首页 > 最新文献

Applied Soft Computing最新文献

英文 中文
Prediction interval soft sensor for dissolved oxygen content estimation in an electric arc furnace 用于电弧炉中溶解氧含量估算的预测间隔软传感器
IF 7.2 1区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2024-09-13 DOI: 10.1016/j.asoc.2024.112246

In this study, a novel soft sensor modeling approach using Takagi–Sugeno (TS) fuzzy models and Prediction Intervals (PIs) is presented to quantify uncertainties in Electric Arc Furnace (EAF) steel production processes, namely to estimate the dissolved oxygen content in the steel bath. In real EAF operation, dissolved oxygen content is measured only a few times in the refining stage; therefore, the approach addresses the challenge of predicting unobserved output under conditions of irregular and scarce output measurements, using two distinct methods: Instant TS (I-TS) and Input Integration TS (II-TS). In the I-TS method, the model is computed for each individual indirect measurement, while the II-TS approach integrates these indirect measurements. The inclusion of PIs in TS models allows the derivation of the narrowest band containing a prescribed percentage of data, despite the presence of heteroscedastic noise. These PIs provide valuable insight into potential variability and allow decision-makers to evaluate worst-case scenarios. When evaluated against real EAF data, these methods were shown to effectively overcome the obstacles posed by scarce output measurements. Despite its simplicity, the I-TS model performed better in terms of interpretability and robustness to the operational reality of the EAF process. The II-TS model, on the other hand, showed excellent performance on all metrics but exhibited theoretical inconsistencies when deviating from typical operations. In addition, the proposed method successfully estimates carbon content in the steel bath using the established dissolved oxygen/carbon equilibrium, eliminating the need for direct carbon measurements. This shows the potential of the proposed methods to increase productivity and efficiency in the EAF steel industry.

