A vaccination game based on public health actions and personal decisions

Susceptible-infective-removed (SIR) models are commonly used for representing the spread of contagious diseases. A SIR model can be described in terms of a probabilistic cellular automaton (PCA), where each individual (corresponding to a cell of the PCA lattice) is connected to others by a random network favoring local contacts. Here, this framework is employed for investigating the consequences of applying vaccine against the propagation of a contagious infection, by considering vaccination as a game, in the sense of game theory. In this game, the players are the government and the susceptible newborns. In order to maximize their own payoffs, the government attempts to reduce the costs for combating the epidemic, and the newborns may be vaccinated only when infective individuals are found in their neighborhoods and/or the government promotes an immunization program. As a consequence of these strategies supported by cost-benefit analysis and perceived risk, numerical simulations show that the disease is not fully eliminated and the government implements quasi-periodic vaccination campaigns. (C) 2011 Elsevier B.V. All rights reserved.

Bone Deposition, Bone Resorption, and Osteosarcoma

Bone deposition and bone resorption are ongoing dynamic processes, constituting bone remodeling. Some bone tumors, such as osteosarcoma (OS), stimulate focal bone deposition. OS is the most common primary bone tumor in children and young adults. A complex network of genes regulates bone remodeling and alterations in its expression levels can influence the genesis and progression of bone diseases, including OS. We hypothesized that the expression profiles of bone remodeling regulator genes would be correlated with OS biology and clinical features. We used real-time PCR to evaluate the mRNA levels of the tartrate-resistant acid phosphatase (ACP5), colony stimulating factor-1 (CSF1R), bone morphogenetic protein 7 (BMP7), collagen, type XI, alpha 2 (COL11A2), and protein tyrosine phosphatases zeta 1 (PTPRZ1) genes, in 30 OS tumor samples and correlated with clinical and histological data. All genes analyzed, except CSF1R, were differentially expressed when compared with normal bone expression profiles. In our results, OS patients with high levels of COL11A2 mRNA showed worse overall (p = 0.041) and event free survival (p = 0.037). Also, a trend for better overall survival was observed in patients with samples showing higher expression of BMP7 (p =0.067). COL11A2 overexpression and BMP7 underexpression could collaborate to OS tumor growth, through its central role in bone remodeling process. (C) 2010 Orthopaedic Research Society. Published by Wiley Periodicals, Inc. J Orthop Res 28:1142-1148, 2010

Development of human minor salivary glands: expression of mucins according to stage of morphogenesis

