Next Article in Journal
PGA: A New Hybrid PSO and GA Method for Task Scheduling with Deadline Constraints in Distributed Computing
Next Article in Special Issue
Risk Analysis and Estimation of a Bimodal Heavy-Tailed Burr XII Model in Insurance Data: Exploring Multiple Methods and Applications
Previous Article in Journal
Characterization Results on Lifetime Distributions by Scaled Reliability Measures Using Completeness Property in Functional Analysis
Previous Article in Special Issue
New Approaches on Parameter Estimation of the Gamma Distribution
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Construction of Column-Orthogonal Designs with Two-Dimensional Stratifications

School of Statistics and Data Science, LPMC & KLMDASR, Nankai University, Tianjin 300071, China
*
Author to whom correspondence should be addressed.
Mathematics 2023, 11(6), 1549; https://doi.org/10.3390/math11061549
Submission received: 17 February 2023 / Revised: 16 March 2023 / Accepted: 20 March 2023 / Published: 22 March 2023
(This article belongs to the Special Issue Distribution Theory and Application)

Abstract

:
For the design of computer experiments, column orthogonality and space-filling are two desirable properties. In this paper, we develop methods for constructing a new class of column-orthogonal designs (ODs) with two-dimensional stratifications on finer grids, including orthogonal Latin hypercube designs (OLHDs) as special cases. In addition to being column-orthogonal, these designs have good space-filling properties in two dimensions. The resulting designs achieve stratifications on s 2 × s or s × s 2 grids, and most column pairs satisfy stratifications on s 2 × s 2 grids. Moreover, many column pairs can achieve stratifications on s 4 × s 2 and s 2 × s 4 grids. Furthermore, the obtained space-filling ODs can have s 6 levels, s 4 levels, and mixed levels, as required for different needs.

1. Introduction

Computer experiments have been widely used recently to explore complex systems in many fields; space-filling and column orthogonality are desirable properties in the design of computer experiments [1]. The space-filling property, which measures the uniformity of the design points in the experimental region, is a fundamental criterion for evaluating designs for computer experiments. Latin hypercube designs (LHDs), proposed by [2], are widely used space-filling designs for computer experiments. An LHD with n runs and m factors, denoted as LHD ( n , m ) , is an n × m matrix with each column a permutation of n equally spaced levels. Such a design achieves the maximum stratification in each dimension. Based on the effect sparsity principle [3], for a high-dimensional design region, only a handful of the factors are expected to be active. In [4], the author proposed orthogonal array (OA)-based LHDs which improve the low-dimensional projection properties of random LHDs. In [5,6], the authors discussed space-filling designs with good projection properties in low dimensions. Recently, ref. [7] introduced strong orthogonal arrays, and [8] proposed mappable nearly orthogonal arrays. Both of these two kinds of arrays have better space-filling properties than ordinary orthogonal arrays.
Column orthogonality is a desirable property for LHDs; when a linear model is fitted, this property ensures that the estimates of the main effects are uncorrelated. In addition, orthogonality can be viewed as a stepping stone to space-filling designs when Gaussian process models are considered [9]. There are many ways to construct orthogonal LHDs (OLHDs); see, e.g., [10,11,12,13,14,15] and the references therein. Among them, the method of rotation has attracted widespread attention. In the extant literature, few works have simultaneously considered both the space-filling property and column orthogonality. In [16], the authors constructed OLHDs which achieved stratifications on s 2 × s or s × s 2 grids, with most column pairs achieving stratifications on s 2 × s 2 grids. In [17], the authors provided column-orthogonal designs (ODs) with two-dimensional stratifications. In [18], the authors studied ODs with two-dimensional and three-dimensional stratifications, while [15] proposed ODs with multi-dimensional stratifications.
The goal of the present paper is to construct ODs with stratifications on finer grids, i.e., s 2 × s 2 , s 4 × s 2 , and s 2 × s 4 . We first introduce a new class of OLHDs with s d + 2 k runs by rotating s-level OAs, where d + 2 k can be any positive even integer not smaller than 4 and d = 2 c ( c 2 ) . We additionally introduce a new class of ODs with flexible run sizes. All these designs guarantee desirable two-dimensional space-filling properties. Most column pairs of the resulting designs can achieve stratifications on s 2 × s 2 grids. Moreover, many column pairs can satisfy stratifications on s 4 × s 2 and s 2 × s 4 grids. Furthermore, the resulting ODs can have s 6 or s 4 levels and mixed levels.
The rest of this paper is organized as follows: Section 2 introduces preliminaries used in this paper; Section 3 proposes the general construction method for OLHDs and extends it to accommodate more factors; Section 4 concentrates on the construction of ODs with s 6 levels, s 4 levels, and mixed levels; finally, concluding remarks are provided in Section 5. All proofs are deferred to Appendix A.

2. Definitions and Notation

We use D ( n , s 1 , , s m ) to denote a balanced design of n runs and m factors, with each of the s j levels from { 0 , 1 , , s j 1 } . When all the instances of s j are equal to s, the design is a symmetric balanced design D ( n , s m ) . Further, if s = n , it is an LHD, denoted as LHD ( n , m ) .
A mixed-level orthogonal array (OA) with strength t and levels s 1 , , s m , denoted as OA ( n , m , s 1 × × s m , t ) , satisfies the requirement that all possible level combinations for any columns t occur with the same frequency. When all s j are equal to s, the array is symmetric and denoted as OA ( n , m , s , t ) . For an OA ( n , m , s , t ) , it must have n = λ s t for some integer λ , which is the index of the OA.
For an array with n runs and m factors, we say it achieves a stratification on an s 1 × × s p grid for some p 2 if the corresponding p columns of it can be collapsed into an OA ( n , p , s 1 × × s p , p ) .
The correlation between two vectors a = ( a 1 , , a n ) T and b = ( b 1 , , b n ) T is defined as
ρ ( a , b ) = i = 1 n ( a i a ¯ ) ( b i b ¯ ) i = 1 n ( a i a ¯ ) 2 i = 1 n ( b i b ¯ ) 2 ,
where a ¯ = i = 1 n a i / n and b ¯ = i = 1 n b i / n . The average correlation of a design D = ( d 1 , , d m ) is defined as
ρ a v e ( D ) = j k ρ ( d j , d k ) m ( m 1 ) .
Two vectors are said to be column-orthogonal if the correlation between them is 0. A design D ( n , s m ) is said to be column-orthogonal, denoted as OD ( n , s m ) , if any two of its columns are column-orthogonal. Obviously, any OA ( n , m , s , t ) with t 2 is an OD ( n , s m ) . Similarly, we have OLHD ( n , m ) .
To facilitate the study of orthogonality, we sometimes center the s 2 levels of an OD ( n , ( s 2 ) m ) into
Ω ( s 2 ) = { u ( s 2 1 ) / 2 | u = 0 , , s 2 1 } .
Let G F ( s d ) = { a 0 + a 1 x + + a d 1 x d 1 , a 0 , , a d 1 G F ( s ) } be a Galois field of order s d and let G F ( s ) = { 0 , , s 1 } be a Galois field of order s. We denote an r × c matrix with entries from G F ( s 2 ) = { a 0 + a 1 x , a 0 , a 1 G F ( s ) } as D ( r , c , s 2 ) , which is called a difference scheme if it satisfies the requirement that, for any i and j with 1 i j c , the vector difference of the ith and jth columns contains every element of G F ( s 2 ) equally often.
For two matrices A = ( a i j ) m × n and B = ( b i j ) u × v with entries from G F ( s 2 ) , we define
A B = a 11 + B a 1 n + B a m 1 + B a m n + B ,
where + is the addition defined on G F ( s 2 ) .
For any design A with entries from { 0 , 1 , , s 2 1 } , let Φ 0 ( A ) = A ; we define
Φ k ( A ) = φ k , 1 ( A ) , , φ k , s 2 / 2 ( A )
for k = 1 , 2 , , and define
φ k , j ( A ) = d 2 j 1 Φ k 1 ( A ) , d 2 j Φ k 1 ( A ) ,
where j = 1 , , s 2 / 2 , h denotes the largest integer less than or equal to h and d l denotes the lth column in the difference scheme D ( s 2 , s 2 , s 2 ) = ( d 1 , , d s 2 ) for l = 1 , , s 2 .
Let
R 1 , 0 = s 2 1 1 s 2 , R u , 0 = s 2 u R u 1 , 0 R u 1 , 0 R u 1 , 0 s 2 u R u 1 , 0 ( u 2 ) ,
Q 1 = 1 0 0 1 , and Q u = Q u 1 0 0 Q u 1 ( u 2 ) .
Then, we define
R u , 1 = s 2 R u , 0 Q u Q u s 2 R u , 0 , R u , k = s 2 R u , k 1 Q u + k 1 Q u + k 1 s 2 R u , k 1 ( u 2 , k 2 ) .
For a prime power s 2 , let C = ( c 1 , , c m ) be an OA ( n , m , s 2 , 2 ) with entries from G F ( s 2 ) and let D be a difference scheme D ( s 2 , s 2 , s 2 ) = ( d 1 , , d s 2 ) . We now create
E i = D c i = ( d 1 c i , , d s 2 c i ) ,
for i = 1 , , m and define
E = ( E 1 , , E m ) .
For a prime s and integer d with d = 2 c and c 2 , we denote the d columns of an s d -run full factorial design as 1 , , d . Any generated column including each column of 1 , , d can be denoted as 1 a 0 d a d 1 for some a 0 , , a d 1 G F ( s ) , and corresponds to a nonzero element a 0 + a 1 x + + a d 1 x d 1 in G F ( s d ) . Here, let p = ( s d 1 ) / ( d ( s 1 ) ) .
As discussed in [11], the corresponding columns of the first p d non-zero elements of G F ( s d ) , x 0 , x 1 , , x p d 1 modulo f ( x ) form a regular design D, where f ( x ) is a primitive polynomial of order d. Any d consecutive columns of D form a full factorial design, denoted as B 1 , B 2 , , B p and B i = ( x ( i 1 ) d , x ( i 1 ) d + 1 , , x i d 1 ) mod f ( x ) , i = 1 , , p . Let B i = ( b i , 1 , , b i , d ) , defining f i , j = s b i , 2 j 1 + b i , 2 j for i = 1 , , p , j = 1 , , d / 2 . Then, we have
F i = ( f i , 1 , , f i , d / 2 )
and
F = ( F 1 , , F p ) .
Without particular explanation, in this paper, s is a prime, k 0 , d is an integer with d = 2 c , c 2 , and p = ( s d 1 ) / ( d ( s 1 ) ) . We provide an illustrative example in the following.
Example 1. 
For s = 3 and d = 4 , we denote the 3 4 full factorial design as ( 1 , 2 , 3 , 4 ) . Here, G F ( 3 4 ) = { a 0 + a 1 x + a 2 x 2 + a 3 x 3 , a 0 , a 1 , a 2 , a 3 G F ( 3 ) } , with the primitive polynomial f ( x ) = x 4 + x + 2 . Then, x 0 , x 1 , x 2 , x 3 modulo f ( x ) are 1, x, x 2 , x 3 , which correspond to columns 1 , 2 , 3 , 4 . Similarly, we have the elements of x 4 , x 5 , , x 39 modulo f ( x ) . For example, 12 2 is obtained by x 4 modulo f ( x ) . The obtained full factorial designs B 1 , , B 10 are shown in Table 1, where b i j is the jth column in B i for i = 1 , , 10 and j = 1 , , 4 .

3. Construction of Orthogonal LHDs

This section first introduces a rotation method in Algorithm 1 to construct OLHDs with attractive stratification properties, then generalizes the method to enlarge the columns of these LHDs.
To make it easier for readers to understand the algorithm, we provide the flowchart in Figure 1 to explain the algorithm.
To measure the stratification properties of a design with m columns, we define the following two proportions:
π α = r α m 2 , π β = r β m 2 ,
where r α is the number of column pairs that achieve stratifications on s 2 × s 2 grids and r β is the number of column pairs that achieve stratifications on s 4 × s 2 and s 2 × s 4 grids. The properties of the designs in Algorithm 1 are summarized in Theorem 1.
Algorithm 1 Construction of OLHDs
Input: 
F = ( F 1 , , F p ) , D ( s 2 , s 2 , s 2 ) = ( d 1 , , d s 2 ) , and integer k.
 1: 
Let F = ( F 1 , , F p ) as defined in (6) and replace the levels of { 0 , 1 , , s 2 1 } in each F i with { a 0 + a 1 x , a 0 , a 1 G F ( s ) } .
 2: 
Obtain a difference scheme D ( s 2 , s 2 , s 2 ) = ( d 1 , , d s 2 ) . For a given k, let F k = ( F k , 1 , , F k , p ) with F k , i = Φ k ( F i ) for i = 1 , , p , where Φ k ( F i ) is defined in (2).
 3: 
Replace the levels of F k with entries from Ω ( s 2 ) as in (1) and denote the resulting design as F k * .
 4: 
