• 沒有找到結果。

Constraints imposed by the block structure, additional requirements of the experi- ment, and some important information about the design are built into the template

N/A
N/A
Protected

Academic year: 2022

Share "Constraints imposed by the block structure, additional requirements of the experi- ment, and some important information about the design are built into the template"

Copied!
18
0
0

加載中.... (立即查看全文)

全文

(1)

TEMPLATES FOR DESIGN KEY CONSTRUCTION

Ching-Shui Cheng and Pi-Wen Tsai

University of California, Berkeley and National Taiwan Normal University

Abstract: We present some useful templates for implementing design key construc- tion of factorial designs with simple block structures, in particular those for the construction of unblocked and blocked split-plot and strip-plot factorial designs.

Constraints imposed by the block structure, additional requirements of the experi- ment, and some important information about the design are built into the template.

These features add to the advantages of design key construction.

Key words and phrases: Block design, factorial design, row-column design, simple block structure, split-plot design, strip-plot design.

1. Introduction

The method of design key, proposed by Patterson (1965, 1976) (also see Patterson and Bailey (1978)), is a useful method of constructing designs for factorial experiments with what Nelder (1965a) called simple block structures.

The simplest examples of simple block structures include, for instance, those of block designs (including split-plot designs) and row-column designs (including strip-plot designs). The design key method is applicable to symmetric or mixed- level designs. For sn factorials where s is a prime number or power of a prime number, it is equivalent to the familiar method of using independent treatment factorial effects (words) to divide the treatment combinations into blocks, rows, and columns, etc. In the process of selecting the treatment words, certain con- ditions need to be verified to ensure that the desired block structure is achieved and some requirements imposed by the experiment are satisfied. The method of design key, on the other hand, guarantees the desired block structure by choos- ing some appropriate contrasts of the experimental units to be aliases of the main-effect contrasts of treatment factors. It has several advantages, including simple generation of the design layout and a unified construction for different block structures.

Patterson (1965, 1976) and Patterson and Bailey (1978) did not address the issue of how to choose design keys, and the same design can be produced by many different design keys. In this paper, for unblocked and blocked split-plot and strip-plot sn factorial designs, where s is a prime number or power of a

(2)

prime number, we present some useful templates to remove such redundancy so that efficient design searches can be performed and for implementing design key construction. Constraints imposed by the block structure and additional requirements of the experiment are built into the template.

To fix the ideas, in Sections 2 and 3 we first review the construction of blocked and row-column factorial designs, and present design key templates for these settings. After the construction and the relationship between the methods based on words and design keys are understood for the two simple cases, a general result is presented in Section 4. Design key templates for split-plot, blocked split-plot, and blocked strip-plot designs are derived in Sections 5, 6, and 7, respectively.

We devote our discussions mostly to complete factorial designs. Modifications that are needed for fractional factorial designs are presented in Section 8.

2. Block Designs

In an sn factorial experiment where s is a prime number or power of a prime number, each treatment combination can be represented by a vector x = (x1, . . . , xn)T, with each xi ∈ GF(s), the Galois field (finite field) with s elements.

The set of all such vectors, sn in total, is called the n-dimensional Euclidean ge- ometry over GF(s). We refer the readers to Appendix A of Hinkelmann and Kempthorne (2005) for the definition of fields, and Chapter 11 there for de- tailed discussions of the construction of blocked factorial designs. To construct a complete sn factorial design in sq blocks of size sn−q, a set of q linearly inde- pendent vectors a1, . . . , aq in EG(n, s) is chosen to perform the partition of the treatment combinations into blocks. Specifically, each block consists of the sn−q vectors (treatment combinations) that are solutions of the q equations aTi x = bi, i = 1, . . . , q, where bi ∈ GF(s). The q linearly independent vectors a1, . . . , aq

are called independent blocking words. Under the constructed design, the s− 1 degrees of freedom defined by each nonzero linear combination of a1, . . . , aq are confounded with block contrasts. We call the nonzero linear combinations of a1, . . . , aq blocking words. Typically we avoid confounding the treatment main effects with block contrasts.

The sq blocks can be determined as follows. We first solve the equations aTi x = 0, i = 1, . . . , q, to obtain the principal block. Given sk blocks (k < q) that have been obtained, pick a treatment combination x that has not appeared yet. Add each of the s− 1 nonzero multiples of x (λx with λ ∈ GF(s), λ ̸= 0) to all the treatment combinations in the sk blocks to form (s− 1)sk additional blocks. Then repeat the same procedure until sq blocks are obtained. It follows that the design is completely determined by the principal block.

(3)

