Algorithm for finding subcritical paths on network diagrams by M. A. Аnfyorov

“…For substantiating the efficiency of the constructed algorithm, the validity of the main provisions was demonstrated as follows: firstly, the multilevel system of relations is exhaustive; secondly, there is no loss in the final solution during the operation of the algorithm; thirdly, the paths obtained as a result of the work of the algorithm satisfy the main required relation between them. …”
Get full text

Diagnostic algorithm for post-traumatic stress disorder by A. V. Vasileva, T. A. Karavaeva, D. S. Radionov, D. A. Starunskaya

“…The importance and complexity of a personalized examination are noted, the main stages, methods and diagnostic tools necessary for the clinical verification of PTSD are considered. …”
Get full text

ALGORITHMIC CONSTRUCTION SCHEDULES IN CONDITIONS OF TIMING CONSTRAINTS by Alexey S. Dobrynin, Roman S. Koynov

“…Tasks of time-schedule construction (JSSP) in various fields of human activities have an important theoretical and practical significance. The main feature of these tasks is a timing requirement, describing allowed planning time periods and periods of downtime. …”
Get full text

ALGORITHM FOR DYNAMIC SCALING RELATIONAL DATABASE IN CLOUDS by Alexander V. Boichenko, Dminry K. Rogojin, Dmitry G. Korneev

“…This article analyzes the main methods of scalingdatabases (replication, sharding) and their supportat the popular relational databases and NoSQLsolutions with different data models: document-oriented, key-value, column-oriented and graph.The article presents an algorithm for the dynamicscaling of a relational database (DB), that takesinto account the specifics of the different types of logic database model. …”
Get full text

ALGORITHM FOR POST-BURN BACTERIAL SEPSIS DIAGNOSIS by B. V. Guzenko

“…The purpose of our work was to develop the algorithm of bacterial sepsis diagnosis in patients with severe burn disease. …”
Get full text

An Efficient Algorithm for Decomposition of Partially Ordered Sets by Elsayed Badr, Mohamed EL-Hakeem, Enas E. El-Sharawy, Thowiba E. Ahmed

“…The main goal of this paper is proposing an efficient algorithm to compute the width of a given partially ordered set P according to Dilworth’s theorem. …”
Get full text

A Quantum Processing Framework for Quantum Algorithms by Mohammad Reza Soltan Aghaei, Zuriati Ahmad Zukarnain

“…At first, the hybrid architecture is designed for the quantum algorithms. Then, the relationship between the classical and the quantum part of hybrid algorithms is extracted, and main stages of the hybrid algorithm are developed. …”
Get full text

An Algorithm of (n, t)-Threshold Proxy Signature with an Arbitrator by E. A. Tolyupa

Get full text

Deep Learning-Based Object Detection Algorithms by Yao Linxi

“…One of the main areas of study in computer vision is object detection. …”
Get full text

Development of Algorithms for Processing Images of Large Volumes by O. N. Vinichuk, V. I. Dravitsa

Get full text

Analgesic treatment, by using a systemic algorithm by A. E. Karateev, L. I. Alekseeva

“…This review considers the targets of pharmacotherapy for MSP and the main groups of medications that may affect them. …”
Get full text

Method and Algorithm for Processing Large Volume Images by O. N. Andreichuk, N. I. Listopad

Get full text

Algorithm of fire detection for multi-sensor system by R. A. Bagutdinov, M. F. Stepanov

“…The main scientific goal is for the system to work autonomously on certain segments of the monitoring process, while the three agents, to varying degrees, must interact with each other based on communication and decision-making algorithms.Method. …”
Get full text

A Penalization-Gradient Algorithm for Variational Inequalities by Abdellatif Moudafi, Eman Al-Shemas

Get full text

ALGORITHM FOR THE TREATMENT OF PATIENTS WITH ACUTE HEART FAILURE by E. V. Reznik, Yu. V. Gavrilov, I. G. Nikitin

“…The algorithm for diagnosis, clinical patient profiles recognition, pharmacological (including diuretics, vasodilators, inotropes, vasopressors, anticoagulants, etc.) and non-pharmacological (including oxygen therapy, non-invasive and invasive ventilation, etc.) approaches to the management of AHF and ADHF are presented in accordance with contemporary guidelines.…”
Get full text

Research on data transmission based on DDPG algorithm by Yan Danting, Jiao Xinquan

“…In order to improve bandwidth utilization and reduce network delay, an improved Deep Deterministic Policy Gradient (DDPG) algorithm is added for congestion control. The experimental test results demonstrate that the algorithm presented in this paper can markedly reduce network latency. …”
Get full text

Research on the impact of algorithmic trading on market volatility by Dan Yang, Yang Yang, Jia Luo, Zeming Wang, Haowei Sha

“…Abstract The rapid growing of algorithmic trading (AT) has been playing an increasingly important role in shaping financial market in recent years. …”
Get full text

An Algorithm for the Detection of Circular Elements in Engineering Design by Bonello D. K., Iano Y., Neto U. B.

“…The benchmarking of images is composed of five main images that are tested in the algorithm of detection of circles in MATLAB with different values of radio for each image. …”
Get full text

Influence maximization algorithm based on social network by Xuan WANG, Yu ZHANG, Junfeng ZHOU, Ziyang CHEN

“…The influence maximization (IM) problem asks for a group of seed users in a social network under a given propagation model, so that the information spread is maximized through these users.Existing algorithms have two main problems.Firstly, these algorithms were difficult to be applied in large-scale social networks due to limited expected influence and high time complexity.Secondly, these algorithms were limited to specific propagation models and could only solve the IM problem under a single type of social network.When they were used in different types of networks, the effect was poor.In this regard, an efficient algorithm (MTIM) based on two classic propagation models and reverse influence sampling (RIS) was proposed.To verify the effectiveness of MTIM, experiments were conducted to compare MTIM with greedy algorithms such as IMM, TIM and PMC, and heuristic algorithms such as OneHop and Degree Discount on four real social networks.The results show that MTIM can return a <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML"> <mrow><mo>(</mo> <mrow> <mn>1</mn><mo>−</mo><mfrac> <mn>1</mn> <mtext>e</mtext> </mfrac> <mo>−</mo><mi>ε</mi></mrow> <mo>)</mo></mrow></math></inline-formula> approximate solution, effectively expand the expected influence and significantly improve the efficiency.…”
Get full text

On routing algorithms in the internet of vehicles: a survey by Arundhati Sahoo, Asis Kumar Tripathy

“…Our study comprehensively reviews diverse routing algorithms and their associated assessment methodologies. …”
Get full text