Coalitional Games for Transmitter Cooperation in MIMO Multiple Access Channels

Cooperation between nodes sharing a wireless channel is becoming increasingly necessary to achieve performance goals in a wireless network. The problem of determining the feasibility and stability of cooperation between rational nodes in a wireless network is of great importance in understanding cooperative behavior. This paper addresses the stability of the grand coalition of transmitters signaling over a multiple access channel using the framework of cooperative game theory. The external interference experienced by each TX is represented accurately by modeling the cooperation game between the TXs in \emph{partition form}. Single user decoding and successive interference cancelling strategies are examined at the receiver. In the absence of coordination costs, the grand coalition is shown to be \emph{sum-rate optimal} for both strategies. Transmitter cooperation is \emph{stable}, if and only if the core of the game (the set of all divisions of grand coalition utility such that no coalition deviates) is nonempty. Determining the stability of cooperation is a co-NP-complete problem in general. For a single user decoding receiver, transmitter cooperation is shown to be \emph{stable} at both high and low SNRs, while for an interference cancelling receiver with a fixed decoding order, cooperation is stable only at low SNRs and unstable at high SNR. When time sharing is allowed between decoding orders, it is shown using an approximate lower bound to the utility function that TX cooperation is also stable at high SNRs. Thus, this paper demonstrates that ideal zero cost TX cooperation over a MAC is stable and improves achievable rates for each individual user.Comment: in review for publication in IEEE Transactions on Signal Processin

Non-equilibrium beta processes in superfluid neutron star cores

The influence of nucleons superfluidity on the beta relaxation time of degenerate neutron star cores, composed of neutrons, protons and electrons, is investigated. We numerically calculate the implied reduction factors for both direct and modified Urca reactions, with isotropic pairing of protons or anisotropic pairing of neutrons. We find that due to the non-zero value of the temperature and/or to the vanishing of anisotropic gaps in some directions of the phase-space, superfluidity does not always completely inhibit beta relaxation, allowing for some reactions if the superfluid gap amplitude is not too large in respect to both the typical thermal energy and the chemical potential mismatch. We even observe that if the ratio between the critical temperature and the actual temperature is very small, a suprathermal regime is reached for which superfluidity is almost irrelevant. On the contrary, if the gap is large enough, the composition of the nuclear matter can stay frozen for very long durations, unless the departure from beta equilibrium is at least as important as the gap amplitude. These results are crucial for precise estimation of the superfluidity effect on the cooling/slowing-down of pulsars and we provide online subroutines to be implemented in codes for simulating such evolutions.Comment: 11 pages, 6 Figs., published, minor changes, subroutines can be found on line at http://luth2.obspm.fr/~etu/villain/Micro/Resolution.htm

Stretching demi-bits and nondeterministic-secure pseudorandomness

