MétaCan
Menu
Back to cohort
Record W2398906346 · doi:10.1155/2016/6308410

Quantization for Robust Distributed Coding

2016· article· en· W2398906346 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

VenueInternational Journal of Distributed Sensor Networks · 2016
Typearticle
Languageen
FieldComputer Science
TopicDistributed Sensor Networks and Detection Algorithms
Canadian institutionsUniversity of ReginaMcMaster University
Fundersnot available
KeywordsDistributed source codingComputer scienceSource codeRate distortionGaussianAlgorithmQuantization (signal processing)Coding (social sciences)Upper and lower boundsTheoretical computer scienceComputer engineeringVariable-length codeDecoding methodsMathematicsStatistics

Abstract

fetched live from OpenAlex

A distributed source coding approach is proposed for robust data communications in sensor networks. When sensor measurements are quantized, possible correlations between the measurements can be exploited to reduce the overall rate of communication required to report these measurements. Robust distributed source coding (RDSC) approaches differentiate themselves from other works in that the reconstruction error of all sources will not exceed a given upper bound, even if only a subset of the multiple descriptions of the distributed source code are received. We deal with practical aspects of RDSC in the context of scalar quantization of two correlated sources. As a benchmark to evaluate the performance of the proposed scheme, we derive theoretically achievable distortion-rate performances of an RDSC for two jointly Gaussian sources by applying known results on the classical multiple description source coding.

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

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.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.020
GPT teacher head0.256
Teacher spread0.236 · 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