«INFORMATICS AND APPLICATIONS»
Scientific journal
Volume 17, Issue 2, 2023

Content | About  Authors

Abstract and Keywords

ON OPTIMIZATION PROBLEMS ARISING FROM THE APPLICATION OF TOPOLOGICAL DATA ANALYSIS TO THE SEARCH FOR FORECASTING ALGORITHMS WITH FIXED CORRECTORS

• I. Yu. Torshin  Federal Research Center "Computer Science and Control" of the Russian Academy of Sciences, 44-2 Vavilov Str., Moscow 119333, Russian Federation, Moscow State Aviation Institute (National Research University), 4 Volokolamskoe Shosse, Moscow 125933, Russian Federation

Abstract: Corrective operations (correctors) in multialgorithmic constructions of the algebraic approach can be based on known physical models and/or multilevel descriptions of physical objects. At the same time, within the framework of the topological approach to the analysis of poorly formalized problems, the search for algorithms included in the corrector can be considered as a combinatorial optimization problem or as a problem ofminimizing a certain loss function. The study of the neighborhoods of chains in the lattice of subsets of objects made it possible to obtain a number of rank optimization criteria that are promising for solving the problems of predicting numerical target variables. The formalism was tested on the problem of ligand-receptor interaction within the framework of the chemokine analysis of drug molecules (data from ProteomicsDB). The best results of predicting constants were observed when using the obtained rank criteria (correlation coefficient on a sliding control 0.86 ± 0.20 averaging over 300 biological activities).

Keywords: topological data analysis; lattice theory; optimization problems; regression; chemoinformatics

THE MONAD OF DIAGRAMS AS A MATHEMATICAL METAMODEL OF SYSTEMS ENGINEERING

• S. P. Kovalyov  V. A. Trapeznikov Institute of Control Sciences ofthe Russian Academy of Sciences, 65 Profsoyuznaya Str., Moscow 117997, Russian Federation

Abstract: The paper addresses issues associated with the development of advanced mathematical methods for systems engineering suitable as the basis of computer tools for automatic synthesis and analysis of systems and processes. Following recent trends, category theory is employed as the framework for the methods. Its application is based on representing the structure of systems, processes, requirements, and other system design results as diagrams in categories whose objects are the algebraic models of parts and morphisms describe relationships between parts. Applying the fundamental Grothendieck flattening construction, the following constructions are described explicitly: categories of diagrams, the monad of diagrams, and the monad and the comonad of pointed diagrams. Application areas of these constructions in systems engineering procedures are identified. An approach is proposed to implement highly automated technologies of the generative design kind for complex multilevel systems.

Keywords: category theory; monad of diagrams; Grothendieck construction; colimit; systems engineering; system of systems; generative design

MULTIPLAYERS' GAMES COMPOSITIONAL STRUCTURE IN THE MONOIDAL CATEGORY OF BINARY RELATIONS

• N. S. Vasilyev  N. E. Bauman Moscow State Technical University, 5-1 Baumanskaya 2nd Str., Moscow 105005, Russian Federation

Abstract: The system approach is suggested for multiplayers' games solution that meets up-to-date network technologies. It allows to optimize the functionality of multiagent systems. The monoidal category of binery relations is applied to make games rules description and players' behavior study and modification. The game problem is to maximize, if possible, the preference relations of all participants in the game. Their composition in the monoidal binary relations category in correspondence with games rules defines resulting game relation (RGR). Players' rational behavior search is reduced to RGR maximum elements choice. The author formalizes the use of various classes of permissible strategies, information exchange processes, and coalitions formation. The RGR existence is proved and maximum RGR elements structure is studied. Moves priority and absolutely optimal preference relations significance are clarified for the coalitions formation process.

Keywords: player's preference relations: absolutely optimal relation, guarantied relation, moves priority relation; game graph; permissible strategy; rational solution; coalition characteristic relation; resulting game relation; monoidal category; compositionality

MARKET WITH MARKOV JUMP VOLATILITY I: PRICE OF RISK MONITORING AS AN OPTIMAL FILTERING PROBLEM

