Software & Systems

Articles of journal № 2 at 2017 year.

Order result by: Public date | Title | Authors |

11. 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: 8177
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.

12. Evaluating the effectiveness of sustainability problem solving methods of distributed information system functioning [№2 за 2017 год]
Author: Yesikov D.O.
Visitors: 10239
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.

13. Texturing of 3d models with filled holes [№2 за 2017 год]
Authors: A.P. Kudryashov, I.V. Solovev
Visitors: 7868
The paper presents an automatic method for texturing three-dimensional computer models. The proposed method is based on the well-known voxel approach, according to which the resulting surface of the scene is obtained by combining a variety of views in the voxel space. Diffuse blurring of weighting function values in the voxel space is used to fill holes. Simple image projection results in visible seams on scan edges. To overcome this problem one normally needs to resort to highly computationally demanding methods. The proposed method of texturing offers a solution for these problems. The texturing algorithm is based on the blending of all available textures, taking into account the weight of each pixel in each triangle, as well the overlap and observability of these triangles. The algorithmic implementation of the method is optimized to improve computational performance of the method and the quality of a generated textured triangulation model. The algorithm of indexing of triangles makes use of a texture map for each view which allows reducing the amount of computation time and therefore to speed up reconstruction and texturing. The multi-core processing provided an additional increase in computational performance. Computational experiments were performed on real three-dimensional scene data obtained by a 3D scanner RangeVision. The experiments showed that the current algorithm is able to generate realistic textures in a short time for highly detailed models.

14. A homogeneous distribution problem based on ant colony adaptive behavioor models [№2 за 2017 год]
Authors: B.K. Lebedev, O.B. Lebedev , E.M. Lebedeva
Visitors: 9082
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 %.

15. 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: 8596
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.

16. Investigation of security of electronic payment systems [№2 за 2017 год]
Authors: T.A. Markina, V.A. Khrupov
Visitors: 5021
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.

17. A software and algorithm complex of enterprise protection and management [№2 за 2017 год]
Authors: Matveykin V.G., B.S. Dmitrievsky, V.I. Mednikov, S.G. Semerzhinsky
Visitors: 6419
The paper presents an enterprise mathematical model interacting with external environment by resource exchange. Current enterprise management, as well as real unauthorized influence on its activities by external environment or a subject is a result of the impact on resources. Unauthorized actions are detected by comparison of actual and calculated values of performance indicators for a selected level of functions execution. If such action is detected, a countermeasure system becomeы active to reach the protected value. The protection success rate is accepted as minimum performance requirements based on statistics and expert way. As a result, the authors have found a technical parameter of enterprise security that quantitatively describes protection inefficiency. The built structure of enterprise protection and management system detects and locates unauthorized effect on its internal processes and the processes of interaction with the environment without human intervention. At the same time it organically combines enterprise management and protection and is significantly different from known systems. The protection and control system, which is implemented as software and algorithm complex, makes it possible to describe all production processes. The paper proposes the means of improving reliability of measurement and obtaining information about resources state. They monitor and identify the external influences on each resource without human intervention. The paper describes the developed means of obtaining quantitative information on resource state and the terms of technical feasibility of the proposed enterprise protection and management system. The proposed secure management algorithms use a resource protection system that provides reliable information at all management levels. The presented the protection and control system raise the enterprise efficiency in the interactions with the environment.

18. Automated data processing system in UNIX-like systems [№2 за 2017 год]
Authors: E.V. Palchevsky, A.R. Khalikov
Visitors: 9556
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.

19. Realization and testing of newton methods for unconstrained optimization [№2 за 2017 год]
Author: A.B. Sviridenko
Visitors: 4238
The paper describes an approach to increasing the effectiveness of Newton’s methods for unconstrained optimization based on the Cholesky factorization with step adjustment and finite-difference approximation of the first and second derivatives. The modified Cholesky decomposition of the second derivative matrix is the basis of increasing the efficiency of the Newton’s methods. It defines the solution to the problem of scaling steps during lovering; the approximation by non-quadratic functions; integration with the method of confidence neighborhoods; decrease in norms of priori amendment. The work investigates the possibility of reducing the number of function evaluations by forming the second derivative matrix in accordance with its structure. The article examins the relationship of the approach to increasing the efficiency of the Gaussian exceptions for sparse matrices and the proposed approach to increasing the efficiency of numerical methods of Newton type (using a matrix structure), that is information about matrix positions which store non-zero elements. For Newton’s methods for unconstrained optimization based on the Cholesky factorization with step adjustment and the finite-difference approximation of the first and second derivatives it is the possibility of reducing the number of function evaluations by forming a matrix of the second derivatives in accordance with its structure. The paper contains the descriptions of program implementations, all versions of the algorithms are implemented in Visual Basic .NET, the development environment is Microsoft Visual Studio 2010. The article shows the results of numerical studies of the effectiveness of the developed algorithms given the set of rules described in the work. The work studies an approach to increasing the efficiency of Newton’s methods with finite-difference approximation of the first and second derivatives. This is the basis for further research, the results of which might be used to build Newton-type numerical methods.

20. Parallel computing when implementing web-based pattern recognition tools based on use case methods [№2 за 2017 год]
Authors: Fomin V.V., I.V. Aleksandrov
Visitors: 10634
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.

◄ ← Preview | 1 | 2 | 3 | Next → ►