| Issue |
EPJ Web Conf.
Volume 126, 2016
4th International Conference on New Frontiers in Physics
|
|
|---|---|---|
| Article Number | 05004 | |
| Number of page(s) | 6 | |
| Section | Poster Session | |
| DOI | https://doi.org/10.1051/epjconf/201612605004 | |
| Published online | 04 November 2016 | |
https://doi.org/10.1051/epjconf/201612605004
Performance of the ALICE secondary vertex b-tagging algorithm
1 FNSPE, Czech Technical University in Prague
2 SINP MSU, Russia
a e-mail: Gyulnara.Eyyubova@fjfi.cvut.cz
b e-mail: Lukas.Kramarik@cern.ch
Published online: 4 November 2016
The identification of jets originating from beauty quarks in heavy-ion collisions is important to study the properties of the hot and dense matter produced in such collisions. A variety of algorithms for b-jet tagging was elaborated at the LHC experments. They rely on the properties of B hadrons, i.e. their long lifetime, large mass and large multiplicity of decay products. In this work, the b-tagging algorithm based on displaced secondary-vertex topologies is described. We present Monte Carlo based performance studies of the algorithm for charged jets reconstructed with the ALICE tracking system in p-Pb collisions at √sNN = 5.02 TeV. The tagging efficiency, rejection rate and the correction of the smearing effects of non-ideal detector response are presented.
© The Authors, published by EDP Sciences, 2016
This is an Open Access article distributed under the terms of the Creative Commons Attribution License 4.0, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.