• A
  • A
  • A
  • ABC
  • ABC
  • ABC
  • А
  • А
  • А
  • А
  • А
Regular version of the site
Of all publications in the section: 199
Sort:
by name
by year
Article
Миркин Б. Г., Трофимов В. Автоматика и телемеханика. 1974. № 9.
Added: Oct 20, 2010
Article
Горяинов В. Б., Горяинова Е. Р. Автоматика и телемеханика. 2015. № 3. С. 62-78.

For the process of order (1,1) spatial autoregression, the consistency and asymptotic normality of the sign estimate were established. The relative asymptotic efficiency of the sign estimate relative to least- squares estimate was calculated, and its behavior under various distributions of the renewing field was considered.

Added: Apr 28, 2015
Article
Поляк Б. Т., Тремба А. А., Хлебников М. В. и др. Автоматика и телемеханика. 2015. № 6. С. 18-41.
Added: Oct 18, 2015
Article
Иванов Ф. И., Жилин И. В. Автоматика и телемеханика. 2016. Т. 10. С. 109-122.

A modification of the decoding q-ary Sum Product Algorithm (q-SPA) was proposed for the nonbinary codes with small check density based on the permutation matrices. The algorithm described has a vector realization and operates over the vectors defined on the field GF(q), rather than over individual symbols. Under certain code parameters, this approach enables significant speedup of modeling.

Added: Dec 11, 2017
Article
Ульянов М. В., Жукова Г. Н., Фомичев М. И. и др. Автоматика и телемеханика. 2018. № 7. С. 149-166.

We show the results of a statistical study of the complexity of the asymmetric traveling salesman problem (ATSP) obtained by processing a specially generated pool of matrices. We show that the normal distribution can serve as an approximation to the distribution of the logarithm of complexity for a fixed problem dimension. We construct a family of probability distributions that represent satisfactory approximations of the complexity distribution with a dimension of the cost matrix from 20 to 49. Our main objective is to make probabilistic predictions of the complexity of individual problems for larger values of the dimension of the cost matrix. We propose a representation of the complexity distribution that makes it possible to predict the complexity. We formulate the unification hypothesis and show directions for further study, in particular proposals on the task of clustering “complex” and “simple” ATSP problems and proposals on the task of directly predicting the complexity of a specific problem instance based on the initial cost matrix.

Added: Jul 16, 2018
Article
Хаметов В. М., Шелемех Е. А. Автоматика и телемеханика. 2019. № 3. С. 152-172.
Added: Feb 22, 2019
Article
Зутлер И. А. Автоматика и телемеханика. 2011. № 12. С. 60-74.
Added: Sep 19, 2012
Article
Веселова Ю. А. Автоматика и телемеханика. 2016. Т. 77. № 3. С. 7-32.

When a society needs to make a collective decision one could apply some aggregation method, particularly, voting. One of the main problems with voting is the manipulability of voting rules. We say a social choice rule is vulnerable to manipulation if there exists at least one voter who can achieve a better voting result by misrepresenting her preferences. The popular approach to comparing manipulability of social choice rules is defining a complexity class of the corresponding manipulation problem. This paper provides a survey into manipulation complexity literature considering variety of problems with different assumptions and constraints.

Added: Oct 25, 2014
Article
Токарев В. В. Автоматика и телемеханика. 2009. № 6. С. 123-140.
Added: Jul 1, 2009
Article
Никитин А. А. Автоматика и телемеханика. 2007. № 2. С. 120-126.
Added: Jan 28, 2010
Article
Зотов М. Г. Автоматика и телемеханика. 2015. № 2. С. 61-72.

. Abstract—We show the graphical and algebraic counterparts of Kharitonov’s theorem constructed on the foundation of the robust Nyquist criterion. The graphical counterpart is different from Tsypkin–Polyak hodograph.

Added: Mar 20, 2015
Article
Лазарев А. А. Автоматика и телемеханика. 2007. № 4. С. 13-23.

Consideration was given to a graphic realization of the method of dynamic programming. Its concept was demonstrated by the examples of the partition and knapsack problems. The proposed method was compared with the existing algorithms to solve these problems.

Added: Nov 23, 2012
Article
Субочев А. Н. Автоматика и телемеханика. 2010. № 1. С. 130-143.
Added: Sep 28, 2012
Article
Афанасьев В. Н. Автоматика и телемеханика. 2015. № 1. С. 3-20.

We formulate the optimal control problem for a class of nonlinear objects that can be represented as objects with linear structure and state-dependent coefficients. We assume that the system is subjected to uncontrollable bounded disturbances. The linear structure of the transformed nonlinear system and the quadratic quality functional let us, in the optimal control synthesis, to pass from Hamilton–Jacobi–Isaacs equations to a state-dependent Riccati Equation. Control of nonlinear uncertain object in the problem of moving along a given trajectory is considered using the theory of differential games. We also give an example that illustrates how theoretical results of this work can be used.

Added: Mar 17, 2015
Article
Афанасьев В. Н. Автоматика и телемеханика. 2014.
An optimal control problem was formulated for a class of nonlinear systems which can be presented by a system with a linear structure and state-depended coefficients (SDC). The system be under the influence of uncontrollable disturbance is supposed. In this paper, the problem of control uncertain nonlinear object to the desired trajectory is considered using the theory of differential games. Parameters of the suboptimal controller are found from the solutions of two differential equations with given initial conditions and the state-depended coefficients. In the paper we propose a method for the construction of guaranteeing control that does not require the solution of nonlinear differential equations with state depending coefficients and provide an acceptable transient response
Added: Oct 29, 2014