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

Robust Fault-tolerant Iterative Learning control for Discrete Systems via Linear Repetitive Processes Theory

International Journal of Automation and computing 2015年第3期12卷 254-265页

作者： Jian Ding Blazej Cichy Krzysztof Galkowski Eric Rogers Hui-Zhong Yang Key Laboratory of Advanced Process Control for Light Industry (Ministry of Education) Jiangnan University Institute of Control and Computation Engineering University of Zielona Gora Department of Electronics and Computer Science University of Southampton

This paper addresses the problem of robust iterative learning control design for a class of uncertain multiple-input multipleoutput discrete linear systems with actuator faults. The stability theory for linear repetitive processes is used to develop formulas for gain matrices design, together with convergent conditions in terms of linear matrix inequalities. An extension to deal with model uncertainty of the polytopic or norm bounded form is also developed and an illustrative example is given.

关键词： Iterative learning control linear repetitive processes linear matrix inequality(LMI) discrete linear systems fault-tolerant cont

来源：评论

学校读者我要写书评

暂无评论

Neural networks in design of iterative learning control for nonlinear systems

引用

IFAC-PapersOnLine 2017年第1期50卷 13402-13407页

作者： Patan, Krzysztof Patan, Maciej Kowalów, Damian Institute of Control and Computation Engineering University of Zielona Góra ul. Szafrana 2 Zielona Gora65-516 Poland

An approach to control design for nonlinear system working under repetitive regime is presented. The general iterative learning control scheme is enhanced with a neural network controller to reduce the uncertainty of the model used for the control design. To achieve this goal an effective data-driven technique for training neural controller is developed. In result, in each process trial, both the control performance and process model can be substantially improved. Also, the stability issues of the neural controller are discussed. Finally, as an illustration of the proposed approach the application to nonlinear pneumatic servomechanism is given. © 2017

关键词： Process control controllers Iterative methods Learning algorithms Learning systems Neural networks Nonlinear systems Two term control systems control design control performance Data driven technique Iterative learning control Neural controller Neural network controllers Process Modeling Stability issues

来源：评论

学校读者我要写书评

暂无评论

Protecting privacy of GPS trails by anonymization of the road graph 1

Protecting privacy of GPS trails by anonymization of the roa...

引用

1st International ACM SIGSPATIAL Workshop on Smart Cities and Urban Analytics, UrbanGIS 2015

作者： Kamola, Mariusz Institute of Control and Computation Engineering Warsaw University of Technology Warsaw00665 Poland

ISBN: (纸本)9781450339735

The problem of anonymization of car GPS traces is addressed. Unlike the existing approaches, we propose to preserve anonymity of the whole road graph, while performing accurate GPS location projection onto that graph edges. Projected locations are denoted by their distances from graph vertices, which allows to perform many analytical tasks, in a graph abstracted from physical node locations. With adequately selected subset of samples, the released data will still be enough to perform refined analysis, e.g. of the driving style, while preserving the anonymity of the graph. Possible deanonymization attacks and countermeasures are discussed shortly. © 2015 ACM.

关键词： Roads and streets

来源：评论

学校读者我要写书评

暂无评论

Constrained actuator fault tolerant control with the application to a wind turbine

引用

IFAC-PapersOnLine 2018年第24期51卷 1157-1163页

作者： Witczak, Piotr Pazera, Marcin Patan, Krzysztof Witczak, Marcin Institute of Control and Computation Engineering University of Zielona Góra ul. Szafrana 2 Zielona Góra65-519 Poland

The paper deals with an actuator fault tolerant control (FTC) under constraints for wind turbines. The main issue is to keep a desired value of turbine efficiency coefficient and minimization of tip-speed-ratio. The proposed strategy relies on following stages: a fault is estimated first and then it is compensated with a robust controller. If the compensation is not sufficient, the invariant-set FTC is employed and predictive scheme is utilized. The main goal of predictive approach is to enhance the domain of attraction of a faulty wind turbine. The paper introduces the wind turbine system, benchmark environment and specifies the methodology of solving the formulated FTC problem. The paper presents also application of the considered FTC system to a wind turbine with a special attention on the realization of the following steps of the FTC procedure. © 2018

