Spatial and vertical heterogeneities in aerosol properties over oceanic regions around India: Implications for radiative forcing

The influence of atmospheric aerosols on Earth's radiation budget and hence climate, though well recognized and extensively investigated in recent years, remains largely uncertain mainly because of the large spatio-temporal heterogeneity and the lack of data with adequate resolution. To characterize this diversity, a major multi-platform field campaign ICARB (Integrated Campaign for Aerosols, gases and Radiation Budget) was carried out during the pre-monsoon period of 2006 over the Indian landmass and surrounding oceans, which was the biggest such campaign ever conducted over this region. Based on the extensive and concurrent measurements of the optical and physical properties of atmospheric aerosols during ICARB, the spatial distribution of aerosol radiative forcing was estimated over the entire Bay of Bengal (BoB), northern Indian Ocean and Arabian Sea (AS) as well as large spatial variations within these regions. Besides being considerably lower than the mean values reported earlier for this region, our studies have revealed large differences in the forcing components between the BoB and the AS. While the regionally averaged aerosol-induced atmospheric forcing efficiency was 31 +/- 6 W m(-2) tau(-1) for the BoB, it was only similar to 18 +/- 7 W m(-2) tau(-1) for the AS. Airborne measurements revealed the presence of strong, elevated aerosol layers even over the oceans, leading to vertical structures in the atmospheric forcing, resulting in significant warming in the lower troposphere. These observations suggest serious climate implications and raise issues ranging from the impact of aerosols on vertical thermal structure of the atmospheric and hence cloud formation processes to monsoon circulation.

Algebraic distributed space-time codes with low ML decoding complexity

"Extended Clifford algebras" are introduced as a means to obtain low ML decoding complexity space-time block codes. Using left regular matrix representations of two specific classes of extended Clifford algebras, two systematic algebraic constructions of full diversity Distributed Space-Time Codes (DSTCs) are provided for any power of two number of relays. The left regular matrix representation has been shown to naturally result in space-time codes meeting the additional constraints required for DSTCs. The DSTCs so constructed have the salient feature of reduced Maximum Likelihood (ML) decoding complexity. In particular, the ML decoding of these codes can be performed by applying the lattice decoder algorithm on a lattice of four times lesser dimension than what is required in general. Moreover these codes have a uniform distribution of power among the relays and in time, thus leading to a low Peak to Average Power Ratio at the relays.

Boson-fermion duality in SU(m vertical bar n) supersymmetric Haldane-Shastry spin chain

By using the Y(gl(m|n)) super Yangian symmetry of the SU(m|n) supersymmetric Haldane-Shastry spin chain, we show that the partition function of this model satisfies a duality relation under the exchange of bosonic and fermionic spin degrees of freedom. As a byproduct of this study of the duality relation, we find a novel combinatorial formula for the super Schur polynomials associated with some irreducible representations of the Y(gl(m|n)) Yangian algebra. Finally, we reveal an intimate connection between the global SU(m|n) symmetry of a spin chain and the boson-fermion duality relation. (C) 2007 Elsevier B.V. All rights reserved.

Distributed joint source channel coding on a multiple access channel with side information

We consider the problem of transmission of several discrete sources over a multiple access channel (MAC) with side information at the sources and the decoder. Source-channel separation does not hold for this channel. Sufficient conditions are provided for transmission of sources with a given distortion. The channel could have continuous alphabets (Gaussian MAC is a special case). Various previous results are obtained as special cases.

Detection of contiguous and distributed damage through contours of equal frequency change

The paper presents the results of a computational modeling for damage identification process for an axial rod representing an end-bearing pile foundation with known damage and a simply supported beam representing a bridge girder. The paper proposes a methodology for damage identification from measured natural frequencies of a contiguously damaged reinforced concrete axial rod and beam, idealized with distributed damage model. Identification of damage is from Equal_Eigen_value_change (Iso_Eigen_value_Change) contours, plotted between pairs of different frequencies. The performance of the method is checked for a wide variation of damage positions and extents. An experiment conducted on a free-free axially loaded reinforced concrete member and a flexural beam is shown as examples to prove the pros and cons of this method. (C) 2009 Elsevier Ltd. All rights reserved.

Distributed space-time codes for cooperative networks with partial CSI

Design criteria and full-diversity Distributed Space Time Codes (DSTCs) for the two phase transmission based cooperative diversity protocol of Jing-Hassibi and the Generalized Nonorthogonal Amplify and Forward (GNAF) protocol are reported, when the relay nodes are assumed to have knowledge of the phase component of the source to relay channel gains. It is shown that this under this partial channel state information (CSI), several well known space time codes for the colocated MIMO (Multiple Input Multiple Output) channel become amenable for use as DSTCs. In particular, the well known complex orthogonal designs, generalized coordinate interleaved orthogonal designs (GCIODs) and unitary weight single symbol decodable (UW-SSD) codes are shown to satisfy the required design constraints for DSTCs. Exploiting the relaxed code design constraints, we propose DSTCs obtained from Clifford Algebras which have low ML decoding complexity.

