The computation of average run length and average time to signal: an overview

Control charts are widely used in industries to monitor a process for quality improvement. Evaluation of the average run length (ARL) or average time to signal (ATS) plays an important role in the design of control charts and performance comparison. In this paper, we review several basic and popular procedures, including the Markov chain and integral equation methods for computing ARL, ATS and associated run length distributions for cumulative sum charts, exponentially weighted moving average charts and combined control charts, respectively. Some important references and key formulations are provided for practitioners.     

A comparison of multivariate signal discrimination techniques

This paper investigates several techniques to discriminate two multivariate stationary signals. The methods considered include Gaussian likelihood ratio tests for variance equality, a chi-squared time-domain test, and a spectral-based test. The latter two tests assess equality of the multivariate autocovariance function of the two signals over many different lags. The Gaussian likelihood ratio test is perhaps best viewed as principal component analyses (PCA) without dimension reduction aspects; it can be modified to consider covariance features other than variances via dimension augmentation tactics. A simulation study is constructed that shows how one can make inappropriate conclusions with PCA tests, even when dimension augmentation techniques are used to incorporate non-zero lag autocovariances into the analysis. The various discrimination methods are first discussed. A simulation study then illuminates the various properties of the methods. In this pursuit, calculations are needed to identify several multivariate time series models with specific autocovariance properties. To demonstrate the applicability of the methods, nine US and Canadian weather stations from three distinct regions are clustered. Here, the spectral clustering perfectly identified distinct regions, the chi-squared test performed marginally, and the PCA/likelihood ratio method did not perform well.     

Bootstrapping probability-proportional-to-size samples via calibrated empirical population

A collection of six novel bootstrap algorithms, applied to probability-proportional-to-size samples, is explored for variance estimation, confidence interval and p-value production. Developed according to bootstrap fundamentals such as the mimicking principle and the plug-in rule, these algorithms make use of an empirical bootstrap population informed by sampled units each with assigned weight. Starting from the natural choice of Horvitz–Thompson (HT)-type weights, improvements based on calibration to known population features are fostered. Focusing on the population total as the parameter to be estimated and on the distribution of the HT estimator as the target of bootstrap estimation, simulation results are presented with the twofold objective of checking practical implementation and of investigating the statistical properties of the bootstrap estimates supplied by the algorithms explored.     

Single and multiple error state-space models for signal extraction

We compare the results obtained by applying the same signal-extraction procedures to two observationally equivalent state-space forms. The first model has different errors affecting the states and the observations, while the second has a single perturbation term which coincides with the one-step-ahead forecast error. The signals extracted from both forms are very similar but their variances are drastically different, because the states for the single-source error representation collapse to exact values while those coming from the multiple-error model remain uncertain. The implications of this result are discussed both with theoretical arguments and practical examples. We find that single error representations have advantages to compute the likelihood or to adjust for seasonality, while multiple error models are better suited to extract a trend indicator. Building on this analysis, it is natural to adopt a ‘best of both worlds’ approach, which applies each representation to the task in which it has comparative advantage.     

A rational sequential probability ratio test control chart for monitoring process shifts in mean and variance

The sequential probability ratio test (SPRT) chart is a very effective tool for monitoring manufacturing processes. This paper proposes a rational SPRT chart to monitor both process mean and variance. This SPRT chart determines the sampling interval d based on the rational subgroup concept according to the process conditions and administrative considerations. Since the rational subgrouping is widely adopted in the design and implementation of control charts, the studies of the rational SPRT have a practical significance. The rational SPRT chart is designed optimally in order to minimize the index average extra quadratic loss for the best overall performance. A systematic performance study has also been conducted. From an overall viewpoint, the rational SPRT chart is more effective than the cumulative sum chart by more than 63%. Furthermore, this article provides a design table, which contains the optimal values of the parameters of the rational SPRT charts for different specifications. This will greatly facilitate the potential users to select an appropriate SPRT chart for their applications. The users can also justify the application of the rational SPRT chart according to the achievable enhancement in detection effectiveness.     

Confidence sets based on the positive part James–Stein estimator with the asymptotically constant coverage probability

The asymptotic expansions for the coverage probability of a confidence set centred at the James–Stein estimator presented in our previous publications show that this probability depends on the non-centrality parameter τ² (the sum of the squares of the means of normal distributions). In this paper we establish how these expansions can be used for a construction of confidence region with constant confidence level, which is asymptotically (the same formula for both case τ→0 and τ→∞) equal to some fixed value 1?α. We establish the shrinkage rate for the confidence region according to the growth of the dimension p and also the value of τ for which we observe quick decreasing of the coverage probability to the nominal level 1?α. When p→∞ this value of τ increases as O(p^1/4). The accuracy of the results obtained is shown by the Monte-Carlo statistical simulations.     

Comments on ‘Application of an adaptive design to a randomized phase II selection trial in gastric cancer: a report of the study design’ by Satoshi Morita and Junichi Sakamoto. Pharmaceutical Statistics

In this commentary, we show that the treatment selection probabilities in Morita and Sakamoto [1] could be different if safety information is considered. Copyright © 2012 John Wiley & Sons, Ltd.     

Step-up and step-down methods for testing multiple hypotheses in sequential experiments

Sequential methods are developed for testing multiple hypotheses, resulting in a statistical decision for each individual test and controlling the familywise error rate and the familywise power in the strong sense. Extending the ideas of step-up and step-down methods for multiple comparisons to sequential designs, the new techniques improve over the Bonferroni and closed testing methods proposed earlier by a substantial reduction of the expected sample size.     

Niveaudurchagangszeiten zur charakterisierung sequentieller schätzverfahren

Let θ be a parameter of a homogenous additive stochastic process. In order to get an unbiased and efficient estimator for a function h(v) one has often to use sequential procedures. In this paper we consider processes of the socalled exponential class. We study level crossing times, which characterize certain sequential estimations. It is shown that the family of level crossing times for an increasing sequence of levels is also a process of the exponential class. The density function of the one-dimensional probability distributions of this new process is given Examples and applications conclude the paper.     

Tail Probability of Low-Priority Queue Length in a Discrete-Time Priority BMAP/PH/1 Queue

ABSTRACT

We investigate the tail probability of the queue length of low-priority class for a discrete-time priority BMAP/PH/1 queue that consists of two priority classes, with BMAP (Batch Markovian Arrival Process) arrivals of high-priority class and MAP (Markovian Arrival Process) arrivals of low-priority class. A sufficient condition under which this tail probability has the asymptotically geometric property is derived. A method is designed to compute the asymptotic decay rate if the asymptotically geometric property holds. For the case when the BMAP for high-priority class is the superposition of a number of MAP's, though the parameter matrices representing the BMAP is huge in dimension, the sufficient condition is numerically easy to verify and the asymptotic decay rate can be computed efficiently.