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

IEEE International Workshop on Cellular Nanoscale Networks and their Applications, (CNNA)

作者： L.O. Chua T. Roska The Electronics Research Laboratory and Department of Electrical Engineering and Computer Science University of California Berkeley Berkeley CA USA Dual and Neural Computing Systems Laboratory in the Computer and Automation Institute of the Hungarian Academy of Sciences Budapest Hungary

Various types of cellular neural networks (CNNs) are summarized, and a taxonomy of CNNs is given according to the different types of grids, processors, interactions, and modes of operation. The CNN universal machine is introduced. The architecture and the key features of the CNN universal machine are outlined. An exhaustive list of references is given.< >

关键词： Cellular neural networks Turing machines computer architecture Grid computing Laboratories Taxonomy Optical computing Chaos Programmable logic arrays Automation

来源：评论

学校读者我要写书评

暂无评论

The CNN universal machine. II. Programmability and applications

The CNN universal machine. II. Programmability and applicati...

引用

IEEE International Workshop on Cellular Nanoscale Networks and their Applications, (CNNA)

作者： T. Roska L.O. Chua The Electronics Research Laboratory and Department of Electrical Engineering and Computer Science University of California Berkeley Berkeley CA USA Dual and Neural Computing Systems Laboratory in the Computer and Automation Institute of the Hungarian Academy of Sciences Budapest Hungary

For pt.I, see ibid., p.1-10 (1992). The programmability (as a stored program) of the CNN universal machine is discussed. It is shown why and in which sense this machine is universal. The analogic type of algorithm is introduced. The application potential is reviewed and the biological relevance is analyzed. It is shown that the architecture is optimal not only for silicon implementations, but also for many biological information processing organs that have the same structure.< >

关键词： Cellular neural networks Turing machines Application software Laboratories Neural networks Cloning Storage automation Silicon Information processing Cellular networks

来源：评论

学校读者我要写书评

暂无评论

ProperSYN: A portable parallel algorithm for logic synthesis

ProperSYN: A portable parallel algorithm for logic synthesis

引用

IEEE International Conference on computer-Aided Design

作者： De Ramkumar Banerjee Center for Reliable & High-Perf. Computing Coordinated Science Laboratory University of Illinois Urbana IL USA Department of Electrical & Computer Engineering University of Iowa Iowa IA USA

An algorithm based on the transduction method and implemented in the ProperCAD environment is described. The parallel ProperSYN algorithm attempts to make the execution time manageably small. The algorithm uses an asynchronous message driven computing model with no synchronizing barriers, and hence it is scalable to a larger number of processors. Also, the algorithm is portable across a wide variety parallel machines. Experimental results on various parallel machines are presented. The algorithm is built around a well-defined sequential algorithm interface such that there can be benefits from future expansion of the sequential algorithm.< >

关键词： Design automation Parallel algorithms

来源：评论

学校读者我要写书评

暂无评论

SCHEDULING JOB OPERATIONS IN AN AUTOMATIC ASSEMBLY LINE

引用

IEEE TRANSACTIONS ON ROBOTICS AND AUTOMATION 1991年第3期7卷 333-341页

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

This paper addresses the problem of scheduling job operations in an automatic assembly line used for manufacturing a small to medium volume of mixed workparts. The assembly line model used here differs from the classical flow shop model in the following three aspects: 1) there are no buffers at machine stations, 2) constraints associated with the material transport system are included, and 3) for each batch of production, workparts are distinguished in groups, rather than individually. An "optimal" algorithm that requires very little computation is derived first by minimizing the total finish time for two machine assembly lines. This result is then generalized to the problem of scheduling an assembly line with m > 2 machines processing single-operation jobs. In order to reduce the computational complexity of the latter problem, heuristic algorithms are also proposed and shown to work quite well for all the cases considered. Finally, a heuristic solution to the problem of scheduling an assembly line with m > 2 machines processing multioperation jobs is discussed.

关键词： Job shop scheduling Processor scheduling Heuristic algorithms Flexible manufacturing systems Optimal scheduling Assembly systems Manufacturing automation Pulp manufacturing Scheduling algorithm Mass production

