General anesthesia reduces complexity and temporal asymmetry of the informational structures derived from neural recordings in Drosophila

We apply techniques from the field of computational mechanics to evaluate the statistical complexity of neural recording data from fruit flies. First, we connect statistical complexity to the flies' level of conscious arousal, which is manipulated by general anesthesia (isoflurane). We show that the complexity of even single channel time series data decreases under anesthesia. The observed difference in complexity between the two states of conscious arousal increases as higher orders of temporal correlations are taken into account. We then go on to show that, in addition to reducing complexity, anesthesia also modulates the informational structure between the forward- and reverse-time neural signals. Specifically, using three distinct notions of temporal asymmetry we show that anesthesia reduces temporal asymmetry on information-theoretic and information-geometric grounds. In contrast to prior work, our results show that: (1) Complexity differences can emerge at very short timescales and across broad regions of the fly brain, thus heralding the macroscopic state of anesthesia in a previously unforeseen manner, and (2) that general anesthesia also modulates the temporal asymmetry of neural signals. Together, our results demonstrate that anesthetized brains become both less structured and more reversible.Comment: 14 pages, 6 figures. Comments welcome; Added time-reversal analysis, updated discussion, new figures (Fig. 5 & Fig. 6) and Tables (Tab. 1

Gi- and Gs-coupled GPCRs show different modes of G-protein binding.

More than two decades ago, the activation mechanism for the membrane-bound photoreceptor and prototypical G protein-coupled receptor (GPCR) rhodopsin was uncovered. Upon light-induced changes in ligand-receptor interaction, movement of specific transmembrane helices within the receptor opens a crevice at the cytoplasmic surface, allowing for coupling of heterotrimeric guanine nucleotide-binding proteins (G proteins). The general features of this activation mechanism are conserved across the GPCR superfamily. Nevertheless, GPCRs have selectivity for distinct G-protein family members, but the mechanism of selectivity remains elusive. Structures of GPCRs in complex with the stimulatory G protein, Gs, and an accessory nanobody to stabilize the complex have been reported, providing information on the intermolecular interactions. However, to reveal the structural selectivity filters, it will be necessary to determine GPCR-G protein structures involving other G-protein subtypes. In addition, it is important to obtain structures in the absence of a nanobody that may influence the structure. Here, we present a model for a rhodopsin-G protein complex derived from intermolecular distance constraints between the activated receptor and the inhibitory G protein, Gi, using electron paramagnetic resonance spectroscopy and spin-labeling methodologies. Molecular dynamics simulations demonstrated the overall stability of the modeled complex. In the rhodopsin-Gi complex, Gi engages rhodopsin in a manner distinct from previous GPCR-Gs structures, providing insight into specificity determinants

Large-Scale Distributed Bayesian Matrix Factorization using Stochastic Gradient MCMC

Despite having various attractive qualities such as high prediction accuracy and the ability to quantify uncertainty and avoid over-fitting, Bayesian Matrix Factorization has not been widely adopted because of the prohibitive cost of inference. In this paper, we propose a scalable distributed Bayesian matrix factorization algorithm using stochastic gradient MCMC. Our algorithm, based on Distributed Stochastic Gradient Langevin Dynamics, can not only match the prediction accuracy of standard MCMC methods like Gibbs sampling, but at the same time is as fast and simple as stochastic gradient descent. In our experiments, we show that our algorithm can achieve the same level of prediction accuracy as Gibbs sampling an order of magnitude faster. We also show that our method reduces the prediction error as fast as distributed stochastic gradient descent, achieving a 4.1% improvement in RMSE for the Netflix dataset and an 1.8% for the Yahoo music dataset

Stochastic Vehicle Routing with Recourse

