助手标题  
全文文献 工具书 数字 学术定义 翻译助手 学术趋势 更多
查询帮助
意见反馈
   全局计算 的翻译结果: 查询用时:0.034秒
图标索引 在分类学科中查询
所有学科
计算机软件及计算机应用
互联网技术
更多类别查询

图标索引 历史查询
 

全局计算
相关语句
  global computing
     Trust Management Model Based on Global Computing in Group-class PDM System
     基于全局计算的集团级产品数据管理系统跨域信任管理研究与实现
短句来源
     This global computing platform is just like many popular grid systems using CPU cycle stealing technology,is dedicated to general applications with multiple parameters.
     这个全局计算平台,和很多个流行的网格系统一样,利用窃取CPU周期技术,致力于解决多参量一般型应用。
短句来源
     This global computing platform is just like many popular grid systems using CPU cycle stealing technology, is dedicated to general applications with multiple parameters.
     这个全局计算平台,和很多个流行的网格系统一样,利用窃取CPU周期技术,致力干解决多参量一般型应用。
  global computation
     A Data Space Fusion Based Approach for Global Computation and Data Decompositions
     基于数据空间融合的全局计算与数据划分方法
短句来源
     This paper presents a theoretical framework of data space fusion and an effective global computation and data decomposition approach based on it, which can be used to solve computation and data decomposition problems on distributed memory multicomputers.
     针对该问题,提出了一套关于数据空间融合的理论框架,并基于该框架给出了一种有效的全局计算与数据划分方法,用于分布主存计算环境中的计算与数据划分问题的求解.
短句来源
     The approach can exploit the parallelism of computation space as high as possible, use the technique of data space fusion to optimize data distribution, and search the optimizing global computation and data decompositions.
     该方法能够尽量开发计算空间的并行度,利用数据融合技术优化数据分布,并能搜寻优化的全局计算与数据划分.
短句来源
     A fast clustering algorithm called F-CABDET(Fast Clustering Algorithm based on Building a DEnsity-Tree) was presented, which significantly improves computing efficiency, reduces executing time and achieves satisfactory clustering results by the window-based method of converting global computation into local computation.
     提出了一种基于窗口的快速聚类算法———FCABDET(Fast Clustering Algorithmbasedon Buildinga DEnsityTree)。 该算法采用基于窗口的计算方法将全局计算转化为局域计算,大幅度提高了计算效率,降低了程序的执行时间,并取得了满意的聚类质量。
短句来源
  “全局计算”译为未确定词的双语例句
     Full-field calculation of active depth from defocus
     主动离焦三维测量的调制度全局计算方法
短句来源
     The experimental results show that the linear expressing based approach for optimizing locality using non-singular loop transformations is effective in optimizing temporal locality and spatial locality.
     针对上述不足之处,本文深入研究了分布共享存储和分布存储计算环境中内存局部性优化问题,提出了一套关于数据空间融合的理论框架,并基于该框架给出了一种有效的全局计算与数据划分方法。
短句来源
     The full-field calculation of active depth from defocus is proposed.
     提出了离焦三维测量的全局计算方法。
短句来源
     By the multilevel B-splines method the global registration is performed and then the result is refined using the local B-splines mesh thus obtaining a better result.
     通过多级B样条插值方法,即先全局计算后局部细化的方法来逐步优化形变结果。
短句来源
查询“全局计算”译词为用户自定义的双语例句

    我想查看译文中含有:的双语例句
例句
为了更好的帮助您理解掌握查询词或其译词在地道英语中的实际用法,我们为您准备了出自英文原文的大量英语例句,供您参考。
  global computing
With the increasing interdependence of integrated electronic commerce and business applications within the global computing environment, performance and reliability are of great concern.
      
Preface to the special issue on Security in global computing
      
Ubiquitous computing refers to building a global computing environment where seamless and invisible access to computing resources is provided to the user.
      
Finally, we discuss how Grid portals, such as those already developed for Cactus, will open the door to global computing resources for scientific users.
      
Deliverable D3.1.1 gives a survey on the state-of-the-art in distributed data management for global computing.
      
更多          
  global computation
The method is based on a global computation of the reaction forces between bodies.
      
The Botti illusion probably depends on global computation in the visual system.
      
On the complexity of global computation in the presence of link failures: the general case
      
A global computation requires inter-sites communication to uses distant sites clock times whereas a local computation only uses the local site data.
      
A number of heuristic clustering algorithms have been proposed to select master nodes that approximate a MDS without resorting to global computation.
      
