The evolution of genomic imprinting

We explore three possible pathways for the evolution of genomic imprinting. (1) Imprinting may be advantageous in itself when imprinted and unimprinted alleles of a locus confer different phenotypes. If a segment of DNA is imprinted in the gametes of one sex but not in those of the other, it might lead to effects correlated with sexual dimorphism. More fundamentally, in certain organisms, sex determination might have evolved because of imprinting. When imprinting leads to chromosome elimination or inactivation and occurs in some embryos but not in others, two classes of embryos, differing in the number of functional gene copies, would result. A model for sex determination based on inequality in the actual or effective copy-number of particular noncoding, regulatory sequences of DNA has been proposed (Chandra, Proc. natn. Acad. Sci. U.S.A. 82. 1165–1169 and 6947–6949, 1985). Maternal control of offspring sex is another possible consequence of imprinting; this would indicate a potential role for imprinting in sex ratio evolution. (2) Genes responsible for imprinting may have pleiotropic effects and they may have been selected for reasons other than their imprinting ability. Lack of evidence precludes further consideration of this possibility. (3) Imprinting could have co-evolved with other traits. For instance, gamete-specific imprinting could lead to a lowered fitness of androgenetic or gynogenetic diploids relative to the fitness of ‘normal’ diploids. This in turn would reinforce the evolution of anisogamy. The reversibility of imprinting raises the possibility of occasional incomplete or improper erasure. If the site of imprinting is the egg – as appears to be the case with the human X (Chandra and Brown, Nature 253. 165–168, 1975) – either improper imprinting or improper erasure could lead to unusual patterns of inheritance (as in the fragile-X syndrome) or fitness effects skipping generations.

A Circuit-Based Proof of Toda′s Theorem

We present a simple proof of Toda′s result (Toda (1989), in "Proceedings, 30th Annual IEEE Symposium on Foundations of Computer Science," pp. 514-519), which states that circled plus P is hard for the Polynomial Hierarchy under randomized reductions. Our approach is circuit-based in the sense that we start with uniform circuit definitions of the Polynomial Hierarchy and apply the Valiant-Vazirani lemma on these circuits (Valiant and Vazirani (1986), Thoeret. Comput. Sci.47, 85-93).

Analyzing Cache Performance Bottlenecks of STM Applications and addressing them with Compiler's help

Software transactional memory (STM) is a promising programming paradigm for shared memory multithreaded programs as an alternative to traditional lock based synchronization. However adoption of STM in mainstream software has been quite low due to its considerable overheads and its poor cache/memory performance. In this paper, we perform a detailed study of the cache behavior of STM applications and quantify the impact of different STM factors on the cache misses experienced by the applications. Based on our analysis, we propose a compiler driven Lock-Data Colocation (LDC), targeted at reducing the cache overheads on STM. We show that LDC is effective in improving the cache behavior of STM applications by reducing the dcache miss latency and improving execution time performance.

NUcache: A Multicore Cache Organization Based on Next-Use Distance

In this work, we propose a new organization for the last level shared cache of a rnulticore system. Our design is based on the observation that the Next-Use distance, measured in terms of intervening misses between the eviction of a line and its next use, for lines brought in by a given delinquent PC falls within a predictable range of values. We exploit this correlation to improve the performance of shared caches in multi-core architectures by proposing the NUcache organization.

Hybrid Polypeptides: Gabapentin as a Stereochemically Constrained gamma-Amino Acid Residue

The design of folded structures in peptides containing the higher homologues of alpha-amino acid residues requires the restriction of the range of local conformational choices In alpha-amino acids stereochemically constrained residues like alpha,alpha-dialkylated residue, aminoisobutyric acid (Aib), and D-Proline ((D)Pro) have proved extremely useful in the design of helices and hairpins in short peptides Extending this approach, backbone substitution and cyclization are anticipated to bc useful in generating conformationally constrained beta- and gamma-residues This brief review provides a survey of work on hybrid peptide sequences concerning the conformationally constrained gamma-amino acid residue 1-aminomethyl cyclohexane acetic acid, gabapentin (Gpn) This achiral, beta,beta-disubstituted, gamma-residue strongly favors gauche-gauche conformations about the C-alpha-C-beta (0(2)) and C-alpha-C-gamma (0(1)) bonds, facilitating local folding The Gpn residue can adopt both C-7 (NH1 -> CO1) and C-9 (CO1 (I)<- NH1+I) hydrogen bonds which are analogous to the C-5 and C7 (gamma-turn) conformations at alpha-residues In conjunction with adjacent residues, Gpn may be used in ay and gamma alpha segments to generate C-12 hydrogen bonded conformations which may be considered as expanded analogs of conventional beta-turns The structural characterization of C-12 helices, C-12/C-10 helices with mixed hydrogen bond directionalities and beta-hairpins incorporating Gpn residues at the turn segment is illustrated (C) 2010 Wiley Periodicals, Inc Biopolymers (Pept Sci) 94 733-741 2010

