Orthogonal Latin hypercube designs from generalized orthogonal designs

Latin hypercube designs is a class of experimental designs that is important when computer simulations are needed to study a physical process. In this paper, we proposed some general criteria for evaluating Latin hypercube designs through their alias matrices. Moreover, a general method is proposed for constructing orthogonal Latin hypercube designs. In particular, links between orthogonal designs (ODs), generalized orthogonal designs (GODs) and orthogonal Latin hypercube designs are established. The generated Latin hypercube designs have some favorable properties such as uniformity, orthogonality of the first and some second order terms, and optimality under the defined criteria.     

αn–Designs

This paper defines a broad class of resolvable incomplete block designs called α_n–designs, of which the original α–designs are a special case with n = 1. The statistical and mathematical properties of α–designs extend naturally to these n –dimensional designs. They are a flexible class of resolvable designs appropriate for use in factorial experiments, in constructing efficient t –latinized resolvable block designs, and for enhancing the existing class of α–designs for a single treatment factor.     

Optimal orthogonal-array-based latin hypercubes

The use of optimal orthogonal array latin hypercube designs is proposed. Orthogonal arrays were proposed for constructing latin hypercube designs by Tang (1993). Such designs generally have better space filling properties than random latin hypercube designs. Even so, these designs do not necessarily fill the space particularly well. As a result, we consider orthogonal-array-based latin hypercube designs that try to achieve optimality in some sense. Optimization is performed by adapting strategies found in Morris & Mitchell (1995) and Ye et al. (2000). The strategies here search only orthogonal-array-based latin hypercube designs and, as a result, optimal designs are found in a more efficient fashion. The designs found are in general agreement with existing optimal designs reported elsewhere.     

On Exact K-optimal Designs Minimizing the Condition Number

A new design criterion based on the condition number of an information matrix is proposed to construct optimal designs for linear models, and the resulting designs are called K-optimal designs. The relationship between exact and asymptotic K-optimal designs is derived. Since it is usually hard to find exact optimal designs analytically, we apply a simulated annealing algorithm to compute K-optimal design points on continuous design spaces. Specific issues are addressed to make the algorithm effective. Through exact designs, we can examine some properties of the K-optimal designs such as symmetry and the number of support points. Examples and results are given for polynomial regression models and linear models for fractional factorial experiments. In addition, K-optimal designs are compared with A-optimal and D-optimal designs for polynomial regression models, showing that K-optimal designs are quite similar to A-optimal designs.     

Entropy of unequal probability sampling designs

There exist many designs for unequal probability sampling. In this paper entropy, which is a measure of randomness, is used to compare eight designs. Both old and commonly used designs and more recent designs are included. Several different and general estimates of entropy are presented. In the quest of finding entropy, expressions for the probability function are derived for different designs. One of them is a recent general design called correlated Poisson sampling. Several designs are close to having maximum entropy, which means that the designs are robust. A few designs yield low entropy and should therefore in general be avoided.     

Robustness of some designs against missing data

This article studies the robustness of several types of designs against missing data. The robustness of orthogonal resolution III fractional factorial designs and second-order rotatable designs is studied when a single observation is missing. We also study the robustness of balanced incomplete block designs when a block is missing and of Youden square designs when a column is missing.     

The construction of nearly balanced and nearly strongly balanced uniform cross-over designs

In this paper we consider the class of uniform cross-over designs. Existing results on the universal optimality of uniform cross-over designs are reviewed and a general method of construction is described. The constructed designs fall into four families, which include the balanced and strongly balanced designs as special cases: the remaining designs we refer to as nearly strongly balanced, a term first introduced by Kunert (Ann. Statist. 11 (1983)), and nearly balanced. The nearly strongly balanced and nearly balanced designs form an important family of uniform cross-over designs which provide designs where balanced or strongly balanced designs do not exist. The construction method can be easily generalized for any number of periods and subjects, as long as they are both a multiple of the number of treatments. Some illustrative examples are included.     

Optimal regression designs in the presence of random block effects

