Some determinant optimality aspects of main effect fold-over designs

Saha and Mohanty (1970) presented a main effect fold-over design consisting of 14 treatment combinations of the 24×33 factorial, which had the nice property of being even balanced. Calling this design DSM, this paper establishes the following specific results: (i) DSM is not d-optimal in the subclass Δe of all 14 point even balanced main effect fold-over designs of the 24×33 factorial; (ii) DSM is not d-optimal in the subclass $\text{Δ}{}^1\text{?Δ}{}^{\mathrm{e}}$ of all 14 point even and odd balanced main effect fold-over designs of the 24×33 factorial; (iii) DSM is even optimal in $\text{Δ}{}^1$ and Δe. In addition to these results two 14 point designs in $\text{Δ}{}^1$ are presented which are d-optimal and via a counter example it is shown that these designs are not odd optimal. Finally, several general matrix algebra results are given which should be useful in resolving d-optimality problems of fold-over designs of the kn11×kn22 factorial.     

An algorithm for calculating D-optimal designs for polynomial regression through a fixed point

Optimal designs are required to make efficient statistical experiments. By using canonical moments, in 1980, Studden found D_s-optimal designs for polynomial regression models. On the other hand, integrable systems are dynamical systems whose solutions can be written down concretely. In this paper, polynomial regression models through a fixed point are discussed. In order to calculate D-optimal designs for these models, a useful relationship between canonical moments and discrete integrable systems is introduced. By using canonical moments and discrete integrable systems, a new algorithm for calculating D-optimal designs for these models is proposed.     

Scaled density models for binary response data and their D- and Ds-optimal designs

We introduce scaled density models for binary response data which can be much more reasonable than the traditional binary response models for particular types of binary response data. We show the maximum-likelihood estimates for the new models and it seems that the model works well with some sets of data. We also considered optimum designs for parameter estimation for the models and found that the D- and D_s-optimum designs are independent of parameters corresponding to the linear function of dose level, but the optimum designs are simple functions of a scale parameter only.     

A series of group divisible designs

Bose and Shrikhande C19763 proved that if D(m, k, ?) is a Baer subdesign of another SBIBD D₁ (v₁, k₁ ?), k₁>k, then it also contains a complementary subdesign D^* which is symmetric GDD, D^* (v^*, k^*; ?-1, ?; m, n). Utilising this, we give a necessary condition for a SBIBD D to be a Baer subdesign of D₁ and also give the parameters. Some GD designs are constructed.     

Statistical properties of Rechtschaffner designs

Rechtschaffner designs are saturated designs of resolution V   in which main effects and two-factor interactions are estimable if three-factor and higher order interactions are negligible. Statistical properties of Rechtschaffner designs are studied in this paper. Best linear unbiased estimators of main effects and two-factor interactions are given explicitly and asymptotic properties of correlations between these estimators are studied as well. It is shown that designs recommended by Rechtschaffner [1967. Saturated fractions of 2ⁿ$2^n$ and 3ⁿ$3^n$ factorial designs, Technometrics 9, 569–576] are not only A-optimal but also D-optimal. Comparisons of Rechtschaffner designs with other A- and D-optimal designs of resolution V are also discussed.     

Comparison of rotatable designs for regression on balls,I (quadratic)

Designs for quadratic and cubic regression are considered when the possible choices of the controlable variable are points x=( x₁,x₂,…,x_q) in the q-dimensional. Full of radius R, B_q(R) ={x:Σ⁴_ix²_i?R²}. The designs that are optimum among rotatable designs with respect to the D-, A-, and E-optimality criteria are compared in their performance relative to these and other criteria, including extrapolation. Additionally, the performance of a design optimum for one value of R, when it is implemented for a different value of R, is investigated. Some of the results are developed algebraically; others, numerically. For example, in quadratic regression the A-optimum design appears to be fairly robust in its efficiency, under variation of criterion.     

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.     

Efficient experimental designs for sigmoidal growth models

For the Weibull- and Richards-regression model robust designs are determined by maximizing a minimum of D  - or _D1$D_1$-efficiencies, taken over a certain range of the non-linear parameters. It is demonstrated that the derived designs yield a satisfactory solution of the optimal design problem for this type of model in the sense that these designs are efficient and robust with respect to misspecification of the unknown parameters. Moreover, the designs can also be used for testing the postulated form of the regression model against a simplified sub-model.     

