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

Appointments for 2005-2006 term

IEEE Transactions on Very Large Scale Integration (VLSI) systems 2005年第7期13卷 773-782页

作者： Ranganathan, Nagarajan Agrawal, Vishwani D. Chakradhar, Srimat T. Chakrabarty, Krishnendu Courtois, Bernard DeMara, Ronald Hu, Xiaobo Sharon Ismail, Yehea I. Jha, Niraj K. John, Lizy Kurian Ker, Ming-Dou Koren, Israel Liu, Bin-Da Marculescu, Diana Marculescu, Radu Narayanan, Vijaykrishnan Nassif, Sani R. Nowick, Steven M. Sapatnekar, Sachin S. Sherlekar, Sunil Sylvester, Dennis Vemuri, Ranga Pham, Michael Department of Computer Science and Engineering University of South Florida Tampa FL 33620 United States Department of Computer Science and Engineering Nanomaterials and Nanomanufacturing Research Center University of South Florida Tampa United States IEEE United States Systems United States Department of Electrical and Computer Engineering Rutgers University New Brunswick NJ United States IETE India ACM NEC Laboratories America Inc. Princeton NJ United States Duke University Durham NC United States ACM SIGDA Sigma Xi United States Laboratory of Techniques of Informatics and Microelectronics for Computer Architectecture ASME IMAPS IEEE Computer Society University of Central Florida Orlando United States Computer Engineering Program SEECS Department of Computer Science and Engineering University of Notre Dame Notre Dame IN United States Northwestern University Evanston IL United States Department of Electrical Engineering Princeton University Princeton NJ United States Association for Computing Machinery Austin United States UT Austin Engineering Foundation United States Department of Electronics Engineering National Chiao-Tung University Taiwan Department of Electrical and Computer Engineering University of Massachusetts Amherst United States Department of Electrical Engineering Department of Electrical and Computer Engineering Carnegie Mellon University Pittsburgh PA United States Electrical and Computer Engineering Faculty Carnegie Mellon University Pittsburgh PA United States Computer Science and Engineering Department Pennsylvania State University University Park United States IBM Austin Research Laboratory Austin TX United States Columbia University New York NY United States Department of Electrical and Computer Engineering University of Minnesota Minneapolis United States Tata Consultancy Services Centre of Excellence for Embedded Systems India Department of Electrical Engineering IIT Bombay India Department of Electrical Engineering Uni

No abstract available

关键词：

来源：评论

学校读者我要写书评

暂无评论

Task allocation for event-aware spatiotemporal sampling of environmental variables

Task allocation for event-aware spatiotemporal sampling of e...

引用

2005 IEEE/RSJ International Conference on Intelligent Robots and systems

作者： M.A. Batalin G.S. Sukhatme Yan Yu R. Pon J. Gordon M.H. Rahimi W.J. Kaiser G.J. Pottie D.E. Estrin Center for Robotics and Embedded Systems Robotic Embedded Systems Laboratory Computer Science Department University of Southern California Los Angeles CA USA Department of Computer Science Center for Embedded Networked Sensing University of California Los Angeles CA USA Department of Electrical Engineering Center for Embedded Networked Sensing University of California Los Angeles CA USA

Monitoring of environmental phenomena with embedded networked sensing confronts the challenges of both unpredictable variability in the spatial distribution of phenomena coupled with the demands for a high spatial sampling rate in three dimensions. For example, low distortion mapping of critical solar radiation properties in forest environments may require two-dimensional spatial sampling rates of greater than 10 samples/m/sup 2/ over transects exceeding 1000 m/sup 2/. Clearly, adequate sampling coverage of such transect requires an impractically large number of sensing nodes. A new approach, networked infomechanical system (NIMS), has been introduced to combine autonomous-articulated and static sensor nodes enabling sufficient spatiotemporal sampling density over large transects to meet a general set of environmental mapping demands. This paper describes our work on the critical parts of NIMS, the task allocation module. We present our methodologies and the two basic greedy task allocation policies - based on time of the task arrival (time policy) and distance from the robot to the task (distance policy). We present results from NIMS deployed in a forest reserve and from a lab testbed. The results show that both policies are adequate for the task of spatiotemporal sampling, but also complement each other. Finally, we suggest the future direction of research that would both help us better quantify the performance of our system and create more complex policies.

