No. 4 (2021)

Published: 2021-11-14

SECTION I. DISTRIBUTED COMPUTING SYSTEMS

  • THEORETICAL FOUNDATIONS OF CREATING SELF-ORGANIZING DISPATCHERS OF DISTRIBUTED SYSTEMS BASED ON A MULTI-AGENT SOCIO-INSPIRATIONAL APPROACH

    A.I. Kalyaev
    Abstract

    This article describes new principles of organization, methods and algorithms for the functioning
    of the Distributed System (DS) dispatcher, which allow allocating and reallocating resources
    with dynamically changing parameters between incoming tasks in order to minimize their
    execution time. The main problem that does not allow today to effectively estimate the execution
    time of tasks in a heterogeneous DS directly follows from the distribution of the system: each of its
    elements has partial independence and may differ significantly from others, moreover, in the process
    of operation, its capabilities may change, and all this is essential. affects the efficiency of
    distribution of tasks between DS nodes and the time it takes to complete tasks. The article proposes
    a new approach to organizing a DS dispatcher, based on the application of the theory of multiagent
    systems and socio-inspirational (based on accepted in human society) methods: DS users
    place their tasks on special nodes – bulletin boards, a proactive software agent is placed on each
    DS node, which implements constant monitoring of the parameters of your site and search on message
    boards suitable for solving problems. At the same time, the agents participating in the solution
    of the common task form communities in which they plan the process of solving the task and
    the distribution of parts of the tasks to minimize the delay time for their solution. As a criterion for
    the effectiveness of the DS, it was decided to take the value of the average delay in the execution of
    functional tasks relative to the required points in time, respectively, the agents distribute tasks in
    such a way as to minimize the value of the specified criterion. This article includes an introduction,
    a formal statement of the task of scheduling DS resources, a review of existing approaches to
    organizing a DS dispatcher, a description of the proposed multi-agent solution to the task of
    scheduling DS resources using a socio-inspirational approach, an algorithm for the operation of a
    distributed system and its elements, a description of the application of a socio-inspirational approach
    in relation to the task scheduling process. and conclusion. The main advantages of the
    proposed approach include: the ability to use reliable and up-to-date information about the specialization
    and current performance of resources in dispatching; high fault tolerance due to the
    absence of DS elements, failure of which leads to a complete loss of DS performance; the possibility
    of flexible scaling of the DS (increasing the number of resources), achieved by decentralizing
    the dispatching process.

  • ESTIMATION OF THE PROBABILITY OF DETECTING A FALSE RESULT OF DISTRIBUTED CALCULATIONS PERFORMED BY A CENTRALIZED MULTI-AGENT SYSTEM

    V. A. Litvinenko, S.A. Khovanskov , V. S. Khovanskovа
    Abstract

    We consider the issues of protection of distributed computing organized on the basis of a multiagent
    system for solving problems of multivariate modeling. When modeling, choosing one of the many
    options may require going through a huge set of parameters that are not available for a high-speed
    computer. Distributed computing is used to reduce the time needed to solve such problems. There are
    many different approaches for organizing distributed computing in a computer network: grid technology,
    metacomputing (BOINC, PVM, and others). All of them are intended for creating centralized distributed
    computing systems. Distributed computing is organized on the basis of a multi-agent system on
    the computing nodes of any computer network. When using a large-scale computer network as a computing
    environment, there may be security threats to distributed computing. One of these threats is getting
    a false result from hackers during calculations. A false result may lead to making an inappropriate or
    incorrect decision during the simulation process. Managing agents of a centralized distributed computing
    system, in addition to managing a distributed system, are forced to detect false results of the calculation
    process. A method has been developed for calculating the probability of detecting a false result
    depending on the total number of agents in a multi-agent system and the number of control agents. Examples
    of calculating the number of control agents that provide the required probability of detecting
    false results in a multi-agent system are given.

  • BIOINSPIRED METHOD FOR CLASSIFICATION OF DISTRIBUTED RESOURCES FOR DISPATCHING IN GRID-COMPUTING

    D.Y. Kravchenko , Y.A. Kravchenko, V.V. Markov , A. E. Saak
    Abstract

    The article is devoted to solving the problem of scheduling distributed computing resources
    based on their classification by the bioinspired search method to improve the efficiency of gridcomputing
    functioning. The relevance of the problem is justified by a significant increase in the
    demand for the paradigm of distributed computing in conditions of information overflow and uncertainty.
    The article deals with the problems of scheduling heterogeneous computing resources
    when solving complex professional and scientific problems arriving at different points in time,
    based on the classification according to significant signs of resource compliance and readiness. A
    comparative review of existing analogues is carried out. The formulation of the problem to be
    solved in the context of the selected research topic is formulated. The strategy of choosing
    bioinspired modeling for solving the problem has been substantiated. The aspects of various decentralized
    bioinspired methods effectiveness of the use are analyzed. It is proposed to solve the
    problem of scheduling computational resources based on determining the correspondence of the
    resource to the required class. The classification is carried out on the basis of the bioinspired
    optimization method application, built on the basis of the Fish School Search algorithm. The use of
    the population bioinspired method allows us to provide unprecedented parallelism in obtaining
    alternative solutions and to optimize the distribution of available computing resources depending
    on the sets of significant features. The object of the research is the processes of data classification,
    which include ordered sequences of actions aimed at the distribution of computing resources by
    classes of problems to be solved. The subject of the research is bioinspired methods for solving the
    problem of data classification in grid-computing. To evaluate the effectiveness of the proposed
    method, a software application was developed and a computational experiment was carried outwith a different number of computing resources generated classes. Each computing resource has a
    certain set of attributes, which is a vector of its features. The cosine measure of the similarity between
    a resource attributes vector and a certain class attributes vector is a classification criterion.
    To improve the quality of the dispatching process, the task of classifying computing resources is
    solved for a variety of options for organizing the flows of complex tasks to be solved in gridcomputing.
    The obtained quantitative estimates demonstrate the time savings in solving the problems
    of scheduling distributed computing resources based on their classification by the bioinspired
    search method at least 7 %. The time complexity in the considered examples was . The described
    studies have a high level of theoretical and practical significance and are directly related
    to the solution of artificial intelligence classical problems.

