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

IEEE International Conference on Fuzzy Systems (FUZZ-IEEE)

作者： L.A. Zadeh Berkeley Initiative in Soft Computing (BISC) Computer Science Division and the Electronics Research Laboratory Department of Electrical Engineering and Computer Science University of California Berkeley CA USA

Recognition systems of one kind or another have been around for a long time. But what we are beginning to see today are recognition systems that are capable of performing tasks that could not be done in the past. The quantum jump in the capabilities of today's recognition systems reflect three converging developments: (a) major advances in sensor technology; (b) major advances in sensor data processing technology; and (c) the use of soft computing techniques to infer a conclusion from observed data.

关键词： Fuzzy logic Laboratories computer science Character recognition Handwriting recognition Pattern recognition Speech recognition Target recognition Authentication Unsolicited electronic mail

来源：评论

学校读者我要写书评

暂无评论

State-space support for path-based reward variables

State-space support for path-based reward variables

引用

International computer Performance and Dependability Symposium

作者： W.D. Obal W.H. Sanders Center for Reliable and High-Performance Computing Department of Electrical and Computer Engineering Coordinated Science Laboratory University of Illinois Urbana-Champaign Urbana-Champaign IL USA

Many sophisticated formalisms exist for specifying complex system behaviors, but methods for specifying performance and dependability variables have remained quite primitive. To cope with this problem, modelers often must augment system models with extra state information and event types to support particular variables. This often leads to models that are non-intuitive, and must be changed to support different variables. To address this problem, we extend the array of performance measures that may be derived from a given system model by developing new performance measure specification and model construction techniques. Specifically, we introduce a class of path-based reward variables, and show how various performance measures may be specified using these variables. Path-based reward variables extend the previous work with reward structures to allow rewards to be accumulated based on sequences of states and transitions. To maintain the relevant history, we introduce the concept of a path automaton, whose state transitions are based on the system model state and transitions. Furthermore, we present a new procedure for constructing state spaces and the associated transition rate matrices that support path-based reward variables. Our new procedure takes advantage of the path automaton to allow a single system model to be used as the basis of multiple performance measures that would otherwise require separate models or a single more complicated model.

关键词： Automata Stochastic processes Indium tin oxide Electronic switching systems Read only memory State-space methods Contracts

来源：评论

学校读者我要写书评

暂无评论

Parallel algorithms for simultaneous scheduling, binding and floorplanning in high-level synthesis

Parallel algorithms for simultaneous scheduling, binding and...

引用

IEEE International Symposium on Circuits and Systems (ISCAS)

作者： P. Prabhakaran P. Banerjee Center for Reliable and High-Performance Computing Coordinated Science Laboratory University of Illinois Urbana-Champaign IL USA Center for Parallel and Distributed Computing Department of Electrical and Computer Engineering Northwestern University Evanston IL USA

With small device features in submicron technologies, interconnection delays play a dominant part in cycle time. Hence, it is important to consider the impact of physical design during high level synthesis. In comparison to a traditional approach which separates high-level synthesis from physical design, an algorithm which is able to make these stages interact very closely, would result in solutions with lower latency and area. However, such an approach could result in increased runtimes. Parallel processing is an attractive way of reducing the runtimes. In this paper, two parallel algorithms for simultaneous scheduling, binding and floorplanning algorithm are presented. A detailed hardware model is considered, taking into account multiplexor and register areas and delays. Experimental results are reported on an IBM SP-2 multicomputer, with close to linear speedups for a set of benchmark circuits.

关键词： Parallel algorithms High level synthesis Runtime Integrated circuit interconnections Delay effects Algorithm design and analysis Parallel processing Scheduling algorithm Hardware Registers

来源：评论

学校读者我要写书评

暂无评论

Load adjustment and filtering based on process criticality

Load adjustment and filtering based on process criticality

引用

IEEE International Conference on Embedded and real-time computing Systems and Applications (RTCSA)

