This article discusses the problem of data synchronization methods using microservice architecture. Microservices is a popular and widespread software architecture today. The article investigates three main ways of interaction of microservices. They are event-based communication, interaction through direct HTTP requests and messaging, and also highlights and analyzes their advantages and disadvantages. The main purpose of the article is to analyze and make offer of the optimal option for solving the problem of synchronizing interacting microservices in real time. The optimal solution involves using the Apache Kafka message broker. It publishes data streams and subscriptions to them, as well as stores and processes them. Mathematical modeling of the proposed data synchronization method was described by constructing its state macine, as well as a system of canonical equations.

The article is devoted to the development of software for building a behavioral assessment of a person based on the analysis of tones of texts from social networks. This software is aimed at collecting, storing and processing data of users of the social network “VKontakte”. The paper deals with natural language processing using deep machine learning techniques. In the paper, we need to analyze the tone of the text. One of our goals is to solve the problem of analyzing posts in social networks. The intonation analysis of the text allows us to understand what intonation coloring a particular post in social networks has - positive or negative. Based on the results of the work, we have proposed a working prototype of a web application for building a behavioral assessment of a person based on the analysis of tones of texts from social networks. The results of the research will be useful to organizations when hiring employees, when it is possible to get data on a particular person from a social network and preview them. Based on the conducted research with trained models, the most accurately trained model with the highest accuracy equal to 75.10

Currently, many different algorithms have been developed that implement the classification problem. Of particular interest is the use of automatic classification algorithms in radar systems. In each such system, one has to solve the classification and recognition problem for detected targets. The work of an operator analyzing the information can take place in conditions that hinder assess of the control object’s state. This is due to the absence or insufficient amount of reliable information about some radar target properties. A radar target is understood as any material object that can be detected, and its location and movement parameters can be measured using radar methods. We consider air, ground and surface objects as a radar object. Object classification algorithms are used in various fields when analyzing the properties of an object. This paper discusses the main methods for the classification of radar objects.

В данной статье рассматривается проблема развития микроэлектроники из-за физического и экономического предела по закону Мура.В качестве решения данной проблемы приводятся алгоритмы на базе алгебры гиперразмерных векторов, так как алгоритмы на базе алгебры гиперразмерных векторов устойчивы к появлению в разрядах регистров мусорных значений, которые критичны при вычислениях классическими алгоритмами.Использование алгоритмов на базе гиперразмерных векторов позволяет увеличить частоты вычислительного устройства, не изменяя токопотребления, и способно давать верный результат несмотря на появление мусорных значений в регистрах вычислительного устройства.В статье поднимается вопрос малой изученности методов кодирования сложных систем в формате автоматов на базе алгебры гиперразмерных векторов.В данной работе представлена инструментальная программная система поддержки методологии проектирования сложных систем на основе автоматных моделей с использованием алгебры гиперразмерных векторов.Предложены методы формализованного описания систем в виде систем канонических уравнений для кодирования в гиперразмерный вектор и описание алгоритмов трансформации формализованного описания с

The paper deals with researching and developing the methods that make it possible to account behaviour examples when synthesizing automaton models by temporal formulas. Definitions of the terms and concepts used in work are given; the problem of synthesizing automaton systems according to the specification in the form of temporal formulas and behaviour examples is formulated; a promising algorithm for reducing the problem of synthesizing automaton systems to the Boolean formula satisfiability problem is described; an analysis of the domain and other approaches is carried out. New methods of taking into account behaviour examples in the synthesis of automaton systems according to a specification given in the form of temporal formulas are proposed. Algorithms for constructing graphs of scripts and methods for dividing graphs into clusters are described; they are designed to increase the efficiency of representing behaviour examples used for coding the behaviour examples in the form of Boolean formulas. An experimental study of the proposed methods of accounting for behaviour examples and basic approaches to the presentation of behaviour examples is carried out. The experimental results showed the superiority of the newly developed methods regarding the presentation of scripts in the form of temporal formulas. In summary, the main conclusions of the work carried out are presented.

This paper presents the developed algorithms for a tool environment for the design of complex information systems based on automata models using the algebra of high-dimensional vectors. The paper raises the problem of the little knowledge of methods of coding complex systems in the format of automata based on the algebra of hyperdimensional vectors. Methods of formalized description of systems in the form of hyperdimensional vectors and description of algorithms for transformation of formalized description using the algebra of hyperdimensional vectors are introduced. The features, advantages and disadvantages of modeling automata models using hyperdimensional vectors are listed.

This aim of the article is to discusses the main static and dynamic user identification methods by keystroke dynamics. As part of the research, a generalized way of representing the process of typing on the keyboard based on the sequential change of the keyboard state was proposed. The definition of the keyboard state context, which is the basis for the dynamic identification procedure, is formulated. The proposed approach will make it possible to apply a variety of static identification methods, significantly expanding the set of methods used for dynamic user identification by keystroke dynamics.

