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.     

A new characterization of Elfving's method for high dimensional computation

We give a new characterization of Elfving's (1952) method for computing c-optimal designs in k dimensions which gives explicit formulae for the k unknown optimal weights and k unknown signs in Elfving's characterization. This eliminates the need to search over these parameters to compute c-optimal designs, and thus reduces the computational burden from solving a family of optimization problems to solving a single optimization problem for the optimal finite support set. We give two illustrative examples: a high dimensional polynomial regression model and a logistic regression model, the latter showing that the method can be used for locally optimal designs in nonlinear models as well.     

Finite set theory and its application to cryptology

The concept of the (k, n, L)-set (or threshold set) of a finite set A is presented in this paper, based on the requirement of solving cryptology problems. It is proved that for a (k′, n′)-threshold scheme of any special or given k′, n′, the general (k, n)-threshold scheme is constructed by the (k, n, L)-set (or threshold set) of set A. A k, n, L)-set (or threshold set) of set A is constructed from an uniform (k, n)-set for L = |A| or a nonuniform (k, n)-set for L = |A| - 1.     

An essentially complete class of multiple decision procedures

Let π₁,…, π_k represent k(?2) independent populations. The quality of the ith population π_i is characterized by a real-valued parameter θ_i, usually unknown. We define the best population in terms of a measure of separation between θ_i's. A selection of a subset containing the best population is called a correct selection (CS). We restrict attention to 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. The main theorem deals with construction of an essentially complete class of selection rules of the above type. Some classical subset selection rules are shown to belong to this class.     

Improved algorithms for closed step-down procedures to test heterogeneity of all subsets of means

A common problem in analysis of variance is testing for heterogeneity of different subsets of the full set of k population means. A step-down procedure tests a given subset of p means only after rejecting homogeneity for all sets that contain it. The Peritz and Gabriel closed procedure rejects homogeneity for the subset if every partition of the k means that includes the subset includes some rejected set. The Begun and Gabriel closure algorithm reduces computations, but the number of tests still increases exponentially with respect to the number of complementary means, m=k−p. We propose a new algorithm that tests only the m−1 pairs of adjacent ordered complementary sample means. Our algorithm may be used with analyses of variance test statistics in balanced and unbalanced designs, and with Studentized ranges except in extremely unbalanced designs. Seaman, Levin, and Serlin proposed a more powerful closure criterion that cannot exploit the Begun and Gabriel algorithm. We propose a new algorithm in this case as well.     

Minimax subset selection for the multinomial distribution

Let (X₁,…,X_k) be a multinomial vector with unknown cell probabilities (p₁,?,p_k). 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¹. Suppose the loss is measured by the size of the selected subset, S. Using linear programming techniques, selection rules can be constructed which are minimax with respect to S in the class of rules which satisfy the P¹-condition. In some situations, the rule constructed by this method is the rule proposed by Nagel (1970). Similar techniques also work for selection in terms of the largest cell probability.     

Higher-order Bartlett-type adjustment

This paper deals with Bartlett-type adjustment which makes all the terms up to order n^−k in the asymptotic expansion vanish, where k is an integer k ⩾ 1 and n depends on the sample size. Extending Cordeiro and Ferrari (1991, Biometrika, 78, 573–582) for the case of k = 1, we derive a general formula of the kth-order Bartlett-type adjustment for the test statistic whose kth-order asymptotic expansion of the distribution is given by a finite linear combination of chi-squared distribution with suitable degrees of freedom. Two examples of the second-order Bartlett-type adjustment are given. We also elucidate the connection between Bartlett-type adjustment and Cornish-Fisher expansion.     

Testing multiple slippages

A class of invariant Bayes rules is derived for testing homogeneity of k (≥2) different populations against (^k_t) slippage alternatives that some (unknown) subset of size t of the given populations has parameter larger than the remaining k-t, where t is a given integer between 1 and k-1. For a similar problem in nonparametric situations, locally best tests based on ranks are derived.     

Partitioning k multivariate normal populations according to equivalence with respect to a standard vector

We propose optimal procedures to achieve the goal of partitioning k multivariate normal populations into two disjoint subsets with respect to a given standard vector. Definition of good or bad multivariate normal populations is given according to their Mahalanobis distances to a known standard vector as being small or large. Partitioning k multivariate normal populations is reduced to partitioning k non-central Chi-square or non-central F distributions with respect to the corresponding non-centrality parameters depending on whether the covariance matrices are known or unknown. The minimum required sample size for each population is determined to ensure that the probability of correct decision attains a certain level. An example is given to illustrate our procedures.     

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.     

On selecting a subset which contains all populations better than a control

Let π₁…, π_k denote k(≥ 2) populations with unknown means μ₁ , …, μ_k and variances σ₁ ² , …, σ_k ² , respectively and let π_o denote the control population having mean μ_o and variance σ_o ² . It is assumed that these populations are normally distributed with correlation matrix {ρ_ij}. The goal is to select a subset, of populations of π₁ , …, π_k which contains all the populations with means larger than or equal to the mean of the control one. Procedures are given for selecting such a subset so that the probability that all the populations with means larger than or equal to the mean of the control one are included in the selected subset is at least equal to a predetermined value P?(l/k < P? < 1). The goal treated here is a first step screening procedure that allows the experimenter to choose a subset and withhold judgement about which one has the largest mean. Then, if the one with the largest mean is desired it can be chosen from the selected subset on the basis of cost and other considerations. Percentage points are also included.     

