All issues

The paper considers the process of flow formation in an outflow of a binary gas mixture through a thin slit into vacuum. An approach to modeling the flows of rarefied gas mixtures in the transient regime is proposed based on the direct solution of the Boltzmann kinetic equation, in which the conservative projection method is used to calculate the collision integrals. Calculation formulas are provided; the calculation procedure is described in detail in relation to the flow of a binary gas mixture. The Lennard–Jones potential is used as an interaction potential of molecules. A software modeling environment has been developed that makes it possible to study the flows of gas mixtures in a transitional regime on systems of cluster architecture. Due to the use of code parallelization technologies, an acceleration of calculations by 50–100 times was obtained. Numerical simulation of a two-dimensional outflow of a binary argon-neon gas mixture from a vessel into vacuum through a thin slit is carried out for various values of the Knudsen number. The graphs of the dependence of gas mixture components output flow on time in the process of establishing the flow are obtained. Non-stationary regions of strong separation of gas mixture components, in which the molecular densities ratio reaches 10 or more, were discovered. The discovered effect can have applications in the problem of gas mixtures separation.

The paper proposes a mathematical model for the therapy of glioma, taking into account the blood-brain barrier, radiotherapy and antibody therapy. The parameters were estimated from experimental data and the evaluation of the effect of parameter values on the effectiveness of treatment and the prognosis of the disease were obtained. The possible variants of sequential use of radiotherapy and the effect of antibodies have been explored. The combined use of radiotherapy with intravenous administration of $mab$ $Cx43$ leads to a potentiation of the therapeutic effect in glioma.

Radiotherapy must precede chemotherapy, as radio exposure reduces the barrier function of endothelial cells. Endothelial cells of the brain vessels fit tightly to each other. Between their walls are formed so-called tight contacts, whose role in the provision of BBB is that they prevent the penetration into the brain tissue of various undesirable substances from the bloodstream. Dense contacts between endothelial cells block the intercellular passive transport.

The mathematical model consists of a continuous part and a discrete one. Experimental data on the volume of glioma show the following interesting dynamics: after cessation of radio exposure, tumor growth does not resume immediately, but there is some time interval during which glioma does not grow. Glioma cells are divided into two groups. The first group is living cells that divide as fast as possible. The second group is cells affected by radiation. As a measure of the health of the blood-brain barrier system, the ratios of the number of BBB cells at the current moment to the number of cells at rest, that is, on average healthy state, are chosen.

The continuous part of the model includes a description of the division of both types of glioma cells, the recovery of BBB cells, and the dynamics of the drug. Reducing the number of well-functioning BBB cells facilitates the penetration of the drug to brain cells, that is, enhances the action of the drug. At the same time, the rate of division of glioma cells does not increase, since it is limited not by the deficiency of nutrients available to cells, but by the internal mechanisms of the cell. The discrete part of the mathematical model includes the operator of radio interaction, which is applied to the indicator of BBB and to glial cells.

Within the framework of the mathematical model of treatment of a cancer tumor (glioma), the problem of optimal control with phase constraints is solved. The patient’s condition is described by two variables: the volume of the tumor and the condition of the BBB. The phase constraints delineate a certain area in the space of these indicators, which we call the survival area. Our task is to find such treatment strategies that minimize the time of treatment, maximize the patient’s rest time, and at the same time allow state indicators not to exceed the permitted limits. Since the task of survival is to maximize the patient’s lifespan, it is precisely such treatment strategies that return the indicators to their original position (and we see periodic trajectories on the graphs). Periodic trajectories indicate that the deadly disease is translated into a chronic one.