For design key construction, we note that the sn experimental units can be thought of as all the combinations of an sq-level factor B and an sn−q-level factor P, with the jth unit in the ith block represented by the combination whereB is at level i and P is at level j. The (sn− 1)-dimensional space of unit contrasts can be decomposed as the direct sum of an (sq−1)-dimensional space of block contrasts, called the interblock stratum, and an sq(sn−q− 1)-dimensional space of within-block contrasts, called the intrablock stratum. It can be seen that the interblock stratum is the same as the space of the main-effect contrasts of B, and the intrablock stratum is generated by the main-effect contrasts of P and the interaction contrasts of B and P. Each treatment factorial effect (main effect or interaction) that coincides with a unit contrast representing the main effect ofB (the latter is called the unit alias of the former) is confounded with a block contrast. On the other hand, if the unit alias of a treatment factorial effect is either the main effect ofP or interaction of B and P, then it is orthogonal to the block contrasts. If a design is constructed in such a way that each treatment main-effect contrast coincides with a unit contrast representing either the main effect of P or interaction of B and P, then all the treatment main effects are orthogonal to block contrasts. Unit aliases of all treatment interactions can be obtained from those of the main-effect contrasts to determine whether they are orthogonal to or are confounded with block contrasts.

For convenience, we represent each of the sq blocks by a combination of q s-level pseudo factorsB1, . . . ,Bq and each of the sn−q levels ofP by a combina- tion of n− q s-level pseudo factors P1, . . . ,Pn−q. Then each experimental unit can be represented by a combination (p1, . . . , pn−q, b1, . . . , bq)T of the levels of P1, . . . ,Pn−q,B1, . . . ,Bq. We call these n factors unit factors. A factorial effect of these factors falls in the interblock (respectively, intrablock) stratum if and only if it involves none (respectively, at least one) of thePj’s. Let Y be an n×snma- trix with each row corresponding to a unit factor and each column corresponding to an experimental unit such that each column of Y is the corresponding level combination of the unit factors. Let

X = KY , (2.1)

where K is a nonsingular n× n matrix with entries from GF(s). A design is obtained by assigning the treatment combination represented by the jth column of X, 1 ≤ j ≤ sn, to the unit corresponding to the jth column of Y . The nonsingularity of K is to ensure that all the sn treatment combinations are generated.

(4)

By (2.1), each treatment combination (x1, . . . , xn)T assigned to the experi- mental unit (p1, . . . , pn−q, b1, . . . , bq)T satisfies

xi =

n−q

j=1

kijpj+

q l=1

ki,n−q+lbl;

that is, the factorial effect of the unit factors defined by the ith row of K is the unit alias of the main effect of the ith treatment factor. Thus the main effect of the ith treatment factor is orthogonal to the block contrasts if and only if at least one of ki,1, . . . , ki,n−q is nonzero. We call K a design key matrix.

(Note that in Patterson (1976), KT is called a key matrix.) Each row of K corresponds to a treatment factor and each of its columns corresponds to a unit factor. In practice, it is not necessary to perform the matrix multiplication in (2.1) to obtain the design layout. Let ei be the n× 1 vector whose ith entry is equal to 1 and all other entries equal to zero. Then {e1, . . . , en} is a set of independent generators of the sn units. Suppose we generate and arrange the sn units in the following Yates order with respect to e1, . . . , en: the first unit is 0 in which all the unit factors are at level 0; given that sk units (0 ≤ k < n) have been generated, follow these units by s− 1 sets of size sk, where each set is obtained by adding a nonzero multiple of ek+1 to the sk units that have been generated. Continue until all the units are generated. Then the first sn−q units in the generated sequence are in the same block, and each succeeding set of sn−q units are also in the same block. Since K is nonsingular, Ke1, . . . , Ken, which are the columns of K, give a set of independent generators of the treatment combinations. If we generate the treatment combinations using the generators Ke1, . . . , Ken, and arrange them in the same Yates order, then the first sn−q treatment combinations in the generated sequence are in the same block, and each succeeding set of sn−q treatment combinations are also in the same block.

Example 1. A 24 design in four blocks of size four, where the treatment factors are denoted by A, B, C, D, is constructed by using the two three-factor interac- tions ABC and ABD as independent blocking words.

(1) acd bcd ab

c ad bd abc

d ac bc abd

cd a b abcd

Note that we have used the convention of representing each treatment combi- nation by a string of lower case letters; a letter is present if and only if the

(5)

corresponding factor is at level 1. The first block consists of the four treatment combinations that have even numbers of letters in common with both ABC and ABD, where (1) is the combination with all the treatment factors at level 0.

The other blocks can be obtained by repeating the process of symbolically mul- tiplying the treatment combinations that have been generated by one that has not appeared yet, subject to the rule that the square of any letter is eliminated.

This design can also be constructed by usingP1,P2,P1P2B1,P1P2B2 as the unit aliases of the treatment main effects A, B, C, D, respectively. Since all these unit aliases involve at least one ofP1 andP2, no treatment main effect is confounded with a block contrast. We have the following design key, where the unit alias of each treatment main effect is used to write down a row:

K =

P1 P2 B1 B2





1 0 0 0 A

0 1 0 0 B

1 1 1 0 C

1 1 0 1 D

(2.2)

