Optimal block designs with non additive mixed effects interference

This paper deals with optimality aspects of block designs balanced for interference effects from neighboring units on both sides under a general non additive model along with random block effects. Here, a class of complete, circular block designs strongly balanced for interference effects has been shown to be universally optimal for the estimation of direct effects and interference effects (left and right) of treatments under a non additive mixed effects model.     

Optimal Circular Block Designs for Neighbouring Competition Effects

Competition or interference occurs when the responses to treatments in experimental units are affected by the treatments in neighbouring units. This may contribute to variability in experimental results and lead to substantial losses in efficiency. The study of a competing situation needs designs in which the competing units appear in a predetermined pattern. This paper deals with optimality aspects of circular block designs for studying the competition among treatments applied to neighbouring experimental units. The model considered is a four-way classified model consisting of direct effect of the treatment applied to a particular plot, the effect of those treatments applied to the immediate left and right neighbouring units and the block effect. Conditions have been obtained for the block design to be universally optimal for estimating direct and neighbour effects. Some classes of balanced and strongly balanced complete block designs have been identified to be universally optimal for the estimation of direct, left and right neighbour effects and a list of universally optimal designs for v<20 and r<100 has been prepared.     

Connectedness of complete block designs under an interference model

We consider an experiment with fixed number of blocks, in which a response to a treatment can be affected by treatments from neighboring units. For such experiment the interference model with neighbor effects is studied. Under this model we study connectedness of binary complete block designs. Assuming the circular interference model with left-neighbor effects we give the condition for minimal number of blocks necessary to obtain connected design. For a specified class of binary, complete block designs, we show that all designs are connected. Further we present the sufficient and necessary conditions of connectedness of designs with arbitrary, fixed number of blocks.     

Approximate theory of multiway block designs

Optimality properties of multiway block designs are deduced from the general results of J. Kiefer's approximate-design theory. In the model with additive effects these optimality properties solely depend on the two-dimensional marginals of the designs. Uniform designs, and designs whose two-dimensional marginals are products of the one-dimensional marginals, are shown to be optimal. Approximate Youden designs are introduced for the case when the support sets of the two-dimensional marginals are prescribed in advance. They are optimal in a relatively small class of competing designs only.     

Cross-over Designs in the Presence of Higher Order Carry-overs

In cross-over experiments, where different treatments are applied successively to the same experimental unit over a number of time periods, it is often expected that a treatment has a carry-over effect in one or more periods following its period of application. The effect of interaction between the treatments in the successive periods may also affect the response. However, it seems that all systematic studies of the optimality properties of cross-over designs have been done under models where carry-over effects are assumed to persist for only one subsequent period. This paper proposes a model which allows for the possible presence of carry-over effects up to k subsequent periods, together with all the interactions between treatments applied at k + 1 successive periods. This model allows the practitioner to choose k for any experiment according to the requirements of that particular experiment. Under this model, the cross-over designs are studied and the class of optimal designs is obtained. A method of constructing these optimal designs is also given.     

Balanced incomplete Latin square designs

Latin squares have been widely used to design an experiment where the blocking factors and treatment factors have the same number of levels. For some experiments, the size of blocks may be less than the number of treatments. Since not all the treatments can be compared within each block, a new class of designs called balanced incomplete Latin squares (BILS) is proposed. A general method for constructing BILS is proposed by an intelligent selection of certain cells from a complete Latin square via orthogonal Latin squares. The optimality of the proposed BILS designs is investigated. It is shown that the proposed transversal BILS designs are asymptotically optimal for all the row, column and treatment effects. The relative efficiencies of a delete-one-transversal BILS design with respect to the optimal designs for both cases are also derived; it is shown to be close to 100%, as the order becomes large.     

AN ALGORITHM FOR THE CONSTRUCTION OF OPTIMAL OR NEAR-OPTIMAL CHANGE-OVER DESIGNS

This paper presents an algorithm for the construction of optimal or near optimal change-over designs for arbitrary numbers of treatments, periods and units. Previous research on optimality has been either theoretical or has resulted in limited tabulations of small optimal designs. The algorithm consists of a number of steps:first find an optimal direct treatment effects design, ignoring residual effects, and then optimise this class of designs with respect to residual effects. Poor designs are avoided by judicious application of the (M, S)-optimality criterion, and modifications of it, to appropriate matrices. The performance of the algorithm is illustrated by examples.     

Optimality of circular neighbor-balanced designs for total effects with autoregressive correlated observations

This paper studies the optimality of circular neighbor-balanced designs (CNBDs) for total effects when the one-sided or two-sided neighbor effects are present in the model and the observation errors are correlated according to a first-order circular autoregressive (AR(1,C$C$)) process. Some optimality results under some specified conditions are provided and the efficiency of a CNBD relative to the optimal block design is investigated. In order to discuss the efficiency of a CNBD among all possible block designs with the same size, the optimal equivalence classes of sequences under the one-sided neighbor effects model are characterized and the efficiencies of CNBDs with blocks of small size are illustrated.     

Designs for two-colour microarray experiments

Summary.  Designs for two-colour microarray experiments can be viewed as block designs with two treatments per block. Explicit formulae for the A- and D-criteria are given for the case that the number of blocks is equal to the number of treatments. These show that the A- and D-optimality criteria conflict badly if there are 10 or more treatments. A similar analysis shows that designs with one or two extra blocks perform very much better, but again there is a conflict between the two optimality criteria for moderately large numbers of treatments. It is shown that this problem can be avoided by slightly increasing the number of blocks. The two colours that are used in each block effectively turn the block design into a row–column design. There is no need to use a design in which every treatment has each colour equally often: rather, an efficient row–column design should be used. For odd replication, it is recommended that the row–column design should be based on a bipartite graph, and it is proved that the optimal such design corresponds to an optimal block design for half the number of treatments. Efficient row–column designs are given for replications 3–6. It is shown how to adapt them for experiments in which some treatments have replication only 2.     

