Нові надходження

• Вантажиться...

  Тип елементу:Документ,

  Method for predicting the flight path of long-range unmanned aerial systems based on the elite ants algorithm

  (Національний технічний університет "Харківський політехнічний інститут", 2026) Khudov, Hennadii; Kivshar, Oleksandr; Khizhnyak, Irina; Taran, Ihor; Solomonenko, Yuriy

  Показати більше

  The subject matter of the article is a method for predicting the flight path of long-range unmanned aerial systems based on the elite ants algorithm. The goal is to develop a method for predicting the flight path of long-range unmanned aerial systems. The tasks are: analysis of existing methods for laying flight paths, development of a method for predicting the flight path of long-range unmanned aerial systems based on the elite ant algorithm, practical verification of the operation of the developed method, conducting experimental studies on predicting the flight path of movement using the method based on a simple ant algorithm and based on the elite ant algorithm, conducting a comparative analysis of the obtained experimental results. The methods used are: graph modeling, multi-criteria optimization, simple ant algorithm, ant algorithm based on elite ants, computer modeling, and comparative analysis of results. The following results are obtained. The methods of laying flight paths are analyzed depending on the approach to optimization, taking into account the specified flight restrictions. They are divided into four main groups, and their main advantages and disadvantages are determined. We will give a formal description of the problem of predicting the path of long-range unmanned aerial systems based on the ant algorithm. A simple ant algorithm and an elite ant algorithm are considered. A method of predicting the path of long-range unmanned aerial systems based on the elite ant algorithm is developed. Experimental studies are conducted on the operation of the method of predicting the path of long-range unmanned aerial systems. A comparative assessment of the efficiency of the simple ant algorithm and the ant algorithm based on elite ants in solving the problem of predicting the optimal path of long-range unmanned aerial systems is carried out. Conclusions. Analysis of experimental studies showed that the use of the elite ant algorithm is more appropriate for the task of predicting the flight path of long-range unmanned aerial systems. The direction of further research is to optimize the input parameters of the elite ant’s algorithm to solve the problem of predicting the flight path of long-range UASs in order to increase its accuracy and stability.

  Показати більше
• Вантажиться...

  Тип елементу:Документ,

  Development of a multi-agent system for dynamic sdn control

  (Національний технічний університет "Харківський політехнічний інститут", 2026) Rukkas, Kyrylo; Morozova, Anastasiia; Zaretska, Iryna; Andriichenko, Yevheniia; Chumachenko, Dmytro

  Показати більше

  Relevance. Currently, the volume of transmitted information and the quality requirements for its transmission are increasing. Recently, Software-Defined Networking (SDN) technology has been gaining popularity; however, challenges arise related to the uncertainty of the SDN network state and its elements, as well as the integration of various data streams that have different quality delivery requirements. Therefore, the task of utilizing an intelligent multi-agent system (MAS) for managing SDN networks becomes relevant. The object of research is the process of managing SDN networks. The subject of the research is models and methods for managing SDN networks. The purpose of this paper is to develop a model for the interaction of intelligent agents to ensure the effective functioning of multi-agent systems (MAS) in dynamic management of SDN. Research results. Using the analytical framework of probabilistic temporal graphs, mathematical models have been developed for two options for coordinating agents in the dynamic management of SDN networks: a system with a coordinating agent and a self-regulating MAS. Based on the analysis of the obtained probabilistic temporal characteristics of various coordination options, it has been established that self-regulating MAS are advisable in situations where agents have sufficient knowledge to solve the overwhelming majority of emerging tasks, where these solutions are highly likely to be correct, the number of agents in the system is small, and there is a high probability of effective control over the decisions made.

  Показати більше
• Вантажиться...

  Тип елементу:Документ,

  Модернізація алгоритмів хешування при захисті інформації

  (ДВНЗ "Приазовський державний технічний університет", 2026) Рисований, Олександр Миколайович

  Показати більше

  У даному дослідженні розглядаються можливі шляхи до удосконалення алгоритмів хешування при захисті інформації. Головний аспект цієї проблеми – якісні показники алгоритмів не повинні бути гіршими від початкових значень. Найпростішим прийомом удосконалення відомих алгоритмів є шлях зменшення часу отримання хеш без зміни інших критеріїв оцінювання. Це досягається за рахунок використання інструкцій паралельної обробки даних набору AVX2. Наступною проблемою, яка вирішується у роботі є перевірка колізій при отриманні хеш та відповідність якісних показників початковим.

  Показати більше
• Вантажиться...

  Тип елементу:Документ,

  Design of a multilevel architecture for optimizing virtual machine migration

  (Національний технічний університет "Харківський політехнічний інститут", 2026) Kuchuk, Nina; Shyshatskyi, Andrii; Radchenko, Viacheslav; Andrusenko, Yuliia; Klivets, Sergii

  Показати більше

  The paper considers the problem of designing a multi-tiered control structure for optimizing virtual machine migration processes in virtualized data centers. The relevance of the study is due to the growth of computing workloads, resource heterogeneity, and the need to ensure high performance and energy efficiency of the infrastructure while maintaining QoS (quality of service). Inefficient VM migration can lead to node overload, increased delays, and additional resource costs. The purpose of the paper is to develop a multi-tiered virtual machine migration management model that provides adaptive resource allocation, reduced downtime, and minimized costs for moving virtual machines. The object of the study is the processes of functioning of a virtualized data center, and the subject is methods and models for optimizing VM migration in a multi-tiered control architecture. The proposed structure provides for strategic, tactical and operational levels of management, which allows combining long-term resource planning with operational response to load changes. The work takes into account the criteria of load balancing, energy efficiency, network traffic minimization and SLA (Service Level Agreement) provision. The results of the study can be used in the design of cloud and grid infrastructures to increase the efficiency of computing resources and ensure stable operation of services under dynamic load conditions. The areas of further research are the implementation of intelligent decision-making algorithms and the use of simulation modeling to assess the effectiveness of the proposed structure.

  Показати більше
• Вантажиться...

  Тип елементу:Документ,

  Methods of information systems synthesis

  (Національний технічний університет "Харківський політехнічний інститут", 2026) Dunaiev, Sergii; Milevskyi, Stanislav; Kushnerov, Oleksandr; Sokol, Vladyslav; Voitko, Oleksandr

  Показати більше

  This paper presents a detailed analysis of the problem of constructing encoders for linear block codes, with a special emphasis on low-density parity-check (LDPC) codes. The aim of this paper is to provide a comprehensive description of the mathematical methods for the transition from the verification matrix to the efficient coding process. Both classical linear algebra approaches and specialized methods for sparse matrices. Results. The fundamental algebraic constructions underlying the duality between the generating and checking matrices over Galois fields, in particular GF (2), are considered. The classical Gaussian exclusion method for systematic coding is analyzed in detail and its shortcomings in the context of LDPC codes, related to the fill in phenomenon and loss of sparsity, are revealed. The central place in the study is occupied by the Approximate Lower Triangulation method proposed by Richardson and Urbanky, which allows achieving linear coding complexity. The article contains a detailed description of matrix preprocessing algorithms, mathematical derivation of formulas for calculating parity bits, as well as an analysis of quasicyclic constructions used in modern telecommunications standards (5G, Wi-Fi). Full numerical examples of transformations for low-dimensional codes and a detailed analysis of the LDPC encoder architecture are given. Conclusion. The solution was to abandon the explicit use of the generating matrix in favor of approximate triangulation methods of the check matrix and the use of quasicyclic structures, which has become standard in 5G and Wi-Fi. The integration of algebraic-geometric methods opens up new prospects for creating codes with specified properties.

  Показати більше