Robust weighted <i>H</i><sub>∞</sub> filtering for networked systems with intermittent measurements of multiple sensors
Why this work is in the frame
A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.
Bibliographic record
Abstract
Abstract In this paper, we investigate the robust weighted H ∞ filtering problem for networked systems with intermittent measurements under the discrete‐time framework. Multiple outputs of the plant are measured by separate sensors, each of which has a specific failure rate. Network‐induced delay, packet dropouts and network‐induced disorder phenomena are all incorporated in the modeling of the network link. The resulting closed‐loop system involves both delayed noise and non‐delayed noise. In order to make full use of the delayed information, we define a weighted H ∞ performance index. Sufficient delay‐dependent and parameter‐dependent conditions for the existence of the filter and the solvability of the addressed problem are given via a set of linear matrix inequalities. Two simulation examples are presented to illustrate the relationship between the minimal performance level and the weighting factor, which show the effectiveness of the proposed method. Copyright © 2010 John Wiley & Sons, Ltd.
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.
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.001 | 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 it