All issues

The work continues research on the ability of a person to improve the productivity of information processing, using parallel work or improving the performance of analyzers. A person receives a series of tasks, the solution of which requires the processing of a certain amount of information. The time and the validity of the decision are recorded. The dependence of the average solution time on the amount of information in the problem is determined by correctly solved problems. In accordance with the proposed method, the problems contain calculations of expressions in two algebras, one of which is associative and the other is nonassociative. To facilitate the work of the subjects in the experiment were used figurative graphic images of elements of algebra. Non-associative calculations were implemented in the form of the game “rock-paper-scissors”. It was necessary to determine the winning symbol in the long line of these figures, considering that they appear sequentially from left to right and play with the previous winner symbol. Associative calculations were based on the recognition of drawings from a finite set of simple images. It was necessary to determine which figure from this set in the line is not enough, or to state that all the pictures are present. In each problem there was no more than one picture. Computation in associative algebra allows the parallel counting, and in the absence of associativity only sequential computations are possible. Therefore, the analysis of the time for solving a series of problems reveals a consistent uniform, sequential accelerated and parallel computing strategy. In the experiments it was found that all subjects used a uniform sequential strategy to solve non-associative problems. For the associative task, all subjects used parallel computing, and some have used parallel computing acceleration of the growth of complexity of the task. A small part of the subjects with a high complexity, judging by the evolution of the solution time, supplemented the parallel account with a sequential stage of calculations (possibly to control the solution). We develop a special method for assessing the rate of processing of input information by a person. It allowed us to estimate the level of parallelism of the calculation in the associative task. Parallelism of level from two to three was registered. The characteristic speed of information processing in the sequential case (about one and a half characters per second) is twice less than the typical speed of human image recognition. Apparently the difference in processing time actually spent on the calculation process. For an associative problem in the case of a minimum amount of information, the solution time is near to the non-associativity case or less than twice. This is probably due to the fact that for a small number of characters recognition almost exhausts the calculations for the used non-associative problem.

In this paper, we consider two variants of the concept of sharp minimum for mathematical programming problems with quasiconvex objective function and inequality constraints. It investigated the problem of describing a variant of a simple subgradient method with switching along productive and non-productive steps, for which, on a class of problems with Lipschitz functions, it would be possible to guarantee convergence with the rate of geometric progression to the set of exact solutions or its vicinity. It is important that to implement the proposed method there is no need to know the sharp minimum parameter, which is usually difficult to estimate in practice. To overcome this problem, the authors propose to use a step adjustment procedure similar to that previously proposed by B. T. Polyak. However, in this case, in comparison with the class of problems without constraints, it arises the problem of knowing the exact minimal value of the objective function. The paper describes the conditions for the inexactness of this information, which make it possible to preserve convergence with the rate of geometric progression in the vicinity of the set of minimum points of the problem. Two analogs of the concept of a sharp minimum for problems with inequality constraints are considered. In the first one, the problem of approximation to the exact solution arises only to a pre-selected level of accuracy, for this, it is considered the case when the minimal value of the objective function is unknown; instead, it is given some approximation of this value. We describe conditions on the inexact minimal value of the objective function, under which convergence to the vicinity of the desired set of points with a rate of geometric progression is still preserved. The second considered variant of the sharp minimum does not depend on the desired accuracy of the problem. For this, we propose a slightly different way of checking whether the step is productive, which allows us to guarantee the convergence of the method to the exact solution with the rate of geometric progression in the case of exact information. Convergence estimates are proved under conditions of weak convexity of the constraints and some restrictions on the choice of the initial point, and a corollary is formulated for the convex case when the need for an additional assumption on the choice of the initial point disappears. For both approaches, it has been proven that the distance from the current point to the set of solutions decreases with increasing number of iterations. This, in particular, makes it possible to limit the requirements for the properties of the used functions (Lipschitz-continuous, sharp minimum) only for a bounded set. Some computational experiments are performed, including for the truss topology design problem.

