查询词典 algorithm of euclid

The basic theory of the algorithm for test pattern generation using satisfiability is explored, including represent method of SAT-ATPG, search algorithm and analyses of achievement techniques. We describe how to represent circuits and fault detection problem as Conjunctive Normal Form . We improve an effient search algorithm suited to ATPG based on basic satisfiability algorithm.

本文研究了组合逻辑电路测试向量自动生成的可满足性方法，主要进行了可满足性的测试生成原理、实现算法、性能提高和测试向量的最大压缩等方面的研究，改进了一种有效的测试生成搜索算法SAT-ATPG，提出了隐含多路敏化的故障效应单路定向传播方法SOPCA、控制输入跟踪算法CIT和测试衍生算法TD，取得了较显著的效果。

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算法的性能和改进算法后，给出了计算机模拟仿真结果，验证了对捷变频引信有源干扰抑制的合理性和可行性。

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基于变换的约束在光滑曲面上的曲线插值方法。

In this thesis, we implement a computational procedure to categorize and classify 3-D objects from their contour under a simple environment. First, we use foreground detection, Canny edge detection and speedy GVF snake to obtain the object's contour. The contour is then used to establish the object's features. Two databases are built using methods which compute similarity by modified aspect-combination algorithm proposed by Cyr and Kimia and new proposed aspect-combination algorithm. By using these two databases, we recognize 3-D objects using four recognition methods and compare their performance. Finally, a conclusion is made that our newly proposed algorithm is better than the modified algorithm proposed by Cyr and Kimia.

在本论文中，对一个在单纯环境下的三维物体，由撷取到辨识出此物体做了一个完整的实现，首先，利用前景侦测结合肯尼边缘侦测法和加速的梯度向量流动态轮廓侦测法，来得到物体轮廓，接著利用此轮廓找寻出物体的特徵，然后配合计算相似度的方法，代入修改后的Cyr and Kimia的外观结合演算法（aspect-combination algorithm）和新提出的外观结合演算法去建资料库，然后，对於三维物体则依据两种不同方法所建出的资料库，利用四种辨识的方法来辨识并比较其结果，最后得出新提出的外观结合演算法是优於修改后的Cyr and Kimia的外观结合演算法的结论。

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等局部优化的蚁群算法求解旅行商问题中得到启示：通过交换策略可以加快算法的收敛速度和获取更高质量的解，因此提出了基于交换策略的蚁群算法。

Chimborazo and Cotopaxi, took me by the hand.

越过琴博腊索山和科托帕克西山。

This car is in a good condition.

这辆车的状况很好。