Some remarks on subdesigns of symmetric designs

Let D(υ, k, λ) be a symmetric design containing a symmetric design D₁(υ₁, k₁, λ₁) (k₁ < k) and let x = υ₁(k ? k₁)/(υ ? υ₁). We show that k ≥(k₁ ? x)² + λ If equality holds, D₁ is called a tight subdesign of D. In the special case, λ₁ = λ, the inequality reduces to that of R.C. Bose and S.S. Shrikhande and tight subdesigns then correspond to their notion of Baer subdesigns. The possibilities for (7upsi;, k, λ) designs having Baer subdesigns are investigated.     

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

D-Optimal Designs for Covariate Parameters in Block Design Set Up

The problem considered is that of finding D-optimal design for the estimation of covariate parameters and the treatment and block contrasts in a block design set up in the presence of non stochastic controllable covariates, when N = 2(mod 4), N being the total number of observations. It is clear that when N ≠ 0 (mod 4), it is not possible to find designs attaining minimum variance for the estimated covariate parameters. Conditions for D-optimum designs for the estimation of covariate parameters were established when each of the covariates belongs to the interval [?1, 1]. Some constructions of D-optimal design have been provided for symmetric balanced incomplete block design (SBIBD) with parameters b = v, r = k = v ? 1, λ =v ? 2 when k = 2 (mod 4) and b is an odd integer.     

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.     

Asymptotic expaxsioxs for the joint distribution of cirrelated hotellings t2 statlstics under normality

Let T² _i=z′_iS^?1z_i, i==,…k be correlated Hotelling's T² statistics under normality. where z=(z′_i,…,z′_k)′ and nS are independently distributed as N_kp((O,ρ?∑) and Wishart distribution W_p(∑, n), respectively. The purpose of this paper is to study the distribution function F(x₁,…,x_k) of (T² _i,…,T² _k) when n is large. First we derive an asymptotic expansion of the characteristic function of (T² _i,…,T² _k) up to the order n^?2. Next we give asymptotic expansions for (T² _i,…,T² _k) in two cases (i)ρ=I_k and (ii) k=2 by inverting the expanded characteristic function up to the orders n^?2 and n^?1, respectively. Our results can be applied to the distribution function of max (T² _i,…,T² _k) as a special case.     

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

Robust statistics for testing mean vectors of multivariate distributions

We develop a ‘robust’ statistic T² _R, based on Tiku's (1967, 1980) MML (modified maximum likelihood) estimators of location and scale parameters, for testing an assumed meam vector of a symmetric multivariate distribution. We show that T² _R is one the whole considerably more powerful than the prominenet Hotelling T² statistics. We also develop a robust statistic T² _D for testing that two multivariate distributions (skew or symmetric) are identical; T² _D seems to be usually more powerful than nonparametric statistics. The only assumption we make is that the marginal distributions are of the type (1/σ_k)f((x-μ_k)/σ_k) and the means and variances of these marginal distributions exist.     

Robust test for means when population variances are unequal

We consider the problem of testing the equality of two population means when the population variances are not necessarily equal. We propose a Welch-type statistic, say T^* _c, based on Tiku!s ‘1967, 1980’ modified maximum likelihood estimators, and show that this statistic is robust to symmetric and moderately skew distributions. We investigate the power properties of the statistic T^* _c; T^* _c clearly seems to be more powerful than Yuen's ‘1974’ Welch-type robust statistic based on the trimmed sample means and the matching sample variances. We show that the analogous statistics based on the ‘adaptive’ robust estimators give misleading Type I errors. We generalize the results to testing linear contrasts among k population means     

D-optimal block designs with at most six varieties

For given positive integers v, b, and k (all of them ≥2) a block design is a k × b array of the variety labels 1,…,v with blocks as columns. For the usual one-way heterogeneity model in standard form the problem is studied of finding a D-optimal block design for estimating the variety contrasts, when no balanced block design (BBD) exists. The paper presents solutions to this problem for v≤6. The results on D-optimality are derived from a graph-theoretic context. Block designs can be considered as multigraphs, and a block design is D-optimal iff its multigraph has greatest complexity (=number of spanning trees).     

Local asymptotic normality of intermediate and central order statistics

