Институт проблем информатики Российской Академии наук
Институт проблем информатики Российской Академии наук
Российская Академия наук

Институт проблем информатики Российской Академии наук




«INFORMATICS AND APPLICATIONS»
Scientific journal
Volume 15, Issue 3, 2021

Content | About  Authors

Abstract and Keywords

REMOTE MONITORING OF WORKFLOWS
  • A. A. Grusho  Institute of Informatics Problems, Federal Research Center "Computer Science and Control" of the Russian Academy of Sciences, 44-2 Vavilov Str., Moscow 119333, Russian Federation
  • N. A. Grusho  Institute of Informatics Problems, Federal Research Center "Computer Science and Control" of the Russian Academy of Sciences, 44-2 Vavilov Str., Moscow 119333, Russian Federation
  • M. I. Zabezhailo  Federal Research Center "Computer Science and Control" of the Russian Academy of Sciences, 44-2 Vavilov Str., Moscow 119333, Russian Federation
  • E. E. Timonina  Institute of Informatics Problems, Federal Research Center "Computer Science and Control" of the Russian Academy of Sciences, 44-2 Vavilov Str., Moscow 119333, Russian Federation

Abstract: The paper discusses the workflows control scheme in the distributed information system which is economical in terms of the amount of information provided to the remote system administrator or security officer.
The proposed scheme allows automation of control, is based on real experience of the system administrator, and allows implementing logic of determination, classification, and approximating localization of anomalies. The system administrator receives information about the operation of the distributed information system through the communication channels. In operation, it is assumed that the sources of messages for the system administrator are sensors. Sensors are entities capable of recognizing information received at the input of sensor-related transformation of information, that is, if the transformation receives information at the input, then the sensor recognizes the fact and time of transmitting the input information to the first transformation of the block in which it is located within the framework of the information technology being implemented. The scheme is based on the calculation and analysis of the moments when the sensor "sees" the transfer of data to the transformation input in a particular instance of information technology. The characteristics of the approach to workflows monitoring are estimations of systematic process delays and analysis of outages using "parallel" sensors. The constructed scheme allows one to dynamically detail the control to clarify the approximate location of the anomaly.

Keywords: information security; remote monitoring of information system; evaluation of monitoring data by information characteristics

FILTERING OF MARKOV JUMP PROCESSES GIVEN COMPOSITE OBSERVATIONS II: NUMERICAL ALGORITHM
  • A. V. Borisov  Institute of Informatics Problems, Federal Research Center "Computer Science and Control" of the Russian Academy of Sciences, 44-2 Vavilov Str., Moscow 119333, Russian Federation, Moscow Aviation Institute (National Research University), 4 Volokolamskoe Shosse, Moscow 125080, Russian Federation, Moscow Center for Fundamental and Applied Mathematics, M. V. Lomonosov Moscow State University, 1 Leninskie Gory, GSP-1, Moscow 119991, Russian Federation
  • D. Kh. Kazanchyan  Department of Mathematical Statistics, Faculty of Computational Mathematics and Cybernetics, M. V. Lomonosov Moscow State University, 1-52 Leninskie Gory, GSP-1, Moscow 119991, Russian Federation

Abstract: The note represents the second, final part of the series initiated by the article Borisov, A., and D. Kazanchyan. 2021. Filtering of Markov jump processes given composite observations I: Exact solution. Informatika i ee primeneniya - Inform. Appl. 15(2):12-19. The authors propose a new numerical algorithm of the optimal state estimation for the Markov jump processes given observable both the counting processes and the diffusion ones with the multiplicative noises. The authors approximate the initial continuous-time estimation problem by a sequence of the corresponding filtering problems given the time-discretized observations. The paper contains the explicit recursive form of the discretized estimate and introduces its one-step precision characteristic along with dependence of the characteristics on the utilized numerical estimation scheme.

Keywords: Markov jump process; optimal filtering; multiplicative observation noises; time-discretized observations; approximation precision

COMPRESSION ALGORITHMS FOR FORCE VOLUME DATA II: CODING OF WAVELET TRANSFORM COMPONENTS
  • D. V. Sushko  Institute of Informatics Problems, Federal Research Center "Computer Science and Control" of the Russian Academy of Sciences, 44-2 Vavilov Str., Moscow 119333, Russian Federation

