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).     

LIMIT THEOREMS FOR STANDARDIZED PARTIAL SUMS OF WEAKLY EXCHANGEABLE ARRAYS

A symmetric array of random variables is weakly exchangeable if, when the same arbitrary permutation is applied to rows and columns, the joint distribution remains the same. We consider the asymptotic distribution of the standardized sums of the elements of the upper left hand corner of the partitioned array, generalizing results on U-statistics. In general, the asymptotic distribution is normal, but if the array is first standardized by subtracting row and column means, then it is a linear form in a normal variable and independent squares of normal variables with coefficients depending on the limits of the eigenvalues of the array.     

Tabu search for covering arrays using permutation vectors

A covering array  CA(N;t,k,v)$\mathsf{CA}(N;t,k,v)$ is an N×k$N\times k$ array, in which in every N×t$N\times t$ subarray, each of the v^t$v^t$ possible t  -tuples over v$v$ symbols occurs at least once. The parameter t is the strength   of the array. Covering arrays have a wide range of applications for experimental screening designs, particularly for software interaction testing. A compact representation of certain covering arrays employs “permutation vectors” to encode v^t×1$v^t\times 1$ subarrays of the covering array so that a covering perfect hash family whose entries correspond to permutation vectors yields a covering array. We introduce a method for effective search for covering arrays of this type using tabu search. Using this technique, improved covering arrays of strength 3, 4 and 5 have been found, as well as the first arrays of strength 6 and 7 found by computational search.     

Projective (2n,n,λ,1)-designs

A projective (2n,n,λ,1)-design is a set $\text{D}$ of n element subsets (called blocks) of a 2n-element set V having the properties that each element of V is a member of λ blocks and every two blocks have a non-empty intersection. This paper establishes existence and non-existence results for various projective (2n,n,λ,1)-designs and their subdesigns.     

Characterization by invariance under length-biasing and random scaling

A positive random variable X with law L(X) and finite moment of order r > 0 has an induced length-biased law of order r, denoted by L(X_r). Let V ⩾ 0 be independent of X_r. A characterization problem seeks solution pairs (L(X), L(V)) for the “in-law” equation X ≅ VX_r, where ≅ denotes equality in law. A renewal process interpretation asks when is the random rescaling of the stationary total lifetime VX₁ equal in law to a typical lifetime X? Solutions are known in special cases.A comprehensive existence/uniqueness theory is presented, and many consequences are explored. Unique solutions occur when − log X and − log V have spectrally positive infinitely divisible laws. Particular cases are explored.Connections with the stationary lifetime law of renewal theory also are investigated.     

A construction of group divisible designs

