Fast tracking in hadron collider experiments

被引:0
作者
Konstantinidis, N [1 ]
Drevermann, H [1 ]
机构
[1] Univ Calif Santa Cruz, Santa Cruz Inst Particle Phys, Santa Cruz, CA 95064 USA
来源
ADVANCED COMPUTING AND ANALYSIS TECHNIQUES IN PHYSICS RESEARCH | 2001年 / 583卷
关键词
D O I
暂无
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
We present two algorithms that, when used sequentially, can reduce the combinatorics before any track reconstruction in the high occupancy tracking environments of future hadron collider experiments. The first algorithm finds the z-position of the primary physics interaction; the second selects groups of hits consistent with tracks coming from this z-position, rejecting most pile-up/noise/ghost hits. We demonstrate with examples of simulated events from ATLAS at the LHC that the algorithms are flexible, robust and efficient and at the same time fast enough to be used at the second level trigger for filtering the data before applying any tracking algorithms.
引用
收藏
页码:130 / 132
页数:3
相关论文
empty
未找到相关数据