iBet uBet web content aggregator. Adding the entire web to your favor.
iBet uBet web content aggregator. Adding the entire web to your favor.



Link to original content: https://api.crossref.org/works/10.3390/A16070312
{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,6,29]],"date-time":"2023-06-29T04:25:51Z","timestamp":1688012751586},"reference-count":19,"publisher":"MDPI AG","issue":"7","license":[{"start":{"date-parts":[[2023,6,22]],"date-time":"2023-06-22T00:00:00Z","timestamp":1687392000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"Ministry of Education and Science of the Republic of Kazakhstan","award":["BR10965191"]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithms"],"abstract":"This paper introduces methods for parallelizing the algorithm to enhance the efficiency of event recovery in Spin Physics Detector (SPD) experiments at the Nuclotron-based Ion Collider Facility (NICA). The problem of eliminating false tracks during the particle trajectory detection process remains a crucial challenge in overcoming performance bottlenecks in processing collider data generated in high volumes and at a fast pace. In this paper, we propose and show fast parallel false track elimination methods based on the introduced criterion of a clustering-based thresholding approach with a chi-squared quality-of-fit metric. The proposed strategy achieves a good trade-off between the effectiveness of track reconstruction and the pace of execution on today\u2019s advanced multicore computers. To facilitate this, a quality benchmark for reconstruction is established, using the root mean square (rms) error of spiral and polynomial fitting for the datasets identified as the subsequent track candidate by the neural network. Choosing the right benchmark enables us to maintain the recall and precision indicators of the neural network track recognition performance at a level that is satisfactory to physicists, even though these metrics will inevitably decline as the data noise increases. Moreover, it has been possible to improve the processing speed of the complete program pipeline by 6 times through parallelization of the algorithm, achieving a rate of 2000 events per second, even when handling extremely noisy input data.<\/jats:p>","DOI":"10.3390\/a16070312","type":"journal-article","created":{"date-parts":[[2023,6,23]],"date-time":"2023-06-23T06:34:07Z","timestamp":1687502047000},"page":"312","source":"Crossref","is-referenced-by-count":0,"title":["Algorithm for Enhancing Event Reconstruction Efficiency by Addressing False Track Filtering Issues in the SPD NICA Experiment"],"prefix":"10.3390","volume":"16","author":[{"ORCID":"http:\/\/orcid.org\/0000-0003-3933-5476","authenticated-orcid":false,"given":"Gulshat","family":"Amirkhanova","sequence":"first","affiliation":[{"name":"Institute of Nuclear Physics, 1 Ibragimov Str., Almaty 050032, Kazakhstan"},{"name":"School of Information Technology, Al-Farabi Kazakh National University, 71 Al-Farabi Ave., Almaty 050040, Kazakhstan"}]},{"given":"Madina","family":"Mansurova","sequence":"additional","affiliation":[{"name":"Institute of Nuclear Physics, 1 Ibragimov Str., Almaty 050032, Kazakhstan"},{"name":"School of Information Technology, Al-Farabi Kazakh National University, 71 Al-Farabi Ave., Almaty 050040, Kazakhstan"}]},{"given":"Gennadii","family":"Ososkov","sequence":"additional","affiliation":[{"name":"Institute of Nuclear Physics, 1 Ibragimov Str., Almaty 050032, Kazakhstan"},{"name":"Joint Institute for Nuclear Research, Joliot-Courie Str. 6, 141980 Dubna, Moscow Region, Russia"}]},{"given":"Nasurlla","family":"Burtebayev","sequence":"additional","affiliation":[{"name":"Institute of Nuclear Physics, 1 Ibragimov Str., Almaty 050032, Kazakhstan"},{"name":"School of Information Technology, Al-Farabi Kazakh National University, 71 Al-Farabi Ave., Almaty 050040, Kazakhstan"}]},{"given":"Adai","family":"Shomanov","sequence":"additional","affiliation":[{"name":"School of Information Technology, Al-Farabi Kazakh National University, 71 Al-Farabi Ave., Almaty 050040, Kazakhstan"},{"name":"School of Engineering and Digital Sciences, Nazarbayev University, Kabanbay Batyr Ave. 53, Astana 010000, Kazakhstan"}]},{"given":"Murat","family":"Kunelbayev","sequence":"additional","affiliation":[{"name":"School of Information Technology, Al-Farabi Kazakh National University, 71 Al-Farabi Ave., Almaty 050040, Kazakhstan"},{"name":"Institute of Information and Computational Technologies, Pushkina 125, Almaty 050060, Kazakhstan"}]}],"member":"1968","published-online":{"date-parts":[[2023,6,22]]},"reference":[{"key":"ref_1","unstructured":"Abazov, V.M., Abramov, V., Afanasyev, L.G., Akhunzyanov, R.R., Akindinov, A.V., Akopov, N., Alekseev, I.G., Aleshko, A.M., Alexakhin, V.Y., and Alexeev, G.D. (2021). Conceptual Design of the Spin Physics Detector. arXiv."},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"444","DOI":"10.1016\/0168-9002(87)90887-4","article-title":"Application of Kalman Filtering to Track and Vertex Fitting","volume":"262","year":"1987","journal-title":"Nucl. Instrum. Meth. A"},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"429","DOI":"10.1016\/0010-4655(88)90004-5","article-title":"Neural Networks and Cellular Automata in Experimental High Energy Physics","volume":"49","author":"Denby","year":"1988","journal-title":"Comput. Phys. Commun."},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"2554","DOI":"10.1073\/pnas.79.8.2554","article-title":"Neural Networks and Physical Systems with Emergent Collective Computational Abilities","volume":"79","author":"Hopfield","year":"1982","journal-title":"Proc. Nat. Acad. Sci. USA"},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"625","DOI":"10.1126\/science.3755256","article-title":"Computing with Neural Circuits: A Model","volume":"233","author":"Hopfield","year":"1986","journal-title":"Science"},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1016\/0010-4655(91)90005-6","article-title":"Elastic Tracking and Neural Network Algorithms for Complex Pattern Recognition","volume":"66","author":"Gyulassy","year":"1991","journal-title":"Comput. Phys. Commun."},{"key":"ref_7","unstructured":"Farrell, S., Calafiura, P., Mudigonda, M., Anderson, D., Vlimant, J.R., Zheng, S., Bendavid, J., Spiropulu, M., Cerati, G., and Gray, L. (2018). Novel Deep Learning Methods for Track Reconstruction. arXiv."},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1140\/epjc\/s10052-021-09675-8","article-title":"Performance of a Geometric Deep Learning Pipeline for HL-LHC Particle Tracking","volume":"81","author":"Ju","year":"2021","journal-title":"Eur. Phys. J. C"},{"key":"ref_9","unstructured":"Rusov, D., Nikolskaia, A., Goncharov, P.V., Shchavelev, E., and Ososkov, G. (2023, June 15). Deep Neural Network Applications for Particle Tracking at the BM@N and SPD Experiments. Available online: https:\/\/inspirehep.net\/files\/804ee777e07426ddac430fd984d12ade."},{"key":"ref_10","unstructured":"(2023, March 14). Gated Recurrent Unit. Available online: https:\/\/en.wikipedia.org\/wiki\/Gated_recurrent_unit."},{"key":"ref_11","unstructured":"Amirkhanova, G.A., Ashimov, Y.K., Goncharov, P.V., Zhemchugov, A.S., Mansurova, M.Y., Ososkov, G.A., Rezvaya, Y.P., and Shomanov, A.S. (2022, January 18\u201322). Application of the Maximum Likelihood Method to Estimate the Parameters of Elementary Particle Trajectories in the Reconstruction Problem of the Internal Detector of the SPD NICA Experiment. Proceedings of the Information and Telecommunication Technologies and Mathematical Modelling of High-Tech Systems, Moscow, Russia."},{"key":"ref_12","first-page":"727","article-title":"X-means: Extending k-means with Efficient Estimation of the Number of Clusters","volume":"1","author":"Pelleg","year":"2002","journal-title":"Mach. Learn."},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"095012","DOI":"10.1088\/1367-2630\/14\/9\/095012","article-title":"Matter and Antimatter in the Universe","volume":"9","author":"Canetti","year":"2012","journal-title":"New J. Phys."},{"key":"ref_14","unstructured":"LHCb Collaboration (2012). Framework TDR for the LHCb Upgrade: Technical Design Report, CERN. Tech. Rep. CERNLHCC-2012-007. LHCb-TDR-12."},{"key":"ref_15","unstructured":"(2023, March 14). Parametric Curve Fitting with Iterative Parametrization. Available online: https:\/\/meshlogic.github.io\/posts\/jupyter\/curve-fitting\/parametric-curve-fitting\/."},{"key":"ref_16","unstructured":"(2023, March 14). Ariadne. Available online: https:\/\/github.com\/t3hseus\/ariadne."},{"key":"ref_17","unstructured":"Adam, G., Bashashin, M., Belyakov, D., Kirakosyan, M., Matveev, M., Podgainy, D., Sapozhnikova, T., Streltsova, O., Torosyan, S., and Vala, M. (2018, January 10\u201314). IT-Ecosystem of the HybriLIT Heterogeneous Platform for High-Performance Computing and Training of IT-Specialists. Proceedings of the CEUR Workshop, Avignon, France."},{"key":"ref_18","doi-asserted-by":"crossref","unstructured":"Stepanek, H. (2020). Thinking in Pandas, Apress.","DOI":"10.1007\/978-1-4842-5839-2"},{"key":"ref_19","unstructured":"Anderson, D.J. (2023, March 14). The HEP.TrkX Project. Approaching Charged Particle Tracking at the HL-LHC with Deep Learning, for Online and Offline Processing. Available online: https:\/\/indico.cern.ch\/event\/587955\/contributions\/2937540\/."}],"container-title":["Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1999-4893\/16\/7\/312\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,28]],"date-time":"2023-06-28T04:45:39Z","timestamp":1687927539000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1999-4893\/16\/7\/312"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,6,22]]},"references-count":19,"journal-issue":{"issue":"7","published-online":{"date-parts":[[2023,7]]}},"alternative-id":["a16070312"],"URL":"http:\/\/dx.doi.org\/10.3390\/a16070312","relation":{},"ISSN":["1999-4893"],"issn-type":[{"value":"1999-4893","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,6,22]]}}}