Construction of Split-Plot Designs with General Minimum Lower Order Confounding

Abstract

Fractional factorial split-plot design has been widely used in many fields due to its advantage of saving experimental cost. The general minimum lower order confounding criterion is usually used as one of the attractive design criterion for selecting fractional factorial split-plot design. In this paper, we are interested in the theoretical construction methods of the optimal fractional factorial split-plot designs under the general minimum lower order confounding criterion. We present the theoretical construction methods of optimal fractional factorial split-plot designs under general minimum lower order confounding criterion under several conditions.

Share and Cite:

Li, K. , Han, B. and Niu, Z. (2023) Construction of Split-Plot Designs with General Minimum Lower Order Confounding. Open Journal of Applied Sciences, 13, 261-274. doi: 10.4236/ojapps.2023.133021.

1. Introduction

“Two-Level Regular Fractional Factorial (FF) Designs” is a class of widely used designs in practice. Such designs perform experimental runs in a completely random order. However, when there are some factors whose levels are difficult to change or control, it is infeasible to perform experimental runs in a completely random order. In these situations, the two-level regular fractional factorial split-plot (FFSP) designs are suitable choices. The FFSP design involves a two-stage randomization when performing experiments. First, randomly choose a level-setting of the hard-to-change factors, called whole plot (WP) factors, then under this level-setting, run all the level-settings of the relatively easy-to-change factors, called subplot (SP) factors, in a completely random order.

In recent years, much attention has been paid to the selection of optimal FFSP designs. Huang et al. [1] extended the minimum aberration (MA) criterion to FFSP designs and proposed the MA-FFSP criterion for selecting optimal regular two-level FFSP designs. Yang et al. [2] applied the MA criterion to multi-level FFSP designs. Tichon et al. [3] proposed the theoretical construction method of MA orthogonal split-plot designs. Zhao et al. [4] constructed MA-FFSP designs for the design scenarios considered in [5] via complementary designs. Mukerjee et al. [6] proposed a criterion of minimum secondary aberration (MSA), denoted as MA-MSA-FFSP criterion, for finding the optimal FFSP designs. Yang et al. [7] constructed the MA-MSA-FFSP designs under weak MA. Zhao et al. [8] studied the mixed-level FFSP designs with a four-level factor in WP section. Zhao et al. [9] proposed the mixed-level FFSP designs with a four-level factor in SP section. Yang et al. [10] proposed a method to find the optimal FFSP designs based on clear effect criterion. Zi et al. [11] conducted a further study based on clear effect criterion. Han et al. [12] investigated the conditions for FFSP designs with two-level factors and a 2 t -level factors containing various clear effects. Han et al. [13] proposed the conditions for FFSP designs with s-level factors and an s t -level factors containing various clear effects. Based on the principle of the effect hierarchy (see [14] ), Zhang et al. [15] introduced aliased effect number patterns and proposed a general minimum lower order confounding (GMC) criterion for finding the optimal FF designs. Wei et al. [16] proposed GMC-FFSP criterion for finding the optimal FFSP designs and found some GMC-FFSP designs by computer search. However, when the number of factors is large, it is usually infeasible to search GMC-FFSP design by computer.

Although it has been noted that the GMC-FFSP designs have a wide range of applications, in addition to the research of Han et al. [17] , there are only primitive studies on the theoretical constructions of the GMC-FFSP designs. In this paper, we propose theoretical construction methods of some 2 ( n 1 + n 2 ) ( m 1 + m 2 ) GMC-FFSP designs with 9 N / 32 + 1 n 1 + n 2 5 N / 16 , where N = 2 ( n 1 + n 2 ) ( m 1 + m 2 ) and the notation 2 ( n 1 + n 2 ) ( m 1 + m 2 ) will be introduced in Section 2.

The rest of the paper is organized as follows. In Section 2, we review the GMC criterion and the SOS design, which play an important role in the later theorems, and introduce some notations that we will use later in the paper. Section 3 gives the construction methods of some GMC-FFSP designs. The concluding remarks are included in Section 4.

2. Preliminaries

We usually use the notation 2 ( n 1 + n 2 ) ( m 1 + m 2 ) FFSP to denote a two-level regular FFSP design of n 1 WP factors and n 2 SP factors, which is determined by m 1 WP defining words and m 2 SP defining words. For a 2 ( n 1 + n 2 ) ( m 1 + m 2 ) FFSP design, a defining word is called a WP defining word if it does not contain any SP factors, and a defining word is called a SP defining word if it contains at least one SP factor. Huang et al. [1] pointed out that a necessary condition of the 2 ( n 1 + n 2 ) ( m 1 + m 2 ) FFSP designs is that the SP definition words are allowed to contain any number of WP factors, but the SP definition words are not allowed to contain only one SP factor, otherwise the split-plot structure of the 2 ( n 1 + n 2 ) ( m 1 + m 2 ) FFSP designs will be destroyed. We refer to the effects that contain only WP factors as WP-type effects, and the effects that contain at least one SP factor as SP-type effects. An alias set is called an alias set of WP-type if it contains at least one WP-type effect, otherwise, it is called an alias set of SP-type.

For the 2 ( n 1 + n 2 ) ( m 1 + m 2 ) FFSP designs, let C i ( s ) # ( w ) ( 0 ) denotes the number of i-factors interaction effects of SP-type which are not in any WP-type alias set and C i ( s ) # ( w ) ( 1 ) denotes the number of i-factors interaction effects of SP-type which are in WP-type alias sets. Considering the split-plot structure of the 2 ( n 1 + n 2 ) ( m 1 + m 2 ) FFSP designs, there must be C 1 ( s ) # ( w ) ( 0 ) = n 2 . For a given 2 ( n 1 + n 2 ) ( m 1 + m 2 ) FFSP design, let C i # j ( k ) denotes the number of its i-factors interaction effects aliased with

its k j-factors interaction effects, where i , j = 1 , , n , k = 0 , 1 , , K j and K j = ( n j ) . Based on the principle of the effect hierarchy, and the assumption

that the effects which involve three or more factors are negligible, a 2 ( n 1 + n 2 ) ( m 1 + m 2 ) FFSP design is called a GMC-FFSP design if it can sequentially maximize

C # s p = ( C 1 ( s ) # ( w ) ( 0 ) = n 2 , C 1 # 2 , C 2 # 2 , C 2 ( s ) # ( w ) ( 0 ) ) , (1)

where C 1 # 2 = ( C 1 # 2 ( 0 ) , C 1 # 2 ( 1 ) , , C 1 # 2 ( K 2 ) ) and C 2 # 2 = ( C 2 # 2 ( 0 ) , C 2 # 2 ( 1 ) , , C 2 # 2 ( K 2 ) ) .

For the convenience of presenting this work, the two-factors interactions (2fis) in the split-plot designs are divided into three categories:

1) The 2fi which involves two WP factors is called a WP-2fi;

2) The 2fi which involves two SP factors is called an SP-2fi;

