The head of the border control unit faces the need to make the decision on the protection of the state border at the border crossing point every day. Decision-making on the protection of the state border is a complex multifactorial process with the variability of possible final values. The article discusses the possibility of using the hierarchy analysis method for the decision-making process by the head of the border control unit. In order to make an optimal decision, using the method of analyzing hierarchies, it is necessary to decompose the known factors into indicators that directly affect the protection of the state border and the situation at the border crossing point. Decomposition of factors into indicators was carried out by the method of expert assessment, the disadvantage of which is the possible subjectivity of expert judgments. To obtain a sufficient number of qualitative judgments when choosing indicators of factors that directly affect the protection of the state border, the authors propose a method for determining the required number of experts when conducting expert assessments. Based on the results obtained, the allowable size of the expert group was 18 specialists involved in assessing the research problem. The research indicates that the involvement of experts in excess of the specified number leads to the presentation by them of insignificant for decision-making or repeated judgments. In order to achieve the best results, substantiate the proposal of all possible optimal indicators of factors that directly affect the protection of the state border, a categorical selection of experts in the direction of protecting the state border at the border crossing point has been established.

In this work, simplified expressions have been obtained that describe the kinematics parameters of the aircraft movement and its accelerations. These expressions are needed to obtain an optimal linear control law in order to provide movement of the aircraft using the hyperbola guidance method with a time difference of arrival navigation system. The key feature of the hyperbola navigation method is the ability to reduce the number of navigation positions by one when the on-board navigation equipment operates in a passive mode, carrying out only the reception of navigation information, like consumers of satellite navigation information.

The purpose of this work are consideration of use of GPS for a research of roads and modeling of the vehicle/wheel machines (WM).

Implementation for this problem of the measuring registering complex on a basis the Raspberry Pi 3/4 minicomputer, the GN-803G sensor and creation of the software in the language C/C ++ is considered.

The obtained information about GPS and approaches of selection of necessary data from the messages on the basis of the NMEA 0183 standard submitted in the text ASCII form with the fields divided by a comma is analyzed. An assessment of opportunities of use of the obtained information is given.

The scheme of connection of the GN-803N module to Raspberry 3/4 through the GPIO protocol is developed and proved.

Reduction of the obtained data to a constant step with use of a polynom of Lagrange of the 2-nd order on three points of a variable step is considered.

It is recommended at further use of this corrected data array in process modeling of the car application of a method of interpolation CatMull-Rom on the 4-th points at the fixed step. Program fragments are given in C/C ++.

It is offered in the territory of RB during the determining of relative distances and a binding to cards at conversion it is possible to use the simplified linear formula lat_m= 112297,6196∙ D_dec lat , lon_m= 63215,444 ∙ D_dec lon .

The offered technique of application of GPS, software, received data are planned to be used for a research of influence of the driver and road conditions on the movement of the vehicle and the subsequent their application when modeling in Matlab/ Simulink, and also in problems of preliminary debugging of management systems by self-driving vehicles.

The article proposes a method for modeling the processing of heterogeneous data in the buffer storage of routers. In contrast to the existing approaches, in the developed method, in the analytical description of the processes of functioning of buffer storage devices of routers under the influence of heterogeneous traffic of subscribers of a special-purpose communication network, the apparatus of the theory of cellular automata was used, which made it possible to take into account the probability of timely processing of data of all used priority levels of communication directions.

As a result of the experiment carried out on the basis of a real special communication network, it was found that the developed method of modeling the processes of processing inhomogeneous data of buffer storage devices of routers makes it possible to increase the accuracy of determining the probability of timely delivery of priority information to subscribers of a special purpose communication network, in comparison with the existing standardized methods.

