Journal of Computational Science最新文献_第3页

Enhancing urban solar photovoltaic system performance evaluation through a disc spherical fuzzy aggregation framework 通过圆盘球形模糊聚合框架增强城市太阳能光伏系统性能评价

IF 3.7 3区计算机科学 Q2 COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS

Journal of Computational Science

Pub Date : 2025-11-26 DOI: 10.1016/j.jocs.2025.102758

Shahzaib Ashraf , Muhammad Shakir Chohan , Wania Iqbal , Vladimir Simic , Dragan Pamucar , Nebojsa Bacanin

The integration of solar photovoltaic (PV) systems in urban environments promises great potential for sustainable energy applications. However, the unique characteristics of cities, the varieties of weather that occur at the place, and technology inefficiency make performance evaluation difficult. This paper sought to address the pressing need for a robust performance evaluation framework for urban solar PV systems by developing a disc spherical fuzzy aggregation framework. It develops basic algebraic aggregation operations in the framework of the disc spherical fuzzy set (D-SFSs), proving their completeness and describing their essential characteristics. These new operators conceived to operate on D-SFSs furnish theoretical robustness and provide the foundation for decisions made. A shining novel disc spherical fuzzy method is developed namely combinative distance-based assessment (CODAS) in D-SFS. A case study regarding the application of this model in the assessment of performance by urban solar PV systems is being conducted, thus proving the application aspect. Results come out positive in interpreting the decision-making dilemma and differences among several experts. This would, therefore, encourage various sectors to expand the use of D-SFSs in decision support systems and similar areas by showing how useful they can be in actual situations.

太阳能光伏系统在城市环境中的整合为可持续能源应用提供了巨大的潜力。然而，城市的独特特征、当地天气的变化以及技术的低效使得绩效评估变得困难。本文试图通过开发一个圆盘球形模糊聚合框架来解决对城市太阳能光伏系统性能评估框架的迫切需求。在圆盘球形模糊集（D-SFSs）的框架中发展了基本的代数聚集运算，证明了它们的完备性并描述了它们的本质特征。这些设想在d - sss上操作的新算子提供了理论上的鲁棒性，并为决策提供了基础。在D-SFS中，提出了一种新颖的圆盘球面模糊评价方法——基于距离的组合评价方法（CODAS）。目前正在对该模型在城市太阳能光伏系统性能评价中的应用进行案例研究，验证了该模型的应用前景。结果在解释决策困境和几位专家之间的差异方面是积极的。因此，这将鼓励各部门在决策支持系统和类似领域扩大使用D-SFSs，显示它们在实际情况中如何有用。

