Vol 23, No 6 (2024)

Mathematical modeling and applied mathematics

A Compositional Approach to the Simulation of Queuing Systems with Random Parameters

Goncharenko V.A., Khomonenko A.D., Abu Khasan R.

Abstract

A general approach to modeling random service processes under conditions of disturbances and uncertainty of the initial data is substantiated. A compositional approach to constructing simulation models of queuing with parametric uncertainty based on phase-type distributions and phase functions is proposed. The calculation and comparison of the characteristics of the developed simulation models with analytical solutions were carried out to confirm their effectiveness and accuracy. The problems of uncertainty of the initial data and their impact on the modeling of service systems are highlighted. The importance of taking into account parametric uncertainty in simulation models is emphasized in order to increase their adequacy and applicability in practice. The study includes a description of a general approach to modeling random service processes with uncertainty, as well as methodological foundations for the application of phase distributions and functions in compositional modeling. Four classes of service models are considered, differing in the type of integral core and phase function, which makes it possible to implement a variety of random service processes, taking into account their characteristics and conditions of their occurrence. The analysis of a model with an exponential integral core and various types of phase functions is carried out, which demonstrates the flexibility and wide possibilities of the proposed compositional approach to the study and modeling of service systems. The results of simulation modeling are presented, confirming analytical studies and showing the applicability and effectiveness of the developed approach in the construction and analysis of models of service systems with random parameters. The practical significance of the compositional method for the design and modernization of information and computing systems at various stages of their development, taking into account the uncertainty of the initial data, is noted. The work is focused on the development of simulation methods for queuing systems and opens up new prospects for their research and optimization in conditions of uncertainty of initial parameters.
Informatics and Automation. 2024;23(6):1577-1608
pages 1577-1608 views

Research of Options for Constructing Information Management Systems Based on Network Models of Queuing Systems

Kurakin S.Z., Onufrey A.Y., Razumov A.V.

Abstract

The use of information management systems (IMSs) for the management of technical facilities is currently one of the directions for further improvement and increase in the effectiveness of the use of technical facilities in solving their target tasks. The existing modern IMSs are a set of hardware and software tools designed for collecting, processing and storing information and management. In the presence of a large amount of information and contradictory factors affecting the quality of management, making informed and timely decisions in the management process is impossible without the use of IMSs. The IMSs currently being developed are, for the most part, specialized systems and are designed to solve specific tasks. In this regard, the development and design of IMSs should be carried out taking into account the relationship with the target indicators and features of the management facilities, the results of a comprehensive analysis of information about the IMS elements in the process of functioning, and structural and algorithmic parameters that affect performance indicators. The use of mathematical models for the study of options for the construction of an IMS is the basis for the design and development of devices and subsystems of an IMS. The IMS models currently being developed make it possible to conduct research for single-stage management processes with the presence of similar service facilities in the system. At the same time, modern technical facilities and control systems are complex complexes with cyclically repeating control processes of various types of means. As a rule, such complexes have a set of parallel operating devices (control channels) that provide control of different types of objects at various stages of information processing. In this case, the structure of the IMS must be represented as a multiphase multichannel technical system in which the process of simultaneous management of several objects of various types takes place. In this regard, the purpose of the article is to develop a mathematical model of an IMS with two phases of management and the presence of an arbitrary number of serviced different types of management facilities. The basis of the model is a multiphase CFR network model with a limited waiting time for an application in the service queue. The study on the model allows choosing an option for building an IMS, in particular, choosing the optimal number of control channels for various types of objects according to the criterion of optimality and restrictions on the cost and time of management. An algorithm for selecting an option for building an IMS has been developed, and an example of calculating the number of control channels for managing three types of objects is given.
Informatics and Automation. 2024;23(6):1609-1642
pages 1609-1642 views

Solving Paths Search Problems in Complex Graphs

Kudelia V.N.

Abstract

The construction of models of various systems is associated with the enumeration of the values of the parameters of the elements of the structure and taking into account all the characteristics of operation and interaction of components to find a certain set of solutions that determine the configuration of the system. Such tasks belong to enumeration type tasks and imply that some of the next solutions from this set are obtained from the previous solution in a certain order. It is known that any problem of the enumeration type is solved only by methods of exhaustive search, and other methods for their enumeration do not exist yet. The paper presents a new method of searching paths in a graph – the method of node-graph transformation. The proposed method, unlike the existing ones, allows one to search all directed simple paths in an oriented graph of arbitrary structure much faster. In the known graph search methods (Breadth First Search and Depth First Search), the object of the search is a path. The total number of such paths in the graph determines the size of the search space. The main idea of the node-graph transformation method is to significantly reduce the size of the search space by enlarging the search objects. The enlargement of enumeration objects is performed by clustering paths into combinatorial objects that concentrate some set of paths of the same length according to certain rules. These combinatorial objects are called node-graphs. A node-graph refers to center-peripheral combinatorial objects, and specific node-graph transformation operations have been developed to enumerate all paths in the graph, which allow finding new paths based on previous paths. The method can be used as a basic toolkit to reduce the dimensionality of the search space for solutions to NP-complete problems while maintaining the universality and accuracy of the full search.
Informatics and Automation. 2024;23(6):1643-1664
pages 1643-1664 views