关键词： Spatiotemporal phenomena Sampling methods Sensor phenomena and characterization Solar radiation Mobile robots Atmospheric measurements Ecosystems Robot sensing systems embedded system Computer science

来源：评论

学校读者我要写书评

暂无评论

Comparison of four procedures for the identification of hybrid systems

Comparison of four procedures for the identification of hybr...

引用

8th International Workshop on Hybrid systems: Computation and Control, HSCC 2005

作者： Juloski, Aleksandar Lj. Heemels, W.P.M.H. Ferrari-Trecate, Giancarlo Vidal, René Paoletti, Simone Niessen, J.H.G. Department of Electrical Engineering Eindhoven University of Technology PO Box 513 5600MB Eindhoven Netherlands Embedded Systems Institute P O Box 513 5600 MB Eindhoven Netherlands INRIA Domaine de Voluceau Rocquencourt B.P.105 78153 Le Chesnay Cedex France Center for Imaging Science Johns Hopkins University 308B Clark Hall 3400 N Charles St. Baltimore MD 21218 United States Dipartimento di Ingegneria dell'Informazione Universita' di Siena Via Roma 56 53100 Siena Italy Nyquist Industrial Control P.O. Box 7170 5605 JD Eindhoven Netherlands

In this paper we compare four recently proposed procedures for the identification of Piece Wise AutoRegressive eXogenous (PWARX) and switched ARX models. We consider the clustering-based procedure, the bounded-error procedure, and the Bayesian procedure which all identify PWARX models. We also study the algebraic procedure, which identifies switched linear models. We introduce quantitative measures for assessing the quality of the obtained models. Specific behaviors of the procedures are pointed out, using suitably constructed one dimensional examples. The methods are also applied to the experimental identification of the electronic component placement process in pick-and-place machines. © Springer-Verlag Berlin Heidelberg 2005.

关键词： Hybrid computers

来源：评论

学校读者我要写书评

暂无评论

Applications and experiments with eBlocks - electronic blocks for basic sensor-based systems

Applications and experiments with eBlocks - electronic block...

引用

IEEE Communications Society Conference on Sensor and Ad Hoc Communications and Networks (SECON)

作者： S. Cotterell K. Downey F. Vahid Department of Computer Science and Engineering University of California Riverside USA Department of Electrical Engineering University of California Riverside USA Center for Embedded Computer Systems University of California Irvine USA

Building a sensor-based system typically requires some programming and electronics expertise. However, some applications require only basic logic transformations and/or state maintenance of sensor information. This paper describes a set of electronic blocks, called eBlocks, that enable non-experts to build basic small-scale sensor-based systems. Each block performs a particular sensing, logic/state, or output function. A user builds a system by connecting blocks together. Each block contains a hidden microprocessor executing a pre-determined low-power compute and communication protocol. A difference between eBlocks and widely known sensor-network nodes is that each eBlock has a specific easy-to-understand function, and thus does not require programming. Further, eBlocks are designed to be connected in particular configurations to create an end application, while traditional nodes form a wireless network that must be programmed to form an application. Our physical prototypes can last for several years or more on a 9-volt battery, or can receive power from wall outlets. We describe the domain of applications for which eBlocks are suitable, including being used to build complete systems or to interface with existing sensor-network compute nodes, and we summarize the eBlock compute/communication protocol. We describe experiments, involving hundreds of users of varying levels of expertise, that demonstrate how systems that otherwise would have taken weeks or more to build can be built by non-experts in just a few minutes using eBlocks.

关键词： Logic programming Application software Acoustic sensors Sensor systems Costs Joining processes Protocols Batteries Computer interfaces Motion detection

来源：评论

学校读者我要写书评

暂无评论

Music2Share - Copyright-compliant music sharing in P2P systems

Music2Share - Copyright-compliant music sharing in P2P syste...

引用

