Pub Date : 2020-07-18DOI: 10.47350/iccs-de.2020.26
E. Vatutin, N. Nikitina, A. Belyshev, M. Manzyuk
The paper discusses the reduction of problems based on Latin squares to the exact cover problem aiming at its subsequent solution using the dancing links algorithm. The former problems include generation of Latin squares and diagonal Latin squares of a general form/with a given normalization, generation of orthogonal Latin and diagonal Latin squares directly/through the set of transversals, obtaining a set of transversals for a given square, forming a subset of disjoint transversals. For each subproblem, we describe in detail the process of forming the corresponding binary coverage matrices. We show that the use of the proposed approach in comparison with the classical one, i.e. the formation of sets of transversals and their coverages using exhaustive enumeration, allows one to increase the eective processing pace of diagonal Latin squares by 2.5{5.6 times. The developed software implementations of the algorithms are used in computational experiments as part of the Gerasim@Home volunteer distributed computing project on the BOINC platform
{"title":"On polynomial reduction of problems based on diagonal Latin squares to the exact cover problem","authors":"E. Vatutin, N. Nikitina, A. Belyshev, M. Manzyuk","doi":"10.47350/iccs-de.2020.26","DOIUrl":"https://doi.org/10.47350/iccs-de.2020.26","url":null,"abstract":"The paper discusses the reduction of problems based on Latin squares to the exact cover problem aiming at its subsequent solution using the dancing links algorithm. The former problems include generation of Latin squares and diagonal Latin squares of a general form/with a given normalization, generation of orthogonal Latin and diagonal Latin squares directly/through the set of transversals, obtaining a set of transversals for a given square, forming a subset of disjoint transversals. For each subproblem, we describe in detail the process of forming the corresponding binary coverage matrices. We show that the use of the proposed approach in comparison with the classical one, i.e. the formation of sets of transversals and their coverages using exhaustive enumeration, allows one to increase the eective processing pace of diagonal Latin squares by 2.5{5.6 times. The developed software implementations of the algorithms are used in computational experiments as part of the Gerasim@Home volunteer distributed computing project on the BOINC platform","PeriodicalId":210887,"journal":{"name":"International Workshop on Information, Computation, and Control Systems for Distributed Environments","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2020-07-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128962099","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}
Pub Date : 2020-07-18DOI: 10.47350/iccs-de.2020.14
M. Kenzin, I. Bychkov, N. Maksimkin
A high level of team situational awareness is essential during complex, large-scale missions of autonomous mobile robots. When a situation appears that needs inter-agent interaction for cooperative decision-making, the basic understanding of the current conditions ought to be identical within the group. To achieve this requirement, all emergent information of acute importance must be promptly shared among team members. It is a non-trivial problem for large-sized and distributed robotic teams, especially under hard communication constraints. The problem considered in this paper is to nd an ecient emergency broadcasting strategy for search and survey operations of the robotic groups providing the fastest way for any agent to aware the remaining team in case of any unexpected changes. A number of simple ruled-based heuristics is proposed to treat the problem. The comparison between the suggested approaches is made regarding both the quality of the obtained solutions and the working speed.
{"title":"Situational awareness for distributed mobile robot teams under limited communication","authors":"M. Kenzin, I. Bychkov, N. Maksimkin","doi":"10.47350/iccs-de.2020.14","DOIUrl":"https://doi.org/10.47350/iccs-de.2020.14","url":null,"abstract":"A high level of team situational awareness is essential during complex, large-scale missions of autonomous mobile robots. When a situation appears that needs inter-agent interaction for cooperative decision-making, the basic understanding of the current conditions ought to be identical within the group. To achieve this requirement, all emergent information of acute importance must be promptly shared among team members. It is a non-trivial problem\u0000for large-sized and distributed robotic teams, especially under hard communication constraints. The problem considered in this paper is to nd an ecient emergency broadcasting strategy for search and survey operations of the robotic groups providing the fastest way for any agent to aware the remaining team in case of any unexpected changes. A number of simple ruled-based heuristics is proposed to treat the problem. The comparison between the suggested approaches\u0000is made regarding both the quality of the obtained solutions and the working speed.","PeriodicalId":210887,"journal":{"name":"International Workshop on Information, Computation, and Control Systems for Distributed Environments","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2020-07-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129135971","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}
Pub Date : 2020-07-18DOI: 10.47350/iccs-de.2020.04
D. Dobrilović, Ž. Stojanov, Jelena Stojanov, Milan Malić
The systems for localization of resources in indoor environments based on Received Signal Strength Indicator (RSSI) are widely used today. Since satellite navigation systems, such as GPS or GLONASS, have certain difficulties in the indoor environments, the signals of deployed wireless devices, such as sensor nodes, access points etc, are used for localization instead. Those systems are known as Indoor Positioning System (IPS). Those systems are used for resource tracking and positioning in places such as airports, railway stations, shopping malls, warehouses, production facilities, construction sites, and healthcare institutions. The Bluetooth Low Energy is one of the wireless technologies that can be used with great efficiency for indoor localization. It offers easy and economic implementation on mobile devices such as smart phones and tablets. There are many techniques used for determination of position. In a number of methods, such as ROCRSSI or MinMax, the distance from the wireless nodes is used for calculating the location. In those systems the main challenge is to accurately estimate distance from the device based on signal strength. In this paper, usability of various software tools for modelling the distance estimation based on RSSI is discussed. Those software tools are Microsoft Access, R Studio, Octave, and Python.
{"title":"Tools for modelling distance estimation based on RSSI","authors":"D. Dobrilović, Ž. Stojanov, Jelena Stojanov, Milan Malić","doi":"10.47350/iccs-de.2020.04","DOIUrl":"https://doi.org/10.47350/iccs-de.2020.04","url":null,"abstract":"The systems for localization of resources in indoor environments based on Received Signal Strength Indicator (RSSI) are widely used today. Since satellite navigation systems, such as GPS or GLONASS, have certain difficulties in the indoor environments, the signals of deployed wireless devices, such as sensor nodes, access points etc, are used for localization instead. Those systems are known as Indoor Positioning System (IPS). Those systems are used for resource tracking and positioning in places such as airports, railway stations, shopping malls, warehouses, production facilities, construction sites, and healthcare institutions. The Bluetooth Low Energy is one of the wireless technologies that can be used with great efficiency for indoor localization. It offers easy and economic implementation on mobile devices such as smart phones and tablets. There are many techniques used for determination of position. In a number of methods, such as ROCRSSI or MinMax, the distance from the wireless nodes is used for calculating the location. In those systems the main challenge is to accurately estimate distance from the device based on signal strength. In this paper, usability of various software tools for modelling the distance estimation based on RSSI is discussed. Those software tools are Microsoft Access, R Studio, Octave, and Python.","PeriodicalId":210887,"journal":{"name":"International Workshop on Information, Computation, and Control Systems for Distributed Environments","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2020-07-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115705157","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}
Pub Date : 2020-07-18DOI: 10.47350/iccs-de.2020.22
I. Sheremet
Article is dedicated to the multigrammatical modelling of games. Basic notions and definitions, concerning multisets and multiset grammars, are considered. So called resource-based games are introduced, and representation of their simplest class – antagonistic resource-based games – by filtering multiset grammars is considered in details. More sophisticated cooperative and coalitional resource-based games are proposed. Directions of further development of resource-based games by application of multigrammatical framework are discussed.
{"title":"Resource-based games","authors":"I. Sheremet","doi":"10.47350/iccs-de.2020.22","DOIUrl":"https://doi.org/10.47350/iccs-de.2020.22","url":null,"abstract":"Article is dedicated to the multigrammatical modelling of games. Basic notions and definitions, concerning multisets and multiset grammars, are considered. So called resource-based games are introduced, and representation of their simplest class – antagonistic resource-based games – by filtering multiset grammars is considered in details. More sophisticated cooperative and coalitional resource-based games are proposed. Directions of further development of resource-based games by application of multigrammatical framework are discussed.","PeriodicalId":210887,"journal":{"name":"International Workshop on Information, Computation, and Control Systems for Distributed Environments","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2020-07-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124764729","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}
Pub Date : 2019-08-21DOI: 10.47350/iccs-de.2019.02
I. Bychkov, G. Oparin, V. Bogdanova, A. A. Pashinin
The complexity of exhaustive problems with the properties of large-scale, openness, unpredictable dynamics, and component mobility determines the relevance of developing microservice-oriented software for their solving in a hybrid computational environment. We propose an approach for adapting to this environment both the existing software and new ones developed using new automated technology for creating an applied microservice package and organizing control of computations in it. The distributed computational model is represented by a set of small, loosely coupled, replaceable, interacting with the use of lightweight communication mechanisms autonomous microservices that implement the functions of the program package modules. The decentralized management of the microservices interaction is carried out by a self-organizing multi-agent system, agents of which are delegated the rights to launch microservices. The paper discusses the models, methods, and software platform that form the basis of the proposed technology. We demonstrate the application of the applied microservice package, based on this technology, for solving the problems of qualitative analysis of binary dynamic system using the author's Boolean constraints method.
{"title":"Intellectual technology for computation control in the package of applied microservices","authors":"I. Bychkov, G. Oparin, V. Bogdanova, A. A. Pashinin","doi":"10.47350/iccs-de.2019.02","DOIUrl":"https://doi.org/10.47350/iccs-de.2019.02","url":null,"abstract":"The complexity of exhaustive problems with the properties of large-scale, openness, unpredictable dynamics, and component mobility determines the relevance of developing microservice-oriented software for their solving in a hybrid computational environment. We propose an approach for adapting to this environment both the existing software and new ones developed using new automated technology for creating an applied microservice package and organizing control of computations in it. The distributed computational model is represented by a set of small, loosely coupled, replaceable, interacting with the use of lightweight communication mechanisms autonomous microservices that implement the functions of the program package modules. The decentralized management of the microservices interaction is carried out by a self-organizing multi-agent system, agents of which are delegated the rights to launch microservices. The paper discusses the models, methods, and software platform that form the basis of the proposed technology. We demonstrate the application of the applied microservice package, based on this technology, for solving the problems of qualitative analysis of binary dynamic system using the author's Boolean constraints method.","PeriodicalId":210887,"journal":{"name":"International Workshop on Information, Computation, and Control Systems for Distributed Environments","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2019-08-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125630787","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}
Pub Date : 2019-08-21DOI: 10.47350/iccs-de.2019.10
I. Sidorov, T. Sidorova, Y. Kurzybova
The high-performance computing systems include a large number of hardware and software components that can cause failures. Nowadays, the well-known approaches to monitoring and ensuring the fault tolerance of the high-performance computing systems do not allow to fully implement its integrated solution. The aim of this paper is to develop methods and tools for identifying abnormal situations during large-scale computational experiments in high-performance computing environments, localizing these malfunctions, automatically troubleshooting if this is possible, and automatically reconfiguring the computing environment otherwise. The proposed approach is based on the idea of integrating monitoring systems, used in different nodes of the environment, into a unified meta-monitoring system. The use of the proposed approach minimizes the time to perform diagnostics and troubleshooting through the use of parallel operations. It also improves the resiliency of the computing environment processes by preventive measures to diagnose and troubleshoot of failures. These advantages lead to increasing the reliability and efficiency of the environment functioning. The novelty of the proposed approach is underlined by the following elements: mechanisms of the decentralized collection, storage, and processing of monitoring data; a new technique of decision-making in reconfiguring the environment; the supporting the provision of fault tolerance and reliability not only for software and hardware, but also for environment management systems.
{"title":"Meta-monitoring system for ensuring a fault tolerance of the intelligent high-performance computing environment","authors":"I. Sidorov, T. Sidorova, Y. Kurzybova","doi":"10.47350/iccs-de.2019.10","DOIUrl":"https://doi.org/10.47350/iccs-de.2019.10","url":null,"abstract":"The high-performance computing systems include a large number of hardware and software components that can cause failures. Nowadays, the well-known approaches to monitoring and ensuring the fault tolerance of the high-performance computing systems do not allow to fully implement its integrated solution. The aim of this paper is to develop methods and tools for identifying abnormal situations during large-scale computational experiments in high-performance computing environments, localizing these malfunctions, automatically troubleshooting if this is possible, and automatically reconfiguring the computing environment otherwise. The proposed approach is based on the idea of integrating monitoring systems, used in different nodes of the environment, into a unified meta-monitoring system. The use of the proposed approach minimizes the time to perform diagnostics and troubleshooting through the use of parallel operations. It also improves the resiliency of the computing environment processes by preventive measures to diagnose and troubleshoot of failures. These advantages lead to increasing the reliability and efficiency of the environment functioning. The novelty of the proposed approach is underlined by the following elements: mechanisms of the decentralized collection, storage, and processing of monitoring data; a new technique of decision-making in reconfiguring the environment; the supporting the provision of fault tolerance and reliability not only for software and hardware, but also for environment management systems.","PeriodicalId":210887,"journal":{"name":"International Workshop on Information, Computation, and Control Systems for Distributed Environments","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2019-08-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128294915","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}
Pub Date : 2019-08-21DOI: 10.47350/iccs-de.2019.03
A. Davydov, Aleksandr Larionov, N. Nagul
The paper demonstrates how the automatic theorem proving technique of the PCF calculus is applied to construct parallel composition of automata. Parallel composition plays an essential role in the supervisory control theory at different stages of systems and supervisors design. Improved formalization of discrete event systems as positively-constructed formulas along with auxiliary predicates, serving for accessibility of the automaton checking, simplify parallel composition construction.
{"title":"PCF-based formalization of the parallel composition of automata","authors":"A. Davydov, Aleksandr Larionov, N. Nagul","doi":"10.47350/iccs-de.2019.03","DOIUrl":"https://doi.org/10.47350/iccs-de.2019.03","url":null,"abstract":"The paper demonstrates how the automatic theorem proving technique of the PCF calculus is applied to construct parallel composition of automata. Parallel composition plays an essential role in the supervisory control theory at different stages of systems and supervisors design. Improved formalization of discrete event systems as positively-constructed formulas along with auxiliary predicates, serving for accessibility of the automaton checking, simplify parallel composition construction.","PeriodicalId":210887,"journal":{"name":"International Workshop on Information, Computation, and Control Systems for Distributed Environments","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2019-08-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133585005","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}
Pub Date : 2019-08-21DOI: 10.47350/iccs-de.2019.01
E. Barakhtenko, D. Sokolov, A. Edelev, S. Gorsky
The paper addresses the research of intelligent integrated energy systems resilience that is the system ability to withstand large disturbances and prevent their cascade development with massive energy shortage. The scheme of intelligent integrated energy systems resilience research is presented in the paper. It involves the disturbance scenarios formation, the evaluation of consequences of disturbance impact on energy systems, the assessment of the effectiveness and feasibility of the resilience enhancement steps. The scheme helps an expert to select specific resilience enhancement steps and to make decision whenever to implement them.
{"title":"Research on the resilience of the intelligent integrated energy systems","authors":"E. Barakhtenko, D. Sokolov, A. Edelev, S. Gorsky","doi":"10.47350/iccs-de.2019.01","DOIUrl":"https://doi.org/10.47350/iccs-de.2019.01","url":null,"abstract":"The paper addresses the research of intelligent integrated energy systems resilience that is the system ability to withstand large disturbances and prevent their cascade development with massive energy shortage. The scheme of intelligent integrated energy systems resilience research is presented in the paper. It involves the disturbance scenarios formation, the evaluation of consequences of disturbance impact on energy systems, the assessment of the effectiveness and feasibility of the resilience enhancement steps. The scheme helps an expert to select specific resilience enhancement steps and to make decision whenever to implement them.","PeriodicalId":210887,"journal":{"name":"International Workshop on Information, Computation, and Control Systems for Distributed Environments","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2019-08-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123239415","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}
Pub Date : 2019-08-21DOI: 10.47350/ICCS-DE.2019.09
G. Oparin, V. Bogdanova, A. A. Pashinin
The main objective of qualitative research is to analyze the behavior of the trajectories of a dynamic system to verify whether it corresponds to the set of constraints characterizing the property. We use an approach to study binary dynamic systems on a finite time interval based on the author's method of Boolean constraints. Based on this method, the Boolean model of the properties of a binary dynamic system is written in the language of Boolean equations or Boolean formulas with quantifiers. Thus, the verification of various dynamical properties is reduced to solving the problems of Boolean constraints satisfiability or the validity of a quantified Boolean formula using efficient SAT or TQBF solvers. The high computational complexity of these problems requires the development of software and tools for their parallel and distributed solving and ensuring transparent end-user access to highperformance computing environments based on a service-oriented approach. This paper represents the architecture and functionality of a new instrumental system that automates the creation of a distributed application for solving the considered class of problems based on the microservice approach and multi-agent technology.
{"title":"Automation of microservices creation for qualitative analysis of binary dynamic systems","authors":"G. Oparin, V. Bogdanova, A. A. Pashinin","doi":"10.47350/ICCS-DE.2019.09","DOIUrl":"https://doi.org/10.47350/ICCS-DE.2019.09","url":null,"abstract":"The main objective of qualitative research is to analyze the behavior of the trajectories of a dynamic system to verify whether it corresponds to the set of constraints characterizing the property. We use an approach to study binary dynamic systems on a finite time interval based on the author's method of Boolean constraints. Based on this method, the Boolean model of the properties of a binary dynamic system is written in the language of Boolean equations or Boolean formulas with quantifiers. Thus, the verification of various dynamical properties is reduced to solving the problems of Boolean constraints satisfiability or the validity of a quantified Boolean formula using efficient SAT or TQBF solvers. The high computational complexity of these problems requires the development of software and tools for their parallel and distributed solving and ensuring transparent end-user access to highperformance computing environments based on a service-oriented approach. This paper represents the architecture and functionality of a new instrumental system that automates the creation of a distributed application for solving the considered class of problems based on the microservice approach and multi-agent technology.","PeriodicalId":210887,"journal":{"name":"International Workshop on Information, Computation, and Control Systems for Distributed Environments","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2019-08-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126882261","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}
Pub Date : 2019-08-21DOI: 10.47350/iccs-de.2019.07
E. Fereferov, A. G. Feoktistov, I. Bychkov
The paper addresses the relevant problem of data preparation for testing modules of scientific applications. Such testing requires the multiple executions of modules with different parameters for various scenarios of solving problems in applications. Often, data sources for parameters used for problem-solving are subject data (experimental results, reports, statistical forms and other information resources) created earlier as a result of functioning various objects of a subject domain. Usually, such data are heterogeneous and weakly structured. The developer of scientific applications has to make additional efforts in extracting, cleaning, integrating, and formatting data in order to achieve the correctness and efficiency of their use in applications. The aim of the study is the development of a framework for automating the description of semi-structured data and their transformation into target structures used by scientific applications. We proposed a conceptual model that allows us to represent knowledge about the structure of the source data, determine their relations with the target structures and set the rules for data transformation. Additionally, we developed a framework prototype. It is integrated into the technological scheme of continuous integration for modules of scientific applications (distributed applied software packages) that are developed with the help of Orlando Tools. The effectiveness of this prototype functioning is confirmed by the results of experimental analysis.
{"title":"Framework for preparing subject data in testing modules of scientific applications","authors":"E. Fereferov, A. G. Feoktistov, I. Bychkov","doi":"10.47350/iccs-de.2019.07","DOIUrl":"https://doi.org/10.47350/iccs-de.2019.07","url":null,"abstract":"The paper addresses the relevant problem of data preparation for testing modules of scientific applications. Such testing requires the multiple executions of modules with different parameters for various scenarios of solving problems in applications. Often, data sources for parameters used for problem-solving are subject data (experimental results, reports, statistical forms and other information resources) created earlier as a result of functioning various objects of a subject domain. Usually, such data are heterogeneous and weakly structured. The developer of scientific applications has to make additional efforts in extracting, cleaning, integrating, and formatting data in order to achieve the correctness and efficiency of their use in applications. The aim of the study is the development of a framework for automating the description of semi-structured data and their transformation into target structures used by scientific applications. We proposed a conceptual model that allows us to represent knowledge about the structure of the source data, determine their relations with the target structures and set the rules for data transformation. Additionally, we developed a framework prototype. It is integrated into the technological scheme of continuous integration for modules of scientific applications (distributed applied software packages) that are developed with the help of Orlando Tools. The effectiveness of this prototype functioning is confirmed by the results of experimental analysis.","PeriodicalId":210887,"journal":{"name":"International Workshop on Information, Computation, and Control Systems for Distributed Environments","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2019-08-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132939777","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
扫码关注我们
求助内容：
应助结果提醒方式：