A Decentralized Fuzzy Rule-Based Approach for Computing Topological Relations between Spatial Dynamic Continuous Phenomena with Vague Boundaries Using Sensor Data
Bibliographic record
Abstract
Sensor networks (SN) are increasingly used for the observation and monitoring of spatiotemporal phenomena and their dynamics such as pollution, noise and forest fires. In multisensory systems, a sensor node may be equipped with different sensing units to observe and detect several spatiotemporal phenomena at the same time. Simultaneous detection of different phenomena can be used to infer their spatial interactions over space and time. For this purpose, decentralized spatial computing approaches have shown their potential for effective reasoning on spatial phenomena within a sensor network. However, in most cases, spatial extents of continuous dynamic phenomena are uncertain, and their relations and interactions cannot be inferred by the existing approaches at the sensor node level. To address this limitation, in this paper, we propose and develop a decentralized fuzzy rule-based spatial reasoning approach to depict the spatial relations that hold between two evolving spatial phenomena with fuzzy boundaries. The proposed method benefits from a more adapted fuzzy-crisp representation of dynamic phenomena observed by SN where each vague phenomenon is composed of five distinguished zones including the kernel, conjecture and exterior zone and their boundaries. For each detected phenomenon, a sensor node will report one of these zones based on its location. Aggregation of the information reported from the sensor nodes allows reasoning on spatial relations between the observed phenomena and their evolution. Such spatial information provides users with more valuable near real-time information on the state of different phenomena that can be used for informed decision-making.
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.001 | 0.003 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.002 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| 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".