Regenerating codes for errors and erasures in distributed storage

Regenerating codes are a class of codes proposed for providing reliability of data and efficient repair of failed nodes in distributed storage systems. In this paper, we address the fundamental problem of handling errors and erasures at the nodes or links, during the data-reconstruction and node-repair operations. We provide explicit regenerating codes that are resilient to errors and erasures, and show that these codes are optimal with respect to storage and bandwidth requirements. As a special case, we also establish the capacity of a class of distributed storage systems in the presence of malicious adversaries. While our code constructions are based on previously constructed Product-Matrix codes, we also provide necessary and sufficient conditions for introducing resilience in any regenerating code.

Using intra-flock association patterns to understand why birds participate in mixed-species foraging flocks in terrestrial habitats

Bird species are hypothesized to join mixed-species flocks (flocks hereon) either for direct foraging or anti-predation-related benefits. In this study, conducted in a tropical evergreen forest in the Western Ghats of India, we used intra-flock association patterns to generate a community-wide assessment of flocking benefits for different species. We assumed that individuals needed to be physically proximate to particular heterospecific individuals within flocks to obtain any direct foraging benefit (flushed prey, kleptoparasitism, copying foraging locations). Alternatively, for anti-predation benefits, physical proximity to particular heterospecifics is not required, i.e. just being in the flock vicinity can suffice. Therefore, we used choice of locations within flocks to infer whether individual species are obtaining direct foraging or anti-predation benefits. A small subset of the bird community (5/29 species), composed of all members of the sallying guild, showed non-random physical proximity to heterospecifics within flocks. All preferred associates were from non-sallying guilds, suggesting that the sallying species were likely obtaining direct foraging benefits either in the form of flushed or kleptoparasitized prey. The majority of the species (24/29) chose locations randomly with respect to heterospecifics within flocks and, thus, were likely obtaining antipredation benefits. In summary, our study indicates that direct foraging benefits are important for only a small proportion of species in flocks and that predation is likely to be the main driver of flocking for most participants. Our findings apart, our study provides methodological advances that might be useful in understanding asymmetric interactions in social groups of single and multiple species.

High resolution light-sheet based high-throughput imaging cytometry system enables visualization of intra-cellular organelles

Visualization of intracellular organelles is achieved using a newly developed high throughput imaging cytometry system. This system interrogates the microfluidic channel using a sheet of light rather than the existing point-based scanning techniques. The advantages of the developed system are many, including, single-shot scanning of specimens flowing through the microfluidic channel at flow rate ranging from micro-to nano- lit./min. Moreover, this opens-up in-vivo imaging of sub-cellular structures and simultaneous cell counting in an imaging cytometry system. We recorded a maximum count of 2400 cells/min at a flow-rate of 700 nl/min, and simultaneous visualization of fluorescently-labeled mitochondrial network in HeLa cells during flow. The developed imaging cytometry system may find immediate application in biotechnology, fluorescence microscopy and nano-medicine. (C) 2014 Author(s). All article content, except where otherwise noted, is licensed under a Creative Commons Attribution 3.0 Unported License.

Hydrogen bonding, halogen bonding and lithium bonding: an atoms in molecules and natural bond orbital perspective towards conservation of total bond order, inter- and intra-molecular bonding

