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

IEEE conference on Control and applications (CCA)

作者： Roschild, Jonatas M. Coutinho, Daniel de Souza, Carlos E. Inst Fed Sul Rio Grandense Campus Charqueadas Charqueadas RS Brazil Univ Fed Santa Catarina Dept Automat & Syst Florianopolis SC Brazil MCTI LNCC BR-25651075 Petropolis RJ Brazil

ISBN: (纸本)9781479977871

This paper presents a robust control design approach for current self-controlled power factor correction (PFC) boost converters. Lyapunov stability theory is applied to assess the closed-loop stability and performance under large load variations and vanishing input voltage disturbances. A differential-algebraic representation of the closed-loop system is considered to derive a convex optimization problem in terms of linear matrix inequality (LMI) constraints to tune the controller parameters. numerical simulations demonstrate the potentials of the proposed approach for tuning current self-controlled PFC boost converters subject to large load variations.

关键词： Lyapunov methods closed loop systems control system synthesis convex programming differential algebraic equations linear matrix inequalities power convertors power factor correction power system control robust control self-adjusting systems voltage control LMI constraints Lyapunov stability theory closed-loop stability closed-loop system controller parameters tuning convex optimization problem current self-controlled PFC boost converters current self-controlled power factor correction boost converters current self-controlled single-phase PFC boost converters differential-algebraic representation linear matrix inequality load variations numerical simulations robust control design robust tuning vanishing input voltage disturbances Closed loop systems linear matrix inequalities Stability analysis Switches Tuning Voltage control Closed loop systems linear matrix inequalities Lyapunov methods Voltage regulation Power factor correction load changes self-adjusting systems power conversion unit tuning differential algebraic equations Power system control control system synthesis convex programming Robust control Switches

来源：评论

学校读者我要写书评

暂无评论

numerical Solution of Underdetermined Systems from Partial linear Circulant Measurements 11

Numerical Solution of Underdetermined Systems from Partial L...

引用

International conference on Sampling theory and applications (SampTA)

作者： Bouchot, Jean-Luc Cao, Lei Rhein Westfal TH Aachen Chair Math C Anal Aachen Germany Drexel Univ Dept Math Philadelphia PA USA

ISBN: (纸本)9781467373531

We consider the traditional compressed sensing problem of recovering a sparse solution from undersampled data. We are in particular interested in the case where the measurements arise from a partial circulant matrix. This is motivated by practical physical setups that are usually implemented through convolutions. We derive a new optimization problem that stems from the traditional l(1) minimization under constraints, with the added information that the matrix is taken by selecting rows from a circulant matrix. With this added knowledge it is possible to simulate the full matrix and full measurement vector on which the optimization acts. Moreover, as circulant matrices are well-studied it is known that using Fourier transform allows for fast computations. This paper describes the motivations, formulations, and preliminary results of this novel algorithm, which shows promising results.

关键词： Matrix algebra

来源：评论

学校读者我要写书评

暂无评论

MPC for a Class of Nonlinear Systems with Guaranteed Identifiability

MPC for a Class of Nonlinear Systems with Guaranteed Identif...

引用

IEEE conference on Control and applications (CCA)

作者： Zacekova, Eva Pcolka, Matej Sebek, Michael Celikovsky, Sergej Czech Tech Univ Fac Elect Engn Dept Control Engn Tech 2 Prague 16627 6 Czech Republic Acad Sci Czech Republ Inst Informat Theory & Automat CR-18208 Prague 8 Czech Republic

ISBN: (纸本)9781479977871

This paper addresses the problem of model predictive control for a class of nonlinear systems which satisfies persistent excitation condition. The conditions under which a nonlinear system description can be handled are specified and two algorithms (one optimizing the first input sample and the other considering optimization of an M- sample subsequence of the input profile) solving the persistent excitation condition within a predictive controller for nonlinear systems are developed, both maximizing the smallest eigenvalue of the information matrix increase. The numerical experiments performed on a test- bed system demonstrate that the algorithms are able to successfully improve identifiability of a nonlinear system description while keeping the original controller performance degradation lower than arbitrarily chosen level.

