In the RFID system,tag collision is a common problem. In this paper,a way to read and write electronic tags which are disorder and continuous in the practice environment correctly is discussed,algorithm of binary tree is proposed,analyzed and designed.
标签碰撞是射频识别系统常见的问题,该文探讨了实际应用环境中电子标签在无序和连续情况下的正确读写,提出一种被动查寻式二叉树型算法,并对算法进行了分析与设计。
参考来源 - RFID被动查寻式防碰撞算法研究与实现Tag collision is a common problem in RFID.
标签冲突是射频识别（RFID）技术的常见问题。
参考来源 - 期刊学术社区·2,447,543篇论文数据，部分数据来源于NoteExpress
By analyzing the features of tag collision, this paper brings forward an algorithm using jumping method.
该算法根据碰撞时的特点，跳跃式前后搜寻，识别N个标签，共需要问询2n - 1次。
This collision causes confusion to any application interested in its respective tag set.
这种冲突使对它的对应标记集感兴趣的应用程序感到困惑。
The solution to collision and recognition, as put forth by XML namespaces, boils down to creating universally unique names for each and every individual tag in every document.
XML名称空间所提出的冲突和识别解决方案，归根到底就是要为每个文档中的每个单独标签创建统一的惟一名称。
应用推荐