Probabilistic Analysis and Correction of Chen's Tag Estimate Method
Bibliographic record
Abstract
Radio frequency identification (RFID) is a ubiquitous wireless technology which allows objects to be identified automatically. An RFID tag is a small electronic device with an antenna and has a unique serial number. For some RFID applications and in the ALOHA-based anticollision algorithms, the number of tags in the system needs to be estimated. In Trans. Autom. Sci. Eng., vol 6, no. 1, pp. 9-15, Jan. 2009, Chen, a probabilistic method for tag estimation in ALOHA-based RFID systems was proposed, based on the maximum a posteriori probability. Although this approach is novel and useful, it has a mathematical error in modeling the problem. In this short paper, we address this problem and provide the correct probabilistic model for the ALOHA-based RFID systems. Some consequences of correcting the error in Trans. Autom. Sci. Eng., vol 6, no. 1, pp. 9-15, Jan. 2009, Chen, are discussed and the model is validated via simulation. Using the correct model, the performance of the ALOHA-based anticollision algorithm can be improved.
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.007 | 0.043 |
| 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.003 | 0.003 |
| Research integrity | 0.002 | 0.003 |
| Insufficient payload (model declined to judge) | 0.003 | 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".