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

2017 All-Russian Conference "Spatial Data Processing for Monitoring of Natural and Anthropogenic Processes, SDM 2017

作者： Bychkov, Igor V. Ruzhnikov, Gennady M. Paramonov, Viacheslav Shumilov, Alexander S. Fedorov, Roman K. Sanjaa, Budnyam Matrosov Institute for System Dynamics and Control Theory SB RAS Irkutsk Russia Irkutsk Scientific Center Irkutsk Russia Institute of Mathematics National University of Mongolia Ulaanbaatar Mongolia

The article deals with the infrastructural approach to creating an information and analytical environment (IAE) for solving problems of managing territorial development, the feature of which is: large volumes of thematic, spatial data used and their distribution;application of service-oriented paradigm, OGC standards, Web technologies, geoportals and distributed WPS-services.

关键词： Data handling

来源：评论

学校读者我要写书评

暂无评论

Information-analytical environment supporting interdisciplinary research of natural resources in the baikal region 1

Information-analytical environment supporting interdisciplin...

引用

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

作者： Bychkov, Igor V. Fedorov, Roman K. Avramenko, Yurii V. Shumilov, Alexander S. Shi-garov, Alexei O Verhozina, Alla V. Emelyanova, Natalia V. Sorokovoi, Andrei A. Ruzhnikov, Gennady M. Matrosov Institute for System Dynamics and Control Theory SB RAS Irkutsk Russia Siberian Institute of Plant Physiology and Biochemistry SB RAS Irkutsk Russia V.B. Sochava Institute of Geography SB RAS Irkutsk Russia Irkutsk Scientific Center SB RAS Irkutsk Russia

The technology of creating a geoportal information-analytical environment for supporting scientific research of nature management in the Baikal region is considered on the basis of a service-oriented paradigm and the integrated use of thematic and spatial data accumulated by the scientific community. © 2018 CEUR-WS. All rights reserved.

关键词： Environmental management

来源：评论

学校读者我要写书评

暂无评论

On numerical solution of specially constructed quadratic bilevel test problems 8

On numerical solution of specially constructed quadratic bil...

引用

8th International Conference on Optimization and Applications, OPTIMA 2017

作者： Orlov, Andrei V. Matrosov Institute for System Dynamics and Control Theory of Siberian Branch of RAS Lermontov St. 134 Irkutsk664033 Russia

This paper addresses the bilevel programming problems (BPPs) with the quadratic objective functions at the upper and the lower levels. The new solution method for such BPPs is developed. The main feature of the approach proposed is employment of the original A.S. Strekalovsky's Global Search theory. Numerical testing of the method on specially constructed instances demonstrated the efficiency of the approach. © Copyright by the paper's authors.

关键词： Numerical methods

来源：评论

学校读者我要写书评

暂无评论

Constructing the crude program control of the operating process of the oribiting telescope 14

Constructing the crude program control of the operating proc...

引用

14th Saint Petersburg International Conference on Integrated Navigation systems, ICINS 2007

作者： Druzhinin, E.I. Voronov, V.A. Institute of System Dynamics and Control Theory SB RAS 134 Lermontov St. Irkutsk Russia

ISBN: (纸本)9785900780672

We consider a construction program control problem for orbital telescope under restrictions and parameters and structure uncertainty of its dynamic model. The calculation of needed control is based on stable to input data small errors direct technique of approximate solutions construction of route problems for controllable nonlinear systems. The modified variant of iteration algorithm calculation realization for direct technique has the structure that enables to rebuild algorithm on each calculation step by previous iteration results. Such algorithm construction enables to compute program controls for wide spectra of input data under problem statement with minimal step number. By numerical research we show that "direct" control obtained with a help stable in Tichonov sense direct technique computational algorithm for orbital telescope model as a single solid provides needed accuracy of motion realization for telescope model with non-rigid solar batteries panels and perturbed dynamical characteristics.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Subject-oriented computing environment for solving large-scale problems of energy security research 5

Subject-oriented computing environment for solving large-sca...

引用

5th International Conference on Information Technology and Nanotechnology, ITNT 2019

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

We represent a new approach to the development and use of a subject-oriented heterogeneous distributed computing environment for solving large-scale problems of energy security research. Both the development of scalable applications (distributed applied software packages) and the computing resources integration are conducted using the Orlando Tools framework. It supports the collaborative application development based on the continuous integration of their software. Computation management tools in Orlando Tools are integrated with a multi-agent system. We propose special multi-agent tools for the heterogeneous resource allocation in the environment. These tools apply knowledge about the subject domain specifics of solved-problems and computing environment characteristics. The effectiveness of such management is highlighted by the results of solving practical problems of energy security research. © 2019 IOP Publishing Ltd. All rights reserved.

关键词： Energy security

来源：评论

学校读者我要写书评

暂无评论

Application of high-performance computing for determining critical components of an energy system

Application of high-performance computing for determining cr...

引用

2020 Sustainable Development and Smart Management, ENERGY-21

作者： Edelev, Aleksey Feoktistov, Alexander Bychkov, Igor Basharina, Olga Melentiev Energy Systems Institute Sb Ras Lermontov St. 130 Irkutsk664033 Russia Matrosov Institute for System Dynamics and Control Theory Sb Ras Lermontov St. 134 Irkutsk664033 Russia

This article presents a package for analyzing the energy system vulnerability developed with new technology for continuous integration, delivery, and deployment of applied software. It implements a framework that allows combining and optimally using various methods for modelling energy systems and provides the comprehensive assessment of their vulnerability with regard to various uncertainties. The essential principles to identify and rank critical elements of an energy system are considered in the article. The investigations made with the package shown that the principles seem to be logical for the subsequent construction of the invariant set of measures for improving the energy system resilience. © The Authors, published by EDP Sciences, 2020.

