?
Semantic and sentiment trajectories of literary masterpieces
Chaos, Solitons and Fractals. 2023. Vol. 175. No. 1. Article 113934.
The paper deals with semantic and sentiment trajectories of literary masterpieces (we used corpora of 12 languages of various language families), composed of individual embeddings or n-grams. We ascertain that, for all languages, semantic and sentiment trajectories are markedly chaotic: positive largest Lyapunov exponents; ‘entropy-complexity’ pairs belonging to the ‘chaotic’ area of the respective plane; the distinctive ‘chaotic’ drop of the number of false nearest neighbours at a particular value of an embedding dimension. The Russian language turns out to be more ‘chaotic’ than, for example, the English one; we attribute this fact to the free order of words. The Esperanto language, for various ‘approaches’ to different Indo-European languages. The results do not corroborate its claim to be equidistant from all languages. However, it seems to be equidistant from all Indo-European languages. These characteristics are utilised in order to develop a method to compare styles of an original masterpiece and its translations (to automatically assess translation quality). It appears that machine translations are still worse than human ones, however, for example, the Facebook translation is comparable with them.
Flamarion M. V., Pelinovsky E., Nonlinear Dynamics 2026 Vol. 114 Article 784
In this article, we investigate wave packet and solitary wave dynamics in the Whitham–Ostrovsky (WO) equation. By means of a multiple-scales expansion, we formally derive a nonlinear Schrödinger (NLS) equation governing the envelope evolution.The corresponding modulational stability diagram is then obtained using the Lighthill criterion. We show that sufficiently large values of the low-frequency dispersive term render ...
Added: June 5, 2026
Medvedev T. V., Pochinka O., Chaos 2026 Vol. 36 No. 6 Article 063107
We consider 3-diffeomorphisms with source–sink dynamics where Smale solenoids play the role of the source and the sink (NSSS-diffeomorphisms). It is known that such diffeomorphisms exist only on lens spaces. On the 3-sphere, every NSSS-diffeomorphism is associated with an exchangeable braid. An exchangeable braid with the strand number n was constructed for each n 3 in such a way ...
Added: June 4, 2026
Seul: PMLR, 2026.
Added: June 4, 2026
Kazakov A., Shilov O. M., Mints D. et al., Chaos 2026 Vol. 36 No. 6 Article 063112
We study hyperbolic chaotic dynamics for maps of a two-dimensional torus. We introduce a two-parameter family of diffeomorphisms which, as we show, demonstrates all types of hyperbolic chaotic dynamics that can appear in the two-dimensional case. In addition, we describe all the bifurcations responsible for the transitions between these chaotic regimes. ...
Added: June 4, 2026
Nozdrinova E., Pochinka O., Shmukler V., Математический сборник 2026 Т. 217 № 6 С. 71–89
Гомеоморфизмы топологических пространств называются эквивалентными по надстройке, если надстройки над ними топологически эквивалентны. В частности, топологически сопряженные гомеоморфизмы эквивалентны по надстройке. Известно, что для гомологически неприводимых гомеоморфизмов их топологическая сопряженность является необходимым и достаточным условием их эквивалентности по надстройке. Тогда как инварианты топологической сопряженности гомологически приводимых гомеоморфизмов во многих случаях являются избыточными для эквивалентности по ...
Added: June 3, 2026
Gnetov F., Konakov V., Успехи математических наук 2026 Т. 81 № 3 (489) С. 161–162
Пусть M обозначает симметрическое пространство некомпактного типа ранга 1. Опираясь на фундаментальную работу [1], в [2] было показано, что плотность соответствующим образом нормированной суммы независимых Hn-значных случайных величин, определенная через сложение Мёбиуса в модели шара Пуанкаре, сходится к фундаментальному решению соответствующего уравнения теплопроводности. Пределом являлся нормальный закон на Hn, соответствующий ядру теплопроводности, определяемому оператором Лапласа–Бельтрами. ...
Added: June 2, 2026
Silakov D., Системный администратор 2026 № 3 С. 28–33
В статье про платформы для разработки открытого ПО в Китае мы рассказали про GitCode – молодой проект, позиционируемый как площадка для разработчиков со всего мира. Сейчас на GitCode размещаются проекты, созданные в КНР, но некоторые из них уже известны и на международной арене. Помочь открытым проектам в становлении, развитии и расширению аудитории призван фонд OpenAtom ...
Added: June 2, 2026
Slivnitsin P., Mylnikov L., Engineering Applications of Artificial Intelligence 2026 Vol. 179 Article 115185
The paper describes a applied artificial intelligence task of recognition-by-components method of real objects based on the recognition of a limited set of primitives or components. The recognition-by-components makes it possible to determine the components, that compose an object, and increase the number of recognizable objects without degrading the recognition quality. Training is performed on ...
Added: May 29, 2026
Gorbounov Vassily, Kazakov A., Data Analytics and Topology 2025 Vol. 1 No. 1 P. 33–45
A classic problem in data analysis is studying the systems of subsets defined by either a similarity or a dissimilarity function on X which is either observed directly or derived from a data set.
For an electrical network there are two functions on the set of the nodes defined by the resistance matrix and the response ...
Added: May 28, 2026
Mokienko O., Zisman M. A., Bobrov P. et al., American Journal of Physical Medicine and Rehabilitation 2026 Vol. 105 No. 6 P. 555–563
Brain-computer interfaces (BCIs) represent a promising technology for restoring lower limb motor functions and gait after stroke. The application of BCIs in this field is supported by a limited number of studies. The objective of the review was to systematically and critically evaluate the current evidence on the use of BCIs for lower limb function ...
Added: May 28, 2026
Kazimirov D., Rybakova E., Vitalii V. Gulevskii et al., IEEE Access 2025 Vol. 13 P. 20101–20132
The Hough (discrete Radon) transform (HT/DRT) is a digital image processing tool that has become indispensable in many application areas, ranging from general image processing to neural networks and X-ray computed tomography. The utilization of the HT in applied problems demands its computational efficiency and increased accuracy. The de facto standard algorithm for the fast ...
Added: May 28, 2026
Kazimirov D., Vitalii Gulevskii, Kroshnin A. et al., Mathematics 2026 Article 1136
The Hough transform (HT) is widely used in computer vision, tomography, and neural networks. Numerous algorithms for HT computation have been proposed, making their systematic comparison essential. However, existing comparative methodologies are either non-universal and limited to certain HT formulations, or task-oriented, relying on application-specific criteria that do not fully capture algorithmic properties. This paper ...
Added: May 28, 2026
Yerbolova A. S., Tomashchuk K., Kogan A. et al., Complexity 2026 Vol. 2026 No. 1 Article 5519690
Tis paper presents a novel approach to analyzing and grouping natural languages based on the degree of their chaoticity. It clusters 52 languages from 18 language families, according to the value of the entropy–complexity pair, to reveal the chaotic properties of semantic trajectories. Te obtained clusters appear to be closely correlated with the family of ...
Added: February 16, 2026
Vasilii A. Gromov, Quynh Nhu Dang, Alexandra S. Kogan et al., PeerJ Computer Science 2024 Vol. 10 Article e2550
This paper concerns the problem of distinguishing human-written and bot-generated texts. In contrast to the classical problem formulation, in which the focus falls on one type of bot only, we consider the problem of distinguishing texts written by any person from those generated by any bot; this involves analysing the large-scale, coarse-grained structure of the ...
Added: November 14, 2024
Gromov V., Tomashchuk K., Rukavishnikov A., Qubahan Academic Journal 2024 Vol. 4 No. 3
This paper proposes a new algorithm for the multi-step-ahead prediction of chaotic time series within the framework of the clustering-based forecasting paradigm. The introduction of the concept of non-predictable points enabled to avoid the exponential growth of the prediction error as a function of the number of steps ahead, which made it possible to develop ...
Added: September 27, 2024
Vasilii A. Gromov, Philip S. Baranov, Complexity 2023 Vol. 2023 Article 6689371
This paper introduces several novel strategies for multi-step-ahead prediction of chaotic time series. Introducing a concept of “generalized z-vectors” (vectors of nonsuccessive time series observations) makes it possible to generate sets of possible prediction values for each point we are trying to predict. +rough examining these sets, uni8ed predictions are calculated, which are in turn ...
Added: September 22, 2023
Vasilii A. Gromov, Yury N. Beschastnov, Korney K. Tomashchuk, PeerJ Computer Science 2023 Vol. 9 No. Article e1254
The paper deals with a generalized relational tensor, a novel discrete model to store information about a time series, and algorithms (1) to construct the model, (2) to generate a time series from the model, and (3) to predict a time series. The algorithms combine the concept of generalized z-vectors with ant colony optimization techniques. ...
Added: January 31, 2023
Dmitriev A., Kazmina A., Dmitriev V. et al., , in: 14th Chaotic Modeling and Simulation International Conference.: Springer, 2022. P. 121–133.
Added: July 13, 2022
Gromov V., Borisenko E. A., Neural Computing and Applications 2015 Vol. 26 No. 8 P. 1827–1838
Predictive clustering algorithm based upon modified Wishart clustering technique is applied to predict chaotic time series. Concept of predictable and non-predictable observations is introduced in order to distinguish between reliable and unreliable predictions and, consequently, to enhance an ability to predict up to considerable number of positions ahead. Non-predictable observations are easily ascertained in the ...
Added: September 27, 2018