?
Эффективное вычисление всех допусков в разреженной задаче о максиминном пути
Успехи математических наук. 2024. Т. 79. № 5. С. 185–186.
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
Tomat A., Sergei O. Kuznetsov, International Journal of Approximate Reasoning 2026 Vol. 197 Article 109754
Interval Pattern Structures (IPS) provide a natural way to represent local, human-readable explanations for predictions on numerical data through vectors of intervals interpreted as axis-parallel hyper-rectangles. In this paper, we develop and evaluate an IPS-based k-nearest neighbors classifier, IPS-KNN, that explains each prediction through a single local interval description rather than through the aggregation of ...
Added: September 21, 2026
Aleksei Samarin, Nazarenko A., Kotenko E. et al., / Series arXiv "math". 2025. No. 2511.20141.
This paper presents a novel approach to neural network compression that addresses redundancy at both the filter and architectural levels through a unified framework grounded in information flow analysis. Building on the concept of tensor flow divergence, which quantifies how information is transformed across network layers, we develop a two-stage optimization process. The first stage ...
Added: September 21, 2026
Дильмухаметова Алия Мидхатовна, Напалков В. В., «Doklady Mathematics» 2009 Т. 424 № 5 С. 591–593
В данной статье вводится определенный класс дифференциальных уравнений с переменными коэффициентами, который тесно связан с операцией умножения Адамара и операторами Данкла имеющими применение в математической физике. Показано, что уравнения этого класса могут быть сведены к уранвениям в обобщенных производных с постоянными коэффициентами. ...
Added: September 21, 2026
Aleksei Samarin, Alexander Savelev, Aleksei Toropov et al., Pattern Recognition and Image Analysis 2025 Vol. 35 No. 2 P. 169–178
This study explores the incorporation of specialized self-attention mechanisms into deep learning architectures, with a particular emphasis on segmenting human iris and pupil regions in infrared images. In this work, we present some modified versions of nonlocal blocks designed to enhance self-attentive properties while addressing the distinct characteristics of infrared imaging data. By applying these customized ...
Added: September 21, 2026
Sohrabi M., Фатхоллахи-Фард А. М., Gromov V., Автоматика и телемеханика 2024 № 3 С. 23–37
Генетические алгоритмы (ГА) известны своей эффективностью в решении задач комбинаторной оптимизации благодаря их способности исследовать разнообразные пространства решений, обрабатывать различные представления, использовать параллелизм, сохранять хорошие решения, адаптироваться к изменяющимся условиям, управлять комбинаторным разнообразием и проводить эвристический поиск. Тем не менее такие ограничения, как преждевременная сходимость, неспецифичность и стохастичность операторов кроссовера и мутации, делают ГА не ...
Added: May 8, 2024
Ignatov A., , in: 14th International Conference, OPTIMA 2023, Petrovac, Montenegro, September 18–22, 2023, Revised Selected Papers. Communications in Computer and Information Science (CCIS, volume 1913)Vol. 1913.: Springer, 2023. P. 173–187.
Modeling protein folding, which is the process by which a protein obtains its spacial shape, still remains a challenging problem. Protein geometry might be simplified by using the coarse-grained models. The highest level of simplification is achieved in HP-models where only polarity of amino acid residues is considered, and the unified monomers are located in nodes ...
Added: January 18, 2024
Dagaev D., Suzdaltsev A., Journal of Combinatorial Optimization 2018 Vol. 35 No. 1 P. 170–188
Before a knock-out tournament starts, the participants are assigned to positions in the tournament bracket through a process known as seeding. There are many ways to seed a tournament. In this paper, we solve a discrete optimization problem of finding a seeding that maximizes spectator interest in a tournament when spectators are interested in matches ...
Added: August 1, 2017
Pablo San Segundo ., Jorge Artieda .., Mikhail Batsyn et al., Optimization Methods and Software 2017 Vol. 32 No. 2 P. 312–335
This paper describes BBMCW, a new efficient exact maximum clique algorithm tailored for large sparse graphs which can be bit-encoded directly into memory without a heavy performance penalty. These graphs occur in real-life problems when some form of locality may be exploited to reduce their scale. One such example is correspondence graphs derived from data association ...
Added: March 9, 2017
Gribanov D., Malyshev D., Журнал Средневолжского математического общества 2016 Т. 18 № 3 С. 19–31
Мы рассматриваем естественные постановки задач о независимом множестве, о вершинном и о реберном доминирующем множестве как задач целочисленного линейного программирования и доказываем полиномиальную разрешимость этих задач для классов графов, имеющих ограниченные по абсолютному значению миноры (расширенных) матриц ограничений. ...
Added: October 20, 2016
Мешалкин В. П., Zakhodiakin G., Ходченко С. М., М.: РХТУ им. Д.И. Менделеева, 2013.
Изложены разделы теории графов и комбинаторного анализа, сущность и применение методов комбинаторной оптимизации на основе одного из широко распространенных методов комбинаторного поиска оптимальных решений – метода ветвей и границ для решения прикладных задач в химической технологии, ресурсоэнергоэффективной инженерно-технической организации сложных химико-технологических систем и логистике ресурсоэнергосбережения. Указанные задачи относятся к классу комбинаторных задач неполиномиальной сложности (NP-задач ...
Added: February 27, 2016
Lazarev A. A., Tarasov I., , in: VI International Conference on Optimization Methods and Applications "Optimization and applications" (OPTIMA-2015), Petrovac, Montenegro, September 2015.: M.: -, 2015. P. 198–199.
A railway connection of two stations by a single railway track is usually found on branch lines of railway network and is very common in various manufacturing supply chains. Our paper isДля книг на иностранных языках concerned with a scheduling problem for two stations with a single railway track with one siding. On single-track railway ...
Added: October 20, 2015
Bronnikov S., Lazarev A. A., Petrov A. S. et al., , in: VI International Conference on Optimization Methods and Applications "Optimization and applications" (OPTIMA-2015), Petrovac, Montenegro, September 2015.: M.: -, 2015. P. 196–197.
We consider the problem of planning the ISS cosmonaut training with different objectives. A pre-defined set of minimum qualification levels should be distributed between the crew members with minimum training time differences, training expenses or a maximum of the training level with a limitation of the budget. First, a description of the cosmonaut training process ...
Added: October 20, 2015
San Segundo P., Nikolaev A., Batsyn M., Computers & Operations Research 2015 Vol. 64 P. 293–303
Many efficient exact branch and bound maximum clique solvers use approximate coloring to compute an upper bound on the clique number for every subproblem. This technique reasonably promises tight bounds on average, but never tighter than the chromatic number of the graph.
Li and Quan, 2010, AAAI Conference, p. 128–133 describe a way to compute even ...
Added: August 24, 2015
Vyalyi M., Журнал вычислительной математики и математической физики 2013 Т. 53 № 5 С. 816–824
Конус полистепеней двойственен конусу неотрицательных многочленов. В данной работе рассматривается связь этого конуса с задачами комбинаторной оптимизации. Для этого используются тензорные расширения многогранников задач комбинаторной оптимизации. Показано, что многогранник задачи MAX-2-CSP (оптимизационная версия задачи 2-выполнимости) тензорной степени 4k совпадает с пересечением конуса 4k-полистепеней с подходящим аффинным пространством. Таким образом, в отличие от SDP-релаксаций, релаксация до конуса полистепеней становится ...
Added: October 18, 2014
Festa P., Pardalos P. M., Annals of Operations Research 2012 P. 663–682
Computational molecular biology has emerged as one of the most exciting interdisciplinary fields. It has currently benefited from concepts and theoretical results obtained by different scientific research communities, including genetics, biochemistry, and computer science. In the past few years it has been shown that a large number of molecular biology problems can be formulated as ...
Added: January 9, 2013
Goldengorin B. I., Pardalos P. M., Chistyakov V., Доклады Академии наук 2012 Т. 446 № 1 С. 21–24
It is known that by means of minimal values of tolerances one can obtain necessary and sufficient conditions for the uniqueness of the optimal solution of a combinatorial optimization problem (COP) with an additive objective function and the set of nonembedded feasible solutions. Moreover, the notion of a tolerance is defined locally, i.e., with respect ...
Added: July 27, 2012