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

IEEE Annual International computer Software and Applications Conference (COMPSAC)

作者： Xiao-Yi Zhang Dave Towey Tsong Yueh Chen Zheng Zheng Kai-Yuan Cai Department of Automatic Control Beihang University Beijing China School of Computer Science The University of Nottingham Ningbo China China Department of Computer Science and Software Engineering Swinburne University of Technology Australia

Fault Localization Prioritization (FLP) aims at reordering existing test cases so that the location of detected faulty components can be identified earlier, using certain fault localization techniques. Although some researchers have proposed adaptive prioritization strategies with white-box code coverage information, such information may not always be available. In this paper, we address the FLP problem using black-box information derived from partitioning the input domain. Based on the well-known technique of Spectra-Based Fault Localization (SBFL), three test case prioritization strategies are designed following some basic SBFL heuristics. The implementation of these proposed strategies relies only on the partition information, and does not require any test case execution history. Experiments show that our strategies, when compared with pure random selection, result in a faster localization of faulty statements, reducing the number of test case executions required. Here, we analyze the characteristics and merits of the three proposed strategies.

关键词： computers Software Conferences

来源：评论

学校读者我要写书评

暂无评论

Packing cubes into a cube in (D>3)-dimensions 21st

Packing cubes into a cube in (D>3)-dimensions

引用

21st International Conference on Computing and Combinatorics Conference, COCOON 2015

作者： Lu, Yiping Chen, Danny Z. Cha, Jianzhong School of Mechanical Electronic and Control Engineering Beijing Jiaotong University Beijing100044 China Department of Computer Science and Engineering University of Notre Dame Notre DameIN46556 United States

ISBN: (纸本)9783319213972

The problem of determining whether a set of cubes can be orthogonally packed into a cube has been studied in 2-diminson, 3-dimension, and (d>3)-dimensions. Open questions were asked on whether this problem is NP-complete in three articles in 1989, 2005, and 2009, respectively. In 1990, the problem of packing squares into a square was shown to be NP-complete by Leung et al. Recently, the problem of packing cubes into a cube in 3-D was shown to be NP-complete by Lu et al. In this paper, we show that the problem in (d>3)-dimensions is NP-complete in the strong sense, thus settling the related open question posed by previous researchers. © Springer International Publishing Switzerland 2015.

关键词： Geometry

来源：评论

学校读者我要写书评

暂无评论

Robust sensor faults estimation with H∞ performance for Lipschitz uncertain nonlinear systems

Robust sensor faults estimation with H∞ performance for Lip...

引用

International Conference on sciences and Techniques of automatic control and computer engineering (STA)

作者： Ammar Zemzemi Mohamed Kamel Ahmed Toumi Laboratory of Science: and Techniques of Automatic Control and Computer Engineering (Lab-STA) University of Sfax PB Sfax Tunisia

ISBN: (纸本)9781467392358

This paper treats with the issue of disturbances, noises, uncertainties and sensor faults estimation for uncertain nonlinear systems whose nonlinearity satisfies the Lipschitz condition. The general idea of this approach is to establish an augmented model by supposing the sensor faults as an auxiliary state. In order to ensure the robustness of the proposed observer and guaranteed the convergence conditions, we have used the Lyapunov theory and the H ∞ criterion. So as to illustrate the design approach a control system of satellite attitude is presented.

关键词： Observers Uncertainty Robustness Nonlinear systems Simulation computers

来源：评论

学校读者我要写书评

暂无评论

Identification of FIR Systems with Quantized Inputs and Observations

引用

IFAC-PapersOnLine 2015年第28期48卷 674-679页

作者： Guo, Jin Wang, Le Yi Yin, George Zhao, Yanlong Zhang, Ji-Feng School of Automation and Electrical Engineering University of Science and Technology Beijing Beijing100083 China Department of Electrical and Computer Engineering Wayne State University DetroitMI48202 United States Department of Mathematics Wayne State University DetroitMI48202 United States Key Laboratory of Systems and Control Institute of Systems Science Academy of Mathematics and Systems Science Chinese Academy of Sciences Beijing100190 China

This paper introduces identification algorithms for finite impulse response systems under quantized output observations and general quantized inputs. While asymptotically efficient algorithms for quantized identification under periodic inputs are available, their counterpart under general inputs has encountered technical difficulties and evaded satisfactory resolutions. Under quantized inputs, this paper resolves this issue with constructive solutions. A two-step algorithm is developed, which demonstrates desired convergence properties including strong convergence, mean-square convergence, convergence rates, asymptotic normality, and asymptotical efficiency in terms of the Cramér-Rao lower bound. Some essential conditions on input excitation are derived that ensure identifiability and convergence. It is shown that by a suitable selection of the algorithm's weighting matrix, the estimates become asymptotically efficient. The strong and mean-square convergence rates are explicitly obtained. Optimal input design is discussed. Numerical examples are included to illustrate the main results of this paper © 2015

