Low-Complexity Detection in Large-Dimension MIMO-ISI Channels Using Graphical Models

In this paper, we deal with low-complexity near-optimal detection/equalization in large-dimension multiple-input multiple-output inter-symbol interference (MIMO-ISI) channels using message passing on graphical models. A key contribution in the paper is the demonstration that near-optimal performance in MIMO-ISI channels with large dimensions can be achieved at low complexities through simple yet effective simplifications/approximations, although the graphical models that represent MIMO-ISI channels are fully/densely connected (loopy graphs). These include 1) use of Markov random field (MRF)-based graphical model with pairwise interaction, in conjunction with message damping, and 2) use of factor graph (FG)-based graphical model with Gaussian approximation of interference (GAI). The per-symbol complexities are O(K(2)n(t)(2)) and O(Kn(t)) for the MRF and the FG with GAI approaches, respectively, where K and n(t) denote the number of channel uses per frame, and number of transmit antennas, respectively. These low-complexities are quite attractive for large dimensions, i.e., for large Kn(t). From a performance perspective, these algorithms are even more interesting in large-dimensions since they achieve increasingly closer to optimum detection performance for increasing Kn(t). Also, we show that these message passing algorithms can be used in an iterative manner with local neighborhood search algorithms to improve the reliability/performance of M-QAM symbol detection.

Interaction of G-Quadruplexes with Nonintercalating Duplex-DNA Minor Groove Binding Ligands

The enzyme telomerase synthesizes the G-rich DNA strands of the telomere and its activity is often associated with cancer. The telomerase may be therefore responsible for the ability of a cancer cell-to escape apoptosis. The G-rich DNA sequences often adopt tetra-stranded structure, known as the G-quadruplex DNA (G4-DNA). The stabilization of the telomeric DNA into the G4-DNA structures by small molecules has been the focus of many researchers for the design and development of new anticancer agents. The compounds which stabilize the G-quadruplex in the telomere inhibit the telomerase activity. Besides telomeres, the G4-DNA forming sequences are present in the genomic regions of biological significance including the transcriptional regulatory and promoter regions of several oncogenes. Inducing a G-quadruplex structure within the G-rich promoter sequences is a potential way of achieving selective gene regulation. Several G-quadruplex stabilizing ligands are known. Minor groove binding ligands (MGBLs) interact with the double-helical DNA through the minor grooves sequence-specifically and interfere with several DNA associated processes. These MGBLs when suitably modified switch their preference sometimes from the duplex DNA to G4-DNA and stabilize the G4-DNA as well. Herein, we focus on the recent advances in understanding the G-quadruplex structures, particularly made by the human telomeric ends, and review the results of various investigations of the interaction of designed organic ligands with the G-quadruplex DNA while highlighting the importance of MGBL-G-quadruplex interactions.

Prototype learning methods for online handwriting recognition

In this paper, we study different methods for prototype selection for recognizing handwritten characters of Tamil script. In the first method, cumulative pairwise- distances of the training samples of a given class are used to select prototypes. In the second method, cumulative distance to allographs of different orientation is used as a criterion to decide if the sample is representative of the group. The latter method is presumed to offset the possible orientation effect. This method still uses fixed number of prototypes for each of the classes. Finally, a prototype set growing algorithm is proposed, with a view to better model the differences in complexity of different character classes. The proposed algorithms are tested and compared for both writer independent and writer adaptation scenarios.

Composition of Extrafloral Nectar Influences Interactions between the Myrmecophyte Humboldtia brunonis and its Ant Associates

