There are some experiences that researcher come across quite number of time for very large networks in the initial samples such that they cannot finish the sampling procedure. Two solutions have been proposed and used by marine biologists which we discuss in this article: i) Adaptive cluster sampling based on order statistics with a stopping rule, ii) Restricted adaptive cluster sampling. Until...

The joint Laplace transform of the two sided boundary crossing stopping rule is known for negative exponential model only under certain conditions. In this paper we eliminate need such Our results also apply to problem geometric models. We further illustrate how can be used obtain distribution multidimensional rules memoryless

Previous work on sample design has been focused on constructing designs for samples taken at point locations. Significantly less work has been done on sample design for data collected along transects. A review of approaches to point and transect sampling design shows that transects can be considered as a sequential set of point samples. Any two sampling designs can be compared through using eac...

This paper discusses a perception-based theory for a multi-variate stopping problem with a monotone rule by Yasuda et al. (1982). The problem is developed by using the perceptive analysis of the previous work(Kurano et al. (2004)). We will show a recursive equation which determines the perceptive value of its equilibrium point for the model.

In this paper resolvent estimates for Abel integral operators are provided. These estimates are applied to deduce regularizing properties of Lavrentiev's m-times iterated method as well as iterative schemes ? with the discrepancy principle as corresponding parameter choice or stopping rule, respectively for solving the corresponding Abel integral equations of the rst kind.

We examine a sequential selection problem in which a single option must be selected. Each option’s value is a function of its attributes, whose precise values can only be ascertained at a given cost. We prove the optimality of a threshold stopping rule for a general class of objective functions.

| In this paper, we consider robust inversion of linear operators with convex constraints. We present an iteration that converges to the minimum norm least squares solution; a stopping rule is shown to regularize the constrained inversion. A constrained Laplace inversion is computed to illustrate the proposed algorithm.

We exploit the even and odd spectrum of real symmetric Toeplitz matrices for the computation of their extreme eigenvalues, which are obtained as the solutions of spectral, or secular, equations. We also present a concise convergence analysis for a method to solve these spectral equations, along with an efficient stopping rule, an error analysis, and extensive numerical results.

Objective priors for sequential experiments are considered. Common priors, such as the Jeffreys prior and the reference prior, will typically depend on the stopping rule used for the sequential experiment. New expressions for reference priors are obtained in various contexts, and computational issues involving such priors are considered.