Abstract: The author presents the second part of the investigation of the problem of reversible (lossless) compression of force volume data which are the three-dimensional arrays with 16-bit integer elements. The author proposes reversible compression algorithms of force volume data based on the universal arithmetic coding of components obtained as the result of applying the one-dimensional discrete wavelet transform using (5-3) wavelet system to the rows of the arrays. The transform is realized in the frame of lifting scheme and it is reversible. To construct effective algorithms, the author uses the method of wavelet transform reapplication and two methods of universal coding previously tested in the first part of the investigation (decomposition into calculable states and choice of the weight while constructing the code probabilities). The author constructs bit rate estimations for the proposed algorithms for five test arrays. The results show that each of the methods mentioned above decreases the bit rate and the combination of all three methods leads to the most efficient algorithm. The bit rates of this algorithm for the test arrays are 3.8160, 3.4050, 3.3678, 4.1309, and 4.0996 bit/pixel, benefit in comparison with the standard JPEG 2000 reversible compression algorithm is 6%-9%.

Keywords: atomic force microscope; force volume data; reversible compression; arithmetic coding; universal coding

MAXIMUM INTERNODE FLOWS AT PEAK LOAD OF A MULTIUSER NETWORK
  • Yu. E. Malashenko  Federal Research Center "Computer Science and Control" of the Russian Academy of Sciences, 44-2 Vavilov Str., Moscow 119333, Russian Federation

Abstract: The paper discusses a method of angular points searching on the edges of the convex polyhedral set of permissible internode flows transmitted between all network nodes simultaneously. The points of coordinate axes intersection with the outer boundary of the set are considered as basic. A point, in which the sum of internode flows is the maximum possible among all permissible distributions, is selected as that reference point.
Based on the data obtained, a system of support vectors is generated with components equal to internode flows, with simultaneous transmitting of which the peak network load is achieved. For the purpose of the analysis, the permissible distributions of internode flows are proposed to record as a convex combination of support vectors. The resulting aggregated representation can be used in the development of regulatory indicators of stationary operation modes when transferring information flows exceeding the network functionality. As examples, estimates of the equal distribution of maximum possible flows are considered.

Keywords: multiuser network; network peak load; internode flows set

EXPERT SYSTEM FOR MONITORING AND FORECASTING OF RESOURCE ALLOCATION PROCESSES
  • A. V. Bosov  Institute of Informatics Problems, Federal Research Center "Computer Science and Control" of the Russian Academy of Sciences, 44-2 Vavilov Str., Moscow 119333, Russian Federation
  • D. V. Zhukov  Federal Research Center "Computer Science and Control" of the Russian Academy of Sciences, 44-2 Vavilov Str., Moscow 119333, Russian Federation

Abstract: The paper presents a project of an expert monitoring system designed to support decision-making in managing the processes of distribution (consumption and reproduction) of resources. The results of the analysis of the consumption process are presented in the form of scenarios for the integral assessment of its state. Scenarios are prepared by an expert, are situational in nature and are used in real calculations both to assess the current state and to predict the development of situations. The traditional interpretation of the consumption process is based on the concept of resources and subjects of consumption who consume resources in accordance with consumption rates, as well as a simple description of the reproduction of resources by production objects. It is assumed that the components of the information model are geographically and temporally referenced, in particular, data on resource reserves are linked to time. The main intellectual load is carried by the methodology for preparing scenarios for the integral assessment of the state. This technique is based on the ideology of expert evaluation of typical situations and the formation of calculation scenarios using simple machine learning methods. The latter use widespread approaches to optimization - minimization of mean squares and modules. The presented project of the expert system is instrumental in nature and can be used in various applications. The process of preparing and evaluating the effectiveness of the scenarios of integral assessment prepared by the expert is illustrated by numerical and graphic material.

Keywords: expert system; resources and consumption; machine learning; least squares method; least modules method

ROUTING JOBS TO HETEROGENEOUS PARALLEL QUEUES USING DISTRIBUTED POLICY GRANDIENT ALGORITHM
  • M. G. Konovalov  Institute of Informatics Problems, Federal Research Center "Computer Science and Control" of the Russian Academy of Sciences, 44-2 Vavilov Str., Moscow 119333, Russian Federation
  • R. V. Razumchik  Institute of Informatics Problems, Federal Research Center "Computer Science and Control" of the Russian Academy of Sciences, 44-2 Vavilov Str., Moscow 119333, Russian Federation