关键词： FIR filters Efficiency Identification (control systems) Impulse response Asymptotic efficiency Asymptotically efficient Finite impulse response system Identification algorithms Input design Mean square convergences non periodic input quantization

来源：评论

学校读者我要写书评

暂无评论

Reliability assessment of actuator architectures for unmanned aircraft 9

Reliability assessment of actuator architectures for unmanne...

引用

9th IFAC Symposium on Fault Detection, Supervision and Safety for Technical Processes, SAFEPROCESS 2015

作者： Venkataraman, Raghu Lukátsi, Márk Vanek, Bálint Seiler, Peter Institute for Computer Science and Control Hungarian Academy of Sciences MTA SZTAKI Hungary Department of Aerospace Engineering and Mechanics University of Minnesota UMN AEM United States

A reliability assessment framework is presented for small unmanned aerial vehicles. The analysis considers several candidate architectures with different numbers of controllable surfaces and servos. It is assumed that a servo fault detection algorithm is available and affected by known rates of false alarms and missed detections. The aircraft flight envelope is analyzed to determine the fault levels for which the aircraft can still be flown at a trim point. For these "flyable" fault levels, it is assumed that the flight control law can be reconfigured to safely land the aircraft. Finally, the probability of catastrophic failure is estimated based on the histogram of (pre-fault) control command distributions, mean time between failure of the individual servos, and missed detection and false alarm rates. In applying the framework to assess the reliability of the candidate architectures, several interesting observations on design trade-offs are made. © 2015, IFAC (International Federation of automatic control) Hosting by Elsevier Ltd. All rights reserved.

关键词： Errors

来源：评论

学校读者我要写书评

暂无评论

The Curse of Dimensionality and Variable Selection in Nonlinear Non-parametric System Identification

引用

IFAC-PapersOnLine 2015年第28期48卷 1279-1284页

作者： Bai, Er-Wei Zhao, Wenxiao Zheng, Wei Xing University of Iowa Department of Electrical and Computer Engineering Iowa52242 United States School of Electronics Electrical Engineering and Computer Science Queens University Belfast United Kingdom Key Laboratory of Systems and Control Academy of Mathematics and Systems Science National Center for Mathematics and Interdisciplinary Sciences Chinese Academy of Sciences Queens University Beijing China School of Computing Engineering and Mathematics University of Western Sydney Chinese Academy of Sciences PenrithNSW2751 Australia

The problem of variable selection in system identification of a high dimensional nonlinear non-parametric system is described. The inherent difficulty, the curse of dimensionality, is introduced. Some recent results of variable selection in system identification are presented. Finally, a simulation example is given to justify the theoretical results. © 2015

关键词： Parameter estimation Religious buildings Curse of dimensionality High dimensional Non parametric Simulation example Variable selection

来源：评论

学校读者我要写书评

暂无评论

End-to-end delay analysis for networked systems

引用

Frontiers of Information Technology & Electronic engineering 2015年第9期16卷 732-743页

作者： Jie SHEN Wen-bo HE Xue LIU Zhi-bo WANG Zhi WANG Jian-guo YAO Department of Control Science and Engineering Zhejiang University School of Computer Science Mc Gill University School of Computer Wuhan University Su zhou Institute of Wuhan University School of Software Shanghai Jiao Tong University

End-to-end delay measurement has been an essential element in the deployment of real-time services in networked systems. Traditional methods of delay measurement based on time domain analysis, however, are not efficient as the network scale and the complexity increase. We propose a novel theoretical framework to analyze the end-to-end delay distributions of networked systems from the frequency domain. We use a signal flow graph to model the delay distribution of a networked system and prove that the end-to-end delay distribution is indeed the inverse Laplace transform of the transfer function of the signal flow graph. ~vo efficient methods, Cramer＇s rule-based method and the Mason gain rule-based method, are adopted to obtain the transfer function. By analyzing the time responses of the transfer function, we obtain the end-to-end delay distribution. Based on our framework, we propose an efficient method using the dominant poles of the transfer function to work out the bottleneck links of the network. Moreover, we use the framework to study the network protocol performance. Theoretical analysis and extensive evaluations show the effectiveness of the proposed approach.

关键词： Networked system End-to-end Delay distribution

来源：评论

学校读者我要写书评

暂无评论

Sensor parametrisation and blending: A group theoretic approach 9

Sensor parametrisation and blending: A group theoretic appro...

引用

9th IFAC Symposium on Fault Detection, Supervision and Safety for Technical Processes, SAFEPROCESS 2015

作者： Szabó, Z. Balas, G. Gáspár, P. Bokor, J. Institute for Computer Science and Control Hungarian Academy of Sciences Kende u. 13-17 Budapest Hungary Department of Aerospace Engineering and Mechanics University of Minnesota 107 Akerman Hall 110 Union St SE MinneapolisMN55455 United States Institute for Computer Science and Control Hungarian Academy of Sciences MTA-BME Control Engineering Research Group Hungary

