Related papers: The SISCone jet algorithm optimised for low partic…
We show how the recently proposed XCone jet algorithm smoothly interpolates between resolved and boosted kinematics. When using standard jet algorithms to reconstruct the decays of hadronic resonances like top quarks and Higgs bosons, one…
In many real-world problems, we are dealing with collections of high-dimensional data, such as images, videos, text and web documents, DNA microarray data, and more. Often, high-dimensional data lie close to low-dimensional structures…
I provide a very brief overview of recent developments in jet algorithms, mostly focusing on the issue of infrared-safety.
Exploring the application of quantum technologies to fundamental sciences holds the key to fostering innovation for both sides. In high-energy particle collisions, quarks and gluons are produced and immediately form collimated particle…
This paper presents an algorithm for computing Sine-Cosine pairs to modest accuracy, but in a manner which contains no conditional tests or branching, making it highly amenable to vectorization. An exemplary implementation for PowerPC…
The particle identification (PID) of hadrons plays a crucial role in particle physics experiments, especially in flavor physics and jet tagging. The cluster-counting method, which measures the number of primary ionizations in gaseous…
We examine the problem of jet reconstruction at heavy-ion colliders using jet-area-based background subtraction tools as provided by FastJet. We use Monte Carlo simulations with and without quenching to study the performance of several jet…
The area of a jet is a measure of its susceptibility to radiation, like pileup or underlying event (UE), that on average, in the jet's neighbourhood, is uniform in rapidity and azimuth. In this article we establish a theoretical grounding…
Aerial autonomous machines (Drones) has a plethora of promising applications and use cases. While the popularity of these autonomous machines continues to grow, there are many challenges, such as endurance and agility, that could hinder the…
Ising machines are specialized computers for finding the lowest energy states of Ising spin models, onto which many practical combinatorial optimization problems can be mapped. Simulated bifurcation (SB) is a quantum-inspired parallelizable…
Identifying the flavour of reconstructed hadronic jets is critical for precision phenomenology and the search for new physics at collider experiments, as it allows to pinpoint specific scattering processes and reject backgrounds. Jet…
Object caches underpin cloud and edge services, but production workloads are heterogeneous, nonstationary, and throughput-constrained. Recent simple non-ML policies such as SIEVE and S3-FIFO set a strong baseline, so any learned method must…
In this paper, we present a cluster algorithm for the numerical simulations of non-additive hard-core mixtures. This algorithm allows one to simulate and equilibrate systems with a number of particles two orders of magnitude larger than…
A method of creating pseudopure spin states in large clusters of coupled spins is described. It is based on filtering multiple-quantum coherence of the highest order followed by a time-reversal period and partial saturation. Experimental…
This paper presents fault-tolerant asynchronous Stochastic Gradient Descent (SGD) algorithms. SGD is widely used for approximating the minimum of a cost function $Q$, as a core part of optimization and learning algorithms. Our algorithms…
Jets are an important probe to identify the hard interaction of interest at the LHC. They are routinely used in Standard Model precision measurements as well as in searches for new heavy particles, including jet substructure methods. In…
Subspace clustering refers to the problem of clustering high-dimensional data into a union of low-dimensional subspaces. Current subspace clustering approaches are usually based on a two-stage framework. In the first stage, an affinity…
This paper makes the case for a single-ISA heterogeneous computing platform, AISC, where each compute engine (be it a core or an accelerator) supports a different subset of the very same ISA. An ISA subset may not be functionally complete,…
We compare the abilities of the cluster-type jet algorithm, KtJet, and a mid-point iterating cone algorithm to reconstruct the top mass at the LHC. We discuss the information contained in the merging scales of cluster-type algorithms, and…
Efficient particle sorting in microfluidic systems is vital for advancements in biomedical diagnostics and industrial applications. This study numerically investigates particle migration and passive sorting in symmetric serpentine…