?
Теоретико-вероятностная модель полутонового изображения для задачи распознавания образов без учителя на основе метода направленного перебора
Компьютерная оптика. 2011. Т. 35. № 3. С. 385–394.
Loubenets E. R., / Series arxiv.org "quant-ph". 2026. No. 2607.18050.
In many quantum applications it is important to know whether or not a Bell nonlocal two-qudit state exhibits its nonlocality under correlation scenarios with some given numbers S1,S2≥1 of generalized quantum measurements at two sites. In the present article, we find analytically a new general locality condition sufficient for a nonseparable Werner state with a ...
Added: July 21, 2026
Bolbachan V., / Series math "arxiv.org". 2024.
Chow polylogarithms are some special functions arising in explicit description of the Beilinson regulator map. The most interesting functional equation for this function reflects its vanishing on the boundary in the Bloch's cycle complex. We show that this functional equation formally follows from more simple ones, namely skew-symmetry, functoriality and multiplicativity.
To prove this, we study ...
Added: July 16, 2026
Bolbachan V., / Series math "arxiv.org". 2024.
Let K be a field of characteristic zero. We prove that its motivic cohomology in degree m−1 and weight m is rationally isomorphic to the cohomology of the polylogarithmic complex. This gives a partial extension of A. Suslin theorem describing the indecomposable K3 of a field. ...
Added: July 16, 2026
Panov V., Ryabchenko A., / Series arXiv "stat.ME". 2026. No. 2607.05048.
This paper investigates the problem of statistical inference for a mixture distribution consisting of a discrete and a continuous component, with a particular focus on the class of rational-infinitely divisible distributions. We consider non-parametric estimation of both components of the mixture as well as the quasi-L{é}vy measure, assuming that the mixture belongs to the class ...
Added: July 9, 2026
Novopoltsev M., Tulenkov A., Murtazin R. et al., IEEE Access 2025 Vol. 13 P. 188170–188181
Video-based Isolated Sign Language Recognition (ISLR) problem presents significant challenges in scaling across diverse languages due to data scarcity and the computational costs associated with training of language-specific models. In this paper, we introduce a novel training pipeline that leverages self-supervised learning on a large-scale sign language dataset. To obtain the foundation model, we utilize ...
Added: June 16, 2026
Konakov V., Kucher D., Mammen E., / Series arXiv "math". 2026. No. 2606.11142v1.
In this paper, we construct strong approximations for discrete-time Markov chains weakly converging to continuous diffusion processes, as well as for their perturbed counterparts. Under the assumption of bounded coefficients, we construct closely coupled versions of these processes on a shared probability space. In particular, for both non-degenerate and degenerate cases, we maximize the probability ...
Added: June 11, 2026
Гущина В. А., / Series chemrxiv-2023-vpzhz-v2 "ChemRxiv". 2023.
All-inorganic perovskite CsPbBr3 and Cs4PbBr6 nanoparticles are being intensively studied due to their unique properties and wide range of applications; however, however, the nature of their optical properties is not yet fully understood due to the difficulty of synthesis of singlephase nanoparticles. In this article we describe the features of the synthesis of single-phase particles ...
Added: May 14, 2026
Dorovskiy A., / Series arXiv "math". 2026.
In this paper the structural stability of generic families of vector fields of the PC-HC class on the two-dimensional sphere is proved. A classification of these families up to moderate equivalence in neighborhoods of their large bifurcation supports is presented, based on such invariants as the configuration and the characteristic set. The realization lemma is proved. ...
Added: May 14, 2026
Taletskii D., / Series arXiv "math". 2026.
A vertex subset of a graph is called a \textit{distance-$k$ independent set} if the distance between any two of its distinct vertices is at least $k + 1$. For all $n,k \geq 1$, we determine the minimum possible number of inclusion-wise maximal distance-$k$ independent sets among all $n$-vertex trees. It equals~$n$ if $n \leq k ...
Added: May 1, 2026
Ovcharenko M., / Series arXiv "math". 2026.
We introduce an explicit class of tempered Laurent polynomials in the sense of Villegas and Doran--Kerr in n⩽4 variables including all Landau--Ginzburg models for smooth Fano threefolds with very ample anticanonical class. We check that it contains Landau--Ginzburg models for various Fano fourfolds which are complete intersections in smooth toric varieties and Grassmannians of planes, ...
Added: April 30, 2026
Pilé I., Deng Y., Shchur L., / Series arXiv "math". 2026. No. 2604.10254.
We investigate the spatial overlap of successive spin configurations in Markov chain Monte Carlo simulations using the local Metropolis algorithm and the Svendsen-Wang and Wolff cluster algorithms. We examine the dynamics of these algorithms for two models in different universality classes: the Ising model and the Potts model with three components. The overlap of two ...
Added: April 20, 2026
Zlotnik Alexander, / Series arXiv "math". 2026. No. 2602.03481v1.
We deal with the global in time weak solutions to the 1D compressible Navier-Stokes system of equations for large discontinuous initial data and nonhomogeneous boundary conditions of three standard types. We prove the Lipschitz-type continuous dependence of the solution $(\eta,u,\theta)$, in a norm slightly stronger than $L^{2,\infty}(Q)\times L^2(Q)\times L^2(Q)$, on the initial data $(\eta^0,u^0,e^0)$ in a ...
Added: April 18, 2026
Medvedev V., / Series arXiv "math". 2026.
We investigate the interplay between the dimension of the space of static potentials and the geometric and topological structure of the underlying static three-manifold. A partial classification of boundaryless static manifolds is obtained in terms of this dimension. We also treat the case of static manifolds with boundary. In particular, we prove that if a ...
Added: April 3, 2026
Gabdullin N., Androsov I., / Series Computer Science "arxiv.org". 2026.
Label prediction in neural networks (NNs) has O(n) complexity proportional to the number of classes. This holds true for classification using fully connected layers and cosine similarity with some set of class prototypes. In this paper we show that if NN latent space (LS) geometry is known and possesses specific properties, label prediction complexity can ...
Added: April 2, 2026
Kolesnikov A., / Series arXiv "math". 2025.
We study Blaschke--Santal{ó}-type inequalities for N>=2 sets (functions) and a special class of cost functions. In particular, we prove new results about reduction of the maximization problem for the Blaschke--Santal{ó}-type functional to homogeneous case (functional inequalities on the sphere) and extend the symmetrization argument to the case of N>2 sets.
We also discuss links to the ...
Added: February 13, 2026
Sorokin K., Beketov M., Онучин А. et al., / arxiv.org. Серия cs.SI "Social and Information Networks ". 2025.
Community detection in complex networks is a fundamental problem, open to new approaches in various scientific settings. We introduce a novel community detection method, based on Ricci flow on graphs. Our technique iteratively updates edge weights (their metric lengths) according to their (combinatorial) Foster version of Ricci curvature computed from effective resistance distance between the ...
Added: January 15, 2026
Gaianov N., Parusnikova A., / Cornell University. Серия math "arxiv.org". 2025.
An algebraic q-difference equation is considered. A sufficient condition for the existence of a formal power-logarithmic expansion of a solution to such an equation in the neighborhood of zero is proposed. An example of applying this sufficient condition for constructing a formal expansion of a solution to a certain q-difference analogue of the fifth Painlevé equation ...
Added: December 25, 2025
Varshavskaya E., Социологические исследования 2023 № 4 С. 94–105
В статье анализируются масштабы внутрифирменного обучения выпускников вузов, описываются его основные практики, определяются факторы участия в обучении. Эмпирической основой выступают данные федерального обследования выпускников вузов, завершивших обучение в 2016-2020 гг. Около четверти выпускников проходили дополнительное обучение в первый год работы. Вероятность дообучения выше для выпускников-очников, занимающих позиции специалиста. Она не зависит от того, работает выпускник ...
Added: May 4, 2023
Илья А. Коршунов, Наталия Н. Ширкова, Образование и саморазвитие 2022 Т. 17 № 2 С. 203–218
Настоящая публикация посвящена анализу трансформации программ, направленных на
обучение взрослого населения, в условиях социального дистанцирования и перехода на
дистанционный формат обучения в связи с распространением коронавирусной инфекции
в Российской Федерации. Источником сбора данных послужили платформы-интеграторы,
предоставляющие программы непрерывного образования (Coursera, Timepad, Edumarket).
Изменение предложения программ исследуется на основе контента-анализа образовательных мероприятий, предлагаемых в 2019 году и в 2020 году.
Спрос на ...
Added: July 11, 2022
Гринберг Э. Я., Pleshkova A., Открытое образование 2018 Т. 22 № 2 С. 14–26
The article is devoted to the identification of key features of training specialists in knowledge management and systematization of information sources available to them. The relevance of the subject is related to the growing need for managerial personnel, capable of organizing work with knowledge at the enterprise in order to achieve competitive advantages.
The study examined ...
Added: June 24, 2020
Savchenko L., Информационные технологии 2019 Т. 25 № 5 С. 313–318
We consider a problem of computer assisted language and pronunciation learning based on the deep learning methods and the information theory of speech perception. In order to improve the efficiency of testing of pronunciation quality, we propose to train a convolutional neural network using the best reference utterances from the user. The experimental results proved ...
Added: May 29, 2019
Savchenko A., , in: International Joint Conference on Rough Sets, Springer, Cham.: Springer, 2017. P. 264–277.
In this paper it is proposed to improve performance of the automatic speech recognition by using sequential three-way decisions. At first, the largest piecewise quasi-stationary segments are detected in the speech signal. Every segment is classified using the maximum a-posteriori (MAP) method implemented with the Kullback-Leibler minimum information discrimination principle. The three-way decisions are taken ...
Added: October 26, 2018
Savchenko L., Телекоммуникации 2017 № 5 С. 42–48
The paper is devoted to the automatic assessment of phoneme pronunciation quality for computer assisted language learning systems. The novel pronunciation training algorithm is proposed. In this algorithm, at first, a student has to achieve a stable pronunciation of all sounds by using the phonetic database from ideal speaker. The second, novel, stage of our ...
Added: October 24, 2018
Savchenko A., Belova N. S., / Series "Working papers by Cornell University". 2017.
The paper deals with the still-to-video face recognition for the small sample size problem based on computation of distances between high-dimensional deep bottleneck features. We present the novel statistical recognition method, in which the still-to-video recognition task is casted into Maximum A Posteriori estimation. In this method we maximize the joint probabilistic density of the ...
Added: August 29, 2017