Symmetric designs of types V and VI

In Butler (1984a) a semi-translation block was defined and a classification given of all symmetric 2-(υ,k,λ) designs with λ>1, which contain more than one such block. In this paper we consider symmetric designs of type V and VI. We show that symmetric designs of type V are also of type VI, and in addition we show that all such designs can be obtained from a P_n,q by a construction which we give. Finally examples of proper symmetric designs of type V which are not of type VI are given.     

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.     

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.     

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.     

E-optimal incomplete block designs with two distinct block sizes

Sufficient conditions are derived for the determination of E-optimal designs in the class D(v,b₁,b₂,k₁,k₂) of incomplete block designs for v treatments in b₁ blocks of size k₁ each and b₂ blocks of size k₂ each. Some constructions for E-optimal designs that satisfy the sufficient conditions obtained here are given. In particular, it is shown that E-optimal designs in D(v,b₁,b₂,k₁,k₂) can be constructed by augmenting b₂ blocks, with k₂ − k₁ extra plots each, of a BIBD(v,b = b₁ + b₂,k₁,λ) and GDD(v,b = b₁ + b₂,k₁,λ₁,λ₂). It is also shown that equireplicate E-optimal designs in D(v,b₁,b₂,k₁,k₂) can be constructed by combining disjoint blocks of BIBD(v,b,k₁,λ) and GDD(v,b,k₁,λ₁,λ₂) into larger blocks. As applications of the construction techniques, several infinite series of E-optimal designs with small block sizes differing by at most two are given. Lower bounds for the A-efficiency are derived and it is found that A-efficiency exceeds 99% for v ⩾ 10, and at least 97.5% for 5 ⩽v < 10.     

Generalized Bhaskar Rao designs of block size three

We show that the necessary conditions

$\text{λ≡0 (}\text{mod}\text{|G|)}$

,

$\text{λ(υ?1)≡0 (}\text{mod}\text{2)}$

,

$\text{λυ(υ?1)≡}\text{0 (}\text{mod}\text{6)}\text{for}\text{|G|}\text{odd}\text{,}\text{0 (}\text{mod}\text{24)}\text{for}\text{|G|}\text{even}$

, are sufficient for the existence of a generalized Bhaskar Rao design GBRD(υ,b,r,3,λ;G) for the elementary abelian group G, of each order |G|.     

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.     

Comparison of rotatable designs for regression on balls,I (quadratic)

Designs for quadratic and cubic regression are considered when the possible choices of the controlable variable are points x=( x₁,x₂,…,x_q) in the q-dimensional. Full of radius R, B_q(R) ={x:Σ⁴_ix²_i?R²}. The designs that are optimum among rotatable designs with respect to the D-, A-, and E-optimality criteria are compared in their performance relative to these and other criteria, including extrapolation. Additionally, the performance of a design optimum for one value of R, when it is implemented for a different value of R, is investigated. Some of the results are developed algebraically; others, numerically. For example, in quadratic regression the A-optimum design appears to be fairly robust in its efficiency, under variation of criterion.     

D-Optimal Axial Designs for Quadratic and Cubic Additive Mixture Models

The paper discusses D-optimal axial designs for the additive quadratic and cubic mixture models σ_1≤i≤q(β_ix_i + β_iix²_i) and σ_1≤i≤q(β_ix_i + β_iix²_i + β_iiix³_i), where x_i≥ 0, x₁ + . . . + x_q = 1. For the quadratic model, a saturated symmetric axial design is used, in which support points are of the form (x₁, . . . , x_q) = [1 ? (q?1)δ_i, δ_i, . . . , δ_i], where i = 1, 2 and 0 ≤δ₂ <_{δ1 ≤} 1/(q ?1). It is proved that when 3 ≤q≤ 6, the above design is D-optimal if δ₂ = 0 and δ₁ = 1/(q?1), and when q≥ 7 it is D-optimal if δ₂ = 0 and δ₁ = [5q?1 ? (9q²?10q + 1)^1/2]/(4q²). Similar results exist for the cubic model, with support points of the form (x₁, . . . , x_q) = [1 ? (q?1)δ_i, δ_i, . . . , δ_i], where i = 1, 2, 3 and 0 = δ₃ <_δ2 < δ_{1 ≤}1/(q?1). The saturated D-optimal axial design and D-optimal design for the quadratic model are compared in terms of their efficiency and uniformity.     

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.     

On the norm of alias matrices in balanced fractional 2m factorial designs of resolution 2l + 1

The norm $\text{6A6 = {tr(A′A)}}{}^{\mathrm{<mtext>1</mtext><mtext>2</mtext>}}$ of the alias matrix A of a design can be used as a measure for selecting a design. In this paper, an explicit expression for 6A6 will be given for a balanced fractional 2^m factorial design of resolution 2l + 1 which obtained from a simple array with parameters (m; λ₀, λ₁,…, λ_m). This array is identical with a balanced array of strength m, m constraints and index set {λ₀, λ₁,…, λ_m}. In the class of the designs of resolution V (l = 2) obtained from S-arrays, ones which minimize 6A6 will be presented for any fixed N assemblies satisfying (i) m = 4, 11 ? N ? 16, (ii) m = 5, 16 ? N ? 32, and (iii) m = 6, 22 ? N ? 40.     

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

