• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • 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 119
Next 10 →

Composition du Jury

by Eric Chaumette, Cédric Richard, Professeur Universités, Yannick Berthoumieu, Professeur Universités, Pascal Chevalier Professeur, Pascal Larzabal, Professeur Universités
"... Caractérisation des problèmes conjoints de détection et d'estimation ..."
Abstract - Add to MetaCart
Caractérisation des problèmes conjoints de détection et d'estimation

Proceedings of the 37th Hawaii International Conference on System Sciences- 2004 QoS Evaluation of JMS: An Empirical Approach

by Shiping Chen, Paul Greenfield
"... JMS is an API specification that defines a standard way for Java applications to access messaging services. All JMS products promise good performance and to properly support the QoS attributes specified in the standard, making it hard to choose between them. Customers who want to determine which JMS ..."
Abstract - Add to MetaCart
JMS is an API specification that defines a standard way for Java applications to access messaging services. All JMS products promise good performance and to properly support the QoS attributes specified in the standard, making it hard to choose between them. Customers who want to determine which JMS product best meets their requirements need a simple, effective and fair methodology for evaluating and comparing competing implementations. This paper presents an empirical methodology for evaluating the QoS implementation of a JMS product. We present a number of test scenarios and define metrics for measuring performance and message persistence. We then illustrate this methodology by using it to evaluate two leading JMS products. Our evaluation results show differences between these products in terms of their overall performance and the impact of various QoS attributes. The case study demonstrates that our empirical methodology is an effective and practical way to test the performance of JMS and other messaging systems.

0 QUANTITATIVE UNIFORM IN TIME CHAOS PROPAGATION FOR BOLTZMANN COLLISION PROCESSES

by S. Mischler, C. Mouhot , 2010
"... ar ..."
Abstract - Add to MetaCart
Abstract not found

TO CODE OR NOT TO CODE

by Présentée À La, Faculté Informatique, Et Communications, Section Des, Systèmes De Communication, Du Grade, De Docteur, Ès Sciences, Prof M. Vetterli, Prof B. Rimoldi, Prof R. Gallager, Prof A. Lapidoth, Prof J. Massey, Prof E. Telatar, Prof S. Verdú, Michael Gastpar, Amos Lapidoth, Jim Ma , 2002
"... de nationalité suisse et originaire de Zurich (ZH) et Lucerne (LU) acceptée sur proposition du jury: ..."
Abstract - Add to MetaCart
de nationalité suisse et originaire de Zurich (ZH) et Lucerne (LU) acceptée sur proposition du jury:

AND

by Tomer Michaeli, Yonina C. Eldar, Guillermo Sapiro , 2014
"... ar ..."
Abstract - Add to MetaCart
Abstract not found

RICE UNIVERSITY Regime Change: Sampling Rate vs. Bit-Depth in Compressive Sensing

by Jason Noah Laska , 2011
"... The compressive sensing (CS) framework aims to ease the burden on analog-to-digital converters (ADCs) by exploiting inherent structure in natural and man-made signals. It has been demon-strated that structured signals can be acquired with just a small number of linear measurements, on the order of t ..."
Abstract - Add to MetaCart
The compressive sensing (CS) framework aims to ease the burden on analog-to-digital converters (ADCs) by exploiting inherent structure in natural and man-made signals. It has been demon-strated that structured signals can be acquired with just a small number of linear measurements, on the order of the signal complexity. In practice, this enables lower sampling rates that can be more easily achieved by current hardware designs. The primary bottleneck that limits ADC sam-pling rates is quantization, i.e., higher bit-depths impose lower sampling rates. Thus, the decreased sampling rates of CS ADCs accommodate the otherwise limiting quantizer of conventional ADCs. In this thesis, we consider a different approach to CS ADC by shifting towards lower quantizer bit-depths rather than lower sampling rates. We explore the extreme case where each measurement is quantized to just one bit, representing its sign. We develop a new theoretical framework to analyze this extreme case and develop new algorithms for signal reconstruction from such coarsely quantized measurements. The 1-bit CS framework leads us to scenarios where it may be more appropriate to reduce bit-depth instead of sampling rate. We find that there exist two distinct regimes of operation that correspond to high/low signal-to-noise ratio (SNR). In the measurement

1Shannon Meets Nyquist: Capacity Limits of Sampled Analog Channels

by Yuxin Chen, Yonina C. Eldar, Andrea J. Goldsmith
"... We explore two fundamental questions at the intersection of sampling theory and information theory: how is channel capacity affected by sampling below the channel’s Nyquist rate, and what sub-Nyquist sampling strategy should be employed to maximize capacity. In particular, we first derive the capaci ..."
Abstract - Add to MetaCart
We explore two fundamental questions at the intersection of sampling theory and information theory: how is channel capacity affected by sampling below the channel’s Nyquist rate, and what sub-Nyquist sampling strategy should be employed to maximize capacity. In particular, we first derive the capacity of sampled analog channels for two prevalent sampling mechanisms: filtering followed by sampling and sampling following filter banks. Connections between sampling and MIMO Gaussian channels are illuminated based on this analysis. Optimal prefilters that maximize capacity are identified for both cases, as well as several kinds of channels for which these sampling mechanisms are optimal to maximize capacity at sub-Nyquist rates. We also highlight connections between sampled analog channel capacity and minimum mean squared error estimation from sampled data. In particular, it is shown that for both filtering and filter-bank sampling strategies, the filters maximizing capacity and minimizing mean squared error are equivalent. We also investigate a more general sampling strategy by adding modulation banks to filter-bank sampling. This general sampling method subsumes most nonuniform sampling techniques applied in both theory and practice. We also show a connection between this general sampling method and MIMO Gaussian channels. We then identify the optimal sampling strategy for piece-wise flat sampled

von

by Mathematisch-naturwissenschaftlichen Fakultät, Stefan Lange, Prof Dr, Jan-hendrik Olbertz, Prof Dr, Elmar Kulke
"... eingereicht an der ..."
Abstract - Add to MetaCart
eingereicht an der

Akademisk avhandling för teknisk doktorsexamen vid

by Kungl Tekniska Högskolan, Kth Tryck , 1994
"... mcmxciv This thesis deals with combinatorics in connection with Coxeter groups, finitely generated but not necessarily finite. The representation theory of groups as nonsingular matrices over a field is of immense theoretical importance, but also basic for computational group theory, where the group ..."
Abstract - Add to MetaCart
mcmxciv This thesis deals with combinatorics in connection with Coxeter groups, finitely generated but not necessarily finite. The representation theory of groups as nonsingular matrices over a field is of immense theoretical importance, but also basic for computational group theory, where

1 An Algebraic Approach to Physical-Layer Network Coding

by Chen Feng, Danilo Silva, Frank R. Kschischang
"... ar ..."
Abstract - Add to MetaCart
Abstract not found
Next 10 →
Results 1 - 10 of 119
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-2016 The Pennsylvania State University