No. 5 (2019)

The features of time synchronization of stations in systems of quantum key distribution (QKD), taking into account the quantum nature of the photodetector output signal, are analyzed. It is emphasized that the implementation of the synchronization process in the multi-photon mode potentially simplifies the unauthorized access to unauthorized access to unauthorized access to the confidential information. Methods for enhancing the security of the synchronization subsystem are discussed, among which the approach is focused on using a photon pulse as the sync signal with an average number of photons less than 1. The aim of the research is to establish the functional dependence of the length of a fiber-optic communication line (FOCL) on the parameters of single-mode optical fibers and single-photon avalanche photodiodes (SAPD) used to formulate the pro-spects for using a two-stage algorithm for one-photon synchronization of the receiving and trans-mitting and coding stations of the autocompensation QKD system without dividing time frames on temporary segments. In the analyzed algorithm at the receiving end, the repetition period and duration of optical sync signals are known. The equipment at the search stage registers the recep-tion of a photon or a dark current pulse (DCP) in the first time frame. If a photon is not registered in the frame, the search continues in subsequent frames. If a photon is accepted when analyzing a time frame, the equipment proceeds to testing, where the second survey is performed only during the gating of a single-photon photodetector. The study shows the prospect of using a two-stage synchronization algorithm for a QKD system using single-mode optical fibers with a minimum attenuation and single-photon avalanche photodiodes with a smaller DCP generation frequency. The implementation of a two-stage algorithm is possible in local networks with a fiber optic length of 20 ... 30 km on almost any single-mode optical fibers in the case of SAPD with an DCP genera-tion frequency of less than 10 Hz. The construction of communication lines with a length of more than 50 km is possible only with a focus on the use of SAPD with a frequency of DCP generation of less than 1 Hz.

The removal of cloud images from photographs of the underlying surface is a prerequisite for the use of datasets from Earth satellites, since such satellite images are used to analyze chang-es in soil cover associated with urban expansion, restoration of forests on abandoned agricultural lands, estimation of forest area, identification of forest types and classification land cover, and this data is most often polluted by clouds. The article explores the algorithm for extracting and remov-ing cloud images and develops its software implementation. The effectiveness of the new approach is shown using several examples for various areas of the earth's surface with clouds. The subject of research is the methods and algorithms for detecting and reconstructing objects that hide de-tails on images, in particular cloud images. The object of study is a set of test images. The result of the study is the development of a method for removing cloud images in order to restore the area covered by clouds. The novelty of the work is an algorithm that improves the quality of image re-covery based on a neural network. The results obtained make it possible to reconstruct areas cov-ered by clouds. The effectiveness of the image restoration method was evaluated using a statistical criterion – the random mean square error of the processing result from the true image. As a result of solving the tasks, it can be concluded: – a method has been developed for removing cloud imag-es and restoring images based on the search for similar blocks with their subsequent integration by a neural network; – an analysis of the results of the study showed that the proposed method can improve the quality of image reconstruction.

This work relates to the field of artificial intelligence solving problems. It considers the traveling salesman problem, which is actively used in practice in logistics, sociology, intellectual design, robotics, to solve search engine optimization problems and many other areas of engineer-ing activity. The traveling salesman problem is fundamental, in view of its theoretical and practical importance. Since it is NP-complete, a solution is sought in a space growing exponentially from n. The development of new methods for its solution and modification of existing ones remains an urgent task for researchers. When solving the traveling salesman problem of large dimension, it is advisable to use various approximate methods for finding its solution. The purpose of this study is to develop a hybrid memetic algorithm for solving the traveling salesman problem and test its effectiveness on modern benchmarks. The memetic algorithms belong to the class of evolution-ary solution methods, which in the general case prove their effectiveness in solving complex opti-mization problems. The main methodological basis for the study is the general theory of evolution-ary computing. The peculiarity of this work is that its verification was carried out using cloud computing on the Internet, which significantly increased computing power and reduced data pro-cessing time. The running time of the algorithm was , where n is the number of cities (verti-ces of the graph). A special program was developed, and a computational experiment was con-ducted on the following benchmarks: Pr76, kroD100, Pr152, Pr439, Pr1002, опубликованных в современной зарубежной литературе. For the problem Pr 76 and Pr152, the results of the solution coincided with the best-known solutions. The developed algorithm has shown its effective-ness for solving the traveling salesman problem with up to 5000 vertices. The results of the study almost coincided with theoretical assumptions.

