在算法上

Mathieu function is the base of field theory analysis in elliptical cylinder coordinate system. So, firstly, detail investigation has been given about the problem of numerical analysis of Matheiu functions, based on the predecessor's contribution, an improved faster algorithm of numerical analysis and confirmation algorithm of Matheiu functions has been presented.

Mathieu函数是椭圆柱坐标系统下场论分析的基础，因此本文首先对Mathieu函数的数值计算问题进行了详细研究，并在前人基础上完善并进一步改进了目前被认为较为可行的数值算法，并提出了验证算法。

First,the feature subspaces are formed from different pose images using ICA and PCA.Then the pose image is transformed into its corresponding frontal face image using the transformation matrix predetermined by learning.Based on this foundation,the wavelet transform is applied to face images,and the authors compare the frontal face feature coefficients directly which are obtained by using the transformation matrix with the feature coefficients of the original face images,the recognition rate is improved greatly.

首先利用ICA和PCA提取不同姿态人脸的特征子空间，然后利用通过训练得到的姿态转换矩阵合成其相对应的正面人脸图像，实验表明ICA人脸识别算法要优于PCA人脸识别算法，并在此基础上用小波对人脸图像进行预处理，据姿态转换矩阵得到的正面人脸特征系数直接进行分类比较，识别率得到了很大的提高。

An efficient algorithm based on FP-tree and support array for mining maximal frequent itemsets is proposed. At first the FP-tree and the support array are created at the same time. Then a maximal frequent itemsets tree MAXFP-tree is built up to store all the maximal frequent itemsets. Therefore, it can reduce the search space and improve the efficiency of the algorithm.

提出了一个基于频繁模式树即FP-tree和支持度数组相结合的最大频繁项集挖掘算法，首先建立FP-tree，同时建立支持度数组，然后在此基础上建立最大频繁项集树MAXFP-tree，MAXFP-tree中包含了所有最大频繁项集，缩小了搜索空间，提高了算法的效率。

Based on these existing algorithms, We present a new branch and bound algorithm for the maximum weight clique problem.

作者在现有算法的基础上，给出了最大加权团问题的一种新的分支定界算法。

Based on the Inclan research,the paper improves the prior distribution of variance parameter and the solution of maximum likelihood estimate for high efficiency in calculation.

本文在Inclan研究工作的基础上，改进了方差参数的先验分布和求解方法，利用变点解的一致性构造了一个快速算法，并以公共卫生突发事件SARS为例展示了新算法的高效率和准确性，为检测突发事件提供了一种实用有效的新技术。

In addition, an algorithm based on rgh-tree, which is suitable for similarity search in metric space, is presented in this paper.

另外，在rgh-tree的基础上提出了相应的相似性搜索算法，该算法具有较小的I/O代价和距离计算次数，平均复杂性近似为o(n0.58)。

Comparing experiments show that the improved algorithm is more accurate, with convergent rate of tens of microsecond on 586/200 PC.

对比实验表明改进Projection无模式算法结果更为准确，更接近于真实的粒度分布，在586／200微机上算法的迭代时间仅为几十毫秒。

In this paper, an algorithm based on heuristic function for minimum set covering problem is presented, as well as the definition of complete strategy concept and the method to structure heuristic function.

本文给出了求解NP困难问题的完备策略的概念，在此基础上提出了一个求解集合覆盖问题的启发函数算法SCHF（set－coveringheuristicfunction），文中对该算法的合理性、时间复杂性以及解的精度进行了分析，本文的主要创新点是用已知的完备策略建立启发函数，并用该启发函数进行空间搜索求出优化解。

In order to solve the problem of assigning minimum protection capacity, some ideal topologies are given and the algorithm of spanning tree construction is analyzed, and then an algorithm based on these is proposed to solve the problem of one link failure.

为了解决如何分配更少的保护容量的问题，该文提出了一些理想的拓扑结构，研究了支撑树算法。在这两者的基础上针对一条链路出现故障的问题给出了利用理想拓扑的保护容量分配算法。

Aiming at the difficulties of invalid solution and local minimum problems when traveling salesman problemis studied using Hopfield artificial neural network.

针对Hopfield神经网络在求解旅行商问题时出现的无效解和局部极小值问题，分析和比较两种改进的求解方法，首先从理论上证明算法的有效性，然后对两种算法分别进行计算机仿真，探讨网络收敛于全局有效解的途径。

This one mode pays close attention to network credence foundation of the businessman very much.

这一模式非常关注商人的网络信用基础。

Cell morphology of bacterial ghost of Pasteurella multocida was observed by scanning electron microscopy and inactivation ratio was estimated by CFU analysi.

扫描电镜观察多杀性巴氏杆菌细菌幽灵和菌落形成单位评价遗传灭活率。