并行算法

The conventional Hough transform can only count the number of feature points which are collinear, and can't record the end points of a line segment and its length. Thereby, this paper present an improved Hough transform to overcome these two shortcomings. The algorithm is parallelized and implemented in MCC. What's more, we give a parallel algorithm to identify and eliminate overlapping line segments. These advantages are very useful in the real applications.

本文针对传统Hough变换只能统计直线上黑色象素个数，不能记录线段的两端点坐标及长度的缺点，介绍了一种改进Hough变换算法，并在网孔处理机阵列中实现，还给出了能够识别并消除重复线段的并行算法，这些在实际问题中是很有用的。

In the algorithm designed here, polygon-fill algorithm and "Painter Algorithm" are used to display 3-D isoline,"Windup Storage" method to balance computer processing load,"Associative Fan in" method to conflate results, and "Run Length Compression" method to save network communication time.

运用多边形填充和"画家算法"，实现了等值线三维显示；根据等值线数据量随其属性值而变化的特点，设计了采用"卷帘存储法"实现负载平衡的等值线三维显示的并行算法；采用"结合扇入法"实现结果合并，并采用"运行长度压缩法"以缩短网络通讯时间。

However, due to decoherence, quantum coherence in QIQC will decrease, even vanish.

从本质上讲，量子并行算法是利用量子态的相干性而设计的算法。

A good parallel algorithms should be able to give full play to the multi-processor parallel computer s computing power.

一个"好的"并行算法应该能够充分发挥并行计算机多处理机的计算能力。

In the Uzawa algorithm, we use the HX preconditioner for the primal variable. The numerical results indicate that the new algorithm has good parallelization scalability and the iteration counts are independent of the mesh size and the jump range as for the floating subdo mains and interior cross-points.

数值实验结果表明，不论是对光滑系数还是对有无浮动子区域及有无内交叉点的跳系数情形，我们所设计的并行算法HX-Uzawa-p的迭代次数都基本不依赖于网格规模及系数跳幅，且具有很好的并行可扩展性。

Compressible ; multi-scales ; super compact symmetric finite difference scheme ; parallel algorithm ; block pipelined method

用分块流水线方法设计了超紧致差分格式的并行算法，进行数值实验及并行性能分析。

The derivation of the method is papered in highly paralleled relaxed Newton method for transient stability real-time simulation-paralel algorithm.

关于该方法的导出在《基于高度并行松驰牛顿方法的暂态稳定性实时分析计算的并行算法》［1］中发表。

Data remapping is used between successive computation steps of STAP. The effectiveness of the implementation is demonstrated with experimental results.

通过数据实验证明这种基于多DSP并行处理系统的STAP并行算法具有较高的实时性能。

As a result, a higher calculation efficiency is obtained on the coarse multiprocessors.

本文提供的并行算法在粗粒度并行计算机上可以获得比较好的效果。

The experiment result show that the designed parallel algorithm has high speedup on NOW.

实验结果表明，设计的并行算法在网络并行计算环境中具有较高的加速比。

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.

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