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

18th International Conference on Mathematical Optimization theory and Operations Research, MOTOR 2019

作者： Ushakov, Anton V. Vasilyev, Igor Matrosov Institute for System Dynamics and Control Theory of SB RAS Lermontov str. 134 Irkutsk664033 Russia

ISBN: (纸本)9783030333935

Most commonly used clustering algorithms are those aimed at solving the well-known k-median problem. Their main advantage is that they are simple to implement and use, and they are flexible in choosing dissimilarity measures (not necessarily metrics). K-median algorithms are also known to be more robust to noise and outliers in comparison with k-means algorithms. In spite of that, they have been of limited use for large-scale clustering problems due to their high computational and space complexity. This work aims at computational comparison of k-median clustering algorithms in a specific large-scale setting—clustering large image collections. We implement distributed versions of the most common k-median clustering algorithms and compare them with our parallel heuristic for solving large-scale k-median problem instances. We analyze clustering results with respect to external evaluation measures and run time. © 2019, Springer Nature Switzerland AG.

关键词： K-means clustering

来源：评论

学校读者我要写书评

暂无评论

Global optimality conditions for optimization problem with D.C. inequality and equality constraints 8

Global optimality conditions for optimization problem with D...

引用

8th International Conference on Optimization and Applications, OPTIMA 2017

作者： Strekalovsky, Alexander S. Matrosov Institute for System Dynamics and Control Theory SB RAS Lermontov st. 134 Irkutsk664033 Russia

This paper addresses the nonconvex optimization problem with the cost function and constraints given by d.c. functions. The original problem is reduced to a problem without inequality and equality constraints by means of the exact penalization techniques. Furthermore, the penalized problem is presented as a d.c. minimization problem. For the latter problem we develop the global optimality conditions (GOCs) which reduce the nonconvex optimization problem to a family of convex problems. In the paper the properties of the GOCs are investigated. The effectiveness of the GOCs is demonstrated by examples. © Copyright by the paper's authors.

关键词： Cost functions

来源：评论

学校读者我要写书评

暂无评论

Application of user dew agent in hybrid-computing environments 1

Application of user dew agent in hybrid-computing environmen...

引用

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

作者： Pashinin, A.A. Bogdanova, V.G. Matrosov Institute for System Dynamics and Control Theory SB RAS Lermontov St. 134 Irkutsk664033 Russia

In recent years, research in Dew computing as a new layer in the vertical hierarchy of scalable computing has been developing. Directions for the development of this technology include research into the possibilities of Dew computing and its applications. Our research belongs to the second direction. We use this technology in a package of applied microservices for solving complex problems of the qualitative study of binary dynamic systems based on the Boolean constraint method in a hybrid cloud environment. This environment includes on-premises, high-performance, and cloud resources. In this paper, the usage of Dew computing technology in a hybrid cloud environment is discussed. A user dew agent installed on an on-premises resource is proposed to provide the possibility of the applied microservices package collaboration with cloud services in a hybrid cloud environment. The advantages of using a user dew agent are considered. The architecture, functionality, operation modes, and the installation of the dew agent are presented. © 2021 for this paper by its authors. Use permitted under Creative Commons License Attribution 4.0 International (CC BY 4.0).

关键词： Cloud computing

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Speeding up the Solving of Logical Equivalence Checking Problems with Disjunctive Diagrams 46

Speeding up the Solving of Logical Equivalence Checking Prob...

引用

46th ICT and Electronics Convention, MIPRO 2023

作者： Kondratiev, Victor Otpuschennikov, Ilya Semenov, Alexander ITMO University St. Petersburg Russia Matrosov Institute for System Dynamics and Control Theory SB RAS Irkutsk Russia

ISBN: (纸本)9789532331042

In the context of the problem of checking the equivalence of Boolean circuits (LEC), we propose an approach that increases the efficiency of modern SAT solvers on this problem by generating additional constraints of a special kind. To generate such constraints, we use a variant of decision diagrams called disjunctive diagrams. In contrast to well-known Binary Decision Diagrams these diagrams can be constructed effectively for an original formula and can also be used to extend the original CNF formula with new clauses which are its logical consequences. In computational experiments, we show that the resulting formulas, encoding difficult LEC variants, extended by the generated constraints are often significantly easier to solve for state-of-the-art SAT solvers compared to the original formulas. © 2023 MIPRO Croatian Society.

关键词： Binary decision diagrams

来源：评论

学校读者我要写书评

暂无评论

Orlando tools: Energy research application development through convergence of grid and cloud computing 4th

Orlando tools: Energy research application development throu...

引用

4th Russian Supercomputing Days Conference, RuSCDays 2018

作者： Feoktistov, Alexander Gorsky, Sergei Sidorov, Ivan Kostromin, Roman Edelev, Alexei Massel, Lyudmila Matrosov Institute for System Dynamics and Control Theory of SB RAS Irkutsk Russia Melentiev Energy Systems Institute of SB RAS Irkutsk Russia

ISBN: (纸本)9783030058067

