Search

The track recognition process (tracking) plays a key role in the event reconstruction in high energy physics. Our study is devoted to tracking for the proposed inner detector of the BES-III experiment, which has only three cylindrical GEM stations. This means, if a particle is registered only at two out of three stations, then its track in the magnetic field cannot be restored without additional information. Such information can be the coordinates of the primary event vertex, from which all tracks exit. Knowing the location of the primary vertex would also help to improve the precision in determining the particle momentum. Besides, it leads to the significant reduction of the algorithmic complexity during the track-candidate search – from O(n2) to O(n), and can improve the overall track reconstruction efficiency. It should also be noted that tracking is especially complicated for strip GEM detectors due to their design specifics, which leads to the appearance of two orders of magnitude more fake hits in addition to useful ones. To solve the problem of vertex finding for the inner detector of the BES-III experiment, we chose a deep convolutional neural network model Look Once On Tracks (LOOT), which processes the whole event at once, as an image, and after proper training can predict the coordinates of the primary vertex location. In this work, the preliminary results of primary vertex prediction on the BES-III simulated data using the LOOT model are presented. [ABSTRACT FROM AUTHOR]

Particle tracking is a fundamental part of the event analysis in high energy and nuclear physics (HENP). Events multiplicity increases each year along with the drastic growth of the experimental data which modern HENP detectors produce, so the classical tracking algorithms such as the well-known Kalman filter cannot satisfy speed and scaling requirements. At the same time, breakthroughs in the study of deep learning open an opportunity for the application of high-performance deep neural networks for solving tracking problems in a dense environment of experiments with heavy ions. However, there are no well-documented software libraries for deep learning track reconstruction yet. We introduce Ariadne, the first open-source library for particle tracking based on the PyTorch deep learning framework. The goal of our library is to provide a simple interface that allows one to prepare train and test datasets and to train and evaluate one of the deep tracking models implemented in the library on the data from your specific experiment. The user experience is greatly facilitated because of the system of gin-configurations. The modular structure of the library and abstract classes let the user develop his data processing pipeline and deep tracking model easily. The proposed library is open-source to facilitate academic research in the field of particle tracking based on deep learning. [ABSTRACT FROM AUTHOR]

Modern high-energy physical detectors provide a huge amount of data, and for future high-luminosity colliders such as NICA, an Exabyte data scale is expected. Particle track reconstruction in such a dense environment is a very challenging task. Common algorithms make use of hand-engineered features and do not scale well with detector occupancy. This work is a logical continuation of the research presented on the XXII International Scientific Conference of Young Scientists and Specialists (AYSS-2018), where we have already introduced the approach of sequential tracking with the help of ad-hoc deep recurrent neural network named TrackNET. But that first version had a number of shortcomings. To address them, we introduce here the TrackNETv2, which is faster, has much fewer parameters and is able to be trained directly from Monte-Carlo simulated events. [ABSTRACT FROM AUTHOR]

Tracking particles is a challenging problem in modern high-energy physics detectors producing a vast amount of data such, as experiments on the future NICA collider. Particle track reconstruction is one of the important parts of such experiments, but existing tracking algorithms do not scale well with a growing data stream. In the same time, new effective tracking methods based on graph neural network (GNN) are actively developed and tested in the HEP.TrkX project at CERN. We introduce our GNN approach for the GEM detector of BM@N experiment of the NICA megaproject. This approach is well-adapted for solving the known fake hit problem inherent to strip detectors like GEM with help of minimum branching tree algorithms. Preliminary results for simulated events of the BM@N GEM detector are presented. [ABSTRACT FROM AUTHOR]

