关于复形的一些pooling设计-基础数学专业论文.docxVIP

摘 摘 要 本文把pooling设计中在测试结果理想的情况下得到的某些结论推广到了可以容错 的情形；把阳性对象是单个集的情形下得到的某些结论推广到了阳性对象是‰一复形 (h≤后)的情形．首先在Q—almost七一disjunct矩阵的基础上引入了a—almost(七；2e+ 1)一s印or06fe矩阵的概念，用它的补阵与随机行取交得到的新矩阵构作了一个关于七一 复形的容错的pooling设计，并计算了检测出所有阳性七一复形的数学期望．然后引入了 口一almost七e—disjunct矩阵的概念，用它的补阵与随机行取交得到的新矩阵构作了一个关 于h一复形的容错的pooling设计，并计算了检测出所有阳性七l一复形的数学期望．最 后利用(s，Z)一叠加码所对应的矩阵给出了适用于所有关于七l一复形的i佗胁6i亡卯模型的 pooling设计．利用(s，f)8一自由覆盖族所对应的矩阵，给出了在关于七l一复形的{扎加6沈卯 模型中可以容错的pooling设计．在(d+(m伽z D，r))一比sJ札nct矩阵的基础上引入了 (七，d+(m俐t D，r))一叠加码的概念，用它对应的矩阵构作了一个在m—in肮阮计模型 中检测阳性七l一复形的pooling设计． 关键词：pooling设计复形separable矩阵 diSjunct矩阵 inhibitor自由覆盖族 叠加码 III AbstractIn Abstract In this paper’we generalize the result which is derived in the condition that the test out． come is ideal in pooling design to the error-tolerant version． And we generalize tlle result which is deriVed in the condition that the positive element is single to the version that the positiVe element is七1一complex(七1 ≤尼)． Firstlywe propose the de矗nition of Q—almost (七；2e+1)一s印arable matrix on the base of口一aJmost尼一disjunct matrix．w-e use the matrix which results by the complement of the口一almost(七；2e+1)一s印口rn6fe matrix intersecting random rows t0 consnllct卸e啪卜tolerant pooling design for七一cD唧fezes．And we calculate the expected number of identi锣ing all positiVe七一c(，仃印Zezes．Next，we propose the definition of Q—almost七e—disjunct matrix．W．e use me matrix which results by the complement of me Q—almost尼8一disjunct ma砸x intersecting random rows to construct an error-tolerant pooling design f．0r七l—cD唧Zezes．And we calculate the expected number of identifying all positive 尼l—cD叫ezes． Finallywe use the m枷x of(s，Z)一superimposed code to give a pooling design which fitS all inhibitor models for七l—cDm讲ezes．w色use the matrix of(s，f)8一coVcr 疗．ee family t0 giVe卸e玎0卜toler卸t pooling design in the inhibitor model for七l—cDm州ezes． we pI。opose the defjnition of(七，d+(7n out D，7))一superimposed code on the base of(d+ (m Duz D，7))一disjunct matrix．w色use the ma嫡x of(七，d+(m D札￡D，7))一superimposed code tID gi