Related papers: Numerical complexity of helix unraveling algorithm…
Multi-layer graphs consist of several graphs (layers) over the same vertex set. They are motivated by real-world problems where entities (vertices) are associated via multiple types of relationships (edges in different layers). We chart the…
High energy physics experiments, in particular experiments at the LHC, require the reconstruction of charged particle trajectories. Methods of reconstructing such trajectories have been known for decades, yet the applications at High…
We report our experiences with the generalized integration-by-parts algorithm [hep-ph/9609429] in the context of calculations of a realistic one-loop subset of diagrams.
A novel FPGA based online tracking algorithm for helix track reconstruction in a solenoidal field, developed for the PANDA spectrometer, is described. Employing the Straw Tube Tracker detector with 4636 straw tubes, the algorithm includes a…
The ATLAS inner detector comprises three different sub-detectors: the pixel detector, the silicon strip tracker, and the transition-radiation drift-tube tracker. The Insertable $B$-Layer, a new innermost pixel layer, was installed during…
Pixel detectors currently in use by high energy physics experiments such as ATLAS, CMS, LHCb, etc., are critical systems for tagging $B$ hadrons within particle jets. However, the performance of standard tagging algorithms begins to fall in…
We briefly describe a new general algorithm for carrying out QCD calculations to next-to-leading order in perturbation theory. The algorithm can be used for computing arbitrary jet cross sections in arbitrary processes and can be…
Graph clustering is a fundamental problem that has been extensively studied both in theory and practice. The problem has been defined in several ways in literature and most of them have been proven to be NP-Hard. Due to their high practical…
We study a dynamic version of the implicit trace estimation problem. Given access to an oracle for computing matrix-vector multiplications with a dynamically changing matrix A, our goal is to maintain an accurate approximation to A's trace…
The precise tracking of micron sized colloidal particles - held in the vicinity of each other using optical tweezers - is an elegant way to gain information about the particle-particle pair interaction potential. The accuracy of the method,…
Monte Carlo simulations of systems with a complex action are known to be extremely difficult. A new approach to this problem based on a factorization property of distribution functions of observables has been proposed recently. The method…
A fast algorithm to study one-dimensional self-gravitating systems, and, more generally, systems that are Lagrangian integrable between collisions, is presented. The algorithm is event-driven, and uses a heap-ordered set of predicted future…
We present an easy implementable algorithm for approximating the geometric measure of entanglement from above. The algorithm can be applied to any multipartite mixed state. It involves only the solution of an eigenproblem and finding a…
Since the start-up of the LHC end of 2009, the trigger commissioning is in full swing. The ATLAS trigger system is divided into three levels: the hardware-based first level trigger, and the software-based second level trigger and Event…
The high-luminosity phase of LHC operations (HL-LHC), will feature a large increase in simultaneous proton-proton interactions per bunch crossing up to 200, compared with a typical leveling target of 64 in Run 3. Such an increase will…
Triggering long-lived particles at the first stage of the trigger system is very crucial in LLP searches to ensure that we do not miss them at the very beginning. The future High Luminosity runs of the Large Hardron Collider will have…
A major challenge facing existing sequential Monte-Carlo methods for parameter estimation in physics stems from the inability of existing approaches to robustly deal with experiments that have different mechanisms that yield the results…
I present a brief review of the existing models for particle multiplicity evaluation in heavy ion collisions which are at our disposal in the form of Monte Carlo simulators. Models are classified according to the physical mechanisms with…
The computation of a peeling order in a randomly generated hypergraph is the most time-consuming step in a number of constructions, such as perfect hashing schemes, random $r$-SAT solvers, error-correcting codes, and approximate set…
The identification of top quark decays where the top quark has a large momentum transverse to the beam axis, known as $top$ $tagging$, is a crucial component in many measurements of Standard Model processes and searches for beyond the…