ON CONSTRUCTION OF GENERALIZED GROUP DIVISIBLE DESIGNS WITH TWO GROUPS

ABSTRACT

Many simple and general methods of construction, using α-resolvable balanced incomplete block designs, for generalized group divisible designs with two groups (GGDD(2)) are given. The E-optimality of all constructed designs is also discussed.     

ON THE ESTIMATION OF TOTAL WEIGHT IN SINGULAR SPRING BALANCE WEIGHING DESIGNS UNDER THE CO VARIANCE MATRIX OF ERRORS s2G

The problem of the estimation of the linear combination of weights, c′w, in a singular spring balance weighing design when the error structure takes the form E(ee′) =s?²G has been studied. A lower bound for the variance of the estimated linear combination of weights is obtained and a necessary and sufficient condition for this lower bound to be attained is given. The general results are applied to the case of the total of the weights. For a specified form for G, some optimum spring balance weighing designs for the estimated total weight are found.     

Designs for symmetrical parallel line assays obtainable through group divisible designs

A wide class of block designs for symmetrical parallel line assays with even number of doses, obtainable through group divisible designs is considered. Several new designs can thus be obtained using group divisibledesigns. Group divisible designs are also shown to provide a unification of many exisiting designs which follow as special cases.     

Singular weighing designs and estimation of total weight

The problem of estimation of total weight of objects using a singular spring balance weighing design has been studied in this paper. A lower bound of the estimated total weight is obtained and some classes of designs attaining the lower bound are studied.     

Non-isomorphic solutions of group divisible designs with k = 3 and λ1 = 0

Some regular and semi-regular group divisible designs with block size three are constructed through triple systems to provide new non-isomorphic solutions, most of which are α-resolvable for α ϵ {2, 3, 4}.     

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.     

ON THE ESTIMATION OF TOTAL WEIGHT IN CHEMICAL BALANCE WEXGHING DESIGNS1

This paper is concerned with the problem of estimation of total weight in a chemical balance weighing design. Some results regarding the estimability of the total weight are obtained and a lower bound for the variance of the estimated total weight is given. Finally, a series of weighing designs estimating the total weight in an ‘optimum’ manner is reported.     

Some new group divisible designs

The paper lists fourteen new group divisible PBIB/2 designs, which were obtained using the computer program described in John (1976).     

The Use of Treatment Concurrences to Assess Robustness of Binary Block Designs Against the Loss of Whole Blocks

Criteria are proposed for assessing the robustness of a binary block design against the loss of whole blocks, based on summing entries of selected upper non‐principal sections of the concurrence matrix. These criteria improve on the minimal concurrence concept that has been used previously and provide new conditions for measuring the robustness status of a design. The robustness properties of two‐associate partially balanced designs are considered and it is shown that two categories of group divisible designs are maximally robust. These results expand a classic result in the literature, obtained by Ghosh, which established maximal robustness for the class of balanced block designs.     

Robustness group divisible designs

Robustness of group divisible (GD) designs is investigated, when one block is lost, in terms of efficiency of the residual design. The exact evaluation of the efficiency can be made for singular GD and semi-regular GD designs as ell as regular GD designs with λ₁ = 0. In a regular GD design with λ₁ > 0, the efficiency may depend upon the lost block and sharp upper and lower bounds on the efficiency are presented. The investigation shows that GD designs are fairly robust in terms of efficiency. As a special case, we can also show the robustness of balanced incomplete block design when one block is lost.     

αn–Designs

This paper defines a broad class of resolvable incomplete block designs called α_n–designs, of which the original α–designs are a special case with n = 1. The statistical and mathematical properties of α–designs extend naturally to these n –dimensional designs. They are a flexible class of resolvable designs appropriate for use in factorial experiments, in constructing efficient t –latinized resolvable block designs, and for enhancing the existing class of α–designs for a single treatment factor.     

A-optimal diallel crosses for test versus control comparisons

