Functional maps within a single neuron

Narayanan R, Johnston D. Functional maps within a single neuron. J Neurophysiol 108: 2343-2351, 2012. First published August 29, 2012; doi:10.1152/jn.00530.2012.-The presence and plasticity of dendritic ion channels are well established. However, the literature is divided on what specific roles these dendritic ion channels play in neuronal information processing, and there is no consensus on why neuronal dendrites should express diverse ion channels with different expression profiles. In this review, we present a case for viewing dendritic information processing through the lens of the sensory map literature, where functional gradients within neurons are considered as maps on the neuronal topograph. Under such a framework, drawing analogies from the sensory map literature, we postulate that the formation of intraneuronal functional maps is driven by the twin objectives of efficiently encoding inputs that impinge along different dendritic locations and of retaining homeostasis in the face of changes that are required in the coding process. In arriving at this postulate, we relate intraneuronal map physiology to the vast literature on sensory maps and argue that such a metaphorical association provides a fresh conceptual framework for analyzing and understanding single-neuron information encoding. We also describe instances where the metaphor presents specific directions for research on intraneuronal maps, derived from analogous pursuits in the sensory map literature. We suggest that this perspective offers a thesis for why neurons should express and alter ion channels in their dendrites and provides a framework under which active dendrites could be related to neural coding, learning theory, and homeostasis.

Monoclonal Antibodies against Hepatitis C Genotype 3a Virus Like Particle Inhibit Virus Entry in Cell Culture System

The envelope protein (E1-E2) of Hepatitis C virus (HCV) is a major component of the viral structure. The glycosylated envelope protein is considered to be important for initiation of infection by binding to cellular receptor(s) and also known as one of the major antigenic targets to host immune response. The present study was aimed at identifying mouse monoclonal antibodies which inhibit binding of virus like particles of HCV to target cells. The first step in this direction was to generate recombinant HCV-like particles (HCV-LPs) specific for genotypes 3a of HCV (prevalent in India) using the genes encoding core, E1 and E2 envelop proteins in a baculovirus expression system. The purified HCV-LPs were characterized by ELISA and electron microscopy and were used to generate monoclonal antibodies (mAbs) in mice. Two monoclonal antibodies (E8G9 and H1H10) specific for the E2 region of envelope protein of HCV genotype 3a, were found to reduce the virus binding to Huh7 cells. However, the mAbs generated against HCV genotype 1b (D2H3, G2C7, E1B11) were not so effective. More importantly, mAb E8G9 showed significant inhibition of the virus entry in HCV JFH1 cell culture system. Finally, the epitopic regions on E2 protein which bind to the mAbs have also been identified. Results suggest a new therapeutic strategy and provide the proof of concept that mAb against HCV-LP could be effective in preventing virus entry into liver cells to block HCV replication.

Decoherence suppression by parallelization

Decoherence as an obstacle in quantum computation is viewed as a struggle between two forces [1]: the computation which uses the exponential dimension of Hilbert space, and decoherence which destroys this entanglement by collapse. In this model of decohered quantum computation, a sequential quantum computer loses the battle, because at each time step, only a local operation is carried out but g*(t) number of gates collapse. With quantum circuits computing in parallel way the situation is different- g(t) number of gates can be applied at each time step and number gates collapse because of decoherence. As g(t) ≈ g*(t) competition here is even [1]. Our paper improves on this model by slowing down g*(t) by encoding the circuit in parallel computing architectures and running it in Single Instruction Multiple Data (SIMD) paradigm. We have proposed a parallel ion trap architecture for single-bit rotation of a qubit.

Generalized bidirectional multi-pair multi-antennawireless network coding

