检索结果-内蒙古大学图书馆

Ivannikov Memorial Workshop (IVMEM)

作者： Hayk Aslanyan Mariam Arutunian Grigor Keropyan Shamil Kurmangaleev Vahagn Vardanyan Russian-Armenian University Yerevan Armenia Yerevan State University Yerevan Armenia Ivannikov Institute for System Programming of the Russian Academy of Sciences Moscow Russia

ISBN: (数字)9781728190884

ISBN: (纸本)9781728190891

Software developers make mistakes that can lead to failures of a software product. One approach to detect defects is static analysis: examine code without execution. Currently, various source code static analysis tools are widely used to detect defects. However, source code analysis is not enough. The reason for this is the use of third-party binary libraries, the unprovability of the correctness of all compiler optimizations. This paper introduces BinSide : binary static analysis framework for defects detection. It does interprocedural, context-sensitive and flow-sensitive analysis. The framework uses platform independent intermediate representation and provide opportunity to analyze various architectures binaries. The framework includes value analysis, reaching definition, taint analysis, freed memory analysis, constant folding, and constant propagation engines. It provides API (application programming interface) and can be used to develop new analyzers. Additionally, we used the API to develop checkers for classic buffer overflow, format string, command injection, double free and use after free defects detection.

关键词： Conferences Static analysis Tools Software Libraries Optimization Engines

来源：评论

学校读者我要写书评

暂无评论

Boundary integral equation solving in vortex method using the Barnes-Hut/multipole algorithm

Boundary integral equation solving in vortex method using th...

引用

Ivannikov ISPRAS Open Conference (ISPRAS)

作者： Evgeniya Ryatina Ilia Marchevsky Alexandra Kolganova Bauman Moscow State Technical University Moscow Russia Bauman Moscow State Technical University Ivannikov Institute for System Programming of RAS Moscow Russia

The problem of efficient solution of the boundary integral equation arising at each time step in problems of 2D outer flow simulation by using the Vortex Particle Method is considered. It is necessary to develop an efficient approach to the corresponding linear system solving with the dense and non-symmetric matrix. For this purpose, an adaptation of the Barnes-Hut-based fast method, which has been initially developed for vortex particles velocities calculation, is suggested. The proposed modification is applied to the second-order numerical scheme with piecewise-linear solution representation since it allows considering vorticity distribution over far-placed panels, and performing integration of the local expansion coefficients over control panels that provides the satisfaction of the boundary condition in Galerkin sense. Besides the speedup effect, it does not require full matrix computation and storage, thus only about 1 % of matrix coefficients should be stored, which are calculated directly.

关键词： Linear systems Adaptation models Integral equations Boundary conditions Mathematical models Method of moments

来源：评论

学校读者我要写书评

暂无评论

On the Deductive Security of Queries to Databases with Multi-Bit Records

引用

Moscow University Computational Mathematics and Cybernetics 2018年第1期42卷 39-43页

作者： Abbas, M. M. Varnovskiy, N. P. Zakharov, V. A. Shokurov, A. V. Faculty of Computational Mathematics and Cybernetics Moscow State University Moscow Russia Institute for Information Security Issues Moscow State University Moscow Russia Ivannikov Institute for System Programming Russian Academy of Sciences Moscow Russia

One of the priority problems in the development and use of databases is that of information security. It becomes substantially more complicated when databases are implemented in cloud computing systems. In our previous paper we studied this problem for the simple case of databases with one-bit records; we offered a criterion of deductive security for queries to such databases, proved the hardness of its checking, and showed that for some classes of queries deductive security can be verified relatively easy. In this paper these results are generalized for the case of more complex databases with multi-bit records.

关键词：

来源：评论

学校读者我要写书评

暂无评论

V.A. Melnikov - The Architect of Soviet Computers and Computer systems

V.A. Melnikov - The Architect of Soviet Computers and Comput...

引用

International Conference on Computer Technology in Russia and in the Former Soviet Union (SoRuCom)

作者： Vera Karpova Leonid Karpov S. A. Lebedev Institute of Precise Mechanics and Computer Engineering Russian Academy of Sciences Moscow Russia Institute for System Programming Russian Academy of Sciences Moscow Russia

