Distributed Function Computation over Fields and Rings via Linear Compression of Sources

The setting considered in this paper is one of distributed function computation. More specifically, there is a collection of N sources possessing correlated information and a destination that would like to acquire a specific linear combination of the N sources. We address both the case when the common alphabet of the sources is a finite field and the case when it is a finite, commutative principal ideal ring with identity. The goal is to minimize the total amount of information needed to be transmitted by the N sources while enabling reliable recovery at the destination of the linear combination sought. One means of achieving this goal is for each of the sources to compress all the information it possesses and transmit this to the receiver. The Slepian-Wolf theorem of information theory governs the minimum rate at which each source must transmit while enabling all data to be reliably recovered at the receiver. However, recovering all the data at the destination is often wasteful of resources since the destination is only interested in computing a specific linear combination. An alternative explored here is one in which each source is compressed using a common linear mapping and then transmitted to the destination which then proceeds to use linearity to directly recover the needed linear combination. The article is part review and presents in part, new results. The portion of the paper that deals with finite fields is previously known material, while that dealing with rings is mostly new.Attempting to find the best linear map that will enable function computation forces us to consider the linear compression of source. While in the finite field case, it is known that a source can be linearly compressed down to its entropy, it turns out that the same does not hold in the case of rings. An explanation for this curious interplay between algebra and information theory is also provided in this paper.

Monitoring Himalayan cryosphere using remote sensing techniques

In the Himalayas, large area is covered by glaciers, seasonal snow and changes in its extent can influence availability of water in the Himalayan Rivers. In this paper, changes in glacial extent, glacial mass balance and seasonal snow cover have been discussed. Field and satellite based investigations suggest, most of the Himalayan glaciers are retreating though the rate of retreat is varying from glacier to glacier, ranging from few meters to almost 50 meters per year, depending upon the numerous glacial, terrain and meteorological parameters. Retreat was estimated for 1868 glaciers in eleven basins distributed across the Indian Himalaya since 1962 to 2001/02. Estimates show an overall reduction in glacier area from 6332 to 5329 sq km, an overall deglaciation of 16 percent.Snow line at the end of ablation season on the Chhota Shigri glacier suggests a change in altitude from 4900 to 5200 m from late 1970’s to the present. Seasonal snow cover monitoring of the Himalaya has shown large amounts of snow cover depletion in early part of winter, i.e. from October to December. For many basins located in lower altitude and in south of Pir Panjal range, snow ablation was observed through out the winter season. In addition, average stream runoff of the Baspa basin during the month of December shows an increase by 75 per cent. This combination of glacial retreat, negative mass balance, early melting of seasonal snow cover and winter time increase in stream runoff suggest an influence of climate change on the Himalayan cryosphere.

An Efficient Distributed Scheme for Source Routing Protocol in Communication Networks

In this paper, we propose an efficient source routing algorithm for unicast flows, which addresses the scalability problem associated with the basic source routing technique. Simulation results indicate that the proposed algorithm indeed helps in reducing the message overhead considerably, and at the same time it gives comparable performance in terms of resource utilization across a wide range of workloads.

A Scalable Architecture for VoIP Conferencing

Real-Time services are traditionally supported on circuit switched network. However, there is a need to port these services on packet switched network. Architecture for audio conferencing application over the Internet in the light of ITU-T H.323 recommendations is considered. In a conference, considering packets only from a set of selected clients can reduce speech quality degradation because mixing packets from all clients can lead to lack of speech clarity. A distributed algorithm and architecture for selecting clients for mixing is suggested here based on a new quantifier of the voice activity called “Loudness Number” (LN). The proposed system distributes the computation load and reduces the load on client terminals. The highlights of this architecture are scalability, bandwidth saving and speech quality enhancement. Client selection for playing out tries to mimic a physical conference where the most vocal participants attract more attention. The contributions of the paper are expected to aid H.323 recommendations implementations for Multipoint Processors (MP). A working prototype based on the proposed architecture is already functional.

Monitoring of seasonal snow cover in Bhutan using remote sensing technique

All major rivers in Bhutan depend on snowmelt for discharge. Therefore, changes in snow cover due to climate change can influence distribution and availability of water. However, information about distribution of seasonal snow cover in Bhutan is not available. The MODIS snow product was used to study snow cover status and trends in Bhutan. Average snow cover area (SCA) of Bhutan estimated for the period 2002 to 2010 was 9030 sq. km, about 25.5% of the total land area. SCA trend of Bhutan for the period 2002-2010 was found to decrease (-3.27 +/- 1.28%). The average SCA for winter was 14,485 sq. km (37.7%), for spring 7411 sq. km (19.3%), for summer 4326 sq. km (11.2%), and for autumn 7788 sq. km (20.2%), mostly distributed in the elevation range 2500-6000 m amsl. Interannual and seasonal SCA trend both showed a decline, although it was not statistically significant for all sub-basins. Pho Chu sub-basin with 19.5% of the total average SCA had the highest average SCA. The rate of increase of SCA for every 100 m elevation was the highest (2.5%) in the Pa Chu sub-basin. The coefficient of variance of 1.27 indicates high variability of SCA in winter.