The paper addresses the relevant problem related to the development of scientific applications (applied software packages) to solve large-scale problems in heterogeneous distributed computing environments that can include various infrastructures (clusters, Grid systems, clouds) and provide their integrated use. We propose a new approach to the development of applications for such environments. It is based on the integration of conceptual and modular programming. The application development is implemented with a special framework named Orlando Tools. In comparison to the known tools, used for the development and execution of distributed applications in the current practice, Orlando Tools provides executing application jobs in the integrated environment of virtual machines that include both the dedicated and non-dedicated resources. The distributed computing efficiency is improved through the multi-agent management. Experiments of solving the large-scale practical problems of energy security research show the effectiveness of the developed application for solving the aforementioned problem in the environment that supports the hybrid computational model including Grid and cloud computing. © 2019, Springer Nature Switzerland AG.

关键词： Energy security

来源：评论

学校读者我要写书评

暂无评论

Domain-oriented specialization tools for knowledge-based systems development platform 3

Domain-oriented specialization tools for knowledge-based sys...

引用

3rd Scientific-Practical Workshop Information Technologies: Algorithms, Models, systems, ITAMS 2020

作者： Pavlov, A.I. Stolbov, A.B. Matrosov Institute for System Dynamics and Control Theory Siberian Branch of the Russian Academy of Sciences 134 Lermotov st. Irkutsk Russia

New details of the implementation of the data representation and editing component of the knowledge-based systems development platform is proposed in the paper. The two modes of considered component is described. The typical component structure along with the core to client component parts communication issues are presented. The main UI control elements are listed and grouped according to the criteria of the number of efforts that applied developers spend in the course of making UI. On the top of controls from the first group considered component provides user interface for data control component and implements unified user interface for any valid component of the platform. The second group is responsible for user interface of the platform as a whole and also for problem-oriented functions of the core components (for example, rule or workflow editors). The third group relies on a predefined set of parameterized typical database manipulations and supports the applied developer in the process of UI customization. The implementation of two techniques is considered on the case of the conceptual model design component extension. © 2020 for this paper by its authors. Use permitted under Creative Commons License Attribution 4.0 International (CC BY 4.0).

关键词： User interfaces

来源：评论

学校读者我要写书评

暂无评论

The -Convergence of Maximal Monotone Nemytskii Operators

引用

Siberian Mathematical Journal 2022年第6期63卷 1169-1180页

作者： Tolstonogov, A. A. Matrosov Institute for System Dynamics and Control Theory Irkutsk Russia

We consider a sequence of superposition operators (Nemytskii operators) from the space of square-integrable functions on a line segment to a separable Hilbert space. Each term of the sequenc...

We consider a sequence of superposition operators (Nemytskii operators) from the space of square-integrable functions on a line segment to a separable Hilbert space. Each term of the sequence is generated by a time-dependent family of maximal monotone operators in the Hilbert space. Under sufficiently general assumptions we show that every superposition operator is maximal monotone and study the $ G $ -convergence of the respective sequence of Nemytskii operators. The results can be used to study the parametric dependence of solutions to evolutionary inclusions with time-dependent maximal monotone operators.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Using Disjunctive Diagrams for Preprocessing of Conjunctive Normal Forms 45

Using Disjunctive Diagrams for Preprocessing of Conjunctive ...

引用

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

作者： Kondratiev, Victor JetBrains Research St. Petersburg Russia Matrosov Institute for System Dynamics and Control Theory Sb Ras Irkutsk Russia

ISBN: (纸本)9789532331035

In this article, in the context of the Boolean satisfiability problem (SAT), the question of speeding up the SAT solvers on specific input formulas is considered. The speedup is achieved using the CNF preprocessing algorithm which is based on the use of decision diagrams of a special kind, called Disjunctive Diagrams. These diagrams allow one to naturally test some sets of partial variable assignments and add more stringent constraints to the original formula. Several families of SAT instances are considered and used to compare the solving time before and after preprocessing, including a selection of tests from the "SAT Competition 2021"and some tests related to the problem of checking the equivalence of Boolean *** experiments have shown that for hard instances in more than half of the cases the proposed preprocessing algorithm can speed up the solving time of considered CNFs. © 2022 Croatian Society MIPRO.

关键词： Graphic methods

来源：评论

学校读者我要写书评

暂无评论

Algorithms for computation of reversible integer transform from linear float transform and minimization of rounding errors 3

Algorithms for computation of reversible integer transform f...

引用

3rd Scientific-Practical Workshop Information Technologies: Algorithms, Models, systems, ITAMS 2020

作者： Hmelnov, Alexei Matrosov Institute for System Dynamics and Control Theory Siberian Branch of Russian Academy of Sciences 134 Lermontov st Irkutsk Russia

Various compression algorithms use linear transforms to represent data vectors in different coordinate systems, where they can be compressed better. The matrices usually have oat coe cients, and the data vectors are integer, so some rounding is required. And to make the compression lossless it is required to make these transforms reversible, i.e. to be able to exactly restore the original vectors from the results of their transform. In this article we'll consider a straightforward algorithm for nding the decomposition of linear transform matrix and the approaches for estimation of the mean square approximation error and for nding the optimal decomposition, which minimizes the error. © 2020 for this paper by its authors. Use permitted under Creative Commons License Attribution 4.0 International (CC BY 4.0).

关键词： Mean square error

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：