来源：评论

学校读者我要写书评

暂无评论

real-time COMMUNICATIONS IN A computer-CONTROLLED WORKCELL

引用

IEEE TRANSACTIONS ON ROBOTICS AND AUTOMATION 1991年第1期7卷 105-113页

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

A computer-integrated manufacturing (CIM) system is composed of several workcells, each of which contains robots, NC machines, sensors, and a transport mechanism. Each CIM workcell is controlled by multiple processors interconnected by an intracell bus, but the individual cells are interconnected by an arbitrary network. This paper considers a communication subsystem that is designed to support real-time control and coordination of devices in each CIM cell. The concept of a poll number is proposed to control the access to the intracell bus. The bus access mechanism with the poll number is intended to minimize the probability of real-time messages missing their deadlines. When a CIM task generates a time-constrained message, a poll number is computed for this message according to the message's deadline and the task's prority. When the intracell bus is free, the various tasks at a workcell that desire to use the bus write the poll number onto the bus and read it back, one bit at a time, starting from the most significant bit. If at any time the bit read back is different from the bit written, then the corresponding task drops out of the contention for the bus. Use of a poll number provides not only for decentralized control of the intracell bus, but also a high degree of flexibility in scheduling messages. The performance of the bus access mechanism with a poll number is analyzed and compared with that of a token bus, which is widely used in CIM systems such as MAP networks. The probability of a real-time message missing its deadline in a token bus is found to be much higher than that of the proposed mechanism.

关键词： computer integrated manufacturing Communication system control Robot sensing systems Robot kinematics Sensor systems Distributed control Job shop scheduling Performance analysis Manufacturing automation Access protocols

来源：评论

学校读者我要写书评

暂无评论

INTELLIGENT COORDINATION OF MULTIPLE SYSTEMS WITH NEURAL NETWORKS

引用

IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS 1991年第6期21卷 1488-1497页

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

Many control applications require cooperation of two or more independently designed, separately located, but mutually affecting, subsystems. In addition to the good behavior of each subsystem, effective coordination of these subsystems is very important to achieve the desired overall system performance. However, such coordination is very difficult to accomplish due mainly to the lack of precise system models and/or dynamic parameters as well as the lack of efficient tools for system analysis, design, and real-time computation of optimal solutions. A new multiple-system coordinator that combines the techniques of intelligent control and neural networks, and forms the high-level coordinator in a hierarchical structure, is proposed. The basic idea is to estimate the effects of the control commands to subsystems using a predictor and modify these commands using a knowledge-based coordinator so as to achieve the desired performance. The predictor is designed for multiple-input, multiple-output systems using neural networks. The knowledge-based coordinator is responsible for a goal-oriented search in its knowledge base and the overall system stability. Because the internal structure and parameters of the low level are not affected by using the proposed method, some commercially designed servo controllers for single systems can be coordinated to perform more sophisticated tasks for multiple systems than originally intended.

关键词： Intelligent networks Neural networks Control systems System performance Intelligent control real time systems Humans Intelligent structures Stability Design methodology

来源：评论

学校读者我要写书评

暂无评论

DESIGN OF A KNOWLEDGE-BASED CONTROLLER FOR INTELLIGENT CONTROL-SYSTEMS

引用

IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS 1991年第2期21卷 368-375页

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

A hierarchical knowledge-based controller is proposed to improve the performance of complex control systems, such as robots. Unlike parameter- and performance- adaptive controllers, this controller is designed only to modify the reference input of a lower-level servo controller. Because the internal parameters and structure of the lower-level controller are not affected, commercial servo controllers can be made to perform more sophisticated tasks than originally intended. The principle of the knowledge-based controller, modification of the reference input, knowledge representation, existence of the solution, and analyses of the controller's stability and tracking error are described in detail. A self-tuning multiple-step predictor is designed as part of the controller to eliminate the undesirable effects of system time delay. Both linear and nonlinear example control systems are tested via extensive simulations and have all shown promising performances.