• A. V. Borisov  Federal Research Center "Computer Science and Control" of the Russian Academy of Sciences, 44-2 Vavilov Str., Moscow 119333, Russian Federation

Abstract: The first part of series is devoted to investigating the market price of risk in a financial system. It contains riskless bank deposits, risky base assets, and their derivatives. The model ofthe underlying price evolution represents a stochastic differential system with stochastic volatility which is a hidden Markov jump process. The investigated market is incomplete and has no arbitrage possibilities. The market price ofrisk, which corresponds to a prevailing martingale measure, can be characterized via the hidden Markov jump process but can not be restored precisely. However, it can be estimated optimally using the observations of both the derivative and underlying prices. Using the concept of the prevailing martingale measure existence, one can derive a system of the partial differential equations which describes an evolution of the derivative prices and represents some analog of the classic Black-Sholes equation. Then, one can convert the calculation problem for the market price of risk to the optimal state filtering in a differential stochastic observation system. The paper also discusses various aspects ofthe numerical realization for the stated estimation problem.

Keywords: Markov jump process; optimal filtering; diffusion and counting observations; multiplicative observation noise; numerical approximation accuracy

MEAN-SQUARE RISK OF THE FDR PROCEDURE UNDER WEAK DEPENDENCE

• M. O. Vorontsov  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  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, Federal Research Center "Computer Science and Control" of the Russian Academy of Sciences, 44-2 Vavilov Str., Moscow 119333, Russian Federation

Abstract: In many application areas, the problem of processing large amounts of data arises. In this case, before processing, the data array is often subjected to some transformation leading to a "sparse" or "economical" representation in which the absolute value of most elements of the array is equal to zero (or sufficiently small).
In addition, as a result of interference when receiving and transmitting data, they become corrupted with noise and it is desirable to remove this noise during further processing. The resulting task is mathematically equivalent to some multiple hypothesis testing problems. Previously, to solve this problem under conditions of normality, independence, and sparsity of data, a procedure based on the method of controlling the average proportion of erroneously rejected hypotheses was proposed (False Discovery Rate, FDR). In this paper, the authors study the asymptotics of the mean-square risk of this procedure in the case of a weak dependence in the data.

Keywords: thresholding; multiple hypothesis testing; mean-square risk

ROBUSTNESS INVESTIGATION OF THE NUMERICAL APPROXIMATION OF THE WONHAM FILTER

• A. V. Bosov  Federal Research Center "Computer Science and Control" of the Russian Academy of Sciences, 44-2 Vavilov Str., Moscow 119333, Russian Federation

Abstract: The properties of the optimal continuous Markov chain state filtering problem decision given be the linear observations noisy Wiener process, assuming incomplete information about its intensity, are investigated. The uncertainty of the observation system is set by the upper bound of the noise intensity. Numerical implementation of the optimal solution in the statement with complete information provided by the Wonham filter does not guarantee stability. It is shown that the Wonham filter in the statement with uncertainty is robust with respect to the noise intensity if the model parameters do not lead to its divergence. In the general case, the instability of the Euler-Maruyama numerical scheme of the Wonham filter is preserved. Simple heuristic techniques that provide stable approximations of the Wonham filter show the workability for a wider set of parameters. However, in the statement with uncertainty, it is possible to give examples when such heuristic filters show unacceptably low quality.
The best solution is provided by discretized filters, approximations of the Wonham filter implemented for a specific model approximating the initial continuous observation system. A series of numerical experiments has shown that these filters have robustness for all sets of parameters. If there are no divergent trajectories among the modeled trajectories of the Wonham filter in the calculations, then the discretized filters lose a little. If there are divergent trajectories, then the gain of discretized filters is absolute.

Keywords: Markov jump process; stochastic filtering; robust estimation; Wonham filter; Euler-Maruyama numerical scheme; discretized filters

CRITERIA FOR CHOOSING THE FACTORIZATION MODEL DIMENSIONALITY

