摘要
给出了关于两个不合格品之分组测试的一个新结果．设ｔｋ表示用测试过程ｔ经ｋ次测试所能鉴别的最大产品数，ｎ_ｋ＝ｍａｘｔｋ，文中给出了一个测试过程使得当为 ｋ偶数ｔｋ／ｎｋ＞０． ９７２，当为 ｋ奇数 ｔｋ／ｎｋ＞０． ９６９，从而改进了文［２，４］的主要结果．
The problem of classifing n items containing two defectives with a minimax number of group tests is surprisingly hard and remains open. A measure to evaluate a group testing procedure t is tk/nk where tk denote the maximum number of items which test procedure t can identify in k tests for two-defective problem and nk=maxtk. The currently best procedure can achieve tk/nk>0. 95 for all k. In this paper we give a procedure t such that tk/nk>0. 972 for k even and tk/nk>O. 969 for k odd.
出处
《数学理论与应用》
1999年第3期138-140,共3页
Mathematical Theory and Applications
基金
湖北省教委重点科研项目
关键词
分组测试
c-集
p-集
f-集
group testing,contaminated set,pure set,free set.