This paper is devoted to the reduction of data transfer between the main memory and direct mapped cache for blocked shortest paths algorithms (BSPA), which represent data by a D[M×M] matrix of blocks. For large graphs, the cache size S = δ×M2, δ < 1 is smaller than the matrix size. The cache assigns a group of main memory blocks to a single cache block. BSPA performs multiple recalculations of a block over one or two other blocks and may access up to three blocks simultaneously. If the blocks are assigned to the same cache block, conflicts occur among the blocks, which imply active transfer of data between memory levels. The distribution of blocks on groups and the block conflict count strongly depends on the allocation and ordering of the matrix blocks in main memory. To solve the problem of optimal block allocation, the paper introduces a block conflict weighted graph and recognizes two cases of block mapping: non-conflict and minimum-conflict. In first case, it formulates an equitable color-class-size constrained coloring problem on the conflict graph and solves it by developing deterministic and random algorithms. In second case, the paper formulates a problem of weighted defective color-count constrained coloring of the conflict graph and solves it by developing a random algorithm. Experimental results show that the equitable random algorithm provides an upper bound of the cache size that is very close to the lower bound estimated over the size of a complete subgraph, and show that a non-conflict matrix allocation is possible at δ = 0.5 for M = 4 and at δ = 0.1 for M = 20. For a low cache size, the weighted defective algorithm gives the number of remaining conflicts that is up to 8.8 times less than the original BSPA gives. The proposed model and algorithms are applicable to set-associative cache as well.

This article discusses one of the ways to generate a common cryptographic key using synchronized artificial neural networks. This option is based on a combined method of forming a cryptographic key [1]. The proposed combined formation consists of two stages: the formation of partially coinciding binary sequences using synchronized artificial neural networks and the elimination of mismatched bits by open comparison of the parities of bit pairs. The purpose of this article is to increase the cryptographic strength of this method in relation to a cryptanalyst. In this regard, it is proposed to prematurely interrupt the synchronization process at the first stage of the combined method and make changes to the resulting binary sequence by randomly inverting a certain number of bits. To confirm the quality of this method, possible attacks are considered and the scale of enumeration of possible values is illustrated. The results obtained showed that the combined method of forming a cryptographic key with a secret modification of the synchronization results of artificial neural networks, proposed in this article, provides its high cryptographic strength, commensurate with the cryptographic strength of modern symmetric encryption algorithms, with a relatively simple implementation.

Block symmetric ciphers are one of the most important components of modern information security systems. At the same time, in addition to the structure of the applied block symmetric cipher, the cryptographic strength and performance of the information protection system is largely determined by the applied encryption mode. In addition to high performance and high-quality destruction of block statistics, modern encryption modes should also protect encrypted information from occurred or intentionally introduced errors. In this paper, we have developed an encryption mode with blocks skipping and using a pseudo-random key sequence generator, which allows checking the integrity of encrypted information with accurate detection of the place where an error was introduced. In this case, the error detection accuracy is determined by the adjustable parameter of the macroblock size and can be set depending on the level of importance of the protected information. The developed encryption mode is characterized by the following key advantages: reducing the number of required encryption operations by half, while providing a high level of cryptographic quality; more effective destruction of macroblock statistics due to the use of an additional generator of pseudo-random key sequences, the impossibility of propagation of the occurred (intentionally introduced) error outside the macroblock, as well as higher values of the number of protection levels due to the possibility of classifying the initial states of the applied generators of pseudo-random key sequences. As proposed in this paper, the mode of authenticated encryption with blocks skipping can be recommended for use on mobile platforms that are demanding both in terms of the quality and reliability of the protected information and are limited in terms of computing and power resources.

This paper discusses a new automated training system called CATS. The proposed system covers all the main components of the educational process, including the simple and convenient formation of educational material, tasks for laboratory works, tests to check knowledge, allows you to monitor the progress of students, the process of studying educational content, check completed work for plagiarism, send incorrectly completed tasks to correction, keep an electronic journal and much more. The automated CATS system has been introduced into the educational process at the Belarusian National Technical University and is actively used, especially in the context of the COVID-19 pandemic. In the spring of 2020 alone, more than a thousand users have registered in the CATS system. The intellectual component in the CATS system allows you to implement a unique training program, which is based on the existing knowledge and the level of perception of the educational material by the students. As mathematical methods, it is proposed to use the analysis of expert systems, as well as artificial neural networks. These mathematical methods made it possible to develop adaptability algorithms, their software implementation and testing in the educational process. Users are provided with a web application and its mobile clients for iOS and Android operating systems. Mobile applications are localized in Russian, Belarusian, English and German. By formalizing the intellectual processes that are carried out by both the teacher and the student, it is possible to automate a certain part of their functions, reduce the cost of manual labor, which will make it easier to control the educational process, and make the training itself more effective.