Border figure detection using a phase oscillator network with dynamical coupling

Oscillator networks have been developed in order to perform specific tasks related to image processing. Here we analytically investigate the existence of synchronism in a pair of phase oscillators that are short-range dynamically coupled. Then, we use these analytical results to design a network able of detecting border of black-and-white figures. Each unit composing this network is a pair of such phase oscillators and is assigned to a pixel in the image. The couplings among the units forming the network are also dynamical. Border detection emerges from the network activity.

AtPIN: Arabidopsis thaliana Protein Interaction Network

Background: Protein-protein interactions (PPIs) constitute one of the most crucial conditions to sustain life in living organisms. To study PPI in Arabidopsis thaliana we have developed AtPIN, a database and web interface for searching and building interaction networks based on publicly available protein-protein interaction datasets. Description: All interactions were divided into experimentally demonstrated or predicted. The PPIs in the AtPIN database present a cellular compartment classification (C(3)) which divides the PPI into 4 classes according to its interaction evidence and subcellular localization. It has been shown in the literature that a pair of genuine interacting proteins are generally expected to have a common cellular role and proteins that have common interaction partners have a high chance of sharing a common function. In AtPIN, due to its integrative profile, the reliability index for a reported PPI can be postulated in terms of the proportion of interaction partners that two proteins have in common. For this, we implement the Functional Similarity Weight (FSW) calculation for all first level interactions present in AtPIN database. In order to identify target proteins of cytosolic glutamyl-tRNA synthetase (Cyt-gluRS) (AT5G26710) we combined two approaches, AtPIN search and yeast two-hybrid screening. Interestingly, the proteins glutamine synthetase (AT5G35630), a disease resistance protein (AT3G50950) and a zinc finger protein (AT5G24930), which has been predicted as target proteins for Cyt-gluRS by AtPIN, were also detected in the experimental screening. Conclusions: AtPIN is a friendly and easy-to-use tool that aggregates information on Arabidopsis thaliana PPIs, ontology, and sub-cellular localization, and might be a useful and reliable strategy to map protein-protein interactions in Arabidopsis. AtPIN can be accessed at http://bioinfo.esalq.usp.br/atpin.

A Comparison of Bimatoprost 0.03% Versus the Fixed-Combination of Latanotoprost 0.005% and Timolol 0.5% in Adult Patients With Elevated Intraocular Pressure: An Eight-Week, Randomized, Open-Label Trial

Introduction and Purpose: Bimatoprost and the fixed combination of latanoprost with timolol maleate are 2 medications widely used to treat glaucoma and ocular hypertension (OHT). The aim of the study is to compare the efficacy of these 2 drugs in reducing intraocular pressure (IOP) after 8 weeks of treatment in patients with primary open angle glaucoma (POAG) or OHT. Methods: In this randomized, open-label trial, 44 patients with POAG or OHT were allocated to receive either bimatoprost (1 drop QD) or latanoprost/timolol (1 drop QD). Primary outcome was the mean diurnal IOP measurement at the 8th week, calculated as the mean IOP measurements taken at 8:00 AM, 10: 00 AM, and 12: 00 PM Secondary outcomes included the baseline change in IOP measured 3 times a day, after the water-drinking test (performed after the last IOP measurement), and the assessment of side effects of each therapy. Results: The mean IOP levels of latanoprost/timolol (13.83, SD = 2.54) was significantly lower than of bimatoprost (16.16, SD = 3.28; P < 0.0001) at week 8. Also, the change in mean IOP values was significantly higher in the latanoprost/timolol group at 10:00 AM (P = 0.013) and 12:00 PM (P = 0.01), but not at 8: 00 AM (P = ns). During the water-drinking test, there was no signifi cant difference in IOP increase (absolute and percentage) between groups; however, there was a signifi cant decrease in mean heart rate in the latanoprost/timolol group. Finally, no signifi cant changes in blood pressure and lung spirometry were observed in either groups. Conclusions: The fixed combination of latanoprost/timolol was significantly superior to bimatoprost alone in reducing IOP in patients with POAG or OHT. Further studies with large sample sizes should be taken to support the superior efficacy of latanoprost/timolol, as well as to better assess its profile of side effects.

