Search

The purpose of this paper is a spectrum analysis of signals of various nature, construction of the signal scalogram using Morlet wavelet, modification of the scalogram to obtain a more informative graphic representation of the signal. Spectral analysis of the signal is constructed by means of the Fourier transform. A modification of the graphical representation of the result of the wavelet transform has been developed with the help of the Mathematica system. For this, a wavelet scalogram has been used as a two-dimensional representation of the original signal. A scale has been introduced on it for the value of the signal amplitude depending on the time and period of its constituent components. This graphical representation allows us to obtain additional information about the dynamic properties of the original signal. A modification of the representation of the original signal scalogram has been developed for a more complete spectrum analysis (determination of the period of the constituent components). The paper contains an example using a modified scalogram for the analysis of a signal containing two pulses, an audio signal and white noise. The basic wavelet in this case is the Morlet wavelet. A comparison of the scalogram, obtained using the built-in function, and the modified scalogram has been made in the paper. The disadvantage of the first scalogram is the impossibility of assessing the frequency of the signal; its advantage is the ability to assess the localization of the pulse. For a modified scalogram, the advantage is the estimation of the signal periodicity, and the disadvantage is the inaccuracy in determining the range of pulse localization. For spectrum analysis in Mathematica, it is recommended to use a combination of two approaches (using a standard built-in function to determine the localization of the pulse) and a modified scalogram (to determine the periods of the constituent components).

The 21st century aviation and aerospace technologies have evolved and become more complex and technical. Turbofan jet engines as well as their cousins, the rocket engines (liquid/solid) have gone through several design upgrades and enhancements during the course of their design and exploitation. These technological upgrades have made engines very complex and expensive machines which need constant monitoring during their working phase. As the demand and use of such engines is growing steadily, both in the civilian and military sectors, it becomes necessary to monitor and predict the behavior of parametric data generated by these complex engines during their working phases. In this paper flight parameters such as Exhaust Gas Temperature (EGT), Engine Fan Speeds (N1 and N2), Fuel Flow (FF), Oil Temperature (OT), Oil Pressure (OP), Vibration and others where used to determine engine fault. All turbo fan engines go through several distinctly different working phases: Take-off phase, Cruise phase and Landing phase. Recording generated parametric data during these different phases leads to a massive amount of in-flight data and maintenance reports, which makes the task of designing and developing a fault diagnostic system highly challenging. It becomes imperative to use modern techniques in data analysis that can handle large volumes of generated data and provide clear visual results for determining the technical status of the engine under investigation/monitoring. These modern techniques should be able to give clear and objective assessment of the object under investigation. Cluster analysis methods based on Neural Networks such as c-means, k-means, self-organizing maps and DBSCAN algorithm have been used to build clusters. Differences in cluster groupings/patterns between healthy engine and engine with degraded performance are compared and used as the bases for defining faults. Fault diagnosis plays a crucial role in aircraft engine management. Timely and accurate detection of faults is the foundation on which maintenance turnaround times, operational costs and flight safety are based. The data used in this paper for analysis was obtained from flight data recorder during one flight cycle. The final decision on a fault is taken by an engineer.

The paper investigates the problems of reduction (decomposition) of multidimensional data models in the form of hypercube OLAP structures. OLAP data processing does not allow changes in the dimension of space. With the increase in data volumes, the productivity of computing cubic structures decreases. Methods for reducing large data cubes to sub-cubes with smaller volumes can solve the problem of reducing computing performance.The reduction problems are considered for cases when the cube lattice has already determined criteria aggregation, and the cube decomposition into smaller cubes is needed to reduce the computation time of the full lattice when dynamically changing data in the cube.The objective of the paper is to find conditions for reducing the computational complexity of solving data analysis problems by reduction methods, to obtain exact quantitative boundaries for reducing the complexity of decomposition methods from the class of polynomial degrees of complexity, to establish the nature of the dependence of computational performance on the structural properties of a hypercube, and to determine the quantitative boundaries of computational performance for solving decomposition problems of data aggregation .The study of the computational complexity of decomposition methods for the analysis of multidimensional hyper-cubes of polynomial-logarithmic and polynomial degrees of complexity is carried out. An exact upper limit is found for reducing the complexity of decomposition methods for analyzing the initial OLAP - data hypercube with respect to non-decomposition ones and based on them criteria are proved for the effective application of reduction methods for analyzing hypercube structures in comparison with traditional non-reduction methods.Examples of decomposition methods of cube structures are presented, both reducing and increasing computational complexity in comparison with calculations using the full model.The results obtained can be used in processing and analysis of information arrays of hypercube structures of analytical OLAP-systems belonging to the BigData class, or ultra-large computer multidimensional data systems.

