算法

To solve QoS-constrained routing problem and the problem of balancing network load, an algorithm based on tabu search is proposed, which has a better ability of balancing the cost of the multicast tree and the network load; upon this algorithm, a new algorithm based on degree-constrained and load-balance is proposed, which has a nicer integrative performance on equipoise the cost of multicast tree and the load of links and nodes.

2针对网络负载均衡的QoS问题，提出基于禁忌搜索的负载均衡QoS组播路由算法，算法能平衡组播树代价和网络链路负载均衡状况；在此基础上提出了基于度约束和负载均衡的QoS组播路由算法，算法在满足QoS约束的基础上，均衡了组播树代价、网络链路负载和节点负载三者之间的关系，综合性能良好。

Based on rough set theory, research in this paper mainly focuses on mining rules from decision system.Based on the research of the basic concepts of rough set, we deeply analysis and discuss the approximation set algorithm, equivalence class algorithm, core algorithm, attribute reduction algorithm, rules extract algorithm etc.

本文首先对数据挖掘和知识发现作一概述，并论述了粗糙集理论的重要概念及其度量，基于这些概念和度量，具体分析了粗糙集理论的近似集算法、核算法、属性约简算法、规则提取算法，给出了它们的算法分析以及具体实现步骤。

In this paper,we propose an accelerating chaos genetic.In this paper,by the use of the ergodic property of chaos movement,an accelerated chaos optimization genetic algorithm is proposed.

文章在Bazaar协商模型下，给出了一种快速混沌遗传算法，该算法首先将混沌机制引入遗传算法，并在搜索中，以具有一定保证的当前最优解为中心不断压缩优化变量的搜索区间，对算法进行加速。

In this thesis, a new detection method, Network Intrusion Detection based on Unsupervised Clustering and Chaos Simulated Annealing algorithm, is proposed. NIDCCSA utilizes the ergodic property of chaos to complete the perturbation of states. Therefore, simulated annealing algorithm based on chaos is more likely to converge to the globally optimal solution and enhance the detection rate.

论文中提出使用聚类和混沌模拟退火算法进行网络入侵检测——NIDCCSA算法，NIDCCSA算法充分利用了混沌的遍历性特点进行状态的变换，这样的混沌模拟退火算法更加可能收敛到全局最优解，从而提高检测率。

Aiming at these problems, an expectation maximum based MAP algorithm is proposed and the performance is analyzed. The proposed algorithm avoids large matrix operations by using the EM algorithm to decompose the MIMO channel estimation problem into a series of single input single output problems. Besides, a joint estimation is carried out over multiple OFDM symbols in order to enhance the data transmission efficiency and the estimative performance of the proposed algorithm.

该算法利用EM算法把多输入输出信道估计问题化简为一系列独立的单输入输出问题，避免了大规模矩阵运算，降低了MAP算法的计算复杂度；为进一步改善MAP算法的数据传输效率及其估计性能，可通过对多个连续的OFDM符号进行联合信道估计。

This paper extends the ant colony algorithm which is used for solving 0-1 knapsack problem in reference [7], and gets enlightenment from the ant colony algorithm with 2-opt local optimization for solving traveling salesman problems: Exchange strategy can make the algorithm have faster convergence rate and get better quality solution. So this paper presents the ant colony algorithm based on exchange stragegy.

本文推广了文献[7]中求解单维0-1背包问题的蚁群算法，并从结合2-opt等局部优化的蚁群算法求解旅行商问题中得到启示：通过交换策略可以加快算法的收敛速度和获取更高质量的解，因此提出了基于交换策略的蚁群算法。

Based on monoid comprehension, we presented an extendable object query translation algorithm which can deal with nested subquery, query with existential and universal quantifier, query with aggregate function, query with sort/group. This algorithm converted the query into joins to the utmost to expect different physical implementations of join to raise execution efficiency.

基于幺群概括，我们提出了一个可扩充的对象查询转换算法，该算法可以处理嵌套子查询、带存在量词和全称量词的查询、带聚集函数的查询、带分组/排序的查询，具有较强的通用性，该算法也体现了我们尽可能地将查询转换成连接以期望用连接的多种物理算法提高执行效率的查询优化思想。

This paper studies QinJiuShao algorithm for fast computation of high-rank polynomial,analyses fast algorithm of modular exponentiation in RSA,and gives its implementation.

介绍了用于快速计算高次多项式值的"秦九韶算法"，并用类似思路分析了RSA算法中方幂模快速实现算法，最后给出了该算法的具体实现。

Through introducing compress and expurgate method,and adopting reformative matrix-based algorithm,the IMM_Apriori algorithm capability is improved and the choke point on the efficiency is overcome.

通过对基于矩阵的算法进行改进，引入删除压缩技术提高了算法性能，有效地解决了Apriori算法在发现频繁2-项集时的效率瓶颈问题，并从理论上证明了算法的正确性和可行性。

Bring forward a kind of learning algorithm fitting on the base of spline function, because the spline function has good flexibility and quadratic smoothing property, the search problem of network weight functions training can be converted into the resoluting extreme value problem of the plurality function through using spline function to represent network input and link weight functions, thus the PNN can be trained with the help of the existing neural network learning algorithms;④build a kind of learning algorithm base on the alternate of Walsh function, the complexity of network computing can be decreased through using the complete orthogonality of Walsh function corollary.

应用结果表明该算法收敛速度快，稳定性好；③提出了一种基于样条函数拟和的学习算法，由于样条函数具有很好的柔韧性和二次光滑性，将网络输入函数和连接权函数用样条函数的形式表示，可把网络权函数训练的函数寻优问题转换为多元函数求极值的问题，从而可借助于现有的神经网络学习算法训练过程神经元网络；④建立了一种基于Walsh函数变换的学习算法，利用Walsh函数系的完备正交性，可大大降低网络计算的复杂度。

The split between the two groups can hardly be papered over.

这两个团体间的分歧难以掩饰。

This approach not only encourages a greater number of responses, but minimizes the likelihood of stale groupthink.

这种做法不仅鼓励了更多的反应，而且减少跟风的可能性。