MétaCan
Menu
Back to cohort
Record W2552268753 · doi:10.1049/iet-cta.2016.1108

State estimation via Markov switching‐channel network and application to suspension systems

2016· article· en· W2552268753 on OpenAlex

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

VenueIET Control Theory and Applications · 2016
Typearticle
Languageen
FieldEngineering
TopicFault Detection and Control Systems
Canadian institutionsUniversity of Alberta
FundersNational Natural Science Foundation of China
KeywordsControl theory (sociology)Markov chainSuspension (topology)State (computer science)Computer scienceMarkov processChannel (broadcasting)Control engineeringMathematicsEngineeringAlgorithmControl (management)Artificial intelligenceTelecommunications

Abstract

fetched live from OpenAlex

The problem of estimation for a class of networked non‐linear systems is investigated. A practical scenario with multiple switching communication channels coexisting in the network is considered. System signals are exchanged over the multiple communication channels and each channel is subject to the two main transmission imperfections, network‐induced time‐varying delays and packet dropouts. The channel switching is assumed to be governed by a continuous‐time Markov process, and a Markov jump non‐linear system model is exploited to represent the overall networked system. Linear estimators are designed such that the underlying estimation error system is stochastically stable and the disturbance rejection attenuation satisfies an performance bound. As a case study, a state estimation problem for an intelligent active suspension system is addressed to verify the theoretical findings.

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.001
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.987
Threshold uncertainty score0.514

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0010.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.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.003
GPT teacher head0.199
Teacher spread0.196 · 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