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

13th Multiconference on control Problems, MCCP 2020

作者： Bychkov, I.V. Ruzhnikov, G.M. Fedorov, R.K. Popova, A.K. Matrosov Institute for System Dynamics and Control Theory Sb Ras Irkutsk Russia

Forest is the most important natural resource of the Baikal natural territory (BNT), which ensures sustainable development of the ecological system of the Lake Baikal, performing water protection, soil protection and water regulation functions. The article describes the issues of transition to a new technological order - the creation of a digital monitoring platform to support the rational use of forests. We formulate characteristics of the current state of forests and analyze the problems of forest resources monitoring in the BNT. We consider the types of digital platforms of different levels and propose basic requirements for forest digital monitoring. © Published under licence by IOP Publishing Ltd.

关键词： Lakes

来源：评论

学校读者我要写书评

暂无评论

On Exact Multidimensional Solutions to a Nonlinear system of Fourth-Order Hyperbolic Equations

引用

Journal of Applied and Industrial Mathematics 2021年第2期15卷 253-260页

作者： Kosov, A.A. Semenov, E.I. Tirskikh, V.V. Matrosov Institute of System Dynamics and Control Theory Irkutsk664033 Russia Irkutsk State Transport University Irkutsk664074 Russia

Abstract: We study the system of two fourth-order nonlinear hyperbolic partial differentialequations. The right-hand sides of the equations contain double Laplace operators and the squaresof the gradients of the sought functions. Such equations, close to the Boussinesq equation and theNavier–Stokes equations, occur in problems of hydrodynamics. We propose to search for a solutionin the form of an ansatz containing quadratic dependence on the spatial variables and arbitraryfunctions of time. The use of the ansatz allows us to decompose the process of finding thecomponents of the solution depending on the space variables and time. For finding the dependenceon the space variables, it is necessary to solve an algebraic system of matrix, vector, and scalarequations. We find the general solution to this system in parametric form. In finding thetime-dependent components of the solution to the original system, there arises a system ofnonlinear ordinary differential equations. In the particular case when the squares of the gradientsare not included in the system, we establish the existence of exact solutions of a certain kind tothe original system expressed through arbitrary harmonic functions of the space variables andexponential functions of time. Some examples are given of the constructed exact solutionsincluding solutions periodic in time and anisotropic in space variables. The exact solutions can beused to verify numerical methods for the approximate construction of the solutions to appliedboundary value problems. © 2021, Pleiades Publishing, Ltd.

关键词： Ordinary differential equations

来源：评论

学校读者我要写书评

暂无评论

The sphere packing problem into bounded containers in three-dimension non-Euclidean space

引用

IFAC-PapersOnLine 2018年第32期51卷 782-787页

作者： Kazakov, A.L. Lempert, A.A. Ta, T.T. Matrosov Institute for System Dynamics and Control Theory SB RAS Irkutsk Russia Irkutsk National Research Technical University Irkutsk Russia

This paper deals with the problem of optimal packing a given number of equal spheres into different closed sets. We consider the problem both in three-dimensional Euclidean and non-Euclidean spaces. The special algorithm based on optical-geometric approach is suggested and implemented. This approach is previously used only for packing circles in two-dimensional space. Numerical results are presented and discussed. © 2018

关键词： Spheres

来源：评论

学校读者我要写书评

暂无评论

Implementation of a brute force attack on the A5/1 keystream generator in a GPU-based volunteer computing project 3

Implementation of a brute force attack on the A5/1 keystream...

引用

3rd International Conference BOINC-Based High Performance Computing: Fundamental Research and Development, BOINC:FAST 2017

作者： Bulavintsev, Vadim Semenov, Alexander Zaikin, Oleg Matrosov Institute for System Dynamics and Control Theory SB RAS Irkutsk Russia

