The connectedness and optimality of a class of row-column designs

Balanced Incomplete Block Designs have been employed as row-column designs by a number of researchers. In this paper necessary and sufficient conditions for the connectedness of such designs are obtained, and methods for their optimisation are presented. The optimal design is shown to be always connected.     

A note on the robustness of PBIBD(2)s against breakdown in the event of observation loss

Robustness against design breakdown following observation loss is investigated for Partially Balanced Incomplete Block Designs with two associate classes (PBIBD(2)s). New results are obtained which add to the body of knowledge on PBIBD(2)s. In particular, using an approach based on the E‐value of a design, all PBIBD(2)s with triangular and Latin square association schemes are established as having optimal block breakdown number. Furthermore, for group divisible designs not covered by existing results in the literature, a sufficient condition for optimal block breakdown number establishes that all members of some design sub‐classes have this property.     

The Construction of Optimal Balanced Incomplete Block Designs When Adjacent Observations are Correlated

An algorithm is described for the optimal rearrangement of the treatments within each block of a Balanced Incomplete Block Design when a specified “nearest neighbour” correlation structure exists among observations from plots in the same block. The procedure uses results obtained by Kiefer & Wynn (1981). Designs obtained using the algorithm are found to compare favourably with those produced by combinatorial methods given in Cheng (1983). The algorithm produces optimal designs for all BIBD parameter sets, including those not covered by the results of Kiefer & Wynn or Cheng.     

Mixture designs with orthogonal blocks

Constructions of blocked mixture designs are considered in situations where BLUEs of the block effect contrasts are orthogonal to the BLUEs of the regression coefficients. Orthogonal arrays (OA), Balanced Arrays (BAs), incidence matrices of balanced incomplete block designs (BIBDs), and partially balanced incomplete block designs (PBIBDs) are used. Designs with equal and unequal block sizes are considered. Also both cases where the constants involved in the orthogonality conditions depend and do not depend on the factors have been taken into account. Some standard (already available) designs can be obtained as particular cases of the designs proposed here.     

Construction on non-adaptive hypergeometric group testing desings for identifying at most two defectives

In the literature a systematic method of obtaining a group testing design is not available at present. Weideman and Raghavarao (1987a, b) gave methods for the construction of non - adaptive hypergeometric group testing designs for identifying at most two defectives by using a dual method. In the present investigation we have developed a method of construction of group testing designs from (i) Hypercubic Designs for t ≡ 3 (mod 6) and (ii) Balanced Incomplete Block Designs for t ≡ 1 (mod 6) and t ≡ 3 (mod 6). These constructions are accomplished by the use of dual designs. The designs so constructed satisfy specified properties and attained an optimal bound as discussed by Weidman and Raghavarao (1987a,b). Here it is also shown that the condition for pairwise disjoint sets of BIBD for t ≡ 1 (mod 6) given by Weideman and Raghavarao (1987b) is not true for all such designs.     

Balanced and partially balanced incomplete block designs with autocorrelation errors

The paper aims to find variance balanced and variance partially balanced incomplete block designs when observations within blocks are autocorrelated and we call them BIBAC and PBIBAC designs. Orthogonal arrays of type I and type II when used as BIBAC designs have smaller average variance of elementary contrasts of treatment effects compared to the corresponding Balanced Incomplete Block (BIB) designs with homoscedastic, uncorrelated errors. The relative efficiency of BIB designs compared to BIBAC designs depends on the block size k and the autocorrelation ρ and is independent of the number of treatments. Further this relative efficiency increases with increasing k. Partially balanced incomplete block designs with autocorrelated errors are introduced using partially balanced incomplete block designs and orthogonal arrays of type I and type II.     

Measures of non orthogonality in block designs

Orthogonality is an important concept in block design. Necessary and sufficient condition for a connected block design to be orthogonal is well known. However, when a design is not orthogonal, it is not clear how much it deviates from orthogonality. In this paper, an attempt has been made to first define the measures of or indices to non orthogonality in block design and then to characterize designs possessing minimum non orthogonality indices. It is shown that a Balanced Incomplete Block Design (BIBD) and a Balanced Block Design (BBD), if exist, possess this property.     

Construction of incomplete Sudoku square and partially balanced incomplete block designs

Abstract

The present article deals with the study of association among the elements of a Sudoku square. In this direction, we have defined an association scheme and constructed incomplete Sudoku square designs which are capable of studying four explanatory variables and also happen to be the designs for two-way elimination of heterogeneity. Some series of Partially Balanced Incomplete Block (PBIB) designs have also been obtained.     

Many (22, 44, 14, 7, 4) — and (15, 42, 14, 5, 4)-balanced incomplete block designs

A Balanced Incomplete Block Design (BIBD) is a pair (V, B) where V is a v-set and B is a collection of b k-subsets of V, called blocks, such that every element of V occurs in exactly r of the k-subsets and every 2-subset of V occurs in exactly λ of the blocks. The number of non-isomorphic designs of a BIBD (22, 44, 14, 7, 4) whose automorphism group is divisible by 7 or 11 are investigated. From this work, results are obtained on the number of non-isomorphic BIBDs (15, 42, 14, 5, 4).     

Construction of repeated measurements designs strongly balanced for residual effects

Abstract

Repeated Measurements Designs have been widely used in agriculture, animal husbandry, education, biology, botany and engineering. Balanced or strongly balanced repeated measurements designs are useful to balance out the residual effects. In this article, some new generators and construction procedures are proposed to obtain circular strongly balanced repeated measurements designs in periods of (a) equal sizes, (b) two different sizes, and (c) three different sizes.     

On the analysis of experiments in affine resolvable designs

