查询词典 algorithm of division

The results show that the two kinds of basic ant colony algorithm have better performance than classical K-means algorithm and hierarchal clustering algorithm, the two kinds of extended algorithm have better performance than corresponding basic ant colony algorithm.

实验结果表明，两种基本蚁群算法的聚类效果优于经典的K_means算法和层次聚类算法；两种改进的算法又分别优于相应的基本蚁群算法，达到了算法改进的目的。

Optimal algorithm of combined nonlinear Hopfield network appears powerful validity in solving nonlinear planning, which includes nonlinear objective function, linear constrains and high-demension of decision-making variants, for its ability of nonlinear parallel computation. It is prominent among optimal algorithms because of its function of simply implement with electrocircuit hardware. Genetic algorithm is expressly suitable for optimal calculation regarding the planning of massive, highly nonlinear, inconsecutively differentiable and multiobjective function as well as objective function without analytical expression. However, it inclines to prematurity, as well as its limitation in ability of partial optimal search. Introducing the optimal algorithm of niche genetic simulated annealing to standard Genetic algorithm, can therefore improve the full-scale or partial search ability of Genetic algorithm effectively. It has a far-flung perspective in the field of systemic planning of water pollution control.

组合式非线性Hopfield网络优化算法所具有的非线性大规模并行计算能力在求解具有非线性目标函数、线性约束条件及高维决策变量的非线性规划问题方面显示出了强大的生命力，它易于电路硬件实现的功能更是在优化算法中独树一帜；遗传算法采用概率搜索技术，不受目标函数与约束条件的限制，特别适合大规模、高度非线性的不连续可微的多峰目标函数及无解析表达式的目标函数的规划问题的优化计算，但其存在容易早熟、局部寻优能力较差等缺点，本文在标准遗传算法中引入小生境技术及模拟退火算法有效地改善遗传算法的全局和局部搜索性能，提高了全局最优解的寻优质量，小生境遗传退火模拟优化算法在水污染控制系统规划中的应用前景极为广阔。

The algorithm adopts classical bilinear interpolation algorithm in the area of image other than the edges;concurrently the stairway detection is further made according to the outcomes of Canny edge detection to sift out the horizontal and vertical edges which will not produce jaggies distortion;but in edge areas where severe jaggies distortion will occur when using classical algorithm,the stairway thinning-based interpolation algorithm is implemented.This interpolation algorithm keeps stairways from being enlarged when zooming out the image,hence the goal of reducing jaggies distortion is achieved.

该算法在图像的非边缘区域采用经典的双线性插值算法；同时根据Canny边缘检测的结果，进一步进行阶梯检测，滤除不会产生锯齿失真的竖直和水平边缘；而在使用经典算法会产生严重锯齿失真的边缘区域，运用基于阶梯细化的插值算法；该插值算法在放大图像的同时，抑制边缘中的阶梯被放大，从而达到减少锯齿失真的目的。

There is mutual contradiction between direction estimation of user's signal and power allocation among all users in the beamforming algorithm. A twice game beamforming algorithm based on game theory is proposed to deal with it. Beamforming game algorithm mathematics model is constructed. During the first game, direction of signal and power allocation are mapped the game theory as "player", which are modeled as the problem of maximin function and obtain direction estimation first. Then during the second game, power allocations of different users are described as a multi-user game. Power updated algorithm is designed. The existence and uniqueness of the Nash equilibrium in the twice game beamforming algorithm based on game theory are proved by mathematics derivation.

摘要针对波束成形算法中，用户的信号方向估计值和用户之间的功率分配存在着相互矛盾，本文提出了一种基于博弈论的二次博弈波束成形算法，构建了波束成形博弈算法数学模型，首先在第一次博弈的时候，将波束成形算法中的信号方向和功率分配映射为博弈论数学模型中的"局中人"，将其建模为函数的极大极小值求解问题，先求解出信号方向；然后在第二次博弈的时候，将不同用户的功率分配过程描述为一个多用户的博弈过程，设计了功率分配更新算法，通过数学推导论证了纳什平衡点的存在性和唯一性。

Related algorithm\' s new application and algorithm\' s improvement andproof proposed include:Dijkstra algorithm,Intersect-Bellman-Ford *algorithm,n regular random graph,multi-dimensional scaling,FastmapAlgorithm,QoS algorithm,multi-view Expectation Maximization algorithmbased on Gaussian distribution hybrid model and so on.

