发布求助
文献互助 智能选刊 最新文献

Doklady Mathematics最新文献

筛选
英文 中文
RuWikiBench: Evaluating Large Language Models Through Replication of Encyclopedia Articles RuWikiBench：通过百科全书文章的复制来评估大型语言模型
IF 0.6 4区 数学
Doklady Mathematics Pub Date : 2026-03-02 DOI: 10.1134/S1064562425700279
D. A. Grigoriev, D. I. Chernyshev
{"title":"RuWikiBench: Evaluating Large Language Models Through Replication of Encyclopedia Articles","authors":"D. A. Grigoriev,&nbsp;D. I. Chernyshev","doi":"10.1134/S1064562425700279","DOIUrl":"10.1134/S1064562425700279","url":null,"abstract":"<div><p>In light of the growing interest in using large language models (LLMs) as tools for generating scientific texts, the evaluation of their ability to produce encyclopedic content is becoming increasingly relevant. However, for Russian-language materials, this issue has not been sufficiently studied and existing benchmarks do not cover key aspects of analytical work with sources. This article presents RuWikiBench—an open benchmark based on Ruwiki for evaluating the ability of LLMs to reproduce Wikipedia-style articles, constructed around three tasks: selection of relevant sources, article structuring, and section generation. The results of testing popular open-source LLMs show that even under ideal conditions, the best models do not always follow the expert logic of composing encyclopedic content: even with a perfect source retrieval system, the models cannot reproduce the reference table of contents, and the quality of section generation shows almost no dependence on the number of parameters.</p></div>","PeriodicalId":531,"journal":{"name":"Doklady Mathematics","volume":"112 1","pages":"299 - 307"},"PeriodicalIF":0.6,"publicationDate":"2026-03-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"147335853","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
NP-Completeness of Hanabi Game with Minimal Parameters 最小参数Hanabi对策的np -完备性
IF 0.6 4区 数学
Doklady Mathematics Pub Date : 2026-03-02 DOI: 10.1134/S1064562425700310
A. A. Onorpienko
{"title":"NP-Completeness of Hanabi Game with Minimal Parameters","authors":"A. A. Onorpienko","doi":"10.1134/S1064562425700310","DOIUrl":"10.1134/S1064562425700310","url":null,"abstract":"<p>We study the algorithmic complexity of the cooperative card game Hanabi. A feature of Hanabi is that players can see other players’ cards, but not their own, and exchange information through hints. Even in the model with one player who has full information about the deck, Hanabi remains NP-hard. We found the minimal parameters of the game that preserve NP-hardness. If these parameters are further reduced, the game turns out to be solvable in polynomial time.</p>","PeriodicalId":531,"journal":{"name":"Doklady Mathematics","volume":"112 1","pages":"255 - 262"},"PeriodicalIF":0.6,"publicationDate":"2026-03-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"147335859","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
Discriminative Lemmatization of Abbreviations in the Era of LLMs 法学硕士时代缩写词的辨别性词源化
IF 0.6 4区 数学
Doklady Mathematics Pub Date : 2026-03-02 DOI: 10.1134/S106456242570022X
A. V. Glazkova, I. A. Smal, O. N. Lyashevskaya, D. A. Morozov
{"title":"Discriminative Lemmatization of Abbreviations in the Era of LLMs","authors":"A. V. Glazkova,&nbsp;I. A. Smal,&nbsp;O. N. Lyashevskaya,&nbsp;D. A. Morozov","doi":"10.1134/S106456242570022X","DOIUrl":"10.1134/S106456242570022X","url":null,"abstract":"<p>This paper presents a study on the effectiveness of discriminative methods for abbreviation lemmatization in Russian texts. Unlike generative approaches, discriminative models select an optimal lemma from a fixed set of candidates, eliminating the risk of generating grammatically incorrect word forms. For the first time in Russian language processing, we have conducted a comprehensive analysis of four context-aware approaches: (1) masked language model ranking, (2) binary classification, (3) multi-class classification, and (4) prompt-based learning. Special attention is given to cases of contextual ambiguity, where the same abbreviation within a single text fragment corresponds to different lemmas. The results demonstrate that fine-tuned multi-class classification achieves the highest quality (macro-averaged F-score of 97.75–99.92% depending on the abbreviation). However, with limited training data, both prompt-based learning and masked language model ranking show promising results. Moreover, the effectiveness of these approaches increases in cases of contextual ambiguity. The study contributes to the development of Russian text processing methods by providing practical recommendations for selecting architectures for abbreviation lemmatization tasks.</p>","PeriodicalId":531,"journal":{"name":"Doklady Mathematics","volume":"112 1","pages":"219 - 226"},"PeriodicalIF":0.6,"publicationDate":"2026-03-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"147336330","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
Competing Risks Survival Models for Churn Prediction 流失预测的竞争风险生存模型
IF 0.6 4区 数学
Doklady Mathematics Pub Date : 2026-03-02 DOI: 10.1134/S1064562425700346
I. A. Vasilev, I. G. Pridanova, M. I. Petrovskiy, I. V. Mashechkin
{"title":"Competing Risks Survival Models for Churn Prediction","authors":"I. A. Vasilev,&nbsp;I. G. Pridanova,&nbsp;M. I. Petrovskiy,&nbsp;I. V. Mashechkin","doi":"10.1134/S1064562425700346","DOIUrl":"10.1134/S1064562425700346","url":null,"abstract":"<p>Predicting customer churn requires considering multiple reasons for customer leave, including financial difficulties, dissatisfaction with service quality, and switching to competitors. Survival analysis methods allow us to estimate the probability of an event occurring over time, but have limited functionality in the case of competing risks. The paper proposes adapting classical survival analysis methods to competing risks by constructing a set of individual models using the One-vs-Rest scheme, with different approaches for incorporating censored events. The proposed method for aggregating forecasts using a multi-class classification meta-model will simplify the process of making expert decisions. According to the results of an experimental study using Freddie Mac mortgage lending data, the proposed methods surpassed existing solutions in quality and can be applied to mortgage lending problems.</p>","PeriodicalId":531,"journal":{"name":"Doklady Mathematics","volume":"112 1","pages":"233 - 238"},"PeriodicalIF":0.6,"publicationDate":"2026-03-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"147335832","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
On Basic Mathematical Definitions of Digital Technologies and Artificial Intelligence 数字技术与人工智能的基本数学定义
IF 0.6 4区 数学
Doklady Mathematics Pub Date : 2026-03-02 DOI: 10.1134/S1064562425700371
A. L. Semenov
{"title":"On Basic Mathematical Definitions of Digital Technologies and Artificial Intelligence","authors":"A. L. Semenov","doi":"10.1134/S1064562425700371","DOIUrl":"10.1134/S1064562425700371","url":null,"abstract":"<p>The paper proposes a system of definitions for basic concepts of computability theory that underlie the mathematics of the digital world: algorithm, computability, calculus, and object complexity close to modern understanding. Hierarchies of the finite and the problem of consistency are considered.</p>","PeriodicalId":531,"journal":{"name":"Doklady Mathematics","volume":"112 1","pages":"214 - 218"},"PeriodicalIF":0.6,"publicationDate":"2026-03-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"147335938","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
Introductory Remarks by AI Journey Team AI之旅团队介绍
IF 0.6 4区 数学
Doklady Mathematics Pub Date : 2026-03-02 DOI: 10.1134/S106456242570036X
AI Journey team
{"title":"Introductory Remarks by AI Journey Team","authors":"AI Journey team","doi":"10.1134/S106456242570036X","DOIUrl":"10.1134/S106456242570036X","url":null,"abstract":"","PeriodicalId":531,"journal":{"name":"Doklady Mathematics","volume":"112 1","pages":"213 - 213"},"PeriodicalIF":0.6,"publicationDate":"2026-03-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"147335939","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
Employing Synthetic Canopy Height Model Data to Enhance Tree Identification in High-Resolution Satellite Imagery 利用合成冠层高度模型数据增强高分辨率卫星图像中的树木识别
IF 0.6 4区 数学
Doklady Mathematics Pub Date : 2026-03-02 DOI: 10.1134/S1064562425700267
A. V. Grigorev, A. A. Leislya, K. S. Semenov
{"title":"Employing Synthetic Canopy Height Model Data to Enhance Tree Identification in High-Resolution Satellite Imagery","authors":"A. V. Grigorev,&nbsp;A. A. Leislya,&nbsp;K. S. Semenov","doi":"10.1134/S1064562425700267","DOIUrl":"10.1134/S1064562425700267","url":null,"abstract":"<p>This paper investigates a novel approach for detecting trees in high-resolution satellite imagery by leveraging synthetic canopy height model (CHM) data. We demonstrate that integrating fine-scale CHM maps significantly enhances both the quality and accuracy of tree detection. Additionally, the study conducts a comparative evaluation of several neural network architectures for delineating tree crowns in imagery. Experimental results confirm the effectiveness of the proposed method, underscoring its potential to streamline satellite data processing workflows and strengthen the reliability of automated vegetation monitoring systems.</p>","PeriodicalId":531,"journal":{"name":"Doklady Mathematics","volume":"112 1","pages":"288 - 298"},"PeriodicalIF":0.6,"publicationDate":"2026-03-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"147335852","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
Neural Network Assessment of Spatial Resolution of Multi-Scale Aerial Photographs of Urban and Natural Landscapes 城市与自然景观多尺度航空照片空间分辨率的神经网络评价
IF 0.6 4区 数学
Doklady Mathematics Pub Date : 2026-03-02 DOI: 10.1134/S1064562425700358
A. V. Zabolotskiy, K. V. Sobyanin
{"title":"Neural Network Assessment of Spatial Resolution of Multi-Scale Aerial Photographs of Urban and Natural Landscapes","authors":"A. V. Zabolotskiy,&nbsp;K. V. Sobyanin","doi":"10.1134/S1064562425700358","DOIUrl":"10.1134/S1064562425700358","url":null,"abstract":"<p>Determining the spatial resolution (GSD) of remote sensing images is in demand in various fields, from environmental monitoring to urban planning and agriculture, which makes it relevant to analyze both urban and natural landscapes. This study focuses on deep learning methods for evaluating the GSD of still images, and its purpose is to study the impact exerted on the quality of GSD assessment by approaches, such as autoencoder pre-training on still images (SSL) and taking into account features from different levels of the model. All the models under consideration were trained on images of landscapes of different types. Scaling augmentations were also used to train them to expand the range of GSD in data samples. ResNet18 was used as a baseline model, which, based on available data, demonstrates MAPE values ranging from 2.73 to 15.6%. Using the relative loss function directly in training allows one to improve performance on data with low spatial resolution from 15.6 to 14.7%. At the same time, using the SSL approach slightly improves performance at high GSD values. A combination of SSL with FPN reaches 3.61% on a set with a mixed landscape type. The results make it possible to use the trained models to solve applied problems. However, it is necessary to choose the most appropriate method for each specific case.</p>","PeriodicalId":531,"journal":{"name":"Doklady Mathematics","volume":"112 1","pages":"227 - 232"},"PeriodicalIF":0.6,"publicationDate":"2026-03-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"147336331","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
New Formulas for the Inversion of the Radon Transform Radon变换反演的新公式
IF 0.6 4区 数学
Doklady Mathematics Pub Date : 2025-12-09 DOI: 10.1134/S1064562425700139
D. S. Anikonov, D. S. Konovalova
{"title":"New Formulas for the Inversion of the Radon Transform","authors":"D. S. Anikonov,&nbsp;D. S. Konovalova","doi":"10.1134/S1064562425700139","DOIUrl":"10.1134/S1064562425700139","url":null,"abstract":"<p>Classical inversion formulas for the integral Radon transform assume that the integrand is smooth. However, this restriction does not fully correspond to application of results in probing theory, which is the main area of application of the Radon transform. It would be more natural to assume that jump discontinuities are admissible for integrands. The paper presents several inversion formulas proved by the authors for piecewise continuous functions. The formulas are compared, and preliminary recommendations on their use for numerical algorithms are given.</p>","PeriodicalId":531,"journal":{"name":"Doklady Mathematics","volume":"111 3","pages":"163 - 166"},"PeriodicalIF":0.6,"publicationDate":"2025-12-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145706220","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
Error Bounds for Integro Quadratic Spline Interpolation in the Mean and Superconvergence Points 积分二次样条插值在均值和超收敛点上的误差界
IF 0.6 4区 数学
Doklady Mathematics Pub Date : 2025-12-09 DOI: 10.1134/S106456242570019X
Yu. S. Volkov
{"title":"Error Bounds for Integro Quadratic Spline Interpolation in the Mean and Superconvergence Points","authors":"Yu. S. Volkov","doi":"10.1134/S106456242570019X","DOIUrl":"10.1134/S106456242570019X","url":null,"abstract":"<p>The problem of interpolation in the mean of a function by an integro quadratic spline given integrally averaged function values is considered. It is shown that an integro quadratic spline can be defined via a cubic interpolation spline. Since cubic interpolation splines have been studied quite well, well-known error bounds for them and some of their properties can be transferred to integro quadratic splines. Points of superconvergence of integro splines are found, i.e., points at which a spline or its derivatives provide a higher order of approximation.</p>","PeriodicalId":531,"journal":{"name":"Doklady Mathematics","volume":"111 3","pages":"172 - 174"},"PeriodicalIF":0.6,"publicationDate":"2025-12-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145706223","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
首页 上一页 下一页 尾页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：604180095
Book学术官方微信
小红书