Scale-free network of a dengue epidemic

In this work we show that the dengue epidemic in the city of Singapore organized itself into a scale-free network of transmission as the 2000-2005 outbreaks progressed. This scale-free network of cluster comprised geographical breeding places for the aedes mosquitoes, acting as super-spreaders nodes in a network of transmission. The geographical organization of the network was analysed by the corresponding distribution of weekly number of new cases. Therefore, our hypothesis is that the distribution of dengue cases reflects the geographical organization of a transmission network, which evolved towards a power law as the epidemic intensity progressed until 2005. (c) 2007 Elsevier Inc. All rights reserved.

Dissemination of bla(KPC-2) by the Spread of Klebsiella pneumoniae Clonal Complex 258 Clones (ST258, ST11, ST437) and Plasmids (IncFII, IncN, IncL/M) among Enterobacteriaceae Species in Brazil

This article reports the spread of bla(KPC-2) in the Sao Paulo and Rio de Janeiro states, facilitated by globally spread K. pneumoniae clonal complex 258 (CC258) clones (ST258, ST11, and ST437) and a diversity of plasmids (IncFII, IncN, and IncL/M, two untypeable plasmids carrying Tn4401a or Tn4401b) successfully disseminated among species of the Enterobacteriaceae (Enterobacter cloacae, Serratia marcescens, and Citrobacter freundii). It also constitutes the first description of sequence type 258 (ST258) in Brazil, which was associated with a nosocomial hospital outbreak in Ribeirao Preto city.

Inhibitory network interactions shape the auditory processing of natural communication signals in the songbird auditory forebrain

The role of GABA in the central processing of complex auditory signals is not fully understood. We have studied the involvement of GABA(A)-mediated inhibition in the processing of birdsong, a learned vocal communication signal requiring intact hearing for its development and maintenance. We focused on caudomedial nidopallium (NCM), an area analogous to parts of the mammalian auditory cortex with selective responses to birdsong. We present evidence that GABA(A)-mediated inhibition plays a pronounced role in NCM`s auditory processing of birdsong. Using immunocytochemistry, we show that approximately half of NCM`s neurons are GABAergic. Whole cell patch-clamp recordings in a slice preparation demonstrate that, at rest, spontaneously active GABAergic synapses inhibit excitatory inputs onto NCM neurons via GABA(A) receptors. Multi-electrode electrophysiological recordings in awake birds show that local blockade of GABA(A)-mediated inhibition in NCM markedly affects the temporal pattern of song-evoked responses in NCM without modifications in frequency tuning. Surprisingly, this blockade increases the phasic and largely suppresses the tonic response component, reflecting dynamic relationships of inhibitory networks that could include disinhibition. Thus processing of learned natural communication sounds in songbirds, and possibly other vocal learners, may depend on complex interactions of inhibitory networks.

The role of predator overlap in the robustness and extinction of a four species predator-prey network

Predators and preys often form species networks with asymmetric patterns of interaction. We study the dynamics of a four species network consisting of two weakly connected predator-prey pairs. We focus our analysis on the effects of the cross interaction between the predator of the first pair and the prey of the second pair. This is an example where the predator overlap, which is the proportion of predators that a given prey shares with other preys, is not uniform across the network due to asymmetries in patterns of interaction. We explore the behavior of the system under different interaction strengths and study the dynamics of survival and extinction. In particular, we consider situations in which the four species have initial populations lower than their long-term equilibrium, simulating catastrophic situations in which their abundances are reduced due to human action or environmental change. We show that, under these reduced initial conditions, and depending on the strength of the cross interaction, the populations tend to oscillate before re-equilibrating, disturbing the community equilibrium and sometimes reaching values that are only a small fraction of the equilibrium population, potentially leading to their extinction. We predict that, contrary to one`s intuition, the most likely scenario is the extinction of the less predated preys. (C) 2010 Elsevier B.V. All rights reserved.

What makes a species central in a cleaning mutualism network?

Mutualisms often form networks of interacting species, characterized by the existence of a central core of species that potentially drive the ecology and the evolution of the whole community. Centrality measures allow quantification of how central or peripheral a species is within a network, thus informing about the role of each species in network organization, dynamics, and stability. In the present study we addressed the question whether the structural position of species in the network (i.e. their topological importance) relates to their ecological traits. We studied interactions between cleaner and client reef fishes to identify central and peripheral species within a mutualistic network, and investigated five ecological correlates. We used three measures to estimate the level of centrality of a species for distinct structural patterns, such as the number of interactions and the structural proximity to other species. Through the use of a principal component analysis (PCA) we observed that the centrality measures were highly correlated (92.5%) in the studied network, which indicates that the same species plays a similar role for the different structural patterns. Three cleaner and ten client species had positive values of centrality, which suggests that these species are modulating ecological and evolutionary dynamics within the network. Higher centralities were related to higher abundances and feeding habits for client fishes, but not for cleaners. The high correlation between centrality measures in the present study is likely related to the nested structure of the cleaning network. The cleaner species` set, by having central species that are not necessarily the most abundant ones, bears potentially more vulnerable points for network cohesiveness. Additionally, the present study generalizes previous findings for plant-animal mutualisms, as it shows that the structure of marine mutualisms is also related to a complex interplay between abundance and niche-related features.

