A survey of nested designs

A nest with parameters (r,k,λ)→(r′,k′,λ′) is a BIBD on (b,v,r,k,λ) where each block has a distinguished sublock of cardinality k, the sublocks forming a (b,v,r,k,λ)-design.These designs are ‘nested’ in the sense of W.T. Federer (1972), who recommended the use of these designs for the sequential addition of periods in marketing experiments in order to retain Youden design properties as rows are added. Note that for a Youden design, the b columns and v treatments are in an SBIBD arrangement with parameters v=b, k=r, and λ.     

On construction of constant block-sum partially balanced incomplete block designs

Abstract

Constant block-sum designs are of interest in repeated measures experimentation where the treatments levels are quantitative and it is desired that at the end of the experiments, all units have been exposed to the same constant cumulative dose. It has been earlier shown that the constant block-sum balanced incomplete block designs do not exist. As the next choice, we, in this article, explore and construct several constant block-sum partially balanced incomplete block designs. A natural choice is to first explore these designs via magic squares and Parshvanath yantram is found to be especially useful in generating designs for block size 4. Using other techniques such as pair-sums and, circular and radial arrangements, we generate a large number of constant block-sum partially balanced incomplete block designs. Their relationship with mixture designs is explored. Finally, we explore the optimization issues when constant block-sum may not be possible for the class of designs with a given set of parameters.     

On block designs arising from rank 3 graphs

In this paper a criterion showing when the orbit of a subgraph of a given rank 3 graph forms a block design, is given. As an application several classes of block designs are derived from the triangular graph T(n) and the lattice graph L₂(n).     

The family of t-designs—part I

The family of t-designs is, without any doubt, the most important family of statistical designs. Their importance is due to their statistical optimalities, desirable symmetries for analyses and interpretations, and uses for constructing other important designs and structures such as Youden designs, generalized Youden designs, optimal fractional factorial designs, error defecting and correcting binary codes, balanced arrays, combinatorial filing systems, Hadamard matrices, finite projective and affine planes, strongly regular graphs, and so on. Research in the area of t-designs has been steadily and rapidly growing, especially during the last three decades. The number of publications in this area is in the several hundreds. Since papers on t-designs are published in a variety of journals, and because of the extensive role of these designs in design of experiments and other areas we believe it is imperative to gather these results and present them in varied form to suit diverse interests. This paper is an instance of such an attempt.     

Robust designs for nearly linear regression

In this paper we seek designs and estimators which are optimal in some sense for multivariate linear regression on cubes and simplexes when the true regression function is unknown. More precisely, we assume that the unknown true regression function is the sum of a linear part plus some contamination orthogonal to the set of all linear functions in the L₂ norm with respect to Lebesgue measure. The contamination is assumed bounded in absolute value and it is shown that the usual designs for multivariate linear regression on cubes and simplices and the usual least squares estimators minimize the supremum over all possible contaminations of the expected mean square error. Additional results for extrapolation and interpolation, among other things, are discussed. For suitable loss functions optimal designs are found to have support on the extreme points of our design space.     

Saturated designs for multivariate cubic regression

This paper deals with the problem of finding saturated designs for multivariate cubic regression on a cube which are nearly D-optimal. A finite class of designs is presented for the k dimensional cube having the property that the sequence of the best designs in this class for each k is asymptotically efficient as k increases. A method for constructing good designs in this class is discussed and the construction is carried out for 1?k?8. These numerical results are presented in the last section of the paper.     

Optimal block designs comparing treatments with a control when the errors are correlated

The efficient design of experiments for comparing a control with v new treatments when the data are dependent is investigated. We concentrate on generalized least-squares estimation for a known covariance structure. We consider block sizes k equal to 3 or 4 and approximate designs. This method may lead to exact optimal designs for some v, b, k, but usually will only indicate the structure of an efficient design for any particular v, b, k, and yield an efficiency bound, usually unattainable. The bound and the structure can then be used to investigate efficient finite designs.     

E-optimal incomplete block designs with two distinct block sizes

