Querying sensor networks: techniques, evaluation, and new directions
Bibliographic record
Abstract
Advances in sensor nodes hardware, which comprises sensors, embedded processors, and communication components, have made the large-scale deployment of sensor networks a reality. Various sensor network applications ranging from monitoring to military require sensor nodes to collect data over a continuous time period. The placement, management, and processing of the sensor data necessitates an effective data storage, management and query processing policy. This poster attempts to identify the key query processing techniques in the sensor networks. Design goals and challenges of the query processing techniques are identified. The techniques are evaluated in terms of efficiency, scalability, applicability, and reliability. The evaluation of the techniques is guided by the distinctive query processing features supported by both types of sensor networks, conventional and wide area. Moreover, we argued for the integration of conventional and wide area sensor networks and addressed the integration issues and design goals. In particular, a query processing architecture is proposed to meet the emerging needs of the sensor networks. The architecture addressed the requirements for different layers of the integrated sensor network components such as base stations, sensor nodes, and the workstations in wide area. Additionally, the future research directions for the query processing are outlined
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 imitationNot 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.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.026 | 0.033 |
| Meta-epidemiology (narrow) | 0.002 | 0.001 |
| Meta-epidemiology (broad) | 0.002 | 0.001 |
| Bibliometrics | 0.004 | 0.007 |
| Science and technology studies | 0.001 | 0.004 |
| Scholarly communication | 0.006 | 0.018 |
| Open science | 0.004 | 0.002 |
| Research integrity | 0.003 | 0.002 |
| Insufficient payload (model declined to judge) | 0.002 | 0.001 |
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.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
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".