Software & Systems

Articles of journal № 2 at 2017 year.

Order result by: Public date | Title | Authors

1. Effective algorithm for constructing associative rules [№2 за 2017 год]
Author: Billig V.A.
Visitors: 10365
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,

2. Automated data processing system in UNIX-like systems [№2 за 2017 год]
Authors: E.V. Palchevsky, A.R. Khalikov
Visitors: 9542
The article considers development of distributed and modular information processing in the automated mode. Implementation of this project allows accepting input and output data on a physical server up to 2,2 GB/s in volume while distributing stream information (all incoming network traffic on the server) on physical and logical kernels. The paper shows a load dependence of physical resources on the input information. It also justifies feasibility of the developed hardware and software SDP (Speed data processing) use. There is also a structure and basic operation diagrams. The first stage of creating a complex is the development of an algorithm. The second stage includes its technical implementation. The article gives a fragment of a source code, which is responsible for notification messages on an email address as CPU load, and the main launched processes. There is a description of the main functionality with the following data: a function name, a function purpose, theoretical loading, data transfer limit (in MB/s) and a result of execution. The third stage includes testing SDP complex. Its average daily results are provided within ten days. The created hardware and software complex allows processing input and output information effectively in an automatic mode in order to increase capacity of reception and sending data in MySQL DBMS, including cases with DoS- and the DDoS-attacks. One of the parts of the complex is WEB-module, which is responsible for control, both as from a personal computer, as well as from a mobile phone. The possibility of notifying about a physical server usage by sms is realized in a monitoring part of the WEB module. The developed hardware and software complex showed high stability when handling data in large volumes with a minimum load on a computer.

3. Investigation of security of electronic payment systems [№2 за 2017 год]
Authors: T.A. Markina, V.A. Khrupov
Visitors: 5014
The article investigates security of electronic payment systems. The relevance of this study is confirmed by the official statistics, which shows the increase of the number of crimes in the field of electronic payments year by year. Therefore, users of these systems need to be aware of the security of electronic payment systems, consequently, about the security of their money stored in these systems. The work considers a variety of electronic payment systems, analyzes the ways and methods of ensuring the security of electronic payment systems, identifies advantages and disadvantages of techniques and methods of electronic payment system protection, the criteria and sub-criteria for evaluation of electronic payment system security, and determines value security index in percentage terms for each sub-criteria. Based on the values of the indicators the authors assessed security of electronic payment systems and received an overall assessment for each electronic payment system. Based on the assessment, the paper shows some conclusions about the degree of security of an electronic payment system. This study demonstrates the assessment of security of the most popular electronic payment systems in the Russian Federation and CIS countries.

4. 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: 7432
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.

5. On modeling of electricity nodal prices [№2 за 2017 год]
Author: Khalilov E.D.
Visitors: 9958
In terms of power supply system reforms in various countries, including Azerbaijan, there is a possibility of using renewable energy sources in the electrical network. Relevant studies began to trace the power of “green” power genera-tors and harmonic distortion sources. Electrical energy trading on the wholesale market uses market mechanisms, such as a day-ahead market, a balancing market, a market of regulated contracts, and free electricity sale and purchase agreements. As generating stations and other suppliers have variable cost of electricity, this fact leads to solving the relevant problem of determining nodal prices. Nodal prices show a electricity unit cost purchased in a node. Each node price includes such components as a marginal price of a balancing node, losses in transmission lines, power line price restrictions. Calculation of these components requires development of the appropriate software. The paper describes the developed algorithm for simulation of nodal prices. This algorithm is implemented as a program in MATLAB system to determine nodal prices in the electricity market. The software efficiency is tested at different test schemes. In particular, this article presents the results of nodal price calculations using the example of 7-node test scheme of electrical network.

6. Generalized periodic motions of dynamical and non-autonomous periodic systems [№2 за 2017 год]
Authors: A.P. Afanasiev, S.M. Dzyuba, Emelyanova, I.I.
Visitors: 4268
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.

7. A homogeneous distribution problem based on ant colony adaptive behavioor models [№2 за 2017 год]
Authors: B.K. Lebedev, O.B. Lebedev , E.M. Lebedeva
Visitors: 9073
The paper proposes a solution of a homogeneous distribution problem. It gives the problem statement, describes the main groups of algorithms to solve it (approximate and exact) and their advantages and disadvantages. The paper proposes a new paradigm of combinatorial optimization, which is based on modeling the adaptive behavior of an ant colony. The solution of a homogeneous distribution problem is its graphical representation as a bipartite graph. New decision mechanisms were proposed to solve these problems. The basis of metaheuristics of an ant colony algorithm is a combination of two techniques. The first basic technique is to perform the search for the best solution using an ant colony adaptive behavior. An ant builds a specific solution using a built-in procedure, which is based on a constructive algorithm. A bipartite graph that is built on the solution search graph is the main difference of the proposed ant algorithm from the existing canonical paradigm. When finding optimal solutions for optimization problems, which allow presenting solutions in the form of bipartite graphs, this approach will be fairly effective. The conducted researches showed that the ant algorithm gives more qualitative solutions in comparison with the known algorithms. Comparing known and developed algorithms, we can say that the results improved by 3–4 %.

