Informacionnye Tehnologii最新文献

Method of Remote Photoplethysmography Robust to Interference in Video Registration of Human Facial Skin 在人类面部皮肤视频注册中抗干扰性强的远程照相血压测量方法

Informacionnye Tehnologii Pub Date : 2024-07-12 DOI: 10.17587/it.30.357-366

M. V. Kopeliovich, I. V. Shcherban

{"title":"Method of Remote Photoplethysmography Robust to Interference in Video Registration of Human Facial Skin","authors":"M. V. Kopeliovich, I. V. Shcherban","doi":"10.17587/it.30.357-366","DOIUrl":"https://doi.org/10.17587/it.30.357-366","url":null,"abstract":"Monitoring of heart rate (HR) and its dynamics is necessary in ambulatory and telemedicine for diagnosis and treatment of diseases. Remote photoplethysmography (rPPG) allows for HR and its dynamics monitoring by video analysis of facial skin blood flow, and is ofparticular importance for patients with delicate skin such as infants, the elderly, or those with severe burn injuries. Unlike other contactless HR measurement methods, rPPG does not require special hardware, but allows to monitor HR on the basis of analyzing a sequence of video images of a person's face. rPPG involves a multi-step process including signal extraction, dimensionality reduction to estimate the photoplethysmographic (PPG) signal, and subsequent HR estimation. However, the presence of high-amplitude spikes due to subject movement, facial expressions, lighting fluctuations, video compression artifacts, ROI tracking errors, among others, can interfere the useful PPG signal, leading to inaccurate HR estimations. A method has been developed that allows to increase the accuracy of HR estimation in the rPPG problem due to its robustness to interferences inevitable during video recording. The proposed approach tackles the rPPG challenge by applying a pre-processing approximation of the signal finite difference using a single-layer neural network with radial basis function (RBF) inner layer. Transitioning to the signal finite difference helps reduce the amplitudes of irrelevant low-frequency peaks within the HR search range, thus avoiding their masking effect on the HR-related spectral peaks. The neural network's RBF approximation further diminishes irrelevant high-frequency spectral peaks when the number of RBF nodes is less than half the signal sample count. The correctness of the solutions is confirmed by numerical experiments carried out on the Mahnob-HCI public database.","PeriodicalId":504905,"journal":{"name":"Informacionnye Tehnologii","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2024-07-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141654218","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Investigation Neural Network Models for Wind Speed Prediction Based on Meteorological Observations in Northern Dagestan 基于达吉斯坦北部气象观测数据的风速预测神经网络模型研究

Informacionnye Tehnologii Pub Date : 2024-07-12 DOI: 10.17587/it.30.350-356

D. N. Kobzarenko, A. M. Kamilova

{"title":"Investigation Neural Network Models for Wind Speed Prediction Based on Meteorological Observations in Northern Dagestan","authors":"D. N. Kobzarenko, A. M. Kamilova","doi":"10.17587/it.30.350-356","DOIUrl":"https://doi.org/10.17587/it.30.350-356","url":null,"abstract":"The paper presents the experiments' results on the study variants of neural network architectures for predicting wind speed based on meteorological time series for Northern Dagestan. When working with data and models, modern software tools of the Python programming language for Data Science are used, such as Keras — a library for modeling neural networks, Pandas — a library for processing tabular data, AutoKeras — a library for automatically generating a neural network by dataset, TabGan — a library for expansion a dataset with artificial data. As initial data, regular observations at the Kochubey (Northern Dagestan) meteorological station for the period 20112022 were taken with a frequency of generalization of measurements 8 times a day. The original semi-structured data is pre-processed and reduced to a structured CSV dataset format. The task of predicting wind speed is reduced to the task of classification, in which it is not the wind speed itself that is predicted, but the class number in accordance with the gradation. From the point of view of considering wind speed as a renewable energy resource, three classes with gradations are accepted: class 0: 0—3 m/s (quiet), class 1: 4—7 m/s (average wind sufficient for optimal wind turbine operating), class 2: 8 m/s and higher (strong wind). When performing experiments, the influence value on the prediction accuracy from several aspects were analyzed, such as: the time data block length, the neural network architecture, the transformation tabular features to normal form or to categorical form, expansion dataset by artificial data, the layout of the verification and test samples, the imbalance of classes, various meteorological parameters as features.","PeriodicalId":504905,"journal":{"name":"Informacionnye Tehnologii","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2024-07-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141653042","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Modified Evolutionary Algorithm Mole-Rat with an Adaptive Mechanism for Dynamic Obstacle Avoidance in Emergency Situations 采用自适应机制的改进型进化算法 Mole-Rat 用于紧急情况下的动态避障

Informacionnye Tehnologii Pub Date : 2024-07-12 DOI: 10.17587/it.30.342-349

V. V. Kureichik, V. Danilchenko

引用次数: 0

Analytic Hierarchy Process in Diagnostics of Diseases 疾病诊断中的层次分析法

Informacionnye Tehnologii Pub Date : 2024-07-12 DOI: 10.17587/it.30.367-371

S. A. Tarasova, V. V. Tarasov

{"title":"Analytic Hierarchy Process in Diagnostics of Diseases","authors":"S. A. Tarasova, V. V. Tarasov","doi":"10.17587/it.30.367-371","DOIUrl":"https://doi.org/10.17587/it.30.367-371","url":null,"abstract":"The study proposes an approach to diagnostics of diseases based on the analytic hierarchy process, which is as follows: by the method of pairwise comparisons, the weight structures of the symptoms of the alleged disease and the patient's disease are investigated, then the measure of the differences between these structures is evaluated, based on this assessment, we can talk about the reliability of the patient's diagnosis. Unlike the classical analytic hierarchy process, there are no alternatives in the developed modification, and diagnostics is carried out only by comparing the weight structures of the symptoms of the alleged disease and the patient's disease, that is, the approach does not imply the establishment of one of the alternative diagnoses, but only confirms (or refutes) the presence of the patient's disease. The method is tested on the basis of a clinical case of a mental disorder, the index of structural differences showed the identity of the weight structures of the symptoms of the alleged disease and the patient's disease, which confirmed the reliability of the patient's diagnosis. The method can be used to assess the reliability of the diagnosis, and, if repeated, the clinical dynamics of the disease in the course of therapy.","PeriodicalId":504905,"journal":{"name":"Informacionnye Tehnologii","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2024-07-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141652166","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

On Quantum Generation of Random Sequences as the Basis for Constructing Bicyclic Orthogonal Matrices 论随机序列的量子生成作为构建双环正交矩阵的基础

Informacionnye Tehnologii Pub Date : 2024-07-12 DOI: 10.17587/it.30.331-335

A. M. Sergeev

{"title":"On Quantum Generation of Random Sequences as the Basis for Constructing Bicyclic Orthogonal Matrices","authors":"A. M. Sergeev","doi":"10.17587/it.30.331-335","DOIUrl":"https://doi.org/10.17587/it.30.331-335","url":null,"abstract":"The paper identifies three main approaches to obtaining Hadamard matrices: search using combinatorial methods, calculation with control based on the theory of dynamical systems and the construction of matrices of fixed structures. For the search and construction of Hadamard matrices, the main tool of the source material is the generation of random sequences. The issues of fixing the structures of Hadamard matrices in the form of a bicyclic construction are considered. To obtain such high-order matrices, important procedures are the generation, filtering and selection of such pairs of sequences that an orthogonal matrix of order n could be constructed from the cyclic matrices of order n/2 obtained on their basis. There is a significant influence of the quality of generated random sequences on the construction time of bicyclic matrices. The results of the first experiments with 1 million random sequences of length 100 generated on a quantum generator based on the interference effect of laser pulses with a random phase are presented. In particular, previously unknown Hadamard matrices of orders up to 100 bicyclic structures and maximum determinant matrices on non-Hadamard orders were obtained in a computer experiment.","PeriodicalId":504905,"journal":{"name":"Informacionnye Tehnologii","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2024-07-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141654359","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Models of Interest, Difficulty, and Perceived Usefulness of the Gaming Chatbot with Wordle Like Puzzles for Learning Programming 游戏聊天机器人的兴趣、难度和感知有用性模型与学习编程的 Wordle 类谜题

Informacionnye Tehnologii Pub Date : 2024-07-12 DOI: 10.17587/it.30.372-381

A. N. Varnavsky

引用次数: 0

Synthesis of an Algorithm for Searching a Given Segment in a Data Sequence of Finite Length 在长度有限的数据序列中搜索给定段落的算法综述

Informacionnye Tehnologii Pub Date : 2024-07-12 DOI: 10.17587/it.30.335-341

V. I. Lutin, F. A. Desyatirikov, A. S. Belyaev, E. V. Lutina, E. N. Desyatirikova

{"title":"Synthesis of an Algorithm for Searching a Given Segment in a Data Sequence of Finite Length","authors":"V. I. Lutin, F. A. Desyatirikov, A. S. Belyaev, E. V. Lutina, E. N. Desyatirikova","doi":"10.17587/it.30.335-341","DOIUrl":"https://doi.org/10.17587/it.30.335-341","url":null,"abstract":"Under conditions of an unknown shift of the reference points of a continuous signal and its given fragment, an approach to the synthesis of a fragment search algorithm is proposed. The approach is based on the classical apparatus for testing hypotheses of mathematical statistics. A distinctive feature of the approach is taking into account the noise of the signal and fragment reading, and on this basis, the formalization of the problem of choosing the number of channels for monitoring the signal. Thus, in this work, using a probabilistic-statistical method, we synthesized an algorithm for a two-stage procedure for searching for a given segment in a long data sequence, which consists in determining the most probable position of the desired segment and checking whether the found segment matches the given one. Analytical relations are obtained to assess the quality of detection, which take into account the autocorrelation properties of sequences, and detection characteristics are calculated, which determine the sample size of a given segment and a sufficient number of detector channels to ensure the required quality of detection under given observation conditions. A block diagram of a device for making decisions about the most probable hypothesis and determining the average value and standard deviation of the start time of the desired segment is proposed, which allows taking into account the least favorable conditions for the beginning of the signal countdown, namely, exactly in the middle of the specified fragment.","PeriodicalId":504905,"journal":{"name":"Informacionnye Tehnologii","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2024-07-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141655239","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Comparative Review of Tasks, Approaches and Tools for Automated Knowledge Extraction from the Texts of Scientific Publications 从科学出版物文本中自动提取知识的任务、方法和工具比较评述

Informacionnye Tehnologii Pub Date : 2024-06-10 DOI: 10.17587/it.30.291-299

S. N. Ushakov, A. O. Saveliev

引用次数: 0

Ranking Search Results Based on User Preferences in the Absence of Personalized Statistics 在缺乏个性化统计数据的情况下根据用户偏好排列搜索结果

Informacionnye Tehnologii Pub Date : 2024-06-10 DOI: 10.17587/it.30.307-317

A. S. Svitek, L. A. Mylnikov

{"title":"Ranking Search Results Based on User Preferences in the Absence of Personalized Statistics","authors":"A. S. Svitek, L. A. Mylnikov","doi":"10.17587/it.30.307-317","DOIUrl":"https://doi.org/10.17587/it.30.307-317","url":null,"abstract":"The article considers the algorithm of search results ranking according to the compliance with user's expectations due to the feedback on the data of search results pre-release, which allowed to reduce the time of search for the necessary information. A numerical experiment aimed at evaluating the effectiveness of the proposed approach on the example of real estate objects is presented. Aggregated data of real estate listings were used as data, and the results of user surveys were used to evaluate the relevance. TOPSIS and PROMETHEE methods were used as pre-ranking algorithms. The ranking results were combined considering their order in the output of both methods. To implement the next step of the algorithm, the pre-release list was partitioned into classes for which users selected a few objects they liked. Machine learning models were trained on the partitioned data. Based on their average accuracy and variance estimates, a naive Bayesian classifier model was selected and used for subsequent computations. The results of further experiments showed the possibility of taking into account personal preferences when organizing search and selection of objects of interest in the absence of personalized statistics on the example of real estate objects. As a result of the experiments, the time of searching a group of results of interest was reduced by 74 % on average.","PeriodicalId":504905,"journal":{"name":"Informacionnye Tehnologii","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2024-06-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141362390","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

The New Method for Increasing the Efficiency of Vectorization of BLAS Operations 提高 BLAS 操作矢量化效率的新方法

Informacionnye Tehnologii Pub Date : 2024-06-10 DOI: 10.17587/it.30.318-328

V. A. Egunov, A. G. Kravets

引用次数: 0