作者： Kalker, Ton Epema, Dick H. J. Hartel, Pieter H. Lagendijk, R.L. Van Steen, Maarten Philips Research Eindhoven Eindhoven 5656 AA Netherlands Technical University Eindhoven Eindhoven 5612 AZ Netherlands Parallel and Distributed Systems Group Faculty of Electrical Engineering Mathematics and Computer Science Delft University of Technology Delft 2600 GA Netherlands Distributed and Embedded Systems Group Department of Computer Science University of Twente Enschede 7500 AE Netherlands Delft University of Technology Delft 2628 CD Netherlands Department of Computer Science Vrije Universiteit Amsterdam 1081 HV Netherlands

Peer-to-peer (P2P) networks are generally considered to be free havens for pirated content, in particular with respect to music. We describe a solution for the problem of copyright infringement in P2P networks for music sharing. In particular, we propose a P2P protocol that integrates the functions of identification, tracking, and sharing of music with those of licensing, monitoring, and payment. This highly decentralized music-aware P2P protocol will allow access to large amounts of music of guaranteed quality;it merges in a natural way the policing functions for copyright protection·and an efficient music-management infrastructure for the benefit of the user. © 2004 IEEE.

关键词： Copyrights

来源：评论

学校读者我要写书评

暂无评论

Enforcing safety of real-time schedules on contemporary processors using a virtual simple architecture (VISA)

Enforcing safety of real-time schedules on contemporary proc...

引用

Real-Time systems Symposium (RTSS)

作者： A. Anantaraman K. Seth E. Rotenberg F. Mueller Departments of Computer Science/Electrical and Computer Engineering Center for Embedded Systems Research North Carolina State University Raleigh NC USA Qualcomm Inc. Cary NC USA

Determining safe and tight upper bounds on the worst-case execution time (WCET) of hard real-time tasks running on contemporary microarchitectures is a difficult problem. Current trends in microarchitecture design have created a complexity wall: by enhancing performance through ever more complex architectural features, systems have become increasingly hard to analyze. This paper extends a framework, introduced previously as virtual simple architecture (VISA), to multitasking real-time systems. The objective of VISA is to obviate the need to statically analyze complex processors by instead shifting the burden of guaranteeing deadlines - in part - onto the hardware. The VISA framework exploits a complex processor that ordinarily operates with all of its advanced features enabled, called the complex mode, but which can also be downgraded to a simple mode by gating off the advanced features. A WCET bound is statically derived for a task assuming the simple mode. However, this abstraction is speculatively undermined at run-time by executing the task in the complex mode. The task's progress is continuously gauged to detect anomalous cases in which the complex mode underperforms, in which case the processor switches to the simple mode to explicitly enforce the overall contractual WCET. The processor typically operates in complex mode, generating significant slack, and the VISA safety mechanism ensures bounded timing in atypical cases. Extra slack can be exploited for reducing power consumption and/or enhancing functionality. By extending VISA from single-task to multi-tasking systems, this paper reveals the full extent of VISA'S powerful abstraction capability. Key missing pieces are filled in: (1) preserving integrity of the gauging mechanism despite disruptions caused by preemptions; (2) demonstrating compatibility with arbitrary scheduling and dynamic voltage scaling (DVS) policies; (3) formally describing VISA speculation overheads in terms of padding tasks' WCETs; and

关键词： Safety Processor scheduling Microarchitecture Upper bound Performance analysis Multitasking Real time systems Hardware Runtime Switches

来源：评论

学校读者我要写书评

暂无评论

Scheduling of early quantum tasks

Scheduling of early quantum tasks

引用

Euromicro Conference on Real-Time systems

作者： P.G. Jansen F. Hanssen M.E. Lijding Distributed and Embedded Systems group Faculty of Electrical Engineering Mathematics and Computer Science University of Twente Enschede Netherlands

An Early Quantum Task (EQT) is a Quantum EDF task that has shrunk its first period into one quantum time slot. Its purpose is to be executed as soon as possible, without causing deadline overflow of other tasks. We derive the conditions under which an EQT can be admitted and can have an immediate start. The advantage of scheduling EQTs is shown by its use in a buffered multimedia server. The EQT is associated with a multimedia stream and it will use its first invocation to fill the buffer, such that a client can start receiving data immediately.

