算法的

It is a difficult task to parallelize the existing sequential algor ithm.

对已有的法进并化，是一项很困难的工作。

Bitonic is introduced and a theorem is proved. The algorithm of bitonic merge-sort is given.

介绍了二分序列的概念和定理证明，给出了利用二分归并进排序的法及实例.

The security of encryption algorithms depends heavily on the computational infeasibility of brute force attack.

加密法的安全性很大程度上取决于暴力破解的不可性。

Sometimes,the platform may shake acutely,and the beaconing can leave the eyeshot of CCD.

轮廓跟踪法采用的是经过改进后的目标邻域边界智能跟踪法。

The new methods can resolve the unclassifiable region problems in the conventional multiclass SVM methods.

该法解决了现有主要法所存在的不可分区域。

In the meantime, mechanisms against desynchronization attacks and cepstrum filtering are introduced to enhance robustness.

同时，通过引入抗异步攻击的机和倒谱滤波，增强了法的鲁棒性。

Screw compensation algorithm including coning and sculling compensations reduces the noncommutable error caused by rigid body .

设计的螺旋补偿法包括了传统的圆锥补偿和划船补偿,有效地减小了刚体转动的不可交换性误差。

The less switching loss mode and the overmodulation mode based on the proposed scheme are also presented.

介绍了基于本法的低开关损耗式和过调模式。

A local search algorithm for minimizing a nondecreasing supermodular set function is presented,and its performance guarantee is probed.

给出了求解一类具有简单约束的上模集函数最小的一种局部搜索法,并讨论了所给法的性能保证。

An approximation algorithm is presented for minimizing a nondecreasing supermodular set function, and its performance guarantee is probed.

摘要给出了求解一类上模集函数最小的一种近似法，并讨论了所给法的性能保证。

This paper proposed an algorithm for finding critical value of normal population variance under unbiassed tests with uniform dominance.

本文给出了求正态总体方差的一致最优化无偏检验的临界的法。

The effect that reduced the time of advect frames was achieved by flexible algorithm and reuse and copy relative pathlines.

采用弹性法来控种子的释放,通过重用、复相关迹线来减少迹线的积分计,达到减少生成每帧图像所需的时间的效果。

Beamforming algorithm in the minimum variance distortionless response beamformer and give a diagram of conventional beamforming and MVDR two waveforms.

波束形成法中的最小方差无失真响应波束形成器，并在一个图中给出常规波束和MVDR两种波形。

An example is given to demonstrate the proposed algorithm by comparing it with the other genetic algorithms presented in preterit articles.

最后给出相应实例，并与其它文献中的方法比较验证了本文法的可性和有效性。

At the same time, through constructing the new generation within phyle, the searching rate in optimization of the algorithm is increased.

同时，提出了在宗族中构造子代种群的思想，提高了法的寻优效率。

It is indicated by experimention that the outcome of this algorithm is very efficient，especially in those problem who fulfil triangle inequation.

经过实验表明，此类法求解的近似度很高，尤其是在满足三角不等式的中，误差更低。

The concept of in-place quicksort binary tree has great theoretical and practical reference value to the research and improvement of sorting algorithm.

原地快速排序二叉树的概念对排序法的研究和改进具有很好的理论和实用参考价。

The PSO algorithm is a new evolutionary computation method which is applicable to complex optimization problems that are nonlinear, nondifferentiable and multimodal.

微粒群法是一种新兴的法,它能有效地解决非线性、不可微、多峰的复杂优化。

The effect that reduces the time of advect frames is achieved by control released seeds and reuse pathlines which have been saved.

采用种子控法来控种子的释放，通过重用已保存的相关迹线来减少迹线的积分计，达到减少生成每帧图象所需的时间的效果。

Proportion of solid colour fibres can be exactly predicted utlizing the least square calculating method.This colour matching result is matchable to spectrum.

使用最小二乘法可以准确的预测各单色纤维的比例，配色结果可以达到光谱匹配。