Кафедра "Комп'ютерна інженерія та програмування"

Постійне посилання колекціїhttps://repository.kpi.kharkov.ua/handle/KhPI-Press/1095

Офіційний сайт кафедри https://web.kpi.kharkov.ua/cep

Від 26 листопада 2021 року кафедра має назву – "Комп’ютерна інженерія та програмування"; попередні назви – “Обчислювальна техніка та програмування”, “Електронні обчислювальні машини”, первісна назва – кафедра “Математичні та лічильно-вирішальні прилади та пристрої”.

Кафедра “Математичні та лічильно-вирішальні прилади та пристрої” заснована 1 вересня 1961 року. Організатором та її першим завідувачем був професор Віктор Георгійович Васильєв.

Кафедра входить до складу Навчально-наукового інституту комп'ютерних наук та інформаційних технологій Національного технічного університету "Харківський політехнічний інститут". Перший випуск – 24 інженери, підготовлених кафедрою, відбувся в 1964 році. З тих пір кафедрою підготовлено понад 4 тисячі фахівців, зокрема близько 500 для 50 країн світу.

У складі науково-педагогічного колективу кафедри працюють: 11 докторів технічних наук, 21 кандидат технічних наук, 1 – економічних, 1 – фізико-математичних, 1 – педагогічних, 1 доктор філософії; 9 співробітників мають звання професора, 14 – доцента, 2 – старшого наукового співробітника.

Переглянути

Результати пошуку

Зараз показуємо 1 - 10 з 14

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, Hu
The 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.
Mathematical model of the information system synthesis process
(ФОП Петров В. В., 2021) Kuchuk, N. G.; Shyman, A.; Davydov, Viacheslav; Hrebeniuk, Daryna
Analysis of information structure modeling methods
(Петров В. В., 2022) Kuchuk, N. G.; Kotova, O.; Rybalchenko, А.
Analysis of the level of automation of traffic management processes
(Петров В. В., 2022) Kuchuk, N. G.; Shyman, A.; Davydov, V. V.; Hrebeniuk, D.
A mathematical model for managing the distribution of information flows for MPLS-TE networks under critical conditions
(Scientific research publishing, 2018) Hani, A.; Mohammad, A.; Mohammad, S.; Ahmed, A.; Shmatkov, S.; Kuchuk, N. G.; Fawaz, K.
The optimal load distribution over a set of independent paths for Multi-Protocol Label Switching for Traffic Engineering (MPLS-TE) networks is regarded as important issue; accordingly, this paper has developed a mathematical method of optimal procedures for choosing the shortest path. As a criterion for choosing the number of paths, a composite criterion is used that takes into account several parameters such as total path capacity and maximum path delay. The mathematical analysis of using the developed method is carried out, and the simulation results show that there are a limited number of the most significant routes that can maximize the composite quality of service indicator, which depends on the network connectivity and the amount of the traffic. The developed technological proposals allow increasing the utilization factor of the network by 20%.
The method of improving the efficiency of routes selection in networks of connection with the possibility of self-organization
(2019) Kuchuk, N. G.; Mohammed, A.; Shyshatskyi, A.; Nalapko, O.
One of the directions improving the efficiency of communication networks with the ability to self-organization is the choice of rational route information transmission from sender to recipient. In the course of the analysis it was established that the existing scientific approaches for forecasting the state of the routes have high computational complexity, which prevents them from predicting the state of the transmission routes in real time. Therefore, the authors of this research conducted a methodology for forecasting the time overload of data transmission routes in mobile radio networks of radio networks with the possibility of self-organization. As the basic mathematical device, the neural network of Elman was used based on the calculation of the network neuron potential. The essence of the proposed method is to decide on the search for new routes based on the predicted time of overloading data transmission routes in mobile radio networks with the possibility of self-organization. The proposed method allows to predict the time of overloading of data transmission routes in mobile radio networks with the possibility of self-organization by reducing the computational complexity of the neural network and application of the algorithm for training the neural network. It is advisable to use the proposed methodology in radio communication with programmable architecture by developing appropriate software, which will increase the efficiency of choosing a route of data transmission in radio communication networks with the ability to self-organize.
Resources redistribution method of university e-learning on the hyperconvergent platform
(National Aerospace University n. a. N. E. Zhukovsky "KhAI", 2018) Merlak, V.; Kuchuk, N. G.; Shmatkov, S.; Nechausov, A.
In this article a method of constructing a graph model of university e-learning functioning process, deployed on a hyperconvergent platform, proposed. The method is based on problems and objectives of the system structure analysis. The created graph considers available e-learning resources.
Method of information flow control in a hyperconvergent system
(Харківський національний університет Повітряних Сил ім. Івана Кожедуба, 2019) Kuchuk, N. G.
In a hyperconvergent system, maintenance costs are reduced. But system performance decreases due to centralized control. Therefore, in such a system, the task of optimizing the distribution of information flows has a significant role. The purpose of the article is to develop a method of information flow control in a hyperconvergent system. Results of the research. The analysis of the causes of packet delay in a hyperconvergent system has been performed. An analytical expression is obtained for calculating the value of the data packet delay on the route. The main factors of delay are revealed. Analytical expressions are obtained for calculating the maximum intensities of information flows in a hyperconvergent system. A method for selecting the optimal packet length is proposed. The formulation of the problem of distribution of information flows along routes is formulated. Conclusions. The proposed method is effective with centralized control and the absence of heterogeneous components. This method allows you to reduce the cost of computing resources, especially with increasing network dimensionality.
Mathematical model of e-learning transaction process
(National Technical University of Ukraine "Igor Sikorsky Kyiv Polytechnic Institute", 2018) Shmatkov, S. I.; Kuchuk, N. G.
Background. In the case of hyper-converged management, granular updating of the system is impossible. In addition, the processing time of transactions compared to distributed systems increases. Therefore, the task of ensuring the timely execution of transactions is relevant. Objective. The aim of the paper is to develop a mathematical model of e-learning transactions in a hyper-converged environment supporting electronic educational resources. In this model, timely execution of transaction requests minimizes the costs of the computing resource. Methods. A two-stage method for constructing a mathematical model is proposed. At the first stage, a set of valid transaction options for resources is defined. At the second stage, there is an optimal time allocation of resources between transactions. Results. A mathematical model of the transaction process is developed. The adequacy of the model is verified with the help of the simulation model. Conclusions. A mathematical model of e-learning transactions in a hyper-converged environment supporting electronic educational resources is proposed. This model allows minimizing the cost of a computational resource with timely execution of transaction requests.