The formation of salivary glands entails the proliferation of epithelial cells from the stomatodeum into the underlying ectomesenchyme, culminating in a complex network of ducts and acinar bulbs. The extent to which mucins regulate this process is unknown, but they appear to mediate luminal space formation and maturation. Our aim was to examine mucin expression patterns during the morphogenesis of human salivary glands. Mucin expression - MUC1, 2, 3, 4, 5AC, 5B, 6, and 16 - was analyzed in specimens of developing human salivary glands, obtained from fetuses at 4-24 weeks` gestation, and fully developed salivary glands by immunohistochemistry. Expression patterns were analyzed qualitatively according to the development stage of the salivary glands. Mucins 1, 3, 4, 5B, and 16 were expressed during salivary gland development - being stronger in all ductal segments by the final phases of branching morphogenesis and in mature glands. Acinar cells were negative for most mucins, including MUC1 in mature salivary glands. Mucins 2, 5AC, and 6 were not expressed. Mucins MUC1, 3, 4, 5B, and 16 are expressed in developing human salivary glands and in mature glands, suggesting important roles in the maturation and maintenance of the ductal network.

SEM and Neurohistological Observations of Nerve Endings in the Middle Region of the Tongue of the Collared Peccary (Tayassu tajacu): A Silver Impregnation Method

The presence of lingual papillae and the nerve endings in the middle region of the tongue mucosa of collared peccary (Tayassu tajacu) were studied using scanning electron microscopy and light microscopy, based upon the silver impregnation method. The middle region of tongue mucosa revealed numerous filiform and fungiform papillae. The thick epithelial layer showed epithelial cells and a dense connective tissue layer containing nerve fibre bundles and capillaries. The sensory nerve endings, intensely stained by silver impregnation, were usually non-encapsulated and extended into the connective tissue of the filiform and fungiform papillae very close to the epithelial cells. In some regions, the sensory nerves fibres formed a dense and complex network of fine fibrils. The presence of these nerve fibrils may characterize the mechanisms of transmission of sensitive impulses to the tongue mucosa.

The web of connections between tourism companies: Structure and dynamics

Tourism destination networks are amongst the most complex dynamical systems, involving a myriad of human-made and natural resources. In this work we report a complex network-based systematic analysis of the Elba (Italy) tourism destination network, including the characterization of its structure in terms of several traditional measurements, the investigation of its modularity, as well as its comprehensive study in terms of the recently reported superedges approach. In particular, structural (the number of paths of distinct lengths between pairs of nodes, as well as the number of reachable companies) and dynamical features (transition probabilities and the inward/outward activations and accessibilities) are measured and analyzed, leading to a series of important findings related to the interactions between tourism companies. Among the several reported results, it is shown that the type and size of the Companies influence strongly their respective activations and accessibilities, while their geographical position does not seem to matter. It is also shown that the Elba tourism network is largely fragmented and heterogeneous, so that it could benefit from increased integration. (C) 2009 Elsevier B.V. All rights reserved.

Investigating relationships within and between category networks in Wikipedia

This work maps and analyses cross-citations in the areas of Biology, Mathematics, Physics and Medicine in the English version of Wikipedia, which are represented as an undirected complex network where the entries correspond to nodes and the citations among the entries are mapped as edges. We found a high value of clustering coefficient for the areas of Biology and Medicine, and a small value for Mathematics and Physics. The topological organization is also different for each network, including a modular structure for Biology and Medicine, a sparse structure for Mathematics and a dense core for Physics. The networks have degree distributions that can be approximated by a power-law with a cut-off. The assortativity of the isolated networks has also been investigated and the results indicate distinct patterns for each subject. We estimated the betweenness centrality of each node considering the full Wikipedia network, which contains the nodes of the four subjects and the edges between them. In addition, the average shortest path length between the subjects revealed a close relationship between the subjects of Biology and Physics, and also between Medicine and Physics. Our results indicate that the analysis of the full Wikipedia network cannot predict the behavior of the isolated categories since their properties can be very different from those observed in the full network. (C) 2011 Elsevier Ltd. All rights reserved.

Modularity and robustness of bone networks

Cortical bones, essential for mechanical support and structure in many animals, involve a large number of canals organized in intricate fashion. By using state-of-the art image analysis and computer graphics, the 3D reconstruction of a whole bone (phalange) of a young chicken was obtained and represented in terms of a complex network where each canal was associated to an edge and every confluence of three or more canals yielded a respective node. The representation of the bone canal structure as a complex network has allowed several methods to be applied in order to characterize and analyze the canal system organization and the robustness. First, the distribution of the node degrees (i.e. the number of canals connected to each node) confirmed previous indications that bone canal networks follow a power law, and therefore present some highly connected nodes (hubs). The bone network was also found to be partitioned into communities or modules, i.e. groups of nodes which are more intensely connected to one another than with the rest of the network. We verified that each community exhibited distinct topological properties that are possibly linked with their specific function. In order to better understand the organization of the bone network, its resilience to two types of failures (random attack and cascaded failures) was also quantified comparatively to randomized and regular counterparts. The results indicate that the modular structure improves the robustness of the bone network when compared to a regular network with the same average degree and number of nodes. The effects of disease processes (e. g., osteoporosis) and mutations in genes (e.g., BMP4) that occur at the molecular level can now be investigated at the mesoscopic level by using network based approaches.

How complex a dynamical network can be?

Positive Lyapunov exponents measure the asymptotic exponential divergence of nearby trajectories of a dynamical system. Not only they quantify how chaotic a dynamical system is, but since their sum is an upper bound for the rate of information production, they also provide a convenient way to quantify the complexity of a dynamical network. We conjecture based on numerical evidences that for a large class of dynamical networks composed by equal nodes, the sum of the positive Lyapunov exponents is bounded by the sum of all the positive Lyapunov exponents of both the synchronization manifold and its transversal directions, the last quantity being in principle easier to compute than the latter. As applications of our conjecture we: (i) show that a dynamical network composed of equal nodes and whose nodes are fully linearly connected produces more information than similar networks but whose nodes are connected with any other possible connecting topology; (ii) show how one can calculate upper bounds for the information production of realistic networks whose nodes have parameter mismatches, randomly chosen: (iii) discuss how to predict the behavior of a large dynamical network by knowing the information provided by a system composed of only two coupled nodes. (C) 2011 Elsevier B.V. All rights reserved.

Finding Quasi-Optimal Network Topologies for Information Transmission in Active Networks

This work clarifies the relation between network circuit (topology) and behaviour (information transmission and synchronization) in active networks, e.g. neural networks. As an application, we show how one can find network topologies that are able to transmit a large amount of information, possess a large number of communication channels, and are robust under large variations of the network coupling configuration. This theoretical approach is general and does not depend on the particular dynamic of the elements forming the network, since the network topology can be determined by finding a Laplacian matrix (the matrix that describes the connections and the coupling strengths among the elements) whose eigenvalues satisfy some special conditions. To illustrate our ideas and theoretical approaches, we use neural networks of electrically connected chaotic Hindmarsh-Rose neurons.

Network of recurrent events for the Olami-Feder-Christensen model

We numerically study the dynamics of a discrete spring-block model introduced by Olami, Feder, and Christensen (OFC) to mimic earthquakes and investigate to what extent this simple model is able to reproduce the observed spatiotemporal clustering of seismicity. Following a recently proposed method to characterize such clustering by networks of recurrent events [J. Davidsen, P. Grassberger, and M. Paczuski, Geophys. Res. Lett. 33, L11304 (2006)], we find that for synthetic catalogs generated by the OFC model these networks have many nontrivial statistical properties. This includes characteristic degree distributions, very similar to what has been observed for real seismicity. There are, however, also significant differences between the OFC model and earthquake catalogs, indicating that this simple model is insufficient to account for certain aspects of the spatiotemporal clustering of seismicity.

Automatic Network Fingerprinting through Single-Node Motifs

Complex networks have been characterised by their specific connectivity patterns (network motifs), but their building blocks can also be identified and described by node-motifs-a combination of local network features. One technique to identify single node-motifs has been presented by Costa et al. (L. D. F. Costa, F. A. Rodrigues, C. C. Hilgetag, and M. Kaiser, Europhys. Lett., 87, 1, 2009). Here, we first suggest improvements to the method including how its parameters can be determined automatically. Such automatic routines make high-throughput studies of many networks feasible. Second, the new routines are validated in different network-series. Third, we provide an example of how the method can be used to analyse network time-series. In conclusion, we provide a robust method for systematically discovering and classifying characteristic nodes of a network. In contrast to classical motif analysis, our approach can identify individual components (here: nodes) that are specific to a network. Such special nodes, as hubs before, might be found to play critical roles in real-world networks.

Purine nucleoside phosphorylase from Schistosoma mansoni in complex with ribose-1-phosphate

Schistosomes are blood flukes which cause schistosomiasis, a disease affecting approximately 200 million people worldwide. Along with several other important human parasites including trypanosomes and Plasmodium, schistosomes lack the de novo pathway for purine synthesis and depend exclusively on the salvage pathway for their purine requirements, making the latter an attractive target for drug development. Part of the pathway involves the conversion of inosine (or guanosine) into hypoxanthine (or guanine) together with ribose-1-phosphate (R1P) or vice versa. This inter-conversion is undertaken by the enzyme purine nucleoside phosphorylase (PNP) which has been used as the basis for the development of novel anti-malarials, conceptually validating this approach. It has been suggested that, during the reverse reaction, R1P binding to the enzyme would occur only as a consequence of conformational changes induced by hypoxanthine, thus making a binary PNP-R1P complex unlikely. Contradictory to this statement, a crystal structure of just such a binary complex involving the Schistosoma mansoni enzyme has been successfully obtained. The ligand shows an intricate hydrogen-bonding network in the phosphate and ribose binding sites and adds a further chapter to our knowledge which could be of value in the future development of selective inhibitors.

Gene Expression Complex Networks: Synthesis, Identification, and Analysis

Thanks to recent advances in molecular biology, allied to an ever increasing amount of experimental data, the functional state of thousands of genes can now be extracted simultaneously by using methods such as cDNA microarrays and RNA-Seq. Particularly important related investigations are the modeling and identification of gene regulatory networks from expression data sets. Such a knowledge is fundamental for many applications, such as disease treatment, therapeutic intervention strategies and drugs design, as well as for planning high-throughput new experiments. Methods have been developed for gene networks modeling and identification from expression profiles. However, an important open problem regards how to validate such approaches and its results. This work presents an objective approach for validation of gene network modeling and identification which comprises the following three main aspects: (1) Artificial Gene Networks (AGNs) model generation through theoretical models of complex networks, which is used to simulate temporal expression data; (2) a computational method for gene network identification from the simulated data, which is founded on a feature selection approach where a target gene is fixed and the expression profile is observed for all other genes in order to identify a relevant subset of predictors; and (3) validation of the identified AGN-based network through comparison with the original network. The proposed framework allows several types of AGNs to be generated and used in order to simulate temporal expression data. The results of the network identification method can then be compared to the original network in order to estimate its properties and accuracy. Some of the most important theoretical models of complex networks have been assessed: the uniformly-random Erdos-Renyi (ER), the small-world Watts-Strogatz (WS), the scale-free Barabasi-Albert (BA), and geographical networks (GG). The experimental results indicate that the inference method was sensitive to average degree k variation, decreasing its network recovery rate with the increase of k. The signal size was important for the inference method to get better accuracy in the network identification rate, presenting very good results with small expression profiles. However, the adopted inference method was not sensible to recognize distinct structures of interaction among genes, presenting a similar behavior when applied to different network topologies. In summary, the proposed framework, though simple, was adequate for the validation of the inferred networks by identifying some properties of the evaluated method, which can be extended to other inference methods.

Neural network model for designing automotive devices using SMD LED

The advantages offered by the electronic component LED (Light Emitting Diode) have resulted in a quick and extensive application of this device in the replacement of incandescent lights. In this combined application, however, the relationship between the design variables and the desired effect or result is very complex and renders it difficult to model using conventional techniques. This paper consists of the development of a technique using artificial neural networks that makes it possible to obtain the luminous intensity values of brake lights using SMD (Surface Mounted Device) LEDs from design data. This technique can be utilized to design any automotive device that uses groups of SMD LEDs. The results of industrial applications using SMD LED are presented to validate the proposed technique.

Optimized network structure for full-synchronization

A network of Kuramoto oscillators with different natural frequencies is optimized for enhanced synchronizability. All node inputs are normalized by the node connectivity and some important properties of the network Structure are determined in this case: (i) optimized networks present a strong anti-correlation between natural frequencies of adjacent nodes: (ii) this anti-correlation should be as high as possible since the average path length between nodes is maintained as small as in random networks: and (iii) high anti-correlation is obtained without any relation between nodes natural frequencies and the degree of connectivity. We also propose a network construction model with which it is shown that high anti-correlation and small average paths may be achieved by randomly rewiring a fraction of the links of a totally anti-correlated network, and that these networks present optimal synchronization properties. (C) 2008 Elsevier B.V. All rights reserved.