Real-Time Assessment and Diagnosis of Process Operating Performance
Bibliographic record
Abstract
Over time, the performance of processes may deviate from the initial design due to process variations and uncertainties, making it necessary to develop systematic methods for online optimality assessment based on routine operating process data. Some processes have multiple operating modes caused by the set point change of the critical process variables to achieve different product specifications. On the other hand, the operating region in each operating mode can alter, due to uncertainties. In this paper, we will establish an optimality assessment framework for processes that typically have multi-mode, multi-region operations, as well as transitions between different modes. The kernel density approach for mode detection is adopted and improved for operating mode detection. For online mode detection, the model-based clustering discriminant analysis (MclustDA) approach is incorporated with some a priori knowledge of the system. In addition, multi-modal behavior of steady-state modes is tackled utilizing the mixture probabilistic principal component regression (MPPCR) method, and dynamic principal component regression (DPCR) is used to investigate transitions between different modes. Moreover, a probabilistic causality detection method based on the sequential forward floating search (SFFS) method is introduced for diagnosing poor or non-optimum behavior. Finally, the proposed method is tested on the Tennessee Eastman (TE) benchmark simulation process in order to evaluate its performance.
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.001 | 0.004 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.002 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| 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".