Enhancing the Performance of CUSUM Schemes for Process Mean Monitoring: A Generalized Fast Initial Response Approach
Bibliographic record
Abstract
Control charts have gained increasing attention as a feedback process monitoring technique in recent times.Among them, CUSUM schemes have proven to be effective for monitoring processes with small or moderate sustained mean shifts.However, the detection ability of CUSUM schemes is often slow during the initial process setup due to the constant control limits.To address this limitation, the fast initial response (FIR) or headstart feature has been commonly employed to enhance the scheme's performance at process startup.Additionally, the dynamic nature of real-world challenges calls for a more sensitive CUSUM scheme capable of rapidly identifying small disturbances in a process.In this paper, we propose the utilization of a generalized FIR feature to improve the performance of CUSUM schemes for monitoring process means.By incorporating the generalized FIR feature, we enhance the control limits of the CUSUM scheme, thereby improving its sensitivity to smaller sustained shifts in a process.We assess the efficiency of the proposed system by comparing how well it performs against existing alternatives, using the average run length (ARL), median run length (MDRL), and standard deviation average run length (SDRL) measures.The ARL performance comparison results indicate that the suggested approach shows faster detection of small to moderate sustained alterations in a particular process.Therefore, this method is especially useful for monitoring processes that have observations collected at widely spaced time intervals, such as hourly, daily, or weekly measures, where it is believed that any changes over time will be minor or moderate.To validate the practical viability of our proposed scheme, we showcase its successful implementation in real-world scenarios, utilizing data sets acquired from a beverage bottling company and a petroleum refinery laboratory.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.002 | 0.007 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.001 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".