Related papers: A parallel algorithm for the enumeration of benzen…
This paper presents a methodology for simultaneous heterogeneous computing, named ENEAC, where a quad core ARM Cortex-A53 CPU works in tandem with a preprogrammed on-board FPGA accelerator. A heterogeneous scheduler distributes the tasks…
An algorithm is discussed for converting a class of recursive processes to a parallel system. It is argued that this algorithm can be superior to certain methods currently found in the literature for an important subset of problems. The…
Several photonic microring resonators (MRRs) based analog accelerators have been proposed to accelerate the inference of integer-quantized CNNs with remarkably higher throughput and energy efficiency compared to their electronic…
The decay of the Standard Model Higgs boson into four leptons via a virtual W-boson or Z-boson pair is one of the most important decay modes in the Higgs-boson search at the LHC. We present the complete electroweak radiative corrections of…
Counting homomorphisms of a constant sized pattern graph $H$ in an input graph $G$ is a fundamental computational problem. There is a rich history of studying the complexity of this problem, under various constraints on the input $G$ and…
We study one-dimensional neighborhood-five conservative cellular automata (CA), referred to as particle cellular automata five (particle CA5). We show that evolution equations for particle CA5s that belong to certain types can be obtained…
A recently introduced cellular automaton model for the description of traffic flow is investigated. It generalises asymmetric exclusion models which have attracted a lot of interest in the past. We calculate the so-called fundamental…
Significant research effort has been devoted to improving the performance of join processing in the massively parallel computation model, where the goal is to evaluate a query with the minimum possible data transfer between machines.…
Automata play important roles in wide area of computing and the growth of multicores calls for their efficient parallel implementation. Though it is known in theory that we can perform the computation of a finite automaton in parallel by…
Following the strategy developed by the ALPHA collaboration, we present a method to compute non-perturbatively the decay constant of a heavy-light meson in HQET including the 1/m corrections. We start by a matching between HQET and QCD in a…
We have computed the electroweak corrections to $H\rightarrow Z\,Z^*\rightarrow$ 4 charged leptons, including the effect of anomalous $HHH$ coupling in the $\kappa$-framework. The results of this scaling are gauge invariant. We have…
The multi-level hp-refinement scheme is a powerful extension of the finite element method that allows local mesh adaptation without the trouble of constraining hanging nodes. This is achieved through hierarchical high-order overlay meshes,…
In this letter, an accelerated quadratic programming (QP) algorithm is proposed based on the proximal gradient method. The algorithm can achieve convergence rate $O(1/p^{\alpha})$, where $p$ is the iteration number and $\alpha$ is the given…
In this paper, we explore the collider phenomenology of the charged Higgs boson in the context of a generic Beyond Standard Model scenario with extended gauge and scalar sectors. In such scenarios, the charged Higgs boson can decay via the…
We first prove a one-to-one correspondence between finding Hamiltonian cycles in a cubic planar graphs and finding trees with specific properties in dual graphs. Using this information, we construct an exact algorithm for finding…
We study weak-coupling perturbation expansions for the ground-state energy of the Hamiltonian with the generalized spiked harmonic oscillator potential V(x) = Bx^2 + A/x^2 + lambda/x^alpha, and also for the bottoms of the angular momentum…
The Biham-Middleton-Levine (BML) traffic model is a simple two-dimensional, discrete Cellular Automaton (CA) that has been used to study self-organization and phase transitions arising in traffic flows. From the computational point of view,…
We revisit the experimental and theoretical status of $B \to \rho l \bar{\nu}$ and $B \to \omega l \bar{\nu}$ decays. We perform a combined fit of averaged spectra from Belle and Babar measurements with prior light cone sum rule…
Score-based algorithms that learn the structure of Bayesian networks can be used for both exact and approximate solutions. While approximate learning scales better with the number of variables, it can be computationally expensive in the…
Heterogeneous graph neural networks (HGNNs) have emerged as powerful algorithms for processing heterogeneous graphs (HetGs), widely used in many critical fields. To capture both structural and semantic information in HetGs, HGNNs first…