Software & Systems

Articles of journal № 4 at 2023 year.

Order result by: Public date | Title | Authors |

1. Quantum algorithmic gate-based computing: Grover quantum search algorithm design in quantum software engineering [№4 за 2023 год]
Authors: Ulyanov, S.V., Ulyanov, V.S.
Visitors: 1221
The difference between classical and quantum algorithms (QA) is following: problem solved by QA is coded in the structure of the quantum operators. Input to QA in this case is always the same. Output of QA says which problem coded. In some sense, give a function to QA to analyze and QA returns its property as an answer without quantitative computing. QA studies qualitative properties of the functions. The core of any QA is a set of unitary quantum operators or quantum gates. In practical representation, quantum gate is a unitary matrix with particular structure. The size of this matrix grows exponentially with an increase in the number of inputs, which significantly limits the QA simulation on a classical computer with von Neumann architecture. Quantum search algorithm (QSA) – models apply for the solution of computer science problems as searching in unstructured data base, quantum cryptography, engineering tasks, control system design, robotics, smart controllers, etc. Grover’s algorithm is explained in details along with implementations on a local computer simulator. The presented article describes a practical approach to modeling one of the most famous QA on classical computers, the Grover algorithm.

2. Russian import-substitution structure based on an optimal distribution system model [№4 за 2023 год]
Authors: Abu-Abed, F.N., Zhironkin, S.A.
Visitors: 1150
The study focuses on a model of an optimal distribution system of economy investments that requires import substitution due to external shocks and sanctions. It is necessary to build a mathematical model that links a sectoral structure of investment and output in terms of technological limitations. This paper explores possibilities of using economic structure and dynamics models for import substitution purposes; using a production function for this purposes, dynamic stochastic general equilibrium models and Bayesian vector autoregressions. This paper presents author's method based on constructing a decision tree for enumerating bypass cycles – route options with a cut. The proposed method can be modified to reduce its running time. The recommended technology for constructing an import substitution structure model is initially reduced to constructing its objective function and presenting it in a graph form. Subsequently, based on a data structure for building routes, the authors present an algorithm that is a basis for implementing optimal distribution of investments in an industry structure and for monitoring their compliance with the designated import substitution requirements. This algorithm is a basis for a software tool architecture and structure with corresponding classes, which provides output as an investment-industry correspondence. The results obtained are necessary for developing a software tool that can solve the important industry problem of modeling an import substitution structure based on investment distribution by industries and products, as well as predict the impact of new external shocks and technological restrictions on this process, changes in labor productivity and a production capacity utilization level.

3. Using MPI library for parallel implementation of a brute-force algorithm [№4 за 2023 год]
Authors: Aye Min Thike, Lupin, S.A., Fedyashin, D.A.
Visitors: 1253
The paper presents results of studying the effectiveness of a parallel application for solving a quadratic assignment problem. The application uses a brute-force algorithm and a Message Passing Interface (MPI) to ensure interprocess communication in a distributed computing environment. Solution options are generated by a lexicographic permutation method, which is well parallelized and ensures load balancing of nodes. The range of brute-force algorithm use to large scale optimization problems is expanded by dividing a search space into parts, which significantly reduces the number of options under consideration. The experiments were conducted in a distributed environment containing 50 nodes with the 7th generation Intel ® Core ™ i5 processors. A parallel application for solving a large-scale problem (n = 24) demonstrated the possibility accelerating calculations in the range from 99 to 95 % from the maximum possible one; an exact solution was found in all cases. This confirms the correctness of methods used for load distribution and for computational complex-ity reduction of tasks. Further work will be aimed at exploring the possibility of using the proposed approaches to implementing a brute-force algorithm and as hybrid applications, which is relevant for heterogeneous computing environments. Since a quadratic assignment problem is a discrete optimization problem, the obtained results suggest that the proposed approaches are effective for other problems of this class.

4. Information security of a supercomputer center [№4 за 2023 год]
Authors: Baranov, A.V., Korepanov, P.M., Kuznetsov, E.E.
Visitors: 1083
Most scientific supercomputer centers (SC) process open access information. Typically, they use standard information security technologies built into operating systems, data storage, and network devices. In recent years we can see an increase in both the number of information security threats and computer attacks and incidents against SCs, which causes reputational and financial risks for SCs. The paper discusses information processing features in SC, which significantly limit known information security measures and tools. Such features include SC user’s freedom to choose tools and application software packages to solve their research problems; a need to ensure maximum computing performance of super-computer resources provided to users; a limited use of secure operating systems and software update tools. The paper justifies the relevance of developing a complex system approach to SC information security. An adequate level of SC information security must be ensured without significant restrictions of user abilities and reducing the quality of high-performance computing services provided to users. The paper discusses current threats to SC information security, provides a classification of data processed in SC, and defines a list of current information security measures. The proposed optional SC information security system structure takes into account the reviewed features of SC information security. The proposed approach is based on dividing SC computing infrastructure into security zones and on using network perimeter control tools, as well as access and information security event analysis.

5. Extracting subsystems from a multilevel representation of a Boolean function system for joint logical minimization [№4 за 2023 год]
Authors: Bibilo, P.N., Kirienko, N.A., Romanov, V.I.
Visitors: 1394
The paper presents experimental results obtained from studying the effectiveness of programs for minimizing multilevel algebraic representations of Boolean function systems performed in combinational circuit synthesis. The resulting minimized logical descriptions are presented as Shannon expansion formulas or formulas defining Boolean networks. Three approaches are investigated: joint minimization of multilevel representations of Boolean function systems; separate minimization; selection of connected subsystems from an original system, where each connected subsystem is minimized separately, however functions that make up each subsystem are minimized together. After obtaining minimized descriptions of circuits given as a set of interrelated Shannon expansion formulas or as two-operand logical equations corresponding to Boolean networks, the synthesis of logic circuits is performed within the same library for designing custom digital CMOS VLSI (very large integrated circuits made using complementary metal oxide-semiconductor technology). The resulting logic circuits are compared in terms of a crystal area and speed (time delay). Experiments involve 39 industrial examples of circuits. Experimental results show competitiveness and expediency of all three considered approaches in practice. The improvement of circuit parameters (area, time delay) in approach 3 is achieved due to minimizing each selected subsystem on the basis of Shannon expansions in its own (for each subsystem) permutation of expansion variables. At the same time, minimizing multilevel representations based on Shannon expansions for function system matrix descriptions is more effective for one half of circuits; minimizing based on Shannon expansions of function systems presented as logical equations is effective for the other half. The practical significance of the study is that the developed software, which implements the proposed algorithm for extracting Boolean function subsystems, allows reducing the area and increasing the performance of functional blocks of custom CMOS VLSI in many cases.

6. Finding an optimal letter set for stylistic classification of literary texts by a statistical index method [№4 за 2023 год]
Author: Gorbich, L.G.
Visitors: 907
The paper concerns the problem of improving style classification methods of Russian-language texts. A method for optimizing a letter set for calculating statistical indices of texts is proposed as a possible research direction. The work used both poetic and prose literary Russian texts for optimization and monitoring the results. The volume of texts was about 300 thousand characters for optimization and about 100 thousand characters for control evaluation. Calculating statistical indices was based on calculating frequencies of letter bigrams and trigrams. Optimization also involved testing joint use of bigram and trigram indices. The paper provides a brief description of a method of statistical indices, a step-by-step optimization algorithm used in the study, a possible optimization function formula, and a formula for finding a classification boundary. It is shown that a letter set optimization improves classification in comparison with both using a full letter set and using a vowel set, when applied to automatically distinguishing poetic and prose literary texts in Russian. Classification results are compared by the proposed classification boundary formula with ROC-curve method calculation results. Therefore, for different combinations of statistical indices and methods for determining a classification boundary, a correct classification range was: 72–74 % for an all letter set; 82–86 % for an only vowel set; 80.5–92.5 % for different sets of letters obtained during optimization.

7. Developing a mobile application life cycle model for people with intellectual disabilities [№4 за 2023 год]
Authors: Guryev, V.V., Shabalina, O.A., Sadovnikova, N.P. , Voronina, A.A.
Visitors: 956
The article discusses life cycle models and software tools for supporting mobile application development. It also analyzes peculiarities of developing mobile applications for people with intellectual disabilities. One way to increase the accessibility of applications is to make them adaptable. Such adaptation requires supporting an application dynamic content, therefore, these features must be already provided at life cycle design and implementation stages. The paper proposes a mobile application development lifecycle (MADLC) model that provides end-to-end support for the stages of design, implementation and maintenance of mobile applications for users with intellectual disabilities. There is a developed mobile application design technology based on a multi-module architecture, which includes developing ready-made architectural templates for generating a basic application code and reuse of successful design solutions. The paper describes the devel-oped adaptable interface design technology based on Pattern-Based user Interface Design Approach. The technology includes developing screen templates, separating template elements into mandatory and optional ones, matching each GUI element with a predefined set of its possible visual representation, and attaching elements in place. A mobile application management system implements CALS technology of end-to-end support for the stages of mobile application design, im-plementation and operation. The paper proposes a method for adapting a mobile application interface using a configuration panel built into the system. There is an example of developing a mobile game for training shopping skills for people with intellectual disabilities. It is shown that the mobile application management system can significantly reduce time spent on developing mobile applications. Using architecture templates and ready-made solutions expands the range of system users and makes it available to developers whose professional activities are related to supporting people with intellectual disabilities.

8. Automatic runtime error localization for software debugging using neural networks [№4 за 2023 год]
Authors: Dostovalova, A.M., Sherminskaya, A.A.
Visitors: 1252
A new automatic runtime error localization method using a neural network was developed. The method determines bug position by program functions tracing data. The method matches an error containing probability for each function. This probability is proportional to the effect of each function parameter on a program execution result. A numerical characteristic calculated by Hashem algorithm determines a parameter effect. The method was applied for debugging several programs with nested functions. The most probable bug locations defined by the method were compared with their real positions. The developed method has some features. It is able to localize multiple bugs, nested function bugs, and bugs with unequal manifestation and location places. In all cases, bugged parameters had more weight in comparison with rest parameters. At the same time, method determines a full error trace for each bug. The trace consists of all program parameters related to a bug. Therefore, the method is able to localize logical errors in program. The method can be used for debugging both technical system software and hardware since method logic does not depend on source data.

9. Integration of reinforcement learning methods and fuzzy logic for intelligent real-time systems [№4 за 2023 год]
Authors: Eremeev, A.P. , Sergeev, M.D., Petrov, V.S.
Visitors: 1292
The paper considers the possibilities of integrating reinforcement learning methods and fuzzy logic in terms of improving the efficiency of reinforcement learning algorithms. The main focus is on applying such integrated methods in real-time intelligent systems, especially in decision support systems for monitoring and controlling complex technical objects. The basis is a reinforcement learning method based on temporal differences; an environmental state and the reward signal are formed using fuzzy logic. The paper presents software implementation and the data of computer simulation of deep learning methods with reinforcement based on temporal differences obtained from a comparative analysis of a fuzzy logic algorithm and neural network algorithms. The authors of the paper show that the main advantages of reinforcement learning algorithms using fuzzy logic are: training effectiveness in terms of minimizing the number of episodes, which is especially important regarding the availability of limited data for training or rapid adaptation of real-time training; resistance to noise and outliers in data, which is important in real environments with noise or data changes; interpretability - fuzzy logic algorithms provide interpretable rules and conclusions based on fuzzy logic; extension of a reinforcement learning scope to subject/problem areas and tasks with a continuous state space. These researches and developments are carried out in terms of designing intelligent real-time decision support systems. Such systems are designed to help operational dispatch personnel (decision makers) in monitoring and managing complex technical and organizational systems under fairly severe time constraints and various types of uncertainties (inaccuracies, fuzziness, inconsistencies) in the information entering a system, i.e. in the presence of so-called noisy data.

10. An integer programming solution: Iterative rounding of coordinates [№4 за 2023 год]
Authors: Ivanov, A.V., Matveev, Yu.N.
Visitors: 1243
The article proposes an algorithm for finding an integer solution using the idea of rounding coordinates of an optimal non-integer solution point and constructing a half-line directed deep into an acceptable solution area. The proposed algorithm is based on an iterative process of rounding coordinates of a point in the direction of a constructed half-line. The study educed that moving towards a half-line without going through all possible options simplifies the algorithm and avoids branching, which distinguishes this approach compared to other currently existing open methods, such as the method of clipping and the method of branches and boundaries. The aim of the work is to develop and study an algorithm for finding an optimal integer solution using the idea of rounding coordinates of a point of an optimal non-integer solution. During the study, the authors carried out description and experimental verification of this algorithm and the possibility of its application in different forms of an acceptable solution domain. The theoretical significance of the work is a development of a new algorithm that does not require performing a simplex-method at each stage, and uses a half-line instead of a plane at each algorithm step, which prevents an increase in problem spatial complexity compared to other methods. The study showed that the proposed algorithm has limitations; however, the main idea proved its operability, which is planned to be developed further.

| 1 | 2 | Next → ►