arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1606.03200cs.DS
收藏

自适应、非自适应和两阶段分组测验中的阳性反应数限制

Constraining the Number of Positive Responses in Adaptive, Non-Adaptive, and Two-Stage Group Testing

Annalisa De Bonis

摘要:

组测试是一个众所周知的搜索问题,它包括通过对给定集合O的适当选择的子集(池)执行测试来检测对象集合O的有缺陷的成员。在经典的分组测试中,目标是通过使用尽可能少的测试来找到所有的缺陷。我们考虑一个变种的经典的组测试中,一个关注的不仅是最小化的测试总数,但也旨在减少涉及有缺陷的元素的测试的数量。这种搜索模型背后的基本原理是,在许多实际应用中,用于测试的设备由于暴露于有缺陷的元件或与有缺陷的元件相互作用而受到劣化。在本文中,我们考虑自适应,非自适应和两阶段的组测试。对于所有三个考虑的情况下,我们得出的“是”的响应,必须承认的任何策略执行最多一定数量的测试的数量上的上限和下限。特别是,对于自适应的情况下,我们提供了一个算法,使用了一些“是”的响应,超过了一个小常数的给定下限。有趣的是,这个界限也可以渐近达到我们的两阶段算法,这是一个类似的现象发生在经典的组测试。对于非自适应的情况下,我们给几乎匹配的上限和下限的“是”的响应的数量。特别是,我们给出了两个结构都达到相同的渐近界。这些构式之一的一个有趣的特征是它是一个显式构式。非自适应和两阶段的情况下的界限遵循的d-覆盖免费的家庭和(p,d)-覆盖免费的家庭在本文中介绍的新的变种的最佳大小的界限,我们相信这可能是在其他情况下也感兴趣。

英文摘要:

Group testing is a well known search problem that consists in detecting the defective members of a set of objects O by performing tests on properly chosen subsets (pools) of the given set O. In classical group testing the goal is to find all defectives by using as few tests as possible. We consider a variant of classical group testing in which one is concerned not only with minimizing the total number of tests but aims also at reducing the number of tests involving defective elements. The rationale behind this search model is that in many practical applications the devices used for the tests are subject to deterioration due to exposure to or interaction with the defective elements. In this paper we consider adaptive, non-adaptive and two-stage group testing. For all three considered scenarios, we derive upper and lower bounds on the number of "yes" responses that must be admitted by any strategy performing at most a certain number t of tests. In particular, for the adaptive case we provide an algorithm that uses a number of "yes" responses that exceeds the given lower bound by a small constant. Interestingly, this bound can be asymptotically attained also by our two-stage algorithm, which is a phenomenon analogous to the one occurring in classical group testing. For the non-adaptive scenario we give almost matching upper and lower bounds on the number of "yes" responses. In particular, we give two constructions both achieving the same asymptotic bound. An interesting feature of one of these constructions is that it is an explicit construction. The bounds for the non-adaptive and the two-stage cases follow from the bounds on the optimal sizes of new variants of d-cover free families and (p,d)-cover free families introduced in this paper, which we believe may be of interest also in other contexts.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