3) The 2fi which involves one WP factor and one SP factor is called a WS-2fi.

Obviously, both SP-2fi and WS-2fi are SP-type 2fis.

In order to derive the construction methods in this paper, we first review some theories on GMC-FF designs which play an important role. We use the notation 2 n m FF to denote an FF design with n factors, determined by m defining words. Note that a 2 ( n 1 + n 2 ) ( m 1 + m 2 ) FFSP design is a 2 n m FF design which has split-plot structure, where n = n 1 + n 2 and m = m 1 + m 2 . Therefore the notation C 1 # 2 and C 1 # 2 are also applicable to 2 n m FF designs. A 2 n m FF design is called a GMC-FF design if it can sequentially maximize

C # = ( C 1 # 2 , C 2 # 2 ) (2)

among all the 2 n m designs.

Chen et al. [18] and Xu et al. [19] introduced some results on the double theory in detail. In Zhang et al. [20] , the double theory was employed to derive theoretical construction methods of the 2 n m GMC-FF designs. In the following, we briefly introduce some knowledge on double theory as it is helpful to derive the construction methods of 2 ( n 1 + n 2 ) ( m 1 + m 2 ) GMC-FFSP designs in this work. Let X be an r × l matrix consisting only of elements 1 and −1. Let α 0 = ( 1,1 ) , α 1 = ( 1, 1 ) and D ( X ) = ( α 0 , α 1 ) X , then D ( X ) is a 2 r × 2 l matrix obtained from X after a double, where denotes the Kronecker product. Then

D t ( X ) = ( α 0 , α 1 ) ( α 0 , α 1 ) ( α 0 , α 1 ) t times X

is a 2 t r × 2 t l matrix obtained by X after t times double. In particular, when X = 1

D t ( 1 ) = ( I , 1 , 2 , 1 2 , , 1 2 t ) ,

is a 2 t × 2 t matrix, where I = ( 1, ,1 ) with 1 being repeated 2 t times; 1 = ( 1, 1, ,1, 1 ) with every 1 followed by a −1, being repeated 2 t 1 times; 2 = ( 1,1, 1, 1, ,1,1, 1, 1 ) with every two consecutive 1’s followed by two −1’s, being repeated 2 t 2 times, ..., t = ( 1,1, ,1, 1, 1, , 1 ) with 2 t 1 consecutive 1’s followed by 2 t 1 −1’s. 1 2 is the componentwise product of vectors 1 and 2 , 1 2 t is the componentwise product of vectors 1 , 2 , , t . Hereafter, let D t ( ) = D t ( 1 ) \ I , where I belongs to D t ( 1 ) . Let X = ( b 1 , b 2 , , b l ) , then D t ( X ) can be expressed as

D t ( X ) = D t ( 1 ) X = ( I b 1 , , I b l ; 1 b 1 , , 1 b l ; 2 b 1 , , 2 b l ; 1 2 b 1 , , 1 2 b l ; ; 1 2 t b 1 , , 1 2 t b l ) .

Suppose j 1 b 1 , j 2 b 2 , , j k b k are k columns from D t ( X ) with j 1 , j 2 , , j k belonging to D t ( 1 ) and b 1 , b 2 , , b k belonging to X , then ( j 1 b 1 ) ( j 2 b 2 ) ( j k b k ) = ( j 1 j 2 j k ) ( b 1 b 2 b k ) .

Let T = ( T W , T S ) , where T W = ( w 1 , w 2 , , w q 1 , w q 1 + 1 , w q 1 + 2 , , w n 1 ) denotes the set of WP factors, T S = ( s 1 , s 2 , , s q 2 , s q 2 + 1 , s q 2 + 2 , , s n 2 ) denotes the set of SP factors, where w 1 , w 2 , , w q 1 are q 1 independent WP factors, s 1 , s 2 , , s q 2 are q 2 independent SP factors, q 1 = n 1 m 1 and q 2 = n 2 m 2 . Since the n factors are assigned to n columns in D q ( ) , we do not differentiate between factors and columns hereafter. Let q = q 1 + q 2 , Yang et al. [10] pointed out that if and only if

