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

2020 Ivannikov Memorial Workshop, IVMEM 2020

作者： Shaikhelislamov, Danil Drobyshevskiy, Mikhail Turdakov, Denis Yatskov, Alexander Varlamov, Maksim Aivazov, Denis Moscow Russia Ivannikov Institute for System Programming Russian Academy of Sciences Moscow Russia

ISBN: (纸本)9781728190884

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

关键词： Social networking (online)

来源：评论

学校读者我要写书评

暂无评论

Make social networks clean again: Graph embedding and stacking classifiers for bot detection

Make social networks clean again: Graph embedding and stacki...

引用

2018 Conference on Information and Knowledge Management Workshops, CIKM 2018

作者： Skorniakov, Kirill Turdakov, Denis Zhabotinsky, Andrey Ivannikov Institute for System Programming Russian Academy of Sciences Moscow Institute of Physics and Technology State University Moscow Russia Ivannikov Institute for System Programming Russian Academy of Sciences National Research University Higher School of Economics Moscow Russia Ivannikov Institute for System Programming Russian Academy of Sciences Lomonosov Moscow State University Moscow Russia

The paper introduces a novel approach to the detection of social bots using ensembling of classifiers. We also studied the impact of different feature sets and demonstrated the power of graph embedding which is underused by the existing methods. The main contribution of this work is a creating of a stacking based ensemble, which effectively exploits text and graph features. Empirical evaluation proved the effectiveness of the proposed method for bots detection and showed improvement in comparison to existing solutions by 4-9 points of AUC. Copyright © CIKM 2018.

关键词： Knowledge management

来源：评论

学校读者我要写书评

暂无评论

Development of design flow for multiported register files, which includes a cell library and a compiler for SOI 0.25-μm process

引用

russian Microelectronics 2017年第1期46卷 66-73页

作者： Kirichenko, P.G. Tarasov, I.V. Scientific Research Institute for System Analysis Russian Academy of Science Moscow117218 Russia

A typical design flow for a high-performance system-on-Chip usually includes memory compilers, which are implemented by different CAD producers for a given technology. These compilers allow to create automatically all file views for a memory unit using its configuration given by a user. However, there was no memory compiler for a 0.25-micron CMOS SOI process used in some our projects. At the same time, chips we were developing in this process had a wide variety of memories including register files. We developed new design approach and patented a multiported modular bitcell. Additionally, a schematic and layout library of basic cells was created to implement register files with different number of read and write ports. This gave rise to development of design flow and a program, which generates typical file views automatically. © 2017, Pleiades Publishing, Ltd.

关键词： system-on-chip

来源：评论

学校读者我要写书评

暂无评论

Visualization of behavioral aspects of AADL-models 11

Visualization of behavioral aspects of AADL-models

引用

11th International Conference on Computer science and Information Technologies, CSIT 2017

作者： Zelenov, Sergey Buzdalov, Denis Software Engineering Department Institute for System Programming Russian Academy of Sciences Moscow Russia

ISBN: (纸本)9781538628317;9781538628300

In the paper, we describe a metamodel to represent dynamics of AADL-models. The metamodel allows to visualize step-by-step a process of models' behavioral aspects analysis. In particular, it essentially helps to debug behavioral specifications. In the paper, we consider examples of the metamodel usage to represent dynamics for the following two aspects of AADL-models: 1) simulation of a modelled system on the basis of a Behavior Annex specification;2) failure modes and effects analysis on the basis of an Error Model Annex specification. We also present a stepwise visualization tool (engine and applications for both mentioned examples) that is implemented in MASIW framework for design of modern avionics systems. © 2017 IEEE.

关键词： Visualization

来源：评论

学校读者我要写书评

暂无评论

Reconfigurable model-based test program generator for microprocessors

Reconfigurable model-based test program generator for microp...

引用

International Workshop on Variability-intensive systems Testing, Validation, and Verification

作者： Kamkin, Alexander Kornykhin, Eugene Vorobyev, Dmitry Software Engineering Department Institute for System Programming Russian Academy of Sciences Moscow Russia

ISBN: (纸本)9780769543451

Automatic generation and simulation of test programs is known to be the main means for verifying microprocessors. The problem is that test program generators for new designs are often developed from scratch with little reuse of well-tried components. State-of-the-art tools, like Genesys-Pro and RAVEN, meet the challenge by using a model-based approach, where a microprocessor model is separated from a platform-independent generation core. However, there is still a problem. Developing a microprocessor model is rather difficult and usually requires deep knowledge of the inner-core structure and interfaces. In this paper, we describe a concept of a reconfigurable test program generator being customized with the help of architecture specifications and configuration files, which describe parameters of the microprocessor subsystems (pipeline, memory, and others). The suggested approach eases the model development and makes it possible to apply the model-based testing in the early design stages when the microprocessor architecture is frequently modified. © 2011 IEEE.

