Non binary partially neighbor balanced designs for circular blocks

ABSTRACT

Neighbor designs are recommended for the cases where the performance of treatment is affected by the neighboring treatments as in biometrics and agriculture. In this paper we have constructed two new series of non binary partially neighbor balanced designs for v = 2n and v = 2n+1 number of treatments, respectively. The blocks in the design are non binary and circular but no treatment is ever a neighbor to itself. The designs proposed here are partially balanced in terms of nearest neighbors. No such series are known in the literature.     

Optimal designs for the logit and probit models for binary data

We consider optimal designs for a class of symmetric models for binary data which includes the common probit and logit models. We show that for a large group of optimality criteria which includes the main ones in the literature (e.g. A-, D-, E-, F- and G-optimality) the optimal design for our class of models is a two-point design with support points symmetrically placed about the ED50 but with possibly unequal weighting. We demonstrate how one can further reduce the problem to a one-variable optimization by characterizing various of the common criteria. We also use the results to demonstrate major qualitative differences between the F - and c-optimal designs, two design criteria which have similar motivation.     

Families of proper generalized neighbor designs

A generalized neighbor design relaxes the equality condition on the number of times two treatments occur as neighbors in the design. In this article we have constructed a new series of generalized neighbor designs with equal block sizes, a series of neighbor designs of Rees [1967. Some designs of use in serology. Biometrics 23, 779–791] and a series of neighbor designs with two distinct block sizes. Two more new series of GN₂ designs are also constructed for even number of treatments. It has been shown that quasi neighbor designs introduced by Preece [1994. Balanced Ouchterlony neighbor designs. J. Combin. Math. Combin. Comput. 15, 197–219] are special cases of generalized neighbor designs with t=2$t=2$. All the designs given here are binary. A new definition—partially balanced circuit design is introduced which is a special case of generalized neighbor designs with binary blocks.     

E-optimal designs for regression models with quantitative factors— a reasonable choice?

For regression models with quantitative factors it is illustrated that the E-optimal design can be extremely inefficient in the sense that it degenerates to a design which takes all observations at only one point. This phenomenon is caused by the different size of the elements in the covariance matrix of the least-squares estimator for the unknown parameters. For these reasons we propose to replace the E-criterion by a corresponding standardized version. The advantage of this approach is demonstrated for the polynomial regression on a nonnegative interval, where the classical and standardized E-optimal designs can be found explicitly. The described phenomena are not restricted to the E-criterion but appear for nearly all optimality criteria proposed in the literature. Therefore standardization is recommended for optimal experimental design in regression models with quantitative factors. The optimal designs with respect to the new standardized criteria satisfy a similar invariance property as the famous D-optimal designs, which allows an easy calculation of standardized optimal designs on many linearly transformed design spaces.     

Construction of optimal designs in random coefficient regression models

We consider the problem of optimal experimental design in random coefficient regression models with respect to a quadratic loss function. By application of WHITTLE'S general equivalence theorem we obtain the structure of optimal designs. An alogrithm is given which allows, under certain assumptions, the construction of the information matrix of an optimal design. Moreover, we give conditions on the equivalence of optimal designs with respect to optimality criteria which are analogous to usual A-D- and _E/-optimality.     

Construction of minimum aberration blocked two-level regular factorial designs

ABSTRACT

In this article, we consider the construction of minimum aberration 2^{n ? k}: 2^p designs with respect to some existing combined wordlength patterns, where a 2^{n ? k}: 2^p design is a blocked two-level design with n treatment factors, 2^p blocks, and N = 2^q runs with q = n ? k. Two methods are proposed for two situations: n ? 2^{q ? p} ? 1 and n > N/2. These methods enable us to obtain some new minimum aberration 2^{n ? k}: 2^p designs from existing minimum aberration unblocked and blocked designs. Examples are included to illustrate the theory.     

Minimax designs for 2k factorial experiments for generalized linear models

ABSTRACT

