Optimum mixed level detecting arrays

DOI10.1214/14-AOS1228MaRDI QIDQ464194zbMATH OpenFDO

Authors Ce Shi, Jianxing Yin, Yu Tang

Publication date 17 October 2014

Published in The Annals of Statistics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1408.3205, https://projecteuclid.org/euclid.aos/1407420008

zbMATH Keywords

optimalityheuristic algorithmdetecting arraymixed levelsearch design

Mathematics Subject Classification ID

Factorial statistical designs (62K15) Approximation methods and heuristics in mathematical programming (90C59) Detection theory in information and communication theory (94A13) Fault detection; testing in circuits and networks (94C12)

Abstract: As a type of search design, a detecting array can be used to generate test suites to identify and detect faults caused by interactions of factors in a component-based system. Recently, the construction and optimality of detecting arrays have been investigated in depth in the case where all the factors are assumed to have the same number of levels. However, for real world applications, it is more desirable to use detecting arrays in which the various factors may have different numbers of levels. This paper gives a general criterion to measure the optimality of a mixed level detecting array in terms of its size. Based on this optimality criterion, the combinatorial characteristics of mixed level detecting arrays of optimum size are investigated. This enables us to construct optimum mixed level detecting arrays with a heuristic optimization algorithm and combinatorial methods. As a result, some existence results for optimum mixed level detecting arrays achieving a lower bound are provided for practical use.

Recommendations

• Detecting arrays and their optimality
• Optimum detecting arrays for independent interaction faults
• Consecutive detecting arrays for interaction faults
• Optimality and constructions of locating arrays
• The equivalence between optimal detecting arrays and super-simple OAs

Cites work

• scientific article; zbMATH DE number 5177325 (Why is no real title available?)
• scientific article; zbMATH DE number 3490286 (Why is no real title available?)
• A new series of main effects plus one plan for 2ᵐ factorial experiments with m=4 1 and 2m runs
• Constructions of new orthogonal arrays and covering arrays of strength three
• Covering arrays with mixed alphabet sizes
• Detecting arrays and their optimality
• Locating and detecting arrays for interaction faults
• Mixed covering arrays of strength three with few factors
• Orthogonal arrays. Theory and applications
• Products of mixed covering arrays of strength two
• Searching probabilities for nonzero effects in search designs for the noisy case
• The CRC handbook of combinatorial designs
• The equivalence between optimal detecting arrays and super-simple OAs
• Two general classes of search designs for factor screening experiments with factors at three levels

Cited in

(12)

• Optimum detecting arrays for independent interaction faults
• scientific article; zbMATH DE number 5717445 (Why is no real title available?)
• A construction of variable strength covering arrays
• The equivalence between optimal detecting arrays and super-simple OAs
• Detecting arrays and their optimality
• Detecting arrays for effects of single factors
• Mixed-level covering, locating, and detecting arrays via cyclotomy
• Bipartite locating array
• Detecting arrays for effects of multiple interacting factors
• Consecutive detecting arrays for interaction faults
• Optimum super-simple mixed covering arrays of type \(a^1 b^{k-1}\)
• Lower bound and construction of mixed-level locating arrays

This page was built for publication: Optimum mixed level detecting arrays

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q464194)