{"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":null,"pages":null},"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}
{"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":null,"pages":null},"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
{"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":null,"pages":null},"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}
{"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":null,"pages":null},"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}
{"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":null,"pages":null},"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}
{"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":null,"pages":null},"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
{"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":null,"pages":null},"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}
{"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":null,"pages":null},"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}
{"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":null,"pages":null},"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}
{"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":null,"pages":null},"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}