At present, multilateration systems are becoming increasingly important in air traffic control. This is due to their significant advantages in compare with secondary surveillance radar complexes. This article solves the problem of synthesizing an algorithm for object location estimation for multilateration system operating in passive mode. The synthesized algorithm is a combination of a procedure, the result of which is a rough estimate of the observed object coordinates, and an iterative algorithm specifying the resulting solution. The rough estimate is the result of solving a linear system of equations. The iterative refinement procedure is based on the linearization of the observational equations and does not require a large number of iterations. The paper provides a comparative statistical analysis of the proposed algorithm and the known Bancroft algorithm. For an objective analysis of two algorithms, the paper derives the Cramer-Rao boundary for the correlation matrix of estimates of the observed object coordinates, which makes it possible to determine the potential accuracy of the solution of the problem. It is shown that both algorithms allow obtaining estimates, the accuracy of which is close to the potentially achievable accuracy of the object location estimate. In contrast to the Bancroft algorithm, the rough estimate of the object location is unambiguous. This virtue reduces the total amount of computations during the algorithm implementation and reduces the probability of anomalous errors.

International audience; The paper deals with the problem of identification of linearly varying frequency of sinusoidal signal with unknown amplitude and phase. Identification task for linearly varying frequency occurs, for example, during telescope operation control and it is of practical interest. Existing synthesis methods for identification algorithms of linearly varying frequency of sinusoidal signal use unlimited functions of time that is not attractive from a technical point of view, since the measurement noise multiplied by an unlimited function tends to give extremely poor estimates of the tunable parameter. This paper proposes a new approach for identification of linearly varying frequency comprising iterative filtering of measured sinusoidal signal (with the use of linear first order stable components), which in turn gives the possibility to obtain a simple linear regression model with one unknown constant parameter. We present computer simulation results, illustrating the performance of the proposed identification algorithm. Computer modeling was performed both in the presence and absence of the measurement noise. Also, comparative analysis of the proposed approach with the previously obtained methods was carried out within the framework of computer simulation. It was shown that the presented solution provides a significant improvement in the accuracy of an unknown frequency identification in the noise presence.; Рассмотрена задача идентификации линейно меняющейся частоты синусоидального сигнала, имеющего неизвестные амплитуду и фазу, возникающая, например, при управлении телескопом. Традиционно методы синтеза алгоритмов идентификации линейно меняющейся частоты синусоидального сигнала используют неограниченные функции времени, что вызывает технические проблемы, поскольку в этом случае наличие шумов при измерении может существенно исказить настраиваемый параметр. Предложен подход к идентификации линейно меняющейся частоты, предусматривающий итеративную фильтрацию (с использованием линейных устойчивых звеньев первого порядка) измеряемого синусоидального сигнала, которая позволяет получить простую линейную регрессионную модель с одним неизвестным постоянным параметром. Приведены результаты компьютерного моделирования, иллюстрирующие работоспособность представленного алгоритма идентификации. Компьютерное моделирование выполнено как при наличии шумов в измерениях, так и в их отсутствие. Путем компьютерного моделирования проведен сравнительный анализ предлагаемого подхода с полученными ранее методами, и показано, что представленное решение обеспечивает существенное повышение точности идентификации неизвестной частоты при наличии шумов

