A binomial CUSUM chart for detecting large shifts in fraction nonconforming

This article studies a unique feature of the binomial CUSUM chart in which the difference (d _t ?d ₀) is replaced by (d _t ?d ₀)² in the formulation of the cumulative sum C _t (where d _t and d ₀ are the actual and in-control numbers of nonconforming units, respectively, in a sample). Performance studies are reported and the results reveal that this new feature is able to increase the detection effectiveness when fraction nonconforming p becomes three to four times as large as the in-control value p ₀. The design of the new binomial CUSUM chart is presented along with the calculation of the in-control and out-of-control Average Run Lengths (ARL₀ and ARL₁).     

Conditional design of the EWMA median chart with estimated parameters

The exponentially weighted moving average (EWMA) chart is often designed assuming the process parameters are known. In practice, the parameters are rarely known and need to be estimated from Phase I samples. Different Phase I samples are used when practitioners construct their own control chart's limits, which leads to the “Phase I between-practitioners” variability in the in-control average run length (ARL) of control charts. The standard deviation of the ARL (SDARL) is a good alternative to quantify this variability in control charts. Based on the SDARL metric, the performance of the EWMA median chart with estimated parameters is investigated in this paper. Some recommendations are given based on the SDARL metric. The results show that the EWMA median chart requires a much larger amount of Phase I data in order to reduce the variation in the in-control ARL up to a reasonable level. Due to the limitation of the amount of the Phase I data, the suggested EWMA median chart is designed with the bootstrap method which provides a good balance between the in-control and out-of-control ARL values.     

An (s,k, S) fluid inventory model with exponential leadtimes and order cancellations

We consider a stochastic fluid inventory model based on a (s, k, S) policy. The content level W = {W(t): t ≥ 0} increases or decreases according to a fluid-flow rate modulated by an n-state continuous time Markov chain (CTMC). W starts at W(0) = S; whenever W(t) drops to level s, an order is placed to take the inventory back to level S, which the supplier will carry out after an exponential leadtime. However, if during the leadtime the content level reaches k, the order is suppressed. We obtain explicit formulas for the expected discounted costs. The derivations are based on the optional sampling theorem (OST) to the multidimensional martingale and on fluid flow techniques.     

Formulas for the Design of CUSUM Quality Control Charts

ABSTRACT

In the design of CUSUM control charts, it is common to use charts, tables, or software to find an appropriate critical threshold (h). This article provides an approximate formula to calculate the threshold directly from prespecified values of the reference value (k) and the in-control average run length (ARL₀). Formulas are also provided for choosing k and h from prespecified values of the in-control and out-of-control average run lengths.     

PIECEWISE POLYNOMIAL APPROXIMATIONS FOR HEAVY-TAILED DISTRIBUTIONS IN QUEUEING ANALYSIS

ABSTRACT

A basic difficulty in dealing with heavy-tailed distributions is that they may not have explicit Laplace transforms. This makes numerical methods that use the Laplace transform more challenging. This paper generalizes an existing method for approximating heavy-tailed distributions, for use in queueing analysis. The generalization involves fitting Chebyshev polynomials to a probability density function g(t) at specified points t ₁, t ₂, …, t _N . By choosing points t _i , which rapidly get far out in the tail, it is possible to capture the tail behavior with relatively few points, and to control the relative error in the approximation. We give numerical examples to evaluate the performance of the method in simple queueing problems.     

On the generalized t(GT) distribution

McDonald and Newey [J.B. McDonald and W.K. Newey, Partially adaptive estimation of regression models via the generalized t distribution, Econ. Theor. 4 (1988), pp. 428–457.] introduced the generalized t(GT) distribution. In this paper, several explicit formulas for its cumulative distribution function (cdf) are derived. These formulas will be useful for future developments in the theory and applications of the distribution. One such situation is explained and an application is provided to rainfall data from Orlando, Florida.     

Performance characteristics of the adjusted r2 algorithm for determining the start of the terminal disposition phase and comparison with a simple r2 algorithm and a visual inspection method