Abstract: The problem of dispatching to heterogeneous servers, operating independently in parallel, is considered.
Each server has a single processor and a dedicated FIFO (first in, first out) queue of infinite capacity. Homogeneous jobs (without preceding constraints) arrive one by one to the dispatcher which immediately makes a routing decision. Both jobs interarrival times and their sizes are assumed to be independent and identically distributed random variables with general distributions. Upon making a decision, full information about the current system's state, including the arrivingjob size, is available to the dispatcher. The problem is to minimize the long-run system's mean response time. A new sample-path-based policy gradient algorithm is proposed which allows one to construct such a policy. Its main ingredients are the dynamically changing discretization of the continuous state space and individual policy gradient algorithms acting in each cell. Simple numerical examples are given which demonstrate that the new algorithm can outperform best known solutions and is applicable in quite general cases.

Keywords: heterogeneous parallel queues; Markov chains with continuous state space; sojourn time optimization

THRESHOLDING FUNCTIONS IN THE NOISE SUPPRESSION METHODS BASED ON THE WAVELET EXPANSION OF THE SIGNAL
  • O. V. Shestakov  Department of Mathematical Statistics, Faculty of Computational Mathematics and Cybernetics, M. V Lomonosov Moscow State University, 1-52 Leninskie Gory, GSP-1, Moscow 119991, Russian Federation, Institute of Informatics Problems, Federal Research Center "Computer Science and Control" of the Russian Academy of Sciences, 44-2 Vavilov Str., Moscow 119333, Russian Federation, Moscow Center for Fundamental and Applied Mathematics, M. V. Lomonosov Moscow State University, 1 Leninskie Gory, GSP-1, Moscow 119991, Russian Federation

Abstract: When transmitted over communication channels, signals are usually contaminated with noise. Noise suppression methods based on thresholding of wavelet expansion coefficients have become popular due to their simplicity, speed, and ability to adapt to nonstationary signals. The analysis of the errors of these methods is an important practical task, since it makes it possible to assess the quality of both the methods themselves and the equipment used for processing. The most popular types of thresholding are hard and soft thresholding but each has its own drawbacks. In an attempt to address these shortcomings, various alternative thresholding methods have been proposed in recent years. The paper considers a model of a signal contaminated with additive Gaussian noise and discusses the general formulation of the thresholding problem with a thresholding function belonging to a certain class. An algorithm for calculating the threshold that minimizes the unbiased risk estimate is described. Conditions are also given under which this risk estimate is asymptotically normal and strongly consistent.

Keywords: wavelets; thresholding; adaptive threshold; unbiased risk estimate

A METHOD FOR ESTIMATING BENT, SHAPE AND SCALE PARAMETERS OF THE GAMMA-EXPONENTIAL DISTRIBUTION
  • A. A. Kudryavtsev  Department of Mathematical Statistics, Faculty of Computational Mathematics and Cybernetics, M. V Lomonosov Moscow State University, 1-52 Leninskie Gory, GSP-1, Moscow 119991, Russian Federation, Moscow Center for Fundamental and Applied Mathematics, M. V. Lomonosov Moscow State University, 1 Leninskie Gory, GSP-1, Moscow 119991, Russian Federation
  • O. V. Shestakov  Department of Mathematical Statistics, Faculty of Computational Mathematics and Cybernetics, M. V Lomonosov Moscow State University, 1-52 Leninskie Gory, GSP-1, Moscow 119991, Russian Federation, Moscow Center for Fundamental and Applied Mathematics, M. V. Lomonosov Moscow State University, 1 Leninskie Gory, GSP-1, Moscow 119991, Russian Federation, Institute of Informatics Problems, Federal Research Center "Computer Science and Control" of the Russian Academy of Sciences, 44-2 Vavilov Str., Moscow 119333, Russian Federation
  • S. Ya. Shorgin  Institute of Informatics Problems, Federal Research Center "Computer Science and Control" of the Russian Academy of Sciences, 44-2 Vavilov Str., Moscow 119333, Russian Federation

Abstract: The article discusses a modified method of moments for estimating three of five parameters of the gamma-exponential distribution. It is proposed to estimate the distribution parameters based on its logarithmic moments. An explicit form of estimates of the bent, shape, and scale parameters is given for fixed concentration parameters of the gamma-exponential distribution; the strong consistency of the obtained estimates is justified. The article also discusses the method of eliminating unnecessary solutions to the system of equations for logarithmic article moments; a number of numerical examples are presented to illustrate the derivation of estimates from model samples. Since the analyzed distribution is closely related to the generalized gamma distribution and the generalized beta distribution of the second kind, the results of this work can be widely used in applied problems using continuous distributions with an unbounded nonnegative support for modeling.