{ T W H w , T S H \ H w and | T W | = n 1 , | T S | = n 2 , (3)

then T = ( T W , T S ) is a 2 ( n 1 + n 2 ) ( m 1 + m 2 ) FFSP design, where | | denotes the number of columns in a design or set, H w = H ( w 1 , w 2 , , w q 1 ) is a closed set generated by the q 1 independent columns w 1 , w 2 , , w q 1 from D q ( ) , and H is a closed set generated by any q independent columns of D q ( ) . To construct a 2 ( n 1 + n 2 ) ( m 1 + m 2 ) GMC-FFSP design is equivalent to choosing T = ( T W , T S ) from D q ( ) such that T can sequentially maximize (1).

A 2 ( n 1 + n 2 ) ( m 1 + m 2 ) FFSP design is said to have a resolution of R if this design has no c-factors interaction that is aliased with any other interactions which involve fewer than R c factors. For a resolution III 2 ( n 1 + n 2 ) ( m 1 + m 2 ) FFSP design, there is at least one main effect aliased with one 2fi. For a resolution IV 2 ( n 1 + n 2 ) ( m 1 + m 2 ) FFSP design, there is no main effect aliased with 2fi. Unless otherwise stated, the 2 ( n 1 + n 2 ) ( m 1 + m 2 ) FFSP designs mentioned in the following are of resolution IV. Note that a 2 ( n 1 + n 2 ) ( m 1 + m 2 ) FFSP design of resolution IV must sequentially maximize C 1 # 2 as it has C 1 # 2 ( 0 ) = n , where n = n 1 + n 2 . According to Zhang et al. [20] , when 9 N / 32 + 1 n 5 N / 16 , a 2 n m FF design must belong to the unique second order saturate (SOS) design of N = 2 n m runs and 5N/16 factors, denoted as S ( 5 N / 16 ) . A 2 n m FF design is called an SOS design if its degree of freedoms is all used to estimate the main effects and 2fis, see Block et al. [21] for more details on the SOS designs. In addition, the SOS design is also widely used in the field of biology, see [22] . Note that the 2 ( n 1 + n 2 ) ( m 1 + m 2 ) FFSP design can be regarded as a 2 n m FF design which has split-plot structure. Therefore, the 2 ( n 1 + n 2 ) ( m 1 + m 2 ) FFSP designs of resolution IV must belong to S ( 5 N / 16 ) . Let X 1 = ( b 1 , b 2 , b 3 , b 4 , b 5 ) be a 2 5 1 design with I = b 1 b 2 b 3 b 4 b 5 and b i D 4 ( 1 ) for i = 1 , 2 , 3 , 4 , 5 , then the unique SOS design S ( 5 N / 16 ) can be expressed as

S ( 5 N / 16 ) = D q 4 ( X 1 ) = ( D q 4 ( b 1 ) , D q 4 ( b 2 ) , D q 4 ( b 3 ) , D q 4 ( b 4 ) , D q 4 ( b 5 ) ) , (4)

where D q 4 ( b i ) = ( I , 1 , 2 , 1 2 , , 1 2 ( q 4 ) ) b i for i = 1 , 2 , , 5 , and I , 1 , 2 , 1 2 , , 1 2 ( q 4 ) D q 4 ( 1 ) .

With the discussions above, we obtain that choosing T from D q ( ) reduces to choose T from S ( 5 N / 16 ) , such that the expression (1) can be sequentially maximized. In the next section, we give the theoretical construction methods of some 2 ( n 1 + n 2 ) ( m 1 + m 2 ) GMC-FFSP designs T = ( T W , T S ) with 9 N / 32 + 1 n 5 N / 16 .

3. Construction Methods of 2 ( n 1 + n 2 ) ( m 1 + m 2 ) GMC-FFSP Designs

Wei et al. [16] pointed out that a 2 ( n 1 + n 2 ) ( m 1 + m 2 ) FFSP design has

C i ( s ) # ( w ) ( 0 ) + C i ( s ) # ( w ) ( 1 ) = l = 1 i ( n 2 l ) ( n 1 i l ) . (5)

According to Equation (5), we obtain the lemma below.

Lemma 1. For a 2 ( n 1 + n 2 ) ( m 1 + m 2 ) FFSP design, there exists

C 2 ( s ) # ( w ) ( 0 ) + C 2 ( s ) # ( w ) ( 1 ) = n 1 n 2 + ( n 2 2 ) . (6)

Obviously, it is easy to draw from equation (6) that maximizing C 2 ( s ) # ( w ) ( 0 ) is equivalent to minimizing C 2 ( s ) # ( w ) ( 1 ) for a 2 ( n 1 + n 2 ) ( m 1 + m 2 ) FFSP design. Since the 2 ( n 1 + n 2 ) ( m 1 + m 2 ) FFSP designs do not allow defining words which contain only one SP factor, thus no WS-2fi is aliased with any WP-2fi meaning that

C 2 ( s ) # ( w ) ( 0 ) n 1 n 2 and C 2 ( s ) # ( w ) ( 1 ) ( n 2 2 ) . As has been discussed, if T can sequentially maximize expression (1), then T S 5 N / 16 . We denote T ¯ = S ( 5 N / 16 ) \ T .

3.1. Construction Methods of 2 ( n 1 + n 2 ) ( m 1 + m 2 ) GMC-FFSP Designs with n 1 = 1 and m 1 = 0

In this section, we consider constructing 2 ( n 1 + n 2 ) ( m 1 + m 2 ) GMC-FFSP designs with n 1 = 1 and m 1 = 0 .

Lemma 2. Suppose n 1 = 1 and m 1 = 0 , then any 2 ( n 1 + n 2 ) ( m 1 + m 2 ) FFSP designs T = ( T W , T S ) of resolution IV must have C 2 ( s ) # ( w ) ( 0 ) ( T ) = n 1 n 2 + ( n 2 2 ) .

Proof. If n 1 = 1 and m 1 = 0 , then the 2 ( n 1 + n 2 ) ( m 1 + m 2 ) FFSP design has no WP defining words. Clearly, C 2 ( s ) # ( w ) ( 1 ) ( T ) = 0 implying that C 2 ( s ) # ( w ) ( 0 ) ( T ) = n 1 n 2 + ( n 2 2 ) . This completes the proof.

Zhang et al. [20] gave the construction methods of GMC-FF designs for 9 N / 32 + 1 n 5 N / 16 as stated in Lemma 3.

Lemma 3. Up to isomorphism, the GMC 2 n m designs with 9 N / 32 + 1 n 5 N / 16 uniquely consist of the last n columns of S ( 5 N / 16 ) .

As aforementioned, a 2 ( n 1 + n 2 ) ( m 1 + m 2 ) FFSP design can be regarded as a 2 n m design that satisfies the split-plot structure. From Lemma 3, if a 2 ( n 1 + n 2 ) ( m 1 + m 2 ) FFSP design consists of the last n columns of S ( 5 N / 16 ) , then this design can sequentially maximize of ( C 1 # 2 , C 2 # 2 ) among all the 2 ( n 1 + n 2 ) ( m 1 + m 2 ) FFSP designs. Let L denote the set which consists of the last n columns in S ( 5 N / 16 ) and L ¯ = S ( 5 N / 16 ) \ L . With Lemma 2 and Lemma 3, we immediately obtain the construction methods of 2 ( n 1 + n 2 ) ( m 1 + m 2 ) GMC-FFSP designs with n 1 = 1 and m 1 = 0 .

Theorem 1. Suppose n 1 = 1 and m 1 = 0 , then the design T = ( T W , T S ) with T W = H w L and T S = L \ T W is a 2 ( n 1 + n 2 ) ( m 1 + m 2 ) GMC-FFSP design.

Proof. Since T W = H w L and T S = L \ T W , then T W H w and T S H \ H w , where H w = H ( w 1 ) . Therefore, T is a 2 ( n 1 + n 2 ) ( m 1 + m 2 ) FFSP design, i.e., C 1 ( s ) # ( w ) ( 0 ) ( T ) = n 2 .

Note that T consists of the last n columns of S ( 5 N / 16 ) , then, according to Lemma 3, we obtain that ( C 1 # 2 , C 2 # 2 ) can be sequentially maximized. According

to Lemma 2, for any T with n 1 = 1 , there exists C 2 ( s ) # ( w ) ( 1 ) ( T ) = ( n 2 2 ) + n 1 n 2 .

Therefore, the design T = ( T W , T S ) is a 2 ( n 1 + n 2 ) ( m 1 + m 2 ) GMC-FFSP design. This completes the proof.

Example 1 below illustrates the applications of Theorem 1.

Example 1. Consider constructing a 2 ( 1 + 9 ) ( 0 + 5 ) GMC-FFSP design T = ( T W , T S ) . Since q = ( n 1 + n 2 ) ( m 1 + m 2 ) = 5 , then

S ( 5 N / 16 ) = D 1 ( X 1 ) = ( I b 1 , 1 b 1 , I b 2 , 1 b 2 , I b 3 , 1 b 3 , I b 4 , 1 b 4 , I b 5 , 1 b 5 ) , where

both I and 1 are from D 1 ( 1 ) . Note that n = 10 , then L = S ( 5 N / 16 ) . Let w 1 = I b 2 be the q 1 = 1 WP column. Then H w = H ( I b 2 ) = I b 2 . It is obtained that T W = H w L = I b 2 and T S = L \ T W = ( I b 1 , 1 b 1 , 1 b 2 , I b 3 , 1 b 3 , I b 4 , 1 b 4 , I b 5 , 1 b 5 ) . According to Theorem 1, design T = ( T W , T S ) is a 2 ( 1 + 9 ) ( 0 + 5 ) GMC-FFSP design.

3.2. Construction Methods of 2 ( n 1 + n 2 ) ( m 1 + m 2 ) GMC-FFSP Designs with m 2 = n 2 1

In this section, we consider constructing 2 ( n 1 + n 2 ) ( m 1 + m 2 ) GMC-FFSP designs with m 2 = n 2 1 .

Lemma 4. The 2 ( n 1 + n 2 ) ( m 1 + m 2 ) FFSP designs T = ( T W , T S ) of resolution IV with m 2 = n 2 1 must have C 2 ( s ) # ( w ) ( 0 ) ( T ) = n 1 n 2 .

Proof. Since m 2 = n 2 1 , we can obtain q 2 = 1 meaning that there is only one independent SP factor denoted as s 1 . Therefore, the non-independent SP factors s 2 , s 3 , , s n 2 can all be represented via s i = w j 1 w j 2 w j k s 1 , where i = 2 , , n 2 , j 1 , j 2 , , j k = 1 , 2 , , q 1 and j 1 , j 2 , , j k are mutually different. Therefore, any SP-2fi is aliased with WP-type effects. There are ( n 2 2 ) SP-2fis, so the C 2 ( s ) # ( w ) ( 1 ) ( T ) ( n 2 2 ) . According to Lemma 1, we know C 2 ( s ) # ( w ) ( 1 ) ( T ) ( n 2 2 ) . Therefore, there exists C 2 ( s ) # ( w ) ( 1 ) ( T ) = ( n 2 2 ) implying that any 2 ( n 1 + n 2 ) ( m 1 + m 2 ) FFSP design T = ( T W , T S ) with m 2 = n 2 1 has C 2 ( s ) # ( w ) ( 0 ) ( T ) = n 1 n 2 . This completes proof.

With Lemma 3 and Lemma 4, we immediately obtain the construction methods of 2 ( n 1 + n 2 ) ( m 1 + m 2 ) GMC-FFSP designs with m 2 = n 2 1 .

Theorem 2. Suppose m 2 = n 2 1 , then the design T = ( T W , T S ) with T W = H w L and T S = L \ T W is a 2 ( n 1 + n 2 ) ( m 1 + m 2 ) GMC-FFSP design.

Proof. Since T W = H w L and T S = L \ T W , then T W H w and T S H \ H w , where H w = H ( w 1 , w 2 , , w q 1 ) . Therefore, T is a 2 ( n 1 + n 2 ) ( m 1 + m 2 ) FFSP design, i.e., C 1 ( s ) # ( w ) ( 0 ) ( T ) = n 2 .

According to formula (6) and Lemma 4, it is obtained that T maximizes C 2 ( s ) # ( w ) ( 0 ) . By noting that T consists of the last n columns of S ( 5 N / 16 ) , we have that T sequentially maximizes (1). This completes the proof.

Example 2 below illustrates the applications of Theorem 2.

Example 2. Consider constructing a 2 ( 6 + 4 ) ( 2 + 3 ) GMC-FFSP design T = ( T W , T S ) . Since q = ( n 1 + n 2 ) ( m 1 + m 2 ) = 5 , then

S ( 5 N / 16 ) = D 1 ( X 1 ) = ( I b 1 , 1 b 1 , I b 2 , 1 b 2 , I b 3 , 1 b 3 , I b 4 , 1 b 4 , I b 5 , 1 b 5 ) , where

both I and 1 are from D 1 ( 1 ) . Note that n = 10 , then L = S ( 5 N / 16 ) . Let w 1 = I b 3 , w 2 = I b 4 , w 3 = I b 5 and w 4 = 1 b 5 be the q 1 = 4 WP columns. Then

H w = H ( I b 3 , I b 4 , I b 5 , 1 b 5 ) = ( I b 3 , I b 4 , I b 5 , 1 b 5 , I b 3 b 4 , I b 3 b 5 , 1 b 3 b 5 , I b 4 b 5 , 1 b 4 b 5 , 1 I , I b 3 b 4 b 5 , 1 b 3 b 4 b 5 , 1 b 3 , 1 b 4 , 1 b 3 b 4 ) . It is obtained that T W = H w L = ( I b 3 , I b 4 , I b 5 , 1 b 5 , 1 b 3 , 1 b 4 ) and T S = L \ T W = ( I b 1 , 1 b 1 , I b 2 , 1 b 2 ) . According to Theorem 2, the design T = ( T W , T S ) is a 2 ( 6 + 4 ) ( 2 + 3 ) GMC-FFSP design.

3.3. Construction Methods of 2 ( n 1 + n 2 ) ( m 1 + m 2 ) GMC-FFSP Designs with n 1 = 2 and m 1 = 0

In this section, we consider constructing 2 ( n 1 + n 2 ) ( m 1 + m 2 ) GMC-FFSP designs with n 1 = 2 and m 1 = 0 .

Lemma 5. Suppose n 1 = 2 and m 1 = 0 , any 2 ( n 1 + n 2 ) ( m 1 + m 2 ) FFSP design T = ( T W , T S ) with T S ( 5 N / 16 ) has

C 2 ( s ) # ( w ) ( 1 ) ( T ) n 2 q 2 1. (7)

Further more, when w 1 D q 4 ( b i ) , w 2 D q 4 ( b j ) and T ¯ D q 4 ( b i ) \ w 1 or D q 4 ( b j ) \ w 2 , the equality in (7) holds, where i , j = 1 , 2 , 3 , 4 , 5 and i j .

Proof. When n 1 = 2 and m 1 = 0 , there are only three WP effects w 1 , w 2 , w 1 w 2 . Since T has resolution IV, thus there is no SP-type 2fi which is aliased with w 1 or w 2 . Next, we explore the number of SP-type 2fis which are aliased with w 1 w 2 .

There are two different ways of choosing T W = ( w 1 , w 2 ) from S ( 5 N / 16 ) :

1) both w 1 and w 2 are from D q 4 ( b i ) , where i = 1 , 2 , 3 , 4 , 5 ,

2) w 1 D q 4 ( b i ) and w 2 D q 4 ( b j ) , where i , j = 1 , 2 , 3 , 4 , 5 and i j .

For (1). Without loss of generality, we suppose both w 1 and w 2 are from D q 4 ( b 1 ) . Denote w 1 = a 1 b 1 and w 2 = a 2 b 1 , where a 1 , a 2 D q 4 ( 1 ) and a 1 a 2 . Then, we have w 1 w 2 = a 1 a 2 I , where a 1 a 2 D q 4 ( 1 ) and I D 4 ( 1 ) . By carefully checking, we can obtain that there are 2 q 4 / 2 column-pairs, say ( c 1 b k , c 2 b k ) ’s, in D q 4 ( b k ) , such that ( c 1 b k ) ( c 2 b k ) = a 1 a 2 I , where k = 1,2,3,4,5 . Therefore, S ( 5 N / 16 ) in total 5 2 q 4 / 2 column-pairs ( c 1 b k , c 2 b k ) ’s that satisfy ( c 1 b k ) ( c 2 b k ) = a 1 a 2 I . Let n ¯ denote the number of columns in T ¯ , where n ¯ = 5 2 q 4 n and 0 n ¯ 2 q 5 1 . Consider deleting n ¯ columns from S ( 5 N / 16 ) to obtain T = ( T W , T S ) with T W = ( w 1 , w 2 ) . By doing so, we obtain that the number of SP-type 2fis, in T , which are aliased with w 1 w 2 is equal or larger than 5 2 q 4 / 2 n ¯ 1 = n 5 2 q 5 1 , where the equality holds if T ¯ shares only one column with each of any n ¯ column-pairs ( c 1 b k , c 2 b k ) ’s, except for w 1 and w 2 .

For (2). Without loss of generality, we suppose w 1 D q 4 ( b 1 ) and w 2 D q 4 ( b 2 ) . Denote w 1 = a 1 b 1 and w 2 = a 2 b 2 , where a 1 , a 2 D q 4 ( 1 ) . Then, we have w 1 w 2 = a 1 a 2 b 1 b 2 , where a 1 a 2 D q 4 ( 1 ) . In S ( 5 N / 16 ) , for each column in D q 4 ( b 1 ) , say c 3 b 1 , we can always find a column from D q 4 ( b 2 ) , say c 4 b 2 , such that ( c 3 b 1 ) ( c 4 b 2 ) = ( a 1 b 1 ) ( a 2 b 2 ) = w 1 w 2 . Therefore, there are a total of 2 q 4 1 SP-type 2fis aliased with w 1 w 2 . Consider deleting n ¯ columns from S ( 5 N / 16 ) to obtain T with T W = ( w 1 , w 2 ) . By doing so, we obtain that the number of SP-type 2fis, in T , which are aliased with w 1 w 2 is equal or larger than 2 q 4 n ¯ 1 = n 2 q 2 1 , where the equality holds if T ¯ D q 4 ( b 1 ) \ w 1 or T ¯ D q 4 ( b 2 ) \ w 2 .

Obviously, n 5 2 q 5 1 > n 2 q 2 1 . Therefore, we obtain that C 2 ( s ) # ( w ) ( 1 ) ( T ) n 2 q 2 1 . When n 1 = 2 and m 1 = 0 , any 2 ( n 1 + n 2 ) ( m 1 + m 2 ) FFSP design T = ( T W , T S ) with T S ( 5 N / 16 ) has C 2 ( s ) # ( w ) ( 1 ) ( T ) n 2 q 2 1 . Further more, when w 1 D q 4 ( b i ) , w 2 D q 4 ( b j ) and T ¯ D q 4 ( b i ) \ w 1 or D q 4 ( b j ) \ w 2 , the equality holds, where i , j = 1 , 2 , 3 , 4 , 5 and i j .

This completes the proof.

With Lemma 3 and Lemma 5, we immediately obtain the construction methods of 2 ( n 1 + n 2 ) ( m 1 + m 2 ) GMC-FFSP designs with n 1 = 2 and m 1 = 0 .

Theorem 3 Suppose n 1 = 2 and m 1 = 0 , then the design T = ( T W , T S ) with T W = H w L and T S = L \ T W is a 2 ( n 1 + n 2 ) ( m 1 + m 2 ) GMC-FFSP design, where w 1 D q 4 ( b 1 ) L , w 2 D q 4 ( b i ) and i = 2,3,4 or 5.

Proof. Since T W = H w L and T S = L \ T W , then T W H w and T S H \ H w , where H w = H ( w 1 , w 2 ) . Therefore, T is a 2 ( n 1 + n 2 ) ( m 1 + m 2 ) FFSP design, i.e., C 1 ( s ) # ( w ) ( 0 ) ( T ) = n 2 .

Because w 1 D q 4 ( b 1 ) , w 2 D q 4 ( b i ) and T ¯ D q 4 ( b 1 ) \ w 1 , according to Lemma 5, we obtain that C 2 ( s ) # ( w ) ( 1 ) ( T ) = n 2 q 2 1 , i.e., C 2 ( s ) # ( w ) ( 0 ) ( T ) is maximized, where i = 2,3,4,5 . By noting that T consists of the last n columns of S ( 5 N / 16 ) , we have that T sequentially maximizes (1). This completes the proof.

Example 3 below illustrates the applications of Theorem 3.

Example 3. Consider constructing a 2 ( 2 + 17 ) ( 0 + 13 ) GMC-FFSP design T = ( T W , T S ) . Since q = ( n 1 + n 2 ) ( m 1 + m 2 ) = 6 , then

S ( 5 N / 16 ) = D 2 ( X 1 ) = ( I b 1 , 1 b 1 , 2 b 1 , 1 2 b 1 , I b 2 , 1 b 2 , 2 b 2 , 1 2 b 2 , I b 3 , 1 b 3 , 2 b 3 , 1 2 b 3 , I b 4 , 1 b 4 , 2 b 4 , 1 2 b 4 , I b 5 , 1 b 5 , 2 b 5 , 1 2 b 5 ) ,

where I , 1 , 2 and 1 2 are from D 2 ( 1 ) . Note that n = 19 , then L = S ( 5 N / 16 ) \ I b 1 . Let w 1 = 1 b 1 and w 2 = I b 2 be the q 1 = 2 independent WP columns. Then

H w = H ( 1 b 1 , I b 2 ) = ( 1 b 1 , I b 2 , 1 b 1 b 2 ) . It is obtained that T W = H w L = ( 1 b 1 , I b 2 ) and T S = L \ T W = ( 2 b 1 , 1 2 b 1 , 1 b 2 , 2 b 2 , 1 2 b 2 , I b 3 , 1 b 3 , 2 b 3 , 1 2 b 3 , I b 4 , 1 b 4 , 2 b 4 , 1 2 b 4 , I b 5 , 1 b 5 , 2 b 5 , 1 2 b 5 ) .

According to Theorem 3, the design T = ( T W , T S ) is a 2 ( 2 + 17 ) ( 0 + 13 ) GMC-FFSP design.

3.4. Construction Methods of 2 ( n 1 + n 2 ) ( m 1 + m 2 ) GMC-FFSP Designs with n 1 = 3 and m 1 = 0

In this section, we consider constructing 2 ( n 1 + n 2 ) ( m 1 + m 2 ) GMC-FFSP designs with n 1 = 3 and m 1 = 0 .

Lemma 6. Suppose n 1 = 3 and m 1 = 0 , any 2 ( n 1 + n 2 ) ( m 1 + m 2 ) FFSP design T = ( T W , T S ) with T S ( 5 N / 16 ) has

C 2 ( s ) # ( w ) ( 1 ) ( T ) 2 n 3 2 q 3 3. (8)

Further more, when w 1 D q 4 ( b i ) , w 2 D q 4 ( b j ) , w 3 D q 4 ( b k ) and T ¯ D q 4 ( b i ) \ w 1 , D q 4 ( b j ) \ w 2 or D q 4 ( b k ) \ w 3 , the equality in (8) holds, where i , j , k = 1,2,3,4,5 and are not equal to each other.

Proof. When n 1 = 3 and m 1 = 0 , we have q 1 = 3 , i.e., there are only three WP factors and they are independent of each other. There are seven WP-type effects w 1 , w 2 , w 3 , w 1 w 2 , w 1 w 3 , w 2 w 3 and w 1 w 2 w 3 in T . Note that T S ( 5 N / 16 ) has resolution IV which implies that no SP-type 2fi is aliased with w 1 , w 2 or w 3 . Therefore, calculating C 2 ( s ) # ( w ) ( 1 ) is equivalent to calculating the number of SP-type 2fis aliased with effects w 1 w 2 , w 1 w 3 , w 2 w 3 and w 1 w 2 w 3 . There are three different ways of choosing T W = ( w 1 , w 2 , w 3 ) from S 5 N / 16 :

1) w 1 , w 2 and w 3 are from D q 4 ( b i ) , where w 1 w 2 w 3 T , otherwise an SP factor will be aliased with w 1 w 2 w 3 which is not allowed, and i = 1,2,3,4 or 5.

