Theory of factorial designs of the parallel flats type. I: the coefficient matrix

Let GF(s) be the finite field with s elements.(Thus, when s=3, the elements of GF(s) are 0, 1 and 2.)Let A(r×n), of rank r, and c_i(i=1,…,f), (r×1), be matrices over GF(s). (Thus, for n=4, r=2, f=2, we could have A=[¹¹¹⁰₀₁₂₁], c₁=[¹₀], c₂=[⁰₂].) Let T_i (i=1,…,f) be the flat in EG(n, s) consisting of the set of all the s^n?r solutions of the equations At=c_i, wheret′=(t₁,…,t_n) is a vector of variables.(Thus, EG(4, 3) consists of the 3⁴=81 points of the form (t₁,t₂,t₃,t₄), where t's take the values 0,1,2 (in GF(3)). The number of solutions of the equations At=c_i is s^n?r, where r=Rank(A), and the set of such solutions is said to form an (n?r)-flat, i.e. a flat of (n?r) dimensions. In our example, both T₁ and T₂ are 2-flats consisting of 3^4?2=9 points each. The flats T₁,T₂,…,T_f are said to be parallel since, clearly, no two of them can have a common point. In the example, the points of T₁ are (1000), (0011), (2022), (0102), (2110), (1121), (2201), (1212) and (0220). Also, T₂ consists of (0002), (2010), (1021), (2101), (1112), (0120), (1200), (0211) and (2222).) Let T be the fractional design for a sⁿ symmetric factorial experiment obtained by taking T₁,T₂,…,T_f together. (Thus, in the example, 3⁴=81 treatments of the 3⁴ factorial experiment correspond one-one with the points of EG(4,3), and T will be the design (i.e. a subset of the 81 treatments) consisting of the 18 points of T₁ and T₂ enumerated above.)In this paper, we lay the foundation of the general theory of such ‘parallel’ types of designs. We define certain functions of A called the alias component matrices, and use these to partition the coefficient matrix X (n×v), occuring in the corresponding linear model, into components X._j(j=0,1,…,g), such that the information matrix X is the direct sum of the X′._jX._j. Here, v is the total number of parameters, which consist of (possibly μ), and a (general) set of (geometric) factorial effects (each carrying (s?1) degrees of freedom as usual). For j≠0, we show that the spectrum of X′._jX._j does not change if we change (in a certain important way) the usual definition of the effects. Assuming that such change has been adopted, we consider the partition of the X._j into the X_ij (i=1,…,f). Furthermore, the X_ij are in turn partitioned into smaller matrices (which we shall here call the) X_ijh. We show that each X_ijh can be factored into a product of 3 matrices J, ζ (not depending on i,j, and h) and Q(j,h,i)where both the Kronecker and ordinary product are used. We introduce a ring R using the additive groups of the rational field and GF(s), and show that the Q(j,h,i) belong to a ring isomorphic to R. When s is a prime number, we show that R is the cyclotomic field. Finally, we show that the study of the X._j and X′._jX._j can be done in a much simpler manner, in terms of certain relatively small sized matrices over R.     

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.     

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

Concerning the vector v(m,t)

Let q = mt + 1 be a prime power, and let v(m, t) be the (m + 1)-vector (b₁, b₂, …, b_{m + 1}) of elements of GF(q) such that for each k, 1 ⩽ k ⩽ m + 1, the set {b_i−b_j:i∈{1,2,…m+1} − {m + 2 − k}, j  i + k(mod m + 2) and 1⩽j⩽m+1} forms a system of representatives for the cyclotomic classes of index m in GF(q). In this paper, we investigate the existence of such vectors. An upper bound on t for the existence of a v(m, t) is given for each fixed m unless both m and t are even, in which case there is no such a vector. Some special cases are also considered.     

A One Sided Test Based on Sample Quasi Ranges

Abstract

Let the data from the ith treatment/population follow a distribution with cumulative distribution function (cdf) F _i (x) = F[(x ? μ _i )/θ _i ], i = 1,…, k (k ≥ 2). Here μ _i (?∞ < μ _i  < ∞) is the location parameter, θ _i (θ _i  > 0) is the scale parameter and F(?) is any absolutely continuous cdf, i.e., F _i (?) is a member of location-scale family, i = 1,…, k. In this paper, we propose a class of tests to test the null hypothesis H ₀ ? θ₁ = · = θ _k against the simple ordered alternative H _A  ? θ₁ ≤ · ≤ θ _k with at least one strict inequality. In literature, use of sample quasi range as a measure of dispersion has been advocated for small sample size or sample contaminated by outliers [see David, H. A. (1981). Order Statistics. 2nd ed. New York: John Wiley, Sec. 7.4]. Let X _i1,…, X _in be a random sample of size n from the population π _i and R _ir  = X _i:n?r  ? X _i:r+1, r = 0, 1,…, [n/2] ? 1 be the sample quasi range corresponding to this random sample, where X _i:j represents the jth order statistic in the ith sample, j = 1,…, n; i = 1,…, k and [x] is the greatest integer less than or equal to x. The proposed class of tests, for the general location scale setup, is based on the statistic W _r  = max_1≤i<j≤k (R _jr /R _ir ). The test is reject H ₀ for large values of W _r . The construction of a three-decision procedure and simultaneous one-sided lower confidence bounds for the ratios, θ _j /θ _i , 1 ≤ i < j ≤ k, have also been discussed with the help of the critical constants of the test statistic W _r . Applications of the proposed class of tests to two parameter exponential and uniform probability models have been discussed separately with necessary tables. Comparisons of some members of our class with the tests of Gill and Dhawan [Gill A. N., Dhawan A. K. (1999). A One-sided test for testing homogeneity of scale parameters against ordered alternative. Commun. Stat. – Theory and Methods 28(10):2417–2439] and Kochar and Gupta [Kochar, S. C., Gupta, R. P. (1985). A class of distribution-free tests for testing homogeneity of variances against ordered alternatives. In: Dykstra, R. et al., ed. Proceedings of the Conference on Advances in Order Restricted Statistical Inference at Iowa city. Springer Verlag, pp. 169–183], in terms of simulated power, are also presented.     

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 Subset Selection Procedure for Selecting the Exponential Population Having the Longest Mean Lifetime When the Guarantee Times are the Same

ABSTRACT

Consider k(≥ 2) independent exponential populations Π₁, Π₂, …, Π _k , having the common unknown location parameter μ ∈ (?∞, ∞) (also called the guarantee time) and unknown scale parameters σ₁, σ₂, …σ _k , respectively (also called the remaining mean lifetimes after the completion of guarantee times), σ _i  > 0, i = 1, 2, …, k. Assume that the correct ordering between σ₁, σ₂, …, σ _k is not known apriori and let σ_[i], i = 1, 2, …, k, denote the ith smallest of σ _j s, so that σ_[1] ≤ σ_[2] ··· ≤ σ_[k]. Then Θ _i  = μ + σ _i is the mean lifetime of Π _i , i = 1, 2, …, k. Let Θ_[1] ≤ Θ_[2] ··· ≤ Θ_[k] denote the ranked values of the Θ _j s, so that Θ_[i] = μ + σ_[i], i = 1, 2, …, k, and let Π_(i) denote the unknown population associated with the ith smallest mean lifetime Θ_[i] = μ + σ_[i], i = 1, 2, …, k. Based on independent random samples from the k populations, we propose a selection procedure for the goal of selecting the population having the longest mean lifetime Θ_[k] (called the “best” population), under the subset selection formulation. Tables for the implementation of the proposed selection procedure are provided. It is established that the proposed subset selection procedure is monotone for a general k (≥ 2). For k = 2, we consider the loss measured by the size of the selected subset and establish that the proposed subset selection procedure is minimax among selection procedures that satisfy a certain probability requirement (called the P*-condition) for the inclusion of the best population in the selected subset.     

Some locally optimal subset selection rules for comparison with a control

Let π₀,π₁,…,π_k be k+1 independent populations. For i=0,1,…,k,π_i has the densit f(x,θ_i), where the (unknown) parameter θ_i belongs to an interval of the real line. Our goal is to select from π₁,… π_k (experimental treatments) those populations, if any, that are better (suitably defined) than π₀ which is the control population. A locally optimal rule is derived in the class of rules for which Pr(π_i is selected)γ_i, i=1,…,k, when θ₀=θ₁=?=θ_k. The criterion used for local optimality amounts to maximizing the efficiency in a certain sense of the rule in picking out the superior populations for specific configurations of θ=(θ₀,…,θ_k) in a neighborhood of an equiparameter configuration. The general result is then applied to the following special cases: (a) normal means comparison — common known variance, (b) normal means comparison — common unknown variance, (c) gamma scale parameters comparison — known (unequal) shape parameters, and (d) comparison of regression slopes. In all these cases, the rule is obtained based on samples of unequal sizes.     

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.     

Characterizations of geometric distribution and discrete IFR (DFR) distributions using order statistics

Let X be a discrete random variable the set of possible values (finite or infinite) of which can be arranged as an increasing sequence of real numbers a₁<a₂<a₃<…. In particular, a_i could be equal to i for all i. Let X_1n≦X_2n≦?≦X_nn denote the order statistics in a random sample of size n drawn from the distribution of X, where n is a fixed integer ≧2. Then, we show that for some arbitrary fixed k(2≦k≦n), independence of the event {X_kn=X_1n} and X_1n is equivalent to X being either degenerate or geometric. We also show that the montonicity in i of P{X_kn = X_1n | X_1n = a_i} is equivalent to X having the IFR (DFR) property. Let a_i = i and $\text{G(i) = P(X≧i), i = 1, 2, …}$. We prove that the independence of {X_2n ? X_1n ∈B} and X_1n for all i is equivalent to X being geometric, where B = {m} (B = {m,m+1,…}), provided G(i) = q^i?1, 1≦i≦m+2 (1≦i≦m+1), where 0<q<1.     

A one-sided test for testino homogeneity of scale parameters against simple ordered alternative

In an earlier paper the authors (1997) extended the results of Hayter (1990) to the two parameter exponential probability model. This paper addressee the extention to the scale parameter case under location-scale probability model. Consider k (k≧3) treatments or competing firms such that an observation from with treatment or firm follows a distribution with cumulative distribution function (cdf) F_i(x)=F[(x-μ_i)/Q_i], where F(·) is any absolutely continuous cdf, i=1,…,k. We propose a test to test the null hypothesis H₀:θ₁=…=θ_k against the simple ordered alternative H₁:θ₁≦…≦θ_k, with at least one strict inequality, using the data X_i,j, i=1,…k; j=1,…,n₁. Two methods to compute the critical points of the proposed test have been demonstrated by talking k two parameter exponential distributions. The test procedure also allows us to construct simultaneous one sided confidence intervals (SOCIs) for the ordered pairwise ratios θ_j/θ_i, 1≦i<j≦k. Statistical simulation revealed that: 9i) actual sizes of the critical points are almost conservative and (ii) power of the proposed test relative to some existing tests is higher.     

