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

CiteSeerX logo

Tools

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

unknown title

by M. Escobedo, J. J. L. Velázquez
"... ar ..."
Abstract - Add to MetaCart
Abstract not found

UNITU–THEP–3/1998 FAU–TP3–98/2 Solving a Coupled Set of Truncated QCD Dyson–Schwinger Equations

by A. Hauck A, L. Von Smekal B, R. Alkofer A , 1998
"... Truncated Dyson–Schwinger equations represent finite subsets of the equations of motion for Green’s functions. Solutions to these non–linear integral equations can account for non–perturbative correlations. A closed set of coupled Dyson–Schwinger equations for the propagators of gluons and ghosts in ..."
Abstract - Add to MetaCart
Truncated Dyson–Schwinger equations represent finite subsets of the equations of motion for Green’s functions. Solutions to these non–linear integral equations can account for non–perturbative correlations. A closed set of coupled Dyson–Schwinger equations for the propagators of gluons and ghosts in Landau gauge QCD is obtained by neglecting all contributions from irreducible 4–point correlations and by implementing the Slavnov–Taylor identities for the 3–point vertex functions. We solve this coupled set in an one–dimensional approximation which allows for an analytic infrared expansion necessary to obtain numerically stable results. This technique, which was also used in our previous solution of the gluon Dyson–Schwinger equation in the Mandelstam approximation, is here extended to solve the coupled set of integral equations for the propagators of gluons and ghosts simultaneously. In particular, the gluon propagator is shown to vanish for small spacelike momenta whereas the previoulsy neglected ghost propagator is found to be enhanced in the infrared. The running coupling of the non–perturbative subtraction scheme approaches an infrared stable fixed point at a critical value of the coupling, αc ≃ 9.5.

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:

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

Natural Slow-Roll Inflation 1

by R. F. Langbein, K. Langfeld, H. Reinhardt, L. V. Smekal , 1993
"... It is shown that the non-perturbative dynamics of a phase change to the non-trivial phase of λϕ 4-theory in the early universe can give rise to slowrollover inflation without recourse to unnaturally small couplings. 1 Supported by DFG under contract Re 856/1 − 1 ..."
Abstract - Add to MetaCart
It is shown that the non-perturbative dynamics of a phase change to the non-trivial phase of λϕ 4-theory in the early universe can give rise to slowrollover inflation without recourse to unnaturally small couplings. 1 Supported by DFG under contract Re 856/1 − 1

unknown title

by Dissertationes Forestales, Kristiina Karhu, Prof Emeritus, Carl Johan Westman, Assoc Prof, Annemieke Gärdenäs , 2010
"... Temperature sensitivity of soil organic matter decomposition in boreal soils ..."
Abstract - Add to MetaCart
Temperature sensitivity of soil organic matter decomposition in boreal soils

RESEARCH Substrate cycles in Penicill

by unknown authors
"... quantified by isotopic non ..."
Abstract - Add to MetaCart
quantified by isotopic non

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

1Backing off from Infinity: Performance Bounds via Concentration of Spectral Measure for Random MIMO Channels

by Yuxin Chen, Andrea J. Goldsmith, Yonina C. Eldar
"... Abstract—The performance analysis of random vector chan-nels, particularly multiple-input-multiple-output (MIMO) chan-nels, has largely been established in the asymptotic regime of large channel dimensions, due to the analytical intractability of characterizing the exact distribution of the objectiv ..."
Abstract - Add to MetaCart
Abstract—The performance analysis of random vector chan-nels, particularly multiple-input-multiple-output (MIMO) chan-nels, has largely been established in the asymptotic regime of large channel dimensions, due to the analytical intractability of characterizing the exact distribution of the objective performance metrics. This paper exposes a new non-asymptotic framework that allows the characterization of many canonical MIMO system performance metrics to within a narrow interval under moderate-to-large channel dimensionality, provided that these metrics can be expressed as a separable function of the singular values of the matrix. The effectiveness of our framework is illustrated through two canonical examples. Specifically, we characterize the mutual information and power offset of random MIMO channels, as well as the minimum mean squared estimation error of MIMO channel inputs from the channel outputs. Our results lead to simple, informative, and reasonably accurate control of various performance metrics in the finite-dimensional regime, as corroborated by the numerical simulations. Our analysis frame-work is established via the concentration of spectral measure phenomenon for random matrices uncovered by Guionnet and Zeitouni, which arises in a variety of random matrix ensembles irrespective of the precise distributions of the matrix entries. Index Terms—MIMO, massive MIMO, confidence interval, concentration of spectral measure, random matrix theory, non-asymptotic analysis, mutual information, MMSE I.

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
Next 10 →
Results 1 - 10 of 70
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