Some mixed orthogonal arrays obtained by orthogonal projection matrices

The method of orthogonal decomposition of projection matrices is used to construct mixed orthogonal arrays of strength two. Several series of tight orthogonal arrays are constructed by using difference schemes. This method is also used to obtain some new 72-run, 100-run, and 108-run orthogonal arrays.     

Incomplete block designs through orthogonal and incomplete orthogonal arrays

The concept of an Incomplete Orthogonal Array (IOA) is extended to that of a Group Incomplete Orthogonal Array, abbreviated as GIOA. A few results are proved regarding the existence of some GIOA's. It is shown how Orthogonal Arrays and GIOA's can be exploited to construct new series of Balanced Incomplete Block (BIB) Designs and Partially Balanced Incomplete Block (PBIB) Designs with two or more associate classes.     

Space-filling orthogonal arrays of strength two

This paper considers the use of orthogonal arrays of strength two as experimental designs for fitting a surrogate model. Contrary to standard space-filling designs or Latin hypercube designs, the points of an orthogonal array of strength two are well distributed when they are projected on the two-dimensional faces of the unit cube. The aim is to determine if this property allows one to fit an accurate surrogate model when the computer response is governed by second-order interactions of some input variables. The first part of the paper is devoted to the construction of orthogonal arrays with space-filling properties. In the second part, orthogonal arrays are compared with standard designs for fitting a Gaussian process model.     

On orthogonal arrays attaining Rao's bounds

Rao (1947) provided two inequalities on parameters of an orthogonal array OA(N,m,s,t). An orthogonal array attaining these Rao bounds is said to be complete. Noda (1979) characterized complete orthogonal arrays of t=4 (strength). We here investigate complete orthogonal arrays with s=2 (levels) and general t; and with t=2, 3 and general s.     

Design selection for strong orthogonal arrays

Strong orthogonal arrays (SOAs) were recently introduced and studied as a class of space‐filling designs for computer experiments. An important problem that has not been addressed in the literature is that of design selection for such arrays. In this article, we conduct a systematic investigation into this problem, and we focus on the most useful SOA(n,m,4,2 + )s and SOA(n,m,4,2)s. This article first addresses the problem of design selection for SOAs of strength 2+ by examining their three‐dimensional projections. Both theoretical and computational results are presented. When SOAs of strength 2+ do not exist, we formulate a general framework for the selection of SOAs of strength 2 by looking at their two‐dimensional projections. The approach is fruitful, as it is applicable when SOAs of strength 2+ do not exist and it gives rise to them when they do. The Canadian Journal of Statistics 47: 302–314; 2019 © 2019 Statistical Society of Canada     

Classification of orthogonal arrays by integer programming

The problem of classifying all isomorphism classes of OA(N,k,s,t)$\mathrm{OA}(N,k,s,t)$'s is shown to be equivalent to finding all isomorphism classes of non-negative integer solutions to a system of linear equations under the symmetry group of the system of equations. A branch-and-cut algorithm developed by Margot [2002. Pruning by isomorphism in branch-and-cut. Math. Programming Ser. A 94, 71–90; 2003a. Exploiting orbits in symmetric ILP. Math. Programming Ser. B 98, 3–21; 2003b. Small covering designs by branch-and-cut. Math. Programming Ser. B 94, 207–220; 2007. Symmetric ILP: coloring and small integers. Discrete Optim., 4, 40–62] for solving integer programming problems with large symmetry groups is used to find all non-isomorphic OA(24,7,2,2)$\mathrm{OA}(24,7,2,2)$'s, OA(24,k,2,3)$\mathrm{OA}(24,k,2,3)$'s for 6?k?11$6?k?11$, OA(32,k,2,3)$\mathrm{OA}(32,k,2,3)$'s for 6?k?11$6?k?11$, OA(40,k,2,3)$\mathrm{OA}(40,k,2,3)$'s for 6?k?10$6?k?10$, OA(48,k,2,3)$\mathrm{OA}(48,k,2,3)$'s for 6?k?8$6?k?8$, OA(56,k,2,3)$\mathrm{OA}(56,k,2,3)$'s, OA(80,k,2,4)$\mathrm{OA}(80,k,2,4)$'s, OA(112,k,2,4)$\mathrm{OA}(112,k,2,4)$'s, for k=6,7$k=6,7$, OA(64,k,2,4)$\mathrm{OA}(64,k,2,4)$'s, OA(96,k,2,4)$\mathrm{OA}(96,k,2,4)$'s for k=7,8$k=7,8$, and OA(144,k,2,4)$\mathrm{OA}(144,k,2,4)$'s for k=8,9$k=8,9$. Further applications to classifying covering arrays with the minimum number of runs and packing arrays with the maximum number of runs are presented.     

The Hamming distances of saturated asymmetrical orthogonal arrays with strength 2

Abstract

Orthogonal arrays have many connections to other combinatorial designs and are applied in coding theory, the statistical design of experiments, cryptography, various types of software testing and quality control. In this paper, we present some general methods to find the Hamming distances for saturated asymmetrical orthogonal arrays (SAOAs) with strength 2. As applications of our methods, the Hamming distances of SAOA parents of size less than or equal to 100 are obtained. We also provide the Hamming distances of the SAOAs constructed from difference schemes or by the expansive replacement method. The feasibility of Hamming distances is discussed.     

Some robust parameter designs from orthogonal arrays

