相关论文: A new jet algorithm based on the k-means clusterin…
Clustering is one of the most frequent problems in many domains, in particular, in particle physics where jet reconstruction is central in experimental analyses. Jet clustering at the CERN's Large Hadron Collider (LHC) is computationally…
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…
We study the case where quantum computing could improve jet clustering by considering two new quantum algorithms that might speed up classical jet clustering algorithms. The first one is a quantum subroutine to compute a Minkowski-based…
Jets constructed via clustering algorithms (e.g., anti-$k_T$, soft-drop) have been proposed for many precision measurements, such as the strong coupling $\alpha_s$ and the nucleon intrinsic dynamics. However, the theoretical accuracy is…
We discuss jet substructure in recombination algorithms for QCD jets and single jets from heavy particle decays. We demonstrate that the jet algorithm can introduce significant systematic effects into the substructure. By characterizing…
We review recent developments related to jet clustering algorithms and jet reconstruction, with particular emphasis on their implications in heavy ion collisions. These developments include fast implementations of sequential recombination…
Jet clustering or reconstruction is a crucial component at high energy colliders, a procedure to identify sprays of collimated particles originating from the fragmentation and hadronization of quarks and gluons. It is a complicated…
We extend the work of [1] to the case in which final-state jets, produced in association with a Higgs or vector boson, are defined using the $k_t$ algorithm. We thereby compute the full distribution of the invariant mass squared of the…
I describe a class of iterative jet algorithms that are based on maximizing a fixed function of the total 4-momentum rather than clustering of pairs of jets. I describe some of the properties of the simplest examples of this class,…
A new algorithm for jet finding in hadronic collisions is presented. The algorithm, based on a Gaussian filter in $(\eta,\phi)$, is specifically intended for use in heavy ion collisions and/or for detectors with limited acceptance. The…
We assess the performance of different jet-clustering algorithms, in the presence of different resolution parameters and reconstruction procedures, in resolving fully hadronic final states emerging from the chain decay of the discovered…
We introduce a new jet-finding algorithm for a hadron collider based on maximizing a J_{E_T} function for all possible combinations of particles in an event. This function prefers a larger value of the jet transverse energy and a smaller…
Jet clustering algorithms are widely used to analyse hadronic events in high energy collisions. Recently a new clustering method, known as `Cambridge', has been introduced. In this article we present an algorithm to determine the transition…
In the present contribution we introduce a strategy to quantify the performance of modern infrared and collinear safe jet clustering algorithms in processes which involve the reconstruction of heavy object decays. We determine optimal…
Mass measurements of objects that decay into hadronic jets, such as the top quark, are shown to be improved by using a variant of the $k_t$ jet algorithm in place of standard cone algorithms. The possibility and importance of better…
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…
We present a new approach to jet definition alternative to clustering methods, such as the anti-$k_T$ scheme, that exploit kinematic data directly. Instead the new method uses kinematic information to represent the particles in a…
A method of reconstruction of the top quarks produced in the process E+E- -> t\bar{t} -> 6 jets at a Linear Collider (LC) is proposed. The approach does not involve a kinematic fit, as well as assumptions on the invariant masses of the…
To precisely measure jets over a large background such as pile up in high luminosity p+p collisions at LHC, a new generation of jet reconstruction algorithms is developed. These algorithms are also applicable to reconstruct jets in the…
This work proposes a clusterization algorithm called k-Morphological Sets (k-MS), based on morphological reconstruction and heuristics. k-MS is faster than the CPU-parallel k-Means in worst case scenarios and produces enhanced…