Software & Systems

Articles of journal № 2 at 2017 year.

Order result by: Public date | Title | Authors |

1. Unified description of information radioelectronic system functioning to estimate training aids software [№2 за 2017 год]
Authors: Abu-Abed, F.N., Dopira R.V., I.N. Ishchuk, E.Yu. Brezhnev, Potapov A.N.
Visitors: 9361
Nowadays, training aids software evaluation is performed according to the coincidence degree of simulated processes with the real one. However, the lack of universality in the description of the mechanisms for operating ergonomic information radio electronic systems (RES), for which training complexes are developed, does not ensure development of tools to form their application strategies taking into account changes in operating conditions that are invariant to RES. As a result, a unified description (representation) of information radio electronic system functioning is relevant. On this basis it is proposed to create software for their training aids. Considering this, the goal of the work is a unified description of information radio electronic systems functioning with further implementation of their training aids software evaluation. A unified description of information radio electronic systems functioning is based on a unified approach to RES representation as structural and logical schemes. Their distinguishing feature is that they take into account radio frequency (RF) interactions with environmental elements expressed through RF actions and RF influences that form cause-effect relationship of RES operation RF-conditions. The possibilities of implementing RES of the functions of selecting, distributing and redistributing resources depend on the mechanisms of controllability in it. To construct structural and logical schemes of ERT operation that take into account operator activity, the paper considers the mechanisms of their controllability. This allows us to develop a scientific and methodological instrument to evaluate software of training facilities for air traffic control operators (ATC) based on the examination results. Moreover, when presenting them as complex hierarchical structure systems and in the information field of ATC operator workplaces using Fisher-х2 criterion and the generalized distribution law.

2. Recursive algorithm for exact calculation of rank tests for testing statistical hypotheses [№2 за 2017 год]
Authors: Agamirov L.V., Vestyak V.A., Agamirov V.L.
Visitors: 10236
The paper considers the method of generating exact distributions of nonparametric rank tests by means of the computer combinatorial theory. Relevance of the work consists in the fact that determination of exact distribution of critical values of rank tests for statistical hypotheses testing is complicated by the fact that the exact tables and recurrence formulas for many of the tests do not exist. In addi-tion, approximations often give unsatisfactory results at limited volumes of observations. The task of calculating the distribution for rank tests is a search of all possible sample permutations and calculations of rank sta-tistics, as well as cumulative frequency of their occurrence. The program of generating permutations of elements of samples for nonparametric rank criteria based on the recursive brute-force algorithm of direct enumeration of order statistics vector permutation is developed with the following limited number of op-tions: in all permutation options the elements from the same sample cannot be swapped. It is a universal condition for all the rank criteria exact distributions. The paper refers to the Internet resource that contains the software package implementation of the considered calculation algo-rithm for a rank test. This complex contains four nonparametric criteria: two-sample Wilcoxon test, Lehmann-Rosenblatt test, series test and Kruskal-Wallis test, whose accurate distribution statistics are of greatest interest for technical problems. The algorithm can be used for other rank tests of statistical hypotheses testing. The paper presents an implementation of the generation method of nonparametric rank test exact distributions by computer com-binatorial means. It is based on the developed by the authors recursive direct enumeration of options of order statistics vector permu-tation with following filtration of the results. Thus, the authors solve the problem of determining the critical values of nonparametric rank tests for testing statistical hypotheses.

3. Generalized periodic motions of dynamical and non-autonomous periodic systems [№2 за 2017 год]
Authors: A.P. Afanasiev, S.M. Dzyuba, Emelyanova, I.I.
Visitors: 4267
This review represents the history of study analysis of the situation of typical behavior of dynamical and non-autonomous periodic system motions. The necessity of this investigation is due to the fact that the complete and detailed description of a typical behavior situation makes it possible to solve the problem of construction of generalized periodic motions of dynamical and non-autonomous periodic systems. The necessity of numerical investigation of indicated systems is due to the fact that the vast majority of real technological, biological, economical and others process models are described by these specific systems. In the autonomous case a generalized periodic motion is equivalent to a classical recurrent motion, which was introduced and investigated by G. Birkhoff. The concept of the recurrent motion is related to the concept of a minimal set. These two concepts define the situation of typical behavior of classical dynamical systems. The construction and investigation of recurrent motions and minimal sets took on special significance due to the requirements of chaotic dynamics and the hyperbolic theory. However, until quite recently there were no general methods of constructing recurrent motions and minimal sets. It came down to constructing attractors of separate systems of differential equations with a polylinear right part. The discovery of the generalized periodic motion concept resulted in creation of the general method of construction and investigation of all minimal sets contained in limit sets of dynamical systems. Furthermore, the concept of a generalized periodic motion allowed adapting all the basic definitions of the classical dynamical system theory to non-autonomous periodic systems and describing the situation of typical behavior in such systems on common ground. Therefore, it allows adapting directly the method of recurrent motion construction to the construction of generalized periodic motions of non-autonomous periodic systems that made the numerical construction of such motions on common ground possible.

4. A software package to measure time of audio motor reaction of chemical technological process control system operators [№2 за 2017 год]
Authors: O.L. Akhremchik , I.I. Bazulev
Visitors: 7585
Time of the operator’s sensory-motor response is a basis for choosing models of information representation and the strategy of chemical and technological process control to minimize losses during human-computer interaction. Sound signal application for forming messages of abnormal and preventive alarms leads to the need of development of methods and monitoring aids of audio-motor response time. The paper considers the structure, functional characteristics and the main components of a software packege for measuring simple audio motor reaction time of a control system operator. According to the structural programming conception, Delphi means are selected to implement the complex. The paper describes screen forms types of the program complex and possible operator actions to use the forms. As complex set-up parameters it is offered to use a type of a sound signal; time interval defining the moment of signal appearance; a number of signal presentations. The different frequency tone signals are used as incentives for measurement. Databases of sound signals, operators and measurement results are filled and used during measurement. The software package might be applied to operate as a part of a control system of chemical and technological process. The package may be considered as a tool for indirect estimation of the status of the operator’s central nervous system. A basis of measurement results transfer to other program systems is saving results as *.cds and *.txt. The package approbation results show that the nature of influence of external factor set on operator’s audio motor reaction time has a multiplicative character.

