O b j e c t i v e s . The problem of synthesis of combinational circuits in the basis of two-input gates is considered. Those gates are AND, OR, NAND and NOR. The objective of the paper is to investigate the possibilities of application of bi-decomposition of Boolean functions to the synthesis of combinational circuits.

M e t h o d s . The method for bi-decomposition is reduced to the search in a graph for a weighted two-block cover with complete bipartite subgraphs (bi-cliques).

R e s u l t s . The initial Boolean function is given as two ternary matrices, one of which represents the domain of Boolean space where the function has the value 1, and the other is the domain of Boolean space where the function has the value 0. The orthogonality graph of rows of ternary matrices representing the given function is considered.  The method for two-bi-clique covering the orthogonality graph of rows of ternary matrices is described. Every bi-clique in the obtained cover is assigned in a certain way with а set of variables that are the arguments of the function. This set is the weight of the bi-clique. Each of those bi-cliques defines a Boolean function whose arguments are the variables assigned to it. The functions obtained in such a way constitute the required decomposition.

Co n c l u s i o n .  The  process  of  synthesis  of  a  combinational  circuit  consists  of  a  successive  application  of bi-decomposition to obtained functions. The suggested method allows obtaining the circuits with short delay.

O b j e c t i v e s .  Early detection of network intelligence allows to reduce the risks of information security of organizations. The study was carried out to develop software module for detecting the features of network intelligence by machine learning methods.

M e t h o d s . Analysis of open datasets of appropriate destination; formation of metrics characteristic of network intelligence; development of a dataset based on certain metrics; study of the effectiveness of machine learning methods for classification task.

R e s u l t s .  The  topology was  designed and  a  test  segment  was  created  in  the  corporate  network of RUE "Beltelecom" to create a dataset. A monitoring tool has been developed for detecting and analyzing the events, the results of which were used as the basis for a new dataset.

The implementation of the decision tree method in the form of program code allowed to increase the speed of the module by about 2 times (0,147 ms). Practical tests of the developed module have shown the alarm on all types of network scanning using Nmap and Masscan utilities.

Co n c l u s i o n. The analysis of the dataset by principal component method showed the presence of a border area between  the  events  of  legal  traffic  and  network  intelligence  traffic,  which  had  a  positive  effect  on  the training of the model. The most promising machine learning methods have been studied and tested using various hyperparameters. The best results were shown by the decision tree method with the parameters criterion = gini and splitter = random and speed as 0,333 ms.

O b j e c t i v e s. The problem of constructing a new class of physically uncloneable functions (PUF) based on controlling the signal propagation delay through the elements lying on the path of its propagation is being solved. The relevance of this problem is associated with the active development of physical cryptography. For its implementation, the following goals are pursued: the construction of the basic elements of the PUF and their modifications, the development of a methodology for constructing controlled ring oscillators based on XOR elements and controlled ring oscillators based on multi-input signal switching.

M e t h o d s.  Methods  of  synthesis  and  analysis  of  digital  devices  were  used,  including  those  based  on programmable logic integrated circuits (FPGA), the basics of Boolean algebra and circuitry.

R e s u l t s. It is shown that combined PUFs based on RS-flip-flops implement the idea of controlling the signal delay by choosing a path, which is a series-connected elements selected in accordance with the PUF request. A technique for constructing an PUF with a  controlled delay through each element of the path has been developed as a development of the idea of controlling the signal delay along the path. The features and properties of PUF with controlled delay of signals of the ring oscillator type are investigated and possible solutions are shown for the case of two-bit input requests. A basic element and its modifications are proposed for constructing new PUF structures based on the control of the signal propagation delay. It is shown that the signal delay through the basic element, which is a multi-input XOR element, depends not only on the number of inputs to which the active input signal is applied, but also on fixed values of 0 or 1 at its other inputs. A new PUF structure is presented, namely, a controlled ring oscillator, its implementation is considered for the case of control by setting the inputs and their number, by which the active input signal changes.