In matters of information security an important task is the development of methods for as-sessing security of confidential information. For many information protection systems information security assessment can be reduced to finding solutions of Boolean nonlinear equations systems and analyzing the complexity of various methods for solving such systems (algebraic analysis method). Algebraic methods of analysis are applied, for example, to the following tasks arising in the field of ensuring information security: – audit of the state of the protected object; – checking the correct functioning of programs; – analysis of the reliability of systems for protecting confi-dential information (including using cryptographic algorithms). This article presents proposed approach to the application of satisfiability problem (SAT) solvers for analyzing the reliability of block encryption algorithms, using as an example the lightweight encryption standard – PRESENT cipher. The research of the reliability of cryptographic algorithms for algebraic analysis methods consists in representing the encryption algorithm as a system of non-linear equations that connects the secret encryption key with plaintexts and ciphertexts. As a method for solving a nonlinear sys-tem of equations, paper considers the method of reducing to the search for performing sets of cor-responding SAT problem. For 3 rounds of the PRESENT encryption algorithm (using 6 known pairs of texts) a secret encryption key was found in 1005.68 sec. (search of the satisfiable value took 5.01 sec.). For 4 rounds of the PRESENT encryption algorithm, (using 8 known pairs of texts) 16 possible encryption keys were found in 3268.42 sec. (it took 527.51 seconds to find all the satis-fiable sets). A technique is proposed for assessing the reliability of symmetric block ciphers based on SAT-solutions using SAT-solvers Plingeling and CaDiCaL. Estimates of the reliability of cryp-tographic algorithms of information security obtained on the basis of algebraic analysis methods should be taken into account throw developing new and improving existing cryptographic systems.

The development of electronic voting systems is a complex and urgent task. The security of any system using networking is based on cryptographic protocols. Their quality is checked using formal verification tools. However, formal verification tools work with protocols in an abstract form of the Alice-Bob format, which does not allow fully checking the protocol for all kinds of attacks. In addition, when implementing the protocol in practice using any programming lan-guage, it is possible to change this protocol with respect to its original form. As a result, it turns out that the abstract initial form of the protocol, which was verified by means of formal verifica-tion, is considered safe, but the modified implemented protocol, having a different look, can no longer be considered safe. Thus, it is relevant to verify the cryptographic protocol of the electronic voting system using source codes. The paper described the electronic voting system using multiple casting of ballots. A parser for extracting the structure of a cryptographic protocol is described, with the help of which the structure of the voting protocol was obtained. The cryptographic proto-col of electronic voting was translated using multiple casting of ballots into the CAS + specifica-tion language for the Avispa automated verifier to verify the security of the protocol.

The security of any protected system that uses data transfer between two or more parties is based on cryptographic protocols. To assess the quality and safety of the developed protocols, various formal verification tools are used. Formal verification tools, such as Scyther tool, Avispa, ProVerif, used to verify standard properties (confidentiality, authentication), while universal tools are used to verify more complex properties. The universal formal verification tool SPIN uses mod-el checking using temporal logic. SPIN was not specifically designed for protocol security verifi-cation. This tool is more complex, but versatile and allows the cryptographic protocol developer to create a model of his protocol at the level of abstractions he needs and check it for compliance with the set verification goals. The purpose of this paper is to describe the verification of the Needham-Schroeder protocol using the SPIN tool. Research objectives: describe the Promela language, which is used to compile the model in the tool in question; show a protocol model to identify attacks on authentication of the parties; describe the interacting parties, the transmitted data, the order of transmitted messages between the parties. The paper describes the security veri-fication of the Needham-Schröder protocol using the formal SPIN verifier for authentication at-tacks. As a result of the work, attacks on authentication of the parties were detected, the interac-tion patterns of the parties during these attacks are shown.