Ant-plant interactions often are mediated by extrafloral nectar (EFN) composition that may influence plant visitation by ants. Over a 300 km range in the Indian Western Ghats, we investigated the correlation between the EFN composition of the myrmecophytic ant-plant Humboldtia brunonis (Fabaceae) and the number and species of ants visiting EFN. EFN composition varied among H. brunonis populations and between plant organs (floral bud vs. young leaf EFN). In general, EFN was rich in sugars with small quantities of amino acids, especially essential amino acids, and had moderate invertase activity. In experiments at the study sites with sugar and amino acid solutions and with leaf or floral bud EFN mimics, dominant EFN-feeding ants differentiated between solutions as well as between mimics. The castration parasite Crematogaster dohrni (northern study site) was the least selective and did not exhibit any clear feeding preferences, while the largely trophobiont-tending non-protective Myrmicaria brunnea (middle study site) preferred higher sucrose concentrations and certain essential/non-essential amino acid mixtures. The mutualistic Technomyrmex albipes (southern study site) preferred sucrose over glucose or fructose solutions and consumed the leaf EFN mimic to a greater extent than the floral bud EFN mimic. This young leaf EFN mimic had low sugar concentrations, the lowest viscosity and sugar: amino acid ratio, was rich in essential amino acids, and appeared ideally suited to the digestive physiology of T. albipes. This preference for young leaf EFN may explain the greater protection afforded to young leaves than to floral buds by T. albipes, and may also help to resolve ant-pollinator conflicts. The differential response of dominant ants to sugar, amino acids, or solution viscosity suggests that plants can fine-tune their interactions with local ants via EFN composition. Thus, EFN can mediate local partner-choice mechanisms in ant-plant interactions.

Reactivity of Bispropargyl Sulfones under Basic Conditions: Interplay Between Garratt-Braverman and Schmittel/Myers-Saito Cyclization Pathway

The preference for GarrattBraverman (GB) over MyersSaito (MS) and Schmittel (SCM) cyclizations has recently been demonstrated in sulfones capable of undergoing all three of the processes. As the GB cyclization is a self-quenching process, there is a need to change the selectivity to the non-self-quenching MS or SCM pathway so as to enhance the DNA-cleaving efficiency that operates through the radical-mediated process. Herein we report a conformational constraint-based strategy developed by using computations (M06-2X/6-31+G*) to switch the selectivity from GB to MS/SCM pathway which also results in greater DNA-cleavage activity. The preference for GB could be brought back by easing the constraint with the help of spacers.

Females of a tree cricket prefer larger males but not the lower frequency male calls that indicate large body size

In the tree cricket Oecanthus henryi, females are attracted by male calls and can choose between males. To make a case for female choice based on male calls, it is necessary to examine male call variation in the field and identify repeatable call features that are reliable indicators of male size or symmetry. Female preference for these reliable call features and the underlying assumption behind this choice, female preference for larger males, also need to be examined. We found that females did prefer larger males during mating, as revealed by the longer mating durations and longer spermatophore retention times. We then examined the correlation between acoustic and morphological features and the repeatability of male calls in the field across two temporal scales, within and across nights. We found that carrier frequency was a reliable indicator of male size, with larger males calling at lower frequencies at a given temperature. Simultaneous playback of male calls differing in frequency, spanning the entire range of natural variation at a given temperature, revealed a lack of female preference for low carrier frequencies. The contrasting results between the phonotaxis and mating experiments may be because females are incapable of discriminating small differences in frequency or because the change in call carrier frequency with temperature renders this cue unreliable in tree crickets. (C) 2012 The Association for the Study of Animal Behaviour. Published by Elsevier Ltd. All rights reserved.

Local Structural Differences in Homologous Proteins: Specificities in Different SCOP Classes

The constant increase in the number of solved protein structures is of great help in understanding the basic principles behind protein folding and evolution. 3-D structural knowledge is valuable in designing and developing methods for comparison, modelling and prediction of protein structures. These approaches for structure analysis can be directly implicated in studying protein function and for drug design. The backbone of a protein structure favours certain local conformations which include alpha-helices, beta-strands and turns. Libraries of limited number of local conformations (Structural Alphabets) were developed in the past to obtain a useful categorization of backbone conformation. Protein Block (PB) is one such Structural Alphabet that gave a reasonable structure approximation of 0.42 angstrom. In this study, we use PB description of local structures to analyse conformations that are preferred sites for structural variations and insertions, among group of related folds. This knowledge can be utilized in improving tools for structure comparison that work by analysing local structure similarities. Conformational differences between homologous proteins are known to occur often in the regions comprising turns and loops. Interestingly, these differences are found to have specific preferences depending upon the structural classes of proteins. Such class-specific preferences are mainly seen in the all-beta class with changes involving short helical conformations and hairpin turns. A test carried out on a benchmark dataset also indicates that the use of knowledge on the class specific variations can improve the performance of a PB based structure comparison approach. The preference for the indel sites also seem to be confined to a few backbone conformations involving beta-turns and helix C-caps. These are mainly associated with short loops joining the regular secondary structures that mediate a reversal in the chain direction. Rare beta-turns of type I' and II' are also identified as preferred sites for insertions.

