scholarly journals Application of correlation pattern recognition technique for neutron– gamma discrimination in the EJ-301 liquid scintillation detector

2021 ◽  
Vol 8 (2) ◽  
pp. 19-26
Author(s):  
Van Chuan Phan ◽  
Van Minh Truong ◽  
Thanh Trung Bui ◽  
Thi Phuc Nguyen ◽  
Dieu Quynh Tran Ngọc

The ability to distinguish between neutrons and gamma-rays is important in the fast -neutron detection, especially when using the scintillation detector. A dual correlation pattern recognition (DCPR) method that was based on the correlation pattern recognition technique has been developed for classification of neutron/gamma events from a scintillation detector. In this study, an EJ-301 liquid scintillation (EJ301) detector was used to detect neutrons and gamma-rays from the 60Co and 252Cf sources; the EJ301 detector's pulses were digitized by a digital oscilloscope and its pulse-shape discriminant (PSD) parameters were calculated by the correlation pattern recognition(CPR) method with the reference neutron and gamma-ray pulses. The digital charge integration (DCI) method was also used as a reference-method for comparison with DCPR method. The figure-ofmerit (FOM) values which were calculated in the 50 ÷ 1100 keV electron equivalent (keVee) region showed that the DCPR method outperformed the DCI method. The FOMs of 50, 420 and 1000 keVee thresholds of DCPR method are 0.82 , 2.2 and 1.62, which are 1.55, 1.77, and 1.1 times greater than the DCI method, respectively.

2019 ◽  
Vol 10 (6) ◽  
pp. 1382-1394
Author(s):  
R. Vijayalakshmi ◽  
V. K. Soma Sekhar Srinivas ◽  
E. Manjoolatha ◽  
G. Rajeswari ◽  
M. Sundaramurthy

1990 ◽  
Vol 41 (3) ◽  
pp. 288-295 ◽  
Author(s):  
Barry K. Lavine ◽  
Robert K. Vander Meer ◽  
Laurence Morel ◽  
Robert W. Gunderson ◽  
Jian Hwa Han ◽  
...  

2013 ◽  
Vol 4 (2) ◽  
pp. 280-294
Author(s):  
Revathi P ◽  
Suresh Babu C ◽  
Purusotham S ◽  
Sundara Murthy M

Many Combinatorial programming problems are NP-hard (Non Linear Polynomial), and we consider one of them called P path minimum distance connectivity from head quarter to the cities. Let there be n cities and the distance matrix D(i, j, k) is given from ithcity to jthcity using kthfacility. There can be an individual factor which influences the distances/cost and that factor is represented as a facility k. We consider m<n cities are in cluster and to connect all the cities in subgroup (cluster) from others by using same facility k. The problem is to find minimum distance to connect all the cities from head quarter (say 1) threw p-paths subject to the above considerations. For this problem we developed a Pattern Recognition Technique based Lexi Search Algorithm, we programmed the proposed algorithm using C. we compared with the existed models and conclude that it suggested for solving the higher dimensional problems.


Sign in / Sign up

Export Citation Format

Share Document