Computational Technology for Shell Models of Magnetohydrodynamic Turbulence Constructing

Vodinchar G.M., Feshchenko L.K.

Abstract

The paper discusses the computational technology for constructing one type of small-scale magnetohydrodynamic turbulence models – shell models. Any such model is a system of ordinary quadratic nonlinear differential equations with constant coefficients. Each phase variable is interpreted in absolute value as a measure of the intensity of one of the fields of the turbulent system in a certain range of spatial scales (scale shell). The equations of any shell model must have several quadratic invariants, which are analogues of conservation laws in ideal magnetohydrodynamics. The derivation of the model equations consists in obtaining such expressions for constant coefficients for which the predetermined quadratic expressions will indeed be invariants. Derivation of these expressions «manually» is quite cumbersome and the likelihood of errors in formula transformations is high. This is especially true for non-local models in which large-scale shells that are distant in size can interact. The novelty and originality of the work lie in the fact that the authors proposed a computational technology that allows one to automate the process of deriving equations for shell models. The technology was implemented using computer algebra methods, which made it possible to obtain parametric classes of models in which the invariance of given quadratic forms is carried out absolutely accurately – in formula form. The determination of the parameter values in the resulting parametric class of models is further carried out by agreement with the measures of the interaction of shells in the model with the probabilities of their interaction in a real physical system. The idea of the described technology and its implementation belong to the authors. Some of its elements were published by the authors earlier, but in this work, for the first time, its systematic description is given for models with complex phase variables and agreement of measures of interaction of shells with probabilities. There have been no similar works by other authors previously. The technology allows you to quickly and accurately generate equations for new non-local turbulence shell models and can be useful to researchers involved in modeling turbulent systems.
Informatics and Automation. 2024;23(6):1665-1697
pages 1665-1697 views

Increase of Reliability of Anomalies Detection on Images at Formation of Their Feature Vectors in Wavelet Bases

Dvornikov S.V., Vasilieva D.V.

Abstract

The method of detection of life rafts and lifeboats in the water area of seas and oceans after shipwrecks based on the recognition of anomalies in the processed images, which increases the probability of recognition of monitoring objects, is proposed. The approach to solving such a problem is substantiated. The formulation of the problem of object recognition from the perspective of binary classification in the detection of anomalies is presented. The analytical expression for the decision-making algorithm is obtained. The possibility of formalization of image matrices in the form of histograms of color (brightness) intensity distributions is considered. The contrast of the feature space on their basis is estimated. It is suggested that the contrast of feature spaces be increased due to the secondary processing of histograms of distributions in the basis of multiple-scale wavelet decomposition. The possibility of realization of wavelet transformations on the basis of Haar functions and Gauss wavelets of the 1st and 2nd orders is considered. The mechanism of formation of secondary feature vectors from three-dimensional wavelet transforms by averaging their coefficients along the time shift axis is substantiated. It is shown that at the same dimensionality of histograms of brightness distribution with newly formed feature vectors, the latter provide higher contrast of feature spaces. It is recommended to use a Gaussian wavelet of the 2nd order for the formalization of images in jpeg format, which provides, other things being equal, a greater magnitude of differences for images containing anomalies. An approach to probabilistic evaluation of the algorithm for automatic image recognition is developed. The analytical expression is obtained and its constituent elements are justified. Graphical dependences of the probability of correct detection (recognition) of anomalies, depending on the size in relation to the total area of the frame and the dispersion of the underlying background are given. The results of the experiment on image recognition with a lifeboat in the ocean water area are presented. The directions of further research are defined.
Informatics and Automation. 2024;23(6):1698-1729
pages 1698-1729 views

Artificial intelligence, knowledge and data engineering

Approaches for Behavior Intensity Estimation in Groups of Heterogeneous Individuals: Precision and Applicability for Data with Uncertainty

Stoliarova V.F., Tulupyeva T.V., Vyatkin A.A.