本研究提出了一种使用高木-菅野(TS)模糊模型和预测区间(PIs)的新型软传感器建模方法,用于量化电弧炉(EAF)钢铁生产过程中的不确定性,即估算钢液中的溶解氧含量。在电弧炉的实际操作中,溶解氧含量只在精炼阶段测量几次;因此,该方法使用两种不同的方法来应对在产出测量不规则和稀缺的条件下预测未观测产出的挑战:即时 TS (I-TS) 和输入积分 TS (II-TS)。在 I-TS 方法中,模型是针对每个单独的间接测量结果计算的,而 II-TS 方法则是对这些间接测量结果进行整合。尽管存在异方差噪声,但将 PI 纳入 TS 模型,可以推导出包含规定百分比数据的最窄频带。这些 PI 为了解潜在的变异性提供了宝贵的信息,使决策者能够对最坏情况进行评估。在根据真实的 EAF 数据进行评估时,这些方法被证明能够有效克服输出测量数据不足所带来的障碍。I-TS 模型尽管简单,但在可解释性和对电弧炉工艺的实际操作的稳健性方面表现更好。另一方面,II-TS 模型在所有指标上都表现出色,但在偏离典型操作时表现出理论上的不一致性。此外,建议的方法利用已建立的溶解氧/碳平衡成功估算了钢液中的碳含量,从而无需直接测量碳含量。这表明所提出的方法具有提高电弧炉炼钢行业生产率和效率的潜力。
{"title":"Prediction interval soft sensor for dissolved oxygen content estimation in an electric arc furnace","authors":"","doi":"10.1016/j.asoc.2024.112246","DOIUrl":"10.1016/j.asoc.2024.112246","url":null,"abstract":"<div><p>In this study, a novel soft sensor modeling approach using Takagi–Sugeno (TS) fuzzy models and Prediction Intervals (PIs) is presented to quantify uncertainties in Electric Arc Furnace (EAF) steel production processes, namely to estimate the dissolved oxygen content in the steel bath. In real EAF operation, dissolved oxygen content is measured only a few times in the refining stage; therefore, the approach addresses the challenge of predicting unobserved output under conditions of irregular and scarce output measurements, using two distinct methods: Instant TS (I-TS) and Input Integration TS (II-TS). In the I-TS method, the model is computed for each individual indirect measurement, while the II-TS approach integrates these indirect measurements. The inclusion of PIs in TS models allows the derivation of the narrowest band containing a prescribed percentage of data, despite the presence of heteroscedastic noise. These PIs provide valuable insight into potential variability and allow decision-makers to evaluate worst-case scenarios. When evaluated against real EAF data, these methods were shown to effectively overcome the obstacles posed by scarce output measurements. Despite its simplicity, the I-TS model performed better in terms of interpretability and robustness to the operational reality of the EAF process. The II-TS model, on the other hand, showed excellent performance on all metrics but exhibited theoretical inconsistencies when deviating from typical operations. In addition, the proposed method successfully estimates carbon content in the steel bath using the established dissolved oxygen/carbon equilibrium, eliminating the need for direct carbon measurements. This shows the potential of the proposed methods to increase productivity and efficiency in the EAF steel industry.</p></div>","PeriodicalId":50737,"journal":{"name":"Applied Soft Computing","volume":null,"pages":null},"PeriodicalIF":7.2,"publicationDate":"2024-09-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S1568494624010202/pdfft?md5=cbdf0e6f49d7012b83f7e00fe7d198f3&pid=1-s2.0-S1568494624010202-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142238717","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
A study on improving drug–drug interactions prediction using convolutional neural networks 利用卷积神经网络改进药物相互作用预测的研究
IF 7.2 1区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2024-09-13 DOI: 10.1016/j.asoc.2024.112242

Appropriate studies on drug–drug interactions (DDIs) can evade possible adverse side effects due to the ingestion of multiple drugs. This paper proposes a novel framework called Similarity Network Fusion and Hybrid Convolutional Neural Network (SNF–HCNN) to predict the DDIs better. The proposed framework leverages data from DrugBank, PubChem, and SIDER. Seven critical drug features are extracted: Target, Transporter, Enzymes, Chemical substructure, Carrier, Offside, and Side effects. The Jaccard Similarity measure evaluates the similarity of drug features to construct a comprehensive similarity matrix that effectively captures potential drug relationships and patterns. The similarity selection process identifies the most relevant features, reduces redundancy, and enhances identifying potential drug interactions. Integrating Similarity Network Fusion (SNF) with the selected similarity matrix ensures a comprehensive representation of drug features and leads to superior accuracy compared to conventional methods. Our experimental results demonstrate the effectiveness of the proposed hybrid convolutional neural network (HCNN) architectures, such as CNN+LR (CNN+Logistic Regression), CNN+RF (CNN+Random Forest), and CNN+SVM (CNN+Support Vector Machine), showing impressive accuracies of 95.19%, 94.45%, and 93.65%, respectively. Moreover, CNN+LR outperforms other approaches regarding precision, sensitivity, F1-score, and AUC score, which implicate better outcomes for ensuring medication safety aspects in clinical settings in the future.

对药物相互作用(DDIs)进行适当的研究可以避免因服用多种药物而可能产生的不良副作用。本文提出了一个名为 "相似性网络融合与混合卷积神经网络(SNF-HCNN)"的新框架,以更好地预测 DDIs。该框架利用了来自 DrugBank、PubChem 和 SIDER 的数据。提取了七个关键药物特征:靶点、转运体、酶、化学亚结构、载体、越位和副作用。Jaccard 相似度测量法可评估药物特征的相似性,从而构建一个全面的相似度矩阵,有效捕捉潜在的药物关系和模式。相似性选择过程可识别最相关的特征,减少冗余,并增强识别潜在药物相互作用的能力。将相似性网络融合(SNF)与所选相似性矩阵相结合,可确保药物特征的全面呈现,与传统方法相比具有更高的准确性。我们的实验结果证明了所提出的混合卷积神经网络(HCNN)架构的有效性,如 CNN+LR(CNN+逻辑回归)、CNN+RF(CNN+随机森林)和 CNN+SVM(CNN+支持向量机),其准确率分别达到了令人印象深刻的 95.19%、94.45% 和 93.65%。此外,CNN+LR 在精确度、灵敏度、F1 分数和 AUC 分数方面都优于其他方法,这意味着未来在临床环境中确保用药安全方面会有更好的结果。
{"title":"A study on improving drug–drug interactions prediction using convolutional neural networks","authors":"","doi":"10.1016/j.asoc.2024.112242","DOIUrl":"10.1016/j.asoc.2024.112242","url":null,"abstract":"<div><p>Appropriate studies on drug–drug interactions (DDIs) can evade possible adverse side effects due to the ingestion of multiple drugs. This paper proposes a novel framework called <em>Similarity Network Fusion and Hybrid Convolutional Neural Network (SNF–HCNN)</em> to predict the DDIs better. The proposed framework leverages data from DrugBank, PubChem, and SIDER. Seven critical drug features are extracted: <em>Target</em>, <em>Transporter</em>, <em>Enzymes</em>, <em>Chemical substructure</em>, <em>Carrier</em>, <em>Offside</em>, and <em>Side effects</em>. The Jaccard Similarity measure evaluates the similarity of drug features to construct a comprehensive similarity matrix that effectively captures potential drug relationships and patterns. The similarity selection process identifies the most relevant features, reduces redundancy, and enhances identifying potential drug interactions. Integrating Similarity Network Fusion (SNF) with the selected similarity matrix ensures a comprehensive representation of drug features and leads to superior accuracy compared to conventional methods. Our experimental results demonstrate the effectiveness of the proposed hybrid convolutional neural network (HCNN) architectures, such as CNN+LR (CNN+Logistic Regression), CNN+RF (CNN+Random Forest), and CNN+SVM (CNN+Support Vector Machine), showing impressive accuracies of 95.19%, 94.45%, and 93.65%, respectively. Moreover, CNN+LR outperforms other approaches regarding precision, sensitivity, F1-score, and AUC score, which implicate better outcomes for ensuring medication safety aspects in clinical settings in the future.</p></div>","PeriodicalId":50737,"journal":{"name":"Applied Soft Computing","volume":null,"pages":null},"PeriodicalIF":7.2,"publicationDate":"2024-09-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142230790","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
FMCF: A fusing multiple code features approach based on Transformer for Solidity smart contracts source code summarization FMCF:基于 Transformer 的多代码特征融合方法,用于 Solidity 智能合约源代码汇总
IF 7.2 1区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2024-09-13 DOI: 10.1016/j.asoc.2024.112238

A smart contract is a software program executed on a blockchain, designed to facilitate functionalities such as contract execution, asset administration, and identity validation within a secure and decentralized ecosystem. Summarizing the code of Solidity smart contracts aids developers in promptly grasping essential functionalities, thereby enhancing the security posture of Ethereum-based projects. Existing smart contract code summarization works mainly use traditional information retrieval and single code features, resulting in suboptimal performance. In this study, we propose a fusing multiple code features (FMCF) approach based on Transformer for Solidity summarization. First, FMCF created contract integrity modeling and state immutability modeling in the data preprocessing stage to process and filter data that meets security conditions. At the same time, FMCF retains the self-attention mechanism to construct the Graph Attention Network (GAT) encoder and CodeBERT encoder, which respectively extract multiple feature vectors of the code to ensure the integrity of the source code information. Furthermore, the FMCF uses a weighted summation method to input these two types of feature vectors into the feature fusion module for fusion and inputs the fused feature vectors into the Transformer decoder to obtain the final smart contract code summarization. The experimental results show that FMCF outperforms the standard baseline methods by 12.45% in the BLEU score and maximally preserves the semantic information and syntax structures of the source code. The results demonstrate that the FMCF can provide a good direction for future research on smart contract code summarization, thereby helping developers enhance the security of development projects.

智能合约是在区块链上执行的软件程序,旨在促进安全、去中心化生态系统中的合约执行、资产管理和身份验证等功能。总结 Solidity 智能合约的代码有助于开发人员迅速掌握基本功能,从而增强基于以太坊的项目的安全态势。现有的智能合约代码总结工作主要使用传统的信息检索和单一代码特征,导致性能不尽如人意。在本研究中,我们提出了一种基于 Transformer 的融合多代码特征(FMCF)方法,用于 Solidity 代码总结。首先,FMCF 在数据预处理阶段创建了合同完整性建模和状态不变性建模,以处理和过滤符合安全条件的数据。同时,FMCF 保留了自我关注机制,构建了图形关注网络(GAT)编码器和 CodeBERT 编码器,分别提取代码的多个特征向量,确保源代码信息的完整性。此外,FMCF 采用加权求和的方法将这两类特征向量输入特征融合模块进行融合,并将融合后的特征向量输入变换器解码器,得到最终的智能合约代码摘要。实验结果表明,FMCF 的 BLEU 分数比标准基线方法高出 12.45%,并最大程度地保留了源代码的语义信息和语法结构。实验结果表明,FMCF 可以为智能合约代码摘要的未来研究提供一个很好的方向,从而帮助开发人员提高开发项目的安全性。
{"title":"FMCF: A fusing multiple code features approach based on Transformer for Solidity smart contracts source code summarization","authors":"","doi":"10.1016/j.asoc.2024.112238","DOIUrl":"10.1016/j.asoc.2024.112238","url":null,"abstract":"<div><p>A smart contract is a software program executed on a blockchain, designed to facilitate functionalities such as contract execution, asset administration, and identity validation within a secure and decentralized ecosystem. Summarizing the code of Solidity smart contracts aids developers in promptly grasping essential functionalities, thereby enhancing the security posture of Ethereum-based projects. Existing smart contract code summarization works mainly use traditional information retrieval and single code features, resulting in suboptimal performance. In this study, we propose a fusing multiple code features (FMCF) approach based on Transformer for Solidity summarization. First, FMCF created contract integrity modeling and state immutability modeling in the data preprocessing stage to process and filter data that meets security conditions. At the same time, FMCF retains the self-attention mechanism to construct the Graph Attention Network (GAT) encoder and CodeBERT encoder, which respectively extract multiple feature vectors of the code to ensure the integrity of the source code information. Furthermore, the FMCF uses a weighted summation method to input these two types of feature vectors into the feature fusion module for fusion and inputs the fused feature vectors into the Transformer decoder to obtain the final smart contract code summarization. The experimental results show that FMCF outperforms the standard baseline methods by 12.45% in the BLEU score and maximally preserves the semantic information and syntax structures of the source code. The results demonstrate that the FMCF can provide a good direction for future research on smart contract code summarization, thereby helping developers enhance the security of development projects.</p></div>","PeriodicalId":50737,"journal":{"name":"Applied Soft Computing","volume":null,"pages":null},"PeriodicalIF":7.2,"publicationDate":"2024-09-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142230580","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Short-term power load forecasting based on Seq2Seq model integrating Bayesian optimization, temporal convolutional network and attention 基于整合贝叶斯优化、时序卷积网络和注意力的 Seq2Seq 模型的短期电力负荷预测
IF 7.2 1区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2024-09-13 DOI: 10.1016/j.asoc.2024.112248

Power load forecasting is of great significance to the electricity management. However, extant research is insufficient in comprehensively combining data processing and further optimization of existing prediction models. Therefore, this paper propose an improved power load prediction methods from two aspects: data processing and optimization of Sequence to Sequence (Seq2Seq) model. Firstly, in the data processing, Extreme Gradient Boosting (XGBoost) is adopted to eliminate the redundant features for feature extraction. Meanwhile, Successive Variational Mode Decomposition (SVMD) is employed to solve the unsteadiness and nonlinearities present in electricity data during the decomposition process. Secondly, the Seq2Seq model is selected and improved with a variety of machine learning methods. Specifically, input data features are extracted using Convolutional Neural Networks (CNN), enhancing the decoder's focus on vital information with the Attention mechanism (AM). Temporal Convolutional Network (TCN) serves as both the encoder and decoder of Seq2Seq, with further optimization of the model parameters through the Bayesian Optimization (BO) algorithm. Finally, the cases of two real power market datasets in Switzerland and Singapore illustrate the efficiency and superiority of proposed hybrid forecasting method. Through a comprehensive comparison and analysis with the other six models and four commonly used evaluation metrics, it is evident that the proposed method excels in performance, attaining the highest level of prediction accuracy, with the highest accuracy rate of 95.83 %. Consequently, it exhibits significant practical utility in the realm of power load forecasting.

电力负荷预测对电力管理具有重要意义。然而,现有研究在全面结合数据处理和进一步优化现有预测模型方面存在不足。因此,本文从数据处理和序列到序列(Sequence to Sequence,Seq2Seq)模型优化两个方面提出了一种改进的电力负荷预测方法。首先,在数据处理方面,采用极端梯度提升法(XGBoost)去除冗余特征进行特征提取。同时,在分解过程中,采用连续变异模式分解(SVMD)来解决电力数据中存在的不稳定性和非线性问题。其次,利用多种机器学习方法选择和改进 Seq2Seq 模型。具体来说,使用卷积神经网络(CNN)提取输入数据特征,利用注意力机制(AM)加强解码器对重要信息的关注。时序卷积网络(TCN)同时作为 Seq2Seq 的编码器和解码器,并通过贝叶斯优化(BO)算法进一步优化模型参数。最后,瑞士和新加坡两个真实电力市场数据集的案例说明了所提出的混合预测方法的效率和优越性。通过与其他六种模型和四种常用评价指标的综合比较和分析,可以看出所提出的方法性能卓越,预测准确率达到最高水平,最高准确率为 95.83%。因此,该方法在电力负荷预测领域具有显著的实用性。
{"title":"Short-term power load forecasting based on Seq2Seq model integrating Bayesian optimization, temporal convolutional network and attention","authors":"","doi":"10.1016/j.asoc.2024.112248","DOIUrl":"10.1016/j.asoc.2024.112248","url":null,"abstract":"<div><p>Power load forecasting is of great significance to the electricity management. However, extant research is insufficient in comprehensively combining data processing and further optimization of existing prediction models. Therefore, this paper propose an improved power load prediction methods from two aspects: data processing and optimization of Sequence to Sequence (Seq2Seq) model. Firstly, in the data processing, Extreme Gradient Boosting (XGBoost) is adopted to eliminate the redundant features for feature extraction. Meanwhile, Successive Variational Mode Decomposition (SVMD) is employed to solve the unsteadiness and nonlinearities present in electricity data during the decomposition process. Secondly, the Seq2Seq model is selected and improved with a variety of machine learning methods. Specifically, input data features are extracted using Convolutional Neural Networks (CNN), enhancing the decoder's focus on vital information with the Attention mechanism (AM). Temporal Convolutional Network (TCN) serves as both the encoder and decoder of Seq2Seq, with further optimization of the model parameters through the Bayesian Optimization (BO) algorithm. Finally, the cases of two real power market datasets in Switzerland and Singapore illustrate the efficiency and superiority of proposed hybrid forecasting method. Through a comprehensive comparison and analysis with the other six models and four commonly used evaluation metrics, it is evident that the proposed method excels in performance, attaining the highest level of prediction accuracy, with the highest accuracy rate of 95.83 %. Consequently, it exhibits significant practical utility in the realm of power load forecasting.</p></div>","PeriodicalId":50737,"journal":{"name":"Applied Soft Computing","volume":null,"pages":null},"PeriodicalIF":7.2,"publicationDate":"2024-09-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142232997","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Cooperative coevolution for non-separable large-scale black-box optimization: Convergence analyses and distributed accelerations 非分离大规模黑箱优化的合作协同进化:收敛分析和分布式加速
IF 7.2 1区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2024-09-12 DOI: 10.1016/j.asoc.2024.112232

Given the ubiquity of non-separable optimization problems in real worlds, in this paper we analyze and extend the large-scale version of the well-known cooperative coevolution (CC), a divide-and-conquer black-box optimization framework, on non-separable functions. First, we reveal empirical reasons of when decomposition-based methods are preferred or not in practice on some non-separable large-scale problems, which have not been clearly pointed out in many previous CC papers. Then, we formalize CC to a continuous-game model via simplification, but without losing its essential property. Different from previous evolutionary game theory for CC, our new model provides a much simpler but useful viewpoint to analyze its convergence, since only the pure Nash equilibrium concept is needed and more general fitness landscapes can be explicitly considered. Based on convergence analyses, we propose a hierarchical decomposition strategy for better generalization, as for any decomposition, there is a risk of getting trapped into a suboptimal Nash equilibrium. Finally, we use powerful distributed computing to accelerate it under the recent multi-level learning framework, which combines the fine-tuning ability from decomposition with the invariance property of CMA-ES. Experiments on a set of high-dimensional test functions validate both its search performance and scalability (w.r.t. CPU cores) on a clustering computing platform with 400 CPU cores.

鉴于不可分割的优化问题在现实世界中无处不在,我们在本文中分析并扩展了著名的合作协同进化(CC)--一种分而治之的黑箱优化框架--在不可分割函数上的大规模版本。首先,我们揭示了在某些不可分割的大规模问题上,基于分解的方法在实践中是否更受青睐的经验原因,这在之前的许多 CC 论文中都没有明确指出。然后,我们通过简化将 CC 形式化为连续博弈模型,但并没有失去其基本特性。与以往的 CC 演化博弈论不同,我们的新模型只需要纯粹的纳什均衡概念,而且可以明确地考虑更一般的适合度景观,因此为分析其收敛性提供了一个更简单但有用的视角。基于收敛性分析,我们提出了一种分层分解策略,以实现更好的泛化,因为对于任何分解,都存在陷入次优纳什均衡的风险。最后,我们利用强大的分布式计算,在最新的多层次学习框架下对其进行加速,从而将分解带来的微调能力与 CMA-ES 的不变性相结合。在一个拥有 400 个 CPU 内核的集群计算平台上,一组高维测试函数的实验验证了它的搜索性能和可扩展性(相对于 CPU 内核)。
{"title":"Cooperative coevolution for non-separable large-scale black-box optimization: Convergence analyses and distributed accelerations","authors":"","doi":"10.1016/j.asoc.2024.112232","DOIUrl":"10.1016/j.asoc.2024.112232","url":null,"abstract":"<div><p>Given the ubiquity of non-separable optimization problems in real worlds, in this paper we analyze and extend the large-scale version of the well-known cooperative coevolution (CC), a divide-and-conquer black-box optimization framework, on non-separable functions. First, we reveal empirical reasons of when decomposition-based methods are preferred or not in practice on some non-separable large-scale problems, which have not been clearly pointed out in many previous CC papers. Then, we formalize CC to a continuous-game model via simplification, but without losing its essential property. Different from previous evolutionary game theory for CC, our new model provides a much simpler but useful viewpoint to analyze its convergence, since only the pure Nash equilibrium concept is needed and more general fitness landscapes can be explicitly considered. Based on convergence analyses, we propose a hierarchical decomposition strategy for better generalization, as for any decomposition, there is a risk of getting trapped into a suboptimal Nash equilibrium. Finally, we use powerful distributed computing to accelerate it under the recent multi-level learning framework, which combines the fine-tuning ability from decomposition with the invariance property of CMA-ES. Experiments on a set of high-dimensional test functions validate both its search performance and scalability (w.r.t. CPU cores) on a clustering computing platform with 400 CPU cores.</p></div>","PeriodicalId":50737,"journal":{"name":"Applied Soft Computing","volume":null,"pages":null},"PeriodicalIF":7.2,"publicationDate":"2024-09-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142168080","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Binary ant colony optimization algorithm in learning random satisfiability logic for discrete hopfield neural network 学习离散跳场神经网络随机满足逻辑的二元蚁群优化算法
IF 7.2 1区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2024-09-12 DOI: 10.1016/j.asoc.2024.112192

This study introduced a novel ant colony optimization algorithm that implements the population selection strategy of the Estimation of Distribution Algorithm and a new pheromone updating formula. It aimed to optimize the performance of G-type random high-order satisfiability logic structures embedded in Discrete Hopfield Neural Networks, thereby enhancing the efficiency of the Hopfield Neural Network learning algorithm. Through comparative analysis with other metaheuristic algorithms, our model demonstrated superior performance in terms of global convergence, time complexity, and algorithm complexity. Additionally, we evaluated the learning phase, retrieval phase, and similarity analysis using various ratios of literals and clauses. It was shown that our proposed model exhibits stronger search ability compared to other metaheuristic algorithms and Exhaustive Search. Our model enhanced the efficiency of the learning phase, resulting in the number of global solutions accounting for 100 %, and significantly improved the global solution diversity. These advancements contributed to the efficiency of the model in convergence, rendering it applicable to a wide range of nonlinear classification and prediction problems.

本研究介绍了一种新型蚁群优化算法,该算法实现了分布估计算法的种群选择策略和新的信息素更新公式。该算法旨在优化嵌入离散 Hopfield 神经网络的 G 型随机高阶可满足性逻辑结构的性能,从而提高 Hopfield 神经网络学习算法的效率。通过与其他元启发式算法的比较分析,我们的模型在全局收敛性、时间复杂性和算法复杂性方面都表现出了卓越的性能。此外,我们还评估了学习阶段、检索阶段以及使用各种字面和分句比例进行的相似性分析。结果表明,与其他元启发式算法和穷举搜索相比,我们提出的模型具有更强的搜索能力。我们的模型提高了学习阶段的效率,使全局解的数量占到 100%,并显著改善了全局解的多样性。这些进步提高了模型的收敛效率,使其适用于广泛的非线性分类和预测问题。
{"title":"Binary ant colony optimization algorithm in learning random satisfiability logic for discrete hopfield neural network","authors":"","doi":"10.1016/j.asoc.2024.112192","DOIUrl":"10.1016/j.asoc.2024.112192","url":null,"abstract":"<div><p>This study introduced a novel ant colony optimization algorithm that implements the population selection strategy of the Estimation of Distribution Algorithm and a new pheromone updating formula. It aimed to optimize the performance of G-type random high-order satisfiability logic structures embedded in Discrete Hopfield Neural Networks, thereby enhancing the efficiency of the Hopfield Neural Network learning algorithm. Through comparative analysis with other metaheuristic algorithms, our model demonstrated superior performance in terms of global convergence, time complexity, and algorithm complexity. Additionally, we evaluated the learning phase, retrieval phase, and similarity analysis using various ratios of literals and clauses. It was shown that our proposed model exhibits stronger search ability compared to other metaheuristic algorithms and Exhaustive Search. Our model enhanced the efficiency of the learning phase, resulting in the number of global solutions accounting for 100 %, and significantly improved the global solution diversity. These advancements contributed to the efficiency of the model in convergence, rendering it applicable to a wide range of nonlinear classification and prediction problems.</p></div>","PeriodicalId":50737,"journal":{"name":"Applied Soft Computing","volume":null,"pages":null},"PeriodicalIF":7.2,"publicationDate":"2024-09-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142230577","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Two-sided matching theory-based second-hand house transaction evaluation and recommendation by the modified PLC-DEMATEL method 基于双面匹配理论的二手房交易评估与推荐--改进的 PLC-DEMATEL 方法
IF 7.2 1区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2024-09-12 DOI: 10.1016/j.asoc.2024.112196

To enhance the two-sided matching efficiency in a multi-source heterogeneous environment, this paper takes the randomness and unstructured features of the online comments into consideration, and proposes a new matching mechanism by introducing the complex information representation tool. Firstly, the concept of the probabilistic linguistic normal cloud (PLNC) model is introduced to preserve information cohesion and characteristic distribution. Next, the basic operation laws and corresponding operators are given. Then, an innovative maximum boundary concept skipping the indirect approach is presented to update the similarity degree and distance measures, also the correlation coefficient. Furthermore, for the multi-indicator systems with interactions, the peer experts are invited to evaluate the relationship between indicators, a modified algorithm based on the Decision-Making and Trial Evaluation Laboratory (DEMATEL) method is applied to obtain the subjective weights of indicators. After that, a whole matching process and a correlation coefficient cluster method-based recommendation algorithm are presented. A case study is provided to illustrate the method, wherein a new indicator system is constructed by analyzing the correlation of multiple indicators based on online linguistic evaluations. The random forest model is combined to obtain the objective weights and balance its reliability. Finally, sensitivity analysis and comparative analysis are employed to validate the effectiveness and applicability.

为了提高多源异构环境下的双向匹配效率,本文考虑到在线评论的随机性和非结构化特征,通过引入复杂信息表示工具,提出了一种新的匹配机制。首先,引入了概率语言正态云(Probabilistic linguistic normal cloud,PLNC)模型的概念,以保持信息的内聚性和特征分布。接着,给出了基本运算法则和相应的算子。然后,提出了一种跳过间接方法的创新最大边界概念,用于更新相似度和距离度量,以及相关系数。此外,对于具有交互作用的多指标系统,邀请同行专家对指标之间的关系进行评价,并采用基于决策与试验评价实验室(DEMATEL)方法的改进算法来获取指标的主观权重。之后,提出了一个整体匹配过程和基于相关系数聚类法的推荐算法。为说明该方法,提供了一个案例研究,通过分析基于在线语言评价的多个指标的相关性,构建了一个新的指标体系。结合随机森林模型获得客观权重,并平衡其可靠性。最后,通过灵敏度分析和对比分析验证了该方法的有效性和适用性。
{"title":"Two-sided matching theory-based second-hand house transaction evaluation and recommendation by the modified PLC-DEMATEL method","authors":"","doi":"10.1016/j.asoc.2024.112196","DOIUrl":"10.1016/j.asoc.2024.112196","url":null,"abstract":"<div><p>To enhance the two-sided matching efficiency in a multi-source heterogeneous environment, this paper takes the randomness and unstructured features of the online comments into consideration, and proposes a new matching mechanism by introducing the complex information representation tool. Firstly, the concept of the probabilistic linguistic normal cloud (PLNC) model is introduced to preserve information cohesion and characteristic distribution. Next, the basic operation laws and corresponding operators are given. Then, an innovative maximum boundary concept skipping the indirect approach is presented to update the similarity degree and distance measures, also the correlation coefficient. Furthermore, for the multi-indicator systems with interactions, the peer experts are invited to evaluate the relationship between indicators, a modified algorithm based on the Decision-Making and Trial Evaluation Laboratory (DEMATEL) method is applied to obtain the subjective weights of indicators. After that, a whole matching process and a correlation coefficient cluster method-based recommendation algorithm are presented. A case study is provided to illustrate the method, wherein a new indicator system is constructed by analyzing the correlation of multiple indicators based on online linguistic evaluations. The random forest model is combined to obtain the objective weights and balance its reliability. Finally, sensitivity analysis and comparative analysis are employed to validate the effectiveness and applicability.</p></div>","PeriodicalId":50737,"journal":{"name":"Applied Soft Computing","volume":null,"pages":null},"PeriodicalIF":7.2,"publicationDate":"2024-09-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142230791","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Tumor classification algorithm via parallel collaborative optimization of single- and multi-objective consistency on PET/CT 通过 PET/CT 上单目标和多目标一致性的并行协同优化实现肿瘤分类算法
IF 7.2 1区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2024-09-12 DOI: 10.1016/j.asoc.2024.112245

Malignant tumors still have a high incidence and mortality rate worldwide. Pathological examination remains the clinical gold standard for tumor diagnosis. However, some patients cannot undergo pathological examination due to advanced age and special lesion location. Therefore, making full use of PET/CT to assist doctors in tumor classification has important clinical significance. Since category labels are calibrated according to pathological images, it is difficult to obtain effective pathological category features directly using PET-CT image modeling. In response to this problem, this paper proposes a novel tumor classification algorithm. This method fully utilizes multi-gray-level 3D gray-level co-occurrence matrix and the proposed rough and fine constraint network under the constraint loss of rough and fine labels. Based on single- and multi-objective consistency, a parallel collaborative optimization method is proposed, including category consistency loss and feature specificity loss. To reduce the interference of redundant features, an improved Boruta feature selection method using multiple classifiers and multiple steps is proposed. The final result is obtained through a conditional weighted voting function. The proposed method shows excellent performance in both the submodels and the fusion model. We validated the proposed tumor classification method on three datasets and achieved good performance with the accuracy of 0.80–0.85 and F1-score of 0.78–0.88. The results indicate that the proposed method has good performance and generalization ability.

恶性肿瘤在全球仍有很高的发病率和死亡率。病理检查仍是临床诊断肿瘤的金标准。然而,部分患者由于年龄偏大、病变部位特殊等原因,无法进行病理检查。因此,充分利用 PET/CT 协助医生进行肿瘤分类具有重要的临床意义。由于分类标签是根据病理图像标定的,因此很难直接利用 PET-CT 图像建模获得有效的病理分类特征。针对这一问题,本文提出了一种新型肿瘤分类算法。该方法充分利用了多灰度级三维灰度级共现矩阵和提出的粗标和细标约束损失下的粗细约束网络。基于单目标和多目标一致性,提出了一种并行协同优化方法,包括类别一致性损失和特征特异性损失。为了减少冗余特征的干扰,提出了一种使用多分类器和多步骤的改进 Boruta 特征选择方法。最终结果通过条件加权投票函数获得。所提出的方法在子模型和融合模型中都表现出优异的性能。我们在三个数据集上验证了所提出的肿瘤分类方法,并取得了良好的效果,准确率为 0.80-0.85,F1-score 为 0.78-0.88。结果表明,所提出的方法具有良好的性能和泛化能力。
{"title":"Tumor classification algorithm via parallel collaborative optimization of single- and multi-objective consistency on PET/CT","authors":"","doi":"10.1016/j.asoc.2024.112245","DOIUrl":"10.1016/j.asoc.2024.112245","url":null,"abstract":"<div><p>Malignant tumors still have a high incidence and mortality rate worldwide. Pathological examination remains the clinical gold standard for tumor diagnosis. However, some patients cannot undergo pathological examination due to advanced age and special lesion location. Therefore, making full use of PET/CT to assist doctors in tumor classification has important clinical significance. Since category labels are calibrated according to pathological images, it is difficult to obtain effective pathological category features directly using PET-CT image modeling. In response to this problem, this paper proposes a novel tumor classification algorithm. This method fully utilizes multi-gray-level 3D gray-level co-occurrence matrix and the proposed rough and fine constraint network under the constraint loss of rough and fine labels. Based on single- and multi-objective consistency, a parallel collaborative optimization method is proposed, including category consistency loss and feature specificity loss. To reduce the interference of redundant features, an improved Boruta feature selection method using multiple classifiers and multiple steps is proposed. The final result is obtained through a conditional weighted voting function. The proposed method shows excellent performance in both the submodels and the fusion model. We validated the proposed tumor classification method on three datasets and achieved good performance with the accuracy of 0.80–0.85 and F1-score of 0.78–0.88. The results indicate that the proposed method has good performance and generalization ability.</p></div>","PeriodicalId":50737,"journal":{"name":"Applied Soft Computing","volume":null,"pages":null},"PeriodicalIF":7.2,"publicationDate":"2024-09-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142232996","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Energy-efficient multi-objective distributed assembly permutation flowshop scheduling by Q-learning based meta-heuristics 基于 Q-learning 元启发式算法的高能效多目标分布式装配包络流水线调度
IF 7.2 1区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2024-09-12 DOI: 10.1016/j.asoc.2024.112247

This study addresses energy-efficient multi-objective distributed assembly permutation flowshop scheduling problems with minimisation of maximum completion time, mean of earliness and tardiness, and total carbon emission simultaneously. A mathematical model is introduced to describe the concerned problems. Five meta-heuristics are employed and improved, including the artificial bee colony, genetic algorithms, particle swarm optimization, iterated greedy algorithms, and Jaya algorithms. To improve the quality of solutions, five critical path-based neighborhood structures are designed. Q-learning, a value-based reinforcement learning algorithm that learns an optimal strategy by repeatedly interacting with the environment, is embedded into meta-heuristics. The Q-learning guides algorithms intelligently select appropriate neighborhood structures in the iterative process. Then, two machine speed adjustment strategies are developed to further optimize the obtained solutions. Finally, extensive experimental results show that the Jaya algorithm with Q-learning has the best performance for solving the considered problems.

本研究探讨了同时最小化最大完成时间、提前和延迟平均值以及总碳排放量的高能效多目标分布式装配排列流动车间调度问题。研究引入了一个数学模型来描述相关问题。采用并改进了五种元启发式算法,包括人工蜂群算法、遗传算法、粒子群优化算法、迭代贪婪算法和 Jaya 算法。为了提高解决方案的质量,设计了五种基于关键路径的邻域结构。Q-learning 是一种基于价值的强化学习算法,它通过与环境的反复交互来学习最优策略,被嵌入到元启发式算法中。Q-learning 引导算法在迭代过程中智能地选择适当的邻域结构。然后,开发了两种机器速度调整策略,以进一步优化获得的解决方案。最后,大量实验结果表明,采用 Q-learning 的 Jaya 算法在解决所考虑的问题时性能最佳。
{"title":"Energy-efficient multi-objective distributed assembly permutation flowshop scheduling by Q-learning based meta-heuristics","authors":"","doi":"10.1016/j.asoc.2024.112247","DOIUrl":"10.1016/j.asoc.2024.112247","url":null,"abstract":"<div><p>This study addresses energy-efficient multi-objective distributed assembly permutation flowshop scheduling problems with minimisation of maximum completion time, mean of earliness and tardiness, and total carbon emission simultaneously. A mathematical model is introduced to describe the concerned problems. Five meta-heuristics are employed and improved, including the artificial bee colony, genetic algorithms, particle swarm optimization, iterated greedy algorithms, and Jaya algorithms. To improve the quality of solutions, five critical path-based neighborhood structures are designed. Q-learning, a value-based reinforcement learning algorithm that learns an optimal strategy by repeatedly interacting with the environment, is embedded into meta-heuristics. The Q-learning guides algorithms intelligently select appropriate neighborhood structures in the iterative process. Then, two machine speed adjustment strategies are developed to further optimize the obtained solutions. Finally, extensive experimental results show that the Jaya algorithm with Q-learning has the best performance for solving the considered problems.</p></div>","PeriodicalId":50737,"journal":{"name":"Applied Soft Computing","volume":null,"pages":null},"PeriodicalIF":7.2,"publicationDate":"2024-09-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142232942","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Modeling barriers to the adoption of metaverse in the construction industry: An application of fuzzy-DEMATEL approach 建筑行业采用元数据的障碍建模:模糊-DEMATEL 方法的应用
IF 7.2 1区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2024-09-12 DOI: 10.1016/j.asoc.2024.112180

The idea of the metaverse has been rather popular in many different sectors since it provides immersive virtual reality where users may connect and participate. Leveraging metaverse technologies—such as virtual reality and augmented reality—for project visualization, collaborative design, and training simulations—in the building industry is attracting increasing attention. Notwithstanding its possible advantages, there is a clear knowledge vacuum on the obstacles preventing the general acceptance of metaverse technology in building. The study intends to close this gap by means of a literature review and analysis of the identified barriers using the fuzzy-DEMATEL technique, therefore separating the causal links among them. There were 26 obstacles found in the literature review and expert comments, arranged technically, organizationally, environmentally, socially, and economically. The most important obstacles shown by results are Security Concerns, Resistance to Change, Lack of Expertise, Siloed Departments, and Training and Education Needs. The results of this research provide building companies and legislators with important new perspectives and direction in developing plans to remove obstacles and encourage the use of metaverse technology. Moreover, the findings of the study provide a road map for industry players in tackling the important issue of restricted data capacities, thereby enabling a better and more successful integration of metaverse technology into building methods.

元宇宙的概念在许多不同领域都相当流行,因为它提供了身临其境的虚拟现实,用户可以在其中进行联系和参与。在建筑行业利用元宇宙技术(如虚拟现实和增强现实技术)进行项目可视化、协同设计和模拟培训正引起越来越多的关注。尽管元宇宙技术可能具有各种优势,但在阻碍建筑业普遍接受元宇宙技术的障碍方面,存在着明显的知识真空。本研究旨在通过文献综述和使用模糊-DEMATEL 技术对已发现的障碍进行分析,从而区分它们之间的因果联系,从而填补这一空白。在文献综述和专家意见中发现了 26 个障碍,分别涉及技术、组织、环境、社会和经济方面。研究结果表明,最重要的障碍是安全顾虑、变革阻力、缺乏专业知识、部门各自为政以及培训和教育需求。这项研究的结果为建筑公司和立法者提供了重要的新视角和方向,帮助他们制定计划,消除障碍,鼓励使用元数据技术。此外,研究结果还为业内人士解决数据容量受限这一重要问题提供了路线图,从而使元数据技术更好、更成功地融入建筑方法中。
{"title":"Modeling barriers to the adoption of metaverse in the construction industry: An application of fuzzy-DEMATEL approach","authors":"","doi":"10.1016/j.asoc.2024.112180","DOIUrl":"10.1016/j.asoc.2024.112180","url":null,"abstract":"<div><p>The idea of the metaverse has been rather popular in many different sectors since it provides immersive virtual reality where users may connect and participate. Leveraging metaverse technologies—such as virtual reality and augmented reality—for project visualization, collaborative design, and training simulations—in the building industry is attracting increasing attention. Notwithstanding its possible advantages, there is a clear knowledge vacuum on the obstacles preventing the general acceptance of metaverse technology in building. The study intends to close this gap by means of a literature review and analysis of the identified barriers using the fuzzy-DEMATEL technique, therefore separating the causal links among them. There were 26 obstacles found in the literature review and expert comments, arranged technically, organizationally, environmentally, socially, and economically. The most important obstacles shown by results are Security Concerns, Resistance to Change, Lack of Expertise, Siloed Departments, and Training and Education Needs. The results of this research provide building companies and legislators with important new perspectives and direction in developing plans to remove obstacles and encourage the use of metaverse technology. Moreover, the findings of the study provide a road map for industry players in tackling the important issue of restricted data capacities, thereby enabling a better and more successful integration of metaverse technology into building methods.</p></div>","PeriodicalId":50737,"journal":{"name":"Applied Soft Computing","volume":null,"pages":null},"PeriodicalIF":7.2,"publicationDate":"2024-09-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142272108","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
期刊
Applied Soft Computing
全部 Acc. Chem. Res. ACS Applied Bio Materials ACS Appl. Electron. Mater. ACS Appl. Energy Mater. ACS Appl. Mater. Interfaces ACS Appl. Nano Mater. ACS Appl. Polym. Mater. ACS BIOMATER-SCI ENG ACS Catal. ACS Cent. Sci. ACS Chem. Biol. ACS Chemical Health & Safety ACS Chem. Neurosci. ACS Comb. Sci. ACS Earth Space Chem. ACS Energy Lett. ACS Infect. Dis. ACS Macro Lett. ACS Mater. Lett. ACS Med. Chem. Lett. ACS Nano ACS Omega ACS Photonics ACS Sens. ACS Sustainable Chem. Eng. ACS Synth. Biol. Anal. Chem. BIOCHEMISTRY-US Bioconjugate Chem. BIOMACROMOLECULES Chem. Res. Toxicol. Chem. Rev. Chem. Mater. CRYST GROWTH DES ENERG FUEL Environ. Sci. Technol. Environ. Sci. Technol. Lett. Eur. J. Inorg. Chem. IND ENG CHEM RES Inorg. Chem. J. Agric. Food. Chem. J. Chem. Eng. Data J. Chem. Educ. J. Chem. Inf. Model. J. Chem. Theory Comput. J. Med. Chem. J. Nat. Prod. J PROTEOME RES J. Am. Chem. Soc. LANGMUIR MACROMOLECULES Mol. Pharmaceutics Nano Lett. Org. Lett. ORG PROCESS RES DEV ORGANOMETALLICS J. Org. Chem. J. Phys. Chem. J. Phys. Chem. A J. Phys. Chem. B J. Phys. Chem. C J. Phys. Chem. Lett. Analyst Anal. Methods Biomater. Sci. Catal. Sci. Technol. Chem. Commun. Chem. Soc. Rev. CHEM EDUC RES PRACT CRYSTENGCOMM Dalton Trans. Energy Environ. Sci. ENVIRON SCI-NANO ENVIRON SCI-PROC IMP ENVIRON SCI-WAT RES Faraday Discuss. Food Funct. Green Chem. Inorg. Chem. Front. Integr. Biol. J. Anal. At. Spectrom. J. Mater. Chem. A J. Mater. Chem. B J. Mater. Chem. C Lab Chip Mater. Chem. Front. Mater. Horiz. MEDCHEMCOMM Metallomics Mol. Biosyst. Mol. Syst. Des. Eng. Nanoscale Nanoscale Horiz. Nat. Prod. Rep. New J. Chem. Org. Biomol. Chem. Org. Chem. Front. PHOTOCH PHOTOBIO SCI PCCP Polym. Chem.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1