查询词典 combinational algorithm

The algorithm for calculating natural neighbour co-ordinates and their derivatives based on Lasserre's algorithm for the volume of a convex polyhedron was derived and the generalized flowchart for NEM in 3D case was presented.

文中推导了基于 Lasserre凸多面体体积公式的三维自然邻结点坐标及其导数的算法，给出了三维自然单元法算法的流程图。

Under some assumption conditions, we also developed trust region and affine scaling algorithm and potential reduction algorithm for convex programming problem with linear constraints.

然后在一定的假设条件下，对线性约束下的凸规划问题我们给出了相应的信赖域仿射尺度算法和势函数下降算法。

Based on quickqull algorithm,an improved algorithm to determine the convex hull of 2-D point set was proposed in this paper.

凸包问题是计算几何的基本问题，分为平面点集凸包和多边形凸包2类。

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 不动点的算法；定义在紧凸集上的连续映射不一定有不动点，但一定有最近点，最近点是不动点概念的推广，我们给出了计算最近点的算法；集值映射变分不等式尚无有效的求解算法，我们给出求解一类集值映射变分不等式的算法。

Aiming at shadow influence problem in vision navigation process of agricultural robot, illumination invariant image based on shadow removal algorithm was introduced. An enhanced OSTU image segmentation method was used, and an optimized Hough transformation algorithm was used to extract crop line, and coordinate transform was applied to obtain navigation parameters.

该研究针对农业机器人视觉导航中存在的阴影干扰问题，采用基于光照无关图的方法去除导航图像中的阴影，然后采用增强的最大类间方差法进行图像分割和优化的Hough变换提取作物行中心线，最终通过坐标转换获得导航参数。

This algorithm lights five pixels in a loop between the coordinate information of line's start and end points. Therefore, the speedof generating of straight line can be accelerated. Compared with the four-step, it is the speed that increased by about 20% while the complexity is almost the same. Meanwhile the five-step still maintains the precise of the traditional line scan conversion algorithm.

该算法过给定的直线的始点和终点，可以一次计算得到并且点亮五个象素点，从而较传统的直线扫描转换算法成倍地提高了直线的生成速度，与著名的"四步法"相比，几乎没有增加复杂性，而速度则提高约20%，同时仍然保持传统直线扫描转换算法的精度。

To image plane coordinate An ipsilateral total tangent algorithm is proposed in the paper, and the algorithm is proved to be effective for solving the coordinate transformation matrix by an example.

为了解决数码相机定位问题，利用双目定位法，在确定物平面坐标系与像平面坐标系的坐标变换矩阵的基础上，提出了一种同侧共切线算法，结合算例证明了这种算法可以有效地求解此坐标变换矩阵。

Because of ICP algorithm can identify a solution regarding the correspondence problem. In this study, I use ICP algorithm to calculate the transformation parameters of overlapped strips and compare the results with other adjusted Airborne LiDAR cloud point data to evaluate its feasibility.

本文即藉由ICP演算法能处理点云间误差的特性，对光达重叠航带的点云资料加以处理，将所得的成果进而与平差处理过后的光达点云资料做分析比较，以探讨其可行性。

Compared with the orthodox SPIHT algorithm, the ability of error counteraction of this algorithm was greatly enhanced.

在该系统中，采用多片DSP级联的方式，对改进的SPIHT算法分级流水处理，保证了该算法的可行性和实时性，满足了星上高速图像传输的要求。

The algorithm combines thermodynamic and covariation information to assign scores to all possible base pairings. Base pairings are then predicted with the help of the iterated RNA folding algorithm based on minimum of free energy.

该方法在给潜在碱基对打分时综合了热力学和协变信息，通过基于最小自由能RNA折叠算法的多次迭代选出所有的碱基对。

We have something to do in the new stage.

在这段崭新的时期中，我们有一些要做的。

The difference between tourism decision-making under uncertainty and risky tourism decision-making is indistinctive.

其中不确定性旅游决策和风险旅游决策的界线比较模糊，两者的区分是相对的。