A new approach for fixed point smoothing in linear distributed parameter systems

In this paper, we solve the distributed parameter fixed point smoothing problem by formulating it as an extended linear filtering problem and show that these results coincide with those obtained in the literature using the forward innovations method.

Low Complexity LID using Pruned Pattern Tables of LZW

We present two discriminative language modelling techniques for Lempel-Ziv-Welch (LZW) based LID system. The previous approach to LID using LZW algorithm was to directly use the LZW pattern tables forlanguage modelling. But, since the patterns in a language pattern table are shared by other language pattern tables, confusability prevailed in the LID task. For overcoming this, we present two pruning techniques (i) Language Specific (LS-LZW)-in which patterns common to more than one pattern table are removed. (ii) Length-Frequency product based (LF-LZW)-in which patterns having their length-frequency product below a threshold are removed. These approaches reduce the classification score (Compression Ratio [LZW-CR] or the weighted discriminant score [LZW-WDS]) for non native languages and increases the LID performance considerably. Also the memory and computational requirements of these techniques are much less compared to basic LZW techniques.

Effect of mechanical cycling on the stress-strain response of a martensitic Nitinol shape memory alloy

An experimental investigation into the ambient temperature, load-controlled tension�tension fatigue behavior of a martensitic Nitinol shape memory alloy (SMA) was conducted. Fatigue life for several stress levels spanning the critical stress for detwinning was determined and compared with that obtained on an alloy similar in composition but in the austenitic state at room temperature. Results show that the fatigue life of the pseudo-plastic alloy is superior to superelastic shape memory alloy. The stress�strain hysteretic response, monitored throughout the fatigue loading, reveals progressive strain accumulation with the cyclic loading. In addition, the area of hysteresis and recoverable and frictional energies were found to decrease with increasing number of fatigue cycles. Post-mortem characterization of the fatigued specimens through calorimetry and fractography was conducted in order to get further insight into the fatigue micromechanisms. These results are discussed in terms of reversible and irreversible microstructural changes that take place during cyclic loading. Aspects associated with self-heating of martensitic alloy undergoing high frequency stress cycling are discussed.

Direct physical evidence for the back-transformation of stress-induced martensite in the vicinity of cracks in pseudoelastic NiTi shape memory alloys

Crack loading and crack extension in pseudoelastic binary NiTi shape memory alloy (SMA) miniature compact tension (CT) specimens with 50.7 at.% Ni (austenitic, pseudoelastic) was investigated using infrared (IR) thermography during in situ loading and unloading. IR thermographic measurements allow for the observation of heat effects associated with the stress-induced transformation of martensite from B2 to BIT during loading and the reverse transformation during unloading. The results are compared with optical images and discussed in terms of the crack growth mechanisms in pseudoelastic NiTi SMAs. Direct experimental evidence is presented which shows that crack growth occurs into a stress-induced martensitic microstructure, which immediately retransforms to austenite in the wake of the crack.

A fluctuation-based characterization of athermal phase transitions:Application to shape memory alloys

We employ a fluctuation-based technique to investigate the athermal component associated with martensite phase transition, which is a prototype of temperature-driven structural transformation. Statistically, when the phase transition is purely athermal, we find that the temporal sequence of avalanches under constant drive is insensitive to the drive rate. We have used fluctuations in electrical resistivity or noise in nickel titanium shape memory alloys in three different forms: a thin film exhibiting well-defined transition temperatures,a highly disordered film, and a bulk wire of rectangular cross-section. Noise is studied in the realm of dynamic transition,viz.while the temperature is being ramped, which probes into the kinetics of the transformation at real time scales,and could probably stand out as a promising tool for material testing in various other systems, including nanoscale devices.

Aging response and its effect on the functional properties of Cu–Al–Ni shape memory alloys

The β-phase aging response of Cu–Al–Ni single crystal shape memory alloys (SMAs) within the temperature range of 473–573 K has been investigated. Alloys in austenitic (Cu–14.1Al–4Ni wt.%, alloy A) and martensitic (Cu–13.4Al–4Ni wt.%, alloy M) conditions at room temperature were considered. Aged samples show presence of β1′ and γ1′ martensites in both the alloys and formation of γ2 precipitates in the alloy A. The differential scanning calorimetry (DSC) thermograms of the aged samples show increase in transformation temperatures as well as transformation hysteresis with aging. Dynamic mechanical analysis (DMA) was conducted on both the alloys to ascertain the role of precipitates and martensitic transition on tan δ, which characterizes the damping behaviour of the material. With aging, a steady decrease in tan δ value was observed in both the alloys, which was attributed to the decrease in the number of interfaces per unit area with increasing aging temperature. Moreover, in alloy A, as the volume fraction of precipitate increases with aging, the movement of martensitic interfaces is restricted causing a decreased tan δ.

A CD8(+) T cell clone specific for antigen also recognizes peptidomimics present in anti-idiotypic antibody: Implications for T cell memory

The relay hypothesis [R. Nayak, S. Mitra-Kaushik, M.S. Shaila, Perpetuation of immunological memory: a relay hypothesis, Immunology 102 (2001) 387-395] was earlier proposed to explain perpetuation of immunological memory without requiring long lived memory cells or persisting antigen. This hypothesis envisaged cycles of interaction and proliferation of complementary idiotypic B cells (Burnet cells) and anti-idiotypic B cells (Jerne cells) as the primary reason for perpetuation of immunological memory. The presence of pepti-domimics of antigen in anti-idiotypic antibody and their presentation to antigen specific T cells was postulated to be primary reason for perpetuation of T cell memory. Using a viral hemagglutinin as a model, in this work, we demonstrate the presence of peptidomimics in the variable region of ail anti-idiotypic antibody capable of functionally mimicking the antigen derived peptides. A CD8(+) CTL clone was generated against the hemagglutinin protein which specifically responds to either peptidomimic synthesizing cells or peptidomimic pulsed antigen presenting cells. Thus, it appears reasonable that a population of activated antigen specific T cells is maintained in the body by presentation of peptidomimic through Jerne cells and other antigen presenting cells long after immunization. (C) 2007 Elsevier Inc. All rights reserved.

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.

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.

Efficient computation of volume fractions for multi-material cell complexes in a grid by slicing

The paper presents a novel slicing based method for computation of volume fractions in multi-material solids given as a B-rep whose faces are triangulated and shared by either one or two materials. Such objects occur naturally in geoscience applications and the said computation is necessary for property estimation problems and iterative forward modeling. Each facet in the model is cut by the planes delineating the given grid structure or grid cells. The method, instead of classifying the points or cells with respect to the solid, exploits the convexity of triangles and the simple axis-oriented disposition of the cutting surfaces to construct a novel intermediate space enumeration representation called slice-representation, from which both the cell containment test and the volume-fraction computation are done easily. Cartesian and cylindrical grids with uniform and non-uniform spacings have been dealt with in this paper. After slicing, each triangle contributes polygonal facets, with potential elliptical edges, to the grid cells through which it passes. The volume fractions of different materials in a grid cell that is in interaction with the material interfaces are obtained by accumulating the volume contributions computed from each facet in the grid cell. The method is fast, accurate, robust and memory efficient. Examples illustrating the method and performance are included in the paper.

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.