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

ADAPTATION AND TRACKING IN SYSTEM-IDENTIFICATION - A SURVEY

AUTOMATICA 1990年第1期26卷 7-21页

作者： LJUNG, L GUNNARSSON, S Division of Automatic Control Department of Electrical Engineering Linköping University S-58183 Linköping Sweden

To track the time-varying dynamics of a system or the time-varying properties of a signal is a fundamental problem in control and signal processing. Many approaches to derive such adaptation algorithms and to analyse their behaviour have been taken. This article gives a survey of basic techniques to derive and analyse algorithms for tracking time-varying systems. Special attention is paid to the study of how different assumptions about the true system's variations affect the algorithm. Several explicit and semi-explicit expressions for the mean square error are derived, which clearly demonstrate the character of the trade-off between tracking ability and noise rejection.

关键词： adaptive systems recursive algorithms System identification time-varying systems

来源：评论

学校读者我要写书评

暂无评论

The Hierarchical Weighted Multi-State k-out-of-n System Model and Its Application for Infrastructure Management

引用

IEEE TRANSACTIONS ON RELIABILITY 2010年第3期59卷 593-603页

作者： Ding, Yi Zuo, Ming J. Tian, Zhigang Li, Wei Nanyang Technol Univ Sch EEE Singapore 639798 Singapore Univ Alberta Dept Mech Engn Edmonton AB T6G 2G8 Canada Concordia Univ Concordia Inst Informat Syst Engn Montreal PQ H3G 1M8 Canada Citigrp Ctr London E14 5LB England

A multi-state system (MSS) model is a more flexible tool for representing engineering systems than the conventional binary system model, which has been widely studied in recent research. The multi-state weighted k-out-of-n system model is the generalization of the multi-state k-out-of-n system model, where the component i in state j carries a certain utility. In this paper, we propose a multi-state system structure called hierarchical weighted multi-state k-out-of-n systems. In such a system, the structure of the system can be decomposed into different hierarchical levels, and a subsystem at each level can be represented using a multi-state weighted k-out-of-n structure. The proposed system structure can find applications in many real life systems, and a municipal infrastructure is a typical example of such a structure. The definition of the hierarchical multi-state weighted k-out-of-n system model is proposed in this paper. Universal generating functions (UGF) are used to evaluate reliabilities of the defined systems. Moreover, to reduce computational complexity, recursive algorithms are developed to obtain lower, and upper bounds of the defined system reliabilities.

关键词： Hierarchical infrastructure k-out-of-n multi-state system recursive algorithms universal generating functions

来源：评论

学校读者我要写书评

暂无评论

Dynamic simulation and neural network compliance control of an intelligent forging center

引用

JOURNAL OF INTELLIGENT & ROBOTIC SYSTEMS 1996年第1期17卷 81-99页

作者： Lilly, KW Melligeri, AS STATDESIGN INC DEARBORN MI 48120 USA

Automation of forging processes is important for both safety and efficiency in today's advanced manufacturing operations. This work supports the development of an Intelligent Open Die Forging System which will integrate state-of-the-arc modelling techniques, automatic die selection and sequencing, full system dynamic simulation, automatic machine programming and coordination, and sensor-based process control to enable the production of more general and complex workpiece geometries than are achievable using current forging methods. Effective automation of this open die forging system requires the coordination and control of the major system components: press, robot, and furnace. In particular, forces exerted on the robot through its manipulation of the workpiece during forging must be minimized to avoid damage to the manipulator mechanism. In this paper, the application of neural networks for compliance control of the forging robot to minimize these forces is investigated. Effectiveness ol the neural network-based compliance control module is evaluated through a full dynamic system simulation, which will later form a central part of the complete Intelligent Forging System. Dynamic simulation of the robot is achieved using an efficient O(N) recursive algorithm, while material flow of the workpiece is modeled with a finite element approach. Simulation and timing results for the complete processing system for a specific open die forging example are presented.

