论文信息 - An algorithmic approach to constructing supersaturated designs

An algorithmic approach to constructing supersaturated designs

Supersaturated designs are very cost-effective to scientists and engineers at the primary stage of scientific investigation. This article describes a method of constructing supersaturated designs from balanced incomplete block designs that is a generalization of the method of Lin for constructing these designs and a more general approach to constructing these designs.

Nam-Ky Nguyen

[1] J. Kiefer. Optimum Experimental Designs , 1959 .

[2] F. E. Satterthwaite. Random Balance Experimentation , 1959 .

[3] K. H. Booth,et al. Some Systematic Supersaturated Designs , 1962 .

[4] W. Wallis,et al. Hadamard Matrices and Their Applications , 1978 .

[5] A. Atkinson. Subset Selection in Regression , 1992 .

[6] Alan J. Miller,et al. A review of some exchange algorithms for constructing discrete D-optimal designs , 1992 .

[7] Anthony C. Atkinson,et al. Optimum Experimental Designs , 1992 .

[8] Dennis K. J. Lin. A new class of supersaturated designs , 1993 .

[9] Dennis K. J. Lin. Another Look at First-Order Saturated Designs: The p-efficient Designs , 1993 .

[10] Nam-Ky Nguyen,et al. AN ALGORITHM FOR CONSTRUCTING OPTIMAL RESOLVABLE ROW-COLUMN DESIGNS , 1993 .

[11] Changbao Wu,et al. Construction of supersaturated designs through partially aliased interactions , 1993 .

[12] Nam-Ky Nguyen,et al. Construction of Optimal Block Designs by Computer , 1994 .

[13] Dennis K. J. Lin. Generating Systematic Supersaturated Designs , 1995 .

[14] J. John,et al. Cyclic and Computer Generated Designs , 1995 .

[15] Nam-Ky Nguyen. A note on the construction of near-orthogonal arrays with mixed levels and economic run size , 1996 .