• M. P. Krivenko  Federal Research Center "Computer Science and Control" of the Russian Academy of Sciences, 44-2 Vavilov Str., Moscow 119333, Russian Federation

Abstract: The paper is devoted to the choice ofmodel dimension ofmatrix factorization in the presence ofmissing elements. The problem of estimating the parameters of the adopted data model is solved by multidimensional optimization. Estimating the value of reduced dimensionality is a typical example of the problem of choosing a model when an alternative arises during data analysis and the choice means either finding out the preferences of individual options or highlighting the "best" representative. Typically, applied selection criteria are based on likelihood function which requires probabilistic assumptions about the data. But when evaluating the parameters of the factor model under consideration, they are not set and it is impractical to introduce them, so as not to violate the commonality of the formulated task of reducing dimensionality. Therefore, an attempt was made to turn to the idea of reusing the available data for the statistical output. None of the existing approaches (bootstrap, folding knife, rechecks, as well as permutation tests) is suitable; so, an original method for generating new data by additional omissions ofelements ofthe original matrix was proposed. To process the formed samples, it is suggested to use a combination of the model of a mixture of normal distributions in conjunction with nuclear smoothing.
The proposed solutions make it possible to correctly carry out the procedure for justifying the dimensionality ofthe adopted factorization model. The exposition is illustrated by an example ofsynthetic data processing.

Keywords: lower rank matrix approximation; missing data; criteria for model selection; resampling methods; kernel smoothing

ANALYSIS OF THE QUEUEING SYSTEMS WITH MIXED PRIORITIES

• A. K. Bergovin  M. V. Lomonosov Moscow State University, 1-52 Leninskie Gory, GSP-1, Moscow 119991, Russian Federation
• V. G. Ushakov  M. V. Lomonosov Moscow State University, 1-52 Leninskie Gory, GSP-1, Moscow 119991, Russian Federation, Federal Research Center "Computer Science and Control" of the Russian Academy of Sciences, 44-2 Vavilov Str., Moscow 119333, Russian Federation

Abstract: A one-line queuing system with an infinite number of waiting places, an arbitrary distribution of service time, and Poisson incoming flows of customers is studied. Two models of mixed priorities are considered. In the first model, there is either preemptive repeat priority discipline between the customers of different flows or a head of the line priority discipline. In the second model - preemptive priority discipline either with loss or with repeat of a newly interrupted customer. By the method of additional components, a multidimensional random process is investigated, the components of which are the number of customers of each priority in the system and the time elapsed since the start of servicing the customer located on the device at time t. The distribution of the specified process in the nonstationary mode of the system is found.

Keywords: head of the line; preemptive repeat; preemptive loss; one-line; queue length

A QUEUEING SYSTEM FOR PERFORMANCE EVALUATION OF A MARKOVIAN SUPERCOMPUTER MODEL

• R. V. Razumchik  Federal Research Center "Computer Science and Control" of the Russian Academy of Sciences, 44-2 Vavilov Str., Moscow 119333, Russian Federation
• A. S. Rumyantsev  Institute of Applied Mathematical Research of the Karelian Research Center of the Russian Academy of Sciences, 11 Pushkinskaya Str., Petrozavodsk 185910, Russian Federation
• R. M. Garimella  Mahindra University, 62/1ABahadurpally Jeedimetla, Hyderabad 500043, India

Abstract: Consideration is given to the well-known supercomputer model in the form of a Markovian nonwork- conserving two-server queueing system with unlimited queue capacity, in which customers are served by a random number of servers simultaneously. For the first time, it is shown that its basic probabilistic characteristics can be calculated from an unrelated single-server queueing system with infinite capacity, work conserving scheduling, and forced customers' losses. Based on the known matrix-analytic techniques for quasi-birth-and-death processes, it is shown that in certain special cases, the transient queue-size distribution can be found (in terms of Laplace transform) using the Level Crossing Information method and has a matrix-geometric form. Numerical examples which illustrate some properties of the established connection between the two queueing systems are provided.

