Optimal blocked main effects plans

In this paper, we consider the construction of optimal blocked main effects designs where m two-level factors are to be studied in N runs which are partitioned into b blocks of equal size. For N ≡ 2±od4 sufficient conditions are derived for a design to be Φ _f optimal among all designs having main effects occurring equally often at their high and low levels within blocks and then this result is extended to the class of all designs for the case when the block size is two. Methods of constructing designs satisfying the sufficient conditions derived are also given.     

Construction of Neighbor-Balanced Designs in Linear Blocks

Neighbor-balanced designs are useful to remove the neighbor effects in experiments where the performance of a treatment is affected by the treatments applied to its adjacent neighbors. In this article, neighbor-balanced designs are constructed in linear blocks of (i) equal sizes and (ii) two different sizes k ₁ and k ₂.     

Minimal Neighbor Designs in Linear Blocks

Neighbor designs are useful to neutralize the neighbor effects. In literature, most of the constructed neighbor designs are in circular blocks but linear blocks have more practical application in field experiments. In this article, some infinite series of minimal neighbor designs are constructed in proper linear blocks. There are many situations where minimal neighbor designs cannot be constructed in proper linear blocks. To overcome this problem neighbor designs in improper linear blocks and GN₂-designs in proper linear blocks are constructed.     

Optimal orthogonal block designs for four-mixture components in two blocks based on F-squares for Becker's models and K-model

Orthogonal block designs in mixture experiments have been extensively studied by various authors. Aggarwal et al. [M.L. Aggarwal, P. Singh, V. Sarin, and B. Husain, Mixture designs in orthogonal blocks using F-squares, METRON – Int. J. Statist. LXVII(2) (2009), pp. 105–128] considered the case of components assuming the same volume fractions and obtained mixture designs in orthogonal blocks using F-squares. In this paper, we have used the class of designs presented by Aggarwal et al. and have obtained D-, A- and E-optimal orthogonal block designs for four components in two blocks for Becker's mixture models and K-model, respectively. Orthogonality conditions for the considered models are also given.     

Some series of proper generalized neighbor designs

Neighbor balanced designs are used to remove the neighbor effects but most of these designs require a large number of blocks. To neutralize the neighbor effects in such situations, GN₂-designs are most desirable. This article deals with the (i) refinement of some series of GN₂-designs constructed by Zafaryab et al. (2010) and (ii) construction of some new series of GN₂-designs in circular blocks of equal size.     

General upper bound for the number of blocks having a given number of treatments common with a given block

The purpose of this paper is systematically to derive the general upper bound for the number of blocks having a given number of treatments common with a given block of certain incomplete block designs. The approach adopted here is based on the spectral decomposition of N′N for the incidence matrix N of a design, where N' is the transpose of the matrix N. This approach will lead us to upper bounds for incomplete block designs, in particular for a large number of partially balanced incomplete block (PBIB) designs, which are not covered with the standard approach (Shah 1964, 1966), Kapadia (1966)) of using well known relations between blocks of the designs and their association schemes. Several results concerning block structure of block designs are also derived from the main theorem. Finally, further generalizations of the main theorem are discussed with some illustrations.     

Algorithmic and analytical construction of efficient designs in small blocks for comparing consecutive pairs of treatments

Optimal block designs in small blocks are explored under the A-, E- and D-criteria when the treatments have a natural ordering and interest lies in comparing consecutive pairs of treatments. We first formulate the problem via approximate theory which leads to a convenient multiplicative algorithm for obtaining A-optimal design measures. This, in turn, yields highly efficient exact designs, under the A-criterion, even when the number of blocks is rather small. Moreover, our approach is seen to allow nesting of such efficient exact designs which is an advantage when the resources for the experiment are available in possibly several stages. Illustrative examples are given and tables of A-optimal design measures are provided. Approximate theory is also seen to yield analytical results on E- and D-optimal design measures.     

Tables of Cyclic Incomplete Block Designs: r=k

