?
Эффективное вычисление всех допусков в разреженной задаче о максиминном пути
Успехи математических наук. 2024. Т. 79. № 5. С. 185–186.
Flamarion M. V., Pelinovsky E., Physica D: Nonlinear Phenomena 2027 Vol. 500 Article 135452
In this work, we investigate soliton turbulence in the modified Benjamin–Bona–Mahony (mBBM) equation. A key
advantage of this model is that it admits solitary wave solutions of both polarities while also being interpretable
as a perturbation of the integrable modified Korteweg–de Vries (mKdV) equation. This framework enables a
direct comparison of the main properties of soliton turbulence in ...
Added: November 18, 2026
Yagilev A., Pochinka O., Shubin D., Математический сборник 2026 Т. 217 № 11 С. 130–144
Рассматриваются неособые потоки Морса-Смейла (НМС-потоки) на замкнутых ориентируемых 3-многообразиях $M^3$, в предположении, что среди периодических орбит ровно одна седловая. Устанавливается, что многообразие $M^3$ допускает такой поток тогда и только тогда, когда оно гомеоморфно линзовому пространству, связной сумме линзовых пространств или многообразию Зейферта вида $M(\mathbb S^2, (p_1,q_1), (p_2,q_2), (p_3,q_3))$. ...
Added: November 17, 2026
Burov A., Котыхов А. С., Aksyonov D. et al., Computer Physics Communications 2027 Vol. 330 Article 110458
Explicit incorporation of magnetic degrees of freedom in machine-learning interatomic potentials (magnetic MLIPs)
plays a crucial role in the correct description of magnetic materials and their properties. An important ingredient
for fitting of magnetic MLIPs is spin-polarized density functional theory (DFT) calculations with non-equilibrium
magnetic moments, i.e. DFT calculations with constraints on magnetic moments. In this study, we ...
Added: November 17, 2026
Kertesz-Farkas A., Andrey B., Plos One 2026 Vol. 21 No. 11 P. 1–20
Background
Domain shifts or batch effects can significantly degrade the performance of machine learning-based classifiers in software production without any warning. This can particularly be problematic in medical applications which involve human lives. The shift changes the shape of the prediction score distribution of the test samples compared to that of the training samples; hence, decision ...
Added: November 17, 2026
Mysin I. E., Dubrovin S. V., Cognitive Neurodynamics 2026 Vol. 20 No. 191 P. 1–30
The hippocampal theta rhythm is crucial for memory and navigation. It is paced by parvalbumin-expressing GABAergic neurons in the medial septum. These neurons segregate into two subpopulations—Teevra and Komal cells—which fire in anti-phase bursts at theta frequency, with a stable phase shift of approximately 150 degrees, and exhibit mutual inhibition. While essential, the network mechanism ...
Added: November 14, 2026
Ефимов К. Д., Журнал Новой экономической ассоциации 2026 № 72 С. 105–114
This study proposes a method for automatic detection of collusive behavior in electronic public procurement auctions based on analysis of the full bid trajectory. The empirical dataset comprises 508 auction histories from 2016–2020 collected from the RTS tender e-procurement platform; the positive class is labeled using case materials of the Federal Antimonopoly Service (FAS Russia), ...
Added: November 13, 2026
Sergey N. Koltcov, Budkovaia M., Surkov A. et al., IEEE Journal of Biomedical and Health Informatics 2026 P. 1–10
Large language models (LLMs) show promise for clinical decision support, but privacy constraints and unreliable free-text decisions limit deployment. We present Medotor, a locally deployed system for screening patients with chronic rhinosinusitis with nasal polyps (CRSwNP) for biologic therapy, and evaluate prompt design on 163 retrospective cases (132 eligible and 31 ineligible). Five models were ...
Added: November 13, 2026
Ермолаев Е. С., Chernyshev V. L., Skripchenko A., Journal of Nonlinear Science 2026 Vol. 36 No. 122 (2026) P. 1–37
We study upper bounds for the moment of permanent -saturation in finite metric graphs. The dynamics is generated by moving points travelling with unit speed along edges and branching into all outgoing directions whenever they reach a vertex. We first reformulate this branched dynamics in terms of birth times at vertices and prove a sufficient ...
Added: November 12, 2026
Физулин А. В., Stepanyants V., Amerikanov A. et al., FUTURE TRANSPORTATION 2026 Vol. 6 No. 6 Article 264
Cooperative warning functions depend on whether V2X information becomes available in time to influence vehicle control. This article presents an event-based co-simulation framework coupling SUMO, ns-3 (ms-van3t), 5G-LENA NR sidelink and application records, with Sionna RT enabled for the intersection scenario. In 140 emergency-vehicle-warning runs, reducing mean packet reception ratio (PRR) from 0.9412 to 0.0675 ...
Added: November 12, 2026
Alfimov Mikhail, Kurakin Andrey, Journal of High Energy Physics 2026 Vol. 2026 Article 99
We continue studying regularization scheme dependence of the 𝒩 = 2 supersymmetric sigma models. In the present work the previous result for the four loop β-function is extended to the five loop order. Namely, we find the renormalization scheme, in which the fifth loop contribution is completely eliminated, while the fourth loop contribution is represented ...
Added: November 12, 2026
Shehtman V. B., Shkatov D., Review of Symbolic Logic 2026 Vol. 19 No. 4 P. 859–882
We study Kripke completeness for predicate modal logics with propositional axioms of bounded alternativity corresponding to the condition on Kripke frames that every world sees at most n worlds. We prove that minimal predicate modal logics with axioms of bounded alternativity, as well as their extensions with the axiom of reflexivity, are strongly Kripke complete, whereas the ...
Added: November 12, 2026
Ignatev M., Vilkin T., Mediterranean Journal of Mathematics 2026 Vol. 23 No. 2 Article 70
Trinomial varieties are affine varieties given by a system of equations consisting of polynomials with three terms. Such varieties are total coordinate spaces of normal varieties with torus action of complexity one. For an affine variety X, we consider the subgroup SAut(X) of the automorphism group generated by all algebraic subgroups isomorphic to the additive ...
Added: November 12, 2026
Maksaev A., Promyslov V., Тишутин П. С., Записки научных семинаров ПОМИ РАН 2026 Т. 554 С. 218–235
Let K be an algebraically closed field and let ℰₖ be the set of n × n matrices over K with exactly k distinct eigenvalues. Previously, the classification of linear maps T: Mₙ(K) → Mₙ(K) satisfying T(ℰₙ) ⊆ ℰₙ was obtained for invertible maps over fields of characteristic 0. In this paper, the classification is ...
Added: November 11, 2026
Barinova M., Tirskaya Karina, Владикавказский математический журнал 2026 Vol. 28 No. 3 P. 25–43
In this paper, the problem of the existence of an energy function for discrete dynamical systems defined by structurally stable diffeomorphisms is studied. For the considered class of dynamical systems, such a function is defined as a continuous function that decreases along the orbits of the system outside the non-wandering set and remains constant on ...
Added: November 11, 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