2) both w 1 and w 2 are from D q 4 ( b i ) , w 3 D q 4 ( b j ) , where w 1 w 2 w 3 T , otherwise a SP factor will be aliased with w 1 w 2 w 3 which is not allowed, and i , j = 1,2,3,4 or 5 and i j .

3) w 1 D q 4 ( b i ) , w 2 D q 4 ( b j ) and w 3 D q 4 ( b k ) , where i , j , k = 1,2,3,4 or 5 and are not equal to each other.

Next, we explore the minimum values of C 2 ( s ) # ( w ) ( 1 ) ( T ) in cases (1), (2) and (3) respectively.

For (1). Without loss of generality, we suppose w 1 , w 2 and w 3 are from D q 4 ( b 1 ) . Denote w 1 = a 1 b 1 , w 2 = a 2 b 1 , w 3 = a 3 b 1 and w 1 w 2 w 3 T , where a 1 , a 2 , a 3 D q 4 ( 1 ) and are not equal to each other. There are 2 q 4 / 2 column-pairs ( c 1 b i , c 2 b i ) ’s in D q 4 ( b i ) such that ( c 1 b i ) ( c 2 b i ) = a 1 a 2 I for i = 1,2,3,4 and 5, respectively, where I is from D 4 ( 1 ) . This indicates that there are a total of 5 2 q 4 / 2 column-pairs ( c 1 b i , c 2 b i ) ’s in S 5 N / 16 such that ( c 1 b i ) ( c 2 b i ) = a 1 a 2 I , where i = 1,2,3,4,5 . Similarly, there are a total of 5 2 q 4 / 2 column-pairs ( c 3 b i , c 4 b i ) ’s in S 5 N / 16 such that ( c 3 b i ) ( c 4 b i ) = a 1 a 3 I , and there are a total of 5 2 q 4 / 2 column-pairs ( c 5 b i , c 6 b i ) ’s in S 5 N / 16 such that ( c 5 b i ) ( c 6 b i ) = a 2 a 3 I , where i = 1,2,3,4,5 and I is from D 4 ( 1 ) . Consider deleting n ¯ columns from S 5 N / 16 to obtain T such that C 2 ( s ) # ( w ) ( 1 ) ( T ) is the smaller the possible. With a similar discussion to the proofs of (1) in Lemma 5, we know that if the deleted n ¯ columns, i.e., T ¯ , consist of only one column of each of any n ¯ column-pairs ( c 1 b i , c 2 b i ) ’s (which are related to w 1 w 2 ), then there are 5 2 q 4 / 2 n ¯ 1 SP-type 2fis in T which are aliased with w 1 w 2 . This is always the case for w 1 w 3 and w 2 w 3 . Note that no 2fi in T is aliased with w 1 w 2 w 3 due to T S 5 N / 16 and w 1 , w 2 , w 3 D q 4 ( 1 ) . Therefore, C 2 ( s ) # ( w ) ( 1 ) ( T ) 3 ( 5 2 q 4 / 2 n ¯ 1 ) = 3 n 15 2 q 5 3 . The equality holds if any two columns of T ¯ are not in the same column-pairs ( c 1 b i , c 2 b i ) ’s, ( c 3 b i , c 4 b i ) ’s or ( c 5 b i , c 6 b i ) ’s, where i = 1,2,3,4,5 .