The simultaneous confidence intervals for all distances from the extreme populations for two-parameter exponential populations based on the multiply type II censored samples

Among k independent two-parameter exponential distributions which have the common scale parameter, the lower extreme population (LEP) is the one with the smallest location parameter and the upper extreme population (UEP) is the one with the largest location parameter. Given a multiply type II censored sample from each of these k independent two-parameter exponential distributions, 14 estimators for the unknown location parameters and the common unknown scale parameter are considered. Fourteen simultaneous confidence intervals (SCIs) for all distances from the extreme populations (UEP and LEP) and from the UEP from these k independent exponential distributions under the multiply type II censoring are proposed. The critical values are obtained by the Monte Carlo method. The optimal SCIs among 14 methods are identified based on the criteria of minimum confidence length for various censoring schemes. The subset selection procedures of extreme populations are also proposed and two numerical examples are given for illustration.     

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.     

Selecting the normal population with the smallest variance: A restricted subset selection rule

Consider k( ? 2) normal populations whose means are all known or unknown and whose variances are unknown. Let σ²_[1] ? ??? ? σ_[k]² denote the ordered variances. Our goal is to select a non empty subset of the k populations whose size is at most m(1 ? m ? k ? 1) so that the population associated with the smallest variance (called the best population) is included in the selected subset with a guaranteed minimum probability P* whenever σ²_[2]/σ_[1]² ? δ* > 1, where P* and δ* are specified in advance of the experiment. Based on samples of size n from each of the populations, we propose and investigate a procedure called R_BCP. We also derive some asymptotic results for our procedure. Some comparisons with an earlier available procedure are presented in terms of the average subset sizes for selected slippage configurations based on simulations. The results are illustrated by an example.     

Importance tempering

Simulated tempering (ST) is an established Markov chain Monte Carlo (MCMC) method for sampling from a multimodal density π(θ). Typically, ST involves introducing an auxiliary variable k taking values in a finite subset of [0,1] and indexing a set of tempered distributions, say π _k (θ)∝ π(θ) ^k . In this case, small values of k encourage better mixing, but samples from π are only obtained when the joint chain for (θ,k) reaches k=1. However, the entire chain can be used to estimate expectations under π of functions of interest, provided that importance sampling (IS) weights are calculated. Unfortunately this method, which we call importance tempering (IT), can disappoint. This is partly because the most immediately obvious implementation is naïve and can lead to high variance estimators. We derive a new optimal method for combining multiple IS estimators and prove that the resulting estimator has a highly desirable property related to the notion of effective sample size. We briefly report on the success of the optimal combination in two modelling scenarios requiring reversible-jump MCMC, where the naïve approach fails.     

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.     

ON TESTING THE EQUALITY OF LOCATION PARAMETERS IN k CENSORED EXPONENTIAL DISTRIBUTIONS

Kumar and Patel (1971) have considered the problem of testing the equality of location parameters of two exponential distributions on the basis of samples censored from above, when the scale parameters are the same and unknown. The test proposed by them is shown to be biased for n₁≠n₂, while for n₁=n₂ the test possesses the property of monotonicity and is equivalent to the likelihood ratio test, which is considered by Epstein and Tsao (1953) and Dubey (1963a, 1963b). Epstein and Tsao state that the test is unbiased. We may note that when the scale parameters of k exponential distributions are unknown the problem of testing the equality of location parameters is reducible to that of testing the equality of parameters in k rectangular populations for which a test and its power function were given by Khatri (1960, 1965); Jaiswal (1969) considered similar problems in his thesis. Here we extend the problem of testing the equality of k exponential distributions on the basis of samples censored from above when the scale parameters are equal and unknown, and we establish the likelihood ratio test (LET) and the union-intersection test (UIT) procedures. Using the results previously derived by Jaiswal (1969), we obtain the power function for the LET and for k= 2 show that the test possesses the property of monotonicity. The power function of the UIT is also given.     

Sequential Estimation of Expectations in the Presence of Trend2

A sequence of independent random variables {Z_n:n≥ 1} with unknown probability distributions is considered and the problem of estimating their expectations {M_n+1: n≥ 1} is examined. The estimation of M_n+1 is based on a finite set {z_k:1≤k≤n}, each z_k being an observed value of Z_k, 1 ≤k≤n, and also based on the assumption that {M_n:n≥ 1} follows an unknown trend of a specified form.     

Saturated designs for multivariate cubic regression

This paper deals with the problem of finding saturated designs for multivariate cubic regression on a cube which are nearly D-optimal. A finite class of designs is presented for the k dimensional cube having the property that the sequence of the best designs in this class for each k is asymptotically efficient as k increases. A method for constructing good designs in this class is discussed and the construction is carried out for 1?k?8. These numerical results are presented in the last section of the paper.