Analysis of a hyper-diverse seed dispersal network: modularity and underlying mechanisms

Mutualistic interactions involving pollination and ant-plant mutualistic networks typically feature tightly linked species grouped in modules. However, such modularity is infrequent in seed dispersal networks, presumably because research on those networks predominantly includes a single taxonomic animal group (e.g. birds). Herein, for the first time, we examine the pattern of interaction in a network that includes multiple taxonomic groups of seed dispersers, and the mechanisms underlying modularity. We found that the network was nested and modular, with five distinguishable modules. Our examination of the mechanisms underlying such modularity showed that plant and animal trait values were associated with specific modules but phylogenetic effect was limited. Thus, the pattern of interaction in this network is only partially explained by shared evolutionary history. We conclude that the observed modularity emerged by a combination of phylogenetic history and trait convergence of phylogenetically unrelated species, shaped by interactions with particular types of dispersal agents.

Scalable model-based configuration management of security services in complex enterprise networks

Security administrators face the challenge of designing, deploying and maintaining a variety of configuration files related to security systems, especially in large-scale networks. These files have heterogeneous syntaxes and follow differing semantic concepts. Nevertheless, they are interdependent due to security services having to cooperate and their configuration to be consistent with each other, so that global security policies are completely and correctly enforced. To tackle this problem, our approach supports a comfortable definition of an abstract high-level security policy and provides an automated derivation of the desired configuration files. It is an extension of policy-based management and policy hierarchies, combining model-based management (MBM) with system modularization. MBM employs an object-oriented model of the managed system to obtain the details needed for automated policy refinement. The modularization into abstract subsystems (ASs) segment the system-and the model-into units which more closely encapsulate related system components and provide focused abstract views. As a result, scalability is achieved and even comprehensive IT systems can be modelled in a unified manner. The associated tool MoBaSeC (Model-Based-Service-Configuration) supports interactive graphical modelling, automated model analysis and policy refinement with the derivation of configuration files. We describe the MBM and AS approaches, outline the tool functions and exemplify their applications and results obtained. Copyright (C) 2010 John Wiley & Sons, Ltd.

A network of integrate and fire neurons for visual selection

Biological systems have facility to capture salient object(s) in a given scene, but it is still a difficult task to be accomplished by artificial vision systems. In this paper a visual selection mechanism based on the integrate and fire neural network is proposed. The model not only can discriminate objects in a given visual scene, but also can deliver focus of attention to the salient object. Moreover, it processes a combination of relevant features of an input scene, such as intensity, color, orientation, and the contrast of them. In comparison to other visual selection approaches, this model presents several interesting features. It is able to capture attention of objects in complex forms, including those linearly nonseparable. Moreover, computer simulations show that the model produces results similar to those observed in natural vision systems.

SZNAJD MODEL AND PROPORTIONAL ELECTIONS: THE ROLE OF THE TOPOLOGY OF THE NETWORK

The Sznajd model (SM) has been employed with success in the last years to describe opinion propagation in a community. In particular, it has been claimed that its transient is able to reproduce some scale properties observed in data of proportional elections, in different countries, if the community structure (the network) is scale-free. In this work, we investigate the properties of the transient of a particular version of the SM, introduced by Bernardes and co-authors in 2002. We studied the behavior of the model in networks of different topologies through the time evolution of an order parameter known as interface density, and concluded that regular lattices with high dimensionality also leads to a power-law distribution of the number of candidates with v votes. Also, we show that the particular absorbing state achieved in the stationary state (or else, the winner candidate), is related to a particular feature of the model, that may not be realistic in all situations.

Percolation in a network with long-range connections: Implications for cytoskeletal structure and function

Cell shape, signaling, and integrity depend on cytoskeletal organization. In this study we describe the cytoskeleton as a simple network of filamentary proteins (links) anchored by complex protein structures (nodes). The structure of this network is regulated by a distance-dependent probability of link formation as P = p/d(s), where p regulates the network density and s controls how fast the probability for link formation decays with node distance (d). It was previously shown that the regulation of the link lengths is crucial for the mechanical behavior of the cells. Here we examined the ability of the two-dimensional network to percolate (i.e. to have end-to-end connectivity), and found that the percolation threshold depends strongly on s. The system undergoes a transition around s = 2. The percolation threshold of networks with s < 2 decreases with increasing system size L, while the percolation threshold for networks with s > 2 converges to a finite value. We speculate that s < 2 may represent a condition in which cells can accommodate deformation while still preserving their mechanical integrity. Additionally, we measured the length distribution of F-actin filaments from publicly available images of a variety of cell types. In agreement with model predictions, cells originating from more deformable tissues show longer F-actin cytoskeletal filaments. (C) 2008 Elsevier B.V. All rights reserved.

