• 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 3,765
Next 10 →

Quantization

by Robert M. Gray, David L. Neuhoff - IEEE TRANS. INFORM. THEORY , 1998
"... The history of the theory and practice of quantization dates to 1948, although similar ideas had appeared in the literature as long ago as 1898. The fundamental role of quantization in modulation and analog-to-digital conversion was first recognized during the early development of pulsecode modula ..."
Abstract - Cited by 884 (12 self) - Add to MetaCart
The history of the theory and practice of quantization dates to 1948, although similar ideas had appeared in the literature as long ago as 1898. The fundamental role of quantization in modulation and analog-to-digital conversion was first recognized during the early development of pulsecode

EEGLAB: an open source toolbox for analysis of single-trial EEG dynamics including independent component analysis

by Arnaud Delorme, Scott Makeig - J. Neurosci. Methods
"... Abstract: We have developed a toolbox and graphic user interface, EEGLAB, running under the cross-platform MATLAB environment (The Mathworks, Inc.) for processing collections of single-trial and/or averaged EEG data of any number of channels. Available functions include EEG data, channel and event i ..."
Abstract - Cited by 886 (45 self) - Add to MetaCart
the behavior of EEGLAB to available memory. Middle-layer functions allow users to customize data processing using command history and interactive ‘pop ’ functions. Experienced MATLAB users can use EEGLAB data structures and stand-alone signal processing functions to write custom and/or batch analysis scripts

Lottery Scheduling: Flexible Proportional-Share Resource Management

by Carl A. Waldspurger, William E. Weihl , 1994
"... This paper presents lottery scheduling, a novel randomized resource allocation mechanism. Lottery scheduling provides efficient, responsive control over the relative execution rates of computations. Such control is beyond the capabilities of conventional schedulers, and is desirable in systems that ..."
Abstract - Cited by 480 (5 self) - Add to MetaCart
that service requests of varying importance, such as databases, media-based applications, and networks. Lottery scheduling also supports modular resource management by enabling concurrent modules to insulate their resource allocation policies from one another. A currency abstraction is introduced to flexibly

Predicting fault incidence using software change history

by Todd L. Graves, Alan F. Karr, J. S. Marron, Harvey Siy - IEEE Transactions on Software Engineering , 2000
"... AbstractÐThis paper is an attempt to understand the processes by which software ages. We define code to be aged or decayed if its structure makes it unnecessarily difficult to understand or change and we measure the extent of decay by counting the number of faults in code in a period of time. Using ..."
Abstract - Cited by 262 (2 self) - Add to MetaCart
change management data from a very large, long-lived software system, we explore the extent to which measurements from the change history are successful in predicting the distribution over modules of these incidences of faults. In general, process measures based on the change history are more useful

Detection of Logical Coupling Based on Product Release History

by Harald Gall, Karin Hajek, Mehdi Jazayeri , 1998
"... Code-based metrics such as coupling and cohesion are used to measure a system’s structural complexity. But dealing with large systems—those consisting of several millions of lines — at the code level faces many problems. An alternative approach is to concentrate on the system’s building blocks such ..."
Abstract - Cited by 208 (13 self) - Add to MetaCart
such as programs or modules as the unit of examination. We present an approach that uses information in a release history of a system to uncover logical dependencies and change patterns among modules. We have developed the approach by working with 20 releases of a large Telecommunications Switching System. We use

DRPM: Dynamic Speed Control for Power Management in Server Class Disks

by Sudhanva Gurumurthi, Anand Sivasubramaniam, Mahmut Kandemir, Hubertus Franke - In Proceedings of the International Symposium on Computer Architecture (ISCA , 2003
"... A large portion of the power budget in server environments goes into the I/O subsystem- the disk array in particular. Traditional approaches to disk power management involve completely stopping the disk rotation, which can take a considerable amount of time, making them less useful in cases where id ..."
Abstract - Cited by 202 (16 self) - Add to MetaCart
idle times between disk requests may not be long enough to outweigh the overheads. This paper presents a new approach called DRPM to modulate disk speed (RPM) dynamically, and gives a practical implementation to exploit this mechanism. Extensive simulations with different workload and hardware

High-Performance Communication Networks

by Jean Walrand, Pravin Varaiya
"... Contents 1 Wireless Networks 1 1.1 Introduction ...................................... 1 1.1.1 History of Wireless Networks ........................ 2 1.1.2 Wireless Data Vision ............................. 5 1.1.3 Technical Challenges ............................. 7 1.2 The Wireless Channel ...... ..."
Abstract - Cited by 163 (4 self) - Add to MetaCart
Contents 1 Wireless Networks 1 1.1 Introduction ...................................... 1 1.1.1 History of Wireless Networks ........................ 2 1.1.2 Wireless Data Vision ............................. 5 1.1.3 Technical Challenges ............................. 7 1.2 The Wireless Channel

Globally distributed content delivery

by John Dilley, Bruce Maggs, Jay Parikh, Harald Prokop, Ramesh Sitaraman, Bill Weihl - Internet Computing, IEEE , 2002
"... Using more than 12,000 servers in over 1,000 networks, Akamai’s distributed content delivery system fights service bottlenecks and shutdowns by delivering content from the Internet’s edge. As Web sites become popular,they’re increasingly vulnerable tothe flash crowd problem, in which request load ov ..."
Abstract - Cited by 160 (18 self) - Add to MetaCart
Using more than 12,000 servers in over 1,000 networks, Akamai’s distributed content delivery system fights service bottlenecks and shutdowns by delivering content from the Internet’s edge. As Web sites become popular,they’re increasingly vulnerable tothe flash crowd problem, in which request load

Cross-layer combining of adaptive modulation and coding with truncated ARQ over wireless links

by Qingwen Liu, Shengli Zhou, Georgios B. Giannakis - IEEE TRANS. WIRELESS COMMUN , 2004
"... We developed a cross-layer design which combines adaptive modulation and coding at the physical layer with a truncated automatic repeat request protocol at the data link layer, in order to maximize spectral efficiency under prescribed delay and error performance constraints. We derive the achieved ..."
Abstract - Cited by 122 (11 self) - Add to MetaCart
We developed a cross-layer design which combines adaptive modulation and coding at the physical layer with a truncated automatic repeat request protocol at the data link layer, in order to maximize spectral efficiency under prescribed delay and error performance constraints. We derive the achieved

Task Request Module Library

by Jan C. Van Der Veen, Sándor P. Fekete, Mateusz Majer, Ali Ahmadinia, Christophe Bobda, Frank Hannig, Jürgen Teich , 2005
"... Abstract — Modern generations of field-programmable gate arrays (FPGAs) allow for partial reconfiguration. In an online context, where the sequence of modules to be loaded on the FPGA is unknown beforehand, repeated insertion and deletion of modules leads to progressive fragmentation of the availabl ..."
Abstract - Add to MetaCart
Abstract — Modern generations of field-programmable gate arrays (FPGAs) allow for partial reconfiguration. In an online context, where the sequence of modules to be loaded on the FPGA is unknown beforehand, repeated insertion and deletion of modules leads to progressive fragmentation
Next 10 →
Results 1 - 10 of 3,765
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