关键词： Wind turbines Actuators controllers Fault tolerance Actuator fault Domain of attraction Fault estimation Fault tolerant control Robust controllers Tip speed ratio Turbine efficiency Wind turbine systems

来源：评论

学校读者我要写书评

暂无评论

Measuring the real-time operating system performance

Measuring the real-time operating system performance

引用

7th Euromicro Workshop on Real-Time Systems, ECRTS 1995

作者： Sacha, Krzysztof M. Institute of Control and Computation Engineering Warsaw University of Technology 00-665 Warsaw Poland

ISBN: (纸本)0818671122

Tests for measuring the real time operating system performance belong to the software technology. They give quantitative measures for the most important characteristics and allow the implementer to compare the efficiency of various operating systems. The paper presents a set of simple tests for measuring the real time operating system characteristics. The tests require no specialized hardware, and are based on direct measuring of the duration of execution of sequences of system functions. All tests described in the paper have been applied to measure the efficiency of a distributed operating system QNX. The measurements include the speed of intertask communication through messages, proxies and signals, and the speed of task switching and timer interrupt handling. The results are presented in a series of easily readable tables. © 1995 IEEE.

关键词： Efficiency

来源：评论

学校读者我要写书评

暂无评论

Multispectral hand features for secure biometric authentication systems

Multispectral hand features for secure biometric authenticat...

引用

作者： Bartuzi, Ewelina Trokielewicz, Mateusz Warsaw Poland Institute of Control and Computation Engineering Warsaw University of Technology Warsaw Poland

With rapid growth of mobile-based computing, reliable security and user authentication methods are necessary. This article proposes a proof-of-concept biometric authentication method utilizing hand images collected in different light spectra. An analysis of similarity between pattern of blood vessels extracted from near-infrared images and thermal images and assessment of the correlation between individual biometric features contained in each image type is also performed. Results indicate a large potential of using thermal images in biometrics more extensively than now. Also proposed and evaluated are biometric recognition methods based on images of the hand acquired in visible light, near infrared, and using thermal infrared sensors. Two approaches were used to assess information content in images of each type: one based on texture descriptor and one employing convolutional neural networks. In an evaluation gathering data from 104 subjects, the former yielded the lowest equal error rate (EER) of (Formula presented.), whereas the latter approach gave (Formula presented.) for thermal images. Finally, fusion of different-spectra modalities increases accuracy and further reduces EER to (Formula presented.). This is, to the authors' best knowledge, the first study exploring the concept of fusing different spectral representations of the human hand for the purpose of biometric recognition. © 2021 John Wiley & Sons Ltd.

关键词： Palmprint recognition

来源：评论

学校读者我要写书评

暂无评论

On optimization of the importance weighted OWA aggregation of multiple criteria

On optimization of the importance weighted OWA aggregation o...

引用

International Conference on computational Science and its Applications, ICCSA 2007

作者： Ogryczak, Wlodzimierz Śliwiński, Tomasz Warsaw University of Technology Institute of Control and Computation Engineering 00-665 Warsaw Poland

ISBN: (纸本)9783540744689

The problem of aggregating multiple numerical criteria to form overall objective functions is of considerable importance in many disciplines. The ordered weighted averaging (OWA) aggregation, introduced by Yager, uses the weights assigned to the ordered values rather than to the specific criteria. This allows one to model various aggregation preferences, preserving simultaneously the impartiality (neutrality) with respect to the individual criteria. However, importance weighted averaging is a central task in multicriteria decision problems of many kinds. It can be achieved with the Weighted OWA (WOWA) aggregation though the importance weights make the WOWA concept much more complicated than the original OWA. We show that the WOWA aggregation with monotonie preferential weights can be reformulated in a way allowing to introduce linear programming optimization models, similar to the optimization models we developed earlier for the OWA aggregation. computational efficiency of the proposed models is demonstrated. © Springer-Verlag Berlin Heidelberg 2007.

关键词： Functional analysis

来源：评论

学校读者我要写书评

暂无评论

Sequential algorithms for Max-Min fair bandwidth allocation

引用

European Computing Conference