Co n c l u s i o n. The proposed new approach to the construction of physically uncloneable functions, based on the control of signal delay through logical elements, has shown its efficiency and promise. The effect of the influence on the delays of signal propagation through the logic element, both the number of its inputs, along which the input signals change, leading to a change in the output signal, and their composition, is experimentally confirmed. It seems promising to further developing the ideas of constructing controlled ring oscillators and oscillators  with  multi-input  switching of  input  signal,  as  well  as  the  creation  of  new PUF  structures of arbiter type.

O b j e c t i v e s . In radar systems for moving objects tracking, there are often gaps in the measurement of coordinates.

The problem is mostly fully solved in continuous time in the theory of systems with a random structure within the  framework of  statistical  Bayesian theory of  filtration  in  the  presence  of  complete  a  priori  statistical information. This approach leads to complex algorithms that are difficult to implement in practice. The purpose of investigation was to develop a filtering algorithm in conditions of information interruptions based on the use of extended least squares method.

M e t h o d s . Methods of estimation theory are used, in particular, the extended least squares method, which makes it possible to find relatively simple algorithms with a  minimum amount of a  priori knowledge about the characteristics of the impacts.

R e s u l t s . The algorithm for filtering radar signals has been developed, based on measurements of the moments of  breaks  and  extrapolation  of  the  measured  coordinates  at  intervals  of  information  lack.  The  resulting algorithm is nonlinear and therefore tracking disruptions may occur in the filter. The results of the algorithm are demonstrated using a model example. The estimation of the filtering accuracy and tracking failure conditions is carried out.

Co n c l u s i o n . A filtering algorithm has been developed that allows determining the moments of the onset of breaks and extrapolating the estimates of useful information. The comparative simplicity of the algorithm makes it suitable for practical use.

O b j e c t i v e s . The amount of data generated by modern methods of high-throughput sequencing is such that their analysis is performed mainly in automatic mode. In particular, the use of newly decoded genomic sequences is possible only after the annotation of functional elements of the genome, which, as a rule, is performed by automatic pipelines. Such annotation pipelines do a good job to identify the genes, but none of them annotate regulatory elements. Without these elements it is not possible to understand when and how genes can be expressed. Information on the regulatory elements of bacteria is collected in several specialized databases (RegulonDB, CollecTF, Prodoric2, etc.), however, only a part of this information can be used for annotation of regulatory elements, and only for a very limited range of bacteria. Previously, we proposed a clear formal criterion for applying regulatory information to any bacterial genome. Such a criterion is the CR tag, a sequence of amino acid residues of a transcriptional regulator that specifically contacts the nitrogenous bases of regulatory element in genomic DNA. The mathematical model of a regulatory element (motif) associated with a CR tag can be correctly applied to annotate similar elements in any genomes encoding a transcriptional regulator with an identical CR tag. The accumulation of motifs associated with CR tags raised the question of their ordered storage for the convenience of subsequent use in the annotation of genomic sequences. Since no one of well-known databases uses the concept of CR tags, a new database ought to be developed. Thus, the goal of this work is to create a database with information about bacterial transcription factors and DNA sequences recognized by them, suitable for annotation of regulatory sequences in bacterial genomes.

M e t h o d s .  Infological  modeling  of  the  subject  area  was  carried  out  using  the  IDEF1X  methodology. The database was developed using the Microsoft SQL Server DBMS. A cross-platform application for importing data into a database is written in C++ using Qt technology.

Re s u l t s . As a result of the study of the subject area, a relational data model was developed and implemented in the Microsoft SQL Server DBMS, which allows holistic storage of information about accumulated transcription regulation motifs in bacteria, including information about the publications confirming their correctness. To automate the process of entering accumulated data, a cross-platform application was developed for importing structured data on transcription factors.

Co n c l u s i o n .  The  main difference of  the  developed database is  the  use  of  CR-tag  concept. Records of mathematical models of regulatory elements (motifs) in the database are associated with a CR tag and, therefore, can be correctly used to annotate similar elements in any genomes encoding a transcriptional regulator with an identical CR tag. The developed database will provide structured and holistic data storage, as well as their quick search when used in the pipeline for automatic annotation of regulatory elements in bacterial genomic sequences.

