### ?

## 13th Chaotic Modeling and Simulation International Conference

Cham:
Springer, 2022.

Academic editor: Skiadas C., Dimotikalis Y.

Gathering the proceedings of the 14th CHAOS2021 International Conference, this book highlights recent developments in nonlinear, dynamical and complex systems. The conference was intended to provide an essential forum for Scientists and Engineers to exchange ideas, methods, and techniques in the field of Nonlinear Dynamics, Chaos, Fractals and their applications in General Science and the Engineering Sciences.

The respective chapters address key methods, empirical data and computer techniques, as well as major theoretical advances in the applied nonlinear field. Beyond showcasing the state of the art, the book will help academic and industrial researchers alike apply chaotic theory in their studies.

Dmitriev A., Sanochkin Y., Kornilov V., , in: 13th Chaotic Modeling and Simulation International Conference. .: Cham: Springer, 2022..

Detection the precursors of critical transitions in complex systems is one of the most difficult and still unsolved problems. This problem has not received a final solution, not only for real complex systems, but also for model systems capable to self-organize into the critical state. The presented paper is devoted to early detection of time ...

Added: August 13, 2021

Keywords: complexity

Zakharov V., Труды Института системного программирования РАН 2015 Т. 27 № 2 С. 221-250

Finite state transducers extend the finite state automata to model functions on strings or lists. They may be used also as simple models of sequential reactive programs. These programs operate in the interaction with the environment permanently receiving data (requests) from it. At receiving a piece of data such program performs a sequence of actions. ...

Added: September 30, 2015

Kanovich M., Ban Kirigin T., Nigam V. et al., Computer Languages, Systems & Structures 2014 No. 40 P. 137-154

It is well-known that the Dolev–Yao adversary is a powerful adversary. Besides acting as the network, intercepting, decomposing, composing and sending messages, he can remember as much information as he needs. That is, his memory is unbounded. We recently proposed a weaker Dolev–Yao like adversary, which also acts as the network, but whose memory is ...

Added: March 23, 2015

Kontchakov R., Pratt-Hartmann I., Zakharyaschev M., Artificial Intelligence 2014 Vol. 217 P. 43-75

The language RCC8RCC8is a widely-studied formalism for describing topological arrangements of spatial regions. The variables of this language range over the collection of non-empty, regular closed sets of n -dimensional Euclidean space, here denoted RC+(Rn)RC+(Rn), and its non-logical primitives allow us to specify how the interiors, exteriors and boundaries of these sets intersect. The key ...

Added: March 24, 2015

Turkensteen M., Malyshev D., Goldengorin B. I. et al., Journal of Global Optimization 2017 Vol. 68 No. 3 P. 601-622

The tolerance of an element of a combinatorial optimization problem with respect to its optimal solution is the maximum change of the cost of the element while preserving the optimality of the given optimal solution and keeping all other input data unchanged. Tolerances play an important role in the design of exact and approximation algorithms, ...

Added: December 10, 2016

Дали Ф. А., Mironkin V., Проблемы информационной безопасности. Компьютерные системы 2018 № 1 С. 113-121

Two models of the tree modes of hash functions are introduced. For each model algorithms of computing of the hash code are formulated and their numerical characteristics are obtained. In terms of the constructed models we classify some existing algorithms for parallel hashing and identify some weaknesses of corresponding primitives. ...

Added: May 28, 2018

Springer, 2017

This book constitutes the refereed proceedings of the 21st International Symposium on Fundamentals of Computation Theory, FCT 2017, held in Bordeaux, France, in September 2017. The 29 revised full papers and 5 invited papers presented were carefully reviewed and selected from 99 submissions. The papers cover topics of all aspects of theoretical computer science, in ...

Added: September 14, 2017

Institute of Physics Publishing (IOP), 2021

Added: August 13, 2021

Yenigün H., Evtushenko N. V., Kushik N. et al., Proceedings of the Institute for System Programming of the RAS 2018 Vol. 30 No. 1 P. 7-24

State identification is a long standing problem in the area of Finite State Machine (FSM) based modeling and testing of discrete event systems. For the identification of the current state of the system, so-called homing and synchronizing experiments with FSMs are used whereas for the initial state identification one can perform a distinguishing experiment. The ...

Added: October 9, 2019

Zakharov V., Новикова Т. А., Труды Института системного программирования РАН 2014 Т. 26 № 2 С. 245-268

It is generally accepted that to unify a pair of substitutions θ_1 and θ_2 means to find out a pair of substitutions η' and η'' such that the compositions θ_1 η' and θ_2 η'' are the same. Actually, unification is the problem of solving linear equations of the form θ_1 X=θ_2 Y in the semigroup ...

Added: September 30, 2015

Fomichev M., Ulyanov M., Головешкин В. А. et al., International Journal of Open Information Technologies 2016 Т. 4 № 12 С. 131-137

It is shown that the logarithm of the complexity (number of nodes in the decision tree of a branch and bound algorithm) of the individual traveling salesman problem is approximately normally distributed. We use a linear regression model (logarithm of the complexity — standard normal distribution) to estimate parameters of normal distribution, which fit the ...