Abstract

In socially oriented areas, there arises the problem of assessing the cumulative characteristics of behavior, such as intensity, that are realized in groups of individuals. All individuals vary in their behavior and the available data is limited and may be associated with significant uncertainty: only a few episodes may be known and only a few individualsi the group may be observed. Mathematical models of behavior are used for estimation of key characteristics of the behavior. One of them is based on the gamma–Poisson point process, that reflects the heterogeneity of individuals in a form of a mixing distribution. This general model allows to formulate several methods of frequency estimation: the Cox regression, estimation of the copula parameter, and a posteriori inference in Bayesian belief networks. The aim of the paper is to assess their determine the precision of these methods based on the Kantorovich–Rubinstein distance between estimates and the true distribution of the desired parameter. The analysis of assumptions of those methods allows to formulate rules, that allow to chose the appropriate method in various sutuations of data availability. It has been shown that the copula-based approach provides the most accurate estimates and has the mild assumptions for the number of observed objects, but it cannot take into account external factors that may influence the behavior. Among methods that can take into account process covariants, estimates based on a posteriori inference in hybrid Bayesian belief networks have the highest precision. The paper considers a method for quantification of a hybrid BBNs with the approximation of mixtures of truncated exponents, that is data-demanding at the stage of calculating a priori estimates. However, it is noted that there are other approaches to setting hybrid BSDs in which a priori estimates can be set completely expertly.
Informatics and Automation. 2024;23(6):1730-1753
pages 1730-1753 views

Enhanced Machine Learning Framework for Autonomous Depression Detection Using Modwave Cepstral Fusion and Stochastic Embedding

Jacob J., Kannan K.

Abstract

Depression is a prevalent mental illness that requires autonomous detection systems due to its complexity. Existing machine learning techniques face challenges such as background noise sensitivity, slow adaptation speed, and imbalanced data. To address these limitations, this study proposes a novel ModWave Cepstral Fusion and Stochastic Embedding Framework for depression prediction. Then, the Gain Modulated Wavelet Technique removes background noise and normalises audio signals. Difficulties with generalisation, which results in a lack of interpretability, hinder extracting relevant characteristics from speech. To address these issues, an Auto Cepstral Fusion extracts relevant features from speech, capturing temporal and spectral characteristics caused by background voice. Feature selection becomes imperative when choosing relevant features for classification. Selecting irrelevant features can result in overfitting, the curse of dimensionality, and less robustness to noise. Hence, the Principal Stochastic Embedding technique handles high-dimensional data, minimising noise influence and dimensionality. Furthermore, the XGBoost classifier differentiates between depressed and non-depressed individuals. As a result, the proposed method uses the DAIC-WOZ dataset from USC for detecting depressions, achieving an accuracy of 97.02%, precision of 97.02%, recall of 97.02%, F1-score of 97.02%, RMSE of 2.00, and MAE of 0.9, making it a promising tool for autonomous depression detection.

Informatics and Automation. 2024;23(6):1754-1783
pages 1754-1783 views

Phoneme-by-Phoneme Speech Recognition as a Classification of Series on a Set of Sequences of Elements of Complex Objects Using an Improved Trie-Tree

Dorokhina G.V.

Abstract

Sequences, including vector sequences, are applicable in any subject domains. Sequences of scalar values or vectors (series) can be produced by higher-order sequences, for example: a series of states, or elements of complex objects. This academic paper is devoted to the application of an improved trie-tree in the classification of series on a set of sequences of elements of complex objects using the dynamic programming method. The implementation areas of dynamic programming have been considered. It has been shown that dynamic programming is adapted to multi-step operations of calculating additive (multiplicative) similarity/difference measures. It is argued that the improved trie-tree is applicable in the problem of classifying a series on a set of sequences of elements of complex objects using such similarity/difference measures. An analysis of hierarchical representations of sets of sequences has been performed. The advantages of the improved trie-tree over traditional representations of other highly branching trees have been described. A formal description of the improved trie-tree has been developed. An explanation has been given to the previously obtained data on a significant speed gain for operations of adding and deleting sequences in the improved trie-tree relative to the use of an array with an index table (24 and 380 times, respectively). The problem of phoneme-by-phoneme recognition of speech commands has been formulated as a problem of classifying series on a set of sequences of elements of complex objects and a method for its solving has been presented. A method for classifying a series on a set of sequences of elements of complex objects using the improved trie-tree is developed. The method has been studied using the example of phoneme-by-phoneme recognition with a hierarchical representation of the dictionary of speech command classes. In this method, recognition of speech commands is executed traversing the improved trie-tree that stores a set of transcriptions of speech commands – sequences of transcription symbols that denote classes of sounds. Numerical studies have shown that classifying a series as sequences of elements of complex objects increases the frequency of correct classification compared to classifying a series on a set of series, and using the improved trie-tree reduces the time spent on classification.
Informatics and Automation. 2024;23(6):1784-1822
pages 1784-1822 views