{"title":"Enhancing urban solar photovoltaic system performance evaluation through a disc spherical fuzzy aggregation framework","authors":"Shahzaib Ashraf , Muhammad Shakir Chohan , Wania Iqbal , Vladimir Simic , Dragan Pamucar , Nebojsa Bacanin","doi":"10.1016/j.jocs.2025.102758","DOIUrl":"10.1016/j.jocs.2025.102758","url":null,"abstract":"<div><div>The integration of solar photovoltaic (PV) systems in urban environments promises great potential for sustainable energy applications. However, the unique characteristics of cities, the varieties of weather that occur at the place, and technology inefficiency make performance evaluation difficult. This paper sought to address the pressing need for a robust performance evaluation framework for urban solar PV systems by developing a disc spherical fuzzy aggregation framework. It develops basic algebraic aggregation operations in the framework of the disc spherical fuzzy set (D-SFSs), proving their completeness and describing their essential characteristics. These new operators conceived to operate on D-SFSs furnish theoretical robustness and provide the foundation for decisions made. A shining novel disc spherical fuzzy method is developed namely combinative distance-based assessment (CODAS) in D-SFS. A case study regarding the application of this model in the assessment of performance by urban solar PV systems is being conducted, thus proving the application aspect. Results come out positive in interpreting the decision-making dilemma and differences among several experts. This would, therefore, encourage various sectors to expand the use of D-SFSs in decision support systems and similar areas by showing how useful they can be in actual situations.</div></div>","PeriodicalId":48907,"journal":{"name":"Journal of Computational Science","volume":"93 ","pages":"Article 102758"},"PeriodicalIF":3.7,"publicationDate":"2025-11-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145623518","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

Exploring network-level indicators for project analysis — A comparison of real and synthetic projects 探索项目分析的网络级指标——真实项目和综合项目的比较

IF 3.7 3区计算机科学 Q2 COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS

Journal of Computational Science

Pub Date : 2025-11-26 DOI: 10.1016/j.jocs.2025.102745

Zsolt T. Kosztyán

This study introduces a novel perspective on project network analysis by incorporating network theory and graph analysis to identify network-level indicators for activity-on-node project networks. A key contribution lies in the comparison between real and synthetic projects on the basis of project and network-level indicators, revealing distinct variations. The findings underscore that real projects demonstrate lower flexibility and efficiency than synthetic counterparts, impacting project scheduling and resource allocation. Moreover, the study suggests employing supervised and unsupervised learning classification methods to categorize projects on the basis of indicator values, enhancing project selection and prioritization processes. By bridging the gap between network-level indicators and project aspects, this research enriches the literature by offering fresh insights and resources for project managers to optimize project network structure and performance.

本研究将网络理论与图分析相结合，引入项目网络分析的新视角，以确定节点上活动项目网络的网络级指标。一个关键的贡献是在项目和网络一级指标的基础上比较了实际项目和综合项目，揭示了明显的差异。研究结果强调，真实项目的灵活性和效率低于合成项目，影响了项目的进度和资源分配。此外，研究建议采用监督学习和无监督学习分类方法，根据指标值对项目进行分类，加强项目选择和优先排序过程。通过弥合网络级指标与项目方面之间的差距，本研究丰富了文献，为项目经理优化项目网络结构和绩效提供了新的见解和资源。

引用次数: 0

Two improved physics-informed Neural Networks for solving Burgers equation 两个改进的物理信息神经网络求解汉堡方程

IF 3.7 3区计算机科学 Q2 COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS

Journal of Computational Science

Pub Date : 2025-11-24 DOI: 10.1016/j.jocs.2025.102756

Zeyue Zhang , Chunlei Ruan , Zhijun Liu

Burgers equation, a simplified mathematical model for the Navier–Stokes equation, is often discussed in Computational Fluid Dynamics (CFD). The Burgers equation is a nonlinear convection–diffusion equation in mathematics, its hyperbolic characteristic challenges the numerical methods. Previous studies with the Physics-Informed Neural Networks (PINNs) on Burgers equation have focused on the relatively high viscosity. In that case, the hyperbolicity of Burgers equation is weak and convergent solutions can be obtained. In this study, we attempt to solve Burgers equation with vanishingly small viscosity and with no viscosity. To obtain the convergent and accurate solutions, we present two improved PINNs, one is the PINNs with time segmentation and the other is PINNs with the Weighted Essential Non-oscillatory (WENO) indicator. The former one is to divide the entire time domain into multiple continuous time periods and to iterate training in each time period. The latter is proposed to deal with the discontinuity. The WENO indicator is used to find the non-smooth region in which more training points should be added. Two numerical examples, including one-dimensional Burgers equation with vanishingly small viscosity with Dirichlet boundary conditions and one-dimensional non-viscous Burgers equation with Dirichlet boundary conditions, are carried out. By comparing with the results obtained by the 5th order WENO-Z method and the other three PINNs methods, the validity and high accuracy of the improved PINNs are proved.

Burgers方程是Navier-Stokes方程的简化数学模型，是计算流体动力学（CFD）中经常讨论的问题。Burgers方程是数学中的非线性对流扩散方程，其双曲性对数值方法提出了挑战。先前使用物理信息神经网络（pinn）对Burgers方程的研究主要集中在相对较高的粘度上。在这种情况下，Burgers方程的双曲性是弱的，可以得到收敛解。在本研究中，我们尝试求解具有极小黏度和无黏度的Burgers方程。为了得到收敛且精确的解，我们提出了两种改进的pin - ns，一种是带时间分割的pin - ns，另一种是带加权基本非振荡（WENO）指标的pin - ns。前一种方法是将整个时域划分为多个连续时间段，在每个时间段内迭代训练。后者是为了处理不连续性而提出的。WENO指标用于寻找需要增加更多训练点的非光滑区域。给出了具有Dirichlet边界条件的一维粘性消失的Burgers方程和具有Dirichlet边界条件的一维非粘性Burgers方程两个数值算例。通过与5阶WENO-Z方法和其他3种pinn方法的结果比较，证明了改进的pinn方法的有效性和较高的精度。

{"title":"Two improved physics-informed Neural Networks for solving Burgers equation","authors":"Zeyue Zhang , Chunlei Ruan , Zhijun Liu","doi":"10.1016/j.jocs.2025.102756","DOIUrl":"10.1016/j.jocs.2025.102756","url":null,"abstract":"<div><div>Burgers equation, a simplified mathematical model for the Navier–Stokes equation, is often discussed in Computational Fluid Dynamics (CFD). The Burgers equation is a nonlinear convection–diffusion equation in mathematics, its hyperbolic characteristic challenges the numerical methods. Previous studies with the Physics-Informed Neural Networks (PINNs) on Burgers equation have focused on the relatively high viscosity. In that case, the hyperbolicity of Burgers equation is weak and convergent solutions can be obtained. In this study, we attempt to solve Burgers equation with vanishingly small viscosity and with no viscosity. To obtain the convergent and accurate solutions, we present two improved PINNs, one is the PINNs with time segmentation and the other is PINNs with the Weighted Essential Non-oscillatory (WENO) indicator. The former one is to divide the entire time domain into multiple continuous time periods and to iterate training in each time period. The latter is proposed to deal with the discontinuity. The WENO indicator is used to find the non-smooth region in which more training points should be added. Two numerical examples, including one-dimensional Burgers equation with vanishingly small viscosity with Dirichlet boundary conditions and one-dimensional non-viscous Burgers equation with Dirichlet boundary conditions, are carried out. By comparing with the results obtained by the 5th order WENO-Z method and the other three PINNs methods, the validity and high accuracy of the improved PINNs are proved.</div></div>","PeriodicalId":48907,"journal":{"name":"Journal of Computational Science","volume":"93 ","pages":"Article 102756"},"PeriodicalIF":3.7,"publicationDate":"2025-11-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145623520","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

Computational modeling of incompressible two-phase fluid dynamics via the conservative Allen–Cahn framework on a virtual cube 虚拟立方体上不可压缩两相流体动力学的保守Allen-Cahn框架计算模型

IF 3.7 3区计算机科学 Q2 COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS

Journal of Computational Science

Pub Date : 2025-11-24 DOI: 10.1016/j.jocs.2025.102755

Ahmed Zeeshan , Juho Ma , Zhengang Li , Xinpei Wu , Junseok Kim

We present a robust computational algorithm for the simulation of incompressible two-phase fluid flows on a virtual cubic surface, i.e., the models of incorporating the conservative Allen–Cahn (CAC) equation into the Navier–Stokes (NS) equation. By using a phase-field approach, the proposed method effectively captures the evolution of complex interfaces among distinct fluid phases instead of explicit interface tracking. The projection method is combined with the finite difference method (FDM) to solve the governing equations in an efficient manner. In addition, a multigrid solver is adopted to handle the pressure Poisson equation, which improves computational accuracy and reduces computational cost. The virtual cubic surface is modeled as a two-dimensional unfolded domain to facilitate straightforward discretization while preserving geometric fidelity. Numerical experiments, including benchmark shear flow and vortex dynamics on the cubic surface, back up the efficacy of the method in handling two-phase flows. The computational results validate that the proposed scheme has significant potential to advance the simulation of multiphase incompressible flows on curved or complex surfaces. This approach provides an effective numerical method applicable to various scientific and engineering problems.

本文提出了一种鲁棒的模拟虚拟立方表面上不可压缩两相流体流动的计算算法，即将保守的Allen-Cahn （CAC）方程与Navier-Stokes （NS）方程相结合的模型。该方法采用相场方法，可以有效地捕捉不同流体相之间复杂界面的演化，而不是显式的界面跟踪。将投影法与有限差分法相结合，有效地求解了控制方程。此外，采用多网格求解器处理压力泊松方程，提高了计算精度，降低了计算成本。虚拟立方体表面建模为二维展开域，以方便直接离散，同时保持几何保真度。数值实验，包括基准剪切流和立方表面上的涡动力学，验证了该方法处理两相流的有效性。计算结果表明，该方法对复杂曲面上多相不可压缩流动的模拟具有重要的推动作用。该方法提供了一种适用于各种科学和工程问题的有效数值方法。

{"title":"Computational modeling of incompressible two-phase fluid dynamics via the conservative Allen–Cahn framework on a virtual cube","authors":"Ahmed Zeeshan , Juho Ma , Zhengang Li , Xinpei Wu , Junseok Kim","doi":"10.1016/j.jocs.2025.102755","DOIUrl":"10.1016/j.jocs.2025.102755","url":null,"abstract":"<div><div>We present a robust computational algorithm for the simulation of incompressible two-phase fluid flows on a virtual cubic surface, i.e., the models of incorporating the conservative Allen–Cahn (CAC) equation into the Navier–Stokes (NS) equation. By using a phase-field approach, the proposed method effectively captures the evolution of complex interfaces among distinct fluid phases instead of explicit interface tracking. The projection method is combined with the finite difference method (FDM) to solve the governing equations in an efficient manner. In addition, a multigrid solver is adopted to handle the pressure Poisson equation, which improves computational accuracy and reduces computational cost. The virtual cubic surface is modeled as a two-dimensional unfolded domain to facilitate straightforward discretization while preserving geometric fidelity. Numerical experiments, including benchmark shear flow and vortex dynamics on the cubic surface, back up the efficacy of the method in handling two-phase flows. The computational results validate that the proposed scheme has significant potential to advance the simulation of multiphase incompressible flows on curved or complex surfaces. This approach provides an effective numerical method applicable to various scientific and engineering problems.</div></div>","PeriodicalId":48907,"journal":{"name":"Journal of Computational Science","volume":"93 ","pages":"Article 102755"},"PeriodicalIF":3.7,"publicationDate":"2025-11-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145693905","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

Safe merging aircraft flows in multi-route schemes 多航路方案下的安全合流

IF 3.7 3区计算机科学 Q2 COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS

Journal of Computational Science

Pub Date : 2025-11-13 DOI: 10.1016/j.jocs.2025.102741

Arseniy A. Spiridonov

The paper considers the problem of creating a conflict-free schedule of aircraft arrivals at checkpoints of an air route scheme for several incoming aircraft flows in the case of multi-stage multi-route merging. Here, “multi-stage” means that an aircraft may sequentially pass several points of merging with other aircraft flows. “Multi-route” means that an aircraft may have several routes leading it from the entry point of its flow to the final point of the scheme. The assumptions adopted in the problem allow a consideration of realistic air route schemes. The main result of the paper is a methodology for constructing a description of the problem in the framework of mixed integer linear programming. The case of several runways is not included, but the model can be extended to cover this case. Models obtained by the suggested approach are computed numerically by means of the optimization library Gurobi. The simulation results and performance of the computational procedure for Koltsovo airport are presented.

本文研究了在多阶段多航路合并的情况下，针对多个进港航路的航路方案，建立无冲突的飞机到达检查点时间表的问题。在这里，“多级”是指一架飞机可能依次通过与其他飞机流合并的几个点。“多航线”是指一架飞机可能有多条航线将其从流的入口点引导到方案的最终点。问题中采用的假设允许考虑实际的航路方案。本文的主要成果是一种在混合整数线性规划框架下构造问题描述的方法。几个跑道的情况不包括在内，但该模型可以扩展到涵盖这种情况。利用优化库Gurobi对该方法得到的模型进行了数值计算。给出了Koltsovo机场的仿真结果和计算过程的性能。

引用次数: 0

ELM-UNet: An efficient and lightweight Vision Mamba UNet for skin lesion segmentation ELM-UNet：用于皮肤病变分割的高效轻量级视觉曼巴UNet

IF 3.7 3区计算机科学 Q2 COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS

Journal of Computational Science

Pub Date : 2025-11-11 DOI: 10.1016/j.jocs.2025.102743

Songling Xia , Hongwei Deng , Feng Chen

Skin lesion segmentation plays a critical role in the early detection and treatment of skin cancer. Although models based on CNNs and Transformers have achieved notable progress in image segmentation, they still exhibit some limitations. Specifically, CNNs struggle with capturing long-range dependencies effectively, while Transformers suffer from high computational costs due to the self-attention mechanism. Recently, Mamba as a representative State Space Models (SSMs), has drawn attention for its ability to efficiently model long-range dependencies with lower computational overhead. To address these challenges, we propose ELM-UNet, an efficient and lightweight skin lesion segmentation method based on the Mamba architecture. We introduce the LKA-MLP Synergy Module (LMSM), which significantly enhances the model’s ability to capture fine details and handle complex regions in skin lesion images, thus improving segmentation precision. Additionally, we present the SSM-Conv Fusion Module (SSM-CFM), which effectively combines the strengths of SSM in modeling long-range dependencies and convolution operation in local feature extraction, further boosting lesion feature representation. The experimental results show that compared to UltraLight VM-UNet, on the ISIC2017 dataset, ELM-UNet achieves improvements of 2.04%, 1.21%, and 1.61% in mIoU, DSC, and Sen, respectively. On the ISIC2018 dataset, it achieves improvements of 1.81%, 1.10%, and 2.36% in mIoU, DSC, and Sen, respectively.

皮肤病灶分割在皮肤癌的早期发现和治疗中起着至关重要的作用。尽管基于cnn和Transformers的模型在图像分割方面取得了显著的进展，但它们仍然存在一定的局限性。具体来说，cnn很难有效地捕获远程依赖关系，而变形金刚由于自关注机制而遭受高计算成本的困扰。最近，Mamba作为一种代表性的状态空间模型（ssm），因其能够以较低的计算开销高效地建模远程依赖关系而引起了人们的关注。为了解决这些问题，我们提出了一种基于Mamba结构的高效、轻量级的皮肤损伤分割方法ELM-UNet。我们引入了LKA-MLP协同模块（LMSM），显著增强了模型对皮肤病变图像中精细细节的捕捉能力和对复杂区域的处理能力，从而提高了分割精度。此外，我们提出了SSM- conv融合模块（SSM- cfm），该模块有效地结合了SSM在远程依赖关系建模方面的优势和卷积运算在局部特征提取方面的优势，进一步增强了病灶特征的表征。实验结果表明，与UltraLight VM-UNet相比，在ISIC2017数据集上，ELM-UNet在mIoU、DSC和Sen上分别提高了2.04%、1.21%和1.61%。在ISIC2018数据集上，mIoU、DSC和Sen分别提高了1.81%、1.10%和2.36%。

{"title":"ELM-UNet: An efficient and lightweight Vision Mamba UNet for skin lesion segmentation","authors":"Songling Xia , Hongwei Deng , Feng Chen","doi":"10.1016/j.jocs.2025.102743","DOIUrl":"10.1016/j.jocs.2025.102743","url":null,"abstract":"<div><div>Skin lesion segmentation plays a critical role in the early detection and treatment of skin cancer. Although models based on CNNs and Transformers have achieved notable progress in image segmentation, they still exhibit some limitations. Specifically, CNNs struggle with capturing long-range dependencies effectively, while Transformers suffer from high computational costs due to the self-attention mechanism. Recently, Mamba as a representative State Space Models (SSMs), has drawn attention for its ability to efficiently model long-range dependencies with lower computational overhead. To address these challenges, we propose ELM-UNet, an efficient and lightweight skin lesion segmentation method based on the Mamba architecture. We introduce the LKA-MLP Synergy Module (LMSM), which significantly enhances the model’s ability to capture fine details and handle complex regions in skin lesion images, thus improving segmentation precision. Additionally, we present the SSM-Conv Fusion Module (SSM-CFM), which effectively combines the strengths of SSM in modeling long-range dependencies and convolution operation in local feature extraction, further boosting lesion feature representation. The experimental results show that compared to UltraLight VM-UNet, on the ISIC2017 dataset, ELM-UNet achieves improvements of 2.04%, 1.21%, and 1.61% in mIoU, DSC, and Sen, respectively. On the ISIC2018 dataset, it achieves improvements of 1.81%, 1.10%, and 2.36% in mIoU, DSC, and Sen, respectively.</div></div>","PeriodicalId":48907,"journal":{"name":"Journal of Computational Science","volume":"93 ","pages":"Article 102743"},"PeriodicalIF":3.7,"publicationDate":"2025-11-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145529200","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

Thought Management System for long-horizon, goal-driven LLM agents 思想管理系统的长远眼光，目标驱动的法学硕士代理人

IF 3.7 3区计算机科学 Q2 COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS

Journal of Computational Science

Pub Date : 2025-11-06 DOI: 10.1016/j.jocs.2025.102740

Andrii Bidochko , Yaroslav Vyklyuk

The “Thoughts Management System” (TMS) is a novel framework that enables autonomous AI Agents to execute long-horizon tasks, inspired by the human mind’s ability to manage 60,000 thoughts per day. TMS empowers agents to dynamically prioritize goals, decompose complex objectives into actionable tasks, and adapt strategies over extended periods. TMS introduces a hierarchical goal decomposition mechanism for breaking down high-level tasks, combined with self-critique modules that iteratively evaluate progress and refine decision-making. By integrating reinforcement learning reward mechanisms, agents focus on high-value tasks while eliminating irrelevant ones, ensuring efficiency and goal alignment.

Built on our prior work, “LLMAgentNet: A Collaborative Network of Autonomous AI Agents,” TMS uses a multi-agent system (MAS) where specialized agents collaborate to achieve shared goals. Techniques like Monte Carlo Tree Search (MCTS) balance exploration and exploitation for optimal performance in dynamic environments. By mimicking human thought management, TMS enables AI Agents to sustain focus, adapt dynamically, and self-improve over time. This framework marks a significant advancement toward autonomous AI systems capable of solving real-world, long-term challenges across domains such as marketing, scientific discovery, and infrastructure management.

“思想管理系统”（TMS）是一个新颖的框架，它使自主的人工智能代理能够执行长期任务，其灵感来自人类大脑每天管理6万个想法的能力。TMS使代理能够动态地确定目标的优先级，将复杂的目标分解为可操作的任务，并在较长时间内调整策略。TMS引入了一种分层目标分解机制，用于分解高级任务，并结合了自我批评模块，迭代地评估进度并改进决策。通过整合强化学习奖励机制，智能体专注于高价值任务，同时消除无关任务，确保效率和目标一致性。在我们之前的工作“LLMAgentNet：一个自主人工智能代理的协作网络”的基础上，TMS使用了一个多代理系统（MAS），在这个系统中，专门的代理协作来实现共同的目标。像蒙特卡罗树搜索（MCTS）这样的技术平衡了探索和开发在动态环境中的最佳性能。通过模仿人类的思维管理，颅磁刺激使人工智能代理能够保持专注，动态适应，并随着时间的推移自我改进。该框架标志着自主人工智能系统的重大进步，该系统能够解决市场营销、科学发现和基础设施管理等领域的长期挑战。

{"title":"Thought Management System for long-horizon, goal-driven LLM agents","authors":"Andrii Bidochko , Yaroslav Vyklyuk","doi":"10.1016/j.jocs.2025.102740","DOIUrl":"10.1016/j.jocs.2025.102740","url":null,"abstract":"<div><div>The “Thoughts Management System” (TMS) is a novel framework that enables autonomous AI Agents to execute long-horizon tasks, inspired by the human mind’s ability to manage 60,000 thoughts per day. TMS empowers agents to dynamically prioritize goals, decompose complex objectives into actionable tasks, and adapt strategies over extended periods. TMS introduces a hierarchical goal decomposition mechanism for breaking down high-level tasks, combined with self-critique modules that iteratively evaluate progress and refine decision-making. By integrating reinforcement learning reward mechanisms, agents focus on high-value tasks while eliminating irrelevant ones, ensuring efficiency and goal alignment.</div><div>Built on our prior work, “LLMAgentNet: A Collaborative Network of Autonomous AI Agents,” TMS uses a multi-agent system (MAS) where specialized agents collaborate to achieve shared goals. Techniques like Monte Carlo Tree Search (MCTS) balance exploration and exploitation for optimal performance in dynamic environments. By mimicking human thought management, TMS enables AI Agents to sustain focus, adapt dynamically, and self-improve over time. This framework marks a significant advancement toward autonomous AI systems capable of solving real-world, long-term challenges across domains such as marketing, scientific discovery, and infrastructure management.</div></div>","PeriodicalId":48907,"journal":{"name":"Journal of Computational Science","volume":"93 ","pages":"Article 102740"},"PeriodicalIF":3.7,"publicationDate":"2025-11-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145579406","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

Local method of fundamental solutions formulations for polyharmonic BVPs 多谐bvp基本解公式的局部方法

IF 3.7 3区计算机科学 Q2 COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS

Journal of Computational Science

Pub Date : 2025-11-06 DOI: 10.1016/j.jocs.2025.102742

Andreas Karageorghis , C.S. Chen , Malgorzata A. Jankowska

We develop three local method of fundamental solutions (LMFS) formulations for solving two-dimensional boundary value problems (BVPs) governed by the polyharmonic equation

Δ^{N} u = 0, N \in N ∖ {1}

, in

Ω \subset R^{2}

. The efficacy of the proposed techniques is demonstrated by several numerical experiments in multi-connected domains. Using the local version of the MFS, the difficulty of selecting the source points in multi-connected domains, especially those containing tiny holes, can be alleviated. We also demonstrate the importance of selecting the appropriate formulation for solving higher order polyharmonic equations. In addition, we formulate matrix decomposition algorithms for the efficient solution of polyharmonic BVPs in radially symmetric domains.

我们开发了三个局部基本解方法（LMFS）公式，用于求解由Ω∧R2中的多谐方程ΔNu=0，N∈N∈{1}控制的二维边值问题（bvp）。通过多连通域的数值实验验证了该方法的有效性。使用本地版本的MFS，可以减轻在多连通域，特别是含有微小孔的域中选择源点的困难。我们还证明了选择合适的公式求解高阶多谐方程的重要性。此外，我们还提出了在径向对称区域中有效求解多谐bvp的矩阵分解算法。

{"title":"Local method of fundamental solutions formulations for polyharmonic BVPs","authors":"Andreas Karageorghis , C.S. Chen , Malgorzata A. Jankowska","doi":"10.1016/j.jocs.2025.102742","DOIUrl":"10.1016/j.jocs.2025.102742","url":null,"abstract":"<div><div>We develop three local method of fundamental solutions (LMFS) formulations for solving two-dimensional boundary value problems (BVPs) governed by the polyharmonic equation <span><math><mrow><msup><mrow><mi>Δ</mi></mrow><mrow><mi>N</mi></mrow></msup><mi>u</mi><mspace></mspace><mo>=</mo><mspace></mspace><mn>0</mn><mo>,</mo><mspace></mspace><mi>N</mi><mo>∈</mo><mi>N</mi><mo>∖</mo><mrow><mo>{</mo><mn>1</mn><mo>}</mo></mrow></mrow></math></span>, in <span><math><mrow><mi>Ω</mi><mo>⊂</mo><msup><mrow><mi>R</mi></mrow><mrow><mn>2</mn></mrow></msup></mrow></math></span>. The efficacy of the proposed techniques is demonstrated by several numerical experiments in multi-connected domains. Using the local version of the MFS, the difficulty of selecting the source points in multi-connected domains, especially those containing tiny holes, can be alleviated. We also demonstrate the importance of selecting the appropriate formulation for solving higher order polyharmonic equations. In addition, we formulate matrix decomposition algorithms for the efficient solution of polyharmonic BVPs in radially symmetric domains.</div></div>","PeriodicalId":48907,"journal":{"name":"Journal of Computational Science","volume":"93 ","pages":"Article 102742"},"PeriodicalIF":3.7,"publicationDate":"2025-11-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145529199","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

Fuzzy data imputation with DIMP and FGAIN 模糊数据的DIMP和FGAIN插值

IF 3.7 3区计算机科学 Q2 COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS

Journal of Computational Science

Pub Date : 2025-10-31 DOI: 10.1016/j.jocs.2025.102738

Maciej Romaniuk , Przemysław Grzegorzewski

Missing values in a dataset are usually replaced by their imputed counterparts. Although many imputation methods are dedicated to real-valued data, the situation is quite different for fuzzy values. Moreover, the issue of missing data in a fuzzy dataset is fundamentally different from the case of real values — the lack of real data only means there are no observations in the database in a specific place. Meanwhile, in the case of fuzzy observations, which are mathematically more complex than real-valued data, missing data may mean both the lack of observations and the fact that a particular component of the fuzzy observations is unknown. In this paper, we propose an imputation method called DIMP, specifically designed to deal with imprecise data that is missing and modeled with fuzzy numbers. We consider two algorithms explicitly tailored for triangular and trapezoidal LR-fuzzy numbers. We also discuss another approach called FGAIN, a special GAIN variant adapted to fuzzy data. Then, we compare DIMP with FGAIN, using both simulated and real-life datasets. Various statistical tools, including error measures and tests, are proposed as suitable benchmarks for this comparison. The conducted numerical analysis shows that both considered methods, with an indication in favor of DIMP, are promising tools that could be recommended for practitioners to handle fuzzy data imputation problems.

数据集中的缺失值通常由其估算的对应值替换。虽然许多方法都是针对实值数据的，但对于模糊值的情况就完全不同了。此外，模糊数据集中缺失数据的问题与真实值的情况有着根本的不同——缺乏真实数据只意味着数据库中特定位置没有观测值。同时，在模糊观测的情况下，它在数学上比实值数据更复杂，缺失的数据可能意味着缺乏观测和模糊观测的特定组成部分未知的事实。在本文中，我们提出了一种称为DIMP的imputation方法，专门用于处理缺失和模糊数建模的不精确数据。我们考虑了两种明确为三角形和梯形lr模糊数量身定制的算法。我们还讨论了另一种称为FGAIN的方法，这是一种适应模糊数据的特殊GAIN变体。然后，我们比较了DIMP和FGAIN，使用模拟和现实数据集。提出了各种统计工具，包括误差测量和测试，作为这种比较的适当基准。所进行的数值分析表明，这两种方法都是有前途的工具，可以推荐从业者处理模糊数据输入问题。

{"title":"Fuzzy data imputation with DIMP and FGAIN","authors":"Maciej Romaniuk , Przemysław Grzegorzewski","doi":"10.1016/j.jocs.2025.102738","DOIUrl":"10.1016/j.jocs.2025.102738","url":null,"abstract":"<div><div>Missing values in a dataset are usually replaced by their imputed counterparts. Although many imputation methods are dedicated to real-valued data, the situation is quite different for fuzzy values. Moreover, the issue of missing data in a fuzzy dataset is fundamentally different from the case of real values — the lack of real data only means there are no observations in the database in a specific place. Meanwhile, in the case of fuzzy observations, which are mathematically more complex than real-valued data, missing data may mean both the lack of observations and the fact that a particular component of the fuzzy observations is unknown. In this paper, we propose an imputation method called DIMP, specifically designed to deal with imprecise data that is missing and modeled with fuzzy numbers. We consider two algorithms explicitly tailored for triangular and trapezoidal LR-fuzzy numbers. We also discuss another approach called FGAIN, a special GAIN variant adapted to fuzzy data. Then, we compare DIMP with FGAIN, using both simulated and real-life datasets. Various statistical tools, including error measures and tests, are proposed as suitable benchmarks for this comparison. The conducted numerical analysis shows that both considered methods, with an indication in favor of DIMP, are promising tools that could be recommended for practitioners to handle fuzzy data imputation problems.</div></div>","PeriodicalId":48907,"journal":{"name":"Journal of Computational Science","volume":"93 ","pages":"Article 102738"},"PeriodicalIF":3.7,"publicationDate":"2025-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145475487","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 nonlinear finite volume scheme preserving positivity for the numerical simulation of groundwater contaminant transport in porous media 地下水污染物在多孔介质中运移的非线性有限体积格式

IF 3.7 3区计算机科学 Q2 COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS

Journal of Computational Science

Pub Date : 2025-10-30 DOI: 10.1016/j.jocs.2025.102739

Sadiq Hamidi , Mustapha El Ossmani , Abdelaziz Taakili

In this paper, we propose a monotone finite volume scheme to simulate a nonlinear degenerate parabolic problem modeling the transport of reactive solutes in groundwater. Our approach is based on the mixed finite element method (MFEM) for Darcy’s flow equation, combined with a fully implicit Euler nonlinear monotone finite volume scheme for the transport equation. We introduce and analyze the scheme in the context of continuous, non-Lipschitz sorption isotherms, where the problem becomes temporally degenerate, requiring a regularization step to address this issue. The proposed method relies on a Nonlinear Two-Point Flux Approximation (NTPFA) for the diffusive term and an enhanced second-order accurate upwind scheme for the convective term. The fully discrete nonlinear system arising at each time step is solved using Picard iteration, accelerated by the Anderson Acceleration (AA) algorithm. Our aim is, on the one hand, to prove that the scheme preserves the positivity of the analytical solution for anisotropic and heterogeneous full-tensor coefficients on unstructured meshes. On the other hand, we establish the stability, mass conservation, and convergence of the fixed-point algorithm applied to the regularized scheme. To illustrate the effectiveness of our method, several numerical experiments and simulations are presented.

本文提出了一个单调有限体积格式来模拟模拟地下水中反应溶质运移的非线性退化抛物问题。我们的方法是基于Darcy流动方程的混合有限元法（MFEM），结合传输方程的全隐式欧拉非线性单调有限体积格式。我们在连续的，非lipschitz吸收等温线的背景下介绍和分析了该方案，其中问题变得暂时退化，需要正则化步骤来解决这个问题。该方法采用非线性两点通量近似（NTPFA）求解扩散项，采用增强的二阶精确逆风格式求解对流项。采用Picard迭代求解各时间步产生的全离散非线性系统，并采用Anderson加速算法进行加速。一方面，我们的目的是证明该方案保留了非结构化网格上各向异性和非均匀全张量系数解析解的正性。另一方面，我们建立了应用于正则化格式的不动点算法的稳定性、质量守恒性和收敛性。为了说明该方法的有效性，给出了几个数值实验和模拟。

{"title":"A nonlinear finite volume scheme preserving positivity for the numerical simulation of groundwater contaminant transport in porous media","authors":"Sadiq Hamidi , Mustapha El Ossmani , Abdelaziz Taakili","doi":"10.1016/j.jocs.2025.102739","DOIUrl":"10.1016/j.jocs.2025.102739","url":null,"abstract":"<div><div>In this paper, we propose a monotone finite volume scheme to simulate a nonlinear degenerate parabolic problem modeling the transport of reactive solutes in groundwater. Our approach is based on the mixed finite element method (MFEM) for Darcy’s flow equation, combined with a fully implicit Euler nonlinear monotone finite volume scheme for the transport equation. We introduce and analyze the scheme in the context of continuous, non-Lipschitz sorption isotherms, where the problem becomes temporally degenerate, requiring a regularization step to address this issue. The proposed method relies on a Nonlinear Two-Point Flux Approximation (NTPFA) for the diffusive term and an enhanced second-order accurate upwind scheme for the convective term. The fully discrete nonlinear system arising at each time step is solved using Picard iteration, accelerated by the Anderson Acceleration (AA) algorithm. Our aim is, on the one hand, to prove that the scheme preserves the positivity of the analytical solution for anisotropic and heterogeneous full-tensor coefficients on unstructured meshes. On the other hand, we establish the stability, mass conservation, and convergence of the fixed-point algorithm applied to the regularized scheme. To illustrate the effectiveness of our method, several numerical experiments and simulations are presented.</div></div>","PeriodicalId":48907,"journal":{"name":"Journal of Computational Science","volume":"93 ","pages":"Article 102739"},"PeriodicalIF":3.7,"publicationDate":"2025-10-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145420500","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