The adjusted r² algorithm is a popular automated method for selecting the start time of the terminal disposition phase (t_z) when conducting a noncompartmental pharmacokinetic data analysis. Using simulated data, the performance of the algorithm was assessed in relation to the ratio of the slopes of the preterminal and terminal disposition phases, the point of intercept of the terminal disposition phase with the preterminal disposition phase, the length of the terminal disposition phase captured in the concentration‐time profile, the number of data points present in the terminal disposition phase, and the level of variability in concentration measurement. The adjusted r² algorithm was unable to identify t_z accurately when there were more than three data points present in a profile's terminal disposition phase. The terminal disposition phase rate constant (λ_z) calculated based on the value of t_z selected by the algorithm had a positive bias in all simulation data conditions. Tolerable levels of bias (median bias less than 5%) were achieved under conditions of low measurement variability. When measurement variability was high, tolerable levels of bias were attained only when the terminal phase time span was 4 multiples of t_1/2 or longer. A comparison of the performance of the adjusted r² algorithm, a simple r² algorithm, and t_z selection by visual inspection was conducted using a subset of the simulation data. In the comparison, the simple r² algorithm performed as well as the adjusted r² algorithm and the visual inspection method outperformed both algorithms. Recommendations concerning the use of the various t_z selection methods are presented.     

A Markov Chain Copula Model for Credit Default Swaps with Bilateral Counterparty Risk

Reduced-form credit risk models are widely used in pricing and hedging credit derivatives. Generating default dependency is the key element in any such model. In this article, we use Markov copulae approach to model the dependence structure of defaults between the three obligors, one is the reference entity, another is the protection seller, the other is the protection buyer(the investor), so we can consider the bilateral counterparty risk of credit default swaps(CDS). In this Markov chain copula model, we obtain the explicit formulas of the CDS premium rates C ₁(T) (with unilateral counterparty risk) and C ₂(T) (with bilateral counterparty risk). And then we perform some numerical experiments to analyze the difference of the fair spreads between the unilateral case and the bilateral case.     

Run rules based phase II c and np charts when process parameters are unknown

Abstract

The performance of attributes control charts is usually evaluated under the assumption of known process parameters (i.e., the nominal proportion of non conforming units or the nominal average number of nonconformities). However, in practice, these process parameters are rarely known and have to be estimated from an in-control Phase I data set. The major contributions of this paper are (a) the derivation of the run length properties of the Run Rules Phase II c and np charts with estimated parameters, particularly focusing on the ARL, SDRL, and 0.05, 0.5, and 0.95 quantiles of the run length distribution; (b) the investigation of the number m of Phase I samples that is needed by these charts in order to obtain similar in-control ARLs to the known parameters case; and (c) the proposition of new specific chart parameters that allow these charts to have approximately the same in-control ARLs as the ones obtained in the known parameters case.     

On perturbations of Stein operator

In this article, we obtain a Stein operator for the sum of n independent random variables (rvs) which is shown as the perturbation of the negative binomial (NB) operator. Comparing the operator with NB operator, we derive the error bounds for total variation distance by matching parameters. Also, three-parameter approximation for such a sum is considered and is shown to improve the existing bounds in the literature. Finally, an application of our results to a function of waiting time for (k₁, k₂)-events is given.     

A very simple proof of the multivariate Chebyshev's inequality

Abstract

In this short note, a very simple proof of the Chebyshev's inequality for random vectors is given. This inequality provides a lower bound for the percentage of the population of an arbitrary random vector X with finite mean μ = E(X) and a positive definite covariance matrix V = Cov(X) whose Mahalanobis distance with respect to V to the mean μ is less than a fixed value. The main advantage of the proof is that it is a simple exercise for a first year probability course. An alternative proof based on principal components is also provided. This proof can be used to study the case of a singular covariance matrix V.     

A direct procedure for monitoring the coefficient of variation using a variable sample size scheme

A variable sample size (VSS) scheme directly monitoring the coefficient of variation (CV), instead of monitoring the transformed statistics, is proposed. Optimal chart parameters are computed based on two criteria: (i) minimizing the out-of-control ARL (ARL₁) and (ii) minimizing the out-of-control ASS (ASS₁). Then the performances are compared between these two criteria. The advantages of the proposed chart over the VSS chart based on the transformed statistics in the existing literature are: the former (i) provides an easier alternative as no transformation is involved and (ii) requires less number of observations to detect a shift when ASS₁ is minimized.     