Sufficient conditions are derived for the determination of E-optimal designs in the class D(v,b₁,b₂,k₁,k₂) of incomplete block designs for v treatments in b₁ blocks of size k₁ each and b₂ blocks of size k₂ each. Some constructions for E-optimal designs that satisfy the sufficient conditions obtained here are given. In particular, it is shown that E-optimal designs in D(v,b₁,b₂,k₁,k₂) can be constructed by augmenting b₂ blocks, with k₂ − k₁ extra plots each, of a BIBD(v,b = b₁ + b₂,k₁,λ) and GDD(v,b = b₁ + b₂,k₁,λ₁,λ₂). It is also shown that equireplicate E-optimal designs in D(v,b₁,b₂,k₁,k₂) can be constructed by combining disjoint blocks of BIBD(v,b,k₁,λ) and GDD(v,b,k₁,λ₁,λ₂) into larger blocks. As applications of the construction techniques, several infinite series of E-optimal designs with small block sizes differing by at most two are given. Lower bounds for the A-efficiency are derived and it is found that A-efficiency exceeds 99% for v ⩾ 10, and at least 97.5% for 5 ⩽v < 10.     

Complete designs with blocks of maximal multiplicity

The set of distinct blocks of a block design is known as its support. We construct complete designs with parameters v(?7), k=3, λ=v ? 2 which contain a block of maximal multiplicity and with support size $\text{b}{}^1\text{= (}{}^{\mathrm{v}}{}_3\text{) ? 4(v ? 2)}$. Any complete design which contains such a block, and has parameters v, k, λ as above, must be supported on at most (^v₃) ? 4(v ? 2) blocks. Attention is given to complete designs because of their direct relationship to simple random sampling.     

On minimax designs when there are two candidate models

This work is motivated by the need to find experimental designs which are robust under different model assumptions. We measure robustness by calculating a measure of design efficiency with respect to a design optimality criterion and say that a design is robust if it is reasonably efficient under different model scenarios. We discuss two design criteria and an algorithm which can be used to obtain robust designs. The first criterion employs a Bayesian-type approach by putting a prior or weight on each candidate model and possibly priors on the corresponding model parameters. We define the first criterion as the expected value of the design efficiency over the priors. The second design criterion we study is the minimax design which minimizes the worst value of a design criterion over all candidate models. We establish conditions when these two criteria are equivalent when there are two candidate models. We apply our findings to the area of accelerated life testing and perform sensitivity analysis of designs with respect to priors and misspecification of planning values.     

Optimal designs for statistical analysis with Zernike polynomials

The Zernike polynomials arise in several applications such as optical metrology or image analysis on a circular domain. In the present paper, we determine optimal designs for regression models which are represented by expansions in terms of Zernike polynomials. We consider two estimation methods for the coefficients in these models and determine the corresponding optimal designs. The first one is the classical least squares method and Φ _p -optimal designs in the sense of Kiefer [Kiefer, J., 1974, General equivalence theory for optimum designs (approximate theory). Annals of Statistics, 2 849–879.] are derived, which minimize an appropriate functional of the covariance matrix of the least squares estimator. It is demonstrated that optimal designs with respect to Kiefer's Φ _p -criteria (p>?∞) are essentially unique and concentrate observations on certain circles in the experimental domain. E-optimal designs have the same structure but it is shown in several examples that these optimal designs are not necessarily uniquely determined. The second method is based on the direct estimation of the Fourier coefficients in the expansion of the expected response in terms of Zernike polynomials and optimal designs minimizing the trace of the covariance matrix of the corresponding estimator are determined. The designs are also compared with the uniform designs on a grid, which is commonly used in this context.     

A construction of group divisible designs

