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

您好，读者！请登录

内蒙古大学图书馆

首页
概况
党建
资源
服务
科研支持
- 论文收录引用证明
- 科技查新
知识产权
档案馆
帮助

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入0个字，您还可以输入200个字

全部搜索
期刊论文
图书
学位论文
标准
纸本馆藏
外文资源发现
数据库导航
超星发现

高级检索

时间限定

出版年份：

文献类型

图书期刊文献学位论文多媒体

馆藏选择

电子馆藏纸本馆藏

核心期刊

全部期刊 SCI 收录期刊 SSCI 收录期刊 EI 收录期刊 CSCD 收录期刊 CSSCI 收录期刊

语言

中文英文

文献类型

期刊文献图书学位论文标准纸本馆藏

帮助

文字说明：

T=题名（书名、题名），A=作者（责任者），K=主题词，P=出版物名称，PU=出版社名称，O=机构（作者单位、学位授予单位、专利申请人），L=中图分类号，C=学科分类号，U=全部字段，Y=年（出版发行年、学位年度、标准发布年）

检索规则说明：

AND代表“并且”；OR代表“或者”；NOT代表“不包含”；(注意必须大写,运算符两边需空一格)

检索范例：

范例一：(K=图书馆学 OR K=情报学) AND A=范并思 AND Y=1982-2016
范例二：P=计算机应用与软件 AND (U=C++ OR U=Basic) NOT K=Visual AND Y=2011-2016

分类表

所选分类

>> <<

限定检索结果

文献类型

174 篇 会议
64 篇 期刊文献
4 册 图书

馆藏范围

242 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

