相关论文: A practical Seedless Infrared-Safe Cone jet algori…

The factorization theorem for the dijet cross section is presented in hadron-hadron collisions with a cone-type jet algorithm. We also apply the beam veto to the beam jets consisting of the initial radiation. The soft-collinear effective…

We present an event-file format for the dissemination of next-to-leading-order (NLO) predictions for QCD processes at hadron colliders. The files contain all information required to compute generic jet-based infrared-safe observables at…

This paper presents the application of a variety of techniques to study jet substructure. The performance of various modified jet algorithms, or jet grooming techniques, for several jet types and event topologies is investigated for jets…

We present a continuous-time collision detection algorithm for quickly detecting whether certain polynomial trajectories in time intersect with convex obstacles. The algorithm is used in conjunction with an existing multicopter trajectory…

We extend the algorithm for matching fixed-order tree-level matrix element generators with the Dipole Cascade Model in Ariadne to apply to processes with incoming hadrons. We test the algoritm on for the process W+n jets at the Tevatron,…

2-joins are edge cutsets that naturally appear in the decomposition of several classes of graphs closed under taking induced subgraphs, such as balanced bipartite graphs, even-hole-free graphs, perfect graphs and claw-free graphs. Their…

We introduce a method to compute one-loop soft functions for exclusive $N$-jet processes at hadron colliders, allowing for different definitions of the algorithm that determines the jet regions and of the measurements in those regions. In…

We propose a new jet algorithm for deep-inelastic scattering (DIS) that accounts for the forward-backward asymmetry in the Breit frame. The Centauro algorithm is longitudinally invariant and can cluster jets with Born kinematics, which…

We calculate the subjet rates for jets produced in hadron collisions. The kt algorithm is used to define the jets and allows the theoretical calculation to sum both the leading and next-to-leading logarithms in the resolution variable,…

We consider the classical contention resolution problem where nodes arrive over time, each with a message to send. In each synchronous slot, each node can send or remain idle. If in a slot one node sends alone, it succeeds; otherwise, if…

Polynomial zonotopes, a non-convex set representation, have a wide range of applications from real-time motion planning and control in robotics, to reachability analysis of nonlinear systems and safety shielding in reinforcement learning.…

The stability of classical semi-implicit scheme, and some more advanced iterative schemes recently proposed for Numerical Weather Prediction (NWP) purpose is examined. In all these schemes, the solution of the centred-implicit non-linear…

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…

We present three case studies at a 100 TeV proton collider for how jet analyses can be improved using new jet (sub)structure techniques. First, we use the winner-take-all recombination scheme to define a recoil-free jet axis that is robust…

This note makes an observation that significantly simplifies a number of previous parallel, two-way merge algorithms based on binary search and sequential merge in parallel. First, it is shown that the additional merge step of distinguished…

We consider linear problems in the worst case setting. That is, given a linear operator and a pool of admissible linear measurements, we want to approximate the values of the operator uniformly on a convex and balanced set by means of…

The Run II jet physics group includes the Jet Algorithms, Jet Shape/Energy Flow, and Jet Measurements/Correlations subgroups. The main goal of the jet algorithm subgroup was to explore and define standard Run II jet finding procedures for…

One of the major challenges for the LHC will be to extract precise information from hadronic final states in the presence of the large number of additional soft pp collisions, pileup, that occur simultaneously with any hard interaction in…

We design and analyze primal-dual, feasible interior-point algorithms (IPAs) employing full Newton steps to solve convex optimization problems in standard conic form. Unlike most nonsymmetric cone programming methods, the algorithms…

The identification of jets containing $b$ hadrons is important for the physics programme of the ATLAS experiment at the Large Hadron Collider. Several algorithms to identify jets containing $b$ hadrons are described, ranging from those…