A note on optimal foldover design

Similar documents
Some Nonregular Designs From the Nordstrom and Robinson Code and Their Statistical Properties

E(s 2 )-OPTIMALITY AND MINIMUM DISCREPANCY IN 2-LEVEL SUPERSATURATED DESIGNS

Construction of column-orthogonal designs for computer experiments

Interaction balance in symmetrical factorial designs with generalized minimum aberration

University, Wuhan, China c College of Physical Science and Technology, Central China Normal. University, Wuhan, China Published online: 25 Apr 2014.

UNIFORM FRACTIONAL FACTORIAL DESIGNS

Projection properties of certain three level orthogonal arrays

Maximal Rank - Minimum Aberration Regular Two-Level Split-Plot Fractional Factorial Designs

Optimal Selection of Blocked Two-Level. Fractional Factorial Designs

Optimal Foldover Plans for Two-Level Fractional Factorial Designs

Algorithmic Construction of Efficient Fractional Factorial Designs With Large Run Sizes

MINIMUM MOMENT ABERRATION FOR NONREGULAR DESIGNS AND SUPERSATURATED DESIGNS

Moment Aberration Projection for Nonregular Fractional Factorial Designs

Optimal blocking of two-level fractional factorial designs

COMPROMISE PLANS WITH CLEAR TWO-FACTOR INTERACTIONS

CONSTRUCTION OF OPTIMAL MULTI-LEVEL SUPERSATURATED DESIGNS. Hongquan Xu 1 and C. F. J. Wu 2 University of California and University of Michigan

CONSTRUCTION OF SLICED ORTHOGONAL LATIN HYPERCUBE DESIGNS

Constructions of uniform designs by using resolvable packings and coverings

Park, Pennsylvania, USA. Full terms and conditions of use:

Restricted Randomized Two-level Fractional Factorial Designs using Gray Code

2 FRED J. HICKERNELL the sample mean of the y (i) : (2) ^ 1 N The mean square error of this estimate may be written as a sum of two parts, a bias term

On the construction of asymmetric orthogonal arrays

A Short Overview of Orthogonal Arrays

Construction of optimal supersaturated designs by the packing method

USING REGULAR FRACTIONS OF TWO-LEVEL DESIGNS TO FIND BASELINE DESIGNS

Designing Two-level Fractional Factorial Experiments in Blocks of Size Two

Acta Mathematica Sinica, English Series Springer-Verlag Berlin Heidelberg & The Editorial Office of AMS 2015

A RESOLUTION RANK CRITERION FOR SUPERSATURATED DESIGNS

Citation Statistica Sinica, 2000, v. 10 n. 4, p Creative Commons: Attribution 3.0 Hong Kong License

Statistica Sinica Preprint No: SS R2

CONSTRUCTION OF SLICED SPACE-FILLING DESIGNS BASED ON BALANCED SLICED ORTHOGONAL ARRAYS

Resolvable partially pairwise balanced designs and their applications in computer experiments

ORTHOGONAL ARRAYS OF STRENGTH 3 AND SMALL RUN SIZES

Some optimal criteria of model-robustness for two-level non-regular fractional factorial designs

Binary construction of quantum codes of minimum distances five and six

Construction of some new families of nested orthogonal arrays

A NEW CLASS OF NESTED (NEARLY) ORTHOGONAL LATIN HYPERCUBE DESIGNS

An Approach to Constructing Good Two-level Orthogonal Factorial Designs with Large Run Sizes

Bounds on the maximum numbers of clear two-factor interactions for 2 (n 1+n 2 ) (k 1 +k 2 ) fractional factorial split-plot designs

Minimax design criterion for fractional factorial designs

Definitive Screening Designs with Added Two-Level Categorical Factors *

A General Criterion for Factorial Designs Under Model Uncertainty

arxiv: v1 [stat.me] 16 Dec 2008

E(s 2 )-OPTIMAL SUPERSATURATED DESIGNS