Member of the Russian Academy of Sciences Vladimir Melnikov was a disciple of the great Russian scientist, academician Sergei Lebedev, who was the founder of the national computer science, the creator of the first Soviet computers, the chief designer of computers that made up the famous BESM line (high-speed electronic computers). Since 1950, being the fifth-year student, he worked in the Academic institute of Precise Mechanics and Computer Engineering (IPMCE), where participated in the development of the first soviet electronic computer. The serial BESM version was called BESM-2, and Melnikov became the executive in charge. Later this computer was replicated in China. A significant role in the life of Melnikov was played by the creation of the transistor BESM-6 computer, on which he worked as a deputy chief designer. In 1967, this computer was put into production and was produced for 17 years. In 1969 Melnikov started the design and development of a computing system "BESM-6 pairing hardware interface" (HI-6). In 1975, during the Soviet-American space flight 'Soyuz-Apollo' the operation was carried out on the system, built on the basis of HI-6 and BESM-6, that also provided a highly automated processing of ballistic and telemetry data in the Soviet Mission Control Center. Since 1978 Melnikov began to develop a new supercomputer, which had the name 'Electronics SS BIS' and was close to the American supercomputer Cray 1 in its instruction set.

关键词： Educational institutions Awards activities Supercomputers Computer science Production

来源：评论

学校读者我要写书评

暂无评论

Lemma Functions for Frama-C: C Programs as Proofs

Lemma Functions for Frama-C: C Programs as Proofs

引用

Ivannikov ISPRAS Open Conference (ISPRAS)

作者： Grigoriy Volkov Mikhail Mandrykin Denis Efremov Faculty of Computer Science Higher School of Economics Moscow Russia Software Engineering Department Ivannikov Institute for System Programming of the Russian Academy of Sciences Moscow Russia

ISBN: (纸本)9781728112763;9781728112756

This paper describes the development of an auto-active verification technique in the Frama-C framework. We outline the lemma functions method and present the corresponding ACSL extension, its implementation in Frama-C, and evaluation on a set of string-manipulating functions from the Linux kernel. We illustrate the benefits our approach can bring concerning the effort required to prove lemmas, compared to the approach based on interactive provers such as Coq. Current limitations of the method and its implementation are discussed.

关键词： Tools Manuals Contracts Linux Kernel Economics

来源：评论

学校读者我要写书评

暂无评论

Collecting Influencers: a Comparative Study of Online Network Crawlers

arXiv

引用

arXiv 2024年

作者： Drobyshevskiy, Mikhail Aivazov, Denis Turdakov, Denis Yatskov, Alexander Varlamov, Maksim Shayhelislamov, Danil Ivannikov Institute for System Programming The Russian Academy of Sciences Moscow Russia Moscow Institute of Physics and Technology State University Moscow Russia Lomonosov Moscow State University Moscow Russia

Online network crawling tasks require a lot of efforts for the researchers to collect the data. One of them is identification of important nodes, which has many applications starting from viral marketing to the prevention of disease spread. Various crawling algorithms has been suggested but their efficiency is not studied well. In this paper we compared six known crawlers on the task of collecting the fraction of the most influential nodes of graph. We analyzed crawlers behavior for four measures of node influence: node degree, k-coreness, betweenness centrality, and eccentricity. The experiments confirmed that greedy methods perform the best in many settings, but the cases exist when they are very inefficient. © 2024, CC BY-NC-ND.

关键词： Web crawler

来源：评论

学校读者我要写书评

暂无评论

Three-step Algorithms for Detection of High Degree Nodes in Online Social Networks

Three-step Algorithms for Detection of High Degree Nodes in ...

引用

Ivannikov Memorial Workshop (IVMEM)

作者： Danil Shaikhelislamov Mikhail Drobyshevskiy Denis Turdakov Alexander Yatskov Maksim Varlamov Denis Aivazov Moscow Institute of Physics and Technology (State University) Moscow Russia Ivannikov Institute for System Programming of the Russian Academy of Sciences Moscow Russia Lomonosov Moscow State University Moscow Russia

ISBN: (数字)9781728190884

ISBN: (纸本)9781728190891

