Optimal superimposed codes and designs for Renyi''s search model

Renyi (Bull. Amer. Math. Soc. 71 (6) (1965) 809) suggested a combinatorial group testing model, in which the size of a testing group was restricted. In this model, Renyi considered the search of one defective element (significant factor) from the finite set of elements (factors). The corresponding optimal search designs were obtained by Katona (J. Combin. Theory 1 (2) (1966) 174). In the present work, we study Renyi's search model of several significant factors. This problem is closely related to the concept of binary superimposed codes, which were introduced by Kautz and Singleton (IEEE Trans. Inform Theory 10 (4) (1964) 363) and were investigated by D'yachkov and Rykov (Problems Control Inform. Theory 12 (4) (1983) 229), Erdos et al. (Israel J. Math. 51 (1–2) (1985) 75), Ruszinko (J. Combin. Theory Ser. A 66 (1994) 302) and Furedi (J. Combin. Theory Ser. A 73 (1996) 172). Our goal is to prove a lower bound on the search length and to construct the optimal superimposed codes and search designs. The preliminary results have been published by D'yachkov and Rykov (Conference on Computer Science & Engineering Technology, Yerevan, Armenia, September 1997, p. 242).     

Cyclic designs for a covariate model

A linear model with one treatment at V levels and first order regression on K continuous covariates with values on a K-cube is considered. We restrict our attention to classes of designs d for which the number of observations N to be taken is a multiple of V, i.e. N = V × R with R ≥2, and each treatment level is observed R times. Among these designs, called here equireplicated, there is a subclass characterized by the following: the allocation matrix of each treatment level (for short, allocation matrix) is obtained through cyclic permutation of the columns of the allocation matrix of the first treatment level. We call these designs cyclic. Besides having easy representation, the most efficient cyclic designs are often D-optimal in the class of equireplicated designs. A known upper bound for the determinant of the information matrix M(d) of a design, in the class of equireplicated ones, depends on the congruences of N and V modulo 4. For some combinations of parameter moduli, we give here methods of constructing families of D-optimal cyclic designs. Moreover, for some sets of parameters (N, V,K = V), where the upper bound on ∣M(d)∣ (for that specific combination of moduli) is not attainable, it is also possible to construct highly D-efficient cyclic designs. Finally, for N≤24 and V≤6, computer search was used to determine the most efficient design in the class of cyclic ones. They are presented, together with their respective efficiency in the class of equireplicated designs.     

Robust integer-valued designs for linear random intercept models

This article considers the robust design problem for linear random intercept models with both departures from fixed effects and correlated errors on a finite design space. Two strategies are proposed. One is a worst-case method minimizing the maximum value of the MSE of estimates for the fixed effects over the departure. The other is an average-case method minimizing the average value of the MSE with respect to some priors for the class of departure functions and correlation structures of random errors. Two examples are given to show robust designs for two polynomial models.     

One-eighth- and one-sixteenth-fraction quaternary code designs with high resolution

The development of a general methodology for the construction of good two-level nonregular designs has received significant attention over the last 10 years. Recent works by Phoa and Xu (2009) and Zhang et al. (2011) indicate that quaternary code (QC) designs are very promising in this regard. This paper explores a systematic construction for 1/8th and 1/16th fraction QC designs with high resolution for any number of factors. The 1/8th fraction QC designs often have larger resolution than regular designs of the same size. A majority of the 1/16th fraction QC designs also have larger resolution than comparable two-level regular designs.     

Tables of Cyclic Incomplete Block Designs: r=k

Initial blocks and efficiencies are given for cyclic incomplete block designs in the range t= 10(1)60 and r=k= 3(1)10. The designs have been selected by search procedures using optimality criteria which maximize the efficiency factor.     

The robustness of chain block designs and coat-of-mail designs

Chain block designs are relatively vulnerable to loss of information when missing values or outliers may occur. An alternative class of designs, coat-of-mail designs, are proposed and the relative robustness of the two types of design are compared.     

Connectedness of PBIB designs

