Кафедра мережних технологій

Permanent URI for this collection

https://ekmair.ukma.edu.ua/handle/123456789/12313

Browse

Browsing Кафедра мережних технологій by Author "Oletsky, Oleksiy"

Now showing 1 - 4 of 4
  • Thumbnail Image
    Item
    Application Of The Ant Colony Algorithm For Solving The Fuzzy Traveling Salesman Problem
    (2024) Ivokhin, Eugene; Oletsky, Oleksiy; Yushtin, Konstantin; Gavrilenko, Valeriy; Boguslavskyi, Maksym
    The traveling salesman problem (TSP) is a classical combinatorial optimization problem that involves finding the shortest or fastest route among a set of cities. To formalize the uncertainty and imprecision in input data, often caused by subjective evaluations of the travel time intervals, this paper employs fuzzy numbers. The form of these fuzzy numbers is based on a Gaussian-like approach. This work examines the specifics of applying the ant colony optimization (ACO) algorithm and proposes an approach for its optimal use. The impact of the algorithm's parameters on the quality of the approximated best solution is analyzed. The problem is illustrated with numerical examples involving a sufficiently large number of cities in the transportation network.
  • Thumbnail Image
    Item
    An approach to modeling elections in bipartisan democracies on the base of the "state-probability of action" model
    (2024) Dosyn, Dmytro; Oletsky, Oleksiy
    An approach to constructing the two-level behavioral "state-probability of action" model and to getting appropriate matrices "state-probability of choice" for the case of two competing alternatives has been suggested. The top level is directly connected to probabilities of choice between alternatives. States of the model are connected to grades of pairwise comparisons. For getting rows of the matrix on this basis transitive scales are offered to be applied, but not only. It appears important to distinguish values of preferences themselves and probabilities of choice related to them. For this reason, another parameter standing for decisiveness of agents has been introduced. The bottom level is related to separate criteria influencing a choice. A way to applying such a model for modeling voting in a bipartisan democracy has been suggested. Within this context, a problem of equilibrium between two alternatives, when no alternative has advantages over the other, is of great importance. Some sufficient conditions for equilibrium between two alternatives have been postulated in the paper, they significantly rely upon properties of symmetry. The illustrating example of modeling elections in an imaginary country has been provided. Voters in this example are to make a choice between two candidates on the base of comparing them by some given criteria. In the initial example the equilibrium between alternatives holds. Then an issue how agents of influence could change the situation in a desirable direction is discussed.
  • Thumbnail Image
    Item
    Automated Pipelines for Large-Scale Height-Based Vegetation Segmentation
    (2024) Tsaryniuk, Oleksandr; Hlybovets, Andriy; Oletsky, Oleksiy
    Height-based vector vegetation segmentation is one of the critical aspects of spatial analysis. This segmented data is used in radio propagation modeling, environmental monitoring, and vegetation mapping. Many studies on vector vegetation segmentation focus on delineating individual tree crowns, allowing detailed data sets to be obtained. However, the high level of detail results in a substantial data volume, making it impractical to use these datasets over large areas, such as an entire country. Segmentation of large vector data sets remains a significant challenge in geospatial data creation. In our study, we developed three different segmentation pipelines: hexagon segmentation, convolution segmentation, and random points. A test data fragment was processed to compare the proposed methods and accuracy and volume metrics were calculated.
  • Thumbnail Image
    Item
    On supervising and coordinating microservices within web applications on the basis of state machines
    (2024) Oletsky, Oleksiy; Moholivskyi, Vitali
    An approach to supervising and coordinating microservices by applying state machines has been developed. Both orchestration and choreography approaches to coordinate microservices are considered. A prototype of a library based on this approach is reported. Such advantages as central control over complex distributed execution flow, declarative description of the system and the workflows within it, rich facilities for visualization, possibilities for applying mathematical methods of analysis, keeping track of long-running background jobs, monitoring the current state of a system, testing coordination logic with mocked implementation details, and debugging coordination issues using only state machine without running microservices are illustrated on examples. A way to estimate the importance measures of specific microservices based on PageRank-like techniques is suggested. Some suggestions for using other mathematical methods are discussed.