Novel algorithms for distributed sequential hypothesis testing

This paper considers sequential hypothesis testing in a decentralized framework. We start with two simple decentralized sequential hypothesis testing algorithms. One of which is later proved to be asymptotically Bayes optimal. We also consider composite versions of decentralized sequential hypothesis testing. A novel nonparametric version for decentralized sequential hypothesis testing using universal source coding theory is developed. Finally we design a simple decentralized multihypothesis sequential detection algorithm.

A nested linear codes approach to distributed function computation over subspaces

In this paper, we consider a distributed function computation setting, where there are m distributed but correlated sources X1,...,Xm and a receiver interested in computing an s-dimensional subspace generated by [X1,...,Xm]Γ for some (m × s) matrix Γ of rank s. We construct a scheme based on nested linear codes and characterize the achievable rates obtained using the scheme. The proposed nested-linear-code approach performs at least as well as the Slepian-Wolf scheme in terms of sum-rate performance for all subspaces and source distributions. In addition, for a large class of distributions and subspaces, the scheme improves upon the Slepian-Wolf approach. The nested-linear-code scheme may be viewed as uniting under a common framework, both the Korner-Marton approach of using a common linear encoder as well as the Slepian-Wolf approach of employing different encoders at each source. Along the way, we prove an interesting and fundamental structural result on the nature of subspaces of an m-dimensional vector space V with respect to a normalized measure of entropy. Here, each element in V corresponds to a distinct linear combination of a set {Xi}im=1 of m random variables whose joint probability distribution function is given.

Enabling node repair in any erasure code for distributed storage

Erasure codes are an efficient means of storing data across a network in comparison to data replication, as they tend to reduce the amount of data stored in the network and offer increased resilience in the presence of node failures. The codes perform poorly though, when repair of a failed node is called for, as they typically require the entire file to be downloaded to repair a failed node. A new class of erasure codes, termed as regenerating codes were recently introduced, that do much better in this respect. However, given the variety of efficient erasure codes available in the literature, there is considerable interest in the construction of coding schemes that would enable traditional erasure codes to be used, while retaining the feature that only a fraction of the data need be downloaded for node repair. In this paper, we present a simple, yet powerful, framework that does precisely this. Under this framework, the nodes are partitioned into two types and encoded using two codes in a manner that reduces the problem of node-repair to that of erasure-decoding of the constituent codes. Depending upon the choice of the two codes, the framework can be used to avail one or more of the following advantages: simultaneous minimization of storage space and repair-bandwidth, low complexity of operation, fewer disk reads at helper nodes during repair, and error detection and correction.

Distributed STBCs with full-diversity partial interference cancellation decoding

Recently, Guo and Xia introduced low complexity decoders called Partial Interference Cancellation (PIC) and PIC with Successive Interference Cancellation (PIC-SIC), which include the Zero Forcing (ZF) and ZF-SIC receivers as special cases, for point-to-point MIMO channels. In this paper, we show that PIC and PIC-SIC decoders are capable of achieving the full cooperative diversity available in wireless relay networks. We give sufficient conditions for a Distributed Space-Time Block Code (DSTBC) to achieve full diversity with PIC and PIC-SIC decoders and construct a new class of DSTBCs with low complexity full-diversity PIC-SIC decoding using complex orthogonal designs. The new class of codes includes a number of known full-diversity PIC/PIC-SIC decodable Space-Time Block Codes (STBCs) constructed for point-to-point channels as special cases. The proposed DSTBCs achieve higher rates (in complex symbols per channel use) than the multigroup ML decodable DSTBCs available in the literature. Simulation results show that the proposed codes have better bit error rate performance than the best known low complexity, full-diversity DSTBCs.

Enabling node repair in any erasure code for distributed storage

Erasure codes are an efficient means of storing data across a network in comparison to data replication, as they tend to reduce the amount of data stored in the network and offer increased resilience in the presence of node failures. The codes perform poorly though, when repair of a failed node is called for, as they typically require the entire file to be downloaded to repair a failed node. A new class of erasure codes, termed as regenerating codes were recently introduced, that do much better in this respect. However, given the variety of efficient erasure codes available in the literature, there is considerable interest in the construction of coding schemes that would enable traditional erasure codes to be used, while retaining the feature that only a fraction of the data need be downloaded for node repair. In this paper, we present a simple, yet powerful, framework that does precisely this. Under this framework, the nodes are partitioned into two types and encoded using two codes in a manner that reduces the problem of node-repair to that of erasure-decoding of the constituent codes. Depending upon the choice of the two codes, the framework can be used to avail one or more of the following advantages: simultaneous minimization of storage space and repair-bandwidth, low complexity of operation, fewer disk reads at helper nodes during repair, and error detection and correction.

