首页 > 最新文献

Journal of Computational Science最新文献

英文 中文
Identifying influential spreaders in complex networks based on local and global structure 根据局部和全局结构识别复杂网络中具有影响力的传播者
IF 3.1 3区 计算机科学 Q2 COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS Pub Date : 2024-07-29 DOI: 10.1016/j.jocs.2024.102395
Li Liang, Zhonghui Tang, Shicai Gong

Complex systems intricately intertwine with life, and the identification of the most influential spreaders in complex networks can aid in resolving numerous pragmatic problems. Nevertheless, the identification of such kinds of nodes currently stands as an open and challenging issue. In order to accurately and efficiently address this issue, numerous metrics have been proposed. In this paper, we propose a new method based on degree, clustering coefficient and k-shell decomposition value—DCK to detect the most influential spreaders by gauging the spreading ability of nodes. The proposed centrality assesses the significance of a node by the impacts of its neighbors, encompassing both the local and global network structures. To evaluate the performance of DCK, we compare it with different centrality measures under utilizing the Susceptible–Infected–Recovered model to simulate the propagation of epidemics across real-world networks. Experiments on real networks illustrate that DCK exhibits superior differentiation ability and more accurate identification ability for influential spreaders and compared with other methods, Kendall’s τ correlation coefficient of the DCK could be enhanced by 12.82%, 13.20%, 8.62%, 5.32%, 7.97% and 11.73% for the degree centrality, K-shell decomposition, GLI centrality, H-GSM centrality, LGI centrality and NPCC centrality.

