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

2nd International Workshop on Information, Computation, and control systems for Distributed Environments, ICCS-DE 2020

作者： Edelev, A.V. Sidorov, I.A. Gorsky, S.A. Feoktistov, A.G. Melentiev Energy Systems Institute Lermontov St. 130 Irkutsk664033 Russia Matrosov Institute for System Dynamics and Control Theory SB RAS Lermontov St. 134 Irkutsk664033 Russia

Nowadays, determining critical components of energy systems is a relevant problem. The complexity of its solving increases significantly when it is necessary to take into account the simultaneous failures of such components. Usually, in problem-solving, processing a large number of failure variants and their consequences is required. Processing such data using traditional relational database management systems does not allow us to quickly identify the most critical components. In the paper, our successful practical experience in applying an in-memory data grid within large-scale analyzing of the energy system vulnerability is provided. The experimental analysis showed the good scalability of distributed computing and significant reduction in data processing time compared to using an open-source SQL relational database management system. In developing and applying the distributed applied software package for solving the aforementioned problem we have used the Orlando Tools framework. Within its applying, we have implemented continuous integration of the package software taking into account the preparing and processing of subject-oriented data through the in-memory data grid. Copyright © 2020 for this paper by its authors. Use permitted under Creative Commons License Attribution 4.0 International (CC BY 4.0).

关键词： Information management

来源：评论

学校读者我要写书评

暂无评论

Using Decision Diagrams of Special Kind for Compactification of Conflict Data Bases Generated by CDCL SAT Solvers

Using Decision Diagrams of Special Kind for Compactification...

引用

Proceedings of the International Convention MIPRO

作者： Victor Kondratiev Ilya Otpuschennikov Alexander Semenov Matrosov Institute for System Dynamics and Control Theory SB RAS Irkutsk Russia

ISBN: (数字)9789532330991

ISBN: (纸本)9781728153391

In the paper we propose new algorithms for constructing compact representations of databases of conflict clauses accumulated by state-of-the-art CDCL SAT solvers. These algorithms use the Decision Diagrams of a special kind (the so-called Disjunctive Diagrams). We consider several families of hard SAT instances and use them to compare the implementations of the proposed algorithms and the well-known CUDD package that uses Zero-Suppressed Binary Decision Diagrams (ZBDD) for solving similar problems. The computational experiments clearly show that our algorithm that uses Disjunctive Diagrams has better effectiveness compared to CUDD.

关键词： Databases Binary decision diagrams

来源：评论

学校读者我要写书评

暂无评论

A parallel SAT solving algorithm based on improved handling of conflict clauses

引用

Procedia Computer Science 2017年 119卷 103-111页

作者： Oleg Zaikin Matrosov Institute for System Dynamics and Control Theory SB RAS Lermontov str. 134 Irkutsk 664033 Russia

In this study, a new parallel algorithm for solving Boolean satisfiability problem (SAT) is suggested. This algorithm is based on the Conflict Driven Clause Learning (CDCL) algorithm. Given an original SAT instance, CDCL is launched on it. Some types of conflict clauses, which are produced by CDCL, are collected. Then the collected clauses are employed to construct a family of different SAT instances. In particular, each SAT instance from a family is produced by adding some subset of the collected conflict clauses to an initial set of clauses (which belong to the original instance). In order to solve the original SAT instance, it is sufficient to solve at least one SAT instance from the constructed family. The proposed algorithm was implemented in the form of a parallel SAT solver. It was compared with two high ranked state-of-the-art parallel solvers. As a test set, we used SAT instances which encode cryptanalysis of three keystream generators: summation generator, threshold generator, and Gifford generator. According to computational experiments, our solver outperforms those two solvers.

关键词： SAT CDCL parallel computing cryptanalysis keystream generator

来源：评论

学校读者我要写书评

暂无评论

Service-oriented Application for Solving Parametric Synthesis Problem of a Boolean Network with Given Dynamic Properties