A-optimality of block designs for control versus test comparisons in diallel crosses is investigated. A sufficient condition for designs to be A-optimal is derived. Type S₀ designs are defined and A-optimal type S₀ designs are characterized. A lower bound to the A-efficiency of type S₀ designs is also given. Using the lower bound to A-efficiency, type S₀ designs are shown to yield efficient designs for test versus control comparisons.     

Robustness of Optimal Chemical Balance Weighing Designs for Estimation of Total Weight

The subject of our study is the chemical balance weighing design in which the errors are correlated and have equal variances. A lower bound for the variance of estimated total weight is obtained and the necessary and sufficient conditions for the attainability of this lower bound are given. Some designs for which the lower bound is attainable are considered.     

ON THE CONVERGENCE OF EMPIRICAL PROCESSES OF MIXING VARIABLES1

Conditions are given for the weak convergence of (t—t²)L_N(a_N^-1( t )) to a Gaussian process where v<1/2, a _N is a cdf and L _N is the normalized weighted empirical cumulative distribution function (cdf) for an α-mixing sample of random variables in R which may be non-stationary with discontinuous marginals.     

MINIMAX ESTIMATION OF A MULTIVARIATE NORMAL MEAN UNDER A CONVEX LOSS FUNCTION

Let X = (X₁, - X_p)prime; ˜ N_p (μ, Σ) where μ= (μ₁, -, μ_p)' and Σ= diag (Σ²₁, -, Σ²_p) are both unknown and p3. Let (n_i - 2) w_i/Σ²_i! X²_ni, independent. of w_i (I ≠ j = 1, -, p). Assume that (w₁, -, w_p) and X are independent. Define W = diag (w₁, -, w_p) and ¶ X ¶²_w= X'W^-1Q^-1W^-1X where Q = diag (q₁, -,n q_p), q_i > 0, i = 1, -, p. In this paper, the minimax estimator of Berger & Bock (1976), given by δ (X, W) = [I_p - r(X, W) ¶ X ¶^-2_w Q^-1W^-1] X, is shown to be minimax relative to the convex loss (δ - μ)'[αQ + (1 - α) Σ^-1] δ - μ)/C, where C =α tr (Σ) + (1 - α)p and 0 α 1, under certain conditions on r(X, W). This generalizes the above mentioned result of Berger & Bock.     

A NEW UPPER BOUND FOR THE EFFICIENCY FACTOR OF A BLOCK DESIGN

An upper bound for the efficiency factor of a block design, which in many cases is tighter than those reported by other authors, is derived. The bound is based on a lower bound for E(1/X) in terms of E(X) and var(X) for a random variable X on the unit interval. For the special case of resolvable designs, an improved bound is given which also competes with known bounds for resolvable designs in some cases.     

Optimum chemical balance weighing designs for estimating the total weight

This deals with chemical balance weighing designs which attain a lower bound for the variance of the estimated total weight, The results extend those of Chacko Dey (1978).     

A TWO STAGE PROCEDURE FOR ESTIMATING THE SIZE OF A TRUNCATED EXPONENTIAL SAMPLE

Let X₁, …, X_N be i.i.d. exponential random variables with unknown scale parameter θ. If one can observe only those X_i in (0, T₀), an estimate of N based on the J observations obtained has a variance which explodes as θ→θC. Using θC based on the observations in (0, T₀) T is computed and all X_i in (0, ) are observed. An estimate of N based on all observations in (0, ) has a bounded variance where the bound can be adjusted by proper choice of .     

Use of balanced bipartite weighing designs as chemical balance designs

This paper deals with the use of balanced bipartite weighing designs as chemical balance designs when there Is a restriction on the number of objects that can be placed on either pan..The variance of each estimated weight and the covarlance of each pair of estimated weights are worked out.The use of additional weighing when the design matrix is singular is discussed.     

ON THE SEQUENTIAL ESTIMATION OF THE PROBABILITY OF SUCCESS

Let x₁ x₂, x₃,be a sequence of independent Bernoulli trials with common success probability p . We consider the problem of estimation of p using a sequential Bayes theoretic approach when the cost per observation is c , and the loss of estimation is squared error loss. A heuristic procedure is suggested, a bound on its Bayes risk is computed, and asymptotic results are exhibited.