An Algorithm for Constructing Orthogonal and Nearly Orthogonal Arrays with Mixed Levels and Small Runs

Construction and analysis of Es 2 efficient supersaturated designs

CONSTRUCTION OF NESTED (NEARLY) ORTHOGONAL DESIGNS FOR COMPUTER EXPERIMENTS

UCLA Department of Statistics Papers

arxiv: v1 [stat.me] 10 Jul 2009

A class of mixed orthogonal arrays obtained from projection matrix inequalities

Optimal Fractional Factorial Plans for Asymmetric Factorials

CONSTRUCTION OF NESTED ORTHOGONAL LATIN HYPERCUBE DESIGNS

FRACTIONAL FACTORIAL DESIGNS OF STRENGTH 3 AND SMALL RUN SIZES

A construction method for orthogonal Latin hypercube designs

A GENERAL CONSTRUCTION FOR SPACE-FILLING LATIN HYPERCUBES

Complexity analysis of job-shop scheduling with deteriorating jobs

CONSTRUCTION OF OPTIMAL MULTI-LEVEL SUPERSATURATED DESIGNS. University of California, Los Angeles, and Georgia Institute of Technology

The restarted QR-algorithm for eigenvalue computation of structured matrices

Construction of optimal Two- Level Supersaturated Designs

QUASI-ORTHOGONAL ARRAYS AND OPTIMAL FRACTIONAL FACTORIAL PLANS

The generalized order-k Fibonacci Pell sequence by matrix methods

Classification of three-word indicator functions of two-level factorial designs

Moments of orthogonal arrays

On the Isomorphism of Fractional Factorial Designs 1

Mixture Designs Based On Hadamard Matrices

Florida State University Libraries

INTELLIGENT SEARCH FOR AND MINIMUM ABERRATION DESIGNS

A CENTRAL LIMIT THEOREM FOR NESTED OR SLICED LATIN HYPERCUBE DESIGNS

HIDDEN PROJECTION PROPERTIES OF SOME NONREGULAR FRACTIONAL FACTORIAL DESIGNS AND THEIR APPLICATIONS 1

A new family of orthogonal Latin hypercube designs

GENERALIZED RESOLUTION AND MINIMUM ABERRATION CRITERIA FOR PLACKETT-BURMAN AND OTHER NONREGULAR FACTORIAL DESIGNS

Nested Latin Hypercube Designs with Sliced Structures

Minimum Aberration and Related Designs in Fractional Factorials. 2 Regular Fractions and Minimum Aberration Designs

Optimal Two-Level Regular Fractional Factorial Block and. Split-Plot Designs

On equidistant constant weight codes

Journal of Statistical Planning and Inference

Orthogonal and nearly orthogonal designs for computer experiments

Analysis Methods for Supersaturated Design: Some Comparisons

