Spatial reference of black capuchin monkeys in Brazilian Atlantic Forest: egocentric or allocentric?

Wild primates occupy large home ranges and travel long distances to reach goals. However, how primates are able to remember goal locations and travel efficiently is unclear. Few studies present consistent results regarding what reference system primates use to navigate, and what kind of spatial information they recognize. We analysed the pattern of navigation of one wild group of black capuchin monkeys, Cebus nigritus, at Atlantic Forest for 100 days in Carlos Botelho State Park (PECB), Brazil. We tested predictions based on the alternative hypotheses that black capuchin monkeys navigate using a sequence of landmarks as an egocentric reference system or an allocentric reference system, or both, depending on availability of food resources. The group location was recorded using a GPS device collecting coordinates at 5 min intervals, and route maps were generated using ArcView v9.3.1. The study group travelled through habitual routes during less than 30% of our study sample, and revisited resources from different starting points, using different paths and routes, even when prominent landmarks near feeding locations were not visible. The study group used habitual routes more frequently when high-quality foods were scarce, and navigated using different paths when revisiting food sources. Results support the hypothesis that black capuchin monkeys at PECB navigate using both egocentric and allocentric systems of reference, depending on the quality and distribution of the food resource they find. (C) 2010 The Association for the Study of Animal Behaviour. Published by Elsevier Ltd. All rights reserved.

Self-Organizing Maps of Molecular Descriptors for Sesquiterpene Lactones and Their Application to the Chemotaxonomy of the Asteraceae Family

The Asteraceae, one of the largest families among angiosperms, is chemically characterised by the production of sesquiterpene lactones (SLs). A total of 1,111 SLs, which were extracted from 658 species, 161 genera, 63 subtribes and 15 tribes of Asteraceae, were represented and registered in two dimensions in the SISTEMATX, an in-house software system, and were associated with their botanical sources. The respective 11 block of descriptors: Constitutional, Functional groups, BCUT, Atom-centred, 2D autocorrelations, Topological, Geometrical, RDF, 3D-MoRSE, GETAWAY and WHIM were used as input data to separate the botanical occurrences through self-organising maps. Maps that were generated with each descriptor divided the Asteraceae tribes, with total index values between 66.7% and 83.6%. The analysis of the results shows evident similarities among the Heliantheae, Helenieae and Eupatorieae tribes as well as between the Anthemideae and Inuleae tribes. Those observations are in agreement with systematic classifications that were proposed by Bremer, which use mainly morphological and molecular data, therefore chemical markers partially corroborate with these classifications. The results demonstrate that the atom-centred and RDF descriptors can be used as a tool for taxonomic classification in low hierarchical levels, such as tribes. Descriptors obtained through fragments or by the two-dimensional representation of the SL structures were sufficient to obtain significant results, and better results were not achieved by using descriptors derived from three-dimensional representations of SLs. Such models based on physico-chemical properties can project new design SLs, similar structures from literature or even unreported structures in two-dimensional chemical space. Therefore, the generated SOMs can predict the most probable tribe where a biologically active molecule can be found according Bremer classification.

Topology Verification for Isosurface Extraction

The broad goals of verifiable visualization rely on correct algorithmic implementations. We extend a framework for verification of isosurfacing implementations to check topological properties. Specifically, we use stratified Morse theory and digital topology to design algorithms which verify topological invariants. Our extended framework reveals unexpected behavior and coding mistakes in popular publicly available isosurface codes.

Lindelof spaces which are indestructible, productive, or D

We discuss relationships in Lindelof spaces among the properties "indestructible". "productive", "D", and related properties. (C) 2011 Elsevier B.V. All rights reserved.

Predicting epidemic outbreak from individual features of the spreaders

Knowing which individuals can be more efficient in spreading a pathogen throughout a determinate environment is a fundamental question in disease control. Indeed, over recent years the spread of epidemic diseases and its relationship with the topology of the involved system have been a recurrent topic in complex network theory, taking into account both network models and real-world data. In this paper we explore possible correlations between the heterogeneous spread of an epidemic disease governed by the susceptible-infected-recovered (SIR) model, and several attributes of the originating vertices, considering Erdos-Renyi (ER), Barabasi-Albert (BA) and random geometric graphs (RGG), as well as a real case study, the US air transportation network, which comprises the 500 busiest airports in the US along with inter-connections. Initially, the heterogeneity of the spreading is achieved by considering the RGG networks, in which we analytically derive an expression for the distribution of the spreading rates among the established contacts, by assuming that such rates decay exponentially with the distance that separates the individuals. Such a distribution is also considered for the ER and BA models, where we observe topological effects on the correlations. In the case of the airport network, the spreading rates are empirically defined, assumed to be directly proportional to the seat availability. Among both the theoretical and real networks considered, we observe a high correlation between the total epidemic prevalence and the degree, as well as the strength and the accessibility of the epidemic sources. For attributes such as the betweenness centrality and the k-shell index, however, the correlation depends on the topology considered.

