查询词典 algorithms

Some improved parameter estimation algorithms are presented , their convergent properties are proved by using the martingale convergence theorem .

围绕这两个方面给出了一些改进的参数估计算法，并用鞅的各种收敛理论对之进行了严格的数学证明。

We prove, under some mild assumptions, the local convergence theorem for this class of dual algorithms and present the error bound for approximate solutions.

在适当的假设条件下，证明了该类算法的局部收敛性质，并给出近似解的误差界。

These modified algorithms show both faster convergency in benchmark examples as compared to the conventional BP algorithm.

这些修正算法都能明显地改善标准BP算法的收敛速度。

Most likely, you will have to create new algorithms and convert data structures and mechanisms working with them.

最有可能的，你必须创建新的算法和数据结构和转换机制，与他们一起工作。

The new methods exceed the performance of the traditional convex combination fusion algorithm and the optimal fusion algorithm in a wide range of process noise. Simulation results show the new algorithms' validity and superiority.

这两种方法在不同过程噪声水平下，性能表现都超过凸组合融合算法和最优融合算

The convex hull of SBGB and subdivision algorithms are also discussed.

此外，还讨论了SBGB曲线的包络及细分算法。

Two algorithms are presented for determining the medial axes of a convex polygon and an arbitrary simple polygon.

提出确定凸多边形中轴和任意简单多边形中轴两个算法。

In view of that conventional algorithms of collision detection spend a lot of detection time on complex polyhedrons, an algorithm to divide a convex polyhedron was presented and proved.

针对传统的碰撞检测算法对于复杂多面体之间的碰撞检测时间过长的缺陷，提出并证明了一种凸多面体的剖分算法，该算法能将复杂的凸多面体剖分为简单四面体，利用基于MPI(Mes-sagePassingInterface)并行处理的方法来提高碰撞检测的实时性。

In chapter three, we prove that there exist solutions to the Ky Fan variation inequality, as the set-valued mappings are defined on spheres in infinite dimensional Banach spaces or odd dimensional Euclidean spaces, following from these theorems, we obtain some fixed point theorems for set-valued mappings defined on a sphere. When G is an approximate compact convex subset of E, or G is a almost quasi-convex set-valued mapping, we prove that there exist solutions to and type generalized Ky Fan variation inequality, following these theorems, we prove several best approximation theorems and coincidence theorems involving two set-valued mappings and two different spaces. In chapter four, we first present a new Simplicial algorithm for computing the Leray - Schauder fixed points, the algorithm can solve the set-valued nonlinear complementarily problem. We give a condition to guarantee the computation proceeding in a bounded region. We present integer-labeling algorithms for computing fixed points of some set-valued mappings, the best approximation points and solutions to a kind of set-valued variation inequalities.

第四章给出了计算定义在非凸集上的非自映射的Leray-Schauder不动点的算法，而现有的不动点算法都是计算凸集的上半连续集值自映射的不动点；给出了保证计算有界的一个充分条件，我们的条件大大弱于Mdrrill条件，我们的算法也可用来计算Eaves不动点；给出了集值非线性互补问题存在解的一个充分条件，此时可利用Leray-Schauder不动点算法来求解；向量标号算法以往是计算集值映射不动点的唯一有效算法，我们给出用整数标号算法计算一类集值映射的Kakutani 不动点的算法；定义在紧凸集上的连续映射不一定有不动点，但一定有最近点，最近点是不动点概念的推广，我们给出了计算最近点的算法；集值映射变分不等式尚无有效的求解算法，我们给出求解一类集值映射变分不等式的算法。

Based on the theories of Differential Geometry and Geodesy,algorithms and formulas for direct and inverse solution of geodetic problem in the new form of geodetic coordinate system on the ellipsoidal surface are deduced in this paper.

基于地球椭球面上所构建的新型大地坐标系，推导出用新大地纵横坐标表述的大地主题解算公式，并研制了相应的正反解算法。

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.

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