One hundred complexes have been investigated exhibiting D-X center dot center dot center dot A interactions, where X = H, Cl or Li and DX is the `X bond' donor and A is the acceptor. The optimized structures of all these complexes have been used to propose a generalized `Legon-Millen rule' for the angular geometry in all these interactions. A detailed Atoms in Molecules (AIM) theoretical analysis confirms an important conclusion, known in the literature: there is a strong correlation between the electron density at the X center dot center dot center dot A bond critical point (BCP) and the interaction energy for all these interactions. In addition, we show that extrapolation of the fitted line leads to the ionic bond for Li-bonding (electrostatic) while for hydrogen and chlorine bonding, it leads to the covalent bond. Further, we observe a strong correlation between the change in electron density at the D-X BCP and that at the X center dot center dot center dot A BCP, suggesting conservation of the bond order. The correlation found between penetration and electron density at BCP can be very useful for crystal structure analysis, which relies on arbitrary van der Waals radii for estimating penetration. Various criteria proposed for shared-and closed-shell interactions based on electron density topology have been tested for H/Cl/Li bonded complexes. Finally, using the natural bond orbital (NBO) analysis it is shown that the D-X bond weakens upon X bond formation, whether it is ionic (DLi) or covalent (DH/DCl) and the respective indices such as ionicity or covalent bond order decrease. Clearly, one can think of conservation of bond order that includes ionic and covalent contributions to both D-X and X center dot center dot center dot A bonds, for not only X = H/Cl/Li investigated here but also any atom involved in intermolecular bonding.

Optimal Binary Power Control for Underlay CR With Different Interference Constraints and Impact of Channel Estimation Errors

Adapting the power of secondary users (SUs) while adhering to constraints on the interference caused to primary receivers (PRxs) is a critical issue in underlay cognitive radio (CR). This adaptation is driven by the interference and transmit power constraints imposed on the secondary transmitter (STx). Its performance also depends on the quality of channel state information (CSI) available at the STx of the links from the STx to the secondary receiver and to the PRxs. For a system in which an STx is subject to an average interference constraint or an interference outage probability constraint at each of the PRxs, we derive novel symbol error probability (SEP)-optimal, practically motivated binary transmit power control policies. As a reference, we also present the corresponding SEP-optimal continuous transmit power control policies for one PRx. We then analyze the robustness of the optimal policies when the STx knows noisy channel estimates of the links between the SU and the PRxs. Altogether, our work develops a holistic understanding of the critical role played by different transmit and interference constraints in driving power control in underlay CR and the impact of CSI on its performance.

NESTED SPARSE BAYESIAN LEARNING FOR BLOCK-SPARSE SIGNALS WITH INTRA-BLOCK CORRELATION

In this work, we address the recovery of block sparse vectors with intra-block correlation, i.e., the recovery of vectors in which the correlated nonzero entries are constrained to lie in a few clusters, from noisy underdetermined linear measurements. Among Bayesian sparse recovery techniques, the cluster Sparse Bayesian Learning (SBL) is an efficient tool for block-sparse vector recovery, with intra-block correlation. However, this technique uses a heuristic method to estimate the intra-block correlation. In this paper, we propose the Nested SBL (NSBL) algorithm, which we derive using a novel Bayesian formulation that facilitates the use of the monotonically convergent nested Expectation Maximization (EM) and a Kalman filtering based learning framework. Unlike the cluster-SBL algorithm, this formulation leads to closed-form EMupdates for estimating the correlation coefficient. We demonstrate the efficacy of the proposed NSBL algorithm using Monte Carlo simulations.

Dynamics of the chemical bond: inter- and intra-molecular hydrogen bond

In this discussion, we show that a static definition of a `bond' is not viable by looking at a few examples for both inter-and intra-molecular hydrogen bonding. This follows from our earlier work (Goswami and Arunan, Phys. Chem. Chem. Phys. 2009, 11, 8974) which showed a practical way to differentiate `hydrogen bonding' from `van der Waals interaction'. We report results from ab initio and atoms in molecules theoretical calculations for a series of Rg center dot center dot center dot HX complexes (Rg = He/Ne/Ar and X = F/Cl/Br) and ethane-1,2-diol. Results for the Rg center dot center dot center dot HX/DX complexes show that Rg center dot center dot center dot DX could have a `deuterium bond' even when Rg center dot center dot center dot HX is not `hydrogen bonded', according to the practical criterion given by Goswami and Arunan. Results for ethane-1,2-diol show that an `intra-molecular hydrogen bond' can appear during a normal mode vibration which is dominated by the O center dot center dot center dot O stretching, though a `bond' is not found in the equilibrium structure. This dynamical `bond' formation may nevertheless be important in ensuring the continuity of electron density across a molecule. In the former case, a vibration `breaks' an existing bond and in the later case, a vibration leads to `bond' formation. In both cases, the molecule/complex stays bound irrespective of what happens to this `hydrogen bond'. Both these cases push the borders on the recent IUPAC recommendation on hydrogen bonding (Arunan et al. Pure. Appl. Chem. 2011, 83 1637) and justify the inclusive nature of the definition.

Micro-satellite angular rate estimation using second-order sliding mode observer

Development of computationally efficient and accurate attitude rate estimation algorithm using low-cost commercially available star sensor arrays and processing unit for micro-satellite mission is presented. Our design reduces the computational load of least square (LS)-based rate estimation method while maintaining the same accuracy compared to other rate estimation approaches. Furthermore, rate estimation accuracy is improved by using recently developed fast and accurate second-order sliding mode observer (SOSMO) scheme. It also gives robust estimation in the presence of modeling uncertainties, unknown disturbances, and measurement noise. Simulation study shows that rate estimation accuracy achieved by our LS-based method is comparable with other methods for a typical commercially available star sensor array. The robustness analysis of SOSMO with respect to measurement noise is also presented in this paper. Simulation test bench for a practical scenario of satellite rate estimation uses moment-of-inertia variation and environmental disturbances affecting a typical micro-satellite at 500km circular orbit. Comparison studies of SOSMO with 1-SMO and pseudo-linear Kalman filter show that satisfactory estimation accuracy is achieved by SOSMO.

The role of intra- and inter-site exchange correlations in the extended Falicov-Kimball model on a triangular lattice

Ground state magnetic properties of the spin-dependent Falicov-Kimball model (FKM) are studied by incorporating the intrasite exchange correlation J (between itinerant d- and localized f-electrons) and intersite (superexchange) correlation J (between localized f-electrons) on a triangular lattice for two different fillings. Numerical diagonalization and Monte-Carlo techniques are used to determine the ground state magnetic properties. Transitions from antiferromagnetic to ferromagnetic and again to re-entrant antiferromagnetic phase is observed in a wide range of parameter space. The magnetic moments of d- and f-electrons are observed to depend strongly on the value off, J and also on the total number of d-electrons (N-d). (C) 2015 Elsevier Ltd. All rights reserved.

Impact Time Guidance for Large Heading Errors Using Sliding Mode Control

In this paper, sliding mode control-based impact time guidance laws are proposed. Even for large heading angle errors and negative initial closing speeds, the desired impact time is achieved by enforcing a sliding mode on a switching surface designed by using the concepts of collision course and estimated time-to-go. Unlike existing guidance laws, the proposed guidance strategy achieves impact time successfully even when the estimated interception time is greater than the desired impact time. Simulation results are also presented.

SMO: An Integrated Approach to Intra-array and Inter-array Storage Optimization

The polyhedral model provides an expressive intermediate representation that is convenient for the analysis and subsequent transformation of affine loop nests. Several heuristics exist for achieving complex program transformations in this model. However, there is also considerable scope to utilize this model to tackle the problem of automatic memory footprint optimization. In this paper, we present a new automatic storage optimization technique which can be used to achieve both intra-array as well as inter-array storage reuse with a pre-determined schedule for the computation. Our approach works by finding statement-wise storage partitioning hyper planes that partition a unified global array space so that values with overlapping live ranges are not mapped to the same partition. Our heuristic is driven by a fourfold objective function which not only minimizes the dimensionality and storage requirements of arrays required for each high-level statement, but also maximizes inter statement storage reuse. The storage mappings obtained using our heuristic can be asymptotically better than those obtained by any existing technique. We implement our technique and demonstrate its practical impact by evaluating its effectiveness on several benchmarks chosen from the domains of image processing, stencil computations, and high-performance computing.