Keywords: supercomputer model; queueing system; nonwork-conserving scheduling; transient regime

ON MODELING THE EFFECTS OF MULTICAST TRAFFIC SERVICING IN 5G NR NETWORKS

• A. K. Samouylov  RUDN University, 6 Miklukho-Maklaya Str., Moscow 117198, Russian Federation
• A. A. Platonova  RUDN University, 6 Miklukho-Maklaya Str., Moscow 117198, Russian Federation
• V. S. Shorgin  Federal Research Center "Computer Science and Control" of the Russian Academy of Sciences, 44-2 Vavilov Str., Moscow 119333, Russian Federation
• Yu. V. Gaidamaka  RUDN University, 6 Miklukho-Maklaya Str., Moscow 117198, Russian Federation, Federal Research Center "Computer Science and Control" of the Russian Academy of Sciences, 44-2 Vavilov Str., Moscow 119333, Russian Federation

Abstract: Multicasting in wireless access networks allows efficient provision of a service to a group of subscribers and is useful for reducing the resource required to serve user equipments requesting the same data. The support of this feature in current 5G New Radio (NR) technology and future subterahertz (sub-THz) 6G systems faces challenges associated with the use of the directional beamforming phased array antennas. The presented multicast and unicast traffic service model allows one to explore the range of 5G/6G network parameters to reduce the density of base stations while maintaining the quality of services provided to subscribers.

Keywords: 5G; 6G; multicasting; millimeter wave; terahertz; multibeam antennas; multi-RAT; numerical simulation

SELF-LEARNING OF AUTONOMOUS INTELLIGENT ROBOTS IN THE PROCESS OF SEARCH AND EXPLORE ACTIVITIES

• V. B. Melekhin  Dagestan State Technical University, 70A Imam Shamil Ave., Makhachkala 367015, Republic of Dagestan
• V. M. Khachumov  Ailamazyan Program Systems Institute of the Russian Academy of Sciences, 4A Petra Pervogo Str., Veskovo 152024, Yaroslavl Region, Russian Federation, Federal Research Center "Computer Science and Control" of the Russian Academy of Sciences, 44-2 Vavilov Str., Moscow 119333, Russian Federation, RUDN University, 6 Miklukho-Maklaya Str., Moscow 117198, Russian Federation, Federal Research Center "Computer Science and Control" of the Russian Academy of Sciences, 44-2 Vavilov Str., Moscow 119333, Russian Federation
• M. V. Khachumov  Ailamazyan Program Systems Institute of the Russian Academy of Sciences, 4A Petra Pervogo Str., Veskovo 152024, Yaroslavl Region, Russian Federation, Federal Research Center "Computer Science and Control" of the Russian Academy of Sciences, 44-2 Vavilov Str., Moscow 119333, Russian Federation, RUDN University, 6 Miklukho-Maklaya Str., Moscow 117198, Russian Federation, Federal Research Center "Computer Science and Control" of the Russian Academy of Sciences, 44-2 Vavilov Str., Moscow 119333, Russian Federation

Abstract: One of the effective approaches to organizing the goal-seeking behavior of autonomous integral robots in the process of search and explore activities in an a priori undescribed conditions of a problematic environment is considered. It is proposed to use the procedures of visual-effective thinking based on the formalization of the reflex behavior of highly organized living systems as the basis for the goal-seeking behavior of robots. A self-learning algorithm has been developed for the conditions with a high level of uncertainty which allows automatically generating conditional programs of expedient behavior that provide autonomous integral robots with the ability to achieve a given behavioral goal in the process of search and explore activities. The boundary estimates of the functional complexity of the proposed self-learning algorithm under uncertainty are found showing the possibility of its implementation on the onboard computer of autonomous integral robots which have, as a rule, limited computing resources. A modeling of self-learning process for an autonomous integral robot in an a priori undescribed and problematic environment was carried out which confirmed the effectiveness of the proposed approach for organizing the planning of goal-seeking behavior in an a priori undescribed and problematic environments.

Keywords: autonomous integral robot; self-learning algorithm; uncertainty conditions; problematic environment; conditional signals

