Distributed discovery services via EPC-BGP for mobile RFID
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
In this paper, we propose an extended architecture of the EPCglobal network that allows tracking objects. This architecture makes use of the distributed discovery services along with the EPC-BGP to provide detailed information about an object regardless of its location. In the EPCglobal network, each object is assigned an IPv6 address once it leaves the last gateway in the supply chain. The IP address of the last gateway enables backtracking of all the information about this object throughout the supply chain. To this end, EPC status updates are crucial in order to advertise any changes in the EPC into the supply chain. On the other hand, concurrent EPC updates, expired EPC databases and/or limitation of resources may cause blocking of an EPC update request. Therefore, we evaluate our proposed architecture in terms of blocking probability of the EPC update requests. To this end, We define three types of blocking, namely the Justified Update Blocking (JUB), Unjustified Update Acceptance (UUA), and Unjustified Update Blocking (UUB). We investigate the impact of the frequency of update advertisements on the blocking probability. Numerical results confirm the trade-off between blocking probability and communication/computation overhead due to EPC update messages. However, further investigation in terms of the number of advertisements and the distance between the routing tables confirms that advertisement of EPC update messages based on certain thresholds can overcome this trade-off.
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.000 | 0.000 |
| Scholarly communication | 0.000 | 0.001 |
| 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