We are surrounded by electronic devices that take advantage of wireless technologies, from our computer mice, which require little amounts of information, to our cellphones, which demand increasingly higher data rates. Until today, the coexistence of such a variety of services has been guaranteed by a fixed assignment of spectrum resources by regulatory agencies. This has resulted into a blind alley, as current wireless spectrum has become an expensive and a scarce resource. However, recent measurements in dense areas paint a very different picture: there is an actual underutilization of the spectrum by legacy sys-tems. Cognitive radio exhibits a tremendous promise for increasing the spectral efficiency for future wireless systems. Ideally, new secondary users would have a perfect panorama of the spectrum usage, and would opportunistically communicate over the available re-sources without degrading the primary systems. Yet in practice, monitoring the spectrum resources, detecting available resources for opportunistic communication, and transmit-ting over the resources are hard tasks. This thesis addresses the tasks of monitoring, de-

the phase diagram of two-color QCD with the functional renormalization group. Universal aspects of deconfinement are illustrated mainly in the 2 + 1 dimensional SU(N) gauge theories with second order transition where many exact results from spin models can be exploited.

pages 156–175, 2013. [2] Johannes Buchmann, Denise Demirel, and Jeroen van de Graaf. Towards a publicly-verifiable mix-net providing everlasting privacy. In Financial Cryptog-raphy, pages 197–204, 2013. [3] Denise Demirel, Jeroen van de Graaf, and Roberto Araùjo. Improving helios

The recent discovery of dark energy has prompted an investigation of ways in which the accelerated expansion of the universe can be realized. In this dissertation, we present two separate projects related to dark energy. The first project analyzes a class of braneworld models in which multiple branes float in a five-dimensional anti-de Sitter bulk, while the second investigates a class of dark energy models from an effective field theory perspective. Investigations of models including extra dimensions have led to modifications of gravity involving a number of interesting features. In particular, the Randall-Sundrum model is well-known for achieving an amelioration of the hierarchy problem. However, the basic model relies on Minkowski branes and is subject to solar system constraints in the absence of a radion stabilization mechanism. We present a method by which a four-dimensional low-energy description can be obtained for braneworld scenarios, allowing for a number of generalizations to the original models. This method is applied to orbifolded and uncompactified N-brane models, deriving an effective four-dimensional action. The parameter space of this theory is constrained using observational evidence, and it is found that the generalizations do not weaken solar system constraints on the original model. Furthermore, we find that general

Caractérisation des problèmes conjoints de détection et d'estimation

Abstract—This paper studies Gaussian Two-Way Relay Chan-nel where two communication nodes exchange messages with each other via a relay. It is assumed that all nodes operate in half duplex mode without any direct link between the communication nodes. A compress-and-forward relaying strategy using nested lattice codes is first proposed. Then, the proposed scheme is improved by performing a layered coding: a common layer is decoded by both receivers and a refinement layer is recovered only by the receiver which has the best channel conditions. The achievable rates of the new scheme are characterized and are shown to be higher than those provided by the decode-and-forward strategy in some regions. Index Terms—Compress-and-forward, Gaussian channel, lat-tice codes, physical-layer network coding, side information, two-

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 elements are data structures in a computer. Matrices are unnecessarily large structures, and part of this thesis is concerned with small and efficient representations of a large class of Coxeter groups (including most Coxeter groups that anyone ever payed any attention to.) The main contents of the thesis can be summarized as follows. • We prove that for all Coxeter graphs constructed from an n-path of unlabelled edges by adding a new labelled edge and a new vertex (sometimes two new edges and vertices), there is a permutational representation of the corresponding group. Group elements correspond to integer n-sequences and the nodes in the path generate all n! permutations. The extra node has a more complicated action, adding a certain quantity to some of the numbers.

and backchase

eingereicht an der

Effective support for custom proof automation is essential for large-scale interactive proof develop-ment. However, existing languages for automation via tactics either (a) provide no way to specify the behavior of tactics within the base logic of the accompanying theorem prover, or (b) rely