关键词： servo controller control systems reference input intelligent control system internal parameter Controllers undesirable effects

来源：评论

学校读者我要写书评

暂无评论

Optimal load sharing in distributed real-time systems 6

Optimal load sharing in distributed real-time systems

引用

6th Distributed Memory computing Conference, DMCC 1991

作者： 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: (纸本)0818622903

In hard real-time systems, the problem of scheduling periodic tasks to meet their deadlines has been studied extensively, but scheduling aperiodic tasks has been addressed far less, due mainly to their uncertain arrivals. The main intent of this paper is to derive an approximate, closed-form solution for the decentralized, dynamic load sharing (LS) problem treated in our early paper [1], Based on the derived solutions, we show that the probability of missing task deadlines can be kept below any required level while minimizing the communication overhead resulting from task transfers and state-information collection. Specifically, "optimal" threshold patterns and buddy set sizes are derived for different system loads by minimizing the communication overhead subject to a constraint of keeping the probability of missing task deadlines below any given level. (One can also derive optimal solutions by minimizing the probability of missing deadlines while keeping the communication overhead below a specified level.). © 1991 IEEE.

关键词： Probability

来源：评论

学校读者我要写书评

暂无评论

Load sharing in hypercube multicomputers in the presence of node failures

Load sharing in hypercube multicomputers in the presence of ...

引用

International Symposium on Fault-Tolerant computing (FTCS)

作者： Y.-C. Chang K.G. Shin Real-Time Computing Laboratory Department of Electrical Engineering and Computer Science University of Michigan USA

Two important issues associated with load sharing (LS) in hypercube multicomputers are discussed and analysed: (i) ordering fault-free nodes as preferred receivers of overflow tasks and (ii) developing an LS mechanism to handle node failures. The authors previously (1989) proposed to order the nodes in each node's proximity into its preferred list of receivers for the purpose of LS in distributed real-time systems. However, the occurrence of node failures will destroy the original structure of a preferred list if the failed nodes are simply dropped from the list. Three algorithms are proposed to modify the preferred list to retain its original features. Based on the modified preferred lists, node failures can be tolerated by equipping each node with a backup queue which stores and updates the arriving/completing tasks at its most preferred node. Simulation results show that this approach, despite its simplicity, can greatly reduce the number of task losses compared to approaches that do not use backup queues.< >

关键词： Hypercubes real time systems Broadcasting Fault tolerance Laboratories Failure analysis Algorithm design and analysis Delay time factors

来源：评论

学校读者我要写书评

暂无评论

Effective load sharing in distributed real-time systems 3

Effective load sharing in distributed real-time systems

引用

Proceedings of the Third IEEE Symposium on Parallel and Distributed Processing

作者： Shin, K.G. Hou, C. Real-Time Computing Laboratory Department of Elec. Engr. and Computer Science University of Michigin Ann Arbor 48109-2122 MI United States

ISBN: (纸本)0818623101

In a distributed real-time system, temporary uneven task arrivals among the nodes may cause some tasks to miss their deadlines even if the overall system has the capacity to meet the deadlines of all tasks. In this paper, an effective load sharing (LS) scheme is proposed as a solution to this problem. Upon arrival of a task at a node, the node determines whether or not it can complete the task in time under the minimum-laxity-first-served policy. If the task cannot be guaranteed or if guarantees of some other tasks are to be violated due to the insertion of this task into the existing schedule, the node looks up the list of loss-minimizing decisions, and determines the best node among a set of nodes in its physical proximity, called its buddy set, to which the task(s) may be transferred. This list of decisions is periodically updated using Bayesian decision analysis and prior/posterior state distributions. These probability distributions are derived from the information collected via time-stamped state-region change broadcasts within each buddy set. The performance of the proposed scheme is evaluated via simulation along with five other schemes. The proposed scheme is shown to outperform all but perfect LS scheme in (i) meeting task deadlines and (ii) tolerating the delays in state-information collection and task transfer. © 1991 IEEE.

关键词： Probability distributions

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：