Complex networks analysis of language complexity

Methods from statistical physics, such as those involving complex networks, have been increasingly used in the quantitative analysis of linguistic phenomena. In this paper, we represented pieces of text with different levels of simplification in co-occurrence networks and found that topological regularity correlated negatively with textual complexity. Furthermore, in less complex texts the distance between concepts, represented as nodes, tended to decrease. The complex networks metrics were treated with multivariate pattern recognition techniques, which allowed us to distinguish between original texts and their simplified versions. For each original text, two simplified versions were generated manually with increasing number of simplification operations. As expected, distinction was easier for the strongly simplified versions, where the most relevant metrics were node strength, shortest paths and diversity. Also, the discrimination of complex texts was improved with higher hierarchical network metrics, thus pointing to the usefulness of considering wider contexts around the concepts. Though the accuracy rate in the distinction was not as high as in methods using deep linguistic knowledge, the complex network approach is still useful for a rapid screening of texts whenever assessing complexity is essential to guarantee accessibility to readers with limited reading ability. Copyright (c) EPLA, 2012

Word sense disambiguation via high order of learning in complex networks

Complex networks have been employed to model many real systems and as a modeling tool in a myriad of applications. In this paper, we use the framework of complex networks to the problem of supervised classification in the word disambiguation task, which consists in deriving a function from the supervised (or labeled) training data of ambiguous words. Traditional supervised data classification takes into account only topological or physical features of the input data. On the other hand, the human (animal) brain performs both low- and high-level orders of learning and it has facility to identify patterns according to the semantic meaning of the input data. In this paper, we apply a hybrid technique which encompasses both types of learning in the field of word sense disambiguation and show that the high-level order of learning can really improve the accuracy rate of the model. This evidence serves to demonstrate that the internal structures formed by the words do present patterns that, generally, cannot be correctly unveiled by only traditional techniques. Finally, we exhibit the behavior of the model for different weights of the low- and high-level classifiers by plotting decision boundaries. This study helps one to better understand the effectiveness of the model. Copyright (C) EPLA, 2012

A simple criterion to predict the glass forming ability of metallic alloys

A new and simple criterion with which to quantitatively predict the glass forming ability (GFA) of metallic alloys is proposed. It was found that the critical cooling rate for glass formation (R-C) correlates well with a proper combination of two factors, the minimum topological instability (lambda(min)) and the Delta h parameter, which depends on the average work function difference (Delta phi) and the average electron density difference (Delta n(ws)(1/3)) among the constituent elements of the alloy. A correlation coefficient (R-2) of 0.76 was found between R-c and the new criterion for 68 alloys in 30 different metallic systems. The new criterion and the Uhlmann's approach were used to estimate the critical amorphous thickness (Z(C)) of alloys in the Cu-Zr system. The new criterion underestimated R-C in the Cu-Zr system, producing predicted Z(C) values larger than those observed experimentally. However, when considering a scale factor, a remarkable similarity was observed between the predicted and the experimental behavior of the GFA in the binary Cu-Zr. When using the same scale factor and performing the calculation for the ternary Zr-Cu-Al, good agreement was found between the predicted and the actual best GFA region, as well as between the expected and the observed critical amorphous thickness. (C) 2012 American Institute of Physics. [doi:10.1063/1.3676196]

Discriminating Different Classes of Biological Networks by Analyzing the Graphs Spectra Distribution

The brain's structural and functional systems, protein-protein interaction, and gene networks are examples of biological systems that share some features of complex networks, such as highly connected nodes, modularity, and small-world topology. Recent studies indicate that some pathologies present topological network alterations relative to norms seen in the general population. Therefore, methods to discriminate the processes that generate the different classes of networks (e. g., normal and disease) might be crucial for the diagnosis, prognosis, and treatment of the disease. It is known that several topological properties of a network (graph) can be described by the distribution of the spectrum of its adjacency matrix. Moreover, large networks generated by the same random process have the same spectrum distribution, allowing us to use it as a "fingerprint". Based on this relationship, we introduce and propose the entropy of a graph spectrum to measure the "uncertainty" of a random graph and the Kullback-Leibler and Jensen-Shannon divergences between graph spectra to compare networks. We also introduce general methods for model selection and network model parameter estimation, as well as a statistical procedure to test the nullity of divergence between two classes of complex networks. Finally, we demonstrate the usefulness of the proposed methods by applying them to (1) protein-protein interaction networks of different species and (2) on networks derived from children diagnosed with Attention Deficit Hyperactivity Disorder (ADHD) and typically developing children. We conclude that scale-free networks best describe all the protein-protein interactions. Also, we show that our proposed measures succeeded in the identification of topological changes in the network while other commonly used measures (number of edges, clustering coefficient, average path length) failed.

