Volodymyr BUTENKO

Prof. Volodymyr BUTENKO

SCS, Ukrainian State University of Railway Transport, Kharkiv, Kharkivs’ka Oblast’, Ukraine
orcid

Research Focus & Metrics

Academic Career Length

10Years (2017-Present)

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

Representative Publications

View All Publications
23 February 2022 in RADIOELECTRONIC AND COMPUTER SYSTEMS
Verified
Journal Article
Closed access
PDF file
VMValentin Moiseenko
Valentin Moiseenko
ОGОleksandra Golovko
Оleksandra Golovko
Volodymyr BUTENKOVolodymyr BUTENKO
Volodymyr BUTENKO
KTKaryna Trubchaninova
Karyna Trubchaninova
The subject of the article is the processes of synthesis of a mathematical model of control objects functioning in computer information-control systems of critical purpose for the needs of high-speed railway transport. The main emphasis is on modeling the movement of a passenger train in the high-speed system of Ukrzaliznytsia. The aim is to study the process of regulating the speed of railway vehicles under conditions of uncertainty in the primary information of microprocessor information-control systems of railway transport. Tasks: determination of the criterion of the safety of railway vehicle auto control; obtain a mathematical model of train movement under conditions of uncertainty; check the adequacy of the model. The method used is the mathematical apparatus of discrete models. The following results have been obtained. The mathematical model of train movement developed in this work includes not only information on train position, reference point, direction, and speed of the vehicle but also a variable control indicator to reflect the process of railway traffic adequately. The study shows that, based on the synthesized model, it is possible to use the so-called fuzzy distance between adjacent trains. This approach improves the accuracy of determining the critical distance between trains, the time required to eliminate the risk of collision, the start time of braking, and braking time considering the angle of inclination of the track, as well as the distance of the braking distance. The necessity to determine the control indicator, its value for many points of time, while there is a reduction in speed for the safe movement of trains. Based on the proposed mathematical model, a computer simulation of the process was performed to determine the required time reserve for the train driver to respond to changes in the speed of the previous train, as well as speed ranges that require immediate emergency action. Conclusions. The scientific novelty of the obtained results is the development of a mathematical model of the behavior of mobile units in computer systems for critical use for the needs of railway transport in the presence of failures in the primary information from sensors that record motion parameters. The behavior of the control system at different values of train speed and changes in the value of the interval of the accompanying journey is studied. The theory of traction calculations in computer control systems for mobile units has been further developed. The obtained scientific results will be used in the development of an application program for many critical computer systems for railway.

30 October 2017 in Eastern-European Journal of Enterprise Technologies
Verified
Journal Article
Open access
PDF file
SLSergey Listrovoy
Sergey Listrovoy
Volodymyr BUTENKOVolodymyr BUTENKO
Volodymyr BUTENKO
VBVolodymyr Bryksin
Volodymyr Bryksin
OGOleksandra Golovko
Oleksandra Golovko
The paper recommends the MCP solution method with small time complexity O(2n3log2n), that allows from one viewpoint solving such problems as definition of the maximum independent sets and minimum vertex covers in graphs, as well as isomorphism of graphs and isomorphic embedding, as far as all those problems may be converted within polynomial time into MCP. This set of problems is formal models of a wide range of management problems in rail transport information systems, and the solution thereof requires the algorithms for their realization with small time complexity. Therefore, the time complexity decrease is an actual task. In the paper, admissibility of decreasing the time complexity of the suggested procedure A for solving MCP is based on using the subsidiary procedure B for defining the estimates of the largest graph clique values, and on its basis the method of the problem solution is described in the paper as procedure A. Procedure A allows forming the cliques on the base of each vertex of graph i. As the process of clique formation on the base of each vertex may be independent, then procedure A may be effectively vectorized. It makes possible in case of using processing cells for solving the MCP to decrease the time complexity of its operation to O(2n2log2n), and the mentioned complex of the problems will be solved in a real-time scale.

12 March 2019 in Procedia Computer Science
Verified
Journal Article
Open access
PDF file
VMValentyn Moiseenko
Valentyn Moiseenko
OKOleksandr Kameniev
Oleksandr Kameniev
Volodymyr BUTENKOVolodymyr BUTENKO
Volodymyr BUTENKO
VGVitalii Gaievskyi
Vitalii Gaievskyi
In the report, microprocessor systems of railway automation are represented by a distributed system of computing [1]. Under certain conditions it is expedient to represent them as a non-oriented graph and optimize with the use of the method of the least-clique [2]. The prognostic model and the method of determining the failures of hardware of microprocessor systems of railway automatics have been developed. They allow you to determine the probability of a device failure from a particular group using Student’s t-distribution, maximum likelihood estimation and uneven observations. Unlike existing approaches to forecasting, the proposed method takes into account the limited amount of control systems operation statistical data [3-6]

31 January 2020
Verified
Book Chapter
Closed access
PDF file
VMValentin Moiseenko
Valentin Moiseenko
Volodymyr BUTENKOVolodymyr BUTENKO
Volodymyr BUTENKO
OGOleksandra Golovko
Oleksandra Golovko
OKOleksandr Kameniev
Oleksandr Kameniev
VGVitalii Gaievskyi
Vitalii Gaievskyi

28 June 2024 in Інформаційно-керуючі системи на залізничному транспорті
Verified
Journal Article
Open access
PDF file
ВМВалентин Іванович Мойсеєнко
Валентин Іванович Мойсеєнко
Volodymyr BUTENKOVolodymyr BUTENKO
Volodymyr BUTENKO
АСАнтон Костянтинович Соколов
Антон Костянтинович Соколов
ВЯВсеволод Олександрович Яранцев
Всеволод Олександрович Яранцев
В статті розглянуто абстрактний діалог. Кожній вершині графа співвідноситься конкретне зображення на екрані електронного пристрою. Натомість дуги вказують на можливі зміни станів при виконанні користувачем конкретної операції. Зважаючи на поставлену ціль наукового дослідження наукова проблема може бути сформульована в термінах математичного апарату комбінаторно – оптимізаційної задачі. В межах термінології інформаційної підтримки подорожувальників, користуючись діаграмою сценаріїв обґрунтовано доцільність розгляду двох альтернативних підходів організації діалогу користувача з мобільним пристроєм: діалог, що керується користувачем та діалог, який керується системою. Доведено, що діалог, який керується користувачем потребує конкретної дії після кожного кроку, що наглядно ілюструє граф абстрактного переходу.

21 September 2020 in Інформаційно-керуючі системи на залізничному транспорті
Verified
Journal Article
Open access
PDF file
ВМВ. І. Мойсеєнко
В. І. Мойсеєнко
Volodymyr BUTENKOVolodymyr BUTENKO
Volodymyr BUTENKO
СЧС. Г. Чуб
С. Г. Чуб
ОГО. В. Головко
О. В. Головко