High-rate, Single-Symbol Decodable Distributed STBCs for Partially-Coherent Cooperative Networks

Space-time block codes (STBCs) that are single-symbol decodable (SSD) in a co-located multiple antenna setting need not be SSD in a distributed cooperative communication setting. A relay network with N relays and a single source-destination pair is called a partially-coherent relay channel (PCRC) if the destination has perfect channel state information (CSI) of an the channels and the relays have only the phase information of the source-to-relay channels. In our earlier work, we had derived a set of necessary and sufficient conditions for a distributed STBC (DSTBC) to be SSD for a PCRC. Using these conditions, in this paper we show that the possibility of channel phase compensation operation at the relay nodes using partial CSI at the relays increases the possible rate of SSD DSTBCs from 2/N when the relays do not have CSI to 1/2, which is independent of N. We also show that when a DSTBC is SSD for a PCRC, then arbitrary coordinate interleaving of the in-phase and quadrature-phase components of the variables does not disturb its SSD property. Using this property we are able to construct codes that are SSD and have higher rate than 2/N but giving full diversity only for signal constellations satisfying certain conditions.

Interactive Distributed Source Coding in Asymmetric Communication Scenarios

We provide a new unified framework, called "multiple correlated informants - single recipient" communication, to address the variations of the traditional Distributed Source Coding (DSC) problem. Different combinations of the assumptions about the communication scenarios and the objectives of communication result in different variations of the DSC problem. For each of these variations, the complexities of communication and computation of the optimal solution is determined by the combination of the underlying assumptions. In the proposed framework, we address the asymmetric, interactive, and lossless variant of the DSC problem, with various objectives of communication and provide optimal solutions for those. Also, we consider both, the worst-case and average-case scenarios.

OFDM Based Distributed Space Time Coding for Asynchronous Relay Networks

Recently Li and Xia have proposed a transmission scheme for wireless relay networks based on the Alamouti space time code and orthogonal frequency division multiplexing to combat the effect of timing errors at the relay nodes. This transmission scheme is amazingly simple and achieves a diversity order of two for any number of relays. Motivated by its simplicity, this scheme is extended to a more general transmission scheme that can achieve full cooperative diversity for any number of relays. The conditions on the distributed space time block code (DSTBC) structure that admit its application in the proposed transmission scheme are identified and it is pointed out that the recently proposed full diversity four group decodable DST-BCs from precoded co-ordinate interleaved orthogonal designs and extended Clifford algebras satisfy these conditions. It is then shown how differential encoding at the source can be combined with the proposed transmission scheme to arrive at a new transmission scheme that can achieve full cooperative diversity in asynchronous wireless relay networks with no channel information and also no timing error knowledge at the destination node. Finally, four group decodable distributed differential space time block codes applicable in this new transmission scheme for power of two number of relays are also provided.

Time and Energy Complexity of Distributed Computation of a Class of Functions in Wireless Sensor Networks

We consider a scenario in which a wireless sensor network is formed by randomly deploying n sensors to measure some spatial function over a field, with the objective of computing a function of the measurements and communicating it to an operator station. We restrict ourselves to the class of type-threshold functions (as defined in the work of Giridhar and Kumar, 2005), of which max, min, and indicator functions are important examples: our discussions are couched in terms of the max function. We view the problem as one of message-passing distributed computation over a geometric random graph. The network is assumed to be synchronous, and the sensors synchronously measure values and then collaborate to compute and deliver the function computed with these values to the operator station. Computation algorithms differ in (1) the communication topology assumed and (2) the messages that the nodes need to exchange in order to carry out the computation. The focus of our paper is to establish (in probability) scaling laws for the time and energy complexity of the distributed function computation over random wireless networks, under the assumption of centralized contention-free scheduling of packet transmissions. First, without any constraint on the computation algorithm, we establish scaling laws for the computation time and energy expenditure for one-time maximum computation. We show that for an optimal algorithm, the computation time and energy expenditure scale, respectively, as Theta(radicn/log n) and Theta(n) asymptotically as the number of sensors n rarr infin. Second, we analyze the performance of three specific computation algorithms that may be used in specific practical situations, namely, the tree algorithm, multihop transmission, and the Ripple algorithm (a type of gossip algorithm), and obtain scaling laws for the computation time and energy expenditure as n rarr infin. In particular, we show that the computation time for these algorithms scales as Theta(radicn/lo- g n), Theta(n), and Theta(radicn log n), respectively, whereas the energy expended scales as , Theta(n), Theta(radicn/log n), and Theta(radicn log n), respectively. Finally, simulation results are provided to show that our analysis indeed captures the correct scaling. The simulations also yield estimates of the constant multipliers in the scaling laws. Our analyses throughout assume a centralized optimal scheduler, and hence, our results can be viewed as providing bounds for the performance with practical distributed schedulers.