On optimality properties of simple block designs in the approximate design theory

Optimality properties of approximate block designs are studied under variations of (1) the class of competing designs, (2) the optimality criterion, (3) the parametric function of interest, and (4) the statistical model. The designs which are optimal turn out to be the product of their treatment and block marginals, and uniform designs when the support is specified in advance. Optimality here means uniform, universal, and simultaneous j_p-optimality. The classical balanced incomplete block designs are embedded into this approach, and shown to be simultaneously j_p-optimal for a maximal system of identifiable parameters. A geometric account of universal optimality is given which applies beyond the context of block designs.     

A generalisation of T‐optimality for discriminating between competing models with an application to pharmacokinetic studies

The T‐optimality criterion is used in optimal design to derive designs for model selection. To set up the method, it is required that one of the models is considered to be true. We term this local T‐optimality. In this work, we propose a generalisation of T‐optimality (termed robust T‐optimality) that relaxes the requirement that one of the candidate models is set as true. We then show an application to a nonlinear mixed effects model with two candidate non‐nested models and combine robust T‐optimality with robust D‐optimality. Optimal design under local T‐optimality was found to provide adequate power when the a priori assumed true model was the true model but poor power if the a priori assumed true model was not the true model. The robust T‐optimality method provided adequate power irrespective of which model was true. The robust T‐optimality method appears to have useful properties for nonlinear models, where both the parameter values and model structure are required to be known a priori, and the most likely model that would be applied to any new experiment is not known with certainty. Copyright © 2012 John Wiley & Sons, Ltd.     

Bayesian optimal blocking of factorial designs

The presence of block effects makes the optimal selection of fractional factorial designs a difficult task. The existing frequentist methods try to combine treatment and block wordlength patterns and apply minimum aberration criterion to find the optimal design. However, ambiguities exist in combining the two wordlength patterns and therefore, the optimality of such designs can be challenged. Here we propose a Bayesian approach to overcome this problem. The main technique is to postulate a model and a prior distribution to satisfy the common assumptions in blocking and then, to develop an optimal design criterion for the efficient estimation of treatment effects. We apply our method to develop regular, nonregular, and mixed-level blocked designs. Several examples are presented to illustrate the advantages of the proposed method.     

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.     

Efficient circular neighbour designs for spatial interference model

We consider circular block designs for field-trials when there are two-sided spatial interference between neighbouring plots of the same blocks. The parameter of interest is total effects that is the sum of direct effect of treatment and neighbour effects, which correspond to the use of a single treatment in the whole field. We determine universally optimal approximate designs. When the number of blocks may be large, we propose efficient exact designs generated by a single sequence of treatment. We also give efficiency factors of the usual binary block neighbour balanced designs which can be used when the number of blocks is small.     

Nonproper variance balanced designs and optimality

This communication deals with the construction and optimality of non-proper (unequal block sized) variance balanced (VB) designs obtainable under linear homoscedastic normal model. Several methods of construction of non-proper VB designs have been given. Some constructed designs are universally optimal non-proper variance balanced designs.     

Designs balanced for circular residual effects

Magda (1980) introduced a model for repeated measurements designs with a circular structure of the residual effects. He proved the universal optimality of circular balanced uniform designs over a subclass of the possible designs. We strengthen his result to optimality over the set of all designs with the same number of experimental units, periods and treatments.     

A note on circular neighbor balanced designs

ABSTRACT

This paper describes some methods of constructing circular neighbor balanced and circular partially neighbor balanced block designs for estimation of direct and neighbor effects of the treatments. A class of circular neighbor balanced block designs with unequal block sizes is also proposed.     

Some sufficient conditions for the type 1 optimality of block designs

In this paper, we investigate the problem of determining block designs which are optimal under type 1 optimality criteria within various classes of designs having υ treatments arranged in b blocks of size k. The solutions to two optimization problems are given which are related to a general result obtained by Cheng (1978) and which are useful in this investigation. As one application of the solutions obtained, the definition of a regular graph design given in Mitchell and John (1977) is extended to that of a semi-regular graph design and some sufficient conditions are derived for the existence of a semi-regular graph design which is optimal under a given type 1 criterion. A result is also given which shows how the sufficient conditions derived can be used to establish the optimality under a specific type 1 criterion of some particular types of semi- regular graph designs having both equal and unequal numbers of replicates. Finally,some sufficient conditions are obtained for the dual of an A- or D-optimal design to be A- or D-optimal within an appropriate class of dual designs.     

Algorithmic construction of optimal block designs for two-colour cDNA microarray experiments using the linear mixed effects model

ABSTRACT

In this study, methods for efficient construction of A-, MV-, D- and E-optimal or near-optimal block designs for two-colour cDNA microarray experiments with array as the block effect are considered. Two algorithms, namely the array exchange and treatment exchange algorithms together with the complete enumeration technique are introduced. For large numbers of arrays or treatments or both, the complete enumeration method is highly computer intensive. The treatment exchange algorithm computes the optimal or near-optimal designs faster than the array exchange algorithm. The two methods however produce optimal or near-optimal designs with the same efficiency under the four optimality criteria.     

On the optimalizes of the mbgdd's under mixed effects model

In the present paper, under the assumption of a mixed effects model with random block effects, the type 1 optimality of the most balanced group divisible designs of type 1 has been established within the general class of all proper and connected block designs with k<v.