The article is devoted to the problem of the discrepancy between the theoretical results of measuring the parameters of harmonic oscillation and software calculation. The simulation was performed using the LabVIEW software environment, using the digital multiplier-conversion method, the main stages of which are presented in the form of a developing chain: a) generation of harmonic oscillations and random processes b) interference filtering using bandpass filters tuned to the first harmonic c) parallel summation resulting processes, d) raising the results of summation to the sixth and seventh degree e) re-filtering a random process using band-pass filters Tuned to the sixth and seventh harmonic, e) multiplication applied to the selected higher harmonics, e) fil-tering for another combinational harmonic by a bandpass filter tuned to the first harmonic, f) the resulting signal is subjected to Hilbert transform. The Hilbert transform from an analytical signal gives a complex signal with a real and imaginary part, h) the resulting complex signal is converted into a polar or exponential form for subsequent phase extraction, and) obtaining frequency infor-mation by applying the derivative to the phase. Obtained, after applying the multiplication-conversion operations, the regularity of the frequency change is compared with the initial frequency and the parameters are determined: mathematical expectation and standard deviation. Based on the discrepancies obtained, a conclusion is drawn about frequency instability. As a re-sult of applying nonlinear transformations of oscillations of oscillators of identical instability and obtaining the same frequency oscillation using the same method, controlled frequency instability is formed. Applying this method many times to the oscillations of highly stable generators, it is pos-sible to form an oscillation with increased instability, and then measure it with conventional measuring instruments without resorting to high costs when performing this operation. Then cal-culate the initial instability using the above formulas.

Currently, the development of new information technologies does not stand still and is moving forward, creating more and more new both theoretical and practical methods, and means for solving various problems. Standing on the path of progress of all mankind. At all stages of the development of information technology, much attention has been paid and is being paid to the issues of modeling func-tioning specialized computer systems, which allow providing the necessary performance indicators in combination with minimized costs of software resources and energy consumption. The article proposes a quantum algorithm for searching and sorting N elements and reflects the developed modeling system (component) that can solve the problem. The scientific novelty of this area is primarily expressed in the constant updating and addition of the field of quantum research in a number of areas, and computer simulation of quantum physical phenomena and features, such as the features of quantum bandwidth, are rather poorly illuminated in the world. The developed algorithms for various problems of complexity classes can give a significant gain in efficiency in comparison with existing classical ones and provide a solution to a number of complex mathematical (including cryptographic) problems. The aim of the work is to develop a quantum algorithm for sorting numerical elements, which will allow us to analyze the speed and advantage of quantum algorithms along with the classical models of a quantum computer within the framework of the computational process. It also consists in developing the theoretical, algo-rithmic and practical foundations for constructing a modular system for the interaction of information processes and algorithms with an open architecture. The relevance of the study is to build a modular specialized computing system for new information technologies and algorithms, analyze their perfor-mance and computational complexity, implement the theoretical foundations of creating software sys-tems for new quantum-oriented information technologies. It also consists in developing the theoretical, algorithmic and practical foundations for constructing a modular system for the interaction of infor-mation processes and algorithms with an open architecture.

To solve the problem of satisfying the requirements for pseudo-random functions for light-weight electronics, among which, in addition to ensuring cryptographic strength, several mutually exclusive properties are required - maximizing information processing speed, minimizing compu-tational resources and minimizing information processing delays, it is proposed to use a new sub-stitution element - pseudo-dynamic substitutions of PD-sbox. The presence of an additional control input in the PD-sbox makes it difficult to directly replace fixed substitutions in structures based on SP-networks. The requirements for pseudo-random functions for lightweight electronics are ana-lyzed and presented, taking into account the features of PD-sbox. The main disadvantages of the known pseudo-random function based on PD-sbox are determined – Collapser. Based on the re-sults of scientific research, an iterative pseudo-random function pCollapser is proposed, each round of which contains a layer of PD-sbox connected in parallel and layers of additional simple linear mixing functions for processing PD-sbox states. The effect of using a layer of parallel-connected PD-sbox, which in turn consists of a parallel set of fixed substitutions, is to ensure ex-treme parallelism of information processing. The test 4-round hardware implementation of pCollapser for a 64-bit input information block allowed to process an array of 64 fixed substitu-tions in one round (clock cycle), which is 6 times more than analogs built on the basis of the SP network (for example, the PRESENT algorithm). The result is a dramatic (6-fold) decrease in the critical path of signal.

