multilateral aid是什么意思

网络释义

用法例句

The Agreement of International Investment: Is Multilateral Arrangement the Only Way?;

国际投资协定:多边安排是唯一的途径吗?

With the development of globalization and regional integration,both China and African countries have a desire to erect a multilateral platform and establish a multilateral relation.

随着全球化和区域一体化的发展,中国和非洲国家搭建了多边平台,发展多边关系的愿望。

Application of Cycloid in Machining Polygon Parts;

摆线在多边形零件加工中的应用

The algorithm of using the method of radial to judge the points in flat in and out of the polygon;

射线法判断平面中的点在多边形内外的算法

A new method for extracting polygon s features;

一种提取多边形特征的新方法

The practical calculation equations for regular polygon folded-plated shell subjected to uniform loads are presented.

在已有的四边形幕结构设计计算理论的基础上,以承受正则荷载的正六边形幕结构屋盖为例,分析了正多边形幕结构的受力机理,提出了在均布荷载作用下的正多边形幕结构内力的实用计算方法,与有限元分析结果对比,吻合较好。

For solving regular polygon,the author presents a geometrograph which divides the circumference uniformly and arbitrarily; and derives an analytic expression.

介绍任意等分圆周的几何作图法及所推导的解析表达式，提出用解三角形法解决正多边形零件在设计和加工中的计算问题。

Aiming at the transition algorithms from regular polygons to a circle,embordering method and edge rounding method are put forward.

针对正多边形渐变为圆的算法进行了研究,提出了两种算法:加边法,即通过增加正多边形边数的方法逐渐逼近于圆,当正多边形的边数足够多时,可以认为其是一个圆;倒角法,逐渐增加正多边的倒角半径,当倒角半径趋近等于正多边形的内接圆半径时,得到的即为一个圆,这个圆是该正多边形的内接圆。

The Validity Of Triangulation Between Two Polygons On Parallel Slices;

平行截面上两个多边形之间三角剖分的合法性

Based on computational geometry and set theory,a vector algorithm for getting the Intersection set of two complex polygons is put forward in this paper.

基于计算几何和集合的基本理论 ,提出了任意两多边形求交的一种矢量算法 。

GIS and Voronoi Polygon Based Public Health Care Accessibility Analysis;

GIS与Voronoi多边形在医疗服务设施地理可达性分析中的应用

Voronoi diagram is founded by using computational geometry based on original distribution of the waypoints, and then the elements from Voronoi diagram are metamorphosed by using the rule for airspace partition, and the controller s workload is accounted in each element that is made up of Metamorphic Voronoi polygon.

根据空域中航路点的自然分布 ,利用算法几何的思想建立Voronoi图 ,并依照空域划分的原则将由Voronoi图获得的单元蜕变 ,统计由各蜕变Voronoi多边形构成的有限元内包含的管制员工作负荷。

Voronoi diagram is founded using computational geometry based on original distribution of the way-point and the controller workload is accounted on each Voronoi polygon.

本文根据空域中航路点的自然分布 ,利用算法几何的思想建立 Voronoi图 ,统计由各 Voronoi多边形包含的管制员工作负荷 ,然后以工作负荷均衡为优化原则 ,使用模拟退火算法对空域中的 Voronoi多边形进行优化组合 ,并使优化组合的新解满足空域划分的两条重要的基本原则。

Algorithm for smallest quadrangle encasing box of convex polygon;

凸多边形最小面积四边形包围盒算法

Algorithm for computing diameter of convex polygon by middle axis;

中轴求凸多边形直径算法

Algorithm of convex polygon diameter based on properties of convex polygon vertices distance;

基于顶点间距离性质的凸多边形直径算法

Based on the location information of anchor nodes,the rough location of each node is gained in the first phase,while the location accuracy would be iteratively refined using weighted multilateration.

该算法利用锚节点位置信息,结合多边测距定位方法分步求精,并可有效识别出网络中的孤节点,消除其对定位过程的影响。

The effective area of solar radiation is calculated with the theory of computing the intersection set of convex polygons and the solar radiation torque is accounted.

将卫星体和太阳帆板组成的几何体进行投影变换后,判断其相互遮挡并采用凸多边形求交的算法求取太阳光压有效作用面积,从而计算太阳光压力矩。

Let P and Q be two arbitrary disjoint convex polygons in a plane.

设Ｐ和Ｑ是平面内任意两个互不相交的凸多边形，目前确定Ｐ与Ｑ的可碰撞区域的最佳串行算法时间复杂度为Ｏ（ｎ＋ｍ），其中ｎ和ｍ分别为凸多边形Ｐ和Ｑ的顶点个数。

The author make a study of convex function and its properties,average valued inequalities proved,and some trigonometic inequalities in convex polygons obtained.

研究凸函数及其性质，证明了均值不等式，得到了凸多边形中的一些三角不等