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

Three Search Algorithms for Three Nonconvex Optimization Problems

Journal of Mathematical Sciences (United States) 2022年第4期267卷 457-464页

作者： Gornov, A. Yu. Sorokovikov, P.S. Zarodnyuk, T.S. Anikin, A.S. Matrosov Institute for System Dynamics and Control Theory of SB RAS 134 Lermontov Str. Ikrusk 664033 Russian Federation

The paper deals with three numerical approaches that allow one to construct computational technologies for solving nonconvex optimization problems. We propose to use the developed algorithms based on modifications of the tunnel search algorithm, the Luus–Yaakola method, and the expert algorithm. The presented techniques are implemented within the framework of the software package and are used for solving nonconvex optimization problems of various classes, in particular, the minimization of the potential function for the Sutton–Chen atomic-molecular cluster, the problem of parametric identification of nonlinear dynamic systems, and the nonconvex optimal control problem. © 2022, Springer Science+Business Media, LLC, part of Springer Nature.

关键词：

来源：评论

学校读者我要写书评

暂无评论

On a Nonconvex Distance-Based Clustering Problem 21st

On a Nonconvex Distance-Based Clustering Problem

引用

21st International Conference on Mathematical Optimization theory and Operations Research, MOTOR 2022

作者： Gruzdeva, Tatiana V. Ushakov, Anton V. Matrosov Institute for System Dynamics and Control Theory of SB RAS 134 Lermontov Street Irkutsk664033 Russia

ISBN: (纸本)9783031096068

Clustering is one of the basic data analysis tools and an important subroutine in many machine learning tasks. Probably, the most well-known and popular clustering model is the Euclidean minimum-sum-of-squares clustering problem, also known as the k-means problem. Clustering with Bregman divergences is a generalization of the k-means problem where the distances between data items and closest cluster centers are computed according to any Bregman divergence, rather than the squared Euclidean distance. In this paper, we consider a mathematical programming problem of clustering with Bregman divergences. We propose several representations of the problem in the form of a DC (difference of convex) program and develop a DC programming approach to solve it. We provide particular DC representations and particular DC solution algorithms for several widely-known Bregman divergences. © 2022, The Author(s), under exclusive license to Springer Nature Switzerland AG.

关键词： K-means clustering

来源：评论

学校读者我要写书评

暂无评论

Volterra Series Models for Nonlinear Automatic control systems

Volterra Series Models for Nonlinear Automatic Control Syste...

引用

2024 International Russian Automation Conference, RusAutoCon 2024

作者： Solodusha, Svetlana Markova, Evgeniia Kokonova, Yuliya Melentiev Energy Systems Institute Sb Ras Irkutsk Russia Matrosov Institute for System Dynamics and Control Theory Sb Ras Irkutsk Russia Irkutsk National Research Technical University Irkutsk Russia

The paper presents algorithms for constructing nonlinear integral models based on the Volterra series tool. Modeling of dynamic processes means assessing the response to possible external changes in real time. The vector of input signals may include measured influences and control actions to be identified based on an analysis of the current state. We use identification algorithms based on the theory of Volterra polynomial equations of the first kind. An approach to the approximate solution to selected types of nonlinear systems of Volterra integral equations using the Newton-Kantorovich method is presented. We use the numerical solution to the corresponding linear system of equations as a trial solution. Calculation schemes obtained with help the standard quadrature methods are given. © 2024 IEEE.

关键词： Integral equations

来源：评论

学校读者我要写书评

暂无评论

Monowave Boundary Construction Method for the Non-convex Reachable Set of the controlled Dynamical system 1

引用

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

作者： Zarodnyuk, Tatiana Gornov, Alexander Matrosov Institute for System Dynamics and Control Theory of SB RAS Irkutsk Russia Moscow Institute of Physics and Technology Dolgoprudny Russia

ISBN: (数字)9783031412295

ISBN: (纸本)9783031412288

