The dynamic development and rapid updating of information and communication technologies (ICT) has created a suitable environment for gesture control of modern computer and robot systems. It is noted that gestures are a necessary component in the communication process. At the same time, it is possible to control the equipment without contact with the support of methods that allow to select and recognize hand gestures. Sufficient work has been done and achievements have been made in the direction of automation and gesture control of technology. The study notes that such systems are more flexible and can easily adapt to people's changing needs. Building a human-machine interface speeds up the communication process and expands the user's capabilities. Gesture control technologies for computer and robotic systems have great potential. A comparative analysis of the parameters of gesture-controlled technologies is shown in the table.
{"title":"Overview of Gesture Control Technologies","authors":"K. S. Gurbanova","doi":"10.17587/it.30.300-306","DOIUrl":"https://doi.org/10.17587/it.30.300-306","url":null,"abstract":"The dynamic development and rapid updating of information and communication technologies (ICT) has created a suitable environment for gesture control of modern computer and robot systems. It is noted that gestures are a necessary component in the communication process. At the same time, it is possible to control the equipment without contact with the support of methods that allow to select and recognize hand gestures. Sufficient work has been done and achievements have been made in the direction of automation and gesture control of technology. The study notes that such systems are more flexible and can easily adapt to people's changing needs. Building a human-machine interface speeds up the communication process and expands the user's capabilities. Gesture control technologies for computer and robotic systems have great potential. A comparative analysis of the parameters of gesture-controlled technologies is shown in the table.","PeriodicalId":504905,"journal":{"name":"Informacionnye Tehnologii","volume":" 920","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-06-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141364091","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}
A modern approach to the design of large-scale electronic computing equipment is inconceivable without using previous similar developments in the current project. It is quite natural in this case to use previously developed digital cell libraries as a base. When a separate library cell is included in a large project, there is no need to calculate signal transmission delays, power consumption and layout of the included cell — all this is obtained in advance at the stage of characterization of library elements. This approach allows to significantly accelerate the development of the product as a whole. The stage of characterization of digital libraries requires significant time and computing resources, which is why it receives increased attention from developers of computer-aided design systems for microelectronic equipment. This article discusses some aspects of building a digital cell library characterization system. The description of the web-based library characterization system developed by the author is given. The main features that distinguish the system from the rest are an interactive approach to building the system, its web—oriented nature (i.e. the system is located on a web server and is available for communication via any web browser on the Internet), a large number of auxiliary procedures, a unique graphical representation of the results obtained. In addition to the above, it may be noted the simplicity of preparing the source data, the ease of switching between the "initial circuit"/ "circuit with extracted parasitic elements" modeling modes, as well as between the so-called "modeling edges": the normal, worst and best combination of temperature and supply voltage. To speed up calculations in the system, two modes of parallelization of modeling processes are provided at the user's choice.
{"title":"Web-Based Digital Cell Library Characterization System","authors":"A. A. Lyalinsky","doi":"10.17587/it.30.227-239","DOIUrl":"https://doi.org/10.17587/it.30.227-239","url":null,"abstract":"A modern approach to the design of large-scale electronic computing equipment is inconceivable without using previous similar developments in the current project. It is quite natural in this case to use previously developed digital cell libraries as a base. When a separate library cell is included in a large project, there is no need to calculate signal transmission delays, power consumption and layout of the included cell — all this is obtained in advance at the stage of characterization of library elements. This approach allows to significantly accelerate the development of the product as a whole. The stage of characterization of digital libraries requires significant time and computing resources, which is why it receives increased attention from developers of computer-aided design systems for microelectronic equipment. This article discusses some aspects of building a digital cell library characterization system. The description of the web-based library characterization system developed by the author is given. The main features that distinguish the system from the rest are an interactive approach to building the system, its web—oriented nature (i.e. the system is located on a web server and is available for communication via any web browser on the Internet), a large number of auxiliary procedures, a unique graphical representation of the results obtained. In addition to the above, it may be noted the simplicity of preparing the source data, the ease of switching between the \"initial circuit\"/ \"circuit with extracted parasitic elements\" modeling modes, as well as between the so-called \"modeling edges\": the normal, worst and best combination of temperature and supply voltage. To speed up calculations in the system, two modes of parallelization of modeling processes are provided at the user's choice.","PeriodicalId":504905,"journal":{"name":"Informacionnye Tehnologii","volume":"29 8","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-05-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140979924","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}
Vyacheslav Vladimirovich Morozov, V. A. Nemtinov, Yu. V. Protasova
The technology of creating an information virtual space is considered, one of the stages of which is the development of thematic excursions. The article focuses on the development of a virtual guide model, which is based on graph theory, for oriented viewing of objects and events of historical reconstruction. As an example, a historical reconstruction was carried out and a virtual museum was created on memorable places associated with the life and activities of the Chicherin family, whose prominent representatives were G. V. Chicherin and his uncle B. N. Chicherin. Chicherin is one of the founders of the constitutional law of Russia, a philosopher, historian, publicist, teacher. He developed the first model of the atom, an honorary member of the Russian Physico-Chemical Society (on the recommendation of Mendeleev). G. V. Chicherin — the first People's Commissar of Foreign Affairs of the USSR, a diplomat. When creating a virtual historical space, the software environments Twinmotion, Bigscreen and 3DVista Virtual Tour Pro were used. The virtual tour solves a number of tasks: an educational platform for schoolchildren, students; joint remote solution of issues related to the modeling of various studied objects, territories, memorable places; conducting remote online excursions to virtual museums, cultural objects with a guide. Keywords: technology for creating virtual excursions, cultural heritage sites, graph theory, historical reconstruction, virtual space, Twinmotion, 3DVista Virtual Tour, "live"guide, Bigscreen
文章考虑了创建信息虚拟空间的技术，其中一个阶段是开发专题游览。文章重点介绍了基于图论的虚拟导游模型的开发情况，该模型用于定向查看历史重建的对象和事件。例如，我们进行了历史重建，并创建了一个虚拟博物馆，展示与奇切林家族生活和活动有关的值得纪念的地方，奇切林家族的杰出代表是格-瓦-奇切林和他的叔叔比-尼-奇切林。契切林是俄罗斯宪法的创始人之一，也是哲学家、历史学家、宣传家和教师。他建立了第一个原子模型，是俄罗斯物理化学学会荣誉会员（门捷列夫推荐）。G. V. Chicherin--苏联第一任外交人民委员，外交官。在创建虚拟历史空间时，使用了 Twinmotion、Bigscreen 和 3DVista Virtual Tour Pro 等软件环境。虚拟游览解决了一系列任务：为中小学生提供教育平台；共同远程解决与各种研究对象、领土、值得纪念的地方的建模有关的问题；在导游的带领下远程在线游览虚拟博物馆、文物。关键词：创建虚拟游览的技术、文化遗址、图论、历史重建、虚拟空间、Twinmotion、3DVista 虚拟游览、"现场 "导游、大屏幕
{"title":"Formation of Thematic Virtual Tours of Cultural Heritage Objects Based on Graph Theory","authors":"Vyacheslav Vladimirovich Morozov, V. A. Nemtinov, Yu. V. Protasova","doi":"10.17587/it.30.269-276","DOIUrl":"https://doi.org/10.17587/it.30.269-276","url":null,"abstract":"The technology of creating an information virtual space is considered, one of the stages of which is the development of thematic excursions. The article focuses on the development of a virtual guide model, which is based on graph theory, for oriented viewing of objects and events of historical reconstruction. As an example, a historical reconstruction was carried out and a virtual museum was created on memorable places associated with the life and activities of the Chicherin family, whose prominent representatives were G. V. Chicherin and his uncle B. N. Chicherin. Chicherin is one of the founders of the constitutional law of Russia, a philosopher, historian, publicist, teacher. He developed the first model of the atom, an honorary member of the Russian Physico-Chemical Society (on the recommendation of Mendeleev). G. V. Chicherin — the first People's Commissar of Foreign Affairs of the USSR, a diplomat. When creating a virtual historical space, the software environments Twinmotion, Bigscreen and 3DVista Virtual Tour Pro were used. The virtual tour solves a number of tasks: an educational platform for schoolchildren, students; joint remote solution of issues related to the modeling of various studied objects, territories, memorable places; conducting remote online excursions to virtual museums, cultural objects with a guide. Keywords: technology for creating virtual excursions, cultural heritage sites, graph theory, historical reconstruction, virtual space, Twinmotion, 3DVista Virtual Tour, \"live\"guide, Bigscreen","PeriodicalId":504905,"journal":{"name":"Informacionnye Tehnologii","volume":"22 10","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-05-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140982241","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}
The main provisions for one of the promising directions of methods development of mixed integer linear programming are presented. The method is based on an iterative application of a cutting-plane procedure that takes into account, as fully as possible, the properties of the problems being solved. Heuristic procedures are applied for the synthesis of cutting-planes as an intermediate step substantiating the construction of a solution tree. The properties of the generated algorithms are experimentally investigated, the prospects and ways of developing the method and expanding the classes of discrete optimization problems to be solved are determined. The material is illustrated with simple visual examples.
{"title":"Heuristic Procedures for the Synthesis of Cutting Hyperplanes in Iterative Algorithms for Solving Mixed Linear Programming with Boolean Variables Problems","authors":"Yu. A. Mezentsev","doi":"10.17587/it.30.240-251","DOIUrl":"https://doi.org/10.17587/it.30.240-251","url":null,"abstract":"The main provisions for one of the promising directions of methods development of mixed integer linear programming are presented. The method is based on an iterative application of a cutting-plane procedure that takes into account, as fully as possible, the properties of the problems being solved. Heuristic procedures are applied for the synthesis of cutting-planes as an intermediate step substantiating the construction of a solution tree. The properties of the generated algorithms are experimentally investigated, the prospects and ways of developing the method and expanding the classes of discrete optimization problems to be solved are determined. The material is illustrated with simple visual examples.","PeriodicalId":504905,"journal":{"name":"Informacionnye Tehnologii","volume":"77 11","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-05-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140978879","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}
Video surveillance systems, cameras, and video stream processing are actively used in many enterprises as a monitoring and control tool for regular and emergency situations, as well as staff activities. The application of intelligent algorithms allows tracking and minimizing operator errors, but these approaches are highly sensitive to the quality of the original video, presence of noise, and low resolution. On the other hand, such video surveillance systems may be limited by network bandwidth. Therefore, this work considers an adaptive video stream processing algorithm that ensures efficient operation of computer vision and object recognition methods while minimizing the amount of transmitted information within network bandwidth constraints. The proposed algorithm addresses the task of determining boundary conditions that ensure the functionality of object recognition algorithms with the least amount of video stream. Corresponding experimental studies were conducted to determine the minimum values of frame resolution and video bitrate. The algorithm was tested in organizing video surveillance at warehouse complexes. The obtained results can be used in developing decision support systems for enterprises in various industries requiring intelligent processing of large volumes of data.
{"title":"Adaptive Processing of Camera Video Stream with Limitations on the Network Data Transmission Bandwidth","authors":"M. S. Nikolyukin, A. D. Obukhov","doi":"10.17587/it.30.252-260","DOIUrl":"https://doi.org/10.17587/it.30.252-260","url":null,"abstract":"Video surveillance systems, cameras, and video stream processing are actively used in many enterprises as a monitoring and control tool for regular and emergency situations, as well as staff activities. The application of intelligent algorithms allows tracking and minimizing operator errors, but these approaches are highly sensitive to the quality of the original video, presence of noise, and low resolution. On the other hand, such video surveillance systems may be limited by network bandwidth. Therefore, this work considers an adaptive video stream processing algorithm that ensures efficient operation of computer vision and object recognition methods while minimizing the amount of transmitted information within network bandwidth constraints. The proposed algorithm addresses the task of determining boundary conditions that ensure the functionality of object recognition algorithms with the least amount of video stream. Corresponding experimental studies were conducted to determine the minimum values of frame resolution and video bitrate. The algorithm was tested in organizing video surveillance at warehouse complexes. The obtained results can be used in developing decision support systems for enterprises in various industries requiring intelligent processing of large volumes of data.","PeriodicalId":504905,"journal":{"name":"Informacionnye Tehnologii","volume":"51 16","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-05-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140980790","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}
The article is devoted to the description of the developed method and tools for translating high-level programming languages into an abstract syntactic tree. The peculiarity of the technique is that it is based on the object-attribute (OA) architecture of a computing system belonging to the dataflow class. The syntactic tree synthesized by the translator is a frame-like dynamic structure. The methodology includes the format and methodology of syntactic tree synthesis, the method for describing the translation algorithm, and the specialized programming language (OA-language) for describing a translation algorithm.
{"title":"High-Level Language Translation Controlled by Dataflow","authors":"S. M. Salibekyan","doi":"10.17587/it.30.261-268","DOIUrl":"https://doi.org/10.17587/it.30.261-268","url":null,"abstract":"The article is devoted to the description of the developed method and tools for translating high-level programming languages into an abstract syntactic tree. The peculiarity of the technique is that it is based on the object-attribute (OA) architecture of a computing system belonging to the dataflow class. The syntactic tree synthesized by the translator is a frame-like dynamic structure. The methodology includes the format and methodology of syntactic tree synthesis, the method for describing the translation algorithm, and the specialized programming language (OA-language) for describing a translation algorithm.","PeriodicalId":504905,"journal":{"name":"Informacionnye Tehnologii","volume":"17 9","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-05-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140982264","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}
P. Posokhov, E. A. Rudaleva, S. Skrylnikov, O. V. Makhnytkina, V. I. Kabarov
The article deals with the joint application of linguistic rules and machine learning models to solve the problem of knowledge extraction from dialog data in Russian. Linguistic rules based on morphological, syntactic and grammatical features are used for automatic markup of the training dataset. The neural network model based on the T5 architecture was trained in multitasking mode, which implied solving the following tasks: a) answer generation based on the dialog history and the facts about the agent's persona found relevant to this history; b) extraction of facts about the persona using the generation method based on the last replica of the agent. The Toloka Persona Chat Rus dataset was used for the experiments. The metrics of both approaches show their applicability to the Russian language, for which no studies have been conducted before.
文章论述了如何联合应用语言规则和机器学习模型来解决从俄语对话数据中提取知识的问题。基于形态、句法和语法特征的语言规则被用于自动标记训练数据集。基于 T5 架构的神经网络模型在多任务模式下进行了训练，这意味着要解决以下任务：a) 根据对话历史和发现的与对话历史相关的代理角色事实生成答案；b) 根据代理的最后一次复制使用生成方法提取角色事实。实验使用的是 Toloka Persona Chat Rus 数据集。这两种方法的度量结果表明，它们都适用于俄语，而俄语以前还没有进行过相关研究。
{"title":"Persona Knowledge Extraction from Dialog Data in Russian Language","authors":"P. Posokhov, E. A. Rudaleva, S. Skrylnikov, O. V. Makhnytkina, V. I. Kabarov","doi":"10.17587/it.30.190-197","DOIUrl":"https://doi.org/10.17587/it.30.190-197","url":null,"abstract":"The article deals with the joint application of linguistic rules and machine learning models to solve the problem of knowledge extraction from dialog data in Russian. Linguistic rules based on morphological, syntactic and grammatical features are used for automatic markup of the training dataset. The neural network model based on the T5 architecture was trained in multitasking mode, which implied solving the following tasks: a) answer generation based on the dialog history and the facts about the agent's persona found relevant to this history; b) extraction of facts about the persona using the generation method based on the last replica of the agent. The Toloka Persona Chat Rus dataset was used for the experiments. The metrics of both approaches show their applicability to the Russian language, for which no studies have been conducted before.","PeriodicalId":504905,"journal":{"name":"Informacionnye Tehnologii","volume":"44 11","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-04-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140662380","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}
The paper proposes a modified algorithm for generating programs for the synthesis of network models expressed in terms of Petri nets [8]. The algorithm is based on the use of boundedly growing strings and the ability to generate them in lexicographic order. To reduce the number of possible synthesis programs, the introduction of limiting conditions imposed on the set partition tree is considered. Taking into account the imposed restrictions, a new tree of smaller dimension is built, which also preserves the lexicographic order of the limitedly growing strings it contains. A comparative assessment of the effectiveness of a new algorithm for generating boundedly growing strings with restrictions and a standard algorithm without restrictions, which is described by D. Knuth, is given. The proposed algorithm can be used to solve problems of synthesizing models of complex computational structures, building parallel systems, parallelizing algorithms and solving other problems related to the creation of efficient distributed systems.
本文提出了一种生成程序的改进算法，用于合成以 Petri 网表示的网络模型 [8]。该算法基于有界增长字符串的使用以及按词典顺序生成字符串的能力。为了减少可能的合成程序数量，我们考虑在集合分区树上引入限制条件。考虑到所施加的限制条件，我们建立了一棵维度更小的新树，它还保留了所包含的有限增长字符串的词法顺序。本文对生成有限制增长字符串的新算法和 D. Knuth 所描述的无限制标准算法的有效性进行了比较评估。所提出的算法可用于解决复杂计算结构模型的合成、并行系统的构建、算法并行化以及与创建高效分布式系统相关的其他问题。
{"title":"Generation of PN-Model Synthesis Programs with Restrictions","authors":"V. P. Kulagin, N. D. Muravyev","doi":"10.17587/it.30.206-213","DOIUrl":"https://doi.org/10.17587/it.30.206-213","url":null,"abstract":"The paper proposes a modified algorithm for generating programs for the synthesis of network models expressed in terms of Petri nets [8]. The algorithm is based on the use of boundedly growing strings and the ability to generate them in lexicographic order. To reduce the number of possible synthesis programs, the introduction of limiting conditions imposed on the set partition tree is considered. Taking into account the imposed restrictions, a new tree of smaller dimension is built, which also preserves the lexicographic order of the limitedly growing strings it contains. A comparative assessment of the effectiveness of a new algorithm for generating boundedly growing strings with restrictions and a standard algorithm without restrictions, which is described by D. Knuth, is given. The proposed algorithm can be used to solve problems of synthesizing models of complex computational structures, building parallel systems, parallelizing algorithms and solving other problems related to the creation of efficient distributed systems.","PeriodicalId":504905,"journal":{"name":"Informacionnye Tehnologii","volume":"54 48","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-04-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140662091","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}
This article substantiates the feasibility of using the Data-Driven approach in education and creating a "one-stop shop" platform. The paper describes the advantages and disadvantages of modern domestic and foreign ED Tech products, on the basis of which a conclusion is made about the necessary functionality of the designed platform. The article describes the software requirements for the UML design methodology, describes the choice of creation tools, and considers the program for implementing the tool system, including the database structure. It is shown that such a scheme is scalable and can be easily supplemented with other functionality. Based on the requirements, a project prototype was created, located at kuzovkin.info; the project consists of several parts, including a database with tasks, an online simulator, an online board, a voice messenger and articles with task theory. In addition, in the future, it is planned to use an adaptive learning algorithm using artificial intelligence. It is shown that this prototype is successfully used for teaching students. In the future, a web portal with similar tools is planned to be introduced into the work of online schools.
{"title":"Educational Web Portal Software for Teachers, Tutors and Students","authors":"V. V. Kuzovkin","doi":"10.17587/it.30.214-223","DOIUrl":"https://doi.org/10.17587/it.30.214-223","url":null,"abstract":"This article substantiates the feasibility of using the Data-Driven approach in education and creating a \"one-stop shop\" platform. The paper describes the advantages and disadvantages of modern domestic and foreign ED Tech products, on the basis of which a conclusion is made about the necessary functionality of the designed platform. The article describes the software requirements for the UML design methodology, describes the choice of creation tools, and considers the program for implementing the tool system, including the database structure. It is shown that such a scheme is scalable and can be easily supplemented with other functionality. Based on the requirements, a project prototype was created, located at kuzovkin.info; the project consists of several parts, including a database with tasks, an online simulator, an online board, a voice messenger and articles with task theory. In addition, in the future, it is planned to use an adaptive learning algorithm using artificial intelligence. It is shown that this prototype is successfully used for teaching students. In the future, a web portal with similar tools is planned to be introduced into the work of online schools.","PeriodicalId":504905,"journal":{"name":"Informacionnye Tehnologii","volume":"112 4","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-04-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140659184","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}
In the process of solving the problem of managing large technical systems, the data obtained from various measuring devices are processed by known methods. On the basis of their analysis, acceptable solutions are formed, and as a result of the choice, the best is made. Some of the data are parametrized and are stochastic, i.e. they are random variables. However, the information for making management decisions must be strictly deterministic. Therefore, the main task of stochastic data processing is to obtain deterministic invariants suitable for use as information in the decision-making process. The article presents an algorithm for verifying data that allows you to determine which type they belong to: Gaussian or non-Gaussian. The results of this test will make it possible to make the right choice of mathematical apparatus for obtaining deterministic invariants. The scientific novelty of the algorithm lies in the fact that the mathematical apparatus of the algorithm is developed within the framework of vector rank analysis. Its essence lies in the fact that a sample is made from the "general population" of available data, on which the average and standard are determined. Then a part of the data taken from the "general population" is added to this sample, and the average and standard are determined again. Such a procedure for increasing the sample continues until the "general population" is completely exhausted. Next, the normalized dependence of the mean and standard values on the sample size is constructed. At the same time, if the dependence has a pronounced tendency to stabilize, then the data belong to the Gaussian type. In another case, they are considered non-Gaussian. The efficiency of the algorithm has been confirmed in the framework of studies of a significant number of samples of data on the power consumption of various large technical systems.
{"title":"Data Validation Algorithm Based on Vector Rank Analysis","authors":"O. R. Kivchun","doi":"10.17587/it.30.198-205","DOIUrl":"https://doi.org/10.17587/it.30.198-205","url":null,"abstract":"In the process of solving the problem of managing large technical systems, the data obtained from various measuring devices are processed by known methods. On the basis of their analysis, acceptable solutions are formed, and as a result of the choice, the best is made. Some of the data are parametrized and are stochastic, i.e. they are random variables. However, the information for making management decisions must be strictly deterministic. Therefore, the main task of stochastic data processing is to obtain deterministic invariants suitable for use as information in the decision-making process. The article presents an algorithm for verifying data that allows you to determine which type they belong to: Gaussian or non-Gaussian. The results of this test will make it possible to make the right choice of mathematical apparatus for obtaining deterministic invariants. The scientific novelty of the algorithm lies in the fact that the mathematical apparatus of the algorithm is developed within the framework of vector rank analysis. Its essence lies in the fact that a sample is made from the \"general population\" of available data, on which the average and standard are determined. Then a part of the data taken from the \"general population\" is added to this sample, and the average and standard are determined again. Such a procedure for increasing the sample continues until the \"general population\" is completely exhausted. Next, the normalized dependence of the mean and standard values on the sample size is constructed. At the same time, if the dependence has a pronounced tendency to stabilize, then the data belong to the Gaussian type. In another case, they are considered non-Gaussian. The efficiency of the algorithm has been confirmed in the framework of studies of a significant number of samples of data on the power consumption of various large technical systems.","PeriodicalId":504905,"journal":{"name":"Informacionnye Tehnologii","volume":"55 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-04-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140662088","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
扫码关注我们
求助内容：
应助结果提醒方式：