Internet of Things (IoT) is an important upcoming technology for making infrastructures of our society smart and adaptable to the users’ needs. One such infrastructure is transportation. The connec-tion between roads and cities is obvious. The main features of the road infrastructure are a long service life and high cost, which means that this problem can be solved at the moment, keeping these objects in their original condition. Economic calculations show that effectively managing traffic on existing roads is more profitable than building new ones, although this is not very cheap from an economic point of view. Studying the experience of many major megacities of the world, it can be concluded that the con-struction of new and reconstruction of existing roads due to the constant increase in the number of vehi-cles does not completely reduce the difference between the capacity of roads and the level of demand required for automobile transport. High costs for the construction of new road infrastructure, constant traffic congestion and environmental factors are pushing companies and the government to look for solutions for more efficient traffic management. We are looking for opportunities to minimize the nega-tive effects of congestion and optimize the use of limited public funds. This article discusses existing methods and algorithms for automated management of traffic flows with a purpose of identifying hot spots and methods for applying IoT in this sector. Advantages and disadvantages of the existing meth-ods are discussed, including evaluation of their effectiveness.

The solar wind has a strong influence primarily on the outer shells of the Earth – the mag-netosphere and the ionosphere, and as a result, the potential difference between the ionosphere and the earth's surface. The solar wind is a stream of fully ionized hydrogen gas (plasma) with approximately the same density of electrons and protons, which moves with acceleration from the sun. The effects of solar-terrestrial connections can have a noticeable, and sometimes a major influence on the dynamics of daily and seasonal variations in the field of the surface atmosphere. The purpose of the work is to identify the effect of the solar wind on the dynamics of daily and seasonal variations of the electric field in the surface atmosphere. The paper presents the results of the performed analysis of the interrelationships of the daily variation of the solar wind charac-teristics (solar wind velocity values, ion concentrations) and the electric field strength of the sur-face atmosphere. The variations of the electric field in the surface layer of the atmosphere during the day are due to both global and local factors. Their contribution to diurnal and seasonal varia-tions in the electric field of the atmosphere has not been studied enough. Long-term ground-based observations of variations in the parameters of atmospheric electricity are an important experi-mental basis for modern research. To measure the daily variations in the atmospheric electric field intensity, this work used a hardware-software complex to measure and transmit to the central server the values of the atmospheric electric field strengths at the Cheget peak. Monitoring in the highland areas is characterized by the fact that the anthropogenic component in the formation of the electric field of the atmosphere is practically excluded.

An immunological method is proposed for solving the problem of text-independent identifi-cation of a person by voice, based on the principles of presentation and processing of voice infor-mation accepted in artificial immune systems. For personality identification by its voice, a Fanta model is used in which the voice signal is formed by passing through a high-order filter. Cepstral coefficients obtained on the basis of a linear speech predictor are used as feature vectors. The following analysis of the feature vectors is carried out on the basis of the apparatus of artificial immune systems using an immunological model of negative selection. The model implements de-centralized recognition of sequentially reaching speech fragments by comparing them with spe-cial, previously created recognition elements — V-detectors, represented by r-dimensional hyperspheres of variable size. V-detectors fill all the workspace free from points of the voice standard, imitating immunocompetent cells of the immune system. The comparison of fragments of the voice signal with V-detectors is carried out by checking their falling into the hyperspheres of V-detectors according to the principle of negative selection. The use of V-detectors makes it possi-ble to more effectively cover the working space of voice fragments by a significantly smaller num-ber of recognition elements, which reduces the computational cost of implementing the voice veri-fication procedure. During the speech signal analysis, the decision "well-known/stranger" is making based on a statistics of V-detectors response frequency. The method is intended for continuous verification control of the speaker’s identity at the rate of voice data income when text of arbitrary size and content is reproduced. It allows to make a timely decision about the possible substitution of speakers. The advantage of the method is its complete protection from replay attacks.

A method is proposed for solving the problem of highlighting the maximum clique in a graph based on a modified model of adaptive behavior of a swarm of particles. The particle swarm method is a stochastic optimization method somewhat similar to evolutionary algorithms. This method does not model evolution, but swarm and pack behavior of animals. Unlike population methods, the particle swarm method works with one static population, whose members gradually improve with the advent of information about the search space. As a data structure that carries information about the solution, a sequence is used, which is the order in which the solution is formed, which is called a priority list. A priority list is a coded solution, in terms of a genetic algo-rithm, a “chromosome”. The priority list is an indirect decision coding scheme. The transition from the priority list to the decision is made using a decoder. A decoder is an operator that allows you to switch from an indirect (numerical) coding scheme for solving a problem to a phenotype. In fact, a priority list is an interpretation of a solution in a particular subject area. The search proce-dures in the space of solutions, the mechanisms of behavior of the modernized swarm of particles are described. The key problem that was solved in this paper is related to the development of the structure of an affine position space that allows us to display and search for interpretations of solutions with integer parameter values. In contrast to the canonical particle swarm method, in order to reduce the weight of affine bonds, by moving the particle to a new position in the affine solution space, a directed mutation operator has been developed, the essence of which is to change the integer values of the genes in the chromosome. The temporal complexity of the algorithm ob-tained experimentally coincides with theoretical studies and for the considered test problems is О(n2) – О(n3). The probability of obtaining a global optimum was 0.94. On average, launching a program provides solutions that differ from the optimal solution by less than 1.5 %. The results show that the proposed approach is an acceptable alternative for solving combinatorial problems.

