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

2024 ivannikov Memorial Workshop, IVMEM 2024

作者： Kopylov, Daniil Mikhaylov, Andrey Matrosov Institute for System Dynamics and Control Theory of Siberian Branch of the Russian Academy of Sciences Irkutsk Russia Ivannikov Institute for System Programming of the Russian Academy of Sciences Moscow Russia

ISBN: (纸本)9798331504663

Bottom-up segmentation approaches, where words are combined into lines, lines into paragraphs, etc., are well-known nowadays. In this work, we use this principle for classification of segments. The features of the blocks that make up a segment and their relationships can be sufficient for classification. Our approach combines a specific choice of features that increases explainability by employing the generalizing ability of neural networks. This work presents an intermediate result, but, nevertheless, the 0.793 classification accuracy on the part of PubLayNet indicates the competitive potential of the approach. It is expected that, similar to the transition from MLP to CNN for MNIST, the transition from vector representation at our stage to GCN at the planned stage will allow us to achieve good results in document classification. © 2024 IEEE.

关键词： Graph neural networks

来源：评论

学校读者我要写书评

暂无评论

Verifying cryptographic protocols by Tamarin Prover

Verifying cryptographic protocols by Tamarin Prover

引用

2020 ivannikov Memorial Workshop, IVMEM 2020

作者： Vinarskii, Evgenii Demakov, Alexey Kamkin, Alexander Yevtushenko, Nina Moscow Institute of Physics and Technology Higher School of Economics Ivannikov Institute for System Programming of the Ras Lomonosov Moscow State University Moscow Russia

ISBN: (纸本)9781728190884

Cryptographic protocols are utilized for establishing a secure session between 'honest' agents which communicate strictly according to the protocol rules as well as for ensuring the authenticated and confidential transmission of messages. The specification of a cryptographic protocol is usually presented as a set of requirements for the sequences of transmitted messages including the format of such messages. Note that protocol can describe several execution scenarios. All these requirements lead to a huge formal specification for a real cryptographic protocol and therefore, it is difficult to verify the security of the whole cryptographic protocol at once. In this paper, to overcome this problem, we suggest verifying the protocol security for its fragments. Namely, we verify the security properties for a special set of so-called traces of the cryptographic protocol. Intuitively, a trace of the cryptographic protocol is a sequence of computations, value checks, and transmissions on the sides of 'honest' agents permitted by the protocol. In order to choose such set of traces, we introduce an Adversary model and the notion of a similarity relation for traces. We then verify the security properties of selected traces with Tamarin Prover. Experimental results for the EAP and Noise protocols clearly show that this approach can be promising for automatic verification of large protocols. © 2020 IEEE.

关键词： Cryptography

来源：评论

学校读者我要写书评

暂无评论

Numeric Truncation Security Predicate

Numeric Truncation Security Predicate

引用

2023 ivannikov ISPRAS Open Conference, ISPRAS 2023

作者： Mezhuev, Timofey Kobrin, Ilay Vishnyakov, Alexey Kuts, Daniil Ivannikov Institute for System Programming of the Ras Moscow Russia Lomonosov Moscow State University Moscow Russia Yandex Cloud Moscow Russia

ISBN: (纸本)9798350349993

Numeric truncation is a widely spread error in software written in languages with static data typing, such as C/C++ or Java. It occurs when the significant bits of the value with a bigger type size are truncated during value conversion to the smaller type. Utilizing one of the most powerful methods for path exploration and automated bug detection called dynamic symbolic execution (DSE), we propose the symbolic security predicate for numeric truncation error detection, developed on top of DSE tool Sydr. Firstly, we execute the program on the data, which does not lead to any errors. During program execution we update symbolic shadow stack and shadow registers to track symbolic sizes of the symbolic variables to avoid false positives. Then, if we meet the instruction, which truncates the symbolic variable, we build the security predicate, try to solve it with the SMT-solver and in case of success save new input file to reproduce the error. We tested our approach on Juliet Dynamic test suite for CWE-197 and achieved 100% accuracy. We approved the workability of our approach by detecting 12 new errors of numeric truncation in 5 different real-world open source projects within OSS-Sydr-Fuzz project. All of the errors were reported, most of the reports were equipped with appropriate fixes, successfully confirmed and applied by project maintainers. © 2023 IEEE.

关键词： Error detection

来源：评论

学校读者我要写书评