Consider n independent random variables Z_i,…, Z_n on R with common distribution function F, whose upper tail belongs to a parametric family F(t) = F_θ(t),t ≥ x₀, where θ ∈ ? ? R ^d. A necessary and sufficient condition for the family F_θ, θ ∈ ?, is established such that the k-th largest order statistic Z_n?k+1:n alone constitutes the central sequence yielding local asymptotic normality ( LAN ) of the loglikelihood ratio of the vector (Z_n?i+1:n)¹ _i=kof the k largest order statistics. This is achieved for k = k(n)→_n→∞∞ with k/n→_n→∞ 0.

In the case of vectors of central order statistics ( Z_r:n, Z_r+1:n,…, Z_s:n ), with r/n and s/n both converging to q ∈ ( 0,1 ), it turns out that under fairly general conditions any order statistic Z_m:n with r ≤ m ≤s builds the central sequence in a pertaining LAN expansion.These results lead to asymptotically optimal tests and estimators of the underlying parameter, which depend on single order statistics only     

Asymptotics for multisample statistics

Consider a family of square-integrable R^d-valued statistics S_k = S_k(X_1,k1; X_2,k2;…; X_m,km), where the independent samples X_i,kj respectively have k_i i.i.d. components valued in some separable metric space X_i. We prove a strong law of large numbers, a central limit theorem and a law of the iterated logarithm for the sequence {S_k}, including both the situations where the sample sizes tend to infinity while m is fixed and those where the sample sizes remain small while m tends to infinity. We also obtain two almost sure convergence results in both these contexts, under the additional assumption that S_k is symmetric in the coordinates of each sample X_i,kj. Some extensions to row-exchangeable and conditionally independent observations are provided. Applications to an estimator of the dimension of a data set and to the Henze-Schilling test statistic for equality of two densities are also presented.     

Symmetric group divisible designs with the dual property

A symmetric group divisible design (SGDD) is said to have the dual property, if the dual of the design has the same parameters as the original design. In this paper we study the structure of such designs and give some applications to Baer subdesigns of symmetric balanced incomplete block designs (SBIBD) and to near planes (Fast-blockpläne).     

A class of fixed-width confidence intervals for a ranked normal mean

Suppose that we are given k(≥ 2) independent and normally distributed populations π₁, …, π_k where π_i has unknown mean μ_i and unknown variance σ² _i (i = 1, …, k). Let μ_[i] (i = 1, …, k) denote the i^th smallest one of μ₁, …, μ_k. A two-stage procedure is used to construct lower and upper confidence intervals for μ_[i] and then use these to obtain a class of two-sided confidence intervals on μ_[i] with fixed width. For i = k, the interval given by Chen and Dudewicz (1976) is a special case. Comparison is made between the class of two-sided intervals and a symmetric interval proposed by Chen and Dudewicz (1976) for the largest mean, and it is found that for large values of k at least one of the former intervals requires a smaller total sample size. The tables needed to actually apply the procedure are provided.     

Confidence intervals for the largest mean from k correlated normal populations

Let X= (X₁,…, X_k)’ be a k-variate (k ≥ 2) normal random vector with unknown population mean vector μ = (μ₁ ,…, μ_k)’ and covariance matrix Σ of order k and let μ_[1] ≤ … ≤ μ_[k] be the ordered values of the μ ’ s. No prior knowledge of the pairing of the μ_[i] with the X_j. (or μ_[i] with the σ_j ²) is assumed for any i and j (1 ≤ i, j ≤ k). Based on a random sample of N independent vector observations on X, this paper considers both upper and lower (one-sided) and two-sided 100γ% (0 < γ < 1) confidence intervals for μ_[k] and μ_[1], the largest and the smallest mean, respectively, when Σ is known and when Σ is equal to σ²R with common unknown variance σ² > 0 and correlation matrix R known, respectively. An optimum two-sided confidence interval via finding the shortest length from this class is also considered. Necessary tables and computer program to actually apply these procedures are provided.     

Orthogonal arrays and ordered designs

In the first part of this paper, we give a short and direct construction of signed orthogonal array SOA(λ,t,k,v), for any set of parameters λ,t,k,v,t ⩽ k. We also construct a specific basis of the Z-module generated by any SOA(0,t,k,v), for any t,k,v,t ⩽ k. We will then construct an inite family of large set of disjoint ordered designs by applying G.B. Khosrovshahi and S. Ajoodani-Namini's method to Luc. Teirlinck's construction.     

