MétaCan
Menu
Back to cohort
Record W2041005828 · doi:10.1109/icif.2007.4408154

Collaborative distributed data fusion architecture using multi-level Markov decision processes

2007· article· en· W2041005828 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
TopicTarget Tracking and Data Fusion in Sensor Networks
Canadian institutionsMcMaster University
Fundersnot available
KeywordsComputer scienceRedundancy (engineering)Sensor fusionMarkov decision processDistributed computingProcess (computing)Markov processDistributed databaseData miningArtificial intelligence

Abstract

fetched live from OpenAlex

Decentralized multisensor-multitarget tracking has numerous advantages over single-sensor or single-platform tracking. In this paper, we present a solution to one of the main problems of decentralized tracking, namely, distributed information transfer and fusion among the participating platforms. This paper presents a hierarchial multi-level decision mechanism for collaborative distributed data fusion that provides each platform with the required data for the fusion process while substantially reducing redundancy in the information flow in the overall system. We consider a distributed data fusion system consisting of platforms that are decentralized, heterogenous, and potentially unreliable. The proposed approach, which is based on hierarchial Markov decision processes and decentralized lookup substrate, will control the information exchange and data fusion process based, among the other parameters, on maximizing performance metrics of individual platforms, thereby enhancing the whole distributed system's reliability as well as that of each participating platform. Simulation examples demonstrate the operation and the performance results of the system.

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.001
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Other design · Consensus signal: none
GenreCandidate signal: Methods · Consensus signal: Methods
Teacher disagreement score0.950
Threshold uncertainty score0.750

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0010.001
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.002
Science and technology studies0.0000.000
Scholarly communication0.0000.001
Open science0.0020.002
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.062
GPT teacher head0.324
Teacher spread0.262 · 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