Gas turbine performance monitoring based on extended information fusion filter
Bibliographic record
Abstract
Performance monitoring is a critical issue for gas turbine engine for improving the operation safety and reducing the maintenance cost. With regard to this, variants of Kalman-filters-based state estimation have been employed to detect gas turbine performance, but the classical centralized Kalman filters are subject to heavy computational effort and poor fault tolerance. A novel nonlinear fusion filter algorithm using information description with distributed architecture is proposed and applied to gas turbine performance monitoring. This methodology is developed from federated Kalman filter, and a bank of local extended information filters and one information mixer are combined with extended information fusion filter. The local state estimates and covariance calculated in parallel by the local extended information filters are integrated in the information mixer to yield a global state estimate. The global state estimate of nonlinear system is fed back to the local filters with weighted factor for next iteration. The aim of the proposed methodology is to reduce the computational efforts of state estimation and improve robustness to sensor faults in cases of gas turbine performance monitoring. The simulation results on a turbofan engine confirm the extended information fusion filter's effective capabilities in comparison to the general central ones.
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.002 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 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.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 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".