Distributed Storage Codes With Repair-by-Transfer and Nonachievability of Interior Points on the Storage-Bandwidth Tradeoff

Regenerating codes are a class of recently developed codes for distributed storage that, like Reed-Solomon codes, permit data recovery from any subset of k nodes within the n-node network. However, regenerating codes possess in addition, the ability to repair a failed node by connecting to an arbitrary subset of d nodes. It has been shown that for the case of functional repair, there is a tradeoff between the amount of data stored per node and the bandwidth required to repair a failed node. A special case of functional repair is exact repair where the replacement node is required to store data identical to that in the failed node. Exact repair is of interest as it greatly simplifies system implementation. The first result of this paper is an explicit, exact-repair code for the point on the storage-bandwidth tradeoff corresponding to the minimum possible repair bandwidth, for the case when d = n-1. This code has a particularly simple graphical description, and most interestingly has the ability to carry out exact repair without any need to perform arithmetic operations. We term this ability of the code to perform repair through mere transfer of data as repair by transfer. The second result of this paper shows that the interior points on the storage-bandwidth tradeoff cannot be achieved under exact repair, thus pointing to the existence of a separate tradeoff under exact repair. Specifically, we identify a set of scenarios which we term as ``helper node pooling,'' and show that it is the necessity to satisfy such scenarios that overconstrains the system.

An Opportunistic, Fast, and Distributed Subchannel and User-Pairing Algorithm for OFDMA

Channel-aware assignment of subchannels to users in the downlink of an OFDMA system requires extensive feedback of channel state information (CSI) to the base station. Since bandwidth is scarce, schemes that limit feedback are necessary. We develop a novel, low feedback, distributed splitting-based algorithm called SplitSelect to opportunistically assign each subchannel to its most suitable user. SplitSelect explicitly handles multiple access control aspects associated with CSI feedback, and scales well with the number of users. In it, according to a scheduling criterion, each user locally maintains a scheduling metric for each subchannel. The goal is to select, for each subchannel, the user with the highest scheduling metric. At any time, each user contends for the subchannel for which it has the largest scheduling metric among the unallocated subchannels. A tractable asymptotic analysis of a system with many users is central to SplitSelect's simple design. Extensive simulation results demonstrate the speed with which subchannels and users are paired. The net data throughput, when the time overhead of selection is accounted for, is shown to be substantially better than several schemes proposed in the literature. We also show how fairness and user prioritization can be ensured by suitably defining the scheduling metric.

Optimal placement of Distributed Generation for a projected load increase using Relative Electrical Distance approach

There is a lot of pressure on all the developed and second world countries to produce low emission power and distributed generation (DG) is found to be one of the most viable ways to achieve this. DG generally makes use of renewable energy sources like wind, micro turbines, photovoltaic, etc., which produce power with minimum green house gas emissions. While installing a DG it is important to define its size and optimal location enabling minimum network expansion and line losses. In this paper, a methodology to locate the optimal site for a DG installation, with the objective to minimize the net transmission losses, is presented. The methodology is based on the concept of relative electrical distance (RED) between the DG and the load points. This approach will help to identify the new DG location(s), without the necessity to conduct repeated power flows. To validate this methodology case studies are carried out on a 20 node, 66kV system, a part of Karnataka Transco and results are presented.

Interference Alignment in Regenerating Codes for Distributed Storage: Necessity and Code Constructions

Regenerating codes are a class of recently developed codes for distributed storage that, like Reed-Solomon codes, permit data recovery from any arbitrary of nodes. However regenerating codes possess in addition, the ability to repair a failed node by connecting to any arbitrary nodes and downloading an amount of data that is typically far less than the size of the data file. This amount of download is termed the repair bandwidth. Minimum storage regenerating (MSR) codes are a subclass of regenerating codes that require the least amount of network storage; every such code is a maximum distance separable (MDS) code. Further, when a replacement node stores data identical to that in the failed node, the repair is termed as exact. The four principal results of the paper are (a) the explicit construction of a class of MDS codes for d = n - 1 >= 2k - 1 termed the MISER code, that achieves the cut-set bound on the repair bandwidth for the exact repair of systematic nodes, (b) proof of the necessity of interference alignment in exact-repair MSR codes, (c) a proof showing the impossibility of constructing linear, exact-repair MSR codes for d < 2k - 3 in the absence of symbol extension, and (d) the construction, also explicit, of high-rate MSR codes for d = k+1. Interference alignment (IA) is a theme that runs throughout the paper: the MISER code is built on the principles of IA and IA is also a crucial component to the nonexistence proof for d < 2k - 3. To the best of our knowledge, the constructions presented in this paper are the first explicit constructions of regenerating codes that achieve the cut-set bound.

