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

American Control Conference (ACC)

作者： Xianzhong Cui Kang G. Shin Real-Time Computing Laboratory Department of Electrical Engineering and Computer Science University of Michigan Ann Arbor MI USA

There are many problems in industrial process control systems due to a long system response delay, dead-zone and/or saturation of the actuator mechanisms, uncertainties in the system model and/or parameters, and process noise. To overcome these problems, an adaptive controller is designed using neural networks and tested extensively via simulations. One of the key problems in designing such a controller is to develop an efficient training algorithm. Neural networks are usually trained using the output errors of the network, instead of using the output errors of the controlled plant. However, when a neural network is used to control a plant directly, the output errors of the network are unknown, since the desired control actions are unknown. In this paper, we propose a simple training algorithm for a class of nonlinear systems, which enables the neural network to be trained by the output errors of the controlled plant. The only a priori knowledge of the controlled plant is the direction of its output response. A detailed analysis of the algorithm is presented and the corresponding theorems are proved. Due to its simple structure and algorithm, and good performance, the proposed controller has high potential for handling difficult problems in industrial process control systems.

关键词： Industrial control Process control Neural networks Error correction Electrical equipment industry Algorithm design and analysis Control systems Delay systems Actuators Uncertainty

来源：评论

学校读者我要写书评

暂无评论

Probabilistic clock synchronization in large distributed systems

Probabilistic clock synchronization in large distributed sys...

引用

International Conference on Distributed computing Systems

作者： A. Olson K.G. Shin Real-Time Computing Laboratory Department of Electrical Engineering and Computer Science University of Michigan Ann Arbor MI USA

Synchronization algorithm is proposed which uses one of two probabilistic techniques to estimate remote clock values, and uses an interactive convergence algorithm on the resulting estimates to adjust the local clock. The algorithm does not require master/slave clocks and reduces the number of messages needed. As a result it is suitable for use in large distributed systems.< >

关键词： Clocks Synchronization Hardware Master-slave Contracts real time systems Distributed computing Laboratories NASA software algorithms

来源：评论

学校读者我要写书评

暂无评论

Collision avoidance in a multiple-robot system using intelligent control and neural networks

Collision avoidance in a multiple-robot system using intelli...

引用

IEEE Conference on Decision and Control

作者： K.G. Shin X. Cui Real-Time Computing Laboratory Department of Electrical Engineering and Computer Science University of Michigan Ann Arbor MI USA

A new hierarchical collision avoidance scheme is proposed to coordinate multiple robots in a common workspace by combining the techniques of intelligent control and neural networks (NNs). The high level in the hierarchy is formed by a knowledge-based coordinator (KBC) and an NN-based predictor, and the low level consists of the robots to be coordinated. The authors state the problem of coordinating multiple robots for collision avoidance and the basic principles of the KBC. The knowledge acquisition and representation of collision detection and avoidance for both cylindrical- and revolute-type robots are discussed. Design of the NN-based predictor and the KBC is summarized. The proposed scheme was tested extensively via simulations for both types of robots, showing promising performance.< >

关键词： Collision avoidance Intelligent networks Intelligent control Neural networks Robot kinematics Path planning Service robots Robotic assembly Trajectory Servomechanisms

来源：评论

学校读者我要写书评

暂无评论

Optimal Load Sharing In Distributed real-time Systems

Optimal Load Sharing In Distributed Real-time Systems

引用

Distributed Memory computing Conference

作者： Yi-Chieh Chang Kang G. Shin Real-Time Computing Laboratory Department of Electrical Engineering and Computer Science University of Michigan Ann Arbor MI USA

来源：评论

学校读者我要写书评

暂无评论

Load sharing with consideration of future task arrivals in heterogeneous distributed real-time systems

Load sharing with consideration of future task arrivals in h...

引用

real-time Systems Symposium (RTSS)

作者： C.-J. Hou K.G. Shin Real-Time Computing Laboratory Department of Elec. Engineering and Computer Science University of Michigan Ann Arbor MI USA

The authors propose a new loading sharing (LS) algorithm for real-time applications that accounts for the effect of future task arrivals on locating the best receiver for each unguaranteed task. The LS algorithm minimizes not only the probability of transferring an unguaranteed task T to an incapable node with Bayesian analysis, but also the probability that a remote node fails to guarantee T because of future arrivals of higher-laxity tasks with queuing analysis. All parameters needed for a node's LS decision are collected/estimated online using time-stamped region-change broadcasts and Bayesian estimation. Simulation results show that the proposed LS algorithm outperforms other existing algorithms in minimizing the probability of dynamic failure, task collisions, and excessive task transfers. The performance improvement becomes more pronounced as the degree of system heterogeneity increases.< >

关键词： real time systems Bayesian methods Failure analysis Algorithm design and analysis Broadcasting Chaos Distributed computing Laboratories Computer science Application software

来源：评论

学校读者我要写书评

暂无评论

Modeling wormhole routing in a hypercube

Modeling wormhole routing in a hypercube

引用

International Conference on Distributed computing Systems

作者： J. Kim C.R. Das Real-Time Computing Laboratory Department of Elec. Engineering and Computer Science University of Michigan Ann Arbor MI USA Department of Elec. and Computer Engineering Pennsylvania State University University Park PA USA

An analytical model for the performance evaluation of asynchronous hypercubes is presented. This analysis is aimed at modeling a deadlock-free wormhole routing scheme prevalent on second-generation hypercube systems. Probability of blocking and average message delay are discussed. The communication traffic to find the probability of blocking is the starting point. The traffic analysis can capture any message destination distribution. The average message delay that consists of two parts is found. The analysis is extended to virtual cut-through routing and random wormhole routing techniques. The validity of the model is demonstrated.< >