A- and D-optimal regression designs under random block-effects models are considered. We first identify certain situations where D- and A-optimal designs do not depend on the intra-block correlation and can be obtained easily from the optimal designs under uncorrelated models. For example, for quadratic regression on [−1,1], this covers D-optimal designs when the block size is a multiple of 3 and A-optimal designs when the block size is a multiple of 4. In general, the optimal designs depend on the intra-block correlation. For quadratic regression, we provide expressions for D-optimal designs for any block size. A-optimal designs with blocks of size 2 for quadratic regression are also obtained. In all the cases considered, robust designs which do not depend on the intrablock correlation can be constructed.     

Computer experiment designs for accurate prediction

Computer experiments using deterministic simulators are sometimes used to replace or supplement physical system experiments. This paper compares designs for an initial computer simulator experiment based on empirical prediction accuracy; it recommends designs for producing accurate predictions. The basis for the majority of the designs compared is the integrated mean squared prediction error (IMSPE) that is computed assuming a Gaussian process model with a Gaussian correlation function. Designs that minimize the IMSPE with respect to a fixed set of correlation parameters as well as designs that minimize a weighted IMSPE over the correlation parameters are studied. These IMSPE-based designs are compared with three widely-used space-filling designs. The designs are used to predict test surfaces representing a range of stationary and non-stationary functions. For the test conditions examined in this paper, the designs constructed under IMSPE-based criteria are shown to outperform space-filling Latin hypercube designs and maximum projection designs when predicting smooth functions of stationary appearance, while space-filling and maximum projection designs are superior for test functions that exhibit strong non-stationarity.     

Orthogonal three-level parallel flats designs for user-specified resolution

Orthogonal factorial and fractional factorial designs are very popular in many experimental studies, particularly the two-level and three-level designs used in screening experiments. When an experimenter is able to specify the set of possibly nonnegligible factorial effects, it is sometimes possible to obtain an orthogonal design belonging to the class of parallel flats designs, that has a smaller run-size than a suitable design from the class of classical fractional factorial designs belonging to the class of single flat designs. Sri-vastava and Li (1996) proved a fundamental theorem of orthogonal s-level, s being a prime, designs of parallel flats type for the user-specified resolution. They also tabulated a series of orthogonal designs for the two-level case. No orthogonal designs for three-level case are available in their paper. In this paper, we present a simple proof for the theorem given in Srivastava and Li (1996) for the three-level case. We also give a dual form of the theorem, which is more useful for developing an algorithm for construction of orthogonal designs. Some classes of three-level orthogonal designs with practical run-size are given in the paper.     

Optimal block designs for triallel cross experiments

Optimal block designs for a certain type of triallel cross experiments are investigated. Nested balanced block designs are introduced and it is shown how these designs give rise to optimal designs for triallel crosses. Several .series of nested balanced block designs, leading to optimal designs for triallel crosses are reported.     

Polygonal designs: some existence and non-existence results

Polygonal designs are introduced as a generalization of balanced incomplete block designs and as a specialization of partially balanced incomplete block designs. As in the case of balanced incomplete block designs, there is no hope of deciding the values of the parameters for which polygonal designs exist. We develop enough theory to reveal the structure, and thus, to resolve the existence problem for small polygonal designs, and derive necessary conditions for general cases. © 1998 Elsevier Science B.V. All rights reserved.     

Robustness properties of minimally‐supported Bayesian D‐optimal designs for heteroscedastic models

Bayesian D‐optimal designs supported on a fixed number of points were found by Dette & Wong (1998) for estimating parameters in a polynomial model when the error variance depends exponentially on the explanatory variable. The present authors provide optimal designs under a broader class of error variance structures and investigate the robustness properties of these designs to model and prior distribution assumptions. A comparison of the performance of the optimal designs relative to the popular uniform designs is also given. The authors' results suggest that Bayesian D‐optimal designs suported on a fixed number of points are more likely to be globaly optimal among all designs if the prior distribution is symmetric and is concentrated around its mean.     

A survey and evaluation of methods for determination of combinatorial equivalence of factorial designs

Equivalent factorial designs have identical statistical properties for estimation of factorial contrasts and for model fitting. Non-equivalent designs, however, may have the same statistical properties under one particular model but different properties under a different model. In this paper, we describe known methods for the determination of equivalence or non-equivalence of two-level factorial designs, whether they be regular factorial designs, non-regular orthogonal arrays, or have no particular structure. In addition, we evaluate a number of potential fast screening methods for detecting non-equivalence of designs. Although the paper concentrates mainly on symmetric designs with factors at two levels, we also evaluate methods of determining combinatorial equivalence and non-equivalence of three-level designs and indicate extensions to larger numbers of levels and to asymmetric designs.     