Sensors play an important role in the control loop. Often they are considered to be a part of the plant and the interaction between the plant and sensor is disregarded. In this paper we investigate stability properties of the control loop when this interface is considered explicitly from an input/output perspective. Making the assumption that the sensor is stable, we provide a Youla type characterisation of all the sensors that renders the loop stable for a fixed plant and controller. When none of the sensors can provide the necessary performance it is time for sensor blending or a sensor reconfiguration. The simplest form of sensor fusion, i.e., a linear combination of the sensors, does not preserve stability of the control loop, in general. In order to design efficient algorithms that operate on the set of controllers or a set of sensors that fulfil a given property, e.g., stability or a norm bound, it is important to have an operation that preserves that property, i.e., a suitable blending method. This paper places the sensor blending problem in a more general context: an operation on stable sensors is given under which feedback stability is preserved and under which sensors form a group, the sensor group. Under the action of this group operation changes in different sensitivities can be also expressed in explicit terms. These results can be applied in the analysis and synthesis of schemes with sensor reconfiguration. © 2015, IF AG (International Federation of automatic control) Hosting by Elsevier Ltd. All rights reserved.

关键词： Blending

来源：评论

学校读者我要写书评

暂无评论

Distributed coordination in multi-agent systems： a graph Laplacian perspective

引用

Frontiers of Information Technology & Electronic engineering 2015年第6期16卷 429-448页

作者： Zhi-min HAN Zhi-yun LIN Min-yue FU Zhi-yong CHEN State Key Laboratory of Industrial Control Technology College of Electrical Engineering Zhejiang University Hangzhou 310027 China School of Electrical Engineering and Computer Science University of Newcastle Callaghan NSW 2308 Australia State Key Laboratory of Industrial Control Technology Department of Control Science and Engineering Zhejiang University Hangzhou 310027 China

This paper reviews some main results and progress in distributed multi-agent coordination from a graph Laplacian perspective. Distributed multi-agent coordination has been a very active subject studied extensively by the systems and control community in last decades, including distributed consensus, formation control, sensor localization, distributed optimization, etc. The aim of this paper is to provide both a comprehensive survey of existing literature in distributed multi-agent coordination and a new perspective in terms of graph Laplacian to categorize the fundamental mechanisms for distributed coordination. For different types of graph Laplacians, we summarize their inherent coordination features and specific research issues. This paper also highlights several promising research directions along with some open problems that are deemed important for future study.

关键词： Multi-agent systems Distributed coordination Graph Laplacian

来源：评论

学校读者我要写书评

暂无评论

IQC arguments for analysis of the 3-state Moore-Greitzer compressor system

IQC arguments for analysis of the 3-state Moore-Greitzer com...

引用

作者： Shiriaev, A.S. Freidovich, L.B. Robertsson, A. Andersson, A. Johansson, R. Department of Engineering Cybernetics Norwegian University of Science and Technology TrondheimNO-7491 Norway Department of Applied Physics and Electronics UmeåUniversity UmeåSE-901 87 Sweden Department of Automatic Control Lund University LundSE-221 00 Sweden

The Integral Quadratic Constraint (IQC) framework developed by Professor Yakubovich and his co-workers, see Yakubovich ***. (2004), is one of few available constructive tools for establishing robust stability of nonlinear systems. An explicit format of stability conditions, procedures for computing a Lyapunov function and developed libraries of IQCs for common nonlinearities in dynamics, all together have made the approach unique and at the same time so to say automatic for recovering stability conditions for many applications: in the process of analyzing a dynamical system, an engineer is just required to search for a suficiently rich set of IQCs describing nonlinearities in the dynamics so that such nonlinearities can be substituted in analysis by quadratic constraints, which they satisfy. The power of the methodology becomes also its weak part in an analysis of concrete systems. Searching IQCs is the dificult task in new examples, where a lack of a rich set of IQCs for concrete nonlinearities makes the method inconclusive or too rough to detect (in)-stability. The paper is aimed at a discussion of such an example of a nonlinear dynamical system (the classical 3-state Moore-Greitzer compressor model) augmented with the dynamical feedback controller, whose parameters should be adjusted to meet a stability condition. The closed-loop system has several nonlinearities and searching the corresponding IQCs to meet the stability conditions for this example is rather involved. To overcome the problem, we have previously described by different methods a set of parameters for which any solution of the closed loop system, if bounded, will converge to the origin and that the origin is locally asymptotically stable. However, the proof is incomplete without showing a boundedness of all solutions. To solve the task we have re-used some of the IQC framework ideas, where the method has been utilized and the corresponding IQCs have been found only for unbounded trajectories, if t

关键词： Lyapunov functions

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：