Рассмотрена задача маршрутизации транспорта с ограничениями по временным окнам. Требовалось составить план доставки товара клиентам, построив маршруты движения идентичных транспортных средств так, чтобы общая длина пройденного пути была минимальной. Для решения задачи разработан гибридный алгоритм. Он состоит из методов построения исходных решений, муравьиного алгоритма и локального поиска. В муравьином алгоритме в процессе формирования маршрутов разрешается нарушение временных ограничений при условии добавления штрафа в целевую функцию. Предложенный метод показал высокую эффективность при решении задач кластерного типа и задач с долгосрочным горизонтом планирования., The purpose of this paper is to improve the performance of a hybrid method based on ant colony optimization (ACO) that finds approximate solutions of the vehicle routing problem with time windows (VRPTW). In order to solve this problem it is required to design a plan for goods delivery to the customers generating the routes of identical vehicles so that the total travelled distance is minimal. For the VRPTW solving, the hybrid method is developed in which a usage of trial solutions makes it possible to explore the most promising parts of the search space. The initial methods for solution construction, an ant colony optimization (ACO) algorithm and local search are proposed in the framework of the hybrid method. In the ACO algorithm, when generating the routes, it is allowed to violate the time window constraints. A method to restore the feasibility of solutions is implemented within the relaxation scheme under “returns in time” principle. Numerical results for solving all problems with 25, 50 and 100 customers from the Solomon test set are obtained. We provide the results on the time and deviation of the solution of these problems in comparison with the results of other authors. Some problems and their classes were solved much faster by the algorithm proposed in this paper. Relative deviations from optimal values of the objective function for the most complex tasks decrease with increasing decision time. The proposed approach can be considered to be an additional or an alternative algorithm for solving the cluster type and the long-term planning horizon problems of the VRPTW., №5(23) (2018)

The paper describes a distributed algorithm and a structure of the software package for its implementation in which a program for computing the vehicle launch dynamics under interaction with the medium flow is complemented with a program to determine the unsteady hydrodynamic loads by the vortex element method.A distinctive feature of the developed system is that its local (running on a single computing core) LEAVING program to calculate the launch dynamics runs together with concurrent (running on multiple computing cores) MDVDD program to compute the unsteady vortex flow and hydrodynamic loads. The LEAVING program is the main one. It is launched app and then runs the MDVDD program in concurrent mode on the specified number of cores. Using MPI technology allows you to use a multiprocessor PC or a local network of multiple PCs to perform calculations. The equations of launcher spring-mass model dynamics and equations of vortex elements parameters evolution are integrated with the same time step. The interprogram communiaction in the step is provided asynchronously using the OS Windows Event mechanism (Events). Interfacing between LEAVING and MDVDD programs is built using the OS Windows FileMapping technology, which allows a specified data structure to be displayed and read to the fixed memory area.The paper provides analysis of acceleration achieved with parallel processing on different numbers of cores, and defines a parallelization degree of various operations. It shows that the parallelization efficiency of the developed algorithm is slower than in case of calculation of the rigid body flow. The causes of reduced efficiency are discussed.It is shown that the developed algorithm can be effectively used to solve problems on a small number of cores, e.g. on PC based on one or two quad-core processors.

To build mathematical models of actuating mechanisms (AM) of robots with linear kinematic structure, J. Denavit and R.S. Hartenberg (D-H) proposed to use a special coordinate system (CS). It uses a matrix of homogeneous transformation and provides clear and unambiguous rules to build mathematical models of robot actuating mechanisms. Developers widely use this approach because of its clarity and binding to AM design parameters. However, its use to describe robots the AM of which has a spatial tree-like kinematic structure revealed the certain hardship.The paper offers a method for building a modified D-H coordinate system. Its using allows to create mathematical models of robot AM, having spatial kinematic structure. The method is based on using both the graphs theory and the known D-H coordinate system jointly.The paper defines concepts of main and auxiliary coordinate systems and the order of their location on the tree-like AM. The values of the modified parameters of D-H are obtained. There its known parameters are complemented by parameters f(i), which determine the father number of the link i, and ns(i), that shows, which son in succession is the link i for the link f(i). An algorithm to form the matrix of reachability and the graph of reachability of the tree-like AM is proposed.It is proved that the use of the modified D-H coordinate system allows us to record in a block-matrix form both kinematic and dynamic equations for all links of the tree-like AM of robot. The use of these equations together with D'Alembert principle allowed us to write the equations of the tree-like AM dynamics of robot in the form traditional for recording the AM dynamics equations with open kinematic structure.Via examples of mathematically described kinematics and dynamics of tree-like AM of specific robots (robot-dog, robot-crab, anthropomorphic walking robot, etc.) the paper shows efficiency of modified D-H coordinate system.Obtained research results of the medical robot AM have shown that the proposed model can be successfully used to describe robots with linear open kinematic structure, which is a special case of tree-like kinematic one.

