?
8th International Conference “Distributed Computing and Grid-technologies in Science and Education”
Selected Papers of the 8th International Conference "Distributed Computing and Grid-technologies in Science and Education"
Dubna, Russia, September 10-14, 2018.
Edited by
Vladimir Korenkov *
Andrey Nechaevskiy *
Tatiana Zaikina *
Elena Mazhitova *
* Joint Institute for Nuclear Research, Dubna, Moscow Region, Russia
Chapters
Gostev I. M., , in: 8th International Conference “Distributed Computing and Grid-technologies in Science and Education”.: ., 2018. P. 568–572.
Added: January 9, 2019
Sukhoroslov O. V., , in: 8th International Conference “Distributed Computing and Grid-technologies in Science and Education”.: ., 2018. P. 266–270.
Distributed computing systems are widely used for execution of loosely coupled many-task applications. There are two important classes of such applications. Bag-of-tasks applications, eg, parameter sweeps or Monte Carlo simulations, represent a set of independent tasks. Workflows, which are used for automation of complex computational and data processing pipelines, consist of multiple tasks with control ...
Added: October 19, 2019
Ponomarenko A., / Series Computer Science "arxiv.org". 2025.
This paper addresses the challenge of merging hierarchical navigable small world (HNSW) graphs, a critical operation for distributed systems, incremental indexing, and database compaction. We propose three algorithms for this task: Naive Graph Merge (NGM), Intra Graph Traversal Merge (IGTM), and Cross Graph Traversal Merge (CGTM). These algorithms differ in their approach to vertex selection ...
Added: July 30, 2026
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
Piontkovski D., / Series arXiv "math". 2026.
A noncommutative projective variety is defined, following Artin and Zhang, by a graded coherent algebra 𝐴. The category of coherent sheaves is then the quotient qgr(𝐴) of the category of finitely presented graded modules by the subcategory of torsion modules. We consider the categorical and polynomial entropies of the Serre twist, that is, of the ...
Added: June 23, 2026
Piontkovski D., / Series arXiv "math". 2025.
If a symmetric multilinear algebra is weakly nil, then it is Engel. This result may be regarded as an infinite-dimensional analogue of the well-known Jacobian theorem, which states that if a polynomial mapping has a polynomial inverse, then its Jacobian matrix is invertible. This refines a theorem of Gerstenhaber and partially answers a question posed ...
Added: June 23, 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
Shipilov F., Barnyakov A., Ivanov A. et al., / Series Physics "arxiv.org". 2026.
A fast simulation of the detector response is a vital task in high-energy physics (HEP). Traditional Monte-Carlo methods form the backbone of modern particle physics simulation software but are computationally expensive. We present a machine-learning-based approach to fast simulation of the Focusing Aerogel Ring Imaging Cherenkov (FARICH) detector response. Given a particle track and momentum, ...
Added: May 19, 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
Derkacheva A., Sakirkina M., Kraev G. et al., /. 2026.
Comprehensive data on natural hazards and their consequences are crucial for effective for risk assessment, adaptation planning, and emergency response. However, many countries face challenges with fragmented, inconsistent, and inaccessible data, particularly regarding local-scale events. To address this data gap in Russia, we developed an end-to-end processing pipeline that scrapes news from various online sources, ...
Added: April 28, 2026
Dvornikov Y., Grigoreva V., Vasenev V. et al., Ecological Indicators 2025 Vol. 170 Article 113014
Urban green infrastructures (UGI) contribute to a quality of life in cities by provisioning cultural and regulating ecosystem services (ES). Planning and management of UGI needs transparent and spatially explicit indicators of the ES supply. In this study, we have used open-source geospatial data to quantify regulating (air pollution/noise and stormwater runoff regulation, climate mitigation), ...
Added: February 1, 2025
Leconte L., Jonckheere M., Samsonov S. et al., , in: Proceedings of The 27th International Conference on Artificial Intelligence and Statistics (AISTATS 2024), 2-4 May 2024, Palau de Congressos, Valencia, Spain. PMLR: Volume 238Vol. 238.: Valencia: PMLR, 2024. P. 1711–1719.
We study asynchronous federated learning mechanisms with nodes having potentially different computational speeds. In such an environment, each node is allowed to work on models with potential delays and contribute to updates to the central server at its own pace. Existing analyses of such algorithms typically depend on intractable quantities such as the maximum node ...
Added: May 26, 2024
Издательский центр ЮУрГУ, 2023.
Данный сборник содержит статьи, включенные в программу всероссийской научной конференции с международным участием «Параллельные вычислительные технологии 2023». Конференция проходила 28–30 марта 2023 года в Университете ИТМО (г. СанктПетербург). Подробную информацию о конференции можно найти в сети Интернет по адресу http://agora.guru.ru/pavt. Отпечатано с авторских оригиналов. ...
Added: November 27, 2023
Dubnov Y. A., Bulychev A., Информационные технологии и вычислительные системы 2023 № 1 С. 71–81
In this paper, we investigate a method of approximate entropy estimation, designed to speed up the classical method of maximum entropy estimation due to the use of regularization in the optimization problem. This method is compared with the method of maximum likelihood and Bayesian estimation, both experimentally and in terms of theoretical calculations for some ...
Added: June 16, 2023
Abrameshin D., Pozhidaev E., Tumkovskiy S., Информационные технологии 2021 Т. 27 № 2 С. 59–64
A model and a method of mathematical modeling of radiation charging of polymer cases of microelectronic equipment with increased conductivity are developed, which are based on the application of the approximation function of the experimental dependence of the case conductivity on the irradiation time obtained using parametric identification methods. The research results are aimed at ...
Added: June 28, 2021
Toporkov V., Yemelyanov D., Anna Toporkova, Simulation Modelling Practice and Theory 2021 Vol. 107 No. February 2021 P. 102228
Abstract
In this work, an approach for a preference-based job-flow scheduling in Grid virtual organizations is proposed and studied. Virtual organizations provide uniform rules of the resources sharing and consumption and should respect individual and common preferences of its stakeholders: users, resource providers and administrators. In most cases, a virtual organization’s stakeholders pursue contradictory market-based goals, ...
Added: December 11, 2020
Челябинск: Издательский центр ЮУрГУ, 2018.
Данный сборник содержит статьи, включенные в программу Международной научной конференции «Параллельные вычислительные технологии 2018». Конференция проходила 2-6 апреля 2018 года в Донском государственном техническом университете (г. Ростов-на-Дону). Подробную информацию о конференции можно найти в сети Интернет по адресу http://agora.guru.ru/pavt. ...
Added: October 30, 2019
Toporkov V., Yemelyanov D., Toporkova A. S., , in: Parallel Computing Technologies. PaCT 2019. Lecture Notes in Computer Science, vol 11657.: Springer, 2019. P. 80–92.
In this work, a preference-based resources allocation algorithm for a job-flow scheduling in Grid virtual organizations (VOs) is proposed and studied. Users’ and resource providers’ preferences, VOs internal policies, resources geographical distribution along with local private utilization impose specific requirements for efficient scheduling according to different, usually contradictive, criteria. The algorithm performs resources selection optimization ...
Added: October 23, 2019
Toporkov V., Toporkova A. S., Yemelyanov D., , in: Intelligent Distributed Computing XIII.: Switzerland: Springer, 2020. P. 160–169.
In this work, an approach for a preference-based job-flow scheduling in Grid virtual organizations (VOs) is proposed and studied. Users’ and resource providers’ preferences, VOs internal policies, resources geographical distribution along with local private utilization impose specific requirements for efficient scheduling according to different, usually contradictive, criteria. Fair scheduling policies in VOs assume resources distribution ...
Added: October 23, 2019
Andreychuk A., Yakovlev K., , in: Interactive Collaborative Robotics: Third International Conference, ICR 2018, Leipzig, Germany, September 18–22, 2018, Proceedings.: Springer, 2018. P. 13–22.
The problem of planning a set of paths for the coalition of robots (agents) with different capabilities is considered in the paper. Some agents can modify the environment by destructing the obstacles thus allowing the other ones to shorten their paths to the goal. As a result the mutual solution of lower cost, e.g. time ...
Added: August 13, 2019
М.: МАКС Пресс, 2011.
В настоящий сборник вошли тезисы докладов участников Международной научной конференции "Ломоносов - 2011" по секции "Вычислительная математика и кибернетика". ...
Added: March 5, 2019