Keywords: parameter estimation; gamma-exponential distribution; mixed distributions; generalized gamma distribution; method of moments; consistent estimate

METHOD FOR IMPROVING ACCURACY OF NEURAL NETWORK FORECASTS BASED ON PROBABILITY MIXTURE MODELS AND ITS IMPLEMENTATION AS A DIGITAL SERVICE
  • A. K. Gorshenin  Institute of Informatics Problems, Federal Research Center "Computer Science and Control" of the Russian Academy of Sciences, 44-2 Vavilov Str., Moscow 119333, Russian Federation
  • V. Yu. Kuzmin  Faculty of Space Research, M.V. Lomonosov Moscow State University, 1-52 Leninskie Gory, GSP-1, Moscow 119991, Russian Federation

Abstract: A method aimed at improving the forecasting accuracy is presented. It uses a combination ofclassical probabilistic-statistical models and neural networks. Moments of mathematical models are used as a nontrivial expansion ofthe feature space. The efficiency ofthe proposed approach is demonstrated by the analysis ofseveral experimental data ensembles of the L-2M stellarator. Error decrease is especially noticeable when using the moments of the statistical models based on the increments of the initial observed data. To implement the methods of statistical analysis and the proposed machine learning algorithms, a digital service has been created. Its architecture and capabilities are also outlined.

Keywords: neural networks; finite normal mixtures; probability models; forecasting; digital service; high- performance computing; turbulence plasma; stellarator

VISUAL REPRESENTATION METHOD FOR THE CONFLICT STIMULATION IN HYBRID INTELLIGENT MULTIAGENT SYSTEMS
  • S. B. Rumovskaya  Kaliningrad Branch of the Federal Research Center "Computer Science and Control" of the Russian Academy of Sciences, 5 Gostinaya Str., Kaliningrad 236000, Russian Federation
  • I. A. Kirikov  Kaliningrad Branch of the Federal Research Center "Computer Science and Control" of the Russian Academy of Sciences, 5 Gostinaya Str., Kaliningrad 236000, Russian Federation

Abstract: Consideration of complex tasks (problems) in small teams of specialists in various fields makes it possible to get a better integrated solution. In such collectives, both destructive (personal) and constructive (instrumental) conflicts inevitably arise. Modeling the work of such teams and stimulating constructive conflicts in them will improve the quality of the solution and develop a solution method that is relevant to the problem. Visualization is a powerful tool for extracting, analyzing, and understanding of information. The work is devoted to the development of the method for visualizing the processes of stimulating conflicts within hybrid intelligent multiagent systems that simulate the reasoning of individual specialists by agents and display in the computer memory macrolevel processes arising as a result of the interaction of specialists when solving a problem "at a round table."

Keywords: collective of experts; conflict; visualization of the conflict stimulation

FORMS REPRESENTING NEW KNOWLEDGE DISCOVERED IN TEXTS
  • I. M. Zatsman  Institute of Informatics Problems, Federal Research Center "Computer Science and Control" of the Russian Academy of Sciences, 44-2 Vavilov Str., Moscow 119333, Russian Federation

Abstract: The model of goal-oriented discovery of new knowledge by a team of experts in texts and the forms of its representation in linguistic typologies and term dictionaries ofmedical knowledge bases are considered. The usage ofthe model is illustrated by two examples: the discovery ofnew knowledge about the meanings ofGerman modal verbs in parallel texts and about the meanings of terms in medical documents. The process of discovering new knowledge is based on linguistic annotation of texts performed by experts. The main goal of annotation is to enrich typologies with headings or, accordingly, augment knowledge bases with terms that meet the specified criterion of novelty, are agreed on within the team of experts, and represent the discovered knowledge. The model includes the coordination of experts' understanding of both the discovered knowledge and the forms of its representation. In the example of the term dictionary of a medical knowledge base, three forms are used: a new term, a changed definition of an existing term without increasing the number of its meanings, and an enlarged definition of an existing term with its new meanings.

Keywords: discovery of knowledge in texts; ITO model; concept; heading; term; contextual meaning; German modal verbs; typology; medical knowledge base