Шинкарев Александр Андреевич, инженер-программист, ООО «741 Студиос.ру», г. Екатеринбург; sania.kill@mail.ru. A.A. Shinkarev, sania.kill@mail.ru “741 Studios.ru” LLC, Ekaterinburg, Russian Federation This paper describes continuation of the authors’ work in the field of traffic flow mathematical models based on the cellular automata theory. The refactored representation of the multifactorial traffic flow model based on the cellular automata theory is used for a representation of an adaptive deceleration step implementation. The adaptive deceleration step in the case of a leader deceleration allows slowing down smoothly but not instantly. Concepts of the number of time steps without conflicts and deceleration aggressiveness coefficient are introduced. Also in this paper a new step type for models based on the cellular automata is formulated on the example of a stop signal. The new step type unites notification and signalization steps. The new step type extends the concept of the three-stepped unified representation of the traffic flow models based on the cellular automata that was formulated in the previous authors’ work. Рассмотрено продолжение работы автора в области математических моделей транспортных потоков на основе теории клеточных автоматов. На примере переработанного представления многофакторной модели транспортных потоков на основе теории клеточных автоматов представлена реализация шага адаптивного торможения, который в случае торможения впереди едущего транспортного средства позволяет снижать скорость плавно, а не мгновенно. Введены понятия количества тактов без конфликта и коэффициента агрессивности торможения. Также в статье на примере стоп-сигнала сформулирован новый тип шагов для моделей на основе клеточного автомата, который объединяет шаги оповещения и сигнализации. Новый тип шагов расширяет концепцию трёхступенчатого унифицированного представления математических моделей транспортных потоков на основе клеточного автомата, которая была сформулирована в предыдущей работе автора.

Error detection codes are mechanisms that enable robust delivery of data in unreliable communication channels and devices. Unreliable channels and devices are error-prone objects. Respectively, error detection codes allow detecting such errors. There are two classes of error detecting codes - classical codes and security-oriented codes. The classical codes have high percentage of detected errors; however, they have a high probability to miss an error in algebraic manipulation. In order, security-oriented codes are codes with a small Hamming distance and high protection to algebraic manipulation. The probability of error masking is a fundamental parameter of security-oriented codes. A detailed study of this parameter allows analyzing the behavior of the error-correcting code in the case of error injection in the encoding device. In order, the complexity of the encoding function plays an important role in the security-oriented codes. Encoding functions with less computational complexity and a low probability of masking are the best protection of encoding device against malicious acts. This paper investigates the influence of encoding function complexity on the error masking probability distribution. It will be shownthat the more complex encoding function reduces the maximum of error masking probability. It is also shown in the paper that increasing of the function complexity changes the error masking probability distribution. In particular, increasing of computational complexity decreases the difference between the maximum and average value of the error masking probability. Our resultshave shown that functions with greater complexity have smoothed maximums of error masking probability, which significantly complicates the analysis of error-correcting code by attacker. As a result, in case of complex encoding function the probability of the algebraic manipulation is reduced. The paper discusses an approach how to measure the error masking probability in the case of nonuniform distribution of the input code words. This approach can also be used to study the characteristics of security-oriented codes in case of strong and weak models of algebraic manipulation.

