Pub Date : 2024-09-17DOI: 10.1016/j.jocs.2024.102445
Seda Çayan , Mehmet Sezer
In this work, a system of linear partial differential equations with constant and variable coefficients via Cauchy conditions is handled by applying the numerical algorithm based on operational matrices and equally-spaced collocation points. To demonstrate the applicability and efficiency of the method, four illustrative examples are tested along with absolute error, maximum absolute error, RMS error, and CPU times. The approximate solutions are compared with the analytical solutions and other numerical results in literature. The obtained numerical results are scrutinized by means of tables and graphics. These comparisons show accuracy and productivity of our method for the linear systems of partial differential equations. Besides, an algorithm is described that summarizes the formulation of the presented method. This algorithm can be adapted to well-known computer programs.
在这项工作中,通过柯西条件,应用基于运算矩阵和等间距配置点的数值算法,处理了一个具有常数和可变系数的线性偏微分方程系统。为了证明该方法的适用性和效率,对四个示例进行了绝对误差、最大绝对误差、均方根误差和 CPU 时间的测试。近似解与分析解以及文献中的其他数值结果进行了比较。通过表格和图形对所获得的数值结果进行了仔细检查。这些比较显示了我们的方法对线性偏微分方程系统的准确性和效率。此外,还介绍了一种算法,该算法总结了所介绍方法的表述。该算法可适用于著名的计算机程序。
{"title":"A feasible numerical computation based on matrix operations and collocation points to solve linear system of partial differential equations","authors":"Seda Çayan , Mehmet Sezer","doi":"10.1016/j.jocs.2024.102445","DOIUrl":"10.1016/j.jocs.2024.102445","url":null,"abstract":"<div><p>In this work, a system of linear partial differential equations with constant and variable coefficients via Cauchy conditions is handled by applying the numerical algorithm based on operational matrices and equally-spaced collocation points. To demonstrate the applicability and efficiency of the method, four illustrative examples are tested along with absolute error, maximum absolute error, RMS error, and CPU times. The approximate solutions are compared with the analytical solutions and other numerical results in literature. The obtained numerical results are scrutinized by means of tables and graphics. These comparisons show accuracy and productivity of our method for the linear systems of partial differential equations. Besides, an algorithm is described that summarizes the formulation of the presented method. This algorithm can be adapted to well-known computer programs<strong>.</strong></p></div>","PeriodicalId":48907,"journal":{"name":"Journal of Computational Science","volume":"83 ","pages":"Article 102445"},"PeriodicalIF":3.1,"publicationDate":"2024-09-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142241749","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-09-07DOI: 10.1016/j.jocs.2024.102429
Zakariae Drabech, Mohammed Douimi, Elmoukhtar Zemmouri
Detecting Change Points (CPs) in data sequences is a challenging problem that arises in a variety of disciplines, including signal processing and time series analysis. While many methods exist for PieceWise Constant (PWC) signals, relatively fewer address PieceWise Linear (PWL) signals due to the challenge of preserving sharp transitions. This paper introduces a Markov Random Field (MRF) model for detecting changes in slope. The number of CPs and their locations are unknown. The proposed method incorporates PWL prior information using MRF framework with an additional boolean variable called Line Process (LP), describing the presence or absence of CPs. The solution is then estimated in the sense of maximum a posteriori. The LP allows us to define a non-convex non-smooth energy function that is algorithmically hard to minimize. To tackle the optimization challenge, we propose an extension of the combinatorial algorithm DPS, initially designed for CP detection in PWC signals. Also, we present a shared memory implementation to enhance computational efficiency. Numerical studies show that the proposed model produces competitive results compared to the state-of-the-art methods. We further evaluate the performance of our method on three real datasets, demonstrating superior and accurate estimates of the underlying trend compared to competing methods.
{"title":"A Markov random field model for change points detection","authors":"Zakariae Drabech, Mohammed Douimi, Elmoukhtar Zemmouri","doi":"10.1016/j.jocs.2024.102429","DOIUrl":"10.1016/j.jocs.2024.102429","url":null,"abstract":"<div><p>Detecting Change Points (CPs) in data sequences is a challenging problem that arises in a variety of disciplines, including signal processing and time series analysis. While many methods exist for PieceWise Constant (PWC) signals, relatively fewer address PieceWise Linear (PWL) signals due to the challenge of preserving sharp transitions. This paper introduces a Markov Random Field (MRF) model for detecting changes in slope. The number of CPs and their locations are unknown. The proposed method incorporates PWL prior information using MRF framework with an additional boolean variable called Line Process (LP), describing the presence or absence of CPs. The solution is then estimated in the sense of maximum a posteriori. The LP allows us to define a non-convex non-smooth energy function that is algorithmically hard to minimize. To tackle the optimization challenge, we propose an extension of the combinatorial algorithm DPS, initially designed for CP detection in PWC signals. Also, we present a shared memory implementation to enhance computational efficiency. Numerical studies show that the proposed model produces competitive results compared to the state-of-the-art methods. We further evaluate the performance of our method on three real datasets, demonstrating superior and accurate estimates of the underlying trend compared to competing methods.</p></div>","PeriodicalId":48907,"journal":{"name":"Journal of Computational Science","volume":"83 ","pages":"Article 102429"},"PeriodicalIF":3.1,"publicationDate":"2024-09-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142167258","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-09-06DOI: 10.1016/j.jocs.2024.102426
Zeenat Zulfiqar , Saif U.R. Malik , Syed Atif Moqurrab , Zubair Zulfiqar , Usman Yaseen , Gautam Srivastava
<div><p>The presence of threats and anomalies in the Internet of Things infrastructure is a rising concern. Attacks, such as Denial of Service, User to Root, Probing, and Malicious operations can lead to the failure of an Internet of Things system. Traditional machine learning methods rely entirely on feature engineering availability to determine which data features will be considered by the model and contribute to its training and classification and “dimensionality” reduction techniques to find the most optimal correlation between data points that influence the outcome. The performance of the model mostly depends on the features that are used. This reliance on feature engineering and its effects on the model performance has been demonstrated from the perspective of the Internet of Things intrusion detection system. Unfortunately, given the risks associated with the Internet of Things intrusion, feature selection considerations are quite complicated due to the subjective complexity. Each feature has its benefits and drawbacks depending on which features are selected. Deep structured learning is a subcategory of machine learning. It realizes features inevitably out of raw data as it has a deep structure that contains multiple hidden layers. However, deep learning models such as recurrent neural networks can capture arbitrary-length dependencies, which are difficult to handle and train. However, it is suffering from exploiting and vanishing gradient problems. On the other hand, the log-cosh conditional variational Autoencoder ignores the detection of the multiple class classification problem, and it has a high level of false alarms and a not high detection accuracy. Moreover, the Autoencoder ignores to detect multi-class classification. Furthermore, there is evidence that a single convolutional neural network cannot fully exploit the rich information in network traffic. To deal with the challenges, this research proposed a novel approach for network anomaly detection. The proposed model consists of multiple convolutional neural networks, gate-recurrent units, and a bi-directional-long-short-term memory network. The proposed model employs multiple convolution neural networks to grasp spatial features from the spatial dimension through network traffic. Furthermore, gate recurrent units overwhelm the problem of gradient disappearing- and effectively capture the correlation between the features. In addition, the bi-directional-long short-term memory network approach was used. This layer benefits from preserving the historical context for a long time and extracting temporal features from backward and forward network traffic data. The proposed hybrid model improves network traffic’s accuracy and detection rate while lowering the false positive rate. The proposed model is evaluated and tested on the intrusion detection benchmark NSL-KDD dataset. Our proposed model outperforms other methods, as evidenced by the experimental results. The overall accuracy of
{"title":"DeepDetect: An innovative hybrid deep learning framework for anomaly detection in IoT networks","authors":"Zeenat Zulfiqar , Saif U.R. Malik , Syed Atif Moqurrab , Zubair Zulfiqar , Usman Yaseen , Gautam Srivastava","doi":"10.1016/j.jocs.2024.102426","DOIUrl":"10.1016/j.jocs.2024.102426","url":null,"abstract":"<div><p>The presence of threats and anomalies in the Internet of Things infrastructure is a rising concern. Attacks, such as Denial of Service, User to Root, Probing, and Malicious operations can lead to the failure of an Internet of Things system. Traditional machine learning methods rely entirely on feature engineering availability to determine which data features will be considered by the model and contribute to its training and classification and “dimensionality” reduction techniques to find the most optimal correlation between data points that influence the outcome. The performance of the model mostly depends on the features that are used. This reliance on feature engineering and its effects on the model performance has been demonstrated from the perspective of the Internet of Things intrusion detection system. Unfortunately, given the risks associated with the Internet of Things intrusion, feature selection considerations are quite complicated due to the subjective complexity. Each feature has its benefits and drawbacks depending on which features are selected. Deep structured learning is a subcategory of machine learning. It realizes features inevitably out of raw data as it has a deep structure that contains multiple hidden layers. However, deep learning models such as recurrent neural networks can capture arbitrary-length dependencies, which are difficult to handle and train. However, it is suffering from exploiting and vanishing gradient problems. On the other hand, the log-cosh conditional variational Autoencoder ignores the detection of the multiple class classification problem, and it has a high level of false alarms and a not high detection accuracy. Moreover, the Autoencoder ignores to detect multi-class classification. Furthermore, there is evidence that a single convolutional neural network cannot fully exploit the rich information in network traffic. To deal with the challenges, this research proposed a novel approach for network anomaly detection. The proposed model consists of multiple convolutional neural networks, gate-recurrent units, and a bi-directional-long-short-term memory network. The proposed model employs multiple convolution neural networks to grasp spatial features from the spatial dimension through network traffic. Furthermore, gate recurrent units overwhelm the problem of gradient disappearing- and effectively capture the correlation between the features. In addition, the bi-directional-long short-term memory network approach was used. This layer benefits from preserving the historical context for a long time and extracting temporal features from backward and forward network traffic data. The proposed hybrid model improves network traffic’s accuracy and detection rate while lowering the false positive rate. The proposed model is evaluated and tested on the intrusion detection benchmark NSL-KDD dataset. Our proposed model outperforms other methods, as evidenced by the experimental results. The overall accuracy of","PeriodicalId":48907,"journal":{"name":"Journal of Computational Science","volume":"83 ","pages":"Article 102426"},"PeriodicalIF":3.1,"publicationDate":"2024-09-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S1877750324002199/pdfft?md5=499c056a20080f0138b115130d2376c9&pid=1-s2.0-S1877750324002199-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142149749","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-09-04DOI: 10.1016/j.jocs.2024.102435
K. Vogiatzoglou , C. Papadimitriou , K. Ampountolas , M. Chatzimanolakis , P. Koumoutsakos , V. Bontozoglou
Forest fires are a key component of natural ecosystems, but their increased frequency and intensity have devastating social, economic, and environmental implications. Thus, there is a great need for trustworthy digital tools capable of providing real-time estimates of fire evolution and human interventions. This work develops an interpretable, physics-based model that will serve as the core of a broader wildfire prediction tool. The modeling approach involves a simplified description of combustion kinetics and thermal energy transfer (averaged over local plantation height) and leads to a computationally inexpensive system of differential equations that provides the spatiotemporal evolution of the two-dimensional fields of temperature and combustibles. Key aspects of the model include the estimation of mean wind velocity through the plantation and the inclusion of the effect of ground inclination. Predictions are successfully compared to benchmark literature results concerning the effect of flammable bulk density, moisture content, and the combined influence of wind and slope. Simulations appear to provide qualitatively correct descriptions of firefront propagation from a localized ignition site in a homogeneous or heterogeneous canopy, of acceleration resulting from the collision of oblique firelines, and of firefront overshoot or arrest at fuel break zones.
{"title":"An interpretable wildfire spreading model for real-time predictions","authors":"K. Vogiatzoglou , C. Papadimitriou , K. Ampountolas , M. Chatzimanolakis , P. Koumoutsakos , V. Bontozoglou","doi":"10.1016/j.jocs.2024.102435","DOIUrl":"10.1016/j.jocs.2024.102435","url":null,"abstract":"<div><p>Forest fires are a key component of natural ecosystems, but their increased frequency and intensity have devastating social, economic, and environmental implications. Thus, there is a great need for trustworthy digital tools capable of providing real-time estimates of fire evolution and human interventions. This work develops an interpretable, physics-based model that will serve as the core of a broader wildfire prediction tool. The modeling approach involves a simplified description of combustion kinetics and thermal energy transfer (averaged over local plantation height) and leads to a computationally inexpensive system of differential equations that provides the spatiotemporal evolution of the two-dimensional fields of temperature and combustibles. Key aspects of the model include the estimation of mean wind velocity through the plantation and the inclusion of the effect of ground inclination. Predictions are successfully compared to benchmark literature results concerning the effect of flammable bulk density, moisture content, and the combined influence of wind and slope. Simulations appear to provide qualitatively correct descriptions of firefront propagation from a localized ignition site in a homogeneous or heterogeneous canopy, of acceleration resulting from the collision of oblique firelines, and of firefront overshoot or arrest at fuel break zones.</p></div>","PeriodicalId":48907,"journal":{"name":"Journal of Computational Science","volume":"83 ","pages":"Article 102435"},"PeriodicalIF":3.1,"publicationDate":"2024-09-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142149748","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-09-03DOI: 10.1016/j.jocs.2024.102427
Jiajue He, Wei Xiong
In the cloud, users need to connect to the data server to perform the file transmission via the Internet, and the Server transmits data to many servers. A machine or vehicle that can fly with the assistance of the air is known as an Aircraft. As an alternative to the downward thrust of jet engines, it uses either static lift or an airfoil's dynamic lift to combat gravity's pull. Drawing wall panel measurement points in the model is easy using the Aircraft Wall Panels (AWP) button. Draw wall panels between existing nodes or on the drawing grid using the relevant wall panel specifications. The technique intends to discover and extract information about undesirable defects such as dents, protrusions, or scratches based on local surface attributes gathered from a 3D scanner. Defects from a perfectly smooth surface include indentations and bumps on the surface. An image's features may be extracted by reducing the number of pixels in the picture to a manageable size so that the most exciting sections of the image can be recorded with Surface Feature Extraction (SFE). Some of the problems are the threat of drones and composite materials that do not break easily in oxymoronic. The aircraft's inner structure may have been damaged, although this is impossible to determine. A runway incursion severely threatens aviation safety because of the rise in aircraft movement on the airport surface and other human factors. An electronic moving map of airport runways and taxiways is shown to the pilot through a head-up display in the cockpit's head-down position. A practical feature extraction approach is required to ensure the safety of the airport scene in runway incursion prevention systems. All the drawbacks are rectified by AWP-SFE sensors installed along the runway centerline to detect magnetic signals generated by surface-moving targets, and this information is utilized to compute the target's length. The target length may extract peak features after regularizing the time domain data. Differentiation of target characteristics is used to determine the similarities between distinct targets. The suggested method's signal characteristics are more easily recognized than time domain or frequency domain feature methods. The experimental results show the proposed method AWP-SE to achieve a high-efficiency ratio of 88.2 %, activity ratio of 73.3 %, Analysis of aircraft in wall plane measurement point of 87.8 % and an error rate of 32.3 % compared to other methods.
{"title":"Surface feature extraction method for cloud data of aircraft wall panel measurement points","authors":"Jiajue He, Wei Xiong","doi":"10.1016/j.jocs.2024.102427","DOIUrl":"10.1016/j.jocs.2024.102427","url":null,"abstract":"<div><p>In the cloud, users need to connect to the data server to perform the file transmission via the Internet, and the Server transmits data to many servers. A machine or vehicle that can fly with the assistance of the air is known as an Aircraft. As an alternative to the downward thrust of jet engines, it uses either static lift or an airfoil's dynamic lift to combat gravity's pull. Drawing wall panel measurement points in the model is easy using the Aircraft Wall Panels (AWP) button. Draw wall panels between existing nodes or on the drawing grid using the relevant wall panel specifications. The technique intends to discover and extract information about undesirable defects such as dents, protrusions, or scratches based on local surface attributes gathered from a 3D scanner. Defects from a perfectly smooth surface include indentations and bumps on the surface. An image's features may be extracted by reducing the number of pixels in the picture to a manageable size so that the most exciting sections of the image can be recorded with Surface Feature Extraction (SFE). Some of the problems are the threat of drones and composite materials that do not break easily in oxymoronic. The aircraft's inner structure may have been damaged, although this is impossible to determine. A runway incursion severely threatens aviation safety because of the rise in aircraft movement on the airport surface and other human factors. An electronic moving map of airport runways and taxiways is shown to the pilot through a head-up display in the cockpit's head-down position. A practical feature extraction approach is required to ensure the safety of the airport scene in runway incursion prevention systems. All the drawbacks are rectified by AWP-SFE sensors installed along the runway centerline to detect magnetic signals generated by surface-moving targets, and this information is utilized to compute the target's length. The target length may extract peak features after regularizing the time domain data. Differentiation of target characteristics is used to determine the similarities between distinct targets. The suggested method's signal characteristics are more easily recognized than time domain or frequency domain feature methods. The experimental results show the proposed method AWP-SE to achieve a high-efficiency ratio of 88.2 %, activity ratio of 73.3 %, Analysis of aircraft in wall plane measurement point of 87.8 % and an error rate of 32.3 % compared to other methods.</p></div>","PeriodicalId":48907,"journal":{"name":"Journal of Computational Science","volume":"83 ","pages":"Article 102427"},"PeriodicalIF":3.1,"publicationDate":"2024-09-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142149750","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-09-02DOI: 10.1016/j.jocs.2024.102430
Eurico Ruivo , Kévin Perrot , Pedro Paulo Balbi , Pacôme Perrotin
A large number of research efforts have been made in trying to solve global decision problems with cellular automata by means of their cells reaching a distributed consensus via their local action. Among them, the determination of the most frequent state in configurations with arbitrary size, i.e., the density classification task, has been the most widely approached benchmark problem. The literature abounds with cases demonstrating that, depending on how it is formulated, a solution can be shown to exist or not. Here we address the problem in terms of deterministic, block-sequential asynchronous updates, over cyclic configurations, by which the possibility of a solution remains open. Our main results are negative in terms of the possibility of solving the problem with such formulation, encompassing the cases of any cellular automaton with any sequential update, and any elementary cellular automaton with any block-sequential update; furthermore, we uncover some properties that any potential solution with block-sequential update should have in order for it to be a candidate to solving the problem. Incidentally, we also give a new, very simple proof of the impossibility of solving the problem with any synchronous rule.
{"title":"Negative results on density determination with one-dimensional cellular automata with block-sequential asynchronous updates","authors":"Eurico Ruivo , Kévin Perrot , Pedro Paulo Balbi , Pacôme Perrotin","doi":"10.1016/j.jocs.2024.102430","DOIUrl":"10.1016/j.jocs.2024.102430","url":null,"abstract":"<div><p>A large number of research efforts have been made in trying to solve global decision problems with cellular automata by means of their cells reaching a distributed consensus via their local action. Among them, the determination of the most frequent state in configurations with arbitrary size, i.e., the density classification task, has been the most widely approached benchmark problem. The literature abounds with cases demonstrating that, depending on how it is formulated, a solution can be shown to exist or not. Here we address the problem in terms of deterministic, block-sequential asynchronous updates, over cyclic configurations, by which the possibility of a solution remains open. Our main results are negative in terms of the possibility of solving the problem with such formulation, encompassing the cases of any cellular automaton with any sequential update, and any elementary cellular automaton with any block-sequential update; furthermore, we uncover some properties that any potential solution with block-sequential update should have in order for it to be a candidate to solving the problem. Incidentally, we also give a new, very simple proof of the impossibility of solving the problem with any synchronous rule.</p></div>","PeriodicalId":48907,"journal":{"name":"Journal of Computational Science","volume":"82 ","pages":"Article 102430"},"PeriodicalIF":3.1,"publicationDate":"2024-09-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142136621","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}
Pub Date : 2024-08-30DOI: 10.1016/j.jocs.2024.102425
Miroslav Vořechovský , Adam Ciszkiewicz
Creating valid and trustworthy models is a key issue in biomedical engineering that affects the quality of life of both patients and healthy individuals in various scientific and industrial domains. This however is a difficult task due to the complex nature of biomechanical joints. In this study, a sampling strategy combining Genetic Algorithm and clustering is proposed to investigate biomechanical joints. A computational model of a human ankle joint with 43 input parameters serves as an illustrative case for the procedure. The Genetic Algorithm is used to efficiently search for distinct variants of the model with similar output, while clustering helps to quantify the obtained results. The search is performed in a close vicinity to the original model, mimicking subjective decisions in parameter acquisition. The method reveals twelve distinct clusters in the model parameter set, all resulting in the same angular displacements. These clusters correspond to three unique internal load states for the model, confirming the complex nature of the ankle. The proposed approach is general and could be applied to study other models in mechanical engineering and robotics.
{"title":"Advanced sampling discovers apparently similar ankle models with distinct internal load states under minimal parameter modification","authors":"Miroslav Vořechovský , Adam Ciszkiewicz","doi":"10.1016/j.jocs.2024.102425","DOIUrl":"10.1016/j.jocs.2024.102425","url":null,"abstract":"<div><p>Creating valid and trustworthy models is a key issue in biomedical engineering that affects the quality of life of both patients and healthy individuals in various scientific and industrial domains. This however is a difficult task due to the complex nature of biomechanical joints. In this study, a sampling strategy combining Genetic Algorithm and clustering is proposed to investigate biomechanical joints. A computational model of a human ankle joint with 43 input parameters serves as an illustrative case for the procedure. The Genetic Algorithm is used to efficiently search for distinct variants of the model with similar output, while clustering helps to quantify the obtained results. The search is performed in a close vicinity to the original model, mimicking subjective decisions in parameter acquisition. The method reveals twelve distinct clusters in the model parameter set, all resulting in the same angular displacements. These clusters correspond to three unique internal load states for the model, confirming the complex nature of the ankle. The proposed approach is general and could be applied to study other models in mechanical engineering and robotics.</p></div>","PeriodicalId":48907,"journal":{"name":"Journal of Computational Science","volume":"82 ","pages":"Article 102425"},"PeriodicalIF":3.1,"publicationDate":"2024-08-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142122718","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}
Pub Date : 2024-08-30DOI: 10.1016/j.jocs.2024.102433
Jun Zhou, Hongbin Chen
It is known that the solution of the Dirichlet fractional Laplacian in a bounded domain exhibits singular behavior near the boundary. Consequently, numerical discretizations on quasi-uniform meshes lead to low accuracy and nonphysical solutions. We adopt a finite element discretization on locally refined composite meshes, which consist in a combination of graded meshes near the singularity and uniform meshes where the solution is smooth. We also provide a reference strategy on parameter selection of locally refined composite meshes. Numerical tests confirm that finite element method on locally refined composite meshes has higher accuracy than uniform meshes, but the computational cost is less than that of graded meshes. Our method is applied to discrete the fractional-in-space Allen–Cahn equation and the fractional Burgers equation with Dirichlet fractional Laplacian, some new observations are discovered from our numerical results.
{"title":"Finite Element Method on locally refined composite meshes for Dirichlet fractional Laplacian","authors":"Jun Zhou, Hongbin Chen","doi":"10.1016/j.jocs.2024.102433","DOIUrl":"10.1016/j.jocs.2024.102433","url":null,"abstract":"<div><p>It is known that the solution of the Dirichlet fractional Laplacian in a bounded domain exhibits singular behavior near the boundary. Consequently, numerical discretizations on quasi-uniform meshes lead to low accuracy and nonphysical solutions. We adopt a finite element discretization on locally refined composite meshes, which consist in a combination of graded meshes near the singularity and uniform meshes where the solution is smooth. We also provide a reference strategy on parameter selection of locally refined composite meshes. Numerical tests confirm that finite element method on locally refined composite meshes has higher accuracy than uniform meshes, but the computational cost is less than that of graded meshes. Our method is applied to discrete the fractional-in-space Allen–Cahn equation and the fractional Burgers equation with Dirichlet fractional Laplacian, some new observations are discovered from our numerical results.</p></div>","PeriodicalId":48907,"journal":{"name":"Journal of Computational Science","volume":"82 ","pages":"Article 102433"},"PeriodicalIF":3.1,"publicationDate":"2024-08-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142098935","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}
Pub Date : 2024-08-30DOI: 10.1016/j.jocs.2024.102434
Ilham Asmouh, Alexander Ostermann
Nonlinear diffusion–reaction systems model a multitude of physical phenomena. A common situation is biological development modeling where such systems have been widely used to study spatiotemporal phenomena in cell biology. Systems of coupled diffusion–reaction equations are usually subject to some complicated features directly related to their multiphysics nature. Moreover, the presence of advection is source of numerical instabilities, in general, and adds another challenge to these systems. In this study, we propose a NURBS-based isogeometric analysis (IgA) combined with a second-order Strang operator splitting to deal with the multiphysics nature of the problem. The advection part is treated in a semi-Lagrangian framework and the resulting diffusion–reaction equations are then solved using an efficient time-stepping algorithm based on operator splitting. The accuracy of the method is studied by means of a advection–diffusion–reaction system with analytical solution. To further examine the performance of the new method on geometries more general than rectangles (e.g., L-shaped domains and parts of annuli), the well-known Schnakenberg–Turing problem is considered with and without advection. Finally, a Gray–Scott system on a circular domain is also presented. The results obtained demonstrate the efficiency of our new algorithm to accurately reproduce the solution in the presence of complex patterns on more complicated geometries. Moreover, the new method clarifies the effect of geometry on Turing patterns.
非线性扩散反应系统可以模拟多种物理现象。一个常见的情况是生物发育建模,这类系统被广泛用于研究细胞生物学中的时空现象。耦合扩散-反应方程系统通常具有一些与其多物理特性直接相关的复杂特征。此外,平流的存在通常是数值不稳定性的来源,也给这些系统增加了另一个挑战。在本研究中,我们提出了一种基于 NURBS 的等几何分析 (IgA),并结合二阶斯特朗算子拆分来处理问题的多物理特性。平流部分在半拉格朗日框架下处理,然后使用基于算子拆分的高效时间步进算法求解扩散-反应方程。通过分析求解的平流-扩散-反应系统,研究了该方法的准确性。为了进一步检验新方法在比矩形更一般的几何图形(如 L 形域和环形的一部分)上的性能,研究了有无平流的著名 Schnakenberg-Turing 问题。最后,还介绍了圆形域上的格雷-斯科特系统。所获得的结果表明,我们的新算法能够在更复杂的几何图形上准确地重现复杂图案的解。此外,新方法还阐明了几何图形对图灵模式的影响。
{"title":"Highly efficient NURBS-based isogeometric analysis for coupled nonlinear diffusion–reaction equations with and without advection","authors":"Ilham Asmouh, Alexander Ostermann","doi":"10.1016/j.jocs.2024.102434","DOIUrl":"10.1016/j.jocs.2024.102434","url":null,"abstract":"<div><p>Nonlinear diffusion–reaction systems model a multitude of physical phenomena. A common situation is biological development modeling where such systems have been widely used to study spatiotemporal phenomena in cell biology. Systems of coupled diffusion–reaction equations are usually subject to some complicated features directly related to their multiphysics nature. Moreover, the presence of advection is source of numerical instabilities, in general, and adds another challenge to these systems. In this study, we propose a NURBS-based isogeometric analysis (IgA) combined with a second-order Strang operator splitting to deal with the multiphysics nature of the problem. The advection part is treated in a semi-Lagrangian framework and the resulting diffusion–reaction equations are then solved using an efficient time-stepping algorithm based on operator splitting. The accuracy of the method is studied by means of a advection–diffusion–reaction system with analytical solution. To further examine the performance of the new method on geometries more general than rectangles (e.g., L-shaped domains and parts of annuli), the well-known Schnakenberg–Turing problem is considered with and without advection. Finally, a Gray–Scott system on a circular domain is also presented. The results obtained demonstrate the efficiency of our new algorithm to accurately reproduce the solution in the presence of complex patterns on more complicated geometries. Moreover, the new method clarifies the effect of geometry on Turing patterns.</p></div>","PeriodicalId":48907,"journal":{"name":"Journal of Computational Science","volume":"83 ","pages":"Article 102434"},"PeriodicalIF":3.1,"publicationDate":"2024-08-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S1877750324002278/pdfft?md5=08cba31da5697d13b5d5ac89f8b16f40&pid=1-s2.0-S1877750324002278-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142149747","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}
Pub Date : 2024-08-30DOI: 10.1016/j.jocs.2024.102428
Pudhari Srilatha , K. Karthik , Koushik V. Prasad , Amal Abdulrahman , R.S. Varun Kumar , R.J. Punith Gowda , R. Naveen Kumar
The significance of chemical reaction with activation energy and convective boundary conditions on the fluid flow via an oscillatory stretchy surface in the presence of permeable media and radiation is analyzed in this study. This inspection presents Fourier and Fick's laws-based equations for heat, mass transport, and liquid flow through an oscillating stretchy sheet. Understanding these dynamics aids in the optimisation of catalytic reaction settings, where gradients greatly influence reaction rates in concentration and temperature. The governing differential equations of the current study are modelled and changed into their non-dimensional form by employing suitable similarity variables. The finite difference method (FDM) is also used to numerically solve the obtained dimensionless equations. The influence of many factors on the several profiles is portrayed with graphical representations. The outcome of the unsteadiness and porosity parameters on the velocity profile with time coordinate is depicted. The increase in the radiation parameter and Biot number upsurges the thermal profile. The temperature reduces as the unsteadiness parameter and temperature relaxation time parameter grow. The upsurge in the activation energy parameter intensifies the mass transport. The rise in concentration relaxation time parameter diminishes the concentration profile.
{"title":"Dynamics of Fourier's and Fick's laws on the convectively heated oscillatory sheet under Arrhenius kinetics: The finite-difference technique","authors":"Pudhari Srilatha , K. Karthik , Koushik V. Prasad , Amal Abdulrahman , R.S. Varun Kumar , R.J. Punith Gowda , R. Naveen Kumar","doi":"10.1016/j.jocs.2024.102428","DOIUrl":"10.1016/j.jocs.2024.102428","url":null,"abstract":"<div><p>The significance of chemical reaction with activation energy and convective boundary conditions on the fluid flow via an oscillatory stretchy surface in the presence of permeable media and radiation is analyzed in this study. This inspection presents Fourier and Fick's laws-based equations for heat, mass transport, and liquid flow through an oscillating stretchy sheet. Understanding these dynamics aids in the optimisation of catalytic reaction settings, where gradients greatly influence reaction rates in concentration and temperature. The governing differential equations of the current study are modelled and changed into their non-dimensional form by employing suitable similarity variables. The finite difference method (FDM) is also used to numerically solve the obtained dimensionless equations. The influence of many factors on the several profiles is portrayed with graphical representations. The outcome of the unsteadiness and porosity parameters on the velocity profile with time coordinate is depicted. The increase in the radiation parameter and Biot number upsurges the thermal profile. The temperature reduces as the unsteadiness parameter and temperature relaxation time parameter grow. The upsurge in the activation energy parameter intensifies the mass transport. The rise in concentration relaxation time parameter diminishes the concentration profile.</p></div>","PeriodicalId":48907,"journal":{"name":"Journal of Computational Science","volume":"82 ","pages":"Article 102428"},"PeriodicalIF":3.1,"publicationDate":"2024-08-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142129572","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}