期刊文献+

高斯计算中分子结构独特性的判断 被引量:1

Judgment of Uniqueness of Molecular Structure in Gaussian Calculation
下载PDF
导出
摘要 利用计算机辅助分子异构体构建STRUauto算法,以解决高斯计算中分子结构独特性判断困难的问题.该算法借助能量和键长的迭代比较,完成分子结构的批量去重操作,避免了常规条件下分子结构独特性判断的误差,可得到准确的分子异构体.在几类典型分子结构上的实验测试结果表明,STRUauto算法能显著提高分子结构独特性判断的效率. We used a computer aided molecular isomer constructionalgorithm STRU auto to solve the difficult problem of judging the uniqueness of the molecular structure in Gaussian calculation.With the help of the iterative comparison of energy and bond length,the algorithm completed the batch deduplication of the molecular structure,avoided the error of the judgment of uniqueness of the molecular structure under normal conditions,andobtained accurate molecular isomer.Experimental results on severaltypes of typical molecular structures show that the algorithm STRU auto can significantly improve the efficiency of judging the uniqueness of molecular structure.
作者 王海燕 崔文超 于爽 丁益宏 WANG Haiyan;CUI Wenchao;YU Shuang;DING Yihong(College of Computer,Jilin Normal University,Siping 136000,Jilin Province,China;Institute of Theoretical Chemistry,Jilin University,Changchun 130021,China)
出处 《吉林大学学报(理学版)》 CAS CSCD 北大核心 2018年第6期1566-1569,共4页 Journal of Jilin University:Science Edition
基金 国家自然科学基金(批准号:61373052 21473069 61502197) 吉林省教育厅科研项目(批准号:JJKH20180763KJ) 吉林师范大学博士科研启动基金(批准号:2013018)
关键词 计算机辅助 分子结构 独特性 自动化 computer aided molecular structure uniqueness automation
  • 相关文献

参考文献3

二级参考文献10

  • 1季晓慧,黄拙,张健.约束求解与优化技术的结合[J].计算机学报,2005,28(11):1790-1797. 被引量:9
  • 2王秦辉,陈恩红,王煦法.分布式约束满足问题研究及其进展[J].软件学报,2006,17(10):2029-2039. 被引量:19
  • 3Francois Rossi, Peter Beek, van, Toby Walsh, et al. Handbook of Constraint Programming [M]. Amsterdam:Elsevier,2006. 被引量:1
  • 4Stergiou K, Heuristics for Dynamically Adapting Propagation [C]//Proceeding of the 2008 Conference on ECAI2008: 18th European Conference on Artificial Intelligence. Amsterdam: IOS Press, 2008: 485-489. 被引量:1
  • 5Hutter F, Hoos H H, Leyton-Brown K,et al. ParamlLS: An Automatic Algorithm Configuration Framework[J]. Journal of Artificial Intelligence Research, 2009, 36: 267-306. 被引量:1
  • 6Balafoutis T,Stergiou K. Adaptive Branching for Constraint Satisfaction Problems [C]//Proceeding of the 2010Conference on ECAI 2010: 19th European Conference on Artificial Intelligence. Amsterdam: IOS Press,2010: 855-860. 被引量:1
  • 7Hamadi Y, Monfroy E,Saubion F. Autonomous Search [M]. Berlin: Springer, 2012. 被引量:1
  • 8Balafoutis T,Paparrizou A, Stergiou K. Experimental Evaluation of Branching Schemes for the CSP [EB/OL].2010-09-02. http://arxiv. org/abs/1009. 0407. 被引量:1
  • 9Bessiere C,Chmeiss A,Sais L. Neighborhood-Based Variable Ordering Heuristics for the Constraint SatisfactionProblem [C]//7th International Conference,Cp2001. Berlin: Springer, 2001 : 565-569. 被引量:1
  • 10Grimes D, Wallace R J. Sampling Strategies and Variable Selection in Weighted Degree Heuristics [C]//13thInternational Conference, Cp2007. Berlin: Springer, 2007: 831-838. 被引量:1

共引文献3

同被引文献2

引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部