Introduction. With the development of digital technology more attention is paid to making radio-receiving tracks based on SDR technology (Software Defined Radio), which is based on the processing of digitalized radio-frequency signals exclusively by means of software in real time. Moreover the construction ofdata-acquisition systems on one integral chip (SoC) is widely used right now. The main fundamental basis of SoC systems is the FieldProgrammable Gate Array (FPGA). One important step of receiving of radio-frequency signals is a digital down conversion, followed by filtration and repeated decimation. Since processing in DDC is made in a fixed calculation format, than before the immediate implementation of this structure on FPGA, it is necessary to analyze the effect offixed calculation bits on the quality of signal processing. Later it can be used to choose DDC internal calculation bits without sacrificing the set quality of signal processing and hardware resources on its implementation. In the well-known papers, analysis of the effect of signal quantization is reduced to two methods: deterministic and probability methods. Deterministic method gives the top-ofthe-line evaluation of quantizing noise at the output of digital system. Probability method is based on evaluation of quantizing noise dispersion at the output of the device. Evaluation of the signal and the quantization noise in the SDDC based on their PSD. In this section, mathematical expressions were obtained for the construction of PSD signal and the quantizing noise at the output of each of the subsystems of the digital DDC. Criterion for selecting SDDC bit is the relative level of PSD quantizing noise at the output of the digital system. Since the ADC is fixed, the choice of bit computing in SDDC should be such that the total quantizing noise in SDDC would not exceed the ADC quantizing noise at the output of the digital system. Example calculation and construction of PSD signal and quantization noise in Matlab for reception QPSK-signal. In this part of the article an example of the analysis of DDC structure for receiving QPSK- signal was considered. Mathematical Matlab's model has been developed which allows to calculate the PSD of the signal and the quantization noise depending on the internal structure of the SDDC bit based on the formulas of section 2 this paper. These expressions make it possible to construct a PSD noise separately from each SDDC source output, and separately estimate the contribution of each source of quantizing noise to the total noise at the output of the digital system. From these results a decision on the choice of a particular quantization step that depends on the selected calculating bit at each stage of processing was made. Conclusions. Quantizing noise dispersion is not an adequate quality evaluation of processing in multi-stage and multi-rate systems, which include software DDC under review. In such systems the sequential changes of the line, as well as the nature of the spectrum of interfering components, including quantization noise, happen. Therefore in this paper I propose a different approach based on the calculation of the power spectral density (PSD) of the quantizing noise at the output of the device, taking into account the filtering effect of all of its stages and repeated decimation., В данной работе предложен метод анализа влияния шумов квантования на обработку сигнала в цифровом DDC, который основанный на вычислении спектральной плотности мощности (СПМ) шумов квантования по выходу устройства с учетом фильтрующего действия всех его каскадов и многократной децимации. В работе были получены математические выражения для нахождения СПМ сигнала и шумов квантования на выходе каждой из подсистем цифрового DDC. Данные выражения дают возможность выбрать внутренние разрядности вычислений в SDDC таким образом, чтобы суммарный шум квантования в данном устройстве не превышал бы шум квантования АЦП на выходе ЦС. В среде Matlab приведен пример анализа DDC для приема QPSK сигнала., В даній роботі запропоновано метод аналізу впливу шумів квантування на обробку сигналу в цифровому DDC, який ґрунтується на обчисленні спектральної щільності потужності (СЩП) шумів квантування на виході пристрою з урахуванням фільтруючої дії всіх його каскадів і багаторазової децимації. У роботі були отримані математичні вирази для знаходження СЩП сигналу і шумів квантування на виході кожної з підсистем цифрового DDC. Дані вирази дають можливість вибрати внутрішні розрядності обчислень в SDDC таким чином, щоб сумарний шум квантування в цьому пристрої не перевищував би шум квантування АЦП на виході ЦС. У середовищі Matlab наведено приклад аналізу DDC для прийому QPSK сигналу.

The paper considers a digital image processing method that provides efficient transmission, redistribution and storage of aerospace environmental monitoring videographic information. The requirement to increase the monitoring efficiency, if necessary, to carry out regular monitoring of changes in the image field of the observed object is especially relevant when describing spatially aligned sets of images obtained after multi-zone, multi-time and multi-polarization shooting. In many remote sensing applications, the processing efficiency reflects the degree of reduction in the volume of transmitted, described, analyzed and stored videographic information. The computational processing of digital images based on the coordinate survey scheme is presented. The method can be used to perform the procedure for decoding images in order to solve the problem of classifying objects of interest, analyzing images. Such characteristics of binary objects as a spatial boundary and a contour were used as deciphering signs. These features make it possible to describe the shape of an object, its geometric parameters and search for images with specific spatial structures. The processing method is realized by executing efficient algorithms for coding an image on a discrete grid by means of a chain code and spectral coding based on the fast discrete Hartley transform. The result of processing comes down to minimizing the number of such basic computational operations as multiplication, addition, transferring, as well as reducing the time and capacitive complexity of the program, and reducing the redundancy of the initial data. An example of an effective representation and description of a segmented image of an object is given. The proposed method makes it possible to expand the technical capabilities of more efficient transmission and processing of images for solving problems in the field of remote sensing.