MODELING THE EVOLUTION OF COMPLEX NETWORKS THROUGH THE PATH-STAR TRANSFORMATION AND OPTIMAL MULTIVARIATE METHODS

The topology of real-world complex networks, such as in transportation and communication, is always changing with time. Such changes can arise not only as a natural consequence of their growth, but also due to major modi. cations in their intrinsic organization. For instance, the network of transportation routes between cities and towns ( hence locations) of a given country undergo a major change with the progressive implementation of commercial air transportation. While the locations could be originally interconnected through highways ( paths, giving rise to geographical networks), transportation between those sites progressively shifted or was complemented by air transportation, with scale free characteristics. In the present work we introduce the path-star transformation ( in its uniform and preferential versions) as a means to model such network transformations where paths give rise to stars of connectivity. It is also shown, through optimal multivariate statistical methods (i.e. canonical projections and maximum likelihood classification) that while the US highways network adheres closely to a geographical network model, its path-star transformation yields a network whose topological properties closely resembles those of the respective airport transportation network.

Beyond the average: Detecting global singular nodes from local features in complex networks

Deviations from the average can provide valuable insights about the organization of natural systems. The present article extends this important principle to the systematic identification and analysis of singular motifs in complex networks. Six measurements quantifying different and complementary features of the connectivity around each node of a network were calculated, and multivariate statistical methods applied to identify singular nodes. The potential of the presented concepts and methodology was illustrated with respect to different types of complex real-world networks, namely the US air transportation network, the protein-protein interactions of the yeast Saccharomyces cerevisiae and the Roget thesaurus networks. The obtained singular motifs possessed unique functional roles in the networks. Three classic theoretical network models were also investigated, with the Barabasi-Albert model resulting in singular motifs corresponding to hubs, confirming the potential of the approach. Interestingly, the number of different types of singular node motifs as well as the number of their instances were found to be considerably higher in the real-world networks than in any of the benchmark networks. Copyright (C) EPLA, 2009

Border trees of complex networks

The comprehensive characterization of the structure of complex networks is essential to understand the dynamical processes which guide their evolution. The discovery of the scale-free distribution and the small-world properties of real networks were fundamental to stimulate more realistic models and to understand important dynamical processes related to network growth. However, the properties of the network borders (nodes with degree equal to 1), one of its most fragile parts, remained little investigated and understood. The border nodes may be involved in the evolution of structures such as geographical networks. Here we analyze the border trees of complex networks, which are defined as the subgraphs without cycles connected to the remainder of the network (containing cycles) and terminating into border nodes. In addition to describing an algorithm for identification of such tree subgraphs, we also consider how their topological properties can be quantified in terms of their depth and number of leaves. We investigate the properties of border trees for several theoretical models as well as real-world networks. Among the obtained results, we found that more than half of the nodes of some real-world networks belong to the border trees. A power-law with cut-off was observed for the distribution of the depth and number of leaves of the border trees. An analysis of the local role of the nodes in the border trees was also performed.

On the effects of geographical constraints on task execution in complex

In the present work, the effects of spatial constraints on the efficiency of task execution in systems underlain by geographical complex networks are investigated, where the probability of connection decreases with the distance between the nodes. The investigation considers several configurations of the parameters defining the network connectivity, and the Barabasi-Albert network model is also considered for comparisons. The results show that the effect of connectivity is significant only for shorter tasks, the locality of connection simplied by the spatial constraints reduces efficiency, and the addition of edges can improve the efficiency of the execution, although with increasing locality of the connections the improvement is small.

Complex networks analysis of manual and machine translations

Complex networks have been increasingly used in text analysis, including in connection with natural language processing tools, as important text features appear to be captured by the topology and dynamics of the networks. Following previous works that apply complex networks concepts to text quality measurement, summary evaluation, and author characterization, we now focus on machine translation (MT). In this paper we assess the possible representation of texts as complex networks to evaluate cross-linguistic issues inherent in manual and machine translation. We show that different quality translations generated by NIT tools can be distinguished from their manual counterparts by means of metrics such as in-(ID) and out-degrees (OD), clustering coefficient (CC), and shortest paths (SP). For instance, we demonstrate that the average OD in networks of automatic translations consistently exceeds the values obtained for manual ones, and that the CC values of source texts are not preserved for manual translations, but are for good automatic translations. This probably reflects the text rearrangements humans perform during manual translation. We envisage that such findings could lead to better NIT tools and automatic evaluation metrics.