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.     

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.     

On algorithmic construction of maximin distance designs

Maximin distance designs are useful for conducting expensive computer experiments. In this article, we compare some global optimization algorithms for constructing such designs. We also introduce several related space-filling designs, including nested maximin distance designs, sliced maximin distance designs, and general maximin distance designs with better projection properties. These designs possess more flexible structures than their analogs in the literature. Examples of these designs constructed by the algorithms are presented.     

Minimal augmented square designs and their extensions

Minimal square designs are proposed and compared. All treatment contrasts in both designs are estimable under the existence of two-way heterogeneity. That is, all designs are treatment-connected. Extended treatment-connected designs are generated by adding one column to minimal treatment-connected square designs. The extended designs not only have lower variances in paired comparisons of unreplicated treatments but also provide necessary degrees of freedom to estimate the process error. (M,S)-optimal extended designs are constructed systematically. Both square designs and their extensions have large numbers of unreplicated treatments.     

α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.     

Two third-order rotatable designs in four dimensions

New third-order rotatable designs in four dimensions are derived from third-order rotatable designs in two dimensions. When these designs are used the results of the experiments performed according to the two-dimensional designs need not be discarded. Further, one of the derived designs requires only sixty points whereas the smallest of the third-order rotatable designs in four dimensions available in the literature require seventy two points.     

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.     

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.     

A-optimal diallel crosses for test versus control comparisons

A-optimality of block designs for control versus test comparisons in diallel crosses is investigated. A sufficient condition for designs to be A-optimal is derived. Type S₀ designs are defined and A-optimal type S₀ designs are characterized. A lower bound to the A-efficiency of type S₀ designs is also given. Using the lower bound to A-efficiency, type S₀ designs are shown to yield efficient designs for test versus control comparisons.     

Irregular Four-level Response Surface Designs

Four-level response surface designs based on regular two-level fractional factorial designs were introduced by Edmondson (1991). Here, the methods are extended to include designs based on irregular two-level fractional factorials. These designs allow orthogonal blocking and require fewer experimental units than the regular designs.     

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.     

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.     

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.     

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.     

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 Factorial Designs for cDNA Microarray Experiments

Balanced factorial designs are introduced for cDNA microarray experiments. Single replicate designs obtained using the classical method of confounding are shown to be particularly useful for deriving suitable balanced designs for cDNA microarrays. Classical factorial designs obtained using methods other than the method of confounding are also shown to be useful. The paper provides a systematic method of deriving designs for microarray experiments as opposed to algorithmic and ad-hoc methods and generalizes several of the microarray designs given recently in the literature.     

Catalogue of small runs nonregular designs from hadamard matrices with generalized minimum aberration

Fries and Hunter ( 1980 ) proposed the Minimum Aberration criterion (MA) for selecting regular designs. The regular designs with MA are msot commonly used because they are considered as the best designs. How ever, as pointed out by Chen, Sun and Wu ( 1993 ), there are situations that other designs may better meet the design need. Therefore, they catalogued some two-level and three-level fractional factorial regular designs with small (16,27,32,64) runs. For nonregular designs, such as the ones taken from Hadamard matrices, the MA criterion is not appUcable. Deng and Tang ( 1999 ) introduced Generalized Minimum Aberration Criterion (GMA) as a natural extension to the MA criterion. Similar to the case in the regular designs, other designs may better meet practical need, In this paper, we use the GMA criterion to give a catalogue of nonregular designs with smaU (16,20,24) runs.     

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.     

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.