SECTION II. INTELLIGENT SYSTEMS

  • AN INTELLIGENT SENTIMENT ANALYSIS SYSTEM FOR MEASURING CUSTOMER LOYALTY AND MAKING DECISIONS BASED ON FUZZY LOGIC

    E.M. Gerasimenko, V.V. Stetsenko
    Abstract

    This paper presents an intelligent approach of measuring customer loyalty to a specific
    product based on the analysis of comments. General sentiment analysis in tweets and messages is
    quite common, but task-oriented analysis of user opinions and measuring their level of loyalty is a
    new idea. The tricky part of doing task-oriented sentiment analysis lies in measuring customer
    loyalty to a particular product based on how customers feel about that product itself. The resulting
    data on the level of customer loyalty to the product can help a new customer to make a decision on
    a specific product, taking into account its various characteristics and feedback from previous customers. The dataset was a large dataset of online customer testimonials from Amazon.com. The set of
    initial data is a set of reviews, from which the proposed approach forms an aggregated assessment of
    opinions, then a fuzzy logic model is used to measure customer loyalty to the product. In the proposed
    approach, the input text is first processed using such methods as tokenization, removal of stop words,
    lemmatization, then the parts of speech are marked and the polarity of the reviews is analyzed, then
    fuzzy logic methods are applied to the obtained aggregated estimates to determine the degree of customer
    loyalty to the product. This work used various open API libraries such as SentiWordNet, Stanford
    CoreNLP, etc. The approach used focuses on identifying the sentiment of reviews, which can be
    positive, negative and neutral. In our study, we used a triangular membership function, also known
    as trimf, because it supports three variables and creates a relationship between them. The implementation
    of the approach ensures high accuracy in determining loyalty to e-commerce products, which
    is superior to previous approaches, and the use of fuzzy logic has significantly increased the values of
    such indicators as precision, recall, and F-measure.

  • EVOLUTIONARY DESIGN AS A TOOL FOR DEVELOPING MULTI-AGENT SYSTEMS

    L. A. Gladkov, N. V. Gladkova
    Abstract

    The article is devoted to the discussion of the problems of constructing evolving multi -
    agent systems. Possible methodologies for designing multi-agent systems are considered. The
    relevance of developing new principles for constructing multi -agent systems based on evolutionary
    design methods is noted. The correspondences between the terms of the theory of
    agents and the theory of evolution are highlighted. The prospects of using hybrid approaches
    to the design of multi-agent systems are noted. The principles of construction and the poss ibility
    of using fuzzy genetic algorithms in the design of multi -agent systems are considered.
    It is suggested that the models and methods of the theory of evolutionary modeling can be
    successfully applied in the design of multi-agent systems. An evolving multi-agent system is
    proposed. The procedure for the formation of new agents in the process of evolution is described.
    The set of parameters for assessing the state of each agent in the population has
    been determined. The resource parameters are proposed to be used to assess the current state
    of the agent and the possibilities of its interaction with other agents. The definitions of an
    agency and a family, the minimum elements of an evolving multi -agent system are given. An
    evolutionary strategy for constructing a model of an evolving multi -agent system is proposed.
    The procedures for the execution of the original evolutionary operators for processing the
    population of agents are described. Based on the proposed methodology, a software system
    for supporting the evolutionary design of agents and multi-agent systems was developed. Atpresent, computational experiments are being carried out to study the proposed design model
    for multi-agent systems, as well as to evaluate the effectiveness of various operators and
    schemes for the formation of descendant agents, the necessary conditions for survival.

  • SELECTING FEATURES OF THE MODEL TRANSFORMATION CHARACTERISTICS FOR AN INTELLIGENT PHYSICAL QUANTITY SENSOR

    S. I. Klevtsov
    Abstract

    The paper discusses the issues of choosing the type and parameters of the model of the transformation
    characteristic of an intelligent sensor of physical quantities using the example of a pressure
    sensor. The transformation characteristic of an intelligent sensor is a mathematical, algorithmic
    and software for calculating a physical quantity based on electrical signals that come from the measuring
    channels of the sensor. The model of the conversion characteristic should be adapted to the
    configuration of the conversion function of the sensor's sensitive element and the behavior of this
    function under the influence of external destabilizing factors. The paper considers various models of
    the conversion characteristics, identifies the features of their application, advantages and disadvantages,
    attainable levels of approximation error of the real characteristic, which affect the final
    measurement accuracy of the smart sensor. Smart sensors are used for measuring physical quantities
    in various technical systems and the requirements for measurement accuracy in real-life tasks are
    different. The measurement accuracy is largely determined by the degree of approximation of the real
    characteristics of the sensor by its mathematical model. The more complex the model, the more difficult
    it is to implement in the sensor, and the higher the measurement cost. Therefore, it is important
    to control the conversion characteristic approximation error in order to use the sensor efficiently. To
    control the approximation error of the transformation characteristic of an intelligent pressure sensor,
    it is proposed to use the method of multi-segment spatial approximation, and use models of linear or
    nonlinear spatial elements as segments. The basic mathematical expressions, the error control
    scheme are determined. The results of modeling are presented, which show the possibility and advantages
    of using the method for the formation of spatial models of the transformation characteristics,
    which are adaptive to changes in the real transformation function of the sensor, take into account
    the influence of external factors on the measurement results. In addition, the method allows you
    to modify the current spatial approximation model by changing the types of local spatial elements
    and, thus, to control the measurement error

  • GENERALIZED TRIGONOMETRIC SYSTEMS AND SPECTRAL TASKS WITH ADDITIONAL INTERNAL BOUNDARY CONDITIONS

    A. G. Klovo , G.V. Kupovykh , А.А. Ilyukhin, I. A. Lyapunova
    Abstract

    When solving problems related to the study of the strength properties of various structures,
    some sets of trigonometric (sine or cosine), as well as hyperbolic functions are often used, which
    cyclically pass into each other when taking derivatives. These sets consist of two functions, and the
    last of these functions, when differentiating, passes into the first, taken respectively with a plus sign (a
    trigonometric system of the first type) or a minus sign (a trigonometric system of the second type).
    Trigonometric and hyperbolic functions are also used in solving many applied problems, whose
    mathematical models contain second derivatives in spatial variables. If the mathematical model contains
    fourth-order derivatives with respect to spatial variables, then when solving the corresponding
    problems, it is possible to use functions whose fourth derivatives are proportional to these functions.
    There are a number of works on the general theory of systems of functions, where generalized trigonometric
    systems (GTS) of functions are described, the derivatives of a certain order of which are
    proportional to these functions. In this paper, this theory is developed in the direction of studying the
    quadratic forms of the functions that make up the GTS. It is shown that the quadratic forms of GTS
    functions can themselves be GTS functions of the same order (of the first or second types). The obtained
    identities and the created theory are used to solve spectral problems for a fourth-order operator
    for functions with certain conditions. The specificity of the problems under consideration is that in
    addition to the standard boundary conditions, there are additional conditions on the inner boundary.
    These conditions are not sufficient to independently solve the problem in each separate domain in
    which the functions under study are specified. The use of the GTS properties identified herein allows
    us to solve such problems in the entire area under consideration.