Changes in temporomandibular joint disc position and form following Herbst and fixed orthodontic treatment

Objective: To determine the changes in the position and form of the temporomandibular joint articular disc in adolescents with Class II division 1 malocclusion and mandibular retrognathism treated with the Herbst appliance (phase I) and fixed orthodontic appliance (phase II). Materials and Methods: Thirty-two consecutive adolescents went through phase I of treatment and 23 completed phase II. The temporomandibular joints were evaluated qualitatively by means of magnetic resonance images at the beginning of treatment (T1), during phase I (T2), at the end of phase I (T3), and at the end of phase II (T4). Results: Significant changes in disc position were not observed with the mouth closed between T1 X T3 (P = .317), T3 X T4 (P = .287), or T1 X T4 (P = .261). At T2, on average, the disc was positioned regressively. With the mouth open, no difference was observed between T1 X T3 (P = .223) or T1 X T4 (P = .082). We did observe a significant difference between T3 X T4 (P < .05). Significant changes in the disc form were found with the mouth closed between T1 X T2 (P < .001) and T2 X T3 (P < .001). Conclusions: At the end of the two-phase treatment, in general terms, the position and form of the initial articular discs were maintained; however, in some temporomandibular joints some seemingly adverse effects were observed at T4. (Angle Orthod. 2010;80:843-852.)

Group I introns and associated homing endonuclease genes reveals a clinal structure for Porphyra spiralis var. amplifolia (Bangiales, Rhodophyta) along the Eastern coast of South America

Background: Group I introns are found in the nuclear small subunit ribosomal RNA gene (SSU rDNA) of some species of the genus Porphyra (Bangiales, Rhodophyta). Size polymorphisms in group I introns has been interpreted as the result of the degeneration of homing endonuclease genes (HEG) inserted in peripheral loops of intron paired elements. In this study, intron size polymorphisms were characterized for different Porphyra spiralis var. amplifolia (PSA) populations on the Southern Brazilian coast, and were used to infer genetic relationships and genetic structure of these PSA populations, in addition to cox2-3 and rbcL-S regions. Introns of different sizes were tested qualitatively for in vitro self-splicing. Results: Five intron size polymorphisms within 17 haplotypes were obtained from 80 individuals representing eight localities along the distribution of PSA in the Eastern coast of South America. In order to infer genetic structure and genetic relationships of PSA, these polymorphisms and haplotypes were used as markers for pairwise Fst analyses, Mantel's test and median joining network. The five cox2-3 haplotypes and the unique rbcL-S haplotype were used as markers for summary statistics, neutrality tests Tajima's D and Fu's Fs and for median joining network analyses. An event of demographic expansion from a population with low effective number, followed by a pattern of isolation by distance was obtained for PSA populations with the three analyses. In vitro experiments have shown that introns of different lengths were able to self-splice from pre-RNA transcripts. Conclusion: The findings indicated that degenerated HEGs are reminiscent of the presence of a full-length and functional HEG, once fixed for PSA populations. The cline of HEG degeneration determined the pattern of isolation by distance. Analyses with the other markers indicated an event of demographic expansion from a population with low effective number. The different degrees of degeneration of the HEG do not refrain intron self-splicing. To our knowledge, this was the first study to address intraspecific evolutionary history of a nuclear group I intron; to use nuclear, mitochondrial and chloroplast DNA for population level analyses of Porphyra; and intron size polymorphism as a marker for population genetics.

Particle competition for complex network community detection

In many real situations, randomness is considered to be uncertainty or even confusion which impedes human beings from making a correct decision. Here we study the combined role of randomness and determinism in particle dynamics for complex network community detection. In the proposed model, particles walk in the network and compete with each other in such a way that each of them tries to possess as many nodes as possible. Moreover, we introduce a rule to adjust the level of randomness of particle walking in the network, and we have found that a portion of randomness can largely improve the community detection rate. Computer simulations show that the model has good community detection performance and at the same time presents low computational complexity. (C) 2008 American Institute of Physics.

Generalized connectivity between any two nodes in a complex network

