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

您好，读者！请登录

内蒙古大学图书馆

首页
概况
党建
资源
服务
科研支持
- 论文收录引用证明
- 科技查新
知识产权
档案馆
帮助

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入0个字，您还可以输入200个字

全部搜索
期刊论文
图书
学位论文
标准
纸本馆藏
外文资源发现
数据库导航
超星发现

高级检索

时间限定

出版年份：

文献类型

图书期刊文献学位论文多媒体

馆藏选择

电子馆藏纸本馆藏

核心期刊

全部期刊 SCI 收录期刊 SSCI 收录期刊 EI 收录期刊 CSCD 收录期刊 CSSCI 收录期刊

语言

中文英文

文献类型

期刊文献图书学位论文标准纸本馆藏

帮助

文字说明：

T=题名（书名、题名），A=作者（责任者），K=主题词，P=出版物名称，PU=出版社名称，O=机构（作者单位、学位授予单位、专利申请人），L=中图分类号，C=学科分类号，U=全部字段，Y=年（出版发行年、学位年度、标准发布年）

检索规则说明：

AND代表“并且”；OR代表“或者”；NOT代表“不包含”；(注意必须大写,运算符两边需空一格)

检索范例：

范例一：(K=图书馆学 OR K=情报学) AND A=范并思 AND Y=1982-2016
范例二：P=计算机应用与软件 AND (U=C++ OR U=Basic) NOT K=Visual AND Y=2011-2016

分类表

所选分类

>> <<

限定检索结果

文献类型

218 篇 会议
120 篇 期刊文献
1 册 图书

馆藏范围

339 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