暂无评论

Numerical Schemes and Hybrid Approach for the Simulation of Unsteady Turbulent Flows

引用

Mathematical Models and Computer Simulations 2019年第6期11卷 1019-1031页

作者： Epikhin, A.S. Ivannikov Institute for System Programming Russian Academy of Sciences Moscow 109004 Russian Federation Bauman Moscow State Technical University Moscow 105005 Russian Federation

Abstract: The paper presents a brief review of computational approaches for the simulation of turbulent flows and shows that the correct calculation of large-scale vortex structures necessarily requires the use of eddy-resolving methods, while the applied numerical schemes must be stable and accurately describe the spatial evolution of vortices. The dissipative properties and stability of most numerical schemes implemented in the OpenFOAM package are analyzed by solving problems on the decay of the homogeneous isotropic turbulence and scalar transfer. It is established that the considered schemes are not suitable for correctly calculating the propagation and dissipation of vortices in space;therefore, they are refined to eliminate oscillations and maintain an acceptable level of dissipation. An algorithm for combining the URANS and LES methods using zoning of the computational domain is described and implemented. To test the implemented calculation method of unsteady turbulent flows, we simulate the flow around a maneuvering aircraft with an installed airbrake deflection. The flow patterns of the aircraft and its aerodynamic characteristics are obtained and compared with the experimental data. © 2019, Pleiades Publishing, Ltd.

关键词： airbrake deflection algorithm for the combination of URANS and LES methods buffeting eddy-resolving approaches lateral loads numerical scheme OpenFOAM software package tail fin unsteady turbulent flows

来源：评论

学校读者我要写书评

暂无评论

Homomorphic comparison methods: Technologies, challenges, and opportunities

Homomorphic comparison methods: Technologies, challenges, an...

引用

2020 International Conference Engineering and Telecommunication, En and T 2020

作者： Babenko, Mikhail Tchernykh, Andrei Golimblevskaia, Elena Pulido-Gaytan, Luis Bernardo Avetisyan, Arutyun Ivannikov Institute for System Programming Moscow Russia Cicese Research Center Ensenada Mexico South Ural State University Chelyabinsk Russia

ISBN: (纸本)9781728188294

The use of cloud computing imposes a number of restrictions related to the security and confidentiality of stored and processed data. One of the mechanisms that allows expanding the scope of public cloud services for processing personal and medical data is homomorphic encryption. Homomorphic encryption allows performing arithmetic addition and multiplication operations on encrypted data. To expand the scope of homomorphic encryption, efficient algorithms are needed to implement the operation of comparing encrypted numbers. In this paper we investigate existing algorithms of encrypted numbers comparison for homomorphic encryption schemes operating both with integers and with fixed-precision numbers. We have shown that for homomorphic integer ciphers, there are efficient algorithms for comparing encrypted numbers based on Lagrange interpolation of a function of two variables. We have shown that fixed-precision comparison of encrypted numbers is an open problem. © 2020 IEEE.

关键词： Cryptography

来源：评论

学校读者我要写书评

暂无评论

Barnes–Hut/Multipole Fast Algorithm in Lagrangian Vortex Method 49th

Barnes–Hut/Multipole Fast Algorithm in Lagrangian Vortex Me...

引用

Advanced Problem in Mechanics III - Proceedings of the 49th International Summer School-Conference "Advanced Problems in Mechanics", 2021

作者： Chernyh, Julia Marchevsky, Ilia Ryatina, Evgeniya Kolganova, Alexandra Bauman Moscow State Technical University Moscow105005 Russia Ivannikov Institute for System Programming of the Russian Academy of Sciences Moscow109004 Russia

ISBN: (纸本)9783031372452

New modification of the fast algorithm based on the Barnes–Hut (BH) and multipole (FMM) methods is developed for the problem of velocities calculation in vortex particle method. It provides a quasilinear computational complexity and allows for the accuracy flexible adjustment, similarly to the classical Barnes–Hut method. Four schemes are developed with different number of terms being hold in multipole and local expansions. All the necessary formulae are presented, expressed in terms of operations with complex numbers. If extremely high accuracy is not required, the proposed algorithm is more efficient in comparison to the traditional FMM methods. © 2023, The Author(s), under exclusive license to Springer Nature Switzerland AG.

关键词： Fast algorithm Multipoles n-body problem The barnes–hut algorithm Vortex method