A countably compact free Abelian group of size continuum that admits a non-trivial convergent sequence

We show that it is consistent with ZFC that the free Abelian group of cardinality c admits a topological group topology that makes it countably compact with a non-trivial convergent sequence. (C) 2011 Elsevier B.V. All rights reserved.

Nonlocal Transport Near Charge Neutrality Point in a Two-Dimensional Electron-Hole System

Nonlocal resistance is studied in a two-dimensional system with a simultaneous presence of electrons and holes in a 20 nm HgTe quantum well. A large nonlocal electric response is found near the charge neutrality point in the presence of a perpendicular magnetic field. We attribute the observed nonlocality to the edge state transport via counterpropagating chiral modes similar to the quantum spin Hall effect at a zero magnetic field and graphene near a Landau filling factor nu = 0.

Almost p-compact groups

We show that if p is a selective ultrafilter, then for each cardinal alpha <= omega(1), there exists a topological group G such that G(beta) is almost p-compact (in particular, countably compact), for beta < alpha, but G(alpha) is not countably compact. If in addition, we assume Martin's Axiom, then the result above holds for every alpha < c. (C) 2012 Elsevier By. All rights reserved.

Continuity of Lyapunov functions and of energy level for generalized gradient semigroup

The global attractor of a gradient-like semigroup has a Morse decomposition. Associated to this Morse decomposition there is a Lyapunov function (differentiable along solutions)-defined on the whole phase space- which proves relevant information on the structure of the attractor. In this paper we prove the continuity of these Lyapunov functions under perturbation. On the other hand, the attractor of a gradient-like semigroup also has an energy level decomposition which is again a Morse decomposition but with a total order between any two components. We claim that, from a dynamical point of view, this is the optimal decomposition of a global attractor; that is, if we start from the finest Morse decomposition, the energy level decomposition is the coarsest Morse decomposition that still produces a Lyapunov function which gives the same information about the structure of the attractor. We also establish sufficient conditions which ensure the stability of this kind of decomposition under perturbation. In particular, if connections between different isolated invariant sets inside the attractor remain under perturbation, we show the continuity of the energy level Morse decomposition. The class of Morse-Smale systems illustrates our results.

Dirac fermions in strong electric field and quantum transport in graphene

Our previous results on the nonperturbative calculations of the mean current and of the energy-momentum tensor in QED with the T-constant electric field are generalized to arbitrary dimensions. The renormalized mean values are found, and the vacuum polarization contributions and particle creation contributions to these mean values are isolated in the large T limit; we also relate the vacuum polarization contributions to the one-loop effective Euler-Heisenberg Lagrangian. Peculiarities in odd dimensions are considered in detail. We adapt general results obtained in 2 + 1 dimensions to the conditions which are realized in the Dirac model for graphene. We study the quantum electronic and energy transport in the graphene at low carrier density and low temperatures when quantum interference effects are important. Our description of the quantum transport in the graphene is based on the so-called generalized Furry picture in QED where the strong external field is taken into account nonperturbatively; this approach is not restricted to a semiclassical approximation for carriers and does not use any statistical assumptions inherent in the Boltzmann transport theory. In addition, we consider the evolution of the mean electromagnetic field in the graphene, taking into account the backreaction of the matter field to the applied external field. We find solutions of the corresponding Dirac-Maxwell set of equations and with their help we calculate the effective mean electromagnetic field and effective mean values of the current and the energy-momentum tensor. The nonlinear and linear I-V characteristics experimentally observed in both low-and high-mobility graphene samples are quite well explained in the framework of the proposed approach, their peculiarities being essentially due to the carrier creation from the vacuum by the applied electric field. DOI: 10.1103/PhysRevD.86.125022

Differential calculus and integration of generalized functions over membranes

In this paper we continue the development of the differential calculus started in Aragona et al. (Monatsh. Math. 144: 13-29, 2005). Guided by the so-called sharp topology and the interpretation of Colombeau generalized functions as point functions on generalized point sets, we introduce the notion of membranes and extend the definition of integrals, given in Aragona et al. (Monatsh. Math. 144: 13-29, 2005), to integrals defined on membranes. We use this to prove a generalized version of the Cauchy formula and to obtain the Goursat Theorem for generalized holomorphic functions. A number of results from classical differential and integral calculus, like the inverse and implicit function theorems and Green's theorem, are transferred to the generalized setting. Further, we indicate that solution formulas for transport and wave equations with generalized initial data can be obtained as well.