Oleksandr Makhovych

Dr. Oleksandr Makhovych

orcid

Research Focus & Metrics

Academic Career Length

7Years (2020-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
16 January 2022 in International Journal of Emerging Technology and Advanced Engineering
Verified
Journal Article
Open access
ADAndriy Dudnik
Andriy Dudnik
IBIvan Bakhov
Ivan Bakhov
OMOleksandr Makhovych
Oleksandr Makhovych
YRYulia Ryabokin
Yulia Ryabokin
OUOleksandr Usachenko
Oleksandr Usachenko
The paper discusses models and methods for improving the performance of wireless computer networks built based on the decomposition of the lower levels of the OSI reference model. A method to improve the performance of networks is suggested, which functionally combines the physical and network layers, which improves its efficiency in marginal reception areas almost twice. A model of the block diagram of a device for improving data transmission quality in marginal reception areas or those with insufficient noise immunity is developed based on the so-called communication quality status monitoring, as well as a model of the block diagram of a wireless adaptive capacity reallocation router based on dynamic channels capacity reallocation, which allows adequately reallocating IS resources depending on traffic and user priority. Keywords— Bluetooth, FIFO discipline, IEEE 802.11, OSI/ISO reference model, wireless computer networks.

1 January 2020 in Information systems and technologies security
Verified
Journal Article
Open access
PDF file
OMOleksandr Makhovych
Oleksandr Makhovych
RMRoman Mykolaichuk
Roman Mykolaichuk
VMVira Mykolaichuk
Vira Mykolaichuk
Using passwords remains the most common way to authenticate users for various types of information systems. This poses the challenge of securing the storage of user authentication information and protecting it from unauthorized access. In practice, various algorithms for secure password storage have become widespread. Mutually contradictory requirements for such algorithms for secure password storage, which on the one hand must be complex enough to coun ter various attacks, and on the other – simple to ensure the speed of the information system – determine the relevance of the study. There is a significant threat of direct search, especially given the fact that the computing power of CPUs and GPUs is constantly growing. Therefore, there is a need to be able to change the complexity of the hash code calcula tion, and therefore the amount of computation and time so as to significantly complicate the attack, but not cause dis comfort to the end user due to the delay in password verification. Among the known methods of secure password stor age are password encryption, the use of the hash function in the classical version, as well as the addition of salt and the use of iterations to calculate the hash code. The comparative analysis of the given methods is carried out in the work, their advantages and disadvantages are established, expedient areas of application of each method are outlined, the corresponding recommendations are developed. For the computational experiment, the tools of the Microsoft .NET Core 3.1 platform were used, which made it possible to set the time indicators of the hash code generation algorithm depending on the set parameters of the algorithm. The data obtained from the experiment can be used to select a method of securely storing passwords.

3 June 2026 in Computation
Verified
Journal Article
Open access
PDF file
Kravchenko YuriiKravchenko Yurii
Kravchenko Yurii
Serhii StavytskyiSerhii Stavytskyi
Serhii Stavytskyi
OMOleksandr Makhovych
Oleksandr Makhovych
ADAndriy Dudnik
Andriy Dudnik
RDRoman Dubik
Roman Dubik
YRYevhen Rudenko
Yevhen Rudenko
This paper considers a numerically stable discrete-time representation of the three-dimensional Constant Turn (CT) motion model within the Interacting Multiple Model (IMM) framework for radar tracking of maneuvering aerial targets. Classical discrete CT models used in Kalman-filter-based tracking contain singular expressions in the vicinity of zero and near-zero turn rates, which may degrade estimation accuracy and impair numerical robustness. To address this problem, a Maclaurin-series-based discretization of the three-dimensional CT model is developed, in which the state transition matrix and the process-noise-related matrices are approximated in polynomial form. Linear, quadratic, and cubic approximations are constructed and analyzed. The proposed CT model is integrated into a three-model IMM algorithm together with the Constant Velocity (CV) and Constant Acceleration (CA) models. The study includes both an internal comparison of Maclaurin approximations of different orders and an external comparison with the classical CT discretization and a Padé-based reference discretization. Numerical experiments are performed for representative three-dimensional maneuvering scenarios under radar measurement conditions. The obtained results show that the proposed discretization eliminates singular behavior near zero turn rate while preserving the tracking capability of the IMM estimator. The comparative analysis demonstrates that the quadratic Maclaurin approximation provides the most favorable trade-off between modeling accuracy, numerical stability, and computational cost. It yields tracking performance close to higher-order approximations and competitive with the Padé-based reference approach, while remaining simpler for practical implementation in real-time radar tracking systems. These results indicate that the proposed quadratic approximation is a suitable solution for maneuvering aerial target tracking in three-dimensional radar applications.