发布求助
文献互助 智能选刊 最新文献

Computers & chemistry最新文献

筛选
英文 中文
Research and prediction of coordination reactions between CPA-mA and some metal ions using artificial neural networks 基于人工神经网络的CPA-mA与金属离子配位反应研究与预测
Computers & chemistry Pub Date : 2001-11-01 DOI: 10.1016/S0097-8485(01)00066-3
Lijun Dong , Aixia Yan , Xingguo Chen , Hongping Xu , Zhide Hu
{"title":"Research and prediction of coordination reactions between CPA-mA and some metal ions using artificial neural networks","authors":"Lijun Dong ,&nbsp;Aixia Yan ,&nbsp;Xingguo Chen ,&nbsp;Hongping Xu ,&nbsp;Zhide Hu","doi":"10.1016/S0097-8485(01)00066-3","DOIUrl":"https://doi.org/10.1016/S0097-8485(01)00066-3","url":null,"abstract":"<div><p>The complex relationship between maximum absorption wavelength (<em>λ</em><sub>max</sub>), molar absorptivity (<em>ε</em>) of the coordination compounds formed from <em>m</em>-acetyl-chlorophosphonazo (CPA-mA) and the metal ions, the acidity of coordination reaction, some properties of metal ions and the properties of more than 20 coordination compounds were studied using artificial neural networks with extended delta-bar-delta EDBD back learning algorithms in this paper. Six parameters: the pH of coordination reactions, metal ion radius (<em>R</em>), relative atomic weight (Wt), ionic electronic energy (<em>E</em>), metal ion standard Gibbs’ free energy (Δ<em>G</em><sup>0</sup>) and hard–soft acid–base dual scale (<em>f</em>) were used as input parameters, to predict the <em>λ</em><sub>max</sub> and <em>ε</em> of the coordination compounds. The structures of networks and the learning times were optimized. The best networks structure is 6–7–2. The optimum number of learning times is about 160 196. It is shown that the maximum relative error is no more than 6% in the testing set. The trained networks are used to simulate the complicated relations between the metal ion properties, coordination reaction conditions and the properties of coordination compounds. This optimized networks have been used for the prediction of the <em>λ</em><sub>max</sub> and <em>ε</em> of coordination compounds formed from Tb<sup>3+</sup>, Ho<sup>3+</sup> with CPA-mA separately and with satisfactory results.</p></div>","PeriodicalId":79331,"journal":{"name":"Computers & chemistry","volume":"25 6","pages":"Pages 551-558"},"PeriodicalIF":0.0,"publicationDate":"2001-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/S0097-8485(01)00066-3","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"91725785","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
Binary coding of Kekulé structures of catacondensed benzenoid hydrocarbons 缩合苯类烃kekul<s:1>结构的二元编码
Computers & chemistry Pub Date : 2001-11-01 DOI: 10.1016/S0097-8485(01)00068-7
Sandi Klavžar , Aleksander Vesel , Petra Žigert , Ivan Gutman
{"title":"Binary coding of Kekulé structures of catacondensed benzenoid hydrocarbons","authors":"Sandi Klavžar ,&nbsp;Aleksander Vesel ,&nbsp;Petra Žigert ,&nbsp;Ivan Gutman","doi":"10.1016/S0097-8485(01)00068-7","DOIUrl":"https://doi.org/10.1016/S0097-8485(01)00068-7","url":null,"abstract":"<div><p>An algorithm is described by means of which the Kekulé structures of a catacondensed benzenoid molecule (with <em>h</em> hexagons) are transformed into binary codes (of length <em>h</em>). By this, computer-aided manipulations with, and memory-storage of Kekulé structures are much facilitated. Any Kekulé structure can easily be recovered from its binary code.</p></div>","PeriodicalId":79331,"journal":{"name":"Computers & chemistry","volume":"25 6","pages":"Pages 569-575"},"PeriodicalIF":0.0,"publicationDate":"2001-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/S0097-8485(01)00068-7","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"91725787","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 24
Prior-knowledge-based feedforward network simulation of true boiling point curve of crude oil 原油真沸点曲线的先验知识前馈网络模拟
Computers & chemistry Pub Date : 2001-11-01 DOI: 10.1016/S0097-8485(00)00116-9
Chong-wei Chen, De-zhao Chen
{"title":"Prior-knowledge-based feedforward network simulation of true boiling point curve of crude oil","authors":"Chong-wei Chen,&nbsp;De-zhao Chen","doi":"10.1016/S0097-8485(00)00116-9","DOIUrl":"10.1016/S0097-8485(00)00116-9","url":null,"abstract":"<div><p>Theoretical results and practical experience indicate that feedforward networks can approximate a wide class of functional relationships very well. This property is exploited in modeling chemical processes. Given finite and noisy training data, it is important to encode the prior knowledge in neural networks to improve the fit precision and the prediction ability of the model. In this paper, as to the three-layer feedforward networks and the monotonic constraint, the unconstrained method, Joerding's penalty function method, the interpolation method, and the constrained optimization method are analyzed first. Then two novel methods, the exponential weight method and the adaptive method, are proposed. These methods are applied in simulating the true boiling point curve of a crude oil with the condition of increasing monotonicity. The simulation experimental results show that the network models trained by the novel methods are good at approximating the actual process. Finally, all these methods are discussed and compared with each other.</p></div>","PeriodicalId":79331,"journal":{"name":"Computers & chemistry","volume":"25 6","pages":"Pages 541-550"},"PeriodicalIF":0.0,"publicationDate":"2001-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/S0097-8485(00)00116-9","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"72522502","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 13
Polynomial expressions for the hyper-Wiener index of extended hydrocarbon networks 扩展烃网超维纳指数的多项式表达式
Computers & chemistry Pub Date : 2001-11-01 DOI: 10.1016/S0097-8485(01)00080-8
Gordon G. Cash
{"title":"Polynomial expressions for the hyper-Wiener index of extended hydrocarbon networks","authors":"Gordon G. Cash","doi":"10.1016/S0097-8485(01)00080-8","DOIUrl":"10.1016/S0097-8485(01)00080-8","url":null,"abstract":"<div><p>General expressions are derived for the hyper-Wiener index (<em>WW</em>) for several series of hydrocarbons, both benzenoid and non-benzenoid, including some two-dimensional networks. Indeed, such expressions were found for all but one series studied. Methods are also described for eliminating the register overflow problem that besets computer-based approaches to calculating <em>WW</em> for large structures by means of the distance matrix.</p></div>","PeriodicalId":79331,"journal":{"name":"Computers & chemistry","volume":"25 6","pages":"Pages 577-582"},"PeriodicalIF":0.0,"publicationDate":"2001-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/S0097-8485(01)00080-8","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81500536","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 19
SOM integrated with CCA for the feature map and classification of complex chemical patterns SOM与CCA集成，用于复杂化学模式的特征映射和分类
Computers & chemistry Pub Date : 2001-11-01 DOI: 10.1016/S0097-8485(01)00084-5
Xuefeng Yan, Dezhao Chen, Yaqiu Chen, Shangxu Hu
{"title":"SOM integrated with CCA for the feature map and classification of complex chemical patterns","authors":"Xuefeng Yan,&nbsp;Dezhao Chen,&nbsp;Yaqiu Chen,&nbsp;Shangxu Hu","doi":"10.1016/S0097-8485(01)00084-5","DOIUrl":"10.1016/S0097-8485(01)00084-5","url":null,"abstract":"<div><p>Considering that the two-dimensional (2D) feature map of the high-dimensional chemical patterns can more concisely and efficiently represent the pattern characteristic, a new procedure integrating self-organizing map (SOM) networks with correlative component analysis (CCA) is proposed. Firstly, CCA was used to identify the most important classification characteristics (CCs) from the original high-dimensional chemical pattern information. Then, the SOM maps the first several CCs, which include the most useful information for pattern classification, onto a 2D plane, on which the pattern classification feature is concisely represented. To improve the learning efficiency of SOM networks, two new algorithms for dynamically adjusting the learning rate and the range of neighborhood around the winning unit were further worked out. Besides, a convenient method for detecting the topologic nature of SOM results was proposed. Finally, a typical example of mapping two classes natural spearmint essence was employed to verify the effectiveness of the new approach. The feature-topology-preserving (FTP) map obtained can well represent the classification of original patterns and is much better than what obtained by SOM alone.</p></div>","PeriodicalId":79331,"journal":{"name":"Computers & chemistry","volume":"25 6","pages":"Pages 597-605"},"PeriodicalIF":0.0,"publicationDate":"2001-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/S0097-8485(01)00084-5","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"90846847","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 18
Multi-isotopic modelling of mass spectra: a procedure for verification of the fragmentation hypothesis for the organometallic and coordination compounds 质谱的多同位素模拟:验证有机金属和配位化合物的碎片假说的程序
Computers & chemistry Pub Date : 2001-11-01 DOI: 10.1016/S0097-8485(01)00067-5
Andrzej J Gorączko, Jacek A Szymura
{"title":"Multi-isotopic modelling of mass spectra: a procedure for verification of the fragmentation hypothesis for the organometallic and coordination compounds","authors":"Andrzej J Gorączko,&nbsp;Jacek A Szymura","doi":"10.1016/S0097-8485(01)00067-5","DOIUrl":"https://doi.org/10.1016/S0097-8485(01)00067-5","url":null,"abstract":"<div><p>Interpretations of mass spectra usually depend on explanations of the molecular structure by determination of the fragmentation ions structures. Therefore, identification of fragmentation ions formulas is an initial step of such investigations. It seems that multi-isotopic modelling of all ions proposed in fragmentation data should lead to the theoretical mass spectrum. Good adjustment of experimental and predicted spectra proves the validity of the fragmentation table, whose contents are recognised as fragmentation hypothesis. This means that multi-isotopic modelling is a helpful tool for verification of proposed fragmentation data. Applications of the method are presented for 1,1′,2,2′,3,3′-hexachloro-ferrocene, C<sub>10</sub>H<sub>4</sub>Cl<sub>6</sub>Fe, and bis(dibutyldithiophosphate)-zinc(II), [(C<sub>4</sub>H<sub>9</sub>O)<sub>2</sub>PS<sub>2</sub>]<sub>2</sub>Zn.</p></div>","PeriodicalId":79331,"journal":{"name":"Computers & chemistry","volume":"25 6","pages":"Pages 559-568"},"PeriodicalIF":0.0,"publicationDate":"2001-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/S0097-8485(01)00067-5","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"91725786","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 2
Dynamic optimization of chemical processes using ant colony framework 基于蚁群框架的化工过程动态优化
Computers & chemistry Pub Date : 2001-11-01 DOI: 10.1016/S0097-8485(01)00081-X
J. Rajesh , Kapil Gupta , Hari Shankar Kusumakar , V.K. Jayaraman, B.D. Kulkarni
{"title":"Dynamic optimization of chemical processes using ant colony framework","authors":"J. Rajesh ,&nbsp;Kapil Gupta ,&nbsp;Hari Shankar Kusumakar ,&nbsp;V.K. Jayaraman,&nbsp;B.D. Kulkarni","doi":"10.1016/S0097-8485(01)00081-X","DOIUrl":"https://doi.org/10.1016/S0097-8485(01)00081-X","url":null,"abstract":"<div><p>Ant colony framework is illustrated by considering dynamic optimization of six important bench marking examples. This new computational tool is simple to implement and can tackle problems with state as well as terminal constraints in a straightforward fashion. It requires fewer grid points to reach the global optimum at relatively very low computational effort. The examples with varying degree of complexities, analyzed here, illustrate its potential for solving a large class of process optimization problems in chemical engineering.</p></div>","PeriodicalId":79331,"journal":{"name":"Computers & chemistry","volume":"25 6","pages":"Pages 583-595"},"PeriodicalIF":0.0,"publicationDate":"2001-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/S0097-8485(01)00081-X","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"91600025","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 87
Research and Prediction of Coordination Reactions Between CPA-mA and Some Metal Ions using Artificial Neural Networks 基于人工神经网络的CPA-mA与金属离子配位反应研究与预测
Computers & chemistry Pub Date : 2001-11-01 DOI: 10.1016/S0097-8485(01)00066-3
Lijun Dong, A. Yan, Xingguo Chen, Hongping Xu, Zhide Hu
{"title":"Research and Prediction of Coordination Reactions Between CPA-mA and Some Metal Ions using Artificial Neural Networks","authors":"Lijun Dong, A. Yan, Xingguo Chen, Hongping Xu, Zhide Hu","doi":"10.1016/S0097-8485(01)00066-3","DOIUrl":"https://doi.org/10.1016/S0097-8485(01)00066-3","url":null,"abstract":"","PeriodicalId":79331,"journal":{"name":"Computers & chemistry","volume":"3 1","pages":"551-8"},"PeriodicalIF":0.0,"publicationDate":"2001-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89788770","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
Binary Coding of Kekulé Structures of Catacondensed Benzenoid Hydrocarbons 缩合苯类烃kekul<s:1>结构的二元编码
Computers & chemistry Pub Date : 2001-11-01 DOI: 10.1016/S0097-8485(01)00068-7
S. Klavžar, A. Vesel, Petra Zigert, I. Gutman
{"title":"Binary Coding of Kekulé Structures of Catacondensed Benzenoid Hydrocarbons","authors":"S. Klavžar, A. Vesel, Petra Zigert, I. Gutman","doi":"10.1016/S0097-8485(01)00068-7","DOIUrl":"https://doi.org/10.1016/S0097-8485(01)00068-7","url":null,"abstract":"","PeriodicalId":79331,"journal":{"name":"Computers & chemistry","volume":"79 1","pages":"569-75"},"PeriodicalIF":0.0,"publicationDate":"2001-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73920079","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 24
Dynamic Optimization of Chemical Processes using Ant Colony Framework 基于蚁群框架的化工过程动态优化
Computers & chemistry Pub Date : 2001-11-01 DOI: 10.1016/S0097-8485(01)00081-X
J. Rajesh, K. Gupta, Hari Shankar Kusumakar, V. Jayaraman, B. Kulkarni
{"title":"Dynamic Optimization of Chemical Processes using Ant Colony Framework","authors":"J. Rajesh, K. Gupta, Hari Shankar Kusumakar, V. Jayaraman, B. Kulkarni","doi":"10.1016/S0097-8485(01)00081-X","DOIUrl":"https://doi.org/10.1016/S0097-8485(01)00081-X","url":null,"abstract":"","PeriodicalId":79331,"journal":{"name":"Computers & chemistry","volume":"17 1","pages":"583-95"},"PeriodicalIF":0.0,"publicationDate":"2001-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89553695","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 88
首页 上一页 下一页 尾页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：604180095
Book学术官方微信