更多          


The full-field calculation of active depth from defocus is proposed. When an object is projected with sinusoidal grating, the light intensity of the object at the projected frequency on the measured point is equal to the modulation of the same point. By using the ratio of the modulation distributions of the two defocus images, the depth of the object can be calculated. The method not only eliminated the transverse and longitudinal resolving power limited in the other depth from defocus by using short time Fourier...

The full-field calculation of active depth from defocus is proposed. When an object is projected with sinusoidal grating, the light intensity of the object at the projected frequency on the measured point is equal to the modulation of the same point. By using the ratio of the modulation distributions of the two defocus images, the depth of the object can be calculated. The method not only eliminated the transverse and longitudinal resolving power limited in the other depth from defocus by using short time Fourier transformation but also may be calculated with simply and apace. The method can be applied to active depth from defocus easily and efficiently.

提出了离焦三维测量的全局计算方法。通过向物体投射正弦光栅,使物体上任一点的光分布在光栅频率(局域傅里叶变换)处的光强度等于该处的调制度,利用拍摄物体的两幅离焦像的调制度之比,得到了物体的深度分布。不但消除了过去主动离焦三维测量采用局域傅里叶变换带来的测量误差,同时计算程序简单、速度快,具有较好的实用性。

Computation and data decompositions are key factors of affecting the performance of parallel programs running on distributed memory multicomputers. This paper presents a theoretical framework of data space fusion and an effective global computation and data decomposition approach based on it, which can be used to solve computation and data decomposition problems on distributed memory multicomputers. The approach can exploit the parallelism of computation space as high as possible, use the technique of data...

Computation and data decompositions are key factors of affecting the performance of parallel programs running on distributed memory multicomputers. This paper presents a theoretical framework of data space fusion and an effective global computation and data decomposition approach based on it, which can be used to solve computation and data decomposition problems on distributed memory multicomputers. The approach can exploit the parallelism of computation space as high as possible, use the technique of data space fusion to optimize data distribution, and search the optimizing global computation and data decompositions. The approach can also be integrated with data replication and offset alignment naturally, and therefore can make the communication overhead as low as possible. Experimental results show that the approach presented in the paper is effective.

计算与数据划分问题是影响并行程序在分布主存多处理机中执行性能的重要因素,也是并行编译优化的重点.针对该问题,提出了一套关于数据空间融合的理论框架,并基于该框架给出了一种有效的全局计算与数据划分方法,用于分布主存计算环境中的计算与数据划分问题的求解.该方法能够尽量开发计算空间的并行度,利用数据融合技术优化数据分布,并能搜寻优化的全局计算与数据划分.该方法还能很自然地与数据复制以及偏移常量的对准结合在一起,从而使得数据通信量尽可能地小.实验结果表明了所提出方法的有效性.

A fast clustering algorithm called F-CABDET(Fast Clustering Algorithm based on Building a DEnsity-Tree) was presented, which significantly improves computing efficiency, reduces executing time and achieves satisfactory clustering results by the window-based method of converting global computation into local computation. F-CABDET algorithm, only one input parameter needed, has the abilities of discovering clusters with arbitrary shape and processing the noise data for its changeable radius of neighborhood. The...

A fast clustering algorithm called F-CABDET(Fast Clustering Algorithm based on Building a DEnsity-Tree) was presented, which significantly improves computing efficiency, reduces executing time and achieves satisfactory clustering results by the window-based method of converting global computation into local computation. F-CABDET algorithm, only one input parameter needed, has the abilities of discovering clusters with arbitrary shape and processing the noise data for its changeable radius of neighborhood. The experiment results demonstrate the effectivity of F-CABDET algorithm.

提出了一种基于窗口的快速聚类算法———FCABDET(Fast Clustering Algorithmbasedon Buildinga DEnsityTree)。该算法采用基于窗口的计算方法将全局计算转化为局域计算,大幅度提高了计算效率,降低了程序的执行时间,并取得了满意的聚类质量。同时FCABDET仅需要一个输入参数,在聚类过程中采用动态邻域半径不仅可以发现任意形状的簇,而且具有处理噪音数据的能力。实验结果表明了FCABDET算法的有效性。

 
<< 更多相关文摘    
图标索引 相关查询

 


 
CNKI小工具
在英文学术搜索中查有关全局计算的内容
在知识搜索中查有关全局计算的内容
在数字搜索中查有关全局计算的内容
在概念知识元中查有关全局计算的内容
在学术趋势中查有关全局计算的内容
 
 

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