Vorzustellen ist ein kurioses Werk aus der Kartensammlung der SLUB, das in bibliophilen Kreisen nicht ganz unbekannt ist: In einer pittoresken „Karte des Bücherlandes“ stellte der Münchner Graphiker und Illustrator Alphons Woelfle (1884 –1951) 1938 das deutsche Buch- und Verlagswesen dar, in barocker Manier mit Kartusche, Allegorie und antiken Lettern. Schon 1941 neu aufgelegt, erlebte die ursprünglich handkolorierte Lithographie auf Büttenpapier bis heute zahlreiche Nachdrucke, sogar im Postkartenformat: Dabei misst das Blatt im Original 40 mal 29 cm.

Der Radweg Berlin–Dresden ist ein Routenvorschlag für Fahrradtouren zwischen Berlin und Dresden, der seit 2012 von Mitgliedern des Allgemeinen Deutschen Fahrrad-Clubs (ADFC) ausgearbeitet wird. Die Route streckt sich über 251km zwischen der Frauenkirche in Dresden und dem Brandenburger Tor in Berlin. Eine Beschilderung der Route wird langfristig angestrebt. Obwohl die Strecke heute nur „auf dem Papier“ existiert, ist sie schon gut befahrbar: Alle Wege (bis auf kleine unvermeidbare Lücken) sind asphaltiert oder gut verdichtet und frei oder wenig belastet vom motorisierten Verkehr. Auf www.radweg-berlin-dresden.de finden Sie aktuelle Informationen zur Route und es steht eine GPX-Datei für GPS-Geräte kostenlos zur Verfügung.

No description available.

Leo VI (886-912) is an emperor who has suffered from a hostile and inadequate press. He has been portrayed as a weak and careless emperor, known mainly for his dubious parentage and marital exploits. This thesis questions these popular perceptions of Leo, and attempts to present a more realistic account of the emperor and the politics of his age. The aspects of the reign tackled focus on essential elements of Leo's life and rule, presented in a rough chronological framework, and the themes of personal relationships and political ideologies are recurrent. Chapter One examines Leo's relationship with Basil I and his attitude to his Macedonian heritage. Chapter Two considers the fate of the monumental figure of Photios at the emperor's hands. Chapter Three deals with the position and role of the 'all powerful' Stylianos Zaoutzes during the first half of the reign. Chapter Four ponders the origin and meaning of Leo's 'wise' epithet. Chapter Five focuses on the emperor's four marriages. Chapter Six turns to the course of foreign affairs during the reign, concentrating on Bulgaria and the Arab navy, and considers the emperor's attitude towards these military problems. Chapter Seven examines the emperor's relationship with his senatorial officials, focusing on two distinct groups, eunuchs and the generals who originated from families of the eastern frontier. Finally Chapter Eight addresses the tense relationship that existed between Leo and his brother and co-emperor Alexander. What emerges from a consideration of these aspects of Leo and his reign is that this is an emperor who does not deserve the popular perceptions that still persist about him. He was an emperor who forged a 'new' and distinctive imperial style, a style that should not deceive us; he may have been literate, sedentary and city-based, but he was also forceful, strong-willed and conscientious.

No description available.

We consider the problem of secure communications in a Gaussian two-way relay network where two nodes exchange confidential messages only via an untrusted relay. The relay is assumed to be honest but curious, i.e., an eavesdropper that conforms to the system rules and applies the intended relaying scheme. We analyze the achievable secrecy rates by applying network coding on the physical layer or the network layer and compare the results in terms of complexity, overhead, and efficiency. Further, we discuss the advantages and disadvantages of the respective approaches.

Preventing the success of active attacks is of essential importance for network coding since even the infiltration of one single corrupted data packet can jam large parts of the network. The existing approaches for network coding schemes preventing such pollution attacks can be divided into two categories: utilize cryptographic approaches or utilize redundancy similar to error correction coding. Within this paper, we compared both paradigms concerning efficiency of data transmission under various circumstances. Particularly, we considered an attacker of a certain strength as well as the influence of the generation size. The results are helpful for selecting a suitable approach for network coding taking into account both security against pollution attacks and efficiency.

Window decoding schedules are very attractive for message passing decoding of spatially coupled LDPC codes. They take advantage of the inherent convolutional code structure and allow continuous transmission with low decoding latency and complexity. In this paper we show that the decoding complexity can be further reduced if suitable message passing schedules are applied within the decoding window. An improvement based schedule is presented that easily adapts to different ensemble structures, window sizes, and channel parameters. Its combination with a serial (on-demand) schedule is also considered. Results from a computer search based schedule are shown for comparison.

Growing memory capacities and the increasing number of cores on modern hardware enforces the design of new in-memory indexing structures that reduce the number of memory transfers and minimizes the need for locking to allow massive parallel access. However, most applications depend on hard durability constraints requiring a persistent medium like SSDs, which shorten the latency and throughput gap between main memory and hard disks. In this paper, we present our winning solution of the SIGMOD Programming Contest 2011. It consists of an in-memory indexing structure that provides a balanced read/write performance as well as non-blocking reads and single-lock writes. Complementary to this index, we describe an SSD-optimized logging approach to fit hard durability requirements at a high throughput rate.

Communications receivers that rely on 1-bit analogto-digital conversion are advantageous in terms of hardware complexity and power dissipation. Performance limitations due to the 1-bit quantization can be tackled with oversampling. This paper considers the oversampling gain from an information-theoretic perspective by analyzing the channel capacity with 1-bit quantization and oversampling at the receiver for the particular case of AWGN channels. This includes a numerical computation of the capacity and optimal transmit symbol constellations, as well as the derivation of closed-form expressions for large oversampling ratios and for high signal-to-noise ratios of the channel.