关键词： eigenvalues and eigenfunctions excited states identification matrix algebra nonlinear systems optimisation predictive control M-sample subsequence optimization MPC eigenvalue maximization information matrix model predictive control nonlinear system identifiability persistent excitation condition Algorithm design and analysis Control systems Heuristic algorithms linear systems Nonlinear systems Optimization Polynomials Nonlinear systems information matrix Predictive control Maximum Allowable Concentration Algorithm design and analysis Eigenfunctions Heuristic algorithms matrix algebra control systems linear system Polynomial excited states Mathematic Identifiability input profile Model predictive control

来源：评论

学校读者我要写书评

暂无评论

conference on Semigroups of Operators - theory and applications, 2013

Conference on Semigroups of Operators - Theory and Applicati...

引用

conference on Semigroups of Operators - theory and applications, 2013

ISBN: (纸本)9783319121444

The proceedings contain 21 papers. The special focus in this conference is on theory and applications. The topics include: The evolution of operator semigroups;on nonlocal perturbations of integral kernels;convolution operators as generators of one-parameter semigroups;one-parameter semigroups in the algebra of slowly increasing functions;some remarks on the Krein-von Neumann extension of different laplacians;on strong convergence to ergodic projection for perturbed substochastic semigroups;uniform stabilization with arbitrary decay rates of the Oseen equation by finite-dimensional tangential localized interior and boundary controls;the null volatility limit of the chaotic black-scholes equation;on semigroups of large particle systems and their scaling asymptotic behavior;the numerical algorithms for the measurement of the deterministic and stochastic signals;dynamics of spatial logistic model;an optimal control of the solutions of the initial-final problem for linear Sobolev type equations with strongly relatively p-radial operator;two approaches to infinite dimensional extension of Feynman-Kac theorem;piecewise deterministic Markov processes in biological models;the nonautonomous linear Oskolkov model on a geometrical graph;dynamical measurements in the view of the group operators theory;bound states, quantum dynamics and wave operators;the dynamics of enzyme inhibition controlled by piece-wise deterministic markov process;the stochastic linear Oskolkov model of the oil transportation by the pipeline and the linearized Benney-Luke mathematical model with additive white noise.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Passive Macromodeling: theory and applications

引用

丛书名： Wiley Series In Microwave And Optical Engineering

2015年

作者： Stefano Grivet‐Talocia Bjørn Gustavsen

ISBN: (数字)9781119140931

ISBN: (纸本)9781118094914

Offers an overview of state of the art passive macromodeling techniques with an emphasis on black-box approaches This book offers coverage of developments in linear macromodeling, with a focus on effective, proven methods. After starting with a definition of the fundamental properties that must characterize models of physical systems, the authors discuss several prominent passive macromodeling algorithms for lumped and distributed systems and compare them under accuracy, efficiency, and robustness standpoints. The book includes chapters with standard background material (such as linear time-invariant circuits and systems, basic discretization of field equations, state-space systems), as well as appendices collecting basic facts from linear algebra, optimization templates, and signals and transforms. The text also covers more technical and advanced topics, intended for the specialist, which may be skipped at first reading. Provides coverage of black-box passive macromodeling, an approach developed by the authors Elaborates on main concepts and results in a mathematically precise way using easy-to-understand language Illustrates macromodeling concepts through dedicated examples Includes a comprehensive set of end-of-chapter problems and exercises Passive Macromodeling: theory and applications serves as a reference for senior or graduate level courses in electrical engineering programs, and to engineers in the fields of numerical modeling, simulation, design, and optimization of electrical/electronic systems. Stefano Grivet-Talocia, PhD, is an Associate Professor of Circuit theory at the Politecnico di Torino in Turin, Italy, and President of IdemWorks. Dr. Grivet-Talocia is author of over 150 technical papers published in international journals and conference proceedings. He invented several algorithms in the area of passive macromodeling, making them available through IdemWorks. Bjørn Gustavsen, PhD, is a Chief Research Scientist in Energy Systems at SINTEF Energy Re

