Publication list: http://elibrary.ru/author_profile.asp?id=526168
Completely Described Undirected Graph Structure
Engineering Education # 04, April 2016
Real Time Adaptive Stream-oriented Geo-data Filtering
Engineering Education # 04, April 2016
Optimization of Computations on Related Sets in CUDA
Engineering Education # 10, October 2015
Evaluating Efficiency of Parallel Algorithms of Transformation Operations with Graph Model
Engineering Education # 11, November 2014
Features of using multimedia technologies at lecturing programming
Engineering Education # 03, March 2014
The article generalizes the results for ten years of lecturing on programming to the undergraduate students at the Department of Computer Systems and Networks of BMSTU using multimedia equipment, namely computer, projector and screen. Two ways of using multimedia equipment: a demonstration of presentations and running programs in software environments are Identified. The article discusses examples of slide presentations and formulates positive results of the multimedia use. It reveals weaknesses to deliver lectures using presentations and offers the ways for their elimintation.
Abstractions and base operations of a specialized description language of algorithms for solving problems of structural analysis and synthesis
Engineering Education # 12, December 2013
This article justifies the need for a specialized programming language that would allow to describe solving procedures for tasks of structural analysis and synthesis in terms of mathematical models being used. Compared with the existing languages and subroutine libraries such language would not only allow to reduce program development time significantly but also provide an opportunity to develop more efficient programs in terms of computational complexity of algorithms and runtime. According to the analysis of algorithms and representations of graph models a set of the necessary abstractions and operations on them was determined. The abstractions such as "set", "multi-set", "sequence", "vector" and "matrix" were proposed for basic abstractions. Operations on these abstractions were divided into mathematical and related to specific implementation features of the algorithm descriptions. A set of elementary operations of the indicated types was defined for each abstraction.
Evaluation of efficiency of optimizing transformation for algorithms of ultra-graph operations
Engineering Education # 01, January 2013
In this article the authors consider experimental evaluation of reducing computational complexity of algorithms of ultra-graph operations. According to the results of theoretical analysis of the algorithms of ultra-graph operations, procedures, which introduce the greatest contribution to their computational complexity, were defined; ways of its reducing were selected. With the help of special software contribution of optimizing transformations to reducing computational complexity of vertex addition was estimated. Experimental results showed high efficiency of the conversion process - total reduction of computational complexity of the algorithm was up to 87%.
77-30569/239406 Evaluation the effectiveness of ordered set operations
Engineering Education # 10, October 2011
The efficiency of using ordered set operations is considered by example of partitioning a complex system structure into subsystems. The article considers a formal definition of this problem as separation of the hypergraph vertex set into disjoint subsets. The article describes the main design routines of computer scheme partitioning by sequential algorithm. The partitioning process was fulfilled by using unordered and ordered set operations. The computation complexity assessment of both member functions was fulfilled. The efficiency of using ordered set operations may be proportional to the quantity of network elements.
Equivalent transformations of algorithm structures
Engineering Education # 11, November 2009
In this article the set of algorithms structures transformations is offered. These transformations are equivalent in sense of calculation results. Ones can be used for reception of structural algorithms from not structural in parallel programming, automatic recognition of program texts and the analysis of computing complexity of algorithm. For each transformation initial and replacing fragments are described, and also conditions of application are determined.