### 1 Interference Channel with an Out-of-Band Relay

"... Abstract—A Gaussian interference channel (IC) with a relay is considered. The relay is assumed to operate over an orthogonal band with respect to the underlying IC, and the overall system is referred to as IC with an out-of-band relay (IC-OBR). The system can be seen as operating over two parallel i ..."

Abstract
- Add to MetaCart

Abstract—A Gaussian interference channel (IC) with a relay is considered. The relay is assumed to operate over an orthogonal band with respect to the underlying IC, and the overall system is referred to as IC with an out-of-band relay (IC-OBR). The system can be seen as operating over two parallel interferencelimited channels: The first is a standard Gaussian IC and the second is a Gaussian relay channel characterized by two sources and destinations communicating through the relay without direct links. We refer to the second parallel channel as OBR Channel (OBRC). The main aim of this work is to identify conditions under which optimal operation, in terms of the capacity region of the IC-OBR, entails either signal relaying and/or interference forwarding by the relay, with either a separable or non-separable use of the two parallel channels, IC and OBRC. Here “separable ” refers to transmission of independent information over the two constituent channels. For a basic model in which the OBRC consists of four orthogonal channels from sources to relay and from relay to destinations (IC-OBR Type-I), a condition is identified under which signal relaying and separable operation is optimal. This condition entails the presence of a relay-to-destinations capacity bottleneck on the OBRC and holds irrespective of the IC. When this condition is not satisfied, various scenarios, which depend on the IC channel gains, are identified in which interference forwarding and non-separable operation are necessary to achieve optimal performance. In these scenarios, the system exploits the “excess capacity ” on the OBRC via interference forwarding to drive the IC-OBR system in specific interference regimes (strong or mixed). The analysis is then turned to a more complex IC-OBR, in which the OBRC consists of only two orthogonal channels, one from sources to relay and one from relay to destinations (IC-OBR Type-II). For this channel, some capacity resuls are derived that parallel the conclusions for IC-OBR Type-I and point to the additional analytical challenges. I.

### AGR 05

"... Responses of soil biological processes to elevated atmospheric [CO2] and nitrogen addition in a poplar plantation ..."

Abstract
- Add to MetaCart

Responses of soil biological processes to elevated atmospheric [CO

*2*] and nitrogen addition in a poplar plantation### ON MAXIMALLY INFLECTED HYPERBOLIC CURVES

"... Abstract. In this note we study the distribution of real inflection points among the ovals of a real non-singular hyperbolic curve of even degree. Using Hilbert’s method we show that for any integers d and r such that 4 ≤ r ≤ 2d2 − 2d, there is a non-singular hyperbolic curve of degree 2d in R2 with ..."

Abstract
- Add to MetaCart

Abstract. In this note we study the distribution of real inflection points among the ovals of a real non-singular hyperbolic curve of even degree. Using Hilbert’s method we show that for any integers d and r such that 4 ≤ r ≤

*2*d*2*−*2*d, there is a non-singular hyperbolic curve of degree*2*d in R*2*### Akademisk avhandling för teknisk doktorsexamen vid

, 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 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.

###
Nuclear Physics B *Proceedings* Supplement – preprint (2014) 1–42 Nuclear Physics B *Proceedings* Supplement Universal Aspects of QCD-like TheoriesI

"... In these lectures I review some basic examples of how the concepts of universality and scaling can be used to study aspects of the chiral and the deconfinement transition, if not in QCD directly but in QCD-like theories. As an example for flavor dynamics I discuss a quark-hadron model to describe th ..."

Abstract
- Add to MetaCart

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.### RICE UNIVERSITY Regime Change: Sampling Rate vs. Bit-Depth in Compressive Sensing

, 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

. 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