東華大學圖書館 |

語系: 繁體中文

說明(常見問題)

回圖書館首頁

手機版館藏查詢

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

Combinatorial group testing with err...

Wu, Xiaoyu.

FindBook

Google Book

Amazon

博客來

Combinatorial group testing with error-tolerance property.

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	Combinatorial group testing with error-tolerance property./
作者:	Wu, Xiaoyu.
面頁冊數:	86 p.
附註:	Source: Dissertation Abstracts International, Volume: 65-06, Section: B, page: 3012.
Contained By:	Dissertation Abstracts International65-06B.
標題:	Computer Science. -
電子資源:	http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3137202
ISBN:	0496843923

Combinatorial group testing with error-tolerance property.
Wu, Xiaoyu.

Combinatorial group testing with error-tolerance property. - 86 p.

Source: Dissertation Abstracts International, Volume: 65-06, Section: B, page: 3012.

Thesis (Ph.D.)--University of Minnesota, 2004.

Group testing is a testing strategy where tests are conducted upon a group of items instead of individual. Items to be identified are positive and the rest are negative. The test outcome of a group composed of negative items exclusively is negative otherwise positive. The goal of group testing is to identify existing positives with minimal number of testing. Combinatorial Group Testing (CGT) studies the problem using combinatorial techniques. Based on whether the tests are scheduled sequentially or in parallel, CGT can be divided into adaptive and non-adaptive. This thesis studies both branches of CGT with the presence of error and corresponding decoding method.

ISBN: 0496843923Subjects--Topical Terms:

626642
Computer Science.

Combinatorial group testing with error-tolerance property.
LDR:02947nmm 2200301 4500 001 1846619
005 20051103093529.5
008 130614s2004 eng d
020 $a 0496843923
035 $a (UnM)AAI3137202
035 $a AAI3137202
040 $a UnM $c UnM
100 1 $a Wu, Xiaoyu. $3 1033984
245 1 0 $a Combinatorial group testing with error-tolerance property.
300 $a 86 p.
500 $a Source: Dissertation Abstracts International, Volume: 65-06, Section: B, page: 3012.
500 $a Adviser: Ding-Zhu Du.
502 $a Thesis (Ph.D.)--University of Minnesota, 2004.
520 $a Group testing is a testing strategy where tests are conducted upon a group of items instead of individual. Items to be identified are positive and the rest are negative. The test outcome of a group composed of negative items exclusively is negative otherwise positive. The goal of group testing is to identify existing positives with minimal number of testing. Combinatorial Group Testing (CGT) studies the problem using combinatorial techniques. Based on whether the tests are scheduled sequentially or in parallel, CGT can be divided into adaptive and non-adaptive. This thesis studies both branches of CGT with the presence of error and corresponding decoding method.
520 $a The counterfeit coin problem is about finding out the heavier counterfeit coin among n coins. It can be interpreted as an adaptive CGT by treating coins as items and the counterfeit coin as a positive one. We investigate this problem with allowance of one erroneous weighing and show the optimal solution.
520 $a The objective of DNA screening is to identify clones in a library containing a certain DNA segment called probe. Nonadaptive CGT in DNA screening is called pooling design. The fact that tests are error-prone in practice demands pooling design with error-tolerance property. We present an algorithm of pooling design by applying Macula's containment design to simplicial complex. We prove that under certain condition the resultant pooling design is (d, k)-disjunct so that its disjunctness is k error detecting and &fll0;k2&flr0; error-correcting. The result is generalized to monotone graph properties and demonstrated with l-matching and Hamiltonian cycle in graph.
520 $a In pooling design, the process to identify existing positives with the outcome of each pool is called decoding. For an error-free pooling design, the decoding process is O(n) if d-disjunct and O(nd) if d-separable. For pooling design, the decoding process is more complicate. We present a O(nt) decoding method for pooling design with (d, k)-disjunct property in the case that the maximum number of error is k.
590 $a School code: 0130.
650 4 $a Computer Science. $3 626642
690 $a 0984
710 2 0 $a University of Minnesota. $3 676231
773 0 $t Dissertation Abstracts International $g 65-06B.
790 1 0 $a Du, Ding-Zhu, $e advisor
790 $a 0130
791 $a Ph.D.
792 $a 2004
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3137202