For (2). Without loss of generality, we suppose w 1 , w 2 D q 4 ( b 1 ) and w 3 D q 4 ( b 2 ) . Denote w 1 = a 1 b 1 , w 2 = a 2 b 1 , w 3 = a 3 b 2 and w 1 w 2 w 3 T , where a 1 , a 2 , a 3 D q 4 ( 1 ) and a 1 a 2 . With a similar discussion to the proofs for (1) and the proofs of (2) in Lemma 5, we conclude that C 2 ( s ) # ( w ) ( 1 ) ( T ) 3 n 21 2 q 5 3 by noting that no 2fi in T is aliased with w 1 w 2 w 3 . The equality holds if T ¯ D q 4 ( b 1 ) \ ( w 1 , w 2 ) or T ¯ D q 4 ( b 2 ) \ w 3 and any two columns of T ¯ are not in the same column-pairs ( c 1 b i , c 2 b i ) ’s that satisfy ( c 1 b i ) ( c 2 b i ) = a 1 a 2 I , where i = 1,2,3,4,5 and I is from D 4 ( 1 ) .

For (3). Without loss of generality, we suppose w 1 D q 4 ( b 1 ) , w 2 D q 4 ( b 2 ) and w 3 D q 4 ( b 3 ) . Denote w 1 = a 1 b 1 , w 2 = a 2 b 2 and w 3 = a 3 b 3 , where a 1 , a 2 and a 3 are from D q 4 ( 1 ) . There are 2 q 4 column-pairs ( c 1 b 1 , c 2 b 2 ) ’s in S ( 5 N / 16 ) such that ( c 1 b 1 ) ( c 2 b 2 ) = a 1 a 2 b 1 b 2 , 2 q 4 column-pairs ( c 3 b 1 , c 4 b 3 ) ’s in S ( 5 N / 16 ) such that ( c 3 b 1 ) ( c 4 b 3 ) = a 1 a 3 b 1 b 3 , 2 q 4 column-pairs ( c 5 b 2 , c 6 b 3 ) ’s in S ( 5 N / 16 ) such that ( c 5 b 2 ) ( c 6 b 3 ) = a 2 a 3 b 2 b 3 . There are 2 q 4 column-pairs ( c 7 b 4 , c 8 b 5 ) ’s in S ( 5 N / 16 ) such that ( c 7 b 4 ) ( c 8 b 5 ) = a 1 a 2 a 3 b 1 b 2 b 3 . Suppose that we delete x 1 , x 2 , x 3 , x 4 and x 5 columns from D q 4 ( b 1 ) , D q 4 ( b 2 ) , D q 4 ( b 3 ) , D q 4 ( b 4 ) and D q 4 ( b 5 ) , respectively, where x 1 + x 2 + + x 5 = n ¯ . In order to minimize the total number of SP-type 2fis in T which are aliased with w 1 w 2 , w 1 w 3 and w 2 w 3 , any two of the to be deleted x 1 + x 2 + x 3 columns are not in the same column-pairs ( c 1 b 1 , c 2 b 2 ) ’s, ( c 3 b 1 , c 4 b 3 ) ’s or ( c 5 b 2 , c 6 b 3 ) ’s. This can always be done noting that n ¯ 2 q 5 1 . For example, we delete x 1 + x 2 + x 3 columns from D q 4 ( b 1 ) , D q 4 ( b 2 ) or D q 4 ( b 3 ) . By doing so, there remain a total of 3 2 q 4 2 ( x 1 + x 2 + x 3 ) 3 SP-type 2fis in T which are aliased with w 1 w 2 , w 1 w 3 or w 2 w 3 . In order to minimize the number of SP-type 2fis in T which are aliased with w 1 w 2 w 3 , any two of the x 4 + x 5 columns (to be deleted) are not in the same column-pairs ( c 7 b 4 , c 8 b 5 ) ’s. By doing so, there remain 2 q 4 ( x 4 + x 5 ) SP-type 2fis in T which are aliased w 1 w 2 w 3 . Therefore, we have

