Repozitoriul Instituțional al Universității de Stat din Moldova (RI USM)

Institutional Repository of Moldova State University (IR MSU)

Repozitoriul Instituțional al Universității de Stat din Moldova reprezintă arhiva digitală cu acces deschis a rezultatelor cercetărilor științifice și științifico-didactice efectuate în cadrul universității. Conținutul arhivei este multidisciplinar și include lucrări din domeniile științelor exacte și socio-umanistice.
The Institutional Repository of the State University of Moldova is an open access digital archive of the results of scientific and scientific-didactic research carried out within the university. The archive's content is multidisciplinary and includes works from the fields of exact sciences, social sciences and humanities.

Communities in DSpace

Select a community to browse its collections.

Now showing 1 - 5 of 17

Recent Submissions

Item

Transportation Problems, the Braess Paradox and Network Coordination [Articol]

(2024) Gorbachuk, Vasyl; Dunaievskyi, Maksym; Havrylenko, Serhiy

Traveling through the transport network or sending information packets via the Internet is implicitly based on game-theoretic considerations: a specific decision-maker (DM), choosing his or her route, takes into account the probability of congestion depending on all DMs, that is, other routes. Based on similar considerations, it is possible to develop models for network traffic. These models explain some paradoxical observations where increasing the capacity of a given network can slow down its traffic under certain circumstances.

Item

Algorithm to Minimize the Worst-Case Regret Function [Articol]

(2024) Godonoaga, Anatol; Chumakov, Borys

This paper examines mathematical model of decision-making under conditions of uncertainty, when Savage’s regret function is used as the objective function. Numerical algorithm for solving the corresponding problems are proposed, based on the implementation of parallel minimization of indicators for each state of nature and the indicator of greatest regret. The algorithms are developed based on the generalized gradient projection method.

Item

Strong Edge-Colorings of Some Lexicographic Products of Graphs [Articol]

(2024) Drambyan, Aram

The edge-coloring of a graph G is strong if edges at distance 0 or 1 receive different colors. The minimum number of colors required for a strong edge-coloring of G is called strong chromatic index of G and denoted by χ′ s(G). In this paper, we determine the exact value of the strong chromatic index of lexicographic products of graphs G and H when Δ(G) ≤ 2 and H is an arbitrary graph, and provide an upper bound on χ′ s(G[H]) when Δ(G) = 3 and H is an arbitrary graph.

Item

Semi-Markovian Networks [Articol]

(2024) Damian, Iulia

In stochastic networks, a series of new problems appear, because the output flow of messages from one node forms the input flow to another node (or other nodes), which is not Poisson, and the serving of messages in the nodes of these networks is no longer exponential type. Such networks are called semiMarkovian networks and, therefore, the mathematical analysis of semi-Markovian networks is complicated and requires the application of some modern departments of mathematics.

Item

Experimental Closed-Loop Identification of the Third Order Inertial Systems with Time Delay [Articol]

(2024) Cojuhari, Irina

n this paper, it is analysed the problem of mathematical identification in the closed-loop and it is proposed an approach for experimental identification, based on the undamped step response of the closed-loop control system. According to the proposed procedure, the dynamics of the control object is proposed to be approximated with transfer function with inertia third order and time delay. The obtained results are verified by computer simulation in MATLAB software package.