In this paper we study the rotational oscillations of the nitrous bases forming a central pair in a short DNA fragment consisting of three base pairs. A simple mechanical analog of the fragment where the bases are imitated by pendulums and the interactions between pendulums — by springs, has been constructed. We derived Lagrangian of the model system and the nonlinear equations of motions. We found solutions in the homogeneous case when the fragment considered consists of identical base pairs: Adenine-Thymine (AT- pair) or Guanine-Cytosine (GC-pair). The trajectories of the model system in the configuration space were also constructed.

In the paper we construct the model of phase change. Process of hydriding / dehydriding is taken as an example. A single powder particle is considered under the assumption about its symmetry. A ball, a cylinder, and a flat plate are examples of such symmetrical shapes. The model desribes both the "shrinking core"(when the skin of the new phase appears on the surface of the particle) and the "nucleation and growth"(when the skin does not appear till complete vanishing of the old phase) scenarios. The model is the non-classical boundary-value problem with the free boundary and nonlinear Neumann boundary condition. The symmetry assumptions allow to reduce the problem to the single spatial variable. The model was tested on the series of experimental data. We show that the particle shape’s influence on the kinetics is insignificant. We also show that a set of particles of different shapes with size distribution can be approxomated by the single particle of the "average" size and of a simple shape; this justifies using single particle approximation and simple shapes in mathematical models.

It is known that the internal mobility of DNA molecules plays an important role in the functioning of these molecules. This explains the great interest of researchers in studying the internal dynamics of DNA. Complexity, laboriousness and high cost of research in this field stimulate the search and creation of simpler physical analogues, convenient for simulating the various dynamic regimes possible in DNA. One of the directions of such a search is connected with the use of a mechanical analogue of DNA — a chain of coupled pendulums. In this model, pendulums imitate nitrous bases, horizontal thread on which pendulums are suspended, simulates a sugarphosphate chain, and gravitational field simulates a field induced by a second strand of DNA. Simplicity and visibility are the main advantages of the mechanical analogue. However, the model becomes too cumbersome in cases where it is necessary to simulate long (more than a thousand base pairs) DNA sequences. Another direction is associated with the use of an electronic analogue of the DNA molecule, which has no shortcomings of the mechanical model. In this paper, we investigate the possibility of using the Josephson line as an electronic analogue. We calculated the coefficients of the direct and indirect transformations for the simple case of a homogeneous, synthetic DNA, the sequence of which contains only adenines. The internal mobility of the DNA molecule was modeled by the sine-Gordon equation for angular vibrations of nitrous bases belonging to one of the two polynucleotide chains of DNA. The second polynucleotide chain was modeled as a certain average field in which these oscillations occur. We obtained the transformation, allowing the transition from DNA to an electronic analog in two ways. The first includes two stages: (1) the transition from DNA to the mechanical analogue (a chain of coupled pendulums) and (2) the transition from the mechanical analogue to the electronic one (the Josephson line). The second way is direct. It includes only one stage — a direct transition from DNA to the electronic analogue.

A simple model based on a kinetic-type equation is proposed to describe the spread of a virus in space through the migration of virus carriers from a certain center. The consideration is carried out on the example of three countries for which such a one-dimensional model is applicable: Russia, Italy and Chile. The geographical location of these countries and their elongation in the direction from the centers of infection (Moscow, Milan and Lombardia in general, as well as Santiago, respectively) makes it possible to use such an approximation. The aim is to determine the dynamic density of the infected in time and space. The model is two-parameter. The first parameter is the value of the average spreading rate associated with the transfer of infected moving by transport vehicles. The second parameter is the frequency of the decrease of the infected as they move through the country, which is associated with the passengers reaching their destination, as well as with quarantine measures. The parameters are determined from the actual known data for the first days of the spatial spread of the epidemic. An analytical solution is being built; simple numerical methods are also used to obtain a series of calculations. The geographical spread of the disease is a factor taken into account in the model, the second important factor is that contact infection in the field is not taken into account. Therefore, the comparison of the calculated values with the actual data in the initial period of infection coincides with the real data, then these data become higher than the model data. Those no less model calculations allow us to make some predictions. In addition to the speed of infection, a similar “speed of recovery” is possible. When such a speed is found for the majority of the country's population, a conclusion is made about the beginning of a global recovery, which coincides with real data.

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.

