具有多重焦点的波带透镜的设计

本文提出了一种新型的具有多重焦点的波带透镜的概念及其设计方法。可提供某些特定的光场分布,而且具有性能稳定、微型化和可实际制作等特点。     

基于C#语言的图片插入方法比较

图片是传递与表达信息的重要形式,由于图片数据特殊编码方式,它的存储和显示显得比较复杂。C#功能强大,使用方便,已经成为一种主流的计算机软件编程语言。文章介绍了使用C#向数据库中插入图片的方法,并加以比较。     

一种基于几何分布的新支持向量机多分类方法

二叉树支持向量机是多分类问题的一种有效方法,然而分类的效果与二叉树的结构密切相关。获得更好的分类效果和更高的效率,要使得二叉树高度尽量小而两个子类尽量易分。距离通常用来衡量两个类的分离程度,但不能反映类的分布情况。考虑到多分类中类的分布,文中定义新的分离度和相似度来衡量两个类的分离度,并且提出了一中新的基于几何分布二叉树支持向量机多分类算法,该方法使得二叉树高度尽量小而两个子类尽量易分。实验表明该方法具有较高的分类准确率和效率。     

Binary particle swarm optimization with multiple evolutionary strategies

This paper introduces a novel variation of binary particle swarm optimization(BPSO) algorithm and a further extension to improve its performance.Firstly,mimicking the behaviors of some creatures group,multiple evolutionary strategies BPSO(MBPSO) is introduced which takes different evolutionary strategies for various particles according to their performances.Then,on the basis of MBPSO,a new strategy is discussed to improve the performance of the MBPSO(M2BPSO) which adopts the concept of the mutation operator aiming to overcome the premature convergence and slow convergent speed during the later stages of the optimization.The proposed two algorithms are tested on seven benchmark functions and their results are compared with those obtained by other methods.Experimental results show that our methods outperform the other algorithms.     

基于Gabor小波与LBP直方图序列的人脸年龄估计

提出了一种基于Gabor小波和局域二值模式(Local binary pattern,LBP)直方图序列的人脸年龄估计方法。首先对人脸图像提取多方向与多尺度的Gabor幅值域图谱(Gabor magnitude maps,GMMs);然后采用基于局部特征的LBP算子对GMMs编码,并对之分块,由各子块的直方图序列来描述人脸;为进一步降低人脸特征维数,再对人脸直方图序列特征应用主成分分析(PCA);最后使用支持向量机回归(SVR)的LOPO策略对人脸年龄库进行训练和测试。实验结果表明,该方法可以较为快速有效地对人脸图像进行年龄估计。     

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

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

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

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

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

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

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.