All issues

This work analyzes the problem of traffic signs recognition in intelligent transport systems. The basic concepts of computer vision and image recognition tasks are considered. The most effective approach for solving the problem of analyzing and recognizing images now is the neural network method. Among all kinds of neural networks, the convolutional neural network has proven itself best. Activation functions such as Relu and SoftMax are used to solve the classification problem when recognizing traffic signs. This article proposes a technology for recognizing traffic signs. The choice of an approach for solving the problem based on a convolutional neural network due to the ability to effectively solve the problem of identifying essential features and classification. The initial data for the neural network model were prepared and a training sample was formed. The Google Colaboratory cloud service with the external libraries for deep learning TensorFlow and Keras was used as a platform for the intelligent system development. The convolutional part of the network is designed to highlight characteristic features in the image. The first layer includes 512 neurons with the Relu activation function. Then there is the Dropout layer, which is used to reduce the effect of overfitting the network. The output fully connected layer includes four neurons, which corresponds to the problem of recognizing four types of traffic signs. An intelligent traffic sign recognition system has been developed and tested. The used convolutional neural network included four stages of convolution and subsampling. Evaluation of the efficiency of the traffic sign recognition system using the three-block cross-validation method showed that the error of the neural network model is minimal, therefore, in most cases, new images will be recognized correctly. In addition, the model has no errors of the first kind, and the error of the second kind has a low value and only when the input image is very noisy.

In this paper, compared fundamentally different turbulence models for calculating a strongly swirling flow in an abrupt expanding pipe. This task is not only of great importance in practice, but also in theoretical terms. Because in such a flow a very complex anisotropic turbulence with recirculation zones arises and the study of the ongoing processes allows us to find an answer to many questions about turbulence. The flow under consideration has been well studied experimentally. Therefore, it is a very complex and interesting test problem for turbulence models. In the paper compared the numerical results of the one-parameter v_t-92 model, the SSG/LRR-RSMw2012 Reynolds stress method and the new two-fluid model. These models are very different from each other. Because the Boussinesq hypothesis is used in the one-parameter v_t-92 model, in the SSG/LRR-RSM-w2012 model, its own equation is written for each stress, and for the new two-fluid model, the basis is a completely different approach to turbulence. A feature of the approach to turbulence for the new two-fluid model is that it allows one to obtain a closed system of equations. Comparison of these models is carried out not only by the correspondence of their results with experimental data, but also by the computational resources expended on the numerical implementation of these models. Therefore, in this work, for all models, the same technique was used to numerically calculate the turbulent swirling flow at the Reynolds number $Re=3\cdot 10^4$ and the swirl parameter $S_w=0.6$. In the paper showed that the new two-fluid model is effective for the study of turbulent flows, because has good accuracy in describing complex anisotropic turbulent flows and is simple enough for numerical implementation.

In this paper we propose high-order (tensor) methods for two types of saddle point problems. Firstly, we consider the classic min-max saddle point problem. Secondly, we consider the search for a stationary point of the saddle point problem objective by its gradient norm minimization. Obviously, the stationary point does not always coincide with the optimal point. However, if we have a linear optimization problem with linear constraints, the algorithm for gradient norm minimization becomes useful. In this case we can reconstruct the solution of the optimization problem of a primal function from the solution of gradient norm minimization of dual function. In this paper we consider both types of problems with no constraints. Additionally, we assume that the objective function is $\mu$-strongly convex by the first argument, $\mu$-strongly concave by the second argument, and that the $p$-th derivative of the objective is Lipschitz-continous.

For min-max problems we propose two algorithms. Since we consider strongly convex a strongly concave problem, the first algorithm uses the existing tensor method for regular convex concave saddle point problems and accelerates it with the restarts technique. The complexity of such an algorithm is linear. If we additionally assume that our objective is first and second order Lipschitz, we can improve its performance even more. To do this, we can switch to another existing algorithm in its area of quadratic convergence. Thus, we get the second algorithm, which has a global linear convergence rate and a local quadratic convergence rate.

Finally, in convex optimization there exists a special methodology to solve gradient norm minimization problems by tensor methods. Its main idea is to use existing (near-)optimal algorithms inside a special framework. I want to emphasize that inside this framework we do not necessarily need the assumptions of strong convexity, because we can regularize the convex objective in a special way to make it strongly convex. In our article we transfer this framework on convex-concave objective functions and use it with our aforementioned algorithm with a global linear convergence and a local quadratic convergence rate.

Since the saddle point problem is a particular case of the monotone variation inequality problem, the proposed methods will also work in solving strongly monotone variational inequality problems.

The paper considers the adequacy of the model developed earlier by the author for the analysis of income inequality and based on an empirically confirmed hypothesis that the relative (to the income of the richest group) income values of 20% population groups in total income can be represented as a finite functional sequence, each member of which depends on one parameter — a specially defined indicator of inequality. It is shown that in addition to the existing methods of inequality analysis, the model makes it possible to estimate with the help of analytical expressions the income shares of 20%, 10% and smaller groups of the population for different levels of inequality, as well as to identify how they change with the growth of inequality, to estimate the level of inequality for known ratios between the incomes of different groups of the population, etc.