C 2 ( s ) # ( w ) ( 1 ) ( T ) 4 2 q 4 2 ( x 1 + x 2 + x 3 ) ( x 4 + x 5 ) 3 = 2 q 2 2 ( n ¯ ( x 4 + x 5 ) ) ( x 4 + x 5 ) 3 = 2 q 2 2 n ¯ + ( x 4 + x 5 ) 3.

Further more, when x 4 + x 5 = 0 , we have C 2 ( s ) # ( w ) ( 1 ) ( T ) 2 q 2 2 n ¯ 3 = 2 n 3 2 q 3 3 which is the minimum value for (3).

When T ¯ D q 4 ( b 1 ) \ w 1 , T ¯ D q 4 ( b 2 ) \ w 2 or T ¯ D q 4 ( b 3 ) \ w 3 , the equation C 2 ( s ) # ( w ) ( 1 ) ( T ) = 2 n 3 2 q 3 3 holds.

Comparing the minimum values of C 2 ( s ) # ( w ) ( 1 ) ( T ) in cases (1), (2) and (3), it is clear that 3 n 15 2 q 5 3 > 3 n 21 2 q 5 3 > 2 n 3 2 q 3 3 . Therefore, when n 1 = 3 and m 1 = 0 , any 2 ( n 1 + n 2 ) ( m 1 + m 2 ) FFSP design T = ( T W , T S ) with T S ( 5 N / 16 ) has C 2 ( s ) # ( w ) ( 1 ) ( T ) 2 n 3 2 q 3 3 . Further more, when w 1 D q 4 ( b i ) , w 2 D q 4 ( b j ) , w 3 D q 4 ( b k ) , and T ¯ D q 4 b i \ w 1 , D q 4 ( b j ) \ w 2 or D q 4 ( b k ) \ w 3 , the equation C 2 ( s ) # ( w ) ( 1 ) ( T ) = 2 n 3 2 q 3 3 holds, where i , j , k = 1,2,3,4 or 5, and are not equal to each other.