Formulas for A- and C-optimal allocations for binary factorial experiments in the context of generalized linear models are derived. Since the optimal allocations depend on GLM weights, which often are unknown, a minimax strategy is considered. This is shown to be simple to apply to factorial experiments. Efficiency is used to evaluate the resulting design. In some cases, the minimax design equals the optimal design. For other cases no general conclusion can be drawn. An example of a two-factor logit model suggests that the minimax design performs well, and often better than a uniform allocation.     

D-minimax Second-order Designs Over Hypercubes for Extrapolation and Restricted Interpolation Regions

The D-minimax criterion for estimating slopes of a response surface involving k factors is considered for situations where the experimental region χ and the region of interest ? are co-centered cubes but not necessarily identical. Taking χ = [ ? 1, 1]^k and ? = [ ? R, R]^k, optimal designs under the criterion for the full second-order model are derived for various values of R and their relative performances investigated. The asymptotically optimal design as R → ∞ is also derived and investigated. In addition, the optimal designs within the class of product designs are obtained. In the asymptotic case it is found that the optimal product design is given by a solution of a cubic equation that reduces to a quadratic equation for k = 3?and?6. Relative performances of various designs obtained are examined. In particular, the optimal asymptotic product design and the traditional D-optimal design are compared and it is found that the former performs very well.     

SOME PROPERTIES OF A FOLDOVER DESIGN

The foldover design of the 12-run Plackett-Burman design is shown to give a 2⁴and 2^4-1design in every set of four factors, and to be resolution V in every set of five factors. In addition, the design allows the search and estimation of up to two non-zero interactions.     

Foldover Conference Designs for Screening Experiments

A conference matrix is a square matrix C with zeros on the diagonal and ±1s off the diagonal, such that C ^T C = CC ^T  = (n ? 1)I, where I is the identity matrix. Conference matrices are an important class of combinatorial designs due to their many applications in several fields of science, including statistical-experimental designs, telecommunications, elliptic geometry, and more. In this article, conference matrices and their full foldover design are combined together to obtain an alternative method for screening active factors in complicated problems. This method provides a model-independent estimate of the set of active factors and also gives a linearity test for the underlying model.     

Optimal partially balanced nested row-column designs

A partially balanced nested row-column design, referred to as PBNRC, is defined as an arrangement of v treatments in b p × q blocks for which, with the convention that p q, the information matrix for the estimation of treatment parameters is equal to that of the column component design which is itself a partially balanced incomplete block design. In this paper, previously known optimal incomplete block designs, and row-column and nested row-column designs are utilized to develop some methods of constructing optimal PBNRC designs. In particular, it is shown that an optimal group divisible PBNRC design for v = mn kn treatments in p × q blocks can be constructed whenever a balanced incomplete block design for m treatments in blocks of size k each and a group divisible PBNRC design for kn treatments in p × q blocks exist. A simple sufficient condition is given under which a group divisible PBNRC is Ψ_f-better for all f> 0 than the corresponding balanced nested row-column designs having binary blocks. It is also shown that the construction techniques developed particularly for group divisible designs can be generalized to obtain PBNRC designs based on rectangular association schemes.     

t-Latinized Designs

A variety trial sometimes requires a resolvable block design in which the replicates are set out next to each other. The long blocks running through the replicates are then of interest. A t -latinized design is one in which groups of these t long blocks are binary. In this paper examples of such designs are given. It is shown that the algorithm described by John & Whitaker (1993) can be used to construct designs with high average efficiency factors. Upper bounds on these efficiency factors are also derived.     

Locally optimal designs for binary dose‐response models

In this article, we consider the problem of seeking locally optimal designs for nonlinear dose‐response models with binary outcomes. Applying the theory of Tchebycheff Systems and other algebraic tools, we show that the locally D‐, A‐, and c‐optimal designs for three binary dose‐response models are minimally supported in finite, closed design intervals. The methods to obtain such designs are presented along with examples. The efficiencies of these designs are also discussed. The Canadian Journal of Statistics 46: 336–354; 2018 © 2018 Statistical Society of Canada     

