Pub Date : 2023-12-29DOI: 10.37661/1816-0301-2023-20-4-24-37
D. Cheremisinov, L. Cheremisinova
Objectives. The problem of functional verification of control devices with respect to their design specification is considered. When solving the problems of implementing and testing of discrete systems, one has to deal with the presence of parallelism in the behavior of interacting control objects, which is also displayed in the assignment for designing control systems. The aim of the work is to develop a method for simulating descriptions of such systems, which allows their behavior testing dynamically on the area limited by their possible functioning.Methods. The paper considers a class of control systems with parallelism of the processes occurring in them, which permits linearization of their execution. To specify the behavior of such control systems, it is proposed to use the PRALU language of parallel control algorithms, which is based on Petri nets and which allows to order events occurring during the device operation. An object-oriented approach to simulation of the description of the control algorithm at the transaction level is proposed. For this purpose, a TLM (Transaction-Level Modeling) model has been developed for describing the devices with behavior parallelism in PRALU language. The transaction level model describes a system as a set of interacting processes that run in parallel and determine the behavior of the system over time.Results. The key concepts of the TLM model for simulating the descriptions of control algorithms in the PRALU language are defined: data structure, transactions, processes, and a barrier mechanism for synchronization of parallel processes. A method is proposed for transforming the description of an algorithm in the language into a TLM model, which is based on the representation of language operations as compositions of elementary operations that are performed sequentially. The set of these operations forms the basis for the algorithmic decomposition of a parallel algorithm in PRALU language into intermediate language program that is executed strictly sequentially. Translators of this program into the Verilog and C languages have been developed, the results of their compilation are simulators of the behavior of control system.Conclusion. The proposed simulation method can be used to create a test bench for functional verification of the circuit implementation of control devices with behavior parallelism. In this case, test sequences for verifying the circuit implementation can be generated dynamically – in the process of simulating the description of the algorithm in the PRALU language directly the control device or system, which include the control algorithm and the algorithms of controlled objects behavior.
目的。考虑控制设备在设计规范方面的功能验证问题。在解决离散系统的实施和测试问题时，我们必须处理交互控制对象行为中存在的并行性问题，这种并行性在控制系统的设计任务中也有体现。这项工作的目的是开发一种模拟描述此类系统的方法，从而可以在受其可能功能限制的区域内对其行为进行动态测试。本文考虑了一类控制系统，该系统中发生的过程具有并行性，允许其执行线性化。为明确此类控制系统的行为，建议使用基于 Petri 网的并行控制算法 PRALU 语言，该语言允许对设备运行过程中发生的事件进行排序。该语言基于 Petri 网，可对设备运行过程中发生的事件进行排序。本文提出了一种面向对象的方法，用于在事务级对控制算法进行仿真描述。为此，开发了一个 TLM（事务级建模）模型，用于用 PRALU 语言描述具有行为并行性的设备。事务级模型将系统描述为一组交互进程，这些进程并行运行，并随着时间的推移决定系统的行为。定义了用于模拟 PRALU 语言控制算法描述的 TLM 模型的关键概念：数据结构、事务、进程和用于并行进程同步的障碍机制。提出了一种将语言中的算法描述转换为 TLM 模型的方法，该方法基于将语言操作表示为顺序执行的基本操作的组合。这些操作的集合构成了将 PRALU 语言中的并行算法分解为严格按顺序执行的中间语言程序的基础。该程序的 Verilog 和 C 语言翻译器已经开发出来，其编译结果就是控制系统行为的模拟器。所提出的仿真方法可用于创建测试台，以对具有行为并行性的控制设备的电路实现进行功能验证。在这种情况下，验证电路实现的测试序列可以动态生成--在用 PRALU 语言直接模拟控制设备或系统的算法描述的过程中生成，其中包括控制算法和受控对象行为的算法。
{"title":"Simulation of discrete control systems with parallelism of behavior","authors":"D. Cheremisinov, L. Cheremisinova","doi":"10.37661/1816-0301-2023-20-4-24-37","DOIUrl":"https://doi.org/10.37661/1816-0301-2023-20-4-24-37","url":null,"abstract":"Objectives. The problem of functional verification of control devices with respect to their design specification is considered. When solving the problems of implementing and testing of discrete systems, one has to deal with the presence of parallelism in the behavior of interacting control objects, which is also displayed in the assignment for designing control systems. The aim of the work is to develop a method for simulating descriptions of such systems, which allows their behavior testing dynamically on the area limited by their possible functioning.Methods. The paper considers a class of control systems with parallelism of the processes occurring in them, which permits linearization of their execution. To specify the behavior of such control systems, it is proposed to use the PRALU language of parallel control algorithms, which is based on Petri nets and which allows to order events occurring during the device operation. An object-oriented approach to simulation of the description of the control algorithm at the transaction level is proposed. For this purpose, a TLM (Transaction-Level Modeling) model has been developed for describing the devices with behavior parallelism in PRALU language. The transaction level model describes a system as a set of interacting processes that run in parallel and determine the behavior of the system over time.Results. The key concepts of the TLM model for simulating the descriptions of control algorithms in the PRALU language are defined: data structure, transactions, processes, and a barrier mechanism for synchronization of parallel processes. A method is proposed for transforming the description of an algorithm in the language into a TLM model, which is based on the representation of language operations as compositions of elementary operations that are performed sequentially. The set of these operations forms the basis for the algorithmic decomposition of a parallel algorithm in PRALU language into intermediate language program that is executed strictly sequentially. Translators of this program into the Verilog and C languages have been developed, the results of their compilation are simulators of the behavior of control system.Conclusion. The proposed simulation method can be used to create a test bench for functional verification of the circuit implementation of control devices with behavior parallelism. In this case, test sequences for verifying the circuit implementation can be generated dynamically – in the process of simulating the description of the algorithm in the PRALU language directly the control device or system, which include the control algorithm and the algorithms of controlled objects behavior.","PeriodicalId":37100,"journal":{"name":"Informatics","volume":" 21","pages":""},"PeriodicalIF":3.1,"publicationDate":"2023-12-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139143437","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 : 2023-12-29DOI: 10.37661/1816-0301-2023-20-4-7-23
V. N. Yarmolik, D. V. Demenkovets, V. V. Petrovskaya, A. A. Ivaniuk
Objectives. The aim of the work is to develop and analyze a formal model for describing complex linked coupling faults of memory devices and to formulate the necessary and sufficient conditions for their detection. The relevance of these studies lies in the fact that modern memory devices, characterized by a large amount of stored data and manufactured according to the latest technological standards, are distinguished by the manifestation of complex types of faults in them.Methods. The presented results are based on the classical theory and practice of march tests (March tests) of memory devices. In particular, the paper uses formal mathematical models for describing memory faults and shows their limitations for representing complex linked coupling faults. The main idea of the approach proposed by the authors is based on the use of a new formal description of such faults, the key element of which is the introduction of roles performed by the cells involved in the fault.Results. Three main roles are defined that cells of the complex linked coupling faults perform, namely the role of the aggressor (A), the role of the victim (V), as well as the role of both the victim and the aggressor (B), performed by two cells simultaneously in relation to each other. It is shown that the scenario for the implementation of the roles of memory failure cells is determined by the marching test used, and, first of all, by the address sequence used to access the cells. The procedure for setting a formal model of a linked fault is given, the basis of which is the roles performed by the cells included in the fault and the scenario specified by the test. A statement is given that determines, on the basis of a new formal description of linked coupling faults, the necessary and sufficient conditions for the detection of such faults. The presence of undetectable linked coupling faults is shown, and the conditions for their detection are formulated using multiple March tests. The conducted experimental studies have confirmed the validity of the formulated provisions of the article. On the basis of the classical example of a linked coupling fault, the fulfillment of necessary and sufficient conditions for its detection by a single march test is shown.Conclusion. The results of the research confirm that the proposed formal mathematical model for describing linked coupling faults makes it possible to determine their detection by marching tests. Within the framework of the proposed model, the necessary and sufficient conditions for detecting linked coupling faults by marching tests that detect single coupled faults are determined.
{"title":"Formal description model and conditions for detecting linked coupling faults of the memory devices","authors":"V. N. Yarmolik, D. V. Demenkovets, V. V. Petrovskaya, A. A. Ivaniuk","doi":"10.37661/1816-0301-2023-20-4-7-23","DOIUrl":"https://doi.org/10.37661/1816-0301-2023-20-4-7-23","url":null,"abstract":"Objectives. The aim of the work is to develop and analyze a formal model for describing complex linked coupling faults of memory devices and to formulate the necessary and sufficient conditions for their detection. The relevance of these studies lies in the fact that modern memory devices, characterized by a large amount of stored data and manufactured according to the latest technological standards, are distinguished by the manifestation of complex types of faults in them.Methods. The presented results are based on the classical theory and practice of march tests (March tests) of memory devices. In particular, the paper uses formal mathematical models for describing memory faults and shows their limitations for representing complex linked coupling faults. The main idea of the approach proposed by the authors is based on the use of a new formal description of such faults, the key element of which is the introduction of roles performed by the cells involved in the fault.Results. Three main roles are defined that cells of the complex linked coupling faults perform, namely the role of the aggressor (A), the role of the victim (V), as well as the role of both the victim and the aggressor (B), performed by two cells simultaneously in relation to each other. It is shown that the scenario for the implementation of the roles of memory failure cells is determined by the marching test used, and, first of all, by the address sequence used to access the cells. The procedure for setting a formal model of a linked fault is given, the basis of which is the roles performed by the cells included in the fault and the scenario specified by the test. A statement is given that determines, on the basis of a new formal description of linked coupling faults, the necessary and sufficient conditions for the detection of such faults. The presence of undetectable linked coupling faults is shown, and the conditions for their detection are formulated using multiple March tests. The conducted experimental studies have confirmed the validity of the formulated provisions of the article. On the basis of the classical example of a linked coupling fault, the fulfillment of necessary and sufficient conditions for its detection by a single march test is shown.Conclusion. The results of the research confirm that the proposed formal mathematical model for describing linked coupling faults makes it possible to determine their detection by marching tests. Within the framework of the proposed model, the necessary and sufficient conditions for detecting linked coupling faults by marching tests that detect single coupled faults are determined.","PeriodicalId":37100,"journal":{"name":"Informatics","volume":" 6","pages":""},"PeriodicalIF":3.1,"publicationDate":"2023-12-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139143492","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 : 2023-12-29DOI: 10.37661/1816-0301-2023-20-4-48-55
Yu. V. Malinkovsky, V. A. Nemilostivaya
Objectives. An exponential queuing network with single-line poles is considered, which differs from the Gordon – Newell network only that the waiting time for service requests at the poles of the network is a random variable with conditional distribution for a fixed number of requests at the pole as an exponential distribution. Requests at poles and requests that did not get the service are moving through the network in accordance with different routing matrices. The objective was to investigate a queuing system and to establish sufficient conditions for its ergodicity, also to find stationary distribution of given network.Methods. Methods of mathematical modeling and analytical research of queuing networks are used.Results. A theorem generalizing the Gordon – Newell theorem is proved.Conclusion. The possibility of varying the routing matrices of served and unserved requests makes it possible to take into account a wide variety of practical situations and reduce the load in the bottlenecks of the network under study. It is very important in the design and modernization of information and computer networks.
{"title":"Closed Gordon – Newell network with single-line poles and exponentially limited request waiting time","authors":"Yu. V. Malinkovsky, V. A. Nemilostivaya","doi":"10.37661/1816-0301-2023-20-4-48-55","DOIUrl":"https://doi.org/10.37661/1816-0301-2023-20-4-48-55","url":null,"abstract":"Objectives. An exponential queuing network with single-line poles is considered, which differs from the Gordon – Newell network only that the waiting time for service requests at the poles of the network is a random variable with conditional distribution for a fixed number of requests at the pole as an exponential distribution. Requests at poles and requests that did not get the service are moving through the network in accordance with different routing matrices. The objective was to investigate a queuing system and to establish sufficient conditions for its ergodicity, also to find stationary distribution of given network.Methods. Methods of mathematical modeling and analytical research of queuing networks are used.Results. A theorem generalizing the Gordon – Newell theorem is proved.Conclusion. The possibility of varying the routing matrices of served and unserved requests makes it possible to take into account a wide variety of practical situations and reduce the load in the bottlenecks of the network under study. It is very important in the design and modernization of information and computer networks.","PeriodicalId":37100,"journal":{"name":"Informatics","volume":"99 4","pages":""},"PeriodicalIF":3.1,"publicationDate":"2023-12-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139146244","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 : 2023-12-29DOI: 10.37661/1816-0301-2023-20-4-56-68
Yu. N. Gorbacheva, V. K. Polevikov
Objectives. A variational-difference method for numerical simulation of equilibrium capillary surfaces based on the minimization of the energy functional is proposed. As a test task a well-known axisymmetric hydrostatic problem on equilibrium shapes of a drop adjacent to a horizontal rotating plane under gravity is considered. The mathematical model of the problem is built on the basis of the variational principle: the shape of the drop satisfies the minimum total energy for a given volume. The problem of the functional minimization is reduced to a system of nonlinear equations using the finite element method. To solve the system a Newton's iterative method is applied.Methods. The variational-difference approach (the finite element method) is used. The finite linear functions are chosen as basic functions.Results. Equilibrium shapes of a drop on a rotating plane are constructed by the finite element method in a wide range of defining parameters: Bond number, rotational Weber number and wetting angle. The influence of these parameters on the shape of a drop is investigated. The numerical results are matched with the results obtained using the iterative-difference approach over the entire range of physical stability with respect to axisymmetric perturbations.Conclusion. The finite element method responds to the loss of stability of a drop with respect to axisymmetric perturbations. Therefore it can be used to study the stability of the equilibrium of axisymmetric capillary surfaces.
{"title":"A variational-difference method for numerical simulation of equilibrium capillary surfaces","authors":"Yu. N. Gorbacheva, V. K. Polevikov","doi":"10.37661/1816-0301-2023-20-4-56-68","DOIUrl":"https://doi.org/10.37661/1816-0301-2023-20-4-56-68","url":null,"abstract":"Objectives. A variational-difference method for numerical simulation of equilibrium capillary surfaces based on the minimization of the energy functional is proposed. As a test task a well-known axisymmetric hydrostatic problem on equilibrium shapes of a drop adjacent to a horizontal rotating plane under gravity is considered. The mathematical model of the problem is built on the basis of the variational principle: the shape of the drop satisfies the minimum total energy for a given volume. The problem of the functional minimization is reduced to a system of nonlinear equations using the finite element method. To solve the system a Newton's iterative method is applied.Methods. The variational-difference approach (the finite element method) is used. The finite linear functions are chosen as basic functions.Results. Equilibrium shapes of a drop on a rotating plane are constructed by the finite element method in a wide range of defining parameters: Bond number, rotational Weber number and wetting angle. The influence of these parameters on the shape of a drop is investigated. The numerical results are matched with the results obtained using the iterative-difference approach over the entire range of physical stability with respect to axisymmetric perturbations.Conclusion. The finite element method responds to the loss of stability of a drop with respect to axisymmetric perturbations. Therefore it can be used to study the stability of the equilibrium of axisymmetric capillary surfaces.","PeriodicalId":37100,"journal":{"name":"Informatics","volume":"71 s317","pages":""},"PeriodicalIF":3.1,"publicationDate":"2023-12-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139146619","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 : 2023-12-29DOI: 10.37661/1816-0301-2023-20-4-87-100
Yu. S. Hetsevich, Ya. S. Zianouka, D. I. Latyshevich, A. A. Bakunovich, A. Y. Drahun, M. A. Kazlova
Objectives. А prototype system for automated removal of homonyms in Belarusian and Russian electronic texts is described. This is due to the urgent problem of automatic text processing at the morphological level, the process of which is complicated by the inflection of the Belarusian language with a diverse and rich system of morphological characteristics of parts of speech.Methods. The work uses regular homographs identification methods and knowledge-based methods.Results. Methods and approaches for designing systems for automatic detection of homographs are proposed. An algorithm for identifying homographs on the basis of knowledge-based method has been developed. An effective and fast-acting prototype for their removal in Russian and Belarusian has been implemented.Conclusion. A working prototype of the homograph search is presented, which is the first resource for removing ambiguity for the Belarusian language in open access.
{"title":"A model of homographs automatic identification for the Belarusian language","authors":"Yu. S. Hetsevich, Ya. S. Zianouka, D. I. Latyshevich, A. A. Bakunovich, A. Y. Drahun, M. A. Kazlova","doi":"10.37661/1816-0301-2023-20-4-87-100","DOIUrl":"https://doi.org/10.37661/1816-0301-2023-20-4-87-100","url":null,"abstract":"Objectives. А prototype system for automated removal of homonyms in Belarusian and Russian electronic texts is described. This is due to the urgent problem of automatic text processing at the morphological level, the process of which is complicated by the inflection of the Belarusian language with a diverse and rich system of morphological characteristics of parts of speech.Methods. The work uses regular homographs identification methods and knowledge-based methods.Results. Methods and approaches for designing systems for automatic detection of homographs are proposed. An algorithm for identifying homographs on the basis of knowledge-based method has been developed. An effective and fast-acting prototype for their removal in Russian and Belarusian has been implemented.Conclusion. A working prototype of the homograph search is presented, which is the first resource for removing ambiguity for the Belarusian language in open access.","PeriodicalId":37100,"journal":{"name":"Informatics","volume":" 27","pages":""},"PeriodicalIF":3.1,"publicationDate":"2023-12-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139143647","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 : 2023-12-29DOI: 10.37661/1816-0301-2023-20-4-69-86
A. Brazhuk, E. Olizarovich
Objectives. The main purpose of the work is the experimental verification of the method of automatic threat modelling based on the ontological approach using the example of multicomponent container applications presented in the form of data flow diagrams.Methods. Methods of ontological modelling and knowledge management are used in the work. The Web Ontology Language is used to represent knowledge; automatic reasoning based on description logics is used for threat modelling.Results. A machine-readable set (dataset) of 200 data flow diagrams is developed; each diagram is obtained from the configuration of a real container application and is presented as an ontology and a knowledge graph. An ontological two-level domain-specific threat model of container applications is formed. An experiment is conducted to compare the coverage by threats using the common approach and using domain-specific threats for created dataset. For 95 % of the diagrams, the domain-specific threat model showed the coverage similar or greater than the common approach.Conclusion. The results of the experiment prove the suitability and effectiveness of the ontological approach for automatic threat modelling. The created dataset can be used for various research in the field of automation of threat modelling.
{"title":"Ontological analysis in the problems of container applications threat modelling","authors":"A. Brazhuk, E. Olizarovich","doi":"10.37661/1816-0301-2023-20-4-69-86","DOIUrl":"https://doi.org/10.37661/1816-0301-2023-20-4-69-86","url":null,"abstract":"Objectives. The main purpose of the work is the experimental verification of the method of automatic threat modelling based on the ontological approach using the example of multicomponent container applications presented in the form of data flow diagrams.Methods. Methods of ontological modelling and knowledge management are used in the work. The Web Ontology Language is used to represent knowledge; automatic reasoning based on description logics is used for threat modelling.Results. A machine-readable set (dataset) of 200 data flow diagrams is developed; each diagram is obtained from the configuration of a real container application and is presented as an ontology and a knowledge graph. An ontological two-level domain-specific threat model of container applications is formed. An experiment is conducted to compare the coverage by threats using the common approach and using domain-specific threats for created dataset. For 95 % of the diagrams, the domain-specific threat model showed the coverage similar or greater than the common approach.Conclusion. The results of the experiment prove the suitability and effectiveness of the ontological approach for automatic threat modelling. The created dataset can be used for various research in the field of automation of threat modelling.","PeriodicalId":37100,"journal":{"name":"Informatics","volume":"101 399","pages":""},"PeriodicalIF":3.1,"publicationDate":"2023-12-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139146237","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 : 2023-12-29DOI: 10.37661/1816-0301-2023-20-4-38-47
K. A. Radkevich, S. V. Kruglikov
Objectives. The interaction between a "smart city" and digital economy can be explored and analyzed within the framework of the structural-parametric adaptation method. This method allows the adaptation of the parameters and structure of the system model to ensure optimal functioning in the conditions of changing external environment. The concept of a "smart city" can be examined based on the principles of structural-parametric adaptation, such as interoperability, decentralization, virtualization, real-time operation, modularity, and service orientation. Within the scope of structural-parametric analysis, a "smart city" is regarded as a complex multi-level cyber-physical system.Methods. Structural-parametric adaptation methods and structural-parametric optimization methods are employed.Results. A general form of the algorithm for structural-parametric adaptation of the system and a mathematical model of the problem of structural-parametric optimization of "smart city" systems have been developed.Conclusion. To address the challenges of constructing, optimizing, and adapting the structure of a "smart city" system, it is necessary to consider the technical requirements of the system and the capabilities of the infrastructure used, and to apply the structural-parametric adaptation method.
{"title":"Method of structural-parametric adaptation of \"smart city\" to digital economy","authors":"K. A. Radkevich, S. V. Kruglikov","doi":"10.37661/1816-0301-2023-20-4-38-47","DOIUrl":"https://doi.org/10.37661/1816-0301-2023-20-4-38-47","url":null,"abstract":"Objectives. The interaction between a \"smart city\" and digital economy can be explored and analyzed within the framework of the structural-parametric adaptation method. This method allows the adaptation of the parameters and structure of the system model to ensure optimal functioning in the conditions of changing external environment. The concept of a \"smart city\" can be examined based on the principles of structural-parametric adaptation, such as interoperability, decentralization, virtualization, real-time operation, modularity, and service orientation. Within the scope of structural-parametric analysis, a \"smart city\" is regarded as a complex multi-level cyber-physical system.Methods. Structural-parametric adaptation methods and structural-parametric optimization methods are employed.Results. A general form of the algorithm for structural-parametric adaptation of the system and a mathematical model of the problem of structural-parametric optimization of \"smart city\" systems have been developed.Conclusion. To address the challenges of constructing, optimizing, and adapting the structure of a \"smart city\" system, it is necessary to consider the technical requirements of the system and the capabilities of the infrastructure used, and to apply the structural-parametric adaptation method.","PeriodicalId":37100,"journal":{"name":"Informatics","volume":"30 45","pages":""},"PeriodicalIF":3.1,"publicationDate":"2023-12-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139147575","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 : 2023-12-28DOI: 10.3390/informatics11010003
Sandro Pullo, Remo Pareschi, Valentina Piantadosi, Francesco Salzano, Roberto Carlini
Addressing the critical challenges of resource inefficiency and environmental impact in the agrifood sector, this study explores the integration of Internet of Things (IoT) technologies with IOTA’s Tangle, a Distributed Ledger Technology (DLT). This integration aims to enhance sustainable agricultural practices, using rice cultivation as a case study of high relevance and reapplicability given its importance in the food chain and the high irrigation requirement of its cultivation. The approach employs sensor-based intelligent irrigation systems to optimize water efficiency. These systems enable real-time monitoring of agricultural parameters through IoT sensors. Data management is facilitated by IOTA’s Tangle, providing secure and efficient data handling, and integrated with MongoDB, a Database Management System (DBMS), for effective data storage and retrieval. The collaboration between IoT and IOTA led to significant reductions in resource consumption. Implementing sustainable agricultural practices resulted in a 50% reduction in water usage, 25% decrease in nitrogen consumption, and a 50% to 70% reduction in methane emissions. Additionally, the system contributed to lower electricity consumption for irrigation pumps and generated comprehensive historical water depth records, aiding future resource management decisions. This study concludes that the integration of IoT with IOTA’s Tangle presents a highly promising solution for advancing sustainable agriculture. This approach significantly contributes to environmental conservation and food security. Furthermore, it establishes that DLTs like IOTA are not only viable but also effective for real-time monitoring and implementation of sustainable agricultural practices.
{"title":"Integrating IOTA’s Tangle with the Internet of Things for Sustainable Agriculture: A Proof-of-Concept Study on Rice Cultivation","authors":"Sandro Pullo, Remo Pareschi, Valentina Piantadosi, Francesco Salzano, Roberto Carlini","doi":"10.3390/informatics11010003","DOIUrl":"https://doi.org/10.3390/informatics11010003","url":null,"abstract":"Addressing the critical challenges of resource inefficiency and environmental impact in the agrifood sector, this study explores the integration of Internet of Things (IoT) technologies with IOTA’s Tangle, a Distributed Ledger Technology (DLT). This integration aims to enhance sustainable agricultural practices, using rice cultivation as a case study of high relevance and reapplicability given its importance in the food chain and the high irrigation requirement of its cultivation. The approach employs sensor-based intelligent irrigation systems to optimize water efficiency. These systems enable real-time monitoring of agricultural parameters through IoT sensors. Data management is facilitated by IOTA’s Tangle, providing secure and efficient data handling, and integrated with MongoDB, a Database Management System (DBMS), for effective data storage and retrieval. The collaboration between IoT and IOTA led to significant reductions in resource consumption. Implementing sustainable agricultural practices resulted in a 50% reduction in water usage, 25% decrease in nitrogen consumption, and a 50% to 70% reduction in methane emissions. Additionally, the system contributed to lower electricity consumption for irrigation pumps and generated comprehensive historical water depth records, aiding future resource management decisions. This study concludes that the integration of IoT with IOTA’s Tangle presents a highly promising solution for advancing sustainable agriculture. This approach significantly contributes to environmental conservation and food security. Furthermore, it establishes that DLTs like IOTA are not only viable but also effective for real-time monitoring and implementation of sustainable agricultural practices.","PeriodicalId":37100,"journal":{"name":"Informatics","volume":"48 4","pages":""},"PeriodicalIF":3.1,"publicationDate":"2023-12-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139151244","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 : 2023-12-20DOI: 10.3390/informatics11010002
Isaac Machorro-Cano, J. O. Olmedo-Aguirre, G. Alor-Hernández, L. Rodríguez-Mazahua, Laura Nely Sánchez-Morales, Nancy Pérez-Castro
Cloud-based platforms have gained popularity over the years because they can be used for multiple purposes, from synchronizing contact information to storing and managing user fitness data. These platforms are still in constant development and, so far, most of the data they store is entered manually by users. However, more and better wearable devices are being developed that can synchronize with these platforms to feed the information automatically. Another aspect that highlights the link between wearable devices and cloud-based health platforms is the improvement in which the symptomatology and/or physical status information of users can be stored and syn-chronized in real-time, 24 h a day, in health platforms, which in turn enables the possibility of synchronizing these platforms with specialized medical software to promptly detect important variations in user symptoms. This is opening opportunities to use these platforms as support for monitoring disease symptoms and, in general, for monitoring the health of users. In this work, the characteristics and possibilities of use of four popular platforms currently available in the market are explored, which are Apple Health, Google Fit, Samsung Health, and Fitbit.
多年来，云平台越来越受欢迎，因为它们可以用于多种用途，从同步联系人信息到存储和管理用户健身数据。这些平台仍在不断开发中，到目前为止，它们存储的大部分数据都是由用户手动输入的。不过，目前正在开发更多更好的可穿戴设备，它们可以与这些平台同步，自动提供信息。可穿戴设备与基于云的健康平台之间的另一个联系是，用户的症状和/或身体状况信息可以每天 24 小时实时存储和同步到健康平台中，从而使这些平台可以与专业医疗软件同步，及时发现用户症状的重要变化。这就为利用这些平台作为监测疾病症状和监测用户健康状况提供了机会。在这项工作中，我们探讨了目前市场上流行的四个平台的特点和使用可能性，这四个平台是 Apple Health、Google Fit、Samsung Health 和 Fitbit。
{"title":"Cloud-Based Platforms for Health Monitoring: A Review","authors":"Isaac Machorro-Cano, J. O. Olmedo-Aguirre, G. Alor-Hernández, L. Rodríguez-Mazahua, Laura Nely Sánchez-Morales, Nancy Pérez-Castro","doi":"10.3390/informatics11010002","DOIUrl":"https://doi.org/10.3390/informatics11010002","url":null,"abstract":"Cloud-based platforms have gained popularity over the years because they can be used for multiple purposes, from synchronizing contact information to storing and managing user fitness data. These platforms are still in constant development and, so far, most of the data they store is entered manually by users. However, more and better wearable devices are being developed that can synchronize with these platforms to feed the information automatically. Another aspect that highlights the link between wearable devices and cloud-based health platforms is the improvement in which the symptomatology and/or physical status information of users can be stored and syn-chronized in real-time, 24 h a day, in health platforms, which in turn enables the possibility of synchronizing these platforms with specialized medical software to promptly detect important variations in user symptoms. This is opening opportunities to use these platforms as support for monitoring disease symptoms and, in general, for monitoring the health of users. In this work, the characteristics and possibilities of use of four popular platforms currently available in the market are explored, which are Apple Health, Google Fit, Samsung Health, and Fitbit.","PeriodicalId":37100,"journal":{"name":"Informatics","volume":"5 3","pages":""},"PeriodicalIF":3.1,"publicationDate":"2023-12-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138956039","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 : 2023-12-19DOI: 10.3390/informatics11010001
Andrew W. Vargo, Kohei Yamaguchi, M. Iwata, Koichi Kise
Vocabulary acquisition and retention is an essential part of learning a foreign language and many learners use flashcard applications to repetitively increase vocabulary retention. However, it can be difficult for learners to remember new words and phrases without any context. In this paper, we propose a system that allows users to acquire new vocabulary with media which gives context to the words. Theoretically, this use of multimedia context should enable users to practice with interest and increased motivation, which has been shown to enhance the effects of contextual language learning. An experiment with 46 English as foreign language learners showed better retention after two weeks with the proposed system as compared to ordinary flashcards. However, the impact was not universally beneficial to all learners. An analysis of participant attributes that were gathered through surveys and questionnaires shows a link between personality and learning traits and affinity for learning with this system. This result indicates that the proposed system provides a significant advantage in vocabulary retention for some users, while other users should stay with traditional flashcard applications. The implications of this study indicate the need for the development of more personalized learning applications.
{"title":"A Context-Based Multimedia Vocabulary Learning System for Mobile Users","authors":"Andrew W. Vargo, Kohei Yamaguchi, M. Iwata, Koichi Kise","doi":"10.3390/informatics11010001","DOIUrl":"https://doi.org/10.3390/informatics11010001","url":null,"abstract":"Vocabulary acquisition and retention is an essential part of learning a foreign language and many learners use flashcard applications to repetitively increase vocabulary retention. However, it can be difficult for learners to remember new words and phrases without any context. In this paper, we propose a system that allows users to acquire new vocabulary with media which gives context to the words. Theoretically, this use of multimedia context should enable users to practice with interest and increased motivation, which has been shown to enhance the effects of contextual language learning. An experiment with 46 English as foreign language learners showed better retention after two weeks with the proposed system as compared to ordinary flashcards. However, the impact was not universally beneficial to all learners. An analysis of participant attributes that were gathered through surveys and questionnaires shows a link between personality and learning traits and affinity for learning with this system. This result indicates that the proposed system provides a significant advantage in vocabulary retention for some users, while other users should stay with traditional flashcard applications. The implications of this study indicate the need for the development of more personalized learning applications.","PeriodicalId":37100,"journal":{"name":"Informatics","volume":"115 30","pages":""},"PeriodicalIF":3.1,"publicationDate":"2023-12-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138959761","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
扫码关注我们
求助内容：
应助结果提醒方式：