Evgeniy Pavlenko
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Evgeniy Pavlenko has a total of 39 co-authors. Here are the top co-authors by number of shared publications:
- Dmitry P. Zegzhda
Peter the Great St. Petersburg Polytechnic University
7 shared publications Dmitry Zegzhda
Institute of Applied Mathematics and Mechanics, Peter the Great St. Petersburg Polytechnic University, St. Petersburg, Russia
6 shared publications- D. S. Lavrova
Peter the Great St. Petersburg Polytechnic University, St. Petersburg, Russia
4 shared publications A. V. Nikol’SKii
Peter the Great St. Petersburg Polytechnic University
3 shared publicationsE. S. Usov
St. Petersburg Polytechnic University
3 shared publicationsM. A. Pakhomov
Peter the Great St. Petersburg Polytechnic University, St. Petersburg, Russia
3 shared publications
Latest Publications
- Open Access
- 1 January 2026
- Published by Peter the Great St. Petersburg Polytechnic University in Problems of information security. Computer systems
- Vol. 70 (Спецвыпуск) , 96-104
APPLICATION OF MACHINE LEARNING TO THE PROBLEMS OF RECOVERING THE SEQUENCE OF DELETED DATA FRAGMENTS
This paper examines a significant problem in digital forensics: recovering fragmented files. A graph representation of the NTFS file system, reflecting the characteristics of its fragmentation process, is created. A method for defragmenting deleted NTFS data by analyzing the file system state using machine learning is developed. This method is based on embedding the graph representation using a relational graph neural network. An experimental evaluation of the developed method is conducted in comparison with the PhotoRec file carving tool using open data.
- 1 January 2026
- Published by Peter the Great St. Petersburg Polytechnic University in Problems of information security. Computer systems
- Vol. 70 (Спецвыпуск) , 96-104
Open AccessAPPLICATION OF MACHINE LEARNING TO THE PROBLEMS OF RECOVERING THE SEQUENCE OF DELETED DATA FRAGMENTS
This paper examines a significant problem in digital forensics: recovering fragmented files. A graph representation of the NTFS file system, reflecting the characteristics of its fragmentation process, is created. A method for defragmenting deleted NTFS data by analyzing the file system state using machine learning is developed. This method is based on embedding the graph representation using a relational graph neural network. An experimental evaluation of the developed method is conducted in comparison with the PhotoRec file carving tool using open data.
- 1 January 2026
- Published by Peter the Great St. Petersburg Polytechnic University in Problems of information security. Computer systems
- Vol. 68 (1) , 69-86
USAGE OF THE SUBJECT-OBJECT MODEL IN THE TASK OF DETECTING MALICIOUS SOFTWARE IN THE ANDROID OS
An overview of the Android application components, permissions, and API functions has been performed, taking into account their possible use by malicious applications. Statistics of the use of Android application components, permissions, API functions, and broadcast receiver events in malicious and benign programs have been compiled. To describe the operation of an Android application, a subject-object model of the behavior of an Android application is presented.
- 1 January 2026
- Published by Peter the Great St. Petersburg Polytechnic University in Problems of information security. Computer systems
- Vol. 68 (1) , 69-86
USAGE OF THE SUBJECT-OBJECT MODEL IN THE TASK OF DETECTING MALICIOUS SOFTWARE IN THE ANDROID OS
An overview of the Android application components, permissions, and API functions has been performed, taking into account their possible use by malicious applications. Statistics of the use of Android application components, permissions, API functions, and broadcast receiver events in malicious and benign programs have been compiled. To describe the operation of an Android application, a subject-object model of the behavior of an Android application is presented.
- 1 December 2024
- Published by Allerton Press in Automatic Control and Computer Sciences
- Vol. 58 (8) , 1365-1372
Analysis of Data Exchange Systems about Information Security Threats
The modern approaches and protocols for communication concerning information security threats are analyzed. A classification of information about the threa
- 1 December 2024
- Published by Allerton Press in Automatic Control and Computer Sciences
- Vol. 58 (8) , 1365-1372
Analysis of Data Exchange Systems about Information Security Threats
The modern approaches and protocols for communication concerning information security threats are analyzed. A classification of information about the threa
- 1 December 2024
- Published by Allerton Press in Automatic Control and Computer Sciences
- Vol. 58 (8) , 1442-1449
Graph of Self-Regulation of Various Types of Networks with Adaptive Topology
Approaches used for the self-regulation of networks with adaptive network topology based on graph theory are presented. These approaches are limited to net
- 1 December 2024
- Published by Allerton Press in Automatic Control and Computer Sciences
- Vol. 58 (8) , 1442-1449
Graph of Self-Regulation of Various Types of Networks with Adaptive Topology
Approaches used for the self-regulation of networks with adaptive network topology based on graph theory are presented. These approaches are limited to net
- 1 December 2024
- Published by Allerton Press in Automatic Control and Computer Sciences
- Vol. 58 (8) , 1318-1325
Providing Information Security of Vehicular Ad Hoc Networks Using the Early Detection of Malicious Nodes
The peculiarities of vehicular ad hoc networks (VANETs) are considered. An approach to provide information security of VANETs is proposed; its distinctive
- 1 December 2024
- Published by Allerton Press in Automatic Control and Computer Sciences
- Vol. 58 (8) , 1318-1325
Providing Information Security of Vehicular Ad Hoc Networks Using the Early Detection of Malicious Nodes
The peculiarities of vehicular ad hoc networks (VANETs) are considered. An approach to provide information security of VANETs is proposed; its distinctive
- 1 December 2024
- Published by Allerton Press in Automatic Control and Computer Sciences
- Vol. 58 (7) , 904-919
Algorithm for Link Prediction in a Self-Regulating Network with Adaptive Topology Based on Graph Theory and Machine Learning
This article presents a functional graph model of a network with adaptive topology, where the network nodes represent the graph vertices, and data exchange
- 1 December 2024
- Published by Allerton Press in Automatic Control and Computer Sciences
- Vol. 58 (7) , 904-919
Algorithm for Link Prediction in a Self-Regulating Network with Adaptive Topology Based on Graph Theory and Machine Learning
This article presents a functional graph model of a network with adaptive topology, where the network nodes represent the graph vertices, and data exchange
- Open Access
Maintaining Cyber Resilience in the Reconfigurable Networks with Immunization and Improved Network Game Methods
The paper proposes a technique for protecting reconfigurable networks that implements topology rebuilding, which combines immunization and network gaming methods, as a solution for maintaining cyber resilience. Immunization presumes an adaptive set of protective reconfigurations destined to ensure the functioning of a network. It is a protective reconfiguration aimed to preserve/increase the functional quality of the system. Network nodes and edges are adaptively reorganized to counteract an invasion. This is a functional component of cyber resilience. It can be implemented as a global strategy, using knowledge of the whole network structure, or a local strategy that only works with a certain part of a network. A formal description of global and local immune strategies based on hierarchical and peer-to-peer network topologies is presented. A network game is a kind of the well-defined game model in which each situation generates a specific network, and the payoff function is calculated based on the constructed networks. A network game is proposed for analyzing a network topology. This model allows quickly identifying nodes that require disconnection or replacement when a cyber attack occurs, and understanding which network sectors might be affected by an attack. The gaming method keeps the network topology resistant to unnecessary connections. This is a structural component of cyber resilience. The basic network game method has been improved by using the criterion of maximum possible path length to reduce the number of reconfigurations. Network optimization works together with immunization to preserve the structural integrity of the network. In an experimental study, the proposed method demonstrated its effectiveness in maintaining system quality within given functional limits and reducing the cost of system protective restructuring.
Open AccessMaintaining Cyber Resilience in the Reconfigurable Networks with Immunization and Improved Network Game Methods
The paper proposes a technique for protecting reconfigurable networks that implements topology rebuilding, which combines immunization and network gaming methods, as a solution for maintaining cyber resilience. Immunization presumes an adaptive set of protective reconfigurations destined to ensure the functioning of a network. It is a protective reconfiguration aimed to preserve/increase the functional quality of the system. Network nodes and edges are adaptively reorganized to counteract an invasion. This is a functional component of cyber resilience. It can be implemented as a global strategy, using knowledge of the whole network structure, or a local strategy that only works with a certain part of a network. A formal description of global and local immune strategies based on hierarchical and peer-to-peer network topologies is presented. A network game is a kind of the well-defined game model in which each situation generates a specific network, and the payoff function is calculated based on the constructed networks. A network game is proposed for analyzing a network topology. This model allows quickly identifying nodes that require disconnection or replacement when a cyber attack occurs, and understanding which network sectors might be affected by an attack. The gaming method keeps the network topology resistant to unnecessary connections. This is a structural component of cyber resilience. The basic network game method has been improved by using the criterion of maximum possible path length to reduce the number of reconfigurations. Network optimization works together with immunization to preserve the structural integrity of the network. In an experimental study, the proposed method demonstrated its effectiveness in maintaining system quality within given functional limits and reducing the cost of system protective restructuring.
- Open Access
- 11 December 2023
- Published by P.G. Demidov Yaroslavl State University in Modeling and Analysis of Information Systems
- Vol. 30 (4) , 288-307
Algorithm for link prediction in self-regulating network with adaptive topology based on graph theory and machine learning
The paper presents a graph model of the functioning of a network with adaptive topology, where the network nodes represent the vertices of the graph, and data exchange between the nodes is represented as edges. The dynamic nature of network interaction complicates the solution of the task of monitoring and controlling the functioning of a network with adaptive topology, which must be performed to ensure guaranteed correct network interaction. The importance of solving such a problem is justified by the creation of modern information and cyber-physical systems, which are based on networks with adaptive topology. The dynamic nature of links between nodes, on the one hand, allows to provide self-regulation of the network, on the other hand, significantly complicates the control over the network operation due to the impossibility of identifying a single pattern of network interaction. On the basis of the developed model of network functioning with adaptive topology, a graph algorithm for link prediction is proposed, which is extended to the case of peer-to-peer networks. The algorithm is based on significant parameters of network nodes, characterizing both their physical characteristics (signal level, battery charge) and their characteristics as objects of network interaction (characteristics of centrality of graph nodes). Correctness and adequacy of the developed algorithm is confirmed by experimental results on modeling of a peer-to-peer network with adaptive topology and its self-regulation at removal of various nodes.
- 11 December 2023
- Published by P.G. Demidov Yaroslavl State University in Modeling and Analysis of Information Systems
- Vol. 30 (4) , 288-307
Open AccessAlgorithm for link prediction in self-regulating network with adaptive topology based on graph theory and machine learning
The paper presents a graph model of the functioning of a network with adaptive topology, where the network nodes represent the vertices of the graph, and data exchange between the nodes is represented as edges. The dynamic nature of network interaction complicates the solution of the task of monitoring and controlling the functioning of a network with adaptive topology, which must be performed to ensure guaranteed correct network interaction. The importance of solving such a problem is justified by the creation of modern information and cyber-physical systems, which are based on networks with adaptive topology. The dynamic nature of links between nodes, on the one hand, allows to provide self-regulation of the network, on the other hand, significantly complicates the control over the network operation due to the impossibility of identifying a single pattern of network interaction. On the basis of the developed model of network functioning with adaptive topology, a graph algorithm for link prediction is proposed, which is extended to the case of peer-to-peer networks. The algorithm is based on significant parameters of network nodes, characterizing both their physical characteristics (signal level, battery charge) and their characteristics as objects of network interaction (characteristics of centrality of graph nodes). Correctness and adequacy of the developed algorithm is confirmed by experimental results on modeling of a peer-to-peer network with adaptive topology and its self-regulation at removal of various nodes.
- 1 December 2023
- Published by Allerton Press in Automatic Control and Computer Sciences
- Vol. 57 (8) , 1084-1095
Analysis and Forecasting of States of Industrial Networks with Adaptive Topology Based on Network Motifs
This article proposes an approach to study states of complex industrial networks with adaptive topology based on network motifs: statistically significant
- 1 December 2023
- Published by Allerton Press in Automatic Control and Computer Sciences
- Vol. 57 (8) , 1084-1095
Analysis and Forecasting of States of Industrial Networks with Adaptive Topology Based on Network Motifs
This article proposes an approach to study states of complex industrial networks with adaptive topology based on network motifs: statistically significant
- 1 December 2023
- Published by Allerton Press in Automatic Control and Computer Sciences
- Vol. 57 (8) , 1055-1062
Graph-Based Self-Regulation for Different Types of Networks with Adaptive Topology
This article presents graph theory-based approaches to self-regulation of networks with adaptive network topology. These approaches are limited to networks
- 1 December 2023
- Published by Allerton Press in Automatic Control and Computer Sciences
- Vol. 57 (8) , 1055-1062
Graph-Based Self-Regulation for Different Types of Networks with Adaptive Topology
This article presents graph theory-based approaches to self-regulation of networks with adaptive network topology. These approaches are limited to networks