The short-term prediction of road traffic condition is one of the main tasks of transportation modelling. The main purpose of which are traffic control, reporting of accidents, avoiding traffic jams due to knowledge of traffic flow and subsequent transportation planning. A number of solutions exist — both model-driven and data driven had proven to be successful in capturing the dynamics of traffic flow. Nevertheless, most space-time models suffer from high mathematical complexity and low efficiency. Artificial Neural Networks, one of the prominent datadriven approaches, show promising performance in modelling the complexity of traffic flow. We present a neural network architecture for traffic flow prediction on a real-world road network graph. The model is based on the combination of a recurrent neural network and graph convolutional neural network. Where a recurrent neural network is used to model temporal dependencies, and a convolutional neural network is responsible for extracting spatial features from traffic. To make multiple few steps ahead predictions, the encoder-decoder architecture is used, which allows to reduce noise propagation due to inexact predictions. To model the complexity of traffic flow, we employ multilayered architecture. Deeper neural networks are more difficult to train. To speed up the training process, we use skip-connections between each layer, so that each layer teaches only the residual function with respect to the previous layer outputs. The resulting neural network was trained on raw data from traffic flow detectors from the US highway system with a resolution of 5 minutes. 3 metrics: mean absolute error, mean relative error, mean-square error were used to estimate the quality of the prediction. It was found that for all metrics the proposed model achieved lower prediction error than previously published models, such as Vector Auto Regression, LSTM and Graph Convolution GRU.

The reconstruction of charged particle trajectories in tracking detectors is a key problem in the analysis of experimental data for high energy and nuclear physics.

The amount of data in modern experiments is so large that classical tracking methods such as Kalman filter can not process them fast enough. To solve this problem, we have developed two neural network algorithms of track recognition, based on deep learning architectures, for local (track by track) and global (all tracks in an event) tracking in the GEM tracker of the BM@N experiment at JINR (Dubna). The advantage of deep neural networks is the ability to detect hidden nonlinear dependencies in data and the capability of parallel execution of underlying linear algebra operations.

In this work we generalize these algorithms to the cylindrical GEM inner tracker of BESIII experiment. The neural network model RDGraphNet for global track finding, based on the reverse directed graph, has been successfully adapted. After training on Monte Carlo data, testing showed encouraging results: recall of 98% and precision of 86% for track finding.

The local neural network model TrackNETv2 was also adapted to BESIII CGEM successfully. Since the tracker has only three detecting layers, an additional neuro-classifier to filter out false tracks have been introduced. Preliminary tests demonstrated the recall value at the first stage of 99%. After applying the neuro-classifier, the precision was 77% with a slight decrease of the recall to 94%. This result can be improved after the further model optimization.

Since 1950s the field of city transport modelling has progressed rapidly. The first equilibrium distribution models of traffic flow appeared. The most popular model (which is still being widely used) was the Beckmann model, based on the two Wardrop principles. The core of the model could be briefly described as the search for the Nash equilibrium in a population demand game, in which losses of agents (drivers) are calculated based on the chosen path and demands of this path with correspondences being fixed. The demands (costs) of a path are calculated as the sum of the demands of different path segments (graph edges), that are included in the path. The costs of an edge (edge travel time) are determined by the amount of traffic on this edge (more traffic means larger travel time). The flow on a graph edge is determined by the sum of flows over all paths passing through the given edge. Thus, the cost of traveling along a path is determined not only by the choice of the path, but also by the paths other drivers have chosen. Thus, it is a standard game theory task. The way cost functions are constructed allows us to narrow the search for equilibrium to solving an optimization problem (game is potential in this case). If the cost functions are monotone and non-decreasing, the optimization problem is convex. Actually, different assumptions about the cost functions form different models. The most popular model is based on the BPR cost function. Such functions are massively used in calculations of real cities. However, in the beginning of the XXI century, Yu. E. Nesterov and A. de Palma showed that Beckmann-type models have serious weak points. Those could be fixed using the stable dynamics model, as it was called by the authors. The search for equilibrium here could be also reduced to an optimization problem, moreover, the problem of linear programming. In 2013, A.V.Gasnikov discovered that the stable dynamics model can be obtained by a passage to the limit in the Beckmann model. However, it was made only for several practically important, but still special cases. Generally, the question if this passage to the limit is possible remains open. In this paper, we provide the justification of the possibility of the above-mentioned passage to the limit in the general case, when the cost function for traveling along the edge as a function of the flow along the edge degenerates into a function equal to fixed costs until the capacity is reached and it is equal to plus infinity when the capacity is exceeded.

