Tests for multiple upper or lower outliers in an exponential sample

SUMMARY T = \[x + ... + x ]/ Sigma x (T*= \[x + ... + x ] Sigma x ) is the max k (n- k+ 1 ) (n) i k ( 1 ) (k) i imum likelihood ratio test statistic for k upper ( lower ) outliers in an exponential sample x , ..., x . The null distributions of T for k= 1,2 were given by Fisher and by Kimber 1 n k and Stevens , while those of T*(k= 1,2) were given by Lewis and Fieller . In this paper , k the simple null distributions of T and T* are found for all possible values of k, and k k percentage points are tabulated for k= 1, 2, ..., 8. In addition , we find a way of determining k, which can reduce the masking or ' swamping ' effects .     

Simulated Likelihood Approximations for Stochastic Volatility Models

Abstract. This paper deals with parametric inference for continuous-time stochastic volatility models observed at discrete points in time. We consider approximate maximum likelihood estimation: for the k th-order approximation, we pretend that the observations form a k th-order Markov chain, find the corresponding approximate log-likelihood function, and maximize it with respect to θ . The approximate log-likelihood function is not known analytically, but can easily be calculated by simulation. For each k , the method yields consistent and asymptotically normal estimators. Simulations from a model based on the Cox–Ingersoll–Ross model are used for illustration.     

Finding maximum G-criterion values for central composite designs on the hypercube

