关于最短路径算法

本文先为两个经典的最短路径算法补充具体路径的保留办法。然后,提供一个便于实现的求有向图两点间所有路径的算法.     

并行求解三对角方程组的二分消元法

本文讨论用二分技术设计求解三对角方程组的并行算法,其中包括并行追赶法、奇偶消元法、奇偶约化法和块消元法等。文中阐述了这些算法的二分法特征。     

基于最大相关法的图像阈值分割

提出了一种基于最大相关准则的图像阈值分割法．该算法比基于最大熵原理的图像分割法更简便．另外，本文采用遗传算法搜索最佳闽值，并对算法中的交叉算子和有关运行参数进行了改进．实验结果证明了该算法的快速性、有效性和稳定性．     

Construction of a genetic map and localization of QTLs for yield traits in tomato by SSR markers

Using an F2 population derived from the hybrid of Lycopersicon esculentum Mill. ‘XF 98-7’× Lycopersicon pimpinellifolium LA2184, a SSR genetic linkage map of tomato is constructed. The map contains 112 markers and spans 808.4 cM with an average distance of 7.22 cM between loci. Two quantitative trait loci (QTLs) for first flower node on chromosomes 5 and 11, two QTLs for number of flowers per truss on chromosomes 2 and 5, and five QTLs for fruit weight on chromosomes 1, 2, 3, 9 and 12 are identified.     

Mlgebraic Attack on Filter-Combiner Model Keystream Generators

Algebraic attack was applied to attack Filter-Combiner model keystream generators. We proposed thetechnique of function composition to improve the model, and the improved model can resist the algebraic attack. A new criterion for designing Filter-Combiner model was also proposed: the total length L of Linear Finite State Machines used in the model should be large enough and the degree d of Filter-Combiner function should be approximate [L/2].     

遗传算法在系统辨识中的应用

对遗传算法的机理和实现步骤进行了介绍,综述了遗传算法在系统辨识中的应用.针对不同的辨识模型,讨论了遗传算法不同的应用形式,研究了遗传算法结合神经网络技术在系统辨识中的应用,最后探讨了遗传算法在系统辨识中的研究方向.     

一种高效的多维数据包分类算法

介绍了数据包分类算法的基本思想及一种包分类算法解决方案的评价原则，在现有的ABV算法的基础上，对该算法进行了分析，提出了一种新的改进方案，并对该改进方案进行了性能分析。     

A RBF Network Learning Scheme Using Immune Algorithm Based on Information Entropy

A hybrid learning method combining immune algorithm and least square method is proposed to design the radial basis function(RBF) networks. The immune algorithm based on information entropy is used to determine the structure and parameters of RBF nonlinear hidden layer, and weights of RBF linear output layer are computed with least square method. By introducing the diversity control and immune memory mechanism, the algorithm improves the efficiency and overcomes the immature problem in genetic algorithm. Computer simulations demonstrate that the RBF networks designed in this method have fast convergence speed with good performances.     

Genetic Algorithms to the Nesting Problem in the Leather Manufacturing Industry

The nesting problem in the leather manufacturing is the problem of placing a set of irregularly shaped pieces (called stencils) on a set of irregularly shaped surfaces (called leathers sheets). This paper presents a novel and promising processing approach. After the profile of leather sheets and stencils is obtained with digitizer, the discretization makes the processing independent of the specific geometrical information. The constraints of profile are regarded thoroughly. A heuristic bottom-left placement strategy is employed to sequentially locate stencils on sheets. The optimal placement sequence and rotation are deterimined by genetic algorithms (GA). A natural concise encoding method is developed to satisfy all the possible requirements of the leather nesting problem. The experimental results show that the proposed algorithm can not only be applied to the normal two-dimensional nesting problem, but also especially suitable for the placement of multiple twodimensional irregular stencils on multiple two-dimensional irregular sheets.     

路由器OSPF协议的扩展

阐述了路由器中OSPF协议的扩展，通过对QoS路由表算法的描述，分析了算法的合理性和可行性以及适用的范围。