Added: August 19, 2017

Zakharov V., Lecture Notes in Computer Science 2015 Vol. 9270 P. 208-221

Finite state transducers over semigroups can be regarded as a formal model of sequential reactive programs. In this paper we introduce a uniform tech- nique for checking eectively functionality, k-valuedness, equivalence and inclusion for this model of computation in the case when a semigroup these transducers op- erate over is embeddable in a decidable group. ...

Added: September 30, 2015

MDPI Open Access Publishing, 2018

Added: October 4, 2018

Zhukova G., Ulyanov M., Fomichev M. et al., International Journal of Open Information Technologies 2016 Т. 4 № 12 С. 7-12

The complexity of solving a particular travelling saleman problem is studied. Complexity is a number of nodes of the decision tree, when a particular problem is being solved by the branch and bound algorithm. A probability distribution of the logarithm of the complexity of a particular TSP is approximately normal. Parameters of the linear transformation ...

Added: October 5, 2017

Куркина Е. С., Knyazeva H., Куретова Е. Д., Сложные системы 2013 № 3 (8) С. 4-50

The global evolution of the world community as an integrated self-organizing and self-developing system is studied in the article; and some main features and laws of its evolution are exposed. The attention is focused on the consideration of cyclic character of evolution, of periods of the global history of mankind, of the growth of complexity ...

Added: November 18, 2013

Rubchinskiy A., Divisive-Agglomerative Algorithm and Complexity of Automatic Classification Problems / Высшая школа экономики. Series WP7 "Математические методы анализа решений в экономике, бизнесе и политике". 2015. No. WP7/2015/09.

An algorithm of solution of the Automatic Classification (AC for brevity) problem is set forth in the paper. In the AC problem, it is required to find one or several partitions, starting with the given pattern matrix or dissimilarity / similarity matrix. The three-level scheme of the algorithm is suggested. The output of the procedure ...

Added: October 19, 2017

Springer, 2020

Springer Proceedings in Complexity publishes proceedings from scholarly meetings on all topics relating to the interdisciplinary studies of complex systems science. Springer welcomes book ideas from authors. The series is indexed in Scopus.
Proposals must include the following: - name, place and date of the scientific meeting - a link to the committees (local organization, international advisors etc.) - ...

Added: February 23, 2020

MDPI AG, 2020

Proceedings (ISSN 2504-3900) publishes publications resulting from conferences, workshops and similar events. ...

Added: March 13, 2020

Vovk V., Gammerman A., Papadopoulos H., Springer, 2015

Festschrift for Alexey Chervonenkis. ...

Added: March 3, 2016

Funchal: SciTePress, 2018

This book contains the proceedings of the 3rd International Conference on Complexity, Future Information Systems and Risk (COMPLEXIS 2018) which was organized and sponsored by the Institute for Systems and Technologies of Information, Control and Communication (INSTICC). This conference was technically co-sponsored by World Federation on Soft Computing (WFSC) and also held in cooperation with ...

Added: June 2, 2018

Furmanov K. K., Nikol'skii I. M., Computational Mathematics and Modeling 2016 Vol. 27 No. 2 P. 247-253

Added: December 22, 2016

Baibikova T., Domoratsky E., Вестник Московского финансово-юридического университета 2017 № 1 С. 200-206

Some questions of scientific visualization are under consideration in this paper. This article also discusses the peculiarities of application of cognitive computer graphics, singles out a range of tasks of scientific visualization. The paper gives a brief overview of modern support tools for program visualization, tendencies of their development and their main characteristics. A module ...

Added: June 10, 2017

Gostev I. M., М.: Юрайт, 2016

В настоящее время компьютерные науки стремительно развиваются. Новые версии операционных систем появляются каждые полтора-два года, поэтому было принято решение о включении в данную книгу такого материала, который не будет устаревать. Содержание учебника представляет собой некоторые наиболее общие принципы построения операционных систем, которые были разработаны более 50 лет назад и практически не изменились за прошедшее время. ...

Added: October 13, 2009

Kiselyova N., Dudarev V., Korzhuev M., Inorganic Materials: Applied Research 2016 Vol. 7 No. 1 P. 34-39

A database (DB) on the bandgap of inorganic substances available via the Internet (http://bg.imetdb.ru) was developed for the information service of specialists in the sphere of inorganic chemistry and materials science. The DB is integrated with other information systems on the properties of inorganic substances and materials, which provides the search of a wide range ...

Added: February 23, 2016

Kalyagin V. A., Koldanov A. P., Koldanov P. et al., Physica A: Statistical Mechanics and its Applications 2014 Vol. 413 No. 1 P. 59-70

A general approach to measure statistical uncertainty of different filtration techniques for market network analysis is proposed. Two measures of statistical uncertainty are introduced and discussed. One is based on conditional risk for multiple decision statistical procedures and another one is based on average fraction of errors. It is shown that for some important cases ...

Added: July 19, 2014