194 篇 理学
- 119 篇 数学
- 71 篇 物理学
- 32 篇 统计学（可授理学、...
- 27 篇 系统科学
- 12 篇 化学
- 8 篇 地球物理学
- 7 篇 天文学
- 4 篇 地质学
185 篇 工学
- 117 篇 计算机科学与技术...
- 78 篇 软件工程
- 22 篇 控制科学与工程
- 20 篇 电气工程
- 18 篇 电子科学与技术（可...
- 15 篇 信息与通信工程
- 11 篇 动力工程及工程热...
- 9 篇 化学工程与技术
- 8 篇 力学（可授工学、理...
- 7 篇 土木工程
- 6 篇 材料科学与工程（可...
- 6 篇 环境科学与工程（可...
- 4 篇 机械工程
- 4 篇 建筑学
- 4 篇 水利工程
- 4 篇 农业工程
- 4 篇 安全科学与工程
43 篇 管理学
- 22 篇 管理科学与工程(可...
- 22 篇 图书情报与档案管...
- 15 篇 工商管理
4 篇 经济学
- 4 篇 应用经济学
4 篇 农学
- 4 篇 作物学
3 篇 法学
2 篇 医学

主题

8 篇 differential equ...
7 篇 software
6 篇 computational mo...
6 篇 control theory
6 篇 optimal control
6 篇 mathematical mod...
5 篇 particle dark ma...
5 篇 process control
5 篇 decision making
5 篇 biological syste...
5 篇 hysteresis
5 篇 k-means clusteri...
5 篇 monte carlo meth...
5 篇 numerical method...
4 篇 dynamical system...
4 篇 hypothetical gau...
4 篇 ontologies
4 篇 optimization
4 篇 trajectory
4 篇 control systems

机构

74 篇 matrosov institu...
37 篇 matrosov institu...
31 篇 matrosov institu...
20 篇 bogoliubov labor...
19 篇 matrosov institu...
19 篇 department of ph...
18 篇 matrosov institu...
18 篇 institute for sy...
15 篇 departamento de ...
13 篇 institut für the...
11 篇 irkutsk scientif...
11 篇 institut für the...
10 篇 of anid fernánde...
9 篇 institute for nu...
8 篇 irkutsk state un...
8 篇 matrosov institu...
8 篇 joint institute ...
8 篇 institute of sys...
7 篇 matrosov institu...
7 篇 samara universit...

作者

18 篇 zaikin oleg
17 篇 zhevlakov alexey...
17 篇 lyubovitskij val...
14 篇 kochemazov stepa...
14 篇 oparin g.a.
13 篇 bogdanova v.g.
13 篇 pashinin a.a.
12 篇 gornov alexander
11 篇 feoktistov a.g.
11 篇 alexey s. zhevla...
11 篇 valery e. lyubov...
11 篇 semenov alexande...
10 篇 fedorov roman k.
10 篇 ushakov anton v.
9 篇 gruzdeva tatiana...
9 篇 bychkov i.v.
8 篇 edelev a.v.
8 篇 bychkov igor v.
8 篇 anikin anton
7 篇 kostromin r.o.

语言

314 篇 英文
20 篇 俄文
5 篇 其他

检索条件"机构=Matrosov Institute for System Dynamics and Control Theory SB RAS"

共 339 条记录，以下是21-30 订阅

全选清除本页清除全部题录导出标记到"检索档案"

详细简洁

排序：

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

Service-oriented Application for Solving Parametric Synthesi...

引用

44th International Convention on Information, Communication and Electronic Technology, MIPRO 2021

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

ISBN: (纸本)9789532331011

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. © 2021 Croatian Society MIPRO.

关键词： Dynamical systems

来源：评论

学校读者我要写书评

暂无评论

Approximation results for impulsive control systems with hysteresis 14

Approximation results for impulsive control systems with hys...

引用

14th International Conference "Stability and Oscillations of Nonlinear control systems" (Pyatnitskiy's Conference), STAB 2018

作者： Samsonyuk, O.N. Tolkachev, D.E. 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. © 2018 IEEE.

ISBN: (纸本)9781538645567

关键词： Hysteresis

来源：评论

学校读者我要写书评

暂无评论

Implicit Boolean Network for Planning Actions 45

Implicit Boolean Network for Planning Actions

引用

45th Jubilee International Convention on Information, Communication and Electronic Technology, MIPRO 2022

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

ISBN: (纸本)9789532331035

It is usual to classify the automated searching of a plan as an artificial intelligence problem. In planning, the environment is defined as a set of both states and transitions between them. Planning consists in searching for a finite transitions sequence (actions) that transfers the initial state to one of the states, satisfying the objective. As a model of the planning environment, we propose to use implicit Boolean networks - binary dynamic systems, the transition function of which is defined by the implicit Boolean equation relative to the current state variables vector and some subsequent variables vectors. For this model, the forming of a plan is reduced to qualitative analysis of dynamic properties of the implicit binary dynamic system. In particular, these are reachability or cyclicity properties over a given discrete time interval. At the final stage of this method, the verification of the Boolean formula satisfiability is performed. This formula includes the equation of the dynamics of the implicit Boolean network and the specification of the dynamical property being verified. The considered approach is demonstrated on the problem of planning a river crossing and constructing a Hamiltonian cycle in a graph. A specialized parallel algorithm for solving deeply structured Boolean satisfiability problems is proposed, which provides scalability with an increase in their dimension. © 2022 Croatian Society MIPRO.

关键词： Hamiltonians

来源：评论

学校读者我要写书评

暂无评论

Computational study of activation dynamics on networks of arbitrary structure 7th

Computational study of activation dynamics on networks of ar...

引用

7th International Conference on Network Analysis, NET 2017

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

ISBN: (纸本)9783319962467

In this paper, we present the results on describing and modeling dynamical properties of collective systems. In particular, we consider the problems of activation and deactivation of collectives, represented by networks, by establishing special agents called activators and deactivators in a network. Such problems are combinatorial and to solve them, we employ the algorithms for solving Boolean satisfiability problem (SAT). Thus, we describe the general technique for reducing the problems from a considered class to SAT. The paper presents the novel approach to analysis of problems related to Computer Security. In particular, we propose to study the developing and blocking of attacks on computer networks as the processes of activation/deactivation. We give a number of theoretical properties of corresponding discrete dynamical systems. For the problems of blocking attacks on computer networks, the corresponding reduction to SAT was implemented and tested. At the present moment using state-of-the-art SAT solvers, it is possible to solve such problems for networks with 200 vertices. © Springer International Publishing AG, part of Springer Nature 2018.

关键词： Chemical activation

来源：评论

学校读者我要写书评

暂无评论

On Solving the Quadratic Sum-of-Ratios Problems 19th

On Solving the Quadratic Sum-of-Ratios Problems

引用

19th International Conference on Mathematical Optimization theory and Operations Research, MOTOR 2020

作者： Gruzdeva, Tatiana V. Strekalovsky, Alexander S. Matrosov Institute for System Dynamics and Control Theory of SB of RAS Irkutsk Russia

ISBN: (纸本)9783030499877

This paper addresses the numerical solution of fractional programs with quadratic functions in the ratios. Instead of considering a sum-of-ratios problem directly, we developed an efficient global search algorithm, which is based on two approaches to the problem. The first one adopts a reduction of the fractional minimization problem to the solution of an equation with an optimal value of a parametric d.c. minimization problem. The second approach reduces the original problem to the optimization problem with nonconvex (d.c.) constraints. Hence, the fractional programs can be solved by applying the Global Search theory of d.c. optimization. The global search algorithm developed for sum-of-ratios problems was tested on the examples with quadratic functions in the numerators and denominators of the ratios. The numerical experiments demonstrated that the algorithm performs well when solving rather complicated quadratic sum-of-ratios problems with up to 100 variables or 1000 terms in the sum. © 2020, Springer Nature Switzerland AG.

关键词： Functions

来源：评论

学校读者我要写书评

暂无评论

Modeling Agent Behavior in Interacting Microgrids 10

Modeling Agent Behavior in Interacting Microgrids

引用

10th International Conference on Information Technology and Nanotechnology, ITNT 2024

作者： Bychkov, Igor Feoktistov, Alexander Chekan, Mikhail Matrosov Institute For System Dynamics And Control Theory Of Sb Ras Irkutsk Russia

ISBN: (纸本)9798350372939

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

关键词： Balancing

来源：评论

学校读者我要写书评

暂无评论

Global and Local Search Methods for D.C. Constrained Problems 19th

Global and Local Search Methods for D.C. Constrained Problem...

引用

19th International Conference on Mathematical Optimization theory and Operations Research, MOTOR 2020

作者： Strekalovsky, Alexander S. Matrosov Institute for System Dynamics and Control Theory of SB of RAS Irkutsk Russia

ISBN: (纸本)9783030499877

This paper addresses the general optimization problem ($$\mathcal P$$) with equality and inequality constraints and the cost function given by d.c. functions. We reduce the problem to a penalized problem ($$\mathcal P_{\sigma }$$) without constraints with the help of the Exact Penalization theory. Further, we show that the reduced problem is also a d.c. minimization problem. This property allows us to prove the Global Optimality Conditions (GOCs), which reduce the study of the penalized problem to an investigation of a family of linearized (convex) problems tractable with the help of standard convex optimization methods and software. In addition, we propose a new Local Search Scheme (LSS1) which produces a sequence of vectors converging to a so-called critical point. On the other hand, the vector satisfying the GOCs turns out to be also a critical point. On the basis of the GOCs for finding a global solution to ($$\mathcal P_{\sigma }$$), we develop a Global Search Scheme, including the LSS1 with an update of the penalty parameter, and a special stopping criteria allowing detection of a feasible vector in the original problem ($$\mathcal P$$), and, consequently, a global solution to the original Problem ($$\mathcal P$$). © 2020, Springer Nature Switzerland AG.

关键词： Cost functions

来源：评论

学校读者我要写书评

暂无评论

Models and software for agent-based model development based on model-driven approach 1

Models and software for agent-based model development based ...

引用

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

作者： Nikolaychuk, Olga A. Pavlov, Alexander I. Stolbov, Alexander B. Matrosov Institute for System Dynamics and Control Theory SB RAS Irkutsk Russia

The article discusses the application of the model-driven approach in the development of agent-based simulation models, presents an overview of agent architectures, considers the updated version of the hierarchical system of metamodels for formalizing the agent-based simulation models development methodology, as well as a description of the minimum set of software tools required to develop the software system for creation the applied agent-based simulation models © 2018 CEUR-WS. All rights reserved.

关键词： Hierarchical systems

来源：评论

学校读者我要写书评

暂无评论

Efficient Heuristics for a Partial Set Covering Problem with Mutually Exclusive Pairs of Facilities 1

引用

7th International Conference on Optimization, Simulation and control, COSC 2022

作者： Belykh, Aleksander Gruzdeva, Tatyana Ushakov, Anton Vasilyev, Igor Matrosov Institute for System Dynamics and Control Theory of SB RAS Irkutsk Russia

ISBN: (数字)9783031412295

ISBN: (纸本)9783031412288

Set cover problems are among the most popular and well-studied models in facility location. In this paper, we address an extension of the set covering and partial set covering problems. We suppose that a set of customers to be served is divided into two non-overlapped subsets: "mandatory" customers who must always be covered and "optional" customers who do not require obligatory coverage. To avoid a trivial solution that covers only customers from H, we suppose that the number of covered optional customers must be at least larger than a pre-defined threshold In the real world, local laws may prohibit location of a large number of facilities in some places to reduce harm to people and/or nature. To reflect that fact our problem involves pairs of facilities that are mutually exclusive, hence if a facility from such a pair is located, another one is prohibited. We formulate this problem as an integer linear program and develop and implement several fast heuristic approaches capable of finding high-quality solutions of large-scale problem instances arisen in real-life settings. In particular, we develop a hybrid heuristic involving a greedy algorithm and local search embedded into a variable neighborhood framework. We test our algorithms in a series of intensive computational experiments on both real-life problems and synthetically generated instances. © The Author(s), under exclusive license to Springer Nature Switzerland AG 2023.

关键词： Location

来源：评论

学校读者我要写书评

暂无评论

The study of inversion problems of cryptographic hash functions from md family using algorithms for solving boolean satisfiability problem

The study of inversion problems of cryptographic hash functi...

引用

2016 International Conference Mathematical and Information Technologies, MIT 2016

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

In this paper we present the results of application of state-ofthe-Art SAT solvers to inversion of cryptographic hash functions from the MD family. In particular we consider the problems of finding preimages and collisions for MD4 and MD5. To solve them we use the approach based on reducing the original problems to Boolean satisfiability problem (SAT). The propositional encoding of the algorithms specifying the considered functions was performed using the Transalg software system. The features of this system make it possible to effectively augment the SAT encodings for MD4 and MD5 hash functions with various additional constraints that improve the effectiveness of SAT solvers on corresponding instances. The effectiveness of the proposed algorithms is better than that in a number of preceding papers. We used the developed algorithms to find new families of two-block collisions for MD5 and to construct new differential paths for finding single-block collisions for MD4.

关键词： Hash functions

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

全选清除本页清除全部题录导出标记到“检索档案”

共34页 << < 1 2 3 4 5 6 7 8 9 10 > >>

检索报告对象比较合并检索0

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

电话和邮箱必须正确填写，我们会与您联系确认。

联系人：

所在院系：

联系邮箱：

联系电话：

内蒙古自治区呼和浩特市赛罕区大学西街235号邮编: 010021

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：