This paper considers the problem of influential users detection in online social networks. Identifying of such key entities is of interest in many areas: marketing, politics, information security, business. The degree of the node of the corresponding graph is used as a popularity indicator in this work. Network query limitation is the main challenge in discovering their structure. Therefore, our task is to detect a percentage of the highest degree network nodes under a budget restriction. We propose a three-step crawling algorithm in two versions to solve the problem. We experimentally show its efficiency at various budget limits and superiority over known crawling strategies. For example, to detect top-1% of hubs with 90% precision, one needs to crawl 5% of graph nodes in average with our 3-StepBatch algorithm. We also show that our algorithm performs well for different target set sizes, from 0.01% to 10% of the graph.

关键词： Social networking (online) Conferences Crawlers Information security Complex networks Task analysis Business

来源：评论

学校读者我要写书评

暂无评论

Collecting Influencers: A Comparative Study of Online Network Crawlers

Collecting Influencers: A Comparative Study of Online Networ...

引用

Ivannikov ISPRAS Open Conference (ISPRAS)

作者： Mikhail Drobyshevskiy Denis Aivazov Denis Turdakov Alexander Yatskov Maksim Varlamov Danil Shayhelislamov Ivannikov Institute for System Programming of the Russian Academy of Sciences Moscow Russia Moscow Institute of Physics and Technology State University Moscow Russia Lomonosov Moscow State University Moscow Russia

关键词： Crawlers Task analysis Facebook Computational complexity Diseases

来源：评论

学校读者我要写书评

暂无评论

LLM-based Interactive Code Generation: Empirical Evaluation

LLM-based Interactive Code Generation: Empirical Evaluation

引用

Ivannikov ISPRAS Open Conference (ISPRAS)

作者： Danil Shaikhelislamov Mikhail Drobyshevskiy Andrey Belevantsev Moscow Institute of Physics and Technology (State University) Moscow Russia Ivannikov Institute for System Programming of the Russian Academy of Sciences Moscow Russia Lomonosov Moscow State University Moscow Russia

ISBN: (数字)9798331526023

ISBN: (纸本)9798331526030

Recently, large language models (LLMs), those pretrained on code, have demonstrated strong capabilities in generating programs from informal natural language intent. However, LLM -generated code is prone to bugs. Developers interacting with LLMs seek trusted code and, ideally, clear indications of potential bugs and vulnerabilities. Verified code can mitigate potential business risks associated with adopting generated code. We use model-agnostic framework CodePatchLLM, an extension for LLM that utilizes Svace feedback to enhance code generation quality. We evaluate CodePatchLLM on four popular LLMs across three datasets. Our experiments show an average absolute reduction of 19.1 % in static analyzer warnings for Java across all datasets and models, while preserving pass@ 1 code generation accuracy.

关键词： Analytical models Codes Accuracy Large language models Computer bugs Natural languages programming Safety Security Reliability

来源：评论

学校读者我要写书评

暂无评论

Docmarking: Real-Time Screen-Cam Robust Document Image Watermarking

arXiv

引用

arXiv 2023年

作者： Yakushev, Aleksey Markin, Yury Obydenkov, Dmitry Frolov, Alexander Fomin, Stas Akopyan, Manuk Kozachok, Alexander Gaynov, Arthur Ivannikov Institute for System Programming of the RAS Russia Russian Federation Security Guard Service Federal Academy Russia Ministry of Defence The Russian Federation Moscow Russia

This paper focuses on investigation of confidential documents leaks in the form of screen photographs. Proposed approach does not try to prevent leak in the first place but rather aims to determine source of the leak. Method works by applying on the screen a unique identifying watermark as semi-transparent image that is almost imperceptible for human eyes. Watermark image is static and stays on the screen all the time thus watermark present on every captured photograph of the screen. The key components of the approach are three neural networks. The first network generates an image with embedded message in a way that this image is almost invisible when displayed on the screen. The other two neural networks are used to retrieve embedded message with high accuracy. Developed method was comprehensively tested on different screen and cameras. Test results showed high efficiency of the proposed approach. © 2023, CC BY-NC-ND.

关键词： Image watermarking

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：