Efficient and robust missing key tag identification for large-scale RFID systems
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.
Bibliographic record
Abstract
Radio Frequency Identification (RFID) technology has been widely used to identify missing items. In many applications, rapidly pinpointing key tags that are attached to favorable or valuable items is critical. To realize this goal, interference from ordinary tags should be avoided, while key tags should be efficiently verified. Despite many previous studies, how to rapidly and dynamically filter out ordinary tags when the ratio of ordinary tags changes has not been addressed. Moreover, how to efficiently verify missing key tags in groups rather than one by one has not been explored, especially with varying missing rates. In this paper, we propose an Efficient and Robust missing Key tag Identification (ERKI) protocol that consists of a filtering mechanism and a verification mechanism. Specifically, the filtering mechanism adopts the Bloom filter to quickly filter out ordinary tags and uses the labeling vector to optimize the Bloom filter's performance when the key tag ratio is high. Furthermore, the verification mechanism can dynamically verify key tags according to the missing rates, in which an appropriate number of key tags is mapped to a slot and verified at once. Moreover, we theoretically analyze the parameters of the ERKI protocol to minimize its execution time. Extensive numerical results show that ERKI can accelerate the execution time by more than 2.14× compared with state-of-the-art solutions.
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 imitationNot 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.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.001 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 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 it