Ambient particulate air pollution (PM2.5) is associated with the ratio of type 2 diabetes to obesity

JRS was supported by the 1000 talents program and a Wolfson merit award from the Royal Sociey. MM was supported by a TWAS studentship of the Chinese Academy of Sciences.Peer reviewedPublisher PD

Capacity of Cellular Networks with Femtocache

The capacity of next generation of cellular networks using femtocaches is studied when multihop communications and decentralized cache placement are considered. We show that the storage capability of future network User Terminals (UT) can be effectively used to increase the capacity in random decentralized uncoded caching. We further propose a random decentralized coded caching scheme which achieves higher capacity results than the random decentralized uncoded caching. The result shows that coded caching which is suitable for systems with limited storage capabilities can improve the capacity of cellular networks by a factor of log(n) where n is the number of nodes served by the femtocache.Comment: 6 pages, 2 figures, presented at Infocom Workshops on 5G and beyond, San Francisco, CA, April 201

Quasi-Normal Modes of Extremal BTZ Black Holes in TMG

We study the spectrum of tensor perturbations on extremal BTZ black holes in topologically massive gravity for arbitrary values of the coefficient of the Chern-Simons term, $\mu$. Imposing proper boundary conditions at the boundary of the space and at the horizon, we find that the spectrum contains quasi-normal modes.Comment: 18 pages, Latex, Ref's added, Typos correcte

Cayley's hyperdeterminant: a combinatorial approach via representation theory

Cayley's hyperdeterminant is a homogeneous polynomial of degree 4 in the 8 entries of a 2 x 2 x 2 array. It is the simplest (nonconstant) polynomial which is invariant under changes of basis in three directions. We use elementary facts about representations of the 3-dimensional simple Lie algebra sl_2(C) to reduce the problem of finding the invariant polynomials for a 2 x 2 x 2 array to a combinatorial problem on the enumeration of 2 x 2 x 2 arrays with non-negative integer entries. We then apply results from linear algebra to obtain a new proof that Cayley's hyperdeterminant generates all the invariants. In the last section we show how this approach can be applied to general multidimensional arrays.Comment: 20 page

Broadcasting in Noisy Radio Networks

The widely-studied radio network model [Chlamtac and Kutten, 1985] is a graph-based description that captures the inherent impact of collisions in wireless communication. In this model, the strong assumption is made that node $v$ receives a message from a neighbor if and only if exactly one of its neighbors broadcasts. We relax this assumption by introducing a new noisy radio network model in which random faults occur at senders or receivers. Specifically, for a constant noise parameter $p \in [0,1)$, either every sender has probability $p$ of transmitting noise or every receiver of a single transmission in its neighborhood has probability $p$ of receiving noise. We first study single-message broadcast algorithms in noisy radio networks and show that the Decay algorithm [Bar-Yehuda et al., 1992] remains robust in the noisy model while the diameter-linear algorithm of Gasieniec et al., 2007 does not. We give a modified version of the algorithm of Gasieniec et al., 2007 that is robust to sender and receiver faults, and extend both this modified algorithm and the Decay algorithm to robust multi-message broadcast algorithms. We next investigate the extent to which (network) coding improves throughput in noisy radio networks. We address the previously perplexing result of Alon et al. 2014 that worst case coding throughput is no better than worst case routing throughput up to constants: we show that the worst case throughput performance of coding is, in fact, superior to that of routing -- by a $\Theta(\log(n))$ gap -- provided receiver faults are introduced. However, we show that any coding or routing scheme for the noiseless setting can be transformed to be robust to sender faults with only a constant throughput overhead. These transformations imply that the results of Alon et al., 2014 carry over to noisy radio networks with sender faults.Comment: Principles of Distributed Computing 201

Directional solidification of Pb-Sn eutectic with vibration

Pb-Sn eutectic alloy was directionally solidified at 1.4 to 3.2 cm/hr with forced convection induced by axial vibration of the growth ampoule with a frequency of 10 to 40 Hz and an amplitude of 0.5 to 1.0 mm. To determine the exact growth rate, an interface demarcation technique was applied. The lamellar spacing was increased 10 to 40 percent in ingots solidified with vibration compared to those solidified without vibration. The average intensity of convection in the melt under axial vibration of the ampoule was estimated by comparing the experimental results with a theoretical model

Directional solidification of Pb-Sn eutectics with vibration

Pb-Sn eutectic alloy was directionally solidified at 1.4 to 3.2 cm/hr with forced convection induced by axial vibration of the growth ampoule with a frequency of 10 to 40 Hz and an amplitude of 0.5 to 1.0 mm. To determine the exact growth rate, an interface demarcation technique was applied. The lamellar spacing was increased 10 to 40 percent in ingots solidified with vibration compared to those solidified without vibration. The number of grain boundaries was increased by vibration. The average intensity of convection in the melt under axial vibration of the ampoule was estimated by comparing the experimental results with a theoretical model