多通道搜索新信号的灵敏度优化
Sensitivity optimization of multichannel searches for new signals
摘要：
在arXiv：0308063中提出的搜索新现象的灵敏度的频率论定义已被用于许多已发表的实验搜索。在大多数情况下，泊松计数与背景的共同问题的简单近似公式已被认为是足够的目的。然而，现在有许多问题需要更复杂的分析，涉及多个渠道。本文将arXiv：0308063的相同方法应用于多通道Poisson问题，并以封闭形式推导出一个方便的公式，推广了简单计数实验的已知结果。一个明确的解决方案也来自一个共同的情况下，搜索叠加在一个平坦的背景高斯信号。
英文摘要：
The frequentist definition of sensitivity of a search for new phenomena proposed in arXiv:0308063 has been utilized in a number of published experimental searches. In most cases, the simple approximate formula for the common problem of Poisson counts with background has been deemed adequate for the purpose. There are however many problems nowadays in which more complex analysis is required, involving multiple channels. In this article, the same approach of arXiv:0308063 is applied to a multichannel Poisson problem, and a convenient formula is derived in closed form, generalizing the known result for the simple counting experiment. An explicit solution is also derived for the common case of a search for a Gaussian signal superimposed over a flat background.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
