Pub Date : 2022-12-01DOI: 10.1016/j.jcmds.2022.100064
Antonella Falini
The Singular Value Decomposition (SVD) is one of the most used factorizations when it comes to Data Science applications. In particular, given the big size of the processed matrices, in most of the cases, a truncated SVD algorithm is employed. In the following manuscript, we review some of the state-of-the-art approaches considered for the selection of the number of components (i.e., singular values) to retain to apply the truncated SVD. Moreover, three new approaches based on the Kullback–Leibler divergence and on unsupervised anomaly detection algorithms, are introduced. The revised methods are then compared on some standard benchmarks in the image processing context.
{"title":"A review on the selection criteria for the truncated SVD in Data Science applications","authors":"Antonella Falini","doi":"10.1016/j.jcmds.2022.100064","DOIUrl":"10.1016/j.jcmds.2022.100064","url":null,"abstract":"<div><p>The Singular Value Decomposition (SVD) is one of the most used factorizations when it comes to Data Science applications. In particular, given the big size of the processed matrices, in most of the cases, a truncated SVD algorithm is employed. In the following manuscript, we review some of the state-of-the-art approaches considered for the selection of the number of components (i.e., singular values) to retain to apply the truncated SVD. Moreover, three new approaches based on the Kullback–Leibler divergence and on unsupervised anomaly detection algorithms, are introduced. The revised methods are then compared on some standard benchmarks in the image processing context.</p></div>","PeriodicalId":100768,"journal":{"name":"Journal of Computational Mathematics and Data Science","volume":"5 ","pages":"Article 100064"},"PeriodicalIF":0.0,"publicationDate":"2022-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S2772415822000244/pdfft?md5=c82db1b06d3855b71bbc4c4f00794338&pid=1-s2.0-S2772415822000244-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86816951","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2022-12-01DOI: 10.1016/j.jcmds.2022.100062
O.A. Famakinwa, O.K. Koriko, K.S. Adegbie
In view of the dominant properties of hybrid nanofluid such as high thermal and electrical conductivity in addition to enhanced heat transfer rate, efforts had been strengthened by many researchers to upgrade the thermal behavior of the base fluid through different approaches. In this study, viscous dissipation and thermal radiation effects on unsteady incompressible squeezing flow conveying water hybrid nanoparticles between two aligned surfaces with variable viscosity is examined. The fluid model is transformed to ordinary differential equations by incorporating appropriate similarity transformation. The numerical simulation is carried out in MATLAB software package via shooting procedure coupled with order Runge–Kutta integration scheme. The limiting case is found to be in accord relative to the preceding reports. The outcomes of the scrutiny are unveiled in tables and graphs. It was revealed that the velocity and temperature augment with increasing viscosity variation and squeezing fluid parameters. Meanwhile, increasing viscous dissipation and thermal radiation parameters decrease the temperature distribution with no significant change in the fluid velocity.
{"title":"Effects of viscous dissipation and thermal radiation on time dependent incompressible squeezing flow of CuO−Al2O3/water hybrid nanofluid between two parallel plates with variable viscosity","authors":"O.A. Famakinwa, O.K. Koriko, K.S. Adegbie","doi":"10.1016/j.jcmds.2022.100062","DOIUrl":"10.1016/j.jcmds.2022.100062","url":null,"abstract":"<div><p>In view of the dominant properties of hybrid nanofluid such as high thermal and electrical conductivity in addition to enhanced heat transfer rate, efforts had been strengthened by many researchers to upgrade the thermal behavior of the base fluid through different approaches. In this study, viscous dissipation and thermal radiation effects on unsteady incompressible squeezing flow conveying <span><math><mrow><mi>C</mi><mi>u</mi><mi>O</mi><mo>−</mo><mi>A</mi><msub><mrow><mi>l</mi></mrow><mrow><mn>2</mn></mrow></msub><msub><mrow><mi>O</mi></mrow><mrow><mn>3</mn></mrow></msub><mo>/</mo></mrow></math></span>water hybrid nanoparticles between two aligned surfaces with variable viscosity is examined. The fluid model is transformed to ordinary differential equations by incorporating appropriate similarity transformation. The numerical simulation is carried out in MATLAB software package via shooting procedure coupled with <span><math><mrow><mn>4</mn><mi>t</mi><mi>h</mi></mrow></math></span> order Runge–Kutta integration scheme. The limiting case is found to be in accord relative to the preceding reports. The outcomes of the scrutiny are unveiled in tables and graphs. It was revealed that the velocity and temperature augment with increasing viscosity variation and squeezing fluid parameters. Meanwhile, increasing viscous dissipation and thermal radiation parameters decrease the temperature distribution with no significant change in the fluid velocity.</p></div>","PeriodicalId":100768,"journal":{"name":"Journal of Computational Mathematics and Data Science","volume":"5 ","pages":"Article 100062"},"PeriodicalIF":0.0,"publicationDate":"2022-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S2772415822000220/pdfft?md5=9424e5a9e389ee13b5970c55ab05f778&pid=1-s2.0-S2772415822000220-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87594959","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2022-08-01DOI: 10.1016/j.jcmds.2022.100050
Stefano De Marchi , Federico Lot , Francesco Marchetti , Davide Poggiali
In recent years, various kernels have been proposed in the context of persistent homology to deal with persistence diagrams in supervised learning approaches. In this paper, we consider the idea of variably scaled kernels, for approximating functions and data, and we interpret it in the framework of persistent homology. We call them Variably Scaled Persistence Kernels (VSPKs). These new kernels are then tested in different classification experiments. The obtained results show that they can improve the performance and the efficiency of existing standard kernels.
{"title":"Variably Scaled Persistence Kernels (VSPKs) for persistent homology applications","authors":"Stefano De Marchi , Federico Lot , Francesco Marchetti , Davide Poggiali","doi":"10.1016/j.jcmds.2022.100050","DOIUrl":"10.1016/j.jcmds.2022.100050","url":null,"abstract":"<div><p>In recent years, various kernels have been proposed in the context of <em>persistent homology</em> to deal with <em>persistence diagrams</em> in supervised learning approaches. In this paper, we consider the idea of variably scaled kernels, for approximating functions and data, and we interpret it in the framework of persistent homology. We call them <em>Variably Scaled Persistence Kernels (VSPKs)</em>. These new kernels are then tested in different classification experiments. The obtained results show that they can improve the performance and the efficiency of existing standard kernels.</p></div>","PeriodicalId":100768,"journal":{"name":"Journal of Computational Mathematics and Data Science","volume":"4 ","pages":"Article 100050"},"PeriodicalIF":0.0,"publicationDate":"2022-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S2772415822000153/pdfft?md5=2a0641fa2440016bd9baecb2f96d656e&pid=1-s2.0-S2772415822000153-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88294881","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2022-08-01DOI: 10.1016/j.jcmds.2022.100040
Davide Poggiali , Diego Cecchin , Stefano De Marchi
It is a common practice in multimodal medical imaging to undersample the anatomically-derived segmentation images to measure the mean activity of a co-acquired functional image. This practice avoids the resampling-related Gibbs effect that would occur in oversampling the functional image. As sides effect, waste of time and efforts are produced since the anatomical segmentation at full resolution is performed in many hours of computations or manual work. In this work we explain the commonly-used resampling methods and give errors bound in the cases of continuous and discontinuous signals. Then we propose a Fake Nodes scheme for image resampling designed to reduce the Gibbs effect when oversampling the functional image. This new approach is compared to the traditional counterpart in two significant experiments, both showing that Fake Nodes resampling gives smaller errors at the cost of an higher computational time.
{"title":"Reducing the Gibbs effect in multimodal medical imaging by the Fake Nodes approach","authors":"Davide Poggiali , Diego Cecchin , Stefano De Marchi","doi":"10.1016/j.jcmds.2022.100040","DOIUrl":"10.1016/j.jcmds.2022.100040","url":null,"abstract":"<div><p>It is a common practice in multimodal medical imaging to undersample the anatomically-derived segmentation images to measure the mean activity of a co-acquired functional image. This practice avoids the resampling-related Gibbs effect that would occur in oversampling the functional image. As sides effect, waste of time and efforts are produced since the anatomical segmentation at full resolution is performed in many hours of computations or manual work. In this work we explain the commonly-used resampling methods and give errors bound in the cases of continuous and discontinuous signals. Then we propose a Fake Nodes scheme for image resampling designed to reduce the Gibbs effect when oversampling the functional image. This new approach is compared to the traditional counterpart in two significant experiments, both showing that Fake Nodes resampling gives smaller errors at the cost of an higher computational time.</p></div>","PeriodicalId":100768,"journal":{"name":"Journal of Computational Mathematics and Data Science","volume":"4 ","pages":"Article 100040"},"PeriodicalIF":0.0,"publicationDate":"2022-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S2772415822000104/pdfft?md5=7a8ef02a33b4c573231207bd94e4a5db&pid=1-s2.0-S2772415822000104-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75582469","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2022-08-01DOI: 10.1016/j.jcmds.2022.100054
Carmina Fjellström, Kaj Nyström
Stochastic gradient descent (SGD) is widely used in deep learning due to its computational efficiency, but a complete understanding of why SGD performs so well remains a major challenge. It has been observed empirically that most eigenvalues of the Hessian of the loss functions on the loss landscape of over-parametrized deep neural networks are close to zero, while only a small number of eigenvalues are large. Zero eigenvalues indicate zero diffusion along the corresponding directions. This indicates that the process of minima selection mainly happens in the relatively low-dimensional subspace corresponding to the top eigenvalues of the Hessian. Although the parameter space is very high-dimensional, these findings seems to indicate that the SGD dynamics may mainly live on a low-dimensional manifold. In this paper, we pursue a truly data driven approach to the problem of getting a potentially deeper understanding of the high-dimensional parameter surface, and in particular, of the landscape traced out by SGD by analyzing the data generated through SGD, or any other optimizer for that matter, in order to possibly discover (local) low-dimensional representations of the optimization landscape. As our vehicle for the exploration, we use diffusion maps introduced by R. Coifman and coauthors.
{"title":"Deep learning, stochastic gradient descent and diffusion maps","authors":"Carmina Fjellström, Kaj Nyström","doi":"10.1016/j.jcmds.2022.100054","DOIUrl":"https://doi.org/10.1016/j.jcmds.2022.100054","url":null,"abstract":"<div><p>Stochastic gradient descent (SGD) is widely used in deep learning due to its computational efficiency, but a complete understanding of why SGD performs so well remains a major challenge. It has been observed empirically that most eigenvalues of the Hessian of the loss functions on the loss landscape of over-parametrized deep neural networks are close to zero, while only a small number of eigenvalues are large. Zero eigenvalues indicate zero diffusion along the corresponding directions. This indicates that the process of minima selection mainly happens in the relatively low-dimensional subspace corresponding to the top eigenvalues of the Hessian. Although the parameter space is very high-dimensional, these findings seems to indicate that the SGD dynamics may mainly live on a low-dimensional manifold. In this paper, we pursue a truly data driven approach to the problem of getting a potentially deeper understanding of the high-dimensional parameter surface, and in particular, of the landscape traced out by SGD by analyzing the data generated through SGD, or any other optimizer for that matter, in order to possibly discover (local) low-dimensional representations of the optimization landscape. As our vehicle for the exploration, we use diffusion maps introduced by R. Coifman and coauthors.</p></div>","PeriodicalId":100768,"journal":{"name":"Journal of Computational Mathematics and Data Science","volume":"4 ","pages":"Article 100054"},"PeriodicalIF":0.0,"publicationDate":"2022-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S2772415822000177/pdfft?md5=38c0dff05f24faf5b0990bd6aa9fd984&pid=1-s2.0-S2772415822000177-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"137407104","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2022-08-01DOI: 10.1016/j.jcmds.2022.100046
Di Chang , Liang Ding , Russell Malmberg , David Robinson , Matthew Wicker , Hongfei Yan , Aaron Martinez , Liming Cai
The seminal work of Chow and Liu (1968) shows that approximation of a finite probabilistic system by Markov trees can achieve the minimum information loss with the topology of a maximum spanning tree. Our current paper generalizes the result to Markov networks of tree-width , for every fixed . In particular, we prove that approximation of a finite probabilistic system with such Markov networks has the minimum information loss when the network topology is achieved with a maximum spanning -tree. While constructing a maximum spanning -tree is intractable for even , we show that polynomial algorithms can be ensured by a sufficient condition accommodated by many meaningful applications. In particular, we show an efficient algorithm for learning the optimal topology of higher order correlations among random variables that belong to an underlying linear structure. As an application, we demonstrate effectiveness of this efficient algorithm applied to biomolecular 3D structure prediction.
{"title":"Optimal learning of Markov k-tree topology","authors":"Di Chang , Liang Ding , Russell Malmberg , David Robinson , Matthew Wicker , Hongfei Yan , Aaron Martinez , Liming Cai","doi":"10.1016/j.jcmds.2022.100046","DOIUrl":"10.1016/j.jcmds.2022.100046","url":null,"abstract":"<div><p>The seminal work of Chow and Liu (1968) shows that approximation of a finite probabilistic system by Markov trees can achieve the minimum information loss with the topology of a maximum spanning tree. Our current paper generalizes the result to Markov networks of tree-width <span><math><mrow><mo>≤</mo><mi>k</mi></mrow></math></span>, for every fixed <span><math><mrow><mi>k</mi><mo>≥</mo><mn>2</mn></mrow></math></span>. In particular, we prove that approximation of a finite probabilistic system with such Markov networks has the minimum information loss when the network topology is achieved with a maximum spanning <span><math><mi>k</mi></math></span>-tree. While constructing a maximum spanning <span><math><mi>k</mi></math></span>-tree is intractable for even <span><math><mrow><mi>k</mi><mo>=</mo><mn>2</mn></mrow></math></span>, we show that polynomial algorithms can be ensured by a sufficient condition accommodated by many meaningful applications. In particular, we show an efficient algorithm for learning the optimal topology of higher order correlations among random variables that belong to an underlying linear structure. As an application, we demonstrate effectiveness of this efficient algorithm applied to biomolecular 3D structure prediction.</p></div>","PeriodicalId":100768,"journal":{"name":"Journal of Computational Mathematics and Data Science","volume":"4 ","pages":"Article 100046"},"PeriodicalIF":0.0,"publicationDate":"2022-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S277241582200013X/pdfft?md5=aad4f1525f5d10d5657975c4606226da&pid=1-s2.0-S277241582200013X-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77532056","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2022-08-01DOI: 10.1016/j.jcmds.2022.100056
Elizabeth Hunter, John D. Kelleher
Equation-based and agent-based models are popular methods in understanding disease dynamics. Although there are many types of equation-based models, the most common is the SIR compartmental model that assumes homogeneous mixing and populations. One way to understand the effects of these assumptions is by agentization. Equation-based models can be agentized by creating a simple agent-based model that replicates the results of the equation-based model, then by adding complexity to these agentized models it is possible to break the assumptions of homogeneous mixing and populations and test how breaking these assumptions results in different outputs. We report a set of experiments comparing the outputs of an SEIR model and a set of agent-based models of varying levels of complexity, using as a case study a measles outbreak in a town in Ireland. We define and use a six level complexity hierarchy for agent-based models to create a set of progressively more complex variants of an agentized SEIR model for the spread of infectious disease. We then compare the results of the agent-based model at each level of complexity with results of the SEIR model to determine when the agentization breaks. Our analysis shows this occurs on the fourth step of complexity, when scheduled movements are added into the model. When agents networks and behaviours are complex the peak of the outbreak is shifted to the right and is lower than in the SEIR model suggesting that heterogeneous populations and mixing patterns lead to slower outbreaks compared homogeneous populations and mixing patterns.
{"title":"Understanding the assumptions of an SEIR compartmental model using agentization and a complexity hierarchy","authors":"Elizabeth Hunter, John D. Kelleher","doi":"10.1016/j.jcmds.2022.100056","DOIUrl":"10.1016/j.jcmds.2022.100056","url":null,"abstract":"<div><p>Equation-based and agent-based models are popular methods in understanding disease dynamics. Although there are many types of equation-based models, the most common is the SIR compartmental model that assumes homogeneous mixing and populations. One way to understand the effects of these assumptions is by agentization. Equation-based models can be agentized by creating a simple agent-based model that replicates the results of the equation-based model, then by adding complexity to these agentized models it is possible to break the assumptions of homogeneous mixing and populations and test how breaking these assumptions results in different outputs. We report a set of experiments comparing the outputs of an SEIR model and a set of agent-based models of varying levels of complexity, using as a case study a measles outbreak in a town in Ireland. We define and use a six level complexity hierarchy for agent-based models to create a set of progressively more complex variants of an agentized SEIR model for the spread of infectious disease. We then compare the results of the agent-based model at each level of complexity with results of the SEIR model to determine when the agentization breaks. Our analysis shows this occurs on the fourth step of complexity, when scheduled movements are added into the model. When agents networks and behaviours are complex the peak of the outbreak is shifted to the right and is lower than in the SEIR model suggesting that heterogeneous populations and mixing patterns lead to slower outbreaks compared homogeneous populations and mixing patterns.</p></div>","PeriodicalId":100768,"journal":{"name":"Journal of Computational Mathematics and Data Science","volume":"4 ","pages":"Article 100056"},"PeriodicalIF":0.0,"publicationDate":"2022-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S2772415822000189/pdfft?md5=8f941ae4468af0fee67c94e73183f140&pid=1-s2.0-S2772415822000189-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77558484","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2022-08-01DOI: 10.1016/j.jcmds.2022.100048
Rajib Biswas , Md. Shahadat Hossain , Rafiqul Islam , Sarder Firoz Ahmmed , S.R. Mishra , Mohammad Afikuzzaman
The present analysis reports a computational study of Magnetohydrodynamic (MHD) flow behaviour of 2D Maxwell nanofluid across a stretched sheet in appearance of Brownian motion. The substantial term thermal radiation and chemical reactions have been employed extensively in the current research. Nanofluids are usually chosen by researchers because of their rheological properties, which are important in determining their appropriateness for convective heat transfer. The present research reveals that the fluid velocity augments for the enhanced values of all the parameters. Heat source, as well as the radiation parameters, ensure that there is enough heat in the fluid, which implies escalation of the thermal boundary layer thickness by accruing radiation parameter. Moreover, streamlines and isotherms have been investigated for the different parametric values. The suggested model is valuable because it has a wide range of applications in domains including medical sciences (treatment of cancer therapeutics), microelectronics, biomedicine, biology, and industrial production processes.
{"title":"Computational treatment of MHD Maxwell nanofluid flow across a stretching sheet considering higher-order chemical reaction and thermal radiation","authors":"Rajib Biswas , Md. Shahadat Hossain , Rafiqul Islam , Sarder Firoz Ahmmed , S.R. Mishra , Mohammad Afikuzzaman","doi":"10.1016/j.jcmds.2022.100048","DOIUrl":"10.1016/j.jcmds.2022.100048","url":null,"abstract":"<div><p>The present analysis reports a computational study of Magnetohydrodynamic (MHD) flow behaviour of 2D Maxwell nanofluid across a stretched sheet in appearance of Brownian motion. The substantial term thermal radiation and chemical reactions have been employed extensively in the current research. Nanofluids are usually chosen by researchers because of their rheological properties, which are important in determining their appropriateness for convective heat transfer. The present research reveals that the fluid velocity augments for the enhanced values of all the parameters. Heat source, as well as the radiation parameters, ensure that there is enough heat in the fluid, which implies escalation of the thermal boundary layer thickness by accruing radiation parameter. Moreover, streamlines and isotherms have been investigated for the different parametric values. The suggested model is valuable because it has a wide range of applications in domains including medical sciences (treatment of cancer therapeutics), microelectronics, biomedicine, biology, and industrial production processes.</p></div>","PeriodicalId":100768,"journal":{"name":"Journal of Computational Mathematics and Data Science","volume":"4 ","pages":"Article 100048"},"PeriodicalIF":0.0,"publicationDate":"2022-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S2772415822000141/pdfft?md5=901981bc7e4956837055a6b712d8d47e&pid=1-s2.0-S2772415822000141-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88860933","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
The current investigation is to examine the compound impact of electromagnetic induced force and internal heat source on a tangent hyperbolic fluid in quadratic Boussinesq approximation. The current hyperbolic tangent liquid flow and heat transport formulation model adequately predicts and characterizes the shear-stricken event. The nonlinear dimensionless heat transfer flow equations are solved completely using weighted residual solution procedures coupled with Galerkin approximation integration approach. The results in the table and graphs revealed that the magnetic field strength has a substantial impact on the fluid flow and heat propagation, as well as the internal heat source. Therefore, the entropy generation is optimized through an enhanced thermodynamic equilibrium and adequate control of heat generating terms and energy loss.
{"title":"Thermodynamic analysis of a tangent hyperbolic hydromagnetic heat generating fluid in quadratic Boussinesq approximation","authors":"A.R. Hassan , S.O. Salawu , A.B. Disu , O.R. Aderele","doi":"10.1016/j.jcmds.2022.100058","DOIUrl":"10.1016/j.jcmds.2022.100058","url":null,"abstract":"<div><p>The current investigation is to examine the compound impact of electromagnetic induced force and internal heat source on a tangent hyperbolic fluid in quadratic Boussinesq approximation. The current hyperbolic tangent liquid flow and heat transport formulation model adequately predicts and characterizes the shear-stricken event. The nonlinear dimensionless heat transfer flow equations are solved completely using weighted residual solution procedures coupled with Galerkin approximation integration approach. The results in the table and graphs revealed that the magnetic field strength has a substantial impact on the fluid flow and heat propagation, as well as the internal heat source. Therefore, the entropy generation is optimized through an enhanced thermodynamic equilibrium and adequate control of heat generating terms and energy loss.</p></div>","PeriodicalId":100768,"journal":{"name":"Journal of Computational Mathematics and Data Science","volume":"4 ","pages":"Article 100058"},"PeriodicalIF":0.0,"publicationDate":"2022-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S2772415822000190/pdfft?md5=8078865678a19d4ad4b600d103f6351a&pid=1-s2.0-S2772415822000190-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88840844","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2022-08-01DOI: 10.1016/j.jcmds.2022.100052
Pierluigi Amodio , Marcello De Giosa , Felice Iavernaro , Roberto La Scala , Arcangelo Labianca , Monica Lazzo , Francesca Mazzia , Lorenzo Pisani
A point cloud describing a railway environment is considered in a case study aimed at presenting a workflow for the automatic detection of external objects that, coming too close to the railway infrastructure, may cause potential risks for its correct functioning. The approach combines classical semantic segmentation methodologies with a novel geometric and numerical procedure to define a region of interest, consisting of a lower tube enveloping the 3D space occupied by the train during its transit and an upper tube enclosing the overhead contact lines. One useful application could be automatic vegetation monitoring in the proximity of the railway structure, which would help with planning maintenance pruning activities.
{"title":"Detection of anomalies in the proximity of a railway line: A case study","authors":"Pierluigi Amodio , Marcello De Giosa , Felice Iavernaro , Roberto La Scala , Arcangelo Labianca , Monica Lazzo , Francesca Mazzia , Lorenzo Pisani","doi":"10.1016/j.jcmds.2022.100052","DOIUrl":"https://doi.org/10.1016/j.jcmds.2022.100052","url":null,"abstract":"<div><p>A point cloud describing a railway environment is considered in a case study aimed at presenting a workflow for the automatic detection of external objects that, coming too close to the railway infrastructure, may cause potential risks for its correct functioning. The approach combines classical semantic segmentation methodologies with a novel geometric and numerical procedure to define a <em>region of interest</em>, consisting of a lower tube enveloping the 3D space occupied by the train during its transit and an upper tube enclosing the overhead contact lines. One useful application could be automatic vegetation monitoring in the proximity of the railway structure, which would help with planning maintenance pruning activities.</p></div>","PeriodicalId":100768,"journal":{"name":"Journal of Computational Mathematics and Data Science","volume":"4 ","pages":"Article 100052"},"PeriodicalIF":0.0,"publicationDate":"2022-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S2772415822000165/pdfft?md5=39ce7dbb7fdd23f164ad540509765339&pid=1-s2.0-S2772415822000165-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"137407105","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}