18Ï È² 7( &: ÄuANOVAp.O`û5 571 Based on this ANOVA model representation, Sobol (1993) proposed global sensitivity index, S i1...i s = D i1...i s /D, w

Mixture Designs Based on Hadamard Matrices

Anale. Seria Informatică. Vol. XIII fasc Annals. Computer Science Series. 13 th Tome 1 st Fasc. 2015

FRACTIONAL FACTORIAL SPLIT-PLOT DESIGNS WITH MINIMUM ABERRATION AND MAXIMUM ESTIMATION CAPACITY

An Algorithm for Constructing Orthogonal and Nearly-Orthogonal Arrays With Mixed Levels and Small Runs

On the existence of nested orthogonal arrays

proposed. This method can easily be used to construct the trend free orthogonal arrays of higher level and higher strength.

SOME NEW THREE-LEVEL ORTHOGONAL MAIN EFFECTS PLANS ROBUST TO MODEL UNCERTAINTY

Secret-sharing with a class of ternary codes

MARGINAL HOMOGENEITY MODEL FOR ORDERED CATEGORIES WITH OPEN ENDS IN SQUARE CONTINGENCY TABLES

A Coset Pattern Identity between a 2 n p Design and its Complement

Definitive Screening Designs

Discrete Applied Mathematics 105 (2000) On (n; k)-sequences. Received 7 April 1999; revised 21 December 1999; accepted 22 December 1999

Some codes related to BCH-codes of low dimension

An Algorithmic Approach to Constructing Supersaturated Designs

An Even Order Symmetric B Tensor is Positive Definite

Connections between the resolutions of general two-level factorial designs

Discrete Applied Mathematics

On the convergence rates of genetic algorithms

A scale-free goodness-of-t statistic for the exponential distribution based on maximum correlations

Tilburg University. Two-dimensional maximin Latin hypercube designs van Dam, Edwin. Published in: Discrete Applied Mathematics

Minimum Aberration and Related Criteria for Fractional Factorial Designs

Transcription:

Statistics & Probability Letters 62 (2003) 245 250 A note on optimal foldover design Kai-Tai Fang a;, Dennis K.J. Lin b, HongQin c;a a Department of Mathematics, Hong Kong Baptist University, Kowloon Tong, Hong Kong, People s Republic of China b Department of Supply Chain and Information Systems, The Pennsylvania State University, USA c Department of Mathematics, Central China Normal University, Wuhan, People s Republic of China Received October 2002; received in revised form November 2002; accepted December 2002 Abstract This note provides a theoretical justication for the optimal foldover plans for two-level designs, including the regular 2 s p, non-regular, saturated and supersaturated designs. c 2003 Elsevier Science B.V. All rights reserved. MSC: 62K15; 62K99 Keywords: Discrepancy; Optimal foldover plan; Uniformity Foldover is a classic technique that reverses the signs of one or more factors in the initial design for the follow-up experiment (called a foldover design). This standard strategy can be found in the literature. The conventional wisdom is to reverse signs for all factors. The foldover plan for reversingonly one factor was discussed by Box et al. (1978) to de-alias the specic factor from all other factors. Montgomery and Runger (1996) studied foldover for resolution IV designs. Using an exhausted search, Li and Lin (2003) and Li and Mee (2002) recently gave all optimal foldover plans for regular two-level fractional factorial designs, in terms of the aberration criterion of the combined design. Li et al. (2003) studied optimal foldover plans for non-regular two-level factorial designs in terms of the generalized minimum aberration of the combined design. A theoretical justication, however, is lacking. In this note, we will provide a theoretical justication for optimal foldover design, based on uniformity criterion. Consider a two-level fractional factorial design with n runs and s factors, denoted as T =(t 1 ;t 2 ;:::;t s )=(t ij ), t ij = ±1. Dene a foldover plan as the set of factors whose signs are reversed in the foldover design. This plan is denoted by = 1 s, where i = 1 if the ith column Correspondingauthor. E-mail address: ktfang@math.hkbu.edu.hk (K.-T. Fang). 0167-7152/03/$ - see front matter c 2003 Elsevier Science B.V. All rights reserved. doi:10.1016/s0167-7152(03)00008-7

246 K.-T. Fang et al. / Statistics & Probability Letters 62 (2003) 245 250 of T is reversed otherwise 0. The correspondingfoldover plan space then is denoted by with 2 s possible foldover plans. For the foldover plan, let m = s i=1 i. When m = s, the foldover plan is called a full foldover plan in the statistical literature. Specically, for a two-level factorial design T with design columns, t i s, and a given foldover plan, a new 2n-run and s-factor combined design T () is then ( ) t1 t 2 t s T ()= : ( 1) 1 t 1 ( 1) 2 t 2 ( 1) s t s Uniformity has received a great deal of attention in the recent design literature (see, for example, Fangand Mukerjee, 2000; Fangand Lin, 2003). There are many measures of uniformity. Among them, the centered L 2 -discrepancy (CD for short) has good properties (Hickernell, 1998a). The squared CD can be expressed in the close form (CD(P)) 2 = ( ) 13 s 1 12 n + 1 n 2 k=1 k=1 i=1 s j=1 i=1 ( s 1 1 2 x ki 1 2 1 2 x ki 1 2 ( 1+ 1 2 2 ) x ki 1 2 + 1 2 x ji 1 2 1 ) 2 x ki x ji ; where P = {x 1 ;:::;x n } is a set of n points on [0; 1) s. For the combined design T ()=(t ij) we can make the transformation from T() to a set of 2n points on [0; 1) s, P T() = {x 1 ;:::;x 2n }, where x ij =(t ij +2)=4 [0; 1). Then, the CD value of T(), denoted by CD(T ()), can be calculated as follows: (CD(T ())) 2 = c + 1 2n 2 k=1 s j=1 i=1 ( 5 2 1 2 x ki x ji 1 ) 2 x ki +( 1) i+1 x ji i ; (1) where c = (13=12) s 2(35=32) s. From (1), it is clear that the value CD(T()) mainly concerns the rst n points of P T() and the foldover plan. For an initial design T, dierent CD-values of T() are given by dierent foldover plans. For regular two-level designs, Fangand Mukerjee (2000) obtained a link between CD and the word length pattern, that can be extended to non-regular two-level designs (see Eqs. (A.1) and (A.2) in Appendix A). We can see the minimum (generalized) aberration criterion and the uniformity criterion in the sense of the CD are almost equivalent for two-level factorials. We have checked all designs given in Chen et al. (1993) and found that these two criteria are consistent without any exception. We thus dene such an almost equivalent as A-equivalent. Thenceforward, the optimal foldover plan in this paper is dened as the foldover plan such that its combined design T has the smallest CD-value over. The main advantages of the uniformity criterion are: (1) it is applicable to regular and non-regular two-level designs and (2) it is very easy to compute. For convenience in this paper, an E(s 2 )-optimal supersaturated design means that the Hamming distance (see MacWilliams and Sloane, 1977) of any two distinct rows of the design is a constant (see Nguyen, 1996; Tangand Wu, 1997). Following Mukerjee and Wu (1995), the Hammingdistance

K.-T. Fang et al. / Statistics & Probability Letters 62 (2003) 245 250 247 of any two distinct rows of a saturated orthogonal array is also a constant. We have the following theorem whose proof is given in Appendix A. Theorem 1. (i) For regular 2 s p designs, the optimal foldover plan given here is A-equivalent to an optimal foldover plan proposed by Li and Lin (2003). (ii) For non-regular two-level factorial designs, the optimal foldover plan given here is A-equivalent to an optimal foldover plan proposed by Li et al. (2003). (iii) If the initial design is a two-level saturated orthogonal array or an E(s 2 )-optimal supersaturated two-level design, then the optimal foldover plan is the full foldover plan. (iv) For xed m and the initial design being a two-level saturated orthogonal array or an E(s 2 )-optimal supersaturated two-level design, the optimal foldover plan is A-equivalent to the one such that N has the minimum generalized aberration, where N is the sub-design of T consisting of s m unchanged columns under. (v) Under the full foldover plan, all initial designs with identical even-length words result in the identical CD-value for the combined design. Remark 1. Note that similar conclusions also hold if the wrap-around L 2 -discrepancy or the symmetric L 2 -discrepancy, proposed by Hickernell (1998a, b) and discussed by Fangand Ma (2001), serves as a measure of uniformity. Remark 2. The statement (v) indicates that if the initial design is a uniform design with even resolution, then the resultingcombined design under the full foldover plan has the lowest discrepancy. This fact does not hold for initial designs of odd resolution. For example, consider two regular designs, D 1 and D 2, both with 16 runs and seven factors. Suppose that the generating relations of D 1 and D 2 are 5 = 12, 6 = 13, 7 = 234, and 5 = 12, 6 = 13, 7 = 23, with word length patterns (0; 0; 2; 3; 2; 0; 0) and (0; 0; 4; 3; 0; 0), respectively. It is clear that both designs have resolution III and the CD-value of D 1 is less than that of D 2. However, the resultingcombined designs under full foldover plan have the same generalized word length pattern (0; 0; 0; 3; 0; 0; 0) and same CD-value 0.287896. Remark 3. It is important to note from (v) that, under the full foldover plan, dierent initial designs may result in the same CD-value for the combined designs. Consider, for example, two 16-run, 5-factor designs with generating relations 5 = 1234 and 5 = 12. One design is of resolution V, and the other one is of resolution III. However, both of their combined designs under the full foldover plan are full factorial designs. Acknowledgements The authors would like to thank the Referee for valuable comments and suggestions that lead to improve the presentation of the paper. This research was partially supported by the HongKong RGC grant, RGC/HKBU 2044/02P and FRG/00-01/II-25.

248 K.-T. Fang et al. / Statistics & Probability Letters 62 (2003) 245 250 Appendix A. Proof of Theorem 1 Fangand Mukerjee (2000) provided the followinganalytic connection between uniformity and aberration in regular two-level designs: ( ) [ ] 9 s s (CD(T ())) 2 A i (T ()) = c + 1+ ; (A.1) 8 9 i i=1 where c is dened in (1) and (A 1 (T ());:::;A s (T())) is the word length pattern of design T(). From (A.1), it is clear that the minimum aberration criterion and the uniformity criterion in the sense of the CD are A-equivalent for regular 2 s p factorials. Recall that the optimal foldover plan proposed by Li and Lin (2003) is the one such that T() has minimum aberration. Thus, statement (i) follows. For non-regular two-level designs, Ma and Fang(2001) proved the followingformula: (CD(T ())) 2 = c + ( ) [ 9 s 1+ 8 s i=1 A g i (T ()) 9 i ] ; (A.2) where c is dened in (1) and (A g 1 (T ());:::;Ag s (T())) is the generalized word length pattern of T () (proposed by Ma and Fang, 2001; Xu and Wu, 2001). It is well known that the criterion of minimum generalized aberration, independently proposed by Ma and Fang(2001) and Xu and Wu (2001) is essentially identical for two-level designs. From (A.2) we can see the CD and the generalized minimum aberration are A-equivalent for non-regular two-level factorials. Note that the optimal foldover plans proposed by Li et al. (2003) are in terms of the generalized minimum aberration. Therefore, statement (ii) is proved. Let DHT(x k ;x j ) and DHN(x k ;x j ) be the Hammingdistance between the kth and jth rows in T and N, respectively. The identity (1) can be expressed in terms of Hammingdistances as follows: (CD(T ())) 2 = c + 1 2n 2 k=1 [ (5 j=1 4 ) s DHT(xk ;x j) + ( ) ] 5 s m+dht(xk ;x j) 2DHN(x k ;x j) : (A.3) 4 When DHT(x k ;x j )= for all pairs (k; j) (k j), (A.3) becomes [ (5 (CD(T ())) 2 = c + 1 ) s ( ) 5 s ( ) 5 s m ( ) ] 5 s m+ +(n 1) + 2n 4 4 4 4 + 1 2n ( ) 5 s m+ s m 4 j=0 E j (N ) ( ) 16 j ; (A.4) 25 where (E 0 (T );E 1 (T );:::;E s (T )) is the distance distribution of T (see Ma and Fang, 2001). Now, it is not hard to see that (CD(T ())) 2 achieves its minimum value if and only if m = s, which establishes statement (iii).

and From (A.4) and two formulae: where K.-T. Fang et al. / Statistics & Probability Letters 62 (2003) 245 250 249 E j (N )= n s m P 2 s m j (i; s m)a g i (N ) i=0 s m P j (i; s m)a j =(1+a) s m i (1 a) i ; j=0 P j (i; t)= ( )( ) j i t i ( 1) r r j r r=0 is the Krawtchouk polynomial (see MacWilliams and Sloane, 1977), we have [ (5 (CD(T ())) 2 = c + 1 ) s ( ) 5 s ( ) 5 s m ( ) ] 5 s m+ +(n 1) + 2n 4 4 4 4 + 1 2 ( ) 5 ( ) [ 41 s m 1+ 4 40 s m t=1 ( ) ] 9 t A g t (N ) : (A.5) 41 From (A.5), it is clear that, for xed m, (CD(T())) 2 achieves its minimum value is A-equivalent to that N has minimum generalized aberration. Hence, statement (iv) follows. When m = s, (A.3) becomes [ (CD(T ())) 2 = c + 1 s (5 ) s i ( )] 5 i E i (T ) + 2n 4 4 = c + i=0 ( ) 9 s + 1 8 2 ( ) 9 s s [1+( 1) i ] Ag i (T) : (A.6) 8 9 i i=1 It is clear that (CD(T ())) 2 depends only on even-length words of T. Statement (v) is proved. References Box, G.E.P., Hunter, W.G., Hunter, J.S., 1978. Statistics for Experimenters. Wiley, New York, NY. Chen, J., Sun, D.X., Wu, C.F.J., 1993. A catalogue of two-level and three-level fractional factorial designs with small runs. Internat. Statist. Rev. 61, 131 145. Fang, K.T., Lin, D.K.J., 2003. Uniform experimental designs and their applications in industry. In: Rao, C.R., Khattree, R. (Eds.), Handbook of Statistics. Vol. 23, Elsevier Science, Amsterdam. Fang, K.T., Ma, C.X., 2001. Wrap-around L 2-discrepancy of random sampling, Latin hypercube and uniform designs. J. Complexity 17, 608 624. Fang, K.T., Mukerjee, R., 2000. Connection between uniformity and aberration in regular fractions of two-level factorials. Biometrika 87, 173 198. Hickernell, F.J., 1998a. A generalized discrepancy and quadrature error bound. Math. Comput. 67, 299 322.

250 K.-T. Fang et al. / Statistics & Probability Letters 62 (2003) 245 250 Hickernell, F.J., 1998b. Lattice rules: how well do they measure up? In: Hellekalek, P., Larcher, G. (Eds.), Random and Quasi-Random Point Sets, Lecture Notes in Statistics, Vol. 138. Springer, New York, pp. 109 166. Li, W., Lin, D.K.J., 2003. Optimal foldover plans for two-level fractional factorial designs. Technometrics, to appear. Li, H., Mee, R.W., 2002. Better foldover fractions for resolution III 2 k p designs. Technometrics 44, 278 283. Li, W., Lin, D.K.J., Ye, K.Q., 2003. Optimal foldover plans for non-regular orthogonal designs. Submitted to Technometrics for publication. Ma, C.X., Fang, K.T., 2001. A note on generalized aberration factorial designs. Metrika 53, 85 93. MacWilliams, F.J., Sloane, N.J.A., 1977. The Theory of Error-correctingCodes. North-Holland, Amsterdam. Montgomery, D.C., Runger, G.C., 1996. Foldovers of 2 k p resolution IV experimental designs. J. Quality Tech. 28, 446 450. Mukerjee, R., Wu, C.F.J., 1995. On the existence of saturated and nearly saturated asymmetrical orthogonal arrays. Ann. Statist. 23, 2102 2115. Nguyen, N.K., 1996. An algorithmic approach to constructing supersaturated designs. Technometrics 38, 69 73. Tang, B., Wu, C.F.J., 1997. A method for constructing supersaturated designs and its E(s 2 ) optimality. Canad. J. Statist. 25, 191 201. Xu, H., Wu, C.F.J., 2001. Generalized minimum aberration for asymmetrical fractional factorial design. Ann. Statist. 29, 549 560.