Minimax type procedures for nonparametric selection of the “best” population with partially classified data

Consider a sequence x ≡ (x₁,…, x_n) of n independent observations, in which each observation x_i is known to be a realization from either one of k_i given populations, chosen among k (≥ k_i) populations π₁, …, π_k Our main objective is to study the problem of the selection of the most reliable population π_j at a fixed time ξ, when no assumptions about the k populations are made. Some numerical examples are presented.     

Computer-Generated Neighbor Designs

Neighbor designs are useful to remove the neighbor effects. In this article, an algorithm is developed and is coded in Visual C + +to generate the initial block for possible first, second,…, and all order neighbor designs. To get the required design, a block (0, 1, 2,…, k ? 1) is then augmented with (v ? 1) blocks obtained by developing the initial block cyclically mod (v ? 1).     

Constants on a Uniform Berry-Esseen Bound on Some Borel Sets in ℝ k via Stein's Method

For each n, k ∈ ?, let Y _i  = (Y _i1, Y _i2,…, Y _ik ), 1 ≤ i ≤ n be independent random vectors in ? ^k with finite third moments and Y _ij are independent for all j = 1, 2,…, k. In this article, we use the Stein's technique to find constants in uniform bounds for multidimensional Berry-Esseen inequality on a closed sphere, a half plane and a rectangular set.     

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.     

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.     

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.     

