ABSTRACTS OF ARTICLES OF THE JOURNAL "INFORMATION TECHNOLOGIES".
No. 3. Vol. 22. 2016

To the contents

À. Å. Saak, Associate Professor, e-mail: saak@tgn.sfedu.ru, Southern Federal University

Ring Algorithms for Scheduling in Grid Systems by Sets of Tasks

Grid systems which have centralized structure of scheduling system are modeled by the resource quadrant. Multiprocessor tasks are modeled by resource rectangles. The task of the resource rectangle distribution is equivalent to the one of multiprocessor task service scheduling provided that processors with consecutive numbers are allotted for task handling. In our previous papers the resource rectangle environment were presented as an instrument of the polynomial scheduling theory for control of computational and time resource distribution. In this paper we define operations of resource rectangle dynamic integration with exceeding and minimal deviation, for the resource rectangle environment. On the base of introduced operations we develop an initial ring algorithm with exceeding and initial ring algorithm with minimal deviation which have polynomial completeness. The algorithms suggested here are adapted for use with the circular quadratic type of a multiprocessor task set. The quality estimation of the algorithms of scheduling is carried out with the use of the Non-Euclidean heuristic measure, which takes into consideration both the area and the shape of occupied resource enclosure. The values of the heuristic measure of the resource enclosures derived in the process of implementation of the initial ring algorithm with exceeding and initial ring algorithm with minimal deviation for scheduling the simulation examples of the set of resource squares with the sides equal to successive natural numbers which begin with one. The investigation shows that the initial ring algorithm with exceeding has the biggest value of the heuristic measure in comparison with the other ones. The result of the comparison of the heuristic measure values of the resource enclosures produced by the initial ring algorithm with minimal deviation and the initial ring algorithm, which was presented in the previous papers, doesn't make it possible to give preference for one of them in particular. On the base of the analysis' results we can recommend the initial ring algorithm with minimal deviation, presented here, for use in Grid systems with centralized architecture of scheduling system and the multisite mode of service.
Keywords: Grid system, centralized architecture of scheduling system, multisite mode of service, operation of resource rectangle dynamic integration horizontally with exceeding, operation of resource rectangle dynamic integration horizontally with minimal deviation, algorithm of polynomial completeness, Non-Euclidean heuristic measure, initial ring algorithm with exceeding, initial ring algorithm with minimal deviation, circular-type set of tasks

P. 163—169

D. V. Oshkalo, Postgraduate Student, dmitry.oshkalo@gmail.com, Bauman Moscow State Technical University, Moscow

Bigraph-Based Development of Model Transformation Processes

Model transformation is one of the key activities of model-driven software development, which enables model and code generation, model refactoring, model synchronization, change propagation, etc. It is performed by applying a set of transformation rules to the model elements. The most practically used rule-based approaches (like relational QVT or graphical TGG) provide a formal background for specifying model transformations, but the lack of technique of developing a transformation rules' set for every concrete scenario makes the development of model transformation processes ineffective and error-prone, since there is no possibilities which allows to formulate and verify the properties of the rule set.
A using of bigraphs is proposed as a solution to build a framework for modeling model transformation processes as event-driven systems, which provides an extensible specification, that allows to define concrete model transformation rules. This approach considers models as bigraphs, which are graph-based theoretical tools that emphasize interplay between physical locality and connectivity. Bigraphs are also used as a constraint technique for building transformation rules' templates. This method allows checking the properties of the model transformations and modeling the transformation processes in multiuser environment when simultaneous model changes performed.
Keywords: bigraphs, model-driven development, data models, model transformation, transformation rules, UML

P. 170—178

A. S. Filippova, Professor. e-mail: annamuh@mail.ru, Bashkir State Pedagogical University named after M. Akmulla, E. I. Dyaminiva, Assistant Professor, e-mail: xasel@mail.ru, Yu. I. Valiahmetova, Assistant Professor, e-mail: julikcas@inbox.ru, Ufa State Aviation Technical University

The Limited Decomposition Method for Solving a Complex Problem of Geometric Coverage and Cutting

There is considered some NP-hard complex problem of geometric coverage and cutting. The solutions for it are as follows: a plan of covering the given polygonal domain with rectangular items of maximal size; a plan of cutting maximal number of sheets into covering items. Cutting and covering coefficients are the two criteria to evaluate its efficiency. The method of limited decomposition of the coverage area is offered, it uses matrix representation of the initial data and is based on the two-stage process, namely: solving a sub-problem of decomposing of the polygonal domain into rectangular ones, the sizes of which do not exceed the sheet size; solving a corresponding subproblem of rectangular sheet cutting. The computing experiment aimed at researching and comparing of the given method efficiency and that of the hybrid evolutional algorithm, developed earlier, has been carried out. Test problem solving has shown that both methods give high cutting coefficient but the suggested method of limited decomposing brings better cutting coefficient in 90 % of cases.
Keywords: geometric coverage, cutting, multivariablc orthogonal polygon, matrix decomposition method, limited decomposition method