Service-oriented Application for Solving Parametric Synthesi...

引用

Proceedings of the International Convention MIPRO

作者： G.A. Oparin V.G. Bogdanova A.A. Pashinin Matrosov Institute for System Dynamics and Control Theory of SB RAS Irkutsk Russia

A constructive logical method for the synthesis of the characteristic matrix of a linear binary dynamical system with a given set of one-point attractors and one-step dynamics of reaching this set from any state is proposed. The problem conditions are written as a quantified Boolean formula with subsequent verification of its truth using the QSAT solver. This solver provide the values of the elements of the required matrix as a certificate. The proposed method implementation is performed using automation tools for constructing and executing composite services in an applied microservices package for solving problems of qualitative research of binary dynamic systems. These tools provide cloud services for getting a quantified Boolean formula in QDIMACS format, verifying its truth, getting a constructive solution to the considered problem, and supporting synchronization of cloud and local data in a hybrid cloud infrastructure using Dew Computing.

关键词：

来源：评论

学校读者我要写书评

暂无评论

SAT-based search for systems of diagonal latin squares in volunteer computing project SAT@home

SAT-based search for systems of diagonal latin squares in vo...

引用

Proceedings of the International Convention MIPRO

作者： Oleg Zaikin Stepan Kochemazov Alexander Semenov Matrosov Institute for System Dynamics and Control Theory SB RAS Irkutsk Russia

In this paper we considered the problem of finding pairs of mutually orthogonal diagonal Latin squares of order 10. First we reduced it to Boolean satisfiability problem. The obtained instance is very hard, therefore we decomposed it into a family of subproblems. To solve the latter we used the volunteer computing project SAT@home. In the course of 10-month long computational experiment we managed to find 29 pairs of described kind, that are different from already known pairs. Also we considered the problem of search for triples of diagonal Latin squares of order 10 that satisfy weakened orthogonality condition. Using diagonal Latin squares from the known pairs (the most of them were found in SAT@home) we constructed new triples of proposed kind. During this computational experiment we used a computing cluster.

关键词： Distributed processing Generators Encoding Cryptography Servers Web sites

来源：评论

学校读者我要写书评

暂无评论

Modeling Agent Behavior in Interacting Microgrids

Modeling Agent Behavior in Interacting Microgrids

引用

Information Technology and Nanotechnology (ITNT), International Conference on

作者： Igor Bychkov Alexander Feoktistov Mikhail Chekan Matrosov Institute for System Dynamics and Control Theory of SB RAS Irkutsk Russia

ISBN: (数字)9798350372939

ISBN: (纸本)9798350372946

We propose the agent-based approach to intellectualize data processing and analysis in modeling the operations of interconnected microgrids. Microgrids are modern energy systems with a large share of environmentally friendly and resource-saving equipment. The modeling of different aspects for the organization and operation of microgrids is relevant for their structural and parametric optimization. The study of these aspects in the interaction of microgrids deserves special attention. In this case, it becomes possible to take into account the synergistic effect in the distribution and consumption of electric power. We implement the modeling process using a multi-agent system. In this regard, we describe the structure of this system, methods of its construction, and goals and processes of agent operations. In addition, we provide a model of agent behavior developed based on the basis of a finite-state control machine. The advantages of the proposed approach are demonstrated on a model example of balancing generation and consumption of electric power.

关键词： Supply and demand Process control Microgrids Organizations Software Social factors Regulation

来源：评论

学校读者我要写书评

暂无评论

A method of table detection in metafiles

引用

Pattern Recognition and Image Analysis 2009年第4期19卷 693-697页

作者： Shigarov, A.O. Bychkov, I.V. Ruzhnikov, G.M. Khmel'nov, A.E. Institute of System Dynamics and Control Theory Siberian Branch Russian Academy of Sciences ul. Lermontova 134 Irkutsk a/ya 292 664033 Russia