The paper proposes a computational technology for constructing the boundary of the reachable set of the controlled dynamical systems. The monowave method underlying it relies on the use of a given sequence of controls with a moving switching point. To construct the controls of a given structure, the time interval is divided into equal parts. Then controls are built in the form of relay functions with switching points in the nodes of the generated grid. A series of computational experiments was carried out to construct the boundaries of non-convex reachable sets. The obtained results made it possible to demonstrate the effectiveness of the proposed monowave method. © The Author(s), under exclusive license to Springer Nature Switzerland AG 2023.

关键词： Dynamical systems

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

On some properties of the Fredholm-type integral algebraic equations

On some properties of the Fredholm-type integral algebraic e...

引用

作者： Chistyakov, Viktor F. Chistyakova, Elena V. Laboratory for Differential Equations and Control Systems Institute for System Dynamics and Control Theory SB RAS Irkutsk Russia

In this paper, we study systems of Fredholm integral equations with a singular matrix multiplying the leading part. We address the solvability issues of such systems with separable kernels and, similarly to differenti... 详细信息

关键词： Fredholm integral equations

来源：评论

学校读者我要写书评

暂无评论

Fast Heuristics for a Staff Scheduling Problem with Time Interval Demand Coverage 23rd

Fast Heuristics for a Staff Scheduling Problem with Time ...

引用

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

作者： Vasilyev, Igor Ushakov, Anton V. Arkhipov, Dmitry Davydov, Ivan Muftahov, Ildar Lavrentyeva, Maria Matrosov Institute for System Dynamics and Control Theory of SB RAS 134 Lermontov Street Irkutsk664033 Russia Sobolev Institute of Mathematics of SB RAS 4 Academic Koptyug Avenue Novosibirsk630090 Russia MPG IT Solutions LLC Novosibirsk Russia Moscow Russia Irkutsk Russia

ISBN: (纸本)9783031627910

Staff scheduling is a key component of supporting and increasing competitiveness for many service enterprises. This is of especially urgent concern for organizations that provide service on a twenty-four hour basis and often encounter significant fluctuations of demand. By scheduling personnel, the employers have also to strictly follow local laws, industrial regulations, and workload agreements that may considerably affect the final schedule. Staff preferences have also to be taken into account when planning work schedules, since it may reduce turnover and increase productivity. In this paper we consider a staff scheduling problem that arise in the industrial fields where the demand in staff is highly dynamic and varies within time intervals throughout a day. The goal is to assign each employee with a shift for each day of a planning horizon so as to minimize the sum of unsatisfied demand over all time intervals subject to hard workplace constraints. Note that each employee may have his/her day-specific set of pre-defined shifts and a set of work-rule constraints. We formulate the scheduling problem as a mixed-integer program. We develop several fast two-stage heuristic algorithms that includes a constructive step to find an initial solution followed by fast local search procedures. We demonstrate the effectiveness of the proposed approaches on a number of real-world huge-scale scheduling problems involving thousands of employees. © The Author(s), under exclusive license to Springer Nature Switzerland AG 2024.

关键词： Personnel

来源：评论

学校读者我要写书评

暂无评论

Inversion Formulas by the Use of Bessel Beams of Integer and Fractional Orders

引用

International Journal of Applied and Computational Mathematics 2024年第6期10卷 1-13页

作者： Balandin, Alexander L. V.M. Matrosov Institute of System Dynamics and Control Theory Siberian Branch of the Russian Academy of Sciences Lermontov str. 134 Irkutsk Region Irkutsk 664033 Russian Federation

A major application of the inversion methods is imaging all types of structural, physical, chemical and biological features of matter. The term vortex beam refers to a beam of electromagnetic radiation, electrons, photons or otherwise - whose phase changes in corkscrew-like manner along the direction of propagation. The paper is devoted to the use of scalar Bessel beams of integer and fractional modes for the reconstruction of scattering potential. In practical applications one naturally deals with Bessel beams truncated in the radial direction. The inversion formula for truncated Bessel beams is also obtained. Instead of the conventional Fourier diffraction theorem (Kak in Principles of computerized tomographic imaging, SIAM, New York, 2001), the relations connecting the scattering field and the scattering potential in the Fourier space are obtained in the explicit form. © The Author(s), under exclusive licence to Springer Nature India Private Limited 2024.

关键词： Bessel beams Born approximation Fourier transform Inverse problems Tomography

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：