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

Distributed Online Convex Optimization with Time-Varying Constraints: Tighter Cumulative Constraint Violation Bounds under Slater's Condition

引用

IEEE Transactions on Automatic control 2025年

作者： Yi, Xinlei Li, Xiuxian Yang, Tao Xie, Lihua Hong, Yiguang Chai, Tianyou Johansson, Karl H. National Key Laboratory of Autonomous Intelligent Unmanned Systems Shanghai Institute of Intelligent Science and Technology China Ministry of Education Frontiers Science Center for Intelligent Autonomous Systems China Massachusetts Institute of Technology Lab for Information & Decision Systems CambridgeMA02139 United States Northeastern University State Key Laboratory of Synthetical Automation for Process Industries Shenyang110819 China Nanyang Technological University School of Electrical and Electronic Engineering 50 Nanyang Avenue 639798 Singapore Kth Royal Institute of Technology Division of Decision and Control Systems School of Electrical Engineering and Computer Science Sweden Digital Futures Stockholm10044 Sweden

This paper considers distributed online convex optimization with time-varying constraints. In this setting, a network of agents makes decisions at each round, and then only a portion of the loss function and a coordinate block of the constraint function are privately revealed to each agent. The loss and constraint functions are convex and can vary arbitrarily across rounds. The agents collaborate to minimize static network regret and network cumulative constraint violation. A novel distributed online algorithm with a vanishing stepsize is proposed and it achieves an O(Tmax {c,1-c}) static network regret bound and an O(T1-c/2) network cumulative constraint violation bound, where T is the number of rounds and c∈ (0,1) is a user-defined trade-off parameter. When Slater's condition holds (i.e, there is a point that strictly satisfies the inequality constraints), the network cumulative constraint violation bound is reduced to O(T1-c). Moreover, if the loss functions are strongly convex, then static network regret bound is reduced to O(log (T)), and the network cumulative constraint violation bound is reduced to O(√log (T)T) and O(log (T)) without and with Slater's condition, respectively. To the best of our knowledge, this paper is the first to achieve tighter (network) cumulative constraint violation bounds for (distributed) online convex optimization with time-varying constraints under Slater's condition. Finally, the theoretical results are verified through numerical simulations. © 1963-2012 IEEE.

关键词： Convex optimization

来源：评论

学校读者我要写书评

暂无评论

Abstraction and counterexample-guided refinement in model checking of hybrid systems

引用

International Journal of Foundations of computer Science 2003年第4期14卷 583-604页

作者： Clarke, Edmund Fehnker, Ansgar Han, Zhi Krogh, Bruce Ouaknine, Joël Stursberg, Olaf Theobald, Michael Computer Science Department Carnegie Mellon University Pittsburgh PA 15213 United States Electrical and Computer Engineering Carnegie Mellon University Pittsburgh PA 15213 United States Process Control Lab (CT-AST) University of Dortmund 44221 Dortmund Germany

Hybrid dynamic systems include both continuous and discrete state variables. Properties of hybrid systems, which have an infinite state space, can often be verified using ordinary model checking together with a finite-state abstraction. Model checking can be inconclusive, however, in which case the abstraction must be refined. This paper presents a new procedure to perform this refinement operation for abstractions of hybrid systems. Following an approach originally developed for finite-state systems [11, 25], the refinement procedure constructs a new abstraction that eliminates a counterexample generated by the model checker. For hybrid systems, analysis of the counterexample requires the computation of sets of reachable states in the continuous state space. We show how such reachability computations with varying degrees of complexity can be used to refine hybrid system abstractions efficiently. Examples illustrate our counterexample-guided refinement procedure. Experimental results for a prototype implementation indicate significant advantages over existing methods. © 2003 World Scientific Publishing Company.

关键词： Abstraction hybrid systems infinite-state systems model checking refinement verification

来源：评论

学校读者我要写书评

暂无评论

Localize and segment scene text

Localize and segment scene text

引用

14th Pacific-Rim Conference on Multimedia, PCM 2013

作者： Liu, Xiaoqian Wang, Weiqiang School of Computer and Control Engineering University of Chinese Academy of Sciences Beijing China Key Lab of Intell. Info. Process. CAS Institute of Computing Technology Beijing China

ISBN: (纸本)9783319037301

In this paper, we present a scene text extraction approach which can realize text localization and segmentation simultaneously. Two popular paradigms (machine learning method and rule-based method) are combined to achieve competitive performance. For a given image, a sliding window is used to detect scene text. The texture feature Local Binary Pattern is extracted to represent the content of each window, and an unbalanced SVM classifier is designed to identify candidate text regions. Then, candidate text windows are further verified using color contrast and binarized by an adaptive local thresholding computation to get candidate text connected components. Further, non-text ones among them are removed utilizing some empirical rules. Finally, text connected components are linked into text lines according to their spatial relationships and appearance similarities. The evaluation results on two challenging and standard datasets ICDAR 2003 and ICDAR 2011 demonstrate that the proposed approach can effectively detect and segment scene text with different sizes, fonts, colors and arrangement directions. © Springer International Publishing Switzerland 2013.

