2019 Ivannikov Memorial Workshop (IVMEM)最新文献_第2页

Automation of Open Sources Data Processing for the Security Assessment 面向安全评估的开源数据处理自动化

2019 Ivannikov Memorial Workshop (IVMEM) Pub Date : 2019-09-01 DOI: 10.1109/IVMEM.2019.00016

M. Poltavtseva, D.A. Bazarnova

引用次数: 0

Application of Anomaly Detection Methods in the Housing and Utility Infrastructure Data 异常检测方法在住房和公用设施数据中的应用

2019 Ivannikov Memorial Workshop (IVMEM) Pub Date : 2019-09-01 DOI: 10.1109/IVMEM.2019.00023

I. Shanin, S. Stupnikov, V. Zakharov

引用次数: 2

Machine Code Caching in PostgreSQL Query JIT-Compiler PostgreSQL查询jit编译器中的机器码缓存

2019 Ivannikov Memorial Workshop (IVMEM) Pub Date : 2019-09-01 DOI: 10.1109/IVMEM.2019.00009

M. Pantilimonov, R. Buchatskiy, R. Zhuykov, E. Sharygin, D. Melnik

{"title":"Machine Code Caching in PostgreSQL Query JIT-Compiler","authors":"M. Pantilimonov, R. Buchatskiy, R. Zhuykov, E. Sharygin, D. Melnik","doi":"10.1109/IVMEM.2019.00009","DOIUrl":"https://doi.org/10.1109/IVMEM.2019.00009","url":null,"abstract":"As the efficiency of main and external memory grows, alongside with decreasing hardware costs, the performance of database management systems (DBMS) on certain kinds of queries is more determined by CPU characteristics and the way it is utilized. Relational DBMS utilize diverse execution models to run SQL queries. Those models have different properties, but in either way suffer from substantial overhead during query plan interpretation. The overhead comes from indirect calls to handler functions, runtime checks and large number of branch instructions. One way to solve this problem is dynamic query compilation that is reasonable only in those cases when query interpretation time is larger than the time of compilation and optimized machine code execution. This requirement can be satisfied only when the amount of data to be processed is large enough. If query interpretation takes milliseconds to finish, then the cost of dynamic compilation can be hundreds of times more than the execution time of generated machine code. To pay off the cost of dynamic compilation, the generated machine code has to be reused in subsequent executions, thus saving the cost of code compilation and optimization. In this paper, we examine the method of machine code caching in our query JIT-compiler for DBMS PostgreSQL. The proposed method allows us to eliminate compilation overhead. The results show that dynamic compilation of queries with machine code caching feature gives a significant speedup on OLTP queries.","PeriodicalId":166102,"journal":{"name":"2019 Ivannikov Memorial Workshop (IVMEM)","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114184201","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}

引用次数: 3

Recovery of High-Level Intermediate Representations of Algorithms from Binary Code 从二进制码中恢复算法的高级中间表示

2019 Ivannikov Memorial Workshop (IVMEM) Pub Date : 2019-09-01 DOI: 10.1109/IVMEM.2019.00015

A. Bugerya, I. Kulagin, V. Padaryan, M. A. Solovev, A. Tikhonov

{"title":"Recovery of High-Level Intermediate Representations of Algorithms from Binary Code","authors":"A. Bugerya, I. Kulagin, V. Padaryan, M. A. Solovev, A. Tikhonov","doi":"10.1109/IVMEM.2019.00015","DOIUrl":"https://doi.org/10.1109/IVMEM.2019.00015","url":null,"abstract":"One of the tasks of binary code security analysis is detection of undocumented features in software. This task is hard to automate, and it requires participation of a cybersecurity expert. The way of representation of the algorithm under analysis strongly determines the analysis effort and quality of its results. Existing intermediate representations and languages are intended for use in software that either carries out optimizing transformations or analyzes binary code. Such representations and intermediate languages are unsuitable for manual data flow analysis. This paper proposes a high-level hierarchical flowchart-based representation of a program algorithm as well as an algorithm for its construction. The proposed representation is based on a hypergraph and it allows both automatic and manual data flow analysis on different detail levels. The hypergraph nodes represent functions. Every node contains a set of other nodes which are fragments. The fragment is a linear sequence of instructions that does not contain call and ret instructions. Edges represent data flows between nodes and correspond to memory buffers and registers. In the future this representation can be used to implement automatic analysis algorithms. An approach is proposed to increasing quality of the developed algorithm representation using grouping of single data flows into one flow connecting logical algorithm modules.","PeriodicalId":166102,"journal":{"name":"2019 Ivannikov Memorial Workshop (IVMEM)","volume":"114 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131275043","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

Analysis of Program Patches Nature and Searching for Unpatched Code Fragments 程序补丁性质分析及未修补代码片段搜索

2019 Ivannikov Memorial Workshop (IVMEM) Pub Date : 2019-09-01 DOI: 10.1109/IVMEM.2019.00014

Mariam Arutunian, H. Aslanyan, V. Vardanyan, V. Sirunyan, S. Kurmangaleev, S. Gaissaryan

引用次数: 3

Text Recognition on Images from Social Media 基于社交媒体图像的文本识别

2019 Ivannikov Memorial Workshop (IVMEM) Pub Date : 2019-09-01 DOI: 10.1109/IVMEM.2019.00006

M. Akopyan, O.V. Belyaeva, T.P. Plechov, D. Turdakov

引用次数: 10

Domain-Specific Language for Infrastructure as Code 作为代码的基础设施领域特定语言

2019 Ivannikov Memorial Workshop (IVMEM) Pub Date : 2019-09-01 DOI: 10.1109/IVMEM.2019.00012

Valeriya Shvetcova, O. Borisenko, M. Polischuk

{"title":"Domain-Specific Language for Infrastructure as Code","authors":"Valeriya Shvetcova, O. Borisenko, M. Polischuk","doi":"10.1109/IVMEM.2019.00012","DOIUrl":"https://doi.org/10.1109/IVMEM.2019.00012","url":null,"abstract":"With increasing number of cloud providers and offered cloud services, the need of effective deployment and portability of software application infrastructures in the cloud environments is becoming more essential. The paper provides a method of unified description and creation of infrastructures, including hardware and software requirements. It describes the developed Ansible module which deploys the required infrastructure in specified cloud environment depending on specific description. The module uses model and language of the TOSCA standard (Topology and Orchestration Specification for Cloud Applications) to describe the relevant node requirements of infrastructure and orchestration tool Ansible to deploy infrastructure in cloud environment. The paper also provides instructions to add new provider support in developed module and describes the maps between TOSCA elements and resources provided by OpenStack and Amazon. With increasing number of cloud providers and offered cloud services, the need of effective deployment and portability of software application infrastructures in the cloud environments is becoming more essential. The paper provides a method of unified description and creation of infrastructures, including hardware and software requirements. It describes the developed Ansible module which deploys the required infrastructure in specified cloud environment depending on specific description. The module uses model and language of the TOSCA standard (Topology and Orchestration Specification for Cloud Applications) to describe the relevant node requirements of infrastructure and orchestration tool Ansible to deploy infrastructure in cloud environment. The paper also provides instructions to add new provider support in developed module and describes the maps between TOSCA elements and resources provided by OpenStack and Amazon.","PeriodicalId":166102,"journal":{"name":"2019 Ivannikov Memorial Workshop (IVMEM)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124587532","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}

引用次数: 3

Constructing Hypothesis Lattices for Virtual Experiments in Data Intensive Research 数据密集型研究中虚拟实验假设格的构造

2019 Ivannikov Memorial Workshop (IVMEM) Pub Date : 2019-09-01 DOI: 10.1109/IVMEM.2019.00008

D. Kovalev, S. Stupnikov

引用次数: 1

OpenFOAM Solver Based on Regularized Hydrodynamic Equations for High Performance Computing 高性能计算中基于正则化流体动力学方程的OpenFOAM求解器

2019 Ivannikov Memorial Workshop (IVMEM) Pub Date : 2019-09-01 DOI: 10.1109/IVMEM.2019.00022

Maxim V. Shatskiy, D. Ryazanov, K. Vatutin, Michael D. Kalugin, I. Sibgatullin

引用次数: 1