关键词： Streaming media Quantum computing Processor scheduling Filling Admission control embedded system Mathematics Computer science Real time systems Multimedia systems

来源：评论

学校读者我要写书评

暂无评论

A way-halting cache for low-energy high-performance systems

IEEE Computer Architecture Letters

引用

IEEE Computer Architecture Letters 2003年第1期2卷 5-5页

作者： Zhang, Chuanjun Yang, Jun Najjar, Walid Department of Electrical Engineering Department of Computer Science and Engineering University of California Riverside United States Embedded Computer Systems UC Irvine United States

We have designed a low power four-way setassociativecache that stores the four lowest-order bits of all way?stags into a fully associative memory, which we call the halt tagarray. The comparison of the halt tag array with the desired tagoccurs concurrently with the address decoding that determineswhich tag and data ways to read from. The halt tag array predeterminesmost tags that cannot match due to their low-orderfour bits mismatching. Further accesses to ways with knownmismatching tags are then halted, thus saving power. Our halttag array has the additional feature of using static logic only,rather than dynamic logic used in highly-associative caches,making our cache consumes even less power. Our result shows55% savings of memory access related energy over a conventionalfour-way set-associative cache. We show nearly 2x energy savingscompared with highly associative caches, while imposing noperformance overhead and only 2% cache area overhead.

关键词： Decoding Logic arrays Circuits Cams Switches Computer science Design engineering Power engineering and energy embedded computing Power engineering computing

来源：评论

学校读者我要写书评

暂无评论

Rate-based end-to-end congestion control of multimedia traffic in packet switched networks

Rate-based end-to-end congestion control of multimedia traff...

引用

International Conference on Information Technology: Coding and Computing (ITCC)

作者： S.R. Subramanya Mingsheng Peng J. Sarangapani Department of Computer Science University of Missouri Rolla MO USA Embedded Systems and Networking Laboratory Department of Electrical and Computer Engineering University of Missouri Rolla MO USA

This paper proposes an explicit rate-based end-to-end congestion control mechanism to alleviate congestion of multimedia traffic in packet switched networks such as the Internet. The congestion is controlled by adjusting the transmission rates of the sources in response to the feedback information from destination such as the buffer occupancy, packet arrival rate and service rate at the outgoing link, so that a desired quality of service (QoS) can be met. The QoS is defined in terms of packet loss ratio, transmission delay, power, and network utilization. Comparison studies demonstrate the effectiveness of the proposed scheme over New-Reno TCP (a variant of AIMD: additive increase multiplicative decrease) technique during simulated congestion. Since it is end-to-end, no router support is necessary, the proposed methodology can be readily applied to today's Internet, as well as for real-time video and voice data transfer in unicast networks.

关键词： Communication system traffic control Intelligent networks Packet switching IP networks Quality of service Traffic control Control systems Internet Communication system control Computer science

来源：评论

学校读者我要写书评

暂无评论

Typing abstractions and management in a component framework 03

Typing abstractions and management in a component framework

引用

Asia and South Pacific Design Automation Conference

作者： F.J. Doucet S.K. Shukla R.K. Gupta Center for Embedded Computer Systems University of California Irvine CA USA Electrical and Computer Engineering Virginia Polytechnic Institute and State University Blacksburg VA USA Computer Science and Engineering University of California San Diego La Jolla CA USA

ISBN: (纸本)9780780376601

We consider the type inference problems in a compositional design environment where the components are automatically instantiated from pre-existing C++-based intellectual property (IP) libraries. We present a component integration language based on scripting for design specification. Our focus is the architectural aspects in the specification that use aggregation - as opposed to the more commonly used inheritance - for composition of components. Our approach simplifies architectural specification by employing a type inference and type management environment. We show that the type inference problem is NP-complete. We present a heuristic based on code generation and parameterization to solve the type inference for IP selection in our C++-based composition environment. We have implemented the composition and type management in the BALBOA framework. The results show the utility of our approach.

关键词： Hardware embedded computing Design engineering Computer architecture Computational modeling Computer science Intellectual property Libraries Environmental management Computer languages

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：