?
Vertex quickest 1-center location problem on trees and its inverse problem under weighted l∞ norm
Journal of Global Optimization. 2023. Vol. 85. P. 461–485.
In view of some shortcomings of traditional vertex 1-center (V1C), we introduce a vertex
quickest 1-center (VQ1C) problem on a tree, which aims to find a vertex such that the
maximum transmission time to transmit σ units data is minimum.We first characterize some
intrinsic properties of VQ1C and design a binary search algorithm in O(n log n) time based
on the relationship between V1C and VQ1C, where n is the number of vertices. Furthermore,
we investigate the inverse VQ1C problem under weighted l∞ norm, in which we modify a
given capacity vector in an optimal way such that a prespecified vertex becomes the vertex
quickest 1-center. We introduce a concept of an effective modification and provide some
optimality conditions for the problem. Then we propose an O(n2 log n) time algorithm.
Finally, we show some numerical experiments to verify the efficiency of the algorithms.
Keywords: Inverse optimization problemTreeStrongly polynomial time algorithmBinary search methodVertex quickest 1-center problem
Publication based on the results of:
Roman Prosvirnin, Suslov A., Aleksei Soldatov et al., Computation 2026 Vol. 14 No. 10 Article 261
Abstract
Safety-aligned language models often encode that a request is harmful yet still comply with it. We turn this gap between internal recognition and observable behavior into an inference-time defense. The proposed activation-steering method uses a multiplicative operator that amplifies the residual-stream component along a harm-recognition direction. Intervention strength scales with the model’s own assessment of ...
Added: October 27, 2026
Aleksei Samarin, Nazarenko A., Nazarenko D. et al., Big Data and Cognitive Computing 2026 Vol. 10 No. 11 P. 1–52
Camera traps are a key tool for non-invasive wildlife monitoring, yet models trained on existing benchmarks often generalize poorly to new regions due to domain shift, class imbalance, and natural variability in illumination, season, and background. We introduce PACTraD, a benchmark of 116,973 annotated camera trap images collected in a protected area of the Baikal ...
Added: October 27, 2026
IEEE, 2026.
Proceedings of the X Scientific School "Dynamics of Complex Networks and their Applications"
(DCNA'2026) contain papers of reports of scientists and specialists in the field of intelligent technologies,
engineering education, research and design of complex networks.
DCNA'2026 was held from 10 to 12 September 2026 in Moscow, Russia, as a part of the International
Forum on Artificial Intelligence and ...
Added: October 26, 2026
Maddalena L., Yildiz B., Del Vecchio Blanco F. et al., Scientific data 2026 P. 1–20
We addressed the task of chemical characterization of the aerosol emitted by heated tobacco products (HTPs) and of the smoke emitted by conventional/commercial cigarettes, usually adopted as a reference. Emphasis was placed on quantifying constituents for enabling the identification of novel compounds through targeted and untargeted analyses, and the evaluation of reductions in toxicant exposure under ...
Added: October 26, 2026
Obsie E. Y., Zhan Y., Liu Y., Engineering Research Express 2026 Article 7
Maintaining plant health is crucial for crop quality, food security, and agricultural productivity. Although deep learning methods have shown strong potential for species, disease, and severity classification, most existing approaches tackle these tasks separately, failing to exploit shared representations and interdependencies among them. Furthermore, the variability of disease symptoms, such as subtle differences in size, ...
Added: October 22, 2026
Lev Pyatko, Sergey Aksenov, Regular and Chaotic Dynamics 2026 Vol. 31 No. 5 P. 794–813
In the circular restricted three-body problem, families of periodic and quasi-periodic orbits exist in the vicinity of the libration points and are of significant interest for practical applications. This work presents a neural network-based algorithm for orbit construction and station-keeping, applicable to both periodic and quasi-periodic orbits near collinear libration points. The method employs a ...
Added: October 19, 2026
Vorontsova T., М.: Академия, 2025.
The textbook has been prepared in accordance with the requirements of the federal state educational standards for secondary vocational education and is intended for studying the professional modules “Information Security in Information and Telecommunication Systems and Networks Using Software and Hardware‑Software Tools, Including Cryptographic Protection Tools” and “Information Security in Automated Systems Using Software and ...
Added: October 19, 2026
Aleksei Samarin, Nazarenko A., Nazarenko D. et al., Machine Learning and Knowledge Extraction 2026 Vol. 8 No. 10 Article 330
Automated microscopic image analysis is essential for quantitative microbiology, yet manual acquisition and generic recognition models struggle with morphological variability and scene artifacts. We address both ends of this pipeline. First, we present a low-cost, open-source acquisition system, based on an Arduino UNO R3 microcontroller and NEMA 17 stepper motors, that automates focusing, magnification, and ...
Added: October 14, 2026
Springer, 2026.
This book highlights cutting-edge research in the field of network science, offering scientists, researchers, students and practitioners a unique update on the latest advances in theory and a multitude of applications. It presents the peer-reviewed proceedings of the XIV International Conference on Complex Networks and their Applications (COMPLEX NETWORKS 2025). The carefully selected papers cover ...
Added: October 13, 2026
Springer, 2026.
This book offers a comprehensive overview of the latest research, innovations, and practical applications in the field of sustainability, with a focus on construction materials and their use in building and civil engineering structures. As an outcome of the 3rd International Conference on Sustainability: Developments and Innovations (ICSDI 2026), this book presents a selection of ...
Added: October 13, 2026
Dmitriev A., Kornilov V., Batienkov R., Lecture Notes in Civil Engineering 2026 Vol. 886 P. 249–255
Numerous studies have provided compelling evidence that the probability distribution of avalanche sizes follows a power law, and that 1/f noise is present in the stochastic dynamics of landslides. We present a theoretical explanation of these phenomena within the framework of self-organized criticality theory, proposing a discrete-time model in the form of a sandpile cellular ...
Added: October 13, 2026
Dmitriev A., Shulman I., Lebedev A., Studies in Computational Intelligence 2026 Vol. 1265 P. 266–273
A discrete-time model is presented for the self-organization of the X/Twitter social network to the edge of a phase transition, characterized by avalanche-like propagation of information in the network. The model is based on the analogy between the critical dynamics of the X social network and sandpile cellular automata with Manna rule on the Chung-Lu ...
Added: October 13, 2026
Makarov D. M., Kalikin N., Fashchevsky K. A. et al., Electrochimica Acta 2026 Vol. 579 Article 150159
Machine learning (ML) has become a powerful tool for accelerating the development of carbon-based supercapacitors;
however, most published models assume that a single predictive framework can describe both conventional
porous carbons and hybrid carbon electrodes. Here, we test this assumption using a comprehensive
benchmark dataset and an extended literature-curated dataset enriched with synthesis- and electrolyte-related
descriptors. Three ML algorithms ...
Added: October 13, 2026
Zhang Z., Ilvovsky D., Information Processing and Management 2026 Vol. 63 No. 7
Transformer-based Large Language Models (LLMs) rely on Key-Value (KV) cache to accelerate autoregressive decoding, but memory and compute requirements still grow with context length, limiting deployment on resource-constrained devices. Existing training-free KV cache compression methods mainly rely on attention-driven retention heuristics, which may under preserve structurally informative tokens under tight cache budgets, especially when such ...
Added: October 13, 2026
No Species Is an Island, Entire of Itself: Genetic Speciation Algorithm with Interplay among Species
Gromov V., Sohrabi M., Fathollahi-Fard A., International Journal of Engineering, Transactions B: Applications 2027 Vol. 40 No. 5 P. 1437–1460
This paper, with a particular emphasis on Genetic Algorithm (GA), proposes a novel approach that integrates clustering mechanisms, predator-prey dynamics, and a distinctive selection strategy for generating subsequent populations. The proposed evolutionary algorithm, referred to as Genetic Speciation Algorithm with Interplay Among Species (GSAIS), is comprehensively evaluated against several variants of GAs as well as ...
Added: October 12, 2026
Alexandrov D., Vasilevsky V., Rezunik L. et al., Труды Института системного программирования РАН 2026 Т. 38 № 5 С. 73–90
Large language models demonstrate limitations in tasks that require precise information retrieval from very long input sequences. This limitation affects code generation in large object-oriented systems, where correctness depends on complex inter-class dependencies and the analysis of long execution traces that exceed standard context window sizes. This paper presents JavaCapsule, a technology for automated generation ...
Added: October 12, 2026
Singapore: Springer, 2026.
This volume presents the Proceedings of the 34th IUPAP Conference on Computational Physics (CCP2023), held in Kobe, Japan on August 4–8, 2023. It offers a collection of peer-reviewed articles that highlight recent developments in computational and simulation research across various areas of physics. Key topics include the use of data science, quantum computing, and machine ...
Added: October 12, 2026
Zykov S. V., Ермаков С. Р., Современные наукоемкие технологии 2026 № 9 С. 43–53
При федеративном обучении с неоднородными клиентскими данными и переменными задержками запоздавшие обновления могут ухудшать качество модели, а обмен параметрами с глобальным сервером увеличивает сетевую нагрузку. Целью исследования является разработка и теоретико-экспериментальное обоснование метода и алгоритмов адаптивного федеративного обучения с учетом распределенного запаздывания клиентских обновлений. Для обоснования разрабатываемых решений использованы событийная и непрерывная модели градиентных обновлений, ...
Added: October 11, 2026
Брычков М. Е., Незнанов А.А., Программирование 2026 № 4 С. 50–66
The matrix profile (MP) quickly became one of the most important time series preprocessing methods when it was introduced in 2016, facilitating the solution of a wide range of time series analysis problems, in particular anomaly and pattern detection problems. The high significance has led to the emergence of various tools for MP calculating, but ...
Added: October 9, 2026
Aleskerov F. T., Вайншток А. П., Делахова А. М. et al., Информационные процессы 2026 Т. 26 № 3 С. 895–913
The development and effective management of territorial entities are priority issues for all states, particularly in the context of the digital transformation of public administration. Over the past decade, the integration of information technologies into municipal and regional planning has significantly altered approaches to strategic development, service delivery, and public engagement. This paper describes the ...
Added: October 9, 2026
Qian X., Guan X., Zhang B. et al., Journal of Global Optimization 2026
Inverse quickest path problem on networks ...
Added: September 27, 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
Jia J., Guan X., Pardalos P. M., Journal of Computational and Applied Mathematics 2026 Vol. 486 Article 117687
We study the restricted inverse optimal value problem on linear programming under weighted l1 norm (RIOVLP1). Given a linear programming problem (LP with a feasible solution x0 and a value K, we aim to adjust the cost vector c to such that x0 becomes an optimal solution of the problem (LP) whose objective value equals K. The objective function is to minimize the distance under weighted l1 norm. First, we reformulate ...
Added: April 10, 2026
Gurvich V., Krnc M., Vyalyi M., Results in Mathematics 2025 Vol. 80 Article 117
An amoeba is a tree together with instructions how to iteratively grow trees by adding paths of a fixed length . This paper analyses such a growth process. An amoeba is mortal if all versions of the process are finite, and it is immortal if they are all infinite. We obtain some necessary and some ...
Added: August 24, 2025