https://elib.bsu.by:443/handle/123456789/280938 Mon, 20 Apr 2026 09:38:39 GMT 2026-04-20T09:38:39Z https://elib.bsu.by:443/handle/123456789/344585 Заглавие документа: Two-Level Preconditioners of Grid Equations in Pseudo-Conjugate Direction Methods Авторы: Belyavskii, S.S.; Mulyarchik, S.G. Аннотация: In the present paper, we consider two-level methods for grid equations approximating two-dimensional boundary value problems for the elliptic equation ∇ · p∇u + q∇u = f in Ω, (1) ru + sun = g on ∂Ω (2) on rectangular grids (or grids topologically invariant to rectangular ones), where Ω is a two-dimensional domain with piecewise smooth boundary. Mon, 01 Jan 2001 00:00:00 GMT https://elib.bsu.by:443/handle/123456789/344585 2001-01-01T00:00:00Z https://elib.bsu.by:443/handle/123456789/344583 Заглавие документа: Двухуровневые предобусловливатели сеточных уравнений в методах псевдодвойственных направлений Авторы: Белявский, С.С.; Мулярчик, С.Г. Аннотация: Исследуются методы многоуровневого решения двумерных краевых задач для уравнения эллиптического типа с несамосопряженным оператором, основанные на использовании r-линейных упорядочений для метода псевдодвойственных направлений. Особое внимание уделяется построению предобусловливателя для матрицы редуцированной системы. Эффективность предлагаемых алгоритмов иллюстрируется на примере численного решения алгебраизованных уравнений дрейфово-диффузионной модели переноса заряда в полупроводниковых средах. Mon, 01 Jan 2001 00:00:00 GMT https://elib.bsu.by:443/handle/123456789/344583 2001-01-01T00:00:00Z https://elib.bsu.by:443/handle/123456789/337595 Заглавие документа: Multimodal Emotion Recognition Method Based on Domain Generalization and Graph Neural Networks Авторы: Xie, J.; Wang, Y.; Meng, T.; Tai, J.; Zheng, Y.; Varatnitski 4, Yu.I. Аннотация: In recent years, multimodal sentiment analysis has attracted increasing attention from researchers owing to the rapid development of human–computer interactions. Sentiment analysis is an important task for understanding dialogues. However, with the increase of multimodal data, the processing of individual modality features and the methods for multimodal feature fusion have become more significant for research. Existing methods that handle the features of each modality separately are not suitable for subsequent multimodal fusion and often fail to capture sufficient global and local information. Therefore, this study proposes a novel multimodal sentiment analysis method based on domain generalization and graph neural networks. The main characteristic of this method is that it considers the features of each modality as domains. It extracts domain-specific and cross-domain-invariant features, thereby facilitating cross-domain generalization. Generalized features are more suitable for multimodal fusion. Graph neural networks were employed to extract global and local information from the dialogue to capture the emotional changes of the speakers. Specifically, global representations were captured by modeling cross-modal interactions at the dialogue level, whereas local information was typically inferred from temporal information or the emotional changes of the speakers. The method proposed in this study outperformed existing models on the IEMOCAP, CMU-MOSEI, and MELD datasets by 0.97%, 1.09% (for seven-class classification), and 0.65% in terms of weighted F1 score, respectively. This clearly demonstrates that the domain-generalized features proposed in this study are better suited for subsequent multimodal fusion, and that the model developed here is more effective at capturing both global and local information. Wed, 01 Jan 2025 00:00:00 GMT https://elib.bsu.by:443/handle/123456789/337595 2025-01-01T00:00:00Z https://elib.bsu.by:443/handle/123456789/322978 Заглавие документа: Planning container inspection and repair: A case study Авторы: Kovalyov, M.Y.; Kuzmicz, K.A.; Lukashevich, M.N.; Pesch, E. Аннотация: The aim of this paper is to introduce a real-life problem of optimal planning of container inspection and repair on several facilities over several time periods assuring effective supply of empty containers indispensable for seamless global maritime transportation. The containers are of several types and quality levels. The objective is to minimize the total holding, inspection, repair, transportation and rejection costs. We formulate a deterministic min-cost multi-commodity network flow problem and prove NP-hardness for two special cases. Values of the rejection costs are determined such that no container is rejected in an optimal solution if there exists a feasible solution with no container rejected. An algorithmic mechanism is proposed to support a negotiation of periodic container demands between the container provider and the container users with the aim to reduce the overall costs. Computer experiments with instances obtained by random deviation from industrial data demonstrate that the majority of instances with up to 4 facilities, 4 container types, 7 quality levels, and 7, 14 or 30 time periods can be solved with an acceptable quality using an academic version of CPLEX in two hours on a standard PC. Mon, 01 Jan 2024 00:00:00 GMT https://elib.bsu.by:443/handle/123456789/322978 2024-01-01T00:00:00Z