TL;DR: The authors define L-moments as the expectations of certain linear combinations of order statistics, which can be defined for any random variable whose mean exists and form the basis of a general theory which covers the summarization and description of theoretical probability distributions.
Abstract: L-moments are expectations of certain linear combinations of order statistics. They can be defined for any random variable whose mean exists and form the basis of a general theory which covers the summarization and description of theoretical probability distributions, the summarization and description of observed data samples, estimation of parameters and quantiles of probability distributions, and hypothesis tests for probability distributions. The theory involves such established procedures as the use of order statistics and Gini's mean difference statistic, and gives rise to some promising innovations such as the measures of skewness and kurtosis and new methods of parameter estimation
TL;DR: It is shown, numerically, that the value of the optimal c (the value of c that minimizes the interpolation error) depends on the number and distribution of data points, on the data vector, and on the precision of the computation.
Abstract: The accuracy of many schemes for interpolating scattered data with radial basis functions depends on a shape parameter c of the radial basis function. In this paper we study the effect of c on the quality of fit of the multiquadric, inverse multiquadric and Gaussian interpolants. We show, numerically, that the value of the optimal c (the value of c that minimizes the interpolation error) depends on the number and distribution of data points, on the data vector, and on the precision of the computation. We present an algorithm for selecting a good value for c that implicitly takes all the above considerations into account. The algorithm selects c by minimizing a cost function that imitates the error between the radial interpolant and the (unknown) function from which the data vector was sampled. The cost function is defined by taking some norm of the error vector E = (E 1, ... , EN)T where E k = Ek = fk - Sk xk) and S k is the interpolant to a reduced data set obtained by removing the point x k and the corresponding data value f k from the original data set. The cost function can be defined for any radial basis function and any dimension. We present the results of many numerical experiments involving interpolation of two dimensional data sets by the multiquadric, inverse multiquadric and Gaussian interpolants and we show that our algorithm consistently produces good values for the parameter c.
TL;DR: In this article, the applicability of the Weibull model to describe thermal inactivation of microbial vegetative cells as an alternative for the classical Bigelow model of first-order kinetics; spores are excluded in this article because of the complications arising due to the activation of dormant spores.
TL;DR: In this paper, a systematic procedure for constructing confidence bounds and point estimates based on rank statistics is given for the two sample location parameters, two sample scale parameter and one sample location parameter problems.
Abstract: Systematic procedures for constructing confidence bounds and point estimates based on rank statistics are given for the two sample location parameter, two sample scale parameter and one sample location parameter problems.
TL;DR: Extensions of this approach that can be applied in the setting of iterated approximate moving least squares approximation of function value data and for RBF pseudo-spectral methods for the solution of partial differential equations are discussed.
Abstract: Many radial basis function (RBF) methods contain a free shape parameter that plays an important role for the accuracy of the method. In most papers the authors end up choosing this shape parameter by trial and error or some other ad hoc means. The method of cross validation has long been used in the statistics literature, and the special case of leave-one-out cross validation forms the basis of the algorithm for choosing an optimal value of the shape parameter proposed by Rippa in the setting of scattered data interpolation with RBFs. We discuss extensions of this approach that can be applied in the setting of iterated approximate moving least squares approximation of function value data and for RBF pseudo-spectral methods for the solution of partial differential equations. The former method can be viewed as an efficient alternative to ridge regression or smoothing spline approximation, while the latter forms an extension of the classical polynomial pseudo-spectral approach. Numerical experiments illustrating the use of our algorithms are included.