This paper demonstrates the advantages of using artificial intelligence algorithms for the design of experiment theory, which makes possible to improve the accuracy of parameter identification for an elastostatic robot model. Design of experiment for a robot consists of the optimal configuration-external force pairs for the identification algorithms and can be described by several main stages. At the first stage, an elastostatic model of the robot is created, taking into account all possible mechanical compliances. The second stage selects the objective function, which can be represented by both classical optimality criteria and criteria defined by the desired application of the robot. At the third stage the optimal measurement configurations are found using numerical optimization. The fourth stage measures the position of the robot body in the obtained configurations under the influence of an external force. At the last, fifth stage, the elastostatic parameters of the manipulator are identified based on the measured data.

The objective function required to finding the optimal configurations for industrial robot calibration is constrained by mechanical limits both on the part of the possible angles of rotation of the robot’s joints and on the part of the possible applied forces. The solution of this multidimensional and constrained problem is not simple, therefore it is proposed to use approaches based on artificial intelligence. To find the minimum of the objective function, the following methods, also sometimes called heuristics, were used: genetic algorithms, particle swarm optimization, simulated annealing algorithm, etc. The obtained results were analyzed in terms of the time required to obtain the configurations, the optimal value, as well as the final accuracy after applying the calibration. The comparison showed the advantages of the considered optimization techniques based on artificial intelligence over the classical methods of finding the optimal value. The results of this work allow us to reduce the time spent on calibration and increase the positioning accuracy of the robot’s end-effector after calibration for contact operations with high loads, such as machining and incremental forming.

Formation of adequate behavioral patterns in condition of the unknown environment carried out through exploratory behavior. At the same time the rapid formation of an acceptable pattern is more preferable than a long elaboration perfect pattern through repeat play learning situation. In extreme situations, phenomenon of imprinting is observed — instant imprinting of behavior pattern, which ensure the survival of individuals. In this paper we propose a hypothesis and imprint model when trained on a single successful pattern of virtual robot's neural network demonstrates the effective functioning. Realism of the model is estimated by checking the stability of playback behavior pattern to perturbations situation imprint run.

In 2007 Kasman conducted a series of original computer experiments with sine-Gordon kinks moving along artificial DNA sequences. Two sequences were considered. Each consisted of two parts separated by a boundary. The left part of the first sequence contained repeating TTA triplets that encode leucines, and the right part contained repeating CGC triplets that encode arginines. In the second sequence, the left part contained repeating CTG triplets encoding leucines, and the right part contained repeating AGA triplets encoding arginines. When modeling the kink movement, an interesting effect was discovered. It turned out that the kink, moving in one of the sequences, stopped without reaching the end of the sequence, and then “bounced off” as if he had hit a wall. At the same time, the kink movement in the other sequence did not stop during the entire time of the experiment. In these computer experiments, however, a simple DNA model proposed by Salerno was used. It takes into account differences in the interactions of complementary bases within pairs, but does not take into account differences in the moments of inertia of nitrogenous bases and in the distances between the centers of mass of the bases and the sugar-phosphate chain. The question of whether the Kasman effect will continue with the use of more accurate DNA models is still open. In this paper, we investigate the Kasman effect on the basis of a more accurate DNA model that takes both of these differences into account. We obtained the energy profiles of Kasman's sequences and constructed the trajectories of the motion of kinks launched in these sequences with different initial values of the energy. The results of our investigations confirmed the existence of the Kasman effect, but only in a limited interval of initial values of the kink energy and with a certain direction of the kinks movement. In other cases, this effect did not observe. We discussed which of the studied sequences were energetically preferable for the excitation and propagation of kinks.