Stability of an unsupported vertical circular excavation in clays under undrained condition

By using the axisymmetric finite elements static limit analysis formulation, proposed recently by the authors, the stability numbers (gamma H/c(o)) for an unsupported vertical circular excavation in clays, whose cohesion increases with depth, have been determined under undrained condition; gamma = unit weight, H., height of the excavation and c(o) = cohesion along ground surface. The results are obtained for various values of H/b and m; where b = the radius of the excavation and m = a non-dimensional parameter which accounts for the rate of the increase of cohesion with depth. The values of the stability numbers increase continuously both with increases in H/b and m. The results obtained in this study compare well with those available in literature.(C) 2009 Elsevier Ltd. All rights reserved.

Unsteady MHD mixed convection flow over an impulsively stretched permeable vertical surface in a quiescent fluid

The unsteady mixed convection flow of an incompressible laminar electrically conducting fluid over an impulsively stretched permeable vertical surface in an unbounded quiescent fluid in the presence of a transverse magnetic field has been investigated. At the same time, the surface temperature is suddenly increased from the surrounding fluid temperature or a constant heat flux is suddenly imposed on the surface. The problem is formulated in such a way that for small time it is governed by Rayleigh type of equation and for large time by Crane type of equation. The non-linear coupled parabolic partial differential equations governing the unsteady mixed convection flow under boundary layer approximations have been solved analytically by using the homotopy analysis method as well as numerically by an implicit finite difference scheme. The local skin friction coefficient and the local Nusselt number are found to decrease rapidly with time in a small time interval and they tend to steady-state values for t* >= 5. They also increase with the buoyancy force and suction, but decrease with injection rate. The local skin friction coefficient increases with the magnetic field, but the local Nusselt number decreases. There is a smooth transition from the unsteady state to the steady state. (C) 2010 Elsevier Ltd. All rights reserved.

A real coded genetic algorithm for data partitioning and scheduling in networks with arbitrary processor release time

The problem of scheduling divisible loads in distributed computing systems, in presence of processor release time is considered. The objective is to find the optimal sequence of load distribution and the optimal load fractions assigned to each processor in the system such that the processing time of the entire processing load is a minimum. This is a difficult combinatorial optimization problem and hence genetic algorithms approach is presented for its solution.

Unsteady mixed convection on the stagnation-point flow adjacent to a vertical plate with a magnetic field

An analysis is performed to study the unsteady combined forced and free convection flow (mixed convection flow) of a viscous incompressible electrically conducting fluid in the vicinity of an axisymmetric stagnation point adjacent to a heated vertical surface. The unsteadiness in the flow and temperature fields is due to the free stream velocity, which varies arbitrarily with time. Both constant wall temperature and constant heat flux conditions are considered in this analysis. By using suitable transformations, the Navier-Stokes and energy equations with four independent variables (x, y, z, t) are reduced to a system of partial differential equations with two independent variables (eta, tau). These transformations also uncouple the momentum and energy equations resulting in a primary axisymmetric flow, in an energy equation dependent on the primary flow and in a buoyancy-induced secondary flow dependent on both primary flow and energy. The resulting system of partial differential equations has been solved numerically by using both implicit finite-difference scheme and differential-difference method. An interesting result is that for a decelerating free stream velocity, flow reversal occurs in the primary flow after certain instant of time and the magnetic field delays or prevents the flow reversal. The surface heat transfer and the surface shear stress in the primary flow increase with the magnetic field, but the surface shear stress in the buoyancy-induced secondary flow decreases. Further the heat transfer increases with the Prandtl number, but the surface shear stress in the secondary flow decreases.

Fracture analysis of stiffened panels under combined tensile, bending, and shear loads

The objective is to present the formulation of numerically integrated modified virtual crack closure integral technique for concentrically and eccentrically stiffened panels for computation of strain-energy release rate and stress intensity factor based on linear elastic fracture mechanics principles. Fracture analysis of cracked stiffened panels under combined tensile, bending, and shear loads has been conducted by employing the stiffened plate/shell finite element model, MQL9S2. This model can be used to analyze plates with arbitrarily located concentric/eccentric stiffeners, without increasing the total number of degrees of freedom, of the plate element. Parametric studies on fracture analysis of stiffened plates under combined tensile and moment loads have been conducted. Based on the results of parametric,studies, polynomial curve fitting has been carried out to get best-fit equations corresponding to each of the stiffener positions. These equations can be used for computation of stress intensity factor for cracked stiffened plates subjected to tensile and moment loads for a given plate size, stiffener configuration, and stiffener position without conducting finite element analysis.