Cooperative distributed sequential spectrum sensing

We consider cooperative spectrum sensing for cognitive radios. We develop an energy efficient detector with low detection delay using sequential hypothesis testing. Sequential Probability Ratio Test (SPRT) is used at both the local nodes and the fusion center. We also analyse the performance of this algorithm and compare with the simulations. Modelling uncertainties in the distribution parameters are considered. Slow fading with and without perfect channel state information at the cognitive radios is taken into account.

A novel algorithm for cooperative distributed sequential spectrum sensing in Cognitive Radio

This paper considers cooperative spectrum sensing in Cognitive Radios. In our previous work we have developed DualSPRT, a distributed algorithm for cooperative spectrum sensing using Sequential Probability Ratio Test (SPRT) at the Cognitive Radios as well as at the fusion center. This algorithm works well, but is not optimal. In this paper we propose an improved algorithm- SPRT-CSPRT, which is motivated from Cumulative Sum Procedures (CUSUM). We analyse it theoretically. We also modify this algorithm to handle uncertainties in SNR's and fading.

Cooperative distributed sequential spectrum sensing

We consider cooperative spectrum sensing for cognitive radios. We develop an energy efficient detector with low detection delay using sequential hypothesis testing. Sequential Probability Ratio Test (SPRT) is used at both the local nodes and the fusion center. We also analyse the performance of this algorithm and compare with the simulations. Modelling uncertainties in the distribution parameters are considered. Slow fading with and without perfect channel state information at the cognitive radios is taken into account.

Mechanism for the Compressive Strain Induced Oscillations in the Conductance of Carbon Nanotubes

We report on the monotonic increase and the oscillation of electrical conductance in multiwalled carbon nanotubes with compressive strain. Combined experimental and theoretical analyses confirm that the conductance variation with strain is because of the transition from sp(2) to configurations that are promoted by the interaction of walls in the nanotubes. The intrawall interaction is the reason for the monotonic increase in the conduction, while the oscillations are attributable to interwall interactions. This explains the observed electromechanical oscillation in multiwalled nanotubes and its absence in single-walled nanotubes, thereby resolving a long-standing debate on the interpretation of these results. Moreover, the current carrying capability of nanotubes can be enhanced significantly by controlling applied strains. DOI: 10.1103/PhysRevLett.110.095504

Strain localization effect on system reliability based design of bridge abutments under earthquake loading

The component and system reliability based design of bridge abutments under earthquake loading is presented in the paper. Planar failure surface has been used in conjunction with pseudo-dynamic approach to compute seismic active earth pressures on an abutment. The pseudo-dynamic method, considers the effect of phase difference in shear waves, soil amplification along with the horizontal seismic accelerations, strain localization in backfill soil and associated post-peak reduction in the shear resistance from peak to residual values along a previously formed failure plane. Four modes of stability viz. sliding, overturning, eccentricity and bearing capacity of the foundation soil are considered in the analysis. The series system reliability is computed with an assumption of independent failure modes. The lower and upper bounds of system reliability are also computed by taking into account the correlations between four failure modes, which is evaluated using the direction cosines of the tangent planes at the most probable points of failure.

Influence of strain localization on reliability based design of bridge abutments using pseudo-dynamic method

The paper focuses on reliability based design of bridge abutments when subjected to earthquake loading. Planar failure surface has been used in conjunction with pseudo-dynamic approach to compute the seismic active earth pressures on the bridge abutment. The proposed pseudo dynamic method, considers the effects of strain localization in the backfill soil and associated post-peak reduction in the shear resistance from peak to residual values along a previously formed failure plane, phase difference in shear waves and soil amplification along with the horizontal seismic accelerations. Four modes of stability viz. sliding, overturning, eccentricity and bearing capacity of the foundation soil are considered for the reliability analysis. The influence of various design parameters on the seismic reliability indices against four modes of failure is presented, following the suggestions of Japan Road Association, Caltrans Bridge Design Specifications and U.S Department of the Army.

Damage identification of beam-like structures with contiguous and distributed damage

