大亚湾反应堆中微子实验Monte Carlo样本事例混合的interleaving算法  

Interleaving algorithm method for Monte Carlo sample event mixing in Daya Bay neutrino experiment

作　　者：张一纯[1] 陈晓苏[2] 何苗[2] 张子平[1] 王萌[3] 黄性涛[3] 

机构地区：[1]中国科学技术大学近代物理系,安徽合肥230026 [2]中国科学院高能物理研究所,北京100049 [3]山东大学物理学院,山东济南250100

出　　处：《中国科学技术大学学报》2013年第3期246-252,共7页JUSTC

基　　金：国家自然科学基金(10225524;10475086;10535050;10575056;Y2118M005C)资助

摘　　要：在反应堆中微子实验的物理数据分析中,前后事例间的时间关联分析是非常重要的一环.对事例间时间结构特性的研究,将有助于理解本底事例产生的物理机制,有利于对信号事例的挑选和对本底事例的排除.与此相应,在产生可用于物理分析的反应堆中微子Monte Carlo(MC)模拟数据的过程中,重构不同事例间的时间关联是一个重要步骤.通过研究大亚湾反应堆中微子实验的数据特点,开发了interleaving算法用于产生带有时间关联的海量物理数据;利用该方法实现了对不同样本的MC数据按事例率的混合;并简要给出了interleaving算法的空间和时间复杂度分析。In reactor neutrino experiments, analysis of time correlation between different readout events is an important task. Investigation of the properties of the time structure of events can help to understand the physics mechanism of the backgrounds, as well as to study event selection and background estimation. In the process of generating Monte Carlo （MC） data for physics analysis in reactor experiments,reconstruction of time correlation between different events is apparently an important step. An interleaving algorithm was designed for producing large MC data in the Daya Bay reactor neutrino experiment, which makes it possible to mix different MC data samples according to their event rates. The time and spatial complexity of this algorithm was also briefly analyzed.

关 键 词：反应堆中微子实验 时间关联分析 interleaving算法 事例率 

分 类 号：TP301.6[自动化与计算机技术—计算机系统结构]