?
Комбинаторный анализ обобщенной схемы последовательных действий
Промышленные АСУ и контроллеры. 2016. № 4. С. 25-27.
Enatskaya N.
The generalization of thescheme of sequential actions belongs to the case of the dependence of the number of outcomes of each next action not only of the action but on the result of the previos action. We fulfiled the enumeration of outcomes of the scheme, the enume-ration problem is solved theoreticaly and two methods of modeling are suggested.
Enatskaya N., Промышленные АСУ и контроллеры 2016 № 6 С. 25-28
Under the conditions of the known results for the more general combinatorial scheme with respect to the given scheme and the scheme of the rest its outcomes (the additional scheme) in the directios of the solution of the problems of the enumerational combinatorial analysis we suggest to obtain all results of its analysis from the ...
Added: September 13, 2016
Н. Ю. Энатская, Промышленные АСУ и контроллеры 2015 № 10 С. 28-31
The notion of the range R of outcomes of a combination scheme is Introduced as the maximal difference between the chosen elements. The number of outcomes of the scheme with limited range R not grater t is defined, their enumeration isfulfilled and the problem of numeration (theproblem of finding one-to-one correspondence between the number of ...
Added: November 9, 2015
Enatskaya N., Промышленные АСУ и контроллеры 2018 № 1 С. 58-61
The direct enumeration of the outcomes by the graph method fulfils and their number is find, the probability of outcomes of the scheme in the general combination scheme. The enumeration is solved for outcomes of the scheme and on this base the algorithm of their quick modelling is suggested. ...
Added: February 8, 2018
Enatskaya N., Труды Карельского научного центра РАН. Серия 10: Математическое моделирование и информационные технологии 2018 № 7 С. 117-133
The paper discusses the specific features and presents the procedure and the results of studying a wide variety of specific combinatorial schemes in the pre-asymptotic region of their parameters change. It is suggested that the schemes are analyzed by an unconventional quality analysis of their outcomes, the result of which include quantitative characteristics. ...
Added: December 4, 2018
Enatskaya N., Труды Карельского научного центра Российской академии наук 2017 № 8 С. 94-100
We consider different procedures to number all outcomes of an arrangement scheme with a given restriction, establish an one-to-one correspondence between the outcomes and its numbers, generated in the numbering procedure, and give some methods to simulate the outcomes. Then in is possible to obtain the results in the same directions for permutations of any ...
Added: January 11, 2018
Н. Ю. Энатская, Промышленные АСУ и контроллеры 2015 № 9 С. 34-39
We consider different procedures to number all outcomes of a arrangement scheme, establish a one-to-one correspondence between the outcomes and its numbers generated in the numbering рrocedure, and give some methods to simulate the outcomes. ...
Added: November 9, 2015
Enatskaya N., Промышленные АСУ и контроллеры 2016 № 2 С. 35-41
The fulfilled analyses of scheme consistsof the establishment of the connection between the schemes with outcomes in the common traektorial from, in finding of the number of outcomes, in the con- straction of the procedur of their enumeration, in the solution of the enumeration problem and of the modeling of their outcomes. ...
Added: September 13, 2016
Н. Ю. Энатская, Е. Р. Хакимуллин, В кн. : Инновации на основе информационных и коммуникационных технологий: Материалы международной научно-практической конференции (2015). : М. : НИУ ВШЭ, 2015. С. 251-252.
В качестве подхода к решению задач перечислительной комбинаторики предлагается анализ комбинаторных схем на основе определенной технологии прямого перечисления всех их исходов с разработкой для каждой схемы дисциплины нумерации. Для этого задаются виды исходов и строятся процедуры их перечисления в различных комбинаторных схемах с опереденным порядком их нумерации, решается задача нумерации исходов, т.е. устанавливается взаимно-однозначное соответствие ...
Added: December 7, 2015
Enatskaya N., Труды Карельского научного центра РАН. Серия 10: Математическое моделирование и информационные технологии 2019 № 7 С. 63-69
The problems of a direct enumeration of the outcomes of scheme, finding their numbers, problems of their numbering and modelling are solved. ...
Added: November 13, 2019
Enatskaya N., Промышленные АСУ и контроллеры 2016 № 7 С. 32-36
All investigations of the scheme defined in its name are fulfiled by the direct enumeration of its outcomes, namely: the number of its outcomes of the scheme and its probability distribution are defined, the numbering problem for outcomes of the scheme is solved, this gives the possibility of a quick modeling of its possible values ...
Added: September 13, 2016
Enatskaya N., Труды Карельского научного центра РАН. Серия 10: Математическое моделирование и информационные технологии 2018 № 7 С. 134-139
We introduce a new characteristic of the outcome of a combination scheme, i. e. its steps, defined as differences between the neighbor-ring elements of the outcome arranged in the order of increase. We consider the procedure of enumerating all outcomes of a combina-tion scheme with a given restriction, establish the one-to-one cor-respondence between the outcomes ...
Added: December 4, 2018
Enatskaya N., Труды Карельского научного центра РАН 2023 № 4 С. 71-76
Problems of enumerative combinatorics are solved for the proposed scheme, i. e. the number of its outcomes is determined, their direct listing is constructed, the numbering problem is solved, the probability distribution of the scheme outcomes is found, and a procedure for their modeling is proposed. ...
Added: August 3, 2023
Enatskaya N., Труды Карельского научного центра Российской академии наук 2016 № 8 С. 141-146
We suggest a procedure for direct enumeration of the outputs of cir-cuit with a given discipline of their enumeration. Proceeding from this, thefollwing aspects are studied: the total numer of outputs of the circuit is found, the enumeration problem is solved, the algorithm of rap[d modeling of outputs is constructed. ...
Added: September 19, 2016
Pochinka O., Митрякова Т. М., Математические заметки 2013 Т. 93 № 6 С. 902-919
В настоящей статье разработан метод построения каскадов на поверхностях, позволяющих моделировать негрубые дискретные динамические системы с конечным числом орбит гетероклинического касания и заданными модулями топологической сопряженности ...
Added: March 25, 2014
Max press, 2018
This collection of articles contain materials of the talks presented at the International Conference "Systems Analysis: Modeling and Control" in memory of Academician A.V. Kryazhimskiy, Moscow, May 31 - June 1, 2018 ...
Added: June 18, 2018
Н. Ю. Энатская, Труды Карельского научного центра РАН. Серия 10: Математическое моделирование и информационные технологии 2015 № 10 С. 137-144
The numerical method of calculation of inversions in permutations uses the method of graphs. As the result we calculate the recurrence for calculation of the numbers of inversions with the use of the bunchs of graphs and finding the probability distribution of the number of inversions with the increes of the size of the permutationThe ...
Added: November 9, 2015
Yasnitsky L., Dumler A. A., Bogdanov K. et al., Biomedical Engineering 2013 Vol. 47 No. 3 P. 160-163
A neural expert network system for diagnostis and prognosis of cardiovascular diseasas was developed. ...
Added: November 19, 2013
Enatskaya N., Труды Карельского научного центра Российской академии наук 2016 № 8 С. 136-140
Outputs of thecircuit are enumerated directly by the graph method, their number and probability in the general combinations circuit are determined, the problem of enumeration of outputs is solved and the algorithm of their rapid modeling is suggestrd on this basis. ...
Added: September 19, 2016
Lazarev A. A., Мусатова Е. Г., Тарасов И. А., Автоматика и телемеханика 2016 № 11 С. 158-174
Рассматривается задача составления оптимального расписания движения поездов между двумя станциями, соединенными однопутной железной дорогой с разъездом. На основе метода динамического программирования предлагаются алгоритмы решения задач минимизации максимального временн´ого смещения и минимизации суммы взвешенных моментов окончания перевозок. Трудоемкость алгоритмов составляет O(n 2 ) операций, где n — количество поездов. ...
Added: December 22, 2016
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
Mikheev A. V., Солнышкин С. Н., Ингстер Ю. И. et al., СПб. : Издательство СПбГЭТУ "ЛЭТИ", 2009
Содержат описание алгоритмов численного анализа, основанных на статистической обработке данных в пакете МАТLАВ. Предназначены студентам ФКТИ СПбГЭТУ «ЛЭТИ». ...
Added: February 4, 2013
Enatskaya N., Промышленные АСУ и контроллеры 2017 № 11 С. 29-34
We study the questions of finding the number of permutations with a given information of structures of cycles, the direct enumeration and modelling of their outcomes. ...
Added: November 30, 2017
Pochinka O., Galkina S., Shubin D., Izvestiya Vysshikh uchebnykh zavedeniy. Prikladnaya nelineynaya dinamika 2019 Vol. 27 No. 6 P. 63-72
A general idea of the qualitative study of dynamical systems, going back to the works by A. Andronov, E. Leontovich, A. Mayer, is a possibility to describe dynamics of a system using combinatorial invariants. So M. Peixoto proved that the structurally stable flows on surfaces are uniquely determined, up to topological equivalence, by the isomorphic ...
Added: October 14, 2019
Enatskaya N. Yu., Khakimullin E. R., , in : Innovative Information Technologies: Materials of the International scientific–practical conference. Part 2. * 2.: M. : HSE, 2014. P. 282-290.
Two statements of the problem for the division of a publication of elements into a given number of discernible parts with and without limitations applied to their dimensions or compositions are distinguished. Under conditions of these statements , the problem under consideration with varying quality of elements by their discernibility is resolved in the folloving ...
Added: March 16, 2015