Special actions (guerrilla, anti-guerrilla, reconnaissance and sabotage, subversive, counter-terrorist, counter-sabotage, etc.) are organized and conducted by law enforcement and armed forces and are aimed at protecting citizens and ensuring national security. Since the early 2000s, the problems of special actions have attracted the attention of specialists in the field of modeling, sociologists, physicists and representatives of other sciences. This article reviews and characterizes the works in the field of modeling special actions and counterterrorism. The works are classified by modeling methods (descriptive, optimization and game-theoretic), by types and stages of actions, and by phases of management (preparation and conduct of activities). The second section presents a classification of methods and models for special actions and counterterrorism, and gives a brief overview of descriptive models. The method of geographic profiling, network games, models of dynamics of special actions, the function of victory in combat and special actions (the dependence of the probability of victory on the correlation of forces and means of the parties) are considered. The third section considers the “attacker – defender” game and its extensions: the Stackelberg game and the Stackelberg security game, as well as issues of their application in security tasks In the “attacker – defender” game and security games, known works are classified on the following grounds: the sequence of moves, the number of players and their target functions, the time horizon of the game, the degree of rationality of the players and their attitude to risk, the degree of awareness of the players. The fourth section is devoted to the description of patrolling games on a graph with discrete time and simultaneous choice by the parties of their actions (Nash equilibrium is computed to find optimal strategies). The fifth section deals with game-theoretic models of transportation security as applications of Stackelberg security games. The last section is devoted to the review and characterization of a number of models of border security in two phases of management: preparation and conduct of activities. An example of effective interaction between Coast Guard units and university researchers is considered. Promising directions for further research are the following: first, modeling of counter-terrorist and special operations to neutralize terrorist and sabotage groups with the involvement of multidepartmental and heterogeneous forces and means, second, complexification of models by levels and stages of activity cycles, third, development of game-theoretic models of combating maritime terrorism and piracy.

Despite numerous achievements of modern science the problem of lightning initiation in an electrodeless thundercloud, the maximum electric field strength inside which is approximately an order of magnitude lower than the dielectric strength of air, remains unsolved. Although there is no doubt that discharge activity begins with the appearance of positive streamers, which can develop under approximately half the threshold electric field as compared to negative ones, it remains unexplored how cold weakly conducting streamer systems unite in a joint hot well-conducting leader channel capable of self-propagation due to effective polarization in a relatively small external field. In this study, we present a self-organizing transport model which is applied to the case of electric discharge tree formation in a thundercloud. So, the model is aimed at numerical simulation of the initial stage of lightning discharge development. Among the innovative features of the model are the absence of grid spacing, high spatiotemporal resolution, and consideration of temporal evolution of electrical parameters of transport channels. The model takes into account the widely known asymmetry between threshold fields needed for positive and negative streamers development. In our model, the resulting well-conducting leader channel forms due to collective effect of combining the currents of tens of thousands of interacting streamer channels each of which initially has negligible conductivity and temperature that does not differ from the ambient one. The model bipolar tree is a directed graph (it has both positive and negative parts). It has morphological and electrodynamic characteristics which are intermediate between laboratory long spark and developed lightning. The model has universal character which allows to use it in other tasks related to the study of transport (in the broad sense of the word) networks.

In this article we propose a new approach to the analysis of econometric industry parameters for the industry consolidation level. The research is based on the simple industry automatic control model. The state of the industry is measured by quarterly obtained econometric parameters from each industry’s company provided by the tax control regulator. An approach to analysis of the industry, which does not provide for tracking the economy of each company, but explores the parameters of the set of all companies as a whole, is proposed. Quarterly obtained econometric parameters from each industry’s company are Income, Quantity of employers, Taxes, and Income from Software Licenses. The ABC analysis method was modified by ABCD analysis (D — companies with zero-level impact to industry metrics) and used to make the results obtained for different indicators comparable. Pareto charts were formed for the set of econometric indicators.

