查询词典 algorithms

In this thesis we discuss trust region algorithms for constrained nonlinear optimization problems by three chapters.

本文主要研究约束非线性优化问题的信赖域算法，全文分为三章。

The selection of starting center points of clustering has great effects on the constringency speed of this clustering algorithms and the performance of clustering.

聚类初始中心的选择对该聚类算法的收敛速度和聚类的性能都有很大的影响。

The computer simulation and the comparison with the similar algorithms show that its constringency is much better and its prematurity is infrequent.

通过计算机仿真分析和与同类算法的比较，此算法收敛速度快，不易陷入早熟，具有很强的鲁棒性和实用性。

Firstly, we suggest using context-free language to describe the start code string of MPEG-2 and using minimum-distance error-correcting parser to correct the errors in MPEG-2 start code string. This method hasn't been reported elsewhere. Secondly, side motion estimation rule is proposed for temporal error concealment and based on the rule, many new algorithms are proposed. Among which, the temporal error concealment method utilizing overlapped block motion compensation and side motion estimation rule has exceeded the best performance ever reported.

首先，提出用上下文无关语言描述MPEG-2起始码链，用最小距离误差校正剖析方法进行MPEG-2起始码链的识别与误差校正，该方法国际上尚未有同类报导；其次，提出了用边界运动估计准则进行时域错误掩盖，基于该准则提出了一系列新算法，其中基于重叠块运动补偿和边界运动估计准则的时域错误掩盖算法达到所有已知算法的最佳性能。

The paper first points out that the continued fraction analysis method is not the original idea of the refuted paper "The Attack on the REESSE1 Public Key Algorithms".

文章首先指出连分式分析方法并非"对REESSE1公钥算法的攻击"一文的原创思想。

The result verifies that the discrete model with power series direct discretization method requires 100 memory length to obtain the better approximation, while one with continued fraction direct discretization method requires only 10 order. Thus the continued fraction direct discretization method is preferable to digital realization of fractional order control algorithms in engineering applications.

研究结果表明，幂级数直接离散法得到近似离散模型需要记忆长度为100方可获得较好的近似，而连分式直接离散法近似离散模型为10阶时就可以获得较好的近似，因此连分式直接离散法比较适合于分数阶控制算法的实际工程应用。

In these algorithms, because of no requirements on the continuity and differentiability of the objective function, they have strong adaptability for the uncertain data and the traits of agility, strong intuitiveness and randomness; they have been put into applications broadly in a short time so as to become active approaches for solving optimization problems.

由于这些方法不要求目标函数连续可微、对计算数据的不确定性有很强的适应能力，且具有灵活性好、直观性和随机性强等特点，因此在很短的时间内就得到了广泛应用，成为解决优化问题的一种有力工具，并展示出方兴未艾的强劲发展势头。

In first part,The Theory and Simulation on Reconstruction Algorithms,webuild a well-defined mathematical model for OCT,on which we prove more than 10theorems,analyze and answer a series of significant questions about OCTreconstruction,from existence, uniqueness,continuousness,stability to sampling,resolution,ill-posedness and accuracy.

在上篇重建算法的理论与实践中，我们将OCT抽象为基于n维Radon变换的数学模型，从而分析、讨论、回答了从存在性、唯一性、连续性、稳定件到采样条件、分辨能力以及病态特件和重建精度等一系列在理论和了OCT的重建理论体系。

Optimization solution algorithm is the most important in topology optimization.Algorithms fit for discrete structure and continuum structure are all investigated. Thecharacteristic and different using limit of both optimization criteria method andmathematics programming method are all analyzed in this paper. OC algorithm and theseries MMA algorithm based on SIMP approach are deducedand used for the topology optimization problem of continuum structure.

优化求解算法是拓扑优化问题求解的核心和关键，本文系统分析了适用于离散结构和连续体结构优化的优化求解算法，重点讨论了 OC 算法和 MP 算法，分析比较了不同算法的特点和适用范围，推导了基于 SIMP 理论的优化准则法和 MMA 系列算法，并将MMA 系列算法应用于连续体结构拓扑优化问题的求解。

In this paper, the algorithms of building constrained Delaunay triangulation is discussed, a software system based on it is developed, and some researches are done on the contour map.

本文研究了限制性Delaunay三角网的生成方法，开发了相应的软件包，并在等高线图上进行了一系列试验研究。

We have no common name for a mime of Sophron or Xenarchus and a Socratic Conversation; and we should still be without one even if the imitation in the two instances were in trimeters or elegiacs or some other kind of verse--though it is the way with people to tack on 'poet' to the name of a metre, and talk of elegiac-poets and epic-poets, thinking that they call them poets not by reason of the imitative nature of their work, but indiscriminately by reason of the metre they write in.

索夫农 、森那库斯和苏格拉底式的对话采用的模仿没有一个公共的名称；三音步诗、挽歌体或其他类型的诗的模仿也没有——人们把&诗人&这一名词和格律名称结合到一起，称之为挽歌体诗人或者史诗诗人，他们被称为诗人，似乎只是因为遵守格律写作，而非他们作品的模仿本质。

The relationship between communicative competence and grammar teaching should be that of the ends and the means.

交际能力和语法的关系应该是目标与途径的关系。