关键词： forging automation compliance control neural networks dynamic simulation finite element models recursive algorithms intelligent manufacturing

来源：评论

学校读者我要写书评

暂无评论

An enumerative algorithm for solving nonconvex dynamic DEA models

引用

OPTIMIZATION LETTERS 2013年第1期7卷 101-115页

作者： Soleimani-damaneh, M. Univ Tehran Coll Sci Sch Math Stat & Comp Sci Tehran Iran

This paper provides a recursive enumeration algorithm for solving the nonconvex dynamic DEA models, to obtain cost minimum under nonconvex technologies. The validity of the algorithm is proved through some theorems. An illustrative example as well as a computational discussion are given to demonstrate the advantages of the proposed algorithm.

关键词： Dynamic DEA FDH Nonconvex models Enumeration algorithms recursive algorithms

来源：评论

学校读者我要写书评

暂无评论

IMAGE MOTION ESTIMATION algorithms USING CUMULANTS

引用

IEEE TRANSACTIONS ON IMAGE PROCESSING 1995年第3期4卷 346-357页

作者： ANDERSON, JMM GIANNAKIS, GB UNIV VIRGINIA DEPT ELECT ENGNCHARLOTTESVILLEVA 22903

A class of algorithms is presented that estimates the displacement vector from two successive image frames consisting of signal plus noise, In our model, the signals are assumed to be either non-Gaussian or (quasistationary) deterministic;and, via a consistency result for cumulant estimators, we unify the stochastic and deterministic signal viewpoints, The noise sources are assumed to be Gaussian (perhaps spatially and temporally correlated) and of unknown covariance. Viewing image motion estimation as a 2-D time delay estimation problem, the displacement vector of a moving object is estimated by solving linear equations involving third-order auto-cumulants and cross-cumulants. Additionally, a block-matching algorithm is developed that follows from a cumulant-error optimality criterion, Finally, the displacement vector for each pel is estimated using a recursive algorithm that minimizes a mean 2-D fourth order cumulant criterion, Simulation results are presented and discussed.

关键词： Dislocated Workers CUMULANT recursive algorithms motion estimation Noise sources algorithms deterministic signal Image pixel Stochastic Non-Gaussian Linear equation

来源：评论

学校读者我要写书评

暂无评论

ROUND-OFF ERROR PROPAGATION IN 4 GENERALLY-APPLICABLE, recursive, LEAST-SQUARES ESTIMATION SCHEMES

引用

AUTOMATICA 1989年第3期25卷 437-444页

作者： VERHAEGEN, MH Department of Electrical Engineering Control Laboratory Delft University of Technology NL-2628 CD Delft P.O. Box 5031 Netherlands

The numerical robustness of four generally-applicable, recursive, least-squares estimation schemes is analysed by means of a theoretical round-off propagation study. This study highlights a number of practical, interesting insights into the widely-used recursive least-squares schemes. These insights have been confirmed in an experimental verification study.

关键词： computer simulation least-squares estimation, numerical analysis recursive algorithms

来源：评论

学校读者我要写书评

暂无评论

BLOCKING FORMULAS FOR THE ENGSET MODEL

引用

IEEE TRANSACTIONS ON COMMUNICATIONS 1994年第6期42卷 2213-2214页

作者： PINSKY, E CONWAY, A LIU, W GTE LABS INC WALTHAMMA 02254 UNIV MARYLAND DEPT COMP SCICATONSVILLEMD 21228

In this paper, we present simple recursive algorithms for computing call and time congestion in the classical Engset model with M sources and N servers. The first recursion has the complexity of O(MN) and gives the blocking probabilities for all intermediate values of M and N. The second recursion assumes a particular value of M and has the complexity of O(N). It gives the blocking probabilities for all intermediate values of N. Both recursions are similar to the well-known recurrence for computing the Erlang loss function.