The paper demonstrates the advantages of the deep learning networks over the ordinary neural networks on their comparative applications to image classifying. An autoassociative neural network is used as a standalone autoencoder for prior extraction of the most informative features of the input data for neural networks to be compared further as classifiers. The main efforts to deal with deep learning networks are spent for a quite painstaking work of optimizing the structures of those networks and their components, as activation functions, weights, as well as the procedures of minimizing their loss function to improve their performances and speed up their learning time. It is also shown that the deep autoencoders develop the remarkable ability for denoising images after being specially trained. Convolutional Neural Networks are also used to solve a quite actual problem of protein genetics on the example of the durum wheat classification. Results of our comparative study demonstrate the undoubted advantage of the deep networks, as well as the denoising power of the autoencoders. In our work we use both GPU and cloud services to speed up the calculations. [ABSTRACT FROM AUTHOR]

The BESIII experiment is a multi-purpose detector operating at the beams of the electron-positron collider BEPCII in Beijing. Particle tracking is a fundamental part of data analysis for this experiment. The inner part of the BESIII tracker suffers from a strong beam-related background, which significantly reduces tracking efficiency for low-pT tracks and the physics performance of the experiment. The inner part of the tracker will be replaced with the CGEM detector, which is expected to have a better performance in the presence of a strong background. At the same time, it will produce a large number of fake hits. Traditional algorithmic solutions rely on hand-engineered features and metrics, do not parallelize easily, and scale poorly with detector occupancy. In this paper we present our solution for identification and reconstruction of tracks based on deep neural network called TrackNETv2. This model is lightweight, efficient and can be trained using Monte-Carlo simulation. TrackNETv2 was proposed for another experiment BM@N and proved its usefulness for task of particle tracking. Due to architectural restrictions we added some new blocks for this model developing it to TrackNetv2.1. In this paper we evaluated these ideas on simulated data and discussed its strengths and limitations for application in the BESIII tracking challenge. [ABSTRACT FROM AUTHOR]

Particle tracking in modern high-energy physics experiments is a challenging task. Well-proven algorithms are no longer capable of providing satisfactory results in terms of processing throughput due to an enormous amount of data being produced through the detector's environments. At the same time, Graph Neural Networks (GNN) have shown great potential, namely the GNN approach, which was introduced by the HEP.TrkX project at LHC. We have already applied such approach for the BM@N experiment of the NICA megaproject and, despite the fact that the straightforward adaptation of the original approach did not achieve significant results for the simulated data from the BM@N GEM detector, we proposed a novel Line Digraph approach with the usage of GNN model, which demonstrated a big potential in the BM@N GEM detector's fixed target environment. Because of such success, we decided to adapt our algorithm to experiments with the collider environment, such as BES-III experiment in China. The overall potential of Line Digraph approach generalization is demonstrated: we achieved encouraging results in terms of tracking efficiency and processing speed on Monte-Carlo simulated data. [ABSTRACT FROM AUTHOR]

Cloud computing has become a routine tool for scientists in many fields. The JINR cloud infrastructure provides JINR users with computational resources to perform various scientific calculations. In order to speed up achievements of scientific results the JINR cloud service for parallel applications has been developed. It consists of several components and implements a flexible and modular architecture which allows to utilize both more applications and various types of resources as computational backends. An example of using the Cloud&HybriLIT resources in scientific computing is the study of superconducting processes in the stacked long Josephson junctions (LJJ). The LJJ systems have undergone intensive research because of the perspective of practical applications in nano-electronics and quantum computing. In this contribution we generalize the experience in application of the Cloud&HybriLIT resources for high performance computing of physical characteristics in the LJJ system. [ABSTRACT FROM AUTHOR]

One of the most important problems of data processing in high energy and nuclear physics is the event reconstruction. Its main part is the track reconstruction procedure which consists in looking for all tracks that elementary particles leave when they pass through a detector among a huge number of points, so-called hits, produced when flying particles fire detector coordinate planes. Unfortunately, the tracking is seriously impeded by the famous shortcoming of multiwired, strip in GEM detectors due to the appearance in them a lot of fake hits caused by extra spurious crossings of fired strips. Since the number of those fakes is several orders of magnitude greaterthan for true hits, one faces with the quite serious difficulty to unravelpossible track-candidates via true hits ignoring fakes. On the basis of our previous two-stage approach based on hits preprocessing using directed K-d tree search followed by a deep neural classifier we introduce here two new tracking algorithms. Both algorithms combine those two stages in one while using different types of deep neural nets. We show that both proposed deep networks do not require any special preprocessing stage, are more accurate, faster and can be easier parallelized. Preliminary results of our new approaches for simulated events are presented. [ABSTRACT FROM AUTHOR]

