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.

Stability numbers for an unsupported vertical circular excavation in c-phi soil

By using an axisymmetric lower bound finite element limit analysis formulation, the stability numbers (gamma H/C) for an unsupported vertical circular excavation in a cohesive-frictional soil have been generated. The numerical results are obtained for values of normalized excavation height (H/b) and friction angle (phi) greater than those considered previously in the literature. The results compare well with those available in literature. The stability numbers presented in this note would be beneficial from a design point of view. (C) 2011 Elsevier Ltd. All rights reserved.

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.

Gap model of one-way cyclic lateral load on vertical files in soft clay

For the analysis and design of pile foundation used for coastal structures the prediction of cyclic response, which is influenced by the nonlinear behavior, gap (pile soil separation) and degradation (reduction in strength) of soil becomes necessary. To study the effect of the above parameters a nonlinear cyclic load analysis program using finite element method is developed, incorporating the proposed gap and degradation model and adopting an incremental-iterative procedure. The pile is idealized using beam elements and the soil by number of elastoplastic sub-element springs at each node. The effect of gap and degradation on the load-deflection behavior. elasto-plastic sub-element and resistance of the soil at ground-line have been clearly depicted in this paper.

Solution of a class of surface water wave scattering problems involving non-reflecting vertical barriers

A large class of scattering problems of surface water waves by vertical barriers lead to mixed boundary value problems for Laplace equation. Specific attentions are paid, in the present article, to highlight an analytical method to handle this class of problems of surface water wave scattering, when the barriers in question are non-reflecting in nature. A new set of boundary conditions is proposed for such non-reflecting barriers and tile resulting boundary value problems are handled in the linearized theory of water waves. Three basic poblems of scattering by vertical barriers are solved. The present new theory of non-reflecting vertical barriers predict new transmission coefficients and tile solutions of tile mathematical problems turn out to be extremely simple and straight forward as compared to the solution for other types of barriers handled previously.

Tensile force distribution along the reinforcement for reinforced soil foundations

In a reinforced soil bed system reinforcement layer is usually placed with or without end anchorage. Since soil is weak in tension reinforcement develop tension under the applied load or the displacement of the footing. This tensile force is distributed along the length of the reinforcement subjected to the end condition. The reinforccement tension helps in distributing the load over a wider area, and becomes more effective at large induced settlements. As a result, vertical componenent of tensile force generated becomes effective in reducing applied load. However, very few studies to quantify the tensile force along the reinforcement have been reported in the literature. In this paper an attempt has been made to obtain the true nature of tensile force distribution along the reinforcement. For a reinforced soil bed below a strip footing this paper brings out induced tensile force distribution along the reinforcement at different load levels and for different types of reinforcements.

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.

Vertical uplift capacity of a group of two coaxial anchors in a general c-phi soil

The vertical uplift resistance of a group of two horizontal coaxial strip anchors, embedded in a general c-phi soil (where c is the unit cohesion and phi is the soil friction angle), has been determined by using the lower bound finite element limit analysis. The variation of uplift factors F-c and F-gamma, due to the components of soil cohesion and unit weight, respectively, with changes in depth (H)/width (B) has been established for different values of vertical spacing (S)/B. As compared to a single isolated anchor, the group of two anchors provides a significantly greater magnitude of F-c for phi <= 20 degrees and with H/B >= 3. The magnitude of F-c becomes almost maximum when S/B is kept closer to 0.5H/B. On the other hand, with the same H/B, as compared to a single anchor, hardly any increase in F-gamma occurs for a group of two anchors.

Enhanced Performance of Discharge Plasma in Raw Engine Exhaust Treatment-Operation under Different Temperatures and Loads

This paper reports improved performance of discharge plasma in raw engine exhaust treatment. For the purpose of investigation, both filtered and raw diesel engine exhaust were separately treated by the discharge plasma. In raw exhaust environment, the discharge plasma exhibits a superior performance with regard to NOx removal, energy consumption and formation of by-products. In this study, experiments were conducted at conditions of different temperatures and loads.

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.

Voltage stability : some reflections on Q-V characteristics of loads

Considering voltage stability as a static viability problem, this paper takes a particular concern of Q-V characteristics and reflects on certain notions that do not seem to have been explicitly mentioned or derived in the existing documented literature. The equations of Q-V characteristics are rederived in exactness, some salient points on the curve are discovered and analysed. The results of the analysis are illustrated through a case study

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.

Does acoustic adaptation drive vertical stratification? A test in a tropical cricket assemblage

In species-rich assemblages, differential utilization of vertical space can be driven by resource availability. For animals that communicate acoustically over long distances under habitat-induced constraints, access to an effective transmission channel is a valuable resource. The acoustic adaptation hypothesis suggests that habitat acoustics imposes a selective pressure that drives the evolution of both signal structure and choice of calling sites by signalers. This predicts that species-specific signals transmit best in native habitats. In this study, we have tested the hypothesis that vertical stratification of calling heights of acoustically communicating species is driven by acoustic adaptation. This was tested in an assemblage of 12 coexisting species of crickets and katydids in a tropical wet evergreen forest. We carried out transmission experiments using natural calls at different heights from the forest floor to the canopy. We measured signal degradation using 3 different measures: total attenuation, signal-to-noise ratio (SNR), and envelope distortion. Different sets of species supported the hypothesis depending on which attribute of signal degradation was examined. The hypothesis was upheld by 5 species for attenuation and by 3 species each for SNR and envelope distortion. Only 1 species of 12 provided support for the hypothesis by all 3 measures of signal degradation. The results thus provided no overall support for acoustic adaptation as a driver of vertical stratification of coexisting cricket and katydid species.