Weighted A-optimality for fractional 2m factorial designs of resolution V

A weighted A-optimality (WA-optimality) criterion is discussed for selecting a fractional 2^m factorial design of resolution V. A WA-optimality criterion having one weight may be considered for designs. It is shown that designs derived from orthogonal arrays are WA-optimal for any weight. From a WA-optimal design, a procedure for finding WA-optimal designs for various weights is given. WA-optimal balanced designs are presented for 4 ⩽ m ⩽ 7 and for the values of n assemblies in certain ranges. It is pointed out that designs for m = 7 and for n = 41, 42 given in Chopra and Srivastava (1973a) or in the corrected paper by Chopra et al. (1986), are not A-optimal.     

New classes of D-optimal edge designs

Edge designs are screening experimental designs that allow a model-independent estimate of the set of relevant variables, thus providing more robustness than traditional designs. In this paper we construct new classes of D-optimal edge designs. This construction uses weighing matrices of order n and weight k together with permutation matrices of order n to obtain D-optimal edge designs. One linear and one quadratic simulated screening scenarios are studied and compared using linear regression and edge designs analysis.     

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.     

Some d-optimal weighing designs for n≡ (mod 4)

A number of D-optimal weighing designs are constructed with the help of block matrices. The D-optimal designs (n,k,s)=(19,13,10), (19,14,7), (19,14,8), (19,15,7), (19,15,8), (19,17,6), (19,18,6), (23,16,8), (23,17,8), (23,18,8), (4n?1,2n+3,(3n+4)/2), (4n?1,2n+4,n+3), (4n?1,2n+4,n+2) where n≡0 mod 4 and a skew H_n exists, (31,24,8), (31,25,8) and many others are constructed. A computer routine leading to locally D-optimal designs is presented.     

Regular A-optimal design matrices X = (xij) with xij = ?1, 0, 1

New construction methods of the regular A-optimal design matrices with elements −1, 0, 1 are presented, under assumption of nonhomogeneity of variance error. The presented constructions are based on the incidence matrices of the balanced bipartite weighing designs.     

A-optimal design measures for one-way layouts with additive regression

For linear models with one discrete factor and additive general regression term the problem of characterizing A-optimal design measures for inference on (i) treatment effects, (ii) the regression parameters and (iii) all parameters will be considered. In any of these problems product designs can be found which are optimal among all designs, and equal weigth 1/J may be given to each of the J levels of the discrete factor. For problem (i) and (ii) the allocation of the continuous factors for the regression term should follow a suitable optimal design for the corresponding pure regression model, whereas for problem (iii) this would not give an A-optimal product design. For this problem an equivalence theorem for A-optimal product designs will be given. An example will illustrate these results. Finally, by analyzing a model with two discrete factors it will be shown that for enlarged models the best product designs may not be A-optimal.     

Bayes A-optimal designs for comparing test treatments with a control

The problem of comparing v test treatments simultaneously with a control treatment when k, v ⩾ 3 is considered. Following the work of Majumdar (1992), we use exact design theory to derive Bayes A-optimal block designs and optimal Г-minimax designs for a more general prior assumption for the one-way elimination of heterogeneity model. Examples of robust optimal designs, highly efficient designs, and the comparisons of the approximate optimal designs that are derived by our methods and by some other existing rounding-off schemes when using Owen's procedure are also provided.     

A-Optimal Spring Balance Weighing Designs Under Some Conditions

In this article, the estimation problem of individual weights of objects in spring balance weighing design using the criterion of A-optimality is discussed. It is assumed that the measurement errors have different variances. The lowest bound of the trace of the dispersion matrix is obtained and the conditions when this lowest bound is achieved are given. A new construction method of an A-optimal design is presented.     

On some optimal fractional 2m factorial designs of resolution V

This paper presents the trace of the covariance matrix of the estimates of effects based on a fractional 2^m factorial (2^m-FF) design T of resolution V for the following two cases: One is the case where T is constructed by adding some restricted assemblies to an orthogonal array. The other is one where T is constructed by removing some restricted assemblies from an orthogonal array of index unity. In the class of 2^m-FF designs of resolution V considered here, optimal designs with respect to the trace criterion, i.e. A-optimal, are presented for m = 4, 5, and 6 and for a range of practical values of N (the total number of assemblies). Some of them are better than the corresponding A-optimal designs in the class of balanced fractional 2^m factorial designs of resolution V obtained by Srivastava and Chopra (1971b) in such a sense that the trace of the covariance matrix of the estimates is small.     

A-Optimal and MV-Optimal Incomplete Block Designs for Comparing Successive Treatments