Generalized Least Squares Model Averaging

In this article, we propose a method of averaging generalized least squares estimators for linear regression models with heteroskedastic errors. The averaging weights are chosen to minimize Mallows’ C_p-like criterion. We show that the weight vector selected by our method is optimal. It is also shown that this optimality holds even when the variances of the error terms are estimated and the feasible generalized least squares estimators are averaged. The variances can be estimated parametrically or nonparametrically. Monte Carlo simulation results are encouraging. An empirical example illustrates that the proposed method is useful for predicting a measure of firms’ performance.     

Bivariate copulas on the Hotelling's T2 control chart

In this paper, we propose five types of copulas on the Hotelling's T² control chart when observations are from exponential distribution and use the Monte Carlo simulation to compare the performance of the control chart, which is based on the Average Run Length (ARL) for each copula. Five types of copulas function for specifying dependence between random variables are used and measured by Kendall's tau. The results show that the copula approach can be fitted the observation and we can use copula as an option for application on Hotelling's T² control chart.     

Robustness of R-Chart to Non Normality

This study addresses the appropriate d ₃ values for constructing range control charts (R-charts) when the distributions of the processes are the uniform, triangular, exponential, and Erlang. Comparisons of the range charts are based on Type I error probabilities obtained using simulations. The results reveal that inappropriate use of the d ₃ values strongly affected the performance of the R-charts. Practitioners should be more careful in selecting suitable coefficients when using R-charts methods to process data. The distribution of the processes must be examined before the coefficients are chosen.     

The ARL of modified Shewhart control charts for conditionally heteroskedastic models

In this article we consider the modified Shewhart control chart for ARCH processes and introduce it for threshold ARCH (TARCH) ones. For both charts, we determine bounds for the distribution of the in-control run length (RL) and, consequently, for its average (ARL), both depending only on the distribution of the generating white noise, the model parameters and the critical value. For the ARCH model, we compare our bounds with others available in literature and show how they improve the existing ones. We present a simulation study to assess the quality of the bounds calculated for the ARL.     

Constrained Maximization of the Shapiro–Wilk W Statistic to Estimate Parameters of the Johnson S B Distribution

This article presents a constrained maximization of the Shapiro Wilk W statistic for estimating parameters of the Johnson S _B distribution. The gradient of the W statistic with respect to the minimum and range parameters is used within a quasi-Newton framework to achieve a fit for all four parameters. The method is evaluated with measures of bias and precision using pseudo-random samples from three different S _B populations. The population means were estimated with an average relative bias of less than 0.1% and the population standard deviations with less than 4.0% relative bias. The methodology appears promising as a tool for fitting this sometimes difficult distribution.     

Geometric ergodicity of nonlinear autoregressive models with changing conditional variances

The authors give easy‐to‐check sufficient conditions for the geometric ergodicity and the finiteness of the moments of a random process x_t = ?(x_t‐1,…, x_t‐p) + ?_tσ(x_t‐1,…, x_t‐q) in which ?: R^p → R, σ R^q → R and (?_t) is a sequence of independent and identically distributed random variables. They deduce strong mixing properties for this class of nonlinear autoregressive models with changing conditional variances which includes, among others, the ARCH(p), the AR(p)‐ARCH(p), and the double‐threshold autoregressive models.     

Weighted L1-estimates for the First-order Bifurcating Autoregressive Model

We developed robust estimators that minimize a weighted L₁ norm for the first-order bifurcating autoregressive model. When all of the weights are fixed, our estimate is an L₁ estimate that is robust against outlying points in the response space and more efficient than the least squares estimate for heavy-tailed error distributions. When the weights are random and depend on the points in the factor space, the weighted L₁ estimate is robust against outlying points in the factor space. Simulated and artificial examples are presented. The behavior of the proposed estimate is modeled through a Monte Carlo study.