MétaCan
Menu
Back to cohort
Record W2597102121 · doi:10.23977/iotea.2016.11005

Compressive Sensing Based Data Collection in Wireless Sensor Networks

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

venuePublished in a venue whose home country is Canada.
no affNo Canadian affiliation: this work is invisible to an affiliation-only frame.
No Canadian affiliation. An affiliation-only frame, the usual design, would never have seen this work. It is one of the works that make the case for inverting the frame.

Bibliographic record

VenueInternet of Things (IoT) and Engineering Applications · 2016
Typearticle
Languageen
FieldComputer Science
TopicEnergy Efficient Wireless Sensor Networks
Canadian institutionsnot available
FundersNatural Science Foundation of Gansu Province
KeywordsWireless sensor networkCompressed sensingComputer scienceData collectionDependency (UML)Kronecker productDomain (mathematical analysis)Kronecker deltaEfficient energy useConstruct (python library)WirelessTime domainReal-time computingData miningAlgorithmComputer networkArtificial intelligenceTelecommunicationsEngineeringComputer visionMathematicsStatistics

Abstract

fetched live from OpenAlex

In order to improve the energy efficiency by reducing the amount of the data delivered in Wireless Sensor Networks(WSNs), a Compressive Sensing(CS) based data collection scheme considering the correlation in temporal-spatial domain is studied in this paper. Kronecker product is applied to construct the sparse basis in the joint domain. The simulation results show that due to the huge amount of sensor nodes, by exploiting the dependency in spatial domain, the data number can be reduced distinctly. The high recovery accurancy can still be achieved.

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

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.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.011
GPT teacher head0.211
Teacher spread0.200 · 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