This article focuses on the identification of the number of paths with different lengths between pairs of nodes in complex networks and how these paths can be used for characterization of topological properties of theoretical and real-world complex networks. This analysis revealed that the number of paths can provide a better discrimination of network models than traditional network measurements. In addition, the analysis of real-world networks suggests that the long-range connectivity tends to be limited in these networks and may be strongly related to network growth and organization.

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.

Social interaction as a heuristic for combinatorial optimization problems

We investigate the performance of a variant of Axelrod's model for dissemination of culture-the Adaptive Culture Heuristic (ACH)-on solving an NP-Complete optimization problem, namely, the classification of binary input patterns of size F by a Boolean Binary Perceptron. In this heuristic, N agents, characterized by binary strings of length F which represent possible solutions to the optimization problem, are fixed at the sites of a square lattice and interact with their nearest neighbors only. The interactions are such that the agents' strings (or cultures) become more similar to the low-cost strings of their neighbors resulting in the dissemination of these strings across the lattice. Eventually the dynamics freezes into a homogeneous absorbing configuration in which all agents exhibit identical solutions to the optimization problem. We find through extensive simulations that the probability of finding the optimal solution is a function of the reduced variable F/N(1/4) so that the number of agents must increase with the fourth power of the problem size, N proportional to F(4), to guarantee a fixed probability of success. In this case, we find that the relaxation time to reach an absorbing configuration scales with F(6) which can be interpreted as the overall computational cost of the ACH to find an optimal set of weights for a Boolean binary perceptron, given a fixed probability of success.

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.

Haplotype distribution of five nuclear genes based on network genealogies and Bayesian inference indicates that Trypanosoma cruzi hybrid strains are polyphyletic

Chagas disease is still a major public health problem in Latin America. Its causative agent, Trypanosoma cruzi, can be typed into three major groups, T. cruzi I, T. cruzi II and hybrids. These groups each have specific genetic characteristics and epidemiological distributions. Several highly virulent strains are found in the hybrid group; their origin is still a matter of debate. The null hypothesis is that the hybrids are of polyphyletic origin, evolving independently from various hybridization events. The alternative hypothesis is that all extant hybrid strains originated from a single hybridization event. We sequenced both alleles of genes encoding EF-1 alpha, actin and SSU rDNA of 26 T. cruzi strains and DHFR-TS and TR of 12 strains. This information was used for network genealogy analysis and Bayesian phylogenies. We found T. cruzi I and T. cruzi II to be monophyletic and that all hybrids had different combinations of T. cruzi I and T. cruzi II haplotypes plus hybrid-specific haplotypes. Bootstrap values (networks) and posterior probabilities (Bayesian phylogenies) of clades supporting the monophyly of hybrids were far below the 95% confidence interval, indicating that the hybrid group is polyphyletic. We hypothesize that T. cruzi I and T. cruzi II are two different species and that the hybrids are extant representatives of independent events of genome hybridization, which sporadically have sufficient fitness to impact on the epidemiology of Chagas disease.

Robust STATCOM control for the stabilisation of fixed-speed wind turbines during low voltages

This paper presents a robust voltage control scheme for fixed-speed wind generators using a static synchronous compensator (STATCOM) controller. To enable a linear and robust control framework with structured uncertainty, the overall system is represented by a linear part plus a nonlinear part that covers an operating range of interest required to ensure stability during severe low voltages. The proposed methodology is flexible and readily applicable to larger wind farms of different configurations. The performance of the control strategy is demonstrated on a two area test system. Large disturbance simulations demonstrate that the proposed controller enhances voltage stability as well as transient stability of induction generators during low voltage ride through (LVRT) transients and thus enhances the LVRT capability. (C) 2011 Elsevier Ltd. All rights reserved.

Connection Admission Control for a WDM Optical Network Based on Traffic Monitoring and Bandwidth Release

We proposed a connection admission control (CAC) to monitor the traffic in a multi-rate WDM optical network. The CAC searches for the shortest path connecting source and destination nodes, assigns wavelengths with enough bandwidth to serve the requests, supervises the traffic in the most required nodes, and if needed activates a reserved wavelength to release bandwidth according to traffic demand. We used a scale-free network topology, which includes highly connected nodes ( hubs), to enhance the monitoring procedure. Numerical results obtained from computational simulations show improved network performance evaluated in terms of blocking probability.