Maximum likelihood estimation in the presence of outiliers

This paper deals with the maximum likelihood estimation of parameters when the sample (x₁…x_n ) may heve k spuriously generated observations from another distribution, say G≠F, where F is the distribution of the target population. If G is stochastically larger than F, then these k observations may give rise to k extreme observations or ‘outliers’. This situation is often described by a so-called ‘k-outlier model’ in which in addition to the parameters involved in F and G, the set ν={ν₁,…,ν_k} of indices, for which x_νj , j=1,…,k, come from G, is also unknow.     

Distributions of patterns of two successes separated by a string of <Emphasis Type="Italic">k</Emphasis>-2 failures

Let Z ₁, Z ₂, . . . be a sequence of independent Bernoulli trials with constant success and failure probabilities p = Pr(Z _t  = 1) and q = Pr(Z _t  = 0) = 1 − p, respectively, t = 1, 2, . . . . For any given integer k ≥ 2 we consider the patterns E₁{\mathcal{E}_{1}}: two successes are separated by at most k−2 failures, E₂{\mathcal{E}_{2}}: two successes are separated by exactly k −2 failures, and E₃{\mathcal{E}_{3}} : two successes are separated by at least k − 2 failures. Denote by N_n,k⁽ⁱ⁾{ N_{n,k}^{(i)}} (respectively M_n,k⁽ⁱ⁾{M_{n,k}^{(i)}}) the number of occurrences of the pattern E_i{\mathcal{E}_{i}} , i = 1, 2, 3, in Z ₁, Z ₂, . . . , Z _n when the non-overlapping (respectively overlapping) counting scheme for runs and patterns is employed. Also, let T_r,k⁽ⁱ⁾{T_{r,k}^{(i)}} (resp. W_r,k⁽ⁱ⁾){W_{r,k}^{(i)})} be the waiting time for the r − th occurrence of the pattern E_i{\mathcal{E}_{i}}, i = 1, 2, 3, in Z ₁, Z ₂, . . . according to the non-overlapping (resp. overlapping) counting scheme. In this article we conduct a systematic study of N_n,k⁽ⁱ⁾{N_{n,k}^{(i)}}, M_n,k⁽ⁱ⁾{M_{n,k}^{(i)}}, T_r,k⁽ⁱ⁾{T_{r,k}^{(i)}} and W_r,k⁽ⁱ⁾{W_{r,k}^{(i)}} (i = 1, 2, 3) obtaining exact formulae, explicit or recursive, for their probability generating functions, probability mass functions and moments. An application is given.     

Simultaneous selection of extreme populations:a bayesian approach

The problem of simultaneously selecting two non-empty subsets, S_Land S_U, of k populations which contain the lower extreme population (LEP) and the upper extreme population (UEP), respectively, is considered. Unknown parameters θ₁,…,θ_kcharacterize the populations π₁,…,π_kand the populations associated with θ_[1]=min θ_i. and θ_[k]= max θ_i. are called the LEP and the UEP, respectively. It is assumed that the underlying distributions possess the monotone likelihood ratio property and that the prior distribution of θ= (θ₁,…,θ_k) is exchangeable. The Bayes rule with respect to a general loss function is obtained. Bayes rule with respect to a semi-additive and non-negative loss function is also determined and it is shown that it is minimax and admissible. When the selected subsets are required to be disjoint, it shown that the Bayes rule with respect to a specific loss function can be obtained by comparing certain computable integrals, Application to normal distributions with unknown means θ₁,…,θ_kand a common known variance is also considered.     

Projection Properties of Certain Three-Level Main Effect Plans with Quantitative Factors

ABSTRACT

Orthogonal arrays are used as screening designs to identify active main effects, after which the properties of the subdesign for estimating these effects and possibly their interactions become important. Such a subdesign is known as a “projection design”. In this article, we have identified all the geometric non isomorphic projection designs of an OA(27,13,3,2), an OA(18,7,3,2) and an OA(36,13,3,2) into k = 3,4, and 5 factors when they are used for screening out active quantitative experimental factors, with regard to the prior selection of the middle level of factors. We use the popular D-efficiency criterion to evaluate the ability of each design found in estimating the parameters of a second order model.