In this paper, we focus on increasing the throughput and diversity of network coded MIMO transmissions in bidirectional multi-pair wireless relay networks. All nodes have multi-antenna capability. Pairs of nodes want to exchange messages via a relay having multi-antenna and encoding/decoding capability. Nodes transmit their messages to the relay in the first (MAC) phase. The relay decodes all the messages and XORs them and broadcasts the XORed message in the second (BC) phase. We develop a generalized framework for bidirectional multi-pair multi-antenna wireless network coding, which models different MIMO transmission schemes including spatial multiplexing (V-BLAST), orthogonal STBC (OSTBC), and non-orthogonal STBC (NO-STBC) in a unified way. Enhanced throughputs are achieved by allowing all nodes to simultaneously transmit at their full rate. High diversity orders are achieved through the use of NO-STBCs, characterized by full rate and full transmit diversity. We evaluate and compare the performance of VBLAST, OSTBC, and NO-STBC schemes in one-dimensional 1-pair linear network (one pair of nodes and a relay) and two-dimensional 2-pair `cross' network (two pairs of nodes and a relay).

Biochemical characterization of C4 protein of cotton leaf curl Kokhran virus-Dabawali

Background: Cotton leaf curl Kokhran Virus-Dabawali (CLCuKV-Dab) is a monopartite begomovirus encoding two proteins V1 and V2 in the virion sense and four proteins Cl, C2, C3 and C4 in the complementary sense. The C4 protein of monopartite begomoviruses has been implicated to play a role in symptom determination and virus movement. The present work aims at the biochemical characterization of this protein. Methods: The C4 protein of CLCuKV-Dab was purified in fusion with GST and tested for the ability to hydrolyze ATP and other phosphate containing compounds. ATPase activity was assayed by using radiolabeled gamma-32P]-ATP and separating the product of reaction by thin layer chromatography. The hydrolysis of other compounds was monitored by the formation of a blue colored phosphomolybdate complex which was estimated by measuring the absorbance at 655 nm. Results: The purified GST-C4 protein exhibited metal ion dependent ATPase and inorganic pyrophosphatase activities. Deletion of a sequence resembling the catalytic motif present in phosphotyrosine phosphatases resulted in 70% reduction in both the activities. Mutational analysis suggested arginine 13 to be catalytically important for the ATPase and cysteine 8 for the pyrophosphatase activity of GST-C4. Interaction of V2 with GST-C4 resulted in an increase in both the enzymatic activities of GST-C4. Conclusions: The residues important for the enzymatic activities of GST-C4 are present in a motif different from the classical Walker motifs and the non-classical ATP binding motifs reported so far. General significance: The C4 protein of CLCuKV-Dab, a putative natively unfolded protein, exhibits enzymatic activities.

On the feasibility of network alignment for three-source three-destination Multiple Unicast networks with delays

A transform approach to network coding was in-troduced by Bavirisetti et al. (arXiv:1103.3882v3 [cs.IT]) as a tool to view wireline networks with delays as k-instantaneous networks (for some large k). When the local encoding kernels (LEKs) of the network are varied with every time block of length k >1, the network is said to use block time varying LEKs. In this work, we propose a Precoding Based Network Alignment (PBNA) scheme based on transform approach and block time varying LEKs for three-source three-destination multiple unicast network with delays (3-S3-D MUN-D). In a recent work, Menget al. (arXiv:1202.3405v1 [cs.IT]) reduced the infinite set of sufficient conditions for feasibility of PBNA in a three-source three-destination instantaneous multiple unicast network as given by Das et al. (arXiv:1008.0235v1 [cs.IT]) to a finite set and also showed that the conditions are necessary. We show that the conditions of Meng et al. are also necessary and sufficient conditions for feasibility of PBNA based on transform approach and block time varying LEKs for 3-S3-D MUN-D.

A transform approach to linear network coding for acyclic networks with delay

The algebraic formulation for linear network coding in acyclic networks with each link having an integer delay is well known. Based on this formulation, for a given set of connections over an arbitrary acyclic network with integer delay assumed for the links, the output symbols at the sink nodes at any given time instant is a Fq-linear combination of the input symbols across different generations, where Fq denotes the field over which the network operates. We use finite-field discrete Fourier transform (DFT) to convert the output symbols at the sink nodes at any given time instant into a Fq-linear combination of the input symbols generated during the same generation. We call this as transforming the acyclic network with delay into n-instantaneous networks (n is sufficiently large). We show that under certain conditions, there exists a network code satisfying sink demands in the usual (non-transform) approach if and only if there exists a network code satisfying sink demands in the transform approach. Furthermore, assuming time invariant local encoding kernels, we show that the transform method can be employed to achieve half the rate corresponding to the individual source-destination mincut (which are assumed to be equal to 1) for some classes of three-source three-destination multiple unicast network with delays using alignment strategies when the zero-interference condition is not satisfied.

Burst error correction using partial fourier matrices and block sparse representation

There is a strong relation between sparse signal recovery and error control coding. It is known that burst errors are block sparse in nature. So, here we attempt to solve burst error correction problem using block sparse signal recovery methods. We construct partial Fourier based encoding and decoding matrices using results on difference sets. These constructions offer guaranteed and efficient error correction when used in conjunction with reconstruction algorithms which exploit block sparsity.

Optical microscopy methods for understanding learning and memory

Structural dynamics of dendritic spines is one of the key correlative measures of synaptic plasticity for encoding short-term and long-term memory. Optical studies of structural changes in brain tissue using confocal microscopy face difficulties of scattering. This results in low signal-to-noise ratio and thus limiting the imaging depth to few tens of microns. Multiphoton microscopy (MpM) overcomes this limitation by using low-energy photons to cause localized excitation and achieve high resolution in all three dimensions. Multiple low-energy photons with longer wavelengths minimize scattering and allow access to deeper brain regions at several hundred microns. In this article, we provide a basic understanding of the physical phenomena that give MpM an edge over conventional microscopy. Further, we highlight a few of the key studies in the field of learning and memory which would not have been possible without the advent of MpM.

Inactivation of the Bacterial RNA Polymerase Due to Acquisition of Secondary Structure by the omega Subunit

The widely conserved omega subunit encoded by rpoZ is the smallest subunit of Escherichia coli RNA polymerase (RNAP) but is dispensable for bacterial growth. Function of omega is known to be substituted by GroEL in omega-null strain, which thus does not exhibit a discernable phenotype. In this work, we report isolation of omega variants whose expression in vivo leads to a dominant lethal phenotype. Studies show that in contrast to omega, which is largely unstructured, omega mutants display substantial acquisition of secondary structure. By detailed study with one of the mutants, omega(6) bearing N60D substitution, the mechanism of lethality has been deciphered. Biochemical analysis reveals that omega(6) binds to beta ` subunit in vitro with greater affinity than that of omega. The reconstituted RNAP holoenzyme in the presence of omega(6) in vitro is defective in transcription initiation. Formation of a faulty RNAP in the presence of mutant omega results in death of the cell. Furthermore, lethality of omega(6) is relieved in cells expressing the rpoC2112 allele encoding beta ` (2112), a variant beta ` bearing Y457S substitution, immediately adjacent to the beta ` catalytic center. Our results suggest that the enhanced omega(6)-beta ` interaction may perturb the plasticity of the RNAP active center, implicating a role for omega and its flexible state.

