MétaCan
Menu
Back to cohort
Record W2122304282 · doi:10.1109/icde.2005.186

An Analysis of Spatio-Temporal Query Processing in Sensor Networks

2005· article· en· W2122304282 on OpenAlexaff
Alexandru Coman, Jörg Sander, Mário A. Nascimento

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicEnergy Efficient Wireless Sensor Networks
Canadian institutionsUniversity of Alberta
Fundersnot available
KeywordsComputer scienceWireless sensor networkEfficient energy useDistributed computingData miningComputer network

Abstract

fetched live from OpenAlex

Sensor networks are an emerging technology that provide new means to monitor and understand various phenomena. Nodes in a sensor network typically have a limited power supply, thus energy-efficient processing of the queries over the network is a critical issue. We propose analytical models to evaluate the performance of three methods for processing historical spatio-temporal queries in sensor networks. The models allow us to better understand the tradeoffs of the investigated methods, as well as to recommend the most energy efficient one at query time.

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.

How this classification was reachedexpand

Full frame machine prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.

metaresearch head score (Codex)0.005
metaresearch head score (Gemma)0.025
Version: metacan-v3-hybrid-931329e0061cValidation 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: Empirical · Consensus signal: none
Teacher disagreement score0.008
Threshold uncertainty score0.026

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0050.025
Meta-epidemiology (narrow)0.0010.001
Meta-epidemiology (broad)0.0010.001
Bibliometrics0.0020.002
Science and technology studies0.0010.002
Scholarly communication0.0020.004
Open science0.0030.001
Research integrity0.0020.001
Insufficient payload (model declined to judge)0.0020.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.248
Teacher spread0.238 · 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

Classification

machine, unvalidated

Machine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designSimulation or modeling
Domainnot available
GenreEmpirical

How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".

Quick stats

Citations39
Published2005
Admission routes1
Has abstractyes

Explore more

Same topicEnergy Efficient Wireless Sensor NetworksFrench-language works237,207