查询词典 parallel algorithm

In the system of anti-active-interference, we introduce the FBLMS algorithm which can overcome the drawback of exacerbation of the convergence properties in the domain of time due to eigenvalue spread of input signal correlation matrix and improve the processing rate because of the parallel properties of the FBLMS algorithm. After discussing the properties of the FBLMS algorithm and its developed algorithm, the paper presents the result of computer simulation and proves the reasonableness and feasibility of canceling the active interference in frequency agility fuse.

在捷变频引信抗有源干扰系统中，引入了频域自适应滤波算法FBLMS，可以克服输入信号相关矩阵特征值分散所导致的时域横向滤波算法收敛特性恶化的缺点，并且，由于算法的并行处理特性，大大提高了算法的实时处理性能，本文在分析了频域FBLMS算法的性能和改进算法后，给出了计算机模拟仿真结果，验证了对捷变频引信有源干扰抑制的合理性和可行性。

With the view of kinematics equivalence between parallel manipulators and serial manipulators, a supposed serial mechanism which is kinematically equivalent to parallel manipulator and six branches regarded as six branch serial mechanisms are used to generate interation algorithm, which is based on equivalent generalized coordinates.

近年来，并联机器人的研究已成为机器人学研究的热点之一。井联机器人是基于并联闭链机构上开发的。而并联机构是由上下平台及若干分支构成，因此出于末端的高精度以及结构的简洁、紧凑的需要，运动副之间很可能出现因结构设计带来的运动耦合问题。

Theoretic models and methods using nonnumeric parallel optimization algorithm, genetic algorithm and simulated annealing algorithm, to adjust and control the production-injection system were made with taking the net present value as the objective function and coupling economic model, reservoir model, wellbore model including producer and injector, and choke model.

以净现值为系统目标，耦合经济模型、油藏模型、注采井筒模型和油嘴模型，首次建立利用非数值并行算法——遗传算法与模拟退火算法调控注采系统的理论模型与方法，对不同开发阶段与不同约束条件下的注采系统进行最佳调控，使之保持最优生产状态。

In this paper, a lot of research works of algorithms of mining CAD has been done. Many important mine specialty graph operation algorithms have been put forward. The main results are as follows: polygons cut out algorithm, two close polygons mutual, merge and subtract algorithm, polygon vector fill, any vector polygons area calculating and sequence polygons or multifold which has the direction and region area calculating, curve smoothing, graph element search for any region, graph element attrib collect in any region, parallel polygon or vector intersection-point push out or pull in, ore reserves and grade calculating for any type polygon, mine spatial data searching and boundary line tracking and automatic link algorithm etc.

论文在矿山图形算法研究方面做了大量的工作，提出了许多有价值的矿山专业图形运算算法，主要算法有：多边形裁剪算法、闭多边形的加、减、并算法、多边形的矢量填充算法、任意有向多边形、有向多连域、有向多边形序列面积算法、多种曲线光滑算法、任意区域的图元搜索算法、任意区域图元属性提取算法、多边形平行外推/内缩算法、任意多边形储量品位计算、矿山空间数据搜索算法、界线的自动追踪和连接等。

Design Krylov subspace conjugate residual squared algorithm for nonsym-metric linear systems and the improved conjugate residual squared algorithm for distributed parallel computing based on biconjugate residual method algorithm, and give theoretical analysis and comparisons of algorithms for two algorithms.

基于BiCR算法设计了求解非对称线性方程组Krylov子空间平方共轭残差算法和适合分布式并行计算的改进的平方共轭残差算法，并对两种算法进行了理论分析和算法比较，串行和并行数值试验表明所提方法具有较好的收敛速度和并行性能。