Phylogeny of the Asian Eutropis (Squamata: Scincidae) reveals an `into India' endemic Indian radiation

Recent generic rearrangement of the circumtropical distributed skink genus `Mabuya' has raised a lot of debate. According to this molecular phylogeny based rearrangement, the tropical Asian members of this genus have been assigned to Eutropis. However, in these studies the Asian members of `Mabuya' were largely sampled from Southeast (SE) Asia with very few species from Indian subcontinent. To test the validity of this assignment and to determine the evolutionary origin of Indian members of this group we sequenced one nuclear and two mitochondrial genes from most of the species from the Indian subregion. The nuclear and mitochondrial trees generated from these sequences confirmed the monophyly of the tropical Asian Eutropis. Furthermore, in the tree based on the combined mitochondrial and nuclear dataset an endemic Indian radiation was revealed that was nested within a larger Asian clade. Results of dispersal-vicariance analysis and molecular dating suggested an initial dispersal of Eutropis from SE Asia into India around 5.5-17 million years ago, giving rise to the extant members of the endemic Indian radiation. This initial dispersal was followed by two back dispersals from India into SE Asia. We also discuss the relationships within the endemic Indian radiation and its taxonomic implications. (c) 2012 Elsevier Inc. All rights reserved.

The effect of potential on electrodeposited CdSe thin films

Cadmium selenide (CdSe) thin films have been successfully prepared by the electrodeposition technique on indium doped tin oxide (ITO) substrates with aqueous solutions of cadmium sulphate and selenium dioxide. The deposited films were characterized with X-ray diffraction (XRD), scanning electron microscope (SEM), energy dispersive analysis by X-rays (EDAX), photoluminescence (PL), UV spectrometry and electrical resistivity measurements. XRD analysis shows that the films are polycrystalline in nature with hexagonal crystalline structure. The various parameters such as crystallite size, micro strain, dislocation density and texture coefficients were evaluated. SEM study shows that the total substrate surface is well covered with uniformly distributed spherical shaped grains. Photoluminescence spectra of films were recorded to understand the emission properties of the films. The presence of direct transition with band gap energy 1.75 eV is established from optical studies. The electrical resistivity of the thin films is found to be 10(6) Omega cm and the results are discussed. (c) 2011 Elsevier Ltd. All rights reserved.

Electrical breakdown of carbon nanotube devices and the predictability of breakdown position

We have investigated electrical transport properties of long (>10 mu m) multiwalled carbon nanotubes (NTs) by dividing individuals into several segments of identical length. Each segment has different resistance because of the random distribution of defect density in an NT and is corroborated by Raman studies. Higher is the resistance, lower is the current required to break the segments indicating that breakdown occurs at the highly resistive segment/site and not necessarily at the middle. This is consistent with the one-dimensional thermal transport model. We have demonstrated the healing of defects by annealing at moderate temperatures or by current annealing. To strengthen our mechanism, we have carried out electrical breakdown of nitrogen doped NTs (NNTs) with diameter variation from one end to the other. It reveals that the electrical breakdown occurs selectively at the narrower diameter region. Overall, we believe that our results will help to predict the breakdown position of both semiconducting and metallic NTs. Copyright 2012 Author(s). This article is distributed under a Creative Commons Attribution 3.0 Unported License. http://dx.doi.org/10.1063/1.4720426]

Electrical characteristics of multiwalled carbon nanotube arrays and influence of pressure

We have investigated the current-voltage characteristics of carbon nanotube arrays and shown that the current through the arrays increases rapidly with applied voltage before the breakdown occurs. Simultaneous measurements of current and temperature at one end of the arrays suggest that the rapid increase of current is due to Joule heating. The current through the array and the threshold voltage are found to increase with decreasing pressure. Copyright 2012 Author(s). This article is distributed under a Creative Commons Attribution 3.0 Unported License. http://dx.doi.org/10.1063/1.3702777]

INST: An Integrated Steering Framework for Critical Weather Applications

Online remote visualization and steering of critical weather applications like cyclone tracking are essential for effective and timely analysis by geographically distributed climate science community. A steering framework for controlling the high-performance simulations of critical weather events needs to take into account both the steering inputs of the scientists and the criticality needs of the application including minimum progress rate of simulations and continuous visualization of significant events. In this work, we have developed an integrated user-driven and automated steering framework INST for simulations, online remote visualization, and analysis for critical weather applications. INST provides the user control over various application parameters including region of interest, resolution of simulation, and frequency of data for visualization. Unlike existing efforts, our framework considers both the steering inputs and the criticality of the application, namely, the minimum progress rate needed for the application, and various resource constraints including storage space and network bandwidth to decide the best possible parameter values for simulations and visualization.