查询词典 algorithms

Some new concepts and algorithms are proposed,such as jobnomial sequence,job perturbation sequence,neighbourhood of job nomial sequence and jobsequence perturbation analysis.These job sequence PA algorithms extend PA techniques aboutcontinuous parameters to discrete parameters and provide some new kinds of tools for solving suchcombination optimization problem.

论文提出了工件序的邻域、摄动序等概念以及对工件序进行摄动分析的思想和算法，将传统的PA算法从连续参数领域推广到离散参数的组合优化领域，为此类组合优化问题增添了新的求解工具。

Aimed at 9-degree of freedom hyper-redundant module robot in intra-vehicular robot system, attention is given to the avoiding joint limits as an optimal mark. Two different iterative algorithms considering fault-tolerance for trajectory planning of redundant robot in Cartesian space are then proposed by using the method of differential locomotion. The first algorithm is for linear-path in which the pose of manipulator can be changed, the second is for circular-path in the plane decided by three noncollinear arbitrary points in the space. Experiments on the specimen robot platform are performed to validate the above algorithms.

以太空舱内机器人系统9-自由度超冗余模块机器人为研究对象，以避关节极限作为优化指标，考虑容错性能，利用微分运动的方法，分别提出了适于计算机迭代计算的冗余机器人在笛卡儿空间进行手爪姿态可变时的直线轨迹优化算法和手爪经过空间中任意不共线3点决定的平面内的圆弧轨迹优化算法。

To cope with highly nonlinear, nondifferentiable and multi-peak objective function, evolutionary algorithms which have the advantage of global solution searching can overcome the drawbacks of conventional algorithms such as slow speed, relatively poor precision and convergence to local solutions.

针对微波领域中优化问题的目标函数的高度非线性、不可导、多极值等特点，利用演化算法的全局搜索特性，可以避免确定性优化方法收敛速度慢、精度低、易于收敛到局部极小值的缺点。

Based on regression ICA and image reconstruction algorithms, some new algorithms for noise ICA and overcomplete ICA are proposed.

在进一步的收敛性分析中，我们获得了这类具有普遍意义的算法在迭代中的收敛条件，为在实际应用中算法的准确获得盲源分离结果提供了保证。

Finally, the problems existing in these algorithms and the prospects of the fuzzy partitional algorithms are discussed.

最后总结了基于划分的模糊聚类算法普遍存在的问题及其发展前景。

For this new method takes the local information to evaluate the clustering result, it will be appropriate for both the spherical data and the data with irregular structures. Further more, it has no addition request for the clustering algorithms and it will be applicable for most partitional clustering algorithms.

基于这个原理，这个新的指标既能适用于球型数据集，也能够适用于非规则形状的数据集，而且它对聚类算法本身也没有额外的要求，对于大部分的划分聚类算法都是有效的。

In order to study these algorithms systematically and deeply, they are reviewed in this paper based on c-means algorithm, from metrics, entropy, and constraints on membership function or cluster centers. Moreover, the advantages and disadvantages of the typical fuzzy partitional algorithms are discussed.

为了能更为系统和深入地了解这些聚类算法及其性质，本文从改变度量方式、改变约束条件、在目标函数中引入熵以及考虑对聚类中心进行约束等几个方面，对在C-均值算法的基础上得到的基于划分的模糊聚类算法作了综述和评价，对各典型算法的优缺点进行了实验比较分析。

These three algorithms can avoid to recompute the nth order head submatrix of the Jacobi matrix. Moreover, the last two algorithms are more stable, their precision can match well with the algorithm of Boley and Golub.

这三种算法都可以避免重构Jacobi矩阵的n阶首主子阵，并且后两种算法更稳定，数值精度可以(来源：A1cBC论c4文网www.abclunwen.com)与Boley和Golub的算法媲美。

The work of this present paper mainly includes the investigation of the structure of KDD system, the study of the basic concepts of rough set theory, the research of the questions in the heuristic reduct finding algorithms based the rough set theory used in the data reduction and the discretization in the field of KDD, and the development of the system which is used to study the algorithms of the rough set.

论文的主要工作是了解知识发现的体系结构，学习粗糙集理论的基本概念，研究基于粗糙集理论的约简算法在知识发现领域中进行数据约简和离散化两个方面存在的问题，开发用于粗糙集理论算法研究的实验平台。

In this thesis, we have proposed the algorithms of performing of three improving types, can improve the efficiency of prospecting of the unusual fluctuation database , so the improvement type of a thesis performs algorithms and will not need to rescan the whole database each time when there are newly-increased materials, the majority only needs to scan the newly-increased trade materials, in order to improve the efficiency of prospecting.

在本论文中，我们提出了三个改良式的演算法，第一个为Apriori演算法来动态探勘，其二为使用布林演算法为基础进行动态探勘，最后为以布林运算为基础之FP-tree的动态探勘，可以提升异动资料库的探勘效率，因为在过去的资料探勘技术中，在探勘关联规则的过程}式演算法当有新增资料时将不用每次都要重新扫描整个资料库，绝大部分只需要扫描新增的交易资料，以提升探勘效率。

Chimborazo and Cotopaxi, took me by the hand.

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

This car is in a good condition.

这辆车的状况很好。