查询词典 division algorithm

FCM algorithm is a clustering algorithm based on the division of its thinking is that it is making is divided into clusters with the greatest similarity between the object and different minimum similarity between the clusters.

FCM算法是一种基于划分的聚类算法，它的思想就是使得被划分到同一簇的对象之间相似度最大而，不同簇之间的相似度最小。

Real AdaBoost algorithm demands division of the sample space. The traditional finite division can not reflect the distribution of positive and negative samples.

连续AdaBoost算法要求对样本空间进行划分，传统的等距划分无法体现正负样本各自的分布规律。

In this paper, a new real AdaBoost algorithm based on multithreshold method was developed. Through the selection method of multioptimization threshold and combining the strategy of weak classifier threshold selection in discrete AdaBoost algorithm, the rational division of sample space was implemented.

对基于连续AdaBoost算法的人脸检测方法进行了改进，结合离散AdaBoost中弱分类器的阈值选取策略，通过多重最优阈值选择方法实现了样本空间的合理划分。

Finally we also discuss the algorithm of syllable division, correcting algorithm, multithread algorithm and algorithm dealing with the rules of vowel and consonant harmony and the final vowel change in the Uyghur language.

此外，本论文叙述了分音节算法，替换算法，多线程处理算法"语音的和谐"处理算法和"语音的同化"处理算法等关键性的算法。

The traditional Givens rotation algorithm involves root computation that needs more hardware resources, a Givens rotation algorithm without root and division computation is presented. And, combined with special structure of input signal matrix, a interference suppression algorithm with low computation is proposed. The narrowband interferences are modeled as autoregressive process and digital signal.

传统Givens旋转算法涉及平方根运算，要消耗较多硬件资源或需要多次循环来实现，为此，提出一种无平方根与除法运算的Givens旋转算法，并结合信号输入矩阵的特殊结构，给出一种低复杂度的干扰抑制算法，将窄带干扰建模为自回归过程以及数字窄带信号。

In this paper, we introduce the algorithm of Schoof-Elkies-Atkin to compute the order of elliptic curves over finite fields. We give out a fast algorithm to compute the division polynomial f〓 and a primitive point of order 2〓. This paper also gives an improved algorithm in computing elliptic curve scalar multiplication. Using the method of complex multiplication, we find good elliptic curves for use in cryptosystems, and implemented ElGamal public-key scheme based on elliptic curves. As a co-product, we also realized the algorithm to determine primes using Goldwasser-Kilian's theorem. Lastly, the elliptic curve method of integer factorization is discussed. By making some improvement and through properly selected parameters, we successfully factored an integer of 55 digits, which is the product of two 28-digit primes.

本文介绍了计算有限域上椭圆曲线群的阶的Schoof-Elkies-Atkin算法，在具体处理算法过程中，我们给出了计算除多项式f〓的快速算法和寻找2〓阶本原点的快速算法；标量乘法是有关椭圆曲线算法中的最基本运算，本文对[Koe96]中的椭圆曲线标量乘法作了改进，提高了其运算速度；椭圆曲线的参数的选择直接影向到椭圆曲线密码体的安全性，文中利用复乘方法构造了具有良好密码特性的椭圆曲线，并实现了椭圆曲线上ElGamal公钥体制；文中还给出了利用Goldwasser-Kilian定理和椭圆曲线的复乘方法进行素数的确定判别算法；最后讨论了利用椭圆曲线分解整数的方法并进行了某些改进，在PC机上分解了两个28位素数之积的55位整数。

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)做对比进行仿真。

The methods for enhance the performance of multiplier are analyzed first, including Booth algorithm, Baugh-Wooley algorithm for direct 2's complement multiplication and the way for sign extension prevention when using Booth algorithm. Then the multiplier for both fixed-point and floating-point operation is designed. Finally the iteration algorithm for floating-point division is presented.

首先分析了提高乘法器性能的常用技术，包括Booth算法、直接进行补码乘法的Baugh-Wooley算法、采用Booth算法进行乘法计算时防止符号扩展的方法等，然后讨论了定浮点乘法器的设计，最后讨论了浮点除法运算的迭代算法。

Finally we also discuss the algorithm of syllable division, correcting algorithm, multithread algorithm and algorithm dealing with the rules of vowel and consonant harmony and the final vowel change in the Uyghur language.

此外，本论文叙述了分音节算法，替换算法，多线程处理算法&语音的和谐&处理算法和&语音的同化&处理算法等关键性的算法。

The traditional Givens rotation algorithm involves root computation which need more hardware resources, the paper presents a Givens rotation algorithm without root and division computation, combined with the special structure of the input signal matrix, a interference suppression algorithm with low computation is also proposed.

传统Givens旋转算法涉及到平方根运算，这种运算要消耗较多硬件资源或需要多次循环来实现，文中给出一种无平方根与除法运算的Givens旋转算法，并结合信号输入矩阵的特殊结构，给出一种低复杂度的干扰抑制算法。

Objective To investigate the effects of interleukin-1 β converting enzyme gene on the biologic characteristics of ovarian cancer cells.

目的 探讨白细胞介素-1 β转换酶的表达，对卵巢癌细胞生物学特性的影响。

Campylobacter: This illness is the most commonly identified cause of diarrheal illness in the world.

弯曲：这种病是最常见的原因查明腹泻病，在世界上。