منابع مشابه
Asymptotic properties of the sample mean in adaptive sequential sampling with multiple selection criteria
We extend the method of adaptive two-stage sequential sampling toinclude designs where there is more than one criteria is used indeciding on the allocation of additional sampling effort. Thesecriteria, or conditions, can be a measure of the targetpopulation, or a measure of some related population. We developMurthy estimator for the design that is unbiased estimators fort...
متن کاملSome Asymptotic Results of Kernel Density Estimator in Length-Biased Sampling
In this paper, we prove the strong uniform consistency and asymptotic normality of the kernel density estimator proposed by Jones [12] for length-biased data.The approach is based on the invariance principle for the empirical processes proved by Horváth [10]. All simulations are drawn for different cases to demonstrate both, consistency and asymptotic normality and the method is illustrated by ...
متن کاملSampling of Multiple Variables Based on Partially Ordered Set Theory
We introduce a new method for ranked set sampling with multiple criteria. The method relaxes the restriction of selecting just one individual variable from each ranked set. Under the new method for ranking, units are ranked in sets based on linear extensions in partially order set theory with considering all variables simultaneously. Results willbe evaluated by a relatively extensive simulation...
متن کاملAsymptotic Theory of Overparameterized
A theory of overparameterized structural models is presented. In such a model some "redundant" parameters are involved; the parameter vector is not identified, and the information matrix is not nonsingular. The minimum discrepancy function (MDF) test statistic is shown to have an asymptotic chi-squared distribution almost everywhere for a wide class of discrepancy functions. Asymptotic distribu...
متن کاملAsymptotic Optimality in Sampling-based Motion Planning
Although one of the fundamental problems in robotics, the motion planning problem is inherently hard from a computational point of view. In particular, the piano movers’ problem [1], [2] is known to be PSPACE-hard, which implies that any algorithm aimed to solve this problem (with completeness guarantees) is expected not to scale well with increasing number of dimensions of the configuration sp...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Annals of Statistics
سال: 1983
ISSN: 0090-5364
DOI: 10.1214/aos/1176346261