De-aliasing effects using semifoldover techniques

Semifoldover designs, obtained by semifolding a regular two-level factorial design, have been discussed recently in the literature. In this article, with the use of indicator functions, we investigate various semifoldover designs that are obtained from a general two-level factorial design. We discuss when a main factor or a two-factor interaction can be de-aliased from their aliased two-factor interactions, and extend some of the existing results from regular designs to non-regular designs. Finally, we present some examples to illustrate the results developed here.     

On Kronecker block designs for factorial experiments

In this paper the use of Kronecker designs for factorial experiments is considered. The two-factor Kronecker design is considered in some detail and the efficiency factors of the main effects and interaction in such a design are derived. It is shown that the efficiency factor of the interaction is at least as large as the product of the efficiency factors of the two main effects and when both the component designs are totally balanced then its efficiency factor will be higher than the efficiency factor of either of the two main effects. If the component designs are nearly balanced then its efficiency factor will be approximately at least as large as the efficiency factor of either of the two main effects. It is argued that these designs are particularly useful for factorial experiments.Extensions to the multi-factor design are given and it is proved that the two-factor Kronecker design will be connected if the component designs are connected.     

THE USE OF A CLASS OF FOLDOVER DESIGNS AS SEARCH DESIGNS

It is shown that members of a class of two-level nonorthogonal resolution IV designs with n factors are strongly resolvable search designs when k, the maximum number of two-factor interactions thought possible, equals one; weakly resolvable when k = 2 except when the number of factors is 6; and may not be weakly resolvable when k≥ 3.     

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.     

Minimax designs for estimating slopes in a trigonometric regression model

Abstract

Designs for the first order trigonometric regression model over an interval on the real line are considered for the situation where estimation of the slope of the response surface at various points in the factor space is of primary interest. Minimization of the variance of the estimated slope at a point maximized over all points in the region of interest is taken as the design criterion. Optimal designs under the minimax criterion are derived for the situation where the design region and the region of interest are identical and a symmetric “partial cycle”. Some comparisons of the minimax designs with the traditional D- and A-optimal designs are provided. Efficiencies of some exact designs under the minimax criterion are also investigated.     

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).     

Rotatability is a Sufficient Condition for A- and D-Rotatability

Designs for estimating axial slopes of a response surface are considered. A design is said to be A- (D-) rotatable if the trace (determinant) of variance–covariance matrix of the estimated slopes at a point in the factor space is a function of the distance of the point from the center of the design. It is shown that for any order d and any dimension k, a design which is rotatable in the Box and Hunter (1957 Box , G. E. P. , Hunter , J. S. ( 1957 ). Multifactor experimental designs for exploring response surfaces . Annals of Mathematical Statistics 28 : 195 – 241 .[Crossref] , [Google Scholar]) sense is automatically A- and D-rotatable. Some specific examples illustrating the validity of this general result are provided.     

Supersaturated designs of projectivity P=3 or near P=3

Supersaturated designs offer a potentially useful way to investigate many factors in few experiments i.e. typical screening situations. Their design properties have mainly been evaluated based on their ability to identify and estimate main effects. Projective properties have received little attention. In this paper we show how to construct two-level supersaturated designs for 2(n−2) factors in n runs (n a multiple of four) of projectivity P=3 or near projectivity P=3 from orthogonal non-regular two-level designs. The designs obtained also have favourable properties such as low maximum absolute value of the inner product between a main effect column and a two-factor interaction column and relatively few types of different projections onto subsets consisting of three factor columns.     

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.     

EQUINEIGHBOURED XPERIMENTAL DESIGNS

This paper introduces a new class of designs called equi-neighboured designs. An equineighboured design has the property that every unordered pair of treatments occurs as nearest neighbours equally frequently at every level. These designs are defined in Section 4 and shown to be balanced when neighbouring observations are correlated. Some equineighboured designs are constructed using a complete set of orthogonal Latin squares. Cyclic equineighboured designs are also defined.     

Orthogonal main-effect plans in row–column designs for two-level factorial experiments

Row–column designs for two-level factorial experiments are constructed to estimate all the main effects. We give the interactions for row and column blockings. Based on these blockings, independent treatment combinations are proposed to establish the whole design so that practitioners can easily apply it to their experiments. Some examples are given for illustrations. The estimation of two-factor interactions in these designs is discussed.     

A-Optimal Block Designs with Additional Singly Replicated Treatments

