查询词典 disk partition

This thesis focuses on surface reconstruction from point cloud model, and have discussed and extended three common methods: Moving Least Squares method, Radial Basis Functions method and Multi-level Partition of Unity method.

本文以点云模型曲面重构为研究对象，研究并扩展了三种常用曲面重构方法：最小移动二乘法(MLS：Moving Least Squares Method)法，径向基函数(RBF：Radial Basis Functions method)法和多层次单元分割(MPU：Multi-level Partition ofUnity method)法。

The detailed algorithm on analyzing cracks exploration inside blocks is: enriched approximations which describe singular crack tips fields and discontinuous crack faces are employed under the Partition of Unity theory; the enriched nodes surrounding crack tips or faces are respectively mapped with corresponding enriched degrees of freedom, and the solution of all these degrees of freedom is uniformly proceeded by the implicit iteration algorithm of DDA, then fracture and breakage of DDA blocks can be analyzed. The numeric examples show this algorithm is rational and efficient.

为此建立的无网格法裂纹扩展分析算法，采用满足单位分解条件的特殊增强型函数表达裂纹周围应力场的非连续、奇异特性，将对应的扩展自由度动态映射到裂纹周围的节点上，统一按DDA法隐式迭代方式求解，实现块体裂纹扩展和强度分析，相关算例结果显示该算法是合理有效的。

More than 30 kinds of meshfree methods are reviewed in this paper in the light of weighted residual method, and different meshfree methods can be viewed as different forms of weighted residual method and/or with different approximation functions. Various kinds of meshfree approximate schemes are presented in detail, including moving least square approximation, kernel and reproducing kernel approximation, partition of unity approximation, radial basis approximation, radial point interpolation and natural neighbor interpolation.

详尽介绍了各种无网格近似方案(包括移动最小二乘近似、核近似和重构核近似、单位分解近似、径向基函数近似、点插值近似、自然邻接点插值近似等)和无网格法中常用的各类加权余量法(伽辽金格式、配点格式、局部弱形式、加权最小二乘格式和边界积分格式等)，并讨论了数值积分方法和边界条件的处理等问题。

This paper studies the distributed partition problem of Web Services composition and proves that it is NP-Hard.

本文证明了将Web服务组合分布式划分到不同节点上，在不同的划分中，求得吞吐量最佳的划分问题是一个NP-Hard问题。

Moreover, we have discussed the partition problem of vehicular ad hoc network.

文章最后还通过模拟实验验证了本文方案的可行性和有效性。

Thus, the problem of open boundary detection becomes a minimal partition problem.

这就将开边界的检测问题转化为一般的曲线最小分割问题。

If each interval is degenerated, then it is called single-shape partition problem.

若每个区间为单一的点，则我们称为单一形分割问题。

This paper also proposes a graph based hierarchical clustering algorithm to solve the cell partition problem.

本文对小区划分进行了形式化的描述，首次提出了采用聚类解决小区划分问题的思想，并且提出了一种基于图模型的层次聚类算法。

Using dynamic programming algorithm can be elegant and efficient solution for many greedy algorithm or partition algorithm to solve the problem.

利用动态规划算法，可以优雅而高效地解决很多贪婪算法或分治算法不能解决的问题。

Granular computing is a new intelligent computing theory based on partition of problem concepts.

粒计算是一种基于问题概念空间划分的新的智能计算理论和方法。

I'm going tor her!

我这就去救她！

As rise are design to help keep a several toney , a brain chemical at continues lever.

SSRI被设计来帮助保持血液中的复合胺即在大脑中一个连续水平的化学物质。