This article is devoted to solving an important and urgent problem of knowledge representa-tion in complex technical systems. The review of existing approaches to knowledge representation is carried out. The use of a three-level structure of knowledge representation in a given subject area is justified, its formal description is performed. A three-level model of knowledge representa-tion based on graphs is developed, in which data is formed at the first level, information is formed at the second level, and knowledge is produced at the third level. The formal description of the fuzzy graph intended for simulation of complex technical systems. The perimeter security system is considered as complex technical system. The objects of the perimeter security system include sta-tionary security objects, technical devices, designed to monitor objects, and potential violators. The graph vertices correspond to the objects of the security system, and the graph edges represent different types of relationships between objects. For modeling systems with different types of infor-mation flows, the use of a graph is justified, which allows to take into account the combination of the same type, different types and multiple edges in the form of a vector. In the author's software pack-age, a three-level model based on a fuzzy graph is developed, where data is represented by vertices, information is represented by the same type of connections, and knowledge is a set of paths in the graph leading to a certain result. As a result of the simulation, the number of technical devices re-quired for the protection of a given perimeter is calculated, and the problem of distribution of zones of influence of technical devices on objects of the security system is solved. The results of experi-mental studies have shown that the approaches proposed by the author can reduce the time of obtain-ing knowledge in graphs to 1000 vertices by 16 ms.

Acousto-optic (AO) methods of information processing have now been widely used in different engineering domains. Their usage is getting more actual with developing new technologies and materi-als. AO cymometers as a kind of acousto-optic measurers of radoisignals parameters have firmly been taking their place in equipmentof parameters estimation because of unique characteristics: multisignal mode, frequency resolution, comparably small mass and sizes, power consumption at acceptable dy-namic range and frequency accuracy. These devices are capable to practically immediately replace radiosignal from time domain to frequency one, and find applications in systems of passive radiocontrol where as important parameters are counted not only frequency range, frequency resolution, frequency and phase accuracy, but also power consumption, mass and sizes which are relevant in portative and space measuring complexes. At these reasons in many countries the AO measurers have been success-fully utilized. One of the tasks being solved in AO development is analysis of design and implementation possibility of these devices on the base of domestic electronic components. For solving this task, collab-orators of “Nanophotonics and optoelectronics” laboratory of Southern federal university have devel-oped and examined the prototype of AO cymometer, meeting required technical needs. Suggested the new structure and design method of two-channel AO cymometer. Given the optical diagram calculation, simulation and experimental results of the AO cymometer. Has been shown that two-channel AO meas-urer structure allows to implement needed technical requirements to AO cymometers at such paramemters as mass, sizes, amplitude-frequency response nonuniformity. Theoretical calculations and modeling have been confirmed with results of experimental examinations of AO cymometer prototype built in compliance with documentation.

The article considers an approach to the organization of resource allocation in the data collection system for the task of creating a complex of perimeter protection of objects of large territorial extent, taking into account the likely presence of various threats and the need to mon-itor the management of objects group based on changing goals. The principles of data descrip-tion system creation are considered. The data description system contains a database and mod-eling and control subsystems. The modeling subsystem of the perimeter security system allows to solve the problem of planning the joint action of objects of the protected area. The descrip-tion of subsystem of modeling of interaction of technical means and objects of the protected territory is resulted. The approach to modeling subsystem of interaction of technical means and objects of the protected area on the basis of new fuzzy hypergraphic model where actors act as vertices is shown. In the framework of this study, an actor is understood as some object or sub-ject, capable of entering into an information network interaction. In the proposed model, actors are dangerous production facilities or their partial representation, protection modules and po-tential violators. The article considers the results of the software implementation of the perime-ter security system database, designed to store and update information about the objects of the security system and threats from potential violators. The perimeter security database is based on the Microsoft Windows Azure cloud storage platform. The scheme of interaction between the database of the perimeter security system and the modeling subsystem is proposed. The ap-proaches implemented in the article allow us to organize the interaction of a modeling sub-system based on the proposed hypergraphic model and a database created using standard SQL database technologies, where in addition to the traditional parameters of objects, the geograph-ical position and General geometry of the object are added.