Hypercube has many advantages, such as smaller diameter, simple routing algorithm, many parallel paths between any two nodes, and fault-tolerance, on the other hand that the Hypercube nodal degree increased logarithmetically to the number of nodes has limited network population. So we propose a constant nodal degree hierarchical topology to remedy the weakness of Hypercube and take advantages of Hypercube most. Given the definition of FCCN we analyse the basic properties including nodal degree , number of links , extensibility and diameter (maximum network communication delay). Also we proposed a simple and self-routing algorithm applied in FCCN. Although the self-routing algorithm is not optimal, but at more than 82% case it can get the shortest path, and the percent is larger and larger increased with network levels. By the self-routing algorithm the internodal distance is calculated to evaluate the network communication delay more clearly. The average internal distance is in order of the cubic root of the network population that is almost same as logarithmetically relation in a few thousands. FCCN is a highly scalable network due to its recursive construction.

首先在比较了基本互连网络的基础上，看到超立体网络的杰出性能，包括网络直径小、寻路算法简单且为自寻路算法、容错能力好等等，但是由于其节点度随网络的规模的增加而按对数关系增长，使得超立体网络的应用规模受到极大限制，所以为了能最大限度利用超立体网络的优点的同时弥补其节点度方面的不足，作者提出了节点度等于常数4的FCCN网络结构，来最多地利用立方体网络的优点；然后在对FCCN网络进行严格的定义后，分析了网络的节点度、链路数、延伸特性、网络的直径（决定网络的最大通讯延迟）等，并提出了适于FCCN网络的简单的自寻路算法，计算自寻路算法可得到最短路径的比例，看到在多于82％以上的情况自寻路算法都是最优的，而且比例随网络层数的增加而增加；应用所提出的自寻路算法计算了可以更加准确反映网络通讯延迟的参数—网络平均节点距离，计算得到此参数与网络大小的立方根成正比，此比例关系在网络的规模在几千节点以内与对数关系的网络几乎一样；FCCN网络是一高度可扩展结构，这是因为FCCN的递归构成方式，使得网络在增加节点时其原有的拓扑结构可以保持不变，不需对网络进行重新设计，为网络的实用扩展提供了条件；理论分析得出FCCN网络是一种高度可扩展高性能网络的结论。

However,the analysis and design of parallel windings are more complicated.Parallel windings including litz wire,litz PCB,twisted and common parallel PCB are evaluated,then respective eddy current loss analytical models were built and systematical algorithm were also proposed for the loss models programming.

与采用单根导体的线圈比较，并联线圈不论损耗模型还是设计技术都有很大的不同，其线圈涡流损耗频率特性影响因素多[1-3]，很复杂，特别是对应用于平面变压器的并联PCB线圈，很难根据对高频涡流效应的直观理解和已有的高频功率变压器线圈损耗模型对其进行设计分析。

Based on these, parallel computing problem of matrix tensor product is discussed, some parallel computing models are presented, the algorithm complexity is analyzed, and the thought and process are elaborated by an example. block matrix ; tensor product ; permuted similar ; parallel algorithms ; computational complexity

文献〔l论述了Cannon算法在工作站机群上的实现，文献[2]提出了一种基于对角划分的并行算法，文献〔3〕提出了在分布式环境下并行求解对称带状矩阵特征值问题的并行二分/多分法及其改进，文献41给出了稠密对称矩阵三对角化的MPI+OpenMP混合并行算法，还有著名的Cannon

The ant colony algorithm is a novel category of bionic meta-heuristic system, and parallel computation and positive feedback mechanism are adopted in this algorithm. This algorithm is easy to combine with other methods in optimization, and has wide application in various fi elds.

蚁群算法是优化领域新出现的一种启发式仿生类并行智能进化系统，该算法采用分布式计算和正反馈机制，易于和其他算法结合，目前已得到了广泛的应用。

The genetic algorithm proposed in this paper is called pseudo parallel genetic algorithm, which is designed by author. This kind of search way improves the basic genetic algorithm.

本文用到的遗传算法是由作者自行设计的伪并行遗传算法，该算法是对基本遗传算法的改进，在收敛速度和全局搜索能力方面远远优于基本遗传算法。

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.

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