?
Electronic Proceedings in Theoretical Computer Science (EPTCS). Proceedings of the 9th International Symposium on Symbolic Computation in Software Science
Open Publishing Association, 2021.
Under the general editorship: T. Kutsia
Chapters
Fedotov I., Anton Khritankov, , in: Electronic Proceedings in Theoretical Computer Science (EPTCS). Proceedings of the 9th International Symposium on Symbolic Computation in Software Science.: Open Publishing Association, 2021. P. 65–77.
Blockchain technology has developed significantly over the last decade. One of the reasons for this is its sustainability architecture, which does not allow modification of the history of committed transactions. That means that developers should consider blockchain vulnerabilities and eliminate them before the deployment of the system. In this paper, we demonstrate a statistical model ...
Added: September 23, 2021
Keywords: symbolic computation
Stepanyants V., Andrey V. Fizulin, Chibirov A. et al., FUTURE TRANSPORTATION 2026 Vol. 6 No. 5 Article 225
Reliable Vehicle-to-Everything (V2X) evaluation requires propagation models that represent terrain and multilevel infrastructure. Most integrated vehicular simulators still rely on planar models, but the magnitude of the resulting bias is unclear. This study quantitatively compares flattened two-dimensional (2D) and terrain-aware three-dimensional (3D) variants of three scenarios using identical Sionna RT settings. The pipeline combines OpenStreetMap ...
Added: October 8, 2026
Люксембург А. А., УРСС, 2005.
Изучается возможность автоматизированного построения математических теорий. Рассматривается дедуктивная система, основанная на языке логики предикатов первого порядка, объектами системы являются математические выражения или формулы, которые описывают математические объекты или их свойства. В дедуктивной системе выводятся математические определения и теоремы. Для доказательства теорем используются методы автоматического доказательства. Разработан алгоритм, выводящий часть формул системы. Для решения задачи используется аппарат математической ...
Added: October 7, 2026
Groshev Maksim, Rybakov Petr, Teterin N. et al., Sensors 2026 Article 6171
Manual assessment of soybean yield components, such as pod number, is laborious, time-consuming, and subjective. Existing computer-vision approaches based on object detection or instance segmentation perform poorly on close-range RGB imagery of soybean canopies due to severe occlusions, ambiguous plant boundaries, and the high cost of bounding-box annotation. To address these challenges, we propose a ...
Added: October 7, 2026
Томск: Издательство Томского государственного университета, 2026.
Материалы сборника Шестнадцатой Международной конференции «Новые информационные
технологии в исследовании сложных структур» (Москва, 21–25 сентября 2026 г.) ориентированы на
широкий круг специалистов, работающих на стыке теории информации, системного анализа и
прикладных предметных областей. В издание вошли результаты исследований, посвящённые
моделированию дискретных и стохастических структур управления и связи, разработке
высокопроизводительных вычислительных и телекоммуникационных систем, а также вопросам
цифровой трансформации образования, архитектурно-градостроительного проектирования,
экологического ...
Added: October 6, 2026
Серебренников Д. А., Belov A. V., Информационные технологии и вычислительные системы 2026 № 3 С. 157–169
В условиях роста стоимости энергоресурсов и необходимости повышения энергоэффективности производственных процессов особую актуальность приобретает задача оптимизации энергопотребления промышленных предприятий. В данной работе рассматривается подход к управлению энергозатратами машиностроительного предприятия на основе методов многокритериальной оптимизации. Постановка задачи включает несколько целевых функций: минимизацию энергопотребления, минимизацию стоимости электроэнергии с учётом тарифных ограничений и максимизацию производственной эффективности. Для решения ...
Added: October 5, 2026
Kuninets A., IEEE Transactions on Information Theory 2026 P. 1–1
In this work we study the applicability of Quasi-Cyclic Subfield Subcodes of Dual Elliptic (QC-SSDE) codes for integration into code-based cryptographic schemes. Detailed algorithms are provided for constructing parity-check matrices as well as block-circulant parity-check matrices for this family of codes, accompanied by empirical results that enable the construction of QC-SSDE codes with predetermined dimensions. ...
Added: October 3, 2026
Zykov S. V., Уфимцев Г. А., Моделирование, оптимизация и информационные технологии 2026 Т. 14 № 8 С. 1–13
Информационные системы формируют большие объёмы событийных журналов, которые используются для анализа работы приложений и сервисов. При этом события могут поступать в аналитический контур позже момента их фактического возникновения и не в исходном порядке. Такая рассинхронизация приводит к ошибкам при построении агрегированных временных показателей, а регулярный полный пересчёт многомерного аналитического куба требует значительных вычислительных затрат. Целью ...
Added: October 2, 2026
Polarization of opinions in the group: a modeling algorithm considering the dynamics of social bonds
Chebotarev V., Andreyuk D., Elizarova Anastasiya et al., Procedia Computer Science 2022 Vol. 213 No. C P. 596–601
The dynamics of opinion in a group are of interest for a number of practical purposes. In particular, consensus helps and polarization of opinions hinders cohesive teamwork. Existing approaches for modeling opinion dynamics mostly do not take into account the dynamism of social relations in a group. This paper proposes an algorithm and a program ...
Added: October 2, 2026
Konstantinov A., Elizarova Anastasiya P., Utkin L., Computing, Telecommunications and Control 2026 Vol. 19 No. 1 P. 16–25
Decision trees and their ensemble extensions, such as random forests, are widely used as classification models due to their simplicity and interpretability. However, in many real-world tasks where class labels overlap in the feature space, standard decision trees rely on hard splits that create fragile decision boundaries. In these regions, small perturbations in the input ...
Added: October 2, 2026
Prokhorov A., Burda M., Journal of Computational and Graphical Statistics 2026 P. 1–13
Bayesian nonparametric density estimation procedures are typically based on single-scale priors, such as Dirichlet process mixtures. Alternative multiscale density priors built on decision trees have many well-known advantages, including the ability to characterize abrupt local changes and to provide an estimate with a desired level of resolution. Despite their theoretical appeal, multiscale methods have typically ...
Added: October 2, 2026
Aly Ismailov, Poptsova M., Plos One 2026 Vol. 21 No. 9 Article e0355902
Added: October 2, 2026
Zlotnik A., Математические заметки 2026 Т. 120 № 6 С. 1005–1009
Численным методам решения систем газодинамических уравнений посвящена обширная литература. Ранее было разработано и успешно апробировано специальное семейство симметричных по пространству консервативных разностных методов, основанных на предварительной кинетической, точнее, квазигазодинамической (КГД), регуляризации этих уравнений. Актуальной задачей является построение численных методов, которые обладают не только свойством консервативности по массе, импульсу и полной энергии, но и удовлетворяют условиям энтропийной ...
Added: October 1, 2026
International Joint Conferences on Artificial Intelligence, 2026.
Added: October 1, 2026
Ryumina E., Aksenov A., Сысоев Д. С. et al., IEEE Computer Society, 2026.
Ambivalence/hesitancy recognition in unconstrained videos is a challenging problem due to the subtle, multimodal, and context-dependent nature of this behavioral state. In this paper, a multimodal approach for video-level ambivalence/hesitancy recognition is presented for the 10th ABAW Competition. The proposed approach integrates four complementary modalities: scene, face, audio, and text. Scene dynamics are captured with ...
Added: September 30, 2026
Ivanov F., Kotov F., IEEE Access 2026 Vol. 14 P. 104662–104679
U-UV codes, based on the Plotkin (U, U + V) construction, provide a unified framework that includes polar and Reed–Muller codes and enables flexible design through the choice of component codes. While modern capacity-approaching codes achieve excellent performance at large block lengths, their efficiency at short and moderate lengths remains limited, especially under low-latency constraints. ...
Added: September 30, 2026
Djambong Tenkeu H., Institute for System Programming of the RAS, 2026.
Added: September 29, 2026
Ivanashev Y., Доклады Российской академии наук. Математика, информатика, процессы управления (ранее - Доклады Академии Наук. Математика) 2026 Т. 529 С. 93–101
Язык L является нижним для релятивизируемого сложностного класса C, если CL=C. Для классов #P, GapP и SpanP известны точные нижние классы языков: Low(#P) = UP ∩ coUP, Low(GapP) = SPP и Low(SpanP) = NP ∩ coNP. В этой статье мы доказываем, что Low(TotP) = P, и приводим характеризации нижних классов функций для #P, GapP, TotP ...
Added: September 28, 2026
Piliugin L., Antropov A., Lobashev E. et al., Journal of Nuclear Materials 2026 Vol. 632 Article 156876
The effects of dislocations on the mobility of gas nanobubbles pinned to them are considered as novel unex- plored mechanisms of accelerated fission gas release and investigated using classical molecular dynamics of helium bubbles in FCC aluminum. Non-equilibrium methods are developed to calculate the mobility of a pinned bubble both along and across the dislocation ...
Added: September 28, 2026
Anoshin V. I., Beketova A., Parusnikova A. et al., Computational Mathematics and Mathematical Physics 2023 Vol. 63 No. 1 P. 86–95
The second member of the fourth Painlevé hierarchy is considered. Convergence of certain power asymptotic expansions in a neighborhood of zero is proved. New families of power asymptotic expansions are found. Computations are carried out using a computer algebra system. Reference to a code that can be used for computing the Gevrey order of the ...
Added: March 30, 2023
Bychkov A., Pogudin G., ACM Communications in Computer Algebra 2021 Vol. 54 No. 3 P. 119–123
Transformation of a polynomial ODE system to a special quadratic form has been successfully used recently as a preprocessing step for model order reduction methods. However, to the best of our knowledge, there has been no practical algorithm for performing this step automatically with any optimality guarantees.
We present an algorithm that, given a system of ...
Added: October 19, 2021
Association for Computing Machinery (ACM), 2021.
The International Symposium on Symbolic and Algebraic Computation (ISSAC) is the premier conference for research in symbolic computation and computer algebra. ISSAC is the continuation of conferences with the names SYMSAC, EUROCAL, EUROSAM, and EUROCAM, which have alternated between North America and Europe before merging into ISSAC. The whole series started in 1966 with the ...
Added: September 27, 2021
NY: ACM, 2018.
The International Symposium on Symbolic and Algebraic Computation (ISSAC) is the premier conference for research in symbolic computation and computer algebra. ISSAC 2018, to be held at the City University of New York, New York City, USA, is the 43rd meeting in this series. The series has been held annually since 1981. ISSAC is sponsored ...
Added: November 1, 2019
NY: ACM, 2017.
Proceedings of the 2017 ACM on International Symposium on Symbolic and Algebraic Computation ...
Added: September 15, 2017
Linz: Research Institute for Symbolic Computation (RISC), Johannes Kepler University Linz, 2014.
Unification is concerned with the problem of identifying terms, finding solutions for equations, or making formulas equivalent. It is a fundamental process used in a number of fields of computer science, including automated reasoning, term rewriting, logic programming, natural language processing, program analysis, types, etc. The International Workshop on Unification (UNIF) is a yearly forum ...
Added: October 13, 2015