For quadratic regression on the hypercube, G—efficiencies are often used in the selection process of an experimental design. To calculate a design's G—efficiency, it is necessary to maximize the prediction variance over the experimental design region. However, it is common to approximate a G—efficiency. This is achieved by calculating the prediction variances generated from a subset of points in the design space and taking the maximum to estimate the maximum prediction variance. This estimate is then applied to approximate the G—efficiency. In this paper, it will be shown that over the class of central composite designs (CCDs) on the hypercube. the prediction variance can be expressed in a closed-form. An exact value of the maximum prediction variance can then be determined by evaluating this closed-form expression over a finite subset of barycentric points. Tables of exact G—efficiencies will be presented. Design optimality criteria, quadratic regression on the hypercube, and the structures of the design matrix X, X'X, and (X'X)^?1 for any CCD will be discussed.     

Multiplicative algorithms for computing optimum designs

We study a new approach to determine optimal designs, exact or approximate, both for the uncorrelated case and when the responses may be correlated. A simple version of this method is based on transforming design points on a finite interval to proportions of the interval. Methods for determining optimal design weights can therefore be used to determine optimal values of these proportions. We explore the potential of this method in a range of examples encompassing linear and non-linear models, some assuming a correlation structure and some with more than one design variable.     

Comparing several experimental groups with a control in the multivariate case

This paper presents a multivariate extension of Dunnett's test for comparing simultaneously k treatment group means with a single control group mean. A test based on Hotelling T²statistics is presented and approximate critical values are evaluated for the case of equal numbers of observations in each group, for the .05 and .01 levels of significance, for 1 to 5 variates, for 1 to 10 treatment groups, and for varying degrees of freedom. The accuracy of the procedure for generating approximate critical values is assessed via simulation studies conducted for selected cases and an example is presented using real data.     

Reliability estimation based on ranked set sampling

In this paper we consider the problem of estimating the reliability of an exponential component based on a Ranked Set Sample (RSS) of size n. Given the first r observations of that sample, 1≤r≤n, we construct an unbiased estimator for this reliability and we show that these n unbiased estimators are the only ones in a certain class of estimators. The variances of some of these estimators are compared. By viewing the observations of the RSS of size n as the lifetimes of n independent k-out-of-n systems, 1≤k≤n, we are able to utilize known properties of these systems in conjunction with the powerful tools of majorization and Schur functions to derive our results.     

NESTING OPTIMAL MAIN EFFECTS PLANS AND OPTIMAL FOLDOVER DESIGNS

ABSTRACT

Optimal main effects plans (MEPs) and optimal foldover designs can often be performed as a series of nested optimal designs. Then, if the experiment cannot be completed due to time or budget constraints, the fraction already performed may still be an optimal design. We show that the optimal MEP for 4t factors in 4t + 4 points does not contain the optimal MEP for 4t factors in 4t + 2 points nested within it. In general, the optimal MEP for 4t factors in 4t + 4 points does not contain the optimal MEPs for 4t factors in 4t + 1, 4t + 2, or 4t + 3 points and the optimal MEP for 4t + 1 factors in 4t + 4 points does not contain the optimal MEPs for 4t + 1 factors in 4t + 2 or 4t + 3 points. We also show that the runs in an orthogonal design for 4t factors in 4t + 4 points, and the optimal foldover designs obtained by folding, should be performed in a certain sequence in order to avoid the possibility of a singular X'X matrix.     

Marginally oversaturated designs

A special class of supersaturated design, called marginally over saturated design (MOSD), in which the number of variables under investigation (k) is only slightly larger than the number of experimental runs (n), is presented. Several optimality criteria for supersaturated designs are discussed. It is shown that the resolution rank criterion is most appropriate for screening situations. The construction method builds on two major theorems which provide an efficient way to evaluate resolution rank. Examples are given for the cases n=8, 12, 16, and 20. Potential extensions for future work are discussed.     

Extensions of D-optimal minimal designs for symmetric mixture models

The purpose of mixture experiments is to explore the optimum blends of mixture components, which will provide the desirable response characteristics in finished products. D-optimal minimal designs have been considered for a variety of mixture models, including Scheffé's linear, quadratic, and cubic models. Usually, these D-optimal designs are minimally supported since they have just as many design points as the number of parameters. Thus, they lack the degrees of freedom to perform the lack-of-fit (LOF) tests. Also, the majority of the design points in D-optimal minimal designs are on the boundary: vertices, edges, or faces of the design simplex. In this article, extensions of the D-optimal minimal designs are developed for a general mixture model to allow additional interior points in the design space to enable prediction of the entire response surface. Also a new strategy for adding multiple interior points for symmetric mixture models is proposed. We compare the proposed designs with Cornell (1986 Cornell, J.A. (1986). A comparison between two ten-point designs for studying three-component mixture systems. J. Qual. Technol. 18(1):1–15.[Taylor &; Francis Online], [Web of Science ®] , [Google Scholar]) two 10-point designs for the LOF test by simulations.     

Information in an observation in robust designs

We consider the Information contained 1n each observation in a given design robust with respect to the estlmability of parameters and against the unavailability of observations. We compare the observations in various 1-, 2- and 3- dimensional designs on the basis of their informations.     

Extended tables of the distribution of friedman’ s s-statistic in the two-way layout

Friedman’s (1937, 1940) S-statistic is designed to test the hypothesis that there is no treatment effect in a randomized-block design with k treatments and n blocks. In this paper we give tables of the null distribution of S for k = 5, n = 6(1)8, and for k = 6, n = 2(1)6. Computational details are discussed.     

Minimum Cost Linear Trend Free 2n-(n-k) Designs of Resolution IV

This article extends the resolution of time trend free designs for sequential 2^n-p experiments from III into IV and minimizes the number of factor level changes between runs (i.e., cost) by constructing a catalog of (2^k?2 ?1) minimum cost linear trend free resolution IV 2^n?(n?k) designs (2^k?2 ≤ n ≤ 2^k?1?2) from the full 2^k factorial experiment using the interactions-main effects assignment technique. Each systematic 2^n?(n?k) design in the catalog is economic in minimum number of factor level changes and allows for the estimation of all n main effects unbiased by either the linear time trend (which may be present in the 2^n?(n?k) sequentially generated responses) or the non negligible two-factor interactions. This article provides for each 2^n?(n?k) design: (1) the defining relation or the alias structure; (2) the k independent generators for sequencing the 2^n?(n?k) runs by the generalized foldover scheme; and (3) the minimum cost represented by the total number of factor level changes between the 2^n?(n?k) runs. All k main effects of the 2^k experiment are excluded from the selection assignment process due to their nonlinear time trend resistance as well as excluding a total of (2^k?1 –k +1) interactions violating the resolution IV requirement.     

Estimation for Discretely Observed Small Diffusions Based on Approximate Martingale Estimating Functions

Abstract.  We consider an asymptotically efficient estimator of the drift parameter for a multi-dimensional diffusion process with small dispersion parameter ɛ . In the situation where the sample path is observed at equidistant times k / n , k  = 0, 1, …,  n , we study asymptotic properties of an M -estimator derived from an approximate martingale estimating function as ɛ tends to 0 and n tends to ∞ simultaneously.     

On Exact K-optimal Designs Minimizing the Condition Number

A new design criterion based on the condition number of an information matrix is proposed to construct optimal designs for linear models, and the resulting designs are called K-optimal designs. The relationship between exact and asymptotic K-optimal designs is derived. Since it is usually hard to find exact optimal designs analytically, we apply a simulated annealing algorithm to compute K-optimal design points on continuous design spaces. Specific issues are addressed to make the algorithm effective. Through exact designs, we can examine some properties of the K-optimal designs such as symmetry and the number of support points. Examples and results are given for polynomial regression models and linear models for fractional factorial experiments. In addition, K-optimal designs are compared with A-optimal and D-optimal designs for polynomial regression models, showing that K-optimal designs are quite similar to A-optimal designs.     

Penalized optimal designs for dose-finding

Optimal design under a cost constraint is considered, with a scalar coefficient setting the compromise between information and cost. It is shown that for suitable cost functions, by increasing the value of the coefficient one can force the support points of an optimal design measure to concentrate around points of minimum cost. An example of adaptive design in a dose-finding problem with a bivariate binary model is presented, showing the effectiveness of the approach.     

Applications and Implementations of Continuous Robust Designs

In the literature concerning the construction of robust optimal designs, many resulting designs turn out to have densities. In practice, an exact design should tell the experimenter what the support points are and how many subjects should be allocated to each of these points. In particular, we consider a practical situation in which the number of support points allowed is constrained. We discuss an intuitive approach, which motivates a new implementation scheme that minimizes the loss function based on the Kolmogorov and Smirnov distance between an exact design and the optimal design having a density. We present three examples to illustrate the application and implementation of a robust design constructed: one for a nonlinear dose-response experiment and the other two for general linear regression. Additionally, we perform some simulation studies to compare the efficiencies of the exact designs obtained by our optimal implementation with those by other commonly used implementation methods.     

Local asymptotic normality of intermediate and central order statistics

Consider n independent random variables Z_i,…, Z_n on R with common distribution function F, whose upper tail belongs to a parametric family F(t) = F_θ(t),t ≥ x₀, where θ ∈ ? ? R ^d. A necessary and sufficient condition for the family F_θ, θ ∈ ?, is established such that the k-th largest order statistic Z_n?k+1:n alone constitutes the central sequence yielding local asymptotic normality ( LAN ) of the loglikelihood ratio of the vector (Z_n?i+1:n)¹ _i=kof the k largest order statistics. This is achieved for k = k(n)→_n→∞∞ with k/n→_n→∞ 0.

In the case of vectors of central order statistics ( Z_r:n, Z_r+1:n,…, Z_s:n ), with r/n and s/n both converging to q ∈ ( 0,1 ), it turns out that under fairly general conditions any order statistic Z_m:n with r ≤ m ≤s builds the central sequence in a pertaining LAN expansion.These results lead to asymptotically optimal tests and estimators of the underlying parameter, which depend on single order statistics only     

Some reliability properties of order statistics

Let X_i:j denote the i^th order statistic of a random sample of size j from a continuous life distribution. We show that if X_k:n, is IFR, IFRA, NBU, or DMRL, so are X_k+1:n, X_k+1:n?1 and X_k+1:n+1. Further we show that, in the first three cases, X_k+1:n+2 also shares the corresponding property if k ≤ (n+3)/2. We also present dual results for DFR, DFRA and NWU classes.     

Some remarks about the gasser-sroka-jennen-steinmetz variance estimator

This article proposes some simplifications of the residual variance estimator of Gasset, Sroka, and Jeneen-Steinmetz (GSJ, 1986) which is often used in conjunction with non parametric regression. The GSJ estimator is a quadratic form of the data, which depends on the relative spacings of the design points. When the errors are independent, identically distributed Gaussian variables, and the true regression curve is flat, the estimate is distributed as a weighted sum of x² variables. By matching the first two moments, the distribution can be approximated by a x² with degrees of freedom determined by the coefficients of the. quadratic form. Computation of the estimated degrees of freedom requires computing the trace of the square of an n x n matrix, where n is the number of design points. In this article, (n-2)/3 is shown to be a conservative estimate of the approximate degrees of freedom, and (n-2)/2 is shown to be conservative for many designs. In addition, a simplified version of the estimator is shown to be asymptotically equivalent, under many conditions.     

Computing location depth and regression depth in higher dimensions

The location depth (Tukey 1975) of a point relative to a p-dimensional data set Z of size n is defined as the smallest number of data points in a closed halfspace with boundary through . For bivariate data, it can be computed in O(nlogn) time (Rousseeuw and Ruts 1996). In this paper we construct an exact algorithm to compute the location depth in three dimensions in O(n2logn) time. We also give an approximate algorithm to compute the location depth in p dimensions in O(mp3+mpn) time, where m is the number of p-subsets used.Recently, Rousseeuw and Hubert (1996) defined the depth of a regression fit. The depth of a hyperplane with coefficients (1,...,p) is the smallest number of residuals that need to change sign to make (1,...,p) a nonfit. For bivariate data (p=2) this depth can be computed in O(nlogn) time as well. We construct an algorithm to compute the regression depth of a plane relative to a three-dimensional data set in O(n2logn) time, and another that deals with p=4 in O(n3logn) time. For data sets with large n and/or p we propose an approximate algorithm that computes the depth of a regression fit in O(mp3+mpn+mnlogn) time. For all of these algorithms, actual implementations are made available.