关键词： Uncertainty analysis

来源：评论

学校读者我要写书评

暂无评论

On the Construction of Triples of Diagonal Latin Squares of Order 10

引用

Electronic Notes in Discrete Mathematics 2016年 54卷 307-312页

作者： Zaikin, Oleg Zhuravlev, Alexey Kochemazov, Stepan Vatutin, Eduard Matrosov Institute for System Dynamics and Control Theory of SB RAS Irkutsk Russian Federation Internet-portal BOINC.ru Moscow Russian Federation Southwest State University Kursk Russian Federation

We provide a triple of diagonal Latin squares of order 10 that is the closest to being a triple of mutually orthogonal diagonal Latin squares found so far. It was obtained by constructing all orthogonal mates for diagonal Latin squares generated according to a specific scheme. We also show that a triple of mutually orthogonal diagonal Latin squares of order 10 cannot be constructed based on diagonal Latin squares from specific families. © 2016 Elsevier B.V.

关键词： diagonality Latin square orthogonality SAT

来源：评论

学校读者我要写书评

暂无评论

On Active-Set Methods for Quadratic Problems with Positive Semidefinite Matrices 23rd

On Active-Set Methods for Quadratic Problems with Positive...

引用

23rd International Conference on Mathematical Optimization theory and Operations Research, MOTOR 2024

作者： Vasiliev, Igor Gruzdeva, Tatiana Barkova, Mariia Boyarkin, Denis Iakubovskii, Dmitrii Matrosov Institute for System Dynamics and Control Theory of SB RAS 134 Lermontov str. Irkutsk664033 Russia Melentiev Energy Systems Research Institute of SB RAS 130 Lermontov str. Irkutsk664033 Russia

ISBN: (纸本)9783031733642

Quadratic programming problems (QP) arise in a vast variety of real-world applications in finance, engineering, operational research, and many other fields. A huge number of methods and their various modifications have been developed for solving convex QPs. One of the first algorithms popularized as the solution method for QPs was the active-set method. The main idea of the method is selection of a set of binding constraints (an active set) and then iteratively adaptation it by adding and dropping constraints from the index set. The dual active-set (DAS) method of Goldfarb and Idnani is still well-known to be efficient and numerically stable. Taking advantage of the fact that the unconstrained minimum of the objective function can be used as a starting point of the method, its implementation utilizes the Cholesky and QR factorizations and procedures for updating them. At the same time, it suffers from the restriction that it cannot be applied to problems with positive semidefinite objective matrices, whereas in practice optimization problems may often be of such structure. We propose an add-in to the method of Goldfarb and Idnani that allows solving problems with positive semidefinite matrices directly by the DAS algorithm with a warm-start where a good estimate of the optimal active set is used to start the algorithm. The proposed technique is based on the well-known possibility of representing any matrix, as a difference of two, positive definite ones and solving then a sequence of so-called partially linearized problems. It can be viewed as a particular case of the special local search method for DC minimization problems. A computational experiment to testing the proposed approach was carried out on QPs with positive semidefinite objective matrices from the Maros and Meszaros test set. © The Author(s), under exclusive license to Springer Nature Switzerland AG 2024.

关键词： Iterative methods

来源：评论

学校读者我要写书评

暂无评论

Enumerating the transversals for diagonal Latin squares of small order 3

Enumerating the transversals for diagonal Latin squares of s...

引用

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

作者： Vatutin, Eduard Kochemazov, Stepan Zaikin, Oleg Valyaev, Sergey Southwest State University Kursk Russia Matrosov Institute for System Dynamics and Control Theory SB RAS Irkutsk Russia Internet portal BOINC.ru Moscow Russia

In this study, we suggest an algorithm for computing minimal and maximal numbers of transversals of diagonal Latin squares. According to this algorithm, we generate all diagonal Latin squares of a particular order, and for each square construct all its transversals and diagonal transversals. With the help of this algorithm, we computed minimal and maximal numbers of transversals for diagonal Latin squares of order at most 7 on a personal computer. The experiment for diagonal Latin squares of order 8 was performed in a volunteer computing project. We also give the estimation of the runtime required to solve the corresponding problem for diagonal Latin squares of order 9. Copyright © by the paper's authors. Copying permitted for private and academic purposes.

关键词： Personal computers

来源：评论

学校读者我要写书评

暂无评论

Using grid systems for enumerating combinatorial objects on example of diagonal Latin squares 7

Using grid systems for enumerating combinatorial objects on ...

引用

7th International Conference Distributed Computing and Gridtechnologies in Science and Education, GRID 2016

作者： Vatutin, E.I. Zaikin, O.S. Zhuravlev, A.D. Manzyuk, M.O. Kochemazov, S.E. Titov, V.S. Southwest State University Kursk Russia Matrosov Institute for System Dynamics and Control Theory of SB RAS Irkutsk Russia Internet Portal BOINC.ru Moscow Russia

In this paper we consider the problem of enumerating diagonal Latin squares of small order. In particular we discuss possible algorithmic approaches to this problem and show our results in this regard. Surprisingly, our research showed that the best algorithm for enumerating diagonal Latin squares consists of a number of fixed loops, and its effectiveness can be significantly increased by careful tuning and applying special heuristics. We used the constructed algorithm to enumerate all diagonal Latin squares of order 8. Also, it is being used to carry out large-scale computational experiment aimed at enumeration of diagonal Latin squares of order 9. © 2016 Eduard I. Vatutin, Oleg S. Zaikin, Alexey D. Zhuravlev, Maxim O. Manzyuk, Stepan E. Kochemazov, Vitaliy S. Titov.

关键词： Combinatorial mathematics

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：