COMPLEX CAUSE-AND-EFFECT RELATIONSHIPS

• A. A. Grusho  Federal Research Center "Computer Science and Control" of the Russian Academy of Sciences, 44-2 Vavilov Str., Moscow 119333, Russian Federation
• N. A. Grusho  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  Federal Research Center "Computer Science and Control" of the Russian Academy of Sciences, 44-2 Vavilov Str., Moscow 119333, Russian Federation
• S. Ya. Shorgin  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 task of constructing a logical inference of the specific property from data selected from a plurality of sets of source data. When solving the problem, it should be taken into account both the possibility of violating the cause-and-effect scheme due to noise and the possibility of not achieving the necessary conclusion.
The cause-and-effect scheme of approximate inference has been built, consisting of objects of covering causes and consequences, which begins from the initial prerequisites and ends with the output of the object containing the required property. To describe the process of generating logical inference of the object with the property of interest from the source data, the concept of activating objects is introduced. This property allows one to represent the inference scheme in the form of a DAG (Directed Acyclic Graph). The simple algorithm for constructing the cause-and-effect scheme was built from the source data up to the object containing the desired property. This algorithm also determines the conditions for the existence of the ability to inference from the original conditions up to the object with the required property.

Keywords: cause-and-effect relationships; approximate logical inference; probability of correct inference under noise conditions

METHODOLOGY OF THE CORPUS-BASED STUDIES IN THE FIELD OF CONTRASTIVE PUNCTUATION

• V. A. Nuriev  Federal Research Center "Computer Science and Control" of the Russian Academy of Sciences, 44-2 Vavilov Str., Moscow 119333, Russian Federation
• V. I. Karpov  Federal Research Center "Computer Science and Control" of the Russian Academy of Sciences, 44-2 Vavilov Str., Moscow 119333, Russian Federation, Institute of Linguistics of the Russian Academy of Sciences, 1 bld. 1 Bolshoy Kislovsky Lane, Moscow 125009, Russian Federation

Abstract: The paper refines the methodological approach to the contrastive studies of punctuation. Given the recent achievements of information science, computer linguistics, and translation theory, such studies are most likely to be corpus-based. The paper presents a methodological model of research into interlingual punctuation asymmetry the aim of which is to shed light on the functional scope of the same punctuation marks in different languages.
It shows what methodological trends are characteristic of this research area. The focus is also on the specificities of corpus methodology in the contrastive study of punctuation. It is argued that one of the methodological tools, tailored specifically to the needs of contrastive punctuation research, may be the supracorpora databases developed at the Federal Research Center "Computer Science and Control" of the Russian Academy of Sciences.

Keywords: contrastive punctuation; translation; corpus-based translation studies; corpus-based studies; parallel corpus; supracorpora database; asymmetry between languages; methodology

SELECTION OF SPECIALISTS IN THE ORGANIZATION OF COLLECTIVE SOLVING PROBLEMS

• S. B. Rumovskaya  Federal Research Center "Computer Science and Control" of the Russian Academy of Sciences, 44-2 Vavilov Str., Moscow 119333, Russian Federation

Abstract: The study of small groups (collectives, teams), their characteristics, problems, dynamics, and features of selection of specialists stands at the intersection of psychology of personnel management and social psychology A special place in a wide range of areas of modern science is occupied by modeling the interaction of people in small collectives of specialists, in particular, within the framework of a multiagent approach. At the same time, when developing intelligent systems (artificial heterogeneous collectives) to solve practical problems, it is now required to combine in the system the models of specialists (agents) with incompatible goals and domain models. These agents are created by different development teams. The selection of specialists in natural and models of specialists in artificial heterogeneous teams is an important task, the results of which influence the further decision-making process. The paper presents an analysis of methods and approaches to the selection of specialists and the acquisition of small groups (collectives, teams) whose measuring tools should be exposed to quality assessment.

Keywords: group; small collective of specialists; team; methods of selecting specialists and forming small groups; teambuilding