关键词： Circuit theory \u0026 Design VLSI ULSI

来源：评论

学校读者我要写书评

暂无评论

numerical Simulation of Thermoelasticity Problems on High Performance Computing Systems 6th

Numerical Simulation of Thermoelasticity Problems on High Pe...

引用

6th International conference on Finite Difference methods - theory and applications (FDM - T and A)

作者： Sivtsev, Petr V. Vabishchevich, Petr N. Vasilyeva, Maria V. North Eastern Fed Univ Yakutsk 677000 Russia Nucl Safety Inst Moscow 115191 Russia

ISBN: (纸本)9783319202396;9783319202389

In this work we consider the coupled linear system of equations for temperature and displacements which describes the thermoelastic behaviour of the body. For numerical solution we approximate our system using finite element method. As model problem for simulation we consider the thermomechanical state of the ceramic substrates with metallization, which are used for the manufacturing of light-emitting diode modules. The results of numerical simulation of the 3D problem in the complex geometric area are presented.

关键词： Thermoelasticity

来源：评论

学校读者我要写书评

暂无评论

On Chubanov's Method for Solving a Homogeneous Inequality System 3rd

On Chubanov's Method for Solving a Homogeneous Inequality Sy...

引用

3rd International conference on numerical Analysis and Optimization - theory, methods, applications and Technology Transfer ((NAO)

作者： Roos, Kees Delft Univ Technol Delft Netherlands

ISBN: (纸本)9783319176895;9783319176888

We deal with a recently proposed method of Chubanov for solving linear homogeneous systems with positive variables. Our first aim is to show that the performance of this method can be improved by a slight modification of Chubanov's so-called Basic Procedure. In theory this results in at least the same decrease of the merit function used by Chubanov, but both in theory and in practice the decrease may be much faster. Theoretical evidence for the speed-up follows from a lemma, whereas some numerical experiments provide convincing computational evidence. We also present a complete, somewhat simplified analysis of Chubanov's Main Algorithm, thereby including also some numerical experiments.

关键词： linear homogeneous systems Algorithm Polynomial-time

来源：评论

学校读者我要写书评

暂无评论

linear KernelPCA and K-means Clustering Using New Estimated Eigenvectors of The Sample Covariance Matrix 14

Linear KernelPCA and K-means Clustering Using New Estimated ...

引用

IEEE 14th International conference on Machine Learning and applications ICMLA

作者： Gado, Nassara Elhadji Ille Grall-Maes, Edith Kharouf, Malika Univ Technol Troyes Optimisat & Safety Syst Charles Delaunay Inst F-10000 Troyes France

ISBN: (纸本)9781509002870

In this article, random matrix theory is used to propose a new K-means clustering algorithm via linear PCA. Our approach is devoted to linear PCA estimation when the number of the features d and the number of samples n go to infinity at the same rate. More precisely, we deal with the problem of building a consistent estimator of the eigenvectors of the covariance data matrix. numerical results, based on the normalized mutual information ( NMI) and the final error rate ( ER), are provided and support our algorithm, even for a small number of features/samples. We also compare our approach to spectral clustering, K-means and traditional PCA methods.

关键词： Clustering High dimensional data K-means Kernel PCA Random matrix

来源：评论

学校读者我要写书评

暂无评论

Polynomial-time algorithms for quadratic isomorphism of polynomials: The regular case

引用

JOURNAL OF COMPLEXITY 2015年第4期31卷 590-616页

作者： Berthomieu, Jeremy Faugere, Jean-Charles Perret, Ludovic Univ Paris 06 Sorbonne Univ Equipe PoLSvs LIP6 F-75005 Paris France CNRS LIP6 UMR 7606 F-75005 Paris France INRIA Equipe PoLSYs Ctr Paris Rocquencourt F-75005 Paris France

Let f = (f1,...,f(m)) and g = (g(1),...,gm) be two sets of in >= 1 nonlinear polynomials in K[x(1),...,x(n)] (K being a field). We consider the computational problem of finding - if any - an invertible transformation on the variables mapping f to g. The corresponding equivalence problem is known as Isomorphism of Polynomials with one Secret (IP1S) and is a fundamental problem in multivariate cryptography. Amongst its applications, we can cite Graph Isomorphism (GI) which reduces to equivalence of cubic polynomials with respect to an invertible linear change of variables, according to Agrawal and Saxena. The main result is a randomized polynomialtime algorithm for solving IP1S for quadratic instances a particular case of importance in cryptography. To this end, we show that IP1S for quadratic polynomials can be reduced to a variant of the classical module isomorphism problem in representation theory. We show that we can essentially linearize the problem by reducing quadratic-IP1S to test the orthogonal simultaneous similarity of symmetric matrices;this latter problem was shown by Chistov, Ivanyos and Karpinski (ISSAC 1997) to be equivalent to finding an invertible matrix in the linear space K-nxn of n x n matrices over K and to compute the square root in a certain representation in a matrix algebra. While computing square roots of matrices can be done efficiently using numerical methods, it seems difficult to control the bit complexity of such methods. However, we present exact and polynomial-time algorithms for computing a representation of the square root of a matrix in K-nxn, for various fields (including finite fields), as a product of two matrices. Each coefficient of these matrices lies in an extension field of K of polynomial degree. We then consider #IP1S, the counting version of IP1S for quadratic instances. In particular, we provide a (complete) characterization of the automorphism group of homogeneous quadratic polynomials. Finally, we also consider the mo

关键词： Quadratic forms Computer algebra Polynomial isomorphism Multivariate cryptography Module isomorphism

来源：评论

学校读者我要写书评

暂无评论

A Bipolar Approach for Intuitionistic Fuzzy Alternative Ranking

A Bipolar Approach for Intuitionistic Fuzzy Alternative Rank...

引用

IEEE International conference on Fuzzy Systems (FUZZ-IEEE)

作者： Tamani, Nouredine INRIA Sophia Antipolis Montpellier France LIRMM Montpellier Montpellier France

ISBN: (纸本)9781467374286

Ranking intuitionistic fuzzy alternatives has been widely studied by Szmidt and Kacprzyk in many work. The lake of a linear order amongst elements of intuitionistic fuzzy alternative sets, as stated in [1], oriented the researches to the definition of aggregation methods measuring the distance of each alternative to the best element of an intuitionistic fuzzy set. However, in some real applications such as raking possible items or alternatives according to positive and negative ratings, expressing respectively the satisfaction and dissatisfaction of some buyers in e-commerce applications, the distance may deliver some counter-intuitive results from the user's standpoint. Therefore, by considering intuitionistic fuzzy alternatives as particular fuzzy bipolar sets, we introduce in this paper an intuitionistic bipolar approach for alternative ranking, based on (i) two intuitionistic preference relations, namely intuitionistic more preferred than or equal to (denoted by greater than or similar to I) and intuitionistic less preferred than or equal to (denoted by less than or similar to I), each of which is a linear order, which can be used to rank bipolar alternatives attached with both degrees of acceptance (membership) and rejection (non-membership), and on (ii) two algebraic operators called Intuitionistic minimum, denoted by Imin, and Intuitionistic maximum, denoted by Imax, to compute respectively the intersection and the union of intuitionistic fuzzy bipolar alternative sets.

关键词： algebra fuzzy set theory minimax techniques aggregation method algebraic operator fuzzy bipolar sets intuitionistic bipolar approach intuitionistic fuzzy alternative ranking intuitionistic fuzzy set intuitionistic maximum intuitionistic minimum Cognition Context Decision making Footwear Fuzzy set theory Fuzzy sets Lakes Fuzzy Set theory minimax techniques footwear lakes algebra Cognition Fuzzy ambipolar decision making

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：