Introduction. In all types of digital communication, error control coding techniques are used. Many digital communication standards, such as Wi-Fi and 5G, use low density parity check (LDPC) codes. These codes are popular because they provide building encoders and decoders with low computational complexity. This work objective is to increase the error correcting capability of the well-known bit-flipping decoder (BF) of LDPC-codes. For this purpose, a modification of the decoder is built, which enables to dynamically control one of its main parameters whose choice affects significantly the quality of decoding. Materials and Methods. The well-known bit-flipping decoder of binary LDPC-codes is considered. This decoder has several parameters that are not rigidly bound with the code parameters. The dependence of the decoding quality on the selection of the output parameters of the bit-flipping decoder was investigated through simulation modeling. It is shown that the decoding results in this case are significantly affected by the input parameter of the decoder — threshold T. A modification of the BF-decoder of binary LDPC-codes has been developed, in which it is proposed to set the threshold dynamically during the execution of the algorithm depending on the error rate. A comparative analysis of the error- correcting capability of decoders is carried out by the simulation modeling method. Results. A lemma on the maximum value of the decoder threshold T is formulated and proved. Upper bounds for the number of operations are found for the original and modified decoders. A simulation model that implements a digital noise-immune communication channel has been built. In the model, the initial data is encoded with a given LDPC-code, then it is made noisy by additive uniformly distributed errors, and thereafter, it is decoded in turn by the bit-flipping algorithm with different threshold T parameters, as well as by a modified decoder. Based on the input and output data, the correction capacity of the decoders used is estimated. Experiments have shown that the error-correcting capability of the modified decoder in the range of the real error rate is higher than that of the original decoder, regardless of the selection of its parameters. Discussion and Conclusions. The lemma, proved in the paper, sets the upper bound on the threshold value in the original decoder, which simplifies its adjustment. The developed modification of the decoder has a better error- correcting capability compared to the original decoder. Nevertheless, the complexity of the modification is slightly increased compared to the original algorithm. It has been pointed out that the decoding quality of a modified decoder develops with a decrease in the number of cycles in the Tanner graph and an increase in the length of the code.

Theaimof the article is to clarify the basics of the digitalization strategy of the competitive businesses and identify features of the institutional environment that ensure the development of cryptocurrency as a new asset (IT product) of the modern economy, analyze the methods of implementing the cryptocurrency business models. Therelevanceof the research paper is determined by the need to develop a competitive Russian cryptocurrency (including the cryptoruble) with the growing private, state and cross-national cryptocurrencies. Thescientific noveltyof the study implies clarifying the informal and formal rules of the institutional environment and related methods ensuring the development of a competitive cryptocurrency. The authors consider the followingmethodsto implement the institutional features of the cryptocurrencies business model development: logic and blockchain algorithm that establish trust and collaboration between cryptocurrency developers; logic and blockchain consensus algorithm ensuring that all the parties of the blockchain network come to a common agreement (consensus); logic and blockchain algorithms that form cryptocurrency transactions and control its turnover by generating blocks of cryptocurrencies, by forming the structure of blocks and transactions of cryptocurrencies, by storing cryptocurrencies’ keys and providing security, by mining (forging) cryptocurrency, etс.Theresultsof the study provide a basis for identifying the institutional features and the corresponding methods providing a competitive cryptocurrency development with a detailed analysis of the blockchain consensus algorithms that ensure the competitiveness of the cryptocurrency. Theconclusionsshow that the most promising are the hybrid consensus algorithms which may include both the logic of two or more known algorithms and the original logic of a new algorithm. The authorsrecommenddefining the logic of the blockchain consensus algorithm as a priority when developing a cryptocurrency to ensure reliability of the transactions in the blockchain network, thus increasing the competitiveness of the cryptocurrency.