O b j e c t i v e s. The problem of efficient organization of the execution of sequential computational processes in the vector mode is solved, taking into account the capabilities of modern high-performance vector-pipeline computers. The relevance of the problem under consideration is due to the fact that processes that occur during cyclic data processing and in iterative algorithms are the most difficult to parallelize. In solving the problem, three main objectives were set. Construction of a mathematical model that takes into account the main architectural and computational features of modern vector-conveyor computers. Calculation of the optimal total execution time of vector operations. Evaluation of the time gain compared to the sequential mode of data processing.

M e t h o d s. To achieve the objectives and to prove the main and auxiliary statements, an original method was used, including establishing the validity of the inductive assumptions in the cases under consideration, as well as an illustrative method of scheduling theory using Gantt charts.

R e s u l t s .   A vector model for the implementation of sequential calculations is proposed, which takes into account  the  main  features  of  vector-conveyor computers. The  optimal  total  execution  time  of  sequential calculations in the vector mode is determined, and a lower estimate of the time gain is obtained in comparison with the sequential mode of their execution.

C o n c l u s i o n. It has been established that when processing scalar input data in the sequential mode by vector operations with a pipeline length k, acceleration is possible by at least a factor nN (nk+N) , where N is the size of the  input,  n  is  the  number of vector and  corresponding scalar operations. The estimation of the  time acceleration in the vectorization of calculations is compared with the sequential mode of their execution.

Software development methodology based on the model of distributed object-based stochastic hybrid systems is proposed. Such mathematical model is planned to be created for the system being designed along with the system specification at all stages of the software development.

The following stages of the development are considered as building of preliminary mathematical model by designing its specification, choosing and specification of system metrics, statistical analysis of the model, approbation of the mathematical model in conditions close to real, analysis by analytical methods and the implementation. The formalism is proposed for describing the system under consideration and an approach to its analysis. At the steps of the methodology, we adjust the model specification and its corresponding mathematical model in accordance with the results of the analysis. This approach allows to develop not only the software, but also a mathematical model with its properties, which implementation is the resulting software.

The problem of building a computer model of a small language was under solution. The relevance of this task is due to the following considerations: the need to eliminate the information inequality between speakers of different languages; the need for new tools for the study of poorly understood languages, as well as innovative approaches to language modeling in the low-resource context; the problem of supporting and developing small languages.

There are three main objectives in solving the problem of small natural language processing at the stage of describing the problem situation: to justify the problem of modeling language in the context of resource scarcity as a special task in the field of natural languages processing, to review the literature on the relevant topic, to develop the concept of language acquisition model with a relatively small number of available resources. Computer modeling techniques using neural networks, semi-supervised learning and reinforcement learning were involved.

The paper provides a review of the literature on modeling the learning of vocabulary, morphology, and grammar of a child's native language. Based on the current understanding of the language acquisition and existing computer models of this process, the architecture of the system of small language processing, which is taught through modeling of ontogenesis, is proposed. The main components of the system and the principles of their interaction are highlighted. The system is based on a module built on the basis of modern dialogical language models and taught in some rich-resources language (e.g., English). During training, an intermediate layer is used which represents statements in some abstract form, for example, in the symbols of formal semantics. The relationship between the formal recording of utterances and their translation into the target low-resource language is learned by modeling the child's acquisition of vocabulary and grammar of the language. One of components stands for the non-linguistic context in which language learning takes place.

This article explores the problem of modeling small languages. A detailed substantiation of the relevance of modeling small languages is given: the social significance of the problem is noted, the benefits for linguistics, ethnography, ethnology and cultural anthropology are shown. The ineffectiveness of approaches applied to large languages in conditions of a lack of resources is noted. A model of language learning by means of ontogenesis simulation is proposed, which is based both on the results obtained in the field of computer modeling and on the data of psycholinguistics.