Related papers: A parallel algorithm for the enumeration of benzen…
The physics programme of the LHCb experiment at the Large Hadron Collider requires an efficient and precise reconstruction of the particle collision vertices. The LHCb Upgrade detector relies on a fully software-based trigger with an online…
We explore the use of the Cell Broadband Engine (Cell/BE for short) for combinatorial optimization applications: we present a parallel version of a constraint-based local search algorithm that has been implemented on a multiprocessor…
A comprehensive study of exclusive hadronic B-meson decays into final states containing two pseudoscalar mesons (PP) or a pseudoscalar and a vector meson (PV) is presented. The decay amplitudes are calculated at leading power in…
For $h=3$ and $h=4$ we prove the existence of infinite $B_h$ sequences $\B$ with counting function $$\mathcal{B}(x)= x^{\sqrt{(h-1)^2+1}-(h-1) + o(1)}.$$ This result extends a construction of I. Ruzsa for $B_2$ sequences.
Given a sequence $\{b_{i}\}_{i=1}^{n}$ and a ratio $\lambda \in (0,1),$ let $E=\cup_{i=1}^n(\lambda E+b_i)$ be a homogeneous self-similar set. In this paper, we study the existence and maximal length of arithmetic progressions in $E$. Our…
We propose a search for Higgs decays with as many as eight leptons in the final state. This signal can arise in a simple model with a hidden vector ($A_d$) that gets mass via a hidden scalar ($h_d$) vacuum expectation value. The 125 GeV…
A definition for a class of asynchronous cellular arrays is proposed. An example of such asynchrony would be independent Poisson arrivals of cell iterations. The Ising model in the continuous time formulation of Glauber falls into this…
We introduce universal, easy-to-reproduce generative models for the QUBO instances to differentiate the performance of the hardware/solvers effectively. Our benchmark process extends the well-known Hebb's rule of associative memory with the…
A preasymptotic error analysis of the finite element method (FEM) and some continuous interior penalty finite element method (CIP-FEM) for Helmholtz equation in two and three dimensions is proposed. $H^1$- and $L^2$- error estimates with…
Randomized parallel algorithms for many fundamental problems achieve optimal linear work in expectation, but upgrading this guarantee to hold with high probability (whp) remains a recurring theoretical challenge. In this paper, we address…
From first-principles density functional calculations, we study the structural and electronic properties of a stable hydrogenated BN sheet, having formula unit BHNH. In the optimized BHNH structure, the H atoms stabilize on the B and N…
A parallel numerical simulation algorithm is presented for fractional-order systems involving Caputo-type derivatives, based on the Adams-Bashforth-Moulton (ABM) predictor-corrector scheme. The parallel algorithm is implemented using…
We developed a flexible parallel algorithm for graph summarization based on vertex-centric programming and parameterized message passing. The base algorithm supports infinitely many structural graph summary models defined in a formal…
A simple fast algorithm of the conodes calculation in binary systems is proposed. The method is based on exact solution of the problem on common tangent to pair of approximating parabolas. Sequence of approximating parabolas pairs having…
The photon polarization in B -> V gamma is a sensitive probe of right-handed currents. In the time dependent decay rate of B_s -> phi gamma the coefficients S and H in front of the sin(Delta m_s t) and the sinh(Delta Gamma_s /2 t) terms are…
The research in parallel machine scheduling in combinatorial optimization suggests that the desirable parallel efficiency could be achieved when the jobs are sorted in the non-increasing order of processing times. In this paper, we find…
The sheer sizes of modern datasets are forcing data-structure designers to consider seriously both parallel construction and compactness. To achieve those goals we need to design a parallel algorithm with good scalability and with low…
Exact Bayesian structure discovery in Bayesian networks requires exponential time and space. Using dynamic programming (DP), the fastest known sequential algorithm computes the exact posterior probabilities of structural features in…
We review the current status of theoretical predictions for mixing quantities and lifetimes in the $B$-sector. In particular, due to the first non-zero measurement of the decay rate difference in the neutral $B_s$-system, $\Delta \Gamma_s/…
Motion planning is an important and well-studied field of robotics. A typical approach to finding a route is to construct a {\em cell graph} representing a scene and then to find a path in such a graph. In this paper we present and analyze…