Connectivity and dynamics of neuronal networks as defined by the shape of individual neurons

Biological neuronal networks constitute a special class of dynamical systems, as they are formed by individual geometrical components, namely the neurons. In the existing literature, relatively little attention has been given to the influence of neuron shape on the overall connectivity and dynamics of the emerging networks. The current work addresses this issue by considering simplified neuronal shapes consisting of circular regions (soma/axons) with spokes (dendrites). Networks are grown by placing these patterns randomly in the two-dimensional (2D) plane and establishing connections whenever a piece of dendrite falls inside an axon. Several topological and dynamical properties of the resulting graph are measured, including the degree distribution, clustering coefficients, symmetry of connections, size of the largest connected component, as well as three hierarchical measurements of the local topology. By varying the number of processes of the individual basic patterns, we can quantify relationships between the individual neuronal shape and the topological and dynamical features of the networks. Integrate-and-fire dynamics on these networks is also investigated with respect to transient activation from a source node, indicating that long-range connections play an important role in the propagation of avalanches.

4-{2-[4-(Dimethylamino)phenyl]ethylidene}benzonitrile

In the crystal of the title compound, C(17)H(16)N(2), molecules are linked by C-H center dot center dot center dot N hydrogen bonds, forming rings of graph-set motifs R(2)(1) (6) and R(2)(2) (10). The title molecule is close to planar, with a dihedral angle between the aromatic rings of 0.6 (1)degrees. Torsion angles confirm a conformational trans structure.

N-(4-chlorophenyl)maleimide

In the title compound, C10H6ClNO2, the dihedral angle between the benzene and maleimide rings is 47.54 (9)degrees. Molecules form centrosymmetric dimers through C-H center dot center dot center dot O hydrogen bonds, resulting in rings of graph- set motif R2 2(8) and chains in the [100] direction. Molecules are also linked by C-H center dot center dot center dot Cl hydrogen bonds along [001]. In this same direction, molecules are connected to other neighbouring molecules by C-H center dot center dot center dot O hydrogen bonds, forming edge- fused R-4(4)(24) rings.

On the k-restricted structure ratio in planar and outerplanar graphs

A planar k-restricted structure is a simple graph whose blocks are planar and each has at most k vertices. Planar k-restricted structures are used by approximation algorithms for Maximum Weight Planar Subgraph, which motivates this work. The planar k-restricted ratio is the infimum, over simple planar graphs H, of the ratio of the number of edges in a maximum k-restricted structure subgraph of H to the number edges of H. We prove that, as k tends to infinity, the planar k-restricted ratio tends to 1/2. The same result holds for the weighted version. Our results are based on analyzing the analogous ratios for outerplanar and weighted outerplanar graphs. Here both ratios tend to 1 as k goes to infinity, and we provide good estimates of the rates of convergence, showing that they differ in the weighted from the unweighted case.

An algorithmic Friedman-Pippenger theorem on tree embeddings and applications

An (n, d)-expander is a graph G = (V, E) such that for every X subset of V with vertical bar X vertical bar <= 2n - 2 we have vertical bar Gamma(G)(X) vertical bar >= (d + 1) vertical bar X vertical bar. A tree T is small if it has at most n vertices and has maximum degree at most d. Friedman and Pippenger (1987) proved that any ( n; d)- expander contains every small tree. However, their elegant proof does not seem to yield an efficient algorithm for obtaining the tree. In this paper, we give an alternative result that does admit a polynomial time algorithm for finding the immersion of any small tree in subgraphs G of (N, D, lambda)-graphs Lambda, as long as G contains a positive fraction of the edges of Lambda and lambda/D is small enough. In several applications of the Friedman-Pippenger theorem, including the ones in the original paper of those authors, the (n, d)-expander G is a subgraph of an (N, D, lambda)-graph as above. Therefore, our result suffices to provide efficient algorithms for such previously non-constructive applications. As an example, we discuss a recent result of Alon, Krivelevich, and Sudakov (2007) concerning embedding nearly spanning bounded degree trees, the proof of which makes use of the Friedman-Pippenger theorem. We shall also show a construction inspired on Wigderson-Zuckerman expander graphs for which any sufficiently dense subgraph contains all trees of sizes and maximum degrees achieving essentially optimal parameters. Our algorithmic approach is based on a reduction of the tree embedding problem to a certain on-line matching problem for bipartite graphs, solved by Aggarwal et al. (1996).

TESTING STATISTICAL HYPOTHESIS ON RANDOM TREES AND APPLICATIONS TO THE PROTEIN CLASSIFICATION PROBLEM