P. 179—187

V. I. Struchenkov, Professor, e-mail: str1942@mail.ru, Moscow State University of Information Technology, Radio Engineering and Electronics, Moscow, Russia

Dynamic Programming with Pareto Sets for Planning of the Renewable Resources Implementation

Under study is the problem of optimal planning of the renewable resources implementation, such as the commercial breeding offish, animals and so on.
The aim of this article is to study the oportunity of the optimal plan calculation using dynamic programming. The predetermined scheduling period is divided into a number of stages, such as months or years.
At each step of the process of constructing an optimal plan the key concept of the Dynamic Programming "state of the system" is formalized as the number of available resources. Process goes from a given initial state to the final one. In accordance with the principle of optimality R. Bellman in achieving some state by different ways all of them are rejected, except the way that corresponds maximum profit. In addition, the state is rejected if on the same step there is a state with more resources and more profit. As a result, at each step Pareto set is formed. Such algorithm is more efficient than classic algorithm of Dynamic Programming.
Keywords: resource, the objective function, the set of states, dynamic programming, the optimal path, Pareto sets

P. 187—191

R. R. Zagidullin, Professor, porysoft@list.ru, Ufa State Aviation Technical University

Automated Development of Alternative Technology

The paper deals with automating the creation of alternative technological processes (ATP) in systems classes CAM using the built-in libraries of programming scripts. The proposed method of formalization of ATP as a symbiosis of the traditional linear technological structure of the operating technology with operators control when used in systems of classes CAM built-in programming scripts allows you to create one record base technological process (TP) several different ATP, which further automates the process of activation of or another ATP as a current depending on the particular circumstances and be used in any system scheduling classes MES (Manufacturing Execution System), APS (Advanced Planning System).
Keywords: technological process, alternative technological process, the script, CAM, planning, MES, APS

P. 192—197

P. S. Poperechny, Postgraduate, Institute for Design Problems in Microelectronics (IPPM RAS)

Digital Filtering Application for Reed-Solomon Coder Implementation

This article proposes a method for coding circuit development by means of digital filtering. This approach allows to use digital filtering methods (cutting to small-order filters, pipe-lining) to change correcting level capability. The well-known coder scheme for RS includes linear feedback shift register (LFSR), which is very similar to TIR-filter (infinite impulse response). So, it is possible to use digital filtering for coder. Here are algebraic and scheme presentations of this approach. It is shown that we can not just change LFSR by IIR — filter, because both of them have different outputs. As well the coder works at different modes for input data and for output. But if we will use FIR-filter (finite-impulse response) serial-connected to IIR we can overcome these issues. This approach allows using all digital filtering advantages, such as to split one big order filter to many first-order filters.
Exactly this property is very useful for reconfiguration of the RS-coder for differ applications. It means that we can use only one proposed coder for any purposes, for example for different flash-memory types rather than many different coders. Here are descriptions of this method for using in RS, coder hardware description, comparing of synthesis results on FPGA with traditional coder.
Keywords: RS, correcting level capability, linear feedback shift register (LFSR), FIR-, IIR-filters (finite\infinite impulse response filters), Galois field

P. 198—202

A. V. Eremenko, Ph. D., Associate Professor of the Department "Info-communication systems and information security", nexus-@mail.ru, Omsk State Transport University (OSTU), A. E. Sulavko, Ph. D., Senior Lecturer of the Department "Comprehensive Information Protection", sulavich@mail.ru, D. A. Volkov, Postgraduate Student, vlkv.d.a@gmail.ru, Omsk State Technical University (OmSTU)

Current State and Ways to Modernize Converters Biometrics to Code

The article is devoted to the problem of the protection of cryptographic keys during their operation. The object of study in the article are the converters biometrics to code. An overview of the methods for use biometric characteristics of a human as a starting material for producing the cryptographic key encryption, as well as for identification and authentication is performed. The main factors affecting the reliability of the methods are considered. The conclusion about possible ways to modernize the existing methods to generate cryptographic keys based on dynamic biometric features is made.
Keywords: biometric techniques, personal data protection, error-correcting codes, error correcting capability, biometric features, fuzzy data, key sequence

P. 203—210

