?
О некоторых классах разложимых цепей Маркова на конечной абелевой группе.
Прикладная дискретная математика. 2015. № 1(27). С. 78-83.
The article is considered the problem of the decomposition of a given simple homogeneous Markov chain in the sum of the components of the circuit. It is described the class of circuits that allow this decomposition of an infinite number of ways.
Priority areas:
mathematics
Language:
Russian
Popkov Y., Popkov A., Dubnov Y. A., Автоматика и телемеханика 2020 № 7 С. 148-172
A randomized forecasting method based on the generation of ensembles of entropy-optimal forecasting trajectories is developed. The latter are generated by randomized dynamic regression models containing random parameters, measurement noises, and a random input. The probability density functions of random parameters and measurement noises are estimated using real data within the randomized machine learning procedure. ...
Added: October 31, 2020
Felikson А. A., Natanzon S. M., Differential Geometry and its Application 2012 Vol. 30 No. 5 P. 490-508
We consider (local) parameterizations of Teichmüller space Tg,n (of genus g hyperbolic surfaces with n boundary components) by lengths of 6 g- 6 + 3 n geodesics. We find a large family of suitable sets of 6 g- 6 + 3. n geodesics, each set forming a special structure called "admissible double pants decomposition". For ...
Added: February 5, 2013
Sirotkin D., Malyshev D., Дискретная математика 2017 Т. 29 № 3 С. 114-125
Задача о независимом множестве для заданного обыкновенного графа состоит в вычислении размера наибольшего множества его попарно несмежных вершин. Предлагается новый способ редукции графов. С его помощью получено новое доказательство NP-полноты задачи о независимом множестве в классе планарных графов и доказана NP-полнота данной задачи в классе плоских графов, имеющих только треугольные внутренние грани, с максимальной степенью ...
Added: September 7, 2017
Yasnitsky L., Пермь : Пермский государственный национальный исследовательский университет. – Электронные данные. , 2020
The collection contains materials from the international conference "Intelligent systems in science and technology" and the Sixth all-Russian scientific and practical conference "Artificial intelligence in solving urgent social and economic problems of the XXI century", which was held on October 12-18, 2020 in Perm as part of the Perm natural science forum "Mathematics and global ...
Added: December 4, 2020
Gafarov E., Lazarev A. A., Werner F., Annals of Operations Research 2012 Vol. 196 No. 1 P. 247-261
We consider the problem of maximizing total tardiness on a single machine, where the first job starts at time zero and idle times between the processing of jobs are not allowed.We present a modification of an exact pseudo-polynomial algorithm based on a graphical approach, which has a polynomial running time. This result settles the complexity ...
Added: November 24, 2012
Gribanov D., Malyshev D., Discrete Applied Mathematics 2017 Vol. 227 P. 13-20
We consider boolean linear programming formulations of the independent set, the vertex and the edge dominating set problems and prove their polynomial-time solvability for classes of graphs with (augmented) constraint matrices having bounded minors in the absolute value ...
Added: April 23, 2017
Akopov A. S., Beklaryan L. A., Saghatelyan A. K., Environmental Modelling and Software 2019 Vol. 116 P. 7-25
Urban greenery such as trees can effectively reduce air pollution in a natural and eco-friendly way. However, how to spatially locate and arrange greenery in an optimal way remains as a challenging task. We developed an agent-based model of air pollution dynamics to support the optimal allocation and configuration of tree clusters in a city. The Pareto ...
Added: February 24, 2019
Lanham : University Press of America, 2012
The history of logic and analytic philosophy in Central and Eastern Europe is still known to very few people. As an exception to the rule, only two scientific schools became internationally popular: the Vienna Circle and the Lvov-Warsaw School. Nevertheless, the countries included in this region have not only joint history, but also joint cultural ...
Added: February 13, 2013
Babash A. V., М. : ИНФРА-М, РИОР, 2013
Пособие предназначено для студентов высших учебных заведений, обучающихся по специальности «Прикладная информатика (в экономике)». Оно также содержит методический материал для ряда инновационных курсов лекций по профилю «Информационная безопасность» и может быть использовано и для блока дисциплин этого профиля. Ряд представленных результатов полезен специалистам и аспирантам, специализирующихся в указанной области. ...
Added: January 14, 2014
Malyshev D., Дискретный анализ и исследование операций 2012 Т. 19 № 4 С. 66-72
Рассматривается конструктивный подход к формированию новых случаев эффективной разрешимости задачи о независимом множестве в семействе наследственных частей множества графов Free({P5,C5}). Именно, доказывается, что если эта задача полиномиально разрешима в классе Free({P5,C5,G}), то для любого графа H, который может быть индуктивно получен из G применением к текущему графу сложения с K1 или умножения на K1, эта ...
Added: August 31, 2012
Kryuchkov M., Rusakov S. V., Вестник Ижевского государственного технического университета 2015 № 2(66) С. 110-112
This paper describes the results of testing the neuronal technical trend indicator according to the exchange rate of Brent oil in 2014. Testing of the model was carried out on three time series, which characterized by their features. ...
Added: August 31, 2015
Alexandrov D. E., Galkin V. V., Zobnin A.I. et al., Journal of Mathematical Sciences 2009 Vol. 163 No. 5 P. 469-486
Sequential and parallel implementations of the F4 algorithm for computing Gr¨obner bases of
polynomial ideals are discussed. ...
Added: October 1, 2014
Malyshev D., Дискретный анализ и исследование операций 2020 Т. 27 № 4 С. 104-130
Задача о рёберной раскраске для заданного графа состоит в том, чтобы минимизировать количество цветов, достаточное для окрашивания его рёбер так, чтобы соседние рёбра были окрашены в разные цвета. Для всех классов графов, определяемых запрещением подграфов с не более чем 6 рёбрами каждый, известен
сложностной статус этой задачи. В настоящей работе данный результат улучшается и получена полная ...
Added: December 25, 2020
Красноярск : ИВМ СО РАН, 2013
Труды Пятой Международной конференции «Системный анализ и информационные технологии» САИТ-2013 (19–25 сентября 2013 г., г.Красноярск, Россия): ...
Added: November 18, 2013
Malyshev D., Discrete Mathematics 2015 Vol. 338 No. 11 P. 1860-1865
We completely determine the complexity status of the 3-colorability problem for hereditary graph classes defined by two forbidden induced subgraphs with at most five vertices. ...
Added: April 7, 2014
Marshirov V. V., Marshirova L. E., Сибирский журнал индустриальной математики 2013 Т. XVI № 4 С. 111-120
The paper considers the problem of determining the rate of cooling of metal during solidification at the intersection of the liquidus temperature under intense heat sink from the surface. The solution to this problem it is necessary to determine the process conditions, the boundary and initial conditions for which it is possible to get new ...
Added: November 17, 2013
Gafarov E., Lazarev A. A., Information Processing Letters 2012 Т. 112 № 3 С. 72-76
In this note, we consider a single machine scheduling problem with generalized total tardiness objective function.
A pseudo-polynomial time solution algorithm is proposed for a special case of this problem. Moreover, we present a new
graphical algorithm for another special case, which corresponds to the classical problem of minimizing the weighted number
of tardy jobs on a single ...
Added: November 24, 2012
Malyshev D., Journal of Applied and Industrial Mathematics (перевод журналов "Сибирский журнал индустриальной математики" и "Дискретный анализ и исследование операций") 2020 Vol. 14 No. 4 P. 706-721
The edge coloring problem for a graph is to minimize the number of colors that are sufficient to color all edges of the graph so that all adjacent edges receive distinct colors. The computational complexity of the problem is known for all graph classes defined by forbidden subgraphs with at most 6 edges. We improve ...
Added: January 30, 2021
Barcelona : IEEE, 2017
International Conference on Control, Decision and Information Technologies. ...
Added: January 17, 2018
Gafarov E., Lazarev A. A., Werner F., Mathematical Social Sciences 2011 No. 62 P. 7-13
We consider single machine scheduling problems with a non-renewable resource. These types of problems have not been intensively investigated in the literature so far. For several problems of these types with standard objective functions (namely the minimization of makespan, total tardiness, number of tardy jobs, total completion time and maximum lateness), we present some complexity ...
Added: November 24, 2012
Litvin Y. V., Абрамов И. В., Технологии техносферной безопасности 2016 № 66
Advanced approach to the assessment of a random time of arrival fire fighting calculation on the object of protection, the time of their employment and the free combustion. There is some quantitative assessments with the review of analytical methods and simulation ...
Added: August 27, 2016
Beklemishev L. D., Оноприенко А. А., Математический сборник 2015 Т. 206 № 9 С. 3-20
We formulate some term rewriting systems in which the number of computation steps is finite for each output, but this number cannot be bounded by a provably total computable function in Peano arithmetic PA. Thus, the termination of such systems is unprovable in PA. These systems are derived from an independent combinatorial result known as the Worm ...
Added: March 13, 2016
Vyalyi M., Дискретная математика 1991 Т. 3 № 3 С. 35-45
Added: October 17, 2014
Зайцев В. И., Щавелин В. М., М. : ВИНИТИ РАН, 1985
Added: November 30, 2020