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.

Interaction between polymorphisms of the Human Leukocyte Antigen and HPV-16 Variants on the risk of invasive cervical cancer

Background: Persistent infection with oncogenic types of human papillomavirus (HPV) is the major risk factor for invasive cervical cancer (ICC), and non-European variants of HPV-16 are associated with an increased risk of persistence and ICC. HLA class II polymorphisms are also associated with genetic susceptibility to ICC. Our aim is to verify if these associations are influenced by HPV-16 variability. Methods: We characterized HPV-16 variants by PCR in 107 ICC cases, which were typed for HLA-DQA1, DRB1 and DQB1 genes and compared to 257 controls. We measured the magnitude of associations by logistic regression analysis. Results: European ( E), Asian-American ( AA) and African (Af) variants were identified. Here we show that inverse association between DQB1*05 ( adjusted odds ratio [ OR] = 0.66; 95% confidence interval [CI]: 0.39-1.12]) and HPV-16 positive ICC in our previous report was mostly attributable to AA variant carriers ( OR = 0.27; 95% CI: 0.10-0.75). We observed similar proportions of HLA DRB1*1302 carriers in E-P positive cases and controls, but interestingly, this allele was not found in AA cases ( p = 0.03, Fisher exact test). A positive association with DRB1*15 was observed in both groups of women harboring either E ( OR = 2.99; 95% CI: 1.13-7.86) or AA variants ( OR = 2.34; 95% CI: 1.00-5.46). There was an inverse association between DRB1*04 and ICC among women with HPV-16 carrying the 350T [83L] single nucleotide polymorphism in the E6 gene ( OR = 0.27; 95% CI: 0.08-0.96). An inverse association between DQB1*05 and cases carrying 350G (83V) variants was also found ( OR = 0.37; 95% CI: 0.15-0.89). Conclusion: Our results suggest that the association between HLA polymorphism and risk of ICC might be influenced by the distribution of HPV-16 variants.

Stability region bifurcations of nonlinear autonomous dynamical systems: Type-zero saddle-node bifurcations

The behavior of stability regions of nonlinear autonomous dynamical systems subjected to parameter variation is studied in this paper. In particular, the behavior of stability regions and stability boundaries when the system undergoes a type-zero sadle-node bifurcation on the stability boundary is investigated in this paper. It is shown that the stability regions suffer drastic changes with parameter variation if type-zero saddle-node bifurcations occur on the stability boundary. A complete characterization of these changes in the neighborhood of a type-zero saddle-node bifurcation value is presented in this paper. Copyright (C) 2010 John Wiley & Sons, Ltd.

Node-Depth Encoding and Multiobjective Evolutionary Algorithm Applied to Large-Scale Distribution System Reconfiguration

The power loss reduction in distribution systems (DSs) is a nonlinear and multiobjective problem. Service restoration in DSs is even computationally hard since it additionally requires a solution in real-time. Both DS problems are computationally complex. For large-scale networks, the usual problem formulation has thousands of constraint equations. The node-depth encoding (NDE) enables a modeling of DSs problems that eliminates several constraint equations from the usual formulation, making the problem solution simpler. On the other hand, a multiobjective evolutionary algorithm (EA) based on subpopulation tables adequately models several objectives and constraints, enabling a better exploration of the search space. The combination of the multiobjective EA with NDE (MEAN) results in the proposed approach for solving DSs problems for large-scale networks. Simulation results have shown the MEAN is able to find adequate restoration plans for a real DS with 3860 buses and 632 switches in a running time of 0.68 s. Moreover, the MEAN has shown a sublinear running time in function of the system size. Tests with networks ranging from 632 to 5166 switches indicate that the MEAN can find network configurations corresponding to a power loss reduction of 27.64% for very large networks requiring relatively low running time.