首页 > 最新文献

Journal of Computational Science最新文献

英文 中文
AFF-BPL: An adaptive feature fusion technique for the diagnosis of autism spectrum disorder using Bat-PSO-LSTM based framework AFF-BPL:使用基于 Bat-PSO-LSTM 框架的自适应特征融合技术诊断自闭症谱系障碍
IF 3.1 3区 计算机科学 Q2 COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS Pub Date : 2024-09-24 DOI: 10.1016/j.jocs.2024.102447
Autism spectrum disorder (ASD) is a neurological condition revealed by deficiencies in physical well-being, social communication, hyperactive behavior, and increased sensitivity. The delayed diagnosis of ASD showcases a significant obstacle in mitigating the severity of its impact. Individuals with ASD often exhibit restricted and repetitive behavioral patterns. In this context, we proposed a novel adaptive feature fusion technique with a BAT-PSO-LSTM-based network for the diagnosis of autism spectrum disorder. Our focus is on three distinct autism screening datasets namely, Toddlers, Children, and Adults for comprehensive analysis of techniques. Bat and PSO concurrently select features and the selected features will go through an adaptive feature fusion algorithm and an LSTM-based classifier. This research addresses various challenges encountered in the existing techniques including concerns related to overfitting, faster training, interpretability, generalization capability, and reduced computation time. The work incorporates baseline techniques like a neural network, CNN, and LSTM with evaluations based on key parameters like precision, specificity, accuracy, sensitivity, and f1-score. The experimental simulations reveal that AFF-BPL outperforms considered baseline techniques achieving remarkable accuracy on all three datasets. Specifically, the model attains the accuracy of 0.992, 0.989, and 0.986 on toddler, children, and adult datasets respectively. Additionally, the exploration of functional and structural images will provide deeper insights into the underlying mechanism of ASD.
自闭症谱系障碍(ASD)是一种神经系统疾病,表现为身体健康、社会交往、多动行为和敏感性增强等方面的缺陷。自闭症的延迟诊断是减轻其严重影响的一大障碍。ASD 患者通常表现出局限性和重复性的行为模式。在此背景下,我们提出了一种基于 BAT-PSO-LSTM 网络的新型自适应特征融合技术,用于自闭症谱系障碍的诊断。我们将重点放在三个不同的自闭症筛查数据集上,即幼儿、儿童和成人数据集,以便对技术进行全面分析。Bat 和 PSO 同时选择特征,所选特征将经过自适应特征融合算法和基于 LSTM 的分类器。这项研究解决了现有技术中遇到的各种挑战,包括与过拟合、更快的训练、可解释性、泛化能力和减少计算时间有关的问题。该研究结合了神经网络、CNN 和 LSTM 等基线技术,并根据精度、特异性、准确度、灵敏度和 f1 分数等关键参数进行了评估。实验模拟显示,AFF-BPL 在所有三个数据集上的准确性都优于所考虑的基准技术。具体来说,该模型在幼儿、儿童和成人数据集上的准确率分别达到了 0.992、0.989 和 0.986。此外,对功能和结构图像的探索将有助于深入了解 ASD 的内在机制。
{"title":"AFF-BPL: An adaptive feature fusion technique for the diagnosis of autism spectrum disorder using Bat-PSO-LSTM based framework","authors":"","doi":"10.1016/j.jocs.2024.102447","DOIUrl":"10.1016/j.jocs.2024.102447","url":null,"abstract":"<div><div>Autism spectrum disorder (ASD) is a neurological condition revealed by deficiencies in physical well-being, social communication, hyperactive behavior, and increased sensitivity. The delayed diagnosis of ASD showcases a significant obstacle in mitigating the severity of its impact. Individuals with ASD often exhibit restricted and repetitive behavioral patterns. In this context, we proposed a novel adaptive feature fusion technique with a BAT-PSO-LSTM-based network for the diagnosis of autism spectrum disorder. Our focus is on three distinct autism screening datasets namely, Toddlers, Children, and Adults for comprehensive analysis of techniques. Bat and PSO concurrently select features and the selected features will go through an adaptive feature fusion algorithm and an LSTM-based classifier. This research addresses various challenges encountered in the existing techniques including concerns related to overfitting, faster training, interpretability, generalization capability, and reduced computation time. The work incorporates baseline techniques like a neural network, CNN, and LSTM with evaluations based on key parameters like precision, specificity, accuracy, sensitivity, and f1-score. The experimental simulations reveal that AFF-BPL outperforms considered baseline techniques achieving remarkable accuracy on all three datasets. Specifically, the model attains the accuracy of 0.992, 0.989, and 0.986 on toddler, children, and adult datasets respectively. Additionally, the exploration of functional and structural images will provide deeper insights into the underlying mechanism of ASD.</div></div>","PeriodicalId":48907,"journal":{"name":"Journal of Computational Science","volume":null,"pages":null},"PeriodicalIF":3.1,"publicationDate":"2024-09-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142328168","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 robust optimization in the face of large-scale datasets: An incremental learning approach 面对大规模数据集的数据驱动稳健优化:增量学习法
IF 3.1 3区 计算机科学 Q2 COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS Pub Date : 2024-09-21 DOI: 10.1016/j.jocs.2024.102432
One of the most significant current discussions in optimization under deep uncertainty is integrating machine learning and data science into robust optimization, which has led to the emergence of a new field called Data-Driven Robust Optimization (DDRO). When creating data-driven uncertainty sets, it considers a dataset’s complexity, hidden information, and inherent form. One of the more practical machine learning algorithms for creating data-driven uncertainty sets is support vector clustering (SVC). This algorithm has no prerequisites for preliminary information to generate uncertainty sets with arbitrary geometry. More scenarios can reduce risk when developing SVC-based uncertainty sets. However, the lack of a systematic way to manage the large number of these scenarios hinders the employment of SVC. This paper puts forward an incremental learning algorithm based on support vector clustering, called Incremental Support Vector Clustering (ISVC), to construct an uncertainty set incrementally and efficiently using large datasets. This approach’s novelty and main contributions include incrementally constructing uncertainty sets and dynamic management of outliers. In order to update the temporarily stored Bounded Support Vectors (BSV) and identify outliers, the idea of BSV-archive is offered, where the revision-and-recycle operation is tailored to do just that. As a result, some of the newly acquired information is preserved. Experiments on large-scale datasets demonstrate that the proposed ISVC approach can create an uncertainty set comparable to that of an SVC-based method while using significantly less time.
在深度不确定性条件下的优化方面,当前最重要的讨论之一是将机器学习和数据科学整合到稳健优化中,这导致了一个名为数据驱动稳健优化(DDRO)的新领域的出现。在创建数据驱动的不确定性集时,它要考虑数据集的复杂性、隐藏信息和固有形式。支持向量聚类(SVC)是用于创建数据驱动不确定性集的较为实用的机器学习算法之一。这种算法对初步信息没有先决条件,可以生成任意几何形状的不确定集合。在开发基于 SVC 的不确定性集时,更多的场景可以降低风险。然而,由于缺乏系统的方法来管理这些大量的情景,SVC 的应用受到了阻碍。本文提出了一种基于支持向量聚类的增量学习算法,称为增量支持向量聚类(ISVC),利用大型数据集增量、高效地构建不确定度集。这种方法的新颖性和主要贡献包括增量构建不确定集和动态管理异常值。为了更新临时存储的有界支持向量(BSV)并识别离群值,我们提出了 BSV 存档的想法,其中的修订和循环操作正是为实现这一目的而量身定制的。因此,一些新获取的信息得以保留。在大规模数据集上进行的实验表明,所提出的 ISVC 方法可以创建一个与基于 SVC 方法相当的不确定性集,而所用时间却大大减少。
{"title":"Data-driven robust optimization in the face of large-scale datasets: An incremental learning approach","authors":"","doi":"10.1016/j.jocs.2024.102432","DOIUrl":"10.1016/j.jocs.2024.102432","url":null,"abstract":"<div><div>One of the most significant current discussions in optimization under deep uncertainty is integrating machine learning and data science into robust optimization, which has led to the emergence of a new field called Data-Driven Robust Optimization (DDRO). When creating data-driven uncertainty sets, it considers a dataset’s complexity, hidden information, and inherent form. One of the more practical machine learning algorithms for creating data-driven uncertainty sets is support vector clustering (SVC). This algorithm has no prerequisites for preliminary information to generate uncertainty sets with arbitrary geometry. More scenarios can reduce risk when developing SVC-based uncertainty sets. However, the lack of a systematic way to manage the large number of these scenarios hinders the employment of SVC. This paper puts forward an incremental learning algorithm based on support vector clustering, called Incremental Support Vector Clustering (ISVC), to construct an uncertainty set incrementally and efficiently using large datasets. This approach’s novelty and main contributions include incrementally constructing uncertainty sets and dynamic management of outliers. In order to update the temporarily stored Bounded Support Vectors (BSV) and identify outliers, the idea of BSV-archive is offered, where the revision-and-recycle operation is tailored to do just that. As a result, some of the newly acquired information is preserved. Experiments on large-scale datasets demonstrate that the proposed ISVC approach can create an uncertainty set comparable to that of an SVC-based method while using significantly less time.</div></div>","PeriodicalId":48907,"journal":{"name":"Journal of Computational Science","volume":null,"pages":null},"PeriodicalIF":3.1,"publicationDate":"2024-09-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142319878","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
VEGF-ERCNN: A deep learning-based model for prediction of vascular endothelial growth factor using ensemble residual CNN VEGF-ERCNN:利用集合残差 CNN 预测血管内皮生长因子的深度学习模型
IF 3.1 3区 计算机科学 Q2 COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS Pub Date : 2024-09-20 DOI: 10.1016/j.jocs.2024.102448

Vascular Endothelial Growth Factor (VEGF), a signaling protein family, is essential in angiogenesis, regulating the growth and survival of endothelial cells that create blood vessels. VEGF is critical in osteogenesis for coordinating blood vessel growth with bone formation, resulting in a well-vascularized environment that promotes nutrition and oxygen delivery to bone-forming cells. Predicting VEGF is crucial, yet experimental methods for identification are both costly and time-consuming. This paper introduces VEGF-ERCNN, an innovative computational model for VEGF prediction using deep learning. Two datasets were generated using primary sequences, and a novel feature descriptor called multi fragmented-position specific scoring matrix-discrete wavelet transformation (MF-PSSM-DWT) was developed to extract numerical characteristics from these sequences. Model training is performed via deep learning techniques such as generative adversarial network (GAN), gated recurrent unit (GRU), ensemble residual convolutional neural network (ERCNN), and convolutional neural network (CNN). The VEGF-ERCNN outperformed other competitive predictors on both training and testing datasets by securing the highest 92.12 % and 83.45 % accuracies, respectively. Accurate prediction of VEGF therapeutic targeting has transformed treatment techniques, establishing it as a crucial participant in both health and disease.

血管内皮生长因子(VEGF)是一个信号蛋白家族,在血管生成过程中起着至关重要的作用,它能调节生成血管的内皮细胞的生长和存活。血管内皮生长因子在成骨过程中至关重要,它能协调血管生长和骨骼形成,从而形成一个良好的血管环境,促进向骨骼形成细胞输送营养和氧气。预测血管内皮生长因子至关重要,但用于鉴定的实验方法既昂贵又耗时。本文介绍了 VEGF-ERCNN,这是一种利用深度学习预测血管内皮生长因子的创新计算模型。利用原始序列生成了两个数据集,并开发了一种名为多片段位置特定评分矩阵-离散小波变换(MF-PSSM-DWT)的新型特征描述符,以从这些序列中提取数字特征。模型训练通过生成对抗网络(GAN)、门控递归单元(GRU)、集合残差卷积神经网络(ERCNN)和卷积神经网络(CNN)等深度学习技术进行。在训练和测试数据集上,VEGF-ERCNN 的准确率分别高达 92.12% 和 83.45%,优于其他同类预测器。血管内皮生长因子治疗靶向的准确预测改变了治疗技术,使其成为健康和疾病的重要参与者。
{"title":"VEGF-ERCNN: A deep learning-based model for prediction of vascular endothelial growth factor using ensemble residual CNN","authors":"","doi":"10.1016/j.jocs.2024.102448","DOIUrl":"10.1016/j.jocs.2024.102448","url":null,"abstract":"<div><p>Vascular Endothelial Growth Factor (VEGF), a signaling protein family, is essential in angiogenesis, regulating the growth and survival of endothelial cells that create blood vessels. VEGF is critical in osteogenesis for coordinating blood vessel growth with bone formation, resulting in a well-vascularized environment that promotes nutrition and oxygen delivery to bone-forming cells. Predicting VEGF is crucial, yet experimental methods for identification are both costly and time-consuming. This paper introduces VEGF-ERCNN, an innovative computational model for VEGF prediction using deep learning. Two datasets were generated using primary sequences, and a novel feature descriptor called multi fragmented-position specific scoring matrix-discrete wavelet transformation (MF-PSSM-DWT) was developed to extract numerical characteristics from these sequences. Model training is performed via deep learning techniques such as generative adversarial network (GAN), gated recurrent unit (GRU), ensemble residual convolutional neural network (ERCNN), and convolutional neural network (CNN). The VEGF-ERCNN outperformed other competitive predictors on both training and testing datasets by securing the highest 92.12 % and 83.45 % accuracies, respectively. Accurate prediction of VEGF therapeutic targeting has transformed treatment techniques, establishing it as a crucial participant in both health and disease.</p></div>","PeriodicalId":48907,"journal":{"name":"Journal of Computational Science","volume":null,"pages":null},"PeriodicalIF":3.1,"publicationDate":"2024-09-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142274659","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
A new space–time localized meshless method based on coupling radial and polynomial basis functions for solving singularly perturbed nonlinear Burgers’ equation 基于径向基函数和多项式基函数耦合的新型时空局部无网格方法,用于求解奇异扰动非线性布尔格斯方程
IF 3.1 3区 计算机科学 Q2 COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS Pub Date : 2024-09-19 DOI: 10.1016/j.jocs.2024.102446
In this paper, the singularly perturbed nonlinear Burgers’ problem (SPBP) with small kinematic viscosity 0<ϵ1 is solved using a new Space–Time Localized collocation method based on coupling Polynomial and Radial Basis Functions (STLPRBF). To our best knowledge, it is the first time that the solution of SPBP is accurately approximated using the space–time meshless method without applying any adaptive refinement technique. The method is based on solving the problem without distinguishing between space and time variables, which eliminates the need for time discretization schemes. To address the inherent non-linearity of the problem, the method employs an iterative algorithm based on quasilinearization technique. The efficiency and accuracy of the proposed method are demonstrated by solving different examples of one- and two-dimensional SPBP with very small ϵ up to 1010. Additionally, the numerical convergence of the method with respect to ϵ and also to the number of collocation points has been investigated. The comparison of the STLPRBF results with other published ones is presented.
本文采用基于耦合多项式和径向基函数(STLPRBF)的新时空局部配位法求解了具有小运动粘度 0<ϵ≪1 的奇异扰动非线性布尔格斯问题(SPBP)。据我们所知,这是首次在不应用任何自适应细化技术的情况下使用无网格时空法精确逼近 SPBP 的解。该方法是在不区分空间和时间变量的情况下求解问题,因此无需时间离散化方案。为了解决该问题固有的非线性问题,该方法采用了基于准线性化技术的迭代算法。通过求解ϵ 非常小(10-10)的一维和二维 SPBP 的不同示例,证明了所提方法的效率和准确性。此外,还研究了该方法的数值收敛性与ϵ 和配位点数量的关系。此外,还将 STLPRBF 的结果与其他已发表的结果进行了比较。
{"title":"A new space–time localized meshless method based on coupling radial and polynomial basis functions for solving singularly perturbed nonlinear Burgers’ equation","authors":"","doi":"10.1016/j.jocs.2024.102446","DOIUrl":"10.1016/j.jocs.2024.102446","url":null,"abstract":"<div><div>In this paper, the singularly perturbed nonlinear Burgers’ problem (SPBP) with small kinematic viscosity <span><math><mrow><mn>0</mn><mo>&lt;</mo><mi>ϵ</mi><mo>≪</mo><mn>1</mn></mrow></math></span> is solved using a new Space–Time Localized collocation method based on coupling Polynomial and Radial Basis Functions (STLPRBF). To our best knowledge, it is the first time that the solution of SPBP is accurately approximated using the space–time meshless method without applying any adaptive refinement technique. The method is based on solving the problem without distinguishing between space and time variables, which eliminates the need for time discretization schemes. To address the inherent non-linearity of the problem, the method employs an iterative algorithm based on quasilinearization technique. The efficiency and accuracy of the proposed method are demonstrated by solving different examples of one- and two-dimensional SPBP with very small <span><math><mi>ϵ</mi></math></span> up to <span><math><mrow><mn>1</mn><msup><mrow><mn>0</mn></mrow><mrow><mo>−</mo><mn>10</mn></mrow></msup></mrow></math></span>. Additionally, the numerical convergence of the method with respect to <span><math><mi>ϵ</mi></math></span> and also to the number of collocation points has been investigated. The comparison of the STLPRBF results with other published ones is presented.</div></div>","PeriodicalId":48907,"journal":{"name":"Journal of Computational Science","volume":null,"pages":null},"PeriodicalIF":3.1,"publicationDate":"2024-09-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142315014","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
Implementation of the emulator-based component analysis 实施基于仿真器的组件分析
IF 3.1 3区 计算机科学 Q2 COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS Pub Date : 2024-09-18 DOI: 10.1016/j.jocs.2024.102437
We present a PyTorch-powered implementation of the emulator-based component analysis used for ill-posed numerical non-linear inverse problems, where an approximate emulator for the forward problem is known. This emulator may be a numerical model, an interpolating function, or a fitting function such as a neural network. With the help of the emulator and a data set, the method seeks dimensionality reduction by projection in the variable space so that maximal variance of the target (response) values of the data is covered. The obtained basis set for projection in the variable space defines a subspace of the greatest response for the outcome of the forward problem. The method allows for the reconstruction of the coordinates in this subspace for an approximate solution to the inverse problem. We present an example of using the code provided as a Python class.
我们介绍了一种 PyTorch 驱动的基于仿真器的分量分析实现,该实现用于已知前向问题近似仿真器的问题。该仿真器可以是一个数值模型、一个插值函数或一个拟合函数(如神经网络)。在仿真器和数据集的帮助下,该方法通过在变量空间中进行投影来降低维度,从而覆盖数据目标(响应)值的最大方差。获得的变量空间投影基集定义了前向问题结果的最大响应子空间。该方法允许在该子空间中重建坐标,以获得逆问题的近似解。我们将举例说明如何使用 Python 类提供的代码。
{"title":"Implementation of the emulator-based component analysis","authors":"","doi":"10.1016/j.jocs.2024.102437","DOIUrl":"10.1016/j.jocs.2024.102437","url":null,"abstract":"<div><div>We present a PyTorch-powered implementation of the emulator-based component analysis used for ill-posed numerical non-linear inverse problems, where an approximate emulator for the forward problem is known. This emulator may be a numerical model, an interpolating function, or a fitting function such as a neural network. With the help of the emulator and a data set, the method seeks dimensionality reduction by projection in the variable space so that maximal variance of the target (response) values of the data is covered. The obtained basis set for projection in the variable space defines a subspace of the greatest response for the outcome of the forward problem. The method allows for the reconstruction of the coordinates in this subspace for an approximate solution to the inverse problem. We present an example of using the code provided as a Python class.</div></div>","PeriodicalId":48907,"journal":{"name":"Journal of Computational Science","volume":null,"pages":null},"PeriodicalIF":3.1,"publicationDate":"2024-09-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S1877750324002308/pdfft?md5=48eb0727ba0e208a45b58ba3c8f2bac4&pid=1-s2.0-S1877750324002308-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142315015","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
A feasible numerical computation based on matrix operations and collocation points to solve linear system of partial differential equations 基于矩阵运算和配位点的可行数值计算,用于求解线性偏微分方程系
IF 3.1 3区 计算机科学 Q2 COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS Pub Date : 2024-09-17 DOI: 10.1016/j.jocs.2024.102445

In this work, a system of linear partial differential equations with constant and variable coefficients via Cauchy conditions is handled by applying the numerical algorithm based on operational matrices and equally-spaced collocation points. To demonstrate the applicability and efficiency of the method, four illustrative examples are tested along with absolute error, maximum absolute error, RMS error, and CPU times. The approximate solutions are compared with the analytical solutions and other numerical results in literature. The obtained numerical results are scrutinized by means of tables and graphics. These comparisons show accuracy and productivity of our method for the linear systems of partial differential equations. Besides, an algorithm is described that summarizes the formulation of the presented method. This algorithm can be adapted to well-known computer programs.

在这项工作中,通过柯西条件,应用基于运算矩阵和等间距配置点的数值算法,处理了一个具有常数和可变系数的线性偏微分方程系统。为了证明该方法的适用性和效率,对四个示例进行了绝对误差、最大绝对误差、均方根误差和 CPU 时间的测试。近似解与分析解以及文献中的其他数值结果进行了比较。通过表格和图形对所获得的数值结果进行了仔细检查。这些比较显示了我们的方法对线性偏微分方程系统的准确性和效率。此外,还介绍了一种算法,该算法总结了所介绍方法的表述。该算法可适用于著名的计算机程序。
{"title":"A feasible numerical computation based on matrix operations and collocation points to solve linear system of partial differential equations","authors":"","doi":"10.1016/j.jocs.2024.102445","DOIUrl":"10.1016/j.jocs.2024.102445","url":null,"abstract":"<div><p>In this work, a system of linear partial differential equations with constant and variable coefficients via Cauchy conditions is handled by applying the numerical algorithm based on operational matrices and equally-spaced collocation points. To demonstrate the applicability and efficiency of the method, four illustrative examples are tested along with absolute error, maximum absolute error, RMS error, and CPU times. The approximate solutions are compared with the analytical solutions and other numerical results in literature. The obtained numerical results are scrutinized by means of tables and graphics. These comparisons show accuracy and productivity of our method for the linear systems of partial differential equations. Besides, an algorithm is described that summarizes the formulation of the presented method. This algorithm can be adapted to well-known computer programs<strong>.</strong></p></div>","PeriodicalId":48907,"journal":{"name":"Journal of Computational Science","volume":null,"pages":null},"PeriodicalIF":3.1,"publicationDate":"2024-09-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142241749","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
A Markov random field model for change points detection 用于变化点检测的马尔可夫随机场模型
IF 3.1 3区 计算机科学 Q2 COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS Pub Date : 2024-09-07 DOI: 10.1016/j.jocs.2024.102429

Detecting Change Points (CPs) in data sequences is a challenging problem that arises in a variety of disciplines, including signal processing and time series analysis. While many methods exist for PieceWise Constant (PWC) signals, relatively fewer address PieceWise Linear (PWL) signals due to the challenge of preserving sharp transitions. This paper introduces a Markov Random Field (MRF) model for detecting changes in slope. The number of CPs and their locations are unknown. The proposed method incorporates PWL prior information using MRF framework with an additional boolean variable called Line Process (LP), describing the presence or absence of CPs. The solution is then estimated in the sense of maximum a posteriori. The LP allows us to define a non-convex non-smooth energy function that is algorithmically hard to minimize. To tackle the optimization challenge, we propose an extension of the combinatorial algorithm DPS, initially designed for CP detection in PWC signals. Also, we present a shared memory implementation to enhance computational efficiency. Numerical studies show that the proposed model produces competitive results compared to the state-of-the-art methods. We further evaluate the performance of our method on three real datasets, demonstrating superior and accurate estimates of the underlying trend compared to competing methods.

检测数据序列中的变化点(CP)是一个具有挑战性的问题,它出现在信号处理和时间序列分析等多个学科中。虽然针对片断常数(PWC)信号有很多方法,但针对片断线性(PWL)信号的方法相对较少,这是因为保留尖锐过渡是一个难题。本文介绍了一种用于检测斜率变化的马尔可夫随机场(MRF)模型。CP 的数量及其位置都是未知的。所提出的方法利用 MRF 框架将 PWL 先验信息与一个名为 "线过程(LP)"的额外布尔变量相结合,描述了 CP 的存在与否。然后根据最大后验法估算出解决方案。LP 允许我们定义一个非凸非平滑能量函数,该函数在算法上很难最小化。为了应对优化挑战,我们提出了组合算法 DPS 的扩展,该算法最初是为 PWC 信号中的 CP 检测而设计的。此外,我们还提出了一种共享内存实现方法,以提高计算效率。数值研究表明,与最先进的方法相比,所提出的模型能产生有竞争力的结果。我们进一步评估了我们的方法在三个真实数据集上的性能,结果表明,与其他竞争方法相比,我们的方法对基本趋势的估计更加出色和准确。
{"title":"A Markov random field model for change points detection","authors":"","doi":"10.1016/j.jocs.2024.102429","DOIUrl":"10.1016/j.jocs.2024.102429","url":null,"abstract":"<div><p>Detecting Change Points (CPs) in data sequences is a challenging problem that arises in a variety of disciplines, including signal processing and time series analysis. While many methods exist for PieceWise Constant (PWC) signals, relatively fewer address PieceWise Linear (PWL) signals due to the challenge of preserving sharp transitions. This paper introduces a Markov Random Field (MRF) model for detecting changes in slope. The number of CPs and their locations are unknown. The proposed method incorporates PWL prior information using MRF framework with an additional boolean variable called Line Process (LP), describing the presence or absence of CPs. The solution is then estimated in the sense of maximum a posteriori. The LP allows us to define a non-convex non-smooth energy function that is algorithmically hard to minimize. To tackle the optimization challenge, we propose an extension of the combinatorial algorithm DPS, initially designed for CP detection in PWC signals. Also, we present a shared memory implementation to enhance computational efficiency. Numerical studies show that the proposed model produces competitive results compared to the state-of-the-art methods. We further evaluate the performance of our method on three real datasets, demonstrating superior and accurate estimates of the underlying trend compared to competing methods.</p></div>","PeriodicalId":48907,"journal":{"name":"Journal of Computational Science","volume":null,"pages":null},"PeriodicalIF":3.1,"publicationDate":"2024-09-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142167258","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
DeepDetect: An innovative hybrid deep learning framework for anomaly detection in IoT networks DeepDetect:用于物联网网络异常检测的创新型混合深度学习框架
IF 3.1 3区 计算机科学 Q2 COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS Pub Date : 2024-09-06 DOI: 10.1016/j.jocs.2024.102426
<div><p>The presence of threats and anomalies in the Internet of Things infrastructure is a rising concern. Attacks, such as Denial of Service, User to Root, Probing, and Malicious operations can lead to the failure of an Internet of Things system. Traditional machine learning methods rely entirely on feature engineering availability to determine which data features will be considered by the model and contribute to its training and classification and “dimensionality” reduction techniques to find the most optimal correlation between data points that influence the outcome. The performance of the model mostly depends on the features that are used. This reliance on feature engineering and its effects on the model performance has been demonstrated from the perspective of the Internet of Things intrusion detection system. Unfortunately, given the risks associated with the Internet of Things intrusion, feature selection considerations are quite complicated due to the subjective complexity. Each feature has its benefits and drawbacks depending on which features are selected. Deep structured learning is a subcategory of machine learning. It realizes features inevitably out of raw data as it has a deep structure that contains multiple hidden layers. However, deep learning models such as recurrent neural networks can capture arbitrary-length dependencies, which are difficult to handle and train. However, it is suffering from exploiting and vanishing gradient problems. On the other hand, the log-cosh conditional variational Autoencoder ignores the detection of the multiple class classification problem, and it has a high level of false alarms and a not high detection accuracy. Moreover, the Autoencoder ignores to detect multi-class classification. Furthermore, there is evidence that a single convolutional neural network cannot fully exploit the rich information in network traffic. To deal with the challenges, this research proposed a novel approach for network anomaly detection. The proposed model consists of multiple convolutional neural networks, gate-recurrent units, and a bi-directional-long-short-term memory network. The proposed model employs multiple convolution neural networks to grasp spatial features from the spatial dimension through network traffic. Furthermore, gate recurrent units overwhelm the problem of gradient disappearing- and effectively capture the correlation between the features. In addition, the bi-directional-long short-term memory network approach was used. This layer benefits from preserving the historical context for a long time and extracting temporal features from backward and forward network traffic data. The proposed hybrid model improves network traffic’s accuracy and detection rate while lowering the false positive rate. The proposed model is evaluated and tested on the intrusion detection benchmark NSL-KDD dataset. Our proposed model outperforms other methods, as evidenced by the experimental results. The overall accuracy of
物联网基础设施中存在的威胁和异常现象日益引起人们的关注。拒绝服务、用户转根、探测和恶意操作等攻击可导致物联网系统瘫痪。传统的机器学习方法完全依赖于特征工程的可用性,以确定模型将考虑哪些数据特征,并促进其训练和分类,同时依赖于 "降维 "技术,以找到影响结果的数据点之间的最佳相关性。模型的性能主要取决于所使用的特征。从物联网入侵检测系统的角度来看,这种对特征工程的依赖及其对模型性能的影响已得到证实。遗憾的是,考虑到物联网入侵的相关风险,由于主观复杂性,特征选择的考虑因素相当复杂。根据所选特征的不同,每个特征都有其优点和缺点。深度结构化学习是机器学习的一个子类别。由于它具有包含多个隐藏层的深层结构,因此它能不可避免地从原始数据中实现特征。然而,递归神经网络等深度学习模型可以捕捉任意长度的依赖关系,这很难处理和训练。然而,它也存在剥削和梯度消失问题。另一方面,log-cosh 条件变分自动编码器忽略了多类分类问题的检测,误报率较高,检测精度不高。此外,自动编码器还忽略了对多类分类的检测。此外,有证据表明,单一卷积神经网络无法充分利用网络流量中的丰富信息。为了应对这些挑战,本研究提出了一种新的网络异常检测方法。所提出的模型由多个卷积神经网络、门-递归单元和双向长短期记忆网络组成。该模型采用多重卷积神经网络,通过网络流量从空间维度把握空间特征。此外,门递归单元克服了梯度消失的问题,有效捕捉了特征之间的相关性。此外,还采用了双向长短期记忆网络方法。该层可长期保存历史背景,并从前后网络流量数据中提取时间特征。所提出的混合模型提高了网络流量的准确性和检测率,同时降低了误报率。我们在入侵检测基准 NSL-KDD 数据集上对所提出的模型进行了评估和测试。实验结果表明,我们提出的模型优于其他方法。所提模型的多类分类总体准确率为 99.31%,二元分类准确率为 99.12%。
{"title":"DeepDetect: An innovative hybrid deep learning framework for anomaly detection in IoT networks","authors":"","doi":"10.1016/j.jocs.2024.102426","DOIUrl":"10.1016/j.jocs.2024.102426","url":null,"abstract":"&lt;div&gt;&lt;p&gt;The presence of threats and anomalies in the Internet of Things infrastructure is a rising concern. Attacks, such as Denial of Service, User to Root, Probing, and Malicious operations can lead to the failure of an Internet of Things system. Traditional machine learning methods rely entirely on feature engineering availability to determine which data features will be considered by the model and contribute to its training and classification and “dimensionality” reduction techniques to find the most optimal correlation between data points that influence the outcome. The performance of the model mostly depends on the features that are used. This reliance on feature engineering and its effects on the model performance has been demonstrated from the perspective of the Internet of Things intrusion detection system. Unfortunately, given the risks associated with the Internet of Things intrusion, feature selection considerations are quite complicated due to the subjective complexity. Each feature has its benefits and drawbacks depending on which features are selected. Deep structured learning is a subcategory of machine learning. It realizes features inevitably out of raw data as it has a deep structure that contains multiple hidden layers. However, deep learning models such as recurrent neural networks can capture arbitrary-length dependencies, which are difficult to handle and train. However, it is suffering from exploiting and vanishing gradient problems. On the other hand, the log-cosh conditional variational Autoencoder ignores the detection of the multiple class classification problem, and it has a high level of false alarms and a not high detection accuracy. Moreover, the Autoencoder ignores to detect multi-class classification. Furthermore, there is evidence that a single convolutional neural network cannot fully exploit the rich information in network traffic. To deal with the challenges, this research proposed a novel approach for network anomaly detection. The proposed model consists of multiple convolutional neural networks, gate-recurrent units, and a bi-directional-long-short-term memory network. The proposed model employs multiple convolution neural networks to grasp spatial features from the spatial dimension through network traffic. Furthermore, gate recurrent units overwhelm the problem of gradient disappearing- and effectively capture the correlation between the features. In addition, the bi-directional-long short-term memory network approach was used. This layer benefits from preserving the historical context for a long time and extracting temporal features from backward and forward network traffic data. The proposed hybrid model improves network traffic’s accuracy and detection rate while lowering the false positive rate. The proposed model is evaluated and tested on the intrusion detection benchmark NSL-KDD dataset. Our proposed model outperforms other methods, as evidenced by the experimental results. The overall accuracy of","PeriodicalId":48907,"journal":{"name":"Journal of Computational Science","volume":null,"pages":null},"PeriodicalIF":3.1,"publicationDate":"2024-09-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S1877750324002199/pdfft?md5=499c056a20080f0138b115130d2376c9&pid=1-s2.0-S1877750324002199-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142149749","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
An interpretable wildfire spreading model for real-time predictions 用于实时预测的可解释野火蔓延模型
IF 3.1 3区 计算机科学 Q2 COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS Pub Date : 2024-09-04 DOI: 10.1016/j.jocs.2024.102435

Forest fires are a key component of natural ecosystems, but their increased frequency and intensity have devastating social, economic, and environmental implications. Thus, there is a great need for trustworthy digital tools capable of providing real-time estimates of fire evolution and human interventions. This work develops an interpretable, physics-based model that will serve as the core of a broader wildfire prediction tool. The modeling approach involves a simplified description of combustion kinetics and thermal energy transfer (averaged over local plantation height) and leads to a computationally inexpensive system of differential equations that provides the spatiotemporal evolution of the two-dimensional fields of temperature and combustibles. Key aspects of the model include the estimation of mean wind velocity through the plantation and the inclusion of the effect of ground inclination. Predictions are successfully compared to benchmark literature results concerning the effect of flammable bulk density, moisture content, and the combined influence of wind and slope. Simulations appear to provide qualitatively correct descriptions of firefront propagation from a localized ignition site in a homogeneous or heterogeneous canopy, of acceleration resulting from the collision of oblique firelines, and of firefront overshoot or arrest at fuel break zones.

森林火灾是自然生态系统的重要组成部分,但其频率和强度的增加会对社会、经济和环境造成破坏性影响。因此,我们亟需能够对火灾演变和人类干预进行实时评估的可靠数字工具。这项工作开发了一个可解释的、基于物理学的模型,将作为更广泛的野火预测工具的核心。建模方法涉及对燃烧动力学和热能传递(当地植被高度的平均值)的简化描述,并产生了一个计算成本低廉的微分方程系统,该系统提供了温度和可燃物二维场的时空演变。该模型的关键部分包括对穿过植被的平均风速的估算,以及对地面倾斜度影响的考虑。预测结果成功地与有关可燃物体积密度、含水量以及风和坡度综合影响的基准文献结果进行了比较。模拟似乎从质量上正确地描述了火线从同质或异质冠层中的局部着火点开始的传播、斜火线碰撞产生的加速以及火线在燃料断裂带处的偏移或停止。
{"title":"An interpretable wildfire spreading model for real-time predictions","authors":"","doi":"10.1016/j.jocs.2024.102435","DOIUrl":"10.1016/j.jocs.2024.102435","url":null,"abstract":"<div><p>Forest fires are a key component of natural ecosystems, but their increased frequency and intensity have devastating social, economic, and environmental implications. Thus, there is a great need for trustworthy digital tools capable of providing real-time estimates of fire evolution and human interventions. This work develops an interpretable, physics-based model that will serve as the core of a broader wildfire prediction tool. The modeling approach involves a simplified description of combustion kinetics and thermal energy transfer (averaged over local plantation height) and leads to a computationally inexpensive system of differential equations that provides the spatiotemporal evolution of the two-dimensional fields of temperature and combustibles. Key aspects of the model include the estimation of mean wind velocity through the plantation and the inclusion of the effect of ground inclination. Predictions are successfully compared to benchmark literature results concerning the effect of flammable bulk density, moisture content, and the combined influence of wind and slope. Simulations appear to provide qualitatively correct descriptions of firefront propagation from a localized ignition site in a homogeneous or heterogeneous canopy, of acceleration resulting from the collision of oblique firelines, and of firefront overshoot or arrest at fuel break zones.</p></div>","PeriodicalId":48907,"journal":{"name":"Journal of Computational Science","volume":null,"pages":null},"PeriodicalIF":3.1,"publicationDate":"2024-09-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142149748","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
Surface feature extraction method for cloud data of aircraft wall panel measurement points 飞机壁板测量点云数据的表面特征提取方法
IF 3.1 3区 计算机科学 Q2 COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS Pub Date : 2024-09-03 DOI: 10.1016/j.jocs.2024.102427

In the cloud, users need to connect to the data server to perform the file transmission via the Internet, and the Server transmits data to many servers. A machine or vehicle that can fly with the assistance of the air is known as an Aircraft. As an alternative to the downward thrust of jet engines, it uses either static lift or an airfoil's dynamic lift to combat gravity's pull. Drawing wall panel measurement points in the model is easy using the Aircraft Wall Panels (AWP) button. Draw wall panels between existing nodes or on the drawing grid using the relevant wall panel specifications. The technique intends to discover and extract information about undesirable defects such as dents, protrusions, or scratches based on local surface attributes gathered from a 3D scanner. Defects from a perfectly smooth surface include indentations and bumps on the surface. An image's features may be extracted by reducing the number of pixels in the picture to a manageable size so that the most exciting sections of the image can be recorded with Surface Feature Extraction (SFE). Some of the problems are the threat of drones and composite materials that do not break easily in oxymoronic. The aircraft's inner structure may have been damaged, although this is impossible to determine. A runway incursion severely threatens aviation safety because of the rise in aircraft movement on the airport surface and other human factors. An electronic moving map of airport runways and taxiways is shown to the pilot through a head-up display in the cockpit's head-down position. A practical feature extraction approach is required to ensure the safety of the airport scene in runway incursion prevention systems. All the drawbacks are rectified by AWP-SFE sensors installed along the runway centerline to detect magnetic signals generated by surface-moving targets, and this information is utilized to compute the target's length. The target length may extract peak features after regularizing the time domain data. Differentiation of target characteristics is used to determine the similarities between distinct targets. The suggested method's signal characteristics are more easily recognized than time domain or frequency domain feature methods. The experimental results show the proposed method AWP-SE to achieve a high-efficiency ratio of 88.2 %, activity ratio of 73.3 %, Analysis of aircraft in wall plane measurement point of 87.8 % and an error rate of 32.3 % compared to other methods.

在云计算中,用户需要通过互联网连接到数据服务器进行文件传输,服务器将数据传输到许多服务器。可以借助空气飞行的机器或车辆被称为飞机。作为喷气发动机向下推力的替代,它利用静态升力或机翼的动态升力来对抗重力的拉力。使用飞机壁板 (AWP) 按钮可以轻松绘制模型中的壁板测量点。使用相关壁板规格在现有节点之间或绘图网格上绘制壁板。该技术旨在根据三维扫描仪收集的局部表面属性,发现和提取有关凹痕、突出物或划痕等不良缺陷的信息。完全光滑表面的缺陷包括表面的凹痕和凸起。要提取图像的特征,可以将图片中的像素数量减少到可控制的大小,这样就可以利用表面特征提取(SFE)技术记录图像中最精彩的部分。其中一些问题是无人机的威胁和复合材料的不易破裂。飞机的内部结构可能已经受损,尽管这无法确定。跑道入侵严重威胁航空安全,因为飞机在机场地面上的运动量会增加,还有其他人为因素。机场跑道和滑行道的电子移动地图通过驾驶舱低头位置的平视显示器显示给飞行员。为确保跑道入侵预防系统中机场场景的安全性,需要一种实用的特征提取方法。沿跑道中心线安装的 AWP-SFE 传感器可检测地表移动目标产生的磁信号,并利用这些信息计算目标的长度,从而纠正所有缺点。在对时域数据进行正则化处理后,目标长度可提取峰值特征。目标特征的区分用于确定不同目标之间的相似性。与时域或频域特征方法相比,建议方法的信号特征更容易识别。实验结果表明,与其他方法相比,建议的 AWP-SE 方法实现了 88.2 % 的高效率、73.3 % 的活跃率、87.8 % 的壁面测量点飞机分析率和 32.3 % 的误差率。
{"title":"Surface feature extraction method for cloud data of aircraft wall panel measurement points","authors":"","doi":"10.1016/j.jocs.2024.102427","DOIUrl":"10.1016/j.jocs.2024.102427","url":null,"abstract":"<div><p>In the cloud, users need to connect to the data server to perform the file transmission via the Internet, and the Server transmits data to many servers. A machine or vehicle that can fly with the assistance of the air is known as an Aircraft. As an alternative to the downward thrust of jet engines, it uses either static lift or an airfoil's dynamic lift to combat gravity's pull. Drawing wall panel measurement points in the model is easy using the Aircraft Wall Panels (AWP) button. Draw wall panels between existing nodes or on the drawing grid using the relevant wall panel specifications. The technique intends to discover and extract information about undesirable defects such as dents, protrusions, or scratches based on local surface attributes gathered from a 3D scanner. Defects from a perfectly smooth surface include indentations and bumps on the surface. An image's features may be extracted by reducing the number of pixels in the picture to a manageable size so that the most exciting sections of the image can be recorded with Surface Feature Extraction (SFE). Some of the problems are the threat of drones and composite materials that do not break easily in oxymoronic. The aircraft's inner structure may have been damaged, although this is impossible to determine. A runway incursion severely threatens aviation safety because of the rise in aircraft movement on the airport surface and other human factors. An electronic moving map of airport runways and taxiways is shown to the pilot through a head-up display in the cockpit's head-down position. A practical feature extraction approach is required to ensure the safety of the airport scene in runway incursion prevention systems. All the drawbacks are rectified by AWP-SFE sensors installed along the runway centerline to detect magnetic signals generated by surface-moving targets, and this information is utilized to compute the target's length. The target length may extract peak features after regularizing the time domain data. Differentiation of target characteristics is used to determine the similarities between distinct targets. The suggested method's signal characteristics are more easily recognized than time domain or frequency domain feature methods. The experimental results show the proposed method AWP-SE to achieve a high-efficiency ratio of 88.2 %, activity ratio of 73.3 %, Analysis of aircraft in wall plane measurement point of 87.8 % and an error rate of 32.3 % compared to other methods.</p></div>","PeriodicalId":48907,"journal":{"name":"Journal of Computational Science","volume":null,"pages":null},"PeriodicalIF":3.1,"publicationDate":"2024-09-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142149750","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