135 篇 工学
- 113 篇 计算机科学与技术...
- 94 篇 软件工程
- 29 篇 力学（可授工学、理...
- 20 篇 控制科学与工程
- 13 篇 机械工程
- 12 篇 信息与通信工程
- 11 篇 电气工程
- 11 篇 安全科学与工程
- 8 篇 航空宇航科学与技...
- 6 篇 电子科学与技术（可...
- 6 篇 生物工程
- 5 篇 动力工程及工程热...
- 4 篇 轻工技术与工程
- 3 篇 光学工程
- 3 篇 化学工程与技术
- 3 篇 石油与天然气工程
- 2 篇 建筑学
- 2 篇 土木工程
- 2 篇 测绘科学与技术
83 篇 理学
- 50 篇 数学
- 33 篇 物理学
- 17 篇 统计学（可授理学、...
- 10 篇 系统科学
- 6 篇 生物学
- 4 篇 化学
- 4 篇 大气科学
25 篇 管理学
- 13 篇 管理科学与工程(可...
- 11 篇 图书情报与档案管...
- 7 篇 工商管理
2 篇 经济学
- 2 篇 应用经济学
1 篇 哲学
1 篇 法学
1 篇 历史学
1 篇 农学

主题

19 篇 static analysis
12 篇 conferences
9 篇 computational mo...
7 篇 libraries
7 篇 fuzzing
7 篇 codes
7 篇 numerical models
7 篇 source coding
6 篇 registers
6 篇 programming
6 篇 numerical simula...
6 篇 software testing
6 篇 software
6 篇 testing
6 篇 mathematical mod...
6 篇 standards
5 篇 tools
5 篇 instruments
5 篇 computer archite...
5 篇 computer bugs

机构

57 篇 ivannikov instit...
36 篇 ivannikov instit...
29 篇 lomonosov moscow...
17 篇 moscow institute...
14 篇 lomonosov moscow...
12 篇 ivannikov instit...
11 篇 ivannikov instit...
9 篇 bauman moscow st...
9 篇 bauman moscow st...
8 篇 ivannikov instit...
7 篇 moscow institute...
7 篇 institute for sy...
6 篇 ivannikov instit...
5 篇 tomsk state univ...
5 篇 ivannikov instit...
5 篇 programming of t...
5 篇 lomonosov moscow...
4 篇 college of engin...
4 篇 ivannikov instit...
4 篇 mohamed bin zaye...

作者

15 篇 yevtushenko nina
12 篇 vishnyakov alexe...
11 篇 kuts daniil
10 篇 parygina darya
10 篇 fedotov andrey
8 篇 gasnikov alexand...
8 篇 burdonov igor
7 篇 logunova vlada
7 篇 marchevsky ilia
6 篇 daniil kuts
6 篇 epikhin andrey
6 篇 ilia marchevsky
6 篇 kobrin eli
6 篇 savidov georgy
6 篇 nina yevtushenko
5 篇 andrey belevants...
5 篇 borodin alexey
5 篇 alexey vishnyako...
5 篇 alexey borodin
5 篇 alexander kamkin

语言

235 篇 英文
5 篇 其他
4 篇 俄文

检索条件"机构=Institute for System Programming of RAS"

共 242 条记录，以下是71-80 订阅

全选清除本页清除全部题录导出标记到"检索档案"

详细简洁

排序：

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

来源：评论

学校读者我要写书评

暂无评论

Advanced Grammar-Based Fuzzing

Advanced Grammar-Based Fuzzing

引用

2022 Ivannikov Memorial Workshop, IVMEM 2022

作者： Sargsyan, Sevak Hakobyan, Jivan Mehrabyan, Matevos Mkoyan, Ruslan Sahakyan, Vardan Melkonyan, Vahagn Arutunian, Mariam Fahradyan, Arman Avetisyan, Arutyun Russian-Armenian University Center of Advanced Software Technologies Yerevan Armenia Programming of the RAS Ivannikov Institute for System Moscow Russia

ISBN: (数字)9781665492973

ISBN: (纸本)9781665492973

This article presents novel method for efficient fuzzing of programs accepting complex structured data. It generates input data based on formal grammar description. Data generator is periodically autoconfigured based on target programs code coverage. It means that the type of generated programs is dynamically changed to increase code coverage. Data generator uses descriptions of BNF (Backus-Naur Form) rules in ANTLR (ANother Tool for Language Recognition) platform. More than 250 languages and data formats are supported. Every rule of grammar is designed as universal pushdown automata, which allows automatically generate BNF compatible data by traversing automata. We added weights for each transition of automata to provide priority of highly efficient paths (sequence of transitions). These weights are automatically changed by fuzzing engine, which provides data generator adaptation based on the coverage of the target programs. According to experimental results, we were able to increase code coverage significantly for several widely used programs including compilers. © 2022 IEEE.

关键词： Automata theory

来源：评论

学校读者我要写书评

暂无评论

Implementation of regularized equations for the disk pump simulation problem in OpenFOAM

Implementation of regularized equations for the disk pump si...

引用

2019 Ivannikov Ispras Open Conference, ISPras 2019

作者： Stenina, Tatiana Elizarova, Tatiana Ryazanov, Daniil Ryabinkin, Eugene Ivannikov Institute for System Programming of the RAS Russia Lomonosov Moscow State University Russia Keldysh Institute of Applied Mathematics of the RAS Russia Moscow Institute of Physics and Technology Russia NRC Kurchatov Institute Russia

ISBN: (纸本)9781728160559

Creating an effective pump that is able to maintain blood circulation in a heart with appropriate medical indications is undoubtedly a crucial task. First versions of such devices are currently being created and tested on the basis of IFPM SB ras, Novosibirsk. This work is devoted to a pump numerical simulations in order to optimize parameters. Equations of viscous incompressible fluid flow are used for this purpose. Implemented numerical algorithm is based on the regularization of the initial equations, which applies a finite volume method that avoids limiting procedures and includes them controlled numerical dissipation. Calculations are carried out within open software package OpenFOAM is installed at ISP ras. Unsteady flow in the pump is studied. © 2019 IEEE.

关键词： Numerical methods

来源：评论

学校读者我要写书评

暂无评论

Adaptive Homing Sequences for Partial Weakly-initialized Observable FSMs

Adaptive Homing Sequences for Partial Weakly-initialized Obs...

引用

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

作者： Vinarskii, Evgenii Tvardovskii, Aleksandr Yevtushenko, Nina Higher School of Economics Moscow Russia Tomsk State University Tomsk Russia Ivannikov Institute for System Programming of the RAS Moscow Russia

ISBN: (纸本)9781665445030

Finite State Machine (FSM) based state identification problem is widely used for analysis of discrete event systems. A homing sequence (HS) allows to determine the current state of an FSM under investigation. An HS is known to always exist and has polynomial length with respect to the number of states for a non-initialized reduced complete deterministic FSM where for each input sequence there is exactly one output sequence and any state can be an initial state. The HS problem becomes more complex if partial, non-deterministic or weakly-initialized machines are considered;for such FSMs an HS not always exists and can be much longer when existing. In particular, it has been proven that for a complete weakly-initialized non-deterministic FSM, length of a shortest adaptive HS (AHS) can be exponential with respect to the number of FSM states but HS length was not evaluated. In this paper, we consider the HS problem for partial observable possibly non-deterministic FSMs. In particular, we suggest a criterion for the existence of an AHS for a partial observable FSM and estimate the length of a shortest AHS. © 2021 IEEE.

关键词： Automata Discrete-event systems

来源：评论

学校读者我要写书评

暂无评论

Numerical Simulation of Supersonic Jet Noise Using Open Source Software 1

引用

23rd International Conference on Computational Science, ICCS 2023

作者： Epikhin, Andrey But, Ivan Ivannikov Institute for System Programming of the RAS Moscow109004 Russia Keldysh Institute of Applied Mathematics of the RAS Moscow125047 Russia Bauman Moscow State Technical University Moscow105005 Russia

ISBN: (数字)9783031360305

ISBN: (纸本)9783031360299

The paper is devoted to the study of various numerical algorithms for calculating the flow and acoustics characteristics of supersonic jets implemented in open source software. The ideally expanded supersonic jet with parameters , is considered. A comparison of various approaches implemented in the OpenFOAM and block-structured adaptive mesh refinement framework of AMReX is conducted. Numerical algorithms for compressible gas flow implemented in pimpleCentralFoam, QGDFoam and CNS solvers are considered. Acoustic noise are calculated using the Ffowcs Williams and Hawkings analogy implemented in the libAcoustics library. Cross-validation comparison of the flow fields and acoustic characteristics is carried out. © The Author(s), under exclusive license to Springer Nature Switzerland AG 2023.

关键词： Open source software

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

A TLM-based approach to functional verification of hardware components at different abstraction levels

A TLM-based approach to functional verification of hardware ...

引用

Latin American Test Workshop, LATW

作者： Mikhail Chupilko Alexander Kamkin Institute for System Programming RAS Moscow Russia

Verification has long been recognized as an integral part of the hardware design process. When designing a system, engineers usually use various design representations and concretize them step by step up to a physical layout. At the beginning of the process, when there is much of indeterminacy, only abstract reference models are applicable to verification; when the process is close to the end, more concrete ones can be utilized. The article concerns problems of developing reusable verification systems (testbenches), which can be used to analyze different versions of the same component at different abstraction levels. We suggest an approach to construct reusable reaction checkers basing on a concept of Transaction Level Modeling (TLM). The paper includes general description of the approach, considers several particular cases, and outlines our experience.

关键词： Adaptation models Computational modeling Hardware Generators Computer architecture Detectors Time domain analysis

来源：评论

学校读者我要写书评

暂无评论

ACCOUNTING and MONITORING INFrasTRUCTURE for DISTRIBUTED COMPUTING in the ATLAS EXPERIMENT 9

ACCOUNTING and MONITORING INFRASTRUCTURE for DISTRIBUTED COM...

引用

9th International Conference "Distributed Computing and Grid Technologies in Science and Education", GRID 2021

作者： Alekseev, Aleksandr Barberis, Dario Beermann, Thomas Institute for System Programming The RAS Russia Universita di Genova INFN Via Dodecaneso 33 GenovaI-16146 Italy University of Wuppertal Germany

The ATLAS experiment uses various tools to monitor and analyze the metadata of the main distributed computing applications. One of the tools is fully based on the Unified Monitoring Infrastructure provided by the CERN-IT MonIT group. The Unified Monitoring Infrastructure uses modern and efficient open-source solutions such as Kafka, InfluxDB, ElasticSearch, Kibana and Grafana to collect, store and visualize metadata produced by data and workflow management systems. This software stack is adapted for the ATLAS experiment and allows the development of dedicated monitoring and accounting dashboards in Grafana visualization environment. The current state of the monitoring infrastructure and overview of core monitoring and accounting dashboards in the ATLAS are presented in this contribution. Copyright © 2021 for this paper by its authors. Use permitted under Creative Commons License Attribution 4.0 International (CC BY 4.0).

关键词： Metadata

来源：评论

学校读者我要写书评

暂无评论

Evaluating Length of a Shortest Adaptive Homing Sequence for Weakly Initialized FSMs

Evaluating Length of a Shortest Adaptive Homing Sequence for...

引用

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

作者： Vinarskii, Evgenii Yevtushenko, Nina Lomonosov Moscow State University Department of Computer Science Moscow Russia Ivannikov Institute for System Programming of Ras Software Engineering Deparment Moscow Russia

ISBN: (数字)9781728198996

ISBN: (纸本)9781728198996

There are many research papers devoted to the state identification problem of finite state machines (FSMs) which are widely used for analysis of discrete event systems. A deterministic complete reduced FSM always has a homing sequence (HS) but a number of non-deterministic FSMs not necessarily have a preset HS;nevertheless, those FSMs can still have an adaptive HS. Moreover, adaptive HS can be shorter than the preset. If each state can be an initial state of a complete FSM, i.e., an FSM is non-initialized, then a shortest adaptive HS (if it exists) has polynomial length in the number of FSM states. We show that it is not the case for weakly-initialized FSMs: such FSMs can have a shortest adaptive HS of exponential length in the number of FSM states/transitions. However, the experimental evaluation shows that the non-polynomial upper bound for a shortest adaptive HS was never reached for randomly generated weakly-initialized two-input FSMs. © 2020 IEEE.

关键词： Adaptive homing sequence Non-deterministic FSM weakly initialized FSM

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

全选清除本页清除全部题录导出标记到“检索档案”

共25页 << < 4 5 6 7 8 9 10 11 12 13 > >>

检索报告对象比较合并检索0

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

电话和邮箱必须正确填写，我们会与您联系确认。

联系人：

所在院系：

联系邮箱：

联系电话：

内蒙古自治区呼和浩特市赛罕区大学西街235号邮编: 010021

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：