Belle II的曲目发现

论文标题

Belle II的曲目发现

Track Finding at Belle II

论文作者

Bertacchi, Valerio, Bilka, Tadeas, Braun, Nils, Casarosa, Giulia, Corona, Luigi, Cunliffe, Sam, Dattola, Filippo, De Marino, Gaetano, De Nuccio, Michael, De Pietro, Giacomo, Van Dong, Thanh, Dujany, Giulio, Ecker, Patrick, Eliachevitch, Michael, Fillinger, Tristan, Frost, Oliver, Fruehwirth, Rudolf, Gebauer, Uwe, Glazov, Alexander, Gosling, Nicolas, Guo, Aiqiang, Hauth, Thomas, Heck, Martin, Kaleta, Mateusz, Kandra, Jakub, Kleinwort, Claus, Kuhr, Thomas, Kurz, Simon, Kvasnicka, Peter, Lettenbichler, Jakob, Lueck, Thomas, Martini, Alberto, Metzner, Felix, Neverov, Dmitrii, Niebuhr, Carsten, Paoloni, Eugenio, Patra, Sourav, Piilonen, Leo, Praz, Cyrille, Prim, Markus Tobias, Pulvermacher, Christian, Racs, Sebastian, Rad, Navid, Rados, Petar, Ritter, Martin, Rizzo, Giuliana, Rostomyan, Armine, Scavino, Bianca, Schlueter, Tobias, Schwenker, Benjamin, Spataro, Stefano, Spruck, Bjoern, Svidras, Henrikas, Tenchini, Francesco, Uematsu, Yuma, Webb, James, Wessel, Christian, Zani, Laura

论文摘要

本文介绍了在日本Tsukuba的Superkekb B-Factory运营的Belle II实验中用于事件重建的轨道调查算法。该算法旨在平衡高效率的要求，以找到具有良好曲目参数分辨率，较低的伪造轨迹以及对CPU资源的合理需求的带电粒子的要求。该软件以灵活，模块化的方式实施，并采用多种全球和本地跟踪算法的选择来实现最佳性能。

This paper describes the track-finding algorithm that is used for event reconstruction in the Belle II experiment operating at the SuperKEKB B-factory in Tsukuba, Japan. The algorithm is designed to balance the requirements of a high efficiency to find charged particles with a good track parameter resolution, a low rate of spurious tracks, and a reasonable demand on CPU resources. The software is implemented in a flexible, modular manner and employs a diverse selection of global and local track-finding algorithms to achieve an optimal performance.

下载PDF全文

下载文献需遵守相关版权规定

论文标题