Ruzicka Indexive Throttled Deep Neural Learning for Resource-Efficient Load Balancing in a Cloud Environment

Ellakkiya M., Ravi T., Panneer Arokiaraj S.

Abstract

Cloud Computing (CC) is a prominent technology that permits users as well as organizations to access services based on their requirements. This computing method presents storage, deployment platforms, as well as suitable access to web services over the internet. Load balancing is a crucial factor for optimizing computing and storage. It aims to dispense workload across every virtual machine in a reasonable manner. Several load balancing techniques have been conventionally developed and are available in the literature. However, achieving efficient load balancing with minimal makespan and improved throughput remains a challenging issue. To enhance load balancing efficiency, a novel technique called Ruzicka Indexive Throttle Load Balanced Deep Neural Learning (RITLBDNL) is designed. The primary objective of RITLBDNL is to enhance throughput and minimize the makespan in the cloud. In the RITLBDNL technique, a deep neural learning model contains one input layer, two hidden layers, as well as one output layer to enhance load balancing performance. In the input layer, the number of cloud user tasks is collected and sent to hidden layer 1. In that layer, the load balancer in the cloud server analyzes the virtual machine resource status depending on energy, bandwidth, memory, and CPU using the Ruzicka Similarity Index. Then, it is classified VMs as overloaded, less loaded, or balanced. The analysis results are then transmitted to hidden layer 2, where Throttled Load Balancing is performed to dispense the workload of weighty loaded virtual machines to minimum loaded ones. The cloud server efficiently balances the workload between the virtual machines in higher throughput and lower response time and makespan for handling a huge number of incoming tasks. To evaluate experiments, the proposed technique is compared with other existing load balancing methods. The result shows that the proposed RITLBDNL provides better performance of higher load balancing efficiency of 7%, throughput of 46% lesser makespan of 41%, and response time of 28% than compared to conventional methods.

Informatics and Automation. 2024;23(6):1823-1844
pages 1823-1844 views

Information security

Synergistic Approaches to Enhance IoT Intrusion Detection: Balancing Features through Combined Learning

Narayanarao C., Mandapati V., Boddu B.

Abstract

The Internet of Things (IoT) plays a crucial role in ensuring security by preventing unauthorized access, malware infections, and malicious activities. IoT monitors network traffic as well as device behaviour to identify potential threats and take appropriate mitigation measures. However, there is a need for an IoT Intrusion Detection system with enhanced generalization capabilities, leveraging deep learning and advanced anomaly detection techniques. This study presents an innovative approach to IoT IDS that combines SMOTE-Tomek link and BTLBO, CNN with XGB classifier which aims to address data imbalances, improve model performance, reduce misclassifications, and improve overall dataset quality. The proposed IoT IDS system, using the IoT-23 dataset, achieves 99.90% accuracy and a low error rate, all while requiring significantly less execution time. This work represents a significant step forward in IoT security, offering a robust and efficient IDS solution tailored to the changing challenges of the interconnected world.

Informatics and Automation. 2024;23(6):1845-1868
pages 1845-1868 views

Convolutional-free Malware Image Classification using Self-attention Mechanisms

Dong H.

Abstract

Malware analysis is a critical aspect of cybersecurity, aiming to identify and differentiate malicious software from benign programmes to protect computer systems from security threats. Despite advancements in cybersecurity measures, malware continues to pose significant risks in cyberspace, necessitating accurate and rapid analysis methods. This paper introduces an innovative approach to malware classification using image analysis, involving three key phases: converting operation codes into RGB image data, employing a Generative Adversarial Network (GAN) for synthetic oversampling, and utilising a simplified Vision Transformer (ViT)-based classifier for image analysis. The method enhances feature richness and explainability through visual imagery data and addresses imbalanced classification using GAN-based oversampling techniques. The proposed framework combines the strengths of convolutional autoencoders, hybrid classifiers, and adapted ViT models to achieve a balance between accuracy and computational efficiency. As shown in the experiments, our convolutional-free approach possesses excellent accuracy and precision compared with convolutional models and outperforms CNN models on two datasets, thanks to the multi-head attention mechanism. On the Big2015 dataset, our model outperforms other CNN models with an accuracy of 0.8369 and an AUC of 0.9791. Specifically, our model reaches an accuracy of 0.9697 and an F1 score of 0.9702 on MALIMG, which is extraordinary.

