Showing papers in "Journal of Statistical Planning and Inference in 1980"

TL;DR: In this paper, the authors investigated the efficiency of Tiku's modified maximum likelihood estimators for estimating the location and scale parameters of symmetric non-normal distributions, and showed that they are jointly more efficient than x and s for long-tailed distributions.

TL;DR: In this paper, sufficient conditions are established when a continuous design contains maximal information for a prescribed s-dimensional parameter in a classical linear model, and the results apply in particular to a class of information functionals which covers c-, D-, A-, L-optimality.

TL;DR: In this paper, it was shown that if pr and pr − 1 are both prime powers, then there is a generalized Hadamard matrix of order pr(pr − 1) with elements from the elementary abelian group Zp x⋯x Zp.

TL;DR: The consistency of the Parzen kernel-type as well as recursive kernel estimates of a regression function is shown and the problem of selecting asymptotically optimal kernels is discussed.

TL;DR: The family of t-designs is, without any doubt, the most important family of statistical designs as mentioned in this paper, and their importance is due to their statistical optimalities, desirable symmetries for analyses and interpretations, and uses for constructing other important designs and structures such as Youden designs, generalized Youden design, optimal fractional factorial designs, error defecting and correcting binary codes, balanced arrays, combinatorial filing systems, Hadamard matrices, finite projective and affine planes, strongly regular graphs, and so on.

TL;DR: In this paper, several modifications of Kendall's τ are discussed to accommodate testing for independence in bivariate data subject to censoring, and an extensive computer simulation is done to investigate power properties of these modifications under alternatives of the bivariate normal or bivariate exponential types.

TL;DR: In this article, properties of abelian groups are used to unify the construction of cyclic and generalized cyclic designs, and necessary and sufficient conditions are obtained for the generation of fractional sets of blocks, and also for resolvable designs.

TL;DR: In this article, the MG-procedure with any selective probability matrix provides a more efficient estimator than the sample mean based on simple random sampling, and the estimator based on it is shown to be more efficient than that studied by Yanagawa and Shirahata [5].

TL;DR: The problem of estimating the numbers of vertices of different degrees in the unknown graph by using the sample information is considered and unbiased estimators are given and their variance-covariance matrix is shown to depend on a set of intrinsic graph parameters.

TL;DR: In this article, the authors consider the problem of identifying the unknown defective elements by testing some subsets A of X, and for each such set A determining whether A contains any of them.

TL;DR: In this paper, the geometric distribution of independent components in a sample of size two has been characterized in the class of either IFR or DFR discrete distributions, using certain properties of order statistics, when the components are independent and identically distributed.

TL;DR: In this article, bounds on the latest root of the C -matrix and the number of blocks for a variance-balanced block design are given, and the results contain the well-known results as special cases.

TL;DR: In this paper, a series of weakly resolvable search designs for the pn factorial experiment is given for which the mean and all main effects are estimable in the presence of any number of two-factor interactions and for which any combination of three or fewer pairs of factors that interact may be detected.

TL;DR: In this paper, the Srivastava-Chopra optimal balanced resolution V plans for 2 m factorials (4⩽ m ⩽8) are presented.

TL;DR: In this paper, sufficient conditions are given for an incomplete block design to be (M,S) -optimal in terms of the association matrix for binary and nonbinary block designs.

TL;DR: The authors extended the idea of Vincze (1978) and unified the approach for the uniparameter and multiparameter situations for obtaining the Cramer-Rao inequality.

TL;DR: In this article, the problem of estimating the mean of a continuous distribution with unknown mean and variance σ 2 is considered, when it is known that μ ∈ (a, ∞) (or μ∈(-∞, b )), almost surely.

TL;DR: In this paper, the authors define the best population in terms of a measure of separation between θ i's and define a set of subset selection rules for which the size of the selected subset is controlled at a given point and the infimum of the probability of correct selection over the parameter space is maximized.

TL;DR: In this paper, the construction of experimental designs by recursive techniques is studied and the recursive addition or deletion of data from a design are derived for a typical sub-hypothesis situation of a general experimental design.

TL;DR: In this paper, four new group divisible designs which are obtained by trial and error are presented, and these designs are believed to be new, since they are not listed in Clatworthy (1973), Freeman (1976) or John and Turner (1977).

TL;DR: In this paper, the estimation of regression parameters in heteroscedastic linear models when the number of parameters is large was studied, and the results generalize work of Huber (1973), Yohai and Maronna (1979), and Carroll and Rupert (1982a).

TL;DR: In this article, a subset of the cells is to be selected in a way so that the cell associated with the smallest cell probability is included in the selected subset with a preassigned probability, P ∗.

TL;DR: In this paper, a formulation of the problem of detecting outliers as an empirical Bayes problem is studied, where the notion of average risk asymptotic optimality (a.r.a.o.) is defined.

TL;DR: In this paper, three methods are presented for constructing connected efficiency-balanced block designs from other block designs with the same properties, which differ from the original ones in the number of blocks and/or in the experimental units and their arrangement.

TL;DR: While all non-sequential unbiased estimators of the normal mean have variances which must obey the Cramer-Rao inequality, it is shown in this paper that some sequential unbiased estimates do not.

TL;DR: In this article, the authors consider how choice data given anonymously can be used to reveal various features of the network and use tools from statistical decision theory and information theory to determine risks and capacities of disclosing choice data, the graph structure of choice data and its numbers of loops and mutuals.

TL;DR: In this article, it was shown that the power-function of a monotone test of H : θ = θ 0 against K : α > α 0 cannot tend to 1 as θ − α 0 → ∞ more than n times faster than the tails of F tend to 0.

TL;DR: In this article, improved upper/lower variance bounds for inverse sample unbiased estimator of the negative binomial parameter p were derived. But the improvement was limited to the case of the positive binomial, and the relative improvement was numerically illustrated.