An optimal search procedure

Consider the following problem. There are exactly two defective (unknown) elements in the set X={x₁, x₂,…,x_n}, all possibilities occuring with equal probabilities. We want to identify the unknown (defective) elements by testing some subsets A of X, and for each such set A determining whether A contains any of them. The test on an individual subset A informs us that either all elements of the tested set A are good, or that at least one of them is defective (but we do not know which ones or how many). A set containing at least one defective element is said to be defective. Our aim is to minimize the maximal number of tests. For the optimal strategy, let the maximal test length be denoted by l₂(n). We obtain the value of this function for an infinite sequence of values of n.     

Partition of a query set into minimal number of subsets having consecutive retrieval property

This paper is concerned with information retrieval. The basic problem is how to store large masses of data in such a way that whenever information regarding some particular aspect of the data is needed, such information is easily and efficiently retrieved. Work in this field is thus very important for organizations dealing with large classes of data.The consecutive retrieval (C-R) property defined by S.P. Ghosh is an important relation between a set of queries and a set of records. Its existence enables the design of information retrieval system with a minimal search time and no redundant storage in that the records can be organized in such a way that those pertinent to any query are stored in consecutive storage locations. The C-R property, however, can not exist between every arbitrary query set and every record set.A subset of the query set Q having the C-R property is called a C-R subset and a C-R subset having the maximum cardinality is called the maximal C-R subset. A partition of Q is called the C-R partition if every subset has the C-R property. A C-R partition with minimum number of subsets is called the minimal C-R partition. With respect to the set of all binary queries and the set of all binary records, it is shown that the maximal cardinality of a C-R subset is 2l-1 where l is the number of attributes concerned. A combinatorial characterization of a maximal C-R subset is also given. A lower bound on the number of subsets in a C-R partition and several examples which attain the lower bound are given. A general procedure for obtaining a minimal C-R partition which attains the lower bound is given provided the number of attributes is even.     

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.     

On optimality properties of simple block designs in the approximate design theory

Optimality properties of approximate block designs are studied under variations of (1) the class of competing designs, (2) the optimality criterion, (3) the parametric function of interest, and (4) the statistical model. The designs which are optimal turn out to be the product of their treatment and block marginals, and uniform designs when the support is specified in advance. Optimality here means uniform, universal, and simultaneous j_p-optimality. The classical balanced incomplete block designs are embedded into this approach, and shown to be simultaneously j_p-optimal for a maximal system of identifiable parameters. A geometric account of universal optimality is given which applies beyond the context of block designs.     

Many (22, 44, 14, 7, 4) — and (15, 42, 14, 5, 4)-balanced incomplete block designs

A Balanced Incomplete Block Design (BIBD) is a pair (V, B) where V is a v-set and B is a collection of b k-subsets of V, called blocks, such that every element of V occurs in exactly r of the k-subsets and every 2-subset of V occurs in exactly λ of the blocks. The number of non-isomorphic designs of a BIBD (22, 44, 14, 7, 4) whose automorphism group is divisible by 7 or 11 are investigated. From this work, results are obtained on the number of non-isomorphic BIBDs (15, 42, 14, 5, 4).     

Some further results on the MV-optimality of block designs for comparing test treatments to a standard treatment

In this paper we further consider the problem of determining optimal block designs which can be used to compare v test treatments to a standard treatment in experimental situations where the available experimental units are to be arranged in b blocks of size k. A design is said to be MV-optimal in such an experimental setting it is minimizes the maximal variance with which treatment differences involving the standard treatment are estimated. In this paper we derive some further sufficient conditions for a design to be MV-optimal in an experimental situation such as described above.     

Minimal orthogonal main-effect plans and partial replication

This work extends Jacroux's results (Jacroux, Technometrics 34 (1992) 92–96) involving minimal orthogonal main-effect plans (OMEP's). Tables of correct minimal numbers of runs of OMEP's are also provided. In addition, a general method is proposed to construct a class of minimal OMEP's. Moreover, a construction method is provided to obtain partially replicated OMEP's (PROMEP's). Our results provide more duplicate points for some plans than Jacroux's results on PROMEP's (Jacroux Technometrics 35 (1993) 32–36). In addition, a method is derived to construct s₁ × (s₁ − 1)²∥s²₁ minimal PROMEP's with maximal duplicate points.     

Maximin efficient design of experiment for exponential regression models

In this paper robust and efficient designs are derived for several exponential decay models. These models are widely used in chemistry, pharmacokinetics or microbiology. We propose a maximin approach, which determines the optimal design such that a minimum of the D-efficiencies (taken over a certain range) becomes maximal. Analytic solutions are derived if optimization is performed in the class of minimal supported designs. In general the optimal designs with respect to the maximin criterion have to be determined numerically and some properties of these designs are also studied. We also illustrate the benefits of our approach by reanalysing a data example from the literature.     

Some sufficient conditions for establishing (M,S)-optimality