作者： Tei-Wei Kuo Shie-Kai Ni Giun-Haur Huang Real Time Systems Laboratory Department of Computer Science and Information Engineering National Chung Cheng University Chiayi Taiwan Department of New Technology Development Platform Software Division Acer Incorporated Taipei Taiwan System Software Laboratory Institute for Information Industry Taipei Taiwan

ISBN: (纸本)081869209X

This paper generalizes the load scaling techniques proposed in (Kuo and Mok, 1991) for fixed-priority real-time applications. A framework is proposed to adjust the system workload by relating the criticality and flexibility of a process to the resource allocation problem. A load adjustment procedure based on the approximation algorithm (Ni et al., 1997) is proposed to maximize the system profit in an on-line fashion. When the list of allowable configurations is implicitly given by scalable periodic processes, the corresponding load filtering problem is shown to be NP-complete. We also prove the upper bound of the system profit and provide a mechanism to balance the schedulability and the maximum profit of the system.

关键词： Filtering Resource management Job shop scheduling Timing real time systems Approximation algorithms Upper bound Laboratories Frequency computer science

来源：评论

学校读者我要写书评

暂无评论

AQuA: an adaptive architecture that provides dependable distributed objects

AQuA: an adaptive architecture that provides dependable dist...

引用

Reliable Distributed Systems

作者： M. Cukier J. Ren C. Sabnis D. Henke J. Pistole W.H. Sanders D.E. Bakken M.E. Berman D.A. Karr R.E. Schantz Center for Reliable and High-Performance Computing Coordinated Science Laboratory and Electrical and Computer Engineering Department University of Illinois Urbana-Champaign Urbana IL USA BBN Technologies Inc. Cambridge MA USA

Dependable distributed systems are difficult to build. This is particularly true if they have dependability requirements that change during the execution of an application, and are built with commercial off-the-shelf hardware. In that case, fault tolerance must be achieved using middleware software, and mechanisms must be provided to communicate the dependability requirements of a distributed application to the system and to adapt the system's configuration to try to achieve the desired dependability. The AQuA architecture allows distributed applications to request a desired level of availability using the Quality Objects (QuO) framework and includes a dependability manager that attempts to meet requested availability levels by configuring the system in response to outside requests and changes in system resources due to faults. The AQuA architecture uses the QuO runtime to process and invoke availability requests, the Proteus dependability manager to configure the system in response to faults and availability requests, and the Ensemble protocol stack to provide group communication services. Furthermore, a CORBA interface is provided to application objects using the AQuA gateway. The gateway provides a mechanism to translate between process-level communication, as supported by Ensemble, and IIOP messages, understood by Object Request Brokers. Both active and passive replication are supported, and the replication type to use is chosen based on the performance and dependability requirements of particular distributed applications.

关键词： Availability Application software computer architecture Hardware Fault tolerant systems Middleware Communication system software Quality management Resource management Runtime

来源：评论

学校读者我要写书评

暂无评论

Statistical real-time channels on multiaccess bus networks

引用

IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS 1997年第8期8卷 769-780页

作者： Chou, CC Shin, KG the Real-Time Computing Laboratory Department of Electrical Engineering and Computer Science The University of Michigan

real-time communication with performance guarantees is expected to become an important and necessary feature of future computer networks. In this paper, we present a scheme which can provide real-time communication services with both absolute and statistical performance guarantees on multiaccess bus networks for given input traffic characteristics and performance requirements. The proposed scheme reserves network bandwidth for real-time connections according to their needs. It also allows for independent addition and deletion of real-time connections while preserving existing guarantees. Our extensive simulation results for motion video communication have shown the proposed scheme to outperform the other well-known schemes.

关键词： real-time communication real-time connection/channel multimedia systems FieldBus (SP50) multiaccess networks digital video transmission

来源：评论

学校读者我要写书评

暂无评论

A fast algorithm for the minimax flow problem with 0/1 weights

引用

APPLIED MATHEMATICS LETTERS 1997年第1期10卷 11-16页

