VIP blockade leads to microcephaly in mice via disruption of Mcph1-Chk1 signaling

Autosomal recessive primary microcephaly (MCPH) is a genetic disorder that causes a reduction of cortical outgrowth without severe interference with cortical patterning. It is associated with mutations in a number of genes encoding protein involved in mitotic spindle formation and centrosomal activities or cell cycle control. We have shown previously that blocking vasoactive intestinal peptide (VIP) during gestation in mice by using a VIP antagonist (VA) results in microcephaly. Here, we have shown that the cortical abnormalities caused by prenatal VA administration mimic the phenotype described in MCPH patients and that VIP blockade during neurogenesis specifically disrupts Mcph1 signaling. VA administration reduced neuroepithelial progenitor proliferation by increasing cell cycle length and promoting cell cycle exit and premature neuronal differentiation. Quantitative RT-PCR and Western blot showed that VA downregulated Mcph1. Inhibition of Mcph1 expression led to downregulation of Chk1 and reduction of Chk1 kinase activity. The inhibition of Mcph1 and Chk1 affected the expression of a specific subset of cell cycle-controlling genes and turned off neural stem cell proliferation in neurospheres. Furthermore, in vitro silencing of either Mcph1 or Chk1 in neurospheres mimicked VA-induced inhibition of cell proliferation. These results demonstrate that VIP blockade induces microcephaly through Mcph1 signaling and suggest that VIP/Mcph1/Chk1 signaling is key for normal cortical development.

Optimal Exact-Regenerating Codes for Distributed Storage at the MSR and MBR Points via a Product-Matrix Construction

Regenerating codes are a class of distributed storage codes that allow for efficient repair of failed nodes, as compared to traditional erasure codes. An [n, k, d] regenerating code permits the data to be recovered by connecting to any k of the n nodes in the network, while requiring that a failed node be repaired by connecting to any d nodes. The amount of data downloaded for repair is typically much smaller than the size of the source data. Previous constructions of exact-regenerating codes have been confined to the case n = d + 1. In this paper, we present optimal, explicit constructions of (a) Minimum Bandwidth Regenerating (MBR) codes for all values of [n, k, d] and (b) Minimum Storage Regenerating (MSR) codes for all [n, k, d >= 2k - 2], using a new product-matrix framework. The product-matrix framework is also shown to significantly simplify system operation. To the best of our knowledge, these are the first constructions of exact-regenerating codes that allow the number n of nodes in the network, to be chosen independent of the other parameters. The paper also contains a simpler description, in the product-matrix framework, of a previously constructed MSR code with [n = d + 1, k, d >= 2k - 1].

Spectral Finite Element Formulation for Nanorods via Nonlocal Continuum Mechanics

In this article, the Eringen's nonlocal elasticity theory has been incorporated into classical/local Bernoulli-Euler rod model to capture unique properties of the nanorods under the umbrella of continuum mechanics theory. The spectral finite element (SFE) formulation of nanorods is performed. SFE formulation is carried out and the exact shape functions (frequency dependent) and dynamic stiffness matrix are obtained as function of nonlocal scale parameter. It has been found that the small scale affects the exact shape functions and the elements of the dynamic stiffness matrix. The results presented in this paper can provide useful guidance for the study and design of the next generation of nanodevices that make use of the wave dispersion properties of carbon nanotubes.

Colorimetric Probes Based on Anthraimidazolediones for Selective Sensing of Fluoride and Cyanide Ion via Intramolecular Charge Transfer

Probes based on anthra[1,2-d]imidazole-6,11-dione were designed and synthesized for selective ion sensing. Each probe acted as strong colorimetric sensors for fluoride and cyanide ions and exhibited intramolecular charge transfer (ICT) band, which showed significant red-shifts after addition of either the F(-) or CN(-) ion. One of the probes (2) showed selective colorimetric sensing for both cyanide and fluoride ions. In organic medium, 2 showed selective color change with fluoride and cyanide, whereas in aqueous organic medium it showed a ratiometric response selectively for cyanide ion.

0.84 ps Resolution Clock Skew Measurement via Subsampling

