- About
-
The Global ETD Search service is a free service for researchers
to find electronic theses and dissertations. This service is
provided by the
Networked Digital Library of Theses and Dissertations.
Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.
Search results
Showing 51 to 60 of 82 (0.015 seconds)| 51 |
HAEC News06 September 2013 (has links)
Newsletter des Sonderforschungsbereichs 912 "Highly Adaptive Energy-Efficient Computing" (HAEC)
|
| 52 |
HAEC NewsJanuary 2012 (has links)
No description available.
|
| 53 |
HAEC NewsJanuary 2012 (has links)
No description available.
|
| 54 |
HAEC News06 September 2013 (has links) (PDF)
No description available.
|
| 55 |
HAEC NewsJanuary 2013 (has links)
No description available.
|
| 56 |
Towards a Unifying Visualization OntologyVoigt, Martin, Polowinski, Jan 13 April 2011 (has links) (PDF)
Although many terminologies, taxonomies and also first ontologies for visualization have been suggested, there is still no unified and formal knowledge representation including the various fields of this interdisciplinary domain. We moved a step towards such an ontology by systematically reviewing existing models and classifications, identifying important fields and discussing inconsistently used terms. Finally, we specified an initial visualization ontology which can be used for both classification and synthesis of graphical representations. Our ontology can also serve the visualization community as a foundation to further formalize, align and unify its existing and future knowledge.
|
| 57 |
Non-regenerative Two-Hop Wiretap Channels using Interference NeutralizationGerbracht, Sabrina, Jorswieck, Eduard A., Zheng, Gan, Ottersten, Björn 23 May 2013 (has links) (PDF)
In this paper, we analyze the achievable secrecy rates in the two-hop wiretap channel with four nodes, where the transmitter and the receiver have multiple antennas while the relay and the eavesdropper have only a single antenna each. The relay is operating in amplify-and-forward mode and all the channels between the nodes are known perfectly by the transmitter. We discuss different transmission and protection schemes like artificial noise (AN). Furthermore, we introduce interference neutralization (IN) as a new protection scheme. We compare the different schemes regarding the high-SNR slope and the high-SNR power offset and illustrate the performance by simulation results. It is shown analytically as well as by numerical simulations that the high SNR performance of the proposed IN scheme is better than the one of AN.
|
| 58 |
Comparison of LDPC Block and LDPC Convolutional Codes based on their Decoding LatencyHassan, Najeeb ul, Lentmaier, Michael, Fettweis, Gerhard P. 11 February 2013 (has links) (PDF)
We compare LDPC block and LDPC convolutional codes with respect to their decoding performance under low decoding latencies. Protograph based regular LDPC codes are considered with rather small lifting factors. LDPC block and convolutional codes are decoded using belief propagation. For LDPC convolutional codes, a sliding window decoder with different window sizes is applied to continuously decode the input symbols. We show the required Eb/N0 to achieve a bit error rate of 10 -5 for the LDPC block and LDPC convolutional codes for the decoding latency of up to approximately 550 information bits. It has been observed that LDPC convolutional codes perform better than the block codes from which they are derived even at low latency. We demonstrate the trade off between complexity and performance in terms of lifting factor and window size for a fixed value of latency. Furthermore, the two codes are also compared in terms of their complexity as a function of Eb/N0. Convolutional codes with Viterbi decoding are also compared with the two above mentioned codes.
|
| 59 |
Communications with 1-Bit Quantization and Oversampling at the Receiver: Benefiting from Inter-Symbol-InterferenceKrone, Stefan, Fettweis, Gerhard 25 January 2013 (has links) (PDF)
1-bit analog-to-digital conversion is very attractive for low-complexity communications receivers. A major drawback is, however, the small spectral efficiency when sampling at symbol rate. This can be improved through oversampling by exploiting the signal distortion caused by the transmission channel. This paper analyzes the achievable data rate of band-limited communications channels that are subject to additive noise and inter-symbol-interference with 1-bit quantization and oversampling at the receiver. It is shown that not only the channel noise but also the inter-symbol-interference can be exploited to benefit from oversampling.
|
| 60 |
Static Partial Order Reduction for Probabilistic Concurrent SystemsFernández-Díaz, Álvaro, Baier, Christel, Benac-Earle, Clara, Fredlund, Lars-Åke 10 September 2013 (has links) (PDF)
Sound criteria for partial order reduction for probabilistic concurrent systems have been presented in the literature. Their realization relies on a depth-first search-based approach for generating the reduced model. The drawback of this dynamic approach is that it can hardly be combined with other techniques to tackle the state explosion problem, e.g., symbolic probabilistic model checking with multi-terminal variants of binary decision diagrams. Following the approach presented by Kurshan et al. for non-probabilistic systems, we study partial order reduction techniques for probabilistic concurrent systems that can be realized by a static analysis. The idea is to inject the reduction criteria into the control flow graphs of the processes of the system to be analyzed. We provide the theoretical foundations of static partial order reduction for probabilistic concurrent systems and present algorithms to realize them. Finally, we report on some experimental results.
|
Page generated in 0.0236 seconds