关键词： Complexity recursive algorithms formula Blocking probability Erlang Recursion MOMENT MAGNITUDE

来源：评论

学校读者我要写书评

暂无评论

Optimal filtering for networked systems with stochastic sensor gain degradation

引用

AUTOMATICA 2014年第5期50卷 1521-1525页

作者： Liu, Yang He, Xiao Wang, Zidong Zhou, Donghua Tsinghua Univ TNList Dept Automat Beijing 100084 Peoples R China Brunel Univ Dept Comp Sci Uxbridge UB8 3PH Middx England

In this paper, the optimal filtering problem is investigated for a class of networked systems in the presence of stochastic sensor gain degradations. The degradations are described by sequences of random variables with known statistics. A new measurement model is put forward to account for sensor gain degradations, network-induced time delays as well as network-induced data dropouts. Based on the proposed new model, an optimal unbiased filter is designed that minimizes the filtering error variance at each time-step. The developed filtering algorithm is recursive and therefore suitable for online application. Moreover, both currently and previously received signals are utilized to estimate the current state in order to achieve a better accuracy. A numerical simulation is exploited to illustrate the effectiveness of the proposed algorithm. (c) 2014 Elsevier Ltd. All rights reserved.

关键词： Optimal filtering Networked systems Sensor gain Stochastic degradation recursive algorithms

来源：评论

学校读者我要写书评

暂无评论

Efficient Modeling of Radiation and Scattering for a Large Array of Loops

引用

IEEE TRANSACTIONS ON ANTENNAS AND PROPAGATION 2010年第3期58卷 999-1002页

作者： Papakanellos, Panagiotis J. Tsitsas, Nikolaos L. Anastassiu, Hristos T. Hellen AF Acad GR-1010 Dekelia Greece Natl Tech Univ Athens Sch Appl Math & Phys Sci GR-15773 Athens Greece Hellen Aerosp Ind SA Def Syst Dept GR-32009 Schimatari Greece

A computationally efficient technique, based on the method of moments (MoM) formulation, is invoked in the characterization of radiation and scattering properties of an array of coaxial, circular, non-identical loops. A set of Pocklington-type integral equations for the loop currents is formulated and subsequently discretized by a standard procedure. Thanks to a suitable choice of the basis functions, the resulting matrix corresponding to the pertinent linear system is forced to consist of circulant blocks. This type of system is solvable by an innovative recursive algorithm, featuring several important advantages, such as lower memory and execution time consumption, over standard, purely numerical inversion. The overall procedure is simpler in implementation than already existing methods, based on Fourier analysis. The procedure invokes almost exclusively elementary functions, and is applicable to large arrays with respect to diameter or number of loops. Data for such configurations are presented for the first time in literature.

关键词： Circulant matrices integral equations loop antenna arrays recursive algorithms

来源：评论

学校读者我要写书评

暂无评论

recursive algorithm for fast evaluation of the Abel inversion integral in broadband reflectometry

引用

REVIEW OF SCIENTIFIC INSTRUMENTS 1999年第1期70卷 1047-1050页

作者： Nunes, FD Santos, J Manso, ME Univ Tecn Lisboa EURATOM IST Assoc Ctr Fusao Nucl Inst Super Tecn P-1096 Lisbon Portugal

The application of Kalman filtering is proposed for the numerical evaluation of plasma density profiles using noisy group delay data obtained from O- mode frequency-modulated broadband reflectometry. This method allows faster computation of the Abel inversion integral than the usual numerical methods (e.g., the trapezoidal rule) while maintaining a good accuracy in the presence of noise. In addition, density profiles with different degrees of smoothing can be produced by adjusting a single parameter. The algorithm seems promising in applications to plasma control in real time. (C) 1999 American Institute of Physics. [S0034-6748(99)70901-9].

关键词： reflectometry numerical calculation recursive algorithms smoothing density profiles Plasma confinement Kalman filtering trapezoidal rule Inversion broadband

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：