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

图标索引 历史查询
 

小能量路径
相关语句
没有找到相关双语例句
例句
为了更好的帮助您理解掌握查询词或其译词在地道英语中的实际用法,我们为您准备了出自英文原文的大量英语例句,供您参考。
  minimum energy path
The LEPS potential energy surface is employed in the study, which is obtained from theab initio results and has an early saddle point in the minimum energy path.
      
Global-local minimum transitions and the minimum energy path to dissociation of the dimer were also characterized.
      
The minimum energy path between the two lowest minima of the conformational energy surface consists of a pure inversion section and a section which is mostly rotation.
      
All species formed have linear equilibrium geometries and the minimum energy path for approach of the proton is along the line-of-centers of the heavy atoms.
      
The minimum energy path for the rearrangement LiOB → OBLi was calculated with the SCF approximation using a double-zeta plus polarization basis set.
      
更多          


As a challenging problem of the upcoming next-generation networks, multi-constrained quality-of- service routing (QoSR) is to find a feasible path that satisfies the multiple constraints simultaneously. For the NP complete problem, the heuristic SA_MCP by applying the simulated annealing to Dijkstra抯 algorithm is proposed. SA_MCP first uses a non-linear energy function to convert multiple QoS weights to a single metric and then seeks to find a feasible path by simulated annealing. This paper overviews the simulated...

As a challenging problem of the upcoming next-generation networks, multi-constrained quality-of- service routing (QoSR) is to find a feasible path that satisfies the multiple constraints simultaneously. For the NP complete problem, the heuristic SA_MCP by applying the simulated annealing to Dijkstra抯 algorithm is proposed. SA_MCP first uses a non-linear energy function to convert multiple QoS weights to a single metric and then seeks to find a feasible path by simulated annealing. This paper overviews the simulated annealing method and analyzes the issues when it is applied to QoSR. Extensive simulations show the following conclusions: (1) SA_MCP has a high performance w.r.t. routing success ratio. (2) It has a good scalability in both network scale and weight number k. (3) It is insensitive to the distribution of QoS constraints. Furthermore, when most QoS requests are feasible, the running time of SA_MCP is about O(k(m+nlogn)), which is k times that of the traditional Dijkstra抯 algorithm.

作为下一代互联网的核心问题之一,多约束的服务质量路由(QoSR)用来寻找一条同时满足多个约束条件的可行路径.然而,该问题具有NP完全的复杂度.将模拟退火引入多约束QoSR计算中,首先使用非线性能量函数将多个QoS度量转化成单一能量,然后基于模拟退火的方式求解最小能量路径.首先概述了模拟退火的方法,分析了在QoSR中应用模拟退火所面临的关键问题以及解决方案,然后给出了SA_MCP算法及其复杂性分析.实验结果表明,该算法具有很高的性能,同时对网络规模和约束个数都具有很好的扩展性,对QoS约束的分布状况也不敏感.此外,只要大部分QoS约束存在可行路径,算法的实际运行时间约为O(k(m+nlogn)),即传统Dijkstra算法的k倍(k为约束个数).

An adaptive string method is proposed based on the string method. In this method, a moving mesh method is adopted to control the tangent movement of mesh points. Bigger density of the mesh points near these states can be obtained by choosing an appropriate monitor function in the moving mesh method, thus accurately locating the positions of the critical points on the minimal energy path and calculating the energies at the critical points. The proposed method is then applied to the study of the double well potential...

An adaptive string method is proposed based on the string method. In this method, a moving mesh method is adopted to control the tangent movement of mesh points. Bigger density of the mesh points near these states can be obtained by choosing an appropriate monitor function in the moving mesh method, thus accurately locating the positions of the critical points on the minimal energy path and calculating the energies at the critical points. The proposed method is then applied to the study of the double well potential system and the Mueller potential problem. The results show that the proposed method is a reliable numerical method for studying rare events in complex systems.

用移动网格方法控制网格点的切向运动,在弦方法的基础上提出了自适应弦方法.通过在移动网格方法中选择合适的控制函数,可使网格点密度在这些点附近比较大,从而能够准确地确定最小能量路径上临界点的位置和其上的能量值.将所提出的方法应用到双井势系统和Mueller势问题中,结果表明该方法是一种可靠的研究复杂系统中稀有事件的数值方法.

The Jacobin matrix for images of a GRB-400 visual servo robot was derived. A controlalgorithm was designed to achieve a stable control strategy for dynamic double-loop feedback motioncontrol of the visual servo robot. Adirectplanar path planning method for the robotwas proposed based on the combination of steepest descent method and punishment function method to solve the least-energy cost path planning problem with time constraint. Simulation and experiment results show that the robot can determine an optimal...

The Jacobin matrix for images of a GRB-400 visual servo robot was derived. A controlalgorithm was designed to achieve a stable control strategy for dynamic double-loop feedback motioncontrol of the visual servo robot. Adirectplanar path planning method for the robotwas proposed based on the combination of steepest descent method and punishment function method to solve the least-energy cost path planning problem with time constraint. Simulation and experiment results show that the robot can determine an optimal path by applying the proposed method whenever objects or obstaclesare within the visual scope of the robot.

建立了GRB-400单目视觉伺服机器人的图像雅可比矩阵,针对此动态双环系统设计了控制算法使视觉伺服闭环运动控制系统稳定.根据视觉伺服闭环运动控制系统的需要,提出了最速下降法与惩罚函数法相结合的平面规划方法,在机器人的视界内解决一定时间内最小能量的路径规划问题.仿真与实验结果表明,机器人根据在其视觉范围内的目标物体的位置即可采用上述方法确定优化的路径.

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

 


 
CNKI小工具
在英文学术搜索中查有关小能量路径的内容
在知识搜索中查有关小能量路径的内容
在数字搜索中查有关小能量路径的内容
在概念知识元中查有关小能量路径的内容
在学术趋势中查有关小能量路径的内容
 
 

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