复杂系统与生活错综复杂地交织在一起,识别复杂网络中最具影响力的传播者有助于解决许多实际问题。然而,如何识别这类节点目前还是一个具有挑战性的开放性问题。为了准确有效地解决这一问题,人们提出了许多衡量标准。本文提出了一种基于度、聚类系数和 K 壳分解值的新方法,通过衡量节点的传播能力来检测最具影响力的传播者。所提出的中心度通过节点邻居的影响来评估节点的重要性,包括本地和全球网络结构。为了评估 "中心度 "的性能,我们利用 "易感-感染-恢复 "模型模拟了流行病在真实世界网络中的传播,并将其与不同的中心度测量方法进行了比较。在真实网络上的实验表明,与其他方法相比,"度中心性"、"K 壳分解"、"中心性"、"- 中心性"、"中心性 "和 "中心性 "的 Kendall 相关系数分别提高了 12.82%、13.20%、8.62%、5.32%、7.97% 和 11.73%,显示出卓越的区分能力和对有影响力的传播者更准确的识别能力。
{"title":"Identifying influential spreaders in complex networks based on local and global structure","authors":"Li Liang,&nbsp;Zhonghui Tang,&nbsp;Shicai Gong","doi":"10.1016/j.jocs.2024.102395","DOIUrl":"10.1016/j.jocs.2024.102395","url":null,"abstract":"<div><p>Complex systems intricately intertwine with life, and the identification of the most influential spreaders in complex networks can aid in resolving numerous pragmatic problems. Nevertheless, the identification of such kinds of nodes currently stands as an open and challenging issue. In order to accurately and efficiently address this issue, numerous metrics have been proposed. In this paper, we propose a new method based on degree, clustering coefficient and k-shell decomposition value—<span><math><mrow><mi>D</mi><mi>C</mi><mi>K</mi></mrow></math></span> to detect the most influential spreaders by gauging the spreading ability of nodes. The proposed centrality assesses the significance of a node by the impacts of its neighbors, encompassing both the local and global network structures. To evaluate the performance of <span><math><mrow><mi>D</mi><mi>C</mi><mi>K</mi></mrow></math></span>, we compare it with different centrality measures under utilizing the Susceptible–Infected–Recovered model to simulate the propagation of epidemics across real-world networks. Experiments on real networks illustrate that <span><math><mrow><mi>D</mi><mi>C</mi><mi>K</mi></mrow></math></span> exhibits superior differentiation ability and more accurate identification ability for influential spreaders and compared with other methods, Kendall’s <span><math><mi>τ</mi></math></span> correlation coefficient of the <span><math><mrow><mi>D</mi><mi>C</mi><mi>K</mi></mrow></math></span> could be enhanced by 12.82%, 13.20%, 8.62%, 5.32%, 7.97% and 11.73% for the degree centrality, K-shell decomposition, <span><math><mrow><mi>G</mi><mi>L</mi><mi>I</mi></mrow></math></span> centrality, <span><math><mi>H</mi></math></span>-<span><math><mrow><mi>G</mi><mi>S</mi><mi>M</mi></mrow></math></span> centrality, <span><math><mrow><mi>L</mi><mi>G</mi><mi>I</mi></mrow></math></span> centrality and <span><math><mrow><mi>N</mi><mi>P</mi><mi>C</mi><mi>C</mi></mrow></math></span> centrality.</p></div>","PeriodicalId":48907,"journal":{"name":"Journal of Computational Science","volume":"82 ","pages":"Article 102395"},"PeriodicalIF":3.1,"publicationDate":"2024-07-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141939269","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Higher-order Haar wavelet method for solution of fourth-order integro-differential equations 求解四阶积分微分方程的高阶哈小波方法
IF 3.1 3区 计算机科学 Q2 COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS Pub Date : 2024-07-25 DOI: 10.1016/j.jocs.2024.102394
Shumaila Yasmeen, Rohul Amin

This paper presents a numerical approach to solve third and fourth order intego-differential equations (IDEs). In order to ascertain the numerical solution for third and fourth order IDEs of second kind, the newly introduced Higher order Haar wavelet method (HOHWM) has been employed to improve the numerical result and rate of convergence compared to classical Haar wavelet approach. Some examples available in the literature have been solved to verify the HOHWM’s effectiveness. To ensure that the approach presented is legitimate, applicable and achieves its objective, the maximum absolute error of each test problem is calculated at a test point.

本文提出了一种求解三阶和四阶积分微分方程(IDE)的数值方法。为了确定二阶三阶和四阶积分微分方程的数值解法,采用了新引入的高阶哈小波方法(HOHWM),与经典哈小波方法相比,提高了数值结果和收敛速度。为了验证 HOHWM 的有效性,我们解决了文献中的一些实例。为确保所提出的方法合法、适用并实现其目标,计算了每个测试问题在测试点的最大绝对误差。
{"title":"Higher-order Haar wavelet method for solution of fourth-order integro-differential equations","authors":"Shumaila Yasmeen,&nbsp;Rohul Amin","doi":"10.1016/j.jocs.2024.102394","DOIUrl":"10.1016/j.jocs.2024.102394","url":null,"abstract":"<div><p>This paper presents a numerical approach to solve third and fourth order intego-differential equations (IDEs). In order to ascertain the numerical solution for third and fourth order IDEs of second kind, the newly introduced Higher order Haar wavelet method (HOHWM) has been employed to improve the numerical result and rate of convergence compared to classical Haar wavelet approach. Some examples available in the literature have been solved to verify the HOHWM’s effectiveness. To ensure that the approach presented is legitimate, applicable and achieves its objective, the maximum absolute error of each test problem is calculated at a test point.</p></div>","PeriodicalId":48907,"journal":{"name":"Journal of Computational Science","volume":"81 ","pages":"Article 102394"},"PeriodicalIF":3.1,"publicationDate":"2024-07-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141851804","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Efficient hypergeometric wavelet approach for solving lane-emden equations 解决莱恩-埃姆登方程的高效超几何小波方法
IF 3.1 3区 计算机科学 Q2 COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS Pub Date : 2024-07-24 DOI: 10.1016/j.jocs.2024.102392
B.J. Gireesha, K.J. Gowtham

Nonlinear initial / boundary value problems present challenges in solving due to the divergence of coefficients near singular points. This study introduces a novel hypergeometric wavelet-based approach designed to effectively address these equations. The specialized wavelet method efficiently manages singularities, resulting in improved accuracy. To evaluate the precision and effectiveness of this approach, Lane-Emden type problems are solved using the proposed methodology and compared against established benchmarks. Comparative analyses with alternative wavelet methods are conducted, featuring absolute error tables and graphical representations. The findings highlight the exceptional accuracy and efficiency of the proposed method relative to existing approaches. An advantage of this method is its requirement of fewer basis functions, leading to reduced computational time and complexity.

由于奇异点附近的系数发散,非线性初值/边界值问题的求解面临挑战。本研究介绍了一种基于超几何小波的新方法,旨在有效解决这些方程。专门的小波方法能有效处理奇异点,从而提高精度。为了评估这种方法的精确性和有效性,我们使用所提出的方法解决了 Lane-Emden 类型的问题,并与既定基准进行了比较。此外,还与其他小波方法进行了比较分析,包括绝对误差表和图形表示法。研究结果表明,与现有方法相比,拟议方法具有卓越的准确性和效率。这种方法的优点是需要的基函数较少,从而减少了计算时间和复杂性。
{"title":"Efficient hypergeometric wavelet approach for solving lane-emden equations","authors":"B.J. Gireesha,&nbsp;K.J. Gowtham","doi":"10.1016/j.jocs.2024.102392","DOIUrl":"10.1016/j.jocs.2024.102392","url":null,"abstract":"<div><p>Nonlinear initial / boundary value problems present challenges in solving due to the divergence of coefficients near singular points. This study introduces a novel hypergeometric wavelet-based approach designed to effectively address these equations. The specialized wavelet method efficiently manages singularities, resulting in improved accuracy. To evaluate the precision and effectiveness of this approach, Lane-Emden type problems are solved using the proposed methodology and compared against established benchmarks. Comparative analyses with alternative wavelet methods are conducted, featuring absolute error tables and graphical representations. The findings highlight the exceptional accuracy and efficiency of the proposed method relative to existing approaches. An advantage of this method is its requirement of fewer basis functions, leading to reduced computational time and complexity.</p></div>","PeriodicalId":48907,"journal":{"name":"Journal of Computational Science","volume":"82 ","pages":"Article 102392"},"PeriodicalIF":3.1,"publicationDate":"2024-07-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141844787","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Graph-neural-network potential energy surface to speed up Monte Carlo simulations of water cluster anions 加速水团阴离子蒙特卡罗模拟的图神经网络势能面
IF 3.1 3区 计算机科学 Q2 COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS Pub Date : 2024-07-22 DOI: 10.1016/j.jocs.2024.102383
Alfonso Gijón , Miguel Molina-Solana , Juan Gómez-Romero

Regression of potential energy functions stands as one of the most prevalent applications of machine learning in the realm of materials simulation, offering the prospect of accelerating simulations by several orders of magnitude. Recently, graph-based architectures have emerged as particularly adept for modeling molecular systems. However, the development of robust and transferable potentials, leading to stable simulations for different sizes and physical conditions, remains an ongoing area of investigation. In this study, we compare the performance of several graph neural networks for predicting the energy of water cluster anions, a system of fundamental interest in Chemistry and Biology. Following the identification of the graph attention network as the optimal aggregation procedure for this task, we obtained an efficient and accurate energy model. This model is then employed to conduct Monte Carlo simulations of clusters across different sizes, demonstrating stable behavior. Notably, the predicted surface-to-interior state transition point and the bulk energy of the system are consistent with findings from other investigations, at a computational cost three-orders of magnitude lower.

势能函数回归是机器学习在材料模拟领域最普遍的应用之一,有望将模拟速度提高几个数量级。最近,基于图的架构已成为分子系统建模的最佳选择。然而,如何开发稳健且可转移的势能,从而针对不同尺寸和物理条件进行稳定的模拟,仍然是一个需要持续研究的领域。在本研究中,我们比较了几种图神经网络在预测水簇阴离子能量方面的性能,水簇阴离子是化学和生物学中的一个重要系统。在确定图注意网络是这项任务的最佳聚合程序后,我们获得了一个高效、准确的能量模型。然后,我们利用该模型对不同大小的簇进行蒙特卡罗模拟,结果显示了稳定的行为。值得注意的是,预测的表面到内部状态转换点和系统的主体能量与其他研究结果一致,而计算成本却低了三个数量级。
{"title":"Graph-neural-network potential energy surface to speed up Monte Carlo simulations of water cluster anions","authors":"Alfonso Gijón ,&nbsp;Miguel Molina-Solana ,&nbsp;Juan Gómez-Romero","doi":"10.1016/j.jocs.2024.102383","DOIUrl":"10.1016/j.jocs.2024.102383","url":null,"abstract":"<div><p>Regression of potential energy functions stands as one of the most prevalent applications of machine learning in the realm of materials simulation, offering the prospect of accelerating simulations by several orders of magnitude. Recently, graph-based architectures have emerged as particularly adept for modeling molecular systems. However, the development of robust and transferable potentials, leading to stable simulations for different sizes and physical conditions, remains an ongoing area of investigation. In this study, we compare the performance of several graph neural networks for predicting the energy of water cluster anions, a system of fundamental interest in Chemistry and Biology. Following the identification of the graph attention network as the optimal aggregation procedure for this task, we obtained an efficient and accurate energy model. This model is then employed to conduct Monte Carlo simulations of clusters across different sizes, demonstrating stable behavior. Notably, the predicted surface-to-interior state transition point and the bulk energy of the system are consistent with findings from other investigations, at a computational cost three-orders of magnitude lower.</p></div>","PeriodicalId":48907,"journal":{"name":"Journal of Computational Science","volume":"81 ","pages":"Article 102383"},"PeriodicalIF":3.1,"publicationDate":"2024-07-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141840257","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
High order energy-preserving method for the space fractional Klein–Gordon-Zakharov equations 空间分数克莱因-戈登-扎哈罗夫方程的高阶能量守恒方法
IF 3.1 3区 计算机科学 Q2 COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS Pub Date : 2024-07-17 DOI: 10.1016/j.jocs.2024.102391
Siqi Yang , Jianqiang Sun , Jie Chen

The space fractional Klein–Gordon-Zakharov equations are transformed into the multi-symplectic structure system by introducing new auxiliary variables. The multi-symplectic system, which satisfies the multi-symplectic conservation, local energy and momentum conservation, is discretizated into the semi-discrete multi-symplectic system by the Fourier pseudo-spectral method. The second order multi-symplectic average vector field method is applied to the semi-discrete system. The fully discrete energy preserving scheme of the space fractional Klein–Gordon-Zakharov equation is obtained. Based on the composition method, a fourth order energy preserving scheme of the Riesz space fractional Klein–Gordon-Zakharov equations is also obtained. Numerical experiments confirm that these new schemes can have computing ability for a long time and can well preserve the discrete energy conservation property of the equations.

通过引入新的辅助变量,将空间分数克莱因-戈登-扎哈罗夫方程转化为多折射结构系统。通过傅里叶伪谱法将满足多交映守恒、局部能量和动量守恒的多交映系统离散化为半离散多交映系统。将二阶多交错平均矢量场方法应用于半离散系统。得到了空间分数克莱因-戈登-扎哈罗夫方程的全离散能量保存方案。基于组成方法,还得到了 Riesz 空间分数 Klein-Gordon-Zakharov 方程的四阶能量守恒方案。数值实验证实,这些新方案具有长期计算能力,并能很好地保持方程的离散能量守恒特性。
{"title":"High order energy-preserving method for the space fractional Klein–Gordon-Zakharov equations","authors":"Siqi Yang ,&nbsp;Jianqiang Sun ,&nbsp;Jie Chen","doi":"10.1016/j.jocs.2024.102391","DOIUrl":"10.1016/j.jocs.2024.102391","url":null,"abstract":"<div><p>The space fractional Klein–Gordon-Zakharov equations are transformed into the multi-symplectic structure system by introducing new auxiliary variables. The multi-symplectic system, which satisfies the multi-symplectic conservation, local energy and momentum conservation, is discretizated into the semi-discrete multi-symplectic system by the Fourier pseudo-spectral method. The second order multi-symplectic average vector field method is applied to the semi-discrete system. The fully discrete energy preserving scheme of the space fractional Klein–Gordon-Zakharov equation is obtained. Based on the composition method, a fourth order energy preserving scheme of the Riesz space fractional Klein–Gordon-Zakharov equations is also obtained. Numerical experiments confirm that these new schemes can have computing ability for a long time and can well preserve the discrete energy conservation property of the equations.</p></div>","PeriodicalId":48907,"journal":{"name":"Journal of Computational Science","volume":"81 ","pages":"Article 102391"},"PeriodicalIF":3.1,"publicationDate":"2024-07-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141846720","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
XAI-driven antivirus in pattern identification of citadel malware XAI 驱动的反病毒软件在碉堡恶意软件模式识别中的应用
IF 3.1 3区 计算机科学 Q2 COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS Pub Date : 2024-07-15 DOI: 10.1016/j.jocs.2024.102389
Carlos Henrique Macedo dos Santos , Sidney Marlon Lopes de Lima

Background and Objective:

The constant growth of invasions and information theft by using infected software has always been a problem. According to McAfee labs in 2020, on average, 480 new viruses are created each hour. The means of identifying such threats, categorizing and creating vaccines may not be that fast. Thanks to the increasing processing power and the popularity of artificial intelligence, it is now possible to integrate intelligence on an antivirus engine to enhance its protecting capabilities. And doing so with good algorithms and parameterization can be a key asset in securing one’s environment. In this work we analyze the overall performance of our antivirus and compare it with other state-of-art antiviruses.

Methods:

In this work, we create an extreme neural network which can perform quick training time and have satisfactory accuracy when classifying unknown files that may or may not be infected with Citadel. Our virus database is built with many examples of well-known infected files, and our results are compared with other intelligent antiviruses created by other companies and/or researchers.

The proposed technique stands out as a beneficial practice in terms of efficiency and interpretability; it achieves a very reduced number of neurons through its thorough pruning process. This reduction of dimensionality shrinks the input layer by 98%, enhancing not only data interpretation but also reducing the time required for training.

Results:

Our antivirus achieves an overall performance of 98.50% when distinguishing harmless and malicious portable executable (PE) programs. To enhance accuracy, we conducted tests under various initial conditions, learning functions, and architectures. Our successful results consumes only 0.19 s of training when using the complete training database and the response time is so immediate that the computer rounds it to 0.00 s.

Conclusions:

In this work, we conclude that mELM implementations are viable, and their performance can match state-of-the-art ones. It’s training and classification times are among the fastest of the algorithms tested, and the accuracy in detecting Citadel-infected PEs is acceptable.

背景和目的:使用受感染软件入侵和窃取信息的情况不断增多,这一直是个问题。根据 McAfee 实验室 2020 年的数据,平均每小时会产生 480 种新的病毒。识别这些威胁、对其进行分类并制作疫苗的手段可能并没有那么快。由于处理能力的提高和人工智能的普及,现在可以在杀毒引擎上集成智能,以增强其保护能力。而通过良好的算法和参数化来实现这一点,可以成为保护环境安全的关键资产。在这项工作中,我们分析了我们的反病毒软件的整体性能,并将其与其他最先进的反病毒软件进行了比较。方法:在这项工作中,我们创建了一个极端神经网络,它可以执行快速训练,并在对可能感染或未感染 Citadel 的未知文件进行分类时具有令人满意的准确性。我们的病毒数据库包含了许多众所周知的感染文件实例,我们的结果与其他公司和/或研究人员创建的其他智能反病毒软件进行了比较。结果:我们的杀毒软件在区分无害和恶意的可移植可执行程序(PE)时,总体性能达到了 98.50%。为了提高准确性,我们在不同的初始条件、学习函数和架构下进行了测试。在使用完整的训练数据库时,我们的成功结果只消耗了 0.19 秒的训练时间,而且响应时间非常迅速,计算机将其舍入为 0.00 秒。它的训练和分类时间是所测试算法中最快的,检测受 Citadel 感染的 PE 的准确性也是可以接受的。
{"title":"XAI-driven antivirus in pattern identification of citadel malware","authors":"Carlos Henrique Macedo dos Santos ,&nbsp;Sidney Marlon Lopes de Lima","doi":"10.1016/j.jocs.2024.102389","DOIUrl":"10.1016/j.jocs.2024.102389","url":null,"abstract":"<div><h3>Background and Objective:</h3><p>The constant growth of invasions and information theft by using infected software has always been a problem. According to McAfee labs in 2020, on average, 480 new viruses are created each hour. The means of identifying such threats, categorizing and creating vaccines may not be that fast. Thanks to the increasing processing power and the popularity of artificial intelligence, it is now possible to integrate intelligence on an antivirus engine to enhance its protecting capabilities. And doing so with good algorithms and parameterization can be a key asset in securing one’s environment. In this work we analyze the overall performance of our antivirus and compare it with other state-of-art antiviruses.</p></div><div><h3>Methods:</h3><p>In this work, we create an extreme neural network which can perform quick training time and have satisfactory accuracy when classifying unknown files that may or may not be infected with Citadel. Our virus database is built with many examples of well-known infected files, and our results are compared with other intelligent antiviruses created by other companies and/or researchers.</p><p>The proposed technique stands out as a beneficial practice in terms of efficiency and interpretability; it achieves a very reduced number of neurons through its thorough pruning process. This reduction of dimensionality shrinks the input layer by 98%, enhancing not only data interpretation but also reducing the time required for training.</p></div><div><h3>Results:</h3><p>Our antivirus achieves an overall performance of 98.50% when distinguishing harmless and malicious portable executable (PE) programs. To enhance accuracy, we conducted tests under various initial conditions, learning functions, and architectures. Our successful results consumes only 0.19 s of training when using the complete training database and the response time is so immediate that the computer rounds it to 0.00 s.</p></div><div><h3>Conclusions:</h3><p>In this work, we conclude that mELM implementations are viable, and their performance can match state-of-the-art ones. It’s training and classification times are among the fastest of the algorithms tested, and the accuracy in detecting Citadel-infected PEs is acceptable.</p></div>","PeriodicalId":48907,"journal":{"name":"Journal of Computational Science","volume":"82 ","pages":"Article 102389"},"PeriodicalIF":3.1,"publicationDate":"2024-07-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141695490","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Data-driven hybrid modelling of waves at mid-frequencies range: Application to forward and inverse Helmholtz problems 数据驱动的中频范围波浪混合建模:正向和反向亥姆霍兹问题的应用
IF 3.1 3区 计算机科学 Q2 COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS Pub Date : 2024-07-15 DOI: 10.1016/j.jocs.2024.102384
Nabil El Moçayd , M. Shadi Mohamed , Mohammed Seaid

In this paper, we introduce a novel hybrid approach that leverages both data and numerical simulations to address the challenges of solving forward and inverse wave problems, particularly in the mid-frequency range. Our method is tailored for efficiency and accuracy, considering the computationally intensive nature of these problems, which arise from the need for refined mesh grids and a high number of degrees of freedom. Our approach unfolds in multiple stages, each targeting a specific frequency range. Initially, we decompose the wave field into a grid of finely resolved points, designed to capture the intricate details at various wavenumbers within the frequency range of interest. Importantly, the distribution of these grid points remains consistent across different wavenumbers. Subsequently, we generate a substantial dataset comprising 1,000 maps covering the entire frequency range. Creating such a dataset, especially at higher frequencies, can pose a significant computational challenge. To tackle this, we employ a highly efficient enrichment-based finite element method, ensuring the dataset’s creation is computationally manageable. The dataset which encompasses 1000 different values of the wavenumbers with their corresponding wave simulation will be the basis to train a fully connected neural network. In the forward problem the neural network is trained such that a wave pattern is predicted for each value of the wavenumber. To address the inverse problem while upholding stability, we introduce latent variables to reduce the number of physical parameters. Our trained deep network undergoes rigorous testing for both forward and inverse problems, enabling a direct comparison between predicted solutions and their original counterparts. Once the network is trained, it becomes a powerful tool for accurately solving wave problems in a fraction of the CPU time required by alternative methods. Notably, our approach is supervised, as it relies on a dataset generated through the enriched finite element method, and hyperparameter tuning is carried out for both the forward and inverse networks.

在本文中,我们介绍了一种新颖的混合方法,利用数据和数值模拟来应对解决正向和反向波浪问题的挑战,尤其是在中频范围内。考虑到这些问题的计算密集性,我们的方法是为提高效率和精度而量身定制的,因为这些问题需要精细的网格和大量的自由度。我们的方法分为多个阶段,每个阶段针对特定的频率范围。最初,我们将波场分解成一个个精细分辨点的网格,旨在捕捉相关频率范围内不同波数的复杂细节。重要的是,这些网格点的分布在不同波数之间保持一致。随后,我们生成了一个庞大的数据集,其中包括 1000 张覆盖整个频率范围的地图。创建这样一个数据集,尤其是高频数据集,会给计算带来巨大挑战。为了解决这个问题,我们采用了一种高效的基于富集的有限元方法,确保数据集的创建在计算上是可控的。数据集包含 1000 个不同的波数值及其相应的波模拟,将作为训练全连接神经网络的基础。在正向问题中,对神经网络进行训练,以预测每个波数值的波形。为了在保持稳定性的同时解决逆向问题,我们引入了潜变量,以减少物理参数的数量。我们训练有素的深度网络对正向和反向问题都进行了严格的测试,从而能够直接比较预测的解决方案和它们的原始对应方案。一旦网络训练完成,它就会成为精确解决波浪问题的强大工具,而所需的 CPU 时间只是其他方法的一小部分。值得注意的是,我们的方法是有监督的,因为它依赖于通过丰富的有限元方法生成的数据集,并且对正向和反向网络都进行了超参数调整。
{"title":"Data-driven hybrid modelling of waves at mid-frequencies range: Application to forward and inverse Helmholtz problems","authors":"Nabil El Moçayd ,&nbsp;M. Shadi Mohamed ,&nbsp;Mohammed Seaid","doi":"10.1016/j.jocs.2024.102384","DOIUrl":"10.1016/j.jocs.2024.102384","url":null,"abstract":"<div><p>In this paper, we introduce a novel hybrid approach that leverages both data and numerical simulations to address the challenges of solving forward and inverse wave problems, particularly in the mid-frequency range. Our method is tailored for efficiency and accuracy, considering the computationally intensive nature of these problems, which arise from the need for refined mesh grids and a high number of degrees of freedom. Our approach unfolds in multiple stages, each targeting a specific frequency range. Initially, we decompose the wave field into a grid of finely resolved points, designed to capture the intricate details at various wavenumbers within the frequency range of interest. Importantly, the distribution of these grid points remains consistent across different wavenumbers. Subsequently, we generate a substantial dataset comprising 1,000 maps covering the entire frequency range. Creating such a dataset, especially at higher frequencies, can pose a significant computational challenge. To tackle this, we employ a highly efficient enrichment-based finite element method, ensuring the dataset’s creation is computationally manageable. The dataset which encompasses 1000 different values of the wavenumbers with their corresponding wave simulation will be the basis to train a fully connected neural network. In the forward problem the neural network is trained such that a wave pattern is predicted for each value of the wavenumber. To address the inverse problem while upholding stability, we introduce latent variables to reduce the number of physical parameters. Our trained deep network undergoes rigorous testing for both forward and inverse problems, enabling a direct comparison between predicted solutions and their original counterparts. Once the network is trained, it becomes a powerful tool for accurately solving wave problems in a fraction of the CPU time required by alternative methods. Notably, our approach is supervised, as it relies on a dataset generated through the enriched finite element method, and hyperparameter tuning is carried out for both the forward and inverse networks.</p></div>","PeriodicalId":48907,"journal":{"name":"Journal of Computational Science","volume":"81 ","pages":"Article 102384"},"PeriodicalIF":3.1,"publicationDate":"2024-07-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141715502","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
IP-GCN: A deep learning model for prediction of insulin using graph convolutional network for diabetes drug design IP-GCN:利用图卷积网络预测胰岛素的深度学习模型,用于糖尿病药物设计
IF 3.1 3区 计算机科学 Q2 COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS Pub Date : 2024-07-14 DOI: 10.1016/j.jocs.2024.102388
Farman Ali , Majdi Khalid , Abdullah Almuhaimeed , Atef Masmoudi , Wajdi Alghamdi , Ayman Yafoz

Insulin is a kind of protein that regulates the blood sugar levels is significant to prevent complications associated with diabetes, such as cancer, neurodegenerative disorders, cardiovascular disease, and kidney damage. Insulin protein (IP) plays an active role in drug discovery, medicine, and therapeutic methods. Unlike experimental protocols, computational predictors are fast and can predict IP accurately. This work introduces a model, called IP-GCN for IP prediction. The patterns from IP are extracted by K-spaced position specific scoring matrix (KS-PSSM) and the model training is accomplished using powerful deep learning tool, called Graph Convolutional Network (GCN). Additionally, we implemented Pseudo Amino Acid Composition (PseAAC) and Dipeptide Composition (DPC) for feature encoding to assess the predictive performance of GCN. To evaluate the efficacy of our novel approach, we compare its performance with well-known deep/machine learning algorithms such as Convolutional Neural Network (CNN), Extremely Randomized Tree (ERT), and Support Vector Machine (SVM). Predictive results demonstrate that the proposed predictor (IP-GCN) secured the best performance on both training and testing datasets. The novel computational would be fruitful in diabetes drug discovery and contributes to research for therapeutic interventions in various Insulin protein associated diseases.

胰岛素是一种调节血糖水平的蛋白质,对预防与糖尿病有关的并发症(如癌症、神经退行性疾病、心血管疾病和肾脏损伤)意义重大。胰岛素蛋白(IP)在药物发现、医学和治疗方法中发挥着积极作用。与实验方案不同,计算预测器不仅速度快,而且能准确预测胰岛素蛋白。这项工作介绍了一种用于 IP 预测的模型,称为 IP-GCN。IP 中的模式由 K 距位置特定评分矩阵(KS-PSSM)提取,模型训练由强大的深度学习工具图形卷积网络(GCN)完成。此外,我们还采用了伪氨基酸组成(PseAAC)和二肽组成(DPC)进行特征编码,以评估 GCN 的预测性能。为了评估新方法的功效,我们将其性能与卷积神经网络(CNN)、极随机树(ERT)和支持向量机(SVM)等著名的深度/机器学习算法进行了比较。预测结果表明,所提出的预测器(IP-GCN)在训练和测试数据集上都取得了最佳性能。这种新型计算方法将在糖尿病药物发现方面取得丰硕成果,并有助于各种胰岛素蛋白相关疾病的治疗干预研究。
{"title":"IP-GCN: A deep learning model for prediction of insulin using graph convolutional network for diabetes drug design","authors":"Farman Ali ,&nbsp;Majdi Khalid ,&nbsp;Abdullah Almuhaimeed ,&nbsp;Atef Masmoudi ,&nbsp;Wajdi Alghamdi ,&nbsp;Ayman Yafoz","doi":"10.1016/j.jocs.2024.102388","DOIUrl":"10.1016/j.jocs.2024.102388","url":null,"abstract":"<div><p>Insulin is a kind of protein that regulates the blood sugar levels is significant to prevent complications associated with diabetes, such as cancer, neurodegenerative disorders, cardiovascular disease, and kidney damage. Insulin protein (IP) plays an active role in drug discovery, medicine, and therapeutic methods. Unlike experimental protocols, computational predictors are fast and can predict IP accurately. This work introduces a model, called IP-GCN for IP prediction. The patterns from IP are extracted by K-spaced position specific scoring matrix (KS-PSSM) and the model training is accomplished using powerful deep learning tool, called Graph Convolutional Network (GCN). Additionally, we implemented Pseudo Amino Acid Composition (PseAAC) and Dipeptide Composition (DPC) for feature encoding to assess the predictive performance of GCN. To evaluate the efficacy of our novel approach, we compare its performance with well-known deep/machine learning algorithms such as Convolutional Neural Network (CNN), Extremely Randomized Tree (ERT), and Support Vector Machine (SVM). Predictive results demonstrate that the proposed predictor (IP-GCN) secured the best performance on both training and testing datasets. The novel computational would be fruitful in diabetes drug discovery and contributes to research for therapeutic interventions in various Insulin protein associated diseases.</p></div>","PeriodicalId":48907,"journal":{"name":"Journal of Computational Science","volume":"81 ","pages":"Article 102388"},"PeriodicalIF":3.1,"publicationDate":"2024-07-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141638666","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
MDEFC: Automatic recognition of human activities using modified differential evolution based fuzzy clustering method MDEFC:利用基于模糊聚类的修正差分进化法自动识别人类活动
IF 3.1 3区 计算机科学 Q2 COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS Pub Date : 2024-07-11 DOI: 10.1016/j.jocs.2024.102377
Abdulaziz Alblwi

In the present scenario, automatic Human Activity Recognition (HAR) is an emerging research topic, particularly in the applications of healthcare, Human Computer Interaction (HCI), and smart homes. By reviewing existing literature, the majority of the HAR methods achieved limited performance, while trained and tested utilizing unseen Internet of Things (IoT) data. In order to achieve higher recognition performance in the context of HAR, a new clustering method named Modified Differential Evolution based Fuzzy Clustering (MDEFC) is proposed in this article. The proposed MDEFC method incorporates an asymptotic termination rule and a new differential weight for enhancing the termination condition and improving this method’s ability in exploring the solution space of the objective function. The extensive empirical analysis states that the proposed MDEFC method achieved impressive recognition results with minimal training time by using both spatial and temporal features of the individual. The proposed MDEFC method’s effectiveness is tested on a real time dataset and an online Wireless Sensor Data Mining (WISDM) v1.1 dataset. The result findings demonstrate that the proposed MDEFC method averagely obtained 99.73 % of precision and 99.86 % of recall on the WISDM v1.1 dataset. Similarly, the proposed MDEFC method averagely obtained 93.46 % of f1-measure, 94.60 % of recall, and 93.88 % of precision on the real time dataset. These obtained experimental results are significantly higher in comparison to the traditional HAR methods.

在当前情况下,自动人类活动识别(HAR)是一个新兴的研究课题,尤其是在医疗保健、人机交互(HCI)和智能家居等应用领域。通过查阅现有文献,大多数人类活动识别(HAR)方法在利用未见的物联网(IoT)数据进行训练和测试时,性能有限。为了在 HAR 中实现更高的识别性能,本文提出了一种新的聚类方法,名为基于模糊聚类的修正差分进化(MDEFC)。所提出的 MDEFC 方法采用了渐近终止规则和新的微分权重来增强终止条件,并提高了该方法探索目标函数解空间的能力。大量的实证分析表明,所提出的 MDEFC 方法利用个体的空间和时间特征,在最短的训练时间内取得了令人印象深刻的识别结果。在实时数据集和在线无线传感器数据挖掘(WISDM)v1.1 数据集上测试了所提出的 MDEFC 方法的有效性。结果表明,所提出的 MDEFC 方法在 WISDM v1.1 数据集上平均获得了 99.73 % 的精确度和 99.86 % 的召回率。同样,拟议的 MDEFC 方法在实时数据集上平均获得了 93.46 % 的 f1-measure、94.60 % 的召回率和 93.88 % 的精确率。这些实验结果明显高于传统的 HAR 方法。
{"title":"MDEFC: Automatic recognition of human activities using modified differential evolution based fuzzy clustering method","authors":"Abdulaziz Alblwi","doi":"10.1016/j.jocs.2024.102377","DOIUrl":"10.1016/j.jocs.2024.102377","url":null,"abstract":"<div><p>In the present scenario, automatic Human Activity Recognition (HAR) is an emerging research topic, particularly in the applications of healthcare, Human Computer Interaction (HCI), and smart homes. By reviewing existing literature, the majority of the HAR methods achieved limited performance, while trained and tested utilizing unseen Internet of Things (IoT) data. In order to achieve higher recognition performance in the context of HAR, a new clustering method named Modified Differential Evolution based Fuzzy Clustering (MDEFC) is proposed in this article. The proposed MDEFC method incorporates an asymptotic termination rule and a new differential weight for enhancing the termination condition and improving this method’s ability in exploring the solution space of the objective function. The extensive empirical analysis states that the proposed MDEFC method achieved impressive recognition results with minimal training time by using both spatial and temporal features of the individual. The proposed MDEFC method’s effectiveness is tested on a real time dataset and an online Wireless Sensor Data Mining (WISDM) v1.1 dataset. The result findings demonstrate that the proposed MDEFC method averagely obtained 99.73 % of precision and 99.86 % of recall on the WISDM v1.1 dataset. Similarly, the proposed MDEFC method averagely obtained 93.46 % of f1-measure, 94.60 % of recall, and 93.88 % of precision on the real time dataset. These obtained experimental results are significantly higher in comparison to the traditional HAR methods.</p></div>","PeriodicalId":48907,"journal":{"name":"Journal of Computational Science","volume":"81 ","pages":"Article 102377"},"PeriodicalIF":3.1,"publicationDate":"2024-07-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141630816","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Optimizing physical quantities of ferrite hybrid nanofluid via response surface methodology: Sensitivity and spectral analyses 通过响应面方法优化铁氧体混合纳米流体的物理量:灵敏度和光谱分析
IF 3.1 3区 计算机科学 Q2 COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS Pub Date : 2024-07-11 DOI: 10.1016/j.jocs.2024.102387
Sweta, RamReddy Chetteti, Pranitha Janapatla

This study analyses the sensitivity analysis of the friction factor and heat transfer rate within a hybrid nanoliquid flow of 20W40 motor oil (a base liquid that has been characterized by the Society of Automotive Engineers) + nickel zinc ferrite- manganese zinc ferrite over a stretchable sheet utilizing the Response Surface Methodology (RSM) along with irreversibility analysis. The melting phenomenon with buoyancy effect has been considered. Hybrid nanofluids exhibit improved thermal connectivity, enhanced mechanical resilience, favorable aspect ratios, and superior thermal conductivity when compared to conventional nanofluids. The system of governing equations is transformed into dimensionless form using the Lie group approach. Numerical computations are performed utilizing the spectral local linearization method. It is demonstrated that the Nusselt number and friction drag are decreased due to the increase of manganese and nickel zinc ferrites particles in the fluid. Further, the melting parameter reduces entropy generation by 41.16% and the viscous dissipation parameter minimizes surface friction. Sensitivity analysis, conducted through RSM, reveals that skin friction and the Nusselt number are positively sensitive to the melting parameter. The numerical solutions have been compared with the available results along with error estimations, which show excellent agreement. Comparison of both hybrid nanofluids are displayed graphically. Finally, this work has many uses such as microwave and biomedical applications, electromagnetic interfaces, melting, and welding operations which are the most significant manufacturing applications important in various sectors such as cooling systems of nuclear reactors.

本研究利用响应面方法(RSM)和不可逆分析,分析了 20W40 机油(一种由美国汽车工程师协会鉴定的基础液体)+镍锌铁氧体-锰锌铁氧体混合纳米液体在可拉伸薄片上流动时的摩擦系数和传热速率的敏感性分析。考虑了具有浮力效应的熔化现象。与传统纳米流体相比,混合纳米流体具有更好的热连通性、更强的机械弹性、有利的纵横比和更优越的导热性。利用李氏方程组方法将控制方程系统转化为无量纲形式。利用谱局部线性化方法进行了数值计算。结果表明,由于流体中锰和镍锌铁氧体颗粒的增加,努塞尔特数和摩擦阻力都有所下降。此外,熔化参数可将熵的产生减少 41.16%,而粘性耗散参数可将表面摩擦降至最低。通过 RSM 进行的敏感性分析表明,表皮摩擦和努塞尔特数对熔化参数呈正敏感性。数值解与现有结果以及误差估计进行了比较,结果显示两者非常吻合。两种混合纳米流体的比较结果以图表形式显示。最后,这项工作有很多用途,如微波和生物医学应用、电磁界面、熔化和焊接操作,这些都是在核反应堆冷却系统等各个领域中最重要的制造应用。
{"title":"Optimizing physical quantities of ferrite hybrid nanofluid via response surface methodology: Sensitivity and spectral analyses","authors":"Sweta,&nbsp;RamReddy Chetteti,&nbsp;Pranitha Janapatla","doi":"10.1016/j.jocs.2024.102387","DOIUrl":"10.1016/j.jocs.2024.102387","url":null,"abstract":"<div><p>This study analyses the sensitivity analysis of the friction factor and heat transfer rate within a hybrid nanoliquid flow of 20W40 motor oil (a base liquid that has been characterized by the Society of Automotive Engineers) + nickel zinc ferrite- manganese zinc ferrite over a stretchable sheet utilizing the Response Surface Methodology (RSM) along with irreversibility analysis. The melting phenomenon with buoyancy effect has been considered. Hybrid nanofluids exhibit improved thermal connectivity, enhanced mechanical resilience, favorable aspect ratios, and superior thermal conductivity when compared to conventional nanofluids. The system of governing equations is transformed into dimensionless form using the Lie group approach. Numerical computations are performed utilizing the spectral local linearization method. It is demonstrated that the Nusselt number and friction drag are decreased due to the increase of manganese and nickel zinc ferrites particles in the fluid. Further, the melting parameter reduces entropy generation by 41.16% and the viscous dissipation parameter minimizes surface friction. Sensitivity analysis, conducted through RSM, reveals that skin friction and the Nusselt number are positively sensitive to the melting parameter. The numerical solutions have been compared with the available results along with error estimations, which show excellent agreement. Comparison of both hybrid nanofluids are displayed graphically. Finally, this work has many uses such as microwave and biomedical applications, electromagnetic interfaces, melting, and welding operations which are the most significant manufacturing applications important in various sectors such as cooling systems of nuclear reactors.</p></div>","PeriodicalId":48907,"journal":{"name":"Journal of Computational Science","volume":"81 ","pages":"Article 102387"},"PeriodicalIF":3.1,"publicationDate":"2024-07-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141714716","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
期刊
Journal of Computational Science
全部 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