N. I. Chervyakov, Professor, Chief of Department of Applied Mathematics and Mathematical Modeling, k-fmf-primath@stavsu.ru, Ì. A. Deryabin, Postgraduate Student, Junior Researcher of Department of Organization of Scientific Research, maxim.deryabin@gmail.com, North Caucasus Federal University, Stavropol

New Method of Threshold Secret Sharing Based on Residue Number System

This paper researches basic principle of constructing secret sharing schemes based on residue number system (RNS). Perfect and computational secrecy analysis of existing secret sharing schemes based on RNS is followed by a new approach to constructing a secret sharing scheme based on conversion of the secret to RNS. The main feature of the proposed method is the fact that the size of each share is small relatively to the size of the secret. Mentioned above feature results in effective data storage and transfer. Performed analysis has shown that using compact sequences of co-prime numbers as moduli set leads to computational secrecy of proposed scheme being close to the computational secrecy of Asmuth—Bloom scheme.
Keywords: threshold secret sharing schemes, Chinese reminder theorem, residue number system, perfect schemes

P. 211—219

V. N. Zhurakovskiy, Associate Professor, S. I. Silin, Assistant, e-mail: sm2-2@inbox.ru, Bauman MSTU

System Analysis Applied to the Data Processing Algorithms Selection for Modern Computing Systems

Main purpose of this work is development of criteria system that could be applied to develop sophisticated devices based on field programmable gate array (FPGA), systems on the chip (SOC) and complex programmable logic devices (CPLD). In the first chapter of this article authors reviewed typical modern approaches to fulfilling this task. Authors provided explanation of the basis which the further apply to developed theory. In the second chapter authors developed criteria and objective function that could be used during system development to select the most suitable algorithm and realization. In the third chapter authors developed limitations to be used during selection process. Limitations are based on the typical structure of programmable integrated circuits and properties of typical problems arise during development process. In the fourth chapter authors placed example of different signal processing algorithms that could be analyzed with developed criteria and limitation systems. In the fifth chapter conclusion to work is placed. This theory suits to give mathematical and theoretical explanation of the selection process during DSP algorithms development.
Keywords: FPGA, system analysis, algorithm, parallel signal-processing, radiolocation, embedded systems, systems on the chip, electronics, circuit technique, systems engineering, system design

P. 220—228

A. S. Zuev, Ph. D., Head of the "Applied and Business Informatics" Department, Zuev_Andrey@mail.ru, I. S. Fadeev, fadeev@protonmail.ch, Moscow State University of Information Technologies, Radioengineering and Electronics

Virtual Command Centers — New Management Tool for Socio-Economic Systems

The article describes the possibilities of application of modern technologies and virtual reality devices to implement virtual command centers as an instrument of socio-economic systems at the level of the state and the individual economic actors. Expediency of addition of management system, based on the command centers, with their virtual models, which are processed with modern computer hardware is proved.
Virtual command center has no objective disadvantages as compared with real physical command centers. Namely, a person who makes decision and experts can participate in the center's work from the places of their current location and move within areas that provide access to the telephone and/or internet; costs are minimized, since there is no need for expensive equipment, communications and service personnel; information that transmitted and displayed by the virtual reality device is not available for non-targeted audience, the possibility of its reading and interception is severely limited; application of the virtual command center is used "as needed" and requires either special devices or head-mounted display for smartphones and mobile phones.
Keywords: virtual reality, command center, the management of socio-economic systems, mobile phone

P. 229—232

V. I. Golubev, Ph. D., RNTO im. A. S. Popov

Information is Display of Subjects of World Around in a Cerebral Cortex

The mechanism of consciousness is formed in this way. The signals from the object through a visual or acoustic analyzer fall within the field of projection of the cerebral cortex and are recorded in the columns in the area. Then they are transferred to the field of associative cortex. There momentum flux forming rings connected neurons, wherein a burst circulate with damping. It has rings connected neurons, rings reverb, which are formed by horizontal connections in neural networks. This circulation occurs with attenuation of the signal amplitude, but it is enough to record the process in biochemical memory peptides and create lasting memories of an event process. Separate impulses from neurons in the rings back to the thalamus, hippocampus, others go on and on to the thalamus through the caudate nucleus of the brain. The delay in the long pulse brain nuclei required for direct synchronization pulses from the projective areas and detained in long nuclei of the brain, the hippocampus. This delay creates a long-term memory.
Keywords: matter, energy, consciousness, information, brain, thoughts, ideas, cortex, neuron, thalamus, hippocampus, reverb, kolumns, drums

P. 233—239

To the contents