Subsystem decomposition and distributed state estimation of nonlinear processes with implicit time‐scale multiplicity
Bibliographic record
Abstract
Abstract In this work, we propose a subsystem decomposition approach and a distributed estimation scheme for a class of implicit two‐time‐scale nonlinear systems. Taking the advantage of the time scale separation, these processes are decomposed into fast subsystem and slow subsystem according to the dynamics. In the proposed method, an approach that combines the approximate solutions obtained from both the fast and slow subsystems to form a composite solution of the original system is proposed. Also, based on the fast and slow subsystems, a distributed state estimation scheme is proposed to handle the implicit time‐scale multiplicity. In the proposed design, an extended Kalman filter (EKF) is designed for the fast subsystem and a moving horizon estimator (MHE) is designed for the slow subsystem. In the design, the slow subsystem is only required to send information to the fast subsystem one‐directionally. The fast subsystem estimator does not send out any information. The estimators use different sampling times, that is, fast sampling of the fast state variables is considered in the fast EKF and slow sampling of the slow state variables is considered in the slow MHE. Extensive simulations based on a chemical process are performed to illustrate the effectiveness and applicability of the proposed subsystem decomposition and composite estimation architecture.
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 distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 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 teacher head, 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".