?
Представления ребер гиперграфов обобщенными путями
Дискретный анализ и исследование операций. 2023. Т. 30. № 3(157). С. 81–95.
Vyalyi M., Карпов В. Е.
We consider a problem of realization of hypergraphs on graphs provided each hyperedge is realized by a subgraph in which exactly two vertices have odd degree. This problem is related to Cycle Double Cover conjecture. We prove that checking the existence of realization is computationally hard. The hardness is proved in various settings: for realizations on all graphs, on simple graphs, and on graphs from several restricted classes.
Snegirev A., Sychev S., Futures 2026 Vol. 183 P. 1–22
This study addresses the systemic identification and categorization of risks associated with AI development, arising from tensions between technological evolution and institutional, infrastructural, and economic contexts. Drawing on a constructionist methodology, we interpret technological risks as constitutive elements of expert communities' images of the future. Through in-depth interviews with 100 AI experts, proportionally representing corporate, ...
Added: September 23, 2026
Parshakov P., Paklina S., International Journal of Human-Computer Interaction 2026 P. 1–17
This study examines how emotional tone shapes user preference in human–large language model (LLM) interaction. Drawing on the Computers as Social Actors framework, we treat conversational AI as a social communicator whose affective cues influence user judgments. Using large-scale pairwise preference data from LMSYS Chatbot Arena, we model emotional tone through the Valence–Arousal–Dominance framework and ...
Added: September 23, 2026
Andrabi U., Wadood E., Ojha S. K. et al., IEEE Access 2026 Vol. 14 P. 103358–103375
The emergence of 5G networks, aimed at accommodating diverse service requirements such as enhanced Mobile Broadband (eMBB), Ultra-Reliable Low-Latency Communication (URLLC), and massive Machine-Type Communication (mMTC), has presented significant challenges in radio resource management and network slicing. In dynamic heterogeneous network systems, traditional heuristics and mathematical programming methods find it challenging to attain scalable multi-objective ...
Added: September 23, 2026
Paklina S., Parshakov P., Elena Rapoport, Scientometrics 2026 P. 1–26
Generative artificial intelligence has become a routine part of academic writing. While much of the debate has focused on questions of integrity and authorship, less attention has been paid to how AI-assisted writing may affect research evaluation itself. This paper asks a straightforward but important question: does the use of LLMs in academic writing change ...
Added: September 23, 2026
Kertesz-Farkas A., Acquaye F. L., Journal of Proteome Research 2026 Vol. 25 P. 3764–3768
Ultimately, most tandem mass spectrometry (MS/MS) proteomics experiments aim to not just detect but also quantify the proteins in a given complex sample. Here, we describe an extension to the Crux MS/MS analysis toolkit to enable label-free quantification of peptides. We demonstrate that Crux’s new quantification command, which is modeled after the algorithms implemented in ...
Added: September 23, 2026
Maddalena L., Yildiz B., Del Vecchio Blanco F. et al., Risk Analysis 2026 Vol. 46 No. 4 P. 1–26
Heated tobacco products (HTPs) are marketed as alternatives to conventional cigarettes with a potential reduced risk profile. Yet, their actual impact on cancer and noncancer disease risk remains uncertain and requires rigorous quantitative assessment. In this study, we develop a unified and transparent computational framework for toxicological risk assessment of HTPs, integrating chemical emissions data ...
Added: September 22, 2026
Дильмухаметова Алия Мидхатовна, Напалков В. В., Муллабаева А. У., Уфимский математический журнал 2010 Т. 2 № 1 С. 52–58
В данной статье введены обобщённые пространства Фока и рассмотрены основные свойства этих пространств. Найдена операция, сопряженная к операции умножения на переменную в обобщенном пространстве Фока. Также определены собственные функции сопряженного оператора. Изучены обобщенное преобразование Лапласа и задача построения базиса для введенных пространств. ...
Added: September 21, 2026
Aleksei Samarin, Alexander Savelev, Aleksei Toropov et al., Pattern Recognition and Image Analysis 2024 Vol. 34 No. 3 P. 855–862
Tasks related to the automation of medical data processing are becoming more urgent. Particular attention is paid to systems for monitoring and analyzing human physiological parameters. Such systems often use specialized sensors to capture biomedical images, such as infrared cameras. This article describes our study of the problem of segmenting the eye pupil and iris ...
Added: September 21, 2026
Aleksei Samarin, Nazarenko A., Alexander Savelev et al., Pattern Recognition and Image Analysis 2024 Vol. 34 No. 3 P. 844–854
Improving image quality is becoming an increasingly popular task, especially when working with mobile devices. One common approach to image enhancement is the use of convolutional neural networks. However, to achieve good results, such networks must be large enough, otherwise there is a risk of unwanted artifacts. In addition, large convolutional neural networks require significant ...
Added: September 21, 2026
Aleksei Samarin, Alexander Savelev, Aleksei Toropov et al., Optical Memory and Neural Networks (Information Optics) 2024 Vol. 33 P. 424–434
This study explores the development of classifiers for microbial images, specifically focusing on streptococci captured via microscopy of live samples. Our approach uses AutoML-based techniques and automates the creation and analysis of feature spaces to produce optimal descriptors for classifying these microscopic images. This technique leverages interpretable taxonomic features based on the external geometric attributes ...
Added: September 21, 2026
Aleksei Samarin, Aleksei Toropov, Alexander Savelev et al., Pattern Recognition and Image Analysis 2024 Vol. 34 No. 4 P. 1053–1060
This paper presents a novel approach to classification in biomedical imaging, specifically targeting polyp recognition in video endoscopy snapshots. Our method leverages specialized image descriptors to enhance the accuracy and robustness of polyp recognition. By employing these specialized descriptors, we address the challenges inherent in analyzing biomedical images from open datasets. Our approach not only ...
Added: September 21, 2026
Самарин А. В., Торопов А. Г., Савельев А. Г. et al., Pattern Recognition and Image Analysis 2024 Vol. 34 No. 4 P. 1044–1052
This paper presents a study aimed at improving the detection quality of small-sized microorganisms under challenging microscopic conditions through the application of a lightweight combined image preprocessing model. We focused on the task of detecting diplococci in images obtained through dynamic sample microscopy. The proposed approach employs predefined filters for image preprocessing, combined with the ...
Added: September 21, 2026
Singapore: Springer Singapore, 2025.
Added: September 21, 2026
Onoprienko A., Доклады Российской академии наук. Математика, информатика, процессы управления (ранее - Доклады Академии Наук. Математика) 2025 № 527 С. 206–216
We study the algorithmic complexity of the cooperative card game Hanabi. The feature of Hanabi is that players see each other’s cards but not their own, and exchange information through hints. Even in the model with one player who has full information about the deck, Hanabi remains NP-hard. We found the minimal parameters ofthe game ...
Added: November 23, 2025
M. N. Vyalyi, Karpov V. E., Journal of Applied and Industrial Mathematics (перевод журналов "Сибирский журнал индустриальной математики" и "Дискретный анализ и исследование операций") 2023 Vol. 17 No. 3 P. 678–686
We consider the problem of realization of hypergraphs on a graph provided each hyperedge is realized by a subgraph in which exactly two vertices have odd degree. This problem is related to Cycle Double Cover conjecture. We prove that checking the existence of realization is computationally hard. The hardness is proved in various settings: for ...
Added: November 30, 2023
S. M. Dudakov, Karlov B. N., S. L. Kuznetsov et al., Algebra and Logic 2021 Vol. 60 No. 5 P. 308–326
The Lambek calculus with the unit can be defined as the atomic theory (algebraic logic) of the class of residuated monoids. This calculus, being a theory of a broader class of algebras than Heyting ones, is weaker than intuitionistic logic. Namely, it lacks structural rules: permutation, contraction, and weakening. We consider two extensions of the ...
Added: November 12, 2023
Vasilyeva E., Romance M., Ivan Samoylenko et al., Entropy 2023 Vol. 25 No. 6 Article 923
We explore the metric structure of networks with higher-order interactions and introduce a novel definition of distance for hypergraphs that extends the classic methods reported in the literature. The new metric incorporates two critical factors: (1) the inter-node distance within each hyperedge, and (2) the distance between hyperedges in the network. As such, it involves ...
Added: July 28, 2023
Дугинов О. И., Кускова Б. М., Malyshev D. et al., Труды института математики и механики УрО РАН 2022 Т. 28 № 2 С. 114–142
Подмножество вершин графа называется диссоциирующим, если степени вершин подграфа, порожденного этим подмножеством, не превосходят 1. Диссоциирующее множество максимально, если оно не содержится ни в каком другом диссоциирующем множестве с бо́льшим числом вершин. В данной работе предлагаются оценки наибольшего (наименьшего) числа вершин в максимальном диссоциирующем множестве графа. Доказано, что задача нахождения максимального диссоциирующего множества наибольшей мощности ...
Added: September 19, 2022
Balobanov A., Shabanov D. A., Discrete Mathematics 2021 Vol. 344 No. 3 Article 112231
This paper deals with estimating the threshold for the strong -colorability of a random 3-uniform hypergraph in the binomial model H(n,3,p). A vertex coloring is said to be strong for a hypergraph if every two vertices sharing a common edge are colored with distinct colors. It is known that the threshold corresponds to the sparse ...
Added: November 27, 2020
Shabanov D. A., Шайхеева Т. М., Математические заметки 2020 Т. 107 № 3 С. 454–465
This paper deals with list colorings of uniform hypergraphs. Let H(m, r, k) be the complete r-partite k-uniform hypergraph with parts of equal size m in which each edge contains exactly one vertex from some k ≤ r parts. Using results on multiple covers by independent sets, we establish that, for fixed k and r, ...
Added: June 14, 2020
Shabanov D. A., Крохмаль Н. Е., Кравцов Д. А., Дискретная математика 2019 Т. 31 № 2 С. 84–113
Работа посвящена изучению пороговой вероятности наличия полноцветной раскраски в r цветов у случайного k-однородного гиперграфа в биномиальной модели H(n,k,p), т.е. такой раскраски, что каждое ребро гиперграфа содержит вершины всех r цветов. Показано, что данная пороговая вероятность при фиксированных r<k и растущем n отвечает разреженному случаю, т.е. случаю линейного среднего числа ребер cn для положительного фиксированного ...
Added: June 5, 2019
Klemashev N., Шананин А. А., Труды Московского физико-технического института 2015 Т. 7 № 4 С. 17–27
We prove NP-completeness of nonparametric test for the model of temporal dictator with several dictators with positively-homogeneous utility functions. ...
Added: March 5, 2019
Avdoshin S. M., Набебин А. А., М.: ДМК Пресс, 2019.
The book contains the necessary information from the algorithm theory, graph theory, combinatorics. It is considered partially recursive functions, Turing machines, some versions of the algorithms (associative calculus, the system of substitutions, grammars, Post's productions, Marcov's normal algorithms, operator algorithms). The main types of graphs are described (multigraphs, pseudographs, Eulerian graphs, Hamiltonian graphs, trees, bipartite ...
Added: August 24, 2018
Shabanov D. A., Kupavskii A., Combinatorics Probability and Computing 2018 Vol. 27 No. 2 P. 245–273
This paper deals with a combinatorial problem concerning colourings of uniform hypergraphs
with large girth. We prove a new lower bound for the maximum edge degree for an n-uniform non-r-colourable simple hypergraph. As an application of our probabilistic technique we establish a lower bound for the classical
van der Waerden number W(n, r), the minimum natural N ...
Added: February 22, 2018