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

Doklady Mathematics最新文献

筛选
英文 中文
Common Digital Space of Scientific Knowledge as an Integrator of Polythematic Information Resources 作为多主题信息资源整合器的科学知识共同数字空间
IF 0.5 4区 数学
Doklady Mathematics Pub Date : 2024-03-11 DOI: 10.1134/S106456242470176X
N. E. Kalenov, A. N. Sotnikov
{"title":"Common Digital Space of Scientific Knowledge as an Integrator of Polythematic Information Resources","authors":"N. E. Kalenov,&nbsp;A. N. Sotnikov","doi":"10.1134/S106456242470176X","DOIUrl":"10.1134/S106456242470176X","url":null,"abstract":"<p>The goals, objectives, and structure of the ontology of the Common Digital Space of Scientific Knowledge (CDSSK) are considered. The CDSSK is an integrated information structure that combines state scientific information systems presented on the Internet (the Great Russian Encyclopedia, the National Electronic Library, the State Catalog of Geographical Names, etc.) with industry information systems, databases, and electronic libraries (MathNet, Socionet, Scientific Heritage of Russia, etc.). CDSSK can be considered as an information basis for solving artificial intelligence problems. The article presents the unified structure of the CDSSK ontology developed at the Joint Supercomputer Center of the Russian Academy of Sciences and its modeling on an example of ten subject classes and eight auxiliary classes of objects of the CDSSK universal subspace.</p>","PeriodicalId":531,"journal":{"name":"Doklady Mathematics","volume":null,"pages":null},"PeriodicalIF":0.5,"publicationDate":"2024-03-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140099212","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
Towards Efficient Learning of GNNs on High-Dimensional Multilayered Representations of Tabular Data 在表格数据的高维多层表示上实现 GNN 的高效学习
IF 0.5 4区 数学
Doklady Mathematics Pub Date : 2024-03-11 DOI: 10.1134/S1064562423701193
A. V. Medvedev, A. G. Djakonov
{"title":"Towards Efficient Learning of GNNs on High-Dimensional Multilayered Representations of Tabular Data","authors":"A. V. Medvedev,&nbsp;A. G. Djakonov","doi":"10.1134/S1064562423701193","DOIUrl":"10.1134/S1064562423701193","url":null,"abstract":"<p>For prediction tasks using tabular data, it is possible to extract additional information about the target variable by examining the relationships between the objects. Specifically, if it is possible to receive agraph in which the objects are represented as vertices and the relationships are expressed as edges, then it is likely that the graph structure contains valuable information. Recent research has indicated that jointly training graph neural networks and gradient boostings on this type of data can increase the accuracy of predictions. This article proposes new methods for learning on tabular data that incorporates a graph structure, in an attempt to combine modern multilayer techniques for processing tabular data and graph neural networks. In addition, we discuss ways to mitigate the computational complexity of the proposed models and conduct experiments in both inductive and transductive settings. Our findings demonstrate tha the proposed approaches provide comparable quality to modern methods.</p>","PeriodicalId":531,"journal":{"name":"Doklady Mathematics","volume":null,"pages":null},"PeriodicalIF":0.5,"publicationDate":"2024-03-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140099219","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
Graph Models for Contextual Intention Prediction in Dialog Systems 用于对话系统中上下文意向预测的图模型
IF 0.5 4区 数学
Doklady Mathematics Pub Date : 2024-03-11 DOI: 10.1134/S106456242370117X
D. P. Kuznetsov, D. R. Ledneva
{"title":"Graph Models for Contextual Intention Prediction in Dialog Systems","authors":"D. P. Kuznetsov,&nbsp;D. R. Ledneva","doi":"10.1134/S106456242370117X","DOIUrl":"10.1134/S106456242370117X","url":null,"abstract":"<p>The paper introduces a novel methodology for predicting intentions in dialog systems through a graph-based approach. This methodology involves constructing graph structures that represent dialogs, thus capturing contextual information effectively. By analyzing results from various open and closed domain datasets, the authors demonstrate the substantial enhancement in intention prediction accuracy achieved by combining graph models with text encoders. The primary focus of the study revolves around assessing the impact of diverse graph architectures and encoders on the performance of the proposed technique. Through empirical evaluation, the experimental outcomes affirm the superiority of graph neural networks in terms of both <span>(Recall@k)</span> (MAR) metric and computational resources when compared to alternative methods. This research uncovers a novel avenue for intention prediction in dialog systems by leveraging graph-based representations.</p>","PeriodicalId":531,"journal":{"name":"Doklady Mathematics","volume":null,"pages":null},"PeriodicalIF":0.5,"publicationDate":"2024-03-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140099298","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
Algorithms with Gradient Clipping for Stochastic Optimization with Heavy-Tailed Noise 针对重尾噪声随机优化的梯度剪切算法
IF 0.5 4区 数学
Doklady Mathematics Pub Date : 2024-03-11 DOI: 10.1134/S1064562423701144
M. Danilova
{"title":"Algorithms with Gradient Clipping for Stochastic Optimization with Heavy-Tailed Noise","authors":"M. Danilova","doi":"10.1134/S1064562423701144","DOIUrl":"10.1134/S1064562423701144","url":null,"abstract":"<p>This article provides a survey of the results of several research studies [12–14, 26], in which open questions related to the high-probability convergence analysis of stochastic first-order optimization methods under mild assumptions on the noise were gradually addressed. In the beginning, we introduce the concept of gradient clipping, which plays a pivotal role in the development of stochastic methods for successful operation in the case of heavy-tailed distributions. Next, we examine the importance of obtaining the high-probability convergence guarantees and their connection with in-expectation convergence guarantees. The concluding sections of the article are dedicated to presenting the primary findings related to minimization problems and the results of numerical experiments.</p>","PeriodicalId":531,"journal":{"name":"Doklady Mathematics","volume":null,"pages":null},"PeriodicalIF":0.5,"publicationDate":"2024-03-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140099631","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
Towards Discovery of the Differential Equations 发现微分方程
IF 0.5 4区 数学
Doklady Mathematics Pub Date : 2024-03-11 DOI: 10.1134/S1064562423701156
A. A. Hvatov, R. V. Titov
{"title":"Towards Discovery of the Differential Equations","authors":"A. A. Hvatov,&nbsp;R. V. Titov","doi":"10.1134/S1064562423701156","DOIUrl":"10.1134/S1064562423701156","url":null,"abstract":"<p>Differential equation discovery, a machine learning subfield, is used to develop interpretable models, particularly, in nature-related applications. By expertly incorporating the general parametric form of the equation of motion and appropriate differential terms, algorithms can autonomously uncover equations from data. This paper explores the prerequisites and tools for independent equation discovery without expert input, eliminating the need for equation form assumptions. We focus on addressing the challenge of assessing the adequacy of discovered equations when the correct equation is unknown, with the aim of providing insights for reliable equation discovery without prior knowledge of the equation form.</p>","PeriodicalId":531,"journal":{"name":"Doklady Mathematics","volume":null,"pages":null},"PeriodicalIF":0.5,"publicationDate":"2024-03-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140099313","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
Artificial Intelligence in Society 社会中的人工智能
IF 0.5 4区 数学
Doklady Mathematics Pub Date : 2024-03-11 DOI: 10.1134/S106456242355001X
A. L. Semenov
{"title":"Artificial Intelligence in Society","authors":"A. L. Semenov","doi":"10.1134/S106456242355001X","DOIUrl":"10.1134/S106456242355001X","url":null,"abstract":"<p>This article is the author’s review of the singularity in which events in the field of artificial intelligence (AI) are developing. A general view is offered on the role of revolutions in information technology as they expand the human personality. The current stage of personal expansion is considered, covering the last decade, especially 2023. The most important and common socially significant documents expressing concern about AI, as well as those that assert an optimistic view of events, are considered: ethical principles, important directions, requirements, and restrictions. It takes a closer look at the pending European AI Act (AIA) and how different groups are reacting to it. Cultural and historical factors are highlighted that can counteract the negative and catastrophic developments that may result from AI. Possible mechanisms for preserving genuine knowledge among professionals and disseminating it among the general public are analyzed.</p>","PeriodicalId":531,"journal":{"name":"Doklady Mathematics","volume":null,"pages":null},"PeriodicalIF":0.5,"publicationDate":"2024-03-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140099209","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
Operator Estimates for Problems in Domains with Singularly Curved Boundary: Dirichlet and Neumann Conditions 具有奇异曲线边界的域中问题的算子估计： 迪里希特条件和诺依曼条件
IF 0.5 4区 数学
Doklady Mathematics Pub Date : 2024-03-11 DOI: 10.1134/S1064562424701758
D. I. Borisov, R. R. Suleimanov
{"title":"Operator Estimates for Problems in Domains with Singularly Curved Boundary: Dirichlet and Neumann Conditions","authors":"D. I. Borisov,&nbsp;R. R. Suleimanov","doi":"10.1134/S1064562424701758","DOIUrl":"10.1134/S1064562424701758","url":null,"abstract":"<p>We consider a system of second-order semilinear elliptic equations in a multidimensional domain with an arbitrarily curved boundary contained in a narrow layer along the unperturbed boundary. The Dirichlet or Neumann condition is imposed on the curved boundary. In the case of the Neumann condition, rather natural and weak conditions are additionally imposed on the structure of the curving. Under these conditions, we show that the homogenized problem is one for the same system of equations in the unperturbed problem with a boundary condition of the same kind as on the perturbed boundary. The main result is operator <span>(W_{2}^{1})</span>- and <i>L</i><sub>2</sub>- estimates.</p>","PeriodicalId":531,"journal":{"name":"Doklady Mathematics","volume":null,"pages":null},"PeriodicalIF":0.5,"publicationDate":"2024-03-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140099305","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 Words of AI Journey Team 人工智能之旅团队简介
IF 0.5 4区 数学
Doklady Mathematics Pub Date : 2024-03-11 DOI: 10.1134/S1064562423900015
The AI Journey Team
{"title":"Introductory Words of AI Journey Team","authors":"The AI Journey Team","doi":"10.1134/S1064562423900015","DOIUrl":"10.1134/S1064562423900015","url":null,"abstract":"","PeriodicalId":531,"journal":{"name":"Doklady Mathematics","volume":null,"pages":null},"PeriodicalIF":0.5,"publicationDate":"2024-03-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140099634","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 Networks for Coordination Analysis 用于协调分析的神经网络
IF 0.5 4区 数学
Doklady Mathematics Pub Date : 2024-03-11 DOI: 10.1134/S1064562423701181
A. I. Predelina, S. Yu. Dulikov, A. M. Alekseev
{"title":"Neural Networks for Coordination Analysis","authors":"A. I. Predelina,&nbsp;S. Yu. Dulikov,&nbsp;A. M. Alekseev","doi":"10.1134/S1064562423701181","DOIUrl":"10.1134/S1064562423701181","url":null,"abstract":"<p>This paper is dedicated to the development of a novel method for coordination analysis (CA) in English using the neural (deep learning) methods. An efficient solution for the task allows identifying potentially valuable links and relationships between specific parts of a sentence, making the extraction of coordinate structures an important text preprocessing tool. In this study, a number of ideas for approaching the task within the framework of one-stage detectors were tested. The achieved results are comparable in quality to the current most advanced CA methods while allowing to process more than three-fold more sentences per unit time.</p>","PeriodicalId":531,"journal":{"name":"Doklady Mathematics","volume":null,"pages":null},"PeriodicalIF":0.5,"publicationDate":"2024-03-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140099234","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
Artificially Generated Text Fragments Search in Academic Documents 在学术文献中搜索人工生成的文本片段
IF 0.5 4区 数学
Doklady Mathematics Pub Date : 2024-03-11 DOI: 10.1134/S1064562423701211
G. M. Gritsay, A. V. Grabovoy, A. S. Kildyakov, Yu. V. Chekhovich
{"title":"Artificially Generated Text Fragments Search in Academic Documents","authors":"G. M. Gritsay,&nbsp;A. V. Grabovoy,&nbsp;A. S. Kildyakov,&nbsp;Yu. V. Chekhovich","doi":"10.1134/S1064562423701211","DOIUrl":"10.1134/S1064562423701211","url":null,"abstract":"<p>Recent advances in text generative models make it possible to create artificial texts that look like human-written texts. A large number of methods for detecting texts obtained using large language models have already been developed. However, improvement of detection methods occurs simultaneously with the improvement of generation methods. Therefore, it is necessary to explore new generative models and modernize existing approaches to their detection. In this paper, we present a large analysis of existing detection methods, as well as a study of lexical, syntactic, and stylistic features of the generated fragments. Taking into account the developments, we have tested the most qualitative, in our opinion, methods of detecting machine-generated documents for their further application in the scientific domain. Experiments were conducted for Russian and English languages on the collected datasets. The developed methods improved the detection quality to a value of 0.968 on the F1-score metric for Russian and 0.825 for English, respectively. The described techniques can be applied to detect generated fragments in scientific, research, and graduate papers.</p>","PeriodicalId":531,"journal":{"name":"Doklady Mathematics","volume":null,"pages":null},"PeriodicalIF":0.5,"publicationDate":"2024-03-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140099334","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学术文献互助群
群 号：481959085
Book学术官方微信