Progressive structure-based alignment of homologous proteins: Adopting sequence comparison strategies

Comparison of multiple protein structures has a broad range of applications in the analysis of protein structure, function and evolution. Multiple structure alignment tools (MSTAs) are necessary to obtain a simultaneous comparison of a family of related folds. In this study, we have developed a method for multiple structure comparison largely based on sequence alignment techniques. A widely used Structural Alphabet named Protein Blocks (PBs) was used to transform the information on 3D protein backbone conformation as a ID sequence string. A progressive alignment strategy similar to CLUSTALW was adopted for multiple PB sequence alignment (mulPBA). Highly similar stretches identified by the pairwise alignments are given higher weights during the alignment. The residue equivalences from PB based alignments are used to obtain a three dimensional fit of the structures followed by an iterative refinement of the structural superposition. Systematic comparisons using benchmark datasets of MSTAs underlines that the alignment quality is better than MULTIPROT, MUSTANG and the alignments in HOMSTRAD, in more than 85% of the cases. Comparison with other rigid-body and flexible MSTAs also indicate that mulPBA alignments are superior to most of the rigid-body MSTAs and highly comparable to the flexible alignment methods. (C) 2012 Elsevier Masson SAS. All rights reserved.

Maximum weight independent sets in hole- and dart-free graphs

The Maximum Weight Independent Set (MWIS) problem on graphs with vertex weights asks for a set of pairwise nonadjacent vertices of maximum total weight. The complexity of the MWIS problem for hole-free graphs is unknown. In this paper, we first prove that the MWIS problem for (hole, dart, gem)-free graphs can be solved in O(n(3))-time. By using this result, we prove that the MWIS problem for (hole, dart)-free graphs can be solved in O(n(4))-time. Though the MWIS problem for (hole, dart, gem)-free graphs is used as a subroutine, we also give the best known time bound for the solvability of the MWIS problem in (hole, dart, gem)-free graphs. (C) 2012 Elsevier B.V. All rights reserved.

Feedback Overhead-Aware, Distributed, Fast, and Reliable Selection

