查询词典 normal algorithm

Aimed at the safety requirement of WAP, the disadvantange of WAP＇s application model is analyzed, a new end-to-end safe model, named Double Encrypt＇s model, is developed. Its DES and IDEA algorithm are realized by the compiling language based on delphi 6.0, the most excellent IDEA algorithm that is suitable to encipher the algorithm in WAP application system is selected to transmit data safely.

为解决无线应用协议在应用中存在的安全隐患，探讨了WAP应用模型漏洞产生的原因，分析了目前WAP应用的3种实现模型及存在的不足，提出了一种新的端到端安全模型——双加密模型，并使用面向对象的编程语言DELPHI6.0实现了数据加密标准和国际数据加密算法两种对称加密算法，选择了适用于WAP应用的最优的IDEA算法。

For overlapping domain decomposition method, we prove the geometric convergence for continuous algorithm in the sense of energy norm by means of projection theory, analyze the convergence rate of the algorithm in detail. And we also discuss the discretization of the algorithm and its finite element implementation. Some numerical experiments are also given.

对重 叠型区域分解算法，利用投影理论，证明了连续型算法在能量模意义下的几何收敛性，详细地分析了算法的收敛速度，也讨论了算法的离散化及有限元处理，并给出了相应的数值实验。

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约束的基础上，均衡了组播树代价、网络链路负载和节点负载三者之间的关系，综合性能良好。

Emulation analysis makes clear as a result, as a result of compensatory Kaerman filter wave algorithm considered the impact of relevant observation error integratedly, accordingly, when flowing epoch number is more than 500 when, flowing precision of filter wave algorithm wants compensatory Kaerman the flowing algorithm of excel tradition.

仿真分析结果表明，由于补充卡尔曼滤波算法综合考虑了相关观测误差的影响，因此，当平滑历元数大于500时，补充卡尔曼滤波算法平滑精度要优于传统的平滑算法。

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.

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

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.

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