Given any affine design with parameters v, b, r, k, λ and μ = k²/v and any design with parameters v′, b′, r′, k′, λ′ where r′ = tr for some natural number `t and k′?r, we construct a group divisible design with parameters v′' = vv′, m = v′, n = v, b′' = vb′, k′' = kk′, r′'= kr′, λ₁ = tkλ and λ₂ = μλ′. This is applied to some series of designs. As a lemma, we also show that any 0-1-matrix with row sums tr and column sums ?r may be written as the sum of r 0-1-matrices with row sums t and column sums ?1.     

Families of Hadamard group divisible designs

By a family of designs we mean a set of designs whose parameters can be represented as functions of an auxiliary variable t where the design will exist for infinitely many values of t. The best known family is probably the family of finite projective planes with υ = b = t² + t + 1, r = k = t + 1, and λ = 1. In some instances, notably coding theory, the existence of families is essential to provide the degree of precision required which can well vary from one coding problem to another. A natural vehicle for developing binary codes is the class of Hadamard matrices. Bush (1977) introduced the idea of constructing semi-regular designs using Hadamard matrices whereas the present study is concerned mostly with construction of regular designs using Hadamard matrices. While codes constructed from these designs are not optimal in the usual sense, it is possible that they may still have substantial value since, with different values of λ₁ and λ₂, there are different error correcting capabilities.     

Optimum designs in complete two-way layouts

In the usual two-way layout of ANOVA (interactions are admitted) let nij ? 1 be the number of observations for the factor-level combination(i, j). For testing the hypothesis that all main effects of the first factor vanish numbers $\text{n}{}^1\text{ij}$ are given such that the power function of the F-test is uniformly maximized (U-optimality), if one considers only designs (nij) for which the row-sums ni are prescribed. Furthermore, in the (larger) set of all designs for which the total number of observations is given, all D-optimum designs are constructed.     

Equineighboured balanced nested row-column designs

This paper presents equineighboured balanced nested row-column designs for v treatments arranged in b blocks each comprising pq units further grouped into p rows and q columns. These are two-dimensional designs with the property that all pairs of treatments are neighbours equally frequently at all levels in both rows and columns. Methods of construction are given both for designs based on Latin squares and those where pq≤v. Cyclic equineighboured designs are defined and tabulated for 5≤v≤10, p≤3, q≤5, where r=bpq/v is the number of replications of each treatment.     

Admissible two-stage designs for phase II cancer clinical trials that incorporate the expected sample size under the alternative hypothesis

two‐stage studies may be chosen optimally by minimising a single characteristic like the maximum sample size. However, given that an investigator will initially select a null treatment e?ect and the clinically relevant di?erence, it is better to choose a design that also considers the expected sample size for each of these values. The maximum sample size and the two expected sample sizes are here combined to produce an expected loss function to ?nd designs that are admissible. Given the prior odds of success and the importance of the total sample size, minimising the expected loss gives the optimal design for this situation. A novel triangular graph to represent the admissible designs helps guide the decision‐making process. The H ₀‐optimal, H ₁‐optimal, H ₀‐minimax and H ₁‐minimax designs are all particular cases of admissible designs. The commonly used H ₀‐optimal design is rarely good when allowing stopping for e?cacy. Additionally, the δ‐minimax design, which minimises the maximum expected sample size, is sometimes admissible under the loss function. However, the results can be varied and each situation will require the evaluation of all the admissible designs. Software to do this is provided. Copyright © 2012 John Wiley & Sons, Ltd.     

On some new search designs for 2m factorial experiments

In this paper, we obtain search designs with reasonably small number of treatments which permit the estimation of the general mean and main effects and search of one more unknown possible nonzero effect among two and three factor interactions in 2^m factorial experiments, 3 ? m ? 8.     

Rotation designs for experiments in high-bias situations

Many experiments in the physical and engineering sciences study complex processes in which bias due to model inadequacy dominates random error. A noteworthy example of this situation is the use of computer experiments, in which scientists simulate the phenomenon being studied by a computer code. Computer experiments are deterministic: replicate observations from running the code with the same inputs will be identical. Such high-bias settings demand different techniques for design and prediction. This paper will focus on the experimental design problem introducing a new class of designs called rotation designs. Rotation designs are found by taking an orthogonal starting design D and rotating it to obtain a new design matrix D_R=DR, where R is any orthonormal matrix. The new design is still orthogonal for a first-order model. In this paper, we study some of the properties of rotation designs and we present a method to generate rotation designs that have some appealing symmetry properties.     

Optimum designs for estimating EDp based on raw optical density data

For raw optical density (ROD) data, such as those generated in biological assays employing an ELISA plate reader, ED_p-optimal designs are identified for a family of homogeneous non-linear models with two parameters. In every case, the theoretical ED_p-optimal design is a design with one or two support points. These theoretical optimal designs might not be suitable for many practical applications. To overcome this shortcoming, we have specified ED_p-optimal designs within the class of k-point equally spaced and uniform designs. The efficiency robustness of these designs with respect to initial nominal values of the parameters have been investigated.     

Optimal designs for calibration of orientations

This paper concerns designed experiments involving observations of orientations following the models of Prentice (1989) and Rivest &Chang (2006). The authors state minimal conditions on the designs for consistent least squares estimation of the matrix parameters in these models. The conditions are expressed in terms of the axes and rotation angles of the design orientations. The authors show that designs satisfying U₁ + … + U_n = 0 are optimal in the sense of minimizing the estimation error average angular distance. The authors give constructions of optimal n‐point designs when n ≥ 4 and they compare the performance of several designs through approximations and simulation.