具体涉及的算法新型应用或者算法改进涵盖了Dijkstra算法、IBF*(Intersect-Bellman-Ford)*算法、N正则随机图、多维定标算法、FastMap算法、QoS算法和多视图EM聚类算法等。

In this implementation, the evolutionary algorithm is hybridized with the simulated annealing algorithm and the hill climbing heuristic. The main aspects are as follows. The Metropolis criterion of the simulated annealing algorithm is introduced to select the offspring in order to make the algorithm more effective to escape the local optimum. In terms of the hill climbing heuristic, the local normal perturbing mutation operator based probability selecting is developed to enhance the local searching of the algorithm.

其主要工作是将进化算法与模拟退火算法及爬山方法相组合，引入模拟退火算法中Metropolis接受准则选择子代，提高算法跳出局部最优解的能力：借鉴爬山方法思想，构造了基于概率选择的局部正态摄动变异算子，以强化进化算法局部细搜索能力；同时进化算法以多种群方式实现，在降低计算时间的同时提高算法收敛到全局最优解的概率。

A high-performance modular exponentiation coprocessor, SEA, is presented here, and three novel ways are employed. First, a parallel binary modular exponentiation algorithm is used to decrease cycles, and a high radix Montgomery modular multiplication algorithm is modified to the radix based high radix Montgomery modular multiplication algorithm to increase the frequency; second when mapping algorithms to a systolic array, modular square and modular multiplication are alternatively computed to cover up the dependencies between iterations in the RBHRMMM algorithm and the bypass is used to eliminate the dependencies in the PBME algorithm; third, multipliers are split first, and then accumulations are compressed as partial products to decrease carry propagation delay in the critical path.

SEA是一种针对大数模幂的高性能协处理器，其主要采用如下3种加速方法：①采用二进位并行模幂算法和以基数长度为处理字长的高基数Montgomery算法；②将算法映射到脉动阵列处理结构，并交替计算平方和乘以掩盖RBHRMMM算法中的相关，同时应用定向技术消除PBME算法中的相关；③基於"先拆分乘法、后将累加压缩"的思想优化关键路径。

Finally, base on research of genetic algorithm and rough sets, analysis of the existing primary algorithm of attribute reduction based on the traditonal genetic algorithm, an improved algorithm of rough set attribute reduction base on dependability and genetic algorithm is presented in this paper.

最后，对遗传算法和粗糙集理论研究的基础上，通过分析现有的约简算法，提出一种基于依赖度的属性约简改进算法，改进后的算法可以求取属性的一个约简。

By introducing the steepest descent algorithm , conjugate gradient algorithm , Newton algorithm , Rayleigh Quotient Iteration algorithm and variable metric algorithm , the MSBMDA is implemented iteratively.

MSBMDA算法将盲多用户信道估计或多用户信息符号估计的模糊度限制到以±1，±j为元素的对角矩阵内，并消除了用户次序的模糊度。

On global optimal algorithms, a heuristic 0-1 Integer Liner Programming algorithm is achieved, which combines heuristic enumeration method and revised simplex method. Simulation experiments show that the degree and optimization efficiency in our algorithm is obviously improved compared with the MATLAB 7 bintprog function that is a 0-1 integer programming algorithm. Moreover our algorithm isn\'t relevant to the scale changes of Web services composition and candidate service sets, thus it is applicable for the scenes that the scales of Web services composition changed dynamically. But for Web services composition with service alliance, the algorithm is unable because the non-linear global optimal model of the fitness function and QoS constraints can\'t be expressed in linear mode.

在全局优化算法研究上，基于启发式0-1整线性规划算法结合了修正单纯形法和启发式枚举法，仿真实验表明该算法与MATLAB 7的0-1整数规划方法比较，在优化程度及优化效率上得到了显著改进，并且对服务组合和候选服务集合的规模变化没有明显的相关性，因而该算法可用于服务组合规模动态变化的场景，但该算法不能应用于存在服务联盟的非线性全局优化模型。

"Please accept this talisman as a token of our thanks."

请收下这个护身符以表达我们的感谢。

If I have that magic, I will be more acceptable in the society.

如果我拥有那种魔法，我将更加被这个社会所容纳。