作者： Ogryczak, Wlodzimierz Śliwiński, Tomasz Institute of Control and Computation Engineering Warsaw University of Technology 00-665 Warsaw Poland

ISBN: (纸本)9780387848136

Telecommunications networks are facing an increasing demand for Internet services. Therefore, a problem of network dimensioning with elastic traffic arises, which requires the allocation of bandwidth to maximize service flows with fair treatment for all the services. In such applications, the so-called Max-Min Fairness (MMF) solution is widely used to formulate the resource allocation scheme. It assumes that the worst service performance is maximized, and the solution is additionally regularized with the lexicographic maximization of the second worst performance, the third worst, etc. Because of lexicographic maximization of ordered quantities, the MMF solution cannot be tackled by the standard optimization model. It can be formulated as a sequential lexicographic optimization procedure. Unfortunately, the basic sequential procedure is applicable only for convex models;thus it allows dealing with basic design problems, but fails if practical discrete restrictions commonly arising in telecommunications network design are to be taken into account. In this paper we analyze alternative sequential approaches allowing the solving of nonconvex MMF network dimensioning problems. Both of our approaches are based on sequential optimization of directly defined artificial criteria. The criteria can be introduced into the original model with some auxiliary variables and linear inequalities;thus the methods are easily implementable. © 2009 Springer Science+Business Media, LLC.

关键词： Bandwidth

来源：评论

学校读者我要写书评

暂无评论

On direct methods for Lexicographic Min-Max optimization

On direct methods for Lexicographic Min-Max optimization

引用

ICCSA 2006: International Conference on computational Science and Its Applications

作者： Ogryczak, Wlodzimierz Śliwiński, Tomasz Warsaw University of Technology Institute of Control and Computation Engineering 00-665 Warsaw Poland

ISBN: (纸本)3540340750

The approach called the Lexicographic Min-Max (LMM) optimization depends on searching for solutions minimal according to the lex-max order on a multidimensional outcome space. LMM is a refinement of the standard Min-Max optimization, but in the former, in addition to the largest outcome, we minimize also the second largest outcome (provided that the largest one remains as small as possible), minimize the third largest (provided that the two largest remain as small as possible), and so on. The necessity of point-wise ordering of outcomes within the lexicographic optimization scheme causes that the LMM problem is hard to implement. For convex problems it is possible to use iterative algorithms solving a sequence of properly defined Min-Max problems by eliminating some blocked outcomes. In general, it may not exist any blocked outcome thus disabling possibility of iterative Min-Max processing. In this paper we analyze two alternative optimization models allowing to form lexicographic sequential procedures for various nonconvex (possibly discrete) LMM problems. Both the approaches are based on sequential optimization of directly defined artificial criteria. The criteria can be introduced into the original model with some auxiliary variables and linear inequalities thus the methods are easily implementable. © Springer-Verlag Berlin Heidelberg 2006.

关键词： Algorithms

来源：评论

学校读者我要写书评

暂无评论

On decision support under risk by the WOWA optimization

On decision support under risk by the WOWA optimization

引用

9th European Conference on Symbolic and Qualitative Approaches to Reasoning with Uncertainty, ECSQARU 2007

作者： Ogryczak, Wlodzimierz Śliwiński, Tomasz Warsaw University of Technology Institute of Control and Computation Engineering 00-665 Warsaw Poland

ISBN: (纸本)9783540752554

The problem of averaging outcomes under several scenarios to form overall objective functions is of considerable importance in decision support under uncertainty. The fuzzy operator defined as the so-called Weighted OWA (WOWA) aggregation offers a well-suited approach to this problem. The WOWA aggregation, similar to the classical ordered weighted averaging (OWA), uses the preferential weights assigned to the ordered values (i.e. to the worst value, the second worst and so on) rather than to the specific criteria. This allows one to model various preferences with respect to the risk. Simultaneously, importance weighting of scenarios can be introduced. In this paper we analyze solution procedures for optimization problems with the WOWA objective function. A linear programming formulation is introduced for optimization of the WOWA objective with monotonie preferential weights. Its computational efficiency is analyzed. © Springer-Verlag Berlin Heidelberg 2007.

关键词： Decision support systems

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：