A Decentralized Semantic Reasoning Approach for the Detection and Representation of Continuous Spatial Dynamic Phenomena in Wireless Sensor Networks
Bibliographic record
Abstract
In this paper, we propose a decentralized semantic reasoning approach for modeling vague spatial objects from sensor network data describing vague shape phenomena, such as forest fire, air pollution, traffic noise, etc. This is a challenging problem as it necessitates appropriate aggregation of sensor data and their update with respect to the evolution of the state of the phenomena to be represented. Sensor data are generally poorly provided in terms of semantic information. Hence, the proposed approach starts with building a knowledge base integrating sensor and domain ontologies and then uses fuzzy rules to extract three-valued spatial qualitative information expressing the relative position of each sensor with respect to the monitored phenomenon’s extent. The observed phenomena are modeled using a fuzzy-crisp type spatial object made of a kernel and a conjecture part, which is a more realistic spatial representation for such vague shape environmental phenomena. The second step of our approach uses decentralized computing techniques to infer boundary detection and vertices for the kernel and conjecture parts of spatial objects using fuzzy IF-THEN rules. Finally, we present a case study for urban noise pollution monitoring by a sensor network, which is implemented in Netlogo to illustrate the validity of the proposed approach.
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.002 | 0.005 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| Meta-epidemiology (broad) | 0.001 | 0.002 |
| Bibliometrics | 0.002 | 0.002 |
| Science and technology studies | 0.001 | 0.002 |
| Scholarly communication | 0.002 | 0.004 |
| Open science | 0.002 | 0.002 |
| Research integrity | 0.001 | 0.002 |
| Insufficient payload (model declined to judge) | 0.001 | 0.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.
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".