Efficient automatic protein classification is of central importance in genomic annotation. As an independent way to check the reliability of the classification, we propose a statistical approach to test if two sets of protein domain sequences coming from two families of the Pfam database are significantly different. We model protein sequences as realizations of Variable Length Markov Chains (VLMC) and we use the context trees as a signature of each protein family. Our approach is based on a Kolmogorov-Smirnov-type goodness-of-fit test proposed by Balding et at. [Limit theorems for sequences of random trees (2008), DOI: 10.1007/s11749-008-0092-z]. The test statistic is a supremum over the space of trees of a function of the two samples; its computation grows, in principle, exponentially fast with the maximal number of nodes of the potential trees. We show how to transform this problem into a max-flow over a related graph which can be solved using a Ford-Fulkerson algorithm in polynomial time on that number. We apply the test to 10 randomly chosen protein domain families from the seed of Pfam-A database (high quality, manually curated families). The test shows that the distributions of context trees coming from different families are significantly different. We emphasize that this is a novel mathematical approach to validate the automatic clustering of sequences in any context. We also study the performance of the test via simulations on Galton-Watson related processes.

Gibbs random graphs on point processes

Consider a discrete locally finite subset Gamma of R(d) and the cornplete graph (Gamma, E), with vertices Gamma and edges E. We consider Gibbs measures on the set of sub-graphs with vertices Gamma and edges E` subset of E. The Gibbs interaction acts between open edges having a vertex in common. We study percolation properties of the Gibbs distribution of the graph ensemble. The main results concern percolation properties of the open edges in two cases: (a) when Gamma is sampled from a homogeneous Poisson process; and (b) for a fixed Gamma with sufficiently sparse points. (c) 2010 American Institute of Physics. [doi:10.1063/1.3514605]

An oracle approach for interaction neighborhood estimation in random fields

We consider the problem of interaction neighborhood estimation from the partial observation of a finite number of realizations of a random field. We introduce a model selection rule to choose estimators of conditional probabilities among natural candidates. Our main result is an oracle inequality satisfied by the resulting estimator. We use then this selection rule in a two-step procedure to evaluate the interacting neighborhoods. The selection rule selects a small prior set of possible interacting points and a cutting step remove from this prior set the irrelevant points. We also prove that the Ising models satisfy the assumptions of the main theorems, without restrictions on the temperature, on the structure of the interacting graph or on the range of the interactions. It provides therefore a large class of applications for our results. We give a computationally efficient procedure in these models. We finally show the practical efficiency of our approach in a simulation study.

The Lobel-Komlos-Sos conjecture for trees of diameter 5 and for certain caterpillars

Loebl, Komlos, and Sos conjectured that if at least half the vertices of a graph G have degree at least some k is an element of N, then every tree with at most k edges is a subgraph of G. We prove the conjecture for all trees of diameter at most 5 and for a class of caterpillars. Our result implies a bound on the Ramsey number r( T, T') of trees T, T' from the above classes.

Method for cadmium and lead longitudinal profiles determination in hair by solid sampling graphite furnace atomic absorption spectrometry

This paper describes methods for the direct determination of Cd and Pb in hair segments (c.a. 5 mm similar to 80 mu g) by solid sampling graphite furnace atomic absorption spectrometry, becoming possible longitudinal profiles in a single strand of hair. To distinguish endogenous and exogenous content. strands of hair were washed by using two different procedures: IAEA protocol (acetone + water + acetone) and the combination of IAEA protocol with HCl washing (acetone + water + acetone + 0.1 mol l(-1) HCl). The concentration of Cd and Pb increased from the root Until the tip of hair washed according to IAEA protocol. However, when the strand of hair was washed using the combination of IAEA protocol and 0.1 mol l(-1) HCl, Cd concentrations decreased in all segments, and Pb concentrations decreased drastically near to the root (5 to 12 mm) and was systematically higher ill the end. The proposed method showed to be useful to assess the temporal variation to Cd and Pb exposure and call be Used for toxicological and environmental investigations. The limits of detection were 2.8 ng g(-1) for Cd and 40 ng g(-1) for Pb. The characteristic masses based oil integrated absorbance were 2.4 pg for Cd and 22 pg for Pb.

Morpholin-4-ium morpholine-4-carbodithioate

The title compound, C(4)H(10)NO(+)center dot C(5)H(8)NOS(2)(-), is built up of a morpholinium cation and a dithiocarbamate anion. In the crystal, two structurally independent formula units are linked via N-H center dot center dot center dot S hydrogen bonds, forming an inversion dimer, with graph-set motif R(4)(4)(12).

Política externa chilena e espectro ideológico político-partidário: um estudo sobre a Câmara dos Deputados (2002-2006)

The influence of political parties on decisions made by members of Congress is a hotly debated issue in political science. In foreign policy, which is usually considered nonpartisan, the matter is even more inconclusive. The current study analyzes all the roll-call votes taken on foreign policy issues in the 2002-2006 legislature of the Chilean Chamber of Deputies. After tracing a spatial map of foreign policy preferences among Chilean Deputies using the Nominate statistical package, we concluded that the ideology of the legislator's political party is a predictive factor for his or her foreign policy behavior. Our findings indicate that the way Chilean legislators structure their preferences on foreign policy issues does not differ significantly from the way they shape their domestic policy preferences.

Skewness, splitting number and vertex deletion of some toroidal meshes

The skewness sk(G) of a graph G = (V, E) is the smallest integer sk(G) >= 0 such that a planar graph can be obtained from G by the removal of sk(C) edges. The splitting number sp(G) of C is the smallest integer sp(G) >= 0 such that a planar graph can be obtained from G by sp(G) vertex splitting operations. The vertex deletion vd(G) of G is the smallest integer vd(G) >= 0 such that a planar graph can be obtained from G by the removal of vd(G) vertices. Regular toroidal meshes are popular topologies for the connection networks of SIMD parallel machines. The best known of these meshes is the rectangular toroidal mesh C(m) x C(n) for which is known the skewness, the splitting number and the vertex deletion. In this work we consider two related families: a triangulation Tc(m) x c(n) of C(m) x C(n) in the torus, and an hexagonal mesh Hc(m) x c(n), the dual of Tc(m) x c(n) in the torus. It is established that sp(Tc(m) x c(n)) = vd(Tc(m) x c(n) = sk(Hc(m) x c(n)) = sp(Hc(m) x c(n)) = vd(Hc(m) x c(n)) = min{m, n} and that sk(Tc(m) x c(n)) = 2 min {m, n}.

Influence of anabolic steroid treatment associated to physical exercise in the ultrasonic vocalization of rats

Unlike humans, who communicate in frequency bands between 250 Hz and 6 kHz, rats can communicate in frequencies above 18 kHz. Their vocalization types depend on the context and are normally associated to subjective or emotional states. It was reported significant vocal changes due to administration of replacement testosterone in a trained tenor singer with hypogonadism. Speech-Language Pathology clinical practices are being sought by singers who sporadically use anabolic steroids associated with physical exercise. They report difficulties in reaching and keeping high notes, ""breakage"" in the passage of musical notes and post singing vocal fatigue. Those abnormalities could be raised by the association of anabolic steroids and physical exercise. Thus, in order to verify if this association could promote vocal changes, maximum, minimum and fundamental frequencies and call duration in rats treated with anabolic steroids and physically trained (10 weeks duration) were evaluated. The vocalizations were obtained by handling the animals. At the end of that period, rats treated and trained showed significant decrease in call duration, but not in other parameters. The decrease in call duration could be associated to functional alterations in the vocal folds of treated and trained animals due to a synergism between anabolic steroids and physical training. (C) 2010 Acoustical Society of America. [DOI: 10.1121/1.3488350]

A novel electrocatalyst support with proton conductive properties for polymer electrolyte membrane fuel cell applications

The objective of this study is to graft the Surface of carbon black, by chemically introducing polymeric chains (Nafion (R) like) with proton-conducting properties. This procedure aims for a better interaction of the proton-conducting phase with the metallic catalyst particles, as well as hinders posterior support particle agglomeration. Also loss of active surface call be prevented. The proton conduction between the active electrocatalyst site and the Nafion (R) ionomer membrane should be enhanced, thus diminishing the ohmic drop ill the polymer electrolyte membrane fuel cell (PEMFC). PtRu nanoparticles were supported on different carbon materials by the impregnation method and direct reduction with ethylene glycol and characterized using amongst others FTIR, XRD and TEM. The screen printing technique was used to produce membrane electrode assemblies (MEA) for single cell tests in H(2)/air(PEMFC) and methanol operation (DMFC). In the PEMFC experiments, PtRu supported on grafted carbon shows 550 mW cm(-2) gmetal(-1) power density, which represents at least 78% improvement in performance, compared to the power density of commercial PtRu/C ETEK. The DMFC results of the grafted electrocatalyst achieve around 100% improvement. The polarization Curves results clearly show that the main Cause of the observed effect is the reduction in ohmic drop, caused by the grafted polymer. (C) 2009 Elsevier B.V. All rights reserved.