Аннотация.В статье приведено описание теоретических аспектов верификации блочно-синхронных параллельных программ для вычислительных систем, построенных с использованием технологии BigData.Мы являемся свидетелями того, как стремительно растет интерес к проблеме верификации программного обеспечения.Сейчас разработчикам программного обеспечения доступен широкий спектр методов доказательства программных свойств на популярных языках программирования, и средств, позволяющих автоматизировать проверку корректности приведенных доказательств.Процесс верификации программ является сложным и дорогим с финансовой точки зрения.Несмотря на это, есть ряд преимуществ, которые делают верификацию незаменимой в некоторых случаях, даже в сравнении с традиционным тестированием.В постановочной части исследования определен объект исследования -семантика языков программирования и инструментария для создания блочно-синхронных параллельных программ, а также поставлена цель исследования -описание абстрактного вычислителя, выполняющего программы на специальном языке, являющимся подмножеством языка С, который можно использовать для верификации программ.В ходе проведенных по тематике статьи исследований получены важные результаты, среди которых аналитический обзор по проблеме актуальности верификации параллельных программ.Обоснован выбор модели построения

This article is devoted to a method for converting a temporary machine into a script for load testing of a messaging service. The concept of operation of temporary finite state machines, unconditional and conditional transitions with a time delay in them is considered. The existing solutions of the program for load testing were analyzed, their advantages and disadvantages were identified. A method of developing a script for a load testing tool "Gatling" using temporary state machines specified by the user is presented. A method for organizing an unconditional and conditional transition with a time delay is proposed to emulate the work of real users with the system, for load testing. The solution is the ability to synthesize a finite state machine that will be transformed into a script in the "Scala" language.

Managing the systems which behaviour is non-deterministic is one of the most important problems in modern management theory. Today, systems with structural and behavioural complexity are prevalent in all areas of human activity, and therefore, their research is of the utmost importance. Such systems, as opposed to deterministic systems, are called non-deterministic. They are characterised by difficult predictable behaviour determined both by external random influences, and within the systems themselves. A clear example of a non-deterministic system is crowds of people, factories, and computer networks and systems. The problem of non-deterministic behaviour directly within the context of professional activities can be seen using an example of building syntactic analysers. The aim of the paper is to design a class of systems oriented towards supporting elements of a discrete event model. The target of research is to simulate discrete event models. The subject of research is a creation of a discrete event model based on the behaviour of an undetermined finite state automaton. During the preparation of the paper, there was developed and practically implemented an algorithm for the application, which materializes the principle of working with threads. The results obtained in the paper are aimed at solving the problem of parallel data processing based on the parallelism of NFA's (non-deterministic finite automaton) behaviour when reading the input string characters. As a result, this should have a positive impact on the regulation of the simulation processes of a non-deterministic system, increasing its efficiency and stability. In conclusion, the algorithm of the application work is disclosed and conclusions about the effectiveness and efficiency of its development are drawn.

Today, in the digital age, the problem of pattern recognition is very relevant. In particular, the task of text recognition is important in banking, for the automatic reading of documents and their control; in video control systems, for example, to identify the license plate of a car that violated traffic rules; in security systems, for example, to check banknotes at an ATM and in many other areas. A large number of methods are known for solving the problem of pattern recognition, but the main advantage of neural networks over other methods is their learning ability. It is this feature that makes neural networks attractive to study. The article proposes a basic neural network model. The main algorithms are considered and a programming model is implemented in the Python programming language. In the course of research, the following shortcomings of the basic model were revealed: low learning rate (the number of correctly recognized digits in the first epochs of learning); retraining the network has not learned to generalize the knowledge gained; low probability of recognition 95.13%.To solve the above disadvantages, various techniques were used that increase the accuracy and speed of work, as well as reduce the effect of network retraining.

The principles of building finite state automata taking into account temporal logic were considered. In this case, time delays of the input symbol are added to the elements of the finite state automaton, which allow the automaton to change its state without producing an output symbol, as well as delays of the output symbol that determine the necessary time interval for the corresponding transition. The main approaches to the definition of the concept of a process, such as “process is a state” and “process is a transition”, which are characterized by the principles of signal processing, taking into account the possibility of saving the state and forming a queue for signal processing, are distinguished. The scientific novelty of this article lies in the approach to the formation of a hierarchical cyber system and the use of temporary SNDA. This method allows to synchronize processes in multithreaded data processing in complex organized, multilevel systems and excludes the possibility of unstable operation, and also improves the performance of the entire complex. As a visual representation of the model of the created principle of temporal non-deterministic automata, a system of grinding and transferring grain in a mill was used.

