scholarly journals A Group-Based Binary Splitting Algorithm for UHF RFID Anti-Collision Systems

2020 ◽  
Vol 68 (2) ◽  
pp. 998-1012 ◽  
Author(s):  
Jian Su ◽  
Zhengguo Sheng ◽  
Alex X. Liu ◽  
Yu Han ◽  
Yongrui Chen
2020 ◽  
Vol 68 (4) ◽  
pp. 743-759
Author(s):  
Dimitrije Čvokić

Introduction/purpose: The purpose of group testing algorithms is to provide a more rational resource usage. Therefore, it is expected to improve the efficiency of large-scale COVID-19 screening as well. Methods: Two variants of non-adaptive group testing approaches are presented: Hwang's generalized binary-splitting algorithm and the matrix strategy. Results: The positive and negative sides of both approaches are discussed. Also, the estimations of the maximum number of tests are given. The matrix strategy is presented with a particular modification which reduces the corresponding estimation of the maximum number of tests and which does not affect the complexity of the procedure. This modification can be interesting from the applicability viewpoint. Conclusion: Taking into account the current situation, it makes sense to consider these methods in order to achieve some resource cuts in testing, thus making the epidemiological measures more efficient than they are now.


2020 ◽  
Author(s):  
Kirill Vechera

This paper addresses the operational efficiency of different pool-testing strategies in typical scenarios of a PCR laboratory working in mass testing for COVID-19 with different values of prevalence, limitations and conditions of testing, and priorities of optimization. The research employs a model of the laboratory's testing process, created after interviewing of PCR laboratories and studying their operations. The limitations and operational characteristics of this model were applied in a simulation of the testing process with different pool-testing strategies managed by a computer program developed in the LOMT project. The efficiency indicators assessed are the number of assays needed to obtain results of a batch of specimens, the number of specimens identified after the first analysis, and total time to obtain all results. Depending on prevalence, constraints of testing, and priorities of optimization, different pool-testing strategies provide the best operational efficiency. The binary splitting algorithm provides the maximum reduction of the number of assays: from 1.99x reduction for a high prevalence (10%) to 25x reduction for a low prevalence (0.1%), while other algorithms provide the least amount of time to obtain results or the maximum number of the specimens classified after the first analysis.


2015 ◽  
Vol 6 (4) ◽  
pp. 171-184
Author(s):  
Liangbo Xie ◽  
Jiaxin Liu ◽  
Yao Wang ◽  
Chuan Yin ◽  
Guangjun Wen

2011 ◽  
Vol 25 (5) ◽  
pp. 468-473
Author(s):  
Weifeng Liu ◽  
Yiqi Zhuang ◽  
Zengwei Qi ◽  
Longfei Tang

2017 ◽  
Vol 59 (5) ◽  
pp. 159-168 ◽  
Author(s):  
Riccardo Colella ◽  
Almudena Rivadeneyra ◽  
Alberto J. Palma ◽  
Luciano Tarricone ◽  
Luis Fermin Capitan-Vallvey ◽  
...  
Keyword(s):  
Uhf Rfid ◽  

Sign in / Sign up

Export Citation Format

Share Document