Identifying speed,tag average response times and reliability are the most important capabilities in passive RFID(radio frequency identification) system.QT(query tree) is a famous algorithm for lowest-cost RFID tags,bu...Identifying speed,tag average response times and reliability are the most important capabilities in passive RFID(radio frequency identification) system.QT(query tree) is a famous algorithm for lowest-cost RFID tags,but its shortcoming is high searching delay and high tag average response times.A prefix subsection matching binary(PSMB) algorithm based on QTalgorithm is proposed.The key idea of PSMB anti-collision algorithm is that,during searching phase,a given reader uses the particular tags ID,which has been searched out formerly,to shorten searching delay and depress tag average response times.The idea of PSMB algorithm can be described as follows.Usually,tag ID is composed of several subsections which have different meanings.Based on the tags ID searched out formerly,a given reader builds a prefix database.In subsequent searching phase,the reader uses its prefix database to deduce searching space of tag ID.Simulation results show that identification delay of PSMB algorithm is about 1/3 of QTalgorithm,tag average response times is about 1/4 of QTalgorithm,and system throughput rate is treble QTalgorithm.展开更多
Disassembly sequence planning （DSP） plays a significant role in maintenance planning of the aircraft. It is used during the design stage for the analysis of maintainability of the aircraft. To solve product disassem...Disassembly sequence planning （DSP） plays a significant role in maintenance planning of the aircraft. It is used during the design stage for the analysis of maintainability of the aircraft. To solve product disassembly sequence planning problems efficiently, a product disassembly hybrid graph model, which describes the connection, non-connection and precedence relationships between the product parts, is established based on the characteristic of disassembly. Farther, the optimization model is provided to optimize disassembly sequence. And the solution methodology based on the genetic/simulated annealing algorithm with binaxy-tree algorithm is given. Finally, an example is analyzed in detail, and the result shows that the model is correct and efficient.展开更多
在RFID网络通信中,当多个标签同时回应阅读器的查询时,如果没有相应的防冲突机制,会导致标签到阅读器的通信冲突,使得从标签返回的数据难以被阅读器正确识别.防冲突算法是阅读器快速、正确获取标签数据的关键.一种被称为基于栈的ID-二...在RFID网络通信中,当多个标签同时回应阅读器的查询时,如果没有相应的防冲突机制,会导致标签到阅读器的通信冲突,使得从标签返回的数据难以被阅读器正确识别.防冲突算法是阅读器快速、正确获取标签数据的关键.一种被称为基于栈的ID-二进制树防冲突算法(Stack-based ID-binary tree anti-collision algorithm,SIBT)被提出,SIBT算法的新颖性在于它将n个标签的ID号映射为一棵唯一对应的ID-二进制树,标签识别过程转化为在阅读器中创建ID-二进制树的过程.为了提高多标签识别效率,阅读器使用栈保存已经获取的ID-二进制树创建线索,用计数器保存标签在该栈中的深度.理论分析和仿真结果表明SIBT算法的性能优于其他基于树的防冲突算法.展开更多
基金Sponsored by the National Natural Science Foundation of China(60372042)
文摘Identifying speed,tag average response times and reliability are the most important capabilities in passive RFID(radio frequency identification) system.QT(query tree) is a famous algorithm for lowest-cost RFID tags,but its shortcoming is high searching delay and high tag average response times.A prefix subsection matching binary(PSMB) algorithm based on QTalgorithm is proposed.The key idea of PSMB anti-collision algorithm is that,during searching phase,a given reader uses the particular tags ID,which has been searched out formerly,to shorten searching delay and depress tag average response times.The idea of PSMB algorithm can be described as follows.Usually,tag ID is composed of several subsections which have different meanings.Based on the tags ID searched out formerly,a given reader builds a prefix database.In subsequent searching phase,the reader uses its prefix database to deduce searching space of tag ID.Simulation results show that identification delay of PSMB algorithm is about 1/3 of QTalgorithm,tag average response times is about 1/4 of QTalgorithm,and system throughput rate is treble QTalgorithm.
基金supported by the National High Technology Research and Development Program of China(2006AA04Z427).
文摘Disassembly sequence planning （DSP） plays a significant role in maintenance planning of the aircraft. It is used during the design stage for the analysis of maintainability of the aircraft. To solve product disassembly sequence planning problems efficiently, a product disassembly hybrid graph model, which describes the connection, non-connection and precedence relationships between the product parts, is established based on the characteristic of disassembly. Farther, the optimization model is provided to optimize disassembly sequence. And the solution methodology based on the genetic/simulated annealing algorithm with binaxy-tree algorithm is given. Finally, an example is analyzed in detail, and the result shows that the model is correct and efficient.
文摘在RFID网络通信中,当多个标签同时回应阅读器的查询时,如果没有相应的防冲突机制,会导致标签到阅读器的通信冲突,使得从标签返回的数据难以被阅读器正确识别.防冲突算法是阅读器快速、正确获取标签数据的关键.一种被称为基于栈的ID-二进制树防冲突算法(Stack-based ID-binary tree anti-collision algorithm,SIBT)被提出,SIBT算法的新颖性在于它将n个标签的ID号映射为一棵唯一对应的ID-二进制树,标签识别过程转化为在阅读器中创建ID-二进制树的过程.为了提高多标签识别效率,阅读器使用栈保存已经获取的ID-二进制树创建线索,用计数器保存标签在该栈中的深度.理论分析和仿真结果表明SIBT算法的性能优于其他基于树的防冲突算法.