关键词： Local binary pattern

来源：评论

学校读者我要写书评

暂无评论

Verification of hybrid systems based on counterexample-guided abstraction refinement

Verification of hybrid systems based on counterexample-guide...

引用

9th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, TACAS 2003 Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2003

作者： Clarke, Edmund Fehnker, Ansgar Han, Zhi Krogh, Bruce Stursberg, Olaf Theobald, Michael Computer Science Carnegie Mellon University PittsburghPA United States Electrical and Computer Engineering Carnegie Mellon University PittsburghPA United States Process Control Lab University of Dortmund Germany

ISBN: (纸本)3540008985

Hybrid dynamic systems include both continuous and discrete state variables. Properties of hybrid systems, which have an infinite state space, can often be verified using ordinary model checking together with a finite-state abstraction. Model checking can be inconclusive, however, in which case the abstraction must be refined. This paper presents a new procedure to perform this refinement operation for abstractions of infinite-state systems, in particular of hybrid systems. Following an approach originally developed for finite-state systems [1,2], the refinement procedure constructs a new abstraction that eliminates a counterexample generated by the model checker. For hybrid systems, analysis of the counterexample requires the computation of sets of reachable states in the continuous state *** showhowsuch reachability computations with varying degrees of complexity can be used to refine hybrid system abstractions efficiently. A detailed example illustrates our counterexample-guided refinement procedure. Experimental results for a prototype implementation of the procedure indicate its advantages over existing methods. © Springer-Verlag Berlin Heidelberg 2003.

关键词： Hybrid systems

来源：评论

学校读者我要写书评

暂无评论

Performance assessment of nonlinear state filters

Performance assessment of nonlinear state filters

引用

8th International Symposium on Advanced control of Chemical processes, ADCHEM 2012

作者： Tulsyan, A. Huang, B. Gopaluni, R.B. Forbes, J.F. Department of Chemical and Materials Engineering Computer Process Control Group University of Alberta Edmonton T6G-2G6 Canada Department of Chemical and Biological Engineering Process Modeling and Control Lab University of British Columbia Vancouver V6T-1Z3 Canada

ISBN: (纸本)9783902823052

Nonlinear state filters of different approximations and capabilities have been developed in the last decade. The quality of different nonlinear filters, in terms of the mean squared error (MSE) of the estimates, depends on the approximations used in the filtering algorithm;however, there are no known methods for effectively evaluating the relative performance of these filters. A new method which measures the performance of different state filters against the theoretical posterior Cramér-Rao lower bound (PCRLB) is proposed. The complex high-dimensional integrals in PCRLB are approximated using sequential Monte-Carlo (SMC) methods. Efficacy of the proposed method is illustrated through a simulation example. © 2012 IFAC.

关键词： Mean square error

来源：评论

学校读者我要写书评

暂无评论

Fuzzy support vector clustering

Fuzzy support vector clustering

引用

3rd International Symposium on Neural Networks, ISNN 2006 - Advances in Neural Networks

作者： Zheng, En-Hui Yang, Min Li, Ping Song, Zhi-Huan College of Information and Electronic Engineering Zhejiang Gongshang University Hang Zhou 310035 China National Lab. of Industrial Control Technology Institute of Industrial Process Control Zhejiang University Hang Zhou 310027 China Computer School Hangzhou Dianzi University Hang Zhou 310018 China

ISBN: (纸本)354034439X

Support vector clustering (SVC) faces the same over-fitting problem as support vector machine (SVM) caused by outliers or noises. Fuzzy support vector clustering (FSVC) algorithm is presented to deal with the problem. The membership model based on k-NN is used to determine the membership value of training samples. The proposed fuzzy support vector clustering algorithm is used to determine the clusters of some benchmark data sets. Experimental results indicate that the proposed algorithm actually reduces the effect of outliers and yields better clustering quality than SVC and traditional centroid-based hierarchical clustering algorithm do. © Springer-Verlag Berlin Heidelberg 2006.

关键词： Learning systems

来源：评论

学校读者我要写书评

暂无评论

Cognition-oriented building blocks of future benchmark scenarios for humanoid home robots

Cognition-oriented building blocks of future benchmark scena...

引用

2007 AAAI Workshop

作者： Burghart, Catherina R. Mikut, Ralf Holzapfel, Hartwig Institute of Process Control and Robotics University of Karlsruhe D-76128 Karlsruhe Germany Forschungszentrum Karlsruhe GmbH Institute of Applied Computer Science P.O. Box 3640 D-76021 Karlsruhe Germany Interactive Systems Lab. University of Karlsruhe D-76128 Karlsruhe Germany

ISBN: (纸本)9781577353317

