查询词典 algorithm

Chaikin algorithm is the simplest discrete curve modeling method.In thepaper planar Chaikin algorithm is generalized into sphere,and the practicability ofthe algorithm as well as the continuous differentiable property of the generatingcurve is proved.It is shown that the curve generated by Chaikin algorithm is apiecewise spherical Bezier curve of second kind of order two.Furthermore,generalspherical corner-cutting algorithms are discussed,and it is pointed out that thecurve generated through corner-cutting has"Spherical Variation DiminishingProperty".3Curve interpolation method restricted on a smooth surface based ontransformation.

Chaikin算法是最简单的离散曲线造型方法，文中将Chaikin算法推广到球面，证明了算法的可行性和生成曲线的连续可微性，指出球面Chaikin算法得到的曲线是分段的二次第二类球面Bezier曲线，并给出了用球面Chaikin算法构造球面插值曲线的算法；进一步，文中讨论了一般的球面割角算法，指出由球面割角算法得到的曲线具有"球面变差缩减性质"。3基于变换的约束在光滑曲面上的曲线插值方法。

A parallel algorithm for certain real symmetric block-tridiagonal linear systems on distributed-memory multicomputers is proposed. This algorithm is based on the block factorization of the coefficient matrix. This algorithm is used to solving the block-tridiagonal linear systems resulted from the finite difference approximation to Poisson's equation with Dirichlet boundary conditions. Then we get a parallel algorithm which speedup tends to linear speedup.

7研究了一类实对称块三对角线性方程组的分布式并行求解，提出了一种基于块矩阵分解的高效分布式并行算法，将其应用于求解带Dirichlet边界条件的Poisson方程导出的块三对角线性方程组，得到加速比趋于线性加速比的分布式并行算法，理论上说，这也是并行算法的理想情况。

A novel hybrid algorithm, which combines predictor-corrector primal-dual interior point method and genetic algorithm, is presented for dynamic and static reactive optimization in this dissertation. The algorithm fully make use of the advantage of interior point method in solving successive optimization problem and the advantage of genetic algorithm in solving discrete optimization problem. The original problem is divided into three parts: total successive problem, discrete problem and successive problem.

结合内点法和遗传算法，本文提出了一种新颖的混合算法用于求解动、静态无功优化问题，算法充分利用了内点法易于求解连续优化问题和遗传算法易于求解离散优化问题的优势，将原优化问题分解为初步的连续优化问题、离散变量优化问题、连续变量优化问题这三个子问题分别求解。

Based on the research of TMS320C64xx program and codeoptimization, 3×3 median filter algorithm ameliorated, 5×5 median filter algorithm ameliorated algorithm and histogram equiangular algorithm is realized. The key code effecting process speed is optimized and the effect is good.

在研究TMS320C64xx的软件编程和代码优化的基础上，实现了改进的3×3中值滤波算法、改进的5×5超快速中值滤波算法和直方图均衡算法，并对影响处理速度的关键代码进行了优化，取得了很好的效果。

Based on a Hopfield neural network mode for combinational circuit test generation, a test generation algorithm with global searching ability is proposed. This algorithm is the combination of chaotic searching with gradient algorithm. By means of the inherent stochastic and ergodic property of chaotic searching, the problem of being trapped in local minimum of gradient algorithm can be solved.

基于组合电路测试生成的离散Hopfield神经网络模型，将混沌搜索与Hopfield网络的梯度算法相结合，利用混沌搜索的内随机性及遍历性来克服梯度算法易于陷于局部极小的缺点，形成一种具有全局搜索能力的测试生成有效算法。

Aiming at these problems, an expectation maximum based MAP algorithm is proposed and the performance is analyzed. The proposed algorithm avoids large matrix operations by using the EM algorithm to decompose the MIMO channel estimation problem into a series of single input single output problems. Besides, a joint estimation is carried out over multiple OFDM symbols in order to enhance the data transmission efficiency and the estimative performance of the proposed algorithm.

该算法利用EM算法把多输入输出信道估计问题化简为一系列独立的单输入输出问题，避免了大规模矩阵运算，降低了MAP算法的计算复杂度；为进一步改善MAP算法的数据传输效率及其估计性能，可通过对多个连续的OFDM符号进行联合信道估计。

This paper extends the ant colony algorithm which is used for solving 0-1 knapsack problem in reference [7], and gets enlightenment from the ant colony algorithm with 2-opt local optimization for solving traveling salesman problems: Exchange strategy can make the algorithm have faster convergence rate and get better quality solution. So this paper presents the ant colony algorithm based on exchange stragegy.

本文推广了文献[7]中求解单维0-1背包问题的蚁群算法，并从结合2-opt等局部优化的蚁群算法求解旅行商问题中得到启示：通过交换策略可以加快算法的收敛速度和获取更高质量的解，因此提出了基于交换策略的蚁群算法。

Since the load of the node is proportional to the ID space that the node is responsible for, the ISLB algorithm distributes ID space based on the node capacity. Because the load of the node also increases with the number of fan-in edge of the node, the LSLB algorithm distributes the load by redirect the fan-in edge of the node. Both the ISLB algorithm and the LSLB algorithm are able to balance the load efficiently.

在结构化对等网络中，对等节点的负载与该节点所负责的ID空间的大小成正比，ISLB算法按节点的处理能力分配ID空间；在另一方面，由于节点的负载随该节点入度数的增加而增加，LSLB算法统计节点各入度的负载和节点的总负载，并通过入度的转移使对等网络负载平衡。

Ant colony algorithm is a simulation of ant foraging behavior of heuristic process This paper introduces the concept of ant colony algorithm and its development trends, analysis of the basic principles of ant colony algorithm to establish a general mathematical model of ant colony algorithm, presented its typical application.

蚁群算法是一种模拟蚂蚁觅食过程行为的启发式算法，本文介绍了蚁群算法的概念及其发展趋势，分析了蚁群算法的基本原理，建立了一般的蚁群算法数学模型，提出了它的典型应用。

A generalized Gaussian Laplacian eigenmap algorithm based on geodesic distance is proposed,which incorporates geodesic distance and generalized Gaussian function into the original Laplacian eigenmap algorithm.GGLE algorithm can adjust the similarities between nodes of neighborhood graph,and can preserve the different degrees of local properties by using super-Gaussian function,Gaussian function or sub-Gaussian function.Moreover,GGLE can avoid the deficiency of Euclidean distance by using geodesic distance when neighborhoods of data points are enlarged for preserving more neighborhood relations.Experimental results show that the global low-dimensional coordinates obtained by GGLE have different clustering properties and different degrees of preserving local neighborhood structures when different generalized Gaussian functions are used to measuring the similarities between high-dimensional data points.(3) An ensemble-based discriminant algorithm based on GGLE is proposed.

该算法将测地线距离和广义高斯函数融合到传统的拉普拉斯特征映射算法中，可以调整近邻图结点间的相似度，通过选择超高斯、高斯或者次高斯函数来实现不同程度的近邻局部特性的保持；而且当需要保持更多的近邻关系使得数据点邻域增大时，采用测地线距离可以避免欧氏距离度量不合理的缺陷；实验结果表明在用不同的广义高斯函数度量高维数据点间的相似度时，局部近邻结构保持的程度是不同的，GGLE获得的全局低维坐标也呈现出不同的聚类特性。

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.

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