Informatics and Automation. 2024;23(6):1869-1898
pages 1869-1898 views

Enhancing Video Anomaly Detection with Improved UNET and Cascade Sliding Window Technique

R. Krishnan S., Amudha P.

Abstract

Computer vision video anomaly detection still needs to be improved, especially when identifying images with unusual motions or objects. Current approaches mainly concentrate on reconstruction and prediction methods, and unsupervised video anomaly detection faces difficulties because there are not enough tagged abnormalities, which reduces accuracy. This paper presents a novel framework called the Improved UNET (I-UNET), designed to counteract overfitting by addressing the need for complex models that can extract subtle information from video anomalies. Video frame noise can be eliminated by preprocessing the frames with a Weiner filter. Moreover, the system uses Convolution Long Short-Term Memory (ConvLSTM) layers to smoothly integrate temporal and spatial data into its encoder and decoder portions, improving the accuracy of anomaly identification. The Cascade Sliding Window Technique (CSWT) is used post-processing to identify anomalous frames and generate anomaly scores. Compared to baseline approaches, experimental results on the UCF, UCSDped1, and UCSDped2 datasets demonstrate notable performance gains, with 99% accuracy, 90.8% Area Under Curve (AUC), and 10.9% Equal Error Rate (EER). This study provides a robust and accurate framework for video anomaly detection with the highest accuracy rate.

Informatics and Automation. 2024;23(6):1899-1930
pages 1899-1930 views

Согласие на обработку персональных данных с помощью сервиса «Яндекс.Метрика»

1. Я (далее – «Пользователь» или «Субъект персональных данных»), осуществляя использование сайта https://journals.rcsi.science/ (далее – «Сайт»), подтверждая свою полную дееспособность даю согласие на обработку персональных данных с использованием средств автоматизации Оператору - федеральному государственному бюджетному учреждению «Российский центр научной информации» (РЦНИ), далее – «Оператор», расположенному по адресу: 119991, г. Москва, Ленинский просп., д.32А, со следующими условиями.

2. Категории обрабатываемых данных: файлы «cookies» (куки-файлы). Файлы «cookie» – это небольшой текстовый файл, который веб-сервер может хранить в браузере Пользователя. Данные файлы веб-сервер загружает на устройство Пользователя при посещении им Сайта. При каждом следующем посещении Пользователем Сайта «cookie» файлы отправляются на Сайт Оператора. Данные файлы позволяют Сайту распознавать устройство Пользователя. Содержимое такого файла может как относиться, так и не относиться к персональным данным, в зависимости от того, содержит ли такой файл персональные данные или содержит обезличенные технические данные.

3. Цель обработки персональных данных: анализ пользовательской активности с помощью сервиса «Яндекс.Метрика».

4. Категории субъектов персональных данных: все Пользователи Сайта, которые дали согласие на обработку файлов «cookie».

5. Способы обработки: сбор, запись, систематизация, накопление, хранение, уточнение (обновление, изменение), извлечение, использование, передача (доступ, предоставление), блокирование, удаление, уничтожение персональных данных.

6. Срок обработки и хранения: до получения от Субъекта персональных данных требования о прекращении обработки/отзыва согласия.

7. Способ отзыва: заявление об отзыве в письменном виде путём его направления на адрес электронной почты Оператора: info@rcsi.science или путем письменного обращения по юридическому адресу: 119991, г. Москва, Ленинский просп., д.32А

8. Субъект персональных данных вправе запретить своему оборудованию прием этих данных или ограничить прием этих данных. При отказе от получения таких данных или при ограничении приема данных некоторые функции Сайта могут работать некорректно. Субъект персональных данных обязуется сам настроить свое оборудование таким способом, чтобы оно обеспечивало адекватный его желаниям режим работы и уровень защиты данных файлов «cookie», Оператор не предоставляет технологических и правовых консультаций на темы подобного характера.

9. Порядок уничтожения персональных данных при достижении цели их обработки или при наступлении иных законных оснований определяется Оператором в соответствии с законодательством Российской Федерации.

10. Я согласен/согласна квалифицировать в качестве своей простой электронной подписи под настоящим Согласием и под Политикой обработки персональных данных выполнение мною следующего действия на сайте: https://journals.rcsi.science/ нажатие мною на интерфейсе с текстом: «Сайт использует сервис «Яндекс.Метрика» (который использует файлы «cookie») на элемент с текстом «Принять и продолжить».