首页 > 最新文献

Journal of Computational Science最新文献

英文 中文
Computational model of ammonia synthesis with catalyst pellets: Linking the structure and performance 催化球团合成氨的计算模型:连接结构与性能
IF 3.7 3区 计算机科学 Q2 COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS Pub Date : 2025-10-30 DOI: 10.1016/j.jocs.2025.102737
Michael Abeiku Daniels, Anna Geohagan, Agnieszka Truszkowska
Packed bed reactors are one of the most widely utilized reactors in today’s industry, consisting of randomly packed catalyst pellets with reaction participants flowing through the void space and diffusing into the pellets. The efficiency of these reactors is reduced due to a range of factors, and there exist continuous efforts to improve their performance. Due to their complexity, these systems offer numerous opportunities for optimization, relying on computational models to accelerate the exploration of enhancements. The modeling efforts rarely consider the pore space of the reactors, as its accurate representation requires large computational resources. In this work, we leverage an established model of ammonia synthesis to simulate reactors with explicitly resolved catalyst pellets in two dimensions. We reformulate one of the original parameters and identify its suitable value through an optimization algorithm, along with the properties of pellet size distribution that best approximates the actual process. We then use a recently proposed approach for identifying the structural characteristics of porous media that dominate their performance to find which pore-scale properties are likely to have an impact on reactor performance. Once found, we change the suggested properties by manipulating particle radii and their spacing, achieving the expected yield increase. We show that these structural changes can be used to introduce both significant and gradual increases of product yield, which is beneficial for identifying ways to improve the reactor performance and the model itself.
填充床反应器是当今工业中应用最广泛的反应器之一,它由随机填充的催化剂球团组成,反应参与者流过空隙并扩散到球团中。这些反应器的效率由于一系列因素而降低,并且存在不断改进其性能的努力。由于它们的复杂性,这些系统提供了许多优化的机会,依靠计算模型来加速增强的探索。建模工作很少考虑反应器的孔隙空间,因为它的准确表示需要大量的计算资源。在这项工作中,我们利用一个已建立的氨合成模型来模拟具有明确分解催化剂颗粒的反应器在两个维度上。我们重新制定了一个原始参数,并通过优化算法确定其合适的值,以及最接近实际过程的颗粒尺寸分布特性。然后,我们使用最近提出的方法来识别主导其性能的多孔介质的结构特征,以发现哪些孔隙尺度特性可能对反应器性能产生影响。一旦发现,我们通过控制粒子半径和它们的间距来改变建议的性质,达到预期的产量增加。我们表明,这些结构变化可以用来引入产品产量的显著和逐渐增加,这有利于确定改善反应器性能和模型本身的方法。
{"title":"Computational model of ammonia synthesis with catalyst pellets: Linking the structure and performance","authors":"Michael Abeiku Daniels,&nbsp;Anna Geohagan,&nbsp;Agnieszka Truszkowska","doi":"10.1016/j.jocs.2025.102737","DOIUrl":"10.1016/j.jocs.2025.102737","url":null,"abstract":"<div><div>Packed bed reactors are one of the most widely utilized reactors in today’s industry, consisting of randomly packed catalyst pellets with reaction participants flowing through the void space and diffusing into the pellets. The efficiency of these reactors is reduced due to a range of factors, and there exist continuous efforts to improve their performance. Due to their complexity, these systems offer numerous opportunities for optimization, relying on computational models to accelerate the exploration of enhancements. The modeling efforts rarely consider the pore space of the reactors, as its accurate representation requires large computational resources. In this work, we leverage an established model of ammonia synthesis to simulate reactors with explicitly resolved catalyst pellets in two dimensions. We reformulate one of the original parameters and identify its suitable value through an optimization algorithm, along with the properties of pellet size distribution that best approximates the actual process. We then use a recently proposed approach for identifying the structural characteristics of porous media that dominate their performance to find which pore-scale properties are likely to have an impact on reactor performance. Once found, we change the suggested properties by manipulating particle radii and their spacing, achieving the expected yield increase. We show that these structural changes can be used to introduce both significant and gradual increases of product yield, which is beneficial for identifying ways to improve the reactor performance and the model itself.</div></div>","PeriodicalId":48907,"journal":{"name":"Journal of Computational Science","volume":"93 ","pages":"Article 102737"},"PeriodicalIF":3.7,"publicationDate":"2025-10-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145420499","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
Parallel sparsity patterns for factored incomplete inverse matrices 分解不完全逆矩阵的并行稀疏模式
IF 3.7 3区 计算机科学 Q2 COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS Pub Date : 2025-10-28 DOI: 10.1016/j.jocs.2025.102736
Christos K. Filelis-Papadopoulos, George A. Gravvanis
The solution of large sparse linear systems is an essential part in many scientific fields. Numerical solution of such systems is usually performed using iterative methods in conjunction with effective preconditioning schemes. Recently, an adaptive factored approached based on adaptive sparsity patterns was proposed. Utilizing their recursive form novel dynamic sparsity patterns are introduced. These novel sparsity patterns enable fully parallel implementation of the factored approximate inverse matrices. In order to further improve performance pre-filling and post-filling is introduced. These strategies reduce the amount of repetitive solutions of local linear systems required during dynamic pattern formation. The parallel performance and effectiveness of the proposed scheme are assessed by solving a multitude of model problems. Furthermore, comparative results are also given.
大型稀疏线性系统的求解是许多科学领域的重要组成部分。这类系统的数值解通常采用迭代法并结合有效的预处理方案。近年来,提出了一种基于自适应稀疏模式的自适应因子方法。利用它们的递归形式,介绍了一种新的动态稀疏模式。这些新颖的稀疏模式使分解近似逆矩阵的完全并行实现成为可能。为了进一步提高性能,介绍了预填充和后填充。这些策略减少了动态模式形成过程中所需的局部线性系统的重复解的数量。通过求解大量的模型问题,评估了该方案的并行性能和有效性。并给出了比较结果。
{"title":"Parallel sparsity patterns for factored incomplete inverse matrices","authors":"Christos K. Filelis-Papadopoulos,&nbsp;George A. Gravvanis","doi":"10.1016/j.jocs.2025.102736","DOIUrl":"10.1016/j.jocs.2025.102736","url":null,"abstract":"<div><div>The solution of large sparse linear systems is an essential part in many scientific fields. Numerical solution of such systems is usually performed using iterative methods in conjunction with effective preconditioning schemes. Recently, an adaptive factored approached based on adaptive sparsity patterns was proposed. Utilizing their recursive form novel dynamic sparsity patterns are introduced. These novel sparsity patterns enable fully parallel implementation of the factored approximate inverse matrices. In order to further improve performance pre-filling and post-filling is introduced. These strategies reduce the amount of repetitive solutions of local linear systems required during dynamic pattern formation. The parallel performance and effectiveness of the proposed scheme are assessed by solving a multitude of model problems. Furthermore, comparative results are also given.</div></div>","PeriodicalId":48907,"journal":{"name":"Journal of Computational Science","volume":"93 ","pages":"Article 102736"},"PeriodicalIF":3.7,"publicationDate":"2025-10-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145419552","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 generalized colouring method for a parallelizable integer linear programming approach to polyomino tiling 多线形平铺的可并行整数线性规划的一种广义着色方法
IF 3.7 3区 计算机科学 Q2 COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS Pub Date : 2025-10-24 DOI: 10.1016/j.jocs.2025.102734
Marcus R. Garvie , John Burkardt
This article presents a generalized checkerboard colouring method for solving large polyomino tiling problems using integer linear programming (ILP). Extending a previous two-colour approach, our method scales to three or more colours, improving runtimes in cases where the two-colour method offers no advantage. We rigorously derive ILP formulations for both the coloured and uncoloured cases and propose a proof-of-concept parallel implementation to improve scalability in these NP-complete tiling problems. Numerical experiments using MATLAB, CPLEX, and Gurobi demonstrate significant reductions in problem size and computation time. This approach has the potential to solve tiling problems substantially larger than those previously tractable using ILP-based methods. Although our colouring method generates many subproblems, it allows for the efficient exploration of a manageable subset to find feasible solutions. Our publicly available MATLAB package, CHROMINOES (v1.0.0), constructs ILP formulations, plots solutions, and is available for download on Zenodo.org. We conclude by discussing the implications of these results and outlining key challenges in developing a fully practical parallel implementation, including load balancing and managing the overhead associated with processing a large number of subproblems.
本文提出了一种用整数线性规划(ILP)求解大多项式平铺问题的通用棋盘着色方法。扩展之前的双色方法,我们的方法扩展到三种或更多的颜色,在双色方法没有优势的情况下改进运行时间。我们严格推导了有色和非有色情况下的ILP公式,并提出了一个概念验证并行实现,以提高这些np完全平铺问题的可扩展性。使用MATLAB、CPLEX和Gurobi的数值实验表明,问题大小和计算时间显著减少。这种方法有可能解决比以前使用基于ilp的方法处理的问题大得多的平铺问题。尽管我们的着色方法产生了许多子问题,但它允许有效地探索可管理的子集以找到可行的解决方案。我们公开提供的MATLAB软件包CHROMINOES (v1.0.0),构建ILP公式,绘制解决方案,并可在Zenodo.org上下载。最后,我们讨论了这些结果的含义,并概述了开发完全实用的并行实现的关键挑战,包括负载平衡和管理与处理大量子问题相关的开销。
{"title":"A generalized colouring method for a parallelizable integer linear programming approach to polyomino tiling","authors":"Marcus R. Garvie ,&nbsp;John Burkardt","doi":"10.1016/j.jocs.2025.102734","DOIUrl":"10.1016/j.jocs.2025.102734","url":null,"abstract":"<div><div>This article presents a generalized checkerboard colouring method for solving large polyomino tiling problems using integer linear programming (ILP). Extending a previous two-colour approach, our method scales to three or more colours, improving runtimes in cases where the two-colour method offers no advantage. We rigorously derive ILP formulations for both the coloured and uncoloured cases and propose a proof-of-concept parallel implementation to improve scalability in these <span><math><mi>NP</mi></math></span>-complete tiling problems. Numerical experiments using <span>MATLAB</span>, <span>CPLEX</span>, and <span>Gurobi</span> demonstrate significant reductions in problem size and computation time. This approach has the potential to solve tiling problems substantially larger than those previously tractable using ILP-based methods. Although our colouring method generates many subproblems, it allows for the efficient exploration of a manageable subset to find feasible solutions. Our publicly available <span>MATLAB</span> package, <span>CHROMINOES</span> (v1.0.0), constructs ILP formulations, plots solutions, and is available for download on <span><span>Zenodo.org</span><svg><path></path></svg></span>. We conclude by discussing the implications of these results and outlining key challenges in developing a fully practical parallel implementation, including load balancing and managing the overhead associated with processing a large number of subproblems.</div></div>","PeriodicalId":48907,"journal":{"name":"Journal of Computational Science","volume":"93 ","pages":"Article 102734"},"PeriodicalIF":3.7,"publicationDate":"2025-10-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145371234","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 cellular automata-Lattice Boltzmann method for modeling solidification microstructure 高效元胞自动机-晶格玻尔兹曼方法模拟凝固组织
IF 3.7 3区 计算机科学 Q2 COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS Pub Date : 2025-10-23 DOI: 10.1016/j.jocs.2025.102735
Jingjing Wang , Xiaoyu Liu , Ruina Mao
This paper introduces a 3D GPU-accelerated Cellular Automata-Lattice Boltzmann (CA-LB) Method that resolves the fully coupled interaction between thermosolutal convection and dendritic growth in a single three-dimensional simulation. The novelty of the proposed framework lies in (i) tailoring GPU kernels and memory layouts specifically for the simultaneous evolution of solute, temperature and solid fraction fields, and (ii) revealing three-dimensional helical flow patterns that directly dictate upstream/downstream branch selection and final micro-segregation patterns. Targeted optimizations, lattice-ordered storage of 19 distribution functions and a refactored collision-streaming pattern, yield a 1058 × speed-up over a CPU serial code and enable grid-resolved simulations of Fe–0.6 wt% C alloy solidification within hours instead of weeks. Benchmark validations against natural-convection solutions (error < 0.9 %) and modified Lipton–Glicksman–Kurz analytical predictions confirm quantitative accuracy. The resulting physics highlights that (1) dendrite growth drives convection that preferentially accelerates upstream arms while suppressing downstream arms, (2) growth direction and domain confinement control vortex topology and intensity, and (3) complex helical streamline patterns and dendritic forms can be precisely captured, providing a comprehensive understanding of fluid flow and dendritic growth dynamics, revealing features unseen in 2D simulations. These findings offer an high-throughput platform for designing next-generation alloys with targeted solidification microstructures.
本文介绍了一种基于gpu加速的三维元胞自动机-晶格玻尔兹曼(CA-LB)方法,该方法在单个三维模拟中解决了热溶质对流和枝晶生长之间的完全耦合相互作用。该框架的新颖之处在于:(i)针对溶质、温度和固体分数场的同时演化定制GPU内核和内存布局,以及(ii)揭示直接决定上游/下游分支选择和最终微偏析模式的三维螺旋流模式。有针对性的优化,19个分布函数的晶格有序存储和重构的碰撞流模式,比CPU串行代码产生1058 × 的加速,并使Fe-0.6 wt% C合金凝固的网格解析模拟在几小时内而不是几周内实现。针对自然对流解决方案的基准验证(误差<; 0.9 %)和改进的Lipton-Glicksman-Kurz分析预测证实了定量准确性。结果表明:(1)枝晶生长驱动对流,优先加速上游臂,同时抑制下游臂;(2)生长方向和区域约束控制涡流拓扑和强度;(3)可以精确捕获复杂的螺旋流线模式和枝晶形式,从而全面了解流体流动和枝晶生长动力学,揭示2D模拟中未见的特征。这些发现为设计具有定向凝固组织的下一代合金提供了一个高通量平台。
{"title":"Efficient cellular automata-Lattice Boltzmann method for modeling solidification microstructure","authors":"Jingjing Wang ,&nbsp;Xiaoyu Liu ,&nbsp;Ruina Mao","doi":"10.1016/j.jocs.2025.102735","DOIUrl":"10.1016/j.jocs.2025.102735","url":null,"abstract":"<div><div>This paper introduces a 3D GPU-accelerated Cellular Automata-Lattice Boltzmann (CA-LB) Method that resolves the fully coupled interaction between thermosolutal convection and dendritic growth in a single three-dimensional simulation. The novelty of the proposed framework lies in (i) tailoring GPU kernels and memory layouts specifically for the simultaneous evolution of solute, temperature and solid fraction fields, and (ii) revealing three-dimensional helical flow patterns that directly dictate upstream/downstream branch selection and final micro-segregation patterns. Targeted optimizations, lattice-ordered storage of 19 distribution functions and a refactored collision-streaming pattern, yield a 1058 × speed-up over a CPU serial code and enable grid-resolved simulations of Fe–0.6 wt% C alloy solidification within hours instead of weeks. Benchmark validations against natural-convection solutions (error &lt; 0.9 %) and modified Lipton–Glicksman–Kurz analytical predictions confirm quantitative accuracy. The resulting physics highlights that (1) dendrite growth drives convection that preferentially accelerates upstream arms while suppressing downstream arms, (2) growth direction and domain confinement control vortex topology and intensity, and (3) complex helical streamline patterns and dendritic forms can be precisely captured, providing a comprehensive understanding of fluid flow and dendritic growth dynamics, revealing features unseen in 2D simulations. These findings offer an high-throughput platform for designing next-generation alloys with targeted solidification microstructures.</div></div>","PeriodicalId":48907,"journal":{"name":"Journal of Computational Science","volume":"93 ","pages":"Article 102735"},"PeriodicalIF":3.7,"publicationDate":"2025-10-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145371233","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
Optimal control applied to a dengue model incorporating symptomatic, asymptomatic, and severe cases with limited healthcare resources 最优控制应用于登革热模型,包括有症状、无症状和严重病例,医疗资源有限
IF 3.7 3区 计算机科学 Q2 COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS Pub Date : 2025-10-21 DOI: 10.1016/j.jocs.2025.102733
Salamida Daudi , Eva Lusekelo , Mlyashimbi Helikumi , Steady Mushayabasa
Dengue remains the most common arboviral disease globally, but the public health implications of different dengue clinical manifestations and the insufficiency of public health infrastructure are not well understood. Accounting for these factors provides valuable insights for the effective management of the disease. This study develops a novel mathematical model for dengue fever that incorporates various clinical manifestations, constraints imposed by limited medical resources, and preventive control strategies. We computed the basic reproduction number and examined its correlation with model parameters. Dynamical analysis revealed that the model exhibits a backward bifurcation. Using numerical techniques, we investigated the influence of varying control strategies, modeled as both time-dependent and non-time-dependent functions, on epidemic dynamics. In both scenarios, we identified threshold levels of intervention and the timelines required for disease extinction. These findings underscore the complexity of dengue dynamics and highlight the necessity of tailored intervention approaches for effective disease management.
登革热仍然是全球最常见的虫媒病毒性疾病,但不同登革热临床表现和公共卫生基础设施不足对公共卫生的影响尚未得到很好的了解。考虑到这些因素为有效地管理疾病提供了有价值的见解。本研究开发了一种新的登革热数学模型,该模型结合了各种临床表现、有限医疗资源所施加的限制和预防控制策略。我们计算了基本再现数,并检验了其与模型参数的相关性。动力学分析表明,该模型呈现后向分岔。使用数值技术,我们研究了不同控制策略对流行病动力学的影响,这些控制策略建模为时间相关和非时间相关函数。在这两种情况下,我们确定了干预的阈值水平和疾病灭绝所需的时间表。这些发现强调了登革热动态的复杂性,并强调了为有效的疾病管理量身定制干预方法的必要性。
{"title":"Optimal control applied to a dengue model incorporating symptomatic, asymptomatic, and severe cases with limited healthcare resources","authors":"Salamida Daudi ,&nbsp;Eva Lusekelo ,&nbsp;Mlyashimbi Helikumi ,&nbsp;Steady Mushayabasa","doi":"10.1016/j.jocs.2025.102733","DOIUrl":"10.1016/j.jocs.2025.102733","url":null,"abstract":"<div><div>Dengue remains the most common arboviral disease globally, but the public health implications of different dengue clinical manifestations and the insufficiency of public health infrastructure are not well understood. Accounting for these factors provides valuable insights for the effective management of the disease. This study develops a novel mathematical model for dengue fever that incorporates various clinical manifestations, constraints imposed by limited medical resources, and preventive control strategies. We computed the basic reproduction number and examined its correlation with model parameters. Dynamical analysis revealed that the model exhibits a backward bifurcation. Using numerical techniques, we investigated the influence of varying control strategies, modeled as both time-dependent and non-time-dependent functions, on epidemic dynamics. In both scenarios, we identified threshold levels of intervention and the timelines required for disease extinction. These findings underscore the complexity of dengue dynamics and highlight the necessity of tailored intervention approaches for effective disease management.</div></div>","PeriodicalId":48907,"journal":{"name":"Journal of Computational Science","volume":"92 ","pages":"Article 102733"},"PeriodicalIF":3.7,"publicationDate":"2025-10-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145361611","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
SDEGCN: Syntactic dependency enhanced and integrated graph convolutional network for aspect-based sentiment analysis 基于方面的情感分析的句法依赖增强和集成图卷积网络
IF 3.7 3区 计算机科学 Q2 COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS Pub Date : 2025-10-17 DOI: 10.1016/j.jocs.2025.102732
Bo He, Hongqian Zhang, Ruoyu Zhao
Aspect-based sentiment analysis (ABSA) aims to identify the sentiment polarity of specific aspects within a sentence. Existing graph convolutional network (GCN) approaches often suffer from insufficient modeling of dependency relations on specific aspects and the shallow integration of syntactic information. To address these issues, this paper proposes a syntactic dependency enhanced and integrated graph convolutional network (SDEGCN), which aims to effectively mine syntactic dependency relations and deeply integrate them into the model. Firstly, in the syntactic dependency enhancement layer, the dependency location-aware algorithm highlights the core syntactic roles of aspect terms and their relevant context, while the syntactic consistency constraint guide the syntactic graph convolutional network to learn more effective representations. Then, the semantic encoding layer calculates attention scores through self-attention mechanisms to optimize the adjacency matrix input of the graph convolutional network, thereby capturing semantically relevant features of sentences. Finally, the feature fusion layer employs a biaffine attention transformation mechanism to fuse syntactic and semantic features, and after pooling and concatenation aggregation, the classification is completed. Extensive experimental results on five benchmark datasets demonstrate that the SDEGCN significantly outperforms existing graph convolutional baseline models, proving its effectiveness in ABSA tasks.
基于方面的情感分析(ABSA)旨在识别句子中特定方面的情感极性。现有的图卷积网络(GCN)方法往往存在对特定方面的依赖关系建模不足和句法信息集成不深的问题。针对这些问题,本文提出了一种句法依赖增强集成图卷积网络(SDEGCN),旨在有效挖掘句法依赖关系并将其深度集成到模型中。首先,在句法依赖增强层,依赖位置感知算法突出了方面术语及其相关上下文的核心句法作用,而句法一致性约束引导句法图卷积网络学习更有效的表示。然后,语义编码层通过自注意机制计算注意分数,优化图卷积网络的邻接矩阵输入,从而捕获句子的语义相关特征。最后,特征融合层采用双仿注意力转换机制融合句法和语义特征,经池化、级联聚合后完成分类。在5个基准数据集上的大量实验结果表明,SDEGCN显著优于现有的图卷积基线模型,证明了其在ABSA任务中的有效性。
{"title":"SDEGCN: Syntactic dependency enhanced and integrated graph convolutional network for aspect-based sentiment analysis","authors":"Bo He,&nbsp;Hongqian Zhang,&nbsp;Ruoyu Zhao","doi":"10.1016/j.jocs.2025.102732","DOIUrl":"10.1016/j.jocs.2025.102732","url":null,"abstract":"<div><div>Aspect-based sentiment analysis (ABSA) aims to identify the sentiment polarity of specific aspects within a sentence. Existing graph convolutional network (GCN) approaches often suffer from insufficient modeling of dependency relations on specific aspects and the shallow integration of syntactic information. To address these issues, this paper proposes a syntactic dependency enhanced and integrated graph convolutional network (SDEGCN), which aims to effectively mine syntactic dependency relations and deeply integrate them into the model. Firstly, in the syntactic dependency enhancement layer, the dependency location-aware algorithm highlights the core syntactic roles of aspect terms and their relevant context, while the syntactic consistency constraint guide the syntactic graph convolutional network to learn more effective representations. Then, the semantic encoding layer calculates attention scores through self-attention mechanisms to optimize the adjacency matrix input of the graph convolutional network, thereby capturing semantically relevant features of sentences. Finally, the feature fusion layer employs a biaffine attention transformation mechanism to fuse syntactic and semantic features, and after pooling and concatenation aggregation, the classification is completed. Extensive experimental results on five benchmark datasets demonstrate that the SDEGCN significantly outperforms existing graph convolutional baseline models, proving its effectiveness in ABSA tasks.</div></div>","PeriodicalId":48907,"journal":{"name":"Journal of Computational Science","volume":"92 ","pages":"Article 102732"},"PeriodicalIF":3.7,"publicationDate":"2025-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145362164","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
Hybridized iterative scheme for solving non-linear collisional-breakage equation 求解非线性碰撞破碎方程的杂交迭代格式
IF 3.7 3区 计算机科学 Q2 COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS Pub Date : 2025-10-10 DOI: 10.1016/j.jocs.2025.102731
Shweta , Saddam Hussain , Rajesh Kumar
The non-linear collision induced fragmentation plays a crucial role in modeling several engineering and physical problems. In contrast to linear breakage, it has not been thoroughly investigated in the existing literature. This study introduces an innovative iterative method that leverages the Elzaki integral transform as a preparatory step to enhance the accuracy and convergence of adomian decomposition, used alongside the projected differential transform method to obtain closed-form or series approximations of solutions for the collisional breakage equation (CBE). A significant advantages of this technique is its capability to directly address both linear and nonlinear differential equations without the need for discretization or linearization. The mathematical framework is reinforced by a thorough convergence analysis, applying fixed point theory within an adequately defined Banach space. Additionally, error estimates for the approximated solutions are derived, offering more profound insights into the accuracy and dependability of the proposed method. The validity of this approach is demonstrated by comparing the obtained results with exact or finite volume approximated solutions considering several physical examples. Interestingly, the proposed algorithm yields accurate approximations for the number density functions as well as moments with fewer terms and maintains higher precision over extended time periods.
非线性碰撞破碎在许多工程和物理问题的建模中起着至关重要的作用。与线性断裂相反,它在现有文献中尚未得到彻底的研究。本研究引入了一种创新的迭代方法,利用Elzaki积分变换作为提高adomian分解精度和收敛性的准备步骤,与投影微分变换方法一起使用,以获得碰撞破碎方程(CBE)解的封闭形式或序列近似。该技术的一个显著优点是它能够直接处理线性和非线性微分方程,而不需要离散化或线性化。数学框架是通过一个彻底的收敛分析,应用不动点理论在一个充分定义的巴拿赫空间加强。此外,推导了近似解的误差估计,为所提出方法的准确性和可靠性提供了更深刻的见解。通过将所得结果与精确解或有限体积近似解进行比较,证明了该方法的有效性。有趣的是,所提出的算法产生精确的近似数密度函数和矩与更少的项,并保持较高的精度在延长的时间周期。
{"title":"Hybridized iterative scheme for solving non-linear collisional-breakage equation","authors":"Shweta ,&nbsp;Saddam Hussain ,&nbsp;Rajesh Kumar","doi":"10.1016/j.jocs.2025.102731","DOIUrl":"10.1016/j.jocs.2025.102731","url":null,"abstract":"<div><div>The non-linear collision induced fragmentation plays a crucial role in modeling several engineering and physical problems. In contrast to linear breakage, it has not been thoroughly investigated in the existing literature. This study introduces an innovative iterative method that leverages the Elzaki integral transform as a preparatory step to enhance the accuracy and convergence of adomian decomposition, used alongside the projected differential transform method to obtain closed-form or series approximations of solutions for the collisional breakage equation (CBE). A significant advantages of this technique is its capability to directly address both linear and nonlinear differential equations without the need for discretization or linearization. The mathematical framework is reinforced by a thorough convergence analysis, applying fixed point theory within an adequately defined Banach space. Additionally, error estimates for the approximated solutions are derived, offering more profound insights into the accuracy and dependability of the proposed method. The validity of this approach is demonstrated by comparing the obtained results with exact or finite volume approximated solutions considering several physical examples. Interestingly, the proposed algorithm yields accurate approximations for the number density functions as well as moments with fewer terms and maintains higher precision over extended time periods.</div></div>","PeriodicalId":48907,"journal":{"name":"Journal of Computational Science","volume":"92 ","pages":"Article 102731"},"PeriodicalIF":3.7,"publicationDate":"2025-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145320025","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
Glioma classification in MRI using a hybrid deep learning framework with majority vote ensemble 使用多数投票集合的混合深度学习框架在MRI中的胶质瘤分类
IF 3.7 3区 计算机科学 Q2 COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS Pub Date : 2025-10-10 DOI: 10.1016/j.jocs.2025.102729
Sonam Saluja , Munesh Chandra Trivedi
Glioma diagnosis remains a critical challenge, often plagued by subjectivity and inconsistent grading. This study explores the potential of deep learning to overcome these limitations, proposing a novel hybrid convolutional neural network (CNN) approach in classifying low-grade (LGG) and high-grade (HGG) tumors on T2-weighted magnetic resonance imaging (T2-W MRI) data. Five pre-trained convolutional neural networks (AlexNet, VGG-16, SqueezeNet, GoogLeNet, and ResNet-50) were fine-tuned and combined through ensemble methods: Majority Voting (MJ), Weighted Voting (WV), and Stacked Ensemble (SE). On the BraTS 2018 dataset, the ensembles demonstrated excellent performance, with the SE method achieving up to 99.35 % accuracy, 99.50 % sensitivity, 99.45 % specificity, and 99.40 % AUC. Testing on the external BraTS 2020 dataset showed strong generalization, with SE achieving 97.90 % accuracy, 98.05 % sensitivity, 97.80 % specificity, and 97.85 % AUC.The proposed ensemble techniques outperformed individual models and existing approaches, illustrating improved robustness and reliability. These findings establishes a foundation for subsequent research to explore diverse imaging sequences, segmented data analyses, and multi-institutional studies, thereby enhancing the scope and applicability of the findings in advancing automated grading systems and holding significant promise for real-world clinical use.
胶质瘤的诊断仍然是一个关键的挑战,往往困扰主观和不一致的分级。本研究探索了深度学习克服这些限制的潜力,提出了一种新的混合卷积神经网络(CNN)方法,用于在t2加权磁共振成像(T2-W MRI)数据上对低级别(LGG)和高级别(HGG)肿瘤进行分类。五个预训练的卷积神经网络(AlexNet, VGG-16, SqueezeNet, GoogLeNet和ResNet-50)通过集成方法进行微调和组合:多数投票(MJ),加权投票(WV)和堆叠集成(SE)。在BraTS 2018数据集上,集成系统表现出优异的性能,SE方法的准确率高达99.35 %,灵敏度为99.50 %,特异性为99.45 %,AUC为99.40 %。在外部BraTS 2020数据集上的测试显示出很强的泛化,SE达到97.90 %的准确率,98.05 %的灵敏度,97.80 %的特异性和97.85 %的AUC。所提出的集成技术优于单个模型和现有方法,说明了改进的鲁棒性和可靠性。这些发现为后续研究探索不同的成像序列、分段数据分析和多机构研究奠定了基础,从而增强了研究结果在推进自动分级系统方面的范围和适用性,并为现实世界的临床应用带来了重大希望。
{"title":"Glioma classification in MRI using a hybrid deep learning framework with majority vote ensemble","authors":"Sonam Saluja ,&nbsp;Munesh Chandra Trivedi","doi":"10.1016/j.jocs.2025.102729","DOIUrl":"10.1016/j.jocs.2025.102729","url":null,"abstract":"<div><div>Glioma diagnosis remains a critical challenge, often plagued by subjectivity and inconsistent grading. This study explores the potential of deep learning to overcome these limitations, proposing a novel hybrid convolutional neural network (CNN) approach in classifying low-grade (LGG) and high-grade (HGG) tumors on T2-weighted magnetic resonance imaging (T2-W MRI) data. Five pre-trained convolutional neural networks (AlexNet, VGG-16, SqueezeNet, GoogLeNet, and ResNet-50) were fine-tuned and combined through ensemble methods: Majority Voting (MJ), Weighted Voting (WV), and Stacked Ensemble (SE). On the BraTS 2018 dataset, the ensembles demonstrated excellent performance, with the SE method achieving up to 99.35 % accuracy, 99.50 % sensitivity, 99.45 % specificity, and 99.40 % AUC. Testing on the external BraTS 2020 dataset showed strong generalization, with SE achieving 97.90 % accuracy, 98.05 % sensitivity, 97.80 % specificity, and 97.85 % AUC.The proposed ensemble techniques outperformed individual models and existing approaches, illustrating improved robustness and reliability. These findings establishes a foundation for subsequent research to explore diverse imaging sequences, segmented data analyses, and multi-institutional studies, thereby enhancing the scope and applicability of the findings in advancing automated grading systems and holding significant promise for real-world clinical use.</div></div>","PeriodicalId":48907,"journal":{"name":"Journal of Computational Science","volume":"92 ","pages":"Article 102729"},"PeriodicalIF":3.7,"publicationDate":"2025-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145320020","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-level synthesis acceleration for an FPGA implementation of an optimized automatic target detection and classification algorithm for hyperspectral image analysis with Intel oneAPI 基于Intel oneAPI的高光谱图像分析优化自动目标检测和分类算法的FPGA实现高级综合加速
IF 3.7 3区 计算机科学 Q2 COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS Pub Date : 2025-10-10 DOI: 10.1016/j.jocs.2025.102723
R. Macias, S. Bernabé, C. González
For many years, hyperspectral images have been one of the most well-established technologies in remote sensing. The main difficulty in hyperspectral image analysis lies in the spectral mixing of materials within a single pixel, which hinders the identification of pure components or endmembers. This task is essential for various Earth observation applications, such as agriculture, mining, and environmental management. From the whole process, the endmember identification or target detection is usually one of the most time-consuming stages, so high-performance computing (HPC) platforms such as multicore processors, graphics processing units (GPUs) or field-programmable gate arrays (FPGAs) are necessary and essential for its exploitation in time-critical scenarios. In this article, we present a high-level synthesis (HLS) acceleration for an FPGA implementation of the automatic target detection and classification algorithm (ATDCA) using the Gram–Schmidt (GS) method for hyperspectral images with the Intel oneAPI Toolkit and DPC++ instead of traditional hardware description languages (HDL). Optimization strategies were applied in terms of parallelism and efficiency in the use of hardware resources on a Stratix 10 SX 2800 FPGA, resulting in a significant performance improvement. Experimental results showed that the optimized implementation through HLS achieved a significant reduction in processing times, demonstrating that the use of optimization techniques for FPGA platforms, combined with the DPC++ environment, provides an effective and flexible solution for spectral unmixing of hyperspectral images.
多年来,高光谱图像一直是遥感领域最成熟的技术之一。高光谱图像分析的主要困难在于单个像元内材料的光谱混合,这阻碍了纯组分或端元的识别。这项任务对于农业、采矿和环境管理等各种地球观测应用至关重要。从整个过程来看,端元识别或目标检测通常是最耗时的阶段之一,因此高性能计算(HPC)平台,如多核处理器、图形处理单元(gpu)或现场可编程门阵列(fpga)对于在时间关键场景中利用它是必要的和必不可少的。在本文中,我们提出了一种高级合成(HLS)加速,用于FPGA实现自动目标检测和分类算法(ATDCA),使用Intel oneAPI工具包和dpc++代替传统的硬件描述语言(HDL),使用高光谱图像的Gram-Schmidt (GS)方法。在Stratix 10 SX 2800 FPGA上应用了并行性和硬件资源使用效率方面的优化策略,从而显著提高了性能。实验结果表明,HLS优化实现显著减少了处理时间,表明基于FPGA平台的优化技术与dpc++环境相结合,为高光谱图像的光谱解混提供了一种有效、灵活的解决方案。
{"title":"High-level synthesis acceleration for an FPGA implementation of an optimized automatic target detection and classification algorithm for hyperspectral image analysis with Intel oneAPI","authors":"R. Macias,&nbsp;S. Bernabé,&nbsp;C. González","doi":"10.1016/j.jocs.2025.102723","DOIUrl":"10.1016/j.jocs.2025.102723","url":null,"abstract":"<div><div>For many years, hyperspectral images have been one of the most well-established technologies in remote sensing. The main difficulty in hyperspectral image analysis lies in the spectral mixing of materials within a single pixel, which hinders the identification of pure components or endmembers. This task is essential for various Earth observation applications, such as agriculture, mining, and environmental management. From the whole process, the endmember identification or target detection is usually one of the most time-consuming stages, so high-performance computing (HPC) platforms such as multicore processors, graphics processing units (GPUs) or field-programmable gate arrays (FPGAs) are necessary and essential for its exploitation in time-critical scenarios. In this article, we present a high-level synthesis (HLS) acceleration for an FPGA implementation of the automatic target detection and classification algorithm (ATDCA) using the Gram–Schmidt (GS) method for hyperspectral images with the Intel oneAPI Toolkit and DPC++ instead of traditional hardware description languages (HDL). Optimization strategies were applied in terms of parallelism and efficiency in the use of hardware resources on a Stratix 10 SX 2800 FPGA, resulting in a significant performance improvement. Experimental results showed that the optimized implementation through HLS achieved a significant reduction in processing times, demonstrating that the use of optimization techniques for FPGA platforms, combined with the DPC++ environment, provides an effective and flexible solution for spectral unmixing of hyperspectral images.</div></div>","PeriodicalId":48907,"journal":{"name":"Journal of Computational Science","volume":"92 ","pages":"Article 102723"},"PeriodicalIF":3.7,"publicationDate":"2025-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145320024","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
Wave phenomena in a wavelength-specific reflector for the Kundu–Mukherjee–Naskar system in optics and photonics 光学与光子学中Kundu-Mukherjee-Naskar系统波长反射器中的波现象
IF 3.7 3区 计算机科学 Q2 COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS Pub Date : 2025-10-09 DOI: 10.1016/j.jocs.2025.102725
Ozlem Kirci , Yusuf Pandir
In this research, the coupled variation of the (2+1)-dimensional Kundu–Mukherjee–Naskar (KMN) equation, which governs the wave dynamics in fiber Bragg grating (FBG), is analyzed. This version models the interaction between two nonlinear waves, while the single mode of this equation characterizes nonlinear wave propagation in a single channel or medium where only one wave is considered. To find analytical solutions, the new version trial equation method (NVTEM) is regarded due to its wide range of solution structures. Analytic wave solutions are not just mathematical constructs but also help reveal the underlying physical mechanisms. Motivated by this, the present work derives and analyzes a variety of exact wave solutions to the coupled KMN equation, such as rogue-like soliton, double-peaked bound state, high-order rogue waves, and bright-lump solution supported by symbolic computation to ensure their validity. The KMN system is first converted to a nonlinear ordinary differential equation (NLODE) via the complex wave transform. Applying the proposed technique, rational, exponential, hyperbolic, and Jacobi elliptic type solutions have been acquired. The two and three-dimensional plots have been utilized to depict the dynamics of our constructed findings and to establish the abundance of the proposed analytical technique as well. Besides, some physical implications may be mentioned through interesting aspects in our findings.
本文分析了控制光纤布拉格光栅(FBG)中波动动力学的(2+1)维Kundu-Mukherjee-Naskar (KMN)方程的耦合变化。这个版本模拟了两个非线性波之间的相互作用,而这个方程的单模态表征了非线性波在单通道或介质中的传播,其中只考虑了一个波。求解解析解的新版本试方程法(NVTEM)因其解结构范围广而受到重视。解析波解不仅是数学结构,而且有助于揭示潜在的物理机制。在此基础上,本文推导并分析了耦合KMN方程的各种精确波解,如类流氓孤子、双峰束缚态、高阶流氓波和符号计算支持的亮块解等,以确保其有效性。首先通过复波变换将KMN系统转化为非线性常微分方程(NLODE)。应用该方法,已获得了有理型、指数型、双曲型和雅可比椭圆型解。二维和三维图被用来描述我们构建的发现的动态,并建立了所提出的分析技术的丰富性。此外,在我们的研究结果中,一些有趣的方面可能会提到一些物理意义。
{"title":"Wave phenomena in a wavelength-specific reflector for the Kundu–Mukherjee–Naskar system in optics and photonics","authors":"Ozlem Kirci ,&nbsp;Yusuf Pandir","doi":"10.1016/j.jocs.2025.102725","DOIUrl":"10.1016/j.jocs.2025.102725","url":null,"abstract":"<div><div>In this research, the coupled variation of the (2+1)-dimensional Kundu–Mukherjee–Naskar (KMN) equation, which governs the wave dynamics in fiber Bragg grating (FBG), is analyzed. This version models the interaction between two nonlinear waves, while the single mode of this equation characterizes nonlinear wave propagation in a single channel or medium where only one wave is considered. To find analytical solutions, the new version trial equation method (NVTEM) is regarded due to its wide range of solution structures. Analytic wave solutions are not just mathematical constructs but also help reveal the underlying physical mechanisms. Motivated by this, the present work derives and analyzes a variety of exact wave solutions to the coupled KMN equation, such as rogue-like soliton, double-peaked bound state, high-order rogue waves, and bright-lump solution supported by symbolic computation to ensure their validity. The KMN system is first converted to a nonlinear ordinary differential equation (NLODE) via the complex wave transform. Applying the proposed technique, rational, exponential, hyperbolic, and Jacobi elliptic type solutions have been acquired. The two and three-dimensional plots have been utilized to depict the dynamics of our constructed findings and to establish the abundance of the proposed analytical technique as well. Besides, some physical implications may be mentioned through interesting aspects in our findings.</div></div>","PeriodicalId":48907,"journal":{"name":"Journal of Computational Science","volume":"92 ","pages":"Article 102725"},"PeriodicalIF":3.7,"publicationDate":"2025-10-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145265401","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学术文献互助群
群 号:604180095
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1