This completes the proof.

With Lemma 3 and Lemma 6, we immediately obtain the construction methods of 2 ( n 1 + n 2 ) ( m 1 + m 2 ) GMC-FFSP designs with n 1 = 3 and m 1 = 0 .

Theorem 4. Suppose n 1 = 3 and m 1 = 0 , then the design T = ( T W , T S ) with T W = H w L and T S = L \ T W is a 2 ( n 1 + n 2 ) ( m 1 + m 2 ) GMC-FFSP design, where w 1 D q 4 ( b 1 ) L , w 2 D q 4 ( b i ) , w 3 D q 4 ( b j ) , i , j = 2,3,4 or 5 and i j .

Proof. Since T W = H w L and T S = L \ T W , then T W H w and T S H \ H w , where H w = H ( w 1 , w 2 , w 3 ) . Therefore, T is a 2 ( n 1 + n 2 ) ( m 1 + m 2 ) FFSP design, i.e., C 1 ( s ) # ( w ) ( 0 ) ( T ) = n 2 .

Because w 1 D q 4 ( b 1 ) L , w 2 D q 4 ( b i ) , w 3 D q 4 ( b j ) and T ¯ D q 4 ( b 1 ) \ w 1 , according to Lemma 6, we obtain that C 2 ( s ) # ( w ) ( 1 ) ( T ) = 2 n 3 2 q 3 3 , i.e., C 2 ( s ) # ( w ) ( 0 ) ( T ) is maximized, where i , j = 2,3,4,5 and i j . By noting that T consists of the last n columns of S ( 5 N / 16 ) , we have that T sequentially maximizes (1). This completes the proof.

Example 4 below illustrates the applications of Theorem 4.

Example 4. Consider constructing a 2 ( 3 + 16 ) ( 0 + 13 ) GMC-FFSP designs T = ( T W , T S ) . Since q = ( n 1 + n 2 ) ( m 1 + m 2 ) = 6 , then

S ( 5 N / 16 ) = D 2 ( X 1 ) = ( I b 1 , 1 b 1 , 2 b 1 , 1 2 b 1 , I b 2 , 1 b 2 , 2 b 2 , 1 2 b 2 , I b 3 , 1 b 3 , 2 b 3 , 1 2 b 3 , I b 4 , 1 b 4 , 2 b 4 , 1 2 b 4 , I b 5 , 1 b 5 , 2 b 5 , 1 2 b 5 ) ,

where I , 1 , 2 and 1 2 are from D 2 ( 1 ) . Note that n = 19 , then L = S ( 5 N / 16 ) \ I b 1 . Let w 1 = 1 b 1 , w 2 = I b 2 and w 3 = I b 3 , be the q 1 = 3 WP columns. Then

H w = H ( 1 b 1 , I b 2 , I b 3 ) = ( 1 b 1 , I b 2 , I b 3 , 1 b 1 b 2 , 1 b 1 b 3 , I b 2 b 3 , 1 b 1 b 2 b 3 ) . It is obtained that T W = H w L = ( 1 b 1 , I b 2 , I b 3 ) and T S = L \ T W = ( 2 b 1 , 1 2 b 1 , 1 b 2 , 2 b 2 , 1 2 b 2 , 1 b 3 , 2 b 3 , 1 2 b 3 , I b 4 , 1 b 4 , 2 b 4 , 1 2 b 4 , I b 5 , 1 b 5 , 2 b 5 , 1 2 b 5 ) .

According to Theorem 4, design T = ( T W , T S ) is a 2 ( 3 + 16 ) ( 0 + 13 ) GMC-FFSP design.