Estimating Average Worth of the Selected Subset from Two-Parameter Exponential Populations

ABSTRACT

Suppose independent random samples are available from k(k ≥ 2) exponential populations ∏₁,…,∏ _k with a common location θ and scale parameters σ₁,…,σ _k , respectively. Let X _i and Y _i denote the minimum and the mean, respectively, of the ith sample, and further let X = min{X ₁,…, X _k } and T _i  = Y _i  ? X; i = 1,…, k. For selecting a nonempty subset of {∏₁,…,∏ _k } containing the best population (the one associated with max{σ₁,…,σ _k }), we use the decision rule which selects ∏ _i if T _i  ≥ c max{T ₁,…,T _k }, i = 1,…, k. Here 0 < c ≤ 1 is chosen so that the probability of including the best population in the selected subset is at least P* (1/k ≤ P* < 1), a pre-assigned level. The problem is to estimate the average worth W of the selected subset, the arithmetic average of means of selected populations. In this article, we derive the uniformly minimum variance unbiased estimator (UMVUE) of W. The bias and risk function of the UMVUE are compared numerically with those of analogs of the best affine equivariant estimator (BAEE) and the maximum likelihood estimator (MLE).     

Nonparametric statistical procedures for the changepoint problem

Let X₁,…,X_r?1,X_r,X_r+1,…,X_n be independent, continuous random variables such that X_i, i = 1,…,r, has distribution function F(x), and X_i, i = r+1,…,n, has distribution function F(x?Δ), with -∞ <Δ< ∞. When the integer r is unknown, this is refered to as a change point problem with at most one change. The unknown parameter Δ represents the magnitude of the change and r is called the changepoint. In this paper we present a general review discussion of several nonparametric approaches for making inferences about r and Δ.