We present an advanced brute force attack on the A5/1 keystream generator, that is still widely used in modern GSM networks. To greatly reduce the search space, we use a well-known idea, introduced by R. Anderson more than 20 years ago. The main contribution of the present paper is the implementation of Anderson's attack on a GPU platform in bit-slice technique. The preliminary estimates of the attack's speed showed that, with the use of GPUs processing power, the attack could be performed in the real time on a modern computer cluster or in a volunteer computing project. To verify our estimates with the use of the BOINC technology we launched a volunteer computing project and executed our variant of Anderson's attack within it. As a result, 10 A5/1 cryptanalysis problems were solved in 7 days in the project. The results presented in this work provide yet another proof of A5/1's cryptographic weakness that shows that this generator is totally unsuitable for transmission of any kind of sensitive data through modern GSM networks. Copyright © by the paper's authors. Copying permitted for private and academic purposes.

关键词： Graphics processing unit

来源：评论

学校读者我要写书评

暂无评论

An Improved SAT-Based Guess-and-Determine Attack on the Alternating Step Generator 20th

An Improved SAT-Based Guess-and-Determine Attack on the Alte...

引用

20th International Conference on Information Security, ISC 2017

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

ISBN: (纸本)9783319696584

In this paper, we propose an algorithm for constructing guess-and-determine attacks on keystream generators and apply it to the cryptanalysis of the alternating step generator (ASG) and two its modifications (MASG and MASG0). In a guess-and-determine attack, we first "guess" some part of an initial state and then apply some procedure to determine, if the guess was correct and we can use the guessed information to solve the problem, thus performing an exhaustive search over all possible assignments of bits forming a chosen part of an initial state. We propose to use in the "determine" part the algorithms for solving Boolean satisfiability problem (SAT). It allows us to consider sets of bits with nontrivial structure. For each such set it is possible to estimate the runtime of a corresponding guess-and-determine attack via the Monte-Carlo method, so we can search for a set of bits yielding the best attack via a black-box optimization algorithm augmented with several SAT-specific features. We constructed and implemented such attacks on ASG, MASG, and MASG0 to prove that the constructed runtime estimations are reliable. We show, that the constructed attacks are better than the trivial ones, which imply exhaustive search over all possible states of the control register, and present the results of experiments on cryptanalysis of ASG and MASG/MASG0 with total registers length of 72 and 96, which have not been previously published in the literature. © 2017, Springer International Publishing AG.

关键词： Monte Carlo methods

来源：评论

学校读者我要写书评

暂无评论

Analysis of service calls for construction of the semantic network of services 1

Analysis of service calls for construction of the semantic n...

引用

1st Scientific-Practical Workshop on Information Technologies: Algorithms, Models, systems, ITAMS 2018

作者： Fedorov, Roman K. Shumilov, Alexander S. Voskoboynikov, Mikhail L. Matrosov Institute for System Dynamics and Control Theory SB RAS Irkutsk Russia

The paper proposes a method for obtaining the missing information in the construction of a semantic network, based on the analysis of statistical data about the service use by users. The advantage of the method is that the semantic connection between the two services is confirmed by a workable example demonstrating the transfer of data from one service to another. In addition, together with the semantic network, we obtain the connectivity of the parameters by the data, the possible values of the parameters, the frequency characteristics of users' use of services and their compositions, the time of the services execution, etc. © 2018 CEUR-WS. All rights reserved.

关键词： Data transfer

来源：评论

学校读者我要写书评

暂无评论

On Solving Bilevel Optimization Problems with a Nonconvex Lower Level: The Case of a Bimatrix Game 20th

On Solving Bilevel Optimization Problems with a Nonconvex Lo...

引用

20th International Conference on Mathematical Optimization theory and Operations Research, MOTOR 2021

作者： Orlov, A.V. Matrosov Institute for System Dynamics and Control Theory of SB of RAS Irkutsk Russia

ISBN: (纸本)9783030778750

