An interchange algorithm for four factor orthogonal main effect plans

In this paper we give a construction for four factor orthogonal main effect plans (OMEPs) and an interchange algorithm to give four factor OMEPs with various different numbers of repeated runs.     

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 the construction of orthogonal factorial designs of resolution 11

A new method of construction of orthogonal resolution IV designs for symmetrical and asymmetrical factorials has been presented. Many new series of orthogonal factorial designs of resolution IV can be obtained by the above general method.     

A lower bound to the measure of optimality for main effect plans in the general asymmetric factorial experiments

A design d is called D-optimal if it maximizes det(M _d ) and is called MS-optimal if it maximizes tr(M _d ) and minimizes tr[(M _d )²] among those which maximize tr(M _d ), where M _d stands for the information matrix produced from d under a given model. In this paper, we establish a lower bound for tr[(M _d )²] with respect to a main effects model, where d is an s ₁×s ₂×···×s _m levels asymmetric orthogonal array of strength at least 1. Nonisomorphic asymmetrical MS-optimal orthogonal arrays of strength 1 with N=6, 8 and 12 runs are also presented.     

Some new classes of orthogonal Latin hypercube designs

Orthogonal Latin hypercube (OLH) is a good design choice in a polynomial function model for computer experiments, because it ensures uncorrelated estimation of linear effects when a first-order model is fitted. However, when a second-order model is adopted, an OLH also needs to satisfy the additional property that each column is orthogonal to the elementwise square of all columns and orthogonal to the elementwise product of every pair of columns. Such class of OLHs is called OLHs of order two while the former class just possessing two-dimensional orthogonality is called OLHs of order one. In this paper we present a general method for constructing OLHs of orders one and two for n=s^m$n=s^m$ runs, where s and m may be any positive integers greater than one, by rotating a grouped orthogonal array with a column-orthogonal rotation matrix. The Kronecker product and the stacking methods are revisited and combined to construct some new classes of OLHs of orders one and two with other flexible numbers of runs. Some useful OLHs of order one or two with larger factor-to-run ratio and moderate runs are tabulated and discussed.     

Pairwise orthogonal F-rectangle designs

The concept of pairwise orthogonal Latin square design is applied to r row by c column experiment designs which are called pairwise orthogonal F-rectangle designs. These designs are useful in designing successive and/or simulataneous experiments on the same set of rc experimental units, in constructing codes, and in constructing orthogonal arrays. A pair of orthogonal F-rectangle designs exists for any set of v treatment (symbols), whereas no pair of orthogonal Latin square designs of order two and six exists; one of the two construction methods presented does not rely on any previous knowledge about the existence of a pair of orthogonal Latin square designs, whereas the second one does. It is shown how to extend the methods to r=pv row by c=qv column designs and how to obtain t pairwise orthogonal F-rectangle design. When the maximum possible number of pairwise orthogonal F-rectangle designs is attained the set is said to be complete. Complete sets are obtained for all v for which v is a prime power. The construction method makes use of the existence of a complete set of pairwise orthogonal Latin square designs and of an orthogonal array with vⁿ columns, (vⁿ−1)/(v−1) rows, v symbols, and of strength two.     

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.     

Mixture experiments with process variables: d-optimal orthogonal experimental designs

Blending experiments with mixture in the presence of process variables are considered. We present an experimental design for quadratic (or linear) blending. The design in two orthogonal blocks is D-optimized in the case where there are no restrictions on the blending in two orthogonal blocks is presented when there are arbitrary restrictions on the blending components. The pair of orthogonal blocks can be used with and arbitrary number of process variables. The number of design points needed when different orthogonal blocks are used is usually smaller than when a single block is repeated at the various process variables levels.     

Mixture designs with orthogonal blocks