Given any affine design with parameters v, b, r, k, λ and μ = k²/v and any design with parameters v′, b′, r′, k′, λ′ where r′ = tr for some natural number `t and k′?r, we construct a group divisible design with parameters v′' = vv′, m = v′, n = v, b′' = vb′, k′' = kk′, r′'= kr′, λ₁ = tkλ and λ₂ = μλ′. This is applied to some series of designs. As a lemma, we also show that any 0-1-matrix with row sums tr and column sums ?r may be written as the sum of r 0-1-matrices with row sums t and column sums ?1.     

Efficient estimates in linear and nonlinear regression with heteroscedastic errors

In this paper we consider the heteroscedastic regression model defined by the structural relation Y = r(V, β) + s(W)ε, where V is a p-dimensional random vector, W is a q-dimensional random vector, β is an unknown vector in some open subset B of R^m, r is a known function from R^p × B into R, s is an unknown function on R^q, and ε is an unobservable random variable that is independent of the pair (V, W). We construct asymptotically efficient estimates of the regression parameter β under mild assumptions on the functions r and s and on the distributions of ε and (V, W).     

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.     

Serial arrays and change-over designs

Consider change-over designs for the comparison of v treatments. Each application has a direct effect and up to n?1 residual and/or interaction effects. An array is defined to be a serial array if: (1) all treatments occur equally often in each row and (2) reading down columns, all possible permutations of n consecutive treatments occur equally often in the array. A method of constructing (λv+n?1) Xv^{n ?1}, λ integral, serial arrays is given. Use of these arrays as change-over designs is discussed with emphasis on the inclusion of interaction effects.     

Embedding of orthogonal arrays of strength two and deficiency greater than two

Let x ≥ 0 and n ≥ 2 be integers. Suppose there exists an orthogonal array $\text{A(n, q, μ}{}^1\text{)}$ of strength 2 in n symbols with q rows and $\text{n}{}^2\text{μ}{}^1$ columns where $\text{q = q}{}^1\text{? d, q}{}^1\text{= n}{}^2\text{x + n + 1}$, $\text{μ}{}^1\text{= (n ?}\text{1}\text{)x +}\text{1}$ and d is a positive integer. Then d is called the deficiency of the orthogonal array. The question of embedding such an array into a complete array $\text{A(n, q}{}^1\text{, μ}{}^1\text{)}$ is considered for the case d ≥ 3. It is shown that for d = 3 such an embedding is always possible if n ≥ 2(d ? 1)²(2d² ? 2d + 1). Partial results are indicated if d ≥ 4 for the embedding of a related design in a corresponding balanced incomplete block design.     

Some resolvable orthogonal arrays with two symbols

A method of constructing a resolvable orthogonal array (4λk2,2) which can be partitioned into λ orthogonal arrays (4,k 2,1) is proposed. The number of constraints kfor this type of orthogonal array is at most 3λ. When λ=2 or a multiple of 4, an orthogonal array with the maximum number of constraints of 3λ can be constructed. When λ=4n+2(n≧1) an orthogonal array with 2λ+2 constraints can be constructed. When λ is an odd number, orthogonal arrays can be constructed for λ=3,5,7, and 9 with k=4,8,12, and 13 respectively.     

MBMUDs: a combinatorial extension of BIBDs showing good optimality behaviour

The construction of a balanced incomplete block design (BIBD) is formulated in terms of combinatorial optimization by defining a cost function that reaches its lower bound on all and only those configurations corresponding to a BIBD. This cost function is a linear combination of distribution measures for each of the properties of a block design (number of plots, uniformity of rows, uniformity of columns, and balance). The approach generalizes naturally to a super-class BIBDs, which we call maximally balanced maximally uniform designs (MBMUDs), that allow two consecutive values for their design parameters [r,r+1;k,k+1;λ,λ+1]. In terms of combinatorial balance, MBMUDs are the closest possible approximation to BIBDs for all experimental settings where no set of admissible parameters exists. Thus, other design classes previously proposed with the same approximation aim—such as RDGs, SRDGs and NBIBDs of type I—can be viewed as particular cases of MBMUDs. Interestingly, experimental results show that the proposed combinatorial cost function has a monotonic relation with A- and D-statistical optimality in the space of designs with uniform rows and columns, while its computational cost is much lower.     

A survey of nested designs

A nest with parameters (r,k,λ)→(r′,k′,λ′) is a BIBD on (b,v,r,k,λ) where each block has a distinguished sublock of cardinality k, the sublocks forming a (b,v,r,k,λ)-design.These designs are ‘nested’ in the sense of W.T. Federer (1972), who recommended the use of these designs for the sequential addition of periods in marketing experiments in order to retain Youden design properties as rows are added. Note that for a Youden design, the b columns and v treatments are in an SBIBD arrangement with parameters v=b, k=r, and λ.     

Classification of difference matrices over cyclic groups

The existence of difference matrices over small cyclic groups is investigated in this computer-aided work. The maximum values of the parameters for which difference matrices exist as well as the number of inequivalent difference matrices in each case is determined up to the computational limit. Several new difference matrices have been found in this manner. The maximum number of rows is 9 for an r ×15 difference matrix over Z₃, 8 for an r ×15 difference matrix over Z₅, and 6 for an r ×12 difference matrix over Z₆; the number of inequivalent matrices with these parameters is 5, 2, and 7, respectively.     

Equineighboured balanced nested row-column designs

This paper presents equineighboured balanced nested row-column designs for v treatments arranged in b blocks each comprising pq units further grouped into p rows and q columns. These are two-dimensional designs with the property that all pairs of treatments are neighbours equally frequently at all levels in both rows and columns. Methods of construction are given both for designs based on Latin squares and those where pq≤v. Cyclic equineighboured designs are defined and tabulated for 5≤v≤10, p≤3, q≤5, where r=bpq/v is the number of replications of each treatment.     

On computer generation of balanced arrays

This paper provides an algebraic (and hence computing) procedure for generation of balanced arrays having two symbols, m rows, specified minimum and maximum column weights, arbitrary strength t≦m, and index set parameters μ^t₁, μ^t₂,…, μ^t_t. μ^t₀ is unspecified, and calculated as part of the algorithm, although the procedure for specifying it is straightforward and can be used if desired. Array generation is herein reduced to finding integral solutions to a linear programming problem. It is shown that the integral solutions of the system of equations comprise all balanced arrays with the given set of parameters.A computing algorithm is provided which constructs the system of equations to be solved; it has been interfaced with a standard linear programming package to provide some preliminary results.Additional algorithms whose development should result in substantial decreases in computing costs are discussed.     

Efficient Semi-Latin Rectangles: Designs for Plant Disease Experiments

Experiments on disease in plants often use half-leaves as experimental units. The whole leaves are typically in the rectangular array formed by h leaf-heights (rows) and p plants (columns), where h < p . We specialize to the case where h = n and p = 2 n and there are 2 n treatments. If each treatment occurs once per column and twice per row, we call such a design a semi-Latin rectangle. Efficient semi-Latin rectangles of such sizes are constructed for 2 ≤ n ≤ 10. Guidance is given on their use.     

Arrays of strength s on two symbols

This paper gives necessary and sufficient conditions on σ, s, t and on μ, s, t for an array with s+t rows to have strength s and weight σ, or to be balanced and have strength s and weight μ. If a balanced array can exist, the conditions provide a construction. The solutions for t=1,2 are also given in an alternate form useful for the study of trim arrays. The balanced solution for t=1 is more detailed than that known so far, and permits one to determine whether or not a solution exists in possibly fewer steps.     

Distribution-free tests for cluster samples of ordinal responses

A simulation comparison is done of Mann–Whitney U test extensions recently proposed for simple cluster samples or for repeated ordinal responses. These are based on two approaches: the permutation approach of Fay and Gennings (four tests, two exact), and Edwardes’ approach (two asymptotic tests, one new). Edwardes’ approach permits confidence interval estimation, unlike the permutation approach. An appropriate parameter for estimation is P(X<Y)−P(X>Y), where X is the rank of a response from group 1 and Y is from group 2. The permutation tests are shown to be unsuitable for some survey data, since they are sensitive to a difference in cluster intra-correlations when there is no distribution difference between groups at the individual level. The exact permutation tests are of little use for less than seven clusters, precisely where they are most needed. Otherwise, the permutation tests perform well.     

The split sample permutation t-tests

Without the exchangeability assumption, permutation tests for comparing two population means do not provide exact control of the probability of making a Type I error. Another drawback of permutation tests is that it cannot be used to test hypothesis about one population. In this paper, we propose a new type of permutation tests for testing the difference between two population means: the split sample permutation t-tests. We show that the split sample permutation t-tests do not require the exchangeability assumption, are asymptotically exact and can be easily extended to testing hypothesis about one population. Extensive simulations were carried out to evaluate the performance of two specific split sample permutation t-tests: the split in the middle permutation t-test and the split in the end permutation t-test. The simulation results show that the split in the middle permutation t-test has comparable performance to the permutation test if the population distributions are symmetric and satisfy the exchangeability assumption. Otherwise, the split in the end permutation t-test has significantly more accurate control of level of significance than the split in the middle permutation t-test and other existing permutation tests.