Density estimation for samples satisfying a certain absolute regularity condition

Let {ξ_i} be an absolutely regular sequence of identically distributed random variables having common density function f(x). Let H_k(x,y) (k=1, 2,…) be a sequence of Borel-measurable functions and f_n(x)=n^?1(H_n(x,ξ₁)+…+H_n(x,ξ_n)) the empirical density function. In this paper, the asymptotic property of the probability P(sup_x|f_n(x)?f(x)|>ε) (n→∞) is studied.     

On moments of the supremum of normed weighted averages

Let {X, X_n; n ≥ 1} be a sequence of real-valued iid random variables, 0 < r < 2 and p > 0. Let D = { A = (a_nk; 1 ≤ k ≤ n, n ≥ 1); a_nk, ? R and sup_{n, k} |a_n,k| < ∞}. Set S_n( A ) = ∑ⁿ_k=1a_{n, k}X_k for A ? D and n ≥ 1. This paper is devoted to determining conditions whereby E{sup_{n ≥ 1}, |S_n( A )|/n^1/r}^p < ∞ or E{sup_{n ≥ 2} |S_n( A )|/2n log n)^1/2}^p < ∞ for every A ? D. This generalizes some earlier results, including those of Burkholder (1962), Choi and Sung (1987), Davis (1971), Gut (1979), Klass (1974), Siegmund (1969) and Teicher (1971).     

Fitting a multiple regression function

Consider the p-dimensional unit cube [0,1]^p, p≥1. Partition [0, 1]^p into n regions, R_1,n,…,R_n,n such that the volume Δ(R_j,n) is of order n^?1,j=1,…,n. Select and fix a point in each of these regions so that we have x⁽ⁿ⁾₁,…,x⁽ⁿ⁾_n. Suppose that associated with the j-th predictor vector x⁽ⁿ⁾_j there is an observable variable Y⁽ⁿ⁾_j, j=1,…,n, satisfying the multiple regression model $\text{Y}{}^{\mathrm{(n)}}{}_{\mathrm{j}}\text{=g(}\text{x}{}^{\mathrm{(n)}}{}_{\mathrm{j}}\text{)+e}{}^{\mathrm{(n)}}{}_{\mathrm{j}}$, where g is an unknown function defined on [0, 1]^pand {e⁽ⁿ⁾_j} are independent identically distributed random variables with Ee⁽ⁿ⁾₁=0 and Var e⁽ⁿ⁾₁=σ²<∞. This paper proposes as an estimator of g(x), where k(u) is a known p-dimensional bounded density and {a_n} is a sequence of reals converging to 0 asn→∞. Weak and strong consistency of g_n(x) and rates of convergence are obtained. Asymptoticnormality of the estimator is established. Also proposed is $\text{σ}{}^2{}_{\mathrm{n}}\text{=n}{}^{\mathrm{?1}}\text{Σ}{}^{\mathrm{n}}{}_{\mathrm{j=1}}\text{(Y}{}^{\mathrm{(n)}}{}_{\mathrm{j}}\text{?g}{}_{\mathrm{n}}\text{(}\text{x}{}^{\mathrm{(n)}}{}_{\mathrm{j}}\text{))}{}^2$ as a consistent estimate of σ².     

Generalized Bhaskar Rao designs

Generalized Bhaskar Rao designs with non-zero elements from an abelian group G are constructed. In particular this paper shows that the necessary conditions are sufficient for the existence of generalized Bhaskar Rao designs with k=3 for the following groups: ?G? is odd, G=Z^r₂, and G=Z^r₂×H where 3? ?H? and r?1. It also constructs generalized Bhaskar Rao designs with υ=k, which is equivalent to υ rows of a generalized Hadamard matrix of order n where υ?n.     

Improved conditions for the robustness of binary block designs against the loss of whole blocks

Several authors have investigated conditions for a binary block design, D, to be maximally robust such that every eventual design obtained from D by eliminating r_[υ]−1 blocks is connected, where r_[υ] is the smallest treatment replication. Four new results for the maximal robustness of D with superior properties are given. An extension of these results to widen the assessment of robustness of the planned design is also presented.     

On characterization results based on the number of observations near the k-records

In this paper, using the completeness properties of the sequence of functions {h_n(x)=(?log x)ⁿ, 0<x<1, n≥1}, some characterization results are established. The results are based on the number of observations near the k-records. It is shown that the equality of the moment of the appropriate subsequence of the number of observations near to upper and lower k-records is a characteristic property of symmetric distributions. Since ordinary record values are contained in the k-records, the results hold for usual records as a particular case.