Search

Your search keyword '"Blagoveshchenskaya, Ekaterina"' showing total 22 results
Start Over Author "Blagoveshchenskaya, Ekaterina"
22 results on '"Blagoveshchenskaya, Ekaterina"'

1. Contemporary Aspects of Online Teaching Mathematics in Technical Universities

Author

Blagoveshchenskaya, Ekaterina A., Garbaruk, Viktor V., Popova, Nina V., Strüngmann, Lutz, Kacprzyk, Janusz, Series Editor, Gomide, Fernando, Advisory Editor, Kaynak, Okyay, Advisory Editor, Liu, Derong, Advisory Editor, Pedrycz, Witold, Advisory Editor, Polycarpou, Marios M., Advisory Editor, Rudas, Imre J., Advisory Editor, Wang, Jun, Advisory Editor, Vasiliev, Yuriy S., editor, Pankratova, Nataliya D., editor, Volkova, Violetta N., editor, Shipunova, Olga D., editor, and Lyabakh, Nikolay N., editor

Published
2022
Full Text
View/download PDF

4. Neural Network Methods for Construction of Sociodynamic Models Hierarchy

Author

Blagoveshchenskaya, Ekaterina A., Dashkina, Aleksandra I., Lazovskaya, Tatiana V., Ryabukhina, Viktoria V., Tarkhov, Dmitriy A., Hutchison, David, Series editor, Kanade, Takeo, Series editor, Kittler, Josef, Series editor, Kleinberg, Jon M., Series editor, Mattern, Friedemann, Series editor, Mitchell, John C., Series editor, Naor, Moni, Series editor, Pandu Rangan, C., Series editor, Steffen, Bernhard, Series editor, Terzopoulos, Demetri, Series editor, Tygar, Doug, Series editor, Weikum, Gerhard, Series editor, Cheng, Long, editor, Liu, Qingshan, editor, and Ronzhin, Andrey, editor

Published
2016
Full Text
View/download PDF

5. Butler Group Direct Decomposition Classification With Applications to Parallel Algorithms.

Author

Blagoveshchenskaya, Ekaterina and Mikulik, Ilya

Subjects
ABELIAN groups, PARALLELISM (Linguistics), METAHEURISTIC algorithms, GENETIC algorithms, K-means clustering
Abstract

The graphical approach to the classification problem of Butler group direct decompositions is used to preserve the indecomposability property of some rigid subgroups in all possible direct decompositions of the group itself. The group class under consideration as well as torsion-free abelian groups as a whole admits non-isomorphic direct decompositions. The proof of decomposition existence with predicted properties is one of the investigation streams. Until now the related results concerned only the ranks of indecomposable summands. Now the way of controlling the other properties of group decompositions is suggested. All the results in this direction are closely connected with the algorithm parallelization. The special feature of the results presented is that they give the method of constructing certain dependence graphs as the subgraphs of the algorithm graph to be given in a parallel form preserving the corresponding fragments. Such dependence subgraphs can define the data relations in parallel computations, which reflect various conditions of parallelism. [ABSTRACT FROM AUTHOR]

Published
2023

9. Ant colony optimization with parameter update using a genetic algorithm for travelling salesman problem

Author

Blagoveshchenskaya, Ekaterina A., Mikulik, Ilya I., and Strüngmann, Lutz H.

Subjects
Computer Science::Neural and Evolutionary Computation, MathematicsofComputing_NUMERICALANALYSIS, genetic algorithm, аnt colony optimization, travelling salesman problem
Abstract

It is widely known that the ant colony algorithm is sensitive to changes in parameters. We present a novel kind of the algorithm which uses a genetic algorithm for solving this problem. Travelling salesman problem, known as NP-complete problem, is one of the most popular and important tasks in combinatorial optimization. This is a typical task for testing combinatorial optimization algorithms. In this paper, we present a comparative analysis of the algorithm with a simple ant colony optimization (SACO) on the example of this problem.

Published
2020
Full Text
View/download PDF

10. Automation of the process of ensuring the safe movement of trains with the help of hardware and software complex

Author

Blagoveshchenskaya, Ekaterina A., Bochkarev, Sergei V., and Gruzdev, Nikolai V.

Subjects
ideal employee, railway infrastructure, automatic troubleshooting, train safety, neural networks, optimization, hardware and software complex
Abstract

Safety and continuity of train traffic is one of the main tasks of JSC "Russian Railways". Today, the number of negative factors affecting the railway infrastructure is increasing. The possibility of determining the probability of occurrence of a critical situation and reducing the time for its elimination is considered. To solve this problem, the model of an ideal employee who provides the tasks of ensuring the safety of train traffic was described. This model was implemented in the form of hardware and software complex APK-PN. The use of the hardware complex allows you to ensure the fastest possible response of the operating personnel to the detected fault. Control of diagnostic parameters of devices is provided by integration with systems of technical diagnostics and monitoring. The prospects for the development of the complex are determined.

Published
2020
Full Text
View/download PDF

13. The Use of Self-Learning Systems to Solve the Problems of Finding Failures on the Railway

Author

Blagoveshchenskaya, Ekaterina A., Bochkarev, Sergey V., Gruzdev, Nikolay V., and Zuev, Denis V.

Abstract

The most frequent reason for the violation of the train schedule is the failure of the technical facilities of the infrastructure complex. The number and duration of train downtime and, as a result, the economic losses of Russian Railways depends on the time of search and elimination of failures. Today, failure search is carried out in an intuitive way. In practice, such a path leads to unnecessary time costs.In the study of methods for constructing algorithms, they were classified in terms of the possibility of constructing a model in which each step is a function of all previous steps and the functions cover the entire space of failures. We built these functions and described the generation model of such functions. Such a model for constructing functions can be applied to any technical branch. For the railway infrastructure, 6 functions were obtained. An automatic self-learning system has been developed, which is a multilayer neural network constructed according to a recurrence model. Based on this model, a hardware-software complex was implemented and tested.

Published
2019
Full Text
View/download PDF

18. Direct decomposition theory under near-isomorphism for a class of infinite rank torsion-free abelian groups.

Author

Blagoveshchenskaya, Ekaterina and Strüngmann, Lutz H.

Subjects
*ISOMORPHISM (Mathematics), *TORSION free Abelian groups, *CYCLIC groups, *ABELIAN groups, *DECOMPOSITION method
Abstract

Near-isomorphism is known as the right concept for classification theorems in the theory of almost completely decomposable groups. As a natural generalization the authors extended in [6] the notion of near-isomorphism to Abelian groups of arbitrary rank. In this article we investigate non-isomorphic direct decompositions of a class of infinite rank torsion-free abelian groups which were defined in [4] as special epimorphic images of so-called almost rigid groups. A complete classification of such decompositions up to near-isomorphism is given. [ABSTRACT FROM AUTHOR]

Published
2017
Full Text
View/download PDF

22. CLASSIFICATION AND DIRECT DECOMPOSITIONS OF SOME BUTLER GROUPS OF COUNTABLE RANK.

Author

Blagoveshchenskaya, Ekaterina and Göbel, Rüdiger

Subjects
*MATHEMATICAL decomposition, *ABELIAN groups
Abstract

This paper is devoted to an extension of results concerning decompositions of particular almost completely decomposable groups of finite rank studied by Mader and the first author in to groups of infinite rank. Thus we obtain asystematic way to consider all decompositions of some fairly large class of torsion-free abelian groups. This will be illustrated discussing all pathological decompositions of Corner's group constructed 40 years ago. [ABSTRACT FROM AUTHOR]

Published
2002
Full Text
View/download PDF

Catalog

Books, media, physical & digital resources
See catalog results