SECTION III. DECISION SUPPORT SYSTEMS

  • DECISION-MAKING METHOD FOR TYPICAL PROCESSES MODELS FORMATION FOR CLOUD-BASED ENTERPRISE SYSTEMS

    А. А. Levchenko, V. V. Taratukhine , Y.A. Kravchenko
    Abstract

    The article is devoted to solving the problem of creating a decision-making method in the formation
    of typical enterprise processes in information systems based on cloud technologies, also
    known as systems operating on the SaaS model (Software as a Service). The study's relevance is due
    to the novelty of cloud computing technology and the impossibility of applying the methods developed
    for on-Premise class systems. The study aims to improve the efficiency of using typical enterprise
    models in the implementation and use of SaaS systems. Increased efficiency affects the time and
    budget of the SaaS implementation project and operational costs after implementation. Achievement
    of the research goal is achieved by performing the following tasks: an analytical review of the research
    area for available methods, formalization and canonical formulation of the research task,
    description of the elements of project documentation as a single system of elements, and determination
    of relationships between them, development of a method for making decisions on the formation
    of models of typical processes, as structural elements of the system, verification of the method by
    determining the criterion for the effectiveness of the method and its comparison with the data of previous
    approaches. The research task is formalized as a canonical optimization problem with an objective
    function to maximize the efficiency criterion. The criterion of efficiency is given in the form of
    a formula that describes the degree of coverage of functional requirements to the target processes of
    the enterprise by standard models. The article describes the methods and algorithms used to solve
    similar problems, as well as their disadvantages and limitations. The proposed method is based for
    the first time on the theory of fuzzy sets and uses the Mamdani fuzzy inference algorithm to link a set
    of functional requirements and a set of system implementations. On the basis of the method, a software
    application was developed, and a computational experiment was carried out. The sample for
    testing the method and its comparison with existing analogs was formed on the basis of functional
    requirements for organizational processes of procurement management of large enterprises and the
    implementation of these requirements in SaaS systems on the SAP platform. The growth of the value
    of the efficiency criterion was confirmed in the case of the application of the proposed method, which
    demonstrates its advantage over the available alternative solutions already at the second iteration of
    use. As an example, a description of a typical process for creating a purchase requisition before and
    after applying the proposed method is presented.

  • INTELLIGENT SUBSYSTEM FOR DECISION SUPPORT BASED ON BIOLOGICALLY PLAUSIBLE ALGORITHMS FOR SELF-ORGANIZATION

    E.V. Kuliev , M.P. Krivenko, М.М. Semenova, S. V. Ignatieva
    Abstract

    The article discusses the basic concepts and definitions of decision support systems based
    on self-organization. Decision Support Systems refers to a range of interactive computer systems
    that help to use data, models, and knowledge to solve semi-structured, unstructured, or unstructured
    problems. The diagram of the basic structure of the decision support system is shown and
    described. Three main components of Decision Support Systems are considered, and a case is
    described when the fourth component of a decision support system - a knowledge-based management
    system - can be applied. The article offers a description of an intelligent decision support
    system. Examples of specialized intelligent decision support systems include intelligent marketing
    decision support systems and medical diagnostics systems, flexible manufacturing systems. The
    problems associated with making optimal decisions occupy an important place in computer-aided
    design and require improving methods and means of supporting optimal design processes at various
    stages. Self-organization algorithms inspired by wildlife are considered. Bioinspired algorithms
    are a representative class of self-organization algorithms. Bio-inspired computing mimics
    nature and uses the underlying concepts and behavior of these systems to solve complex problems.
    The article describes the algorithm for bats. An experimental analysis of the process of applying
    the self-organization algorithm in decision-making systems is carried out.

  • DEVELOPMENT OF BIOHEURISTICS FOR CREATING AN INTELLECTUAL SUBSYSTEM FOR MAKING EFFECTIVE DECISIONS OF NP-HARD AND NP-DIFFICULT COMBINATORY-LOGICAL PROBLEMS ON GRAPHS

    D. V. Zaruba , E. V. Kuliev , D.Y. Zaporozhets , M. M. Semenova
    Abstract

    The article is devoted to the solution of new topical problems that have arisen in the conditions
    of the modern development of information and nanometer technologies in the field of design,
    as well as the development of new innovative methods that provide effective solutions in polynomial
    time. The article deals with the problem of solving NP-hard problems. The description of the
    procedure for measuring the complexity of the problem is presented the features of NP-hard and
    NP-difficult combinatorial logic problems are described. The main differences between the tasks
    are presented, as well as the problems that one has to face when solving this type of task. The general
    decision-making scheme is presented, consisting of the problem formulation; decisionmaking;
    signal in automatic systems and feedback. At the second stage (formation and selection of
    solutions), the solution is based on a bioinspired algorithm for finding solutions to the traveling
    salesman problem. To solve this problem, a modified bioinspired algorithm based on the behaviorof an ant colony was developed. Unlike other optimization methods, metaheuristic algorithms can
    find global optimal solutions for problems where there are many local solutions due to their random
    nature. These reasons have led to the widespread use of such algorithms in solving various
    optimization problems. Bioinspired algorithms are becoming a new revolution in the field of solving
    optimization problems. The statement of the traveling salesman problem is presented, as well
    as the solution of the problem on the basis of the ant algorithm. Algorithms such as genetic algorithms
    and PSO can be very useful, but they still have some disadvantages in solving multimodal
    optimization problems. These algorithms can find optimal solutions regardless of the physical
    nature of the problem. In the framework of experimental studies, the analysis of the work of
    bioinspired algorithms was carried out: the algorithm of a flock of bats, the bacterial algorithm
    and the ant algorithm.

  • ALGORITHM OF EFFECTIVE CONTROLS FOR NONSTOCHASTIC CAUSAL MODELS IN THE ABSENCE OF OBSERVABLE VARIABLES FOR SYSTEMS OF DECISION MAKING CONTROL

    A.N. Tselykh, V.S. Vasilev , L.A. Tselykh
    Abstract

    The paper deals with the problem of reproducing the decision-making process by a person under
    conditions of uncertainty and incompleteness of the initial data. The decision-maker relies on his
    belief system, which includes a shared vision of the system in relation to which the decision is being
    made. The system is presented in the form of a causal model created on the basis of human mental
    representations. These models are directed graphs, on the arcs of which the causal relationship is
    expressed in the form of labels with a sign that determines the direction of change in the state of the
    system. The vertices of this directed graph are high-level abstraction concepts. This graph simulates
    the functioning of a real system. Thus, we investigate the problem of predicting and controlling human
    actions based on non-stochastic causal models in the absence of observable variables for use in
    decision support systems and expert systems. Decision-making is considered from the point of view of
    the choice of objects of application of managerial influences - the factors of the model. In this study,
    we show that the application of the proposed algorithm can facilitate decision-making regarding the
    choice of control actions that support the achievement of the tactical and strategic goals of the decision
    maker. It should be noted that the algorithm implements an automatic selection of the regularization
    parameter, which makes the development and application of the proposed algorithm available
    to users who do not have sufficient mathematical training. The convergence of the sequence of Lagrange
    multipliers of an effective control algorithm is proved. The theorem on resonance in a nonstochastic
    causal mod-el, represented by a directed graph, which is determined by the range of admissible
    values of the damping coefficient in the control model, is proved. It is expected that the introduction
    of this tool into decision support systems will in-crease the reliability of decisions regarding
    the operation of the system as a whole. The choice of control actions using the proposed algorithm
    has high efficiency and productivity. Thus, the results presented in the study can be useful for
    developing applications in intelligent systems.

  • SOLUTION OF THE MAXIMUM EVACUATION FLOW PROBLEM DASED ON HESITANT FUZZY AGGREGATIPN OPERATORS

    Е. М. Gerasimenko, E.V. Nyzhov
    Abstract

    Evacuation modeling is an urgent problem that has attracted more and more interest in recent
    years. Today, flow theory in macroscopic evacuation allows researchers to find solutions to
    optimization problems by treating aggrieved as a homogeneous mass. The main difficulty in constructing
    evacuation scenarios is the necessity to take into account the internal uncertainty of the
    network. In addition to the inherent ambiguity, the nodes of the network have limited capacities
    and can store the flow as well as direct an additional flow to a sink in a given order. Thus, an
    expert is a key figure in fuzzy modeling who must evaluate the order of intermediate nodes in order
    to obtain the flow. If the decision-maker doubts during the choice of the membership function of an
    alternative in relation to an attribute due to possible sub-attributes, he / she can set out all possible
    evaluations of the alternative. Therefore, this article discusses the problem of maximum evacuation
    with intermediate storage in nodes and compiling a priority of shelters. The hesitant fuzzy
    hybrid averaging aggregation operator is used to determine the priority of intermediate nodes.
    This evacuation scenario is the safest, since the maximum number of victims can be sent to the
    safest shelters, using the capacities of intermediate nodes, so that the amount of incoming flow at
    the intermediate node can exceed the outgoing flow. After finding the priority list of vertices, atransport network that is correspond to the residual network is constructed, and the flow is searched for, taking into account the storage of the flow in the shelters. A numerical example is
    given to illustrate the proposed algorithm

