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

Parameter tuning of the firefly algorithm by three tuning methods: Standard Monte Carlo, quasi-Monte Carlo and latin hypercube sampling methods 采用标准蒙特卡罗、拟蒙特卡罗和拉丁超立方采样三种方法对萤火虫算法进行参数整定

IF 3.1 3区计算机科学

Journal of Computational Science Pub Date : 2025-04-08 DOI: 10.1016/j.jocs.2025.102588

Geethu Joy , Christian Huyck , Xin-She Yang

{"title":"Parameter tuning of the firefly algorithm by three tuning methods: Standard Monte Carlo, quasi-Monte Carlo and latin hypercube sampling methods","authors":"Geethu Joy , Christian Huyck , Xin-She Yang","doi":"10.1016/j.jocs.2025.102588","DOIUrl":"10.1016/j.jocs.2025.102588","url":null,"abstract":"<div><div>There are many different nature-inspired algorithms in the literature, and almost all such algorithms have algorithm-dependent parameters that need to be tuned. The proper setting and parameter tuning should be carried out to maximize the performance of the algorithm under consideration. This work is the extension of the recent work on parameter tuning by Joy et al. (2024) presented at the International Conference on Computational Science (ICCS 2024), and the Firefly Algorithm (FA) is tuned using three different methods: the Monte Carlo method, the Quasi-Monte Carlo method and the Latin Hypercube Sampling. The FA with the tuned parameters is then used to solve a set of six different optimization problems, and the possible effect of parameter setting on the quality of the optimal solutions is analyzed. Rigorous statistical hypothesis tests have been carried out, including Student’s t-tests, F-tests, non-parametric Friedman tests and ANOVA. Results show that the performance of the FA is not influenced by the tuning methods used. In addition, the tuned parameter values are largely independent of the tuning methods used. This indicates that the FA can be flexible and equally effective in solving optimization problems, and any of the three tuning methods can be used to tune its parameters effectively.</div></div>","PeriodicalId":48907,"journal":{"name":"Journal of Computational Science","volume":"87 ","pages":"Article 102588"},"PeriodicalIF":3.1,"publicationDate":"2025-04-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143820613","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

Discrete fractional neural networks within the framework of octonions: A preliminary exploration 八进制框架内的离散分数神经网络：初步探索

IF 3.1 3区计算机科学

Journal of Computational Science Pub Date : 2025-04-05 DOI: 10.1016/j.jocs.2025.102586

Jie Ran , Yonghui Zhou , Thabet Abdeljawad , Hao Pu

{"title":"Discrete fractional neural networks within the framework of octonions: A preliminary exploration","authors":"Jie Ran , Yonghui Zhou , Thabet Abdeljawad , Hao Pu","doi":"10.1016/j.jocs.2025.102586","DOIUrl":"10.1016/j.jocs.2025.102586","url":null,"abstract":"<div><div>Conventional neural networks constructed on real or complex domains have limitations in capturing multi-dimensional data with memory effects. This work is a preliminary exploration of discrete fractional neural network modeling within the framework of octonions. Initially, by introducing the discrete fractional Caputo difference operator into the octonion domain, we establish a novel system of discrete fractional delayed octonion-valued neural networks (DFDOVNNs). The new system provides a theoretical support for developing neural network algorithms that are useful for solving complex, multi-dimensional problems with memory effects in the real world. We then use the Cayley–Dickson technique to divide the system into four discrete fractional complex-valued neural networks to deal with the non-commutative and non-associative properties of the hyper-complex domain. Next, we establish the existence and uniqueness of the equilibrium point to the system based on the homeomorphism theory. Furthermore, by employing the Lyapunov theory, we establish some straightforward and verifiable linear matrix inequality (LMI) criteria to ensure global Mittag-Leffler stability of the system. In addition, an effective feedback controller is developed to achieve the system’s drive-response synchronization in the Mittag-Leffler sense. Finally, two numerical examples support the theoretical analysis. This research introduces a novel direction in neural network studies that promises to significantly advance the fields of signal processing, control systems, and artificial intelligence.</div></div>","PeriodicalId":48907,"journal":{"name":"Journal of Computational Science","volume":"87 ","pages":"Article 102586"},"PeriodicalIF":3.1,"publicationDate":"2025-04-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143785566","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

Dispersal- and harvesting-induced dynamics of single-species inhabited in minimal ring-shaped patches 最小环形斑块中单一物种的扩散和收获诱导动态

IF 3.1 3区计算机科学

Journal of Computational Science Pub Date : 2025-04-05 DOI: 10.1016/j.jocs.2025.102581

Arjun Hasibuan , Bapan Ghosh , Asep K. Supriatna

{"title":"Dispersal- and harvesting-induced dynamics of single-species inhabited in minimal ring-shaped patches","authors":"Arjun Hasibuan , Bapan Ghosh , Asep K. Supriatna","doi":"10.1016/j.jocs.2025.102581","DOIUrl":"10.1016/j.jocs.2025.102581","url":null,"abstract":"<div><div>We investigate two discrete-time models of a single-species dispersed between three patches located on a ring. The dynamic models are formulated by identical logistic maps with linear coupling. The co-existing equilibrium completely depends on the intrinsic growth rate and carrying capacity. However, stability depends only on intrinsic growth rate and dispersal rate. We shall analytically present the stability analysis of both the trivial and coexisting equilibrium in a two parameter plane. Our main focus is to explore the bifurcations at the coexisting equilibrium and their consequences in ecology. Increasing dispersal rate leads to a period-doubling bifurcation in the bi-directional dispersal model followed by a Neimark-Sacker bifurcation arising from each periodic branch. Our analysis reports the existence of either three stable 2-cycles or three distinct quasi-periodic modes resulting in either periodic–periodic–periodic multistability or quasiperiodic–quasiperiodic–quasiperiodic multistability. In contrast to the bi-directional model, only a Neimark-Sacker occurs in the uni-directional dispersal model for increasing dispersal rate. This uni-directional dispersal strategy does not exhibit any multistability. The co-existing equilibrium may experience an instability switching in both models while introducing harvesting in one of the patches. Under harvesting, the bi-directional model could induce a Neimark-Sacker bifurcation which is impossible to occur for increasing dispersal. We shall estimate the effort levels to achieve the same amount of harvested yield in both uni- and bi-directional dispersal models. These results might be interesting from biological conservation and fishery management viewpoints.</div></div>","PeriodicalId":48907,"journal":{"name":"Journal of Computational Science","volume":"87 ","pages":"Article 102581"},"PeriodicalIF":3.1,"publicationDate":"2025-04-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143808259","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

Modeling the effect of fear-inducing awareness programs on smoking cessation 模拟恐惧诱导意识项目对戒烟的影响

IF 3.1 3区计算机科学

Journal of Computational Science Pub Date : 2025-04-05 DOI: 10.1016/j.jocs.2025.102584

Jyoti Maurya, Mamta Kumari, A.K. Misra

{"title":"Modeling the effect of fear-inducing awareness programs on smoking cessation","authors":"Jyoti Maurya, Mamta Kumari, A.K. Misra","doi":"10.1016/j.jocs.2025.102584","DOIUrl":"10.1016/j.jocs.2025.102584","url":null,"abstract":"<div><div>Smoking remains a significant public health challenge, contributing to numerous preventable diseases and mortality worldwide. Addressing this issue requires innovative strategies to enhance smoking cessation rate. In this research work, we develop a mathematical model to evaluate the impact of fear-inducing awareness programs on promoting smoking cessation. The model incorporates the parameters depicting the behavioral changes of individuals to capture the dynamic interplay between fear-driven awareness programs and smoking behavior. We analyze the local and global stability of the equilibria obtained from the model, providing a comprehensive understanding of the system’s dynamics. Furthermore, we identify critical bifurcation phenomena, including saddle–node and transcritical bifurcations, occurring in both forward and backward directions, which elucidate the system’s qualitative changes under parameter variations. Numerical simulations are conducted using smoking prevalence data from the United States of America (USA) to validate the analytical results and explore the influence of key parameters on smoking behavior. Our findings highlight that intensifying the fear component within awareness programs is more effective in promoting smoking cessation compared to merely increasing the number of such programs.</div></div>","PeriodicalId":48907,"journal":{"name":"Journal of Computational Science","volume":"87 ","pages":"Article 102584"},"PeriodicalIF":3.1,"publicationDate":"2025-04-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143808258","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

Defense timing selection for MTD in periodic satellite computing systems: A Markov game approach 周期性卫星计算系统中 MTD 的防御时机选择：马尔可夫博弈方法

IF 3.1 3区计算机科学

Journal of Computational Science Pub Date : 2025-04-04 DOI: 10.1016/j.jocs.2025.102583

Lin Zhang , Yunchuan Guo , Siyuan Leng , Xiaogang Cao , Fenghua Li , Liang Fang

{"title":"Defense timing selection for MTD in periodic satellite computing systems: A Markov game approach","authors":"Lin Zhang , Yunchuan Guo , Siyuan Leng , Xiaogang Cao , Fenghua Li , Liang Fang","doi":"10.1016/j.jocs.2025.102583","DOIUrl":"10.1016/j.jocs.2025.102583","url":null,"abstract":"<div><div>Satellite computing systems (SCSs), with their enormous economic value, are suffering from increasing attacks. Moving Target Defense (MTD), which changes the attack surface to create an asymmetric situation between attacks and defenses, can be used to improve the safety of the SCS. Defense timing selection is crucial for enhancing the defense capability of MTD and reducing its cost. However, existing MTD defense timing selection strategies do not consider limited defense resources and periodic user traffic in the SCS, which leads to significant resource consumption and impacts a large volume of traffic, making them unsuitable for the SCS. We propose a Markov Game-based Defense Timing Selection (MGDTS) approach to protect the SCS. We divide the orbital cycle of the SCS into several time periods with different traffic rates. For each period, we formulate the attack-defense adversarial relationship as a Markov game with incomplete information. In the game, we use explicit costs to define the resource consumption of a defender. Further, we employ Markov decision processes to construct the defense timing decision equation and use real-time dynamic programming to solve the equation. Experimental results show that compared with the existing MTDs, our scheme can enhance security while reducing resource consumption and the influence on user traffic. This work is an extended version of the ICCS-2024 conference paper (Lin Zhang et al., 2024).</div></div>","PeriodicalId":48907,"journal":{"name":"Journal of Computational Science","volume":"87 ","pages":"Article 102583"},"PeriodicalIF":3.1,"publicationDate":"2025-04-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143816992","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

Slope stability evaluation and prediction based on KTAN coupling model and Monte Carlo method 基于KTAN耦合模型和蒙特卡罗方法的边坡稳定性评价与预测

IF 3.1 3区计算机科学

Journal of Computational Science Pub Date : 2025-03-27 DOI: 10.1016/j.jocs.2025.102580

Feiyang Yu , Xiaoqiang Zhang , Shunchuan Wu , Yanming Feng , Libing Zhang

引用次数: 0

Impact of inlet velocity waveform shape on hemodynamics 入口速度波形形状对血流动力学的影响

IF 3.1 3区计算机科学

Journal of Computational Science Pub Date : 2025-03-27 DOI: 10.1016/j.jocs.2025.102579

Justen R. Geddes, Timothy D. King, Cyrus Tanade, William Ladd, Nusrat Sadia Khan, Amanda Randles

{"title":"Impact of inlet velocity waveform shape on hemodynamics","authors":"Justen R. Geddes, Timothy D. King, Cyrus Tanade, William Ladd, Nusrat Sadia Khan, Amanda Randles","doi":"10.1016/j.jocs.2025.102579","DOIUrl":"10.1016/j.jocs.2025.102579","url":null,"abstract":"<div><div>Monitoring disease development in arteries, which supply oxygen and nutrients to the body, is crucial and can be assessed using hemodynamic metrics. Hemodynamic metrics can be calculated via computational fluid dynamic simulation of patient-specific geometries. These simulations are known to be heavily influenced by boundary conditions, such as time-dependent inlet flow. However, the effects of inlet flow profiles have not previously been quantified or understood. Here we quantify the effects of modulating temporal arterial waveforms on hemodynamic metrics. Building on our previous work that identified the minimum number of points of interest needed to characterize a left coronary artery inlet waveform, here, we extend this approach to pulmonary and carotid artery waveforms, pinpointing critical points of interest on these waveforms. Using a systematic variation of these points, we quantify the effects on hemodynamic metrics such as wall shear stress, oscillatory shear index, and relative residence time. We simulate using 1D Navier–Stokes and 3D lattice Boltzmann simulation approaches conducted on high performance compute clusters. The results pinpoint parts of the waveform that are most susceptible to perturbations and measurement error. The impacts of this work include the construction of a method that can be applied to other fluid simulations with pulsatile inlet conditions and the ability to distinguish the vital parts of a pulsatile inlet condition for computational fluid dynamic simulations and clinical metrics. This work is an extension of work published at the International Conference on Computational Science (ICCS-2024), (Geddes et al., 2024).</div></div>","PeriodicalId":48907,"journal":{"name":"Journal of Computational Science","volume":"87 ","pages":"Article 102579"},"PeriodicalIF":3.1,"publicationDate":"2025-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143724970","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

Bearing-distance flocking with zone-based interactions in constrained dynamic environments 约束动态环境下基于区域交互的方位距离蜂群

IF 3.1 3区计算机科学

Journal of Computational Science Pub Date : 2025-03-23 DOI: 10.1016/j.jocs.2025.102574

Hossein B. Jond

{"title":"Bearing-distance flocking with zone-based interactions in constrained dynamic environments","authors":"Hossein B. Jond","doi":"10.1016/j.jocs.2025.102574","DOIUrl":"10.1016/j.jocs.2025.102574","url":null,"abstract":"<div><div>This paper presents a novel zone-based flocking control approach suitable for dynamic multi-agent systems (MAS). Inspired by Reynolds behavioral rules for <em>boids</em>, flocking behavioral rules with the zones of repulsion, conflict, attraction, and surveillance are introduced. For each agent, using only bearing and distance measurements, behavioral contribution vectors quantify the local separation, local and global flock velocity alignment, local cohesion, obstacle avoidance and boundary conditions, and strategic separation for avoiding alien agents. The control strategy uses the local perception-based behavioral contribution vectors to guide each agent’s motion. Additionally, the control strategy incorporates a directionally aware obstacle avoidance mechanism that prioritizes obstacles in the agent’s forward path. Simulation results validate the effectiveness of the model in creating flexible, adaptable, and scalable flocking behavior. Asymptotic stability and convergence to a stable flocking configuration for any initial conditions provided the interaction graph is a spanning tree are demonstrated. The flocking model’s reliance on locally sensed bearing and distance measurements ensures scalability and robustness, particularly in scenarios where communication is unreliable or resource-intensive. This makes it well-suited for real-world applications demanding seamless operation in highly dynamic and distributed environments.</div></div>","PeriodicalId":48907,"journal":{"name":"Journal of Computational Science","volume":"87 ","pages":"Article 102574"},"PeriodicalIF":3.1,"publicationDate":"2025-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143704490","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

Design of a high-performance tensor–matrix multiplication with BLAS 基于BLAS的高性能张量矩阵乘法的设计

IF 3.1 3区计算机科学

Journal of Computational Science Pub Date : 2025-03-22 DOI: 10.1016/j.jocs.2025.102568

Cem Savaş Başsoy

{"title":"Design of a high-performance tensor–matrix multiplication with BLAS","authors":"Cem Savaş Başsoy","doi":"10.1016/j.jocs.2025.102568","DOIUrl":"10.1016/j.jocs.2025.102568","url":null,"abstract":"<div><div>The tensor–matrix multiplication (TTM) is a basic tensor operation required by various tensor methods such as the HOSVD. This paper presents flexible high-performance algorithms that compute the tensor–matrix product according to the Loops-over-GEMM (LOG) approach. The proposed algorithms can process dense tensors with any linear tensor layout, arbitrary tensor order and dimensions all of which can be runtime variable. The paper discusses two slicing methods with orthogonal parallelization strategies and propose four algorithms that call BLAS with subtensors or tensor slices. It also provides a simple heuristic which selects one of the four proposed algorithms at runtime. All algorithms have been evaluated on a large set of tensors with various tensor shapes and linear tensor layouts. In case of large tensor slices, our best-performing algorithm achieves a median performance of 2.47 TFLOPS on an Intel Xeon Gold 5318Y and 2.93 TFLOPS an AMD EPYC 9354. Furthermore, it outperforms batched GEMM implementation of Intel MKL by a factor of 2.57 with large tensor slices. Our runtime tests show that our best-performing algorithm is, on average, at least 6.21% and up to 334.31% faster than frameworks implementing state-of-the-art approaches, including actively developed libraries such as Libtorch and Eigen. For the majority of tensor shapes, it is on par with TBLIS which uses optimized kernels for the TTM computation. Our algorithm performs better than all other competing implementations for the majority of real world tensors from the SDRBench, reaching a speedup of 2x or more for some tensor instances. This work is an extended version of ”Fast and Layout-Oblivious Tensor–Matrix Multiplication with BLAS” (Başsoy 2024).</div></div>","PeriodicalId":48907,"journal":{"name":"Journal of Computational Science","volume":"87 ","pages":"Article 102568"},"PeriodicalIF":3.1,"publicationDate":"2025-03-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143681883","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

Evaluation of new CORDIC algorithms implemented on FPGA for the Givens Rotator 基于给定旋转器的新CORDIC算法在FPGA上实现的评估

IF 3.1 3区计算机科学

Journal of Computational Science Pub Date : 2025-03-21 DOI: 10.1016/j.jocs.2025.102567

Pawel Poczekajlo , Leonid Moroz , Ewa Deelman , Pawel Gepner

引用次数: 0