Constructions of blocked mixture designs are considered in situations where BLUEs of the block effect contrasts are orthogonal to the BLUEs of the regression coefficients. Orthogonal arrays (OA), Balanced Arrays (BAs), incidence matrices of balanced incomplete block designs (BIBDs), and partially balanced incomplete block designs (PBIBDs) are used. Designs with equal and unequal block sizes are considered. Also both cases where the constants involved in the orthogonality conditions depend and do not depend on the factors have been taken into account. Some standard (already available) designs can be obtained as particular cases of the designs proposed here.     

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.     

Three-factor symmetrical balanced designs with full efficiency for main effects

Some methods for constructing balanced design for 3-factor symmetrical factorial experiments in which all the main effects are completely unconfounded by using balanced arrays and BIB designs are proposed. The method is flexible in terms of selecting block size.     

Incomplete row-column designs with factorial treatment structure for estimating main effects with full efficiency

In this paper, we propose two methods of constructing row-column designs for factorial experiments. The constructed designs have orthogonal factorial structure with balance and permits estimation of main effects with full efficiency.     

Minimum cost linear trend-free 12-run fractional factorial designs

Time trend resistant fractional factorial experiments have often been based on regular fractionated designs where several algorithms exist for sequencing their runs in minimum number of factor-level changes (i.e. minimum cost) such that main effects and/or two-factor interactions are orthogonal to and free from aliasing with the time trend, which may be present in the sequentially generated responses. On the other hand, only one algorithm exists for sequencing runs of the more economical non-regular fractional factorial experiments, namely Angelopoulos et al. [1 P. Angelopoulos, H. Evangelaras, and C. Koukouvinos, Run orders for efficient two-level experimental plans with minimum factor level changes robust to time trends, J. Statist. Plann. Inference 139 (2009), pp. 3718–3724. doi: 10.1016/j.jspi.2009.05.002[Crossref], [Web of Science ®] , [Google Scholar]]. This research studies sequential factorial experimentation under non-regular fractionated designs and constructs a catalog of 8 minimum cost linear trend-free 12-run designs (of resolution III) in 4 up to 11 two-level factors by applying the interactions-main effects assignment technique of Cheng and Jacroux [3 C.S. Cheng and M. Jacroux, The construction of trend-free run orders of two-level factorial designs, J. Amer. Statist. Assoc. 83 (1988), pp. 1152–1158. doi: 10.1080/01621459.1988.10478713[Taylor &; Francis Online], [Web of Science ®] , [Google Scholar]] on the standard 12-run Plackett–Burman design, where factor-level changes between runs are minimal and where main effects are orthogonal to the linear time trend. These eight 12-run designs are non-orthogonal but are more economical than the linear trend-free designs of Angelopoulos et al. [1 P. Angelopoulos, H. Evangelaras, and C. Koukouvinos, Run orders for efficient two-level experimental plans with minimum factor level changes robust to time trends, J. Statist. Plann. Inference 139 (2009), pp. 3718–3724. doi: 10.1016/j.jspi.2009.05.002[Crossref], [Web of Science ®] , [Google Scholar]], where they can accommodate larger number of two-level factors in smaller number of experimental runs. These non-regular designs are also more economical than many regular trend-free designs. The following will be provided for each proposed systematic design:

• (1) The run order in minimum number of factor-level changes.

• (2) The total number of factor-level changes between the 12 runs (i.e. the cost).

• (3) The closed-form least-squares contrast estimates for all main effects as well as their closed-form variance–covariance structure.

In addition, combined designs of each of these 8 designs that can be generated by either complete or partial foldover allow for the estimation of two-factor interactions involving one of the factors (i.e. the most influential).     

Optimal robust parameter designs with qualitative and quantitative factors

Robust parameter design is an effective methodology for reducing variance and improving the quality of a product and a process. Recent work has mainly concentrated on two‐level robust parameter designs. We consider general robust parameter designs with factors having two or more or mixed levels these levels being either qualitative or quantitative. We propose a methodology and develop a generalised minimum aberration optimality criterion for selecting optimal robust parameter designs. A catalogue of 18‐run optimal designs is constructed and tabulated.