The problem of building and optimizing the teams of programmers taking into account the qualification and the level of skills in programming technologies and tools is considered. Known technological environments for the management of teamwork, such as Agile, formulate only general requirements and principles for building the teams and the distribution of work between them. A method for formalizing and evaluating the qualification of individual programmers and entire groups of programmers has been proposed. The input data are attributes of the most popular technologies and programming tools, including technology rating, as well as the results of a survey of programmers on their level of skills. The qualification of a group of programmers is evaluated taking into account the requirements for a particular project, which integrates three components: the average qualification of programmers included in the group; the qualification of the group with respect to the best representatives for each of the technologies; threshold values of the levels of programmer qualification and group qualification for each of the technologies, as well as threshold values of the integrated qualification, reflecting the specifics of the given project. The contribution of each component is determined by appropriate weights. The proposed method is a basis for a genetic algorithm that performs the search for the number, size and staff of groups of programmers which yield a maximum of total qualification. Software has been developed and computer experiments have been carried out on a set of programmers who graduated from Belarusian universities. The obtained results demonstrate the real ability of the system to find the number, size and staff of groups of programmers, which increase the overall qualification of groups by 30% while minimizing the number of unemployed developers. The results prove the practical importance of the method and software in the field of technologies and tools for the management of professional teams of programmers.

The analysis of methods of reception of longitudinal biases/profile of road important for carrying out of modelling of movement of the vehicle on the basis of geodetic charts, gaugings of roads by means of the geodetic equipment, use mobile laboratories is carried out, radar scanning of the earth, data read-out from the electronic control package of the car and the estimation of their accuracy is given. It is noticed that the listed modes are labour-consuming and Expenses and not always provide necessary accuracy. So in case of use of the popular data of radar scanning of the earth from companions the error can reach 30–50%. Though in the future in process of perfection of accuracy of sounding and availability of the information the given mode is represented to the most perspective.

The method of registration of cross-sections/biases of the big sites of roads in the course of movement of the vehicle on the basis of microcontroller Arduino Due, the gauge of speedups and discharge angles MPU-6050 and data recording on a SD- card is offered, application of the combined processing of the information on the basis of the developed programs in language With in the microcontroller and in module S-Function Builder in package Matlab/Simulink is considered.

By means of the offered methods registration of biases of road of difficult character by extent of 10 km is spent. And for the same road the method of use of a chart of radar scanning of the earth constructs a road cross-section. Comparison of results of methods of use of speedups and radar scanning of the earth is spent.

Good coincidence of character of change of a cross-section of road and sredne-quadratic and maximum values of heights of a cross-section of the road, received on the offered methods (a toe-out of 7–20%) is revealed.

The problem of approximation is relevant for most engineering applications. In this connection, the universal methods of approximation are of interest. The method of nonparametric approximation is developing in the paper – the method of singular wavelets. The method includes an effective numerical algorithm based on the summation of a recursive sequence of functions. The universal algorithm of approximation makes it possible to apply it to approximate one-dimensional and multidimensional functions, in decision support systems, in the processing of stochastic information, pattern recognition, and solution of boundary-value problems.

The introduction explain the idea of the method of singular wavelets – to combine the theory of wavelets with the Nadaraya-Watson kernel regression estimator. Usually, Nadaraya-Watson kernel regression are considered as an example of non- parametric estimation. However, one parameter, the smoothing parameter, is still present in the traditional kernel regression algorithm. The choice of the optimal value of this parameter is a complex mathematical problem, and numerous studies have been devoted to this question. In the approximation by the method of singular wavelets, summation of Nadaraya-Watson kernel regression estimates with the smoothing parameter takes place, which solves the problem of the optimal choice of this parameter.

In the main part of the paper theorems are formulated that determine the properties of the regularized wavelet transform. Sufficient conditions for uniform convergence of the wavelet series are obtained for the first time. To illustrate the effectiveness of the numerical approximation algorithm, we consider an example of the quasi-interpolation of the Runge function by wavelets with a uniform distribution of interpolation nodes.

