MétaCan
Menu
Back to cohort
Record W1582493312 · doi:10.1109/chicc.2015.7260361

Event-based state estimation of a discrete-state hidden Markov model through a reliable communication channel

2015· article· en· W1582493312 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

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicDistributed Sensor Networks and Detection Algorithms
Canadian institutionsUniversity of AlbertaUniversity of Calgary
Fundersnot available
KeywordsEvent (particle physics)Hidden Markov modelComputer scienceChannel (broadcasting)Lossy compressionState (computer science)Markov processMarkov modelMarkov chainSet (abstract data type)Probability distributionAlgorithmMathematicsArtificial intelligenceStatisticsMachine learningComputer network

Abstract

fetched live from OpenAlex

In this work, a state estimation problem is considered for a hidden Markov model subject to event-based sensor measurement updates sent through a reliable communication channel. The change of probability approach is utilized to consider the estimation problem, and an analytical expression for the probability distributions of the states conditioned on all the past hybrid point- and set-valued measurement information caused by the event-triggering scheme is obtained. Also, it is shown that the scenario with a lossy channel, but without the event-trigger, can be treated as a special case of the reliable channel results, and thus can be solved by applying the proposed results.

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.000
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: Simulation or modeling
GenreCandidate signal: Methods · Consensus signal: none
Teacher disagreement score0.660
Threshold uncertainty score0.496

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.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.001
Open science0.0010.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.025
GPT teacher head0.269
Teacher spread0.244 · 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