The design layout can be obtained by using the four independent generators acd, bcd, c, and d identified from the columns of K. We start with (1) and the first generator acd. Multiplying them by the second generator bcd, we obtain the four treatment combinations in the first block. The second block can be obtained from the third generator c, and the last two blocks can be obtained from the fourth generator d. The unit aliases of ABC and ABD are P1P2(P1P2B1) =B1

andP1P2(P1P2B2) =B2, respectively. Since these unit aliases involve neitherP1

norP2, ABC and ABD are indeed blocking words. This can also be seen from the inverse of K−1:

K−1=

A B C D





1 0 0 0 P1

0 1 0 0 P2

1 1 1 0 B1

1 1 0 1 B1

In the inverse key matrix, which happens to be equal to K, the roles of treatment and unit factors are reversed. From the last two rows, we can see that the treatment aliases of B1 and B2 are, respectively, the two independent blocking words ABC and ABD.

A method of constructing blocked sncomplete factorial designs proposed by Das (1964) and Cotter (1974), although not presented in the form of a design

(6)

key, is essentially equivalent to using a design key of the form K =

[In−q 0n−q,q

B Iq

]

, (2.3)

where I is an identity matrix and 0n−q,q is the (n− q) × q matrix of 0’s. The discussion in Example 1 shows that the principal block is generated by the first n−q columns of K. Since the principal block itself is an sn−q fractional factorial design, it can be generated by using n− q basic factors; that is, there are n − q treatment factors such that the principal block contains each of their level combinations exactly once, and the other q treatment factors can be defined in terms of interactions of the basic factors. Thus there exists a set of n− q independent generators of the principal block such that each basic factor appears at level 1 in exactly one of the generators and level 0 in all the other generators.

Without loss of generality (subject to a relabeling of the treatment factors), we can assume that these basic factors correspond to the first n−q rows of K. Then the first n− q columns of K are as shown in (2.3). On the other hand, since the design is completely determined by the principal block, we can choose the last q columns of K arbitrarily as long as K is nonsingular. Clearly the columns of K in (2.3) are linearly independent. Thus all block designs can be constructed by using a design key of the form in (2.3). If no treatment main effects are to be confounded with blocks, then all the rows of B must be nonzero. This gives a template for constructing blocked complete factorial designs. To choose a blocking scheme, only the q nonzero rows of B need to be chosen.

For a matrix of the from in (2.3), we have K−1=

[In−q 0n−q,q

−B Iq

]

, (2.4)

in particular, for two-level designs, K−1 = K. It follows that each of the last q rows of K with the first n− q components replaced by their additive inverses (unchanged when s = 2) defines a treatment factorial effect that is confounded with block contrasts. It is clear that these rows are linearly independent. Thus the selection of q independent blocking words is equivalent to that of the q rows of B, and a set of independent blocking words can be identified directly from the last q rows of K. In comparison with the method based on words, we point out the advantages of not having to check independence of the blocking words, not having to check that no main effect is a generalized interaction of the independent blocking words, and not having to solve equations to identify the treatment combinations in the principal block. All of these are built into the template.

(7)

Example 2. (Example 1 revisited) By (2.3), a design key template is

K =

P1 P2 B1 B2





1 0 0 0 A

0 1 0 0 B

1 0 C

0 1 D

There are four unfilled entries, where at least one of the two unfilled entries in the same row must be 1. Suppose we fill all the four entries with 1. Then we have the design key in (2.2). The two independent blocking words ABC and ABD can be read directly from the last two rows of K.

3. Row-column Designs

We refer the readers to Section 9.8 of Hinkelmann and Kempthorne (2005) for a discussion of the construction of row-column designs for two-level factorial experiments. To construct a complete sn factorial row-column design with sp rows and sq columns, where p + q = n and s is a prime number or power of a prime, we choose a set of p + q linearly independent vectors a1, . . . , ap, b1, . . . , bq in EG(n, s). The sn treatment combinations x are partitioned into sp rows and sq columns according to the values of aTi x, i = 1, . . . , p, and bTjx, j = 1, . . . , q, respectively. In this case the (sn − 1)-dimensional space of unit contrasts is orthogonally decomposed into three strata: an (sp− 1)-dimensional row stratum of row contrasts, an (sq− 1)-dimensional column stratum of column contrasts, and an (sp− 1)(sq− 1)-dimensional unit stratum of those that are orthogonal to row and column contrasts. The treatment factorial effects defined by nonzero linear combinations of a1, . . . , ap are confounded with row contrasts, and those defined by nonzero linear combinations of b1, . . . , bqare confounded with column contrasts.

For design key construction, each unit is a combination of n = p + q s- level pseudo factorsR1, . . . ,Rp and C1, . . . , Cq. The main-effect and interaction contrasts of R1, . . . ,Rp are in the row-stratum, the main-effect and interaction contrasts of C1, . . . , Cqare in the column-stratum, and the remaining interaction contrasts of R1, . . . ,Rp and C1, . . . , Cq are in the unit stratum. Similar to the construction of block designs, the design key K is an n× n matrix with each row corresponding to a treatment factor and each column corresponding to one of the n unit factors R1, . . . ,Rp, C1, . . . , Cq. We order the columns of K so that the first q correspond to C1, . . . , Cq and the last p correspond to R1, . . . ,Rp. The design generated by the first q columns of K is an sn−p fractional factorial

