查询词典 algorithms

Similarly, there are simple randomized in-place algorithms for primality testing such as the Miller-Rabin primality test , and there are also simple in-place randomized factoring algorithms such as Pollard's rho algorithm .

类似地，对於质数测试有简单的随机化原地算法像是米勒-拉宾检验，也有简单原地随机化整数分解算法像是 Pollard's rho 算法。

This paper first analyses and summarizes the ststus quo and evolution trend of encryption, some common used cryptograph are introduced, including the algorithms used in symmetric cryptosystem and asymmetirc cryptosystem. We describe the theory of each algorithms and compare the elliptic curve cryptosystem with the other two asymmetric cryptosystems to show the advantages of this algorithm. Second, the principle of ECC is discussed, including the math foundation of ECC, basic conception of elliptic curves, constructiong idea of ECC, operation on the elliptic curve and so on. Third, the current attacks of ECC were analyzed deeply, and an algorithm based on limited prime number field was constructed. We analyzed its realizability in theory, and implement it by using certain function of MIRACL software package. Latter half in this paper, the implementation model of a simple elliptic curve encryption system which based on GF has been introduced. The paper also put a deep analysis on the algorithm of point addition and point multiplication.

本文首先对密码技术的发展现状及其发展趋势进行了分析和综述，详细的介绍了私钥密码系统和公钥密码系统的发展，说明各种算法的原理和优缺点，并给出了一些典型的密码体制的简要分析，重点将椭圆曲线算法与其它几种公钥密码算法比较，说明椭圆曲线算法的优势；其次，探讨了椭圆曲线密码体制的原理，包括椭圆曲线密码的数学基础、基本概念、椭圆曲线密码体制的构造思想等问题；第三作者对椭圆曲线的攻击现状作了详细的分析，针对所使用的大素数域F_p，设计了素数域上安全椭圆曲线产生的算法，从理论上做了可实施性分析，从软件上做了具体实现；在本文的后半部分，提出了一个简单的基于有限素数域上的椭圆曲线加密方按算实现模型，并对SECES中设计的点加和点乘运算进行了深入分析。

In this paper evolutionary algorithms based on probabilistic models are studied, which are new evolutionary algorithms proposed recently.

概率分析进化算法是最近几年发展起来的一类新的进化算法。

A class of Probabilistic Modeling Evolutionary Algorithms are explored and their principles, models and algorithms are studied.

进化算法的共同特点是通过选择和重组过程模仿个体的进化过程。

Neural network competitive learning algorithms are widely used for vector quantization. In this paper, some typical competitive learning algorithms have been specially investigated and analyzed . A new competitive learning algorithm based on the neuron win probability is presented for vector quantization.

用于矢量量化的神经网络竞争学习算法徐勇陈贺新戴逸松（长春邮电学院，长春130012）（吉林工业大学，长春130025）摘要对典型的竞争学习算法进行了研究和分析，提出了一种基于神经元获胜概率的概率敏感竞争学习算法。

Algorithms are presented using prose instead of pseudocode to focus attention on the algorithms themselves, rather than on specific computational models.

用散文而不是伪代码来提出算法，将焦点集中于算法本身，而不是特殊的计算模型。

In the third chapter, we concerned PVT algorithms for bound constrained optimization problem and proposed two feasible PVT algorithms.

第三章，我们对含边界约束的PVT算法进行了研究，给出了求解边界约束优化问题的PVT可行算法。

Then the spatial index is constructed which includes not only the external approximate expression but also interior approximate expression of spatial object and is extended from tranditional index only with external approximate expression. The index structures of MR-tree and MRD-tree based on multi-approximate expression are set up with the prototype index of R-tree, and the relevant algorithms about the index of insertion, deletion and search are provided. Then, the efficiencies of constructing index based on the multi-approximate expression and window range query are analysised and compared. In addition, the several algorithms and efficiency of soving the maximum enclosed circle and maximum enclosed rectangle are discussed and analyzed during constructing index based on multi-approximate expression.

首先，论文讨论了空间数据的特点、空间数据库的关键技术以及空间对象间的拓扑、距离以及方向关系，分析了空间对象的外部和内部近似表达，然后将传统索引中只利用空间对象的外部近似扩展为既有空间对象的外部近似又有空间对象的内部近似，即以空间对象的多重近似来构建索引，并以R-tree为索引原型构建基于多重近似的MR-tree和MRD-tree索引结构，然后给出了相关索引的插入、删除及查找算法，并通过实验比较分析了基于多重近似索引与基于外部近似索引的构建效率及窗口范围查询效率。

The simulation results show the two improved algorithms is more superior in computational efficiency and real time operation to traditional algorithms.

仿真表明两种新算法误码率、信干比性能都优于传统算法，且收敛速度明显提高。

According to this method,four different 11-step algorithms with four different window functions which are rectangular window,triangle window,hanning window,and blackman window are designed. Analysis and simulation show that hanning window and blackman window with small lobes are less sensitive to errors. Seven different algorithms with the same phase shifting interval π/2 are designed by hanning window function,whose phase shifting steps are separately 5,11,15,39,51,76 and 101 steps.

选择矩形窗、三角窗、hanning窗和blackman窗生成4种11步移相算法，对振动误差和相移误差的分析验证了旁瓣小的hanning窗和blackman窗生成的算法对误差的灵敏度要小；再选择hanning窗生成了移相间距为π/2的5，11，15，39，51，76和101步7种移相算法，仿真验证了步数越多主瓣越小，对振动抑制能力越好，但需要更高的微位移器移动精度来获得有效的干涉条纹。

When this condition occurs, inbound replication with the source partner is stopped on the destination domain controller and event ID 2042 is logged in the Directory Services event log.

计算机密码学是研究计算机信息加密、解密及其变换的科学，是数学和计算机的交义学科，也是一门新兴的学科。

Instructions: click on the thumbnails to see a larger image, then use the left-right arrow keys to scroll through the slideshow.

使用说明：滑鼠点在小图上即可放大观赏。开启后键盘左右键可用来换照片。