This paper addresses the optimistic statement of one class of bilevel optimization problems (BOPs) with a nonconvex lower level. Namely, we study BOPs with a convex quadratic objective function at the upper level and with a bimatrix game at the lower level. It is known that the problem of finding a Nash equilibrium point in a bimatrix game is equivalent to the special nonconvex optimization problem with a bilinear structure. Nevertheless, we can replace such a lower level with its optimality conditions and transform the original bilevel problem into a single-level nonconvex optimization problem. Then we apply the original Global Search theory (GST) for general D.C. optimization problems and the Exact Penalization theory to the resulting problem. After that, a special method of local search, which takes into account the structure of the problem under consideration, is developed. © 2021, Springer Nature Switzerland AG.

关键词： Local search (optimization)

来源：评论

学校读者我要写书评

暂无评论

Analysis of comparative effectiveness of state-of-the-art heuristics for CDCL SAT solvers 1

Analysis of comparative effectiveness of state-of-the-art he...

引用

1st International Workshop on Advanced Information and Computation Technologies and systems, AICTS 2020

作者： Kochemazov, Stepan Matrosov Institute for System Dynamics and Control Theory SB RAS Irkutsk Russia

The Conflict-Driven Clause Learning algorithms for solving the Boolean satisfiability problem comprise the major part of the methods used to solve various instances of the problems that arise in industry and science. In recent years there have been proposed several major heuristics for these algorithms which are assumed to be de facto good for the solvers' performance over diverse sets of benchmarks. The goal of this paper is to evaluate the contribution of each separate heuristic to the performance of a state-of-the-art solver, see the extent to which they are beneficial, and figure out if the heuristics have any particular features that need to be taken into account. © 2021 for this paper by its authors. Use permitted under Creative Commons License Attribution 4.0 International (CC BY 4.0).

关键词： Benchmarking

来源：评论

学校读者我要写书评

暂无评论

A domain-specific language for transformation models 1

A domain-specific language for transformation models

引用

1st Scientific-Practical Workshop on Information Technologies: Algorithms, Models, systems, ITAMS 2018

作者： Dorodnykh, Nikita O. Yurin, Alexandr Yu. Matrosov Institute for System Dynamics and Control Theory SB RAS Irkutsk Russia

The efficiency of the intelligent systems engineering on the basis of conceptual models can be improved through the use of specialized languages. The paper describes a domain-specific language designed for describing transformation models namely Transformation Model Representation Language (TMRL). The descriptions of the basic language constructions, as well as comparison with analogues, are given. © 2018 CEUR-WS. All rights reserved.

关键词： Intelligent systems

来源：评论

学校读者我要写书评

暂无评论

Algorithm for improvement of digital terrain models represented by triangulations 1

Algorithm for improvement of digital terrain models represen...

引用

1st Scientific-Practical Workshop on Information Technologies: Algorithms, Models, systems, ITAMS 2018

作者： Hmelnov, Alexei E. Hmelnova, Tatiana F. Matrosov Institute for System Dynamics and Control Theory SB RAS Irkutsk Russia

When constructing a digital terrain model from the available vector data, iso-lines (relief contour lines) are used as the main source of information. Also the maps may contain the point elevation marks. To obtain the relief model, the algorithms for construction of constrained Delaunay triangulations are used, which take the contour lines as the hard edges (constraints). The algorithms may produce the artefacts – horizontal "steps consisting of triangles with all the three vertices lying on isolines of the same height. These "steps"appear, both on the ridges, and in the valleys when the neighboring isolines are located sufficiently far apart from each other. The article considers the algorithms for elimination of the horisontal triangle artefacts. The proposed algorithm is based upon adding to the triangulation the edges of the approximation of the skeleton (mid-line) of the horizontal triangle groups. To calculate the heights of the added points, a greedy algorithm is used, and we prove its optimality according to the criterion of minimizing the maximum gradient of the added edges. © 2018 CEUR-WS. All rights reserved.

关键词： Triangulation

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：