• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

Advanced Search Include Citations

Tools

Sorted by:
Try your query at:
Semantic Scholar Scholar Academic
Google Bing DBLP
Results 1 - 10 of 2,522
Next 10 →

Static Scheduling of Synchronous Data Flow Programs for Digital Signal Processing

by Edward Ashford Lee, David G. Messerschmitt - IEEE TRANSACTIONS ON COMPUTERS , 1987
"... Large grain data flow (LGDF) programming is natural and convenient for describing digital signal processing (DSP) systems, but its runtime overhead is costly in real time or cost-sensitive applications. In some situations, designers are not willing to squander computing resources for the sake of pro ..."
Abstract - Cited by 598 (37 self) - Add to MetaCart
Large grain data flow (LGDF) programming is natural and convenient for describing digital signal processing (DSP) systems, but its runtime overhead is costly in real time or cost-sensitive applications. In some situations, designers are not willing to squander computing resources for the sake

Brain magnetic resonance imaging with contrast dependent on blood oxygenation.

by S Ogawa , T M Lee , A R Kay , D W Tank - Proc. Natl. Acad. Sci. USA , 1990
"... ABSTRACT Paramagnetic deoxyhemoglobin in venous blood is a naturally occurring contrast agent for magnetic resonance imaging (MRI). By accentuating the effects of this agent through the use of gradient-echo techniques in high fields, we demonstrate in vivo images of brain microvasculature with imag ..."
Abstract - Cited by 648 (1 self) - Add to MetaCart
with image contrast reflecting the blood oxygen level. This blood oxygenation level-dependent (BOLD) contrast follows blood oxygen changes induced by anesthetics, by insulininduced hypoglycemia, and by inhaled gas mixtures that alter metabolic demand or blood flow. The results suggest that BOLD contrast can

The Advanced Regional Prediction System (ARPS) -- A multi-scale . . .

by M. Xue, et al. , 2001
"... ... numerical solution procedures and the parameterizations of subgrid-scale and PBL turbulence of the Advanced Regional Prediction System (ARPS) were described. The dynamic and numerical framework of the model was verified using idealized and real mountain flow cases and an idealized density curren ..."
Abstract - Cited by 290 (131 self) - Add to MetaCart
... numerical solution procedures and the parameterizations of subgrid-scale and PBL turbulence of the Advanced Regional Prediction System (ARPS) were described. The dynamic and numerical framework of the model was verified using idealized and real mountain flow cases and an idealized density

Developments in the Measurement of Subjective Well-Being

by Daniel Kahneman , Alan B Krueger - Psychological Science. , 1993
"... F or good reasons, economists have had a long-standing preference for studying peoples' revealed preferences; that is, looking at individuals' actual choices and decisions rather than their stated intentions or subjective reports of likes and dislikes. Yet people often make choices that b ..."
Abstract - Cited by 284 (7 self) - Add to MetaCart
momentary utilities over time that Edgeworth had in mind. This is not the case, however. Numerous studies have related individuals' retrospective evaluations of an experience to their record of real-time reports. Although retrospective evaluations are related to the real-time reports

Packet Classification on Multiple Fields

by Pankaj Gupta , Nick McKeown , 1999
"... Routers classify packets to determine which flow they belong to, and to decide what service they should receive. Classification may, in general, be based on an arbitrary number of fields in the packet header. Performing classification quickly on an arbitrary number of fields is known to be difficult ..."
Abstract - Cited by 261 (4 self) - Add to MetaCart
to be difficult, and has poor worst-case performance. In this paper, we consider a number of classifiers taken from real networks. We find that the classifiers contain considerable structure and redundancy that can be exploited by the classification algorithm. In particular, we find that a simple multi

Truthful Mechanisms for One-Parameter Agents

by Aron Archer, Eva Tardos
"... In this paper, we show how to design truthful (dominant strategy) mechanisms for several combinatorial problems where each agent’s secret data is naturally expressed by a single positive real number. The goal of the mechanisms we consider is to allocate loads placed on the agents, and an agent’s sec ..."
Abstract - Cited by 232 (3 self) - Add to MetaCart
truthful mechanisms for maximum flow, Qjj P Cj (scheduling related machines to minimize the sum of completion times), optimizing an affine function over a fixed set, and special cases of uncapacitated facility location. In addition, for Qjj P wjCj (minimizing the weighted sum of completion times), we prove

Non-control-data attacks are realistic threats

by Shuo Chen, Jun Xu, Emre C. Sezer, Prachi Gauriar, Ravishankar K. Iyer - In USENIX Security Symposium , 2005
"... Most memory corruption attacks and Internet worms follow a familiar pattern known as the control-data attack. Hence, many defensive techniques are designed to protect program control flow integrity. Although earlier work did suggest the existence of attacks that do not alter control flow, such attac ..."
Abstract - Cited by 185 (6 self) - Add to MetaCart
, such attacks are generally believed to be rare against real-world software. The key contribution of this paper is to show that non-control-data attacks are realistic. We demonstrate that many real-world applications, including FTP, SSH, Telnet, and HTTP servers, are vulnerable to such attacks. In each case

The price of routing unsplittable flow

by Baruch Awerbuch, Yossi Azar, Amir Epstein - In Proc. 37th Symp. Theory of Computing (STOC , 2005
"... The essence of the routing problem in real networks is that the traffic demand from a source to destination must be satisfied by choosing a single path between source and destination. The splittable version of this problem is when demand can be satisfied by many paths, namely a flow from source to d ..."
Abstract - Cited by 140 (3 self) - Add to MetaCart
The essence of the routing problem in real networks is that the traffic demand from a source to destination must be satisfied by choosing a single path between source and destination. The splittable version of this problem is when demand can be satisfied by many paths, namely a flow from source

A classification of natural rivers.

by David L Rosgen - Catena , 1994
"... Abstract A classification system for natural rivers is presented in which a morphological arrangement of stream characteristics is organized into relatively homogeneous stream types. This paper describes morphologically similar stream reaches that are divided into 7 major stream type categories tha ..."
Abstract - Cited by 173 (1 self) - Add to MetaCart
in the mountains to the coastal plains. A stream hierarchical inventory system is presented which utilizes the stream classification system. Examples for use of this stream classification system for engineering, fish habitat enhancement, restoration and water resource management applications are presented

Bounding worst-case instruction cache performance

by Robert Arnold, Frank Mueller, David Whalley, Marion Harmon - In IEEE Real-Time Systems Symposium , 1994
"... The use of caches poses a difficult tradeoff for architects of real-time systems. While caches provide significant performance advantages, they have also been viewed as inherently unpredictable since the behavior of a cache reference depends upon the history of the previous references. The use of ca ..."
Abstract - Cited by 131 (38 self) - Add to MetaCart
Simulation is used to analyze a program’s control flow to statically categorize the caching behavior of each instruction. A timing analyzer, which uses the categorization information, then estimates the worst-case instruction cache performance for each loop and function in the program. 1.
Next 10 →
Results 1 - 10 of 2,522
Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University