Abstract The authors consider a continuous dynamic approximating model of a gas fields group and, on its basis, set maximum and minimum issues. The tasks proposed for research are optimal control problems with mixed constraints with free-final-time and moving right end. We analytically solve the rapid-action problem. The central mathematical apparatus is Pontryagin maximum principle in Arrow form, using Lagrange multipliers. The theoretically obtained results of the analysis are of particular interest.
{"title":"Theoretical Estimate of the Total Shelf Length in a Gas Fields Model","authors":"A. Skiba, N. Skiba","doi":"10.1515/comp-2020-0224","DOIUrl":"https://doi.org/10.1515/comp-2020-0224","url":null,"abstract":"Abstract The authors consider a continuous dynamic approximating model of a gas fields group and, on its basis, set maximum and minimum issues. The tasks proposed for research are optimal control problems with mixed constraints with free-final-time and moving right end. We analytically solve the rapid-action problem. The central mathematical apparatus is Pontryagin maximum principle in Arrow form, using Lagrange multipliers. The theoretically obtained results of the analysis are of particular interest.","PeriodicalId":43014,"journal":{"name":"Open Computer Science","volume":null,"pages":null},"PeriodicalIF":1.5,"publicationDate":"2021-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1515/comp-2020-0224","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"41273247","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Abstract Finger vein(s) based biometrics is another way to deal with individual's distinguishing proof and has recently received much consideration. The strategy in light of low-level components, like the dark surface of finger vein is taken as standard. However, it is typically looked with numerous difficulties that involves affectability to noise and low neighbourhood consistency. Generally finger vein recognition in view of abnormal state highlights the portrayal that has ended up being a promising method to successfully defeat the above restrictions and enhance the framework execution. This research work proposes finger vein-based recognition technique making use of Hybrid BM3D Filter along with grouped sparse representation for image denoising and feature selection (Local Binary Pattern – LBP, Scale Invariant Feature Transform – SIFT) to evaluate features, key-points and perform recognition. The experimental results on two open databases of finger vein, i.e., HKPU and SDU show that the proposed method has enhanced the overall performance of finger vein pattern recognition system compared with other existing methods.
{"title":"A Novel Approach Based Multi Biometric Finger Vein Template Recognition System using HGF","authors":"Rahul Dev, Rohit Tripathi, Ruqaiya Khanam","doi":"10.1515/comp-2020-0187","DOIUrl":"https://doi.org/10.1515/comp-2020-0187","url":null,"abstract":"Abstract Finger vein(s) based biometrics is another way to deal with individual's distinguishing proof and has recently received much consideration. The strategy in light of low-level components, like the dark surface of finger vein is taken as standard. However, it is typically looked with numerous difficulties that involves affectability to noise and low neighbourhood consistency. Generally finger vein recognition in view of abnormal state highlights the portrayal that has ended up being a promising method to successfully defeat the above restrictions and enhance the framework execution. This research work proposes finger vein-based recognition technique making use of Hybrid BM3D Filter along with grouped sparse representation for image denoising and feature selection (Local Binary Pattern – LBP, Scale Invariant Feature Transform – SIFT) to evaluate features, key-points and perform recognition. The experimental results on two open databases of finger vein, i.e., HKPU and SDU show that the proposed method has enhanced the overall performance of finger vein pattern recognition system compared with other existing methods.","PeriodicalId":43014,"journal":{"name":"Open Computer Science","volume":null,"pages":null},"PeriodicalIF":1.5,"publicationDate":"2021-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1515/comp-2020-0187","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"44406247","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Abstract This paper presents a review of state-of-the-art security frameworks for IoT applications. It aims to find out what alternatives have been proposed to guide IoT application developers in the implementation of security measures through all development phases. In this literature review, we identified 21 security frameworks, and we analyzed them from IoT application domains addressed and IoT elements protected. We find four application domains: generic, smart cities, smart car/VANET, and smart infrastructures. Concerning elements protected, we analyzed the frameworks through protected application resources and we also consider security properties in this paper. Our two principal findings are: (i) Even though there are a wide variety of security frameworks, we did not find a proposal that addresses all the layers of an IoT application (device, network, service and application) and all development phases (analysis, design, implementation, testing, deployment, and maintenance), (ii) Addressing security from the design phase allows IoT developers to have a broader perspective of the system, avoiding massive changes to be made in later stages, saving costs and time. This gap and concerns enable various research on security by design and secure development to be carried out, and proposed frameworks to address the identified problems.
{"title":"Framework-based security measures for Internet of Thing: A literature review","authors":"J. Rueda-Rueda, J. Portocarrero","doi":"10.1515/comp-2020-0220","DOIUrl":"https://doi.org/10.1515/comp-2020-0220","url":null,"abstract":"Abstract This paper presents a review of state-of-the-art security frameworks for IoT applications. It aims to find out what alternatives have been proposed to guide IoT application developers in the implementation of security measures through all development phases. In this literature review, we identified 21 security frameworks, and we analyzed them from IoT application domains addressed and IoT elements protected. We find four application domains: generic, smart cities, smart car/VANET, and smart infrastructures. Concerning elements protected, we analyzed the frameworks through protected application resources and we also consider security properties in this paper. Our two principal findings are: (i) Even though there are a wide variety of security frameworks, we did not find a proposal that addresses all the layers of an IoT application (device, network, service and application) and all development phases (analysis, design, implementation, testing, deployment, and maintenance), (ii) Addressing security from the design phase allows IoT developers to have a broader perspective of the system, avoiding massive changes to be made in later stages, saving costs and time. This gap and concerns enable various research on security by design and secure development to be carried out, and proposed frameworks to address the identified problems.","PeriodicalId":43014,"journal":{"name":"Open Computer Science","volume":null,"pages":null},"PeriodicalIF":1.5,"publicationDate":"2021-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1515/comp-2020-0220","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"41902608","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Abstract Ultrasonography is an extensively used medical imaging technique for multiple reasons. It works on the basic theory of echoes from the tissues under consideration. However, the occurrence of signal dependent noise such as speckle destroys utility of ultrasound images. Speckle noise is subject to the composition of image tissue and parameters of image. It reduces the effectiveness of many image processing steps and decreases human perception of fine details form ultrasound images. In many medical image processing methods, despeckling is used as the preprocessing step before segmentation and feature extraction. Many speckle reduction filters are proposed but while combining many techniques some speckle diagnostic information should be preserved. Removal of speckle noise from ultrasound image by preserving edges and added features is a great challenging task in ultrasound image restoration. This paper aims at a comprehensive description and comparison of reduction of speckle noise of ultrasound fibroid image. Many filters are applied on ultrasound scanned images and the performance is marked in terms of some statistical measures. Even though several despeckling filters are there for speckle reduction, all are not good for ultrasound scanned images. A comparison of quality measures such as mean square error, peak signal-to-noise ratio, and signal-to-noise ratio is done in ultrasound images in despeckling.
{"title":"Novel image enhancement approaches for despeckling in ultrasound images for fibroid detection in human uterus","authors":"K. T. Dilna, Jude Hemanth Duraisamy","doi":"10.1515/comp-2020-0140","DOIUrl":"https://doi.org/10.1515/comp-2020-0140","url":null,"abstract":"Abstract Ultrasonography is an extensively used medical imaging technique for multiple reasons. It works on the basic theory of echoes from the tissues under consideration. However, the occurrence of signal dependent noise such as speckle destroys utility of ultrasound images. Speckle noise is subject to the composition of image tissue and parameters of image. It reduces the effectiveness of many image processing steps and decreases human perception of fine details form ultrasound images. In many medical image processing methods, despeckling is used as the preprocessing step before segmentation and feature extraction. Many speckle reduction filters are proposed but while combining many techniques some speckle diagnostic information should be preserved. Removal of speckle noise from ultrasound image by preserving edges and added features is a great challenging task in ultrasound image restoration. This paper aims at a comprehensive description and comparison of reduction of speckle noise of ultrasound fibroid image. Many filters are applied on ultrasound scanned images and the performance is marked in terms of some statistical measures. Even though several despeckling filters are there for speckle reduction, all are not good for ultrasound scanned images. A comparison of quality measures such as mean square error, peak signal-to-noise ratio, and signal-to-noise ratio is done in ultrasound images in despeckling.","PeriodicalId":43014,"journal":{"name":"Open Computer Science","volume":null,"pages":null},"PeriodicalIF":1.5,"publicationDate":"2021-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"48910678","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Stefan Toth, Emanuel Zaymus, Michal Duracík, Patrik Hrkút, Matej Mesko
Abstract Despite the modern boom in technology, we are still faced with the fact that people write texts without diacritics. There are two main reasons for this. The first, historical reason stems from the past when the use of diacritics was troublesome and people would write text without them. The second one is the speed - typing without diacritics is usually faster. Text without diacritics is easy to understand for people, but for some types of documents, missing diacritics can cause a problem. This is also an issue when computers process such text. In this paper, we propose an algorithm based on word n-grams (a contiguous sequence of n words) that can restore diacritics of text written in the Slovak language. We also compare and evaluate our results with other algorithms developed for Slovak text.
{"title":"Diacritics restoration based on word n-grams for Slovak texts","authors":"Stefan Toth, Emanuel Zaymus, Michal Duracík, Patrik Hrkút, Matej Mesko","doi":"10.1515/comp-2020-0143","DOIUrl":"https://doi.org/10.1515/comp-2020-0143","url":null,"abstract":"Abstract Despite the modern boom in technology, we are still faced with the fact that people write texts without diacritics. There are two main reasons for this. The first, historical reason stems from the past when the use of diacritics was troublesome and people would write text without them. The second one is the speed - typing without diacritics is usually faster. Text without diacritics is easy to understand for people, but for some types of documents, missing diacritics can cause a problem. This is also an issue when computers process such text. In this paper, we propose an algorithm based on word n-grams (a contiguous sequence of n words) that can restore diacritics of text written in the Slovak language. We also compare and evaluate our results with other algorithms developed for Slovak text.","PeriodicalId":43014,"journal":{"name":"Open Computer Science","volume":null,"pages":null},"PeriodicalIF":1.5,"publicationDate":"2021-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1515/comp-2020-0143","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"47521554","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Sourav Kumar Bhoi, S. K. Panda, C. Mallick, K. K. Jena
Abstract Vehicular communication is the communication between the vehicles to provide intelligent transportation systems (ITSs) services to the end users. It is the most advance and emerging wireless technology in ad hoc network. On the other hand, construction of roads has a great impact in forwarding the data to the destination. As vehicles are moving with high speeds, the architecture of roads can change the performance of routing and data forwarding in the vehicular ad hoc network (VANET). If the construction of the roads in a city area is planned with intelligent junctions, flyovers, multilane, etc., then the performance of the system increases. In this paper, we have analyzed the impact of road elements like intersections, flyovers, multilane, buildings, hills, etc., on VANET routing and find solutions for the problems related to the performance of the system. We also simulate the impact of these elements in VANET routing and analyzed the performance using OMNeT++ network simulator and SUMO traffic simulator. The performance is studied by comparing standard GSR and GPSR position-based routing protocols.
{"title":"Impact of road architecture and design on performance of city-based VANETs","authors":"Sourav Kumar Bhoi, S. K. Panda, C. Mallick, K. K. Jena","doi":"10.1515/comp-2020-0217","DOIUrl":"https://doi.org/10.1515/comp-2020-0217","url":null,"abstract":"Abstract Vehicular communication is the communication between the vehicles to provide intelligent transportation systems (ITSs) services to the end users. It is the most advance and emerging wireless technology in ad hoc network. On the other hand, construction of roads has a great impact in forwarding the data to the destination. As vehicles are moving with high speeds, the architecture of roads can change the performance of routing and data forwarding in the vehicular ad hoc network (VANET). If the construction of the roads in a city area is planned with intelligent junctions, flyovers, multilane, etc., then the performance of the system increases. In this paper, we have analyzed the impact of road elements like intersections, flyovers, multilane, buildings, hills, etc., on VANET routing and find solutions for the problems related to the performance of the system. We also simulate the impact of these elements in VANET routing and analyzed the performance using OMNeT++ network simulator and SUMO traffic simulator. The performance is studied by comparing standard GSR and GPSR position-based routing protocols.","PeriodicalId":43014,"journal":{"name":"Open Computer Science","volume":null,"pages":null},"PeriodicalIF":1.5,"publicationDate":"2021-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"47118894","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
George Papageorgiou, A. Ioannou, Athanasios Maimaris, Alexander N. Ness
Abstract This paper presents a strategic approach for implementing a Smart Pedestrian Network (SPN) navigation System that is geared towards promoting sustainable mobility. The SPN system is being designed to reach multiple market segments by providing information on suitable walking routes aiming to satisfy potential users’ needs, but also multiple stakeholder demands. The paper presents the main objectives of the SPN system as well as its system structure, application features, functions, and relevant data sources. The proposed strategic implementation framework deems necessary for scaling up so that the SPN system is successfully implemented in a variety of urban conditions. The framework emphasizes the element of adaptability, so that SPN can be adjusted where and when necessary, to deal with a variety of contexts and specific sustainable mobility issues, depending on the particular municipality conditions. The proposed framework combines elements of both the waterfall and agile software development methods, as well as, aspects of Open Innovation, Customer Involvement and Co-Creation taking a multiple stakeholder approach.
{"title":"A Strategic Approach for implementing A Smart Pedestrian Network (SPN) System","authors":"George Papageorgiou, A. Ioannou, Athanasios Maimaris, Alexander N. Ness","doi":"10.1515/comp-2020-0128","DOIUrl":"https://doi.org/10.1515/comp-2020-0128","url":null,"abstract":"Abstract This paper presents a strategic approach for implementing a Smart Pedestrian Network (SPN) navigation System that is geared towards promoting sustainable mobility. The SPN system is being designed to reach multiple market segments by providing information on suitable walking routes aiming to satisfy potential users’ needs, but also multiple stakeholder demands. The paper presents the main objectives of the SPN system as well as its system structure, application features, functions, and relevant data sources. The proposed strategic implementation framework deems necessary for scaling up so that the SPN system is successfully implemented in a variety of urban conditions. The framework emphasizes the element of adaptability, so that SPN can be adjusted where and when necessary, to deal with a variety of contexts and specific sustainable mobility issues, depending on the particular municipality conditions. The proposed framework combines elements of both the waterfall and agile software development methods, as well as, aspects of Open Innovation, Customer Involvement and Co-Creation taking a multiple stakeholder approach.","PeriodicalId":43014,"journal":{"name":"Open Computer Science","volume":null,"pages":null},"PeriodicalIF":1.5,"publicationDate":"2021-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1515/comp-2020-0128","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"48412394","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Abstract Task scheduling and load balancing are a concern for service providers in the cloud computing environment. The problem of scheduling tasks and balancing loads in a cloud is categorized under an NP-hard problem. Thus, it needs an efficient load scheduling algorithm that not only allocates the tasks onto appropriate VMs but also maintains the trade-off amidst VMs. It should keep an equilibrium among VMs in a way that reduces the makespan while maximizing the utilization of resources and throughput. In response to it, the authors propose a load balancing algorithm inspired by the mimicking behavior of a flock of birds, which is called the Bird Swarm Optimization Load Balancing (BSO-LB) algorithm that considers tasks as birds and VMs as destination food patches. In the considered cloud simulation environment, tasks are assumed to be independent and non-preemptive. To evaluate the efficacy of the proposed algorithm under real workloads, the authors consider a dataset (GoCJ) logged by Goggle in 2018 for the execution of cloudlets. The proposed algorithm aims to enhance the overall system performance by reducing response time and keeping the whole system balanced. The authors have integrated the binary variant of the BSO algorithm with the load balancing method. The proposed technique is analyzed and compared with other existing load balancing algorithms such as MAX-MIN, RASA, Improved PSO, and other scheduling algorithms as FCFS, SJF, and RR. The experimental results show that the proposed method outperforms when being compared with the different algorithms mentioned above. It is noteworthy that the proposed approach illustrates an improvement in resource utilization and reduces the makespan of tasks.
{"title":"A binary Bird Swarm Optimization based load balancing algorithm for cloud computing environment","authors":"Kaushik Mishra, S. Majhi","doi":"10.1515/comp-2020-0215","DOIUrl":"https://doi.org/10.1515/comp-2020-0215","url":null,"abstract":"Abstract Task scheduling and load balancing are a concern for service providers in the cloud computing environment. The problem of scheduling tasks and balancing loads in a cloud is categorized under an NP-hard problem. Thus, it needs an efficient load scheduling algorithm that not only allocates the tasks onto appropriate VMs but also maintains the trade-off amidst VMs. It should keep an equilibrium among VMs in a way that reduces the makespan while maximizing the utilization of resources and throughput. In response to it, the authors propose a load balancing algorithm inspired by the mimicking behavior of a flock of birds, which is called the Bird Swarm Optimization Load Balancing (BSO-LB) algorithm that considers tasks as birds and VMs as destination food patches. In the considered cloud simulation environment, tasks are assumed to be independent and non-preemptive. To evaluate the efficacy of the proposed algorithm under real workloads, the authors consider a dataset (GoCJ) logged by Goggle in 2018 for the execution of cloudlets. The proposed algorithm aims to enhance the overall system performance by reducing response time and keeping the whole system balanced. The authors have integrated the binary variant of the BSO algorithm with the load balancing method. The proposed technique is analyzed and compared with other existing load balancing algorithms such as MAX-MIN, RASA, Improved PSO, and other scheduling algorithms as FCFS, SJF, and RR. The experimental results show that the proposed method outperforms when being compared with the different algorithms mentioned above. It is noteworthy that the proposed approach illustrates an improvement in resource utilization and reduces the makespan of tasks.","PeriodicalId":43014,"journal":{"name":"Open Computer Science","volume":null,"pages":null},"PeriodicalIF":1.5,"publicationDate":"2021-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1515/comp-2020-0215","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"42102967","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Abstract The main goal of this contribution is to present the current developmental state of FRIMAN – the graphical development environment designed to support the teaching process of the object-oriented paradigm. FRIMAN project has two main purposes: 1. simplifying the understanding of the basics of the object-oriented programming for JAVA language beginners, 2. teaching students of applied informatics to collaborate in bigger project development. Therefore, an application called FRIMAN has been developed at the Faculty of Management Science and Informatics at the University of Žilina. This project is developed by students of Master degrees under the leaderships of experienced software developers. The suggested system consists of several modules. In this paper, we focus on the description of selected modules and their current functionality as well as description of future plans for this project and brief description of FRIMAN development process. Attention is paid to a module for class management and a graphical code editor, which enables the creation of method bodies using flow diagrams without the necessity of programming language syntax knowledge. Based on good evaluation by the development team preparing changes in the high school education process, the current application is planned to be applied in practice.
{"title":"Development of FRIMAN – Supporting Tool for Object Oriented Programming Teaching","authors":"P. Sedlaček, Marek Kvet, M. Vaclavkova","doi":"10.1515/comp-2020-0117","DOIUrl":"https://doi.org/10.1515/comp-2020-0117","url":null,"abstract":"Abstract The main goal of this contribution is to present the current developmental state of FRIMAN – the graphical development environment designed to support the teaching process of the object-oriented paradigm. FRIMAN project has two main purposes: 1. simplifying the understanding of the basics of the object-oriented programming for JAVA language beginners, 2. teaching students of applied informatics to collaborate in bigger project development. Therefore, an application called FRIMAN has been developed at the Faculty of Management Science and Informatics at the University of Žilina. This project is developed by students of Master degrees under the leaderships of experienced software developers. The suggested system consists of several modules. In this paper, we focus on the description of selected modules and their current functionality as well as description of future plans for this project and brief description of FRIMAN development process. Attention is paid to a module for class management and a graphical code editor, which enables the creation of method bodies using flow diagrams without the necessity of programming language syntax knowledge. Based on good evaluation by the development team preparing changes in the high school education process, the current application is planned to be applied in practice.","PeriodicalId":43014,"journal":{"name":"Open Computer Science","volume":null,"pages":null},"PeriodicalIF":1.5,"publicationDate":"2020-12-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1515/comp-2020-0117","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"49547633","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Abstract This article deals with a high order integration method based on the Taylor series. The paper shows many positive properties of this method on a set of technical initial value problems. These problems can be transformed into the autonomous systems of ordinary differential equations for both linear and nonlinear problems. The MATLAB implementation of the method is compared with state-of-the-art MATLAB solvers.
{"title":"Taylor Series Based Numerical Integration Method","authors":"Petr Veigend, Gabriela Necasová, Václav Šátek","doi":"10.1515/comp-2020-0163","DOIUrl":"https://doi.org/10.1515/comp-2020-0163","url":null,"abstract":"Abstract This article deals with a high order integration method based on the Taylor series. The paper shows many positive properties of this method on a set of technical initial value problems. These problems can be transformed into the autonomous systems of ordinary differential equations for both linear and nonlinear problems. The MATLAB implementation of the method is compared with state-of-the-art MATLAB solvers.","PeriodicalId":43014,"journal":{"name":"Open Computer Science","volume":null,"pages":null},"PeriodicalIF":1.5,"publicationDate":"2020-12-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1515/comp-2020-0163","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"42475582","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：