The paper deals with the issues of decomposition of control algorithms for the processes in parallel computing systems and the use of automaton models. When designing parallel processing systems, an important task is the formal presentation of process control algorithms since they allow achieving a packaged solution to the problems of specification, development, implementation, verification, and analysis of complex control systems, including the control of interacting processes and resources in parallel computing systems. It is especially necessary to use formal methods to verify complex information processing systems by model testing. One of the methods for the formal description of control algorithms is based on the use for these purposes of the nondeterministic automaton (NDA) logic, which is a method that allows one to present control algorithms for information processing in the form of systems of canonical equations describing all particular events implemented in the algorithm. The advantage of such a language is that all transitions in the control system are described not in terms of system states, but in terms of particular events, the simultaneous existence of which determines all states and transitions in the system; this allows avoiding a "combinatorial explosion" in the state space to the possibilities of means verification. Purpose of the paper: research of control algorithms for parallel computing systems using the NDA apparatus. The development and research object is parallel decomposition of control algorithms for parallel computing systems using automatic models.

This article discusses one of the main problems of user identification by keyboard handwriting - short-term changes in the keystroke dynamics of users in connection with its psychophysical state, as well as changes over a long time associated with the formation of keystroke dynamics by a new user or when switching to a new device. A method for determining the phase of working capacity by the time characteristics of the keystroke dynamics is proposed.

The article considers a dialog service which performs a bot assistant functions for recording metrological measurements results. The project conducted research of one of the modern approach to developing chatbot — rule-based chatbot. The main approach’s features were considered and compared with analogous bot assistant in that article. The aim of the research is development of the dialog service model to ease and accelerate metrological measurements. As a result, the article proposed recommendations for developing a dialog system which performs a bot assistant with functions of performing and recording metrological measurements results typed by the user to the chat or using a voice assistant.

Today, in the digital age, the problem of pattern recognition is very relevant. In particular, the task of text recognition is important in banking, for the automatic reading of documents and their control; in video control systems, for example, to identify the license plate of a car that violated traffic rules; in security systems, for example, to check banknotes at an ATM and in many other areas. A large number of methods are known for solving the problem of pattern recognition, but the main advantage of neural networks over other methods is their learning ability. It is this feature that makes neural networks attractive to study. The article proposes a basic neural network model. The main algorithms are considered and a programming model is implemented in the Python programming language. In the course of research, the following shortcomings of the basic model were revealed: low learning rate (the number of correctly recognized digits in the first epochs of learning); retraining - the network has not learned to generalize the knowledge gained; low probability of recognition - 95.13%. To solve the above disadvantages, various techniques were used that increase the accuracy and speed of work, as well as reduce the effect of network retraining.

Аннотация.Работа посвящена исследованию и анализу возможных подходов к организации параллельных вычислений в распределенных вычислительных системах.В ходе работы над статьей проанализированы основные подходы к организации параллельных вычислений на распределенных системах.Рассмотрены современные методы организации таких систем, их положительные и отрицательные стороны, а также теоретическая и реальная производительность.Проведены оценки метрик эффективности распределенных и параллельных систем, на примере закона Амадала.Приведено описание архитектуры вычислительного кластера, основанне на инфраструктуре облачного сервиса.Поведен ряд экспериментов, оценивающих эффективность построенной системы.Проведен ряд тестов, оценивающих производительность кластера для алгоритмов wordcount и sort.Анализ полученных результатов показал, что spark может эффективно использовать распределенные

This article describes the formalization of the signal protocol for the organization of audio and video calls via the Internet using the automata theory; the elements of the theory demonstrate the work of this protocol more clearly. Now, the Internet is an integral part of everyday life and messaging apps allow making audio and video calls. The signal protocol is the most important part in organization of such interaction and allows making a connection between users. Therefore, its formalization is actual for nowadays. The interpretation of this protocol on the non-deterministic event-driven automata allows to show its organization, all factors and problems which could be faced by developer more clearly.

This article examines the issue of poorly studied methods of temporal analysis of cyberphysical systems, as well as simulations of concurrent computing cyberphysical systems with a time component. The article describes the currently relevant methods and means of temporal analysis of computing cyber systems, their advantages and disadvantages[1]. Often, in the process of developing a real mechanical cyber system, it is necessary to simulate it and simulate its work under certain conditions, in order to identify possible difficulties in the functioning of the mechanism, and to adjust them subsequently. Actual methods of temporal analysis of cyber systems do not fully solve the posed problem or do not solve it at all. In order to solve the above-mentioned problem, a new method of temporal analysis was proposed that solves problems that other methods described in this article do not solve[2]. One of the advantages of the method proposed in this article is the modeling of non-deterministic time machines, so that this approach can be widely used in modeling cyber systems and simulating their work under a variety of conditions. As a test of the scientific solution of the problem described in this article, a software tool for temporal analysis and simulation of models of computing cyberphysical systems was developed and debugged. The main feature of the environment is the coding and building computing cyberphysical systems in the graph format of an abstract temporary finite deterministic or non-deterministic automaton using a system of canonical equations given in disjunctive normal form. The basic method of parsing the system of canonical equations for building a model of the target computing cyberphysical system in the graph format of an abstract automaton as well as simulation algorithms for the entire model in the mode of a deterministic and non-deterministic automaton are described. The user interface elements for managing the modeling environment, its main features and methods of temporal analysis of specified concurrent computing systems are described.