Nowadays, it is considerable to develop a general concept and implement a system for storing and analyzing data related to socio-economic displacements of people. The population movement, related to long-term and short-term migrations, has an increasing nature, which directly affects the various fields of activity in a single country and the world community as a whole. The proposed article describes the subject area associated with socio-economic displacements of people, the key features of internal and external migrations are noted. Based on the subject area, the general architecture of the universal system of data storage and processing is proposed, which is based on the client-server architecture. A fragment of the data model, associated with the accumulation of data from external sources, is provided. General approaches of algorithms and data structures usage are proposed. The system architecture is described with the possibility of scaling both vertical and horizontal.

The proposed system organizes the process of searching for data and filling the database from third-party sources. To do this, a module for collecting and converting information from third-party Internet sources and sending them to the database has developed. In the paper is noted the feature of the client application, which provides a convenient interface for analyzing data in the form of diagrams, graphs, maps, etc. The system is intended for various users interested in analyzing economic and social transfers, for example, to tourist organizations wishing to obtain statistics for a certain time, to airlines which could plan flights in one direction or another, as well as for state structures with the purpose of analyzing the migration flows of the population and developing appropriate strategy for their regulation.

The goal of the work is the further extending the scope of application of code automorthism in methods and algorithms of error correction by these codes. The effectiveness of such approach was demonstrated by norm of syndrome theory that was developed by Belarusian school of noiseless coding at the turn of the XX and XXI century. The group Г of the cyclical shift of vector component lies at the core of the theory. Under its action The error vectors are divided into disjoint Г-orbits with definite spectrum of syndromes. This allowed to introduce norms of syndrome of a family of BCH codes that are invariant over action of group Г. Norms of syndrome are unique characteristic of error orbit Г of any decoding set, hence it is the basis of permutation norm methods of error decoding. Looking over the Г-orbits of errors not the errors these methods are faster than classic syndrome methods of error decoding, are avoided from the complex process of solving the algebraic equation in Galois field, are simply implemented.

A detailed theory for automorphism group G of BCH codes obtained by adding cyclotomic substitution to the group Г develops in the article. The authors held a detailed study of structure of G-orbit of errors as union of orbits Г of error vectors; one-to-one mapping of this structure on the norm structure of group Г. These norms being interconnected by Frobenius automorphism in the Galois field – field of BCH code constitute the complete set of roots of the only irreducible polynomial. It is a polynomial invariant of its orbit G. The main focus of the work is on the description of properties and specific features of groups G of double errors and its polynomial invariants.

In recent decades, perfect algebraic constructions are successfully being use to signal systems synthesis, to construct block and stream cryptographic algorithms, to create pseudo-random sequence generators as well as in many other fields of science and technology. Among perfect algebraic constructions a significant place is occupied by bent-sequences and the class of perfect binary arrays associated with them. Bent-sequences are used for development of modern cryptographic primitives, as well as for constructing constant amplitude codes (C-codes) used in code division multiple access technology. In turn, perfect binary arrays are used for constructing correction codes, systems of biphase phase- shifted signals and multi-level cryptographic systems. The development of methods of many-valued logic in modern information and communication systems has attracted the attention of researchers to the improvement of methods for synthesizing many-valued bent-sequences for cryptography and information transmission tasks. The new results obtained in the field of the synthesis of ternary bent-sequences, make actual the problem of researching the class of perfect ternary arrays. In this paper we consider the problem of extending the definition of perfect binary arrays to three-valued logic case, as a result of which the definition of a perfect ternary array was introduced on the basis of the determination of the unbalance of the ternary function. A complete class of perfect ternary arrays of the third order is obtained by a regular method, bypassing the search. Thus, it is established that the class of perfect ternary arrays is a union of four subclasses, in each of which the corresponding methods of reproduction are determined. The paper establishes the relationship between the class of ternary bent-sequences and the class of perfect ternary arrays. The obtained results are the basis for the introduction of perfect ternary arrays into modern cryptographic and telecommunication algorithms.