Related papers: Online Event Selection for Mu3e using GPUs
We present the first direct search for lepton flavour violating muon decay mediated by a new light particle X, $\mu^+ \to \mathrm{e}^+\mathrm{X}, \mathrm{X} \to \gamma\gamma$. This search uses a dataset resulting from $7.5\times 10^{14}$…
Recent advances in segmented solid-state detector arrays for rare-event searches have allowed the technology to approach the ton-scale in detector mass and the scale of meters in size. Often focused around searches for neutrinoless…
We present the first experimental results based on the jet boost algorithm, a technique to select unbiased samples of gluon jets in e+e- annihilations, i.e. gluon jets free of biases introduced by event selection or jet finding criteria.…
A search for new long-lived particles decaying to leptons is presented using proton-proton collisions produced by the LHC at sqrt(s) = 8 TeV. Data used for the analysis were collected by the CMS detector and correspond to an integrated…
The MEG experiment is designed to search the Lepton Flavor Violating process $\mu \to e^+\gamma$ \cite{mori-1999,meg2007-baldini}. This search requires a high intensity muon beam stopping in a thin target with the maximum rate compatible…
The ATLAS detector at the Large Hadron Collider is used to search for the lepton flavor violating process $Z \rightarrow e \mu$ in pp collisions using 20.3 $fb^{-1}$ of data collected at $\sqrt{s}$ = 8 TeV. An enhancement in the $e \mu$…
In high energy physics, the ability to reconstruct particles based on their detector signatures is essential for downstream data analyses. A particle reconstruction algorithm based on learning hypergraphs (HGPflow) has previously been…
The traditional design of an HEP reconstruction system partitions the problem into a series of modules. A reconstruction job is then just a sequence of modules run in a particular order with each module reading data from the event and…
A fast algorithm for the approximation of a low rank LU decomposition is presented. In order to achieve a low complexity, the algorithm uses sparse random projections combined with FFT-based random projections. The asymptotic approximation…
We present a procedure for reconstructing particle cascades from event data measured in a high energy physics experiment. For evaluating the hypothesis of a specific physics process causing the observed data, all possible reconstruction…
In the framework of the minimal ${SU}(3)_C\otimes {SU}(3)_L \otimes {U}(1)_N$ model, the lepton-flavour-violating decay $\pi^+ \ra \mu^- \nu_\mu e^+ e^+ $ is calculated without directly invoking lepton mixing. The branching ratio for this…
We present a search for lepton-flavor-violating tau decays into three leptons (electrons or muons) using 782 fb^-1 of data collected with the Belle detector at the KEKB asymmetric-energy e+e- collider. No evidence for these decays is…
The first search for the lepton number violating decay $K^+\to\pi^0\pi^-\mu^+e^+$ and lepton flavour violating decays $K^+\to\pi^0\pi^+\mu^-e^+$, $K^+\to\pi^0\pi^+\mu^+e^-$ has been performed using a dataset collected by the NA62 experiment…
Graphical Processing Units (GPUs) have recently become a valuable computing tool for the acquisition of data at high rates and for a relatively low cost. The devices work by parallelizing the code into thousands of threads, each executing a…
In the present paper we consider neutrino events due to quasi-elastic scattering (QEL) as the most reliable events among various candidate events to be analyzed, and have carried out the first step of an L/E analysis which aims to confirm…
Evolutionary model merging enables the creation of high-performing multi-task models but remains computationally prohibitive for consumer hardware. We introduce MERGE$^3$, an efficient framework that makes evolutionary merging feasible on a…
The ALICE experiment has undergone a major upgrade for LHC Run 3 and will collect data at an interaction rate 50 times larger than before. The new computing scheme for Run 3 replaces the traditionally separate online and offline frameworks…
In LHC Run 3, ALICE will increase the data taking rate significantly to 50 kHz continuous read out of minimum bias Pb-Pb collisions. The reconstruction strategy of the online offline computing upgrade foresees a first synchronous online…
We propose a GPU-accelerated distributed optimization algorithm for controlling multi-phase optimal power flow in active distribution systems with dynamically changing topologies. To handle varying network configurations and enable…
We study \emph{parallel} online algorithms: For some fixed integer $k$, a collective of $k$ parallel processes that perform online decisions on the same sequence of events forms a $k$-\emph{copy algorithm}. For any given time and input…