?
Алгоритм оценки спектральной корреляционной функции с использованием двумерного быстрого преобразования Фурье
Радиотехника и электроника. 2023. Т. 68. № 8. С. 782–789.
An algorithm for estimating the spectral correlation function of cyclostationary random processes on the basis of their finite-time realization is proposed. The main algorithm steps are described and the main operations performed at each of them are formalized. The presented estimates of the spectral correlation function in the presence of a correlated stationary noise overlapping the analyzed cyclostationary random process in the frequency domain confirm the efficiency of the algorithm with a low signal-to-noise ratio. The number of required computational operations and the amount of computer memory required for storing intermediate results are estimated.
Language:
Russian
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
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
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
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
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
Chertopolokhov V., Mukhamedov A., Bugriy G. et al., IEEE Access 2026 Vol. 14 P. 14369–14392
This study presents on-the-fly identification and multi-step prediction of nonlinear systems with delayed inputs using a dynamic neural network combined with a smooth projection onto ellipsoids. The projection enforces parameter constraints that guarantee stability, while a Lyapunov–Krasovskii analysis yields computable ultimate error bounds. Riccati-type matrix inequalities are derived, providing an efficient vectorization–projection–devectorization implementation suitable for ...
Added: May 22, 2026
Морозов С. В., Calcolo 2026 Vol. 63 No. 2 Article 23
The approximation of tensors in a low-para metric format is a crucial component in many mathematical modelling and data analysis tasks. Among the widely used low-parametric representations, the canonical polyadic (CP) decomposition is known to be very efficient. Nowadays, most algorithms for CP approximation aim to construct the approximation in the Frobenius norm; however, some ...
Added: May 22, 2026
Jin S., Komarov M. M., Scientific Reports 2026
Intrabody communication (IBC) channels offer physiological diversity that can be leveraged for passive biometric identification in wearable devices. Recent reports of over 99 per cent identification accuracy have frequently resulted from data leakage, where samples from the same subject are seen in both training and evaluation, yielding inflated and unreliable metrics. In this work, we ...
Added: May 21, 2026
Селянин Ф. И., Journal of Dynamical and Control Systems 2026 Vol. 32 No. 2 Article 18
A B-facet is a lattice -dimensional polytope in the positive octant with a positive normal covector, such that every -dimensional simplex with vertices in it is a B-simplex (i.e., a pyramid of height one with base on a coordinate hyperplane). B-facets were introduced in [2] in the context of the monodromy conjecture. In this paper, we complete the ...
Added: May 21, 2026
Ausubel L., Baranov O., Journal of Economic Theory 2026 Vol. 235 Article 106192
The Vickrey-Clarke-Groves (VCG) mechanism is one of the most compelling constructs in mechanism design, but the presence of complementary goods creates the possibility of non-core and even zero-revenue outcomes. In this article, we show that joint feasibility constraints on allocations offer a second pathway to ill-behaved outcomes in the VCG mechanism, even when all bidders ...
Added: May 20, 2026
Denis Seliutskii, Russian Journal of Mathematical Physics 2025 Vol. 32 No. 2 P. 399–407
In this paper, we find an upper bound for the first Steklov eigenvalue for a surface of revolution with boundary consisting of two spheres of different radii. Moreover, we prove that, in some cases, this boundary is sharp. ...
Added: May 19, 2026
Жакупов О. Б., European Journal of Mathematics 2025 Vol. 11 Article 84
We provide examples of smooth three-dimensional Fano complete intersections of degree 2, 4, 6, and 8 that have absolute coregularity 0. Considering the main theorem of Avilov, Loginov, and Przyjalkowski (CNTP 18:506–577, 2024) on the remaining 101 families of smooth Fano threefolds, our result implies that each family of smooth Fano threefolds has an element of absolute ...
Added: May 18, 2026
Gurevich E., Saraev I., Известия РАН. Серия математическая 2026 Т. 90 № 3 С. 19–56
In this paper, we consider a class of gradient-like ows without heteroclinic
intersections, dened on closed manifolds of dimension four. We show that for
such ows, the problem of complete topological classication can be reduced to
the combinatorial problem of distinguishing special framed graphs describing
the mutual arrangement of invariant manifolds and the action of the ow on a
wandering ...
Added: May 18, 2026
Gonchenko S., Lerman L., Turaev D., Regular and Chaotic Dynamics 2026 Vol. 31 No. 3 P. 349–369
We show that bifurcations of four-dimensional symplectic diffeomorphisms with a quadratic homoclinic tangency to a saddle periodic orbit with real multipliers produce 2-elliptic periodic orbits if the tangency is not partially hyperbolic. We show that a normal form for the rescaled first-return maps near such tangency is given by a four-dimensional symplectic H´enonlike map and study bifurcations of the ...
Added: May 15, 2026
Aleskerov F. T., Khutorskaya O., Stepochkina A. et al., Springer, 2026.
The book contains new models of bibliometric analysis based on centrality measures in network analysis, pattern analysis and stability analysis. A distinctive feature of these centrality measures is that they account for the parameters of vertices and group influence of vertices to a vertex. This reveals specific groups of publications, authors, terms, journals and affiliations ...
Added: May 15, 2026
Kuptsov P., Panyushev A., Stankevich N., Chaos 2026 Vol. 36 No. 5 Article 053138
We develop a machine-learning approach to reproduce the behavior of two versions of the van der Pol oscillator exhibiting a subcritical Andronov–Hopf bifurcation, with or without a codimension-2 Bautin point. We construct a neural-network model that functions as a recur rent map and train it on short segments of oscillator trajectories. The results show that, ...
Added: May 15, 2026
Shevgunov T., , in: 2025 Systems of Signals Generating and Processing in the Field of on Board Communications.: IEEE, 2025. P. 1–5.
The paper presents an algorithm for processing secondary radar signals that is based on identification of the characteristic cyclic frequencies specific to the breathing signals of a motionless human. The main procedure of the algorithm consists in sequential processing of signals contained in the range lines of a radar frame. It includes pre-processing to remove ...
Added: February 25, 2026
Гущина О. А., Shevgunov T., Ефимов Е. Н. et al., Журнал радиоэлектроники 2022 № 10 Статья 1
В статье представлен подход к построению моделей сигналов со сложными видами модуляции в рамках циклостационарного подхода и предложена процедура получения конечных аналитических выражений для их спектральных корреляционных функций (СКФ), являющихся функциями двух аргументов: частоты и циклической частоты и описывающих вероятностные свойства исследуемых сигналов при их представлении в виде реализаций циклостационарных случайных процессов (ЦССП) второго порядка. ...
Added: June 6, 2024
Shevgunov T., Efimov E., Kirdyashkin V. et al., , in: Intelligent Systems Reference LibraryVol. 184: Advances in Signal Processing: Theories, Algorithms, and System Control.: Springer, 2020. P. 75–86.
This chapter presents the algorithm for estimating spectral correlation
function of a random process that is a valid bi-frequency description of the probabilistic
properties of any wide-sense cyclostationary process and relates to its cyclic
autocorrelation function via Fourier transform. The key point of the algorithm is that
it is based on the two-dimensional discrete Fourier transform of the sample ...
Added: August 25, 2020
Shevgunov T., Efimov E., Kuznetsov Y., , in: 2018 BALTIC URSI SYMPOSIUM.: IEEE, 2018. P. 184–187.
This paper presents an approach to estimating delays of the cyclostationary signal propagating through tracks of the data bus of a printed circuit board (PCB). The signal path is described by the series of delays estimated using cyclostationary characteristics in the frequency domain. A brief overview of cyclostationarity phenomena is given alongside with the designed ...
Added: April 1, 2019