SECTION IV. DATA ANALYSIS AND INFORMATION PROCESSING

  • DESTRUCTURIZATION OF CRITICAL INFORMATION INFRASTRUCTURE FOR ASSESSING THE INFRASTRUCTURAL STABILITY OF THE SUBJECT OF CRITICAL INFORMATION INFRASTRUCTURE UNDER DESTRUCTIVE INFLUENCES

    Е. А. Maksimova, N. P. Sadovnikova
    Abstract

    With the adoption of Federal Law No. 187 "On the Security of Critical Information Infrastructure",
    the implementation of which in practice is not possible without a comprehensive assessment
    of information security (IS) of subjects of critical information infrastructure (SСII).However, the currently existing regulatory documents of regulators do not consider SСII from the
    point of view of a systematic approach, the infrastructural component of SСII is not taken into
    account when building an information protection system. At the same time, the assessment of IS
    SСII without taking into account the effect on the state and behavior of the system of inter-object
    and intersubject connections arising in the system leads to an error in the assessment, since the
    system itself, under certain conditions, can generate infrastructural destructivism. Thus, the error
    in assessing the ISSII arises due to the failure to take into account the indicator of the SСII's inability
    to implement its functionality in full under the influence of infrastructure risks, i.e. infrastructural
    destructivism. From the point of view of the theory of sustainability, this indicator can
    be correlated with the category of “infrastructure sustainability of SСII”. The proposed by the
    authors of the study, the model for assessing the infrastructure sustainability (IS) of SСII is presented
    1) using the apparatus of cognitive modeling, 2) using the apparatus of the theory of reliability
    of technical systems. Within the framework of cognitive modeling, the power of concepts is
    set by experts. In the presented study, for this assessment, it is proposed to use the apparatus of
    logical-probabilistic modeling, through a clear structuring of the system - SСII. Thus, the assessment
    of the infrastructure stability of the SCII is characterized by the possibility of assessing the
    probability of no-failure operation of the facilities of the CII and preventing failures in the functioning
    of the CII spheres, which guarantees stability and the required level of information security.
    In this case, the problem of assessing IS in this case acquires a key character in the comprehensive
    assessment of IS SСII.

  • MOBILE-CLOUD SYSTEM FOR SOLVING PHOTOGRAMMETRY TASKS IN INDUSTRY

    A.N. Samoylov, Y. M. Borodyansky
    Abstract

    With the development of the capabilities of mobile devices and the increase in the availability
    of wireless communication, the possibilities of building industrial automation systems have
    significantly expanded. The quality of digital photography obtained with a smartphone camera
    makes it possible to build mobile systems based on computer vision: for example, photogrammetry
    systems. There are several factors to consider. The first factor is that the tasks of processing digital
    photography for industrial purposes remain resource-intensive and cannot be fully implemented
    only on the basis of a mobile device. Therefore, it is required to transfer the execution environment
    for resource-intensive tasks to third-party computing power available on demand. The second
    factor is the stability and bandwidth of the communication channel - mobile devices are usually
    needed in remote locations where the deployment of desktop computers is not possible. Therefore,
    using a smartphone only as a camera is not always justified, since the transfer of an unprocessed
    image may take a long time or even be impossible. The third factor hindering the widespread
    use of mobile devices in solving photogrammetric problems is the variability and constant
    emergence of new methods of image processing and analysis. It is necessary to centrally create
    and replenish libraries of such modules. Thus, the creation of mobile photogrammetric measuringsystems requires combining the computing power of cloud services and the mobility of smartphones. The article proposes a method for constructing photogrammetric measuring systems
    based on mobile cloud computing, which provides a dynamic balance of the computational load on
    the nodes of the system, as well as the variability of functionality on mobile devices of users

  • THE ADJACENCY MATRIX RECONSTRUCTION ALGORITHM FOR CAUSAL GRAPH MODELS IN THE ABSENCE OF OBSERVABLE VARIABLES

    A. N. Tselykh , V.S. Vasilev, L. A. Tselykh
    Abstract

    The paper deals with the problem of modeling complex systems in the absence of observable
    variables. To solve this problem, it is proposed to use causal graph models. The class of causal
    models considered here is defined as non-stochastic causal models with unobservable variables.
    These models are presented in the form of a directed graph, created on the basis of human mental
    representations. In this case, on the arcs, causality is expressed in the form of some marks with a
    sign that determines the direction of change in the state of the system. The considered causal models
    include heterogeneous, complex and qualitative types of variables that illustrate the nonnumerical
    nature of nodes and links and, as a consequence, the absence and impossibility of obtaining
    time series data. In the absence of observable variables and the impossibility of conducting
    experiments, the problem of reconstructing the adjacency matrix of the causal graph model becomes
    much more complicated. It is required to obtain a model with a certain spectral decomposition
    that implements the main function of the modeled system. Based on this concept, a new method
    for reconstructing the adjacency matrix is proposed, implemented on the basis of the corresponding
    causal propagation matrix or transmission matrix. The idea is to use combinatorial optimization
    based on spectral graph theory to generate data from a qualitative non-stochastic causal
    model and reconstruct an adjacency matrix using that data. In this case, the eigenvectors are
    identified as key objectives of the matrix reconstruction process, which postulates a fundamental
    approach based on the spectral properties of the graph. The results of computational experiments
    on solving the problem of reconstructing the adjacency matrix for causal graph models in the absence
    of observable variables using the developed algorithm have shown that the algorithm effectively
    reconstructs matrices from the given parameters with admissible similarity indices. The
    convergence of the approximation to the solution of the matrix reconstruction algorithm is proved
    no slower than with the speed of a geometric progression. From a technical point of view, the
    advantage of the algorithm is the implementation of a tool for automatic adjustment of the regularization
    parameter, suitable for users without prior mathematical knowledge.

  • ANALYSIS OF CERTAIN WEIGHT FUNCTIONS (WINDOWS) AND THEIR APPROXIMATIONS FOR IMPLEMENTATION OF CONTROLLED RECURSIVE LOW-PASS FILTERS WITH A FINITE IMPULSE RESPONSE ON THEIR BASIS

    T.V. Shushkevich , А.А. Morozov, I. I. Turulin
    Abstract

    There are various types of weighting functions, the so-called windows in digital signal processing,
    such as rectangular (Dirichlet window), triangular (Bartlett window), Vallee-Poussin window,
    Kaiser-Bessel window, Barsilon-Temesh window, Hann, Bohman, Blackman, Gauss (Weierstrass),
    Dolph - Chebyshev, Hamming windows and many others and ideal characteristics of standard filters
    such as low-pass, high-pass, bandpass filters. The purpose of this review article is to determine the most
    suitable weighting function for implementation on its basis of a controlled recursive low-pass filter with
    a finite impulse response. This article presents an analysis of only some of the above windows and their
    approximations, namely the Dolph - Chebyshev window, the Gauss (Weierstrass) window and the
    Hamming window. In addition to the analysis, the synthesis of recursive filters with a finite impulse
    response for weighting data based on the selected windows and their approximations was considered.
    The method of synthesis of Dolph-Chebyshev windows is considered. The implementation of the Gauss
    (Weierstrass) window is considered. Methods for approximating the Hamming window and methods
    and several algorithms for developing filters with FIR in the form of this window are considered. The
    estimation of parameters dependencies some quick window of the maximum level of the side lobes.
    Based on the data obtained, conclusions were drawn about the selection of the most suitable and
    demonstrating maximum performance windows, suitable for implementation on its basis of a controlled
    recursive low-pass filter with a finite impulse response.

  • JUSTIFICATION OF THE APPEARANCE OF A PROMISING AUTOMATED SYSTEM FOR RECORDING PERSONNEL OF THE ARMED FORCES OF THE RUSSIAN FEDERATION

    S. A. Botsvin , V.A. Khvatkov
    Abstract

    Accounting of personnel of the Armed Forces of the Russian Federation (AFRF) is carried
    out using several highly specialized automated systems, which does not allow solving tasks in a
    single information space. The study identified problematic issues that arise when solving the tasks
    of accounting personnel of the AFRF, such as low efficiency, the use of various media, low reliability
    of information due to the lack of synchronization mechanisms between systems, etc.
    The main subsystems are identified and a list of elements is defined for building the functional
    structure of a promising automated system that will provide operational access to information for
    an unlimited number of officials and automatically solve the tasks of collecting, summarizing and
    presenting quantitative (statistical) data. Based on the analysis of the topological structure of the
    personnel bodies of the AFRF, it is proposed to use a hierarchical (tree-like) structure to build a
    promising automated system and transfer information between databases of different levels to
    reduce information redundancy and load on server equipment. The priority option for organizing
    data storage is distributed storage, which was chosen based on the requirements for the stability
    and reliability of the operation of a promising automated system, especially in wartime. At the
    same time, the use of replication mechanisms will allow for instant synchronization of information
    at all levels. The calculation of the required resources for storing and processing information at
    various levels, depending on the number of military personnel at each level, the frequency of occurrence
    of personnel events and the amount of memory required for storing personal information.
    On the basis of which the technical characteristics of the elements of a promising system, necessary
    and sufficient for high-quality functioning, are determined, and the requirements for the technical
    characteristics of server equipment and data storage systems are obtained. The conducted
    research made it possible to construct a scheme for the perspective appearance of an automated
    personnel accounting system and to justify the relevance of solving the problem of forming and
    developing a new automated system. In addition, the results of the work made it possible to determine
    the principles laid down in the prospective system, such as the construction of a hierarchical
    distributed database, the creation of mechanisms for synchronizing information between system
    elements, the possibility of using existing technical means and the organization of information
    interaction with other automated systems

  • TRANSFORMATION AND ANALYSIS OF INFORMATION WHEN CREATING A DATABASE OF PARTICIPANTS OF THE GREAT PATRIOTIC WAR 1941-1945 IN THE MEMORIAL COMPLEX «ROAD OF MEMORY» IN THE MAIN RUSSIAN ARMED FORCES CATHEDRAL ON THE BASIS OF COMPUTER METHODS OF INFORMATION PR

    S. A. Botsvin , V.A. Khvatkov
    Abstract

    Preserving the historical memory of the participants of the Great Patriotic War
    1941–1945 is a world-class task that should preserve the truth about the most terrible war and the
    feat of our people. In modern conditions, attracting interest in history, traditions and finally
    recognition of one's duty to the past generations requires modern methods. One of these methods
    is the transformation of information, which allows you to present this information in such a way
    that it can be used most effectively. At the same time, the main goal in the transformation of historical
    data is to optimize their representations and formats and not change the information content.
    The presented algorithms of transformation and analysis of information when creating a database
    of participants of the Great Patriotic War were aimed at maximizing the preservation of historical
    value and reliability of information. To achieve this goal, computer methods of information processing
    for normalization and consolidation of personal data obtained from various sources are
    considered. The analysis of the content of information in archival documents with the presentation
    of statistical data on the number of documents (records) from various sources (archives, databases,
    information resources, etc.) is carried out and the procedure for translating information
    from archival documents into electronic form, which has been applied in practice, is described.
    Based on the analysis of the information, diagrams of the content of personal information in archival
    sources are constructed, the stages of systematization and bringing the generalized information
    array records to a single format are presented, as well as the procedure for combining and
    deleting duplicate records. For the possibility of using in other projects, an algorithm for consolidating
    data obtained from various sources is described in detail, and its block diagram is constructed.
    In addition, the applied fuzzy search algorithms are described, which made it possible to
    minimize errors in records, as well as image comparison algorithms for searching for duplicates
    from photographs. All of these algorithms have made it possible to bring together information
    contained on various media, having different structures and geographical location. The created
    information resource allows you to enormously reduce the resources needed to find the necessary
    information, including access to which was limited or not at all. Further improvement of algorithms
    for normalization and consolidation of information can serve as a basis for data migration
    from outdated to promising systems, as well as for the formation of information resources from
    existing heterogeneous archival funds.

