An annotated checklist of amphibian of India with some insights into the patterns of species discoveries, distribution and endemism

An annotated checklist of 284 species of amphibians of India accommodated under 50 genera and 14 families is provided. Synonyms, English names, type localities, deposition of type specimens, type specimen availability and distributional records in India and outside India are provided for all the species. Among the 284 species of amphibians from India, 132 are endemic to Western Ghats; 29 to Northeastern India; and 5 to Andaman Nicobar islands. Species discovery patterns from the various biogeographic zones in India are discussed in detail. Cumulative discovery pattern with special reference to the genera Fejervarya (17 species), Nyctibatrachus (16 species), Indirana (10 species), Micrixalus (11 species), Philautus (46 species) and Gegeneophis (10 species) are also discussed.

Joint evaluation of multiple speech patterns for speech recognition and training

We are addressing the novel problem of jointly evaluating multiple speech patterns for automatic speech recognition and training. We propose solutions based on both the non-parametric dynamic time warping (DTW) algorithm, and the parametric hidden Markov model (HMM). We show that a hybrid approach is quite effective for the application of noisy speech recognition. We extend the concept to HMM training wherein some patterns may be noisy or distorted. Utilizing the concept of ``virtual pattern'' developed for joint evaluation, we propose selective iterative training of HMMs. Evaluating these algorithms for burst/transient noisy speech and isolated word recognition, significant improvement in recognition accuracy is obtained using the new algorithms over those which do not utilize the joint evaluation strategy.

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.

Correlated Gaussian Sources over Orthogonal Gaussian Channels

We consider the transmission of correlated Gaussian sources over orthogonal Gaussian channels. It is shown that the Amplify and Forward (AF) scheme which simplifies the design of encoders and the decoder, performs close to the optimal scheme even at high SNR. Also, it outperforms a recently proposed scalar quantizer scheme both in performance and complexity. We also study AF when there is side information at the encoders and decoder.

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.

A Petri net model for evaluating packet buffering strategies in a network processor

Previous studies have shown that buffering packets in DRAM is a performance bottleneck. In order to understand the impediments in accessing the DRAM, we developed a detailed Petri net model of IP forwarding application on IXP2400 that models the different levels of the memory hierarchy. The cell based interface used to receive and transmit packets in a network processor leads to some small size DRAM accesses. Such narrow accesses to the DRAM expose the bank access latency, reducing the bandwidth that can be realized. With real traces up to 30% of the accesses are smaller than the cell size, resulting in 7.7% reduction in DRAM bandwidth. To overcome this problem, we propose buffering these small chunks of data in the on chip scratchpad memory. This scheme also exploits greater degree of parallelism between different levels of the memory hierarchy. Using real traces from the internet, we show that the transmit rate can be improved by an average of 21% over the base scheme without the use of additional hardware. Further, the impact of different traffic patterns on the network processor resources is studied. Under real traffic conditions, we show that the data bus which connects the off-chip packet buffer to the micro-engines, is the obstacle in achieving higher throughput.

A non-orthogonal cooperative multiple access (NCMA) protocol and low ML decoding complexity codes

A half-duplex constrained non-orthogonal cooperative multiple access (NCMA) protocol suitable for transmission of information from N users to a single destination in a wireless fading channel is proposed. Transmission in this protocol comprises of a broadcast phase and a cooperation phase. In the broadcast phase, each user takes turn broadcasting its data to all other users and the destination in an orthogonal fashion in time. In the cooperation phase, each user transmits a linear function of what it received from all other users as well as its own data. In contrast to the orthogonal extension of cooperative relay protocols to the cooperative multiple access channels wherein at any point of time, only one user is considered as a source and all the other users behave as relays and do not transmit their own data, the NCMA protocol relaxes the orthogonality built into the protocols and hence allows for a more spectrally efficient usage of resources. Code design criteria for achieving full diversity of N in the NCMA protocol is derived using pair wise error probability (PEP) analysis and it is shown that this can be achieved with a minimum total time duration of 2N - 1 channel uses. Explicit construction of full diversity codes is then provided for arbitrary number of users. Since the Maximum Likelihood decoding complexity grows exponentially with the number of users, the notion of g-group decodable codes is introduced for our setup and a set of necesary and sufficient conditions is also obtained.

Joint decoding of multiple speech patterns for robust speech recognition

