Ranked set sampling theory with selective probability vector

In this paper an estimator of the population mean is introduced by using the idea of selective probability vector and the optimization algorithm of linear programming to find the optimal solution of the selective probability vector under the condition of unbiasedness.     

Some families of group divisible designs

Generalizing methods of constructions of Hadamard group divisible designs due to Bush (1979), some new families of semi-regular or regular group divisible designs are produced. Furthermore, new nonisomorphic solutions for some known group divisible designs are given, together with useful group divisible designs not listed in Clatworthy (1973).     

A note on the construction of optimal linear codes

Let us denote by (n,k,d)-code, a binary linear code with code length nk information symbols and the minimum distance d. It is well known that the problem of obtaining a binary linear code whose code length n is minimum among (n,k,d)-codes for given integers k and d, is equivalent to solve a linear programming whose solutions correspond to a minimum redundancy error-correcting code. In this paper it will be shown that for some given integers d, there exists no solution of the linear programming except a solution which is obtained using a flat in a finite projective geometry.     

Misclassification probabilities in 23 factorial experiments

Interpretational difficulties of the 2³ factorial experiments have been illustrated previously using the Monte Carlo simulation methodology. The present theoretical study derives the surprisingly large maximum frequencies of misclassification when simple effects are judged using main effects when interactions are insignificant.     

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.     

Stochastic orderings related to ranking in an nth order record process

Let X₁, X₂, …, X_m be successive observations on m objects, numbered 1,2, …, m. If X₁ belongs to the n largest observations among X₁,X₂,…,X_i, object i is called a record, i = 1,2,…,m; n?1.In investigating the influence of the ranking of the objects on the expected number of records, a hierarchy of stochastic order relations between random variables arises.It is these order relations and their relationship with known stochastic orderings that are studied in this paper.     

On linear regression designs which maximize information

Necessary and sufficient conditions are established when a continuous design contains maximal information for a prescribed s-dimensional parameter in a classical linear model. The development is based on a thorough study of a particular dual problem and its interplay with the optimal design problem, extending partial results and earlier approaches based on differential calculus, game theory, and other programming methods. The results apply in particular to a class of information functionals which covers c-, D-, A-, L-optimality, they include a complete account of the non-differentiable criterion of E-optimality, and provide a constructive treatment of those situations in which the information matrix is singular. Corollaries pertain to the case of s out of k parameters, simultaneous optimality with respect to several criteria, multiplicity of optimal designs, bounds on their weights, and optimality which is induced by admissibility.     

On the estimation of restricted mean

In sampling from a continuous distribution with unknown mean μ and variance σ² the problem of estimation of μ, when it is known that μ∈(a, ∞) (or μ∈(-∞, b)), is considered. The estimators proposed here lie in the interval (a, ∞) (or (-∞, b)) almost surely. The performance of these estimators is compared to that of some known estimators in the case of sampling from a normal, exponential and a weighted difference of two independent chi-square distributions.     

Optimum designs in complete two-way layouts

In the usual two-way layout of ANOVA (interactions are admitted) let nij ? 1 be the number of observations for the factor-level combination(i, j). For testing the hypothesis that all main effects of the first factor vanish numbers $\text{n}{}^1\text{ij}$ are given such that the power function of the F-test is uniformly maximized (U-optimality), if one considers only designs (nij) for which the row-sums ni are prescribed. Furthermore, in the (larger) set of all designs for which the total number of observations is given, all D-optimum designs are constructed.     

Estimation of a linear transformation and an associated distributional problem

A multivariate “errors in variables” regression model is proposed which generalizes a model previously considered by Gleser and Watson (1973). Maximum likelihood estimators [MLE's] for the parameters of this model are obtained, and the consistency properties of these estimators are investigated. Distribution of the MLE of the “error” variance is obtained in a simple case while the mean and the variance of the estimator are obtained in this case without appealing to the exact distribution.