?
MIP Models and Complexity Results for DAG Scheduling in the Cloud
P. 317–331.
Yury Semenov, Oleg Sukhoroslov
In book
Vol. 15681. , Switzerland: Springer, 2025.
Springer, 2025.
This book constitutes the refereed proceedings of the 19th International Conference on Parallel Computational Technologies, PCT 2025, held in Moscow, Russia, during April 8–10, 2025.
The 31 full papers included in this volume were carefully reviewed and selected from 122 submissions. These papers were organized under the following topical sections: High Performance Architectures, Tools and Technologies; ...
Added: May 18, 2026
Yerbolova A. S., Tomashchuk K., Kogan A. et al., Complexity 2026 Vol. 2026 No. 1 Article 5519690
Tis paper presents a novel approach to analyzing and grouping natural languages based on the degree of their chaoticity. It clusters 52 languages from 18 language families, according to the value of the entropy–complexity pair, to reveal the chaotic properties of semantic trajectories. Te obtained clusters appear to be closely correlated with the family of ...
Added: February 16, 2026
Porosenkov G., Цепелевич М. М., Кизяков Д. А. et al., Информатика и образование 2025 Т. 40 № 2 С. 57–65
Research on learner engagement in massive open online courses (MOOCs) has predominantly focused on those developed by educational and non-profit organizations. However, the significance of MOOCs offered by IT service providers (vendors), particularly in the field of cloud computing, has gained prominence in recent years. These vendor-led courses facilitate interaction between learners and vendors, underscoring the ...
Added: January 18, 2026
Speranski S. O., Journal of Logic and Computation 2013 Vol. 23 No. 5 P. 1035–1055
In the present article, the quantifiers over propositions are first introduced into the language for reasoning about probability, then the complexity issues for validity problems dealing with the corresponding hierarchy of probabilistic sentences are investigated. We prove, among other things, the $\Pi^1_1$-completeness for the general validity and also indicate the least level in the hierarchy ...
Added: December 27, 2025
Speranski S. O., Computability 2015 Vol. 4 No. 2 P. 159–174
Added: December 27, 2025
Springer, 2025.
This book constitutes the refereed proceedings of the 15th International Conference on Parallel Processing and Applied Mathematics, PPAM 2024, held in Ostrava, Czech Republic, during September 8–11, 2024.
The 75 full papers included in this book were carefully reviewed and selected from 134 submissions. The papers are organized in the following topical sections:
Part I : Numerical ...
Added: December 26, 2025
Speranski S. O., Studia Logica 2017 Vol. 105 No. 2 P. 407–429
The paper contains a survey on the complexity of various truth hierarchies arising in Kripke’s theory. I present some new arguments, and use them to obtain a number of interesting generalisations of known results. These arguments are both relatively simple, involving only the basic machinery of constructive ordinals, and very general. ...
Added: December 26, 2025
Kuznetsov S., Speranski S. O., Annals of Pure and Applied Logic 2022 Vol. 173 No. 2 Article 103057
We introduce infinitary action logic with exponentiation — that is, the multiplicative-additive Lambek calculus extended with Kleene star and with a family of subexponential modalities, which allow some of the structural rules (contraction, weakening, permutation). The logic is presented in the form of an infinitary sequent calculus. We prove cut elimination and, in the case ...
Added: December 26, 2025
Kuznetsov S., Speranski S. O., Studia Logica 2023 Vol. 111 No. 2 P. 251–280
Infinitary action logic can be naturally expanded by adding exponential and subexponential modalities from linear logic. In this article we shall develop infinitary action logic with a subexponential that allows multiplexing (instead of contraction). Both non-commutative and commutative versions of this logic will be considered, presented as infinitary sequent calculi. We shall prove cut admissibility ...
Added: December 26, 2025
Speranski S. O., Logic Journal of the IGPL 2025 Vol. 33 No. 2 Article jzae042
This paper is concerned with a two-sorted probabilistic language, denoted by QPL, which contains quantifiers over events and over reals, and can be viewed as an elementary language for reasoning about probability spaces. The fragment of QPL containing only quantifiers over reals is a variant of the well-known ‘polynomial’ language from [Fagin et al. 1990, Section 6]. ...
Added: December 26, 2025
Speranski S. O., Logic Journal of the IGPL 2025 Vol. 33 No. 3 Article jzae114
We shall be concerned with two natural expansions of the quantifier-free ‘polynomial’ probability logic of [Fagin et al. 1990]. One of these, denoted by QPL-e, is obtained by adding quantifiers over arbitrary events, and the other, denoted by p-QPL-e, uses quantifiers over propositional formulas — or equivalently, over events expressible by such formulas. The earlier proofs ...
Added: December 26, 2025
LePoire D., Grinin L. E., Korotayev A., Journal of Big History 2025 Vol. 8 No. 3 P. 98–139
Building on foundational work in systems theory, thermodynamics, and evolutionary theory, this paper argues that complexity can serve as a conceptual bridge across disciplines. It explores the role of complexity dynamics in Big History through an integrative theoretical framework that spans physical, chemical, geological, biological, social, cognitive, and civilizational domains. By examining how complexity emerges, ...
Added: November 1, 2025
Arzhantsev I., Functional Analysis and Its Applications 1997 Vol. 31 No. 4 P. 278–280
Let a connected reductive group G act on a normal affine variety X with the generic stabilizer H, let the complexity of this action be one, and let the categorial quotient X//G be one-dimensional. Then the closure of any G-orbit in X is normal. ...
Added: June 13, 2025
Sochi: IEEE, 2025.
International Russian Smart Industry Conference is devoted to discussion of the latest achievements in the field of automation and control systems. It will be held in Sochi, the Russian Federation, in March, 2026. The conference is organized in order to exchange experiences, to promote the discussion and presentation of research papers, summarizing research in universities, ...
Added: May 10, 2025
Yury Semenov, Oleg Sukhoroslov, , in: Supercomputing. 10th Russian Supercomputing Days, RuSCDays 2024, Moscow, Russia, September 23–24, 2024, Revised Selected Papers, Part II* 2.: Springer, 2025. P. 20–31.
Workflow scheduling in the cloud is a challenging multi-objective optimization problem where an efficient scheduling algorithm is required to optimize both performance and cost. Despite the huge body of work on designing workflow scheduling algorithms, the differences in the experiment settings, VM instances, sets of baseline algorithms, and the choice of reference point for hypervolume ...
Added: April 25, 2025
Springer, 2024.
This book constitutes the refereed post proceedings of the 18th International Conference on Parallel Computational Technologies, PCT 2024, held in Chelyabinsk, Russia, in April 2024.
The 22 full papers included in this book were carefully reviewed and selected from 62 submissions. These papers have been organized under the following topical sections: High Performance Architectures, Tools and Technologies; Parallel Numerical Algorithms and ...
Added: December 20, 2024
Cham: Springer, 2020.
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 Eighth International Conference on Complex Networks and their Applications (COMPLEX NETWORKS 2019), which took place in Lisbon, ...
Added: February 27, 2024
Marina Boykova, Knyazeva H., Salazkin M., Foresight and STI Governance 2023 Vol. 17 No. 4 P. 80–91
The challenges the futures studies face are particularly complex, interconnected, and contradictory, and cannot be resolved using linear approaches. Prognostic science needs tools matching the new contextual complexity, which would allow to capture a much wider range of driving forces, and their potential effects, in a non-linear perspective, to improve the accuracy of forecasts and ...
Added: January 25, 2024
Springer, 2021.
Springer Proceedings in Complexity publishes proceedings from scholarly meetings on all topics relating to the interdisciplinary studies of complex systems science. Springer welcomes book ideas from authors. The series is indexed in Scopus ...
Added: January 15, 2023
Perez-Guerra J., Smirnova E. A., VIAL - Vigo International Journal of Applied Linguistics 2023 No. 20 P. 149–183
This study focuses on the analysis of linguistic complexity in professional academic writing in light of the empirical evidence provided by a 1,597,000-word corpus of ‘hard’ (life and physical sciences) and ‘soft’ (arts and social) scientific research articles published in leading peer-review journals. Specifically, this investigation aims both to describe the complexity features of texts ...
Added: December 20, 2022
Gromov V., Мазайшвили К. В., Заикин П. В. et al., Вестник кибернетики 2022 Т. 45 № 1 С. 72–82
The prevalence of chronic kidney disease is growing every year and is already comparable to such socially significant diseases as hypertension and diabetes mellitus, as well as obesity and metabolic syndrome [1,2]. The standard solution for hemodialysis patients is to create a permanent vascular access in the form of an arteriovenous fistula. However, its use ...
Added: November 14, 2022
Oleg Sukhoroslov, Maxim Gorokhovskii, Roman Ilgovskiy et al., , in: Материалы IV Международного семинара по информационным, вычислительным и управляющим системам для распределенных сред (ICCS-DE 2022).: Иркутск: ИДСТУ СО РАН, 2022. P. 79–96.
Resource management is a critical part of modern large-scale distributed systems and an active area of research. The diversity of systems, workloads and requirements have lead to many domain-specific problem statements, solutions and simulation tools proposed by researchers, which are hard to compare and reuse. In this paper, an overview of related resource management problems ...
Added: October 30, 2022