Optimal foldover designs

An obvious strategy for obtaining a Doptimal foldover design for p factors at two levels each in 2N runs is to fold a Doptimal main effects plan. We show that this strategy works except when N = 4t + 2 and s is even In that case there are two different classes of D-optimal main effects plans with N runs that have the same determinant. However folding them gives two different values foi the D-optimality criteiion One set of designs is D-optimal The other is not.     

Minimax Design for the Difference Between Estimated Responses for the Quadratic Model Over Hypercubic Regions

Abstract

A second-order model involving the intercept and only the pure quadratic terms is considered for regression over hypercubes. Minimization of the variance of the difference between estimated responses at two points, maximized over all pairs of points in the region of interest in factor space, is taken as the design criterion. Optimal design under the minimax criterion is derived and found to be the one which is also simultaneously A-, D-, and E-optimal for the parameters excluding the intercept. The minimax design is compared with other standard designs and is found to perform extremely well.     

A method for constructing supersaturated designs and its Es2 optimality

A lower bound for the Es² value of an arbitrary supersaturated design is derived. A general method for constructing supersaturated designs is proposed and shown to produce designs with n runs and m = k(n — 1) factors that achieve the lower bound for Es² and are thus optimal with respect to the Es² criterion. Within the class of designs given by the construction method, further discrimination can be made by minimizing the pairwise correlations and using the generalized D and A criteria proposed by Wu (1993). Efficient designs of 12, 16, 20 and 24 runs are constructed by following this approach.     

Modified Robust Second-Order Slope-Rotatable Designs

Generally it is very difficult to construct robust slope-rotatable designs along axial directions. Present paper focuses on modified second-order slope-rotatable designs (SOSRDs) with correlated errors. Modified robust second-order slope-rotatability conditions are derived for a general variance–covariance structure of errors. These conditions get simplified for intraclass correlation structure. A few robust second-order slope-rotatable designs (over all directions, or with equal maximum directional variance slope, or D-optimal slope) are examined with respect to modified robust slope-rotatability. It is observed that robust second-order slope-rotatable designs over all directions, or with equal maximum directional variance slope, or D-optimal slope are not generally modified robust second-order slope-rotatable designs.     

Computer-Generated Neighbor Designs

Neighbor designs are useful to remove the neighbor effects. In this article, an algorithm is developed and is coded in Visual C + +to generate the initial block for possible first, second,…, and all order neighbor designs. To get the required design, a block (0, 1, 2,…, k ? 1) is then augmented with (v ? 1) blocks obtained by developing the initial block cyclically mod (v ? 1).     

D-Optimal Designs for Covariate Parameters in Block Design Set Up

The problem considered is that of finding D-optimal design for the estimation of covariate parameters and the treatment and block contrasts in a block design set up in the presence of non stochastic controllable covariates, when N = 2(mod 4), N being the total number of observations. It is clear that when N ≠ 0 (mod 4), it is not possible to find designs attaining minimum variance for the estimated covariate parameters. Conditions for D-optimum designs for the estimation of covariate parameters were established when each of the covariates belongs to the interval [?1, 1]. Some constructions of D-optimal design have been provided for symmetric balanced incomplete block design (SBIBD) with parameters b = v, r = k = v ? 1, λ =v ? 2 when k = 2 (mod 4) and b is an odd integer.     

On the construction of optimal designs

Two strategies for specifying additional data to be included with the data of a non-orthogonal design are presented. The additional data increase the magnitude of the information matrix X′X and the orthogonality of the design matrix. Sequentially, the new points are augmented to the original design, such that each new point optimally increases the smallest eigenvalue of X′X. The new runs are created in a predefined spherical region and a rectangular region. Optimum number of additional observations is presented in order to orthogonalize the design matrix X and optimize some functions of the information matrix X′X. Comparisons of the results acquired with the proposed methods versus the most commonly used procedures for data augmentation are carried out. In addition, the advantages of the use of our techniques over the studied methods to solve the augmenting data problems are discussed.