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.     

A series of group divisible designs

Bose and Shrikhande C19763 proved that if D(m, k, ?) is a Baer subdesign of another SBIBD D₁ (v₁, k₁ ?), k₁>k, then it also contains a complementary subdesign D^* which is symmetric GDD, D^* (v^*, k^*; ?-1, ?; m, n). Utilising this, we give a necessary condition for a SBIBD D to be a Baer subdesign of D₁ and also give the parameters. Some GD designs are constructed.     

Three methods of constructing pbib designs

Three construction methods of two- or three-associate partially balanced incomplete block (PBIB) designs are presented.     

Super-simple group divisible designs with block size 4 and index 9

A design is said to be super-simple if the intersection of any two blocks has at most two elements. In statistical planning of experiments, super-simple designs are the ones providing samples with maximum intersection as small as possible. Super-simple GDDs are useful in constructing super-simple BIBDs. The existence of super-simple (4,λ)‐GDDs has been determined for λ=2-6. In this paper, we investigate the existence of a super-simple (4,9)-GDD of group type g^u and show that such a design exists if and only if u≥4, g(u−2)≥18 and u(u−1)g²≡0 (mod 4).     

Some families of group divisible designs

Generalizing methods of constructions of Hadamard group divisible designs due to Bush (1979), some new families of semi-regular or regular group divisible designs are produced. Furthermore, new nonisomorphic solutions for some known group divisible designs are given, together with useful group divisible designs not listed in Clatworthy (1973).     

New combinatorial designs and their applications to group testing

A class of designs with property C(t) are introduced for the first time, and their applications in group testing of samples are studied.     

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.     

The analysis of mixed and random effects models for equireplicate variance-balanced block designs

Equirephcate variance-balanced block designs possess many desirable properties and include several important subclasses of designs, such as balanced incomplete block designs. However, while attention has been paid to the derivation of properties and the construction of these designs, methods of analyzing experiments using these designs have not been developed completely. Thus, we consider models appropriate to these designs, construct test statistics for basic hypotheses and derive the distributions for these statistics. Four additive models that include all of the possible combinations of fixed and random effects are examined. The analyses are generalizations of the analyses for balanced incomplete block designs, and include the intra-block, intra-treatment and inter-block analyses, Estimators of fixed treatment effects and their distributions also are given.     

Catalogue of small runs nonregular designs from hadamard matrices with generalized minimum aberration

Fries and Hunter ( 1980 ) proposed the Minimum Aberration criterion (MA) for selecting regular designs. The regular designs with MA are msot commonly used because they are considered as the best designs. How ever, as pointed out by Chen, Sun and Wu ( 1993 ), there are situations that other designs may better meet the design need. Therefore, they catalogued some two-level and three-level fractional factorial regular designs with small (16,27,32,64) runs. For nonregular designs, such as the ones taken from Hadamard matrices, the MA criterion is not appUcable. Deng and Tang ( 1999 ) introduced Generalized Minimum Aberration Criterion (GMA) as a natural extension to the MA criterion. Similar to the case in the regular designs, other designs may better meet practical need, In this paper, we use the GMA criterion to give a catalogue of nonregular designs with smaU (16,20,24) runs.     

Balanced Treatment incomplete block (BTIB) designs for comparing treatments with a control: minimal complete sets of generator designs for k = 3, p = 3(1)10

Bechhofer and Tamhane (1981) proposed a new class of incomplete block designs called BTIB designs for comparing p ≥ 2 test treatments with a control treatment in blocks of equal size k < p + 1. All BTIB designs for given (p,k) can be constructed by forming unions of replications of a set of elementary BTIB designs called generator designs for that (p,k). In general, there are many generator designs for given (p,k) but only a small subset (called the minimal complete set) of these suffices to obtain all admissible BTIB designs (except possibly any equivalent ones). Determination of the minimal complete set of generator designs for given (p,k) was stated as an open problem in Bechhofer and Tamhane (1981). In this paper we solve this problem for k = 3. More specifically, we give the minimal complete sets of generator designs for k = 3, p = 3(1)10; the relevant proofs are given only for the cases p = 3(1)6. Some additional combinatorial results concerning BTIB designs are also given.     