Obtain Z = F k * R , where R = I p s 2 / 2 R c ^ , k , c ^ = log 2 d 1 , and R c ^ , k is defined in (3).
Output: 
Design Z.
Theorem 1. 
Design Z in Algorithm 1 is an OLHD ( s d + 2 k , m ) where m = p d γ / 2 and γ = s 2 / 2 k 2 k , and has the following properties:
(1)
Any two columns achieve a stratification on an s 2 × s or s × s 2 grid;
(2)
The proportion of column pairs achieving stratifications on s 2 × s 2 grids satisfies π α 1 2 ( s 1 ) / ( m 1 ) ;
(3)
The proportion of column pairs achieving stratifications on s 2 × s 4 and s 4 × s 2 grids satisfies π β 1 ( m / γ + 2 γ s γ 2 s ) / ( m 1 ) .
For this, we use the following illustrative example.
Example 2. 
For s = 2 and d = 4 , we denote the four independent columns as 1 , 2 , 3 , 4 , while the generated columns of these four columns are denoted as 12 , 13 , 14 , 23 , 24 , 34 , 123 , 124 , 134 , 234 , 1234 . We have G F ( 2 4 ) = { a 0 + a 1 x + a 2 x 2 + a 3 x 3 , a i G F ( 2 ) } with G F ( 2 ) = { 0 , 1 } and the primitive polynomial f ( x ) = x 4 + x + 1 . It is easy to obtain three full factorial designs B 1 = ( 1 , 2 , 3 , 4 ) , B 2 = ( 12 , 23 , 34 , 124 ) , and B 3 = ( 13 , 24 , 123 , 234 ) . Then, we have F 1 = ( 2 × 1 + 2 , 2 × 3 + 4 ) , F 2 = ( 2 × 12 + 23 , 2 × 34 + 124 ) , and F 3 = ( 2 × 13 + 24 , 2 × 123 + 234 ) . Thus, F = ( F 1 , F 2 , F 3 ) , which is displayed in Table 2.
In this way, we obtain a difference scheme D ( 4 , 4 , 4 ) = ( d 1 , d 2 , d 3 , d 4 ) , denoted as
D = 0 0 0 0 0 1 x x + 1 0 x x + 1 1 0 x + 1 1 x ,
with F 1 = ( F 1 , 1 , F 1 , 2 , F 1 , 3 ) , where F 1 , i = Φ 1 ( F i ) = ( d 0 F i , d 1 F i , d 2 F i , d 3 F i ) for i = 1 , 2 , 3 . We can obtain F 1 * by replacing the levels of F 1 with entries from { 1.5 , 0.5 , 0.5 , 1.5 } . Then, we rotate F 1 * by R = I 6 R 1 , 1 to generate an OLHD ( 64 , 24 ) , where
R 1 , 1 = 16 4 1 0 4 16 0 1 1 0 16 4 0 1 4 16 .
The resulting OLHD ( 64 , 24 ) is displayed in Table A1 of Appendix B. From Table 3, it is apparent that 260 out of all 276 (i.e., 94.20 % ) column pairs achieve stratifications on 4 × 4 grids, more than 60 % of column pairs achieve stratifications on 4 × 16 or 16 × 4 grids, and 52.17 % of column pairs achieve stratifications on 2 × 32 or 32 × 2 grids.
To illustrate the projection property of the resulting OLHD ( 64 , 24 ) , we display the pairwise scatter plots of the (1–5)th columns of the design in Figure 2.
From Figure 2, it can be seen that all the column pairs of the first five columns achieve stratifications on 4 × 4 grids, and most of the same column pairs achieve stratifications on 4 × 16 and 16 × 4 grids. Other column pairs perform similarly.
Example OLHDs constructed by Algorithm 1 are listed in Table 4. Without loss of generality, we only show the lower bounds of π α and π β in Table 4, which are denoted as π α , L B and π β , L B , respectively.
As shown in Table 4, the lower bounds of π α are very close to 1, while that of π β is close to 1 when the run size is large, which means that nearly all the column pairs achieve stratifications on s 2 × s 2 grids and that most column pairs achieve stratifications on s 2 × s 4 and s 4 × s 2 grids.
A comparison between the OLHDs obtained using Algorithm 1 and the OLHDs in [14,15,16] is presented in Table 5. Compared with this class of designs, the resulting OLHDs satisfy two-dimensional space-filling properties on finer grids, i.e., s 2 × s 2 , s 4 × s 2 , and s 2 × s 4 . The OLHDs in [14] satisfy stratifications on s 2 × s and s × s 2 grids, while the designs in [16] satisfy stratifications on s 2 × s 2 grids. Thus, the OLHDs based on Algorithm 1 satisfy better two-dimensional space-filling properties. Moreover, these OLHDs are able to accommodate more factors than OLHDs in [15], and can fill the gap between the run sizes of the available OLHDs in [16]. For example, we can construct OLHDs of 64 and 1024 runs, while such designs are not available in [16].
Furthermore, we can construct OLHDs with more columns through Algorithm 2. The flowchart of Algorithm 2 is shown in Appendix B.
Algorithm 2 Enlarging the columns of OLHDs
Input: 
F = ( F 1 , , F p ) , O = ( o i j ) , and integer k.
 1: 
Let O = ( o i j ) be an OLHD ( s , t ) . For l = 1 , , t , obtain matrix B ( l )   =   ( B 1 ( l ) , , B p ( l ) ) by replacing the s levels of B with o 1 l , , o s l , respectively, where B =  ( B 1 , , B p ) is the same as in Section 2.
 2: 
For l = 1 , , t , obtain F ( l ) from B ( l ) per (6) in Section 2 and replace the levels of each F ( l ) with { a 0 + a 1 x , a 0 , a 1 G F ( s ) } .
 3: 
For a given integer k and l = 1 , , t , let F k ( l ) = ( F k , 1 ( l ) , , F k , p ( l ) ) with F k , i ( l ) = Φ k ( F i ( l ) ) for i = 1 , , p , where Φ k ( F i ( l ) ) is defined in (2).
 4: 
For l = 1 , , t , replace the levels of F k , i ( l ) with entries from Ω { s 2 } in (1) and denote the resulting design as F k , i ( l ) * . Construct M = ( M 1 , , M t ) = ( F k ( 1 ) * R , , F k ( t ) * R ) , where R = I p s 2 / 2 R c ^ , k , c ^ = log 2 d 1 , and R c ^ , k is the same as in Algorithm 1.
Output: 
Design M.
Corollary 1. 
Design M obtained by Algorithm 2 is an OLHD ( s d + 2 k , m t ) where m = p d γ / 2 and γ = s 2 / 2 k 2 k . Each sub-design M i achieves the same stratifications with Z in Algorithm olhds1 for i = 1 , , t . At least 2 k p d t ( 2 k p d t 2 t ) / 8 column pairs of M achieve stratifications on s × s grids in all the two dimensions.
In Step 1, we can choose OLHDs obtained by [15,19] when s = 5, 7, 11, and 17, respectively. According to Algorithm 2, we can obtain OLHDs with t sub-designs, with each satisfying the same stratification properties in Theorem 1. Moreover, when s = 5 , per Algorithm 2 we can obtain an OLHD ( 5 6 , 3744 ) that can accommodate more columns than OLHD ( 5 6 , 2496 ) in [14] and has more attractive space-filling properties.

4. Construction of Orthogonal Designs

This section introduces three rotation methods for constructing ODs. The first two methods can construct ODs with s 6 and s 4 levels, respectively, while the third can obtain mixed-level ODs. We first present the construction of ODs with s 6 levels and investigate their properties. The construction method is provided in Algorithm 3, and the flowchart is shown in Appendix B.
Algorithm 3 Construction of s 6 -level ODs
Input: 
F = ( F 1 , , F p ) and D ( s 2 , s 2 , s 2 ) = ( d 1 , , d s 2 ) .
 1: 
Let F = ( F 1 , , F p ) = ( ξ 1 , , ξ p q ) with q = d / 2 , and let D be a difference scheme D ( s 2 , s 2 , s 2 ) = ( d 1 , , d s 2 ) with entries from G F ( s 2 ) as defined in Section 2. Replace the levels of { 0 , 1 , , s 2 1 } in each F i with { a 0 + a 1 x , a 0 , a 1 G F ( s ) } and define
E i = D ξ i = ( d 1 ξ i , , d s 2 ξ i ) , i = 1 , , p q , q = d / 2 .
 2: 
Divide each E i into g or g + 1 groups for i = 1 , , p q as E i = ( E i , 1 , , E i , g ) if s 2 = 2 g or E i = ( E i , 1 , , E i , g , l i ) if s 2 = 2 g + 1 , where each E i , j has two columns. Then, order E i , j ’s as
E 1 , 1 , E 2 , 1 , , E p q , 1 , E 1 , 2 , E 2 , 2 , , E p q , 2 , , E 1 , g , E 2 , g , , E p q , g .
 3: 
Replace the levels of each E i , j with entries from Ω ( s 2 ) and denote the resulting design as E i , j * . Take two successive instances of E i , j * at a time in the order given in (8), and obtain μ = p q g / 2 sets of four columns, denoted as E ( 1 ) , , E ( μ ) . Combine E ( i ) for i = 1 , , μ together:
E * = ( E ( 1 ) , , E ( μ ) ) .
 4: 
