Regular group divisible designs and Bhaskar Rao designs with block size three

Some recursive constructions are given for Bhaskar Rao designs. Using examples of these designs found by Shyam J. Singh, Rakesh Vyas and new ones given here we show the necessary conditions λ≡0 (mod 2), λυ(υ?1)≡0 (mod 24) are sufficient for the existence of Bhaskar Rao designs with one association class and block size 3. This result is used with a result of Street and Rodger to obtain regular partially balanced block designs with 2υ treatments, block size 3, λ₁=0, group size 2 and υ groups.     

Partially efficiency-balanced designs-II

efficiency balanced (£R) and partially efficiency balanced (PEB) designs were studied hy Calinski (1971) and Puri and Higam (1971, 1977a). In tais paper we have studied the dual desinas of two classes of PEB designs. It is shown that the dual of any symmetrical PCS design with HN'=N'H is again a PEB design. Also the dual of a PEB(S) with μ₁ = 0 μ₂ = 0and is shown to the again a PEB(S). The relations between PEB designs and linked and partially linked blocks have heen established. As a conseguence, the analysis of linked Mock and partially linkei block designs can he sinrlififid. Sore useful classes of supplencntcd block designs having simple analysis have also been discussed.     

Families of Hadamard group divisible designs

By a family of designs we mean a set of designs whose parameters can be represented as functions of an auxiliary variable t where the design will exist for infinitely many values of t. The best known family is probably the family of finite projective planes with υ = b = t² + t + 1, r = k = t + 1, and λ = 1. In some instances, notably coding theory, the existence of families is essential to provide the degree of precision required which can well vary from one coding problem to another. A natural vehicle for developing binary codes is the class of Hadamard matrices. Bush (1977) introduced the idea of constructing semi-regular designs using Hadamard matrices whereas the present study is concerned mostly with construction of regular designs using Hadamard matrices. While codes constructed from these designs are not optimal in the usual sense, it is possible that they may still have substantial value since, with different values of λ₁ and λ₂, there are different error correcting capabilities.     

Families of regular designs based on geometries

Recently Bush and Ostrom (1979) settled most of the open questions with respect to inequivalent solutions of a class of semiregular (SR) designs which can be constructed from nets. This paper is a study of the same nature for two families of regular (R) designs derived from finite projective planes. One family presents no problems, but the other which is a ‘double’ family with two parameters is much more difficult. In fact it is here solved only for designs based on planes of orders 3, 4, 5 and 8. Certain general methods exist which are indicated, but we were unable to resolve even the case 7 using this technique.Basically we show the existence of either inequivalent solutions or show there is but one solution settling a number of open cases. In particular for the case λ₁ = 2, λ₂ = 1 we give new solutions to a number of D(2) designs or group divisible designs with two associate classes which have no repeated blocks in contrast with the published solutions which have this undesirable property for a number of applications.     

Construction of group divisible designs and rectangular designs from resolvable and almost resolvable balanced incomplete block designs

In this paper, we present a general construction of group divisible designs and rectangular designs by utilising resolvable and “almost resolvable” balanced incomplete block designs. As special cases, we obtain the following E-optimal designs: (a) Group divisible (GD) designs with λ₂=λ₁+1 and (b) Rectangular designs with 2 rows and having λ₃=λ₂−1=λ₁+1. Many of the GD designs are optimal among binary designs with regard to all type 1 criteria.     

Optimal design results for 2n factorial paired comparison experiments

Four general classes of partially balanced designs for 2ⁿ factorials, corresponding to four different forms of a general null hypothesis H on factorial effects, are presented. For the typical design in each class, the simplified form of the non-centrality parameter λ² of the asymptotic chi-square distribution of the likelihood ratio statistic for testing the corresponding form of H₀ is derived under defined local alternatives. Optimal designs d₁ maximizing λ² in the i-th class and minimizing the trace, determinant and largest eigenvalue of a defined covariance matrix, i =1,…,4, are determined.     

Optimal blocking and foldover plans for nonregular two-level designs

This paper discusses the issue of choosing optimal designs when both blocking and foldover techniques are simultaneously employed to nonregular two-level fractional factorial designs. By using the indicator function, the treatment and block generalized wordlength patterns of the combined blocked design under a general foldover plan are defined. Some general properties of combined block designs are also obtained. Our results extend the findings of Ai et al. (2010) from regular designs to nonregular designs. Based on these theoretical results, a catalog of optimal blocking and foldover plans in terms of the generalized aberration criterion for nonregular initial design with 12, 16 and 20 runs is tabulated, respectively.     

Robustness of designed experiments against missing data

This paper investigates the robustness of designed experiments for estimating linear functions of a subset of parameters in a general linear model against the loss of any t( ≥1) observations. Necessary and sufficient conditions for robustness of a design under a homoscedastic model are derived. It is shown that a design robust under a homoscedastic model is also robust under a general heteroscedastic model with correlated observations. As a particular case, necessary and sufficient conditions are obtained for the robustness of block designs against the loss of data. Simple sufficient conditions are also provided for the binary block designs to be robust against the loss of data. Some classes of designs, robust up to three missing observations, are identified. A-efficiency of the residual design is evaluated for certain block designs for several patterns of two missing observations. The efficiency of the residual design has also been worked out when all the observations in any two blocks, not necessarily disjoint, are lost. The lower bound to A-efficiency has also been obtained for the loss of t observations. Finally, a general expression is obtained for the efficiency of the residual design when all the observations of m ( ≥1) disjoint blocks are lost.     

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.     

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.     

OPTIMAL DESIGNS FOR FITTING A PROPORTIONAL HAZARDS REGRESSION MODEL TO DATA SUBJECT TO CENSORING

