11-16 July 2022
Europe/Moscow timezone
For authors of online talks: we will send videoconference links 1 day before the session to e-mail addresses specified in the Registration form

Nuclei Identification by Multiple Energy Losses in Detectors of the PAMELA Spectrometer

15 Jul 2022, 10:00
20m
Физический ф-т, СФА

Физический ф-т, СФА

Ленинские Горы, д. 1, стр. 2
Oral talk (15 min + 5 min questions) Experimental and theoretical studies of nuclear reactions

Speaker

Vladislav Alekseev (Yaroslavl State University)

Description

PAMELA magnetic spectrometer [1] includes a set of detectors, each of which measures the energy losses of charged particles along its trajectory. In total, it is possible to obtain up to 6 values of energy loss in detectors of the time-of-flight system, up to 12 values in the track system, and up to 43 values in the calorimeter. This information combined with rigidity and velocity measurements can be used for effective identification of particles.
We propose two algorithms for identification of nuclei with atomic numbers 1 – 26 (from protons up to iron): the first algorithm is based on maximum likelihood estimation method, and the second is based on machine learning. For both algorithms we performed Monte Carlo simulation of particles interaction in detectors of PAMELA with Geant4 software [2].
The first algorithm consists of the following steps.
1. Fit the energy loss distributions in simulation for each detector depending on particle type and magnetic rigidity $R$ by a 2-parametric family of distributions $f(x; \mu, \sigma)$.
2. Approximation of the relation between parameters $(\mu, \sigma)$ and particle rigidity by some functions $\hat{\mu}(x)$ and $\hat{\sigma}(x)$. As a result, we obtain a set of functions $\hat{\mu}_{ij}(x)$ and $\hat{\sigma}_{ij}(x)$ for each nucleus number (charge) $i$ and detector number $j$.
3. After that, we can apply an algorithm to the experimental data. For each nucleus type calculate a likelihood function (where $R$ is magnetic rigidity):
$$L_i(R) = \sum\limits_{j = 1}{N} \ln f(R; \hat{\mu}_{ij}(R), \hat{\sigma}_{ij}(R))$$ The result of an identification algorithm is a nucleus $n$, which minimizes $L_i (R)$: $$\hat{n} = \arg\min\limits_{i}⁡L_i(R).$$
The second method is based on machine learning using the gradient boosting method, which is currently one of the reference methods of classical learning [3]. The magnetic rigidity and energy releases along the trajectory are used as features.
We present the results of each of the above methods separately, as well as in comparison with each other.
1. Adriani O. et al. Astrophys J (2014) 791:93
2. S. Agostinelli et al., Nucl. Instrum. Meth. A 506, pp. 250-303, 2003.
3. Friedman, Jerome. (2000). Greedy Function Approximation: A Gradient Boosting Machine. The Annals of Statistics. 29.10.1214/aos/1013203451

The speaker is a student or young scientist No
Section 2. Experimental and theoretical studies of nuclear reactions

Primary authors

Vladislav Alekseev (Yaroslavl State University) Olga Golub (NRNU MEPhI) Artem Epifanov (NRNU MEPhI) Mr Anton Lukyanov (Yaroslavl State University) Dr Andrey Mayorov (Moscow Engineering and Physics Institute, National Research Nuclear University MEPhI,Moscow, Russia)

Presentation Materials