Create
X * = ( E ( 1 ) R 1 , 1 , , E ( μ ) R 1 , 1 ) ,
where
R 1 , 1 = s 4 s 2 1 0 s 2 s 4 0 1 1 0 s 4 s 2 0 1 s 2 s 4
is a rotation matrix up to a constant.
Output: 
Design X * .
Based on the form of the rotation matrix, it is easy to see that any column x in X * obtained in (9) has the following form:
x = s 4 e ± s 2 e ± e ,
where e and e are the two columns in some E i , j * with E i , j * E ( l ) for some l; here, e is a column which is not in E i , j * . We call e the leading column of x to facilitate later study. Now, we can consider the mapping
δ 1 ( z ) = z + ( s 6 1 ) / 2 s 4 s 2 1 2 , for z Ω ( s 6 ) ,
with δ 1 ( · ) collapsing the s 6 levels in Ω ( s 6 ) into s 2 levels in Ω ( s 2 ) . For example, when s = 2 , the 64 levels are collapsed into 4 levels by the mapping, as follows:
31.5 , 30.5 , , 16.5 1.5 , 15.5 , 14 , 5 , , 0.5 0.5 , 0.5 , 1 , 5 , , 15.5 0.5 , 16.5 , 17.5 , 31.5 1.5 .
Then, we consider the mapping
δ 2 ( z ) = z + ( s 6 1 ) / 2 s 2 s 4 1 2 , for z Ω ( s 6 ) ,
with δ 2 ( · ) collapsing the s 6 levels in Ω ( s 6 ) into s 4 levels in Ω ( s 4 ) . For example, when s = 2 , the 64 levels are collapsed into 16 levels by the mapping, as follows:
31.5 , 30.5 , 29.5 , 28.5 7.5 , 27.5 , 26 , 5 , 25.5 , 24.5 6.5 , 24 , 5 , 25 , 5 , 26.5 , 27.5 6.5 , 28.5 , 28.5 30.5 , 31.5 7.5 .
The resulting design X * is orthogonal and achieves stratifications on s 2 × s or s × s 2 grids; most column pairs can achieve stratifications on s 2 × s 2 grids. Moreover, column pairs can achieve stratifications on s 2 × s 4 and s 4 × s 2 grids as well. We can summarize the properties of X * in the following theorem.
Theorem 2. 
Design X * in (9) is an OD ( s d + 2 , ( s 6 ) 4 μ ) , where μ = p q g / 2 and g = s 2 / 2 ; X * can be partitioned into p q disjoint groups of 2 g columns, each with the following properties:
(1)
Any two distinct columns achieve a stratification on an s 2 × s or s × s 2 grid;
(2)
Most column pairs achieve stratifications on s 2 × s 2 grids, and the proportion π α is not less than 1 2 ( s 1 ) / ( 4 μ 1 ) ;
(3)
The proportion of column pairs achieving stratifications on s 2 × s 4 and s 4 × s 2 grids satisfies π β 1 ( μ / g + 4 g s 2 g 2 s ) / ( 4 μ 1 ) .
From Theorem 2, it can be understood that the obtained ODs have appealing stratification properties. For example, for s = 3 and d = 4 at least 97.48 % of all column pairs of X * can achieve stratifications on s 2 × s 2 grids. Furthermore, many column pairs of X * achieve stratifications on finer s 2 × s 4 and s 4 × s 2 grids ( π β 64.78 ). The lower bound of this proportion is relatively loose. Below, we provide an illustrative example.
Example 3. 
Consider the same conditions in Example 2 with p = 3 , q = 2 , and g = 2 ; we can obtain F = ( F 1 , F 2 , F 3 ) = ( ξ 1 , , ξ 6 ) and the difference scheme D ( 4 , 4 , 4 ) . From Step 1, we have E = ( E 1 , , E 6 ) , where
E i = D ξ i = ( d 0 ξ i , , d 3 ξ i ) , i = 1 , , 6 .
Then, we divide E i into two groups, as follows: E i = ( E i , 1 , E i , 2 ) for i = 1 , , 6 , where each E i , j has two columns, and order the E i , j as follows:
E 1 , 1 , E 2 , 1 , , E 6 , 1 , E 1 , 2 , E 2 , 2 , , E 6 , 2 .
We replace the levels of each E i , j with entries from Ω ( s 2 ) and denote the resulting design as E i , j * . Taking two successive instances of E i , j * at a time in the order given in (13), we obtain μ = 6 sets of four columns, denoted as E ( 1 ) , , E ( 6 ) . Then, we can obtain an OLHD ( 64 , 24 ) through
X * = ( E ( 1 ) R 1 , 1 , , E ( 6 ) R 1 , 1 ) ,
which is displayed in Table A2 of Appendix B. The stratification properties of X * are summarized in Table 6. It can be seen that this design has the same number of column pairs achieving stratification on a 4 × 4 grid as the one in Example 2, and has more column pairs achieving stratifications on 4 × 16 or 16 × 4 grids than the one in Example 2 with π β = 63.77 % . Furthermore, by calculation, we can say that the obtained OLHD ( 64 , 24 ) achieves stratifications on a 2 × 32 grid in 140 out of all 276 (i.e., 50.72 % ) and on a 32 × 2 grid in100 out of all 276 (i.e., 36.23 % ).
The OAs and difference schemes used in the construction are available in [20] and the library of OAs (http://neilsloane.com/oadir/index.html, accessed on 16 March 2023). It is easy to show that X * is an OLHD ( s d + 2 , 4 μ ) when d = 4 . Table 7 summarizes example ODs constructed by Algorithm 3. Their space-filling properties are characterized by π α and π β . Similar to Section 3, we only list the lower bounds of π α and π β in Table 7, denoted as π α , L B and π β , L B , respectively. As shown in Table 7, the lower bounds of π α are very close to 1 and those of π β are quite large in most cases, which means that nearly all the column pairs of these ODs achieve stratifications on s 2 × s 2 grids, and that most column pairs achieve stratifications on finer s 2 × s 4 and s 4 × s 2 grids as well.
Next, we introduce the construction of ODs with s 4 levels with the same space-filling properties as the designs obtained in Algorithm 3. The construction method is provided in Algorithm 4.
Algorithm 4 Construction of s 4 -level ODs
Input: 
F = ( F 1 , , F p ) and D ( s 2 , s 2 , s 2 ) = ( d 1 , , d s 2 ) .
 1: 
Let matrices B, F, D, E i , j , E i , j * be the same as in Algorithm 3.
 2: 
For i = 1 , , p d / 2 , define G i = ( E i , 1 * , , E i , g * ) with g = s 2 / 2 .
 3: 
Create
Y = ( G 1 , , G p d / 2 ) V = ( Y 1 , , Y p d / 2 ) ,
where
V = R 1 , 0 0 2 × 2 0 2 × 2 0 2 × 2 R 1 , 0 0 2 × 2 0 2 × 2 0 2 × 2 R 1 , 0 with R 1 , 0 = s 2 1 1 s 2 ,
where R 1 , 0 is repeated p d g / 2 times and all off-diagonal sub-matrices of V are 2 × 2 zero matrices.
Output: 
Design Y.
For the resulting design, it is easy to obtain the following theorem.
Theorem 3. 
Design Y in (14) is an OD ( s d + 2 , ( s 4 ) m ) with m = 2 p d g , g = s 2 / 2 that can be partitioned into p d disjoint groups of 2 g columns with the same stratification properties as X * in Theorem 2.
Compared with the ODs constructed in Algorithm 3, design Y has lower levels and can accommodate more columns than design X * in Algorithm 3 when d is an odd number. Now, we turn to an illustrative example.
Example 4. 
Considering the same conditions in Example 3, we first obtain the Ei,js. For i = 1 , , 6 , we define G i = ( E i , 1 * , E i , 2 * ) and R 1 , 0 = s 2 1 1 s 2 . We can construct an OD ( 64 , 16 24 ) by
Y = ( Y 1 , , Y 6 ) = ( G 1 , , G 6 ) V ,
which is displayed in Table A3 of Appendix B. It can be seen that the design points are well-scattered in the two-dimensional projections of the resulting OD ( 64 , 16 24 ) , and it has the same space-filling properties as the OD constructed in Example 3.
Table 8 lists example ODs obtained by Algorithm 4. Compared with the ODs constructed using Algorithm 3, the obtained designs have lower levels and more columns when d is odd. The resulting designs have the same stratification properties as the ODs constructed by Algorithm 3. These ODs have more flexible run sizes than the OLHDs obtained by Algorithm 1.
Now, we consider the construction of mixed-level ODs, which are very useful when the factors cannot have the same number of levels. The construction method is provided in Algorithm 5.
Algorithm 5 Construction of mixed-level ODs
Input: 
F = ( F 1 , , F p ) and D ( s 2 , s 2 , s 2 ) = ( d 1 , , d s 2 ) .
 1: 
Let matrices B, F, D, E i , j , and E i , j * be the same as in Algorithm 3. Then, order the Ei,js as in (8). First, take two successive E i , j instances at each time in the above list and take a total of μ 1 times (where μ 1 p q g / 2 ) to μ 1 sets of four columns each. Center the s 2 levels of each column into Ω ( s 2 ) in (1) and denote these sets as E ( 1 ) , , E ( μ 1 ) .
 2: 
Take one E i , j at a time in the remaining list of (8), thus μ 2 = p d g / 2 2 μ 1 sets of two columns each can be obtained. Similarly center the s 2 levels of each column into Ω ( s 2 ) and denote these sets as J ( 1 ) , , J ( μ 2 ) .
 3: 
Create
H = ( E ( 1 ) R 1 , 1 , , E ( μ 1 ) R 1 , 1 , J ( 1 ) R 1 , 0 , , J ( μ 2 ) R 1 , 0 ) ,
where R 1 , 1 and R 1 , 0 are the rotation matrices provided in (3).
Output: 
Design H.
For the resulting design H, the following theorem holds.
Theorem 4. 
Design H in (15) is an OD ( s d + 2 , ( s 6 ) 4 μ 1 ( s 4 ) 2 μ 2 ) with μ 1 p q k / 2 that can be partitioned into p d disjoint groups of 2 g columns with the same stratification properties as design X * in Algorithm 3.
Table 9 summarizes example ODs constructed by Algorithms 3–5 for practical needs.

5. Conclusions, Limitations, and Future Research

In this paper, we have proposed a new rotation method to generate OLHDs that can achieve stratifications on s 2 × s or s × s 2 grids; moreover, most column pairs can achieve stratifications on s 2 × s 2 grids, and a large portion of column pairs can achieve stratifications on s 4 × s 2 and s 2 × s 4 grids. Furthermore, we introduce a new class of space-filling ODs with s 6 levels, s 4 levels, and mixed levels, which can guarantee desirable stratifications in two dimensions.
It is worth noting that the resulting OLHDs and ODs enjoy stratifications on finer grids that cannot be satisfied by the existing space-filling designs. To the best of our knowledge, this is a new development in the literature. The theoretical constructions are well established. All these properties make the resulting designs competitive for computer experiments. The proposed designs are constructed systematically, without relying on any optimization algorithm, and the methods are efficient from a time perspective.
Next, we provide a simple simulation example to illustrate the performance of the resulting OLHDs from the model perspective. First, we use the following three methods to screen the active effects: the least absolute shrinkage and selection operator (LASSO) in the ‘glmnet’ R package, the smoothly clipped absolute deviation (SCAD) in the ‘ncvreg’ R package, and the stepwise linear model regression following the AIC criterion; the first two methods were recently used in [21], and further details can be found there. Suppose the true model is
y = μ + β 1 x 1 + β 2 x 2 + β 3 x 3 + β 4 x 4 + β 5 x 5 + β 6 x 6 + β 1 , 3 x 1 x 3 + β 2 , 5 x 2 x 5 + β 4 , 6 x 4 x 6 + ϵ ,
where μ = 10 , β = ( β 1 , , β 6 , β 1 , 3 , β 2 , 5 , β 4 , 6 ) T = ( 7 , 3 , 5 , 5 , 3 , 7 , 4 , 3 , 3 ) T , and the random error ϵ N ( 0 , 1 ) . We use the first twelve columns of the designed OLHD ( 64 , 24 ) in Example 2 to generate the responses. All screening results are provided in Table 10, where the truly active factors are marked with the superscript ‘‘a’’ and identified ‘‘active factors’’ are indicated with ‘‘•’’.
From Table 10, it can be seen that each method identifies eleven active effects, and the three methods all obtain the same ten truly active effects. Next, we entered all of these thirteen active effects into the model in order to test the significance of the coefficients. Table 11 shows the estimates and significance test results.
From Table 11, the true active effects can be correctly identified as { μ , x 1 , x 2 , x 3 , x 4 , x 5 , x 6 , x 1 x 3 , x 2 x 5 , x 4 x 6 } . Then, we fitted the model in (17), with the R 2 of the model being 0.9378.
y ^ = 9.826 + 6.887 x 1 + 3.360 x 2 4.747 x 3 3.725 x 4 + 3.573 x 5 + 7.984 x 6 + 5.051 x 1 x 3 4.787 x 2 x 5 3.970 x 4 x 6 .
This result is very close to the real model.
The computation was implemented on a personal computer with an Intel i5-4210H CPU and 2.90 GHz, which needed 0.384 seconds to generate the design, screen the active effects, and fit the model.
Due to the utilization of the rotation method, the run sizes of the obtained designs are restricted to prime powers, and certain two-dimensional stratification properties are not satisfied by all the column pairs, only a large proportion of them. Due to time restrictions, we do not provide an empirical example here. These issues are, however, deserving of future work. In this paper, we consider the space-filling properties measured by the two-dimensional stratifications; however, other criteria, for example, the maximin distance criterion, can be suitable choices as well. Constructions of column-orthogonal designs using the maximin distance and flexible run sizes are interesting topics for future research.

Author Contributions

S.-N.L.: conceptualization, methodology, formal analysis, writing—original draft preparation; J.-Y.Y.: methodology, formal analysis, writing—review and editing, supervision; M.-Q.L.: methodology, supervision, writing—review and editing, funding acquisition. All authors have read and agreed to the published version of the manuscript.

Funding

This work was supported by the National Natural Science Foundation of China (Grant Nos. 12131001 and 12226343) and the National Ten Thousand Talents Program of China.

Data Availability Statement

Not applicable.

Conflicts of Interest

The authors declare no conflict of interest.

Appendix A

First, we introduce a lemma from [14] that is crucial for the construction in this paper.
Lemma A1
([14]). Let A be an ( s 2 ) g -full factorial and define a difference scheme D ( s 2 , s 2 , s 2 ) = ( d 1 , , d s 2 ) . For j = 1 , , s 2 , let B j = d j A . Then, for any column b in B j , ( B i , b ) must be an ( s 2 ) g + 1 -full factorial for any i j .
Proof of Theorem 1. 
We first show that Z is an LHD. Because each B i is an s d full factorial design with elements from { 0 , 1 , , s 1 } , it is the case that f i , j = s b i , 2 j 1 + b i , 2 j has levels { 0 , 1 , , s 2 1 } and F i = ( f i , 1 , , f i , d / 2 ) is an ( s 2 ) d / 2 full factorial design for any i = 1 , , p . Due to Lemma A1, ( φ 1 , j 1 ( F i ) , b ) is a d / 2 + 1 full factorial design where b is one column in φ 1 , j 1 ( F i ) , j 1 j 1 = 1 , , s 2 / 2 , and i = 1 , , p . For each φ 1 , j 1 ( F i ) , we can create ( φ 2 , j 2 ( F i ) , φ 2 , j 2 ( F i ) ) with j 2 j 2 = 1 , , s 2 / 2 and i = 1 , , p such that φ 2 , j 2 ( F i ) by applying Lemma A1 twice; this results in certain sub-arrays of d / 2 + 2 columns being full factorials. In general, for any integer k, ( φ k , j k ( F i ) , φ k , j k ( F i ) ) with j k j k = 1 , , s 2 / 2 and i = 1 , , p has the property that certain sub-arrays of d / 2 + k columns are full factorials. Thus, all possible ( d / 2 + k ) -tuples with elements from { ( s 2 1 ) / 2 , ( s 2 3 ) / 2 , , ( s 2 1 ) / 2 } appear equally often in F k , i * , for i = 1 , , p . Due to the property of R u , k , it can be verified that the ith column of Z is a permutation of { ( s d + 2 k 1 ) / 2 , ( s d + 2 k 3 ) / 2 , , ( s d + 2 k 1 ) / 2 } , which implies that Z is an LHD.
Next, we prove the orthogonality of Z. As R is column-orthogonal, we only need to prove the orthogonality of F k * . For any column ξ , φ k , j k ( ξ ) has two columns. We denote the first column of φ k , j k ( ξ ) as φ k , j k 1 ( ξ ) and the second column of φ k , j k ( ξ ) as φ k , j k 2 ( ξ ) . For any two columns φ k , j k q ( s b i , 2 j 1 + b i , 2 j ) + ( 1 s 2 ) / 2 and φ k , j k q ( s b h , 2 l 1 + b h , 2 l ) + ( 1 s 2 ) / 2 in F k * with j k , j k = 0 , 1 , , s 2 / 2 1 and q = 1 , 2 , we have s b i , 2 j 1 + b i , 2 j + ( 1 s 2 ) / 2 = s [ b i , 2 j 1 + ( 1 s ) / 2 ] + ( b i , 2 j ) + ( 1 s ) / 2 ] and s b h , 2 l 1 + b h , 2 l + ( 1 s 2 ) / 2 = s [ b h , 2 l 1 + ( 1 s ) / 2 ] + [ b h , 2 l + ( 1 s ) / 2 ] . Then,
[ s b i , 2 j 1 + b i , 2 j + ( 1 s 2 ) / 2 ] T [ s b h , 2 l 1 + b h , 2 l + ( 1 s 2 ) / 2 ] = 0
where i h = 1 , , p and j l = 1 , , d / 2 1 . It follows that ( B 1 , . . . , B p ) is an O A ( s d , p d , s , 2 ) . Then, we can find that when j h , the columns in φ k , j k ( s b i , 2 j 1 + b i , 2 j ) ( 1 s 2 ) / 2 and φ k , j k ( s b h , 2 l 1 + b h , 2 l ) ( 1 s 2 ) / 2 are column-orthogonal. When j = h and j k j k , we can find that φ k , j k ( s b i , 2 j 1 + b i , 2 j ) ( 1 s 2 ) / 2 and φ k , j k ( s b h , 2 l 1 + b h , 2 l ) ( 1 s 2 ) / 2 are column-orthogonal based on the properties of the difference scheme. Thus, Z is an OLHD.
Next, we prove the stratification properties of (1) and (2). It can be seen that after collapsing the levels of Z to the s 2 level, we obtain F k . Thus, we only need to prove the stratification property of F k . For any i = 1 , , p and j = 1 , , s 2 / 2 , it is easy to find that any two columns from φ k , j ( F i ) can achieve a stratification on an s 2 × s 2 grid, as F i is a d / 2 full factorial design. From the properties of the difference scheme, we can find that if j j , any two columns from φ k , j ( F i ) and φ k , j ( F i ) can achieve a stratification on an s 2 × s 2 grid. Now, we consider two columns from F k , i and F k , i for i i . According to proof of Theorem 1 in [16], the column pairs in F k can only have the following structures:
  • (a). ( φ k , j q ( s X + Y ) , φ k , j q ( s ( X + l Y ) + L ) or ( φ k , j q ( s X + Y ) , φ k j q ( s L + ( X + l Y ) ) ) ,
  • (b). ( φ k , j q ( s X + Y ) , φ k , j q ( s M + N ) ) or ( φ k , j q ( s X + Y ) , φ k j q ( s N + M ) ) ,
  • where j , j = 1 , , s 2 / 2 , q = 1 , 2 , and X, Y, L, M, N are independent columns of F. Here, X + l Y denotes any interaction of X and Y with l = 1 , , s 1 and L, M, N denote the factors that are not the interactions of X and Y. If two columns have structure (a) and j = j , they can only achieve a stratification on an s × s 2 or s 2 × s grid. It is easy to check that there are less than p d γ ( s 1 ) / 2 such pairs in F k . The other column pairs having structure (b) or (a) with j j can achieve stratifications on s 2 × s 2 grids. When the other column pairs have structure (b), then s X + Y and s M + N is orthogonal. Thus, they can achieve stratifications on s 2 × s 2 grids. If the other column pairs have structure (a) with j j , they can achieve stratifications on s 2 × s 2 grids based on the properties of difference scheme.
Now, we prove property (3). For any two columns z 1 and z 2 of Z, we collapse the s d + 2 k levels of z 1 into s 2 levels in Ω ( s 2 ) using mapping g 1 and collapse the s d + 2 k levels of z 2 into s 4 levels in Ω ( s 4 ) using mapping g 2 . Then, we have g 1 ( z 1 ) = φ k , j q ( f i ) and g 2 ( z 2 ) = s 2 φ k , j q ( f l ) ± φ k , j q ( f l ) , where j j = 1 , , s 2 / 2 , q = 1 , 2 , f i and f l are from F, and i , l = 1 , , p d / 2 . As the column pairs in F k can only have structure (a) or (b) and if φ k , j q ( f i ) , φ k , j q ( f l ) have structure (b), j j , ( φ k , j q ( f i ) , φ k , j q ( f l ) , φ k , j q ( f l ) ) from an OA ( s d + 2 k , 3 , s 2 , 3 ) . Thus, they can achieve stratifications on s 2 × s 4 grids. In a similar way, it is clear that they can achieve stratifications on s 4 × s 2 grids as well. It easy to see that only p d ( p d / 2 1 ) / 4 p d ( s 1 ) / 2 column pairs have structure (b) in F. Thus, we have at least p d ( p d / 2 1 ) / 4 p d ( s 1 ) / 2 γ ( γ 1 ) = p d γ ( p d 4 s + 2 ) ( γ 1 ) / 8 column pairs achieving stratifications on s 2 × s 4 and s 4 × s 2 grids. The proof is completed. □
Proof of Corollary 1. 
We only need to prove the stratification property of M which follows from the property of F k ( l ) * , where l = 1 , , t . When collapsed into s levels, f i 1 , h ( l 1 ) becomes b i 1 , 2 h 1 ( l 1 ) and f i 2 , g ( l 2 ) becomes b i 2 , 2 g 1 ( l 2 ) , where f i 1 , h ( l 1 ) and f i 2 , g ( l 2 ) are the hth column of F i 1 ( l 1 ) and the gth column of F i 2 ( l 2 ) , respectively, and b i 1 , 2 h 1 ( l 1 ) and b i 2 , 2 g 1 ( l 2 ) are the (2h − 1)th column of B i 1 ( l 1 ) and the (2g − 1)th column of B i 2 ( l 2 ) , respectively.
  • Case 1: 
If l 1 = l 2 and ( i 1 , h ) ( i 2 , g ) , the two columns are in the same M i and achieve the same stratification as in Theorem 1.
  • Case 2: 
If l 1 l 2 and ( i 1 , h ) ( i 2 , g ) , ( b i 1 , 2 h 1 ( l 1 ) , b i 2 , 2 g 1 ( l 2 ) ) and ( f i 1 , h ( l 1 ) , f i 2 , g ( l 2 ) ) are orthogonal. Based on the properties of difference scheme, ( φ k j ( f i 1 , h ( l 1 ) ) , φ k j ( f i 2 , g ( l 2 ) ) ) is an OA for j , j = 1 , , s 2 / 2 . Thus, the hth column of F k , i 1 ( l 1 ) and the gth column of F k , i 2 ( l 2 ) can achieve a stratification on an s × s grid. Then, if ( i 1 , h ) = ( i 2 , g ) , ( b i 1 , 2 h 1 ( l 1 ) , b i 2 , 2 g 1 ( l 2 ) ) may not be an OA and fails to guarantee stratification on an s × s grid. Thus, similar to the proof of Theorem 1, we can find that at least 2 k p d t ( 2 k p d t 2 t ) / 8 column pairs in M can achieve stratifications on s × s grids. The proof is completed. □
Proof of Theorem 2. 
First, we need to prove the orthogonality; as R 4 is column-orthogonal, we only need to prove the orthogonality of E * . It is easy to find that s b i , l + b i , l + 1 + ( 1 s 2 ) / 2 = s [ b i , l + ( 1 s ) / 2 ] + [ b i , l + 1 + ( 1 s ) / 2 ] and s b k , h + b k , h + 1 + ( 1 s 2 ) / 2 = s [ b k , h + ( 1 s ) / 2 ] + [ b k , h + 1 + ( 1 s ) / 2 ] . Due to the property of ( B 1 , , B p ) ,
[ ( s b i , l + b i , l + 1 ) + ( 1 s 2 ) / 2 ] T [ s b k , h + b k , h + 1 + ( 1 s 2 ) / 2 ] = 0 ,
where i , k = 1 , , p and l , h = 1 , , d / 2 1 . Then, we can find that when l h , ( d j ( s b i , l + b i , l + 1 ) + ( 1 s 2 ) / 2 ) and ( d j ( s b k , h + b k , h + 1 ) + ( 1 s 2 ) / 2 ) are column-orthogonal. When l = h and j j , we can find that ( d j ( s b i , l + b i , l + 1 ) + ( 1 s 2 ) / 2 ) and ( d j ( s b k , h + b k , h + 1 ) + ( 1 s 2 ) / 2 ) are column-orthogonal based on the properties of the difference scheme. Thus, X * is an OD.
Next, we prove the stratification properties of X * . Note that
δ 1 ( x ) = s 4 e ± s 2 e ± e + ( s 6 1 ) / 2 s 4 s 2 1 2 = s 4 b 1 ± s 2 b 2 ± b 3 s 4 s 2 1 2 ,
where b 1 = e ( s 1 ) / 2 , b 2 = e ( s 1 ) / 2 , and b 3 = e ( s 1 ) / 2 . The elements of e, e , and e are in Ω ( s 2 ) ; thus, all the elements of b i fall into Ω ( s 2 ) , i = 1 , 2 , 3 . This indicates that the elements of s 2 b 2 ± b 3 must be less than s 4 . Therefore, we have δ 1 ( x ) = e . Similar to the proof of Theorem 1, according to proof of Theorem 1 in [16], the column pairs in F * have only the following two structures:
(a). ( d j ( s X + Y ) , d j ( s ( X + l Y ) + L ) ) or ( d j ( s X + Y ) , d j ( s L + ( X + l Y ) ) ) ,
(b). ( d j ( s X + Y ) , d j ( s M + N ) ) or ( d j ( s X + Y ) , d j ( s N + M ) ) ,
Here, X, Y, L, M, N are independent columns of F, X + l Y denotes any interaction of X and Y with l = 1 , . , s 1 , and L, M, N denote the factors that are not interactions of X and Y, where j , j = 0 , 1 , , s 2 / 2 1 . If two columns have structure (a) and j = j , they can only achieve stratifications on an s × s 2 or s 2 × s grid. It is easy to check that there are less than 2 k p ( s 1 ) column pairs in E * when p k is even and 2 ( k p 1 ) ( s 1 ) column pairs in E * when p k is odd. The other column pairs with structure (b) or (a) for j j can achieve stratifications on s 2 × s 2 grids. This completes the proof of properties (1) and (2).
Any two columns x 1 and x 2 of X * can be expressed as
x 1 = s 4 e 1 ± s 2 e 1 ± e 1 , x 2 = s 4 e 2 ± s 2 e 2 ± e 2 .
Based on the previous discussion, it is easy to see that e 1 and e 1 are from the same E i , j , and as such are e 2 and e 2 . Now, we collapse the s 6 levels in Ω ( s 6 ) of x 1 into s 2 levels in Ω ( s 2 ) using mapping δ 1 in (11) and collapse the s 6 levels in Ω ( s 6 ) of x 2 into s 4 levels in Ω ( s 4 ) using mapping δ 2 as
δ 2 ( z ) = z + ( s 6 1 ) / 2 s 2 s 4 1 2 .
Then, we have δ 1 ( x 1 ) = e 1 and δ 2 ( x 2 ) = s 2 e 2 ± e 2 , where e 1 = d j L , e 2 = d j M , e 2 = d j N , and L , M , N are independent columns of F. If e 1 and e 2 have structure (b) and j j , then the two pairs ( e 1 , e 1 ) and ( e 2 , e 2 ) have structure (b) and j j as well. Only if e 2 and e 2 are not interactions of e 1 and e 1 , ( e 1 , s 2 e 2 ± e 2 ) can there be an OA ( s d + 2 , 2 , s 2 × s 4 , 2 ) . Similar to the proof of Theorem 1, at least μ ( p d 2 s + 1 ) ( g 1 ) / 8 column pairs achieve stratifications on s 2 × s 4 and s 4 × s 2 grids. This completes the proof of property (3). The proof is completed. □

Appendix B

Figure A1. Flowchart of Algorithm 2.
Figure A1. Flowchart of Algorithm 2.
Mathematics 11 01549 g0a1
Figure A2. Flowchart of Algorithm 3.
Figure A2. Flowchart of Algorithm 3.
Mathematics 11 01549 g0a2
Table A1. The OLHD ( 64 , 24 ) used in Example 2.
Table A1. The OLHD ( 64 , 24 ) used in Example 2.
123456789101112131415161718192021222324
1−31.5−16.5−28.5−19.5−31.5−16.5−28.5−19.5−31.5−16.5−28.5−19.5−31.5−16.5−28.5−19.5−31.5−16.5−28.5−19.5−31.5−16.5−28.5−19.5
2−27.5−1.5−24.5−2.5−27.5−1.5−24.5−2.5−19.528.5−16.531.5−19.528.5−16.531.5−10.5−5.5−9.5−6.5−10.5−5.5−9.5−6.5
3−23.513.5−20.514.5−23.513.5−20.514.5−6.59.5−5.510.5−6.59.5−5.510.514.520.513.523.514.520.513.523.5
4−19.528.5−16.531.5−19.528.5−16.531.5−10.5−5.5−9.5−6.5−10.5−5.5−9.5−6.527.51.524.52.527.51.524.52.5
5−14.5−20.5−13.5−23.5−14.5−20.5−13.5−23.523.5−13.520.5−14.523.5−13.520.5−14.5−2.524.5−1.527.5−2.524.5−1.527.5
6−10.5−5.5−9.5−6.5−10.5−5.5−9.5−6.527.51.524.52.527.51.524.52.5−23.513.5−20.514.5−23.513.5−20.514.5
7−6.59.5−5.510.5−6.59.5−5.510.514.520.513.523.514.520.513.523.519.5−28.516.5−31.519.5−28.516.5−31.5
8−2.524.5−1.527.5−2.524.5−1.527.52.5−24.51.5−27.52.5−24.51.5−27.56.5−9.55.5−10.56.5−9.55.5−10.5
92.5−24.51.5−27.52.5−24.51.5−27.56.5−9.55.5−10.56.5−9.55.5−10.510.55.59.56.510.55.59.56.5
106.5−9.55.5−10.56.5−9.55.5−10.510.55.59.56.510.55.59.56.531.516.528.519.531.516.528.519.5
1110.55.59.56.510.55.59.56.531.516.528.519.531.516.528.519.5−27.5−1.5−24.5−2.5−27.5−1.5−24.5−2.5
1214.520.513.523.514.520.513.523.519.5−28.516.5−31.519.5−28.516.5−31.5−14.5−20.5−13.5−23.5−14.5−20.5−13.5−23.5
1319.5−28.516.5−31.519.5−28.516.5−31.5−14.5−20.5−13.5−23.5−14.5−20.5−13.5−23.523.5−13.520.5−14.523.5−13.520.5−14.5
1423.5−13.520.5−14.523.5−13.520.5−14.5−2.524.5−1.527.5−2.524.5−1.527.52.5−24.51.5−27.52.5−24.51.5−27.5
1527.51.524.52.527.51.524.52.5−23.513.5−20.514.5−23.513.5−20.514.5−6.59.5−5.510.5−6.59.5−5.510.5
1631.516.528.519.531.516.528.519.5−27.5−1.5−24.5−2.5−27.5−1.5−24.5−2.5−19.528.5−16.531.5−19.528.5−16.531.5
17−30.5−17.5−8.5−7.511.54.529.518.5−30.5−17.5−8.5−7.511.54.529.518.5−30.5−17.5−8.5−7.511.54.529.518.5
18−26.5−0.5−12.5−22.515.521.525.53.5−18.529.5−4.511.57.5−8.517.5−30.5−11.5−4.5−29.5−18.530.517.58.57.5
19−22.512.5−0.526.53.5−25.521.5−15.5−7.58.5−17.530.518.5−29.54.5−11.515.521.525.53.5−26.5−0.5−12.5−22.5
20−18.529.5−4.511.57.5−8.517.5−30.5−11.5−4.5−29.5−18.530.517.58.57.526.50.512.522.5−15.5−21.5−25.5−3.5
21−15.5−21.5−25.5−3.526.50.512.522.522.5−12.50.5−26.5−3.525.5−21.515.5−3.525.5−21.515.522.5−12.50.5−26.5
22−11.5−4.5−29.5−18.530.517.58.57.526.50.512.522.5−15.5−21.5−25.5−3.5−22.512.5−0.526.53.5−25.521.5−15.5
23−7.58.5−17.530.518.5−29.54.5−11.515.521.525.53.5−26.5−0.5−12.5−22.518.5−29.54.5−11.5−7.58.5−17.530.5
24−3.525.5−21.515.522.5−12.50.5−26.53.5−25.521.5−15.5−22.512.5−0.526.57.5−8.517.5−30.5−18.529.5−4.511.5
253.5−25.521.5−15.5−22.512.5−0.526.57.5−8.517.5−30.5−18.529.5−4.511.511.54.529.518.5−30.5−17.5−8.5−7.5
267.5−8.517.5−30.5−18.529.5−4.511.511.54.529.518.5−30.5−17.5−8.5−7.530.517.58.57.5−11.5−4.5−29.5−18.5
2711.54.529.518.5−30.5−17.5−8.5−7.530.517.58.57.5−11.5−4.5−29.5−18.5−26.5−0.5−12.5−22.515.521.525.53.5
2815.521.525.53.5−26.5−0.5−12.5−22.518.5−29.54.5−11.5−7.58.5−17.530.5−15.5−21.5−25.5−3.526.50.512.522.5
2918.5−29.54.5−11.5−7.58.5−17.530.5−15.5−21.5−25.5−3.526.50.512.522.522.5−12.50.5−26.5−3.525.5−21.515.5
3022.5−12.50.5−26.5−3.525.5−21.515.5−3.525.5−21.515.522.5−12.50.5−26.53.5−25.521.5−15.5−22.512.5−0.526.5
3126.50.512.522.5−15.5−21.5−25.5−3.5−22.512.5−0.526.53.5−25.521.5−15.5−7.58.5−17.530.518.5−29.54.5−11.5
3230.517.58.57.5−11.5−4.5−29.5−18.5−26.5−0.5−12.5−22.515.521.525.53.5−18.529.5−4.511.57.5−8.517.5−30.5
33−29.5−18.511.54.529.518.5−11.5−4.5−29.5−18.511.54.529.518.5−11.5−4.5−29.5−18.511.54.529.518.5−11.5−4.5
34−25.5−3.515.521.525.53.5−15.5−21.5−17.530.57.5−8.517.5−30.5−7.58.5−8.5−7.530.517.58.57.5−30.5−17.5
35−21.515.53.5−25.521.5−15.5−3.525.5−4.511.518.5−29.54.5−11.5−18.529.512.522.5−26.5−0.5−12.5−22.526.50.5
36−17.530.57.5−8.517.5−30.5−7.58.5−8.5−7.530.517.58.57.5−30.5−17.525.53.5−15.5−21.5−25.5−3.515.521.5
37−12.5−22.526.50.512.522.5−26.5−0.521.5−15.5−3.525.5−21.515.53.5−25.5−0.526.522.5−12.50.5−26.5−22.512.5
38−8.5−7.530.517.58.57.5−30.5−17.525.53.5−15.5−21.5−25.5−3.515.521.5−21.515.53.5−25.521.5−15.5−3.525.5
39−4.511.518.5−29.54.5−11.5−18.529.512.522.5−26.5−0.5−12.5−22.526.50.517.5−30.5−7.58.5−17.530.57.5−8.5
40−0.526.522.5−12.50.5−26.5−22.512.50.5−26.5−22.512.5−0.526.522.5−12.54.5−11.5−18.529.5−4.511.518.5−29.5
410.5−26.5−22.512.5−0.526.522.5−12.54.5−11.5−18.529.5−4.511.518.5−29.58.57.5−30.5−17.5−8.5−7.530.517.5
424.5−11.5−18.529.5−4.511.518.5−29.58.57.5−30.5−17.5−8.5−7.530.517.529.518.5−11.5−4.5−29.5−18.511.54.5
438.57.5−30.5−17.5−8.5−7.530.517.529.518.5−11.5−4.5−29.5−18.511.54.5−25.5−3.515.521.525.53.5−15.5−21.5
4412.522.5−26.5−0.5−12.5−22.526.50.517.5−30.5−7.58.5−17.530.57.5−8.5−12.5−22.526.50.512.522.5−26.5−0.5
4517.5−30.5−7.58.5−17.530.57.5−8.5−12.5−22.526.50.512.522.5−26.5−0.521.5−15.5−3.525.5−21.515.53.5−25.5
4621.5−15.5−3.525.5−21.515.53.5−25.5−0.526.522.5−12.50.5−26.5−22.512.50.5−26.5−22.512.5−0.526.522.5−12.5
4725.53.5−15.5−21.5−25.5−3.515.521.5−21.515.53.5−25.521.5−15.5−3.525.5−4.511.518.5−29.54.5−11.5−18.529.5
4829.518.5−11.5−4.5−29.5−18.511.54.5−25.5−3.515.521.525.53.5−15.5−21.5−17.530.57.5−8.517.5−30.5−7.58.5
49−28.5−19.531.516.5−9.5−6.510.55.5−28.5−19.531.516.5−9.5−6.510.55.5−28.5−19.531.516.5−9.5−6.510.55.5
50−24.5−2.527.51.5−13.5−23.514.520.5−16.531.519.5−28.5−5.510.56.5−9.5−9.5−6.510.55.5−28.5−19.531.516.5
51−20.514.523.5−13.5−1.527.52.5−24.5−5.510.56.5−9.5−16.531.519.5−28.513.523.5−14.5−20.524.52.5−27.5−1.5
52−16.531.519.5−28.5−5.510.56.5−9.5−9.5−6.510.55.5−28.5−19.531.516.524.52.5−27.5−1.513.523.5−14.5−20.5
53−13.5−23.514.520.5−24.5−2.527.51.520.5−14.5−23.513.51.5−27.5−2.524.5−1.527.52.5−24.5−20.514.523.5−13.5
54−9.5−6.510.55.5−28.5−19.531.516.524.52.5−27.5−1.513.523.5−14.5−20.5−20.514.523.5−13.5−1.527.52.5−24.5
55−5.510.56.5−9.5−16.531.519.5−28.513.523.5−14.5−20.524.52.5−27.5−1.516.5−31.5−19.528.55.5−10.5−6.59.5
56−1.527.52.5−24.5−20.514.523.5−13.51.5−27.5−2.524.520.5−14.5−23.513.55.5−10.5−6.59.516.5−31.5−19.528.5
571.5−27.5−2.524.520.5−14.5−23.513.55.5−10.5−6.59.516.5−31.5−19.528.59.56.5−10.5−5.528.519.5−31.5−16.5
585.5−10.5−6.59.516.5−31.5−19.528.59.56.5−10.5−5.528.519.5−31.5−16.528.519.5−31.5−16.59.56.5−10.5−5.5
599.56.5−10.5−5.528.519.5−31.5−16.528.519.5−31.5−16.59.56.5−10.5−5.5−24.5−2.527.51.5−13.5−23.514.520.5
6013.523.5−14.5−20.524.52.5−27.5−1.516.5−31.5−19.528.55.5−10.5−6.59.5−13.5−23.514.520.5−24.5−2.527.51.5
6116.5−31.5−19.528.55.5−10.5−6.59.5−13.5−23.514.520.5−24.5−2.527.51.520.5−14.5−23.513.51.5−27.5−2.524.5
6220.5−14.5−23.513.51.5−27.5−2.524.5−1.527.52.5−24.5−20.514.523.5−13.51.5−27.5−2.524.520.5−14.5−23.513.5
6324.52.5−27.5−1.513.523.5−14.5−20.5−20.514.523.5−13.5−1.527.52.5−24.5−5.510.56.5−9.5−16.531.519.5−28.5
6428.519.5−31.5−16.59.56.5−10.5−5.5−24.5−2.527.51.5−13.5−23.514.520.5−16.531.519.5−28.5−5.510.56.5−9.5
Table A2. The OLHD ( 64 , 24 ) used in Example 3.
Table A2. The OLHD ( 64 , 24 ) used in Example 3.
123456789101112131415161718192021222324
1−31.5−16.5−28.5−19.5−31.5−16.5−28.5−19.5−31.5−16.5−28.5−19.5−31.5−16.5−28.5−19.5−31.5−16.5−28.5−19.5−31.5−16.5−28.5−19.5
2−30.5−17.5−8.5−7.5−28.5−19.531.516.5−10.5−5.5−9.5−6.5−30.5−17.5−8.5−7.5−28.5−19.531.516.5−10.5−5.5−9.5−6.5
3−29.5−18.511.54.5−9.5−6.510.55.511.54.529.518.5−29.5−18.511.54.5−9.5−6.510.55.511.54.529.518.5
4−28.5−19.531.516.5−10.5−5.5−9.5−6.530.517.58.57.5−28.5−19.531.516.5−10.5−5.5−9.5−6.530.517.58.57.5
5−11.5−4.5−29.5−18.529.518.5−11.5−4.5−8.5−7.530.517.5−11.5−4.5−29.5−18.529.518.5−11.5−4.5−8.5−7.530.517.5
6−10.5−5.5−9.5−6.530.517.58.57.5−29.5−18.511.54.5−10.5−5.5−9.5−6.530.517.58.57.5−29.5−18.511.54.5
7−9.5−6.510.55.511.54.529.518.528.519.5−31.5−16.5−9.5−6.510.55.511.54.529.518.528.519.5−31.5−16.5
8−8.5−7.530.517.58.57.5−30.5−17.59.56.5−10.5−5.5−8.5−7.530.517.58.57.5−30.5−17.59.56.5−10.5−5.5
98.57.5−30.5−17.59.56.5−10.5−5.510.55.59.56.58.57.5−30.5−17.59.56.5−10.5−5.510.55.59.56.5
109.56.5−10.5−5.510.55.59.56.531.516.528.519.59.56.5−10.5−5.510.55.59.56.531.516.528.519.5
1110.55.59.56.531.516.528.519.5−30.5−17.5−8.5−7.510.55.59.56.531.516.528.519.5−30.5−17.5−8.5−7.5
1211.54.529.518.528.519.5−31.5−16.5−11.5−4.5−29.5−18.511.54.529.518.528.519.5−31.5−16.5−11.5−4.5−29.5−18.5
1328.519.5−31.5−16.5−11.5−4.5−29.5−18.529.518.5−11.5−4.528.519.5−31.5−16.5−11.5−4.5−29.5−18.529.518.5−11.5−4.5
1429.518.5−11.5−4.5−8.5−7.530.517.58.57.5−30.5−17.529.518.5−11.5−4.5−8.5−7.530.517.58.57.5−30.5−17.5
1530.517.58.57.5−29.5−18.511.54.5−9.5−6.510.55.530.517.58.57.5−29.5−18.511.54.5−9.5−6.510.55.5
1631.516.528.519.5−30.5−17.5−8.5−7.5−28.5−19.531.516.531.516.528.519.5−30.5−17.5−8.5−7.5−28.5−19.531.516.5
17−27.5−1.5−24.5−2.5−27.5−1.5−24.5−2.5−27.5−1.5−24.5−2.514.520.513.523.514.520.513.523.514.520.513.523.5
18−26.5−0.5−12.5−22.5−24.5−2.527.51.5−14.5−20.5−13.5−23.515.521.525.53.513.523.5−14.5−20.527.51.524.52.5
19−25.5−3.515.521.5−13.5−23.514.520.515.521.525.53.512.522.5−26.5−0.524.52.5−27.5−1.5−26.5−0.5−12.5−22.5
20−24.5−2.527.51.5−14.5−20.5−13.5−23.526.50.512.522.513.523.5−14.5−20.527.51.524.52.5−15.5−21.5−25.5−3.5
21−15.5−21.5−25.5−3.525.53.5−15.5−21.5−12.5−22.526.50.526.50.512.522.5−12.5−22.526.50.525.53.5−15.5−21.5
22−14.5−20.5−13.5−23.526.50.512.522.5−25.5−3.515.521.527.51.524.52.5−15.5−21.5−25.5−3.512.522.5−26.5−0.5
23−13.5−23.514.520.515.521.525.53.524.52.5−27.5−1.524.52.5−27.5−1.5−26.5−0.5−12.5−22.5−13.5−23.514.520.5
24−12.5−22.526.50.512.522.5−26.5−0.513.523.5−14.5−20.525.53.5−15.5−21.5−25.5−3.515.521.5−24.5−2.527.51.5
2512.522.5−26.5−0.513.523.5−14.5−20.514.520.513.523.5−25.5−3.515.521.5−24.5−2.527.51.5−27.5−1.5−24.5−2.5
2613.523.5−14.5−20.514.520.513.523.527.51.524.52.5−24.5−2.527.51.5−27.5−1.5−24.5−2.5−14.5−20.5−13.5−23.5
2714.520.513.523.527.51.524.52.5−26.5−0.5−12.5−22.5−27.5−1.5−24.5−2.5−14.5−20.5−13.5−23.515.521.525.53.5
2815.521.525.53.524.52.5−27.5−1.5−15.5−21.5−25.5−3.5−26.5−0.5−12.5−22.5−13.5−23.514.520.526.50.512.522.5
2924.52.5−27.5−1.5−15.5−21.5−25.5−3.525.53.5−15.5−21.5−13.5−23.514.520.526.50.512.522.5−12.5−22.526.50.5
3025.53.5−15.5−21.5−12.5−22.526.50.512.522.5−26.5−0.5−12.5−22.526.50.525.53.5−15.5−21.5−25.5−3.515.521.5
3126.50.512.522.5−25.5−3.515.521.5−13.5−23.514.520.5−15.5−21.5−25.5−3.512.522.5−26.5−0.524.52.5−27.5−1.5
3227.51.524.52.5−26.5−0.5−12.5−22.5−24.5−2.527.51.5−14.5−20.5−13.5−23.515.521.525.53.513.523.5−14.5−20.5
33−23.513.5−20.514.5−23.513.5−20.514.5−23.513.5−20.514.523.5−13.520.5−14.523.5−13.520.5−14.523.5−13.520.5−14.5
34−22.512.5−0.526.5−20.514.523.5−13.5−2.524.5−1.527.522.5−12.50.5−26.520.5−14.5−23.513.52.5−24.51.5−27.5
35−21.515.53.5−25.5−1.527.52.5−24.53.5−25.521.5−15.521.5−15.5−3.525.51.5−27.5−2.524.5−3.525.5−21.515.5
36−20.514.523.5−13.5−2.524.5−1.527.522.5−12.50.5−26.520.5−14.5−23.513.52.5−24.51.5−27.5−22.512.5−0.526.5
37−3.525.5−21.515.521.5−15.5−3.525.5−0.526.522.5−12.53.5−25.521.5−15.5−21.515.53.5−25.50.5−26.5−22.512.5
38−2.524.5−1.527.522.5−12.50.5−26.5−21.515.53.5−25.52.5−24.51.5−27.5−22.512.5−0.526.521.5−15.5−3.525.5
39−1.527.52.5−24.53.5−25.521.5−15.520.5−14.5−23.513.51.5−27.5−2.524.5−3.525.5−21.515.5−20.514.523.5−13.5
40−0.526.522.5−12.50.5−26.5−22.512.51.5−27.5−2.524.50.5−26.5−22.512.5−0.526.522.5−12.5−1.527.52.5−24.5
410.5−26.5−22.512.51.5−27.5−2.524.52.5−24.51.5−27.5−0.526.522.5−12.5−1.527.52.5−24.5−2.524.5−1.527.5
421.5−27.5−2.524.52.5−24.51.5−27.523.5−13.520.5−14.5−1.527.52.5−24.5−2.524.5−1.527.5−23.513.5−20.514.5
432.5−24.51.5−27.523.5−13.520.5−14.5−22.512.5−0.526.5−2.524.5−1.527.5−23.513.5−20.514.522.5−12.50.5−26.5
443.5−25.521.5−15.520.5−14.5−23.513.5−3.525.5−21.515.5−3.525.5−21.515.5−20.514.523.5−13.53.5−25.521.5−15.5
4520.5−14.5−23.513.5−3.525.5−21.515.521.5−15.5−3.525.5−20.514.523.5−13.53.5−25.521.5−15.5−21.515.53.5−25.5
4621.5−15.5−3.525.5−0.526.522.5−12.50.5−26.5−22.512.5−21.515.53.5−25.50.5−26.5−22.512.5−0.526.522.5−12.5
4722.5−12.50.5−26.5−21.515.53.5−25.5−1.527.52.5−24.5−22.512.5−0.526.521.5−15.5−3.525.51.5−27.5−2.524.5
4823.5−13.520.5−14.5−22.512.5−0.526.5−20.514.523.5−13.5−23.513.5−20.514.522.5−12.50.5−26.520.5−14.5−23.513.5
49−19.528.5−16.531.5−19.528.5−16.531.5−19.528.5−16.531.5−6.59.5−5.510.5−6.59.5−5.510.5−6.59.5−5.510.5
50−18.529.5−4.511.5−16.531.519.5−28.5−6.59.5−5.510.5−7.58.5−17.530.5−5.510.56.5−9.5−19.528.5−16.531.5
51−17.530.57.5−8.5−5.510.56.5−9.57.5−8.517.5−30.5−4.511.518.5−29.5−16.531.519.5−28.518.5−29.54.5−11.5
52−16.531.519.5−28.5−6.59.5−5.510.518.5−29.54.5−11.5−5.510.56.5−9.5−19.528.5−16.531.57.5−8.517.5−30.5
53−7.58.5−17.530.517.5−30.5−7.58.5−4.511.518.5−29.5−18.529.5−4.511.54.5−11.5−18.529.5−17.530.57.5−8.5
54−6.59.5−5.510.518.5−29.54.5−11.5−17.530.57.5−8.5−19.528.5−16.531.57.5−8.517.5−30.5−4.511.518.5−29.5
55−5.510.56.5−9.57.5−8.517.5−30.516.5−31.5−19.528.5−16.531.519.5−28.518.5−29.54.5−11.55.5−10.5−6.59.5
56−4.511.518.5−29.54.5−11.5−18.529.55.5−10.5−6.59.5−17.530.57.5−8.517.5−30.5−7.58.516.5−31.5−19.528.5
574.5−11.5−18.529.55.5−10.5−6.59.56.5−9.55.5−10.517.5−30.5−7.58.516.5−31.5−19.528.519.5−28.516.5−31.5
585.5−10.5−6.59.56.5−9.55.5−10.519.5−28.516.5−31.516.5−31.5−19.528.519.5−28.516.5−31.56.5−9.55.5−10.5
596.5−9.55.5−10.519.5−28.516.5−31.5−18.529.5−4.511.519.5−28.516.5−31.56.5−9.55.5−10.5−7.58.5−17.530.5
607.5−8.517.5−30.516.5−31.5−19.528.5−7.58.5−17.530.518.5−29.54.5−11.55.5−10.5−6.59.5−18.529.5−4.511.5
6116.5−31.5−19.528.5−7.58.5−17.530.517.5−30.5−7.58.55.5−10.5−6.59.5−18.529.5−4.511.54.5−11.5−18.529.5
6217.5−30.5−7.58.5−4.511.518.5−29.54.5−11.5−18.529.54.5−11.5−18.529.5−17.530.57.5−8.517.5−30.5−7.58.5
6318.5−29.54.5−11.5−17.530.57.5−8.5−5.510.56.5−9.57.5−8.517.5−30.5−4.511.518.5−29.5−16.531.519.5−28.5
6419.5−28.516.5−31.5−18.529.5−4.511.5−16.531.519.5−28.56.5−9.55.5−10.5−7.58.5−17.530.5−5.510.56.5−9.5
Table A3. The OD ( 64 , 16 24 ) used in Example 4.
Table A3. The OD ( 64 , 16 24 ) used in Example 4.
123456789101112131415161718192021222324
1−7.5−4.5−7.5−4.5−7.5−4.5−7.5−4.5−7.5−4.5−7.5−4.5−7.5−4.5−7.5−4.5−7.5−4.5−7.5−4.5−7.5−4.5−7.5−4.5
2−7.5−4.5−2.5−1.5−7.5−4.57.54.5−2.5−1.5−2.5−1.5−7.5−4.5−2.5−1.5−7.5−4.57.54.5−2.5−1.5−2.5−1.5
3−7.5−4.52.51.5−2.5−1.52.51.52.51.57.54.5−7.5−4.52.51.5−2.5−1.52.51.52.51.57.54.5
4−7.5−4.57.54.5−2.5−1.5−2.5−1.57.54.52.51.5−7.5−4.57.54.5−2.5−1.5−2.5−1.57.54.52.51.5
5−2.5−1.5−7.5−4.57.54.5−2.5−1.5−2.5−1.57.54.5−2.5−1.5−7.5−4.57.54.5−2.5−1.5−2.5−1.57.54.5
6−2.5−1.5−2.5−1.57.54.52.51.5−7.5−4.52.51.5−2.5−1.5−2.5−1.57.54.52.51.5−7.5−4.52.51.5
7−2.5−1.52.51.52.51.57.54.57.54.5−7.5−4.5−2.5−1.52.51.52.51.57.54.57.54.5−7.5−4.5
8−2.5−1.57.54.52.51.5−7.5−4.52.51.5−2.5−1.5−2.5−1.57.54.52.51.5−7.5−4.52.51.5−2.5−1.5
92.51.5−7.5−4.52.51.5−2.5−1.52.51.52.51.52.51.5−7.5−4.52.51.5−2.5−1.52.51.52.51.5
102.51.5−2.5−1.52.51.52.51.57.54.57.54.52.51.5−2.5−1.52.51.52.51.57.54.57.54.5
112.51.52.51.57.54.57.54.5−7.5−4.5−2.5−1.52.51.52.51.57.54.57.54.5−7.5−4.5−2.5−1.5
122.51.57.54.57.54.5−7.5−4.5−2.5−1.5−7.5−4.52.51.57.54.57.54.5−7.5−4.5−2.5−1.5−7.5−4.5
137.54.5−7.5−4.5−2.5−1.5−7.5−4.57.54.5−2.5−1.57.54.5−7.5−4.5−2.5−1.5−7.5−4.57.54.5−2.5−1.5
147.54.5−2.5−1.5−2.5−1.57.54.52.51.5−7.5−4.57.54.5−2.5−1.5−2.5−1.57.54.52.51.5−7.5−4.5
157.54.52.51.5−7.5−4.52.51.5−2.5−1.52.51.57.54.52.51.5−7.5−4.52.51.5−2.5−1.52.51.5
167.54.57.54.5−7.5−4.5−2.5−1.5−7.5−4.57.54.57.54.57.54.5−7.5−4.5−2.5−1.5−7.5−4.57.54.5
17−6.5−0.5−6.5−0.5−6.5−0.5−6.5−0.5−6.5−0.5−6.5−0.53.55.53.55.53.55.53.55.53.55.53.55.5
18−6.5−0.5−3.5−5.5−6.5−0.56.50.5−3.5−5.5−3.5−5.53.55.56.50.53.55.5−3.5−5.56.50.56.50.5
19−6.5−0.53.55.5−3.5−5.53.55.53.55.56.50.53.55.5−6.5−0.56.50.5−6.5−0.5−6.5−0.5−3.5−5.5
20−6.5−0.56.50.5−3.5−5.5−3.5−5.56.50.53.55.53.55.5−3.5−5.56.50.56.50.5−3.5−5.5−6.5−0.5
21−3.5−5.5−6.5−0.56.50.5−3.5−5.5−3.5−5.56.50.56.50.53.55.5−3.5−5.56.50.56.50.5−3.5−5.5
22−3.5−5.5−3.5−5.56.50.53.55.5−6.5−0.53.55.56.50.56.50.5−3.5−5.5−6.5−0.53.55.5−6.5−0.5
23−3.5−5.53.55.53.55.56.50.56.50.5−6.5−0.56.50.5−6.5−0.5−6.5−0.5−3.5−5.5−3.5−5.53.55.5
24−3.5−5.56.50.53.55.5−6.5−0.53.55.5−3.5−5.56.50.5−3.5−5.5−6.5−0.53.55.5−6.5−0.56.50.5
253.55.5−6.5−0.53.55.5−3.5−5.53.55.53.55.5−6.5−0.53.55.5−6.5−0.56.50.5−6.5−0.5−6.5−0.5
263.55.5−3.5−5.53.55.53.55.56.50.56.50.5−6.5−0.56.50.5−6.5−0.5−6.5−0.5−3.5−5.5−3.5−5.5
273.55.53.55.56.50.56.50.5−6.5−0.5−3.5−5.5−6.5−0.5−6.5−0.5−3.5−5.5−3.5−5.53.55.56.50.5
283.55.56.50.56.50.5−6.5−0.5−3.5−5.5−6.5−0.5−6.5−0.5−3.5−5.5−3.5−5.53.55.56.50.53.55.5
296.50.5−6.5−0.5−3.5−5.5−6.5−0.56.50.5−3.5−5.5−3.5−5.53.55.56.50.53.55.5−3.5−5.56.50.5
306.50.5−3.5−5.5−3.5−5.56.50.53.55.5−6.5−0.5−3.5−5.56.50.56.50.5−3.5−5.5−6.5−0.53.55.5
316.50.53.55.5−6.5−0.53.55.5−3.5−5.53.55.5−3.5−5.5−6.5−0.53.55.5−6.5−0.56.50.5−6.5−0.5
326.50.56.50.5−6.5−0.5−3.5−5.5−6.5−0.56.50.5−3.5−5.5−3.5−5.53.55.56.50.53.55.5−3.5−5.5
33−5.53.5−5.53.5−5.53.5−5.53.5−5.53.5−5.53.55.5−3.55.5−3.55.5−3.55.5−3.55.5−3.55.5−3.5
34−5.53.5−0.56.5−5.53.55.5−3.5−0.56.5−0.56.55.5−3.50.5−6.55.5−3.5−5.53.50.5−6.50.5−6.5
35−5.53.50.5−6.5−0.56.50.5−6.50.5−6.55.5−3.55.5−3.5−0.56.50.5−6.5−0.56.5−0.56.5−5.53.5
36−5.53.55.5−3.5−0.56.5−0.56.55.5−3.50.5−6.55.5−3.5−5.53.50.5−6.50.5−6.5−5.53.5−0.56.5
37−0.56.5−5.53.55.5−3.5−0.56.5−0.56.55.5−3.50.5−6.55.5−3.5−5.53.50.5−6.50.5−6.5−5.53.5
38−0.56.5−0.56.55.5−3.50.5−6.5−5.53.50.5−6.50.5−6.50.5−6.5−5.53.5−0.56.55.5−3.5−0.56.5
39−0.56.50.5−6.50.5−6.55.5−3.55.5−3.5−5.53.50.5−6.5−0.56.5−0.56.5−5.53.5−5.53.55.5−3.5
40−0.56.55.5−3.50.5−6.5−5.53.50.5−6.5−0.56.50.5−6.5−5.53.5−0.56.55.5−3.5−0.56.50.5−6.5
410.5−6.5−5.53.50.5−6.5−0.56.50.5−6.50.5−6.5−0.56.55.5−3.5−0.56.50.5−6.5−0.56.5−0.56.5
420.5−6.5−0.56.50.5−6.50.5−6.55.5−3.55.5−3.5−0.56.50.5−6.5−0.56.5−0.56.5−5.53.5−5.53.5
430.5−6.50.5−6.55.5−3.55.5−3.5−5.53.5−0.56.5−0.56.5−0.56.5−5.53.5−5.53.55.5−3.50.5−6.5
440.5−6.55.5−3.55.5−3.5−5.53.5−0.56.5−5.53.5−0.56.5−5.53.5−5.53.55.5−3.50.5−6.55.5−3.5
455.5−3.5−5.53.5−0.56.5−5.53.55.5−3.5−0.56.5−5.53.55.5−3.50.5−6.55.5−3.5−5.53.50.5−6.5
465.5−3.5−0.56.5−0.56.55.5−3.50.5−6.5−5.53.5−5.53.50.5−6.50.5−6.5−5.53.5−0.56.55.5−3.5
475.5−3.50.5−6.5−5.53.50.5−6.5−0.56.50.5−6.5−5.53.5−0.56.55.5−3.5−0.56.50.5−6.5−0.56.5
485.5−3.55.5−3.5−5.53.5−0.56.5−5.53.55.5−3.5−5.53.5−5.53.55.5−3.50.5−6.55.5−3.5−5.53.5
49−4.57.5−4.57.5−4.57.5−4.57.5−4.57.5−4.57.5−1.52.5−1.52.5−1.52.5−1.52.5−1.52.5−1.52.5
50−4.57.5−1.52.5−4.57.54.5−7.5−1.52.5−1.52.5−1.52.5−4.57.5−1.52.51.5−2.5−4.57.5−4.57.5
51−4.57.51.5−2.5−1.52.51.5−2.51.5−2.54.5−7.5−1.52.54.5−7.5−4.57.54.5−7.54.5−7.51.5−2.5
52−4.57.54.5−7.5−1.52.5−1.52.54.5−7.51.5−2.5−1.52.51.5−2.5−4.57.5−4.57.51.5−2.54.5−7.5
53−1.52.5−4.57.54.5−7.5−1.52.5−1.52.54.5−7.5−4.57.5−1.52.51.5−2.5−4.57.5−4.57.51.5−2.5
54−1.52.5−1.52.54.5−7.51.5−2.5−4.57.51.5−2.5−4.57.5−4.57.51.5−2.54.5−7.5−1.52.54.5−7.5
55−1.52.51.5−2.51.5−2.54.5−7.54.5−7.5−4.57.5−4.57.54.5−7.54.5−7.51.5−2.51.5−2.5−1.52.5
56−1.52.54.5−7.51.5−2.5−4.57.51.5−2.5−1.52.5−4.57.51.5−2.54.5−7.5−1.52.54.5−7.5−4.57.5
571.5−2.5−4.57.51.5−2.5−1.52.51.5−2.51.5−2.54.5−7.5−1.52.54.5−7.5−4.57.54.5−7.54.5−7.5
581.5−2.5−1.52.51.5−2.51.5−2.54.5−7.54.5−7.54.5−7.5−4.57.54.5−7.54.5−7.51.5−2.51.5−2.5
591.5−2.51.5−2.54.5−7.54.5−7.5−4.57.5−1.52.54.5−7.54.5−7.51.5−2.51.5−2.5−1.52.5−4.57.5
601.5−2.54.5−7.54.5−7.5−4.57.5−1.52.5−4.57.54.5−7.51.5−2.51.5−2.5−1.52.5−4.57.5−1.52.5
614.5−7.5−4.57.5−1.52.5−4.57.54.5−7.5−1.52.51.5−2.5−1.52.5−4.57.5−1.52.51.5−2.5−4.57.5
624.5−7.5−1.52.5−1.52.54.5−7.51.5−2.5−4.57.51.5−2.5−4.57.5−4.57.51.5−2.54.5−7.5−1.52.5
634.5−7.51.5−2.5−4.57.51.5−2.5−1.52.51.5−2.51.5−2.54.5−7.5−1.52.54.5−7.5−4.57.54.5−7.5
644.5−7.54.5−7.5−4.57.5−1.52.5−4.57.54.5−7.51.5−2.51.5−2.5−1.52.5−4.57.5−1.52.51.5−2.5

References

  1. Fang, K.T.; Li, R.; Sudjianto, A. Design and Modeling for Computer Experiments; Chapman and Hall/CRC: New York, NY, USA, 2006. [Google Scholar]
  2. McKay, M.D.; Beckman, R.J.; Conover, W.J. A comparison of three methods for selecting values of input variables in the analysis of output from a computer code. Technometrics 1979, 21, 239–245. [Google Scholar]
  3. Wu, C.F.J.; Hamada, M.S. Experiments: Planning, Analysis and Optimization, 3rd ed.; John Wiley & Sons: New York, NY, USA, 2021. [Google Scholar]
  4. Tang, B. Orthogonal arrays based Latin hypercubes. J. Am. Stat. Assoc. 1993, 88, 1392–1397. [Google Scholar] [CrossRef]
  5. Joseph, V.R.; Gul, E.; Ba, S. Maximum projection designs for computer experiments. Biometrika 2015, 102, 371–380. [Google Scholar] [CrossRef]
  6. Sun, F.; Wang, Y.; Xu, H. Uniform projection designs. Ann. Stat. 2019, 47, 641–661. [Google Scholar] [CrossRef]
  7. He, Y.; Tang, B. Strong orthogonal arrays and associated Latin hypercubes for computer experiments. Biometrika 2013, 1, 254–260. [Google Scholar] [CrossRef]
  8. Mukerjee, R.; Sun, F.; Tang, B. Nearly orthogonal arrays mappable into fully orthogonal arrays. Biometrika 2014, 101, 957–963. [Google Scholar] [CrossRef]
  9. Bingham, D.; Sitter, R.R.; Tang, B. Orthogonal and nearly orthogonal designs for computer experiments. Biometrika 2009, 96, 51–65. [Google Scholar] [CrossRef] [Green Version]
  10. Steinberg, D.M.; Lin, D.K.J. A construction method for orthogonal Latin hypercube designs. Biometrika 2006, 93, 279–288. [Google Scholar] [CrossRef]
  11. Pang, F.; Liu, M.Q.; Lin, D.K.J. A construction method for orthogonal Latin hypercube designs with prime power levels. Stat. Sin. 2009, 19, 1721–1728. [Google Scholar]
  12. Lin, C.D.; Mukerjee, R.; Tang, B. Construction of orthogonal and nearly orthogonal Latin hypercubes. Biometrika 2009, 96, 243–247. [Google Scholar] [CrossRef]
  13. Georgiou, S.D.; Efthimiou, I. Some classes of orthogonal latin hypercube designs. Stat. Sin. 2014, 24, 101–120. [Google Scholar]
  14. Sun, F.; Tang, B. A general rotation method for orthogonal Latin hypercubes. Biometrika 2017, 104, 465–472. [Google Scholar]
  15. Yang, X.; Yang, J.F.; Liu, M.Q.; Zhou, Q. Column-orthogonal designs with multi-dimensional stratifications. Sci. China Math. 2021, 64, 1291–1304. [Google Scholar] [CrossRef]
  16. Li, H.; Yang, L.; Liu, M.Q. Construction of space-filling orthogonal Latin hypercube designs. Stat. Probab. Lett. 2022, 180, 109–245. [Google Scholar] [CrossRef]
  17. Sun, F.; Tang, B. A method of constructing space-filling orthogonal designs. J. Am. Stat. Assoc. 2017, 112, 683–689. [Google Scholar] [CrossRef]
  18. Wang, C.; Yang, J.; Liu, M.Q. Construction of space-filling orthogonal designs. J. Stat. Plan. Inference 2021, 213, 130–141. [Google Scholar] [CrossRef]
  19. Sun, F.; Liu, M.Q.; Lin, D.K.J. Construction of orthogonal Latin hypercube designs. Biometrika 2009, 96, 971–974. [Google Scholar] [CrossRef]
  20. Hedayat, A.S.; Sloane, N.J.A.; Stufken, J. Orthogonal Arrays: Theory and Applications; Springer: New York, NY, USA, 1999. [Google Scholar]
  21. Zheng, C.W.; Qi, Z.F.; Zhang, Q.Z.; Liu, M.Q. A method for augmenting supersaturated designs with newly added factors. Mathematics 2023, 11, 60. [Google Scholar] [CrossRef]
Figure 1. Flowchart of Algorithm 1.
Figure 1. Flowchart of Algorithm 1.
Mathematics 11 01549 g001
Figure 2. The pairwise scatter plots of the (1–5)th columns of OLHD ( 64 , 24 ) in Example 2.
Figure 2. The pairwise scatter plots of the (1–5)th columns of OLHD ( 64 , 24 ) in Example 2.
Mathematics 11 01549 g002
Table 1. The obtained 3 4 full factorial designs.
Table 1. The obtained 3 4 full factorial designs.
b i 1 b i 2 b i 3 b i 4
B 1 1 ( x 0 ) 2 ( x 1 ) 3 ( x 2 ) 4 ( x 3 )
B 2 12 2 ( x 4 ) 23 2 ( x 5 ) 34 2 ( x 6 ) 12 2 4 2 ( x 7 )
B 3 123 ( x 8 ) 234 ( x 9 ) 12 2 34 ( x 10 ) 123 2 4 ( x 11 )
B 4 14 2 ( x 12 ) 12 ( x 13 ) 23 ( x 14 ) 34 ( x 15 )
B 5 12 2 4 ( x 16 ) 13 2 ( x 17 ) 24 2 ( x 18 ) 12 2 3 2 ( x 19 )
B 6 23 2 4 2 ( x 20 ) 12 2 3 2 4 ( x 21 ) 13 2 4 2 ( x 22 ) 124 ( x 23 )
B 7 13 ( x 24 ) 24 ( x 25 ) 12 2 3 ( x 26 ) 23 2 4 ( x 27 )
B 8 12 2 34 2 ( x 28 ) 1234 2 ( x 29 ) 13 2 4 2 ( x 30 ) 123 2 4 ( x 31 )
B 9 134 2 ( x 32 ) 124 2 ( x 33 ) 123 2 ( x 34 ) 234 2 ( x 35 )
B 10 12 2 3 2 4 2 ( x 36 ) 1234 ( x 37 ) 134 ( x 38 ) 14 ( x 39 )
Table 2. F in Example 2.
Table 2. F in Example 2.
F 1 F 2 F 3
2 × 1 + 2 2 × 3 + 4 2 × 12 + 23 2 × 34 + 124 2 × 13 + 24 2 × 123 + 234
000000
010 x + 1 11
0x1xx x + 1
0 x + 1 11 x + 1 x
10 x + 1 11 x + 1
11 x + 1 x0x
1xx x + 1 x + 1 1
1 x + 1 x0x0
x0x1x1
x1xx x + 1 x
xx x + 1 x + 1 0 x + 1
x x + 1 x + 1 010
x + 1 010 x + 1 1
x + 1 11 x + 1 x0
x + 1 x0x1x
x + 1 x + 1 010 x + 1
Table 3. The stratification properties of the resulting design in Example 2.
Table 3. The stratification properties of the resulting design in Example 2.
4 × 16 16 × 4 2 × 4 4 × 2 4 × 4
count168180276260260
proportion (%)60.8765.2210094.2094.20
Table 4. Example OLHDs constructed by Algorithm 1.
Table 4. Example OLHDs constructed by Algorithm 1.
sdpk γ OLHD ( s d + 2 k , p d γ / 2 ) π α , LB π β , LB
24314OLHD ( 2 6 , 24 ) 91.3039.13
243216OLHD ( 2 8 , 96 ) 97.8947.37
283114OLHD ( 2 10 , 496 ) 99.6073.39
341018OLHD ( 3 6 , 160 ) 97.4866.04
3410264OLHD ( 3 8 , 1280 ) 99.6973.89
5439124OLHD ( 5 6 , 1872 ) 99.5784.82
74100148OLHD ( 7 6 , 9600 ) 99.8791.56
Table 5. Comparison with related designs.
Table 5. Comparison with related designs.
OLHD  1 OLHD  2 OLHD  3 OLHD  4
s N m m m m
21666126
264244820
22569612419262
21024496992204
38120204020
3729160160120
36561128016403280800
5625787815678
515,625187224961302
1 OLHDs obtained by Algorithm 1; 2 OLHDs in [16]; 3 OLHDs in [14]; 4 OLHDs in [15]. The (−) symbol indicates that the corresponding value is not available.
Table 6. The stratification properties of the resulting OLHD ( 64 , 24 ) in Example 3.
Table 6. The stratification properties of the resulting OLHD ( 64 , 24 ) in Example 3.
4 × 16 16 × 4 2 × 4 4 × 2 4 × 4
count176176272264260
proportion (%)63.7763.7798.5595.6594.20
Table 7. Example ODs constructed by Algorithm 3.
Table 7. Example ODs constructed by Algorithm 3.
sdpqgOA ( s d , s d 1 s 1 , s , 2 ) OD ( s d + 2 , ( s 6 ) 4 μ ) π α , LB π β , LB
24322OA ( 2 4 , 15 , 2 , 2 ) OD ( 2 6 , ( 64 ) 24 ) # 91.3039.13
25622OA ( 2 5 , 31 , 2 , 2 ) OD ( 2 7 , ( 64 ) 48 ) 95.7457.45
261032OA ( 2 6 , 63 , 2 , 2 ) OD ( 2 8 , ( 64 ) 120 ) 98.3268.07
271832OA ( 2 7 , 127 , 2 , 2 ) OD ( 2 9 , ( 64 ) 216 ) 99.0771.16
283142OA ( 2 8 , 255 , 2 , 2 ) OD ( 2 10 , ( 64 ) 496 ) 99.6073.33
341024OA ( 3 4 , 40 , 3 , 2 ) OD ( 3 6 , ( 729 ) 160 ) # 97.4864.78
352424OA ( 3 5 , 121 , 3 , 2 ) OD ( 3 7 , ( 729 ) 384 ) 98.9678.07
366034OA ( 3 6 , 364 , 3 , 2 ) OD ( 3 8 , ( 729 ) 1440 ) 99.7284.99
3715634OA ( 3 7 , 1093 , 3 , 2 ) OD ( 3 9 , ( 729 ) 3744 ) 99.8986.53
5439212OA ( 5 4 , 156 , 5 , 2 ) OD ( 5 6 , ( 15625 ) 1872 ) # 99.5784.82
The # symbol indicates that the design is also an OLHD.
Table 8. Example ODs constructed by Algorithm 4.
Table 8. Example ODs constructed by Algorithm 4.
sdpgOA ( s d , s d 1 s 1 , s , 2 ) OD ( s d + 2 , ( s 4 ) m ) π α , LB π β , LB
2432OA ( 2 4 , 15 , 2 , 2 ) OD ( 2 6 , ( 16 ) 24 ) 91.3039.13
2562OA ( 2 5 , 31 , 2 , 2 ) OD ( 2 7 , ( 16 ) 60 ) 95.7461.02
26102OA ( 2 6 , 63 , 2 , 2 ) OD ( 2 8 , ( 16 ) 120 ) 98.3268.07
27182OA ( 2 7 , 127 , 2 , 2 ) OD ( 2 9 , ( 16 ) 252 ) 99.0771.71
28312OA ( 2 8 , 255 , 2 , 2 ) OD ( 2 10 , ( 16 ) 496 ) 99.6073.33
34104OA ( 3 4 , 40 , 3 , 2 ) OD ( 3 6 , ( 81 ) 160 ) 97.4864.78
35244OA ( 3 5 , 121 , 3 , 2 ) OD ( 3 7 , ( 81 ) 480 ) 98.9679.96
36604OA ( 3 6 , 364 , 3 , 2 ) OD ( 3 8 , ( 81 ) 1440 ) 99.7284.99
371564OA ( 3 7 , 1093 , 3 , 2 ) OD ( 3 9 , ( 81 ) 4368 ) 99.8986.67
531012OA ( 5 3 , 31 , 5 , 2 ) OD ( 5 5 , ( 625 ) 360 ) 96.6538.44
543912OA ( 5 4 , 156 , 5 , 2 ) OD ( 5 6 , ( 625 ) 1872 ) 99.5784.82
Table 9. Example ODs constructed by Algorithms 3–5.
Table 9. Example ODs constructed by Algorithms 3–5.
OA ( s d , s d 1 s 1 , s , 2 ) OD ( s d + 2 , ( s 6 ) 4 μ 1 ) OD ( s d + 2 , ( s 4 ) 2 μ 2 ) OD ( s d + 2 , ( s 6 ) 4 μ 1 ( s 4 ) 2 μ 2 )
OA ( 2 4 , 15 , 2 , 2 ) OD ( 2 6 , ( 64 ) 24 ) OD ( 2 6 , ( 16 ) 24 ) OD ( 2 6 , 64 4 μ 1 16 2 μ 2 ) , 4 μ 1 + 2 μ 2 = 24
OA ( 2 5 , 31 , 2 , 2 ) OD ( 2 7 , ( 64 ) 48 ) OD ( 2 7 , ( 16 ) 60 ) OD ( 2 7 , 64 4 μ 1 16 2 μ 2 ) , 4 μ 1 + 2 μ 2 = 60
OA ( 2 6 , 63 , 2 , 2 ) OD ( 2 8 , ( 64 ) 120 ) OD ( 2 8 , ( 16 ) 120 ) OD ( 2 8 , 64 4 μ 1 16 2 μ 2 ) , 4 μ 1 + 2 μ 2 = 120
OA ( 2 7 , 127 , 2 , 2 ) OD ( 2 9 , ( 64 ) 216 ) OD ( 2 9 , ( 16 ) 252 ) OD ( 2 9 , 64 4 μ 1 16 2 μ 2 ) , 4 μ 1 + 2 μ 2 = 252
OA ( 2 8 , 255 , 2 , 2 ) OD ( 2 10 , ( 64 ) 496 ) OD ( 2 10 , ( 16 ) 496 ) OD ( 2 10 , 64 4 μ 1 16 2 μ 2 ) , 4 μ 1 + 2 μ 2 = 496
OA ( 3 4 , 40 , 3 , 2 ) OD ( 3 6 , ( 729 ) 160 ) OD ( 3 6 , ( 81 ) 160 ) OD ( 3 6 , 729 4 μ 1 81 2 μ 2 ) , 4 μ 1 + 2 μ 2 = 160
OA ( 3 5 , 121 , 3 , 2 ) OD ( 3 7 , ( 729 ) 384 ) OD ( 3 7 , ( 81 ) 480 ) OD ( 3 7 , 729 4 μ 1 81 2 μ 2 ) , 4 μ 1 + 2 μ 2 = 480
OA ( 3 6 , 364 , 3 , 2 ) OD ( 3 8 , ( 729 ) 1440 ) OD ( 3 8 , ( 81 ) 1440 ) OD ( 3 8 , 729 4 μ 1 81 2 μ 2 ) , 4 μ 1 + 2 μ 2 = 1440
OA ( 3 7 , 1093 , 3 , 2 ) OD ( 3 9 , ( 729 ) 3744 ) OD ( 3 9 , ( 81 ) 4368 ) OD ( 3 9 , 729 4 μ 1 81 2 μ 2 ) , 4 μ 1 + 2 μ 2 = 4368
Table 10. Screening result.
Table 10. Screening result.
Method μ a x 1 a x 2 a x 3 a x 4 a x 5 a x 6 a x 8 x 1 x 2 x 1 x 3 a x 2 x 5 a x 3 x 4 x 4 x 6 a
LASSO
SCAD
stepwise
Table 11. Estimates and significance test results.
Table 11. Estimates and significance test results.
True ValueEstimatep-ValueSignificance
μ 10 10.204 0.000 *Y
β 1 7 6.386 0.000 *Y
β 2 3 2.988 0.000 *Y
β 3 5 5.036 0.000 *Y
β 4 5 5.342 0.000 *Y
β 5 3 2.889 0.000 *Y
β 6 7 7.205 0.000 *Y
β 8 0 0.113 0.784N
β 1 , 2 0 0.823 0.683N
β 1 , 3 4 3.649 0.009 *Y
β 2 , 5 3 5.494 0.001 *Y
β 3 , 4 0 0.532 0.796N
β 4 , 6 3 2.744 0.047 *Y
The * symbol indicates that the coefficient is significant.
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.

Share and Cite

MDPI and ACS Style

Liu, S.-N.; Liu, M.-Q.; Yang, J.-Y. Construction of Column-Orthogonal Designs with Two-Dimensional Stratifications. Mathematics 2023, 11, 1549. https://doi.org/10.3390/math11061549

AMA Style

Liu S-N, Liu M-Q, Yang J-Y. Construction of Column-Orthogonal Designs with Two-Dimensional Stratifications. Mathematics. 2023; 11(6):1549. https://doi.org/10.3390/math11061549

Chicago/Turabian Style

Liu, Song-Nan, Min-Qian Liu, and Jin-Yu Yang. 2023. "Construction of Column-Orthogonal Designs with Two-Dimensional Stratifications" Mathematics 11, no. 6: 1549. https://doi.org/10.3390/math11061549

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop