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

Monitoring Behavioral Evolution for On-Line Fault Detection

IFAC Proceedings Volumes 1991年第6期24卷 313-319页

作者： L.E. Holloway B.H. Krogh Laboratory for Automated Systems and Information Processing Department of Electrical and Computer Engineering Carnegie Mellon University Pittsburgh PA 15213 USA

The evolution graph monitor is defined and illustrated for on-line monitoring of computer-controlled processes with both discrete and continuous dynamics. Using a behavioral model specification of the process dynamics, the evolution graph monitor builds and maintain an efficient representation of the set of admissible system trajectories which are consistent with the on-line observations as they are received. In contrast to simulation-based methods, the evolution graph approach handles delayed, uncertain, and infrequent observations for systems with widely varying operating characteristics. A behavioral model specification and evolution graph monitor have been developed to perform on-line fault detection for an electric arc furnace in a continuous-caster steel mill. This application is used throughout the paper to illustrate the details of the approach.

关键词： Monitoring Failure Detection Discrete systems Casting Manufacturing Processes

来源：评论

学校读者我要写书评

暂无评论

On-Line Evaluation of systems with Discrete Observations

引用

IFAC Proceedings Volumes 1991年第5期24卷 41-46页

作者： L.E. Holloway B.H. Krogh Laboratory for Automated Systems and Information Processing Department of Electrical and Computer Engineering Carnegie Mellon University Pittsburgh PA 15213 USA

This paper presents a method for detecting faults in systems with discrete observations. We examine systems representable by a behavioral model. The behavioral model framework characterizes the time evolution of systems with discrete and continuous states and uncertainty in model parameters. Our method for detecting faults depends on an on-line encoding of the set of trajectories corresponding to a given observation and the dynamics specifications of the behavioral model. This encoding, called an evolution graph, is modified on-line as new observations are received. Faults are detected when the set of encoded trajectories is determined to be empty. This paper presents the modelling framework and discusses the construction and maintenance of the evolution graph.

关键词： Monitoring Failure Detection Discrete systems Manufacturing Processes Discrete Observations

来源：评论

学校读者我要写书评

暂无评论

Petri Net based Models for Condition/Event systems

Petri Net based Models for Condition/Event Systems

引用

American control Conference (ACC)

作者： R.S. Sreenivas B.H. Krogh Laboratory for Automated Systems and Information Processing Department of Electrical Engineering and Computer Engineering Carnegie Mellon University Pittsburgh PA USA

In this paper we define a class of continuous-time discrete event dynamic systems (DEDS) with two types of discrete-valued input and output signals: condition signals and event signals called Condition/Event systems (C/E systems). We formally define C/E systems and models of C/E systems that are based on an extension of Petri nets (C/E PNs). We then introduce equivalent C/E PN models for C/E systems resulting from cascade and feedback interconnections via examples. The algorithms that compute these equivalent models can be found in reference [1] The paper concludes with directions for future research.

关键词： Feedback Petri nets Disruption tolerant networking Topology Books Terminology

来源：评论

学校读者我要写书评

暂无评论

DIGNET: a self-organizing neural network for automatic pattern recognition and classification

DIGNET: a self-organizing neural network for automatic patte...

引用

IEEE Conference on Decision and control

作者： S.C.A. Thomopoulos D.K. Bougoulias Decision and Control Systems Laboratory Department of Electrical & Computer Engineering Pennsylvania State University University Park PA USA Information Proc. & Intell. System Laboratory Department of Electrical Engineering Southem Illinois University Carbondale IL USA

The authors present a self-organizing artificial neural network (ANN) that exhibits deterministically reliable behavior to noise interference when the noise does not exceed a specified level of tolerance. The complexity of the proposed ANN, called DIGNET, in terms of neuron requirements versus stored patterns, increases linearly with the number of stored patterns and their dimensionality. The self-organization of DIGNET is based on the idea of competitive generation and elimination of attraction wells in the pattern space. The same neural network can be used for both pattern recognition and classification.< >

关键词： Neural networks Pattern recognition Artificial neural networks Neurons Interference Vectors Laboratories Noise level Signal detection Automatic control

来源：评论

学校读者我要写书评

暂无评论

SPEECH RECOGNITION BY A SELF-ORGANIZING FEATURE FINDER

引用

International Journal of Neural systems 1991年第1N02期2卷 55-78页

作者： S.Z. Lerner J.R. Deller, Jr. GTE Laboratories Inc. 40 Sylvan Rd. Waltham MA 02254 USA (617) 466–2959 Michigan State University Department of Electrical Engineering/258 EB Control Systems and Signal Processing Group: Speech Processing Laboratory East Lansing MI 48824–1226 USA (517) 353–8840

A self-organizing neural network is presented which automatically learns the number and type of spectral features from speech examples. The learning algorithm is analyzed with respect to its convergence and stability properties. The “strength” of the presence of the learned features is registered by the network to effect recognition of further speech presentations. The network consists of two layers of feature detectors, each layer of which is self-organized, and the outputs of the second layer are time-aligned in the present design using dynamic time warping. The significance of the two-layer structure, as well as general architectural advantages of the network, are discussed. Results of experiments involving various isolated word recognition tasks, including single and multi-speaker training and recognition, and the recognition of speech of a nonverbal individual, are reported.

关键词：

来源：评论

学校读者我要写书评

暂无评论

ON THE COMPLEXITY OF HYPERELLIPTIC DISCRETE LOGARITHM PROBLEM

ON THE COMPLEXITY OF HYPERELLIPTIC DISCRETE LOGARITHM PROBLE...

引用

WORKSHOP ON THE THEORY AND APPLICATION OF CRYPTOGRAPHIC TECHNIQUES

作者： SHIZUYA, H ITOH, T SAKURAI, K Department of Electrical Communications Faculity of Engineering Tohoku University Aramaki-Aza-Aoba Aoba-ku Sendai 980 Japan Département d’I.R.O. Université de Montréal C.P.6128 Succ.A Montréal H3C 3J7 QC Canada Department of Information Processing The Graduate School at Nagatsuta Tokyo Institute of Technology 4259 Nagatsuta Midori-ku Yokohama 227 Japan Computer & Information Systems Laboratory Mitsubishi Electric Corporation 5-1-1 Ofuna Kamakura 247 Japan

ISBN: (纸本)3540546200

We give a characterization for the intractability of hyperelliptic discrete logarithm problem from a viewpoint of computational complexity theory. It is shown that the language of which complexity is equivalent to that of the hyperelliptic discrete logarithm problem is in NP ∩ co-AM, and that especially for elliptic curves, the corresponding language is in NP ∩ co-NP. It should be noted here that the language of which complexity is equivalent to that of the discrete logarithm problem defined over the multiplicative group of a finite field is also characterized as in NP ∩ co-NP. © Springer-Verlag Berlin Heidelberg 1991.

关键词： Computational complexity

来源：评论

学校读者我要写书评

暂无评论

A systolic algorithm for adaptive set membership identification

A systolic algorithm for adaptive set membership identificat...

引用

International Conference on Acoustics, Speech, and Signal processing (ICASSP)

作者： S.F. Odeh J.R. Deller Department of Electrical Engineering / 260 EB Control Systems and Signal Processing Group Speech Processing Laboratory East Lansing MI USA

An adaptive set membership identification algorithm with a very flexible forgetting scheme is presented. In preliminary experiments, the method yields highly accurate estimates using very few of the data, and quickly adapts to fast-changing dynamics. A compact systolic architecture to implement this algorithm is developed which uses O(m) cells and reduces the computational complexity to O(m) operations per observation, where m represents the number of parameters to be estimated in a linear system or signal model.< >

关键词： Yield estimation Computer architecture Computational complexity Parameter estimation Linear systems

来源：评论

学校读者我要写书评

暂无评论

The use of simulated annealing to solve the mobile manipulator path planning problem

The use of simulated annealing to solve the mobile manipulat...

引用

IEEE International Conference on Robotics and Automation (ICRA)

作者： W.F. Carriker P.K. Khosla B.H. Krogh Laboratory for Automated Systems and Information Processing Department of Electrical and Computer Engineering Carnegie Mellon University Pittsburgh PA USA

The planning problem is considered for a mobile manipulator system which must perform a sequence of tasks defined by position, orientation, force, and moment vectors at the end effector. Each task can be performed in multiple configurations due to the redundancy introduced by mobility. The planning problem is formulated as an optimization problem in which the decision variables for mobility (base position) are separated from the manipulator joint angles in the cost function. The resulting numerical problem is nonlinear with nonconvex, unconnected feasible regions in the decision space. Simulated annealing is proposed as a general solution method for obtaining near-optimal results. The problem formulation and numerical solution by simulated annealing are illustrated for a positioning system with five degrees of freedom. These results are compared with results obtained by conventional nonlinear programming techniques customized for the particular example system.< >

关键词： Simulated annealing Path planning Mobile computing Manipulators Robots Computational modeling Computer simulation Laboratories information processing Process planning

来源：评论

学校读者我要写书评

暂无评论

Fault detection and diagnosis in manufacturing systems: a behavioral model approach

Fault detection and diagnosis in manufacturing systems: a be...

引用

International Conference on Computer Integrated Manufacturing

作者： L.E. Holloway B.H. Krogh Laboratory for Automated Systems and Information Processing Department of Electrical and Computer Engineering Carnegie Mellon University Pittsburgh PA USA

An approach to online fault detection and diagnosis in automated manufacturing systems with discrete controls and sensing is described. The approach is based on the concept of behavioural models of the individual system components. These models, which can be developed while the system is being designed, characterize the responses of the devices in the system to arbitrary input signals over the range of acceptable operating conditions. The expected flow of signals through the system, from control inputs to sensor outputs, is captured in the behavioural model dynamics. This model provides the basis for online fault detection by generating expected system response signals which are compared online, in real-time, to the actual sensor signals from the system. Fault diagnosis is accomplished by maintaining a current set of operational assumptions which identify the system components which could cause deviations from the expected behavior.< >

关键词： Fault detection Fault diagnosis Manufacturing systems Sensor systems Automatic control control systems Signal design control system synthesis Sensor phenomena and characterization Signal generators

来源：评论

学校读者我要写书评

暂无评论

Toward the use of set-membership identification in efficient training of feedforward neural networks

Toward the use of set-membership identification in efficient...

引用

IEEE International Symposium on Circuits and systems (ISCAS)

作者： J.R. Deller Control Systems and Signal Processing Research Group: Speech Processing Laboratory Department of Electrical Engineering Michigan State University East Lansing MI USA

The application of the theory of set-membership identification to the development of efficient learning algorithms for neural networks is discussed. Some results relevant to the application of the method to nonlinear feedforward networks are presented. The techniques discussed have the potential to significantly improve the efficiency of teaching neural networks by employing novel data selection criteria based on set-theoretic constraints.< >

关键词： Intelligent networks Neural networks Feedforward neural networks Samarium Vectors Signal processing Signal processing algorithms Training data control systems Speech processing

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：