Currently, CMOS is the main element basis in the production of VLSI. VLSI production volumes at CMOS are growing. However, with all the advantages of CMOS-element base, it has a significant drawback-a thin sub-gate oxide, which reduces the percentage of yield and reliability of VLSI based on CMOS. The paper considers a topological variant of the structure of injection-field logic, which is de-void of the disadvantage of CMOS - thin oxide - and, in addition, allows to increase the density of the layout when using the same topological norms more than two times compared to CMOS-structure of approximately the same power consumption. A typical cell of an injection-field structure includes a normally closed field-effect transistor having an annular gate geometry with a drain in the center, and a bipolar p-n-p transistor of a horizontal design called an injector. In contrast to the ring geometry of the typical IPL structure, the proposed version uses a linear topology: in the gaps between rectangular gates there are drains that are the outputs of multi-input OR-NOT circuits. Logical schemes in the ap-plication of this topological structure can be built in the basis OR-NOT. On the basis of the analytical two-dimensional model calculates the injection-field structure: the dependence of the channel resistance and the width of the space charge of the gate in the open state of the applied voltage, the obtained values for the logical zero and one inverter. The proposed structural and technological version of the IPL-structure can be recommended for the creation of VLSI with higher reliability and degree of integration in comparison with CMOS VLSI.

Работа посвящена разработке алгоритмов поведения группы роботов, базирующихся на использовании биоинспирированных подходов, основанных на использовании аналогий поведения живых существ, в частности метода роя частиц. Целью работы роя роботов является исследование некоторой территории с целью обнаружения участка с экстре-мальным значением заданного вещества. Основополагающей идеей роевого управления яв-ляется «роевой интеллект». В основу управления гомогенным роем роботов положен прин-цип силовой релаксации. Поиск решения производится в аффинном пространстве, элемен-тами которого являются n-мерные точки (позиции). Обозначим R  {ri |i=1,2,..s } рассмат-риваемый рой роботов, где s – число роботов в рое; Xi(t)(xi (t), yi(t)) – текущее положение робота ri. Пусть начальные положения роботов роя определяет набор векторов Xi(0), i[1:s]. Каждый робот ri вычисляет целевую функцию f(Xi(t)) – значение искомого вещест-ва в точке Xi(t). На каждой итерации выполняются следующие действия. Введем обозначе-ния W(t) – множество координат ячеек (точек) над которыми расположены роботы в момент t. Определяется точка X*i(t)W(t) с лучшим значением функции f(Xi(t)), которая рассматривается в качестве аттрактора. В соответствии с алгоритмом силовой релак-сации положение робота ri в следующий момент времени t1 определяется по формуле: Xi t1)Xi(t) Vi(t). Принципы перемещения робота производится по аналогии с методом роя частиц. В отличие от канонического метода роя частиц в работе предусматривается использование вещественных значений параметров в многомерных, вещественных, метри-ческих пространствах. Также, в отличие от канонического метода роя частиц, в нашем случае скорость Vi(t) и координаты точки Xi(t1) не могут быть представлены в виде ана-литического выражения с вещественными значениями переменных. Если в качестве пози-ции используется двумерный вектор Vi(t) в декартовой системе координат 0xy, то число параметров, определяющих положение частицы в пространстве решений (позицию) долж-но быть равно двум. Значение каждой координаты откладывается на соответствующей оси пространства решений. В этом случае возникают некоторые требования к значениям координат. Значения координат должны быть дискретными и независимыми друг от дру-га. В качестве аналога скорости Vi(t) выступает оператор направленной мутации (ОНМ), суть которого заключается в изменения целочисленных значений координат. Перемещение робота ri в новую позицию означает переход от Vi(t) к новой – Vi(t+1) c новыми целочислен-ными значениями генов координат, полученными после применения оператора направлен-ной мутации. Вектор перемещения Vi(t), которое робот ri совершает при переходе из те-кущего положения Xi(t) в положение Xi(t1) имеет вид: Vi(t)= VIi(t-1)+VCi(t-1)+VSi(t-1). Вре-менная сложность алгоритма лежит в пределах О(n2)-О(n3), где n –число роботов.

