Pub Date : 2021-07-24DOI: 10.47350/iccs-de.2021.04
D. Dobrilović, Milica Mazalica, Goran Gecin
Considering the growing appliance of wireless technologies in the Internet of Things and Wireless Sensor Networks the question of their coexistence and interoperability becomes extremely important. Wi-Fi and ZigBee technologies already have a long-lasting presence in the market as well as deployment in many systems. Because of their numerous appliances, it is extremely important to measure the impact of one technology on another. This paper has presented the approach of using open-source hardware and software for measuring the interference effects of Wi-Fi to ZigBee. The testing platform is built on Arduino microcontroller boards. This paper describes the experiment, the experimental platform, methodology, and tools used for collecting and analyzing data, as well as the experience gained during the experiments, and its influence on future work. The results presented in this paper give a clear insight into how the IEEE 802.11 networks influence the throughput of IEEE 802.15.4 networks when operating in similar frequencies. According to presented test results, Wi-Fi at distances of about 12m can affect the ZigBee throughput when the central frequency difference is 7 MHz or lower.
{"title":"Experience in measuring Wi-Fi to ZigBee interference using open-source hardware","authors":"D. Dobrilović, Milica Mazalica, Goran Gecin","doi":"10.47350/iccs-de.2021.04","DOIUrl":"https://doi.org/10.47350/iccs-de.2021.04","url":null,"abstract":"Considering the growing appliance of wireless technologies in the Internet of Things and Wireless Sensor Networks the question of their coexistence and interoperability becomes extremely important. Wi-Fi and ZigBee technologies already have a long-lasting presence in the market as well as deployment in many systems. Because of their numerous appliances, it is extremely important to measure the impact of one technology on another. This paper has presented the approach of using open-source hardware and software for measuring the interference effects of Wi-Fi to ZigBee. The testing platform is built on Arduino microcontroller boards. This paper describes the experiment, the experimental platform, methodology, and tools used for collecting and analyzing data, as well as the experience gained during the experiments, and its influence on future work. The results presented in this paper give a clear insight into how the IEEE 802.11 networks influence the throughput of IEEE 802.15.4 networks when operating in similar frequencies. According to presented test results, Wi-Fi at distances of about 12m can affect the ZigBee throughput when the central frequency difference is 7 MHz or lower.","PeriodicalId":210887,"journal":{"name":"International Workshop on Information, Computation, and Control Systems for Distributed Environments","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2021-07-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123058782","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 : 2021-07-24DOI: 10.47350/iccs-de.2021.17
N. Vershkov, V. Kuchukov, N. Kuchukova, N. Kucherov, E. Shiriaev
The article deals with the modelling of Artificial Neural Networks as an information transmission system to optimize their computational complexity. The analysis of existing theoretical approaches to optimizing the structure and training of neural networks is carried out. In the process of constructing the model, the well-known problem of isolating a deterministic signal on the background of noise and adapting it to solving the problem of assigning an input implementation to a certain cluster is considered. A layer of neurons is considered as an information transformer with a kernel for solving a certain class of problems: orthogonal transformation, matched filtering, and nonlinear transformation for recognizing the input implementation with a given accuracy. Based on the analysis of the proposed model, it is concluded that it is possible to reduce the number of neurons in the layers of neural network and to reduce the number of features for training the classifier.
{"title":"Optimization of computational complexity of an artificial neural network","authors":"N. Vershkov, V. Kuchukov, N. Kuchukova, N. Kucherov, E. Shiriaev","doi":"10.47350/iccs-de.2021.17","DOIUrl":"https://doi.org/10.47350/iccs-de.2021.17","url":null,"abstract":"The article deals with the modelling of Artificial Neural Networks as an information transmission system to optimize their computational complexity. The analysis of existing theoretical approaches to optimizing the structure and training of neural networks is carried out. In the process of constructing the model, the well-known problem of isolating a deterministic signal on the background of noise and adapting it to solving the problem of assigning an input implementation to a certain cluster is considered. A layer of neurons is considered as an information transformer with a kernel for solving a certain class of problems: orthogonal transformation, matched filtering, and nonlinear transformation for recognizing the input implementation with a given accuracy. Based on the analysis of the proposed model, it is concluded that it is possible to reduce the number of neurons in the layers of neural network and to reduce the number of features for training the classifier.","PeriodicalId":210887,"journal":{"name":"International Workshop on Information, Computation, and Control Systems for Distributed Environments","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2021-07-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126194833","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 : 2021-07-24DOI: 10.47350/iccs-de.2021.12
I. Sheremet
This paper is dedicated to the application of the multigrammatical framework to the assessment of vulnerability of energy infrastructures affected by impacts destroying (reducing capabilities of) their facilities (power plants, fuel producing plants, power transmission lines, fuel transporting pipes, as well as networking devices of both electricity and fuel subsystems of an energy infrastructures). A basic graph representation of energy infrastructures is considered, and technique of their multigrammatical representation is introduced. Criterial base for recognition of the energy infrastructures vulnerability, being a generalization of the similar criterial base developed regarding industrial infrastructures is proposed. Techniques of multigrammatical modelling reservation of energy infrastructures and their recovery after impacts is proposed. Directions of future research in this area are announced.
{"title":"Multiset-based assessment of vulnerability of energy infrastructures to destructive impacts","authors":"I. Sheremet","doi":"10.47350/iccs-de.2021.12","DOIUrl":"https://doi.org/10.47350/iccs-de.2021.12","url":null,"abstract":"This paper is dedicated to the application of the multigrammatical framework to the assessment of vulnerability of energy infrastructures affected by impacts destroying (reducing capabilities of) their facilities (power plants, fuel producing plants, power transmission lines, fuel transporting pipes, as well as networking devices of both electricity and fuel subsystems of an energy infrastructures). A basic graph representation of energy infrastructures is considered, and technique of their multigrammatical representation is introduced. Criterial base for recognition of the energy infrastructures vulnerability, being a generalization of the similar criterial base developed regarding industrial infrastructures is proposed. Techniques of multigrammatical modelling reservation of energy infrastructures and their recovery after impacts is proposed. Directions of future research in this area are announced.","PeriodicalId":210887,"journal":{"name":"International Workshop on Information, Computation, and Control Systems for Distributed Environments","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2021-07-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134079732","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 : 2021-07-24DOI: 10.47350/iccs-de.2021.08
S. Kratov, Olga Sokolova
The article describes the full life cycle of an information system based on open Webtechnologies from the point of view of developers and system administrators. The article starts with the development of technical specifications for an information system creation and ends with the system’s launching into operation and its subsequent uninterrupted operation. As the example, the creation process of the information system for the Foundation of Algorithms and Programs of the Siberian Branch of the Russian Academy of Sciences is described.
{"title":"About the life cycle of information systems based on open Web-technologies","authors":"S. Kratov, Olga Sokolova","doi":"10.47350/iccs-de.2021.08","DOIUrl":"https://doi.org/10.47350/iccs-de.2021.08","url":null,"abstract":"The article describes the full life cycle of an information system based on open Webtechnologies from the point of view of developers and system administrators. The article starts with the development of technical specifications for an information system creation and ends with the system’s launching into operation and its subsequent uninterrupted operation. As the example, the creation process of the information system for the Foundation of Algorithms and Programs of the Siberian Branch of the Russian Academy of Sciences is described.","PeriodicalId":210887,"journal":{"name":"International Workshop on Information, Computation, and Control Systems for Distributed Environments","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2021-07-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134232748","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 : 2021-07-24DOI: 10.47350/iccs-de.2021.11
G. Oparin, V. Bogdanova, A. A. Pashinin
The property of observability of controlled binary dynamical systems is investigated. A formal definition of the property is given in the language of applied logic of predicates with bounded quantifiers of existence and universality. A Boolean model of the property is built in the form of a quantified Boolean formula accordingly to the Boolean constraints method developed by the authors. This formula satisfies both the logical specification of the property and the equations of the binary system dynamics. Aspects of the proposed approach implementation for the study of the observability property are considered. The technology of checking the feasibility of the property using an applied microservice package is demonstrated in several examples.
{"title":"Investigation of observability property of controlled binary dynamical systems: a logical approach","authors":"G. Oparin, V. Bogdanova, A. A. Pashinin","doi":"10.47350/iccs-de.2021.11","DOIUrl":"https://doi.org/10.47350/iccs-de.2021.11","url":null,"abstract":"The property of observability of controlled binary dynamical systems is investigated. A formal definition of the property is given in the language of applied logic of predicates with bounded quantifiers of existence and universality. A Boolean model of the property is built in the form of a quantified Boolean formula accordingly to the Boolean constraints method developed by the authors. This formula satisfies both the logical specification of the property and the equations of the binary system dynamics. Aspects of the proposed approach implementation for the study of the observability property are considered. The technology of checking the feasibility of the property using an applied microservice package is demonstrated in several examples.","PeriodicalId":210887,"journal":{"name":"International Workshop on Information, Computation, and Control Systems for Distributed Environments","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2021-07-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114879492","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 : 2021-07-24DOI: 10.47350/iccs-de.2021.09
N. Kucherov, V. Kuchukov, E. Golimblevskaia, N. Kuchukova, I. Vashchenko, E. Kuchukova
The article develops an efficient implementation of an algorithm for detecting and correcting multivalued residual errors with a fixed number of calculations of the syndrome, regardless of the set of moduli size. Criteria for uniqueness are given that can be met by selecting moduli from a set of primes to satisfy the desired error correction capability. An extended version of the algorithm with an increase in the number of syndromes depending on the number of information moduli is proposed. It is proposed to remove the restriction imposed on the size of redundant moduli. Identifying the location of the error and finding the error vector requires only look-up tables and does not require arithmetic operations. In order to minimize the excess space, an extended algorithm is also proposed in which the number of syndromes and look-up tables increases with the number of information moduli, but the locations of errors can still be identified without requiring iterative computations. By using the approximate method, we have reduced the computational complexity of the algorithm for calculating the syndrome from quadratic to linear-logarithmic, depending on the number of bits in the dynamic range.
{"title":"Efficient implementation of error correction codes in modular code","authors":"N. Kucherov, V. Kuchukov, E. Golimblevskaia, N. Kuchukova, I. Vashchenko, E. Kuchukova","doi":"10.47350/iccs-de.2021.09","DOIUrl":"https://doi.org/10.47350/iccs-de.2021.09","url":null,"abstract":"The article develops an efficient implementation of an algorithm for detecting and correcting multivalued residual errors with a fixed number of calculations of the syndrome, regardless of the set of moduli size. Criteria for uniqueness are given that can be met by selecting moduli from a set of primes to satisfy the desired error correction capability. An extended version of the algorithm with an increase in the number of syndromes depending on the number of information moduli is proposed. It is proposed to remove the restriction imposed on the size of redundant moduli. Identifying the location of the error and finding the error vector requires only look-up tables and does not require arithmetic operations. In order to minimize the excess space, an extended algorithm is also proposed in which the number of syndromes and look-up tables increases with the number of information moduli, but the locations of errors can still be identified without requiring iterative computations. By using the approximate method, we have reduced the computational complexity of the algorithm for calculating the syndrome from quadratic to linear-logarithmic, depending on the number of bits in the dynamic range.","PeriodicalId":210887,"journal":{"name":"International Workshop on Information, Computation, and Control Systems for Distributed Environments","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2021-07-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125685942","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 : 2021-07-24DOI: 10.47350/iccs-de.2021.02
M. Babenko, A. Tchernykh, A. Redvanov, A. Djurabaev
In today's world, the problem of information security is becoming critical. One of the most common cryptographic approaches is the elliptic curve cryptosystem. However, in elliptic curve arithmetic, the scalar point multiplication is the most expensive compared to the others. In this paper, we analyze the efficiency of the scalar multiplication on elliptic curves comparing Affine, Projective, Jacobian, Jacobi-Chudnovsky, and Modified Jacobian representations of an elliptic curve. For each coordinate system, we compare Fast exponentiation, Nonadjacent form (NAF), and Window methods. We show that the Window method is the best providing lower execution time on considered coordinate systems.
{"title":"Comparative analysis of the scalar point multiplication algorithms in the NIST FIPS 186 elliptic curve cryptography","authors":"M. Babenko, A. Tchernykh, A. Redvanov, A. Djurabaev","doi":"10.47350/iccs-de.2021.02","DOIUrl":"https://doi.org/10.47350/iccs-de.2021.02","url":null,"abstract":"In today's world, the problem of information security is becoming critical. One of the most common cryptographic approaches is the elliptic curve cryptosystem. However, in elliptic curve arithmetic, the scalar point multiplication is the most expensive compared to the others. In this paper, we analyze the efficiency of the scalar multiplication on elliptic curves comparing Affine, Projective, Jacobian, Jacobi-Chudnovsky, and Modified Jacobian representations of an elliptic curve. For each coordinate system, we compare Fast exponentiation, Nonadjacent form (NAF), and Window methods. We show that the Window method is the best providing lower execution time on considered coordinate systems.","PeriodicalId":210887,"journal":{"name":"International Workshop on Information, Computation, and Control Systems for Distributed Environments","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2021-07-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130671621","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 : 2021-07-24DOI: 10.47350/iccs-de.2021.03
A. Davydov, Aleksandr Larionov, N. Nagul
The paper illustrates an application of the recently developed method of dealing with controlled automata-based discrete event systems with the help of logical inference. The method based on the calculus of positively constructed formulas is extended on the case of systems built out of sets of modules. Specifications restricting system behavior are also supposed to be modular. Due to the special features of the calculus of positively constructed formulas, it may be applied at the upper level of a robot group control system. The case study of mobile robots pushing a block to a target area is considered.
{"title":"Modular discrete event systems control based on logic inference","authors":"A. Davydov, Aleksandr Larionov, N. Nagul","doi":"10.47350/iccs-de.2021.03","DOIUrl":"https://doi.org/10.47350/iccs-de.2021.03","url":null,"abstract":"The paper illustrates an application of the recently developed method of dealing with controlled automata-based discrete event systems with the help of logical inference. The method based on the calculus of positively constructed formulas is extended on the case of systems built out of sets of modules. Specifications restricting system behavior are also supposed to be modular. Due to the special features of the calculus of positively constructed formulas, it may be applied at the upper level of a robot group control system. The case study of mobile robots pushing a block to a target area is considered.","PeriodicalId":210887,"journal":{"name":"International Workshop on Information, Computation, and Control Systems for Distributed Environments","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2021-07-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116637805","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 : 2021-07-24DOI: 10.47350/iccs-de.2021.14
Ž. Stojanov
Software maintenance has been recognized as the most demanding and costly phase in the software life cycle. Software maintenance tasks, although require a more complex set of skills and knowledge, are far less interesting to software engineers than software development tasks. In addition, insight into the scholarly literature revealed that the knowledge basis on software maintenance is significantly less than the knowledge base on software development. Due to the obvious constraints of small software companies, they do not have time, people, and other resources for assessing and improving their software maintenance practice. This paper presents the author’s reflections on experience in assessing and improving software maintenance practice in an indigenous micro software company.
{"title":"Software maintenance improvement in small software companies: Reflections on experiences","authors":"Ž. Stojanov","doi":"10.47350/iccs-de.2021.14","DOIUrl":"https://doi.org/10.47350/iccs-de.2021.14","url":null,"abstract":"Software maintenance has been recognized as the most demanding and costly phase in the software life cycle. Software maintenance tasks, although require a more complex set of skills and knowledge, are far less interesting to software engineers than software development tasks. In addition, insight into the scholarly literature revealed that the knowledge basis on software maintenance is significantly less than the knowledge base on software development. Due to the obvious constraints of small software companies, they do not have time, people, and other resources for assessing and improving their software maintenance practice. This paper presents the author’s reflections on experience in assessing and improving software maintenance practice in an indigenous micro software company.","PeriodicalId":210887,"journal":{"name":"International Workshop on Information, Computation, and Control Systems for Distributed Environments","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2021-07-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124164831","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 : 2021-07-24DOI: 10.47350/iccs-de.2021.15
S. Valeev, N. Kondratyeva, R. Karimov, M. Verkhoturov, Timur Islamgulov, L. Shekhtman
The problem of production planning as an element of Gartner enterprise architecture in a distributed organizational and technical system is considered on the example of a construction company of medium and large scale. Mathematical models for planning organizational and technical resources in a distributed system as elements of patterns are discussed. In the development of the information and application layers, field-proven solutions can be used as patterns. The approach to the organization of business processes of a construction company that allows solving the problem of optimal scheduling of construction works while simultaneously executing a number of projects by the company and, thus, increasing the management efficiency of a geographically distributed enterprise is considered. The enterprise architecture as a unified information environment for managers of a construction company, site managers, supply engineers, designers, and estimates is discussed.
{"title":"Production planning in a construction company as an element of Gartner enterprise architecture","authors":"S. Valeev, N. Kondratyeva, R. Karimov, M. Verkhoturov, Timur Islamgulov, L. Shekhtman","doi":"10.47350/iccs-de.2021.15","DOIUrl":"https://doi.org/10.47350/iccs-de.2021.15","url":null,"abstract":"The problem of production planning as an element of Gartner enterprise architecture in a distributed organizational and technical system is considered on the example of a construction company of medium and large scale. Mathematical models for planning organizational and technical resources in a distributed system as elements of patterns are discussed. In the development of the information and application layers, field-proven solutions can be used as patterns. The approach to the organization of business processes of a construction company that allows solving the problem of optimal scheduling of construction works while simultaneously executing a number of projects by the company and, thus, increasing the management efficiency of a geographically distributed enterprise is considered. The enterprise architecture as a unified information environment for managers of a construction company, site managers, supply engineers, designers, and estimates is discussed.","PeriodicalId":210887,"journal":{"name":"International Workshop on Information, Computation, and Control Systems for Distributed Environments","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2021-07-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127045280","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
扫码关注我们
求助内容：
应助结果提醒方式：