How Many Initiator tRNA Genes Does Escherichia coli Need?

Multiple copies of a gene require enhanced investment on the part of the cell and, as such, call for an explanation. The observation that Escherichia coli has four copies of initiator tRNA (tRNA(i)) genes, encoding a special tRNA (tRNA(fMet)) required to start protein synthesis, is puzzling particularly because the cell appears to be unaffected by the removal of one copy. However, the fitness of an organism has both absolute and relative connotations. Thus, we carried out growth competition experiments between E. coli strains that differ in the number of tRNA(i) genes they contain. This has enabled us to uncover an unexpected link between the number of tRNA(i) genes and protein synthesis, nutritional status, and fitness. Wild-type strains with the canonical four tRNA(i) genes are favored in nutrient-rich environments, and those carrying fewer are favored in nutrient-poor environments. Auxotrophs behave as if they have a nutritionally poor internal environment. A heuristic model that links tRNA(i) gene copy number, genetic stress, and growth rate accounts for the findings. Our observations provide strong evidence that natural selection can work through seemingly minor quantitative variations in gene copy number and thereby impact organismal fitness.

Precoding-Based Network Alignment Using Transform Approach for Acyclic Networks With Delay

The algebraic formulation for linear network coding in acyclic networks with the links having integer delay is well known. Based on this formulation, for a given set of connections over an arbitrary acyclic network with integer delay assumed for the links, the output symbols at the sink nodes, at any given time instant, is a F(p)m-linear combination of the input symbols across different generations, where F(p)m denotes the field over which the network operates (p is prime and m is a positive integer). We use finite-field discrete Fourier transform to convert the output symbols at the sink nodes, at any given time instant, into a F(p)m-linear combination of the input symbols generated during the same generation without making use of memory at the intermediate nodes. We call this as transforming the acyclic network with delay into n-instantaneous networks (n is sufficiently large). We show that under certain conditions, there exists a network code satisfying sink demands in the usual (nontransform) approach if and only if there exists a network code satisfying sink demands in the transform approach. When the zero-interference conditions are not satisfied, we propose three precoding-based network alignment (PBNA) schemes for three-source three-destination multiple unicast network with delays (3-S 3-D MUN-D) termed as PBNA using transform approach and time-invariant local encoding coefficients (LECs), PBNA using time-varying LECs, and PBNA using transform approach and block time-varying LECs. We derive sets of necessary and sufficient conditions under which throughputs close to n' + 1/2n' + 1, n'/2n' + 1, and n'/2n' + 1 are achieved for the three source-destination pairs in a 3-S 3-D MUN-D employing PBNA using transform approach and time-invariant LECs, and PBNA using transform approach and block time-varying LECs, where n' is a positive integer. For PBNA using time-varying LECs, we obtain a sufficient condition under which a throughput demand of n(1)/n, n(2)/n, and n(3)/n can be met for the three source-destination pairs in a 3-S 3-D MUN-D, where n(1), n(2), and n(3) are positive integers less than or equal to the positive integer n. This condition is also necessary when n(1) + n(3) = n(1) + n(2) = n where n(1) >= n(2) >= n(3).