The Traditional structure power source has three levels: rectifier; the patch of the factor to powers (KKM); pulsed insulated DC/DC source. Such structure can be not used in power source for systems on crystal (SoC) on two main reasons:1) in SNK it is impossible place the electrolytic capacitors (EK), as well as ceramic capacitors (KK) to big capacity; 2) appear the difficulties at realization of the pulsed radio-frequency transformer DC/DC source with re-quired turn ratio. In work is shown that introduction to structure fourth level on base linear stabilizer without output electrolytic capacitor (NoCap) avoids the first reason, but require-ments on turn ratio remain former. This is connected with that that stabilizers of the type NoCap have a non-standard input voltages, which little differ from output (the difference forms 100–200 mB). In work is given motivation to need of the introduction fifth and sixth level of the structure in the manner of pulsed DC/DC sources. The Main part DC/DC source fifth level can take seats with SNK, but required for his work choke will be an outboard element SoC. In arti-cle is shown that efficient use stabilizers type NoCap possible only when performing it is enough hard conditions on stability their input voltages.

A significant expansion of the functional capabilities of the pneumatic drive, ensuring the opera-tion of various technological equipment, is achieved by introducing the precise organization of control of its elements into the pneumatic system. However, despite the modern development of methods of the theory of automatic control, which have found application in various technical fields and fields of sci-ence, the task of synthesizing the laws of control is still a complex, ambiguous and requiring creative approach to its solution. Currently, research is being conducted in this direction by both Russian and foreign scientists using the classical linear laws of control, the optimal control methodology, as well as the modern apparatus of fuzzy logic and neural networks. The aim of this work is to develop an astatic nonlinear synergistic controller to suppress disturbing effects arising in electro-pneumatic systems. The synthesis of control actions was carried out using the method of analytical design of aggregated controllers, which is part of the concept of synergetic control theory. The starting materi-al for the study is the mathematical model and parameters of the Camozzi pneumatic cylinder of the QCT2A032A200 series. The synthesis of synergistic control laws is based on the method of analytical design of aggregated controllers and the representation of the behavior of the system in phase space. The essence of the method is to choose the regions of attraction - invariant manifolds of the system, falling on which the system will inevitably move towards a given control goal. The control laws ob-tained by an analytic method, by jointly solving the introduced macro-variable and functional equations, guarantee the asymptotic stability of the closed system, as well as the achievement of the desired control goals - invariants while suppressing disturbing influences. The resulting control actions were simulated in the Maple. The obtained graphs of changes in phase variables indicate the adequacy of the synthe-sized astatic control law and its suppressive perturbation property. The results can be used in the pro-cess of setting up programmable logic controllers for high-precision energy-saving control of pneumatic drives, and further experimental research.

The most simple and effective way to modify the characteristics of solar cells is the use of functional coatings. This way allows increasing the efficiency of solar cells without modifying the design and changing the technology of their production. The most promising may be the use of multifunctional coatings, which at the same time would combine the properties of antireflection coatings and allow to expand the spectral sensitivity and increase the quantum yield of solar cells. Such functional coatings can be created on the basis of polymer films with metal nanoparticles. Silver metallic nanoparticles are promising for use in functional coatings for silicon solar cells, since they produce surface plasmons, which in turn can create fluctuations in the surface charge density at the interface with the dielectric polymer film. Thus, a functional coating, which is a polymer film with silver nanoparticles distributed in it, can combine the protective function, the antireflection effect of the polyvinyl butyral polymer film, and the plasmon effect of silver nanoparticles, which will ulti-mately improve the characteristics of the solar cell. In the present work, polyvinyl butyral films with silver nanoparticles were obtained on the surface of solar cells and the effect of this functional coat-ing on the characteristics of a silicon solar cell was studied. The purpose of the work is to study the effect of the functional coatings with silver nanoparticles on the spectral characteristics of silicon solar cells. The spectral dependences of the external quantum yield of a silicon solar cell at various concentrations of silver nanoparticles in a polyvinyl butyral film are presented. It was found that the highest values of the external quantum yield of a solar cell (22.3% higher than the value of the ex-ternal quantum yield of a solar cell without functional coating) in the spectral range 540-1040 nm were recorded at a silver nanoparticles concentration of 7 mmol/L.