The paper provides a more detailed confirmation of the proposed model adequacy in comparison with the previously obtained results of statistical analysis of empirical data on the distribution of income between the 20% and 10% population groups. It is based on the analysis of certain ratios between the values of quintiles and deciles according to the proposed model. The verification of these ratios was carried out using a set of data for a large number of countries and the estimates obtained confirm the sufficiently high accuracy of the model.

Data are presented that confirm the possibility of using the model to analyze the dependence of income distribution by population groups on the level of inequality, as well as to estimate the inequality indicator for income ratios between different groups, including variants when the income of the richest 20% is equal to the income of the poor 60 %, income of the middle class 40% or income of the rest 80% of the population, as well as when the income of the richest 10% is equal to the income of the poor 40 %, 50% or 60%, to the income of various middle class groups, etc., as well as for cases, when the distribution of income obeys harmonic proportions and when the quintiles and deciles corresponding to the middle class reach a maximum. It is shown that the income shares of the richest middle class groups are relatively stable and have a maximum at certain levels of inequality.

The results obtained with the help of the model can be used to determine the standards for developing a policy of gradually increasing the level of progressive taxation in order to move to the level of inequality typical of countries with social oriented economy.

The paper presents a physical and numerical analysis of the dynamics and radiation of explosion products formed during the Russian-American experiment in the ionosphere using an explosive generator based on hexogen (RDX) and trinitrotoluene (TNT). The main attention is paid to the radiation of the perturbed region and the dynamics of the products of explosion (PE). The detailed chemical composition of the explosion products is analyzed and the initial concentrations of the most important molecules capable of emitting in the infrared range of the spectrum are determined, and their radiative constants are given. The initial temperature of the explosion products and the adiabatic exponent are determined. The nature of the interpenetration of atoms and molecules of a highly rarefied ionosphere into a spherically expanding cloud of products is analyzed. An approximate mathematical model of the dynamics of explosion products under conditions of mixing rarefied ionospheric air with them has been developed and the main thermodynamic characteristics of the system have been calculated. It is shown that for a time of 0,3–3 sec there is a significant increase in the temperature of the scattering mixture as a result of its deceleration. In the problem under consideration the explosion products and the background gas are separated by a contact boundary. To solve this two-region gas dynamic problem a numerical algorithm based on the Lagrangian approach was developed. It was necessary to fulfill special conditions at the contact boundary during its movement in a stationary gas. In this case there are certain difficulties in describing the parameters of the explosion products near the contact boundary which is associated with a large difference in the size of the mass cells of the explosion products and the background due to a density difference of 13 orders of magnitude. To reduce the calculation time of this problem an irregular calculation grid was used in the area of explosion products. Calculations were performed with different adiabatic exponents. The most important result is temperature. It is in good agreement with the results obtained by the method that approximately takes into account interpenetration. The time behavior of the IR emission coefficients of active molecules in a wide range of the spectrum is obtained. This behavior is qualitatively consistent with experiments for the IR glow of flying explosion products.

In the last quarter of the twentieth century, the nature of global demographic and economic development began to change rapidly: the continuously accelerating growth of the main characteristics that took place over the previous two hundred years was replaced by a sharp slowdown. In the context of these changes, the role of a long-term forecast of global dynamics is increasing. At the same time, the forecast should be based not on inertial projection of past trends into future periods, but on mathematical modeling of fundamental patterns of historical development. The article presents preliminary results of research on mathematical modeling and forecasting of global demographic and economic dynamics based on this approach. The basic dynamic equations reflecting this dynamics are proposed, the modification of these equations in relation to different historical epochs is justified. For each historical epoch, based on the analysis of the corresponding system of equations, a phase portrait was determined and its features were analyzed. Based on this analysis, conclusions were drawn about the patterns of world development in the period under review.

It is shown that mathematical description of technology development is important for modeling historical dynamics. A method for describing technological dynamics is proposed, on the basis of which the corresponding mathematical equations are proposed.

Three stages of historical development are considered: the stage of agrarian society (before the beginning of the XIX century), the stage of industrial society (XIX–XX centuries) and the modern era. The proposed mathematical model shows that an agrarian society is characterized by cyclical demographic and economic dynamics, while an industrial society is characterized by an increase in demographic and economic characteristics close to hyperbolic.

The results of mathematical modeling have shown that humanity is currently moving to a fundamentally new phase of historical development. There is a slowdown in growth and the transition of human society into a new phase state, the shape of which has not yet been determined. Various options for further development are considered.

