main| new issue| archive| editorial board| for the authors| publishing house|
Main page
New issue
Archive of articles
Editorial board
For the authors
Publishing house



No. 6. Vol. 21. 2015

To the contents

V. A. Fomichov, Professor, e-mail:, A. A. Razorenow, Ph. D. student, e-mail: National Research University Higher School of Economics (HSE), Moscow, Russia

The Significance of the K-Representations Theory for the Studies on Automatic Semantic Role Labeling

The paper shows an incompleteness of theoretical foundations of the Computational Semantics branches called Semantic Role Labeling and Frame-Semantic Parsing. This situation is a consequence of a seeming lack of a semantic formalism allowing to describe semantic structures of complex sentences and discourses pertaining to arbitrary application domains. It is concluded that the theory of K-representations (knowledge representations) provides a formalism of the kind, determining a new class of formal languages — the class of SK-languages (standard knowledge languages). Some new expressive mechanisms of SK-languages are illustrated. The central ideas of a method of semantic parsing of natural language (NL) texts proposed by the theory of K-representations are set forth. The method employs the class of SK-languages for constructing semantic representations of texts. The final part of the paper considers the application of the method to designing NL-interfaces for software management. A file manager with a NL-interface NLC-1 (Natural Language Commander — Version One) has been developed, the system is implemented with the help of the functional programming language Haskell.
Keywords: natural language, semantic-syntactic analysis of texts, semantic parsing, semantic role labeling, frame-semantic parsing, semantic representation, theory of K-representations, SK-language, linguistic database, software management, file system natural language management, Natural Language Commander, Haskell

P. 403—411

P. A. Borisovsky, Associated Professor,, Omsk State University Dostoyevsky, A. V. Eremeev, Senior Researcher,, Omsk Branch of Sobolev Institute of Mathematics

Production Scheduling of a Multi-Product Plant Using Integer Linear Programming and Evolutionary Computations

In this paper, we propose a new algorithm for multi-product plant scheduling problem of high dimension. The algorithm is based on time-decomposition, moving window heuristic method and a genetic algorithm. An experimental study on a large-scale data showed a significant advantage of the solution quality and the solving time comparing to other algorithm, and confirmed the suitability of the proposed approach for the real-life production scheduling in chemical industry.
Keywords: production schedule, decomposition, mixed integer linear programming, greedy algorithm, genetic algorithm, event point, reaction, demand, task, planning horizon

P. 412—421

V. V. Vorobyev, Postgraduate student, e-mail:, E. A. Parshikova, Postgraduate student, e-mail:, Moscow Institute of Electronics and Mathematics National Research University "High School of Economics, Moscow

Application of Multisets for Assessment of the Situation by the Mobile Agent

The mobile agent needs the developed receptors for existence in a dynamic environment with unknown characteristics. But the increase in the number of receptors leads to a significant increase in the complexity of the processing of the signals coming from these sensors. The problem of the dimension of the input sensory data of agent occurs. The article discusses the possibility of using of multisets to reduce the dimension of the input data vector from sensors and the possibility of using of multisets for further assessment of the situation by the mobile agent. On the example of the mobile agent reinforcement learning it is shown that the presentation of the properties of the environment in the form of multisets allows to aggregate the sensory data of agent, thereby reducing the dimension of the input data vector.
Keywords: multisets, data aggregation, mobile agent, intelligent bots, recognition of situations, control theory, reinforcement learning, learning by example, the base of precedents, finite state machine

P. 421—426

G. G. Bulychev, Professor, e-mail:, Moscow State University of RadioEngineering, Electronics and Automation

Numerical Modeling of Dynamical Destruction Hollow Bodies by Detonation Products

By numerical method of spatial characteristics there is solved the problem of impulsive destruction of thin-walled isotropic body. The impulse is made by point explosion in the center of body or by moving detonation point of explosive cord, located along the perimeter of the inner cavity of the body. Limit of destruction’s stress is determined by as function of velocity of detonation, thickness of walls and Puasson’s factor of a body material.
Keywords: a numerical simulation, a mechanics of the deformed solid body, dynamics, destruction, thin-walled bodies

P. 427—432

K. A. Shcheglov, Graduate Student, A. Yu. Shcheglov, Professor, Saint-Petersburg National Research University of Information Technologies, Mechanics and Optics, Russia

Network Informational System Data Securing Technology

