查询词典 algorithms

Finding 3D edges directly from 2D points, the algorithm is superior to the general algorithms in this field; introducing a cylinder as an additional subobject, it extends the domain of 3D objects which can be generated by the general algorithms for reconstruction.

算法直接由二维点求三维边，从而改进了这一领域的一般算法。通过引入圆柱体作为附加的子实体，扩充了一般算法产生的三维实体域。

Now HLS has absorbed much research attention in IC-CAD field. In HLS, algorithms represented by algorithm description language are transformed into hardware structure description consisted of resisters and transfers. In the transforming process, synthesis of datapath is a core. The other works is based on it. And in the synthesis of datapath, operation scheduling, functional unit allocation and binding all are NP-Completeness problems. The structure of their solution space is not known well. If we must find a global optimum solution, we can only use exhaustion. This way needs too much computation for VLSI synthesis, and is impractical in Industry. So usually heuristic algorithms are used to search suboptimum solution.

因此HLS成为国际IC-CAD学界的一个热门，它把算法描述语言表达的算法转换为用寄存器、传输器描述的硬件结构，其中以数据通路的综合为主体，其余工作皆以此为基础；而在数据通路综合中，操作调度、功能单元分配、连线等均属NP问题，目前该问题的解空间尚未充分了解，如要求得最优解，只有采取穷举搜索法，对于大规模集成电路而言运算量太大，工业中无法承受，故通常都采用启发算法求次优解。

Firstly, the paper expatiates the essence principle of the motion estimation based block matching, introduces Full Search method and several typical motion estimation fast algorithms, and analyzes each characteristic, then to sum up the key technology for increasing the motion estimation search efficiency; Secondly, it stress introduces three motion estimation fast improved algorithms: the improved algorithm based Full Search method, it imports successive elimination algorithm、subsample and termination condition to increase search speed for enhancing the real time of Full Search.

本文首先阐述了基于块匹配法的运动估计基本原理，介绍了全搜索法和几种典型的运动估计快速算法，分析了各算法的特点，在此基础上总结了提高运动估计搜索效率的几个关键技术。接着重点介绍了本文提出的三种运动估计快速改进算法。基于全搜索的改进算法，是在全搜索的基础上尝试引入了连续排除算法、子抽样和终止条件来提高搜索速度，增强全搜索的实时性。

In the first chapter, the application background and the main algorithms of the complementarity problems is introduced. In Chapter 2, some basic definitions and theories of complementarity problems are introduced. The 3rd chapter is the most important part of this paper, in which a new class of smoothing Newton method is detailed, also the global and local superlinear convergence is established for the method. In the 4th chapter, we propose some numerical experiment, and the results show the effectiveness of the proposed algorithms.

全文共分为四章，各部分内容安排如下：第一章是绪论部分，介绍了互补问题的应用背景和近年来有关互补问题求解方法的研究成果；第二章介绍了与互补问题相关的一些定义以及相关的定理和推论；第三章是本文的重点，构造了求解互补问题的一类光滑牛顿法，从理论上证明了算法的全局收敛性和局部超线性收敛性；第四章是数值实验，通过数值试验的结果进一步证明了算法的可行性和有效性。

In this paper, we mainlydiscuss the above functions and apply the violation constrained functions to filterSQP methods the algorithms, furthermore, we prove that the new algorithms haveglobal convergence and superlinear convergence under the mild conditions.

本文着重讨论这几种NCP类函数的性质，并把它们所定义的违反约束度函数应用于SQP算法中，并证明了在一定的条件下新的算法具有全局收敛性和超线性收敛性。

In Chapter 2, combining two types of the preconvex part of modified Broydens family with Armijo line search, we get two algorithms for solving unconstrained optimization problems, and prove these algorithms are global and superlinear convergence under some suitable conditions.

第二章，将两种修改Broyden非凸族与Armijo线搜索相结合，得到了求解无约束最优化问题两种算法，在适当的条件下，证明了这些算法具有全局收敛性和超线性收敛性。

The experimental result conducted on large-scale corpus indicates that the performance of this algorithm is remarkably higher than other usual lexical tagging algorithms such as hidden markov model. Meanwhile, by introducing the concept of confidence interval, implement an lexical tagger that combines SVM and HMM algorithms, reaching both high performance and efficiency.

针对句法分析的前期任务：词性标注的特点，提出创新的排歧算法，使得其精度和效率都得到非常显著的提高，为实现高精度和高效率的句法分析系统提供良好的基础。

The basic theory of cellular automata, the ways how algorithms are designed based on cellular automata and the security of the algorithms have been discussed in this thesis.

本文主要对细胞自动机的基本理论、利用细胞自动机构造密码的各种方式及其安全性进行了研究。

This paper deeply discusses the theory and algorithms of these three correlation projection analysis, and the proposed algorithms are successfully applied in face recognition and handwritten character recognition.

本文就三种相关投影分析的理论和算法进行了深入的研究和探讨，所提出的各种算法在人脸识别和字符识别方面得到了较成功的应用。

The algorithms of MUSIC and ESPRIT are introduced, which are the most important algorithms in array signal processing. A method is proposed to make the estimation of the covariance matrix become Toeplitz matrix using the Toeplitz characteristic of covariance matrix.

第2章建立了阵列信号的模型，主要分析了两种无方向模糊的阵列：阵元数大于6的均匀圆阵和非均匀L形线性阵列，并讨论了非均匀L形线性阵列无模糊设计的方法；然后介绍了在阵列信号处理中，两种最主要的算法：MUSIC算法和ESPRIT算法。

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.

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