MétaCan
Menu
Back to cohort
Record W4293902059 · doi:10.1109/lcn53696.2022.9843510

Limited Size Lossy Compression for WSNs

2022· article· en· W4293902059 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

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicDistributed Sensor Networks and Detection Algorithms
Canadian institutionsUniversity of Alberta
FundersAlberta Innovates
KeywordsLossy compressionWireless sensor networkComputer scienceData compressionLossless compressionWirelessPayload (computing)Compressed sensingReal-time computingVolume (thermodynamics)PiecewiseAlgorithmComputer networkMathematicsTelecommunicationsArtificial intelligenceNetwork packet

Abstract

fetched live from OpenAlex

We consider the problem of lossy compression of time series data collected by wireless sensor nodes, such that it produces a limited volume of compressed data for a given amount of raw data. The lossy compression is performed in a manner that minimizes the resulting L <inf xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">∞</inf> reconstruction error. Producing a bounded volume of compressed data is desirable in circumstances where we wish to know, or limit, the rate at which the compressed data are communicated, e.g., for periodic communication scheduling of fixed payload transmissions. The work is also geared to understanding the impact of, and accommodating for, storage limitations of Wireless Sensor Network (WSN) nodes. The proposed scheme belongs to the class of piecewise linear approximations (PLAs) and its performance is compared to other PLA schemes proposed for WSNs. The evaluation is carried out using existing public data sets.

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: Not applicable · Consensus signal: none
GenreCandidate signal: Methods · Consensus signal: none
Teacher disagreement score0.902
Threshold uncertainty score0.333

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.014
GPT teacher head0.233
Teacher spread0.219 · 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