Trudy Instituta sistemnogo programmirovaniia RAN最新文献

筛选
英文 中文
Approaches for improving the efficiency of protected OS components fuzzing 提高受保护操作系统组件模糊检测效率的方法
Trudy Instituta sistemnogo programmirovaniia RAN Pub Date : 2022-01-01 DOI: 10.15514/ispras-2022-34(4)-2
V. V. Egorova, A. S. Panov, V. Y. Telezhnikov, P. N. Devyanin
{"title":"Approaches for improving the efficiency of protected OS components fuzzing","authors":"V. V. Egorova, A. S. Panov, V. Y. Telezhnikov, P. N. Devyanin","doi":"10.15514/ispras-2022-34(4)-2","DOIUrl":"https://doi.org/10.15514/ispras-2022-34(4)-2","url":null,"abstract":"Fuzzing as a part of the continuous integration is a necessary tool, aimed primarily at the providing confidence in the software being developed. At the same time, in the presence of significant amounts of the source code, fuzzing becomes a resource-intensive task. That’s why increasing the efficiency of fuzzing to reach needed code sections more quickly without reducing quality becomes an important line of research. The article deals with approaches to improve the efficiency of fuzzing both for kernel and for user-space software. On the other hand, on these amounts of program code, static code analysis produces a huge number of warnings about possible errors, and the main resources within this type of analysis are required not to obtain to result, but for analytical processing. In this regard, in the article considerable attention is paid to the approach of correlating the results of static and dynamic code analysis using the developed tool, which also allows to implement directed fuzzing in order to confirm the warnings of static analyzer, which significantly increases the efficiency of testing components of the protected OS Astra Linux.","PeriodicalId":33459,"journal":{"name":"Trudy Instituta sistemnogo programmirovaniia RAN","volume":"22 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2022-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89671475","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
Requirements traceability as the basis for designing a functional and logical architecture of a software system 需求可追溯性是设计软件系统的功能和逻辑架构的基础
Trudy Instituta sistemnogo programmirovaniia RAN Pub Date : 2022-01-01 DOI: 10.15514/ispras-2022-34(1)-2
B. Pozin, G. Tsiperman
{"title":"Requirements traceability as the basis for designing a functional and logical architecture of a software system","authors":"B. Pozin, G. Tsiperman","doi":"10.15514/ispras-2022-34(1)-2","DOIUrl":"https://doi.org/10.15514/ispras-2022-34(1)-2","url":null,"abstract":"The paper deals with the formation and transformation of stakeholder requirements for the information system throughout the entire life cycle. It is shown how the seamless architecture provides traceability of requirements from the level of the business process, to the functional and logical architectures of systems, to the selection of criteria and identification of microservices. It is shown how maintaining the traceability of requirements in the presence of business, functional and logical architecture models can reduce the cost of planning complex functional and load testing of systems, as well as ensure the interaction of operation, maintenance services and contractors that form the entire system, maintain its integrity during the life cycle.","PeriodicalId":33459,"journal":{"name":"Trudy Instituta sistemnogo programmirovaniia RAN","volume":"6 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2022-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86434847","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
Modification of the Method for Calculating Polygenic Risks With Variation Graph 用变异图计算多基因风险方法的改进
Trudy Instituta sistemnogo programmirovaniia RAN Pub Date : 2022-01-01 DOI: 10.15514/ispras-2022-34(2)-15
O. Kondrateva, E. Karpulevich
{"title":"Modification of the Method for Calculating Polygenic Risks With Variation Graph","authors":"O. Kondrateva, E. Karpulevich","doi":"10.15514/ispras-2022-34(2)-15","DOIUrl":"https://doi.org/10.15514/ispras-2022-34(2)-15","url":null,"abstract":"Representation of the DNA sequence is possible in various ways. The variation graph is one of the most accurate methods that allows you to work with atypical areas and take into account all their diversity. Based on this data structure and the polygenic risk assessment method, a DNA interpretation system was built. As a result, a correlation coefficient was obtained between the path in the column responsible for a specific DNA sequence and the feature. We then compared it with a coefficient obtained by a similar method but using sequence representation using a reference genome. Such a comparison helped to evaluate the effectiveness of the representation in the form of a graph. After that, a modified method for calculating the polygenic score on the alignment data of the vg tool was built, which was also compared with existing methods. The modified method showed an improvement in the prediction of the trait.","PeriodicalId":33459,"journal":{"name":"Trudy Instituta sistemnogo programmirovaniia RAN","volume":"3 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2022-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87199894","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
Methods and techniques to automatic entity linking in Russian 俄文实体自动链接的方法与技术
Trudy Instituta sistemnogo programmirovaniia RAN Pub Date : 2022-01-01 DOI: 10.15514/ispras-2022-34(4)-13
A. Mezentseva, E. Bruches, Tatiana Batura
{"title":"Methods and techniques to automatic entity linking in Russian","authors":"A. Mezentseva, E. Bruches, Tatiana Batura","doi":"10.15514/ispras-2022-34(4)-13","DOIUrl":"https://doi.org/10.15514/ispras-2022-34(4)-13","url":null,"abstract":"Nowadays, there is a growing interest in solving NLP tasks using external knowledge storage, for example, in information retrieval, question-answering systems, dialogue systems, etc. Thus it is important to establish relations between entities in the processed text and a knowledge base. This article is devoted to entity linking, where Wikidata is used as an external knowledge base. We consider scientific terms in Russian as entities. Traditional entity linking system has three stages: entity recognition, candidates (from knowledge base) generation, and candidate ranking. Our system takes raw text with the defined terms in it as input. To generate candidates we use string match between terms in the input text and entities from Wikidata. The candidate ranking stage is the most complicated one because it requires semantic information. Several experiments for the candidate ranking stage with different models were conducted, including the approach based on cosine similarity, classical machine learning algorithms, and neural networks. Also, we extended the RUSERRC dataset, adding manually annotated data for model training. The results showed that the approach based on cosine similarity leads to better results compared to others and doesn’t require manually annotated data. The dataset and system are open-sourced and available for other researchers.","PeriodicalId":33459,"journal":{"name":"Trudy Instituta sistemnogo programmirovaniia RAN","volume":"13 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2022-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"90760240","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
Detecting Influential Users in Social Networks Based on Bipartite Comments Graph 基于二部评论图的社交网络影响力用户检测
Trudy Instituta sistemnogo programmirovaniia RAN Pub Date : 2022-01-01 DOI: 10.15514/ispras-2022-34(5)-8
R. Pastukhov, Mikhail Drobyshevskiy, D. Turdakov
{"title":"Detecting Influential Users in Social Networks Based on Bipartite Comments Graph","authors":"R. Pastukhov, Mikhail Drobyshevskiy, D. Turdakov","doi":"10.15514/ispras-2022-34(5)-8","DOIUrl":"https://doi.org/10.15514/ispras-2022-34(5)-8","url":null,"abstract":"With the development of online social networks, the task of identifying users who have a great influence on other participants in social networks is becoming increasingly important. An important source of information is user comments on content created by other users. The paper proposes a method for determining influence based on a bipartite user-comment-content graph. It incorporates information about text messages and the reactions of other users to them. In addition, we propose a method for identifying user communities in such a graph based on common interests. Experiments on data collections from VKontakte and YouTube networks show the correlation between user activity and influence, however, the most active commenters are not necessarily the most influential. Community analysis shows a positive correlation between the size of a community, the number of most influential users in it, and the average influence of community users.","PeriodicalId":33459,"journal":{"name":"Trudy Instituta sistemnogo programmirovaniia RAN","volume":"6 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2022-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79273876","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
Large-scale scientific data and long-term data storage function in a computing center 计算中心的大规模科学数据和长期数据存储功能
Trudy Instituta sistemnogo programmirovaniia RAN Pub Date : 2022-01-01 DOI: 10.15514/ispras-2022-34(4)-9
Dmitry Vladimirovich Ivankov
{"title":"Large-scale scientific data and long-term data storage function in a computing center","authors":"Dmitry Vladimirovich Ivankov","doi":"10.15514/ispras-2022-34(4)-9","DOIUrl":"https://doi.org/10.15514/ispras-2022-34(4)-9","url":null,"abstract":"Long-term data storing is an important task for many modern scientific laboratories and datacenters. In order to reduce cost of digital information ownership, some solutions use magnetic tape technology and special software to control medium and data. Considering the on-site infrastructure specifics and well-established workflows of data processing, these organizations build and support such systems mainly by their own efforts, what becomes an important task in seeking to acquire the technological sovereignty. This paper describes long-term data storage issues in the computing center of the Zababakhin All-Russia Research Institute of Technical Physics where mathematical modeling computations generate vast amount of scientific data. The architecture and functional composition of the developed Archive Data Storage System are given as well as its internal data model, the chunk grouping rules, and the low-level tape format used. The measures taken to ensure an archived data consistency, methods of storage media management and issues of archival fund maintenance, are also considered. The calculation scheme of a typical archive system site’s hardware configuration, sufficient to process archiving data flows existing in datacenter, is given.","PeriodicalId":33459,"journal":{"name":"Trudy Instituta sistemnogo programmirovaniia RAN","volume":"15 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2022-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82649254","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
JIT-aware DBMS planner configuration 支持jit的DBMS规划器配置
Trudy Instituta sistemnogo programmirovaniia RAN Pub Date : 2022-01-01 DOI: 10.15514/ispras-2022-34(4)-8
Egor Viktorovich Dolgodvorov, R. Buchatskiy, M. Pantilimonov, D. Melnik
{"title":"JIT-aware DBMS planner configuration","authors":"Egor Viktorovich Dolgodvorov, R. Buchatskiy, M. Pantilimonov, D. Melnik","doi":"10.15514/ispras-2022-34(4)-8","DOIUrl":"https://doi.org/10.15514/ispras-2022-34(4)-8","url":null,"abstract":"Dynamic compilation of certain operator compositions might have a drastic impact on overall query performance, but not be considered during optimal query plan selection by DBMS planner due to lack of knowledge. To tackle this problem, we propose to extend cost model with criteria that make dynamic compilation overhead relevant. The necessity to set up the optimizer criteria is due to the fact that the properties of various execution models impose restrictions on the efficiency of query plan execution using certain operator nodes. For example, the push-model used in the dynamic compiler is advantageous when executing queries using sequential scan. So, dynamic compilation makes sequential scan more efficient than index scan. Using index nodes in such a plan makes the value of the dynamic compilation method diminishing. To overcome these problems, it is proposed to configure the DBMS optimizer, so that it evaluates and takes into account the efficiency of using certain types of nodes when building a query plan with its subsequent dynamic compilation. This paper discusses the modification of the PostgreSQL planner to select the most efficient query execution plan based on hardware characteristics and the execution model of operator nodes with interpretation or compilation.","PeriodicalId":33459,"journal":{"name":"Trudy Instituta sistemnogo programmirovaniia RAN","volume":"26 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2022-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89411298","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
Usability Evaluation of Brain Computer Interfaces: Analysis of State of Art 脑机接口的可用性评估:现状分析
Trudy Instituta sistemnogo programmirovaniia RAN Pub Date : 2022-01-01 DOI: 10.15514/ispras-2022-34(3)-10
Yoselyn Nohemí Ortega-Gijón, Carmen Mezura-Godoy
{"title":"Usability Evaluation of Brain Computer Interfaces: Analysis of State of Art","authors":"Yoselyn Nohemí Ortega-Gijón, Carmen Mezura-Godoy","doi":"10.15514/ispras-2022-34(3)-10","DOIUrl":"https://doi.org/10.15514/ispras-2022-34(3)-10","url":null,"abstract":"Brain Computer Interfaces – BCI allow users to communicate with the software system through cognitive functions measurable by brain signals, identified as Electroencephalography – EEG. User tests have been the most used method for usability evaluation of BCI software applications. In user tests, the data collected comes from the opinions of users through questionnaires, these tests require a lot of time, since they include not only performing interaction task and the application of the questionnaires, but also include placing and calibrating the EEG device. All this makes the evaluation process a very heavy task for the participants of the test and can mean that the data collected is not entirely reliable. That is why we are interested in including EEG signals in the usability evaluation process of applications with BCI software applications. Therefore, we present in this paper the result of the analysis of state of art in order to identify the relevant works in the area and future lines of research.","PeriodicalId":33459,"journal":{"name":"Trudy Instituta sistemnogo programmirovaniia RAN","volume":"50 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2022-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85711165","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
Methods for determining the elements of the PQRST-complex of the electrocardiogram 心电图pqrst复合物元素的测定方法
Trudy Instituta sistemnogo programmirovaniia RAN Pub Date : 2022-01-01 DOI: 10.15514/ispras-2022-34(4)-16
Olga Anatolyevna Mashkova, Vsevolod Vladislavovich Shaklein, Y. Markin, E. Karpulevich, V. Ananev, A. Asatryan, Shagane Tigranovna Tigranyan, Sergej Nikolaevich Skorik, Denis Yuryevich Turdakov
{"title":"Methods for determining the elements of the PQRST-complex of the electrocardiogram","authors":"Olga Anatolyevna Mashkova, Vsevolod Vladislavovich Shaklein, Y. Markin, E. Karpulevich, V. Ananev, A. Asatryan, Shagane Tigranovna Tigranyan, Sergej Nikolaevich Skorik, Denis Yuryevich Turdakov","doi":"10.15514/ispras-2022-34(4)-16","DOIUrl":"https://doi.org/10.15514/ispras-2022-34(4)-16","url":null,"abstract":"An electrocardiogram (ECG) is one of the most common medical examinations. High-quality interpretation of a 12-channel electrocardiogram is important for subsequent diagnosis and treatment. One of the important steps in deciphering an ECG is to determine the boundaries of the elements of the PQRST complex. The article discusses mathematical methods for determining the boundaries of the P, T waves and the QRS complex, as well as the R, P and T peaks, presents the shortcomings of mathematical methods for determining the elements of the PQRST complex. And also the values ​​of the metrics obtained as a result of training the neural network segmentation model of the PQRST-complex are given. The experiments performed show the relevance of using neural network and combined approaches to the analysis of the PQRST complex.","PeriodicalId":33459,"journal":{"name":"Trudy Instituta sistemnogo programmirovaniia RAN","volume":"69 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2022-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79922927","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
Exploring the application of neural networks for facial image reconstruction in recognition systems 探索神经网络在人脸图像重建识别系统中的应用
Trudy Instituta sistemnogo programmirovaniia RAN Pub Date : 2022-01-01 DOI: 10.15514/ispras-2022-34(6)-8
Evgeny Igorevich Markin, V. Zuparova, A. Martyshkin
{"title":"Exploring the application of neural networks for facial image reconstruction in recognition systems","authors":"Evgeny Igorevich Markin, V. Zuparova, A. Martyshkin","doi":"10.15514/ispras-2022-34(6)-8","DOIUrl":"https://doi.org/10.15514/ispras-2022-34(6)-8","url":null,"abstract":"Identifying a person in a digital image using computer vision is a crucial aspect of this field. The presence of external objects, such as medical masks that cover part of the face, can drastically reduce recognition accuracy and increase errors from 5% to 50%, depending on the algorithm. This paper investigates the use of neural networks, in particular the generative adversarial network (GAN), to solve the problem of reconstructing an image of a face covered by a medical mask to improve face recognition accuracy.","PeriodicalId":33459,"journal":{"name":"Trudy Instituta sistemnogo programmirovaniia RAN","volume":"6 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2022-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79152564","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学术文献互助群
群 号:604180095
Book学术官方微信