An information theory approach to a fault location problem
informationtheor00camp.pdf (3.807Mb)Abstract
The fault location model under investigation consists of an n-component series system known to have exactly one failed component. Component positions in the system are taken as fixed. A component is either working or failed. Components work or fail independently of each other, with their a prior reliabilities taken as given but not necessarily equal. Group testing to locate the failed component is sequential, binary and dichotomous in nature with certain results. The only costs are the number of tests made. The three solution procedures investigated are (1) a dynamic programming formulation, (2) a sequential halving procedure, and (3) a procedure based on information theory. The criteria for optimality are minimization of the expected number of tests required and minimization of the maximum number of tests required.
Rights
This publication is a work of the U.S. Government as defined in Title 17, United States Code, Section 101. Copyright protection is not available for this work in the United States.Collections
Related items
Showing items related by title, author, creator and subject.
-
Analysis of minimization algorithms for multiple-valued programmable logic arrays
(1988-05);We compare the performance of three heuristic algorithms [3,6,13] for the minimization of sum-of-products expressions realized by the newly developed multiplevalued programmable logic arrays [9]. Heuristic methods are ... -
On the minimization of SOPs for bi-decomposable functions
(2001);A function f is AND bi-decomposable if it can be written as f (X1;X2) = h1(X1)h2(X2). In this case, a sum-ofproducts expression (SOP) for f is obtained from minimum SOPs (MSOP) for h1 and h2 by applying the law of ... -
Multiple-valued programmable logic array minimization by simulated annealing
(Monterey, California. Naval Postgraduate School, 1992); NPS-EC-92-004We propose a solution to the minimization problem of multiple-valued programmable logic arrays (PLA) that uses simulated annealing. The algorithm accepts a sum-of-products expression, divides and recombines the product ...
