On the norm of alias matrices in balanced fractional 2m factorial designs of resolution 2l + 1

The norm $\text{6A6 = {tr(A′A)}}{}^{\mathrm{<mtext>1</mtext><mtext>2</mtext>}}$ of the alias matrix A of a design can be used as a measure for selecting a design. In this paper, an explicit expression for 6A6 will be given for a balanced fractional 2^m factorial design of resolution 2l + 1 which obtained from a simple array with parameters (m; λ₀, λ₁,…, λ_m). This array is identical with a balanced array of strength m, m constraints and index set {λ₀, λ₁,…, λ_m}. In the class of the designs of resolution V (l = 2) obtained from S-arrays, ones which minimize 6A6 will be presented for any fixed N assemblies satisfying (i) m = 4, 11 ? N ? 16, (ii) m = 5, 16 ? N ? 32, and (iii) m = 6, 22 ? N ? 40.     

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.     

Search designs for 2m factorials derived from balanced arrays of strength 2(l+1) and ad-optimal search designs

We consider a search design for the 2^m type such that at most knonnegative effects can be searched among (l+1)-factor interactions and estimated along with the effects up to l- factor interactions, provided (l+1)-factor and higher order interactions are negligible except for the k effects. We investigate some properties of a search design which is yielded by a balanced 2^m design of resolution 2l+1 derived from a balanced array of strength 2(l+1). A necessary and sufficient condition for the balanced design of resolution 2l+1 to be a search design for k=1 is given. Optimal search designs for k=1 in the class of the balanced 2^m designs of resolution V (l=2), with respect to the AD-optimality criterion given by Srivastava (1977), with N assemblies are also presented, where the range of (m,N) is (m=6; 28≤N≤41), (m=7; 35≤N≤63) and (m=8; 44≤N≤74).     

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.     

On the construction of hypercubic design

Hypercubic design was introduced by Shah (1958) and Kusumoto(1965) in which the t=v^m treatments are represented by n-plets (x₁, x₂, ..., x_m),where 1≤ x₁, x₂, ..., x_m ≤v, and two treatments are said to be i-th associates if they differ in exactly i components. This paper deals with the construction of some hypercubic designs and gives their application to confounding plans for symmetrical factorial experiments. The proposed methods prove to be quite flexible in terms of choice of possible block sizes and are easy to use.     

Balanced arrays of strength 4 and balanced fractional 3m factorial designs

A connection between a balanced fractional 2^m factorial design of resolution 2l + 1 and a balanced array of strength 2l with index set {μ₀, μ₁,…, μ_2l} was established by Yamamoto, Shirakura and Kuwada (1975). The main purpose of this paper is to give a connection between a balanced fractional 3^m factorial design of resolution V and a balanced array of strength 4, size N, m constraints, 3 levels and index set {λ_l0l1l2}.     

On a robustness property of PBIBD

In this paper we study a robustness property of partially balanced incomplete block designs based on association schemes with m classes (PBIBD(m)) against the unavailability of data in the sense that, when any t (a positive integer) observations are unavailable the design remains connected w.r.t. treatment. We characterize the robustness property of PBIBD(m) completely for m=2 and partially for m=3.     

Characteristic polynomials of the information matrices of balanced fractional 3m factorial designs of resolution v

An explicit expression for the characteristic polynomial of the information matrix M_T of a balanced fractional 3^m factorial (3^m-BFF) design T of resolution V is obtained by utilizing the algebraic structure of the underlying multidimentional relationship. Also by using of the multidimensional relationship algebra, the trace and the determinant of the covariance matrix of the estimates of effects are derived.     

On the use of partial confounding for the construction of alternative regular two-level blocked fractional factorial designs

In this paper, we consider experimental situations in which a regular fractional factorial design is to be used to study the effects of m two-level factors using n=2^m−k experimental units arranged in 2^p blocks of size 2^m−k−p. In such situations, two-factor interactions are often confounded with blocks and complete information is lost on these two-factor interactions. Here we consider the use of the foldover technique in conjunction with combining designs having different blocking schemes to produce alternative partially confounded blocked fractional factorial designs that have more estimable two-factor interactions or a higher estimation capacity or both than their traditional counterparts.     

A basic lemma and the analysis of block and Kronecker product designs

In this paper the analysis of the class of block designs whose C matrix can be expressed in terms of the Kronecker product of some elementary matrices is considered. The analysis utilizes a basic result concerning the spectral decomposition of the Kronecker product of symmetric matrices in terms of the spectral decomposition of the component matrices involved in the Kronecker product. The property (A) of Kurkjian and Zelen (1963) is generalised and the analysis of generalised property (A) designs is given. It is proved that a design is balanced factorially if and only if it is a generalised property (A) design. A method of analysis of Kronecker product block designs whose component designs are equi-replicate and proper is also suggested.     