Robust parameter design, originally proposed by Taguchi [System of Experimental Design, Vols. I and II, UNIPUB, New York, 1987], is an offline production technique for reducing variation and improving a product's quality by using product arrays. However, the use of the product arrays results in an exorbitant number of runs. To overcome this drawback, several scientists proposed the use of combined arrays, where the control and noise factors are combined in a single array. In this paper, we use non-isomorphic orthogonal arrays as combined arrays, in order to identify a model that contains all the main effects (control and noise), their control-by-noise interactions and their control-by-control interactions with high efficiency. Some cases where the control-by-control-noise are of interest are also considered.     

Some resolvable orthogonal arrays with two symbols

A method of constructing a resolvable orthogonal array (4λk2,2) which can be partitioned into λ orthogonal arrays (4,k 2,1) is proposed. The number of constraints kfor this type of orthogonal array is at most 3λ. When λ=2 or a multiple of 4, an orthogonal array with the maximum number of constraints of 3λ can be constructed. When λ=4n+2(n≧1) an orthogonal array with 2λ+2 constraints can be constructed. When λ is an odd number, orthogonal arrays can be constructed for λ=3,5,7, and 9 with k=4,8,12, and 13 respectively.     

Optimal split‐plot orthogonal arrays

It is well known that many industrial experiments have split‐plot structures. Compared to completely randomised experiments, split‐plot designs are more economical and thus have received much attention among researchers. Much work has been done for two‐level split‐plot designs. In this article, we consider split‐plot designs with factors of three, more than three, or mixed levels and with both qualitative and quantitative factors. We show that if two designs with both qualitative and quantitative factors are geometrically isomorphic, then their generalised wordlength patterns are identical. Three design scenarios are considered for optimal designs. The corresponding wordlength patterns are defined and the minimum aberration mixed‐level split‐plot designs having 18 and 36 runs are tabulated.     

On the construction of balanced and orthogonal arrays

Two series of three symbol balanced arrays of strength two are constructed. Using special classes of BIB designs, two classes of two symbol orthogonal arrays of strength three are constructed.     

Construction of some new families of nested orthogonal arrays

Nested orthogonal arrays have been used in the design of an experimental setup consisting of two experiments, the expensive one of higher accuracy being nested in a larger and relatively less expensive one of lower accuracy. In this paper, we provide new methods for constructing two types of nested orthogonal arrays.     

Some new constructions of strength 3 mixed orthogonal arrays

Orthogonal arrays of strength 3 permit estimation of all the main effects of the experimental factors free from confounding or contamination with 2-factor interactions. We introduce methods of using arithmetic formulations and Latin squares to construct mixed orthogonal arrays of strength 3. Although the methods could be well extended to computing larger arrays, we confine computing to at most 100 run orthogonal arrays for practical uses. We find new arrays with run sizes 80 and 96, each has many distinct factor levels.     

An orthogonal arrays approach to robust parameter designs methodology

Robust parameter design methodology was originally introduced by Taguchi [14 Taguchi, G. 1986. Introduction to Quality Engineering: Designing Quality Into Products and Process, Tokyo: Asian Productivity Organization.  [Google Scholar]] as an engineering methodology for quality improvement of products and processes. A robust design of a system is one in which two different types of factors are varied; control factors and noise factors. Control factors are variables with levels that are adjustable, whereas noise factors are variables with levels that are hard or impossible to control during normal conditions, such as environmental conditions and raw-material properties. Robust parameter design aims at the reduction of process variation by properly selecting the levels of control factors so that the process becomes insensitive to changes in noise factors. Taguchi [14 Taguchi, G. 1986. Introduction to Quality Engineering: Designing Quality Into Products and Process, Tokyo: Asian Productivity Organization.  [Google Scholar] 15 Taguchi, G. 1987. System of Experimental Design, Vol. I and II, New York: UNIPUB.  [Google Scholar]] proposed the use of crossed arrays (inner–outer arrays) for robust parameter design. A crossed array is the cross-product of an orthogonal array (OA) involving control factors (inner array) and an OA involving noise factors (outer array). Objecting to the run size and the flexibility of crossed arrays, several authors combined control and noise factors in a single design matrix, which is called a combined array, instead of crossed arrays. In this framework, we present the use of OAs in Taguchi's methodology as a useful tool for designing robust parameter designs with economical run size.     

A note on embedding of orthogonal arrays of strength two

The problem of embedding an orthogonal array of strength 2 into a complete orthogonal array is discussed. It is shown that for any n≠4 any orthogonal array of strength 2 and deficiency 2 can always be embedded into a corresponding complete orthogonal array.     

On the construction of mixed orthogonal arrays of strength two

The generalized Kronecker sum was used by Wang and Wu (J. Amer. Statist. Assoc. 86 (1991) 450) and Dey and Midha (Statist. Probab. Lett. 28 (1996) 211; Proc. AP Akad. Sci. 5 (2001) 39) to construct mixed orthogonal arrays. We modify their methods to obtain several families of mixed orthogonal arrays. Some new arrays with run size less than 100 are found.     

Model identification using 27 runs three level orthogonal arrays

In this paper we examine all the combinatorial non-isomorphic OA(27, q, 3, t), with 3≤q≤13 three level quantitative factors, with respect to model identification, estimation capacity and efficiency. We use the popular D-efficiency criterion to evaluate the ability of each design considered in estimating the parameters of a second-order model with adequate efficiency. The prior selection of the ‘middle’ level of factors plays an important role in the results.     

A linear programming bound for orthogonal arrays with mixed levels

We show how the Delsarte theory can be used to obtain a linear programming bound for orthogonal arrays with mixed levels. Even for strength 2 this improves on the Rao bound in a large number of cases. The results point to several interesting sets of parameters for which the existence of the arrays is at present undecided.