Line: 1 to 1  

 
Line: 99 to 99  
CMS Physics TDR Vol.I .  
Changed:  
< <  Given below is a structured html version of this document,  
> >  Reproduced below is a structured html version of this document (the subchapter 11.2),  
containing, along with the iterative cone description, also a description of a midpoint and an inclusive algorithms. 
Line: 1 to 1  

 
Line: 91 to 91  
"  
Changed:  
< <  CMS PDTR1  
> >  CMS PTDR1  
Changed:  
< <  A description is available in the  
> >  An Iterative Cone description is available in the  
[[https://twiki.cern.ch/twiki/pub/Main/AVFedotovLogA010/PTDR1_11.2.Jet_algorithms.pdf][  
Changed:  
< <  Section 11.2: Jet_algorithms]] of the CMS Physics TDR, Vol.1 .  
> >  Section 11.2: Jet algorithms]] of the
CMS Physics TDR Vol.I .
Given below is a structured html version of this document, containing, along with the iterative cone description, also a description of a midpoint and an inclusive algorithms.  
Changed:  
< < 
PDTR1: 11.2 Jet algorithms  
> >  PTDR1: 11.2 Jet algorithms  
The first jet algorithms for hadron physics were simple cones [ 250 , 259 ]. Over the last two  
Line: 219 to 224  
used to calculate midpoints.  
Added:  
> >  PTDR1: Inclusive algorithm
The inclusive jet algorithm is a clusterbased jet algorithm.
 
Added:  
> >  The algorithm successively merges objects which have a distance .  
Added:  
> >  It follows that for all final jets and .  
PTDR1: References  
Deleted:  
< <  
Changed:  
< <  [250]
 
> > 
 
Changed:  
< <  [259]
 
> > 
 
Changed:  
< <  [260]
 
> > 
 
Changed:  
< <  [261]
 
> > 
 
Changed:  
< <  [262]
 
> > 
 
Changed:  
< <  [263]
 
> > 
 
 
Changed:  
< < 
 
> > 
 

Line: 1 to 1  

 
Line: 53 to 53  
Added:  
> >  CMS Iterative Cone algorithm
FastJet manualThe FastJet manual gives very liitle info on the algoritm in the Section 7.3.5 CMS iterative cone : "The (iterative) cone (with progressive removal) algorithm used by CMS during the preparation for the LHC. <! SyntaxHighlightingPlugin > #include ‘‘fastjet/CMSIterativeConePlugin.hh’’ ///... CMSIterativeConePlugin (double ConeRadius, double SeedThreshold=0.0); <! end SyntaxHighlightingPlugin >The underlying code for this algorithm was extracted from the CMSSW web site, with certain small service routines having been rewritten by the FastJet authors. The resulting code was validated by clustering 1000 events with the original version of the CMS software and comparing the output to the clustering performed with the FastJet plugin. The jet contents were identical in all cases. However the jet momenta differed at a relative precision level of , related to the use of singleprecision arithmetic at some internal stage of the CMS software (while the FastJet version is in double precision). Note: this algorithm is unsafe [6] . It is to be deprecated for new experimental or theoretical analyses. . . . [6] M. Cacciari, G. P. Salam and G. Soyez, JHEP 0804 (2008) 063 [arXiv:0802.1189 [hepph ]] (pdf) . "
CMS PDTR1A description is available in the Section 11.2: Jet_algorithms of the CMS Physics TDR, Vol.1 .
PDTR1: 11.2 Jet algorithmsThe first jet algorithms for hadron physics were simple cones [ 250 , 259 ]. Over the last two decades, clustering techniques have greatly improved in sophistication. Three principal jet reconstruction algorithms have been coded and studied for CMS: The midpointcone and algorithms are widely used in offline analysis in current hadron collider experiments, while the iterative cone algorithm is simpler and faster and commonly used for jet reconstruction in softwarebased trigger systems.The jet algorithms may be used with one of two recombination schemes for adding the constituents.
The inclusive algorithm merges, in each iteration step, input objects into possible final jets and so the new jet quantities, the jet direction and energy, have to be calculated directly during the clustering. The cone jet algorithms, iterative and midpoint, group the input objects together as an intermediate stage and the final determination of the jet quantities (recombination) is done in one step at the end of the jet finding.
PTDR1: 11.2.1 Iterative cone
In the iterative cone algorithm, an ordered list of input objects (particles or calorimeter towers) is created.
The cone size and the seed threshold are parameters of the algorithm. When the algorithm is terminated, a different recombination scheme may be applied to jet constituents to define the final jet kinematic properties.
PTDR1: 11.2.2 Midpoint coneThe midpontcone algorithm was designed to facilitate the splitting and merging of jets. The midpointcone algorithm also uses an iterative procedure to find stable cones (protojets) starting from the cones around objects with an above a seed threshold. In contrast to the iterative cone algorithm described above, no object is removed from the input list. This can result in overlapping protojets (a single input object may belong to several protojets). To ensure the collinear and infrared safety of the algorithm, a second iteration of the list of stable jets is done. For every pair of protojets that are closer than the cone diameter, a midpoint is calculated as the direction of the combined momentum. These midpoints are then used as additional seeds to find more protojets. When all protojets are found,
This algorithm implements the energy scheme to calculate the protojet properties but a different recombination scheme may be used for the final jet. The parameters of the algorithm include
PTDR1: References
 
Deleted:  
< < 
 
 
Added:  
> > 

Line: 1 to 1  

 
Line: 54 to 54  
 
Added:  
> > 

Line: 1 to 1  

Added:  
> > 
<!
LATEX VIA MATHMODEPLUGIN
DEFINE A VARIABLE (reference with )
>
Sections:
Links
FastJet algoritms employed in CMSSWIn CMSSW, the jet finding is interfaced to the FastJet package. The employed FastJet algorithms are ( details ):
