Trudy Instituta sistemnogo programmirovaniia RAN最新文献

筛选
英文 中文
Organization of a secure query to a database in the cloud 组织对云中的数据库的安全查询
Trudy Instituta sistemnogo programmirovaniia RAN Pub Date : 2022-01-01 DOI: 10.15514/ispras-2022-34(3)-12
S. Martishin, M. V. Khrapchenko, A. Shokurov
{"title":"Organization of a secure query to a database in the cloud","authors":"S. Martishin, M. V. Khrapchenko, A. Shokurov","doi":"10.15514/ispras-2022-34(3)-12","DOIUrl":"https://doi.org/10.15514/ispras-2022-34(3)-12","url":null,"abstract":"The development of cloud computing, including the storage and processing of confidential user data on servers that can be attacked, puts forward new requirements for information protection. The article explores the problem of obtaining information from the database by the client in such a way that no one except the client himself get any information about the information the client is interested in (PIR - Private Information Retrieval). The problem was introduced in 1995 by Chor, Goldreich, Kushilevitz and Sudan in the information-theoretic setting. A model of cloud computing is proposed. It includes a cloud, a user, clients, a trusted dealer, a passive adversary in the cloud. Also, the attacking side has the ability to create fake clients to generate an unlimited number of requests. An algorithm for the organization and database distribution on the cloud and an algorithm for obtaining the required bit were proposed. Communication complexity of the algorithm was estimated. The probability of revealing required bit's number in the case when fake clients perform unlimited requests was estimated too.","PeriodicalId":33459,"journal":{"name":"Trudy Instituta sistemnogo programmirovaniia RAN","volume":"16 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2022-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85785763","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
Automatic data labeling for document image segmentation using deep neural networks 基于深度神经网络的文档图像分割自动数据标注
Trudy Instituta sistemnogo programmirovaniia RAN Pub Date : 2022-01-01 DOI: 10.15514/ispras-2022-34(6)-10
Andrey Anatolievitch Mikhaylov
{"title":"Automatic data labeling for document image segmentation using deep neural networks","authors":"Andrey Anatolievitch Mikhaylov","doi":"10.15514/ispras-2022-34(6)-10","DOIUrl":"https://doi.org/10.15514/ispras-2022-34(6)-10","url":null,"abstract":"The article proposes a new method for automatic data annotation for solving the problem of document image segmentation using deep object detection neural networks. The format of marked PDF files is considered as the initial data for markup. The peculiarity of this format is that it includes hidden marks that describe the logical and physical structure of the document. To extract them, a tool has been developed that simulates the operation of a stack-based printing machine according to the PDF format specification. For each page of the document, an image and annotation are generated in PASCAL VOC format. The classes and coordinates of the bounding boxes are calculated during the interpretation of the labeled PDF file based on the labels. To test the method, a collection of marked up PDF files was formed from which images of document pages and annotations for three segmentation classes (text, table, figure) were automatically obtained. Based on these data, a neural network of the EfficientDet D2 architecture was trained. The model was tested on manually labeled data from the same domain, which confirmed the effectiveness of using automatically generated data for solving applied problems.","PeriodicalId":33459,"journal":{"name":"Trudy Instituta sistemnogo programmirovaniia RAN","volume":"57 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2022-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85806570","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
Big Transformers for Code Generation 代码生成的大变形器
Trudy Instituta sistemnogo programmirovaniia RAN Pub Date : 2022-01-01 DOI: 10.15514/ispras-2022-34(4)-6
erman Arsenovich Arutyunov, S. Avdoshin
{"title":"Big Transformers for Code Generation","authors":"erman Arsenovich Arutyunov, S. Avdoshin","doi":"10.15514/ispras-2022-34(4)-6","DOIUrl":"https://doi.org/10.15514/ispras-2022-34(4)-6","url":null,"abstract":"IT industry has been thriving over the past decades. Numerous new programming languages have emerged, new architectural patterns and software development techniques. Tools involved in the process ought to evolve as well. One of the key principles of new generation of instruments for software development would be the ability of the tools to learn using neural networks. First of all, it is necessary for the tools to learn how to write code. In this work we study the ability of Transformers to generate competition level code. The main goal is to discover whether open-source Big Transformers are “naturally” good coders.","PeriodicalId":33459,"journal":{"name":"Trudy Instituta sistemnogo programmirovaniia RAN","volume":"42 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2022-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73571746","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}
引用次数: 1
Automated testing of LLVM programs with complex input data structures 具有复杂输入数据结构的LLVM程序的自动测试
Trudy Instituta sistemnogo programmirovaniia RAN Pub Date : 2022-01-01 DOI: 10.15514/ispras-2022-34(4)-4
Alexander Vladimirovich Misonizhnik, A. A. Babushkin, S. Morozov, Yu.O. Kostyukov, D. Mordvinov, D. Koznov
{"title":"Automated testing of LLVM programs with complex input data structures","authors":"Alexander Vladimirovich Misonizhnik, A. A. Babushkin, S. Morozov, Yu.O. Kostyukov, D. Mordvinov, D. Koznov","doi":"10.15514/ispras-2022-34(4)-4","DOIUrl":"https://doi.org/10.15514/ispras-2022-34(4)-4","url":null,"abstract":"Symbolic execution is a widely used approach for automatic regression test generation and bug and vulnerability finding. The main goal of this paper is to present a practical symbolic execution-based approach for LLVM programs with complex input data structures. The approach is based on the well-known idea of lazy initialization, which frees the user from providing constraints on input data structures manually. Thus, it provides us with a fully automatic symbolic execution of even complex program. Two lazy initialization improvements are proposed for segmented memory models: one based on timestamps and one based on type information. The approach is implemented in the KLEE symbolic virtual machine for the LLVM platform and tested on real C data structures — lists, binomial heaps, AVL trees, red-black trees, binary trees, and tries.","PeriodicalId":33459,"journal":{"name":"Trudy Instituta sistemnogo programmirovaniia RAN","volume":"25 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2022-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"74789126","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}
引用次数: 1
Group Cohesion for a Coaching System in Co-located Collaborative Environments 协同环境下教练系统的团队凝聚力
Trudy Instituta sistemnogo programmirovaniia RAN Pub Date : 2022-01-01 DOI: 10.15514/ispras-2022-34(3)-8
Alessandra R eyes-Flores, Carmen Mezura-Godoy, E. Benítez-Guerrero, Luis Gerardo Montané-Jiménez
{"title":"Group Cohesion for a Coaching System in Co-located Collaborative Environments","authors":"Alessandra R eyes-Flores, Carmen Mezura-Godoy, E. Benítez-Guerrero, Luis Gerardo Montané-Jiménez","doi":"10.15514/ispras-2022-34(3)-8","DOIUrl":"https://doi.org/10.15514/ispras-2022-34(3)-8","url":null,"abstract":"Technologies that support co-located collaboration must not only provide a shared workspace, but also support collaboration. From an observational study, some collaboration problems were identified in groups of people working in a system with a Tangible User Interface. Some of these problems could be identified and prevented with the support of Coaching System. This system encourages interactions between group members through Social Interventions. To develop a Coaching System, it is necessary to know the cohesion between the members of the group, in order to decide the appropriate Social Interventions. In this paper, a model is proposed to represent the social interactions that occur in a group of people when performing a task. Interactions can be analyzed to determine the degree of cohesiveness of a group and support the collaboration.","PeriodicalId":33459,"journal":{"name":"Trudy Instituta sistemnogo programmirovaniia RAN","volume":"23 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2022-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73876107","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
Wi-Fi sensing Human Detection with Kolmogorov-Wiener Filter and Gated Recurrent Neural Networks 基于Kolmogorov-Wiener滤波和门控递归神经网络的Wi-Fi传感人体检测
Trudy Instituta sistemnogo programmirovaniia RAN Pub Date : 2022-01-01 DOI: 10.15514/ispras-2022-34(2)-11
P. Shibaev, A. Chupakhin
{"title":"Wi-Fi sensing Human Detection with Kolmogorov-Wiener Filter and Gated Recurrent Neural Networks","authors":"P. Shibaev, A. Chupakhin","doi":"10.15514/ispras-2022-34(2)-11","DOIUrl":"https://doi.org/10.15514/ispras-2022-34(2)-11","url":null,"abstract":"Using Received Signal Strength Indicator (RSSI) values to detect human presence is a well-known Wi-Fi sensing technique. In this paper, an overview of existing algorithms solving the problem is considered. Two new techniques based on the discrete Kolmogorov-Wiener filter and the gated recurrent unit neural network are proposed. Human detection experiment results are presented along with algorithms' accuracy analysis.","PeriodicalId":33459,"journal":{"name":"Trudy Instituta sistemnogo programmirovaniia RAN","volume":"2 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2022-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"74818906","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
Combined method for plagiarism detection in text documents 文本文档中抄袭检测的组合方法
Trudy Instituta sistemnogo programmirovaniia RAN Pub Date : 2022-01-01 DOI: 10.15514/ispras-2022-34(1)-11
Kamil Safin, Y. Chehovich
{"title":"Combined method for plagiarism detection in text documents","authors":"Kamil Safin, Y. Chehovich","doi":"10.15514/ispras-2022-34(1)-11","DOIUrl":"https://doi.org/10.15514/ispras-2022-34(1)-11","url":null,"abstract":"There are two global approaches to the problem of searching plagiarism in the text: external and intrinsic search. The first approach implies search through an external collection of documents that could have been used for text reuse. The second approach, on the contrary, does not use any external data, but analyzes the text by itself. It is proposed to combine these two approaches to speed up the search for text plagiarism. With a large flow of documents that need to be checked, the outer corpus search system processes each document and finds plagiarised blocks in each document, if there are any. However, intrinsic search could be used to determine the fact of plagiarism. Thus, it is possible to reduce the number of documents for the expensive procedure for searching for plagiarism by the outer corpus. Moreover, in an isolated analysis of a single document, there is no need to try to find specific blocks of plagiarism, this procedure is considered as a unique indicator of the originality of the document. If the overall originality is at a low level, then this document should be sent for a more detailed and accurate check. The proposed method allows to filter texts with a high rate of originality that do not need additional verification.","PeriodicalId":33459,"journal":{"name":"Trudy Instituta sistemnogo programmirovaniia RAN","volume":"36 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2022-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81352020","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}
引用次数: 1
Research Perspectives on the Tatar language based on the LingvoDoc platform 基于LingvoDoc平台的鞑靼语研究展望
Trudy Instituta sistemnogo programmirovaniia RAN Pub Date : 2022-01-01 DOI: 10.15514/ispras-2022-34(6)-13
F. Nurieva, G. Galiullina, A. F. Yusupov
{"title":"Research Perspectives on the Tatar language based on the LingvoDoc platform","authors":"F. Nurieva, G. Galiullina, A. F. Yusupov","doi":"10.15514/ispras-2022-34(6)-13","DOIUrl":"https://doi.org/10.15514/ispras-2022-34(6)-13","url":null,"abstract":"The article discusses research perspectives on the Tatar language based on the LingvoDoc platform. Digitalization of language learning in modern linguistics allows us to move to a new level of describing the language structure. Large corpora containing millions of word forms have been created in all European languages since the 90s of the last century. Currently, this has been done not only in the Russian language, but also in many national languages of Russia such as Tatar, Bashkir, Udmurt, Mari, Moksha, Komi, etc. One of the recognized platforms in modern national linguistics is the development of the LingvoDoc virtual laboratory, created ISP RAS. This platform gives an opportunity to create, store and analyze multilayer dictionaries, language materials and dialects. The main functionality of Lingvodoc is used by more than 250 linguists who process their materials online, more than 1000 dictionaries and 300 text corpora in the national languages of the Russian Federation have already been collected. We consider the possibilities of this platform to study the Tatar language. We believe that electronic corpora allow us to solve a variety of theoretical and practical problems of the language. At present, when the Tatar literary and everyday spoken language is actively used in all fields, it is very important to make a complete description of its features, which will help create more accurate grammars and dictionaries. The relevance of the study is due to the need to use a gloss corpus of texts in the Tatar language. As modern studies in linguistics show, nowadays it is impossible to describe the state of the language without such corpora and analyze its grammatical structure, which corresponds to the world standards of modern science. The LingvoDoc platform makes it possible to process a significant amount of material in a short time and create corpora with glossing and removed homonymy based on samples of the Tatar literary, business, colloquial and dialect languages.","PeriodicalId":33459,"journal":{"name":"Trudy Instituta sistemnogo programmirovaniia RAN","volume":"1 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2022-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85649924","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
Detection of uses of disposed resources in C# source code using static analysis 使用静态分析检测c#中已处置资源的使用情况
Trudy Instituta sistemnogo programmirovaniia RAN Pub Date : 2022-01-01 DOI: 10.15514/ispras-2022-34(6)-3
Uljana Vladimirovna Tsiazhkorob, V. N. Ignatyev, A. Belevantsev
{"title":"Detection of uses of disposed resources in C# source code using static analysis","authors":"Uljana Vladimirovna Tsiazhkorob, V. N. Ignatyev, A. Belevantsev","doi":"10.15514/ispras-2022-34(6)-3","DOIUrl":"https://doi.org/10.15514/ispras-2022-34(6)-3","url":null,"abstract":"The paper is devoted to the scalable approach for the detection of uses of disposed resources in C# source code, that is based on static symbolic execution. The resulting detector is implemented as a part of an industrial SharpChecker, that performs a scalable inter-procedural path-, and context-sensitive analysis. The evaluation of the developed detector shows 70% true positive ratio allowing it to include to the standard set of detectors and provide functionality to users. The paper describes a detection algorithm that takes into account the limitations imposed by the existing infrastructure of SharpChecker, its evaluation on the set of open-source programs containing 6 mln LOC and some examples of found errors in real projects.","PeriodicalId":33459,"journal":{"name":"Trudy Instituta sistemnogo programmirovaniia RAN","volume":"32 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2022-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79924920","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
Overapproximation of the Number of Active Timers in Timed-Arc Petri Nets Using DP-Systems 用dp系统对定时弧Petri网中活动定时器数目的过逼近
Trudy Instituta sistemnogo programmirovaniia RAN Pub Date : 2022-01-01 DOI: 10.15514/ispras-2022-34(5)-12
L. W. Dworzanski
{"title":"Overapproximation of the Number of Active Timers in Timed-Arc Petri Nets Using DP-Systems","authors":"L. W. Dworzanski","doi":"10.15514/ispras-2022-34(5)-12","DOIUrl":"https://doi.org/10.15514/ispras-2022-34(5)-12","url":null,"abstract":"Timed-arcs Petri nets are a time extension of Petri nets that allows assigning clocks to tokens. System of dynamic points on a metric graph (DP-systems) is another dynamical model that is studied in discrete geometry dynamics; DP-system combines continuous time and discrete branching events and used, for example, in study of localized Gaussian wave packets scattering on thin structures. In recent works, asymptotic estimates of the growth of the number of points in dynamic systems on metric graphs were obtained. In this paper, we provide a mean to overapproximate the number of different values of timers for a subclass of timed-arc Petri nets by constructing a system of dynamic points on a metric graph and prove overapproximation of the number of timer values by the number of points in the system of dynamic points.","PeriodicalId":33459,"journal":{"name":"Trudy Instituta sistemnogo programmirovaniia RAN","volume":"53 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2022-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88979413","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
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学术官方微信