AN ALGORITHMIC APPROACH TO CONSTRUCTING ORTHOGONAL AND NEAR-ORTHOGONAL ARRAYS
Due to run size constraints, near-orthogonal arrays (near-OAs) and supersaturated designs, a special case of near-OA, are considered good alternatives to OAs. This paper shows (i) a combinatorial relationship between a mixed-level array and a non-resolvable incomplete block design (IBD) with varying replications (and its dual, a resolvable IBD with varying block size); (ii) the relationship between the criterion E(d2) proposed by Lu and Sun (2001) or E(fNOD) proposed by Fang et al. (2003) used in the (near-) OA construction and the (M, S)-optimality criterion used in the IBD construction (the tighter bound for E(d2) is accordingly established); (iii) how to modify the IBD algorithm of Nguyen (1994) to obtain efficient (near-) OA algorithms and the relationship between these algorithms and the one of Xu (2002). Some new OAs will be presented and some near-OAs are compared with designs constructed by other authors. Examples showing the use of the constructed arrays will be given.
computer-generated designs Cramers V screening designs supersaturated designs incomplete block designs.
NAM-KY NGUYEN
School of Mathematics, Statistics and Computer Science, University of New England, Australia
国际会议
2006 International Conference on Design of Experiments and Its Applications(2006实验设计及其应用国际会议)
天津
英文
2006-07-09（万方平台首次上网日期，不代表论文的发表时间）