Кафедри
Постійне посилання на розділhttps://repository.kpi.kharkov.ua/handle/KhPI-Press/35393
Переглянути
5 результатів
Результати пошуку
Документ Algorithms and Data Structures(National Technical University "Kharkiv Polytechnic Institute", 2024) Bulba, S. S.; Brechko, V. O.; Kuchuk, N. G.The main data structures are presented, issues of algorithm analysis are discussed, and methods of achieving maximum asymptotic algorithm performance are covered. The material is illustrated with practical examples, and each section includes necessary problems and exercises. For students majoring in 123 "Computer Engineering".Документ Transaction Planning Methods in Hyperconverged Architecture Systems(Ceur-ws, 2019) Bulba, S. S.; Kuchuk, N. G.; Semenova, A.; Zhengbing, HuThe analysis of the features of the functioning of systems with hyperconverged architecture is carried out. Transaction efficiency in such systems is reduced compared to decentralized systems. The purpose of the research: to develop a method for planning transactions in systems with a hypeconvergent architecture, which will take into account the specifics of the functioning of such systems. The development of the method takes into account the centralized management of the transaction package and the distribution of various resources. Existing methods for determining the sequence of transactions in systems with hyperconverged architecture are considered. The methods that were considered were based on the greedy, clustering, and ant algorithms. For each method, its features and functioning scheme are determined. Analysis of existing methods showed the advantages of the greedy algorithm with a small system load. It is also proved that with the growth of information volumes and the number of simultaneously executed transactions, each of the methods considered is less effective than with decentralized management. Therefore, a method for planning the execution of transactions through the sharing of these optimization algorithms is proposed. This allowed to reduce the execution time of the optimal transaction plan in comparison with existing methods. The experiments showed that the effectiveness of the proposed method increases with increasing amount of information. Which is processed by a transaction package of a hyperconverged system.Документ Automated penetration testing method using deep machine learning technology(Національний технічний університет "Харківський політехнічний інститут", 2021) Semenov, S. S.; Weilin, Cao; Liqiang, Zhang; Bulba, S. S.The article developed a method for automated penetration testing using deep machine learning technology. The main purpose of the development is to improve the security of computer systems. To achieve this goal, the analysis of existing penetration testing methods was carried out and their main disadvantages were identified. They are mainly related to the subjectivity of assessments in the case of manual testing. In cases of automated testing, most authors confirm the fact that there is no unified effective solution for the procedures used. This contradiction is resolved using intelligent methods of analysis. It is proposed that the developed method be based on deep reinforcement learning technology. To achieve the main goal, a study was carried out of the Shadov system's ability to collect factual data for designing attack trees, as well as the Mulval platform for generating attack trees. A method for forming a matrix of cyber intrusions using the Mulval tool has been developed. The Deep Q - Lerning Network method has been improved for analyzing the cyber intrusion matrix and finding the optimal attack trajectory. In the study, according to the deep reinforcement learning method, the reward scores assigned to each node, according to the CVSS rating, were used. This made it possible to shrink the attack trees and identify an attack with a greater likelihood of occurring. A comparative study of the automated penetration testing method was carried out. The practical possibility of using the developed method to improve the security of a computer system has been revealed.Документ Classification of methods assessment and management risk development software(Харківський національний університет Повітряних Сил ім. Івана Кожедуба, 2016) Lysytsia, D. O.; Bulba, S. S.The paper deals with methods for assessing the risks of software development (Software). Revealed their strengths and weaknesses. The ways to improve the methods of qualitative risk assessment. The classification management of software development that will minimize the level of vulnerability in the software, in consequence of which enhance the quality of the product. Identified strengths and weaknesses of existing methods of risk management software development. The ways of further development of security software development.Документ Composite application distribution methods modeling(Національний технічний університет "Харківський політехнічний інститут", 2018) Bulba, S. S.The subject of consideration are algorithms for optimal distribution of existing pool of computing resources between composite applications and algorithm of utilization of resources on computing blocks. The purposeof the article is to analyze the results of simulation and mathematical modeling of the resource allocation process between composite applications, depending on the distribution option. The efficiency of existing dynamic planning algorithms that are related to the greedy algorithm class is considered. They find a locally optimal solution at each step. The boundary of effective planning of algorithms based on clustering approach is revealed. The efficiency of using ant colony optimization algorithm and algorithms of cluster approach using ant colony optimization algorithm is shown. The simulation of the distribution of the composite application is carried out, depending on the complexity of the graph construction. The dependence of the execution time of the composite application on utilization of resources on the calculated blocks is obtained. Using the resource utilization function, the quality of the distribution of composite application resources is analyzed, depending on the amount of data transferred to the calculations. Data on the quality of resource allocation is obtained, depending on such parameters as the time of implementation of the composite application, the volume of transmitted data, the complexity of the graph construction. A method for choosing the optimal resource allocation algorithm between composite applications depending on the listed parameters is proposed. This will allow you to quickly dispose of distributed computing blocks that are occupied by calculating a distributed task, which will speed up the computation of distributed tasks on an existing pool of computing blocks.