MétaCan
Menu
Back to cohort
Record W2619603874 · doi:10.1109/jiot.2017.2708719

Beacon Deployment for Unambiguous Positioning

2017· article· en· W2619603874 on OpenAlex

Why this work is in the frame

A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.

affAt least one author lists a Canadian institution in the pinned OpenAlex snapshot.

Bibliographic record

VenueIEEE Internet of Things Journal · 2017
Typearticle
Languageen
FieldEngineering
TopicIndoor and Outdoor Localization Technologies
Canadian institutionsUniversity of Waterloo
Fundersnot available
KeywordsBeaconComputer scienceSoftware deploymentBluetooth Low EnergyBluetoothInteger (computer science)Integer programmingReal-time computingMobile deviceCloud computingComputer networkAlgorithmWirelessTelecommunications

Abstract

fetched live from OpenAlex

Instant and precise localization of a mobile user is fundamental for supporting various sophisticated indoor location-aware services. This paper focuses on achieving unambiguous user positioning using practical Bluetooth low energy (BLE) beacons with multiple discrete power levels. By receiving the beacon coverage status from a user's device, the cloud server can unambiguously pinpoint the user's location and react correspondingly. We first define the problem of beacon deployment for positioning (BDP) and provide several theoretic bounds on the number of required beacons to gain sufficient understanding on its performance behavior. The BDP problem is further formulated into an integer linear program (ILP) and solved in extensive case studies. We claim that this is the first systematic and in-depth research on beacon deployment for unambiguous user positioning. Our analysis and experiments show that the proposed solution takes O(√N) to O(N/2) beacons for N test positions, which is 2-8 times less beacons compared to that by the naive approach, while the analytical bounds are tight with the ILP results with 20% of gap.

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.

Full frame distilled prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.

metaresearch head score (Codex)0.000
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Bench or experimental · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.617
Threshold uncertainty score0.349

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.000
Science and technology studies0.0000.000
Scholarly communication0.0000.000
Open science0.0000.000
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0000.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.016
GPT teacher head0.254
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