作者： Han, CC Real-Time Computing Laboratory Department of Electrical Engineering and Computer Science The University of Michigan Ann Arbor MI 48109-2122 U.S.A.

In this paper, we define the minimax flow problem and design an O(k . M(n, m)) time optimal algorithm for a special case of the problem in which the weights on arcs are either O or 1, where n is the number of vertices, m is the number of arcs, k (where 1 less than or equal to k less than or equal to m) is the number of arcs with nonzero weights, and M(n;m) is the best time bound for finding a maximum flow in a network.

关键词： design and analysis of algorithms f-saturated critical arcs maximum flow minimax flow residual network

来源：评论

学校读者我要写书评

暂无评论

QoS negotiation in real-time systems and its application to automated flight control

QoS negotiation in real-time systems and its application to ...

引用

3rd IEEE real-time Technology and Applications Symposium

作者： Abdelzaher, TF Atkins, EM Shin, KG Real- Time Computing Laboratory Department of Electrical Engineering and Computer Science University of Michigan Ann Arbor MI 48109-2122 United States

ISBN: (纸本)0818680164

We propose a model for quality-of-service (QoS) negotiation in building real-time services to meet both predictability and graceful degradation requirements. QoS negotiation is shown to (i) outperform conventional ''binary'' admission control schemes (either guaranteeing the required QoS or rejecting the service request), and (ii) achieve higher application-perceived system utility. We incorporated the proposed QoS-negotiation model into an example realtime middleware service, called RTPOOL, which manages a distributed pool of shared computing resources (processors) to guarantee timeliness QoS for real-time applications. The efficacy and power of QoS negotiation are demonstrated for an automated flight control system implemented on a network of PCs running RTPOOL. This system is used to fly an F-16 fighter aircraft modeled using the Aerial Combat (ACM) F-16 Flight Simulator. Experimental results indicate that QoS negotiation, while maintaining real-time guarantees, enables graceful QoS degradation under conditions in which traditional schedulability analysis and admission control schemes fail.

关键词： real time systems

来源：评论

学校读者我要写书评

暂无评论

An efficient semaphore implementation scheme for small-memory embedded systems

An efficient semaphore implementation scheme for small-memor...

引用

3rd IEEE real-time Technology and Applications Symposium

作者： Zuberi, KM Shin, KG Real-Time Computing Laboratory Department of Electrical Engineering and Computer Science University of Michigan Ann Arbor MI 48109-2122 United States

ISBN: (纸本)0818680164

In object-oriented programming, updates to the state variables of objects (by the methods of the object) have to be protected through semaphores to ensure mutual exclusion. Semaphore operations are invoked each time an, object is accessed, and this represents significant run-time overhead. This a's of special concern in cost-conscious, small-size embedded systems such as those used in automotive applications - where costs must be kept to an absolute minimum. Object-oriented programming can be feasible an such applications only if the OS provides efficient, lour-overhead semaphores. We present a new semaphore implementation scheme which saves one context switch per semaphore lod operation in most circumstances and gives performance improvements of 18-25% over traditional semaphore implementation schemes.

关键词： Object oriented programming

来源：评论

学校读者我要写书评

暂无评论

Comment on a pre-run-time scheduling algorithm for hard real-time systems

引用

IEEE Transactions on Software engineering 1997年第9期23卷 599-600页

作者： Abdelzaher, Tarek F. Shin, Kang G. Real-Time Computing Laboratory Department of Electrical Engineering and Computer Science University of Michigan Ann Arbor MI 48109 United States

In Shepard and Gagne [1], a branch-and-bound implicit enumeration algorithm is described whose purpose is to generate a feasible schedule, if any, for each processor on a multiprocessing node running hard real-time processes. The optimization criterion is to minimize process lateness defined as the difference between the process completion time and deadline. We show in this correspondence that this algorithm does not always succeed in finding a feasible solution, and describe the reason why the algorithm might fail. © 1997 IEEE.

关键词： Branch and bound scheduling algorithm Hard real-time systems Multiprocessors Pre-run-time scheduling Precedence constraints

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：