Structural health monitoring of existing infrastructure is currently an active field of research, where elaborate experimental programs and advanced analytical methods are used in identifying the current state of health of critical structures. Change of static deflection as the indicator of damage is the simplest tool in a structural health monitoring scenario of bridges that is least exploited in damage identification strategies. In this paper, some simple and elegant equations based on loss of symmetry due to damage are derived and presented for identification of damage in a bridge girder modeled as a simply supported beam using changes in static deflections and dynamic parameters. A single contiguous and distributed damage, typical of reinforced or prestressed concrete structures, is assumed for the structure. The methodology is extended for a base-line-free as well as base-line-inclusive measurement. Measurement strategy involves application of loads only at two symmetric points one at a time and deflection measurements at those symmetric points as well as at the midspan of the beam. A laboratory-based experiment is used to validate the approach. Copyright (c) 2012 John Wiley & Sons, Ltd.

Linear Coding Schemes for the Distributed Computation of Subspaces

Let X-1,..., X-m be a set of m statistically dependent sources over the common alphabet F-q, that are linearly independent when considered as functions over the sample space. We consider a distributed function computation setting in which the receiver is interested in the lossless computation of the elements of an s-dimensional subspace W spanned by the elements of the row vector X-1,..., X-m]Gamma in which the (m x s) matrix Gamma has rank s. A sequence of three increasingly refined approaches is presented, all based on linear encoders. The first approach uses a common matrix to encode all the sources and a Korner-Marton like receiver to directly compute W. The second improves upon the first by showing that it is often more efficient to compute a carefully chosen superspace U of W. The superspace is identified by showing that the joint distribution of the {X-i} induces a unique decomposition of the set of all linear combinations of the {X-i}, into a chain of subspaces identified by a normalized measure of entropy. This subspace chain also suggests a third approach, one that employs nested codes. For any joint distribution of the {X-i} and any W, the sum-rate of the nested code approach is no larger than that under the Slepian-Wolf (SW) approach. Under the SW approach, W is computed by first recovering each of the {X-i}. For a large class of joint distributions and subspaces W, the nested code approach is shown to improve upon SW. Additionally, a class of source distributions and subspaces are identified, for which the nested-code approach is sum-rate optimal.

A unified model for the dynamics of driven ribbon with strain and magnetic order parameters

We develop a unified model to explain the dynamics of driven one dimensional ribbon for materials with strain and magnetic order parameters. We show that the model equations in their most general form explain several results on driven magnetostrictive metallic glass ribbons such as the period doubling route to chaos as a function of a dc magnetic field in the presence of a sinusoidal field, the quasiperiodic route to chaos as a function of the sinusoidal field for a fixed dc field, and induced and suppressed chaos in the presence of an additional low amplitude near resonant sinusoidal field. We also investigate the influence of a low amplitude near resonant field on the period doubling route. The model equations also exhibit symmetry restoring crisis with an exponent close to unity. The model can be adopted to explain certain results on magnetoelastic beam and martensitic ribbon under sinusoidal driving conditions. In the latter case, we find interesting dynamics of a periodic one orbit switching between two equivalent wells as a function of an ac magnetic field that eventually makes a direct transition to chaos under resonant driving condition. The model is also applicable to magnetomartensites and materials with two order parameters. (C) 2013 American Institute of Physics. http://dx.doi.org/10.1063/1.4790845]

Tension-compression asymmetry in an extruded Mg alloy AM30: temperature and strain rate effects

The effect of strain rate, (epsilon) over dot, and temperature, T, on the tension-compression asymmetry (TCA) in a dilute and wrought Mg alloy, AM30, over a temperature range that covers both twin accommodated deformation (below 250 degrees C in compression) as well as dislocation-mediated plasticity (above 250 degrees C) has been investigated. For this purpose, uniaxial tension and compression tests were conducted at T ranging from 25 to 400 degrees C with (epsilon) over dot varying between 10(-2) and 10 s(-1). In most of the cases, the stress-strain responses in tension and compression are distinctly different; with compression responses `concaving upward,' due to {10 (1) over bar2} tensile twinning at lower plastic strains followed by slip and strain hardening at higher levels of deformation, for T below 250 degrees C. This results in significant levels of TCA at T < 250 degrees C, reducing substantially at high temperatures. At T=150 and 250 degrees C, high (epsilon) over dot leads to high TCA, in particular at T=250 degrees C and (epsilon) over dot=10 s(-1), suggesting that twin-mediated plastic deformation takes precedence at high rates of loading even at sufficiently high T. TCA becomes negligible at T=350 degrees C; however at T=400 degrees C, as (epsilon) over dot increases TCA gets higher. Microscopy of the deformed samples, carried out by using electron back-scattered diffraction (EBSD), suggests that at T > 250 degrees C dynamic recrystallization begins between accompanied by reduction in the twinned fraction that contributes to the decrease of the TCA.