A new model and class of designs for mixture experiments with process variables

Experiments that involve the blending of several components are known as mixture experiments. In some mixture experiments, the response depends not only on the proportion of the mixture components, but also on the processing conditions, A new combined model is proposed which is based on Taylor series approximation and is intended to be a compromise between standard mixture models and standard response surface models. Cost and/or time constraints often limit the size of industrial experiments. With this in mind, we present a new class of designs that will accommodate the fitting of the new combined model.     

Construction of some mixed two- and four-level regular designs with GMC criterion

General minimum lower-order confounding (GMC) criterion is to choose optimal designs, which are based on the aliased effect-number pattern (AENP). The AENP and GMC criterion have been developed to form GMC theory. Zhang et al. (2015 Zhang, T.F., Yang, J.F., Li, Z.M., Zhang, R.C. (2015). Construction of regular 2ⁿ4¹ designs with general minimum lower-order confounding. Commun. Stat. - Theory Methods 46:2724–2735.[Taylor &; Francis Online], [Web of Science ®] , [Google Scholar]) introduced GMC 2ⁿ4^m criterion for choosing optimal designs and constructed all GMC 2ⁿ4¹ designs with N/4 + 1 ? n + 2 ? 5N/16. In this article, we analyze the properties of 2ⁿ4¹ designs and construct GMC 2ⁿ4¹ designs with 5N/16 + 1 ? n + 2 < N ? 1, where n and N are, respectively, the numbers of two-level factors and runs. Further, GMC 2ⁿ4¹ designs with 16-run, 32-run are tabulated.     

Balanced arrays of strength 4 and balanced fractional 3m factorial designs

A connection between a balanced fractional 2^m factorial design of resolution 2l + 1 and a balanced array of strength 2l with index set {μ₀, μ₁,…, μ_2l} was established by Yamamoto, Shirakura and Kuwada (1975). The main purpose of this paper is to give a connection between a balanced fractional 3^m factorial design of resolution V and a balanced array of strength 4, size N, m constraints, 3 levels and index set {λ_l0l1l2}.     

Economic and economic-statistical designs of the T2 control charts with SVSSI sampling scheme

Recent studies have shown that the adaptive T² chart with two different sampling interval and three sample sizes (SVSSI) shows a good performance in detecting small to large shifts in the process mean. This paper investigates the economic and economic statistical designs of the SVSSI T² charts. We use the Markov chain approach to developing the cost model proposed by Costa and Rahim (Journal of applied statistics 2001; 28: 875–885). A genetic algorithm approach is used to find the optimal solutions. Using numerical examples, we illustrate the performance of the proposed model and compare the statistical, economic, and economic statistical designs of the SVSSI T² chart with respect to the economic and statistical criteria. Furthermore, we compare the performance of the SVSSI T² chart with the other T² control schemes.     

A characterization of some {3v2 + v3, 3v1 + v2; 3, 3}-minihypers and some [15, 4, 9; 3]-codes with B2 = 0

It is known (cf. Hill and Newton (Ars Combin., 25A (1988), 61–72; Designs Codes Cryptography, 2 (1992), 137–157) and Remark A.2 in the Appendix) that (1) there is no [14, 4, 9; 3]-code meeting the Griesmer bound and (2) if C is a [15, 4, 9; 3]-code then B₂ = 0 or 2 and (3) there is a one-to-one correspondence between the set of all nonequivalent [15, 4, 9; 3]-codes with B₂ = 0 and the set of all {3v₂ + v₃, 3v₁ + v₂: 3, 3}-minihypers, where v₁ = 1, v₂ = 4, v₃ = 13 and B₂ denotes the number of codewords of weight 2 in its dual code. Recently it has been shown by Eupen and Hill (Designs Codes Cryptography, 4 (1994) 271–282) that a [15, 4, 9; 3]-code with B₂ = 2 is unique up to equivalence. The purpose of this paper is to characterize all [15, 4, 9; 3]-codes with B₂ = 0 using the geometrical structure of the corresponding {3v₂ + v₃, 3v₁ + v₂; 3, 3}-minihypers. Those results give a complete characterization of [15, 4, 9; 3]-codes.