A necessary and sufficient condition for the connectedness of an m-associate-class PBIB design is derived in a form, and using an approach, different from those in Ogawa, Ikeda, and Kageyama (1984) and Saha and Kageyama (1984). The applicability of this condition is shown in the context of group-divisible m-associate-class PBIB designs.     

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 equivalence of certain constant weight codes and combinatorial designs

Stinson and van Rees (Combinatorica (1984), 357–362) proved that the existence of an equidistant code E: (n = 4s + 1,d = 2s, N) with N = n implies the existence of a certain symmetrical BIB design. This result is extended here for the constant weight codes with the same n and d. A theorem on the equivalence of a Hadamard matrix and a certain constant weight code is also proved.     

Hypercubic designs and applications

In this paper we develop relatively easy methods for constructing hypercubic designs from symmetrical factorial experiments for t=v ^m treatments with v=2, 3. The proposed methods are easy to use and are flexible in terms of choice of possible block sizes.     

Model-robust supersaturated and partially supersaturated designs

Supersaturated designs are an increasingly popular tool for screening factors in the presence of effect sparsity. The advantage of this class of designs over resolution III factorial designs or Plackett–Burman designs is that n, the number of runs, can be substantially smaller than the number of factors, m. A limitation associated with most supersaturated designs produced thus far is that the capability of these designs for estimating g active effects has not been discussed. In addition to exploring this capability, we develop a new class of model-robust supersaturated designs that, for a given n and m, maximizes the number g   of active effects that can be estimated simultaneously. The capabilities of model-robust supersaturated designs for model discrimination are assessed using a model-discrimination criterion, the subspace angle. Finally, we introduce the class of partially supersaturated designs, intended for use when we require a specific subset of _m1$m_1$ core factors to be estimable, and the sparsity of effects principle applies to the remaining (m-_m1$m-m_1$) factors.     

Minimal augmented square designs and their extensions

Minimal square designs are proposed and compared. All treatment contrasts in both designs are estimable under the existence of two-way heterogeneity. That is, all designs are treatment-connected. Extended treatment-connected designs are generated by adding one column to minimal treatment-connected square designs. The extended designs not only have lower variances in paired comparisons of unreplicated treatments but also provide necessary degrees of freedom to estimate the process error. (M,S)-optimal extended designs are constructed systematically. Both square designs and their extensions have large numbers of unreplicated treatments.     

On pairs of Youden designs

It is well known that generalized Youden designs, or GYD's, enjoy a variety of optimality properties. Not being maximum trace designs, b copies of a non-regular GYD will not be optimum for b sufficiently large, opening the question of whether such a set will be so for any b. This paper explores the E-behavior of b = 2 non-regular GYDs. A general E-efficiency bound is derived and the E-optimality of a particular series is proven. That pairs of non-regular GYDs are not always E-optimal is shown by a counterexample.     

Constructions of efficiency-balanced designs

We present a number of methods of constructing efficiency-balanced binary block designs which are design patterns for simplification of statistical analysis. Furthermore, a method of construction of an efficiency-balanced block design with v+1 treatments from one with v treatments is generally characterized.     

Characterizing projected designs: repeat and mirror-image runs

Two-level designs are useful to examine a large number of factors in an efficient manner. It is typically anticipated that only a few factors will be identified as important ones. The results can then be reanalyzed using a projection of the original design, projected into the space of the factors that matter. An interesting question is how many intrinsically different type of projections are possible from an initial given design. We examine this question here for the Plackett and Burman screening series with N= 12, 20 and 24 runs and projected dimensions k≤5. As a characterization criterion, we look at the number of repeat and mirror-image runs in the projections. The idea can be applied toany two-level design projected into fewer dimensions.     

Complete designs with blocks of maximal multiplicity

The set of distinct blocks of a block design is known as its support. We construct complete designs with parameters v(?7), k=3, λ=v ? 2 which contain a block of maximal multiplicity and with support size $\text{b}{}^1\text{= (}{}^{\mathrm{v}}{}_3\text{) ? 4(v ? 2)}$. Any complete design which contains such a block, and has parameters v, k, λ as above, must be supported on at most (^v₃) ? 4(v ? 2) blocks. Attention is given to complete designs because of their direct relationship to simple random sampling.