Software & Systems

Articles of journal № 2 at 2017 year.

Order result by: Public date | Title | Authors

21. A system and legal model of information security (data protection) [№2 за 2017 год]
Authors: S.V. Golubchikov, V.K. Novikov, А.V. Baranova
Visitors: 14663
The paper considers the problems of information security (data protection) in the context of information as a strategic resource of any state, a productive force and an expensive commodity. One of the state activities to solve these prob-lems is the legal regulation of this area. Since information security is an integral part of the overall and national security with its content based on the Constitution of the Russian Federation, as well as on the core documents, the article identifies the levels of security of the Russian Federation. Security is defined as a condition of protection of the vital interests of an individual, society and the state from internal and external threats. Therefore the paper gives the definition of “vital interests” arising from the definition of “security”. The authors formulate the most important purposes for ensuring information security of the Russian Federation. The paper specifies the directions of ensuring the information security of the Russian Federation, as well as organizational and technical measures to protect information in the national information and telecommunication systems. The article presents the developed legal model for ensuring information security. The model reveals the objects of information security that may be under different kinds of influences, such as personal data; various technical means; software; information and technical systems involved in sensing, processing, storage and transmission of information (data); documents (paper, electronic); radiation; substances. There is a conclusion that information security is an integral part of the overall and national security and covers all spheres of activities of the state, citizens, as well as various organizations and businesses.

22. Formation of Vietnam energy development options by combinatorial modeling methods [№2 за 2017 год]
Authors: Edelev А.V., V.I. Zorkaltsev, Đoàn Văn Bình, Nguyễn Hoài Nam
Visitors: 8173
The article describes the combinatorial modelling approach to the research on energy sector development. The idea of approach is to model a system development in the form of a directed graph with nodes corresponding to the possible states of a system at certain moments of time and arcs characterizing the possibility of transitions from one state to another. The combinatorial modelling is a visual representation of dynamic discrete alternatives. It permits to simulate the long-term process of system development at various possible external and internal conditions, to determine an optimal development strategy of the system under study. The formation and analysis procedures of energy development options are implemented in the Corrective software package. The distributed computing environment are necessary to compute an energy sector development graph. In 2015, the Institute of Energy Science of the Vietnamese Academy of Science and Technology performed a study of Vietnam sustainable energy development from 2015 to 2030. Data of this study show application of the combinatorial modelling methods to formation and analysis of Vietnam energy development options taking into account energy security requirements. The created Vietnam energy sector development graph consists of 531 442 nodes. It is computed in the cluster located at the Institute for System Dynamics and Control Theory of the Siberian Branch of the Russian Academy of Science (Irkutsk). The found optimal way of Vietnam sustainable energy development provides minimum costs of energy sector development and operation.

23. n efficient block codig method for binary images [№2 за 2017 год]
Author: M.P. Bakulina
Visitors: 4870
Efficient image compression without quality loss is one of important problems of the information theory. This problem has a wide practical application. It is known that any digital image can be represented by a sequence of messages. There are numerous ways to select messages. The only requirement for these methods is the possibility of restoring an exact copy of the original image from a sequence of messages. One of the ways of choosing messages is that the adjacent picture elements are grouped into blocks. Then, these blocks are encoded according to the probabilities of their occurrence. Thus, short code words are used for the most probable configurations of blocks, and long code words are used for less probable configurations. The result is an average ratio of data compression. This coding is called block coding. The block coding method makes it possible to obtain efficient compression two-level (binary) images without losing quality. This paper considers the solution of this problem. We consider any binary image as many adjacent rectangular blocks of a certain size. These blocks form a set of messages, which characterizes the image. Using the optimal Huffman coding we can achieve the highest data compression. However, in blocks larger than 3×3 a set of messages is very large, and the Huffman code becomes inefficient. In addition, statistical analysis of two-level images shows that a block consisting of white elements has high probability. Based on this observation and applying the known optimal code, this paper proposes an efficient two-step block coding method for binary images. We found the optimal block size at the first stage of coding. We have also compared the experimental results of the compression ratio with the proposed algorithm and the block algorithm JPEG. The results have confirmed the efficiency of the proposed method.

◄ ← Preview | 1 | 2 | 3