We review the new network informational system data securing approach based on newly created objects (file system objects and clipboard) access control methods implementation, which allows to exclude object from access policy (with help of created objects automatic labeling). Practical implementation of such approach (while saving labeling directly in created file) allows to formulate and solve the task of implementing data (processed in network informational system) access policy in a view of different possible ways of data exchange between computers in such system. Herewith we implement data streams managing already within whole system. Reviewed protection method is based on practical realization which was patented by authors of "File objects access control system based on auto-labeling" solution. This solution allows to rethink known realization of both access control methods including discretionary and mandate ones. This not only dramatically simplifies setting file objects access policy (by eliminating the "access object" essence from access control scheme), but also settings correct implementation in the general case is provided in the same time.
Keywords: network informational system, data securing, unauthorized access, data access control and policy, access policy, newly created object, data streams, management

P. 433—439

Y. N. Imamverdiyev, Head of Laboratory, e-mail:, Institute of Information Technology of Azerbaijan National Academy of Sciences

A Fuzzy Cognitive Model for the Strategic Management of Information Security of E-Government

The article studies the nature and application of cognitive modeling in the strategic management of information security of e-government. Factors of strategic management of information security are defined and the fuzzy cognitive map for strategic management of e-government information security is built on the basis of expert assessments. Based on the developed cognitive model results of different strategies for e-government information security management are analyzed.
Keywords: information security, information security management, information security strategy, cognitive modeling, fuzzy cognitive maps

P. 440—447

S. I. Smetanin, Graduate Student, V. A. Ignatyuk, Dr. Sci Sciences, prof., e-mail;, A. A. Evstifeev, Graduate Student Department of Electronics, Vladivostok State University of Economics and Service, Vladivostok

Implementation of the Software Part of the System of Satellite Monitoring

The text shows an approach to the creation of the software part of the satellite monitoring system. Also, it talks about the necessity to develop their own solutions to a wider variety of use cartographic information and other data information. The proposed conceptual approach to the creation of a monitoring system, which is based on web technology, will greatly simplify the development of such systems, aimed at addressing the problems of any possible type. In particular, realization of the main functions which any cartographical cursor — scalings and movements of the card has to realize is given in this article. Also the example ot comparison of pixels of the card to geographical coordinates of the objects which are stored in a database that allows to connect them in program functions is given. Code examples are given. The code is given in the C# language as server part and JavaScript as client part.
Keywords: satellite monitoring system, engine mapping, database design, JavaScript, C#, default server, the client application

P. 448—455

V. G. Getmanov1, 2, Professor, Chief Researcher, G. I. Borzunov2, 3, Professor,
1The Geophysical Center of the Russian Academy of Sciences
2National Research Nuclear University MEPhI (Moscow Engineering Physics Institute)
3Moscow state University of design and technology

The Algorithm of Parallel Calculations for a Problem of the Spectral-Time Analysis on Basic Polyharmonic Functions

The algorithm of parallel calculations for a problem of the spectral-time analysis (STAN) on basic polyharmonic functions is offered. The analysis of consecutive algorithm for STAN showed that on temporary complexity it belongs to the class of exponential algorithms, it formed the basis for development of parallel algorithm. The method of a task of vectors of search frequencies is created. It is known that the speedup and efficiency of parallel algorithms heavily depends on its balancing, i. e. how evenly distributed computational load between processes executing. Balancing the developed parallel algorithm is based on partitioning the sequence of numbers of the vectors of the search frequencies at equal length sections. Introduced a splitting sequence of vectors of indices into equal parts correctly because: does not increase the amount of computation and memory required for the implementation of the algorithm; ensures uniform loading of the compute nodes by partitioning the sequence of index numbers as equal parts of the index; provides scalability when increasing the number of compute nodes by reducing the lengths of the parts of the index. In the offered parallel algorithm effective frequency search ls used. Results of computing experiment with model realization of parallel algorithm for signal STAN with amplitude and frequency modulation are given.
Keywords: parallel calculations, spectral time analysis, polyharmonic functions, approximation, estimation

P. 456—463

Yu. G. Tabakov, Graduate Student, e-mail:, Voronezh State Academy of Forestry Engineering, Voronezh

Problems Processing LF Signals in of Intellectual Information Systems