We develop the theory of cryptographic nondeterministic-secure pseudorandomness beyond the point reached by Rudich's original work [25], and apply it to draw new consequences in average-case complexity and proof complexity. Specifically, we show the following: Demi-bit stretch: Super-bits and demi-bits are variants of cryptographic pseudorandom generators which are secure against nondeterministic statistical tests [25]. They were introduced to rule out certain approaches to proving strong complexity lower bounds beyond the limitations set out by the Natural Proofs barrier of Razborov and Rudich [23]. Whether demi-bits are stretchable at all had been an open problem since their introduction. We answer this question affirmatively by showing that: every demi-bit b : {0, 1}n → {0, 1}n+1 can be stretched into sublinear many demi-bits b′: {0, 1}n → {0, 1}n+nc , for every constant 0 < c < 1. Average-case hardness: Using work by Santhanam [26], we apply our results to obtain new averagecase Kolmogorov complexity results: we show that Kpoly[n-O(1)] is zero-error average-case hard against NP/poly machines iff Kpoly[n-o(n)] is, where for a function s(n) : N → N, Kpoly[s(n)] denotes the languages of all strings x ∈ {0, 1}n for which there are (fixed) polytime Turing machines of description-length at most s(n) that output x. Characterising super-bits by nondeterministic unpredictability: In the deterministic setting, Yao [31] proved that super-polynomial hardness of pseudorandom generators is equivalent to ("nextbit") unpredictability. Unpredictability roughly means that given any strict prefix of a random string, it is infeasible to predict the next bit. We initiate the study of unpredictability beyond the deterministic setting (in the cryptographic regime), and characterise the nondeterministic hardness of generators from an unpredictability perspective. Specifically, we propose four stronger notions of unpredictability: NP/poly-unpredictability, coNP/poly-unpredictability, ∩-unpredictability and ∪unpredictability, and show that super-polynomial nondeterministic hardness of generators lies between ∩-unpredictability and ∪unpredictability. Characterising super-bits by nondeterministic hard-core predicates: We introduce a nondeterministic variant of hard-core predicates, called super-core predicates. We show that the existence of a super-bit is equivalent to the existence of a super-core of some non-shrinking function. This serves as an analogue of the equivalence between the existence of a strong pseudorandom generator and the existence of a hard-core of some one-way function [8, 12], and provides a first alternative characterisation of super-bits. We also prove that a certain class of functions, which may have hard-cores, cannot possess any super-core

An ALMA study of the Orion Integral Filament : I. Evidence for narrow fibers in a massive cloud

© 2018 ESO. Reproduced with permission from Astronomy & Astrophysics. Content in the UH Research Archive is made available for personal research, educational, and non-commercial purposes only. Unless otherwise stated, all content is protected by copyright, and in the absence of an open license, permissions for further re-use should be sought from the publisher, the author, or other copyright holder.Aim. We have investigated the gas organization within the paradigmatic Integral Shape Filament (ISF) in Orion in order to decipher whether or not all filaments are bundles of fibers. Methods. We combined two new ALMA Cycle 3 mosaics with previous IRAM 30m observations to produce a high-dynamic range N 2H + (1-0) emission map of the ISF tracing its high-density material and velocity structure down to scales of 0.009 pc (or ~2000 AU). Results. From the analysis of the gas kinematics, we identify a total of 55 dense fibers in the central region of the ISF. Independently of their location in the cloud, these fibers are characterized by transonic internal motions, lengths of ~0.15 pc, and masses per unit length close to those expected in hydrostatic equilibrium. The ISF fibers are spatially organized forming a dense bundle with multiple hub-like associations likely shaped by the local gravitational potential. Within this complex network, the ISF fibers show a compact radial emission profile with a median FWHM of 0.035 pc systematically narrower than the previously proposed universal 0.1 pc filament width. Conclusions. Our ALMA observations reveal complex bundles of fibers in the ISF, suggesting strong similarities between the internal substructure of this massive filament and previously studied lower-mass objects. The fibers show identical dynamic properties in both low- and high-mass regions, and their widespread detection in nearby clouds suggests a preferred organizational mechanism of gas in which the physical fiber dimensions (width and length) are self-regulated depending on their intrinsic gas density. Combining these results with previous works in Musca, Taurus, and Perseus, we identify a systematic increase of the surface density of fibers as a function of the total mass per-unit-length in filamentary clouds. Based on this empirical correlation, we propose a unified star-formation scenario where the observed differences between low- and high-mass clouds, and the origin of clusters, emerge naturally from the initial concentration of fibers.Peer reviewedFinal Published versio

Three-Dimensional Light Bullets in Arrays of Waveguides

We report the first experimental observation of 3D-LBs, excited by femtosecond pulses in a system featuring quasi-instantaneous cubic nonlinearity and a periodic, transversally-modulated refractive index. Stringent evidence of the excitation of LBs is based on time-gated images and spectra which perfectly match our numerical simulations. Furthermore, we reveal a novel evolution mechanism forcing the LBs to follow varying dispersion/diffraction conditions, until they leave their existence range and decay.Comment: 4 pages, 5 figures - Published by the American Physical Societ