Suppose the probability model for failure time data, subject to censoring, is specified by the hazard function λ(t)exp(β_T x), where x is a vector of covariates. Analytical difficulties involved in finding the optimal design are avoided by assuming that λ is completely specified and by using D-optimality based on the information matrix for β Optimal designs are found to depend on β, but some results of practical consequence are obtained. It is found that censoring does not affect the choice of design appreciably when β^T x ≥ 0 for all points of the feasible region, but may have an appreciable effect when β_ix_i 0, for all i and all points in the feasible experimental region. The nature of the effect is discussed in detail for the cases of one and two parameters. It is argued that in practical biomedical situations the optimal design is almost always the same as for uncensored data.     

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.     

A basic lemma and the analysis of block and Kronecker product designs

In this paper the analysis of the class of block designs whose C matrix can be expressed in terms of the Kronecker product of some elementary matrices is considered. The analysis utilizes a basic result concerning the spectral decomposition of the Kronecker product of symmetric matrices in terms of the spectral decomposition of the component matrices involved in the Kronecker product. The property (A) of Kurkjian and Zelen (1963) is generalised and the analysis of generalised property (A) designs is given. It is proved that a design is balanced factorially if and only if it is a generalised property (A) design. A method of analysis of Kronecker product block designs whose component designs are equi-replicate and proper is also suggested.     

Cyclic Polygonal Designs with Block Size 3 and Joint Distance α = 2

Polygonal designs are useful in survey sampling in terms of balanced sampling plans excluding contiguous units (BSECs) and balanced sampling plans excluding adjacent units (BSAs). In this article, the method of cyclic shifts has been used for the construction of cyclic polygonal designs (in terms of BSAs) with block size k = 3 and λ = 1, 2, 3, 4, 6, 12 for joint distance α = 2 and 51 new designs for treatments v ≤ 100 are given.     

ON INCOMPLETE BLOCK DESIGNS FOR SYMMETRIC PARALLEL LINE ASSAYS

Incomplete block designs for symmetric parallel line assays, which estimate L_p, L₁and L1/1 with full efficiency, are constructed in a unified manner. Necessary and sufficient conditions are given for existence. A complete solution is presented when the number of doses is even. A general systematic method of construction is given when the number of doses is odd, and all possible designs for up to 15 doses of each preparation are tabulated.     

Optimal regular graph designs

A typical problem in optimal design theory is finding an experimental design that is optimal with respect to some criteria in a class of designs. The most popular criteria include the A- and D-criteria. Regular graph designs occur in many optimality results, and if the number of blocks is large enough, an A-optimal (or D-optimal) design is among them (if any exist). To explore the landscape of designs with a large number of blocks, we introduce extensions of regular graph designs. These are constructed by adding the blocks of a balanced incomplete block design repeatedly to the original design. We present the results of an exact computer search for the best regular graph designs and the best extended regular graph designs with up to 20 treatments v, block size \(k \le 10\) and replication r \(\le 10\) and \(r(k-1)-(v-1)\lfloor r(k-1)/(v-1)\rfloor \le 9\).     

Generalized Youden designs: construction and tables

Generalized Youden Designs are generalizations of the class of two-way balanced block designs which include Latin squares and Youden squares. They are used for the same purposes and in the same way that these classical designs are used, and satisfy most of the common criteria of design optimality.We explicitly display or give detailed instructions for constructing all these designs within a practical range: when υ, the number of treatments, is ?25; and b₁ and b₂, the dimensions of the design array, are each ?50.     

Optimal designs for calibration of orientations

This paper concerns designed experiments involving observations of orientations following the models of Prentice (1989) and Rivest &Chang (2006). The authors state minimal conditions on the designs for consistent least squares estimation of the matrix parameters in these models. The conditions are expressed in terms of the axes and rotation angles of the design orientations. The authors show that designs satisfying U₁ + … + U_n = 0 are optimal in the sense of minimizing the estimation error average angular distance. The authors give constructions of optimal n‐point designs when n ≥ 4 and they compare the performance of several designs through approximations and simulation.     

Admissible two-stage designs for phase II cancer clinical trials that incorporate the expected sample size under the alternative hypothesis

two‐stage studies may be chosen optimally by minimising a single characteristic like the maximum sample size. However, given that an investigator will initially select a null treatment e?ect and the clinically relevant di?erence, it is better to choose a design that also considers the expected sample size for each of these values. The maximum sample size and the two expected sample sizes are here combined to produce an expected loss function to ?nd designs that are admissible. Given the prior odds of success and the importance of the total sample size, minimising the expected loss gives the optimal design for this situation. A novel triangular graph to represent the admissible designs helps guide the decision‐making process. The H ₀‐optimal, H ₁‐optimal, H ₀‐minimax and H ₁‐minimax designs are all particular cases of admissible designs. The commonly used H ₀‐optimal design is rarely good when allowing stopping for e?cacy. Additionally, the δ‐minimax design, which minimises the maximum expected sample size, is sometimes admissible under the loss function. However, the results can be varied and each situation will require the evaluation of all the admissible designs. Software to do this is provided. Copyright © 2012 John Wiley & Sons, Ltd.     

Testing equality of conditionally jfclhwdqw exponential distributions

For the models given V = v (a common random stress), X and Y are independently exponentially distributed with failure rates λ₁and λ₂v, testing H₀λ₁λ₂using a random ‘paired’ sample is considered. It is shown that a uniformly most powerful invariant test does not exist even for one sided alternatives; locally most powerful invariant tests are derived and compared with existing procedures. The method is illustrated with reliability data. Finally, the robustness of the tests when the relationships of the failure rates to V is more complex are established.