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

arXiv 2018年

作者： Gribanova, Irina Semenov, Alexander Matrosov Institute for System Dynamics and Control Theory Sb Ras Irkutsk Russia

IN this paper we construct preimage attack on the truncated variant of the MD4 hash function. Specifically, we study the MD4-39 function defined by the first 39 steps of the MD4 algorithm. We suggest a new attack on MD4-39, which develops the ideas proposed by H. Dobbertin in 1998. Namely, the special relaxation constraints are introduced in order to simplify the equations corresponding to the problem of finding a preimage for an arbitrary MD4-39 hash value. The equations supplemented with the relaxation constraints are then reduced to the Boolean Satisfiability Problem (SAT) and solved using the state-of-the-art SAT solvers. We show that the effectiveness of a set of relaxation constraints can be evaluated using the black-box function of a special kind. Thus, we suggest automatic method of relaxation constraints generation by applying the black-box optimization to this function. The proposed method made it possible to find new relaxation constraints that contribute to a SAT-based preimage attack on MD4-39 which significantly outperforms the competition. Copyright © 2018, The Authors. All rights reserved.

关键词： Hash functions

来源：评论

学校读者我要写书评

暂无评论

Approximation results for impulsive control systems with hysteresis

Approximation results for impulsive control systems with hys...

引用

International Conference on Stability and Oscillations of Nonlinear control systems (Pyatnitskiy's Conference)

作者： O. N. Samsonyuk D. E. Tolkachev Matrosov Institute for System Dynamics and Control Theory of SB RAS Irkutsk Russia

In this paper, impulsive control systems described by measure-driven differential equations with rate independent hysteresis are considered. Approximation results for impulsive processes are presented.

关键词： Hysteresis Trajectory Differential equations Aerospace electronics system dynamics control theory

来源：评论

学校读者我要写书评

暂无评论

Methods and tools to increase fault tolerance of high-performance computing systems

Methods and tools to increase fault tolerance of high-perfor...

引用

Proceedings of the International Convention MIPRO

作者： I.A. Sidorov Matrosov Institute for System Dynamics and Control Theory of SB RAS Irkutsk Russia

This work focuses on the development of models, methods, and tools to increase a fault tolerance of high-performance computing systems. The described models and methods are based on automatic diagnostics of the basic software and hardware components of these systems, the use of automatic localization, correction of faults, and the use of automatic HPC-system reconfiguration mechanisms. The originality and novelty of the offered approach consist of creating the multi-agent system with universal software agents, capable of collecting node state data for analysis and thereby enabling the agent to make the make necessary decisions directly.

关键词： Production Random access memory Monitoring Software Hardware Fault tolerance Fault tolerant systems

来源：评论

学校读者我要写书评

暂无评论

dynamics of Bipartite Logical Networks

Dynamics of Bipartite Logical Networks

引用

Proceedings of the International Convention MIPRO

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

ISBN: (数字)9798350382501

ISBN: (纸本)9798350382518

Based on the Boolean constraints method several problems of qualitative analysis of bipartite logical networks are solved. The dynamics of the trajectories behavior of these networks is studied over a finite time interval. A method is proposed for splitting a bipartite trajectory into two independent trajectories based on deterministic block-sequential updating of the state vectors of each part. Conditions for the existence, isolation and attraction of cyclic trajectories of a given length are obtained as Boolean constraints. The solvability of such equations reduces to the well-known Boolean satisfiability problem, effectual algorithms for solving which provide dynamic analysis for systems with high dimensionality of the state vector over large discrete time intervals. The program modules implementation for building Boolean constraints and checking their feasibility in the form of microservices ensures their reuse, simplification of deployment, updating, and high scalability in the cloud environment. Multi-agent computation management in an applied microservices package provides the non-procedural problem formulation on a distributed model of the subject area, forms and executes a scheme for solving it, and automates the additional resources provision. The practical significance of the obtained results consists in providing the opportunity for a more detailed study of dynamics of the molecular features of gene regulation networks.

关键词： Computational modeling Scalability Heuristic algorithms Biological system modeling Microservice architectures Vectors Mathematical models

来源：评论

学校读者我要写书评

暂无评论

Machine learning in a multi-agent system for distributed computing management 4

Machine learning in a multi-agent system for distributed com...

引用

4th International Conference on Information Technology and Nanotechnology - Session: Data Science, DS-ITNT 2018

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

We address the relevant problem of machine learning in a multi-agent system for distributed computing management. We propose a new approach to the agent learning in the system for managing job flows of scalable applications in a heterogeneous distributed computing environment, which includes high-performance computing clusters, as its main components. We manage parameter sweep applications that execute their jobs in a virtual machine environment. We use the specialized tools to implement such environment. In contrast to the known approaches, our approach is based on the integrated applying of methods for job classification and parameter adjustment of algorithms for functioning agents. Simulation modeling the environment allows eliciting the necessary knowledge for parameter adjustment. During the learning of agents, we use the expert knowledge of environment node administrators. An example of solving the complex practical problem that relates to studying energy development directions of Russia demonstrates advantages of the proposed approach. © 2018 CEUR-WS. All rights reserved.

关键词： Multi agent systems

来源：评论

学校读者我要写书评

暂无评论

Technology for integrating idle computing cluster resources into volunteer computing projects

Technology for integrating idle computing cluster resources ...

引用

2015 5th International Workshop on Computer Science and Engineering: Information Processing and control Engineering, WCSE 2015-IPCE

作者： Afanasiev, A.P. Bychkov, I.V. Manzyuk, M.O. Posypkin, M.A. Semenov, A.A. Zaikin, O.S. Institute for System Dynamics and Control Theory SB RAS Irkutsk Russia A. A. Kharkevich Institute for Information Transmission Problems RAS Moscow Russia

In this paper we propose the technology for integrating idle computing cluster resources into volunteer computing projects. The main principles of this technology are the following: only standard cluster user rights and only idle computing cluster resources (i.e. the resources that are not employed by other cluster users) are used. We describe the CluBORun tool implementing this technology for BOINC-based volunteer computing projects. The CluBORun tool was successfully applied to boost the performance of volunteer computing projects SAT@home and OPTIMA@home.

关键词： Cluster computing

来源：评论

学校读者我要写书评

暂无评论

A GPU-enabled black-box optimization in application to dispersion-based geoacoustic inversion 8

A GPU-enabled black-box optimization in application to dispe...

引用

8th International Conference on Optimization and Applications, OPTIMA 2017

作者： Bulavintsev, Vadim Petrov, Pavel Posypkin, Mikhail Zaikin, Oleg Matrosov Institute for System Dynamics and Control Theory SB RAS Irkutsk Russia Il'Ichev Pacific Oceanological Institute FEB RAS Far Eastern Federal University Vladivostok Russia Dorodnicyn Computing Centre FRC CS RAS Moscow Russia

In this study, a GPU-enabled implementation of an algorithm for the solution of a real-life optimization problem arising in the geoacoustic inversion is proposed. In the inversion algorithm, a single-hydrophone recording of a pulse acoustic signal is used for the estimation of the waveguide parameters from the dispersion data. We devised and implemented a hierarchical optimization scheme where and efficient GPUenabled implementation of the objective function calculation is combined with the CPU implementation of the search algorithm. The GPU-enabled implementation turned out to be several dozen times faster than the pure CPU one. Exploiting this advantage we were able to successfully solve the considered problem in reasonable time. © Copyright by the paper's authors.

关键词： Graphics processing unit

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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.

关键词：

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：