Oleksii Sirotkin

Mr. Oleksii Sirotkin

orcid

Research Focus & Metrics

Academic Career Length

4Years (2023-Present)

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

Representative Publications

View All Publications
21 May 2025 in Journal of Edge Computing
Verified
Journal Article
Open access
PDF file
Mykola YaroshynskyiMykola Yaroshynskyi
Mykola Yaroshynskyi
APArsentii Prymushko
Arsentii Prymushko
IPIvan Puchko
Ivan Puchko
OSOleksii Sirotkin
Oleksii Sirotkin
DSDmytro Sinko
Dmytro Sinko
The article addresses big data processing challenges, fault tolerance, and consumer interaction in a smart grid network management system. It analyses the use of Akka for agent-based modelling of smart grid systems, which enables the creation of distributed, resilient systems that can efficiently scale and recover from failures. The article describes how the hierarchical structure of Akka actors can improve the management of disparate components within a smart grid system, allowing developers to create complex interaction and management models. The approach ensures multithreading and asynchronous operation, geographic distribution of management nodes, and enhanced system security, allowing the simulation of system hierarchy down to the level of the end device or user, which is crucial for overall system reliability.

26 April 2025 in Computation
Verified
Journal Article
Open access
PDF file
OSOleksii Sirotkin
Oleksii Sirotkin
APArsentii Prymushko
Arsentii Prymushko
IPIvan Puchko
Ivan Puchko
HKHryhoriy Kravtsov
Hryhoriy Kravtsov
Mykola YaroshynskyiMykola Yaroshynskyi
Mykola Yaroshynskyi
Volodymyr O ArtemchukVolodymyr O Artemchuk
Volodymyr O Artemchuk
Modern computational models tend to become more and more complex, especially in fields like computational biology, physical modeling, social simulation, and others. With the increasing complexity of simulations, modern computational architectures demand efficient parallel execution strategies. This paper proposes a novel approach leveraging the reactive stream paradigm as a general-purpose synchronization protocol for parallel simulation. We introduce a method to construct simulation graphs from predefined transition functions, ensuring modularity and reusability. Additionally, we outline strategies for graph optimization and interactive simulation through push and pull patterns. The resulting computational graph, implemented using reactive streams, offers a scalable framework for parallel computation. Through theoretical analysis and practical implementation, we demonstrate the feasibility of this approach, highlighting its advantages over traditional parallel simulation methods. Finally, we discuss future challenges, including automatic graph construction, fault tolerance, and optimization strategies, as key areas for further research.

21 April 2025 in Preprints.org
Verified
Preprint
Open access
PDF file
OSOleksii Sirotkin
Oleksii Sirotkin
APArsentii Prymushko
Arsentii Prymushko
IPIvan Puchko
Ivan Puchko
HKHryhoriy Kravtsov
Hryhoriy Kravtsov
Mykola YaroshynskyiMykola Yaroshynskyi
Mykola Yaroshynskyi
Volodymyr O ArtemchukVolodymyr O Artemchuk
Volodymyr O Artemchuk
Modern computational models tend to become more and more complex, especially in fields like computational biology, physical modelling, social simulation and others. With the increasing complexity of simulations, modern computational architectures demand efficient parallel execution strategies. This paper proposes a novel approach leveraging the reactive streams paradigm as a general-purpose synchronization protocol for parallel simulation. We introduce a method to construct simulation graphs from predefined transition functions, ensuring modularity and reusability. Additionally, we outline strategies for graph optimization and interactive simulation through push and pull patterns. The resulting computational graph, implemented using reactive streams, offers a scalable framework for parallel computation. Through theoretical analysis and practical implementation, we demonstrate the feasibility of this approach, highlighting its advantages over traditional parallel simulation methods. Finally, we discuss future challenges, including automatic graph construction, fault tolerance, and optimization strategies, as key areas for further research.

25 October 2023 in arXiv
Verified
Preprint
Open access
PDF file
OSOleksii Sirotkin
Oleksii Sirotkin
In the process of building (structural learning) a probabilistic graphical model from a set of observed data, the directional, cyclic dependencies between the random variables of the model are often found. Existing graphical models such as Bayesian and Markov networks can reflect such dependencies. However, this requires complicating those models, such as adding additional variables or dividing the model graph into separate subgraphs. Herein, we describe a probabilistic graphical model - probabilistic relation network - that allows the direct capture of directional cyclic dependencies during structural learning. This model is based on the simple idea that each sample of the observed data can be represented by an arbitrary graph (structured outcome), which reflects the structure of the dependencies of the variables included in the sample. Each of the outcomes contains only a part of the graphical model structure; however, a complete graph of the probabilistic model is obtained by combining different outcomes. Such a graph, unlike Bayesian and Markov networks, can be directed and can have cycles. We explored the full joint distribution and conditional distribution and conditional independence properties of variables in the proposed model. We defined the algorithms for constructing of the model from the dataset and for calculating the conditional and full joint distributions. We also performed a numerical comparison with Bayesian and Markov networks. This model does not violate the probability axioms, and it supports learning from observed data. Notably, it supports probabilistic inference, making it a prospective tool in data analysis and in expert and design-making applications.

12 October 2023 in Research Square
Verified
Preprint
Open access
PDF file
OSOleksii Sirotkin
Oleksii Sirotkin
In the process of building (structural learning) a probabilistic graphical model from a set of observed data, the directional, cyclic dependencies between the random variables of the model are often found. Existing graphical models such as Bayesian and Markov networks can reflect such dependencies. However, this requires complicating those models, such as adding additional variables or dividing the model graph into separate subgraphs. Herein, we describe a probabilistic graphical model—probabilistic relation network— that allows the direct capture of directional cyclic dependencies during structural learning. This model is based on the simple idea that each sample of the observed data can be represented by an arbitrary graph (structured outcome), which reflects the structure of the dependencies of the variables included in the sample. Each of the outcomes contains only a part of the graphical model structure; however, a complete graph of the probabilistic model is obtained by combining different outcomes. Such a graph, unlike Bayesian and Markov networks, can be directed and can have cycles. We explored the full joint distribution and conditional distribution and conditional independence properties of variables in the proposed model. We defined the algorithms for constructing of the model from the dataset and for calculating the conditional and full joint distributions. We also performed a numerical comparison with Bayesian and Markov networks. This model does not violate the probability axioms, and it supports learning from observed data. Notably, it supports probabilistic inference, making it a prospective tool in data analysis and in expert and design-making applications.