نتایج جستجو برای: average run length
تعداد نتایج: 756615 فیلتر نتایج به سال:
We consider a Markov control model in discrete time with countable both state space and action space. Using the value function of suitable long-run average reward problem, we study various reachability/controllability problems. First, characterize domain attraction escape set system, generalization called $p$-domain attracti...
I N STATISTICAL process control (SPC), one major concern is whether there has been a change of the distribution from the target in the process. To answer this question, we have to distinguish the variation due to real change of distribution (assignable causes) from that due to random error (chance causes). Many kinds of control charts serve this purpose. When there is no change and the process ...
The RTP Control Protocol (RTCP) is used in conjunction with the Realtime Transport Protocol (RTP) in order to provide a variety of shortterm and long-term reception statistics. The available reporting may include aggregate information across longer periods of time as well as individual packet reporting. This document specifies a per-packet report metric capturing individual packets discarded fr...
The EWMA chart for the standard deviation is a useful tool for monitoring the variability of a process quality characteristic. The performance of this chart is usually evaluated under the assumption of known parameters. However, in practice, process parameters are estimated from an in-control Phase I data set. A modified EWMA control chart is proposed for monitoring the standard deviation when ...
We report our progress in scaling deductive synthesis and repair of recursive functional Scala programs in the Leon tool. We describe new techniques, including a more precise mechanism for encoding the space of meaningful candidate programs. Our techniques increase the scope of synthesis by expanding the space of programs we can synthesize and by reducing the synthesis time in many cases. As a ...
Two strings x and y are said to be Abelian equivalent if x is a permutation of y, or vice versa. If a string z satisfies z = xy with x and y being Abelian equivalent, then z is said to be an Abelian square. If a string w can be factorized into a sequence v1, . . . , vs of strings such that v1, . . . , vs−1 are all Abelian equivalent and vs is a substring of a permutation of v1, then w is said t...
A repetitive sequence collection is one where portions of a base sequence of length n are repeated many times with small variations, forming a collection of total length N . Examples of such collections are version control data and genome sequences of individuals, where the differences can be expressed by lists of basic edit operations. This paper is devoted to studying ways to store massive se...
Gallager and Van Voorhis have found optimal prefix-free codes κ(K) for a random variable K that is geometrically distributed: Pr[K = k] = p(1 − p) for k ≥ 0. We determine the asymptotic behavior of the expected length Ex[#κ(K)] of these codes as p → 0: Ex[#κ(K)] = log2 1 p + log2 log 2 + 2 + f ( log2 1 p + log2 log 2 )
In this paper, an approach based on the U statistic is first proposed to eliminate the effect of between profile autocorrelation of error terms in Phase-II monitoring of general linear profiles. Then, a control chart based on the adjusted parameter estimates is designed to monitor the parameters of the model. The performance of the proposed method is compared with the ones of some existing meth...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید