Open Access Open Access  Restricted Access Access granted  Restricted Access Subscription or Fee Access

Vol 30, No 11 (2024)

Cover Page

Full Issue

Open Access Open Access
Restricted Access Access granted
Restricted Access Subscription or Fee Access

Articles

Heuristic approaches for using an exact model to obtain the placement of a set of rectangles on a half-strip

Andrianova A.A.

Abstract

There is considered the problem of the compact orthogonal placement, which consists in placing of the set of rectangles on the half-strip and its solution by constructing an optimization model that reduces to solving a high-dimensional linear partial Boolean programming problem. The main method of solving the problem is the algorithm of branches and boundaries, providing consistent fixation of the Boolean variables. The direct use of this algorithm represents significant computational difficulties and is used only for the small size of the initial set of rectangles. In this paper are proposes approaches that reduce the computational complexity of the solution of this optimization model by using heuristic approaches to fix individual Boolean variables. Most of the variables responsible for the relative arrangement of all pairs of rectangles relative to each other are fixed on the basis of generating the permutation of rectangles and special code that determines the direction by which the intersection of the location of the rectangles should be monitored. Thus, the direct computing complexity of the method of branches and the boundaries of solving the problem becomes insignificant. To generate pre-fixation of the Boolean variables, genetic algorithms and local search algorithms are used. Computational experiments showed that the used techniques of fixing the Boolean variables allowed to reduce the volume of calculations and the quality of the resulting approximate solution, in general, it turns out acceptable.

Informacionnye Tehnologii. 2024;30(11):555-564
pages 555-564 views

Enhancing the robustness of the E_BLIND/D_LC digital watermarking algorithm against DCT-filtering removal attacks

Anzhin V.A.

Abstract

The paper focuses on evaluating and improving the robustness of watermarking algorithms against DCT-filtering, a common image processing technique that can be used to remove embedded watermarks from cover images. The study examines the E_BLIND/D_LC watermarking algorithm, which operates in the spatial domain and is designed to embed a 1-bit message into an image. To evaluate robustness against DCT-filtering, the research utilizes software implementations of the watermarking algorithms, the dctdnoiz filter from FFmpeg, and the Flickr8k image database, which contains 8091 images. An extension to the E_BLIND/D_LC algorithm is proposed to enhance its robustness against DCT-filtering. The paper presents an experiment comparing the robustness of the extended algorithm with the original E_BLIND/D_LC. The results demonstrate that the extended algorithm improves robustness against DCT-filtering and also maintains better image quality, as measured by the PSNR metric, at equal levels of robustness in terms of the number of successful watermark detections after filtering. This suggests that the proposed extension effectively balances enhanced robustness against DCT-filtering with the preservation of image quality. The experiment confirms that the extended version outperforms the original algorithm in both detection reliability and image quality under DCT-filtering conditions. The paper includes links to the algorithm implementations on C++ programming language and the Python testing scripts, which can be useful for further research and practical applications in software development.

Informacionnye Tehnologii. 2024;30(11):565-570
pages 565-570 views

Matrix model of deterministic synchronous cellular automata

Matolygina N.A., Gromov M.L.

Abstract

The paper presents an approach for modeling deterministic synchronous cellular automata by matrices and operations on them. It is proposed to renumber the states of the automaton and write down a matrix, the elements of which are the current states (numbers associated with them) of the cells of the automaton. It is proposed to calculate the matrix of cell states in the next cycle in two stages: find the convolution of the current matrix with a special core, and map the resulting convolution matrix into the matrix of cell states in the next cycle. The convolution core is determined by the cell neighborhood pattern, and the convolution mapping to the matrix of the following states is based on the transition function of the automaton.

Informacionnye Tehnologii. 2024;30(11):571-578
pages 571-578 views

Architecture independent test templates for virtual machines and microprocessors

Protsenko A.S.

Abstract

To ensure the quality of compilers, virtual machines and microprocessors, testing with the use of test programs is applied. Test templates, i.e. parameterized descriptions of test programs, are used to reduce the resources spent on test creation. For verification of test objects with different architectures, test templates testing the same functional properties can be used. A task of describing templates in an architecture-independent form and its customization for a target architecture arises. The paper proposes a method for creating and using architecture independent test templates. The method is as follows. Architecture dependent constructs that are needed to describe a test template are defined. Based on these constructs, an architecture independent test template is created. Then the template is customized to the architecture of the object under test by describing implementations of the architecture dependent constructs. Realizations of the constructs can be described by different sets of architecturally dependent operations, differing both by the type of data used and by the operations used. Different strategies for selecting the implementations to be used, such as full brute force, random selection, and others, can be applied in the test templates. Providing an interface as the architecture dependent constructs allows the use of third-party generators to create the architecturally independent templates. Rewriting the implementations of the constructs allows the test programs to be derived from the given templates for new architectures. This method was successfully applied to check optimizations in a virtual machine compiler.

Informacionnye Tehnologii. 2024;30(11):579-583
pages 579-583 views

A QSimulator quantum programming system

Stepanenko K.A., Shorina O.A.

Abstract

In this paper the authors propose their own QSimulator quantum programming system, which is a software tool for developing and debugging quantum algorithms in a high-level C++ language. The basic structure of the presented system is described, including quantum algorithms and quantum operations, available to the programmer. The components of the system and their fundamental basis are briefly outlined. This system emulates the behaviour of a quantum coprocessor in a standard computational basis and thus can be used for debugging and programming quantum algorithms in the language of quantum circuits. The system proposed by the authors also implements the Grover search algorithm and the Durr-Hoyer minimization algorithm based on it. Many tasks can be formulated in terms of the search task. In particular, the SAT problem. In this article, we also propose a variant of constructing an oracle in the form of a quantum circuit for the SAT problem, which can be integrated into the Grover algorithm implemented in the presented system. Automatic oracle generation for the SAT task will help save time in developing quantum algorithms related to this task when working with our system.

Informacionnye Tehnologii. 2024;30(11):584-594
pages 584-594 views

The introduction of automation in control of virtualized laboratory complex components at higher educational institution

Filimonov A.Y., Aksyonov K.A., Kodolov S.D., Gubanov D.D.

Abstract

The intensity of the use of remote work and learning tools has increased significantly during the pandemic and has led to the emergence of new tools and a significant increase in the capabilities of previously developed technology platforms. The introduction of modern technologies based on software control and complex virtualization for the creation of virtual laboratory complexes in educational institutions provides virtually unlimited opportunities for organizing individual and distance forms of practical classes. Modern learning management platforms that able to integrate with the database of university students makes it possible to evaluate the quality of students’ work with various types of course learning materials in real time. The article shows that the use of virtual communication infrastructures in connection to the Moodle learning management platform will provide end-to-end control of the theoretical and practical components of the educational process and will automate the processes of preparing and conducting practical classes, which will improve the quality of the educational processand the teacher efficiency.

Informacionnye Tehnologii. 2024;30(11):595-602
pages 595-602 views