MétaCan
Menu
Back to cohort
Record W2099901255 · doi:10.1109/tsp.2009.2016240

Incremental Distributed Identification of Markov Random Field Models in Wireless Sensor Networks

2009· article· en· W2099901255 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.
fundA Canadian funder is recorded on the work.

Bibliographic record

VenueIEEE Transactions on Signal Processing · 2009
Typearticle
Languageen
FieldComputer Science
TopicDistributed Sensor Networks and Detection Algorithms
Canadian institutionsUniversity of British Columbia
FundersWestern Canada Research Grid
KeywordsWireless sensor networkComputer scienceScalabilityIdentification (biology)Fusion centerMarkov processWireless networkMarkov chainSensor fusionWirelessField (mathematics)Distributed computingHidden Markov modelMarkov random fieldDistributed algorithmComputer networkArtificial intelligenceMachine learningTelecommunicationsMathematicsCognitive radio

Abstract

fetched live from OpenAlex

Wireless sensor networks (WSNs) comprise of highly power constrained nodes that observe a hidden natural field and reconstruct it at a distant data fusion center. Algorithmic strategies for extending the lifetime of such networks invariably require a knowledge of the statistical model of the underlying field. Since centralized model identification is communication intensive and eats into any potential power savings, we present a stochastic recursive identification algorithm which can be implemented in a fully distributed and scalable manner within the network. We demonstrate that it consumes modest resources relative to centralized estimation, and is stable, unbiased, and asymptotically efficient.

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: Empirical · Consensus signal: none
Teacher disagreement score0.986
Threshold uncertainty score0.726

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.001
Science and technology studies0.0000.000
Scholarly communication0.0000.001
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.013
GPT teacher head0.238
Teacher spread0.226 · 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