We study the classic Vehicle Routing Problem in the setting of stochastic optimization with recourse. StochVRP is a two-stage optimization problem, where demand is satisfied using two routes: fixed and recourse. The fixed route is computed using only a demand distribution. Then after observing the demand instantiations, a recourse route is computed -- but costs here become more expensive by a factor lambda. We present an O(log^2 n log(n lambda))-approximation algorithm for this stochastic routing problem, under arbitrary distributions. The main idea in this result is relating StochVRP to a special case of submodular orienteering, called knapsack rank-function orienteering. We also give a better approximation ratio for knapsack rank-function orienteering than what follows from prior work. Finally, we provide a Unique Games Conjecture based omega(1) hardness of approximation for StochVRP, even on star-like metrics on which our algorithm achieves a logarithmic approximation.Comment: 20 Pages, 1 figure Revision corrects the statement and proof of Theorem 1.

Coulomb Drag of Edge Excitations in the Chern-Simons Theory of the Fractional Quantum Hall Effect

Long range Coulomb interaction between the edges of a Hall bar changes the nature of the gapless edge excitations. Instead of independent modes propagating in opposite directions on each edge as expected for a short range interaction one finds elementary excitations living simultaneously on both edges, i.e. composed of correlated density waves propagating in the same direction on opposite edges. We discuss the microscopic features of this Coulomb drag of excitations in the fractional quantum Hall regime within the framework of the bosonic Chern-Simons Landau-Ginzburg theory. The dispersion law of these novel excitations is non linear and depends on the distance between the edges as well as on the current that flows through the sample. The latter dependence indicates a possibility of parametric excitation of these modes. The bulk distributions of the density and currents of the edge excitations differ significantly for short and long range interactions.Comment: 11 pages, REVTEX, 2 uuencoded postscript figure

On the Current Carried by `Neutral' Quasiparticles

The current should be proportional to the momentum in a Galilean-invariant system of particles of fixed charge-to-mass ratio, such as an electron liquid in jellium. However, strongly-interacting electron systems can have phases characterized by broken symmetry or fractionalization. Such phases can have neutral excitations which can presumably carry momentum but not current. In this paper, we show that there is no contradiction: `neutral' excitations {\em do} carry current in a Galilean-invariant system of particles of fixed charge-to-mass ratio. This is explicitly demonstrated in the context of spin waves, the Bogoliubov-de Gennes quasiparticles of a superconductor, the one-dimensional electron gas, and spin-charge separated systems in 2+1 dimensions. We discuss the implications for more realistic systems, which are not Galilean-invariant

From the Chern-Simons theory for the fractional quantum Hall effect to the Luttinger model of its edges

The chiral Luttinger model for the edges of the fractional quantum Hall effect is obtained as the low energy limit of the Chern-Simons theory for the two dimensional system. In particular we recover the Kac-Moody algebra for the creation and annihilation operators of the edge density waves and the bosonization formula for the electronic operator at the edge.Comment: 4 pages, LaTeX, 1 Postscript figure include

An intuitionistic approach to scoring DNA sequences against transcription factor binding site motifs

Background: Transcription factors (TFs) control transcription by binding to specific regions of DNA called transcription factor binding sites (TFBSs). The identification of TFBSs is a crucial problem in computational biology and includes the subtask of predicting the location of known TFBS motifs in a given DNA sequence. It has previously been shown that, when scoring matches to known TFBS motifs, interdependencies between positions within a motif should be taken into account. However, this remains a challenging task owing to the fact that sequences similar to those of known TFBSs can occur by chance with a relatively high frequency. Here we present a new method for matching sequences to TFBS motifs based on intuitionistic fuzzy sets (IFS) theory, an approach that has been shown to be particularly appropriate for tackling problems that embody a high degree of uncertainty. Results: We propose SCintuit, a new scoring method for measuring sequence-motif affinity based on IFS theory. Unlike existing methods that consider dependencies between positions, SCintuit is designed to prevent overestimation of less conserved positions of TFBSs. For a given pair of bases, SCintuit is computed not only as a function of their combined probability of occurrence, but also taking into account the individual importance of each single base at its corresponding position. We used SCintuit to identify known TFBSs in DNA sequences. Our method provides excellent results when dealing with both synthetic and real data, outperforming the sensitivity and the specificity of two existing methods in all the experiments we performed. Conclusions: The results show that SCintuit improves the prediction quality for TFs of the existing approaches without compromising sensitivity. In addition, we show how SCintuit can be successfully applied to real research problems. In this study the reliability of the IFS theory for motif discovery tasks is proven