首页 > 最新文献

Doklady Mathematics最新文献

英文 中文
Prediction of Industrial Cyber Attacks Using Normalizing Flows 利用规范化流预测工业网络攻击
IF 0.5 4区 数学 Q3 MATHEMATICS Pub Date : 2025-03-22 DOI: 10.1134/S1064562424602269
V. P. Stepashkina, M. I. Hushchyn

This paper presents the development and evaluation of methods for detecting cyberattacks on industrial systems using neural network approaches. The focus is on the task of detecting anomalies in multivariate time series, where the diversity and complexity of potential attack scenarios require the use of advanced models. To address these challenges, a transformer-based autoencoder architecture was used, which was further enhanced by transitioning to a variational autoencoder (VAE) and integrating normalizing flows. These modifications allowed the model to better capture the data distribution, enabling effective anomaly detection, including those not present in the training set. As a result, high performance was achieved, with an F1 score of 0.93 and a ROC-AUC of 0.87. The results underscore the effectiveness of the proposed methodology and provide valuable contributions to the field of anomaly detection and cybersecurity in industrial systems.

本文介绍了利用神经网络方法检测工业系统网络攻击的方法的开发和评估。重点是检测多变量时间序列中的异常情况,潜在攻击场景的多样性和复杂性要求使用先进的模型。为了应对这些挑战,我们使用了基于变压器的自动编码器架构,并通过过渡到变异自动编码器(VAE)和整合归一化流量进一步增强了该架构。这些修改使模型能够更好地捕捉数据分布,从而实现有效的异常检测,包括训练集中不存在的异常。因此,该模型取得了很高的性能,F1 得分为 0.93,ROC-AUC 为 0.87。结果凸显了所提方法的有效性,为工业系统的异常检测和网络安全领域做出了宝贵贡献。
{"title":"Prediction of Industrial Cyber Attacks Using Normalizing Flows","authors":"V. P. Stepashkina,&nbsp;M. I. Hushchyn","doi":"10.1134/S1064562424602269","DOIUrl":"10.1134/S1064562424602269","url":null,"abstract":"<p>This paper presents the development and evaluation of methods for detecting cyberattacks on industrial systems using neural network approaches. The focus is on the task of detecting anomalies in multivariate time series, where the diversity and complexity of potential attack scenarios require the use of advanced models. To address these challenges, a transformer-based autoencoder architecture was used, which was further enhanced by transitioning to a variational autoencoder (VAE) and integrating normalizing flows. These modifications allowed the model to better capture the data distribution, enabling effective anomaly detection, including those not present in the training set. As a result, high performance was achieved, with an F1 score of 0.93 and a ROC-AUC of 0.87. The results underscore the effectiveness of the proposed methodology and provide valuable contributions to the field of anomaly detection and cybersecurity in industrial systems.</p>","PeriodicalId":531,"journal":{"name":"Doklady Mathematics","volume":"110 1 supplement","pages":"S95 - S102"},"PeriodicalIF":0.5,"publicationDate":"2025-03-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143676386","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Deep Learning-Driven Approach for Handwritten Chinese Character Classification 基于深度学习的手写体汉字分类方法
IF 0.5 4区 数学 Q3 MATHEMATICS Pub Date : 2025-03-22 DOI: 10.1134/S1064562424602245
B. Kriuk, F. Kriuk

Handwritten character recognition (HCR) is a challenging problem for machine learning researchers. Unlike printed text data, handwritten character datasets have more variation due to human-introduced bias. With numerous unique character classes present, some data, such as Logographic Scripts or Sino-Korean character sequences, bring new complications to the HCR problem. The classification task on such datasets requires the model to learn high-complexity details of the images that share similar features. With recent advances in computational resource availability and further computer vision theory development, some research teams have effectively addressed the arising challenges. Although known for achieving high accuracy while keeping the number of parameters small, many common approaches are still not generalizable and use dataset-specific solutions to achieve better results. Due to complex structure, existing methods frequently prevent the solutions from gaining popularity. This paper proposes a highly scalable approach for detailed character image classification by introducing the model architecture, data preprocessing steps, and testing design instructions. We also perform experiments to compare the performance of our method with that of existing ones to show the improvements achieved.

手写字符识别(HCR)是机器学习研究人员面临的一个具有挑战性的问题。与印刷文本数据不同,由于人为引入的偏差,手写字符数据集有更多的变化。由于存在许多独特的字符类,一些数据,如Logographic Scripts或Sino-Korean字符序列,给HCR问题带来了新的复杂性。在这些数据集上的分类任务需要模型学习具有相似特征的图像的高复杂性细节。随着计算资源的可用性和计算机视觉理论的进一步发展,一些研究团队已经有效地解决了出现的挑战。虽然以在保持参数数量较少的情况下实现高精度而闻名,但许多常见方法仍然无法推广,并且使用特定于数据集的解决方案来获得更好的结果。现有方法由于结构复杂,往往阻碍了解决方案的普及。本文通过介绍模型架构、数据预处理步骤和测试设计说明,提出了一种高度可扩展的精细字符图像分类方法。我们还进行了实验,将我们的方法与现有方法的性能进行比较,以显示所取得的改进。
{"title":"Deep Learning-Driven Approach for Handwritten Chinese Character Classification","authors":"B. Kriuk,&nbsp;F. Kriuk","doi":"10.1134/S1064562424602245","DOIUrl":"10.1134/S1064562424602245","url":null,"abstract":"<p>Handwritten character recognition (HCR) is a challenging problem for machine learning researchers. Unlike printed text data, handwritten character datasets have more variation due to human-introduced bias. With numerous unique character classes present, some data, such as Logographic Scripts or Sino-Korean character sequences, bring new complications to the HCR problem. The classification task on such datasets requires the model to learn high-complexity details of the images that share similar features. With recent advances in computational resource availability and further computer vision theory development, some research teams have effectively addressed the arising challenges. Although known for achieving high accuracy while keeping the number of parameters small, many common approaches are still not generalizable and use dataset-specific solutions to achieve better results. Due to complex structure, existing methods frequently prevent the solutions from gaining popularity. This paper proposes a highly scalable approach for detailed character image classification by introducing the model architecture, data preprocessing steps, and testing design instructions. We also perform experiments to compare the performance of our method with that of existing ones to show the improvements achieved.</p>","PeriodicalId":531,"journal":{"name":"Doklady Mathematics","volume":"110 1 supplement","pages":"S278 - S287"},"PeriodicalIF":0.5,"publicationDate":"2025-03-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143676206","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
MDS-ViTNet: Improving Saliency Prediction for Eye-Tracking with Vision Transformer MDS-ViTNet:基于视觉变换器的眼动追踪显著性预测改进
IF 0.5 4区 数学 Q3 MATHEMATICS Pub Date : 2025-03-22 DOI: 10.1134/S1064562424602117
I. Polezhaev, I. Goncharenko, N. Iurina

In this paper, we present a novel methodology we call MDS-ViTNet (Multi Decoder Saliency by Vision Transformer Network) for enhancing visual saliency prediction or eye-tracking. This approach holds significant potential for diverse fields, including marketing, medicine, robotics, and retail. We propose a network architecture that leverages the Vision Transformer, moving beyond the conventional ImageNet backbone. The framework adopts an encoder-decoder structure, with the encoder utilizing a Swin transformer to efficiently embed most important features. This process involves a Transfer Learning method, wherein layers from the Vision Transformer are converted by the Encoder Transformer and seamlessly integrated into a CNN Decoder. This methodology ensures minimal information loss from the original input image. The decoder employs a multi-decoding technique, utilizing dual decoders to generate two distinct attention maps. These maps are subsequently combined into a singular output via an additional CNN model. Our trained model MDS-ViTNet achieves state-of-the-art results across several benchmarks. Committed to fostering further collaboration, we intend to make our code, models, and datasets accessible to the public.

在本文中,我们提出了一种新的方法,我们称之为MDS-ViTNet (Multi Decoder Saliency by Vision Transformer Network),用于增强视觉显著性预测或眼动追踪。这种方法在不同的领域具有巨大的潜力,包括营销、医药、机器人和零售。我们提出了一种利用视觉转换器的网络架构,超越了传统的ImageNet主干。该框架采用编码器-解码器结构,编码器利用Swin变压器有效嵌入最重要的特性。这个过程涉及一种迁移学习方法,其中来自视觉转换器的层由编码器转换器转换并无缝集成到CNN解码器中。这种方法确保了原始输入图像的最小信息损失。解码器采用多重解码技术,利用双解码器生成两个不同的注意图。这些地图随后通过一个额外的CNN模型组合成一个单一的输出。我们训练有素的MDS-ViTNet模型在几个基准测试中取得了最先进的结果。为了促进进一步的合作,我们打算让我们的代码、模型和数据集对公众开放。
{"title":"MDS-ViTNet: Improving Saliency Prediction for Eye-Tracking with Vision Transformer","authors":"I. Polezhaev,&nbsp;I. Goncharenko,&nbsp;N. Iurina","doi":"10.1134/S1064562424602117","DOIUrl":"10.1134/S1064562424602117","url":null,"abstract":"<p>In this paper, we present a novel methodology we call MDS-ViTNet (Multi Decoder Saliency by Vision Transformer Network) for enhancing visual saliency prediction or eye-tracking. This approach holds significant potential for diverse fields, including marketing, medicine, robotics, and retail. We propose a network architecture that leverages the Vision Transformer, moving beyond the conventional ImageNet backbone. The framework adopts an encoder-decoder structure, with the encoder utilizing a Swin transformer to efficiently embed most important features. This process involves a Transfer Learning method, wherein layers from the Vision Transformer are converted by the Encoder Transformer and seamlessly integrated into a CNN Decoder. This methodology ensures minimal information loss from the original input image. The decoder employs a multi-decoding technique, utilizing dual decoders to generate two distinct attention maps. These maps are subsequently combined into a singular output via an additional CNN model. Our trained model MDS-ViTNet achieves state-of-the-art results across several benchmarks. Committed to fostering further collaboration, we intend to make our code, models, and datasets accessible to the public.</p>","PeriodicalId":531,"journal":{"name":"Doklady Mathematics","volume":"110 1 supplement","pages":"S230 - S235"},"PeriodicalIF":0.5,"publicationDate":"2025-03-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://link.springer.com/content/pdf/10.1134/S1064562424602117.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143676210","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Neural Network-Based Coronary Dominance Classification of RCA Angiograms 基于神经网络的RCA血管造影冠状动脉优势分类
IF 0.5 4区 数学 Q3 MATHEMATICS Pub Date : 2025-03-22 DOI: 10.1134/S1064562424602026
I. Kruzhilov, E. Ikryannikov, A. Shadrin, R. Utegenov, G. Zubkova, I. Bessonov

Coronary arterial dominance classification is essential for SYNTAX score estimation, which is a tool used to determine the complexity of coronary artery disease and guide patient selection toward optimal revascularization strategy. We developed coronary dominance classification algorithm based on the analysis of right coronary artery (RCA) angiograms using neural network.

We employed convolutional neural network ConvNext and Swin transformer for 2D image (frames) classification, along with a majority vote for cardio angiographic view classification. An auxiliary network was also used to detect irrelevant images which were then excluded from the data set.

5-fold cross validation gave the following dominance classification metrics (p = 95%): macro recall = 93.1% ± 4.3%, accuracy = 93.5% ± 3.8%, macro F1 = 89.2% ± 5.6%. The most common case in which the model regularly failed was RCA occlusion, as it requires utilization of left coronary artery (LCA) information.

The use of machine learning approaches to classify coronary dominance based on RCA alone has been shown to be successful with satisfactory accuracy. However, for higher accuracy, it is necessary to utilize LCA information in the case of an occluded RCA and detect cases where there is high uncertainty.

冠状动脉优势分类对于SYNTAX评分至关重要,它是确定冠状动脉疾病复杂性和指导患者选择最佳血运重建策略的工具。在对右冠状动脉(RCA)血管造影进行分析的基础上,提出了一种基于神经网络的冠状动脉优势度分类算法。我们使用卷积神经网络ConvNext和Swin变压器进行二维图像(帧)分类,并使用多数投票进行心血管造影视图分类。一个辅助网络也被用来检测不相关的图像,然后从数据集中排除。5倍交叉验证的优势分类指标为:宏观召回率= 93.1%±4.3%,准确率= 93.5%±3.8%,宏观F1 = 89.2%±5.6%。模型经常失败的最常见情况是RCA闭塞,因为它需要利用左冠状动脉(LCA)信息。使用机器学习方法单独基于RCA对冠状动脉优势进行分类已被证明是成功的,具有令人满意的准确性。然而,为了提高准确性,有必要在RCA闭塞的情况下利用LCA信息,并检测具有高不确定性的情况。
{"title":"Neural Network-Based Coronary Dominance Classification of RCA Angiograms","authors":"I. Kruzhilov,&nbsp;E. Ikryannikov,&nbsp;A. Shadrin,&nbsp;R. Utegenov,&nbsp;G. Zubkova,&nbsp;I. Bessonov","doi":"10.1134/S1064562424602026","DOIUrl":"10.1134/S1064562424602026","url":null,"abstract":"<p>Coronary arterial dominance classification is essential for SYNTAX score estimation, which is a tool used to determine the complexity of coronary artery disease and guide patient selection toward optimal revascularization strategy. We developed coronary dominance classification algorithm based on the analysis of right coronary artery (RCA) angiograms using neural network.</p><p>We employed convolutional neural network ConvNext and Swin transformer for 2D image (frames) classification, along with a majority vote for cardio angiographic view classification. An auxiliary network was also used to detect irrelevant images which were then excluded from the data set.</p><p>5-fold cross validation gave the following dominance classification metrics (<i>p</i> = 95%): macro recall = 93.1% ± 4.3%, accuracy = 93.5% ± 3.8%, macro F1 = 89.2% ± 5.6%. The most common case in which the model regularly failed was RCA occlusion, as it requires utilization of left coronary artery (LCA) information.</p><p>The use of machine learning approaches to classify coronary dominance based on RCA alone has been shown to be successful with satisfactory accuracy. However, for higher accuracy, it is necessary to utilize LCA information in the case of an occluded RCA and detect cases where there is high uncertainty.</p>","PeriodicalId":531,"journal":{"name":"Doklady Mathematics","volume":"110 1 supplement","pages":"S212 - S222"},"PeriodicalIF":0.5,"publicationDate":"2025-03-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://link.springer.com/content/pdf/10.1134/S1064562424602026.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143676208","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Unraveling the Hessian: A Key to Smooth Convergence in Loss Function Landscapes 解开黑森:损失函数景观平滑收敛的关键
IF 0.5 4区 数学 Q3 MATHEMATICS Pub Date : 2025-03-22 DOI: 10.1134/S1064562424601987
N. S. Kiselev, A. V. Grabovoy

The loss landscape of neural networks is a critical aspect of their training, and understanding its properties is essential for improving their performance. In this paper, we investigate how the loss surface changes when the sample size increases, a previously unexplored issue. We theoretically analyze the convergence of the loss landscape in a fully connected neural network and derive upper bounds for the difference in loss function values when adding a new object to the sample. Our empirical study confirms these results on various datasets, demonstrating the convergence of the loss function surface for image classification tasks. Our findings provide insights into the local geometry of neural loss landscapes and have implications for the development of sample size determination techniques.

神经网络的损失面是其训练的一个关键方面,了解其特性对提高其性能至关重要。在本文中,我们研究了当样本量增加时损失面是如何变化的,这是一个以前从未探讨过的问题。我们从理论上分析了全连接神经网络中损失面的收敛性,并推导出在样本中添加新对象时损失函数值差异的上限。我们的实证研究在各种数据集上证实了这些结果,证明了图像分类任务中损失函数面的收敛性。我们的研究结果为神经损失景观的局部几何提供了见解,并对样本大小确定技术的发展产生了影响。
{"title":"Unraveling the Hessian: A Key to Smooth Convergence in Loss Function Landscapes","authors":"N. S. Kiselev,&nbsp;A. V. Grabovoy","doi":"10.1134/S1064562424601987","DOIUrl":"10.1134/S1064562424601987","url":null,"abstract":"<p>The loss landscape of neural networks is a critical aspect of their training, and understanding its properties is essential for improving their performance. In this paper, we investigate how the loss surface changes when the sample size increases, a previously unexplored issue. We theoretically analyze the convergence of the loss landscape in a fully connected neural network and derive upper bounds for the difference in loss function values when adding a new object to the sample. Our empirical study confirms these results on various datasets, demonstrating the convergence of the loss function surface for image classification tasks. Our findings provide insights into the local geometry of neural loss landscapes and have implications for the development of sample size determination techniques.</p>","PeriodicalId":531,"journal":{"name":"Doklady Mathematics","volume":"110 1 supplement","pages":"S49 - S61"},"PeriodicalIF":0.5,"publicationDate":"2025-03-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://link.springer.com/content/pdf/10.1134/S1064562424601987.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143676267","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Application of Metaheuristic Algorithms for Optimization of Recloser Placement in a Power Supply System with Distributed Generation 元启发式算法在分布式供电系统重合闸布置优化中的应用
IF 0.5 4区 数学 Q3 MATHEMATICS Pub Date : 2025-03-22 DOI: 10.1134/S1064562424602282
N. N. Sergeev, P. V. Matrenin

Efficiency and reliability optimization of distribution networks is an important task in the design of power supply systems, and its complexity increases with the development of new technologies such as distributed generation. One way to improve network reliability is through the installation and optimal placement of automatic circuit reclosers. The presence of distributed generation units and reclosers significantly increases the dimensionality of the optimization problem, thus necessitating the use of alternative approaches to solve it. The goal of the research is to analyze the effectiveness of metaheuristic algorithms in the recloser quantity and allocation optimization problem in a distribution network. The scientific novelty of the study lies in simultaneously considering the failure rate of network elements and changes in operating condition in case of contingencies. The practical significance of the work is demonstrated through the effectiveness of using metaheuristic methods when selecting the optimal equipment configuration in electrical networks. To solve the optimization problem of recloser placement in a 24-bus 10 kV network, the genetic algorithm, evolutionary strategy, and adaptive particle swarm optimization were considered. Computational experiments showed that the genetic algorithm is the most efficient in this case. The results can be further used in the development of methodological guidelines for designing distribution networks of various voltage classes.

配电网的效率和可靠性优化是供电系统设计中的一项重要任务,随着分布式发电等新技术的发展,配电网效率和可靠性优化的复杂性不断增加。提高网络可靠性的一种方法是安装和优化自动电路复位器。分布式发电机组和重合闸的存在大大增加了优化问题的维度,因此需要使用替代方法来解决它。研究的目的是分析元启发式算法在配电网重合闸数量和分配优化问题中的有效性。本研究的科学新颖之处在于,在突发事件的情况下,同时考虑了网络要素的故障率和运行状态的变化。通过使用元启发式方法选择电网中最优设备配置的有效性,证明了工作的实际意义。针对24母线10kv电网中重合闸布设的优化问题,综合考虑了遗传算法、进化策略和自适应粒子群算法。计算实验表明,遗传算法在这种情况下是最有效的。这些结果可以进一步用于设计各种电压等级的配电网的方法学指导方针的发展。
{"title":"Application of Metaheuristic Algorithms for Optimization of Recloser Placement in a Power Supply System with Distributed Generation","authors":"N. N. Sergeev,&nbsp;P. V. Matrenin","doi":"10.1134/S1064562424602282","DOIUrl":"10.1134/S1064562424602282","url":null,"abstract":"<p>Efficiency and reliability optimization of distribution networks is an important task in the design of power supply systems, and its complexity increases with the development of new technologies such as distributed generation. One way to improve network reliability is through the installation and optimal placement of automatic circuit reclosers. The presence of distributed generation units and reclosers significantly increases the dimensionality of the optimization problem, thus necessitating the use of alternative approaches to solve it. The goal of the research is to analyze the effectiveness of metaheuristic algorithms in the recloser quantity and allocation optimization problem in a distribution network. The scientific novelty of the study lies in simultaneously considering the failure rate of network elements and changes in operating condition in case of contingencies. The practical significance of the work is demonstrated through the effectiveness of using metaheuristic methods when selecting the optimal equipment configuration in electrical networks. To solve the optimization problem of recloser placement in a 24-bus 10 kV network, the genetic algorithm, evolutionary strategy, and adaptive particle swarm optimization were considered. Computational experiments showed that the genetic algorithm is the most efficient in this case. The results can be further used in the development of methodological guidelines for designing distribution networks of various voltage classes.</p>","PeriodicalId":531,"journal":{"name":"Doklady Mathematics","volume":"110 1 supplement","pages":"S87 - S94"},"PeriodicalIF":0.5,"publicationDate":"2025-03-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143676268","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
SciRus: Tiny and Powerful Multilingual Encoder for Scientific Texts 科学文本的小而强大的多语言编码器
IF 0.5 4区 数学 Q3 MATHEMATICS Pub Date : 2025-03-22 DOI: 10.1134/S1064562424602178
N. Gerasimenko, A. Vatolin, A. Ianina, K. Vorontsov

LLM-based representation learning is widely used to build effective information retrieval systems, including scientific domains. For making science more open and affordable, it is important that these systems support multilingual (and cross-lingual) search and do not require significant computational power. To address this we propose SciRus-tiny, light multilingual encoder trained from scratch on 44 M abstracts (15B tokens) of research papers and then tuned in a contrastive manner using citation data. SciRus-tiny outperforms SciNCL, English-only SOTA-model for scientific texts, on 13/24 tasks, achieving SOTA on 7, from SciRepEval benchmark. Furthermore, SciRus-tiny is much more effective than SciNCL: it is almost 5x smaller (23 M parameters vs. 110 M), having approximately 2x smaller embeddings (312 vs. 768) and 2x bigger context length (1024 vs. 512). In addition to the tiny model, we also propose the SciRus-small (61 M parameters and 768 embeddings size), which is more powerful and can be used for complicated downstream tasks. We further study different ways of contrastive pre-training and demonstrate that almost SOTA results can be achieved without citation information, operating with only title-abstract pairs.

基于llm的表示学习被广泛用于构建有效的信息检索系统,包括科学领域。为了使科学更加开放和负担得起,重要的是这些系统支持多语言(和跨语言)搜索,并且不需要大量的计算能力。为了解决这个问题,我们提出了一个小型的、轻量级的多语言编码器,该编码器从零开始训练44万篇研究论文的摘要(15B代币),然后使用引文数据以对比的方式进行调整。在SciRepEval基准测试中,scirecval -tiny在13/24个任务上优于科学文本的英文SOTA模型sciincl,在7个任务上达到SOTA。此外,SciRus-tiny比SciNCL更有效:它几乎小5倍(23 M参数vs. 110 M),嵌入大约小2倍(312 vs. 768),上下文长度大2倍(1024 vs. 512)。除了微型模型,我们还提出了SciRus-small (61 M参数和768个嵌入尺寸),它更强大,可用于复杂的下游任务。我们进一步研究了不同的对比预训练方法,并证明了在没有引文信息的情况下,仅使用标题-摘要对就可以获得几乎相同的SOTA结果。
{"title":"SciRus: Tiny and Powerful Multilingual Encoder for Scientific Texts","authors":"N. Gerasimenko,&nbsp;A. Vatolin,&nbsp;A. Ianina,&nbsp;K. Vorontsov","doi":"10.1134/S1064562424602178","DOIUrl":"10.1134/S1064562424602178","url":null,"abstract":"<p>LLM-based representation learning is widely used to build effective information retrieval systems, including scientific domains. For making science more open and affordable, it is important that these systems support multilingual (and cross-lingual) search and do not require significant computational power. To address this we propose SciRus-tiny, light multilingual encoder trained from scratch on 44 M abstracts (15B tokens) of research papers and then tuned in a contrastive manner using citation data. SciRus-tiny outperforms SciNCL, English-only SOTA-model for scientific texts, on 13/24 tasks, achieving SOTA on 7, from SciRepEval benchmark. Furthermore, SciRus-tiny is much more effective than SciNCL: it is almost 5x smaller (23 M parameters vs. 110 M), having approximately 2x smaller embeddings (312 vs. 768) and 2x bigger context length (1024 vs. 512). In addition to the tiny model, we also propose the SciRus-small (61 M parameters and 768 embeddings size), which is more powerful and can be used for complicated downstream tasks. We further study different ways of contrastive pre-training and demonstrate that almost SOTA results can be achieved without citation information, operating with only title-abstract pairs.</p>","PeriodicalId":531,"journal":{"name":"Doklady Mathematics","volume":"110 1 supplement","pages":"S193 - S202"},"PeriodicalIF":0.5,"publicationDate":"2025-03-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://link.springer.com/content/pdf/10.1134/S1064562424602178.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143676295","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Universal Representations for Well-Logging Data via Ensembling of Self-Supervised Models 基于自监督模型集成的测井数据通用表示
IF 0.5 4区 数学 Q3 MATHEMATICS Pub Date : 2025-03-22 DOI: 10.1134/S1064562424602257
V. A. Zholobov, E. D. Romanenkova, S. A. Egorov, N. A. Gevorgyan, A. A. Zaytsev

Time series representation learning is crucial in applications requiring sophisticated data analysis. In some areas, like the Oil and Gas industry, the problem is particularly challenging due to missing values and anomalous samples caused by sensor failures in highly complex manufacturing environments. Self-supervised learning is one of the most popular solutions for obtaining data representation. However, being either generative or contrastive, these methods suffer from the limited applicability of obtained embeddings, – so general usage is more often declared than achieved.

This study introduces and examines various generative self-supervised architectures for complex industrial time series. Moreover, we propose a new way to ensemble several generative approaches, leveraging the best advantages of each method. The suggested procedure is designed to tackle a wide range of scenarios with missing and multiscale data.

For numerical experiments, we use various-scale datasets of well logs from diverse oilfields. Evaluation includes change point detection, clustering, and transfer learning, with the last two problems being introduced for the first time. It shows that variational autoencoders excel in clustering, autoregressive models better detect change points, and the proposed ensemble succeeds in both tasks.

在需要复杂数据分析的应用中,时间序列表示学习至关重要。在某些领域,如石油和天然气行业,由于高度复杂的生产环境中传感器故障导致的缺失值和异常样本,这个问题尤其具有挑战性。自我监督学习是获得数据表示最常用的解决方案之一。然而,这些方法要么是生成式的,要么是对比式的,都存在所获得嵌入的适用性有限的问题,因此普遍使用的情况往往是声明多于实现。此外,我们还提出了一种将多种生成方法集合起来的新方法,充分利用每种方法的最佳优势。在数值实验中,我们使用了来自不同油田的各种规模的测井数据集。评估包括变化点检测、聚类和迁移学习,其中后两个问题是首次引入。结果表明,变分自编码器在聚类方面表现出色,自回归模型能更好地检测变化点,而提议的集合在这两项任务中都取得了成功。
{"title":"Universal Representations for Well-Logging Data via Ensembling of Self-Supervised Models","authors":"V. A. Zholobov,&nbsp;E. D. Romanenkova,&nbsp;S. A. Egorov,&nbsp;N. A. Gevorgyan,&nbsp;A. A. Zaytsev","doi":"10.1134/S1064562424602257","DOIUrl":"10.1134/S1064562424602257","url":null,"abstract":"<p>Time series representation learning is crucial in applications requiring sophisticated data analysis. In some areas, like the Oil and Gas industry, the problem is particularly challenging due to missing values and anomalous samples caused by sensor failures in highly complex manufacturing environments. Self-supervised learning is one of the most popular solutions for obtaining data representation. However, being either generative or contrastive, these methods suffer from the limited applicability of obtained embeddings, – so general usage is more often declared than achieved.</p><p>This study introduces and examines various generative self-supervised architectures for complex industrial time series. Moreover, we propose a new way to ensemble several generative approaches, leveraging the best advantages of each method. The suggested procedure is designed to tackle a wide range of scenarios with missing and multiscale data.</p><p>For numerical experiments, we use various-scale datasets of well logs from diverse oilfields. Evaluation includes change point detection, clustering, and transfer learning, with the last two problems being introduced for the first time. It shows that variational autoencoders excel in clustering, autoregressive models better detect change points, and the proposed ensemble succeeds in both tasks.</p>","PeriodicalId":531,"journal":{"name":"Doklady Mathematics","volume":"110 1 supplement","pages":"S126 - S136"},"PeriodicalIF":0.5,"publicationDate":"2025-03-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://link.springer.com/content/pdf/10.1134/S1064562424602257.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143676297","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Digital World, Mathematics, and Education 数字世界、数学和教育
IF 0.5 4区 数学 Q3 MATHEMATICS Pub Date : 2025-03-22 DOI: 10.1134/S1064562424702284
A. L. Semenov

This paper examines changes in the content and technology of research in mathematics, computer science, and mathematical education determined by the digital transformation of civilization. Human activities and competences in the modern world are characterized in terms of an expanded personality. A characteristic feature here is the need and ability to solve fundamentally new problems, i.e., ones that are “not-known-how-to-solve.” The main types of human mathematical activities are classified. It is shown that, within the framework of school education, mathematics (including computer science) is an area where the task of developing the ability and readiness to solve challenging problems is solved most effectively. The possibilities of optimizing the educational process by using artificial intelligence tools are characterized.

本文考察了文明的数字化转型所决定的数学、计算机科学和数学教育研究的内容和技术的变化。现代社会的人类活动和能力以扩展的人格为特征。这里的一个特征是解决根本的新问题的需要和能力,即那些“不知道如何解决”的问题。对人类数学活动的主要类型进行了分类。结果表明,在学校教育的框架内,数学(包括计算机科学)是培养解决具有挑战性问题的能力和准备的任务最有效地解决的领域。介绍了利用人工智能工具优化教育过程的可能性。
{"title":"Digital World, Mathematics, and Education","authors":"A. L. Semenov","doi":"10.1134/S1064562424702284","DOIUrl":"10.1134/S1064562424702284","url":null,"abstract":"<p>This paper examines changes in the content and technology of research in mathematics, computer science, and mathematical education determined by the digital transformation of civilization. Human activities and competences in the modern world are characterized in terms of an expanded personality. A characteristic feature here is the need and ability to solve fundamentally new problems, i.e., ones that are “not-known-how-to-solve.” The main types of human mathematical activities are classified. It is shown that, within the framework of school education, mathematics (including computer science) is an area where the task of developing the ability and readiness to solve challenging problems is solved most effectively. The possibilities of optimizing the educational process by using artificial intelligence tools are characterized.</p>","PeriodicalId":531,"journal":{"name":"Doklady Mathematics","volume":"110 1 supplement","pages":"S2 - S7"},"PeriodicalIF":0.5,"publicationDate":"2025-03-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143676393","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Railway Infrastructure Detection Based on YOLOv8 with NPU Acceleration 基于 YOLOv8 和 NPU 加速的铁路基础设施检测
IF 0.5 4区 数学 Q3 MATHEMATICS Pub Date : 2025-03-22 DOI: 10.1134/S1064562424601951
V. A. Fedorov

This paper delves into the efficacy of utilizing the YOLOv8 model, which is based on a convolutional neural network (CNN), for the purpose of detecting objects within railway infrastructure, leveraging the capabilities of Neural Processing Units (NPU). It comprehensively explores various configurations of YOLOv8, each characterized by distinct architectural structures and input layer resolutions. These configurations were meticulously trained and evaluated using a sizable dataset comprising over 20   000 Full HD images. Through rigorous experimentation, this study elucidates the considerable potential of YOLOv8, especially when bolstered by NPU acceleration, in facilitating the real-time detection of objects within railway infrastructure. The performance of different YOLOv8 variants was thoroughly assessed by evaluating critical factors such as detection accuracy and computational efficiency. The findings of this research underscore the adaptability and resilience of YOLOv8 models across a spectrum of input resolutions, underscoring their proficiency in accurately identifying various elements of railway infrastructure under diverse environmental conditions. Furthermore, the integration of NPU acceleration emerges as a pivotal factor. It significantly augments the detection speed and responsiveness of the system, thereby enabling the swift processing of high-resolution images in real-time scenarios. This paper emphasizes the promising prospects associated with integrating YOLOv8 and NPU acceleration for applications in railway infrastructure monitoring and management. It offers valuable insights into the future trajectory of object detection technology within transportation systems, paving the way for enhanced efficiency and effectiveness in railway infrastructure operations.

YOLOv8 模型基于卷积神经网络 (CNN),本文利用神经处理单元 (NPU) 的功能,深入探讨了利用 YOLOv8 模型检测铁路基础设施内物体的功效。它全面探讨了 YOLOv8 的各种配置,每种配置都具有不同的架构结构和输入层分辨率。这些配置都经过了精心的训练,并使用由 20,000 多张全高清图像组成的大量数据集进行了评估。通过严格的实验,本研究阐明了 YOLOv8 在促进铁路基础设施内物体的实时检测方面的巨大潜力,尤其是在 NPU 加速的支持下。通过评估检测精度和计算效率等关键因素,对不同 YOLOv8 变体的性能进行了全面评估。这项研究的结果强调了 YOLOv8 模型在各种输入分辨率下的适应性和复原力,突出了其在不同环境条件下准确识别铁路基础设施各种元素的能力。此外,集成 NPU 加速功能也是一个关键因素。它大大提高了系统的检测速度和响应能力,从而能够在实时场景中快速处理高分辨率图像。本文强调了将 YOLOv8 和 NPU 加速集成到铁路基础设施监控和管理应用中的广阔前景。它为交通系统中物体检测技术的未来发展轨迹提供了宝贵的见解,为提高铁路基础设施运营的效率和效益铺平了道路。
{"title":"Railway Infrastructure Detection Based on YOLOv8 with NPU Acceleration","authors":"V. A. Fedorov","doi":"10.1134/S1064562424601951","DOIUrl":"10.1134/S1064562424601951","url":null,"abstract":"<p>This paper delves into the efficacy of utilizing the YOLOv8 model, which is based on a convolutional neural network (CNN), for the purpose of detecting objects within railway infrastructure, leveraging the capabilities of Neural Processing Units (NPU). It comprehensively explores various configurations of YOLOv8, each characterized by distinct architectural structures and input layer resolutions. These configurations were meticulously trained and evaluated using a sizable dataset comprising over 20   000 Full HD images. Through rigorous experimentation, this study elucidates the considerable potential of YOLOv8, especially when bolstered by NPU acceleration, in facilitating the real-time detection of objects within railway infrastructure. The performance of different YOLOv8 variants was thoroughly assessed by evaluating critical factors such as detection accuracy and computational efficiency. The findings of this research underscore the adaptability and resilience of YOLOv8 models across a spectrum of input resolutions, underscoring their proficiency in accurately identifying various elements of railway infrastructure under diverse environmental conditions. Furthermore, the integration of NPU acceleration emerges as a pivotal factor. It significantly augments the detection speed and responsiveness of the system, thereby enabling the swift processing of high-resolution images in real-time scenarios. This paper emphasizes the promising prospects associated with integrating YOLOv8 and NPU acceleration for applications in railway infrastructure monitoring and management. It offers valuable insights into the future trajectory of object detection technology within transportation systems, paving the way for enhanced efficiency and effectiveness in railway infrastructure operations.</p>","PeriodicalId":531,"journal":{"name":"Doklady Mathematics","volume":"110 1 supplement","pages":"S42 - S48"},"PeriodicalIF":0.5,"publicationDate":"2025-03-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://link.springer.com/content/pdf/10.1134/S1064562424601951.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143676266","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
期刊
Doklady Mathematics
全部 Acc. Chem. Res. ACS Applied Bio Materials ACS Appl. Electron. Mater. ACS Appl. Energy Mater. ACS Appl. Mater. Interfaces ACS Appl. Nano Mater. ACS Appl. Polym. Mater. ACS BIOMATER-SCI ENG ACS Catal. ACS Cent. Sci. ACS Chem. Biol. ACS Chemical Health & Safety ACS Chem. Neurosci. ACS Comb. Sci. ACS Earth Space Chem. ACS Energy Lett. ACS Infect. Dis. ACS Macro Lett. ACS Mater. Lett. ACS Med. Chem. Lett. ACS Nano ACS Omega ACS Photonics ACS Sens. ACS Sustainable Chem. Eng. ACS Synth. Biol. Anal. Chem. BIOCHEMISTRY-US Bioconjugate Chem. BIOMACROMOLECULES Chem. Res. Toxicol. Chem. Rev. Chem. Mater. CRYST GROWTH DES ENERG FUEL Environ. Sci. Technol. Environ. Sci. Technol. Lett. Eur. J. Inorg. Chem. IND ENG CHEM RES Inorg. Chem. J. Agric. Food. Chem. J. Chem. Eng. Data J. Chem. Educ. J. Chem. Inf. Model. J. Chem. Theory Comput. J. Med. Chem. J. Nat. Prod. J PROTEOME RES J. Am. Chem. Soc. LANGMUIR MACROMOLECULES Mol. Pharmaceutics Nano Lett. Org. Lett. ORG PROCESS RES DEV ORGANOMETALLICS J. Org. Chem. J. Phys. Chem. J. Phys. Chem. A J. Phys. Chem. B J. Phys. Chem. C J. Phys. Chem. Lett. Analyst Anal. Methods Biomater. Sci. Catal. Sci. Technol. Chem. Commun. Chem. Soc. Rev. CHEM EDUC RES PRACT CRYSTENGCOMM Dalton Trans. Energy Environ. Sci. ENVIRON SCI-NANO ENVIRON SCI-PROC IMP ENVIRON SCI-WAT RES Faraday Discuss. Food Funct. Green Chem. Inorg. Chem. Front. Integr. Biol. J. Anal. At. Spectrom. J. Mater. Chem. A J. Mater. Chem. B J. Mater. Chem. C Lab Chip Mater. Chem. Front. Mater. Horiz. MEDCHEMCOMM Metallomics Mol. Biosyst. Mol. Syst. Des. Eng. Nanoscale Nanoscale Horiz. Nat. Prod. Rep. New J. Chem. Org. Biomol. Chem. Org. Chem. Front. PHOTOCH PHOTOBIO SCI PCCP Polym. Chem.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1