MétaCan
Menu
Back to cohort
Record W1999421133 · doi:10.1115/1.4024606

H ∞ SwitchedFiltering for Networked Systems Based on Delay Occurrence Probabilities1

2013· article· en· W1999421133 on OpenAlex
Hui Zhang, Yang Shi, Mingxi Liu

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.

affAt least one author lists a Canadian institution in the pinned OpenAlex snapshot.

Bibliographic record

VenueJournal of Dynamic Systems Measurement and Control · 2013
Typearticle
Languageen
FieldEngineering
TopicStability and Control of Uncertain Systems
Canadian institutionsUniversity of Victoria
Fundersnot available
KeywordsNode (physics)EstimatorComputer scienceSet (abstract data type)Filter (signal processing)State (computer science)Control theory (sociology)Network delayReal-time computingAlgorithmMathematicsEngineeringComputer networkArtificial intelligenceStatistics

Abstract

fetched live from OpenAlex

Abstract This paper considers the state estimation problem for discrete-time systems in a network environment. Specifically, the network-induced delay from the sensor node to the estimator node is modeled as a finite set of delays with corresponding occurrence probabilities. The design of H∞ switched filters is proposed. The switching is performed according to the detected time delay. The occurrence probability of the delay is incorporated into the filter design, which can improve the filtering performance. Simulation studies and comparisons illustrate the effectiveness and the improvement of the proposed design method.

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 imitation

Not 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.

metaresearch head score (Codex)0.002
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesMeta-epidemiology (narrow)
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: Simulation or modeling
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.833
Threshold uncertainty score1.000

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0020.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0010.000
Bibliometrics0.0000.000
Science and technology studies0.0000.000
Scholarly communication0.0000.000
Open science0.0000.000
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0000.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.

Opus teacher head0.015
GPT teacher head0.193
Teacher spread0.178 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it