算法

In order to improve the performance of traditional random walk algorithm,an image segmentation algorithm based on toboggan and random walk is proposed.

为了提高传统的随机游走分割算法的性能，提出一种基于滑降算法的随机游走图像分割算法。

It is shown by the analysis of its time complexity and completeness as well as the numerical experiment that the proposed algorithm can achieve the goal of completeness and rapid convergence.

对算法进行的时间复杂度和完备性分析以及数值实验表明，基于遗传算法的粗糙集属性约简算法具有完备、快速收敛等特点。

The improved algorithm supplied the exact reference phase for current d-q transformation,then detection accuracy of the algorithm wasn t influenced by voltage distortion,so it can detect the harmonic and reactive component of load current effectively.

该改进算法为电流的d-q变换提供精确的参考相位。采用改进的检测算法，电压畸变不会影响该算法检测的精确度，并能有效地检测负载电流的谐波与无功分量。

General approach for noise-free BSS and classical BSS algorithms of real domain data are discussed.

2分析和研究了无噪模型下盲源分离的一般方法和常规实数算法，提出了一类盲源分离的多源复数算法，在计算机上用仿真数据验证了算法的性能。

Theoretical analysis and experiment results prove that our presented technique is one of the fastest techniques for the stable, real-time animation of a kind of non-rigid objects.

进行织物悬垂模拟的实验结果表明，新的算法在求解过程中是收敛和稳定的，算法在实时性上较已有的方法有一定的优越性，同时该算法得到了良好的视觉效果。

The simulation results show that the algorithm gets higher saved rebroadcast and reachability than the probabilistic algorithm and the counter-based algorithm.

模拟实验表明，本算法在节省转发率和可达率两个性能指标上均优于概率算法和计数器算法。

The genetic algorithm pays attention to unknown area search . It has high speed and relative low precision. It will not get into local extremum. The BP algorithm searches the area that include whole-space minimum. It can improve speed and recision.

遗传BP算法利用遗传算法进行全局搜索，注重搜索未知区域，处理速度快而对精度要求不高，不易陷入局部极小点，而利用BP算法搜索有最优点的区域，提高搜索速度和精度。

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种移相算法，仿真验证了步数越多主瓣越小，对振动抑制能力越好，但需要更高的微位移器移动精度来获得有效的干涉条纹。

In this paper a recursion equation of butterfly FFT is represented according to which a program is given.

实际应用中全部点的FFT算法是冗余的，为解决少数点的FFT算法，文章导出了蝶形FFT的递归方程，给出实现少数点应用程序，进而提出直接多项式方法，较全部点迭代FFT算法具有更高的效

Half set of issues -- recursive algorithm, algorithm analysis and design of the algorithm, very useful.

半数集问题--递归算法，是算法分析与设计的重要算法之一，很有用的。

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.

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