(8)

design, and that generated by the last p columns is an sn−q fractional factorial design. The former has a set A2 of q basic factors and the latter has a set A1 of p basic factors. Since a complete sn factorial is generated by the n columns together, A1 and A2 can be chosen to be disjoint. Let the first q rows of K correspond to those in A2 and the last p rows correspond to those in A1. Then without loss of generality (subject to treatment factor relabeling), we can use a design key matrix of the form

K =

[Iq B C Ip

]

. (3.1)

If no treatment main-effect contrasts are to be confounded with row or column contrasts, then all the rows of B and C must be nonzero. This gives a design key template for complete factorial row-column designs. Again it can be seen that selection of the n independent words a1,· · · , ap, b1,· · · , bq is equivalent to that of the n rows of B and C. The design layout can be obtained by generating the treatment combinations from the columns of K in the Yates order. Each succeeding set of sq treatment combinations from the beginning of the generated sequence yields one row of the design, with the treatment combinations in each set assigned to the columns in the order as given.

Under a strip-plot design (see, e.g., Miller (1997)), some treatment factors, called row treatment factors, must have constant level on all the units in the same row, and the other treatment factors, called column treatment factors, must have constant level on all the units in the same column. The main effects of row treatment factors are confounded with row contrasts and those of column treatment factors are confounded with column contrasts. For complete factorial strip-plot designs with p row treatment factors and q column treatment factors, the first q rows of the design key K in (3.1) correspond to column treatment factors, the last p rows correspond to row treatment factors, and both B and C must be zero matrices. In other words, we have the design key

K =

[Iq 0 0 Ip

]

. (3.2)

In this case, the design is completely determined by the design for the row treat- ment factors, called the row design, and that for the column treatment factors, called the column design. Specifically, the strip-plot design is the product of the row design and column design: each combination of the row treatment factors is coupled with each combination of the column treatment factors once.

(9)

4. A General Result

Under a block design, a set of unstructured units is nested in each of another set of unstructured units. On the other hand, the block structure of a row- column design involves the crossing of two sets of unstructured units. Nelder (1965a) defined simple block structures to be those that can be obtained by repeated nesting and crossing. McLeod and Brewster (2004) considered blocking of factorial split-plot designs, where there are two layers of nesting: subplots are nested in whole-plots, which in turn are nested in blocks. The blocked strip-plot designs considered by Miller (1997) have a block structure that is obtained by combining nesting with crossing: a row-column structure is nested in each of several blocks. Both blocked split-plot and blocked strip-plot designs have block structures that are examples of a simple block structure. Analysis of randomized experiments with simple block structures and rules for determining the strata can be found in Nelder (1965a,b).

Similar to the derivation of (2.3) and (3.1), the following result can easily be established.

Theorem 1. Let B1 and B2 be simple block structures on sm1 and sm2 units, respectively, where s is a prime number or power of a prime number, n = m1+m2, and B1/B2 (respectively, B1 × B2) be block structures on sn units obtained by nesting B2 in B1 (respectively, crossing B1 and B2). Without loss of generality, a design key K for a complete snfactorial with block structure B1/B2 or B1×B2

can be expressed as

K =

[ K2 A B K1

]

(4.1) for some matrices A and B, where K1 is a design key for a complete sm1 factorial with block structure B1 and K2 is a design key for a complete sm2 factorial with block structure B2, the first m2 columns of K correspond to the unit factors in B2 and the last m1 columns correspond to the unit factors in B1. Furthermore, if the sm1 units in B1 are unstructured, then a design key for a complete sn factorial with the block structure B1/B2 can be expressed as

K =

[ K2 0 B Im1

]

. (4.2)

As an application of Theorem 1, we derive design key templates for blocked split-plot and strip-plot designs in Sections 6 and 7, respectively.

(10)

5. Split-plot Designs

Consider the construction of sn complete factorial split-plot designs with sq whole-plots each containing sn−q subplots, where n1 of the n treatment factors are whole-plot factors and the other n2 = n− n1 treatment factors are subplot factors. For complete factorials, we must have n1 ≤ q. The results in Section 2 can be applied to the current setting since the block structure of a split-plot design is the same as that of a block design, with the whole-plots and subplots playing the same roles of blocks and units, respectively. Denote P1, . . . ,Pn−q

and B1, . . . ,Bq in Section 2 by S1, . . . ,Sn−q and W1, . . . ,Wq, respectively; here S1, . . . ,Sn−q define the subplots in each whole-plot, and W1, . . . ,Wq define the whole-plots. We can use a design key K of the form in (2.3), where B is q×(n−q), the first n− q columns of K correspond to S1, . . . ,Sn−q, and the last q columns correspond to W1, . . . ,Wq. In this setting, the interblock and intrablock strata are called, respectively, whole-plot and subplot strata.

