MétaCan
Menu
Back to cohort
Record W4200291572 · doi:10.1109/mass52906.2021.00019

Entropic Sensing for Energy Efficiency

2021· article· en· W4200291572 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 institutionsQueen's University
Fundersnot available
KeywordsComputer scienceWireless sensor networkEnergy consumptionEntropy (arrow of time)Real-time computingEfficient energy useWirelessEnergy (signal processing)AlgorithmMathematicsStatisticsTelecommunicationsComputer networkElectrical engineeringEngineering

Abstract

fetched live from OpenAlex

We present a novel energy-efficient approach to wireless real-time sensing. For a sensor node (SN) transmitting samples of a discrete time series in real-time, its lifetime depends largely on its battery capacity. With most of the energy consumed in wireless transmission, we present an energy efficient scheme that can significantly reduce the number of transmitted samples, while maintaining a low mean absolute error between the original and the recovered signals. We introduce the concept of instantaneous entropy and we derive a computationally efficient iterative formula for computing Shannon’s entropy. The SN evaluates the information content in each sample and decide whether to transmit or omit the sample. At the sink, we use incremental machine learning to recover the omitted samples in real-time. Our approach showed an average of 60% reduction in energy consumption by the SN with less than 2% mean absolute error in the recovered signal.

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: none
GenreCandidate signal: Methods · Consensus signal: none
Teacher disagreement score0.805
Threshold uncertainty score0.231

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.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.010
GPT teacher head0.217
Teacher spread0.207 · 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