| dc.contributor | 企管系 | |
| dc.creator (作者) | 唐揆 | zh_TW |
| dc.creator (作者) | Schneider, H.;Tang, Kwei | |
| dc.date (日期) | 1990 | |
| dc.date.accessioned | 24-八月-2016 17:23:43 (UTC+8) | - |
| dc.date.available | 24-八月-2016 17:23:43 (UTC+8) | - |
| dc.date.issued (上傳時間) | 24-八月-2016 17:23:43 (UTC+8) | - |
| dc.identifier.uri (URI) | http://nccur.lib.nccu.edu.tw/handle/140.119/100718 | - |
| dc.description.abstract (摘要) | A Bayesian model for the classical group-testing problem is presented. Lots of size N from which all the defective items have to be removed are submitted for inspection. If the number of defectives, D, is known, then the problem of group testing is to determine the (fixed) group size that minimizes the total inspection per lot for defective rate p = D/N. In this article, we assume that the number of defectives in a lot is a random variable with a Polya distribution. We also derive an optimal two-stage group-testing plan via dynamic programming. It is shown that a variable group size based on a simple updating procedure can reduce inspection substantially compared to a fixed group size based on the mean defective rate and applied to the whole lot. | |
| dc.format.extent | 129 bytes | - |
| dc.format.mimetype | text/html | - |
| dc.relation (關聯) | Technometrics, 32(4), 397-405 | |
| dc.subject (關鍵詞) | Bayes, Dynamic programming, Optimization, Sampling, Screening | |
| dc.title (題名) | Adaptive Procedures for the Two-Stage Group-Testing Problem Based on Prior Distributions and Costs | |
| dc.type (資料類型) | article | |
| dc.identifier.doi (DOI) | 10.1080/00401706.1990.10484726 | |
| dc.doi.uri (DOI) | http://dx.doi.org/10.1080/00401706.1990.10484726 | |