The aim of the work is to comparatively evaluate the sizes of FIFO and LIFO stacks required for image segmentation based on growing regions. The coordinates (y, x) of the pixels that need to be attached to the cultivated area are placed in stacks during the segmentation process. The size of the stack needed to store the coordinates depends on the structure of the image and cannot be determined before segmentation. To avoid stack overflow, its size is determined for maximum load conditions when the image contains a single maximum area. In this case, the stack size is equal to the image size. This approach does not take into account the process of stack unloading and leads to memory overrun. Expressions are obtained in the paper that allow one to increase the accuracy of determining the sizes of FIFO and LIFO stacks necessary for storing the coordinates of adjacent pixels in a segmentation algorithm based on growing regions under maximum load conditions. In this case, the initial position of the region growth point and the direction of the selection of adjacent pixels in the scanning window are taken into account. A comparative assessment of the stack sizes required for image segmentation showed that using the FIFO stack is preferable to the LIFO stack and leads to significant memory savings.

Introduction. A hardware basis of modern Advanced Driver Assistance Systems (ADAS) consists of millimeterrange radars, characterized by a relatively short range (meters – tens of meters). At the same time, improving of traffic safety requires to increase the range at least to several hundred meters. The one way to achieve such values is to increase wavelength of a probing signal, to use the centimeter range of wavelengths, for example. The paper represents a detailed description of main steps of signal processing algorithm in the model of the ADAS low-power centimeter range radar, which provides fast-moving objects speed and range definition.Aim. Development of an algorithm for estimating the range and the speed of targets by an autocorrelation radar with a wide-band continuous linear frequency modulation (linear FM) signal in order to increase the rate of the ADAS system estimates formation.Materials and methods. The proposed algorithm is based on the methods of primary and secondary digital processing of radar signals. The model of a centimeter-range autocorrelation radar with a broadband continuous linear FM probing signal was used for practical researches. MATLAB software was used to process the received signal samples.Results. The algorithm has been developed to determine the speed and the range of fast-moving objects in conditions when their movement during the evaluation interval significantly exceeds the radar range resolution. The use of simplified Kalman filtering for inter-period secondary signal processing allowed to increase significantly the stability of the algorithm. In a full-scale experiment using the low-power radar model with continuous radiation of the centimeter range, it was shown that a stable assessment of a real car speed and range was provided at a distance of at least about one kilometer.Conclusion. The results of the field experiment make it possible to draw conclusions that the proposed algorithm is highly robust even in the absence of inter-period secondary processing. Its usage allows one to improve the stability of the algorithm without considerable additional computational costs. It is possible because near-linear dynamics of the observation object and of the radar carrier makes it sufficient to use a simplified implementation of Kalman filter in the form α-β-algorithm.

This paper considers the problem of memory allocation for the organization of the LIFO-stack in the algorithm for image segmentation based on growing regions is considered. Segmentation divides the image into regions with identical or similar properties and is the most demanding process for the capacity of RAM. The cultivation of areas begins with the neighborhoods of pre-selected initial growth pixels and uses stacks to store the coordinates of adjacent pixels attached to the cultivated region. Stack loading is maximized when the segment size matches the size of the YX image. In the absence of an expression for the exact determination of the size of the stack, it is possible to guarantee the stable operation of the algorithm for growing regions, eliminating the overflow of the memory allocated for processing if the stack size is assumed equal to YX. However, this approach does not take into account the fact that filling the coordinate stacks is also accompanied by a selection of them, which makesthe stack size always smaller than YX. The article proposes an expression that allows one to increase the accuracy of determining the required size of the LIFO-stack for storing the coordinates of adjacent pixels depending on the image size. The expression takes into account the conditions of the maximum load of the LIFO-stack when: a) the segmentation of the square region with the initial growth pixel in the corner of this region is carried out; b) in the scan window, adjacent pixels are always selected in order with the first selectable pixel located in the corner of the scan window. Using the proposed expression to calculate the required capacity of the LIFO-stack under conditions of its maximum load in the image segmentation algorithm based on growing regions provides a 2-fold reduction in the number of LIFO-stack memory cells.

