Related papers: The SISCone jet algorithm optimised for low partic…
We propose the algorithm that solves the symmetric cone programs (SCPs) by iteratively calling the projection and rescaling methods the algorithms for solving exceptional cases of SCP. Although our algorithm can solve SCPs by itself, we…
We present a scalable technique for the simulation of collider events with multi-jet final states, based on an improved parton-level event file format. The method is implemented for both leading- and next-to-leading order QCD calculations.…
I explore many aspects of jet substructure at the Large Hadron Collider, ranging from theoretical techniques for jet calculations, to phenomenological tools for better searches with jets, to software for implementing and comparing such…
We introduce a new framework for jet definitions called p-jets that matches the computational speed of the currently used anti-k_T jet algorithm, but avoids combining much of the energy from background pileup events with signal jets. As a…
Jets with a large radius $R\gtrsim 1$ and grooming algorithms are widely used to fully capture the decay products of boosted heavy particles at the Large Hadron Collider (LHC). Unlike most discriminating variables used in such studies, the…
Jet point cloud images are high dimensional data structures that needs to be transformed to a separable feature space for machine learning algorithms to distinguish them with simple decision boundaries. In this article, the authors focus on…
This paper describes a new way to reconstruct and identify muons with high efficiency and high pion rejection. Since muons at the ILC are often produced with or in jets, for many of the physics channels of interest[1], an efficient…
In high performance computing, researchers try to optimize the CPU Scheduling algorithms, for faster and efficient working of computers. But a process needs both CPU bound and I/O bound for completion of its execution. With modernization of…
Spatially-coupled (SC) codes, known for their threshold saturation phenomenon and low-latency windowed decoding algorithms, are ideal for streaming applications. They also find application in various data storage systems because of their…
This paper presents a new online multi-agent trajectory planning algorithm that guarantees to generate safe, dynamically feasible trajectories in a cluttered environment. The proposed algorithm utilizes a linear safe corridor (LSC) to…
The method of Hol\'y, Sokol and \v{C}ern\'y (Applied Soft Computing, 2017, Vol. 60, p. 752-762) clusters objects based on their incidence in a large number of given sets. The idea is to minimize the occurrence of multiple objects from the…
We study bipartite community detection in networks, or more generally the network biclustering problem. We present a fast two-stage procedure based on spectral initialization followed by the application of a pseudo-likelihood classifier…
A novel scheme is presented for fault-tolerant quantum computation based on the cluster model. Some relevant logical cluster states are constructed in concatenation by post-selection through verification, without necessity of recovery…
Conventional cone jet algorithms arose from heuristic considerations of LO hard scattering coupled to independent showering. These algorithms implicitly assume that the final states of individual events can be mapped onto a unique set of…
Many analyses at the CERN LHC exploit the substructure of jets to identify heavy resonances produced with high momenta that decay into multiple quarks and/or gluons. This paper presents a new technique for correcting the substructure of…
In this paper, we present a cluster algorithm for the simulation of hard spheres and related systems. In this algorithm, a copy of the configuration is rotated with respect to a randomly chosen pivot point. The two systems are then…
Sedimentation and centrifugation can be used to sort particles by size, using a multistep (multicascade) method in which particles in the sediment are removed and the content of the supernatant is processed again, repeating the cycle…
We introduce a search technique that is sensitive to a broad class of signals with large final state multiplicities. Events are clustered into large radius jets and jet substructure techniques are used to count the number of subjets within…
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…
This paper presents a Fast Synchronization Clustering algorithm (FSynC), which is an improved version of SynC algorithm. In order to decrease the time complexity of the original SynC algorithm, we combine grid cell partitioning method and…