说明：双击或选中下面任意单词，将显示该词的音标、读音、翻译等；选中中文或多个词，将显示翻译。 您的位置：首页 -> 词典 -> 多集散点 1)  multi-depots 多集散点 1. Study on multi-depots vehicle routing problem and its ant colony optimization; 多集散点车辆路径问题及其蚁群算法研究 2. In order to reach a global optimization in multi-depots vehicle routing,vehicle routing models based on detail order information were established. 为使多集散点车辆路径优化结果全局最优,以订单为基准建立多集散点车辆路径优化模型。 3. In order to get global solution in multi-depot vehicle routing problem(VRP),freight relation is expressed in details,and single vehicle routing problem models are established for multi-depots. 为使多集散点车辆路径优化结果全局最优,详细化表示货运关系,建立多集散点单车路径优化模型,并以订单为基准建立蚁群算法的二维禁忌表,确定状态转移规则;在满足车辆约束条件下,以最短路径完成所有订单货运的单车路径搜索。 2)  collective event 多工序集散节点 3)  scattered data points 离散点集 1. In the process of physical measurement and modeling,setting scattered data points triangular mesh is not only one of the key links,but also is the precondition and foundation of the follow-up surface reconstruction. 在实物测量造型过程中,根据离散点集进行三角网格划分是其关键环节之一,也是进行后续进行曲面重构的前提和基础。 2. This paper brings forward a 3D triangulation algorithm for scattered data points which is adapted to any unclose surface, close surface and multiple connected surface. 提出一种在 3D空间直接对曲面离散数据点进行三角网格划分的算法 ,该方法适用于非封闭曲面、封闭曲面及多连通复杂曲面的离散点集 ,同时也能处理剪裁曲面的离散点集 ,得到优良的三角网格。 4)  scattered point set 散乱点集 1. A general algorithm of triangulating arbitrary planar polygonal domain and scattered point set is presented. 提出了一个适用于任意平面多边形区域及散乱点集的通用三角化算法 。 2. An algorithm speedily building TIN of scattered point set is presented. 该文提出了一种针对散乱点集的快速生成TIN的算法。 5)  discrete point set 离散点集 1. By using geometric method, a new algorithm is advanced on quick locating for turning points in discrete point set of plane curve. 采用几何的方法 ,提出一种确定平面曲线离散点集拐点的快速算法 ,该算法结构简单、计算效率高 ,而且可以快速确定平面参数曲线离散点集的拐点 。 2. The algorithm,based on ordering plane discrete point set,making subareas and orientation by indicating pointer,increases convex hull vertexes and deletes convex hull vertexes dynamically in the process of scanning a discrete point set for getting its minimum convex hull vertex set. 该算法通过排序、分区、指针定位、一遍扫描离散点集,在运算过程中对凸包顶点进行动态增加或删除,可快速生成点集的最小凸包。 6)  hubs 集散节点 1. Strategies against vulnerability of hubs in complex networks; 无尺度网络中集散节点的抗脆弱性策略 2. Distributed controlling model for hubs in P2P networks P2P网络中集散节点分布式处理控制模型 3. Study on strategies against control of hubs in scale-free networks 无尺度网络中集散节点控制策略的研究 补充资料：多苯基多亚甲基多异氰酸酯     多苯基多亚甲基多异氰酸酯，简称PAPI，或称粗MDI，浅黄色至褐色粘稠液体．有刺激性气味。相对密度(20℃／20 ℃)1．2，燃点218℃。PAPI实际上是由50％MDI与50％官能度大于2以上的多异氰酸酯组成的混合物。升温时能发生自聚作用。溶于氯苯、邻二氯苯、甲苯等。PAPI的活性低，蒸气压低，只是TDI的百分之一，故毒性很低。    用于制造聚氨脂胶粘剂。也可直接加入橡胶胶粘剂中，改善橡胶与尼龙或聚酯线的粘接性能。贮存于阴凉、通风、干燥的库房内，远离火种、热源。严格防水、防潮，避免光照。 说明：补充资料仅用于学习参考，请勿用于其它任何用途。 参考词条 ©2011 dictall.com