A method is proposed for the detection of statistical tables that use metafiles as input data;the latter fact allows one to apply this method to documents of different formats. In this method, the table detection process is viewed as a bottom-up segmentation of a document page, i. e., segmentation from simple elements of a page to more complicated ones. The experimental evaluation of the method shows that it is efficient as applied to a wide class of statistical tables. © 2009 Pleiades Publishing, Ltd.

关键词： Software engineering

来源：评论

学校读者我要写书评

暂无评论

HPC-based parallel software for solving applied Boolean satisfiability problems

HPC-based parallel software for solving applied Boolean sati...

引用

Proceedings of the International Convention MIPRO

作者： V.G. Bogdanova S.A. Gorsky A.A. Pashinin Matrosov Institute for System Dynamics and Control Theory of SB RAS Irkutsk Russia

ISBN: (数字)9789532330991

ISBN: (纸本)9781728153391

Boolean satisfiability is one of the fundamental problems in mathematical logic and the theory of computation. Many practical problems can be formulated as problems of Boolean satisfiability (solving a system of Boolean equations). These include the tasks of cryptography, qualitative research of binary dynamic systems, logical programming, robot action planning, and many others. NP-complexity of the Boolean satisfiability problem actualizes the development of parallel software for solving it in a high-performance computing environment. We focus on the development of specialized parallel solvers for Boolean satisfiability problems oriented to the application in the qualitative study of binary dynamic systems based on the Boolean constraint method. The Boolean constraint method uses a formal definition of the dynamical property, presented in the language of predicate logic with limited existential and universal quantifiers. Based on this definition, a model of dynamical property is formed in the form of Boolean constraints by a series of sequential formal transformations. The developed parallel solvers provide a conclusion on the feasibility of Boolean constraints, interpret this conclusion accordingly the tested property, and find, unlike similar software tools, all sets of values of Boolean variables that lead to this conclusion. An example of applying the developed solver to constructing cycles of a given length of stream ciphers based on shift registers is considered. The results confirming the effectiveness and scalability of the developed software are presented.

关键词： Scalability Tools Shift registers Dynamical systems Software tools Task analysis Robots

来源：评论

学校读者我要写书评

暂无评论

Constructing a Set of Weak Values for Full-round MD4 Hash Function

Constructing a Set of Weak Values for Full-round MD4 Hash Fu...

引用

Proceedings of the International Convention MIPRO

作者： Irina Gribanova Alexander Semenov Matrosov Institute for System Dynamics and Control Theory SB RAS Irkutsk Russia

ISBN: (数字)9789532330991

ISBN: (纸本)9781728153391

In this paper we describe the construction of a set of full-round MD4 compression function values, which are weak against the preimage attack of a special kind. The cardinality estimation for this set, obtained by using an effective probabilistic algorithm, is close to 2 32 . According to this, the fraction of weak outputs in the set of all outputs of the MD4 compression function is about $2^{-96}$. Thus, the probability to obtain an easyinvertible output by choosing a random input is significantly higher than $2^{-128}$. These results demonstrate that the full-round MD4 compression function does not have the properties of a random oracle.

关键词： Hash functions Estimation Probabilistic logic

来源：评论

学校读者我要写书评

暂无评论

Problems of stability of dynamical systems and computer algebra

引用

Journal of Mathematical Sciences 2002年第6期108卷 1094-1108页

作者： Banshchikov, A.V. Burlakova, L.A. Irtegov, V.D. Institute of System Dynamics Control Theory SB RAS Siberian Branch Russian Academy of Science Irkutsk Russian Federation

Examples of problems of motion stability solved with the help of computer algebra systems (CAS) are presented. The authors have experience in developing and applying problem-oriented systems of symbolic computations and software packages for solving problems of dynamics of multi-body systems. The algorithms under consideration are implemented (completely or partly) with the aid of up-to-date CAS. They are intended for inclusion in the "Stability" package of symbolic computation. © 2002 Plenum Publishing Corporation. © 2002 Plenum Publishing Corporation.

关键词：

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：