查询词典 integer polyhedron

based on the analysis of the traditional gnss carrier phase measurement model and the rule of the integer ambiguity estimation,the quality of normal integer mapping is gained,then,the theory of rough integer mapping is proposed,the question of gnss integer ambiguity estimation is solved,the searching efficiency of integer ambiguity is improved,the problem of gnss carrier phase measurement in a certain extent is solved.

摘 要：在分析传统的基于gnss载波相位测量模型对整周模糊度解算的一般规律后，得出一般归整映射的性质，进而提出粗糙归整映射理论，用来解决整周模糊度浮点解归整问题，提高了整周模糊度的搜索效率，一定程度上解决了载波相位实时测量的技术难题。

The Monte Carlo integration that the domain of integration is curved or complex connected curved polyhedron and the integrand has singular points is discussed in this chapter.where G is the domain of integration that is the curved polyhedron, and X P,where G, G,(i = 1,2,...s) is the domain of integration thatis the curved polyhedron,Chapter 3 Deals with the computer simulation on the multiple random current and LIFO multiple service desks mixed queuing system modles in discrete event system.

Z，为。厂的奇异点，且、训方」 SZ；。G一U乓，：一'，2，第三章讨论了多随机顾客流且后进先出的先有Ul个服务台并联，然后有 V个服务台串联，最后有UZ个服务台并联的串并联混合和先有 Vl个服务台串联，然后有U个服务台并联，最后有VZ个服务台串联的串并联混合多服务台排队系统模型的计算机模拟。

Using the divisible theory of the integer,the underside conclusion is proved:for all the vertex-coloring formulas of the regular polyhedron ,let be any integer,the result of these formulas is still the integer.

利用整数的整除理论，证明了以下结论：在所有正多面体顶点着色公式中，当颜色数取任何一个整数时，这些公式的计算结果仍然是整数。

The course is a comprehensive introduction to the theory, algorithms and applications of integer optimization and is organized in four parts: formulations and relaxations, algebra and geometry of integer optimization, algorithms for integer optimization, and extensions of integer optimization.

本课程对整数最优化的理论、算法和应用做了全面的介绍。课程分为四部分：公式和松弛、整数最优化的代数学和几何学、整数最优化的算法，以及整数最优化的拓展。

The division with surplus, the comprehensive division and Eisenstein Test applications on polynomial that can not be divided are mainly discussed; the sufficient condition of that polynomial with coefficient being integer has no integer root, that cubic polynomial with coefficient being integer is irreducible in rational domain and that polynomial with coefficient being integer has not two completely same roots are summed up.

主要论述了带余除法、综合除法及不可约多项式艾森斯坦判别法的应用；总结出了整系数多项式的无整数根的充分性，三次整系数多项式在有理数域上不可约的充分性，整系数多项式无重根的充分性。

We define an extended class of integer linear first-order logic formula, which supports most integer linear and bit-wise expressions in C programs including integer division, integer modular and bit-wise operation.

我们定义了一类整数线性一阶逻辑判定公式，此类判定公式支持C程序中常用的整数线性运算。

In order to solvepiecewise algebraic varieties, we propose a new method to compute an algebraic varietyon a convex polyhedron by adding hyperplanes with the method of Groebner bases. Thus,the algebraic variety on the convex polyhedron is transformed to the positive solutionsof a system of polynomials. Besides, the minimal decomposition is also obtained.

通过添加超平面技巧将Groebner基方法应用到凸多面体内任意维代数簇的计算上，从而把凸多面体内的代数簇转化为另外一组多项式方程组的正解，并且得到了该代数簇在凸多面体内的极小分解。

It can be solved in O(n 2) time for single convex polyhedron obstacle (here n is the total number of vertices of polyhedron).

文章主要研究了k＝ 2情形下的最短路问题，提出一个在O（n2）时间内解决该问题的算法。

According to the viewpoint of combination tope, any convex polyhedron can be composed of some simplexes, and both convex polyhedron and simplex are important concepts of programming theory, so it's necessary to find their volumes in some calculations.

由组合拓扑学可知，任意凸多面体均为若干个单纯形的某种组合，两者均为规划论中最重要的基本概念之一，因而在一些计算中对其求积是不可少的。

The authors present a new algorithm in this paper. Firstly, a vector pointing from one polyhedron to the other is picked. Then the authors start to find an intersection plane of one polyhedron based on the scalar product of the norm vector of the plane and the picked vector.

就这一问题，给出了一种新的算法，其思想是取一个从一个凸多面体指向另一个多面体的向量，根据两个多面体中的面与这一向量的相对位置关系来寻找相交的平面。

But this is impossible, as long as it is engaging in a market economy, there are risks in any operation.

但是，这是不可能的，只要是搞市场经济，是有风险的任何行动。

We're on the same wavelength.

我们是同道中人。