?
The Problem of a Symmetric Graph with a Maximum Number of Vertices and Minimum Diameter
Lobachevskii Journal of Mathematics. 2023. Vol. 44. No. 12. P. 5453–5459.
The paper gives a solution for the problem of the topology of the communication subsystem graph for high-performance multi-core computing systems. In this graph, each vertex is connected to four neighbors, and the number of vertices is the maximum for a given graph diameter. The solution to this problem is the family of circulants C(D(D+1)+1; 1, 2D+1) , D – diameter. This graph is invariant under transforming its arbitrary vertex into any other, and its vertices are located densely in the vicinity of the root vertex, which determines its compliance with the diameter optimality criterion. All statements formulated during the solution of the problem are proven.
Language:
English
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
Arutyunov K., JIANG1 Q., FANG J. et al., Science China Information Sciences 2026 Vol. 69 No. 6 P. 1–11
Resonators based on nanoelectromechanical systems (NEMS) using two-dimensional (2D) materials with high-quality factors and excellent electrical control are critical for tunable coherent phonon dynamics, resonant sensors and wireless communications. However, their performance is fundamentally limited by the lack of a unified framework governing energy dissipation mechanisms and their electrical tunability. Here, we synergistically modulate both ...
Added: May 28, 2026
М.: Институт проблем управления им. В.А. Трапезникова РАН, 2024.
В сборник вошли материалы VIII Международной научной конференции «Информационные технологии и технические средства управления» (ICCT-2024). На конференции были рассмотрены вопросы, касающиеся перспектив развития научного приборостроения в телекоммуникационных и управляющих системах, биомедицинской информатики, аппаратного и программного обеспечения информационнокоммуникационных систем, надежности, диагностики и неразрушающего контроля, систем управления и автоматизации, цифровых экосистем, управления производством и логистикой, методов математического ...
Added: May 27, 2026
Degtyarev A., Bakhurin S., Yudin N., DSPA 2026 P. 1–6
This paper investigates one possible solution to the problem of self-interference cancellation (SIC) arising in the design of in-band full-duplex (IBFD) communication systems. Self-interference cancellation is performed in the digital domain using multilayer nonlinear models adapted via gradient-based optimization. The presence of local minima and saddle points during the adaptation of multilayer models limits the ...
Added: May 26, 2026
Ilyashenko Y., Shilin I., Stanislav Minkov, Russian Journal of Mathematical Physics 2026 Vol. 33 No. 1 P. 89–106
In this paper, new numerical invariants of structurally unstable vector fields in the plane
are found. One of the main tools is an improved asymptotics of sparkling saddle connections that
occur when a separatrix loop of a hyperbolic saddle breaks. Another main tool is a new topological
invariant of two arithmetic progressions, both perturbed and unperturbed, on the ...
Added: May 26, 2026
Androsov I., Proceedings of the Institute for System Programming of the RAS 2026 Vol. 38 No. 3 P. 87–114
This paper examines echo state networks (ESNs), one of the most prevalent approaches to
implementing reservoir computing. An ESN consists of a recurrent neural network with fixed (untrained)
weights and a readout layer that is typically linear and trainable. This approach enables the creation of energyefficient and computationally efficient neural networks capable of real-time learning. However, since ...
Added: May 26, 2026
Gusev I., Maksaev A., Promyslov V., Journal of Mathematical Sciences 2025 Vol. 299 No. 6
The regular graph of the space of n × m matrices over a field F is defined as the undirected graph whose vertices are matrices of rank min(n, m), and distinct matrices A and B are connected by an edge if and only if rk(A + B) < min(n, m). In this paper, for |F| ...
Added: May 25, 2026
Караваева Е. А., Кулигин Л. А., Rezunik L. et al., Труды Института системного программирования РАН 2026 Т. 38 № 3 С. 67–94
В статье представлен метод рефакторинга исходного кода на основе интеграции большой языковой модели (LLM) и расширенной UML-модели программного кода. Предложенный подход позволяет выявлять проблемные участки кода с использованием функций тревожности и структурных метрик классов, а затем выполнять автоматизированный рефакторинг. Ключевой особенностью метода является использование LLM для генерации формальных спецификаций на языке OCL (Object Constraint Language), ...
Added: May 24, 2026
Tyukin I., Tyukina T., van Helden D. P. et al., Information Sciences 2024 Vol. 678 Article 120856
AI errors pose a significant challenge, hindering real-world applications. This work introduces a novel approach to cope with AI errors using weakly supervised error correctors that guarantee a specific level of error reduction. Our correctors have low computational cost and can be used to decide whether to abstain from making an unsafe classification. We provide ...
Added: May 23, 2026
Zaikin A., Sviridov I., Sosedka A. et al., Technologies 2026 Vol. 14 No. 2 Article 84
High-dimensional tabular data are common in biomedical and clinical research, yet conventional machine learning methods often struggle in such settings due to data scarcity, feature redundancy, and limited generalization. In this study, we systematically evaluate Synolitic Graph Neural Networks (SGNNs), a framework that transforms high-dimensional samples into sample-specific graphs by training ensembles of low-dimensional pairwise ...
Added: May 23, 2026
Malikov M., Romanov A., IEEE Access 2025 Vol. 13 P. 148803–148815
Networks-on-chip (NoCs) widespread in computing system design are used in many applications. A critical NoC aspect is the interaction between computing cores and in particular the traffic patterns. The relevance of this work stems from the fact that traffic patterns in NoCs are poorly understood and have no general classification; and there are no universal ...
Added: September 16, 2025
Romanov A., Lerner A., Amerikanov A., The Journal of Supercomputing 2024 No. 80 P. 22462–22478
On-chip networks (NoCs) have become a popular choice for designing large multiprocessor architectures. Software-based emulation is often used to perform the design verifcation. However, if the considered design is sufciently large, softwarebased emulation becomes impractically slow. To avoid this limitation, multi-FPGA emulation was introduced, where multiple interconnected FPGAs collectively emulate a single circuit. The number ...
Added: June 30, 2024
Mikhail Yu. Romashikhin, , in: Proceedings 2024 International Russian Smart Industry Conference (SmartIndustryCon), 25-29 March 2024.: Sochi: IEEE, 2024. P. 104–108.
This article describes the implementation of regular topologies for networks-on-chip. The complexity of network development and its main parameters depend on the choice of topology. The rationale for the influence of topology on network bandwidth is given. Software that automates the generation of configuration files (bitstream) for the implementation of networks-on-chip with different topologies and ...
Added: May 13, 2024
Sukhov A., Romanov A., Selin M., Symmetry 2024 Vol. 16 No. 1 Article 127
In this work, the circulant topology as an alternative to 2D mesh in networks-on-chip is considered. A virtual coordinate system for numbering nodes in the circulant topology is proposed, and the principle of greedy promotion is formulated. The rules for constructing the shortest routes between the two nodes based on coordinates are formulated. A technique ...
Added: March 8, 2024
Sukhov A., Romanov A., Глушак Е. В., Ученые записки Казанского университета. Серия: Физико-математические науки 2023 Т. 165 № 3 С. 282–293
The article discusses routing methods in two-dimensional circulant graphs (each vertex is connected to four neighboring ones). The unique group of symmetries of the circulant graph makes it possible to use it as a topology for high performance computing devices, including networks-on-chip and cluster supercomputers. It is shown that the minimum number of transitions along ...
Added: January 5, 2024
Romanov A., Big Data and Cognitive Computing 2023 Vol. 7 No. 2 Article 80
This article presents software for the synthesis of circulant graphs and the dataset obtained. An algorithm and new methods, which increase the speed of finding optimal circulant topologies, are proposed. The results obtained confirm an increase in performance and a decrease in memory consumption compared to the previous implementation of the circulant topologies synthesis method. ...
Added: June 4, 2023
Aleksandr Y. Romanov, Nikolay M. Myachin, Evgenii V. Lezhnev et al., Micromachines 2023 Vol. 14 No. 1 Article 141
This article considers the usage of circulant topologies as a promising deadlock-free topology for networks-on-chip (NoCs). A new high-level model, Newxim, for the exploration of NoCs with any topology is presented. Two methods for solving the problem of cyclic dependencies in circulant topologies, which limit their applications for NoCs due to the increased possibility of ...
Added: January 31, 2023
El-Mesady A., Romanov A., Amerikanov A. et al., Algorithms 2023 Vol. 16 No. 1 Article 10
Recent developments in commutative algebra, linear algebra, and graph theory allow us to approach various issues in several fields. Circulant graphs now have a wider range of practical uses, including as the foundation for optical networks, discrete cellular neural networks, small-world networks, models of chemical reactions, supercomputing and multiprocessor systems. Herein, we are concerned with ...
Added: January 17, 2023
Monakhova E. A., Monakhov O. G., Romanov A., IEEE Transactions on Network Science and Engineering 2023 Vol. 10 No. 1 P. 413–425
The solution of the problem of organizing optimal communications in circulant networks of degree four is considered. For a family of optimal circulant networks with the minimum diameter and average distance for any number of nodes in a graph, we propose an optimal pair routing algorithm of constant complexity based on using the relative addressing ...
Added: November 18, 2022