{"title":"A three-stage framework combining neural networks and Monte Carlo tree search for approximating analytical solutions to the Thomas–Fermi equation","authors":"Hassan Dana Mazraeh , Kourosh Parand","doi":"10.1016/j.jocs.2025.102582","DOIUrl":"10.1016/j.jocs.2025.102582","url":null,"abstract":"<div><div>This study presents an innovative framework that integrates physics-informed neural networks with Monte Carlo tree search to develop an approximate analytical solution for the Thomas–Fermi equation. The framework operates in three stages. Initially, a physics-informed neural network is used to generate a numerical approximation of the Thomas–Fermi equation. Subsequently, the Monte Carlo tree search algorithm identifies an analytical expression that closely approximates the numerical solution from the first stage, resulting in an initial analytical solution. In the final stage, the physics-informed neural network is employed once more to optimize the coefficients of the expression found by Monte Carlo tree search, further refining the accuracy of the solution. Experimental results validate the effectiveness of this approach, demonstrating its capability to solve the challenging and nonlinear Thomas–Fermi equation, for which an exact analytical solution is not available.</div></div>","PeriodicalId":48907,"journal":{"name":"Journal of Computational Science","volume":"87 ","pages":"Article 102582"},"PeriodicalIF":3.1,"publicationDate":"2025-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143816994","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}
João Carmo de Almeida Neto , Leandro Santiago de Araújo , Leopoldo André Dutra Lusquino Filho , Claudio Miceli de Farias
{"title":"Time series forecasting for multidimensional telemetry data based on Generative Adversarial Network in a Digital Twin","authors":"João Carmo de Almeida Neto , Leandro Santiago de Araújo , Leopoldo André Dutra Lusquino Filho , Claudio Miceli de Farias","doi":"10.1016/j.jocs.2025.102589","DOIUrl":"10.1016/j.jocs.2025.102589","url":null,"abstract":"<div><div>The research related to Digital Twins has been increasing in recent years. Besides the mirroring of the physical word into the digital, there is the need of providing services related to the data collected and transferred to the virtual world. One of these services is the forecasting of physical part future behavior, that could lead to applications, like preventing harmful events or designing improvements to get better performance. One strategy used to predict any system operation is the use of time series models like Autoregressive Integrated Moving Average (ARIMA) or Long-Short Term Memory (LSTM) and improvements implemented using these algorithms. Recently, deep learning techniques based on generative models such as Generative Adversarial Networks (GANs) have been proposed to create time series, and the use of LSTM has gained more relevance in time series forecasting, but both have limitations that restrict the forecasting results. Another issue found in the literature is the challenge of handling multivariate environments/applications in time series generation. Therefore, new methods need to be studied in order to fill these gaps and, consequently, provide better resources for creating useful Digital Twins. In the proposed method we introduce the integration of a Bidirectional LSTM (BiLSTM) layer with a time series obtained by GAN that leads to improved forecasting of all feature of the available dataset in terms of accuracy. The obtained results demonstrate improved prediction performance.</div></div>","PeriodicalId":48907,"journal":{"name":"Journal of Computational Science","volume":"88 ","pages":"Article 102589"},"PeriodicalIF":3.1,"publicationDate":"2025-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143854326","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}
{"title":"A tripartite evolutionary game for strategic decision-making in live-streaming e-commerce","authors":"Georgia Fargetta, Laura R.M. Scrimali","doi":"10.1016/j.jocs.2025.102585","DOIUrl":"10.1016/j.jocs.2025.102585","url":null,"abstract":"<div><div>The rapid growth of live-streaming has transformed traditional e-commerce into an interactive and immersive experience, giving birth to live-streaming e-commerce. This paper investigates the strategic interactions between brands, social media influencers, and consumers under this mechanism. Using evolutionary game theory, we model decision-making dynamics across these three parties and analyze how their strategies develop over time. Our framework incorporates contractual penalties between brands and influencers, rewards for influencers, product returns, and subscription fees to capture realistic market behaviors. We derive replicator dynamics equations for each participant group and identify stable equilibrium strategies for the entire system. The application of replicator dynamics offers valuable perspectives on temporary states and strategies that achieve long-term equilibrium. We also present numerical simulations to validate the effectiveness of our model. In addition, we show how parameters, such as penalties and rewards, influence strategy selection and allow the system to achieve stability successfully. This research provides actionable recommendations for optimizing partnerships in live-streaming e-commerce supply chains.</div></div>","PeriodicalId":48907,"journal":{"name":"Journal of Computational Science","volume":"87 ","pages":"Article 102585"},"PeriodicalIF":3.1,"publicationDate":"2025-04-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143816993","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}
{"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}
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}
{"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}
{"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}
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}
{"title":"Slope stability evaluation and prediction based on KTAN coupling model and Monte Carlo method","authors":"Feiyang Yu , Xiaoqiang Zhang , Shunchuan Wu , Yanming Feng , Libing Zhang","doi":"10.1016/j.jocs.2025.102580","DOIUrl":"10.1016/j.jocs.2025.102580","url":null,"abstract":"<div><div>Landslides pose significant challenges to slope stability evaluation due to their complex and unpredictable nature. This study introduces a novel machine learning model, KTAN (KAN-Transformer), to enhance slope stability prediction. By preprocessing slope stability classification data and landslide-influencing factors, we optimized five machine learning algorithms—Support Vector Machine (SVM), Random Forest (RF), eXtreme Gradient Boosting (XGBoost), Multiple Linear Regression (MLR), and KTAN—using Nested 10-Fold Cross-Validation (N10FCV) and Grid Search (GS). The models’ performance was assessed with metrics such as accuracy, F1-score, and AUC, and their uncertainty was evaluated via Monte Carlo simulation. Results demonstrate that KTAN outperforms the other models, achieving an accuracy of 0.94 and an F1-score of 0.95, offering a reliable and innovative approach to slope stability analysis.</div></div>","PeriodicalId":48907,"journal":{"name":"Journal of Computational Science","volume":"88 ","pages":"Article 102580"},"PeriodicalIF":3.1,"publicationDate":"2025-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143923648","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}
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}