Use of Exocentric and Egocentric Representations in the Concurrent Planning of Sequential Saccades

The concurrent planning of sequential saccades offers a simple model to study the nature of visuomotor transformations since the second saccade vector needs to be remapped to foveate the second target following the first saccade. Remapping is thought to occur through egocentric mechanisms involving an efference copy of the first saccade that is available around the time of its onset. In contrast, an exocentric representation of the second target relative to the first target, if available, can be used to directly code the second saccade vector. While human volunteers performed a modified double-step task, we examined the role of exocentric encoding in concurrent saccade planning by shifting the first target location well before the efference copy could be used by the oculomotor system. The impact of the first target shift on concurrent processing was tested by examining the end-points of second saccades following a shift of the second target during the first saccade. The frequency of second saccades to the old versus new location of the second target, as well as the propagation of first saccade localization errors, both indices of concurrent processing, were found to be significantly reduced in trials with the first target shift compared to those without it. A similar decrease in concurrent processing was obtained when we shifted the first target but kept constant the second saccade vector. Overall, these results suggest that the brain can use relatively stable visual landmarks, independent of efference copy-based egocentric mechanisms, for concurrent planning of sequential saccades.

History of MRI

A brief account of the basic principle and methodologies of MRI technique, right from its beginning, are outlined. The final pulse sequence used for MRI using Fourier Imaging (phase encoding), Echo-Planar Imaging (EPI) for detection of a whole plane in a single excitation and T-1 and T-2 contrast enhancement is explained. The various associated methods such as, MR-spectroscopy, flow measurement (MRI-angiography), Lung-imaging using hyperpolarized Xe-129 and He-3 and functional imaging (f-MRI) are described.

Do gamma oscillations play a role in cerebral cortex?

Gamma rhythm (which has a center frequency between 30 and 80 Hz) is modulated by cognitive mechanisms such as attention and memory, and has been hypothesized to play a role in mediating these processes by supporting communication channels between cortical areas or encoding information in its phase. We highlight several issues related to gamma rhythms, such as low and inconsistent power, its dependence on low-level stimulus features, problems due to conduction delays, and contamination due to spike-related activity that makes accurate estimation of gamma phase difficult. Gamma rhythm could be a potentially useful signature of excitation-inhibition interactions in the brain, but whether it also provides a mechanism for information processing or coding remains an open question.