D-optimal block designs with at most six varieties

For given positive integers v, b, and k (all of them ≥2) a block design is a k × b array of the variety labels 1,…,v with blocks as columns. For the usual one-way heterogeneity model in standard form the problem is studied of finding a D-optimal block design for estimating the variety contrasts, when no balanced block design (BBD) exists. The paper presents solutions to this problem for v≤6. The results on D-optimality are derived from a graph-theoretic context. Block designs can be considered as multigraphs, and a block design is D-optimal iff its multigraph has greatest complexity (=number of spanning trees).     

Constructions of Nested Pairwise Efficiency and Variance Balanced Designs

ABSTRACT

Nested pairwise efficiency and variance balanced designs form a new class of block designs. In this article, two methods of constructing such designs from a symmetric balanced incomplete block design are proposed with some illustrations.     

Pseudo-Youden designs balanced for intersection

If the row-column intersections of a row-column design A form a balanced incomplete block design, then A is said to be balanced for intersection. This property was originally defined for triple arrays by McSorley et al. (2005a), Section 8, where an example was presented and questions of existence were raised and discussed. We give sufficient conditions for the class of balanced grids in order to be balanced for intersection, and prove that a family of binary pseudo-Youden designs has this property.     

A nonparametric procedure for the analysis of balanced crossover designs

The authors propose nonparametric tests for the hypothesis of no direct treatment effects, as well as for the hypothesis of no carryover effects, for balanced crossover designs in which the number of treatments equals the number of periods p, where p ≥ 3. They suppose that the design consists of n replications of balanced crossover designs, each formed by m Latin squares of order p. Their tests are permutation tests which are based on the n vectors of least squares estimators of the parameters of interest obtained from the n replications of the experiment. They obtain both the exact and limiting distribution of the test statistics, and they show that the tests have, asymptotically, the same power as the F‐ratio test.     

Generalized Youden designs: construction and tables

Generalized Youden Designs are generalizations of the class of two-way balanced block designs which include Latin squares and Youden squares. They are used for the same purposes and in the same way that these classical designs are used, and satisfy most of the common criteria of design optimality.We explicitly display or give detailed instructions for constructing all these designs within a practical range: when υ, the number of treatments, is ?25; and b₁ and b₂, the dimensions of the design array, are each ?50.     

Arrays of strength s on two symbols

This paper gives necessary and sufficient conditions on σ, s, t and on μ, s, t for an array with s+t rows to have strength s and weight σ, or to be balanced and have strength s and weight μ. If a balanced array can exist, the conditions provide a construction. The solutions for t=1,2 are also given in an alternate form useful for the study of trim arrays. The balanced solution for t=1 is more detailed than that known so far, and permits one to determine whether or not a solution exists in possibly fewer steps.     

Minimal point second order designs

This paper deals with the problem of finding nearly D-optimal designs for multivariate quadratic regression on a cube which take as few observations as possible and still allow estimation of all parameters. It is shown that among the class of all such designs taking as many observations as possible on the corners of the cube there is one which is asymptotically efficient as the dimension of the cube increases. Methods for constructing designs in this class, using balanced arrays, are given. It is shown that the designs so constructed for dimensions ≤6 compare well with existing computer generated designs, and in dimensions 5 and 6 are better than those in literature prior to 1978.     

On robustness of optimal balanced resolution v plans

In this paper, we present Srivastava-Chopra optimal balanced resolution V plans for 2^m factorials (4?m?8) which are robust in the sense that, when any observation is missing, each of these designs will remain as a resolution V plan.     

TWO-DIMENSIONAL BALANCED SAMPLING PLANS EXCLUDING CONTIGUOUS UNITS

ABSTRACT

A balanced sampling plan excluding contiguous units (or BSEC for short) was first introduced by Hedayat, Rao and Stufken in 1988. These designs can be used for survey sampling when the units are arranged in one-dimensional ordering and the contiguous units in this ordering provide similar information. In this paper, we generalize the concept of a BSEC to the two-dimensional situation and give constructions of two-dimensional BSECs with block size 3. The existence problem is completely solved in the case where λ = 1.     

E-optimal design in irregular BIBD settings

When the necessary conditions for a BIBD are satisfied, but no BIBD exists, there is no simple answer for the optimal design problem. This paper identifies the E-optimal information matrices for any such irregular BIBD setting when the number of treatments is no larger than 100. A- and D-optimal designs are typically not E-optimal. An E-optimal design for 15 treatments in 21 blocks of size 5 is found.