查询词典 algorithm

General esprit algorithm good time, the calculation algorithm is a subspace trouble, I changed some matrix algorithm.

一般的esprit算法好的时间比较大，在计算子空间是算法比较烦，我改了一些矩阵算法。

In the algorithm similarity degree is a very essential and very important parameter, therefore this paper abandons the original self-adapted genetic algorithm's consistent strategy that algorithm do the mutation after the cross.

如何在已有研究的基础上，针对大规模这一特点，提出一些行之有效的算法，使调度算法更贴近实际应用，已成为近年来生产调度领域研究的一个新热点。

The modular inverse operation by extended Euclidean algorithm and the binary extended Euclidean algorithm are analyzed, and the improved modular inverse operation by binary extended Euclidean algorithm is presented in this paper.

基于现有的求最大公因子的方法，分析利用扩展欧几里德求模逆的方法，以及二进制扩展欧几里德算法，提出了利用二进制扩展欧几里德算法求模逆的方法，给出了几种算法性能比较的测试环境和测试结果。

Through analysing muddleheaded time alignment, build the network of the 3 make a present of before the layer that has many concealed node, be based on extensive to change a gender to consider to use lop algorithm to train, in node of concealed of part of the expunction on the foundation that assures to forecast precision in order to reduce network complexity, the overall situation that uses genetic algorithm to have searchs actor ability to train a network afresh, benefit appliance has algorithm of BP of the local ability that find actor to train this network again.

通过分析混沌时间序列，建立具有多个隐节点的3层前馈网络，基于泛化性考虑采用剪枝算法练习，在保证猜测精度的基础上消去部分隐节点以降低网络复杂性，利用遗传算法具有的全局寻优能力重新练习网络，利用具有局部寻优能力BP算法再次练习该网络。

At the early iteratives, the mutation rate is bigger and the aim is to make particles to explore smaller and isolate region and to avoid the algorithm trapping to the local optimum. While the algorithm runs, the mutation rate will be decreased to reduce the disturbing to the particles. IPSO adopts a new method that congregates some neighboring individuals to form multiple sub-populations in order to lead particles to explore new search space. Additionally, our algorithm incorporates a mechanism with a simple and easy penalty function based on the largest distance between the particle and the boundary of the feasible region to handle constraint.

IPSO采用了一种新型的变异策略，变异概率随着算法的运行是动态变化的：在算法运行初期，变异概率大，其目的是使算法不但能够探测到目标空间中的孤立区域，而且避免搜索陷入局部极值；在算法运行后期，变异概率逐渐变小，以减少对粒子的扰动；算法通过将部分具有邻近距离的粒子聚集成核形成多子群引导种群中粒子的飞行；采用一个简单的基于粒子与可行域边界最远距离的罚函数处理约束的机制，使得算法高效实现。

In the algorithm,a kind of merit function and the schemes of nonmono-tone line search are used to have the algorithm be of the global convergence andsuperlinear convergence and have the algorithm be of a extended application range,especially at time of the feasible initial point is hard to be obtained.

该方法适用于任意的起始点。并且使用了一类效益函数，ε—积极约束策略及非单调线搜索，从而使算法保持了整体收敛性和局部超线性收敛性，并具有较广的适用范围，尤其在可行的起始点难于得到的情况下。

By reviewing of the existing algorithms in CGE model, such as Scarf fixed point method, Newton-Raphson method, Tatonnement method, Johanson-Euler method, projected Lagrange method, genetic algorithm and simulated annealing algorithm, this paper expound each algorithm's principle and main problems, pointed out their respective strengths and weaknesses, and finally made a detailed comparative analysis.

本文通过对现有的求解算法进行综述，包括传统的Scarf不动点算法、牛顿迭代法、Tatonnement算法、Johanson-Euler法、投影拉格朗日算法，以及近期兴起的遗传算法和模拟退火算法，扼要说明它们的求解原理及存在的问题，指出各自的优缺点并作了详尽的比较分析与探讨，对于致力于推进CGE建模与仿真求解技术瓶颈突破的研究者们具体重要的参考意义。

Aim at the problems of great overhead and the lower stability in Ad Hoc routing technology, an improved ant colony algorithm is proposed to study an ant-based Ad Hoc routing protocol. In our algorithm, the ant foraging, labor division and task allocation algorithm is the basic designation thinking.

针对已有Ad Hoc路由技术中存在的开销大以及网络稳定性较低的问题，本文引入蚁群算法，提出改进思想，将蚂蚁觅食和分工的方法作为路由设计的基本思想，研究基于改进蚂蚁算法的Ad Hoc路由协议，并与比较成熟的AODV(Ad Hoc On-Demand Distance Vector)做对比进行仿真。

In order to simplify analysis of the mechanical characteristics of the damper for vibration, which is modeled by the fractional derivative Maxwell model, a sinusoidal algorithm is derived. The credibility and the advantage of this algorithm are validated by comparing the calculating results of this sinusoidal algorithm with the existing theoretical and experimental results.

为了简化振动环境下用分数微分Maxwell模型建模的缓冲器的力学特性分析，提出了一种正弦算法，并将该算法计算的结果与已有的计算结果和试验结果分别比较，证明了该算法的可靠性，突出了其优越性。

With long time study of many researchers, now three algebra function methods are formed which are parabola algorithm , suspension cable algorithm and perturbational algorithm.

经不少学者、专家的不断研究，迄今巳形成3种代数函数法：抛物线、悬索曲线、摄动法未取代悬链线作近似计算。

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.

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