关键词： Routing Hypercubes Delay Analytical models Traffic control Performance analysis Protocols Laboratories System recovery Power engineering and energy

来源：评论

学校读者我要写书评

暂无评论

Fault-Tolerance in real-time Systems

引用

IFAC Proceedings Volumes 1991年第2期24卷 119-121页

作者： K.G. Shin G. Koob F. Jahanian Real-Time Computing Laboratory Department of Electrical Engineering and Computer Science The University of Michigan Ann Arbor MI 48109-2122 USA Office of Naval Research Code 1133 800 N. Quincy Street Arlington VA 22217-5000 USA IBM T.J. Watson Research Center P.O. Box 704 Yorktown Heights NY 10598 USA

With ever-increasing reliance on digital computers in embedded systems such as in space, avionics, manufacturing, and life-support monitoring/control applications, the need for dependable systems that deliver services in a timely manner has become crucial. Embedded systems often interact with the external environment and operate under strict timeliness and reliability requirements. Fault tolerance and real-time requirements on a system often influence one another in subtle ways, for example, the requirements on a highly—available system, such as an air traffic control system, may derive the timing constraints imposed on certain critical tasks. In cases where a set of interacting tasks operate under strict timing constraints, missing a deadline may result in a catastrophic system failure, which was termed a dynamic failure in (Shin, Krishna, and Lee, 1985). This paper argues that fault- tolerance and real-time requirements are not orthogonal and it addresses some of the challenges that confront the designers of fault-tolerant real-time systems. These challenges include formal specification of reliability and timing requirements, appropriate language and operating system support for providing fault-tolerance in a time-critical system, new scheduling theories which consider multiple resources and fault-tolerance, tradeoff between time and space redundancy, and predictable redundancy management in the presence of faults.

关键词： Fault-tolerance real-time systems reliability time and space redundancy run-time monitoring specification

来源：评论

学校读者我要写书评

暂无评论

DESIGN FOR TEST USING PARTIAL PARALLEL SCAN

引用

IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS 1990年第2期9卷 203-211页

作者： LEE, SG SHIN, KG Real-Time Computing Laboratory Department of Electrical Engineering and Computer Science University of Michigan Ann Arbor MI USA

Traditional scan design techniques such as level-sensitive scan design, scan path, and random-access scan suffer from the drawback that the extra test application effort (which includes both time and memory) required is directly proportional to the number of latches and can become quite significant. A scan design technique termed partial parallel scan which reduces test application effort by one to two orders of magnitude is presented. Theoretical and practical aspects of the design method are discussed. The practical use of the partial parallel scan technique has been demonstrated with an LSI circuit and a VLSI circuit designed using silicon compiler tools.< >

关键词： Circuit testing Latches Design for testability Hardware Circuit faults Design automation Switches Design methodology Large scale integration Very large scale integration

来源：评论

学校读者我要写书评

暂无评论

Load sharing in hypercube multicomputer in the presence of node failures 5

Load sharing in hypercube multicomputer in the presence of n...

引用

5th Distributed Memory computing Conference, DMCC 1990

作者： Chang, Yi-Chieh Shin, Kang G. Real-Time Computing Laboratory Department of Electrical Engineering and Computer Science University of Michigan Ann ArborMI48109-2122 United States

ISBN: (纸本)0818621133

This paper discusses and analyzes two load sharing (LS) issues: adjusting preferred lists and implementing a fault-tolerant mechanism in the presence of node failures. In an early paper, we have proposed to order the nodes in each node's proximity into a preferred list for the purpose of load sharing in distributed real-time systems. The preferred list of each node is constructed in such a way that each node will be selected as the kth preferred node by one and only one other node. Such lists are proven to allow the tasks to be evenly distributed in a system. However, the presence of faulty nodes will destroy the original structure of a preferred list if the faulty nodes are simply skipped in the preferred list. An algorithm is therefore proposed to modify each preferred list to retain its original features regardless of the number of faulty nodes in the system. The communication overhead introduced by this algorithm is shown to be minimal. Based on the modified preferred lists, a simple fault-tolerant mechanism is implemented. Each node is equipped with a backup queue which stores and updates the arriving/completing tasks at its most preferred node. Whenever a node becomes faulty, its most preferred node will treat the tasks in the ba,ckup queue as externally arriving tasks. Our simulation results show that this approach, despite of the simplicity, can reduce the number of task losses dramatically, as compared to the approaches without any faulttolerant mechanism. © 1990 IEEE.

关键词： real time systems

来源：评论

学校读者我要写书评

暂无评论

Traffic routing for multi-computer networks with virtual cut-through capability

Traffic routing for multi-computer networks with virtual cut...

引用

International Conference on Distributed computing Systems

作者： D.D. Kandlur K.G. Shin Real-Time Computing Laboratory Department of Electrical Engineering and Computer Science University of Michigan Ann Arbor USA

The problem of selecting routes for interprocess communication in a network with virtual cut-through capability, while balancing the network load and minimizing the number of times that a message gets buffered, is addressed. The approach taken is to formulate the route selection problem as a minimization problem, with a link cost function that depends on the traffic through the link. The form of this cost function is derived on the basis of the probability of establishing a virtual cut-through route. It is shown that this route selection problem is NP-hard, and so an approximate algorithm that tries to reduce the cost incrementally by rerouting traffic is developed. The performance of this algorithm is evaluated for two popular network topologies: the hypercube and the C-wrapped hexagonal mesh.< >

关键词： Telecommunication traffic Routing Packet switching Delay Cost function Hypercubes Application software Multiprocessor interconnection networks Telecommunication network reliability Communication system control

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：