نتایج جستجو برای: production run length
تعداد نتایج: 998453 فیلتر نتایج به سال:
A natural multivariate extension of the two-sided cumulative sum chart is proposed via projection pursuit. A modification is given for improving its performance for the special situation in which the process mean is already shifted at the time the charting begins. Simulation studies show that the new charts have slightly better performance than the competing charts (MC1, MEWMA1 and MEWMA2) in t...
In this paper, we propose anO(min{mN,Mn}) time algorithm for finding a longest common subsequence of stringsX and Y with lengthsM andN , respectively, and run-length-encoded lengthsm and n, respectively. We propose a new recursive formula for finding a longest common subsequence of Y and X which is in the run-length-encoded format. That is, Y=y1y2 · · · yN andX=r1 1 r2 2 · · · rm m , where ri i...
The longest common subsequence (LCS) problem is a classic and well-studied problem in computer science with extensive applications in diverse areas ranging from spelling error corrections to molecular biology. This paper focuses on LCS for fixed alphabet size and fixed runlengths (i.e., maximum number of consecutive occurrences of the same symbol). We show that LCS is NP-complete even when rest...
Finding desired information from large data set is a difficult problem. Information retrieval is concerned with the structure, analysis, organization, storage, searching, and retrieval of information. Index is the main constituent of an IR system. Now a day exponential growth of information makes the index structure large enough affecting the IR system’s quality. So compressing the Index struct...
The standard max chart gives an out-of-control signal when the chart's statistic M exceeds the upper control limit UCL. The probability of M falling below the UCL is given as [3] 2 2 2) UCL (2 2 2) UCL (2 1 2 1 UCL UCL δ χ δ χ δ δ δ δ H H n n , where UCL > 0,) (⋅ Φ is the cumulative distribution function of a standard normal random variable,) (⋅ H is the cumulative distribution function of a ch...
A phase II nonparametric control chart based on precedence statistics with runs-type signaling rules
Nonparametric control charts do not require knowledge about the shape of the underlying distribution and can thus be attractive in certain situations. Two new Shewharttype nonparametric control charts are proposed for monitoring the unknown location parameter of a continuous population in Phase II (prospective) applications. The charts are based on control limits given by two specified order st...
The combination of Shewhart control charts and an exponentially weighted moving average (EWMA) control charts to simultaneously monitor shifts in the mean output of a production process has proven very effective in handling both small and large shifts. To improve the sensitivity of the control chart to detect off-target processes, we propose a combined Shewhart-EWMA (CSEWMA) control chart for m...
This paper develops Mean and Range control charts in fuzzy environment using different transformation methods. It is assumed that the observations of each sample are fuzzy random variables, which have triangular membership functions. After calculating fuzzy mean and fuzzy range of each sample using fuzzy arithmetic, their representative values are calculated exploiting the transformation method...
CT ED P RO O Abstract When stimulated, vasopressin neurones discharge lengthy, repeating bursts of action potentials. An increase in the stimulus strength causes both a lengthening of the bursts’ active phase and an increase in the intra-burst firing frequency. Here we extend our earlier model (P. Roper, J. Callaway, W. Armstrong. J. Neurosci. 24(20) (2004) 4831.) for phasic bursting at a const...
— We find two new hook length formulas for binary trees. The particularity of our formulas is that the hook length h v appears as an exponent. Consider the set B (n) of all binary trees with n vertices. It is well-known that the cardinality of B (n) is equal to the Catalan number (see, e.g., [9, p.220]): (1) T ∈B(n) 1 = 1 n + 1 2n n. For each vertex v of a binary tree T ∈ B (n) the hook length ...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید