助手标题  
全文文献 工具书 数字 学术定义 翻译助手 学术趋势 更多
查询帮助
意见反馈
   大划分 的翻译结果: 查询用时:0.016秒
图标索引 在分类学科中查询
所有学科
更多类别查询

图标索引 历史查询
 

大划分
相关语句
  “大划分”译为未确定词的双语例句
     In particular,the EVI-LAI relationship could be improved significantly(R~2 increased over 30%) when canopy geometries were considered.
     不同植被指数比较,EVI-LAI相关关系受株型的影响较大,划分株型后其复相关系数R2可提高30%以上;
短句来源
  相似匹配句对
     Division of the tectonic units in the Greater Mekong subregion
     湄公河次地区构造单元划分
短句来源
     Maximum Genus and Vertex Partition of Graphs
     图的最亏格与图的顶点划分
短句来源
     A Big Cheater
     骗子
短句来源
     Big Aristotle
     “”亚里士多德
短句来源
     A Study on Division of Climatic Zone in Guangxi
     广西气候带的划分
短句来源
查询“大划分”译词为用户自定义的双语例句

    我想查看译文中含有:的双语例句
例句
为了更好的帮助您理解掌握查询词或其译词在地道英语中的实际用法,我们为您准备了出自英文原文的大量英语例句,供您参考。
  big endian
Big Endian and Little Endian Representation Different platforms store large multibyte numbers in two different ways.
      
Big endian overhead amounts to 384 cycles per 1024 byte block, resulting in a reduced throughput of 179 Mbit/s.
      
Here the commas define separation of each byte arranged in big endian format.
      
It's 32 bits, it's big endian, and it usually doesn't use any inline assembly.
      
If a binary file is created on a big endian machine, and read on a little endian, the resulting values will be wildly wrong.
      
更多          


There are a lot of investigating on parallel algorithms in database. Since join operation is frequently and commonly used, and it is a costly operation. , optimizing the method for performing join operation is very important. Two new parallel join algorithms are presented in this paper, in order to reduce the complexity of database operations.. These parallel algorithms, based on clustering and grid files, can improve the performance of the join operation by avoiding the expensive partitioning phase inherent...

There are a lot of investigating on parallel algorithms in database. Since join operation is frequently and commonly used, and it is a costly operation. , optimizing the method for performing join operation is very important. Two new parallel join algorithms are presented in this paper, in order to reduce the complexity of database operations.. These parallel algorithms, based on clustering and grid files, can improve the performance of the join operation by avoiding the expensive partitioning phase inherent in hash based parallel join algorithms. Simulations and results of the algorithms are also presented.

对数据库运算有很多并行算法。由于联结运算开销大而且使用频繁,所以,联结运算的优化至关重要。作者提出了基于网格文件的两个新的并行算法,分别用于一致关系和下一致关系。因为这里给出的算法避免了当前常用的散列算法中必然的开销很大的划分阶段,所以能够提高联结运算的效率。

The multiclass SVM methods based on binary tree are proposed. The new methods can resolve the unclassifiable region problems in the conventional multiclass SVM methods. To maintain high generalization ability, the most widespread class should be separated at the upper nodes of a binary tree. Hypercuboid and hypersphere class least covers are used to be rules of constructing binary tree. Numerical experiment results show that the multiclass SVM methods are suitable for practical use.

提出一种新的基于二叉树结构的支持向量(SVM)多类分类算法.该算法解决了现有主要算法所存在的不可分区域问题.为了获得较高的推广能力,必须让样本分布广的类处于二叉树的上层节点,才能获得更大的划分空间.所以,该算法采用最小超立方体和最小超球体类包含作为二叉树的生成算法.实验结果表明,该算法具有一定的优越性.

Based on the basic assumptions used in the Sarma method,the sliding body was divided into a series of oblique slices and the recursive equation of interslice forces were derived according to the force equilibrium conditions of slices.In consistence with the principle of maximum thrust force,the problem of searching the minimum factor of safety was transformed into that of searching the maximum residual thrust force.By using the dynamic programming,the problem of dividing the oblique slices was transformed into...

Based on the basic assumptions used in the Sarma method,the sliding body was divided into a series of oblique slices and the recursive equation of interslice forces were derived according to the force equilibrium conditions of slices.In consistence with the principle of maximum thrust force,the problem of searching the minimum factor of safety was transformed into that of searching the maximum residual thrust force.By using the dynamic programming,the problem of dividing the oblique slices was transformed into that of multi-stage decision.The procedure and steps of the optimal decision strategy was given based on the recursive equation of thrust force,with which the combination of oblique slices was optimized resulting in the maximum residual thrust force.Since the solution of the Sarma method was the upper-bound in nature,the safety factor thus obtained was the least upper-bound solution of slope stability.It was shown that the optimal combination of oblique slices obtained by the dynamic programming agreed well with the theoretical solution of the mechanics of plasticity,and the factor of safety obtained was slightly bigger than that of the rigorous limit equilibrium method of slices with the vertical slices.

基于Sarma法的基本假设,将滑体划分为若干斜条块,由条块力的平衡条件得到条块间推力递推方程。根据推力最大原理,将寻求安全系数最小问题转化为寻求剩余推力最大问题。采用动态规划方法,将斜条块划分问题转化为多阶段决策问题。给出了基于条间推力递推方程的最优决策方法和步骤,对边坡斜条块划分组合进行了优化,找到剩余推力最大的划分组合。由于Sarma法本身是上限解,因此优化得到安全系数本质上是最小上限解。计算结果表明:利用动态规划方法搜索的最优斜条块划分组合,可以充分接近塑性力学解,安全系数一般大于并接近基于垂直条块的严格极限平衡条分法的安全系数。

 
图标索引 相关查询

 


 
CNKI小工具
在英文学术搜索中查有关大划分的内容
在知识搜索中查有关大划分的内容
在数字搜索中查有关大划分的内容
在概念知识元中查有关大划分的内容
在学术趋势中查有关大划分的内容
 
 

CNKI主页设CNKI翻译助手为主页 | 收藏CNKI翻译助手 | 广告服务 | 英文学术搜索
版权图标  2008 CNKI-中国知网
京ICP证040431号 互联网出版许可证 新出网证(京)字008号
北京市公安局海淀分局 备案号:110 1081725
版权图标 2008中国知网(cnki) 中国学术期刊(光盘版)电子杂志社