High Yield Room Temperature Synthesis And Spectral Studies Of Tri(Amino)Silanes: (R2n)3SIH

Tri(amino)silanes were prepared by the condensation of trichlorosilane with secondary amines in 1:6 molar ratio. Reactions of trichlorosilane with pyrrolidine, piperidine, hexamethyleneimine, morpholine, N-methylpiperazine and diethylamine afford the tri(amino)silanes in nearly quantitative yields. Their physical and spectroscopic properties are discussed. All these compounds are highly sensitive to moisture and hydrolyse to silica and the respective amine with the evolution of hydrogen. The compounds have been characterised by IR, 1H NMR, [1H]29Si NMR spectroscopic methods and CHN elemental analysis.

A Sub-Nyquist Sampling Method For Computing The Level-crossing-times Of An Analog Signal: Theory And Applications

We address the problem of computing the level-crossings of an analog signal from samples measured on a uniform grid. Such a problem is important, for example, in multilevel analog-to-digital (A/D) converters. The first operation in such sampling modalities is a comparator, which gives rise to a bilevel waveform. Since bilevel signals are not bandlimited, measuring the level-crossing times exactly becomes impractical within the conventional framework of Shannon sampling. In this paper, we propose a novel sub-Nyquist sampling technique for making measurements on a uniform grid and thereby for exactly computing the level-crossing times from those samples. The computational complexity of the technique is low and comprises simple arithmetic operations. We also present a finite-rate-of-innovation sampling perspective of the proposed approach and also show how exponential splines fit in naturally into the proposed sampling framework. We also discuss some concrete practical applications of the sampling technique.

A novel property of an Auto-Correlation Sequence and some Applications

In this article, we use some spectral properties of polynomials presented in 1] and map an auto-correlation sequence to a set of Line Spectral Frequencies(LSFs) and reflection coefficients. This novel characterization of an auto-correlation sequence is used to obtain a lattice structure of a Linear-Phase(LP) FIR filter.

Bayesian Decentralized Spectrum Sensing in Cognitive Radio Networks

This paper considers the problem of spectrum sensing, i.e., the detection of whether or not a primary user is transmitting data by a cognitive radio. The Bayesian framework is adopted, with the performance measure being the probability of detection error. A decentralized setup, where N sensors use M observations each to arrive at individual decisions that are combined at a fusion center to form the overall decision is considered. The unknown fading channel between the primary sensor and the cognitive radios makes the individual decision rule computationally complex, hence, a generalized likelihood ratio test (GLRT)-based approach is adopted. Analysis of the probabilities of false alarm and miss detection of the proposed method reveals that the error exponent with respect to M is zero. Also, the fusion of N individual decisions offers a diversity advantage, similar to diversity reception in communication systems, and a tight bound on the error exponent is presented. Through an analysis in the low power regime, the number of observations needed as a function of received power, to achieve a given probability of error is determined. Monte-Carlo simulations confirm the accuracy of the analysis.

Model Based Target Tracking in a Wireless Network of Passive Infrared Sensor Nodes

We consider the problem of tracking an intruder in a plane region by using a wireless sensor network comprising motes equipped with passive infrared (PIR) sensors deployed over the region. An input-output model for the PIR sensor and a method to estimate the angular speed of the target from the sensor output are proposed. With the measurement model so obtained, we study the centralized and decentralized tracking performance using the extended Kalman filter.

Continuity Metric for Unit Selection based Text-to-Speech Synthesis

A new method based on unit continuity metric (UCM) is proposed for optimal unit selection in text-to-speech (TTS) synthesis. UCM employs two features, namely, pitch continuity metric and spectral continuity metric. The methods have been implemented and tested on our test bed called MILE-TTS and it is available as web demo. After verification by a self selection test, the algorithms are evaluated on 8 paragraphs each for Kannada and Tamil by native users of the languages. Mean-opinion-score (MOS) shows that naturalness and comprehension are better with UCM based algorithm than the non-UCM based ones. The naturalness of the TTS output is further enhanced by a new rule based algorithm for pause prediction for Tamil language. The pauses between the words are predicted based on parts-of-speech information obtained from the input text.