Since the unit alias of the main effect of each whole-plot treatment factor cannot involve any ofS1, . . . ,Sq, each row of K that corresponds to a whole-plot treatment factor must have all the first n− q components equal to zero. Thus, unlike in Section 2, there is an additional constraint that the first n− q rows of K must correspond to subplot treatment factors. Without loss of generality, let the next n1 rows correspond to whole-plot treatment factors and, if n1 < q, the last q− n1 rows correspond again to subplot treatment factors. Then all the first n1 rows of B must be zero and, if n1 < q, the last q− n1 rows of B are nonzero.

This gives a template for constructing complete sn factorial split-plot designs.

For n1 < q, the design key construction requires the selection of q − n1

nonzero rows of B. This is the case where the number of whole-plot treatment factor level combinations is less than the number of whole-plots, and hence the design on the whole-plots consists of sq−n1 copies of the complete factorial of whole-plot treatment factors. The construction in Bingham, Schoen, and Sitter (2004) uses q− n1 independent splitting words to partition each of sn1 sets of subplot treatment factor combinations that are coupled with the same whole-plot treatment factor combination into sq−n1 smaller sets, resulting in a total of sn1· sq−n1 = sqwhole-plots. The splitting words (splitting effects) are factorial effects that involve some subplot treatment factors but are confounded with whole-plot contrasts. The selection of the last q − n1 rows of B is equivalent to that of independent splitting words, and these words can be identified from the last q− n1 rows of K in the same way as the determination of independent blocking words in Section 2.

(11)

Two further advantages, in addition to those mentioned in Section 2, are that it is not necessary to go through the splitting process and that one single design key works for all the situations regardless of whether n1= q or n1< q.

6. Blocked Split-plot Designs

Consider the construction of an sn complete factorial split-plot design with sqwhole-plots each containing sn−qsubplots, where there are n1whole-plot treat- ment factors, n2 = n− n1 subplot treatment factors, and the sq whole-plots are divided into sg blocks each of size sq−g. McLeod and Brewster (2004) presented three methods (pure whole-plot blocking, separation, and mixed blocking) for constructing blocked split-plot designs. We show that one single template is suf- ficient to generate the designs in a simple manner in all the situations. McLeod and Brewster’s (2004) three methods are more complicated and do not cover all the cases.

In the current setting the (sn − 1)-dimensional space of unit contrasts is orthogonally decomposed into an (sg− 1)-dimensional space of block contrasts, called the block stratum, an sg(sq−g − 1)-dimensional space of whole-plot con- trasts within the same block, called the whole-plot stratum, and an sq(sn−q 1)-dimensional space of between-subplot contrasts within the same whole-plot, called the subplot stratum. Each experimental unit can be represented by a com- bination of n = (n− q) + (q − g) + g unit factors S1, . . . ,Sn−q,W1, . . . ,Wq−g,B1,

· · · , Bg; here S, W, and B stand for subplots, whole-plots and blocks, respec- tively. A treatment main effect is confounded with a block (respectively, whole- plot) contrast if its unit alias does not involve any ofS1, . . . , Sn−q,W1, . . . ,Wq−g

(respectively, involves at least one ofW1, . . . ,Wq−g but not any ofS1, . . . ,Sn−q), and is orthogonal to block and whole-plot contrasts if its unit alias involves at least one of S1, . . . ,Sn−q.

Throughout the rest of this section, we assume that the between-whole-plot variance within the same block is less than the between-block variance. This is often the case in practice, and can be shown to hold under the usual mixed- effect model for blocked split-plot designs; see, e.g., (2.10) of Cheng and Tsai (2011). Under this assumption, if n1 ≤ q − g (that is, the number of whole- plot treatment factor level combinations is no more than the number of whole- plots in each block), then in each block it is better to have all the whole-plot treatment factor level combinations appear the same number of times than to have a replicated fractional factorial of the whole-plot treatment factors. On the other hand, if n1> q− g, then in each block it is better to have an unreplicated sn1−(n1−q+g) design for the whole-plot treatment factors than replications of a

(12)

more fractionated design. A theorem provides a design key template for blocked split-plot designs.

Theorem 2. Suppose no treatment main effects are confounded with block con- trasts, no replication of the same whole-plot treatment factor level combination in each block is allowed when n1 ≥ q − g, and the within-block replication is min- imized when n1 < q− g. Then, without loss of generality, we have a design key template for blocked split-plot designs:

K =

In−q 0n−q,q−g 0n−q,g B Iq−g 0q−g,g

C Ig

 , (6.1)

where B is q× (n − q), C is g × (q − g), the first n − q columns of K correspond to S1, . . . ,Sn−q, the next q− g columns correspond to W1, . . . ,Wq−g, the last g columns correspond toB1, . . . ,Bg, the first n−q rows of K correspond to subplot treatment factors, the next n1 rows correspond to whole-plot treatment factors, and all the remaining rows correspond to subplot treatment factors if n1 < q.