In a communication system in which K nodes communicate with a central sink node, the following problem of selection often occurs. Each node maintains a preference number called a metric, which is not known to other nodes. The sink node must find the `best' node with the largest metric. The local nature of the metrics requires the selection process to be distributed. Further, the selection needs to be fast in order to increase the fraction of time available for data transmission using the selected node and to handle time-varying environments. While several selection schemes have been proposed in the literature, each has its own shortcomings. We propose a novel, distributed selection scheme that generalizes the best features of the timer scheme, which requires minimal feedback but does not guarantee successful selection, and the splitting scheme, which requires more feedback but guarantees successful selection. The proposed scheme introduces several new ideas into the design of the timer and splitting schemes. It explicitly accounts for feedback overheads and guarantees selection of the best node. We analyze and optimize the performance of the scheme and show that it is scalable, reliable, and fast. We also present new insights about the optimal timer scheme.

Fast Likelihood Computation in Speech Recognition using Matrices

Acoustic modeling using mixtures of multivariate Gaussians is the prevalent approach for many speech processing problems. Computing likelihoods against a large set of Gaussians is required as a part of many speech processing systems and it is the computationally dominant phase for Large Vocabulary Continuous Speech Recognition (LVCSR) systems. We express the likelihood computation as a multiplication of matrices representing augmented feature vectors and Gaussian parameters. The computational gain of this approach over traditional methods is by exploiting the structure of these matrices and efficient implementation of their multiplication. In particular, we explore direct low-rank approximation of the Gaussian parameter matrix and indirect derivation of low-rank factors of the Gaussian parameter matrix by optimum approximation of the likelihood matrix. We show that both the methods lead to similar speedups but the latter leads to far lesser impact on the recognition accuracy. Experiments on 1,138 work vocabulary RM1 task and 6,224 word vocabulary TIMIT task using Sphinx 3.7 system show that, for a typical case the matrix multiplication based approach leads to overall speedup of 46 % on RM1 task and 115 % for TIMIT task. Our low-rank approximation methods provide a way for trading off recognition accuracy for a further increase in computational performance extending overall speedups up to 61 % for RM1 and 119 % for TIMIT for an increase of word error rate (WER) from 3.2 to 3.5 % for RM1 and for no increase in WER for TIMIT. We also express pairwise Euclidean distance computation phase in Dynamic Time Warping (DTW) in terms of matrix multiplication leading to saving of approximately of computational operations. In our experiments using efficient implementation of matrix multiplication, this leads to a speedup of 5.6 in computing the pairwise Euclidean distances and overall speedup up to 3.25 for DTW.

Molecular Marriage through Partner Preferences in Covalent Cage Formation and Cage-to-Cage Transformation

Unprecedented self-sorting of three-dimensional purely organic cages driven by dynamic covalent bonds is described. Four different cages were first synthesized by condensation of two triamines and two dialdehydes separately. When a mixture of all the components was allowed to react, only two cages were formed, which suggests a high-fidelity self-recognition. The issue of the preference of one triamine for a particular dialdehyde was further probed by transforming a non-preferred combination to either of the two preferred combinations by reacting it with the appropriate triamine or dialdehyde.

Performance of established native seedlings in relation to invasive Lantana camara, rainfall and species' habitat preferences in a seasonally dry tropical forest

Native species' response to the presence of invasive species is context specific. This response cannot be studied in isolation from the prevailing environmental stresses in invaded habitats such as seasonal drought. We investigated the combined effects of an invasive shrub Lantana camara L. (lantana), seasonal rainfall and species' microsite preferences on the growth and survival of 1,105 naturally established seedlings of native trees and shrubs in a seasonally dry tropical forest. Individuals were followed from April 2008 to February 2010, and growth and survival measured in relation to lantana density, seasonality of rainfall and species characteristics in a 50-ha permanent forest plot located in Mudumalai, southern India. We used a mixed effects modelling approach to examine seedling growth and generalized linear models to examine seedling survival. The overall relative height growth rate of established seedlings was found to be very low irrespective of the presence or absence of dense lantana. 22-month growth rate of dry forest species was lower under dense lantana while moist forest species were not affected by the presence of lantana thickets. 4-month growth rates of all species increased with increasing inter-census rainfall. Community results may be influenced by responses of the most abundant species, Catunaregam spinosa, whose growth rates were always lower under dense lantana. Overall seedling survival was high, increased with increasing rainfall and was higher for species with dry forest preference than for species with moist forest preference. The high survival rates of naturally established seedlings combined with their basal sprouting ability in this forest could enable the persistence of woody species in the face of invasive species.

A study on pulsed laser deposited metallic spin valves

In the recent past conventional Spin Valve (SV) structures are gaining growing interest over Tunneling Magneto-resistance (TMR) because of its preference due to low RA product in hard disc read head sensor applications. Pulsed Laser Deposited (PLD) SV and Pseudo Spin Valve (PSV) samples are grown at room temperature with moderately high MR values using simple FM/NM/FM/AFM structure. Although PLD is not a popular technique to grow metallic SVs because of expected large intermixing of the interfaces, particulate formation, still by suitably adjusting the deposition parameters we could get exchange bias (EB) as well as 2-3% MR of these SVs in the Current In Plane (CIP) geometry. Exchange Bias, which sets in even without applying magnetic field during deposition observed by using SQUID magnetometry as well as by MR measurements. Angular variation of the MR reveals four-fold anisotropy of the hard layer (Co) which becomes two-fold in presence of an adjacent AFM layer.

On the secret key capacity of the harary graph PIN model

A pairwise independent network (PIN) model consists of pairwise secret keys (SKs) distributed among m terminals. The goal is to generate, through public communication among the terminals, a group SK that is information-theoretically secure from an eavesdropper. In this paper, we study the Harary graph PIN model, which has useful fault-tolerant properties. We derive the exact SK capacity for a regular Harary graph PIN model. Lower and upper bounds on the fault-tolerant SK capacity of the Harary graph PIN model are also derived.