Response Surface Designs Where Levels of Some Factors are Difficult to Change

This article considers response surface designs in which the number of levels of some of the factors are constrained. Two general types of designs are examined: CUBE designs and STAR designs. The specific factor levels are chosen to give variance contours with a high level of sphericity, thus providing designs that are close to rotatable.     

Balanced Treatment incomplete block (BTIB) designs for comparing treatments with a control: minimal complete sets of generator designs for k = 3, p = 3(1)10

Bechhofer and Tamhane (1981) proposed a new class of incomplete block designs called BTIB designs for comparing p ≥ 2 test treatments with a control treatment in blocks of equal size k < p + 1. All BTIB designs for given (p,k) can be constructed by forming unions of replications of a set of elementary BTIB designs called generator designs for that (p,k). In general, there are many generator designs for given (p,k) but only a small subset (called the minimal complete set) of these suffices to obtain all admissible BTIB designs (except possibly any equivalent ones). Determination of the minimal complete set of generator designs for given (p,k) was stated as an open problem in Bechhofer and Tamhane (1981). In this paper we solve this problem for k = 3. More specifically, we give the minimal complete sets of generator designs for k = 3, p = 3(1)10; the relevant proofs are given only for the cases p = 3(1)6. Some additional combinatorial results concerning BTIB designs are also given.     

D- and V-optimal population designs for the quadratic regression model with a random intercept term

In this paper D- and V-optimal population designs for the quadratic regression model with a random intercept term and with values of the explanatory variable taken from a set of equally spaced, non-repeated time points are considered. D-optimal population designs based on single-point individual designs were readily found but the derivation of explicit expressions for designs based on two-point individual designs was not straightforward and was complicated by the fact that the designs now depend on ratio of the variance components. Further algebraic results pertaining to d-point D-optimal population designs where d≥3 and to V-optimal population designs proved elusive. The requisite designs can be calculated by careful programming and this is illustrated by means of a simple example.     

One-eighth- and one-sixteenth-fraction quaternary code designs with high resolution

The development of a general methodology for the construction of good two-level nonregular designs has received significant attention over the last 10 years. Recent works by Phoa and Xu (2009) and Zhang et al. (2011) indicate that quaternary code (QC) designs are very promising in this regard. This paper explores a systematic construction for 1/8th and 1/16th fraction QC designs with high resolution for any number of factors. The 1/8th fraction QC designs often have larger resolution than regular designs of the same size. A majority of the 1/16th fraction QC designs also have larger resolution than comparable two-level regular designs.     

Designs for cropping systems research

The present article establishes equivalence between extended group divisible (EGD) designs and designs for crop sequence experiments. This equivalence has encouraged the agricultural experimenters to use EGD designs for their experimentation. Some real life applications of EGD designs have been given. It has also been shown that several existing association schemes are special cases of EGD association scheme. Some methods of construction of EGD designs are also given. A catalogue of EGD designs obtainable through methods of construction along with efficiency factors of various factorial effects is also presented. In some crop sequence experiments that are conducted to develop suitable integrated nutrient supply system of a crop sequence, the treatments do not comprise of a complete factorial structure. The experimenter is interested in estimating the residual and direct effect of the treatments along with their cumulative effects. For such experimental settings block designs with two sets of treatments applied in succession are the appropriate designs. The correspondence established between row–column designs and block designs for two stage experiments by Parsad et al. [2003. Structurally incomplete row–column designs. Comm. Statist. Theory Methods 32(1), 239–261] has been exploited in obtaining designs for such experimental situations. Some open problems related to designing of crop sequence experiments are also given.     

Classification of efficient two-level fractional factorial designs of resolution IV or more

Two-level fractional factorial designs that are efficient in terms of aberration or other aliasing properties are classified into four types of designs of resolution IV or more: the half-fraction designs, the even designs, the five-column designs and the join designs. The designs are shown to have concise grid representations which provide simple interpretations of their aliasing structure. New efficient 128-run designs are presented and blocking of the designs is considered.