An all-digital on-chip clock skew measurement system via subsampling is presented. The clock nodes are sub-sampled with a near-frequency asynchronous sampling clock to result in beat signals which are themselves skewed in the same proportion but on a larger time scale. The beat signals are then suitably masked to extract only the skews of the rising edges of the clock signals. We propose a histogram of the arithmetic difference of the beat signals which decouples the relationship of clock jitter to the minimum measurable skew, and allows skews arbitrarily close to zero to be measured with a precision limited largely by measurement time, unlike the conventional XOR based histogram approach. We also analytically show that the proposed approach leads to an unbiased estimate of skew. The measured results from a 65 nm delay measurement front-end indicate that for an input skew range of +/- 1 fan-out-of-4 (FO4) delay, +/- 3 sigma resolution of 0.84 ps can be obtained with an integral error of 0.65 ps. We also experimentally demonstrate that a frequency modulation on a sampling clock maintains precision, indicating the robustness of the technique to jitter. We also show how FM modulation helps in restoring precision in case of rationally related clocks.

Nanostructuration via solid state transformation as a strategy for improving the thermoelectric efficiency of PbTe alloys

The approach taken in this paper in order to modify the scattering features of electrons and phonons and improve the figure of merit (ZT) of thermoelectric PbTe is to alter the microstructure at constant chemistry. A lamellar pattern of PbTe/GeTe at the nano- and microscale was produced in Pb(0.36)Ge(0.64)Te alloy by the diffusional decomposition of a supersaturated solid solution. The mechanism of nanostructuration is most likely a discontinuous spinodal decomposition. A simple model relating the interface velocity to the observed lamellar spacing is proposed. The effects of nanostructuration in Pb(0.36)Ge(0.64)Te alloy on the electrical and thermal conductivity, thermopower and ZT were investigated. It was shown that nanostructuration through the formation of a lamellar pattern of PbTe/GeTe is unlikely to provide a significant improvement due to the occurrence of discontinuous coarsening. However, the present study allows an analysis of possible strategies to improve thermoelectric materials via optimal design of the microstructure and optimized heat treatment. (C) 2011 Acta Materialia Inc. Published by Elsevier Ltd. All rights reserved.

Fast-Group-Decodable STBCs via Codes over GF(4): Further Results

Recently in, a framework was given to construct low ML decoding complexity Space-Time Block Codes (STBCs) via codes over the finite field F4. In this paper, we construct new full-diversity STBCs with cubic shaping property and low ML decoding complexity via codes over F4 for number of transmit antennas N = 2m, m >; 1, and rates R >; 1 complex symbols per channel use. The new codes have the least ML decoding complexity among all known codes for a large set of (N, R) pairs. The new full-rate codes of this paper (R = N) are not only information-lossless and fully diverse but also have the least known ML decoding complexity in the literature. For N ≥ 4, the new full-rate codes are the first instances of full-diversity, information-lossless STBCs with low ML decoding complexity. We also give a sufficient condition for STBCs obtainable from codes over F4 to have cubic shaping property, and a sufficient condition for any design to give rise to a full-diversity STBC when the symbols are encoded using rotated square QAM constellations.

Low ML Decoding Complexity STBCs via Codes Over the Klein Group

In this paper, we give a new framework for constructing low ML decoding complexity space-time block codes (STBCs) using codes over the Klein group K. Almost all known low ML decoding complexity STBCs can be obtained via this approach. New full- diversity STBCs with low ML decoding complexity and cubic shaping property are constructed, via codes over K, for number of transmit antennas N = 2(m), m >= 1, and rates R > 1 complex symbols per channel use. When R = N, the new STBCs are information- lossless as well. The new class of STBCs have the least knownML decoding complexity among all the codes available in the literature for a large set of (N, R) pairs.

Distributed Function Computation over Fields and Rings via Linear Compression of Sources

The setting considered in this paper is one of distributed function computation. More specifically, there is a collection of N sources possessing correlated information and a destination that would like to acquire a specific linear combination of the N sources. We address both the case when the common alphabet of the sources is a finite field and the case when it is a finite, commutative principal ideal ring with identity. The goal is to minimize the total amount of information needed to be transmitted by the N sources while enabling reliable recovery at the destination of the linear combination sought. One means of achieving this goal is for each of the sources to compress all the information it possesses and transmit this to the receiver. The Slepian-Wolf theorem of information theory governs the minimum rate at which each source must transmit while enabling all data to be reliably recovered at the receiver. However, recovering all the data at the destination is often wasteful of resources since the destination is only interested in computing a specific linear combination. An alternative explored here is one in which each source is compressed using a common linear mapping and then transmitted to the destination which then proceeds to use linearity to directly recover the needed linear combination. The article is part review and presents in part, new results. The portion of the paper that deals with finite fields is previously known material, while that dealing with rings is mostly new.Attempting to find the best linear map that will enable function computation forces us to consider the linear compression of source. While in the finite field case, it is known that a source can be linearly compressed down to its entropy, it turns out that the same does not hold in the case of rings. An explanation for this curious interplay between algebra and information theory is also provided in this paper.