Initial blocks and efficiencies are given for cyclic incomplete block designs in the range t= 10(1)60 and r=k= 3(1)10. The designs have been selected by search procedures using optimality criteria which maximize the efficiency factor.     

Lower bounds of the wrap-around -discrepancy and relationships between MLHD and uniform design with a large size

The wrap-around (WD) L₂-discrepancy has been commonly used in experimental designs. In this paper, some lower bounds of the WD L₂-discrepancy for asymmetrical U-type designs are given and the expectation and variance of midpoint Latin hypercube designs (LHD) are also obtained. Relationships between midpoint LHD and uniform designs for symmetrical and asymmetrical cases are discussed in the sense of comparing the lower bound and the expectation of squared wrap-around L₂-discrepancy of U-type designs. Some comparisons between simple random sampling and the lower bounds of U-type designs are given.     

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.     

The Efficient Methods to Construct Two-Per-Block Design in 2 k Plans

There are many situations which require the performing of two points in one block. Two subjects, in which all effects are available to estimate free of blocks and all main effects and two-factor interactions are estimated free of blocks, are worth to pursue in the 2 ^k design. In this article, we precisely present the minimum number of necessary blocks that enable to estimate the required effects. We also give a methodology to construct the combined designs without using computer search.     

Lower bound of average centered L2-discrepancy for U-type designs

Uniform designs are widely used in various scientific investigations and industrial applications. By considering all possible level permutation of the factors, a connection between average centered L₂-discrepancy and generalized wordlength pattern for asymmetrical fractional factorial designs is derived. Moreover, we present new lower bounds to the average centered L₂-discrepancy for symmetrical and asymmetrical U-type designs. For illustration of the theoretical results, the lower bounds for symmetrical and asymmetrical U-type designs are tabulated, and numerical results indicate that our lower bounds behave well and can be recommended for use in practice.     

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.     

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.     

On the E-optimality of blocked main effects plans in blocks of different sizes

In this article, we consider experimental situations in which m 2-level factors are to be studied using a main effects plan where n runs are to be partitioned into b blocks having both even and odd sizes. For these cases, we give some simple methods for constructing E-optimal 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.     

2<Superscript><Emphasis Type="Italic">m</Emphasis></Superscript>4<Superscript>1</Superscript> designs with minimum aberration or weak minimum aberration

For measuring the goodness of 2 ^m 4¹ designs, Wu and Zhang (1993) proposed the minimum aberration (MA) criterion. MA 2 ^m 4¹ designs have been constructed using the idea of complementary designs when the number of two-level factors, m, exceeds n/2, where n is the total number of runs. In this paper, the structures of MA 2 ^m 4¹ designs are obtained when m>5n/16. Based on these structures, some methods are developed for constructing MA 2 ^m 4¹ designs for 5n/16<m<n/2 as well as for n/2≤m<n. When m≤5n/16, there is no general method for constructing MA 2 ^m 4¹ designs. In this case, we obtain lower bounds for A ₃₀ and A ₃₁, where A ₃₀ and A ₃₁ are the numbers of type 0 and type 1 words with length three respectively. And a method for constructing weak minimum aberration (WMA) 2 ^m 4¹ designs (A ₃₀ and A ₃₁ achieving the lower bounds) is demonstrated. Some MA or WMA 2 ^m 4¹ designs with 32 or 64 runs are tabulated for practical use, which supplement the tables in Wu and Zhang (1993), Zhang and Shao (2001) and Mukerjee and Wu (2001).     

Circular balanced repeated measurement designs in periods of three different sizes

Abstract

Repeated measurement designs are widely used in medicine, pharmacology, animal sciences and psychology. If there is a restriction on the total number of treatments, some experimental units can receive on the total length of time while some experimental units can remain in the trial, then repeated measurements designs with unequal period sizes should be used. In this article, some infinite series are developed to generate the minimal balanced repeated measurement designs in periods of three different sizes p₁, p₂ and p₃, where 2?≤?p₃?<?p₂ ≤ 10 and p₂?<?p₁.     

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.     

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.