检测骨架图形特征点的新方法

端点、折点、歧点和交点是骨架图形的重要特点是，提出用快速查表法检测侯选特征点，再进行侯选特征点聚集，用局部结构分析，去除假特征点，判别真特征点的类型，并对折点给以大致的定量描述。实验结果表明，该方法能快速有效地找出骨架图形的特征点，在目标识别、字符识别等应用中起着关键作用。     

一种基于光照变化补偿的颜色识别方法

针对RoboCup中型组足球机器人比赛中光照变化会使颜色发生色彩漂移,影响颜色识别的准确性问题,提出一种基于光照变化补偿的颜色识别方法。该方法首先利用球的历史信息预测球的位置,然后在较小的区域内用基于色调直方图反向投影的方法找到球后,通过球的亮度直方图的变化计算出光照变化率,用于动态补偿颜色查找表。实验表明该方法能提高颜色识别的光照自适应性。     

An efficient IP address lookup algorithm based on a small balanced tree using entry reduction

Due to a tremendous increase in internet traffic, backbone routers must have the capability to forward massive incoming packets at several gigabits per second. IP address lookup is one of the most challenging tasks for high-speed packet forwarding. Some high-end routers have been implemented with hardware parallelism using ternary content addressable memory (TCAM). However, TCAM is much more expensive in terms of circuit complexity as well as power consumption. Therefore, efficient algorithmic solutions are essentially required to be implemented using network processors as low cost solutions.Among the state-of-the-art algorithms for IP address lookup, a binary search based on a balanced tree is effective in providing a low-cost solution. In order to construct a balanced search tree, the prefixes with the nesting relationship should be converted into completely disjointed prefixes. A leaf-pushing technique is very useful to eliminate the nesting relationship among prefixes [V. Srinivasan, G. Varghese, Fast address lookups using controlled prefix expansion, ACM Transactions on Computer Systems 17 (1) (1999) 1-40]. However, it creates duplicate prefixes, thus expanding the search tree.This paper proposes an efficient IP address lookup algorithm based on a small balanced tree using entry reduction. The leaf-pushing technique is used for creating the completely disjointed entries. In the leaf-pushed prefixes, there are numerous pairs of adjacent prefixes with similarities in prefix strings and output ports. The number of entries can be significantly reduced by the use of a new entry reduction method which merges pairs with these similar prefixes. After sorting the reduced disjointed entries, a small balanced tree is constructed with a very small node size. Based on this small balanced tree, a native binary search can be effectively used in address lookup issue. In addition, we propose a new multi-way search algorithm to improve a binary search for IPv4 address lookup. As a result, the proposed algorithms offer excellent lookup performance along with reduced memory requirements. Besides, these provide good scalability for large amounts of routing data and for the address migration toward IPv6. Using both various IPv4 and IPv6 routing data, the performance evaluation results demonstrate that the proposed algorithms have better performance in terms of lookup speed, memory requirement and scalability for the growth of entries and IPv6, as compared with other algorithms based on a binary search.     

Web信息抽取技术综述*

快速高效地获取网页主题信息的需求使得Web信息抽取技术成为信息技术领域的研究热点。现有的Web信息抽取技术大致可以归纳为基于统计理论的、基于视觉特征的、基于DOM树结构的和基于模板的几类。由于网页文本本身具有树结构并且具有一定的相似性,基于DOM树结构和基于模板的抽取技术发展很快而且已经得到了广泛的应用。分别论述了上述几类技术在近几年来的研究进展,从自动化程度、适用范围和复杂性三个角度分析对比了几类技术的优缺点。     

高端路由器CIDR表非关键字索引的B-Tree机制

不分类的互联网协议(IP)地址方式无类别域间路由(CIDR)可以解决高端路由器中路由匹配延
迟问题. 通过对CIDR表深入分析,在参考数据库的非关键字索引方法和分割索引算法的基础
上,提出了一种满足CIDR表要求的非关键字索引的B Tree算法. 该算法首先对CIDR表的全
部前缀地址集合进行分割索引,分割后,CIDR表被改变成一种B Tree索引结构;然后按照I
P地址的非关键字对CIDR表进行快速查找. 仿真结果表明,本文算法更好地满足了快速查找I
P地址的需求.     

媒体处理器视频哈夫曼解码快速算法

为了提高视频处理中哈夫曼解码的性能,从减少比特操作、提高处理器内存利用率的角度出发,设计了2种不同的数据结构进行哈夫曼码表的组织,提出了一种新的并行分步查表算法,对Ishii的并行查表法进行了改进.实验结果表明,采用新算法及其内存优化策略,以哈夫曼解码性能较少下降的代价,内存开销得到大幅降低.新算法比常用的分步查表算法的解码效率有较大提升,对MPEG系列、H.26X系列等视频压缩标准具有普适性.     

基于蜜罐在线恶意网页检测系统研究与设计

针对网页安全威胁的动态性、广泛性等特点,设计了一个基于蜜罐在线恶意网页检测系统。该系统使用URL数据表来记录网页地址,同时结合蜜罐技术对URL数据表不存在或存在但还需进行检测的网页进行综合检测,实时检测出用户需要浏览的网页的安全状态,避免恶意网页的攻击,从而提高人们网络活动的安全性。     

基于Chord的多集群网格系统资源查找算法改进

分析了P2P-Grid模式下的多集群网格系统资源查找问题,提出了一种基于Chord的优化资源查找算法P-RN-Tree算法来提高资源定位的效率。通过P-RN-Tree算法,设计并实现了基于Chord的分布式计算资源查找策略。理论分析表明,RN-Tree和P-RN-Tree的高度总是接近lbN,但由于优势集群选择算法的加入,P-RN-Tree平均查找长度要低于RN-Tree。仿真实验结果表明,该算法将进一步减少了资源调度所需的代价,提高了多集群网格系统的性能。     

跨站脚本攻击模式研究

文章对将包含XSS攻击代码的HTTP URLs单词集合分为两部分。按一定粒度分词,运用Apriori算法挖掘攻击模式字符串频繁项集,并在此基础上运用类似Apriori算法思想的PrioriMerge子串合并算法得到攻击模式并统计其频率,实验结果表明算法能有效地挖掘出XSS攻击模式。