A Reputation-aware Mobile Crowd Sensing Scheme for Emergency Detection
Bibliographic record
Abstract
The unforeseen proliferation of smart devices has set in motion research efforts aimed at building Smart Cities (SCs) that improve the well-being of their citizens. One of the key technologies to achieve a SC is Mobile Crowd Sensing (MCS). In MCS, data is collected from the environment surrounding the smart device owners and utilized in the provision of a wide array of SC services. A prevalent class of services which is attracting increasing attention is smart emergency services, where MCS is leveraged to facilitate the detection and mitigation operations of crises. In this paper, we study the problem of an emergency situation detection based on MCS-provided data from heterogeneous participants. Specifically, we formulate our problem based on Detection Theory and underline its computational complexity. We present a greedy algorithm that aims to balance the trade-off between the decision time and the quality of the final decision. We perform extensive simulation experiments that show how our scheme improves the correct detection rate compared to a naive reputation-unaware baseline.
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.008 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.002 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.002 | 0.001 |
| Scholarly communication | 0.001 | 0.002 |
| Open science | 0.003 | 0.003 |
| Research integrity | 0.002 | 0.001 |
| Insufficient payload (model declined to judge) | 0.001 | 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".