Furthermore, the first n1 rows of B are zero, all the last q− n1 rows of B are nonzero if n1 < q, and all the first n1−(q−g) rows of C are nonzero if n1 > q−g.

Proof. Since we have a block structure wherein sq−gwhole-plots, each containing sn−q subplots, are nested in each of sg blocks, (4.2) in Theorem 1 is applicable.

We have m1 = g, and the matrix K2 in (4.2) can be obtained from (2.3), with q replaced by q− g. Thus without loss of generality, we have a design key of the form

K =

In−q 0 0 B1 Iq−g 0 B2 C Ig

 .

Since all the rows of In−q are nonzero, the first n− q rows of K must correspond to subplot treatment factors.

The columns of K corresponding to those of Iq−g in the middle are used to generate the whole-plot treatment factor combinations in the first block. If n1 ≥ q − g and no whole-plot treatment factor combination is replicated in each block as required, then the treatment combinations generated by these q−g columns can also be generated by using a certain set of q−g whole-plot treatment factors as basic factors. Without loss of generality, we can associate these factors with the rows of K that correspond to those of B1. Then all the entries of B1are zero. If n1 > q−g, then n1−(q −g) of the last g rows of K must also correspond to whole-plot treatment factors. Without loss of generality, take these to be the

(13)

first n1 − (q − g) of the last g rows of K. Then the corresponding rows of B2

(respectively, C) must be zero (respectively, nonzero). The assertion about C follows from the constraint that no treatment main effects are confounded with block contrasts. The last q − n1 rows of K correspond to subplot treatment factors, and hence the corresponding rows of B2 are nonzero.

Similarly, if n1< q− g and within-block replication of whole-plot treatment factor combinations is to be kept at the minimum, then the treatment combi- nations generated by the q − g columns of K corresponding to those of Iq−g

can be generated by using a certain set of n1 whole-plot treatment factors and q− g − n1 subplot treatment factors as basic factors. Without loss of generality, we can associate the rows of K that correspond to the first n1 rows of B1 with whole-plot treatment factors and associate the last q−n1 rows of K with subplot treatment factors. Then the first n1 rows of B1 are zero, and the remaining rows of B1 as well as all the rows of B2 are nonzero. This completes the proof.

If n1≥ q − g, then the design key matrix in (6.1) reduces to

K =

In−q 0 0 0 Iq−g 0 B2 C Ig

 .

In this case, as in Section 2,

K−1 =

In−q 0 0 0 Iq−g 0

−B2 − C Ig

 , (6.2)

and K−1 = K for two-level designs. Thus each of the last g rows of K with the first n− g components replaced by their additive inverses (unchanged when s = 2) defines a blocking effect. Furthermore, if n1 < q, then the last q− n1 of these blocking words (those that are determined from the last q− n1 rows of K) are also splitting words.

For n1 < q− g, K−1 cannot be obtained from K by changing the signs of B and C. This is also the case not covered by the three methods proposed by McLeod and Brewster (2004). Here, independent splitting words can be deter- mined from the last q− n1 rows of K−1, and the last g of these splitting words are also blocking words. Nevertheless, it can be seen that q− n1− g independent splitting words that are not blocking words can still be determined in the same way as described before directly from the rows of K that correspond to those of the last q− n1− g rows of Iq−g.

(14)

7. Blocked Strip-plot Designs

As another application of Theorem 1, we present a design key template for blocked strip-plot designs. Consider the construction of a complete sn factorial design with sg blocks each containing sp+q units that are arranged in sp rows and sq columns, where n = p + q + g. In this case the (sn− 1)-dimensional space of unit contrasts is orthogonally decomposed into an (sg− 1)-dimensional space of block contrasts, called the block stratum, an sg(sp − 1)-dimensional space of row contrasts within the same block, called the row stratum, an sg(sq− 1)- dimensional space of column contrasts within the same block, called the column stratum, and an sg(sp− 1)(sq− 1)-dimensional unit stratum. Each experimen- tal unit can be represented by a combination of n = p + q + g unit factors R1, . . . ,Rp, C1, . . . , Cq,B1, . . . ,Bg; here R, C, and B stand for rows, columns and blocks, respectively. A factorial effect of the unit factors is in the block (re- spectively, row, column, or unit) stratum if it involves only theB’s (respectively, at least one R but no C’s, at least one C but no R’s, or at least one R and at least one C).

Suppose n1 (respectively, n2 = n− n1) of the treatment factors are row (respectively, column) treatment factors. For complete factorial designs we must have n1 ≥ p and n2 ≥ q. A design key can be obtained from (4.2) with m1 = g and K2 given by (3.2):

K =

Iq 0 0 0 Ip 0 A B Ig

 , (7.1)