Block designs to which have been added a number of singly-replicated treatments, known as secondary treatments, are particularly useful for experiments where only small amounts of material are available for some treatments, for example new plant varieties. The designs are of particular use in the microarray situation. Such designs are known as 'augmented designs'. This paper obtains the properties of these designs and shows that, with an equal number of secondary treatments in each block, the A-optimal design is obtained by using the A-optimal design for the original block design. It develops formulae for the variance of treatment comparisons, for both the primary and the secondary treatments. A number of examples are used to illustrate the results.     

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.     

Circular Binary Block Second- and Higher-Order Neighbor Designs

Some new neighbor designs are presented here. Second-order neighbor designs for different configurations are generated in circular binary blocks. Third-order and fourth-order neighbor designs for some cases are also constructed. In all cases, circular blocks are well separated and these designs are obtained through initial block/s. At the end of the study, some models for analysis of these designs are also presented.     

The performance of subset response surface designs for estimating third order terms

Response surface designs are widely used in industries like chemicals, foods, pharmaceuticals, bioprocessing, agrochemicals, biology, biomedicine, agriculture and medicine. One of the major objectives of these designs is to study the functional relationship between one or more responses and a number of quantitative input factors. However, biological materials have more run to run variation than in many other experiments, leading to the conclusion that smaller response surface designs are inappropriate. Thus designs to be used in these research areas should have greater replication. Gilmour (2006) introduced a wide class of designs called “subset designs” which are useful in situations in which run to run variation is high. These designs allow the experimenter to fit the second order response surface model. However, there are situations in which the second order model representation proves to be inadequate and unrealistic due to the presence of lack of fit caused by third or higher order terms in the true response surface model. In such situations it becomes necessary for the experimenter to estimate these higher order terms. In this study, the properties of subset designs, in the context of the third order response surface model, are explored.     

Three-stage designs for monitoring clinical trials

Optimal three-stage designs with equal sample sizes at each stage are presented and compared to fixed sample designs, fully sequential designs, designs restricted to use the fixed sample critical value at the final stage, and to modifications of other group sequential designs previously proposed in the literature. Typically, the greatest savings realized with interim analyses are obtained by the first interim look. More than 50% of the savings possible with a fully sequential design can be realized with a simple two-stage design. Three-stage designs can realize as much as 75% of the possible savings. Without much loss in efficiency, the designs can be modified so that the critical value at the final stage equals the usual fixed sample value while maintaining the overall level of significance, alleviating some potential confusion should a final stage be necessary. Some common group sequential designs, modified to allow early acceptance of the null hypothesis, are shown to be nearly optimal in some settings while performing poorly in others. An example is given to illustrate the use of several three-stage plans in the design of clinical trials.     

Balanced Treatment incomplete block (BTIB) designs for comparing treatments with a control: minimal complete sets of generator designs for k = 3, p = 3(1)10

Bechhofer and Tamhane (1981) proposed a new class of incomplete block designs called BTIB designs for comparing p ≥ 2 test treatments with a control treatment in blocks of equal size k < p + 1. All BTIB designs for given (p,k) can be constructed by forming unions of replications of a set of elementary BTIB designs called generator designs for that (p,k). In general, there are many generator designs for given (p,k) but only a small subset (called the minimal complete set) of these suffices to obtain all admissible BTIB designs (except possibly any equivalent ones). Determination of the minimal complete set of generator designs for given (p,k) was stated as an open problem in Bechhofer and Tamhane (1981). In this paper we solve this problem for k = 3. More specifically, we give the minimal complete sets of generator designs for k = 3, p = 3(1)10; the relevant proofs are given only for the cases p = 3(1)6. Some additional combinatorial results concerning BTIB designs are also given.     

Generalized neighbor designs with block size 3

A generalized neighbor design relaxes the equality condition on the number of times two treatments as neighbors in the design. In this article, we have considered the construction of some classes of generalized neighbor designs with block size k=3 by using the method of cyclic shifts. The distinguishing feature of this construction method is that the properties of a design can easily be obtained from the sets of shifts instead of constructing the actual blocks of the design. A catalog of generalized neighbor designs with block size k=3 is compiled for v∈{5,6,…,18} treatments and for different replications. We provide the reader with a simpler method of construction, and in general the catalog that gives an open choice to the experimenter for selecting any class of neighbor designs.     

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.     

Optimal experimental designs when an independent variable is potentially censored

This paper considers the problem of constructing optimal approximate designs when an independent variable might be censored. The problem is which design should be applied in practice to obtain the best approximate design when a censoring distribution is assumed known in advance. The approach for finite or continuous design spaces deserves different attention. In both cases, equivalent theorems and algorithms are provided in order to calculate optimal designs. Some examples illustrate this approach for D-optimality.