SECTION V. DESIGN AUTOMATION AND NETWORK TECHNOLOGIES

  • APPLICATION OF THE HAMMING CODE IN THE PROBLEM OF INCREASING FAULT TOLERANCE OF LOGIC CIRCUITS

    D.V. Telpukhov , T.D. Zhukova, A.N. Schelokov, P.D. Kretinina
    Abstract

    Currently, when designing integrated circuits, developers have to take into account a very
    large number of dissimilar factors that are associated with ensuring the necessary performance
    characteristics, occupied area, energy efficiency, yield, convenience of subsequent testing, requirements
    for universality, autonomy, and so on. One of the main factors is the reliability of operation.
    This criterion comes to the fore for critical applications, as well as for devices operating
    under the influence of destabilizing factors. To provide increased reliability, different methods and
    approaches are used at different levels of abstraction. Some of them can be applied at the design
    stage. One of the main methods for improving the reliability of integrated circuits at the design
    stage is the use of tools from the theory of error-correcting coding.The traditional field of application
    of error-correcting codes is the control of the integrity of stored and transmitted information.
    Combinational logic circuits, on the other hand, change information and do not have storage elements.
    Combinational logic circuits implement look-up tables at the gate level, which unambiguously
    assign a certain output value to each input action. Nevertheless, the use of error-correcting
    codes for constructing error-tolerant combinational circuits turns out to be very effective. This
    requires the introduction of additional combinational blocks into the circuit, which provide coding,
    decoding, control, and in some cases correction of errors arising in the circuit. The paper
    investigates the efficiency of using Hamming codes in relation to the construction of fault-tolerant
    combinational circuits. The paper considered classical Hamming code and his main modification -
    weighted code with summation without carries for the implementation of fault-tolerant combinational
    circuits. Means have been developed for the automated synthesis of fault-tolerant circuits
    based on these codes. Structural redundancy and reliability characteristics of the resulting circuits
    are investigated. Comparison with traditional method triple modular redundancy is carried out.
    Estimating functions are derived for redundancy and the probability of missing an error.

  • HYBRID METHOD FOR SOLVING THE PROBLEM OF PLACEMENT OF DIGITAL COMPUTER DEVICES

    L. A. Gladkov , N. V. Gladkova , M.J. Yasir
    Abstract

    The problem of placing elements of digital computing technology is considered in the article.
    The analysis of the current state of research on this topic is carried out, the relevance of the
    problem under consideration is noted. The importance of developing new effective methods for
    solving such problems are highlighted. The place of the placement problem in the general cycle ofthe design stage is shown. The importance of a high-quality solution to the placement problem
    from the point of view of the successful implementation of subsequent design stages is noted. The
    importance of minimizing connection delays in the design process of large-scale devices is noted.
    A review and analysis of various models and criteria for evaluating the solution to the placement
    problem is carried out. It was emphasized that the most important criterion is the length of the
    joints, it has a significant impact on the technologies used in the design. A complex mathematical
    formulation of the problem of placing elements of digital computing equipment has been completed.
    Perspective approaches to solving design problems are analyzed, hybrid methods and models
    for solving complex multicriteria optimization and design problems are described. The principles
    of operation and the model of a fuzzy logic controller are described. The description of the used
    fuzzy control scheme is given. The functions of various blocks of a fuzzy logic controller are determined.
    The structure of a multilayer neural network that implements the Gaussian function is
    proposed. The interaction of blocks of a fuzzy genetic algorithm is described. A model of a hybrid
    algorithm for solving the placement problem is proposed. The control parameters of the fuzzy
    logic controller are determined. The proposed hybrid algorithm is implemented as an application
    program. A series of computational experiments to determine the effectiveness of the developed
    algorithm and select the optimal values of the control parameters were carried out.

  • CONSTRUCTION CONCEPT AND ARCHITECTURE CRITICAL INFORMATION SEGMENTS OF THE REGIONAL INFOCOMMUNICATION NETWORK

    I.V. Rodygina, I. I. Buzenkov, Y.V. Kakhanets
    Abstract

    Today, in absolute terms, not a single branch of the state can do without modern high-tech
    communications that connect computing systems and remote databases. The use of new information
    and communication technologies as a means of resolving contradictions, as well as a
    means of implicit influence, is becoming a growing threat to the security of the community on the
    world stage. The presented work examines not only the stages of development, but also the main
    trends, approaches to the construction of digital information systems, as well as the characteristic
    threats to information security for them. The article also shows the actual place of critical information
    segments in the general context of the communication system of the Russian Federation.
    The first part of the work reveals the concept of a three-component construction of regional critical
    information segments. The main part focuses on the difference in technologies used to build
    critical information segments. The main part of the article is aimed at identifying the vulnerabilities
    of complex information structures and systems that use the architecture of multiservice communication
    systems. The analysis carried out by the authors allows us to classify the main threats
    to information security both for communication systems built according to classical circuit switching
    schemes, and for communication systems based on new technological principles, basically -
    packet switching. In general, the authors tell us that the idea of a standard and clearly defined
    traffic structure and user interaction procedures, regardless of their type, geographic distance or
    area of its application, together with digital transmission and switching methods, has a revolutionary
    role in the development of communication systems. Special attention should be paid to the
    classification of protocols presented by the authors, which allows to identify the weakest points in
    modern information systems, which should be paid attention to first of all: protocols that ensure
    the functioning of wireless networks, mail protocols, file exchange protocols, and others

  • COMPARATIVE ANALYSIS OF TECHNOLOGIES FOR DEVELOPING THE SERVER SIDE OF THE SALES MANAGEMENT SYSTEM

    I. V. Rodygina , A.V. Nalivayko
    Abstract

    This article focuses on a topic when developing web applications: the choice of technology
    for writing the server side of the application. The question of the correct language and framework
    for the implementation of the server side of the application is always relevant, since its quality of
    work depends on this: whether the server will process a large number of requests, how quickly the
    data will be processed and issued to the user - which is especially important for a sales management
    system, since it assumes work with a large amount of data. Most modern web applications
    are written using PHP, NodeJS. The method of development with PHP allows us to write blocking
    and non-blocking code, which in any implementation, with a large number of requests, will significantly
    load the system. NodeJS allows to implement asynchronous non-blocking code, but the lack
    of typing can reduce the work on the project when it scales with quality. Java and its frameworks
    and libraries will allow completing this task. The article describes the principle of interaction
    between the client and server parts of a web application. Based on the selected criteria, a compared
    were the technologies such as Java, PHP, NodeJS, and also the principle of operation of a
    serverless architecture using the Google Firebase service was considered, frameworks and libraries
    for creating the server side of an application were considered. Also, an important stage in the
    comparison will be the execution of tests that will show what loads the frameworks can withstand,
    how many requests can be processed, the delay between them. The optimal technology will be
    selected, which will be used to develop the server side for sales management