Computer-Generated Change-Over Designs for Correlated Observations

Change-over designs with independently distributed errors in the model have been studied extensively in the literature. Martin and Eccleston (2001 Martin , R. J. , Eccleston , J. A. ( 2001 ). Optimal and near optimal designs for dependent observations . Statist. Applic. 3 : 101 – 116 . [Google Scholar]) gave an algorithm for the generation of efficient change-over designs when the errors are correlated. This article proposes an algorithm for the generation of efficient change-over designs for estimation of direct effects of treatments in the presence of first-order residual effects in the model and when the errors are correlated.     

Addition of runs to a two-level supersaturated design

The purpose of this article is to introduce a new class of extended E(s²)-optimal two level supersaturated designs obtained by adding runs to an existing E(s²)-optimal two level supersaturated design. The extended design is a union of two optimal SSDs belonging to different classes. New lower bound to E(s²) has been obtained for the extended supersaturated designs. Some examples and a small catalogue of E(s²)-optimal SSDs are also included.     

Designs for cropping systems research

The present article establishes equivalence between extended group divisible (EGD) designs and designs for crop sequence experiments. This equivalence has encouraged the agricultural experimenters to use EGD designs for their experimentation. Some real life applications of EGD designs have been given. It has also been shown that several existing association schemes are special cases of EGD association scheme. Some methods of construction of EGD designs are also given. A catalogue of EGD designs obtainable through methods of construction along with efficiency factors of various factorial effects is also presented. In some crop sequence experiments that are conducted to develop suitable integrated nutrient supply system of a crop sequence, the treatments do not comprise of a complete factorial structure. The experimenter is interested in estimating the residual and direct effect of the treatments along with their cumulative effects. For such experimental settings block designs with two sets of treatments applied in succession are the appropriate designs. The correspondence established between row–column designs and block designs for two stage experiments by Parsad et al. [2003. Structurally incomplete row–column designs. Comm. Statist. Theory Methods 32(1), 239–261] has been exploited in obtaining designs for such experimental situations. Some open problems related to designing of crop sequence experiments are also given.     

Efficient Block Designs for Dependent Observations—A Computer-Aided Search

In this article, the exchange and interchange algorithm of Zergaw (1989 Zergaw , G. ( 1989 ). A sequential method of constructing optimal block designs . Austral. J. Statist. 31 : 333 – 342 .[Crossref] , [Google Scholar]) and Martin and Eccleston (1992 Martin , R. J. , Eccleston , J. A. ( 1992 ). Recursive formulae for constructing block designs with dependent errors . Biometrika 79 : 426 – 430 .[Crossref], [Web of Science ®] , [Google Scholar]) have been modified and used for searching efficient block designs for making all possible pairwise treatment comparisons when observations are dependent. The lower bounds to the A- and D-efficiencies of the designs in a given class of the designs have been obtained for correlated observation structure and the procedure of computing lower bounds to A- and D-efficiencies has been incorporated in the algorithm. The algorithm has been translated into a computer program using Microsoft Visual C++. Using this program, a search for efficient designs for making all possible pairwise treatment comparisons has been made for v ≤ 10, b ≤ 33, k ≤ 10 such that bk ≤ 100 and v > k. The block designs considered are usual block designs (rectangular block designs) and circular block designs. Nearest neighbor (NN), autoregressive of order 1 (AR(1)) correlation structures are studied. The ranges of correlation coefficients for different correlation structures investigated are |ρ|≤0.50 for NN correlation structure in rectangular blocks, |ρ|≤0.45 for NN correlation structure in circular blocks, and |ρ|≤0.95 for AR(1) correlation structure. For these ranges, the matrix of correlation coefficients among observations within a block is positive definite. Robustness aspects of designs that are efficient for a given value of correlation have been investigated against other values of correlation coefficients. Robustness aspects of designs that are efficient for independent observations have also been studied for experimental situations with dependent observations.     

Construction of Efficient Multi-Level k-Circulant Supersaturated Designs

This article proposes an algorithm to construct efficient balanced multi-level k-circulant supersaturated designs with m factors and n runs. The algorithm generates efficient balanced multi-level k-circulant supersaturated designs very fast. Using the proposed algorithm many balanced multi-level supersaturated designs are constructed and cataloged. A list of many optimal and near optimal, multi-level supersaturated designs is also provided for m ≤ 60 and number of levels (q) ≤10. The algorithm can be used to generate two-level k-circulant supersaturated designs also and some large optimal two-level supersaturated designs are presented. An upper bound to the number of factors in a balanced multi-level supersaturated design such that no two columns are fully aliased is also provided.     

Incomplete row-column designs with factorial treatment structure for estimating main effects with full efficiency

In this paper, we propose two methods of constructing row-column designs for factorial experiments. The constructed designs have orthogonal factorial structure with balance and permits estimation of main effects with full efficiency.     

Robustness of complete diallel crossing plans against exchange of one cross

The robustness aspects of block designs for complete diallel crossing plans against the exchange of one cross using connectedness and efficiency criteria have been investigated. The exchanged cross may have either no line in common or one line in common with the original cross. It has been found that randomized complete block (RCB) designs for complete diallel crosses and binary balanced block designs for complete diallel crosses are robust against the exchange of one cross in one observation. The RCB designs for diallel crosses have been shown to be robust against the exchange of one cross with another cross in all the blocks. The non-binary balanced block designs obtainable from Family 5 of Das et al. (1998) have also been found to be robust against the exchange of one cross.     

Two-dimensional balanced sampling plans excluding adjacent units under sharing a border and island adjacency schemes

In Balanced Sampling Plans Excluding Adjacent Units (BSA plans) first order inclusion probabilities are equal and second order inclusion probabilities are zero for pairs of units at a distance less than or equal to m and are constant for pairs of units which are at a distance greater than m. These plans are useful when the adjacent units in the population provide similar information. In this paper, an algorithm based on linear programming approach has been developed for construction of two-dimensional BSA plans under sharing a border and island adjacency schemes for m ≤ 2. Some results on existence of such BSA plans have also been obtained for each adjacency scheme separately.     

Balanced treatment incomplete block designs through integer programming

An algorithm is presented to construct balanced treatment incomplete block (BTIB) designs using a linear integer programming approach. Construction of BTIB designs using the proposed approach is illustrated with an example. A list of efficient BTIB designs for 2 ? v ? 12, v + 1 ? b ? 50, 2 ? k ? min(10, v), r ? 10, r₀ ? 20 is provided. The proposed algorithm is implemented as part of an R package.