We introduce the Plant Disease Detection Platform (PDDP) that allows users to send photos of sick plant leaves or textual descriptions of their appearance to obtain information about an infection that hit the vegetation and treatment tips. The backend of the platform in terms of deep learning includes image classification and text similarity models. The image classification model has two parts: feature extractor and classifier. The feature extractor was trained using the triplet loss function along with transfer learning when the weights of the network are initialized from the MobileNetV2 pretrained on the ImageNet dataset. The classifier is a simple multilayer perceptron. The test on 100 random plant images from the Internet shows 98% of the classification accuracy. We did the post-training static quantization in order to reduce the overall model size and increase the inference performance. The final model has a size of 7 Mb and works 5 times faster than the initial model without significant loss of accuracy. The text similarity model is a BERT-based transformer for obtaining vector representation of input texts for further similarity calculation between user requests and disease descriptions on the PDDP. [ABSTRACT FROM AUTHOR]

Three deep tracking methods are presented for the BM@N experiment GEM track detector, which differ in their concepts. The first is a two-stage method with data preprocessing by a directional search in the k-d tree to find all possible candidates for tracks, and then use a deep recurrent neural network to classify them by true and ghost tracks. The second end-to-end method used a deep recurrent neural network to extrapolate the initial tracks, similar to the Kalman filter, which learns necessary parameters from the data. The third method implements our new attempt to adapt the neural graph network approach developed in the HEP.TrkX project at CERN to GEM-specific data. The results of applying these three methods to simulated events are presented. [ABSTRACT FROM AUTHOR]

Crop losses are a major threat to the wellbeing of rural families, to the economy and governments, and to food security worldwide. The goal of our research is to develop a multi-functional platform to help the farming community to tilt against plant diseases. In our previous works, we reported about the creation of a special database of healthy and diseased plants' leaves consisting of five sets of grapes images and proposed a special classification model based on a deep siamese network followed by k-nearest neighbors (KNN) classifier. Then we extended our database to five sets of images for grape, corn, and wheat – 611 images in total. Since after this extension the classification accuracy decreased to 86 %, we propose in this paper a novel architecture with a deep siamese network as feature extractor and a single-layer perceptron as a classifier that results in a significant gain of accuracy, up to 96 %. [ABSTRACT FROM AUTHOR]

One of the most important problems of data processing in high energy and nuclear physics is the event reconstruction. Its main part is the track reconstruction procedure which consists in looking for all tracks that elementary particles leave when they pass through a detector among a huge number of points, so-called hits, produced when flying particles fire detector coordinate planes. Unfortunately, the tracking is seriously impeded by the famous shortcoming of multiwired, strip and GEM detectors due to appearance in them a lot of fake hits caused by extra spurious crossings of fired strips. Since the number of those fakes is several orders of magnitude greater than for true hits, one faces with the quite serious difficulty to unravel possible track-candidates via true hits ignoring fakes. We introduce a renewed method that is a significant improvement of our previous two-stage approach based on hit preprocessing using directed K-d tree search followed a deep neural classifier. We combine these two stages in one by applying recurrent neural network that simultaneously determines whether a set of points belongs to a true track or not and predicts where to look for the next point of track on the next coordinate plane of the detector. We show that proposed deep network is more accurate, faster and does not require any special preprocessing stage. Preliminary results of our approach for simulated events of the BM@N GEM detector are presented. [ABSTRACT FROM AUTHOR]