关键词： Software testing

来源：评论

学校读者我要写书评

暂无评论

Runtime verification of linux kernel modules based on call interception

Runtime verification of linux kernel modules based on call i...

引用

IEEE International Conference on Software Testing, Verification and Validation

作者： Rubanov, Vladimir V. Shatokhin, Eugene A. Department of Software Engineering Institute for System Programming Russian Academy of Sciences Moscow Russia

ISBN: (纸本)9780769543420

Verification of Linux kernel modules and especially device drivers is a critically important task. However, due to the special nature of the kernel operation, it is very challenging to perform runtime analysis of particular kernel modules of interest without adverse influence on the rest of the kernel. Methods and tools for addressing this challenge are the main subject of this paper. The basic method for low-influence runtime analysis of interacting software modules is call interception. Shadow state techniques represent another method. In this paper, we discuss these methods including three different approaches to implement call interception. Conclusions are made about the most suitable ways for runtime analysis of kernel modules. Finally, we present KEDR framework, an extensible runtime analysis system for Linux kernel modules, which deploys these approaches to perform different types of analysis. The system can be used by the developers of kernel modules and, in particular, may be useful for building automated driver verification systems. © 2011 IEEE.

关键词： Linux

来源：评论

学校读者我要写书评

暂无评论

Dense subgraphs of power-law random graphs

引用

Moscow Journal of Combinatorics and Number Theory 2021年第1期10卷 1-14页

作者： Lazarev, Denis O. Kuzyurin, Nikolay N. Theoretical Computer Science Departement Ivannikov Institute for System Programming of the RAS Moscow Russian Federation

The problem of finding a maximal dense subgraph of a power-law random graph G(n, α) is considered for every value of density c ε (0, 1) and for every a ε (0,+∞). It is shown that in case α <2 a maximal c-dense subgraph has size Θ_p(n^1-α/2), in case α = 2 it is limited whp, and in case α >2 it is whp less than 4/c. © 2021 Mathematical sciences Publishers.

关键词： Graph density Maximal dense subgraph Maximal dense subgraph of random graph Poissonian model Power-law random graph

来源：评论

学校读者我要写书评

暂无评论

BinSide: Static Analysis Framework for Defects Detection in Binary Code

BinSide: Static Analysis Framework for Defects Detection in ...

引用

2020 Ivannikov Memorial Workshop, IVMEM 2020

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

ISBN: (纸本)9781728190884

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

关键词： Static analysis

来源：评论

学校读者我要写书评

暂无评论

Using Lingvodoc platform for researching genetic and areal semantic shifts: the case of Ob-Ugric basic vocabulary

Using Lingvodoc platform for researching genetic and areal s...

引用

2022 Ivannikov Open Conference, ISPRAS 2022

作者： Fedotova, Idaliya Hse University Ivannikov Institute for System Programming of the Russian Academy of Sciences Moscow Russia

ISBN: (纸本)9798350398533

Typology of semantic shifts has been in the focus of linguistic typology for the last 20 years. Emergence of cross-linguistic databases and linguistic platforms has taken the study of semantic changes to the new level, as it enlarged the sample of the languages under investigation. Yet the languages of Russia are only scarcely represented in the global databases and do not make a substantial contribution to this field. The LingvoDoc platform, which stores unique materials on the languages of Russia, upon certain enhancements can fill in this gap. © 2022 IEEE.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

Graph Neural Network for Crawling Target Nodes in Social Networks

Graph Neural Network for Crawling Target Nodes in Social Net...

引用

2022 Ivannikov Open Conference, ISPRAS 2022

作者： Lukyanov, Kirill Drobyshevskiy, Mikhail Shaikhelislamov, Danil Turdakov, Denis Ivannikov Institute for System Programming of the Russian Academy of Sciences Moscow Russia Moscow Russia

ISBN: (纸本)9798350398533

Social networks crawling is in the focus of active research the last years. One of the challenging task is to collect target nodes in an initially unknown graph given a budget of crawling steps. Predicting a node property based on its partially known neighbourhood is at the heart of a successful crawler. In this paper we adopt graph neural networks for this purpose and show they are competitive to traditional classifiers and are better for individual cases. Additionally we suggest a training sample boosting technique, which helps to diversify the training set at early stages of crawling and thus improves the predictor quality. The experimental study on three types of target set topology indicates GNN based approach has a potential in crawling task, especially in the case of distributed target nodes. © 2022 IEEE.

关键词： Graph neural networks

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：