The ID3 algorithm is a classical learning algorithm of decision tree in data mining.The algorithm trends to choosing the attribute with more values,affect the efficiency of classification and prediction for building a...The ID3 algorithm is a classical learning algorithm of decision tree in data mining.The algorithm trends to choosing the attribute with more values,affect the efficiency of classification and prediction for building a decision tree.This article proposes a new approach based on an improved ID3 algorithm.The new algorithm introduces the importance factor λ when calculating the information entropy.It can strengthen the label of important attributes of a tree and reduce the label of non-important attributes.The algorithm overcomes the flaw of the traditional ID3 algorithm which tends to choose the attributes with more values,and also improves the efficiency and flexibility in the process of generating decision trees.展开更多
在RFID网络通信中,当多个标签同时回应阅读器的查询时,如果没有相应的防冲突机制,会导致标签到阅读器的通信冲突,使得从标签返回的数据难以被阅读器正确识别.防冲突算法是阅读器快速、正确获取标签数据的关键.一种被称为基于栈的ID-二...在RFID网络通信中,当多个标签同时回应阅读器的查询时,如果没有相应的防冲突机制,会导致标签到阅读器的通信冲突,使得从标签返回的数据难以被阅读器正确识别.防冲突算法是阅读器快速、正确获取标签数据的关键.一种被称为基于栈的ID-二进制树防冲突算法(Stack-based ID-binary tree anti-collision algorithm,SIBT)被提出,SIBT算法的新颖性在于它将n个标签的ID号映射为一棵唯一对应的ID-二进制树,标签识别过程转化为在阅读器中创建ID-二进制树的过程.为了提高多标签识别效率,阅读器使用栈保存已经获取的ID-二进制树创建线索,用计数器保存标签在该栈中的深度.理论分析和仿真结果表明SIBT算法的性能优于其他基于树的防冲突算法.展开更多
CAN(controller area network)总线是应用最广泛的现场总线,由于缺乏认证及消息检验机制,使得现在的CAN总线具有极大的安全隐患,需要为CAN总线设计防御机制.针对此情况,本文设计了一种优先级跳变机制,将通过散列函数进行一次性标识符动...CAN(controller area network)总线是应用最广泛的现场总线,由于缺乏认证及消息检验机制,使得现在的CAN总线具有极大的安全隐患,需要为CAN总线设计防御机制.针对此情况,本文设计了一种优先级跳变机制,将通过散列函数进行一次性标识符动态跳变的方式引入到实时调度算法中.使用遗传算法计算固定优先级,求出优先级可妥协范围,将各帧进行分组,将数据帧的ID段进行分段重构,ID段前部分决定优先级并进行优先级跳变,ID段的后部分进行一次性动态跳变.实验结果表明,使用动态优先级和一次性ID跳变的方式进行跳变,相较于已有的ID跳变机制其安全性有了较大的提升.展开更多
A high-speed comer detection algorithm based on fuzzy ID3 decision tree was proposed. In the algorithm, the Bresenham circle with 3-pixel radius was used as the test mask, overlapping the candidate comers with the nuc...A high-speed comer detection algorithm based on fuzzy ID3 decision tree was proposed. In the algorithm, the Bresenham circle with 3-pixel radius was used as the test mask, overlapping the candidate comers with the nucleus. Connected pixels on the circle were applied to compare the intensity value with the nucleus, with the membership function used to give the fuzzy result. The pixel with maximum information gain was chosen as the parent node to build a binary decision tree. Thus, the comer detector was derived. The pictures taken in Fengtai Railway Station in Beijing were used to test the method. The experimental results show that when the number of pixels on the test mask is chosen to be 9, best result can be obtained. The comer detector significantly outperforms existing detector in computational efficiency without sacrificing the quality and the method also provides high performance against Poisson noise and Gaussian blur.展开更多
文摘The ID3 algorithm is a classical learning algorithm of decision tree in data mining.The algorithm trends to choosing the attribute with more values,affect the efficiency of classification and prediction for building a decision tree.This article proposes a new approach based on an improved ID3 algorithm.The new algorithm introduces the importance factor λ when calculating the information entropy.It can strengthen the label of important attributes of a tree and reduce the label of non-important attributes.The algorithm overcomes the flaw of the traditional ID3 algorithm which tends to choose the attributes with more values,and also improves the efficiency and flexibility in the process of generating decision trees.
文摘在RFID网络通信中,当多个标签同时回应阅读器的查询时,如果没有相应的防冲突机制,会导致标签到阅读器的通信冲突,使得从标签返回的数据难以被阅读器正确识别.防冲突算法是阅读器快速、正确获取标签数据的关键.一种被称为基于栈的ID-二进制树防冲突算法(Stack-based ID-binary tree anti-collision algorithm,SIBT)被提出,SIBT算法的新颖性在于它将n个标签的ID号映射为一棵唯一对应的ID-二进制树,标签识别过程转化为在阅读器中创建ID-二进制树的过程.为了提高多标签识别效率,阅读器使用栈保存已经获取的ID-二进制树创建线索,用计数器保存标签在该栈中的深度.理论分析和仿真结果表明SIBT算法的性能优于其他基于树的防冲突算法.
文摘CAN(controller area network)总线是应用最广泛的现场总线,由于缺乏认证及消息检验机制,使得现在的CAN总线具有极大的安全隐患,需要为CAN总线设计防御机制.针对此情况,本文设计了一种优先级跳变机制,将通过散列函数进行一次性标识符动态跳变的方式引入到实时调度算法中.使用遗传算法计算固定优先级,求出优先级可妥协范围,将各帧进行分组,将数据帧的ID段进行分段重构,ID段前部分决定优先级并进行优先级跳变,ID段的后部分进行一次性动态跳变.实验结果表明,使用动态优先级和一次性ID跳变的方式进行跳变,相较于已有的ID跳变机制其安全性有了较大的提升.
基金Project(J2008X011) supported by the Natural Science Foundation of Ministry of Railway and Tsinghua University,China
文摘A high-speed comer detection algorithm based on fuzzy ID3 decision tree was proposed. In the algorithm, the Bresenham circle with 3-pixel radius was used as the test mask, overlapping the candidate comers with the nucleus. Connected pixels on the circle were applied to compare the intensity value with the nucleus, with the membership function used to give the fuzzy result. The pixel with maximum information gain was chosen as the parent node to build a binary decision tree. Thus, the comer detector was derived. The pictures taken in Fengtai Railway Station in Beijing were used to test the method. The experimental results show that when the number of pixels on the test mask is chosen to be 9, best result can be obtained. The comer detector significantly outperforms existing detector in computational efficiency without sacrificing the quality and the method also provides high performance against Poisson noise and Gaussian blur.