The paper gives explicit formulae for analysing an experiment carried out in an affine resolvable proper block design. They follow from a randomization model, decomposed into stratum submodels. Analyses within the four relevant strata, and then the combined analysis, are considered in details. The paper is essentially an extension of some results presented in recent books, by Caliński and Kageyama [2000. Block Designs: A Randomization Approach, Volume I: Analysis. Lecture Notes in Statistics, vol. 150. Springer, New York; 2003. Block Designs: A Randomization Approach, Volume II: Design. Lecture Notes in Statistics, vol. 170. Springer, New York].     

A SEQUENTIAL METHOD OF CONSTRUCTING OPTIMAL BLOCK DESIGNS

An algorithm for the construction of a wide class of block designs including Balanced Incomplete Blocks (BIB) is described. The algorithm which allows the experimenter to give weights for a set of treatment contrasts uses an initial starting design to generate an optimal block design sequentially. The performance of the algorithm is illustrated by examples, and designs constructed by the algorithm compare favourably with designs generated by other methods.     

BOOK REVIEWS

Book reviewed in this article:
Incomplete Block Designs. By Peter W. M. John.
Statistical Modeling Techniques. By Samuel S. Shapiro and Alan J. Gross
Factorial Designs. By B. L. Raktoe, A. Hedayat and W. T. Federer.
Stochastic Storage Processes—Queues, Insurance Risk and Dams. By N. U. Prabhu.
A User's Guide to the Gottman-Williams Time Series Analysis Computer Programs for Social Scientists. By Esther A. Williams and John M. Gottman.
Statistics at Work. Edited by S. Gubbins, D. A. Rhoades, D. Vere-Jones.
Computing in Statistical Science through APL. By Francis John Anscombe.     

The Hamming distances of saturated asymmetrical orthogonal arrays with strength 2

Abstract

Orthogonal arrays have many connections to other combinatorial designs and are applied in coding theory, the statistical design of experiments, cryptography, various types of software testing and quality control. In this paper, we present some general methods to find the Hamming distances for saturated asymmetrical orthogonal arrays (SAOAs) with strength 2. As applications of our methods, the Hamming distances of SAOA parents of size less than or equal to 100 are obtained. We also provide the Hamming distances of the SAOAs constructed from difference schemes or by the expansive replacement method. The feasibility of Hamming distances is discussed.     

Some new classes of multivariate survival distribution functions

The concept of the univariate mean remaining life (m.r.l.) function is generalized to the multivariate case. The multivariate mean remaining life (m.m.r.l.) function is utilized to introduce four new classes of multivariate survival distribution functions (s.d.f.'s). Each of these classes is a new generalization of the univariate decreasing mean remaining life (DMRL) class of s.d.f.'s. The duals of these classes are introduced. Some properties, physical interpretation, and relationships among these classes are investigated. Also for each case, the class of s.d.f.'s common in a class and its dual is characterized.     

Wald's approximations to the average run length in cusum procedures

Wald's approximation to the ARL(average run length in cusum) (cumulative sum) procedures are given for an exponential family of densities. From these approximations it is shown that Page's (1954) cusum procedure is (in a sense) identical with a cusum procedure defined in terms of likelihood ratios. Moreover, these approximations are improved by estimating the excess over the boundary and their closeness is examined by numerical comparisons with some exact results. Some examples are also given.     

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 new classes of orthogonal Latin hypercube designs

Orthogonal Latin hypercube (OLH) is a good design choice in a polynomial function model for computer experiments, because it ensures uncorrelated estimation of linear effects when a first-order model is fitted. However, when a second-order model is adopted, an OLH also needs to satisfy the additional property that each column is orthogonal to the elementwise square of all columns and orthogonal to the elementwise product of every pair of columns. Such class of OLHs is called OLHs of order two while the former class just possessing two-dimensional orthogonality is called OLHs of order one. In this paper we present a general method for constructing OLHs of orders one and two for n=s^m$n=s^m$ runs, where s and m may be any positive integers greater than one, by rotating a grouped orthogonal array with a column-orthogonal rotation matrix. The Kronecker product and the stacking methods are revisited and combined to construct some new classes of OLHs of orders one and two with other flexible numbers of runs. Some useful OLHs of order one or two with larger factor-to-run ratio and moderate runs are tabulated and discussed.     

Comparisons of search designs using search probabilities

Search designs are considered for searching and estimating one nonzero interaction from the two and three factor interactions under the search linear model. We compare three 12-run search designs D1, D2, and D3, and three 11-run search designs D4, D5, and D6, for a 2⁴ factorial experiment. Designs D2 and D3 are orthogonal arrays of strength 2, D1 and D4 are balanced arrays of full strength, D5 is a balanced array of strength 2, and D6 is obtained from D3 by deleting the duplicate run. Designs D4 and D5 are also obtained by deleting a run from D1 and D2, respectively. Balanced arrays and orthogonal arrays are commonly used factorial designs in scientific experiments. “Search probabilities” are calculated for the comparison of search designs. Three criteria based on search probabilities are presented to determine the design which is most likely to identify the nonzero interaction. The calculation of these search probabilities depends on an unknown parameter ρ which has a signal-to-noise ratio form. For a given value of ρ, Criteria I and II are newly proposed in this paper and Criteria III is given in Shirakura et al. (Ann. Statist. 24 (6) (1996) 2560). We generalize Criteria I–III for all values of ρ so that the comparison of search designs can be made without requiring a specific value of ρ. We have developed simplified methods for comparing designs under these three criteria for all values of ρ. We demonstrate, under all three criteria, that the balanced array D1 is more likely to identify the nonzero interaction than the orthogonal arrays D2 and D3, and the design D4 is more likely to identify the nonzero interaction than the designs D5 and D6.The methods of comparing designs developed in this paper are applicable to other factorial experiments for searching one nonzero interaction of any order.