来源：评论

学校读者我要写书评

暂无评论

Searching by Code: a New SearchBySnippet Dataset and SnippeR Retrieval Model for Searching by Code Snippets 30

Searching by Code: a New SearchBySnippet Dataset and SnippeR...

引用

Joint 30th International Conference on Computational Linguistics and 14th International Conference on Language Resources and Evaluation, LREC-COLING 2024

作者： Sedykh, Ivan Abulkhanov, Dmitry Sorokin, Nikita Nikolenko, Sergey Malykh, Valentin Huawei Noah's Ark Lab Canada St. Petersburg Department The Steklov Institute of Mathematics Russia Ivannikov Institute for System Programming Russia

ISBN: (纸本)9782493814104

Code search is an important and well-studied task, but it usually means searching for code by a text query. We argue that using a code snippet (and possibly an error traceback) as a query while looking for bugfixing instructions and code samples is a natural use case not covered by prior art. Moreover, existing datasets use code comments rather than full-text descriptions as text, making them unsuitable for this use case. We present a new SearchBySnippet dataset implementing the search-by-code use case based on StackOverflow data;we show that on SearchBySnippet, existing architectures fall short of a simple BM25 baseline even after fine-tuning. We present a new single encoder model SnippeR that outperforms several strong baselines on SearchBySnippet with a result of 0.451 Recall@10;we propose the SearchBySnippet dataset and SnippeR as a new important benchmark for code search evaluation. © 2024 ELRA Language Resource Association: CC BY-NC 4.0.

关键词： Information retrieval

来源：评论

学校读者我要写书评

暂无评论

Optimizing Components of Multi-Module systems Based on don't Care Input Sequences

Optimizing Components of Multi-Module Systems Based on don't...

引用

2020 IEEE East-West Design and Test Symposium, EWDTS 2020

作者： Shirokova, Ekaterina Evtushenko, Larisa Laputenko, Andrey Yevtushenko, Nina Tomsk State University Higher School of Economics Tomsk Russia Ivannikov Institute for System Programming of Ras Higher School of Economics Moscow Russia

ISBN: (数字)9781728198996

ISBN: (纸本)9781728198996

In this paper, we use a window approach when optimizing Finite State Machine (FSM) components of a multi module system. Given a window with a loop-free binary composition of complete deterministic FSMs, we construct a partial FSM for the tail component FSM such that any reduced form of this partial FSM can replace the tail component preserving the composition behaviour. There are a number of cases when using a partial network equivalent instead of the initial component FSM allows to simplify the corresponding logic circuit with respect to the number of gates and path length between primary inputs and outputs. © 2020 IEEE.

关键词： Computer circuits

来源：评论

学校读者我要写书评

暂无评论

Page Layout Analysis for Refining Table Extraction from PDF Documents

Page Layout Analysis for Refining Table Extraction from PDF ...

引用

2021 ivannikov Ispras Open Conference, ISPRAS 2021

作者： Mikhailov, Andrey Shigarov, Alexey Matrosov Institute For System Dynamics And Control Theory Siberian Branch Of The Russian Academy Of Sciences Irkutsk664033 Russia Ivannikov Institute For System Programming Russian Academy Of Sciences Moscow109004 Russia

ISBN: (纸本)9781665423304

Perhaps, PDF is the most popular format to share non-editable documents. PDF documents are often untagged. In particular, this means that positions and the cell structure of tables are not designated explicitly. PDF table detection predicts bounding boxes of tables on document pages. Some of the predictions inevitably happen to be false. This negatively affects the accuracy of table structure recognition. We argue that the page layout analysis in pre- and post-processing can refine the table detection. We suggest pre-processing algorithms for the recognition of headings, running titles, paragraphs, and images in PDF pages. This allows selecting areas of interest inside pages where real tables can be placed. Then we use deep neural networks to predict tables only in these areas. We also propose post-processing algorithms to verify predictions and filter out false table candidates after table detection. Our empirical study shows that the proposed approach reduces errors in the table detection and improve the PDF table extraction overall. © 2021 IEEE.

关键词： Extraction

来源：评论

学校读者我要写书评

暂无评论

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

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

引用

2022 ivannikov Open Conference, ISPRAS 2022

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

ISBN: (纸本)9798350398533

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. © 2022 IEEE.

关键词： Piecewise linear techniques

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：