8. Evaluating the effectiveness of sustainability problem solving methods of distributed information system functioning [№2 за 2017 год]
Author: Yesikov D.O.
Visitors: 10222
To make informed decisions regarding the organization of data storage and processing to ensure the sustainability of distributed information systems the paper proposes to use a complex of mathematical models for optimizing the dis-tribution of functional task software elements over network nodes; for optimizing the distribution of information resources by data storage and processing centers; for optimizing technical means of data storage and processing system; for optimizing the allocation of resources by information storage and processing centers. It is shown that these problems are related to the class of optimization problems with discrete Boolean variables. The paper proposes and experimentally verifies the branch-and-bound method and the method of genetic algorithms to solve formalized problems. In order to improve the efficiency of the branch-and-bound method the paper proposes preliminary determination of the variable branching order using an approximation method for solving the dual problem once. The article shows an experimental verification of the effectiveness of the branch-and-bound method for solving problems of ensuring distributed information system sustainability including the use of the algorithm of predetermined order of branching variables. The author estimates the initial data influence on overall performance of the branch-and-bound method. The paper shows the most effective strategies of variables branching to solve the designed tasks. There are variations of major operators, as well as initialization circuits of a genetic algorithm initial population to solve the problems of ensuring distributed information system sustainability. To improve the quality of the solution, which is obtained using a genetic algorithm, the author justifies the use of an adaptive scheme of individuals’ reproduction and an computational island circuit. He also experimentally checks the effectiveness of the proposed genetic and island genetic algorithms. The paper determines the parameters of genetic algorithms for ensuring maximum quality of the solutions and proves ability to manage the accuracy of the obtained solution by changing the algorithm parameters when introducing time restrictions for solving. There is a comparative assessment of the branch-and-bound method and the island genetic algorithm for solving formal problems. The paper also shows areas of their effective application.

9. Parallel computing when implementing web-based pattern recognition tools based on use case methods [№2 за 2017 год]
Authors: Fomin V.V., I.V. Aleksandrov
Visitors: 10623
The article considers a software solution aimed at improving image recognition quality and effectiveness of machine learning tools using grid technologies. The paper formulates strategic directions for pattern recognition tools as a software system based on the principles of distributed systems, parallelism and adaptive configuration of computing re-sources. The article considers the structure of web tools for pattern recognition using the concept of the algorithm library. It also describes the algorithmic solutions for parallelizing learning and recognition algorithms on the basis of classical data mining algorithms that are proved themselves in practice. Such algorithms include precedent (case-based reasoning) methods or methods based on proximity metrics. They have a great potential to parallelize computational processes and develop parallel algorithms for their implementation. The search for ways to improve the productivity of computers, especially when implementing web tools based on re-source-intensive computer algorithms for machine recognition and prediction, led to the decision to create a grid system. The architecture and implementation of the grid system considered in the article assumes parallelization and organization of distributed computations on a multi-machine basis using Internet technologies. It allows obtaining similar computing power as multiprocessor computer systems but the cost is much lower. The article considers the problem of increasing the efficiency of computing resources with the possibility of reconfiguring the structure of Internet connections, including the procedure of configuring a computer network structure, connectable communication channels and dedicated servers depending on the original algorithms and data. The paper presents dependencies of operation execution time parameters on the service discipline that adapts the system to user requests. Here the tasks are ranked according to resource intensity and computing power corresponding to their rank is allocated to them.

10. Statement of the problem of formation of directions of development of organizational automated systems and its solution algorithm [№2 за 2017 год]
Authors: V.L. Lyaskovsky , I.B. Bresler , M.A. Alasheev
Visitors: 8581
The article discusses the statement of the problem of formation of directions for the development of organizational automated information processing and control systems and its solution algorithm. It is necessary to solve this problem due to the fact that many automated systems are created and operated for decades, while the requirements for these systems change over time. Therefore, there is a need to form solutions in order to bring an automated system in compliance with new requirements from time to time. The main performance indicator of generated solutions is a complex index of the degree of automation of functional processes implemented in the system. The constraints are mandatory requirements for automation of the most important functional processes and timeliness of their implementation, as well as the maximum permissible financial and time resources for development of an automated system. The analysis of the algorithmic complexity of the problem solution shows the impossibility of its solution by considering all possible options due to exponential dependence of the number of decisions on the dimension on the source data. Therefore, the authors have developed a heuristic algorithm to reduce the number of options under consideration and rational solution to obtain a relatively small computational complexity. The proposed algorithm allows getting the decision on the development and production of complex automation equipment for an automated control system, as well as extending the life of existing automation. This algorithm is expected to be implemented in an automated decision support system, which functions as software on a consumer-grade personal computer.

| 1 | 2 | 3 | Next → ►