Научный журнал «ИНФОРМАЦИОННЫЕ ТЕХНОЛОГИИ И ТЕЛЕКОММУНИКАЦИИ»
Сообщение
2023, Vol. 11, Iss. 2 |
|
Implementation of INSERT in PostgreSQL in a Segment Tree
|
|
V. Martynov, N. Plotnikova
|
|
Abstract: Purpose: This article is a continuation of the article [1], which considered a method of optimizing aggregation queries on a continuous range of PostgreSQL databases rows using a segment tree [2–4]. The disadvantage of the considered approach was that the operation of inserting new values into the table took too much time, as it led to a complete rebuilding of the tree. The purpose of this work is to develop a method that allows to significantly speed up the insertion of new items into a table while maintaining up-to-date information in the segment tree. In this article, we propose a method that can significantly speed up the insertion of new items into the table while maintaining up-to-date information in the segment tree. At the same time the gain in aggregating queries is fully preserved. The method is based on the peculiarity of the segment tree, which allows to update elements in it for O(log_2 N) asymptotic. Then we can reduce the problem of adding new values to updating existing elements, which can be solved more efficiently. For this purpose, additional neutral elements are allocated during the construction of the tree. When new values are added to the table, one of these additional elements is updated. When the free elements in the tree run out the tree is rebuilt, again allocating additional memory. The result of this work is the development of an algorithm for updating elements in the tree and its implementation in the form of PostgreSQL Extensions. The speed of the obtained solution has been measured. Conclusions on the results of work and plans for further optimization of operations are made.
Keywords: database, segment tree, PostgreSQL, insert, asymptotic.
DOI 10.31854/2307-1303-2023-11-2-1-7
|
|
Algorithm for Effectiveness Evaluating of Graphical User Interfaces Color Aesthetic
|
|
A. Vostrykh
|
|
Abstract: Purpose: currently, for the performance of various job responsibilities by users, there is a wide range of software characterized, in addition to functionality, by cognitive and ergonomic characteristics, on which such user indicators as: work speed, satisfaction, probability of making mistakes, etc. depend. In order to select the most effective software products from a variety of existing analogues, a scientific and methodological tool based on a strict mathematical apparatus is needed, which will avoid subjectivity of the evaluation results. The purpose of the work is to develop a scientific and methodological tool in the form of an algorithm that allows evaluating software products to select the most effective ones. Methods: to achieve this goal, a comparative analysis of a wide range of approaches from such fields of science as visual aesthetics was carried out; human-computer interaction, gestalt psychology, neuroaesthetics, perceptual psychology and ergonomics, which allowed us to identify a number of approaches capable of solving the tasks of this study. Novelty: compared with differential approaches to software evaluation, the developed algorithm is based on the aggregation of a number of selected indicators for evaluating the consistency of information and functional elements of graphical user interfaces. Results: an algorithm for evaluating the consistency of information and functional elements of graphical user interfaces has been developed, which allows evaluating and comparing software products in this area.
Keywords: graphical user interface, algorithm, consistency, information and functional element, evaluation.
DOI 10.31854/2307-1303-2023-11-2-8-24
|
|
An Algorithm Design for a Secure Full Duplex Non-Orthogonal Multiple Access in Wireless Communication System
|
|
R. Khan
|
|
Abstract: In this article, a new Component-Forward (CF) cooperative communication algorithm is proposed for Full Duplex Modulation-based Non-Orthogonal Multiple Access and is referred as FD-MNOMA. The FD-MNOMA prevents security issues in the FD mode of a cooperative communication system, where a near user assists a far user to receive a better quality of signal. For further improving the security issues, Artificial Noise (AN) is also added to the signal and called it FA-MNOMA. In this article, the secrecy capacity equation is derived for the FA-MNOMA algorithm. Performance evaluation shows that FA-MNOMA and FD-MNOMA outperforms the traditional NOMA. The secrecy capacity of FA-MNOMA is further optimized using Machine Learning Genetic Algorithm (MLGA). This article also shows the implementation of FA-MNOMA in the Intelligent Transportation System (ITS) as one of its applications.
Keywords: 5G, AN, component-forward (CF), FA-MNOMA, FD, NOMA, MLGA, secrecy capacity.
DOI 10.31854/2307-1303-2023-11-2-25-34
|
|
Technological Aspects of IBN Technology for Slicing at 5G Multiservice Network
|
|
V. Elagin, E. Mitin
|
|
Abstract: Purpose: The 5G network offers a variety of services, each of which requires specific parameters such as performance, throughput, reliability and latency. In this regard, network virtualization is a robust solution known as network slicing that provides support for different types of services and provides resources that match the needs of each service. The purpose of this review is to examine the implementation of a slicing platform within a 5G multiservice intent-based network that allows network operators to deploy network services in a flexible and customizable manner. Results: The considered system architecture provides the ability to monitor virtual and physical resources using OpenStack Neutron and the FlexRAN controller application. In addition, the implementation of the platform for intent-based network segmentation under consideration gives operators the ability to deploy network services in a flexible and customizable manner.
Keywords: Intent-based network, 5G, slicing, IBN, FlexRAN, GAN.
DOI 10.31854/2307-1303-2023-11-2-35-46
|
|
Application of Categorical Division to Classify Motivation For Insider Activities
|
|
D. Vlasov
|
|
Abstract: Statement of the problem: identifying insider activities in organizations that lead to threats to information security, one of the first steps of which should be the study of the motivation that pushes employees to illegal actions. The purpose of the work is to synthesize the main classes of insider motivations; at the same time, the classes must cover all possible situations, and each of the classes must not overlap with others. Methods used: categorical division to identify classes and their practical justification. Novelty: in contrast to the existing motivations of insiders, the proposed classification meets the criteria of necessity and sufficiency, thereby being initially sufficiently consistent and covering all cases; Moreover, all classes are obtained theoretically using the strict logic of categorical division. Result: the use of categorical division identified 3 pairs of categories (Internal vs External, Physical vs Psycho-emotional, Benefit or good intentions vs Harm or malicious intent), which made it possible to form 8 unique classes of insider motivations based on their combinations. The existence of each class is confirmed by the presence of a corresponding publication. Theoretical relevance: a unified set of insider motivation classes was obtained that meets the criteria of necessity and sufficiency. Practical relevance: the resulting classes of insider motivations can be used to understand the reasons for such illegal activities and, therefore, to create effective ways to counteract them.
Keywords: information security, insider, organization, motivation.
DOI 10.31854/2307-1303-2023-11-2-47-56
|
© SPbSUT © Authors
Авторизация