where the first q columns correspond to C1, . . . , Cq, the next p columns corre- spond toR1, . . . ,Rp, and the last g columns correspond toB1, . . . ,Bg, the first q rows correspond to column treatment factors, the next p rows correspond to row treatment factors, and the last g rows correspond to the remaining row or column treatment factors. For any of the last g rows that corresponds to a row (respec- tively, column) treatment factor, the corresponding row of A (respectively, B) must be zero. A blocking word can be identified from each of the last g rows by using the rule described before.

Example 3. Miller (1997) constructed a 32-run blocked strip-plot design with four rows and four columns in each of two blocks, six two-level row treatment factors, and four two-level column treatment factors. We consider here the con- struction of a full factorial with three two-level row treatment factors (A, B, C) and two two-level column treatment factors (S, T ), and return to the original

(15)

fractional factorial setting of Miller (1997) in Section 8. By (7.1), we have a design key of the form

C1 C2 R1 R2 B









1 0 0 0 0 S

0 1 0 0 0 T

0 0 1 0 0 A

0 0 0 1 0 B

0 0 1 C

Suppose we choose the two unfilled entries (from left to right) to be 1 and 0, respectively. Then the blocking word is AC. The design can be constructed by writing the 32 treatment combinations in the Yates order with respect to the generators identified from the five columns of the design key. The first two generators determine the first row in the first block, the next two generators complete the other rows in the first block, and the second block is obtained from the last generator.

8. Fractional Factorial Designs

For constructing an sn−hfractional factorial design with the block structures discussed, we can add h rows to a design key for the complete factorial of n− h basic factors, one for each added factor. Then two treatment factorial effects are aliased if and only if their unit aliases are aliased. Given the defining relation of the fraction, the row of the design key associated with each added factor can be obtained as a linear combination of the rows corresponding to the basic factors whose interaction is used to define the given factor. We need to check that the constraints imposed by the block structures are satisfied. For instance, in the setting of Section 2, if no treatment main effects are to be confounded with block contrasts, then one needs to make sure that at least one of the first n− q entries of each of the added rows is nonzero.

We illustrate the method on the construction of fractional factorial blocked strip-plot designs. In the setting of Section 7, suppose there are n1row treatment factors, n2 column treatment factors, n1 ≥ p + g, n2 ≥ q + g, and n > p + q + g, where n = n1+ n2. In this case, the row and column designs are blocked sn1−(n1−p−g) and sn2−(n2−q−g) designs, respectively. Miller’s (1997) construction starts with the product of two such blocked designs, which produces a blocked strip-plot design with s2g blocks. The construction is completed by suitably choosing sg of the s2g blocks. We show how the design can be constructed in a simple manner by using a design key.

(16)

Suppose the design key for the complete factorial of p + q + g basic factors obtained in Section 7 has a rows corresponding to row treatment factors with the other b = p + q + g− a rows corresponding to column treatment factors.

If a < p + g, then we need to expand the a row treatment factors to a set of p + g basic factors for the row design. Likewise, if b < q + g, then we need to expand the b column treatment factors to a set of q + g basic factors for the column design. We use independent interactions of the basic factors for the row (respectively, column) design to define the other n1− (p + g) row treatment factors (respectively, n2− (q + g) column treatment factors). Altogether we need to define (p + g−a)+(q +g −b) = g additional factors to serve as basic factors for the row and column designs. A lemma shows that each of the g blocking words is used to produce such a factor.

Lemma 1. Suppose no replication of the same level combination is allowed in both the row and column designs. If a < p + g (respectively, b < q + g), then each of the p + g− a (respectively, q + g − b) additional basic factors for the row (respectively, column) design is defined by a word of the form XY , where X involves some of the a row treatment factors only, Y involves some of the b column treatment factors only, and both X and Y involve at least one factor.

Furthermore, if XY defines a basic factor for the row design, then Y is a blocking word, and if it defines a basic factor for the column design, then X is a blocking word .

Proof. Each of the additional basic factors for the row and column designs is defined by a word that involves both row and column treatment factors; otherwise we would not be able to generate sp+g distinct row treatment factor combinations and sq+g distinct column treatment factor combinations. Write such a word in the form XY . Then in the case where XY defines a basic factor for the row design, the unit alias of Y must not involve any of C1, . . . , Cq . Furthermore, since Y is an interaction of the column treatment factors, its unit alias also does not involve any of R1, . . . ,Rp. Thus Y is a blocking word. A similar conclusion holds for the case in which XY defines a basic factor for the column design.

The conclusion of Lemma 1 has each additional basic factor for the row design defined by aliasing a row treatment interaction with a blocking word involving column treatment factors only. Likewise, each additional basic factor for the column design is defined by aliasing a column treatment interaction with a blocking word involving row treatment factors only. As a result, g independent defining words are created. Essentially this is equivalent to selecting sg of the s2g blocks in the product of a blocked row design and a blocked column design, as mentioned earlier.

(17)

