查询词典 algorithm

Genetic algorithm with matrix encoding, different mutate operator, crossover operator and selection operator based on order rank selection algorithm was applied to solve the problem. Genetic algorithm was approved to be convergence.

本文第三章提出了基于矩阵编码的遗传算法的最低费用的下一跳路由，解决了下一跳路由中不考虑网络负载和时延可能产生拥塞的问题，优化了网络的性能，使得网络中的带宽得到合理分配。

Experiment in this paper validates the convergence of the improved Mean Shift algorithm, contrast convergence rate of improved Mean Shift algorithm with convergence rate of traditional Mean Shift algorithm.

本文的实验也进一步验证了改进的Mean Shift算法的收敛性，并对比了改进前后的Mean Shift算法的收敛速度。

So the priority that combines packet delay and dynamic queue length is obtained. A packet scheduling algorithm based on this priority scheme is proposed for the input memory switch. The scheduling algorithm supports both packet delay and packet queue length. The application of this scheduling algorithm in Crossbar and Clos networks is presented.

在此优先级的基础上，提出了输入缓存交换结构中能够兼顾分组时延与分组队长的分组调度算法，将此调度算法用于单Crossbar交换单元和Clos网络，并提出了在Clos网络中按照优先级均衡负载的路由算法。

Association rules mining is a very active field in data mining and there are many algorithms today. In this field, the most classical algorithm is Apriori put forward by Agrawal et. al and it is used widely. The paper analyzes the advantages an disadvantages of Apriori, AprioriTid and AprioriHybrid algorithm in mining association rules. To solve the bottle of AprioriHybrid algorithm, a Support-Matrix method to rapidly verify the 2-frequent itemsets is put forward. To accelerate the speed of verify the k-frequent itemsets, a simple and highly efficient method of minimizing the trade database is given. All these two methods improve the efficiency of AprioriHybrid method.

关联规则挖掘是数据挖掘中一个非常活跃的领域，当前有许多种算法，最经典并被广泛使用的是Agrawal等人提出的Apriori算法及其衍生算法，本文分析了Apriori，AprioriTid和AprioriHybrid算法的优缺点，针对AprioriHybrid算法的瓶颈提出一种使用支持度矩阵对频繁2项集快速验证的方法，并给出一种简单易行，而又高效的逐步缩减交易数据库的方法，加快对候选频繁k项集的验证速度，从而提高了AprioriHybrid算法的效率。

In the algorithm, radial-basis function neural network was utilized as forward model, and genetic algorithm was used to solve the optimization problem in the inverse problem, which can avoid the local minimum solution possibly encountered in the iterative inverse algorithm based on gradient descent and consequently achieve the global optimized solution of the inverse problem.

在该算法中，径向基函数神经网络用作前向模型，遗传算法用于求解逆问题中的优化问题，其优点是能够避免基于梯度下降法的迭代逆算法中可能遇到的局部最小问题，并能得到逆问题的全局最优解。

We present a SNMP-based topology discovery algorithm using direct connection theorem and simple connection theorem for judging relationship of switches in subnets. In order to in discover the map of network without SNMP, several key problems such as subnet guessing and multi-address routers are discussed in details. And then a topology discovery algorithm based on primitive protocols is presented. We also deeply study some routing protocols such as OSPF and BGP and propose a routing-protocols-based algorithm for topology discovery.

基于判断交换机互联的直接连接定理和间接连接定理，提出了一种完整的基于SNMP的拓扑发现算法；详细讨论了子网获取、多址路由器处理等关键问题，针对不同的网络环境给出了相应的解决方案，并以此为基础提出了一种基于通用协议的拓扑发现算法；在对OSPF，BGP等网络路由协议进行分析的基础上给出了一种基于路由协议的拓扑发现算法，并设计了一个自上而下的拓扑发现框架结构。

This paper proposes a method, which use genetic algorithm and particle swarm optimization algorithm of evolutionary algorithm, to solve the problems of multiple sequence alignments.

本文提出使用遗传算法和粒子群优化算法来解决多序列比对问题。

The convergence speed of forward algorithm is as fast as ten times of backward algorithm.Additionally,the decrypted image quality and noiseproof ability for the forward algorithm are also higher than the backward algorithms obviously.

不仅如此，整个算法的收敛速度比后向算法快一个数量级，而且无论迭代结果的解密图象质量还是抑制噪声能力也都明显优于后向算法。

On the basis of Venigalla\'s work,we adopted two path-based algorithms, namely,gradient projection algorithm and disaggregated simplicial decomposition algorithm to solve nonadditive path cost traffic assignment problem under different engine operating modes.We compared the above two algorithms in a network example which showed that compared with the traditional Frank-Wolfe algorithm, the two path-based algorithms had a more quicker convergency while getting optimal solution,and it can obtain a satisfying solution in most cases.

2在Venigalla等人研究工作的基础上，分别采用基于路径的梯度投影算法(gradient projection，GP)和基于路径的非集计的单纯分解算法(disaggregated simplicial decomposition，DSD)来求解考虑不同发动机启动模式下，具有非可加路径费用的交通分配问题，在实例计算中比较了这两种算法的计算性能。

Theoretic models and methods using nonnumeric parallel optimization algorithm, genetic algorithm and simulated annealing algorithm, to adjust and control the production-injection system were made with taking the net present value as the objective function and coupling economic model, reservoir model, wellbore model including producer and injector, and choke model.

以净现值为系统目标，耦合经济模型、油藏模型、注采井筒模型和油嘴模型，首次建立利用非数值并行算法——遗传算法与模拟退火算法调控注采系统的理论模型与方法，对不同开发阶段与不同约束条件下的注采系统进行最佳调控，使之保持最优生产状态。

Many will continue to choose to live in duality and in conflict.

许多人将继续选择活在二元对立性和冲突中。

I find that students of the University of Physical Education all wear sportswear at first sight.

我发现：体育大学的学生乍一看，都是穿运动衣，大家都一样