5. n efficient block codig method for binary images [№2 за 2017 год]
Author: M.P. Bakulina
Visitors: 4868
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.

6. Effective algorithm for constructing associative rules [№2 за 2017 год]
Author: Billig V.A.
Visitors: 10363
Constructing associative rules is one of the most important algorithms for extracting knowledge from databases. All modern algorithms are somehow connected with Apriori algorithm proposed in R. Agrawal’s and his co-authors’ works published more than 20 years ago and now considered classical. The known effective implementations of the algorithm are connected with database compression and presentation of data structure as a tree, which allows effective evaluation of support and other characteristics of associative rules. The proposed ConApriori algorithm does not use the above idea. We regard database transactions as enumeration given by a scale. This allows instant calculation of the basic algorithm operation determining whether some set is a subset of another set or not. The calculations are reduced to several logical computer commands. Enumeration also allows us to treat the transaction in the internal presentation as a number, preserving the meaning of the transaction elements in their external presentation at the same time. Another idea used in the algorithm allows us to construct most of the confident rules on the basis of those previously built. This article provides evidence for correctness of the algorithm as well as evaluate its complexity. We analyze its effectiveness compared with other known algorithm implementations. Possibility of parallelization is also considered. Keywords: data mining, apriori, associative rules, support, confidence, lift, enumeration, scale, database, transaction,

7. A contracted representation of strong associative rules in data analysis [№2 за 2017 год]
Authors: Bykova V.V., Kataeva A.V.
Visitors: 9437
Modern methods and means of searching for association rules in big data lead to a significant number of rules, many of which are redundant. Redundant association rules are generally of no value, but they can misinform. To solve this problem, the paper proposes an algorithm MClose, which is a modification of the algorithm Close. It is known that Close algorithm might help to construct mini-max basis for strict association rules (association rules with the confidence of 1). Mini-max basis consists of only min-max association rules. Association rules with minimal antecedent and maximal consequent are called min-max association rules. Such rules are interesting for experts. However, mini-max basis may contain redundant association rules. The algorithm MClose immediately eliminates redundant association rules when creating mini-max basis. The resulting basis is called concise strong basis (CSB). Redundant association rules might always be obtained from the CSB without sacrificing their support and confidence, without references to the data set. Algorithm MClose is based on Galois connection. MClose algorithm is also based on derivability, which are similar on Armstrong axioms for functional dependencies. Experiments have shown that running time of algorithm MClose is comparable with the algorithm Close. However, it reduces the number of association rules mini-max basis about twice. We provide a description of the program which presents MClose and Close algorithms.

8. A system and legal model of information security (data protection) [№2 за 2017 год]
Authors: S.V. Golubchikov, V.K. Novikov, А.V. Baranova
Visitors: 14652
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.

9. Clustering software solution [№2 за 2017 год]
Authors: A.S. Grigorash, Kureichik V.M., V.V. Kureychik
Visitors: 10157
Nowadays, information technologies have developed considerably. Databases grow too fast, and data processing becomes more and more difficult with each passing day. Data mining methods become an urgent area of study for processing large amounts of data because they allow finding out implicit patterns in data sets. One of the main tasks of data mining is clustering. The authors formulated the clustering problem. Clustering is a NP-complete, difficult task, therefore it is necessary to develop non-standard algorithms and methods for finding an effective solution in polynomial time. The purpose of this research is to build a software package for solving the clustering problem. In order to solve it, there were proposed modified methods of evolutionary modeling and swarm intelligence, which might adaptat to environmental changes. The paper specifies a modification to find quasi-optimal solutions, which allowed significantly reducing the time of cluster for-mation. It also describes modified genetic, ant and bee colony algorithms, as well as an algorithm functioning model as a consistent system. The article considers the structure of the software system and the developed an intuitive user interface. A computational experiment was carried out on different amounts of data banks. A series of computational experiments showed that the time for element clustering approximately equals to 9.4 seconds. The difference between the obtained value and the optimal value is at average of 3–5 %. Within the research, the optimal time is 8–9 seconds. The experiment revealed temporary complexity of the developed complex. It approximately equals to the ICA ≈ O(n2).

10. Method of generating sets of alternative variants of building subsystems which are a part of a computer attack protection system [№2 за 2017 год]
Authors: Drobotun E.B., Uglovsky E.P., I.Sh. Zamaltdinov
Visitors: 7431
Constructing a rational computer attack protection system for an information or automated system assumes creating a set of protection system configurations consisting of a set of separate program and hardware-software components and a further choice of a rational option of creating a computer attack protection system from the created set according to cer-tain criteria. When generating this set, in addition to protection system compliance with necessary functional requirements, it is necessary to consider the parameters of the protected system (its structure and a multiple-level creation system), as well as software and hardware compatibility of components, and also compatibility of components with a hardware-software platform, which is the basis for the constructed protected system. The article presents one of the possible approaches to forming a set of possible options of creating a computer attack protection system, taking into account its decomposition on three subsystem types. They are: computer attack detection subsystems, computer attack counteraction subsystems and subsystems of elimination of consequences of computer attack application.

| 1 | 2 | 3 | Next → ►