To estimate the industry monopolization, the Herfindahl – Hirschman index was calculated for the most sensitive companies metrics. Using the HHI approach, it was proved that COVID-19 does not lead to changes in the monopolization of the Russian IT industry.

As the most visually obvious approach to the industry visualization, scattering diagrams in combination with the Pareto graph colors were proposed. The affect of the accreditation procedure is clearly observed by scattering diagram in combination with red/black dots for accredited and nonaccredited companies respectively.

The last reported result is the proposal to use the Licenses End-to-End Product Identification as the market structure control instrument. It is the basis to avoid the multiple accounting of the licenses reselling within the chain of software distribution.

The results of research could be the basis for future IT industry analysis and simulation on the agent based approach.

Finding PageRank vector is of great scientific and practical interest due to its applicability to modern search engines. Despite the fact that this problem is reduced to finding the eigenvector of the stochastic matrix $P$, the need for new algorithms is justified by a large size of the input data. To achieve no more than linear execution time, various randomized methods have been proposed, returning the expected result only with some probability close enough to one. We will consider two of them by reducing the problem of calculating the PageRank vector to the problem of finding equilibrium in an antagonistic matrix game, which is then solved using the Grigoriadis – Khachiyan algorithm. This implementation works effectively under the assumption of sparsity of the input matrix. As far as we know, there are no successful implementations of neither the Grigoriadis – Khachiyan algorithm nor its application to the task of calculating the PageRank vector. The purpose of this paper is to fill this gap. The article describes an algorithm giving pseudocode and some details of the implementation. In addition, it discusses another randomized method of calculating the PageRank vector, namely, Markov chain Monte Carlo (MCMC), in order to compare the results of these algorithms on matrices with different values of the spectral gap. The latter is of particular interest, since the magnitude of the spectral gap strongly affects the convergence rate of MCMC and does not affect the other two approaches at all. The comparison was carried out on two types of generated graphs: chains and $d$-dimensional cubes. The experiments, as predicted by the theory, demonstrated the effectiveness of the Grigoriadis – Khachiyan algorithm in comparison with MCMC for sparse graphs with a small spectral gap value. The written code is publicly available, so everyone can reproduce the results themselves or use this implementation for their own needs. The work has a purely practical orientation, no theoretical results were obtained.

This article is devoted to the development of an algorithm for trajectory control of a highly maneuverable four-wheeled robotic transport platform equipped with mecanum wheels, in order to organize its movement behind some moving object. The calculation of the kinematic ratios of this platform in a fixed coordinate system is presented, which is necessary to determine the angular velocities of the robot wheels depending on a given velocity vector. An algorithm has been developed for the robot to follow a mobile object on a plane without obstacles based on the use of a modified chase method using different types of control functions. The chase method consists in the fact that the velocity vector of the geometric center of the platform is co-directed with the vector connecting the geometric center of the platform and the moving object. Two types of control functions are implemented: piecewise and constant. The piecewise function means control with switching modes depending on the distance from the robot to the target. The main feature of the piecewise function is a smooth change in the robot’s speed. Also, the control functions are divided according to the nature of behavior when the robot approaches the target. When using one of the piecewise functions, the robot’s movement slows down when a certain distance between the robot and the target is reached and stops completely at a critical distance. Another type of behavior when approaching the target is to change the direction of the velocity vector to the opposite, if the distance between the platform and the object is the minimum allowable, which avoids collisions when the target moves in the direction of the robot. This type of behavior when approaching the goal is implemented for a piecewise and constant function. Numerical simulation of the robot control algorithm for various control functions in the task of chasing a target, where the target moves in a circle, is performed. The pseudocode of the control algorithm and control functions is presented. Graphs of the robot’s trajectory when moving behind the target, speed changes, changes in the angular velocities of the wheels from time to time for various control functions are shown.