QUEUING SYSTEM WITH SIGNALS FOR DYNAMIC RESOURCE ALLOCATION FOR ANALYZING NETWORK SLICING IN 5G NETWORKS
  • I. A. Kochetkova  Peoples' Friendship University of Russia (RUDN University), 6 Miklukho-Maklaya Str., Moscow 117198, Russian Federation, Institute of Informatics Problems, Federal Research Center "Computer Science and Control" of the Russian Academy of Sciences, 44-2 Vavilov Str., Moscow 119333, Russian Federation
  • A. S. Vlaskina  Peoples' Friendship University of Russia (RUDN University), 6 Miklukho-Maklaya Str., Moscow 117198, Russian Federation
  • N. N. Vu  Peoples' Friendship University of Russia (RUDN University), 6 Miklukho-Maklaya Str., Moscow 117198, Russian Federation
  • V. S. Shorgin  Institute of Informatics Problems, Federal Research Center "Computer Science and Control" of the Russian Academy of Sciences, 44-2 Vavilov Str., Moscow 119333, Russian Federation

Abstract: Network slicing is one of the key technologies of fifth generation wireless networks with an ever-increasing number of users and services. A feature of this technology is the ability to organize logically isolated segments of radio resources for the specific requirements of the operator and its users, and the redistribution of the resource volumes between the segments is possible, but only at the moments of the controller accessing them. In this work, a mathematical model is built for two classes of impatient elastic traffic with a minimum rate guarantee transmission by queuing system with queues and signals that control resource redistribution. Formulas are given for calculating the parameters of the efficiency of resource redistribution - the coefficient of compliance with the initial distribution of the resource, the success rate of resource redistribution, and the coefficient of resource utilization.

Keywords: 5G; network slicing; queuing system with signals; dynamic resource allocation; elastic traffic

ANALYSIS OF 5G NR BASE STATIONS OFFLOADING BY MEANS OF NR-U TECHNOLOGY
  • А. V. Daraseliya  Peoples' Friendship University of Russia (RUDN University), 6 Miklukho-Maklaya Str., Moscow 117198, Russian Federation
  • E. S. Sopin  Peoples' Friendship University of Russia (RUDN University), 6 Miklukho-Maklaya Str., Moscow 117198, Russian Federation, Institute of Informatics Problems, Federal Research Center "Computer Science and Control" of the Russian Academy of Sciences, 44-2 Vavilov Str., Moscow 119333, Russian Federation
  • D. А. Moltchanov  Peoples' Friendship University of Russia (RUDN University), 6 Miklukho-Maklaya Str., Moscow 117198, Russian Federation, Tampere University, 7 Korkeakoulunkatu, Tampere 33720, Finland
  • K. E. Samouylov  Peoples' Friendship University of Russia (RUDN University), 6 Miklukho-Maklaya Str., Moscow 117198, Russian Federation, Institute of Informatics Problems, Federal Research Center "Computer Science and Control" of the Russian Academy of Sciences, 44-2 Vavilov Str., Moscow 119333, Russian Federation

Abstract: Fifth generation millimeter wave New Radio (NR) base stations (BS) are expected to be deployed in areas with extremely high and drastically fluctuating traffic demands resulting in frequent QoS (Quality of Service) violations in terms of provided rate at the access interface, especially, during busy hour conditions. As one of the measures to combat congestion, 3GPP (3rd Generation Partnership Project) considers the NR-U (NR-Unlicensed) technology, which allows to use the unlicensed frequency spectrum, for example, 60 GHz, on the BS in addition to the licensed spectrum. In this case, a session that cannot be served in the licensed spectrum due to lack of resources can be redirected to the unlicensed spectrum where competition for resources with WiGig technology subscribers takes place. The aim of this study is to evaluate the QoS (quality of service) parameters in an area characterized by a certain density of NR and WiGig users, where NR users can use NR-U technology if their rate requirements are met. The studied metric is the NR session loss probability and the achievable transmission rate in the unlicensed frequency spectrum. The performed numerical study shows that in addition to the density of NR and WiGig UE, the studied characteristics are influenced by the size of the contention window, the density of blockers, and the minimum required rate. The presented numerical results allow one to conclude that the approach under consideration can significantly increase the attainable data rate of user sessions but this requires dense deployments of NR technology

Keywords: NR-U; New Radio; WiGig; QoS; queuing theory; resource queuing system; Markov process