The paper contains a new text searching method representing modification of the Boyer-Moore algorithm and enabling a user to find the places in the text where the given substring occurs maybe with possible errors, that is the string in text and a query may not coincide but nevertheless are identical. The idea consists in division of the searching process in two phases: at the first phase a fuzzy variant of the Boyer–Moore algorithm is performed; at the second phase the Dice metrics is used. The advantage of suggested technique in comparison with the known methods using the fixed value of the mistakes number is that it 1) does not perform precomputation of the auxiliary table of the sizes comparable to the original text sizes and 2) it more flexibly catches the semantics of the erroneous text substrings even for a big number of mistakes. This circumstance extends possibilities of the Boyer–Moore method by addmitting a bigger amount of possible mistakes in text and preserving text semantics. The suggested method provides also more accurate regulation of the upper boundary for the text mistakes which differs it from the known methods with fixed value of the maximum number of mistakes not depending on the text sizes. Moreover, this upper boundary is defined as Levenshtein distance not suitable for evaluating a relevance of the founded text and a query, while the Dice metrics provides such a relevance. In fact, if maximum Levenshtein distanse is 3 then how one can judge if this value is big or small to provide relevance of the search results. Consequently, the suggested method is more flexible, enables one to find relevant answers even in case of a big number of mistakes in text. The efficiency of the suggested method in the worst case is O(nc) with constant c defining the biggest allowable number of mistakes.

The active development of the mobile platforms sector such as smartphones, smart watches, fitness bracelets and other wearable electronic devices in the last 4 years has caused a huge growth of the market of mobile applications-services. Western countries are actively implementing mobile applications-services for household energy users. In Belarus, there is a positive dynamics in the number of active users of applications-services, every year it is possible to attract 7 % of unique customers. In the present paper the experience of implementation and operation of the mobile application for power systems is analyzed. The dynamics of the market of mobile applications-services has been traced: the amount of time spent by the person in interaction with the device was determined as well as the total expenditure of funds in the application at the moment; also, the growth of expenses within the applications was forecasted. The potential benefits for business and end-users of services from the implementation of mobile applications-services were demonstrated. Their properties, main qualities and advantages over traditional methods of “business – client” interaction are considered. A number of features needed for the successful functioning of the mobile application in the power system of Belarus are identified. The process of creating software for smart devices has been studied and the functionality needed by the mobile application for the power system has been proposed for attracting new users. A special algorithm for the launch and successful “life cycle” of a mobile application has been proposed. It allows to operate and develop mobile applications-services as efficiently as possible, as well as to avoid the most common errors at the stages of their development and launch. The implementation of a mobile application in the power system of the Republic of Belarus, in the long-term, will significantly increase customer loyalty, simplify interaction with users, make it possible to build new models of distribution of electricity, and, consequently, regulate the demand for energy resources.

Load profile alignment based on optimal power consumption management is considered to be one of the main ways to ensure efficient operation of energy systems in the short-term planning. Alignment load profile with a view to reducing costs can be implemented with the aid of consumers’ involvement by administrative and economic measures. Administrative measures are associated with the forced restriction of consumer loads in certain intervals of the planning period. On one hand, these measures provide benefits to the power system by alignment load profile, and on the other hand, they cause detriment to consumers. Ultimately, in some cases, for the whole power system, the detriment may be greater than the benefits. Therefore, it is advisable to use administrative measures in conditions of shortage of power and electricity in the power system. Optimal planning of short-term regimes of power systems according to rigid load profile received after alignment can be carried out by traditional methods. The solution of such a problem ought to be initially carried out under conditions of non-rigid load profile resulting from the directive use of administrative and economic measures carried out with the help of specially developed models. In this regard, the paper proposes a mathematical model of the problem of optimizing load profile of regulated electricity consumers to be used for optimal planning of shortterm power system modes, an algorithm for optimal planning of a short-term power system mode with optimizing load profile of regulated power consumers. Also, algorithms are proposed for accounting for simple and functional constraints in the form of equalities and inequalities when optimizing load profile. The effectiveness of the described algorithm for optimizing the short-term mode of the power system, taking into account the optimal load control of adjustable electricity consumers, has been studied using the example of optimal coverage of the load profile of power system, which contains two consumers with adjustable load profile, and two TPPs. Based on the calculated-and-experimental studies, it was determined that the proposed mathematical model of the problem is adequate, while the developed algorithms for optimal planning of short-term power system modes with optimization of load profile of regulated electricity consumers and taking into account various types of limitations are of high computational qualities.