We are addressing a new problem of improving automatic speech recognition performance, given multiple utterances of patterns from the same class. We have formulated the problem of jointly decoding K multiple patterns given a single Hidden Markov Model. It is shown that such a solution is possible by aligning the K patterns using the proposed Multi Pattern Dynamic Time Warping algorithm followed by the Constrained Multi Pattern Viterbi Algorithm The new formulation is tested in the context of speaker independent isolated word recognition for both clean and noisy patterns. When 10 percent of speech is affected by a burst noise at -5 dB Signal to Noise Ratio (local), it is shown that joint decoding using only two noisy patterns reduces the noisy speech recognition error rate to about 51 percent, when compared to the single pattern decoding using the Viterbi Algorithm. In contrast a simple maximization of individual pattern likelihoods, provides only about 7 percent reduction in error rate.

Low PAPR STBCs from Complex Partial-Orthogonal Designs (CPODs)

Space-time codes from complex orthogonal designs (CODs) with no zero entries offer low Peak to Average power ratio (PAPR) and avoid the problem of turning off antennas. But CODs for 2(a) antennas with a + 1 complex variables, with no zero entries are not known in the literature for a >= 4. In this paper, a method of obtaining no zero entry (NZE) codes, called Complex Partial-Orthogonal Designs (CPODs), for 2(a+1) antennas whenever a certain type of NZE code exists for 2(a) antennas is presented. This is achieved with slight increase in the ML decoding complexity for regular QAM constellations and no increase for other complex constellations. Since NZE CODs have been constructed recently for 8 antennas our method leads to NZE CPODs for 16 antennas. Moreover, starting from certain NZE CPODs for n antennas, a construction procedure is given to obtain NZE CPODs for 2n antennas. The class of CPODs do not offer full-diversity for all complex constellations. For the NZE CPODs presented in the paper, conditions on the signal sets which will guarantee full-diversity are identified. Simulations results show that bit error performance of our codes under average power constraint is same as that of the CODs and superior to CODs under peak power constraint.

Complex near-orthogonal designs with no zero entry

Zero entries in complex orthogonal designs (CODs) impede their practical implementation. In this paper, a method of obtaining a no zero entry (NZE) code for 2(k+1) antennas whenever a NZE code exists for 2(k) antennas is presented. This is achieved with slight increase in the ML decoding complexity for regular QAM constellations and no increase for other complex constellations. Since NZE CODs have been constructed recently for 8 antennas our method leads to NZE codes for 16 antennas. Simulation results show good performance of our new codes compared to the well known constructions for 16 and 32 antennas under peak power constraints.

Low-delay, high-rate, non-square STBCs from scaled complex orthogonal designs

Space-time block codes (STBCs) obtained from non-square complex orthogonal designs are bandwidth efficient compared to those from square real/complex orthogonal designs for colocated coherent MIMO systems and has other applications in (i) non-coherent MIMO systems with non-differential detection, (ii) Space-Time-Frequency codes for MIMO-OFDM systems and (iii) distributed space-time coding for relay channels. Liang (IEEE Trans. Inform. Theory, 2003) has constructed maximal rate non-square designs for any number of antennas, with rates given by [(a+1)/(2a)] when number of transmit antennas is 2a-1 or 2a. However, these designs have large delays. When large number of antennas are considered this rate is close to 1/2. Tarokh et al (IEEE Trans. Inform. Theory, 1999) have constructed rate 1/2 non-square CODs using the rate-1 real orthogonal designs for any number of antennas, where the decoding delay of these codes is less compared to the codes constructed by Liang for number of transmit antennas more than 5. In this paper, we construct a class of rate-1/2 codes for arbitrary number of antennas where the decoding delay is reduced by 50% when compared with the rate-1/2 codes given by Tarokh et al. It is also shown that even though scaling the variables helps to lower the delay it can not be used to increase the rate.

Memory-efficient spatial prediction image compression scheme

In prediction phase, the hierarchical tree structure obtained from the test image is used to predict every central pixel of an image by its four neighboring pixels. The prediction scheme generates the predicted error image, to which the wavelet/sub-band coding algorithm can be applied to obtain efficient compression. In quantization phase, we used a modified SPIHT algorithm to achieve efficiency in memory requirements. The memory constraint plays a vital role in wireless and bandwidth-limited applications. A single reusable list is used instead of three continuously growing linked lists as in case of SPIHT. This method is error resilient. The performance is measured in terms of PSNR and memory requirements. The algorithm shows good compression performance and significant savings in memory. (C) 2006 Elsevier B.V. All rights reserved.

'Wet N2O oxidation' process and interface state density characterization of nanoscale nitrided SiO2 for flash memory application

In this paper we first present the 'wet N2O' furnace oxidation process to grow nitrided tunnel oxides in the thickness range 6 to 8 nm on silicon at a temperature of 800 degrees C. Electrical characteristics of MOS capacitors and MOSFETs fabricated using this oxide as gate oxide have been evaluated and the superior features of this oxide are ascertained The frequency response of the interface states, before and after subjecting the MOSFET gate oxide to constant current stress, is studied using a simple analytical model developed in this work.