4. Concluding Remarks

Two-level regular split-plot designs have wide applications in practice. To choose desirable two-level regular split-plot designs, Wei et al. [16] proposed the GMC-FFSP criterion. This criterion is capable of estimating as many lower order effects of interest as possible. However, the studies on theoretical construction methods of 2 ( n 1 + n 2 ) ( m 1 + m 2 ) GMC-FFSP designs are still primitive.

In this paper, we explore the theoretical construction methods of 2 ( n 1 + n 2 ) ( m 1 + m 2 ) FFSP designs with 9 N / 32 + 1 n 1 + n 2 5 N / 16 . The theoretical construction methods of 2 ( n 1 + n 2 ) ( m 1 + m 2 ) GMC-FFSP designs for the cases where m 1 = 0 with n 1 = 1 , 2 and 3, and m 2 = n 2 1 are worked out. The construction methods are concise and easy to apply.

Acknowledgments

The authors are grateful to anonymous referees for their insightful comments and suggestions.

Conflicts of Interest

The authors declare no conflicts of interest regarding the publication of this paper.

References

[1] Huang, P., Chen, D. and Voelkel, J.O. (1998) Minimum-Aberration Two-Level Split-Plot Designs. Technometrics, 40, 314-326.
https://doi.org/10.1080/00401706.1998.10485560
[2] Yang, J.F., Liu, M.Q. and Zhang, R.C. (2009) Some Results on Fractional Factorial Split-Plot Designs with Multi-Level Factors. Communications in Statistics, 38, 3623-3633.
https://doi.org/10.1080/03610920802618418
[3] Tichon, J.G., Li, W. and Mcleod, R.G. (2012) Generalized Minimum Aberration Two-Level Split-Plot Designs. Journal of Statistical Planning and Inference, 142, 1407-1414.
https://doi.org/10.1016/j.jspi.2011.12.019
[4] Zhao, Q.Q. and Zhao, S.L. (2020) Constructing Minimum Aberration Split-Plot Designs via Complementary Sets when the Whole Plot Factors Are Important. Journal of Statistical Planning and Inference, 209, 123-143.
https://doi.org/10.1016/j.jspi.2020.03.005
[5] Wang, C.C., Zhao, Q.Q. and Zhao, S.L. (2019) Optimal Fractional Factorial Split-Plot Designs when the Whole Plot Factors Are Important. Journal of Statistical Planning and Inference, 199, 1-13.
https://doi.org/10.1016/j.jspi.2018.05.001
[6] Mukerjee, R. and Fang, K.T. (2002) Fractional Factorial Split-Plot Designs with Minimum Aberration and Maximum Estimation Capacity. Statistica Sinica, 12, 885-903.
[7] Yang, J.F., Zhang, R.C. and Liu, M.Q. (2007) Construction of Fractional Factorial Split-Plot Designs with Weak Minimum Aberration. Statistics & Probability Letters. 77, 1567-1573.
https://doi.org/10.1016/j.spl.2007.03.043
[8] Zhao, S.L. and Chen, X.F. (2012) Mixed Two- and Four-Level Fractional Factorial Split-Plot Designs with Clear Effects. Journal of Statistical Planning and Inference, 142, 1789-1793.
https://doi.org/10.1016/j.jspi.2012.02.042
[9] Zhao, S.L. and Chen, X.F. (2012) Mixed-Level Fractional Factorial Split-Plot Designs Containing Clear Effects. Metrika, 75, 953-962.
https://doi.org/10.1007/s00184-011-0361-9
[10] Yang, J.F., Li, P.F., Liu, M.Q. and Zhang, R.C. (2006) Fractional Factorial Split-Plot Designs Containing Clear Effects. Journal of Statistical Planning and Inference, 136, 4450-4458.
https://doi.org/10.1016/j.jspi.2005.06.009
[11] Zi, X.M., Zhang, R.C. and Liu, M.Q. (2006) Bounds on the Maximum Numbers of Clear Two-Factor Interactions for Fractional Factorial Split-Plot Designs. Science in China Series A: Mathematics, 49, 1816-1829.
https://doi.org/10.1007/s11425-006-2032-2
[12] Han, X.X., Liu, M.Q., Yang, J.F. and Zhao, S.L. (2020) Mixed 2- and 2r-Level Fractional Factorial Split-Plot Designs with Clear Effects. Journal of Statistical Planning and Inference, 204, 206-216.
https://doi.org/10.1016/j.jspi.2019.04.012
[13] Han, X.X., Chen, J.B., Liu, M.Q. and Zhao, S.L. (2020) Asymmetrical Split-Plot Designs with Clear Effects. Metrika, 83, 779-798.
https://doi.org/10.1007/s00184-019-00755-0
[14] Wu, C.F.J. and Hamada, M.S. (2009) Experiments: Planning, Analysis and Optimization. 2nd Edition, John and Wiley & Sons, New Jersey.
[15] Zhang, R.C., Li, P., Zhao, S.L. and Ai, M.Y. (2008) A General Minimum Lower-Order Confounding Criterion for Two-Level Regular Designs. Statistica Sinica, 18, 1689-1705.
[16] Wei, J.L., Yang, J.F., Li, P. and Zhang, R.C. (2010) Split-Plot Designs with General Minimum Lower-Order Confounding. Science China Mathematics, 53, 939-952.
https://doi.org/10.1007/s11425-010-0070-2
[17] Han, B.C. and Zhao, Y.N. (2022) Construction of Optimal Split-Plot Designs for Various Design Scenarios. Fractal and Fractional, 608, 2504-3110.
https://doi.org/10.3390/fractalfract6100608
[18] Chen, H. and Cheng, C.S. (2006) Doubling and Projection: A Method of Constructing Two-Level Designs of Resolution IV. The Annals of Statistics, 34, 5456-558.
https://doi.org/10.1214/009053605000000813
[19] Xu, H. and Cheng, C.S. (2008) A Complementary Design Theory for Doubling. The Annals of Statistics, 36, 445-457.
https://doi.org/10.1214/009005360700000712
[20] Zhang, R.C., Cheng, Y. (2010) General Minimum Lower Order Confounding Designs: An Overview and a Construction Theory. Journal of Statistical Planning and Inference, 140, 1719-1730.
https://doi.org/10.1016/j.jspi.2009.12.024
[21] Block, R.M. and Mee, R.W. (2003) Second Order Saturated Resolution IV Designs. Journal of Statistical Theory and Application, 2, 96-112.
[22] Zha, D. (2008) New Blind Estimation Method of Evoked Potentials Based on Minimum Dispersion Criterion and Fractional Lower Order Statistics. Journal of Biomedical Science and Engineering, 1, 91-97.
https://doi.org/10.4236/jbise.2008.12015

Copyright © 2024 by authors and Scientific Research Publishing Inc.

Creative Commons License

This work and the related PDF file are licensed under a Creative Commons Attribution 4.0 International License.