Tatiana A. Milovanova
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Tatiana A. Milovanova has a total of 36 co-authors. Here are the top co-authors by number of shared publications:
- Ivan S. Zaryadov
Peoples’ Friendship University of Russia (RUDN University)
12 shared publications - Viana C. C. Hilquias
RUDN University
6 shared publications - Anna V. Korolkova
RUDN University
5 shared publications - Карвалью Кравид Виана
Российский университет дружбы народов
5 shared publications - Vladimir Rykov
Gubkin Russian State Oil and Gas University
3 shared publications - Dmitry Kozyrev
Department of Probability Theory and Cybersecurity, Peoples’ Friendship University of Russia Named After Patrice Lumumba (RUDN University), 117198 Moscow, Russia
2 shared publications
Latest Publications
- 16 February 2025
- Published by Springer Nature
- p. 312-326
Probability Characteristics of Queuing Systems with Two Different Threshold-Based Stochastic Drop Mechanisms$^\star $- 16 February 2025
- Published by Springer Nature
- p. 312-326
Probability Characteristics of Queuing Systems with Two Different Threshold-Based Stochastic Drop Mechanisms$^\star $- Open Access
- 9 December 2024
- Published by Endocrinology Research Centre in Endocrine Surgery
- Vol. 18 (3) , 36-42
Primary hyperparathyroidism caused by an ectopic parathyroid adenoma in the mediastinum (case report)
Recently, primary hyperparathyroidism, which represents a medical and socially significant problem, has become increasingly relevant. The high prevalence of forms without pronounced clinical symptoms, as well as the low awareness of doctors regarding this pathology, lead to late diagnosis, delayed initiation of treatment and, as a consequence, the development of serious multisystem complications with a higher risk of premature death. At the same time, early diagnosis is based on relatively laboratory tests — serum calcium and parathyroid hormone, and visualization of the adenoma in most cases is provided by ultrasound examination and scintigraphy. This article is a case report of primary hyperparathyroidism caused by an ectopic parathyroid adenoma located in the mediastinum, when late treatment led to the patient’s long-term suffering and the development of severe complications.
- 9 December 2024
- Published by Endocrinology Research Centre in Endocrine Surgery
- Vol. 18 (3) , 36-42
Open AccessPrimary hyperparathyroidism caused by an ectopic parathyroid adenoma in the mediastinum (case report)
Recently, primary hyperparathyroidism, which represents a medical and socially significant problem, has become increasingly relevant. The high prevalence of forms without pronounced clinical symptoms, as well as the low awareness of doctors regarding this pathology, lead to late diagnosis, delayed initiation of treatment and, as a consequence, the development of serious multisystem complications with a higher risk of premature death. At the same time, early diagnosis is based on relatively laboratory tests — serum calcium and parathyroid hormone, and visualization of the adenoma in most cases is provided by ultrasound examination and scintigraphy. This article is a case report of primary hyperparathyroidism caused by an ectopic parathyroid adenoma located in the mediastinum, when late treatment led to the patient’s long-term suffering and the development of severe complications.
- Open Access
- 15 October 2024
- Published by Peoples' Friendship University of Russia in Discrete and Continuous Models and Applied Computational Science
- Vol. 32 (2) , 154-171
Chronology of the development of active queue management algorithms of RED family. Part 3: from 2016 up to 2024
This work is the first part of a large bibliographic review of active queue management algorithms of the Random Early Detection (RED) family, presented in the scientific press from 1993 to 2023. The third part will provide data on algorithms published from 2016 to 2023.
- 15 October 2024
- Published by Peoples' Friendship University of Russia in Discrete and Continuous Models and Applied Computational Science
- Vol. 32 (2) , 154-171
Open AccessChronology of the development of active queue management algorithms of RED family. Part 3: from 2016 up to 2024
This work is the first part of a large bibliographic review of active queue management algorithms of the Random Early Detection (RED) family, presented in the scientific press from 1993 to 2023. The third part will provide data on algorithms published from 2016 to 2023.
- Open Access
- 30 June 2024
- Published by Peoples' Friendship University of Russia in Discrete and Continuous Models and Applied Computational Science
- Vol. 32 (1) , 18-37
Chronology of the development of Active Queue Management algorithms of RED family. Part 2: from 2006 up to 2015
This work is the second part of a large bibliographic review of active queue management algorithms of the Random Early Detection (RED) family, presented in the scientific press from 1993 to 2023. This part provides data on algorithms published from 2006 to 2015.
- 30 June 2024
- Published by Peoples' Friendship University of Russia in Discrete and Continuous Models and Applied Computational Science
- Vol. 32 (1) , 18-37
Open AccessChronology of the development of Active Queue Management algorithms of RED family. Part 2: from 2006 up to 2015
This work is the second part of a large bibliographic review of active queue management algorithms of the Random Early Detection (RED) family, presented in the scientific press from 1993 to 2023. This part provides data on algorithms published from 2006 to 2015.
- Open Access
- 15 December 2023
- Published by Peoples' Friendship University of Russia in Discrete and Continuous Models and Applied Computational Science
- Vol. 31 (4) , 305-331
Chronology of the development of Active Queue Management algorithms of RED family. Part 1: from 1993 up to 2005
This work is the first part of a large bibliographic review of active queue management algorithms of the Random Early Detection (RED) family, presented in the scientific press from 1993 to 2023. The first part will provide data on algorithms published from 1993 to 2005.
- 15 December 2023
- Published by Peoples' Friendship University of Russia in Discrete and Continuous Models and Applied Computational Science
- Vol. 31 (4) , 305-331
Open AccessChronology of the development of Active Queue Management algorithms of RED family. Part 1: from 1993 up to 2005
This work is the first part of a large bibliographic review of active queue management algorithms of the Random Early Detection (RED) family, presented in the scientific press from 1993 to 2023. The first part will provide data on algorithms published from 1993 to 2005.
- Open Access
- 13 November 2022
- Published by MDPI AG in Mathematics
- Vol. 10 (22) , 4243
On Reliability Function of a k-out-of-n System with Decreasing Residual Lifetime of Surviving Components after Their Failures
We consider the reliability function of a k-out-of-n system under conditions that failures of its components lead to an increase in the load on the remaining ones and, consequently, to a change in their residual lifetimes. Development of models able to take into account that failures of a system’s components lead to a decrease in the residual lifetime of the surviving ones is of crucial significance in the system reliability enhancement tasks. This paper proposes a novel approach based on the application of order statistics of the system’s components lifetime to model this situation. An algorithm for calculation of the system reliability function and two moments of its uptime has been developed. Numerical study includes sensitivity analysis for special cases of the considered model based on two real-world systems. The results obtained show the sensitivity of system’s reliability characteristics to the shape of lifetime distribution, as well as to the value of its coefficient of variation at a fixed mean.
- 13 November 2022
- Published by MDPI AG in Mathematics
- Vol. 10 (22) , 4243
Open AccessOn Reliability Function of a k-out-of-n System with Decreasing Residual Lifetime of Surviving Components after Their Failures
We consider the reliability function of a k-out-of-n system under conditions that failures of its components lead to an increase in the load on the remaining ones and, consequently, to a change in their residual lifetimes. Development of models able to take into account that failures of a system’s components lead to a decrease in the residual lifetime of the surviving ones is of crucial significance in the system reliability enhancement tasks. This paper proposes a novel approach based on the application of order statistics of the system’s components lifetime to model this situation. An algorithm for calculation of the system reliability function and two moments of its uptime has been developed. Numerical study includes sensitivity analysis for special cases of the considered model based on two real-world systems. The results obtained show the sensitivity of system’s reliability characteristics to the shape of lifetime distribution, as well as to the value of its coefficient of variation at a fixed mean.
- Open Access
- 3 May 2022
- Published by Peoples' Friendship University of Russia in Discrete and Continuous Models and Applied Computational Science
- Vol. 30 (2) , 160-182
Analysis of queuing systems with threshold renovation mechanism and inverse service discipline
The paper presents a study of three queuing systems with a threshold renovation mechanism and an inverse service discipline. In the model of the first type, the threshold value is only responsible for activating the renovation mechanism (the mechanism for probabilistic reset of claims). In the second model, the threshold value not only turns on the renovation mechanism, but also determines the boundaries of the area in the queue from which claims that have entered the system cannot be dropped. In the model of the third type (generalizing the previous two models), two threshold values are used: one to activate the mechanism for dropping requests, the second - to set a safe zone in the queue. Based on the results obtained earlier, the main time-probabilistic characteristics of these models are presented. With the help of simulation modeling, the analysis and comparison of the behavior of the considered models were carried out.
- 3 May 2022
- Published by Peoples' Friendship University of Russia in Discrete and Continuous Models and Applied Computational Science
- Vol. 30 (2) , 160-182
Open AccessAnalysis of queuing systems with threshold renovation mechanism and inverse service discipline
The paper presents a study of three queuing systems with a threshold renovation mechanism and an inverse service discipline. In the model of the first type, the threshold value is only responsible for activating the renovation mechanism (the mechanism for probabilistic reset of claims). In the second model, the threshold value not only turns on the renovation mechanism, but also determines the boundaries of the area in the queue from which claims that have entered the system cannot be dropped. In the model of the third type (generalizing the previous two models), two threshold values are used: one to activate the mechanism for dropping requests, the second - to set a safe zone in the queue. Based on the results obtained earlier, the main time-probabilistic characteristics of these models are presented. With the help of simulation modeling, the analysis and comparison of the behavior of the considered models were carried out.
- 1 January 2022
- Published by Springer Nature
- p. 309-323
The Queueing System with Threshold-Based Direct and Inverse General Renovation Mechanism
- 1 January 2022
- Published by Springer Nature
- p. 309-323
The Queueing System with Threshold-Based Direct and Inverse General Renovation Mechanism
- 15 December 2021
- Published by Springer Nature
- p. 196-210
Two Types of Single-Server Queueing Systems with Threshold-Based Renovation Mechanism
- 15 December 2021
- Published by Springer Nature
- p. 196-210
Two Types of Single-Server Queueing Systems with Threshold-Based Renovation Mechanism
- Open Access
- 15 December 2020
- Published by Peoples' Friendship University of Russia in Discrete and Continuous Models and Applied Computational Science
- Vol. 28 (4) , 305-318
Queueing systems with different types of renovation mechanism and thresholds as the mathematical models of active queue management mechanism
This article is devoted to some aspects of using the renovation mechanism (different types of renovation are considered, definitions and brief overview are also given) with one or several thresholds as the mathematical models of active queue management mechanisms. The attention is paid to the queuing systems in which a threshold mechanism with renovation is implemented. This mechanism allows to adjust the number of packets in the system by dropping (resetting) them from the queue depending on the ratio of a certain control parameter with specified thresholds at the moment of the end of service on the device (server) (in contrast to standard RED-like algorithms, when a possible drop of a packet occurs at the time of arrivals of next packets in the system). The models with one, two and three thresholds with different types of renovation are under consideration. It is worth noting that the thresholds determine not only from which place in the buffer the packets are dropped, but also to which the reset of packets occurs. For some of the models certain analytical and numerical results are obtained (the references are given), some of them are only under investigation, so only the mathematical model and current results may be considered. Some results of comparing classic RED algorithm with renovation mechanism are presented.
- 15 December 2020
- Published by Peoples' Friendship University of Russia in Discrete and Continuous Models and Applied Computational Science
- Vol. 28 (4) , 305-318
Open AccessQueueing systems with different types of renovation mechanism and thresholds as the mathematical models of active queue management mechanism
This article is devoted to some aspects of using the renovation mechanism (different types of renovation are considered, definitions and brief overview are also given) with one or several thresholds as the mathematical models of active queue management mechanisms. The attention is paid to the queuing systems in which a threshold mechanism with renovation is implemented. This mechanism allows to adjust the number of packets in the system by dropping (resetting) them from the queue depending on the ratio of a certain control parameter with specified thresholds at the moment of the end of service on the device (server) (in contrast to standard RED-like algorithms, when a possible drop of a packet occurs at the time of arrivals of next packets in the system). The models with one, two and three thresholds with different types of renovation are under consideration. It is worth noting that the thresholds determine not only from which place in the buffer the packets are dropped, but also to which the reset of packets occurs. For some of the models certain analytical and numerical results are obtained (the references are given), some of them are only under investigation, so only the mathematical model and current results may be considered. Some results of comparing classic RED algorithm with renovation mechanism are presented.