Example 4. [Example 3 continued] Miller’s (1997) example involved six row treatment factors A, B, C, D, E, F and four column treatment factors S, T , U , V . (Note that Miller (1997) denoted the column treatment factors as a, b, c, and d, respectively.) A design key for the basic factors A, B, C, S, T was obtained in Example 3. We already have a set of three basic factors A, B, C for the row design; so only an additional basic factor, say U , is needed for the column design.

Since AC is the single blocking word for the basic design, by Lemma 1, we must define U by an interaction of the form ACX, where X is a factorial effect of S and T . Suppose we replace the two levels 0 and 1 with −1 and 1, respectively, and define U as ACS (another choice is−ACST ; ACT would give an isomorphic design). Then the defining word ACSU is introduced, so SU is also a blocking word. The design can be completed by choosing three independent interactions of A, B, and C to define D, E, and F , and one interaction of S, T , U to define V . Suppose D, E, and F are defined by D =−AB, E = ABC, F = −BC, and V is defined by V = ST U . Then we have the design key matrix.

K =

C1 C2 R1 R2 B

































1 0 0 0 0 S

0 1 0 0 0 T

0 0 1 0 0 A

0 0 0 1 0 B

0 0 1 0 1 C

0 0 1 1 0 D

0 0 0 1 1 E

0 0 1 1 1 F

1 0 0 0 1 U

0 1 0 0 1 V

.

The resulting design, which can be generated in a simple manner from the five columns of K, is the same as that constructed by Miller (1997) after C and D are switched.

Acknowledgement

We would like to thank an associate editor and the referee for their help- ful comments. Ching-Shui Cheng’s research was supported by National Science Foundation Grant No. DMS-0805722. Pi-Wen Tsai’s research was supported by Taiwan National Science Council Grant No. 99-2118-M-003-001-MY2. Part of the work was done when both authors were visiting the Isaac Newton Institute for Mathematical Sciences, whose support is acknowledged.

(18)

References

Bingham, D. R., Schoen, E. D. and Sitter, R. R. (2004). Designing fractional factorial split-plot experiments with few whole-plot factors. Appl. Statist. 53, 325-339.

Cheng, C. S. and Tsai, P. W. (2011). Multistratum fractional factorial designs. Statist. Sinica 21, 1001-1021.

Cotter, S. (1974). A general method of confounding for symmetrical factorial experiments. J.

Roy. Statist. Soc. Ser. B 36, 267–276.

Das, M. N. (1964). A somewhat alternative approach for construction of symmetrical factorial designs and obtaining maximum number of factors. Calcutta Statist. Assoc. Bull. 13, 1-17.

Hinkelmann, K. and Kempthorne, O. (2005). Design and Analysis of Experiments, Vol. 2. Wiley, New York.

McLeod, R. G. and Brewster, J. F. (2004). The design of blocked fractional factorial split-plot experiments. Technometrics 56, 135-146.

Miller, A. (1997). Strip-plot configurations of fractional factorials. Technometrics 39, 153-161.

Nelder, J. A. (1965a). The analysis of randomized experiments with orthogonal block structure.

I. block structure and the null analysis of variance. Proc. R. Soc. Lond. A 283, 147-162.

Nelder, J. A. (1965b). The analysis of randomized experiments with orthogonal block structure.

II. Treatment structure and the general analysis of variance. Proc. R. Soc. Lond. A 283, 163-178.

Patterson, H. D. (1965). The factorial combination of treatments in rotation experiments, J.

Agric. Sci. 65, 171-182.

Patterson, H. D. (1976). Generation of factorial designs. J. Roy. Statist. Soc. Ser. B 38, 175-179.

Patterson, H. D. and Bailey, R. A. (1978). Design keys for factorial experiments. Appl. Statist.

27, 335-355.

Department of Statistics, University of California, Berkeley, California 94720, USA.

E-mail: cheng@stat.berkeley.edu

Department of Mathematics, National Taiwan Normal University, Taipei 11677, Taiwan.

E-mail: pwtsai@math.ntnu.edu.tw

(Received March 2012; accepted February 2013)

參考文獻

相關文件

To do (9), you need to recall the exercise from hw 1 and hw 2 in Calculus I: (you do not need to turn in the following exercises) If you are not familiar with the exercises below,

The time complexity of flatten is Θ(n 2 ) (in the worst case), where n is the number of Tip nodes in the tree.... A simple observation shows that there are exactly n − 1 Bin

[r]

The Cauchy sequence {x n } converges but it does not converge in Q, so Q does not have completeness property.. Then f is uniformly contin- uous on

Describe the Galois group G(K/Q) by the fundamental theorem of finitely-generated abelian groups.. Show that the order of the Galois group G(E/Q)

The first typ e is the unsafe drivers, who disregard traffic regulations and make life difficult for other drivers and people walking in the street.. Unsafe drivers do

An n×n square is called an m–binary latin square if each row and column of it filled with exactly m “1”s and (n–m) “0”s. We are going to study the following question: Find

More precisely, it is the problem of partitioning a positive integer m into n positive integers such that any of the numbers is less than the sum of the remaining n − 1