Related papers: A parallel algorithm for the enumeration of benzen…
A particle-in-cell algorithm is derived with a canonical Poisson structure in the formalism of finite element exterior calculus. The resulting method belongs to the class of gauge-compatible splitting algorithms, which exactly preserve…
The continuum spectrum of the planetary nebula Hf 2-2 close to the Balmer discontinuity is modeled in the context of the long standing problem of the abundance and temperature discrepancy found when analyzing optical recombination lines and…
In the area of Pattern Recognition and Matching, finding a Longest Common Subsequence plays an important role. In this paper, we have proposed one algorithm based on parallel computation. We have used OpenMP API package as middleware to…
We report on the computation of the $B_s$ meson decay constant in Heavy Quark Effective Theory on the lattice. The next to leading order corrections in the HQET expansion are included non-perturbatively. We estimate higher order…
Benzene, a hexagonal molecule with formula C$_6$H$_6$, is one of the most important aromatic hydrocarbons. Its structure arises from the $sp^{2}$ hybridization from which three in-plane $\sigma$-bonds are formed. A fourth $\pi$-orbital…
We derive new formulas for the high dimensional biharmonic potential acting on Gaussians or Gaussians times special polynomials. These formulas can be used to construct accurate cubature formulas of an arbitrary high order which are fast…
An influential theorem of Nikiforov states that if an $N$-vertex graph $G$ contains at least $\gamma N^h$ copies of some fixed $h$-vertex graph $H$, then $G$ contains an $H$-blowup of order $c_H(\gamma)\log N$. We provide a new proof of…
The convex hull is a fundamental geometrical structure for many applications where groups of points must be enclosed or represented by a convex polygon. Although efficient sequential convex hull algorithms exist, and are constantly being…
A target composition scheme to optimize the combined proton acceleration regime is presented and verified by two-dimensional particle-in-cell (2D PIC) simulations by using an ultra-intense circularly-polarized (CP) laser pulse irradiating…
The coherent potential approximation (CPA) is extended to describe satisfactorily the motion of particles in a random potential which is spatially correlated and smoothly varying. In contrast to existing cluster-CPA methods, the present…
We show that there exists a one-to-one correspondence between the set of number-conserving cellular automata (CA) with $q$ inputs and the set of balanced sequences with $q$ terms. This allows to enumerate number-conserving CA. We also show…
I will discuss a new method for calculating transport quantities, such as the charged particle stopping power, in a weakly to moderately coupled plasma. This method, called dimensional continuation, lies within the framework of convergent…
In this work, we reveal a rich combinatorial structure underlying exact minimax optimal algorithms for classical nonexpansive fixed-point problems. This viewpoint unifies all extremal optimal methods and provides a systematic and practical…
We introduce a new Petrov-Galerkin multiscale method for the numerical approximation of the Helmholtz equation with large wave number $\kappa$ in bounded domains in $\mathbb{R}^d$. The discrete trial and test spaces are generated from…
We demonstrate the feasibility of determining the strong coupling constant, $\alpha_s$, from the inclusive semileptonic decay width of $B$ mesons. We express the semileptonic $B$ decay width as a function of $\alpha_s(5\mathrm{\,GeV})$, the…
In this paper, we present enumeration algorithms to list all preferred extensions of an argumentation framework. This task is equivalent to enumerating all maximal semikernels of a directed graph. For directed graphs on $n$ vertices, all…
The \emph{Product Structure Theorem} for planar graphs (Dujmovi\'c et al.\ \emph{JACM}, \textbf{67}(4):22) states that any planar graph is contained in the strong product of a planar $3$-tree, a path, and a $3$-cycle. We give a simple…
We prove that the planar hexagonal honeycomb is asymptotically optimal for a large class of optimal partition problems, in which the cells are assumed to be convex, and the criterion is to minimize either the sum or the maximum among the…
Parallel algorithms on CPU and GPU are implemented for the Unified Gas-Kinetic Scheme and their performances are investigated and compared by a two dimensional channel flow case. The parallel CPU algorithm has a one dimensional block…
Beam hopping (BH) is a satellite communications technique in which sets of beams are sequentially illuminated over a defined time interval. Geographically varying the duty cycle of satellite transmission allows for reduced resource wastage…