This paper proposes the implementation of a coherent transceiver with a constant delay and the ability to select any clock frequency grid used for clocking peripheral DACs and ADCs, tasks of device synchronization and data transmission. The choice of the required clock frequency grid directly affects the data transfer rate in the network, however, it allows one to flexibly configure the network for the tasks of transmitting clock signals and subnanosecond generation of sync signals on all devices in the network. A method for increasing the synchronization accuracy to tenths of nanoseconds by using digital phase detectors and a Phase Locked Loop (PLL) system on the slave device is proposed. The use of high-speed fiber-optic communication lines (FOCL) for synchronization tasks allows simultaneously exchanging control commands and signaling data. To simplify and reduce the cost of devices of a synchronous network of transceivers, it is proposed to use a clock signal restored from a data transmission line to filter phase noise and form a frequency grid in the PLL system for heterodyne signals and clock peripheral devices, including DAC and ADC. The results of multiple synchronization tests in the proposed synchronous network are presented.

Stochastic optimization is a current area of research due to significant advances in machine learning and their applications to everyday problems. In this paper, we consider two fundamentally different methods for solving the problem of stochastic optimization — online and offline algorithms. The corresponding algorithms have their qualitative advantages over each other. So, for offline algorithms, it is required to solve an auxiliary problem with high accuracy. However, this can be done in a distributed manner, and this opens up fundamental possibilities such as, for example, the construction of a dual problem. Despite this, both online and offline algorithms pursue a common goal — solving the stochastic optimization problem with a given accuracy. This is reflected in the comparison of the computational complexity of the described algorithms, which is demonstrated in this paper.

The comparison of the described methods is carried out for two types of stochastic problems — convex optimization and saddles. For problems of stochastic convex optimization, the existing solutions make it possible to compare online and offline algorithms in some detail. In particular, for strongly convex problems, the computational complexity of the algorithms is the same, and the condition of strong convexity can be weakened to the condition of $\gamma$-growth of the objective function. From this point of view, saddle point problems are much less studied. Nevertheless, existing solutions allow us to outline the main directions of research. Thus, significant progress has been made for bilinear saddle point problems using online algorithms. Offline algorithms are represented by just one study. In this paper, this example demonstrates the similarity of both algorithms with convex optimization. The issue of the accuracy of solving the auxiliary problem for saddles was also worked out. On the other hand, the saddle point problem of stochastic optimization generalizes the convex one, that is, it is its logical continuation. This is manifested in the fact that existing results from convex optimization can be transferred to saddles. In this paper, such a transfer is carried out for the results of the online algorithm in the convex case, when the objective function satisfies the $\gamma$-growth condition.

State-of-the-art localization and mapping approaches for augmented (AR) and mixed (MR) reality devices are based on the extraction of local features from the camera. Along with this, modern AR/MR devices allow you to build a three-dimensional mesh of the surrounding space. However, the existing methods do not solve the problem of global device co-localization due to the use of different methods for extracting computer vision features. Using a space map from a 3D mesh, we can solve the problem of collaborative global localization of AR/MR devices. This approach is independent of the type of feature descriptors and localisation and mapping algorithms used onboard the AR/MR device. The mesh can be reduced to a point cloud, which consists of only the vertices of the mesh. We propose an approach for collaborative localization of AR/MR devices using point clouds that are independent of algorithms onboard the device. We have analyzed various point cloud registration algorithms and discussed their limitations for the problem of global co-localization of AR/MR devices indoors.

Certifying a transport airplane for the flights under icing conditions in Russia was carried out within the framework of the requirements of Annex С to the AP-25 Aviation Rules. In force since 2023 to replace AP-25 the new Russian certification document “Airworthiness Standards” (NLG-25) proposes the introduction of Appendix O. A feature of Appendix O is the need to carry out calculations in conditions of high liquid water content and with large water drops (500 microns or more). With such parameters of the dispersed flow, such physical processes as the disruption and splashing of a water film when large drops enter it become decisive. The flow of a dispersed medium under such conditions is essentially polydisperse. This paper describes the modifications of the IceVision technique implemented on the basis of the FlowVision software package for the ice accretion calculations within the framework of Appendix O.

The main difference between the IceVision method and the known approaches is the use of the Volume of fluid (VOF) technology to the shape of ice changes tracking. The external flow around the aircraft is calculated simultaneously with the growth of ice and its heating. Ice is explicitly incorporated in the computational domain; the heat transfer equation is solved in it. Unlike the Lagrangian approaches, the Euler computational grid is not completely rebuilt in the IceVision technique: only the cells containing the contact surface are changed.

The IceVision 2.0 version accounts for stripping the film, as well as bouncing and splashing of falling drops at the surfaces of the aircraft and ice. The diameter of secondary droplets is calculated using known empirical correlations. The speed of the water film flow over the surface is determined taking into account the action of aerodynamic forces, gravity, hydrostatic pressure gradient and surface tension force. The result of taking into account surface tension is the effect of contraction of the film, which leads to the formation of water flows in the form of rivulets and ice deposits in the form of comb-like growths. An energy balance relation is fulfilled on the ice surface that takes into account the energy of falling drops, heat exchange between ice and air, the heat of crystallization, evaporation, sublimation and condensation. The paper presents the results of solving benchmark and model problems, demonstrating the effectiveness of the IceVision technique and the reliability of the obtained results.