Optimality of Orthogonal Access for One-dimensional Convex Cellular Networks

It is shown that a greedy orthogonal access scheme achieves the sum degrees of freedom of all one-dimensional (all nodes placed along a straight line) convex cellular networks (where cells are convex regions) when no channel knowledge is available at the transmitters except the knowledge of the network topology. In general, optimality of orthogonal access holds neither for two-dimensional convex cellular networks nor for one-dimensional non-convex cellular networks, thus revealing a fundamental limitation that exists only when both one-dimensional and convex properties are simultaneously enforced, as is common in canonical information theoretic models for studying cellular networks. The result also establishes the capacity of the corresponding class of index coding problems

The effect of gag reflex on cardiac sympatovagal tone

Objectives: Heart velocity may be influenced by gagging. The medulla oblongata receives the afferents of gag reflex. Neuronal pools of vomiting, salivation and cardiac parasympathetic fibers are very close in this area. So, their activities may be changed by spillover from each other. Using the heart rate variability (HRV) analysis, the effect of gagging on cardiac sympatovagal balance was studied. Methods: ECG was recorded from 9 healthy nonsmoker volunteer students for 10 minutes in the sitting position between 10 and 11 AM. Gagging was elicited by tactile stimulation of the posterior pharyngeal wall. At 1 kHz sampling rate, HRV was calculated. The mean of heart rate at low and high frequencies (LF: 0.04-0.15; HF: 0.15-0.4 Hz) were compared before and after the stimulus. Results: The mean of average heart rate, LF and HF in normalized units (nu) and the ratio of them (LF/HF) before and after the gagging were 89.9 ± 3 and 95.2 ± 3 bpm; 44.2 ± 5.8 and 21.2 ± 4; 31.1 ± 5.3 and 39.4 ± 3.8; and 1.7 ± 0.3 and 0.6 ± 0.2 respectively. Conclusion: Gagging increased heart velocity and had differential effect on two branches of cardiac autonomic nerves. The paradoxical relation between average heart rate and HRV indexes of sympatovagal tone may be due to unequal rate of change in autonomic fiber activities which is masked by 5 minutes interval averaging. © OMSB, 2012

Retrospective Interference Alignment

We explore similarities and differences in recent works on blind interference alignment under different models such as staggered block fading model and the delayed CSIT model. In particular we explore the possibility of achieving interference alignment with delayed CSIT when the transmitters are distributed. Our main contribution is an interference alignment scheme, called retrospective interference alignment in this work, that is specialized to settings with distributed transmitters. With this scheme we show that the 2 user X channel with only delayed channel state information at the transmitters can achieve 8/7 DoF, while the interference channel with 3 users is able to achieve 9/8 DoF. We also consider another setting where delayed channel output feedback is available to transmitters. In this setting the X channel and the 3 user interference channel are shown to achieve 4/3 and 6/5 DoF, respectively

Passively mode locked Raman laser

We report on the observation of a novel mode locked optical comb generated at the Raman offset (Raman comb) in an optically pumped crystalline whispering gallery mode resonator. Mode locking is confirmed via measurement of the radio-frequency beat note produced by the optical comb on a fast photodiode. Neither the conventional Kerr comb nor hyper-parametric oscillation is observed when the Raman comb is present

Distributed Data Storage with Minimum Storage Regenerating Codes - Exact and Functional Repair are Asymptotically Equally Efficient

We consider a set up where a file of size M is stored in n distributed storage nodes, using an (n,k) minimum storage regenerating (MSR) code, i.e., a maximum distance separable (MDS) code that also allows efficient exact-repair of any failed node. The problem of interest in this paper is to minimize the repair bandwidth B for exact regeneration of a single failed node, i.e., the minimum data to be downloaded by a new node to replace the failed node by its exact replica. Previous work has shown that a bandwidth of B=[M(n-1)]/[k(n-k)] is necessary and sufficient for functional (not exact) regeneration. It has also been shown that if k < = max(n/2, 3), then there is no extra cost of exact regeneration over functional regeneration. The practically relevant setting of low-redundancy, i.e., k/n>1/2 remains open for k>3 and it has been shown that there is an extra bandwidth cost for exact repair over functional repair in this case. In this work, we adopt into the distributed storage context an asymptotically optimal interference alignment scheme previously proposed by Cadambe and Jafar for large wireless interference networks. With this scheme we solve the problem of repair bandwidth minimization for (n,k) exact-MSR codes for all (n,k) values including the previously open case of k > \max(n/2,3). Our main result is that, for any (n,k), and sufficiently large file sizes, there is no extra cost of exact regeneration over functional regeneration in terms of the repair bandwidth per bit of regenerated data. More precisely, we show that in the limit as M approaches infinity, the ratio B/M = (n-1)/(k(n-k))$