Consider an incomplete block experiment in which observations are taken from t treatments using an incomplete block design with b blocks of size k < t. Suppose the interest is in estimating the differences of effects of successive treatments. This may occur, for example, if the treatments are different dosages or concentrations of a compound. This article presents A-optimal and MV-optimal incomplete block designs for estimating the the differences of successive treatment effects. Tables of optimal designs are given for k < t ≤ 5 with b ≤ 40.     

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.     

On the optimality of chemical balance weighing designs

In this paper we consider the problem of optimally weighing n objects with N weighings on a chemical balance. Several previously known results are generalized. In particular, the designs shown by Ehlich (1964a) and Payne (1974) to be D-optimal in various classes of weighing designs where N≡2 (mod4) are shown to be optimal with respect to any optimality criterion of Type I as defined in Cheng (1980). Several results on the E-optimality of weighing designs are also given.     

Optimal selection and ordering of columns in supersaturated designs

Two methods to select columns for assigning factors to work on supersaturated designs are proposed. The focus of interest is the degree of non-orthogonality between the selected columns. One method is the exhaustive enumeration of selections of p columns from all k columns to find the exact optimality, while the other is intended to find an approximate solution by applying techniques used in the corresponding analysis, aiming for ease of use as well as a reduction in the large computing time required for large k with the first method. Numerical illustrations for several typical design matrices reveal that the resulting “approximately” optimal assignments of factors to their columns are exactly optimal for any p. Ordering the columns in E(s²)-optimal designs results in promising new findings including a large number of E(s²)-optimal designs.     

Non-binary neighbor balance circular designs for v=2n and λ=2

Neighbor balance designs were first introduced by Rees (1967) in circular blocks for the use in serological research. Subsequently several researchers have defined the neighbor designs in different ways. In this paper, neighbor balance circular designs for (k≤v) block size are constructed for even number of treatments i.e. v=2n. No such series of designs is known in literature. Two theorems are developed for circular designs. Theorem 1 gives the non-binary circular blocks, whereas Theorem 2 generates binary circular blocks when n≤4 and non-binary blocks for n>4. In suggested designs no treatment is ever a neighbor of itself. Blocks are constructed in such a way that each treatment is a right and left neighbor of every other treatment for a fixed number of times say λ. Sizes of initial circular blocks are not same. One main guiding principle for such designs is to ensure economy in material use.     

Optimal row–column design for three treatments

The A-optimality problem is solved for three treatments in a row–column layout. Depending on the numbers of rows and columns, the requirements for optimality can be decidedly counterintuitive: replication numbers need not be as equal as possible, and trace of the information matrix need not be maximal. General rules for comparing 3×3$3\times 3$ information matrices for their A-behavior are also developed, and the A-optimality problem is also solved for three treatments in simple block designs.     

Block designs for incomplete factorial treatment structures with two factors

Abstract

In this paper, the problem of obtaining efficient block designs for incomplete factorial treatment structure with two factors excluding one treatment combination for estimation of dual versus single treatment contrasts is considered. The designs have been obtained using the A-optimal completely randomized designs and modified strongest treatment interchange algorithm. A catalog of efficient block designs has been prepared for m₁?=?3, 4 and m₂?=?2, b?≤?10 and k?≤?9 and for m₁?=?3,4 and m₂?=?3, 4, b?≤?10 and k?≤?10.     

Finite set theory and its application to cryptology

The concept of the (k, n, L)-set (or threshold set) of a finite set A is presented in this paper, based on the requirement of solving cryptology problems. It is proved that for a (k′, n′)-threshold scheme of any special or given k′, n′, the general (k, n)-threshold scheme is constructed by the (k, n, L)-set (or threshold set) of set A. A k, n, L)-set (or threshold set) of set A is constructed from an uniform (k, n)-set for L = |A| or a nonuniform (k, n)-set for L = |A| - 1.     

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.     

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.     

Row-column designs for comparing treatments with a control

This paper considers the problem of the design and analysis of experiments for comparing several treatments with a control when heterogeneity is to be eliminated in two directions. A class of row-column designs which are balanced for treatment vs. control comparisons (referred to as the balanced treatment vs. control row-column or BTCRC designs) is proposed. These designs are analogs of the so-called BTIB designs proposed by Bechhofer and Tamhane (Technometrics 23 (1981) 45–57) for eliminating heterogeneity in one direction. Some methods of analysis and construction of these designs are given. A measure of efficiency of BTCRC designs in terms of the A-optimality criterion is derived and illustrated by several examples.