The article describes and shows the basic problems in the processing of low-frequency signals removed from the cerebral cortex and possible solutions. Proposed a specially designed mathematical models and algorithms for processing low-frequency signals. These model and algorithms constructed on a specially designed and modified Daubechies and Morlaix wavelet-transform, which allow processing low-frequency signals in real time and analyze the data obtained. Present detailed block diagram of the low-frequency signal processing module, which demonstrates the work of the mathematical model. Present a block diagram of the developed mathematical algorithm demonstrating phased operation of processing from low-frequency signal captured from human cerebral cortex. Obtained in the course research results, as well as the developed mathematical models and algorithms can be used in specialized medical institutions dealing with problems rehabilitation of the musculoskeletal system of the person. The purpose of such research — process and analyze low frequency signals taken from the human cerebral cortex, and the data obtained reveal the control signals for intellectual simulators to restore the musculoskeletal system of the person.
Keywords: signal analysis, signal processing, low-frequency signals, programming, intellectual simulator, Daubechies wavelet, Morlaix wavelet, wavelet transform, mathematical model

P. 464—468

V. I. Anikin, Professor, e-mail:, Volga State University of Service, Tolyatti, A. A. Karmanova, Software Engineer, e-mail:, LLC "NetCracker", Tolyatti

Clustering and Classification of Multidimensional Data by Kohonen's Cellular Neural Network

The paper presents experimental results of multidimensional data clustering and classification by help of Kohonen's cellular neural network (CNN). An important feature of our study is that Kohonen's CNN and visualization tools (self-organizing map (SOM), U-, H- and P-matrixes, coordinate maps, map of data classes) have been implemented in Microsoft Excel spreadsheet, without programming in VBA. The user interface of this spreadsheet model makes it easy to change the configurable parameters and visually observe the neural network learning process and data classification results using cluster grouping method.
The experimental studies have shown high temporal efficiency of Kohonen's CNN learning algorithm. Having the time complexity of the algorithm is T = O(n · N · d · i), where n — the number of neurons, N — the size of training sample, d — the input space dimension, i — the number of training epochs, the experimental run time of one training epoch was t » 100 s for n = 400, N = 8000, d = 4. That is, the learning algorithm of Kohonen's CNN works in Excel about 2 times slower than the classic learning algorithm in the SOM_PAK program. This slight training time increase in Excel is repeatedly paid by clarity, analysis flexibility and effective visualization of multi-dimensional data clustering patterns.
A useful application of the edge effect and multilinked SOMs for reliable identification of clusters grouping boundaries in linear and nonlinear separable input spaces and the possibility of solving a well-known problem of "dead" neurons are shown.
Keywords: Kohonen's neural network, cellular automata, Excel, multi-dimensional data classification, visualization, U-matrix, P-matrix

P. 470—477

A. A. Uskov, Professor, e-mail:, A. G. Zhukova, Russian University of Cooperation

Neural Network Assessment Challenges IDEF-Charts

Considered neural network system for estimating the complexity of perception IDEF-human model, characterized by the use of expert-based method of paired comparisons for the data used for training multilayer perceptron, which allows for arbitrary IDEF-charts to predict its factor of perception, where you can make a comparison and optimization IDEF-models. The results presented in this paper may be useful in the construction of IDEF-models as well as the design of CASE-tools based on them.
When constructing models IDEF-important issue is to present the diagrams so as to ensure the best understanding of the model a human user. It is proposed to characterize the complexity of human-to-understand diagrams positive scalar parameters — degree of difficulty of perception. Than it is for this chart is, the more difficult it is perceived by man.
In order to predict the perception of degree of difficulty, based on the structure of the diagram, it is proposed to use the neural network system based on multilayer perceptron. For the training sample is used expert method and the method of paired comparisons, as the experts is rather difficult to accurately estimate the absolute scale factor of the perception of a large number of diagrams. The article discussed in detail the process of obtaining the training sample, as well as the development of an artificial neural network based on the expansion pack MATLAB Neural Network Toolbox.
The proposed article neural network system for evaluating factor of perception IDEF-diagrams can be used in the development of CASE-tools. In particular, it is proposed to develop algorithms and implement their software applications that allow a process of interaction with the user interactively construct optimal from the point of view of the complexity of perception IDEF-model, which will improve the software development technology.
Keywords: CASE-tools, artificial neural network, factor of perception, expert method, the method of paired comparisons

P. 478—480

To the contents