Comparing intelligent robots interacting with humans is a difficult task. First of all, robotic helps in everyday life can be involved in different tasks. Additionally, the grade of autonomy of the robot and the type of interaction between human and robot may differ to a great extent. It also is an intricate task to design common metrics to assess human-robot interaction. Thus normal benchmarks fail in this case. After an overview of already existing benchmarks in robotics this paper sketches affordances for benchmarks for human-robot interaction in a home environment. Many aspects of already existing benchmarks, evaluation criteria, and metrics have to be combined to asses human-robot interaction in a complex environment. The great difficulty is measuring human and robot behavior;here novel approaches taking into account perspectives from different fields (i.e. engineers, psychologists, sociologist) are needed, as a human being does not behave as anticipated by the system designer most of the time. Copyright © 2007, Association for the Advancement of Artificial Intelligence (***). All rights reserved.

关键词： Human robot interaction

来源：评论

学校读者我要写书评

暂无评论

Performance Assessment of Nonlinear State Filters

引用

IFAC Proceedings Volumes 2012年第15期45卷 371-376页

作者： A. Tulsyan B. Huang R.B Gopaluni J.F Forbes Computer Process Control Group Department of Chemical and Materials Engineering University of Alberta Edmonton Canada T6G-2G6 Process Modeling and Control Lab Department of Chemical and Biological Engineering University of British Columbia Vancouver Canada V6T-1Z3

Nonlinear state filters of different approximations and capabilities have been developed in the last decade. The quality of different nonlinear filters, in terms of the mean squared error (MSE) of the estimates, depends on the approximations used in the filtering algorithm; however, there are no known methods for effectively evaluating the relative performance of these filters. A new method which measures the performance of different state filters against the theoretical posterior Cramér-Rao lower bound (PCRLB) is proposed. The complex high-dimensional integrals in PCRLB are approximated using sequential Monte-Carlo (SMC) methods. Efficacy of the proposed method is illustrated through a simulation example.

关键词：

来源：评论

学校读者我要写书评

暂无评论

A DATA-BASED MEASURE FOR INTERACTIONS IN MULTIVARIATE SYSTEMS

引用

IFAC Proceedings Volumes 2006年第2期39卷 681-686页

作者： M. Rossi A.K. Tangirala S.L. Shah C. Scali Computer Process Control Lab Dept. of Chemical Engineering University of Pisa Pisa Italy Dept. of Chemical Engineering IIT Madras Chennai India Department of Chemical & Materials Engineering - University of Alberta Edmonton Canada

This article focusses on the control loop performance diagnosis of a multivariate system with emphasis on the presence of interactions and poor performance of control loops. The paper provides a data-driven technique to determine if a decentralized PI(D) + controller will suffice or if an advanced controller ( e.g. , MPC) is necessary to handle the control interactions and improve the loop performance. Two different techniques are proposed: the first one, based on the Power Spectrum of the error, analyzes interactions in the frequency domain, while the second one, based on the evaluation of a modified IAE (Integral of Absolute Error), analyzes interactions in the time domain. A performance index for the controller is also proposed for the case of set-point tracking. Simulation and experimental case studies are presented to highlight the applicability of the proposed techniques.

关键词： Interactions MIMO systems frequency domain time domain

来源：评论

学校读者我要写书评

暂无评论

Multi-view Subspace Learning with Diversity Enforced Skeleton Embedding

Multi-view Subspace Learning with Diversity Enforced Skeleto...

引用

IEEE International Conference on Multimedia Big Data (BigMM)

作者： Shijie Yang Liang Li Shuhui Wang Weigang Zhang Qingming Huang School of Computer and Control Engineering University of Chinese Academy of Sciences Beijing China Key Lab of Intel. Info. Process Chinese Academy of Scicences School of Computer Science and Technology Harbin Institute of Technology Weihai China

ISBN: (纸本)9781509065509

We consider the task of multi-view subspace learning which integrates multi-view information to learn a unified representation for multimedia data. In real-world scenarios, we encounter views with high diversities of semantic levels. Neglecting the problem of semantic inconsistency, existing graph-based methods directly convert heterogeneous information into local affinity matrices to conduct a fusion process, which inevitably destroys the valuable high-semantic-level structure. To address semantic inconsistency, we propose Multi-view Subspace Skeleton Embedding (MSSE), in which the high-level semantic structure of the learned subspace is explicitly taken as the skeleton of the learned subspace. Specifically, cooperating with a set of anchor points, the high-level semantic structure is adopted as semantic constraints to guide the multi-graph learning process based on RESCAL tensor factorization. To guarantee sufficient geometric coverage of the skeleton in the learned subspace, we enforce the diversity of anchor points by a Determinantal Point process (DPP) regularizer. Compared with traditional methods, the learned subspace is endowed with higher semantic consistency and more robust to noisy views. Experiments on real-world image datasets demonstrate the promising performance comparing to state-of-the-art graph-based methods.

关键词： Semantics Skeleton Tensile stress Multimedia communication Robustness Noise measurement Image reconstruction

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：