利用二进制数算法寻找5个点的Ramsey图

用二进制数来表示完全图的各种组合,借助计算机编程可从完全图的各种组合中寻找出ramsey图。5个顶点的Ramsey图是最基本的Ramsey图,这种基本方法为寻找更复杂的Ramsey图提供了基础。     

折半查找算法在最优化问题中的应用

折半查找是一种常见的静态查找方法,在特定的、有序的查找区间内,通过折半方式不断地缩小查找区间,将区间中间位置的元素与给定元素加以比较,最终确定查找结果.在此传统折半查找基础上,总结了一种抽象化的改进方法,并将此改进后的折半查找算法应用于最优化问题的求解.     

一种基于视频的车站人群密度估计算法

提出了一种基于视频的车站人群密度检测算法。该算法能标记出无人活动区域和有人活动区域,在检测人群密度方面只计算有人活动区域,可降低计算复杂度,为人群密度检测的实时性奠定了基础;在计算人流密度时,考虑到了摄像头画面出现黑屏、雪花和移位的现象,从整体上提高了人群密度检测的准确率;通过对有人运动区域的连通域内像素数与有人区域的像素点数的比值计算人群整体密度值,计算复杂度低且衡量人群整体密度的精确度较高。此方法尤其适用于机场、地铁、车站等场景模型下人群密度的实时场景监测。     

基于分形编码和LIC混沌系统的图像压缩加密算法

随着数字图像在网络中的广泛应用,其在安全、传输、存储等方面的问题亟待解决。提出的算法为分形编码提供了新型安全方案,分形图像编码具有压缩比高和重构质量高的特点,而混沌的不可预测性和初值敏感性适用于图像加密,将分形编码和混沌加密有效结合可以充分发挥两者的优势。此外,通过耦合增强构造新的混沌系统,改善了种子映射复杂度低、混沌范围有限等问题,并设计了置乱扩散同时进行的加密结构来提高算法效率。实验表明,提出的算法的密钥空间大、密钥敏感性强、相邻像素相关系数和信息熵都接近理想值,能够抵抗多种常见攻击,且加密速度更快,能满足实际应用的需要。压缩性能方面,在满足重构视觉质量的同时达到了较其他方案更高的压缩比。     

一种改进的基于在线解耦的轻量级动态污点分析方法

在针对二进制程序的实际分析场景中,动态分析方法因具有更高的准确性而得到更为广泛的关注和运用.但是以动态污点分析为代表的细粒度分析方法通常会产生较高的性能和资源开销.为缓解这些问题,本文提出一种改进的轻量级在线解耦的动态污点分析方法,其主要思想是在线解耦程序执行和指令分析,同步构建分析代码并完成分析.该方法能够进一步降低对目标程序运行时的性能影响,并易将分析过程迁移至其它上下文环境中,从而可进一步减小对目标程序运行环境的干扰.本文通过采用多种实际程序进行实验,结果表明该方法能够比传统在线污点分析具有更高的分析性能,并具有较低的系统资源消耗,易于在实际环境中进行部署和应用.     

基于游程编码思想的条码定位与识别方法

在复杂背景中的定位条码是图像式条码识别系统中的一个关键步骤,在复杂的背景中快速、自动地检测出条形码是文章研究的主要内容。该文首先介绍了条型码的编码结构,然后提出了一种基于游程编码思想的条码定位与识别方法,最后通过相关实验结果验证了该算法的可行性和实用性。     

井下人员定位系统读卡器存储算法分析与测试

从查找时间与存储容量2个方面分析了适用于井下人员定位系统读卡器的3种存储算法,即链式存储算法、哈希表存储算法和哈希二叉树存储算法,给出了该3种不同存储算法的使用效率与应用场合。测试结果表明,链式存储算法查找时间呈线性增长,哈希表存储算法明显优越于链式存储算法,如果测试数据增多,其优越性会更明显;当数据量较大时,哈希搜索二叉树存储算法又明显优于哈希表存储算法,当人数达到行业所要求的8 000人以上时,选择哈希搜索二叉树存储算法更为合理。     

An FEC scheme combined with weighted scheduling to reduce multicast packet loss in IPTV over PON

Congestion is one of the most important challenges in optical networks. In a Passive Optical Network (PON), the Optical Line Terminal (OLT) is a bottleneck and congestion prone. In this paper, a framework is proposed with Forward Error Correction (FEC) at the IP layer combined with Weighted Round Robin (WRR) at the scheduling level to overcome packet-loss due to congestion in the OLT in order to achieve efficient video multicasting over PON. In the FEC scheme, Reed-Solomon (RS(n,k)) with erasure coding is used, where (n−k) erroneous symbols per n symbol blocks can be corrected. In our framework, an Internet Protocol TeleVision (IPTV) service provider uses the mentioned RS coding and generates redundant packets from regular IPTV packets in such a way that an Optical Network Unit (ONU) can recover lost packets from received packets, thus resulting in a better video quality. Simulation results show that using the proposed framework, an ONU can recover many lost packets and achieve better video quality under different traffic loads for its users. For instance, the proposed method can reduce packet loss rate by almost 55% and 10% under traffic load 0.9, respectively, compared with the Round Robin (RR) and WRR methods under symmetric traffic load. When High Receivers Queue (HRQ) traffic (i.e., traffic received by many users) is twice Low Receivers Queue (LRQ) traffic (i.e., traffic received by a small number of users), this reduction is almost 86% and 30% under traffic load 0.9. Finally, when LRQ traffic is twice HRQ traffic, the reduction in packet loss rate is almost 70% and 91% at traffic load 0.5.     

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.