Some remarks on subdesigns of symmetric designs

Let D(υ, k, λ) be a symmetric design containing a symmetric design D₁(υ₁, k₁, λ₁) (k₁ < k) and let x = υ₁(k ? k₁)/(υ ? υ₁). We show that k ≥(k₁ ? x)² + λ If equality holds, D₁ is called a tight subdesign of D. In the special case, λ₁ = λ, the inequality reduces to that of R.C. Bose and S.S. Shrikhande and tight subdesigns then correspond to their notion of Baer subdesigns. The possibilities for (7upsi;, k, λ) designs having Baer subdesigns are investigated.     

On D-optimal robust second order slope-rotatable designs

Das and Park (2006) introduced slope-rotatable designs overall directions for correlated observations which is known as A-optimal robust slope-rotatable designs. This article focuses D-optimal slope-rotatable designs for second-order response surface model with correlated observations. It has been established that robust second-order rotatable designs are also D-optimal robust slope-rotatable designs. A class of D-optimal robust second-order slope-rotatable designs has been derived for special correlation structures of errors.     

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.     

Optimal designs,supplementary difference sets and multipliers

We investigate multipliers of 2 - {v; q², q²; λ} supplementary difference sets where cyclotomy has been used to construct D-optimal designs.     

Balanced fractional factorial designs of resolution 2l+1 for interesting effects orthogonal to some nuisance parameters: 2m1+m2 series

For 2^m₁+m₂ factorial designs, this paper investigates balanced fractional 2^m₁ factorial designs of resolution 2l+1 with some nuisance parameters concerning the second factors. They are derivable from partially balanced arrays and further permit estimation of the effects up to the l-factor interactions concerning the first factors orthogonally to the nuisance parameters.     

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.     

Minimum aberration majorization in non-isomorphic saturated designs

In this paper we propose a new criterion, minimum aberration majorization, for comparing non-isomorphic saturated designs. This criterion is based on the generalized word-length pattern proposed by Ma and Fang (Metrika 53 (2001) 85) and Xu and Wu (Ann. Statist. 29 (2001) 1066) and majorization theory. The criterion has been successfully applied to check non-isomorphism and rank order saturated designs. Examples are given through five non-isomorphic L₁₆(2¹⁵) designs and two L₂₇(3¹³) designs.     

Generalized Bhaskar Rao designs

Generalized Bhaskar Rao designs with non-zero elements from an abelian group G are constructed. In particular this paper shows that the necessary conditions are sufficient for the existence of generalized Bhaskar Rao designs with k=3 for the following groups: ?G? is odd, G=Z^r₂, and G=Z^r₂×H where 3? ?H? and r?1. It also constructs generalized Bhaskar Rao designs with υ=k, which is equivalent to υ rows of a generalized Hadamard matrix of order n where υ?n.     

Some new factor screening designs using the search linear model

Factor screening designs for searching two and three effective factors using the search linear model are discussed. The construction of such factor screening designs involved finding a fraction with small number of treatments of a 2^m factorial experiment having the property P_2t (no 2t columns are linearly dependent) for t=2 and 3. A ‘Packing Problem’ is introduced in this connection. A complete solution of the problem in one case and partial solutions for the other cases are presented. Many practically useful new designs are listed.     

Note on Draper and Lin's article “capacity considerations for two-level fractional factorial designs”

In Table 4 of Draper and Lin (1990) the authors present eleven 2^{k − p}_R designs for which doubt is expressed as to whether they are saturated. This note removes doubt on nine of these designs indicating that they are indeed saturated. Some observations are made in terms of the resolution of a design for the remaining two designs among the 11. The conclusions are derived by properly interpreting an updated table of binary linear codes of Verhoeff (1987).     

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.     

Optimal designs for tumor regrowth models

Most growth curves can only be used to model the tumor growth under no intervention. To model the growth curves for treated tumor, both the growth delay due to the treatment and the regrowth of the tumor after the treatment need to be taken into account. In this paper, we consider two tumor regrowth models and determine the locally D- and c-optimal designs for these models. We then show that the locally D- and c-optimal designs are minimally supported. We also consider two equally spaced designs as alternative designs and evaluate their efficiencies.