Two sufficient conditions are given for an incomplete block design to be (M,S- optimal. For binary designs the conditions are (i) that the elements in each row, excluding the diagonal element, of the association matrix differ by at most one, and (ii) that the off-diagonal elements of the block characteristic matrix differ by at most one. It is also shown how the conditions can be utilized for nonbinary designs and that for blocks of size two the sufficient condition in terms of the association matrix can be attained.     

Minimal 2-coverings of a finite affine space based on GF(2)

Let EG(m, 2) denote the m-dimensional finite Euclidean space (or geometry) based on GF(2), the finite field with elements 0 and 1. Let T be a set of points in this space, then T is said to form a q-covering (where q is an integer satisfying 1?q?m) of EG(m, 2) if and only if T has a nonempty intersection with every (m-q)-flat of EG(m, 2). This problem first arose in the statistical context of factorial search designs where it is known to have very important and wide ranging applications. Evidently, it is also useful to study this from the purely combinatorial point of view. In this paper, certain fundamental studies have been made for the case when q=2. Let N denote the size of the set T. Given N, we study the maximal value of m.     

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.     

Effect size for comparing two or more normal distributions based on maximal contrasts in outcomes

Effect size is a concept that can be especially useful in bioequivalence and studies designed to find important and not just statistically significant differences among responses to treatments based on independent random samples. We develop and explore a new effect size related to a maximal superiority ordering for assessing the separation among two or more normal distributions, possibly having different means and different variances. Confidence intervals and tests of hypothesis for this effect size are developed using a p value obtained by averaging over a distribution on variances. Since there is almost always some difference among treatments, instead of the usual hypothesis test of exactly no effect, researchers should consider testing that an appropriate effect size has at least, or at most, some meaningful magnitude, when one is available, possibly established using the framework developed here. A simulation study of type I error rate, power and interval length is presented. R-code for constructing the confidence intervals and carrying out the tests here can be downloaded from Author’s website.     

Reml and best linear unbiased prediction in state space models

This article takes a hierarchical model approach to the estimation of state space models with diffuse initial conditions. An initial state is said to be diffuse when it cannot be assigned a proper prior distribution. In state space models this occurs either when fixed effects are present or when modelling nonstationarity in the state transition equation. Whereas much of the literature views diffuse states as an initialization problem, we follow the approach of Sallas and Harville (1981,1988) and incorporate diffuse initial conditions via noninformative prior distributions into hierarchical linear models. We apply existing results to derive the restricted loglike-lihood and appropriate modifications to the standard Kalman filter and smoother. Our approach results in a better understanding of De Jong's (1991) contributions. This article also shows how to adjust the standard Kalman filter, the fixed inter- val smoother and the state space model forecasting recursions, together with their mean square errors, for he presence of diffuse components. Using a hierarchical model approach it is shown that the estimates obtained are Best Linear Unbiased Predictors (BLUP).     

Statistical inference for a general class of asymmetric distributions

We consider a general class of asymmetric univariate distributions depending on a real-valued parameter α, which includes the entire family of univariate symmetric distributions as a special case. We discuss the connections between our proposal and other families of skew distributions that have been studied in the statistical literature. A key element in the construction of such families of distributions is that they can be stochastically represented as the product of two independent random variables. From this representation we can readily derive theoretical properties, easy-to-implement simulation schemes as well as extensions to the multivariate case. We also study statistical inference for this class based on the method of moments and maximum likelihood. We give special attention to the skew-power exponential distribution, but other cases like the skew-t distribution are also considered. Finally, the statistical methods are illustrated with 3 examples based on real datasets.     

Model-free feature screening for ultrahigh dimensional censored regression

In this paper we design a sure independent ranking and screening procedure for censored regression (cSIRS, for short) with ultrahigh dimensional covariates. The inverse probability weighted cSIRS procedure is model-free in the sense that it does not specify a parametric or semiparametric regression function between the response variable and the covariates. Thus, it is robust to model mis-specification. This model-free property is very appealing in ultrahigh dimensional data analysis, particularly when there is lack of information for the underlying regression structure. The cSIRS procedure is also robust in the presence of outliers or extreme values as it merely uses the rank of the censored response variable. We establish both the sure screening and the ranking consistency properties for the cSIRS procedure when the number of covariates p satisfies \(p=o\{\exp (an)\}\), where a is a positive constant and n is the available sample size. The advantages of cSIRS over existing competitors are demonstrated through comprehensive simulations and an application to the diffuse large-B-cell lymphoma data set.     

E-optimal designs for three treatments

E-optimality is studied for three treatments in an arbitrary n-way heterogeneity setting. In some cases maximal trace designs cannot be E-optimal. When there is more than one E-optimal design for a given setting, the best with respect to all reasonable criteria is determined.     

On the spectrum of [v,k, t] trades

A [v, k, t] trade of volume m consists of two disjoint collections T₁ and T₂, each of m k-subsets of a v-set V, such that each t-subset of V is contained in the same number of blocks of T₁ and T₂, and each element of V is contained in at least one block of T₁. We study [v, k, t] trades, and investigate their spectrum (i.e., the collections of allowable volumes), using both theoretical techniques and computer-based searches.     

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.     

Sequential search using question-sets with bounded intersections

The paper is concerned with sequential search on a finite set: an unknown element of the finite set is to be found testing its subsets, and getting the information that the unknown element is or is not an element of the tested subset. The optimum of the strategy lengths is found under the condition that the intersection of any two different test-sets is bounded. This condition is generalized taking the intersection of any m different test-sets instead of two, and the general problem is also solved.