A dynamic epidemic control model on uncorrelated complex networks

In this paper, a dynamic epidemic control model on the uncorrelated complex networks is proposed. By means of theoretical analysis, we found that the new model has a similar epidemic threshold as that of the susceptible-infectedrecovered （SIR） model on the above networks, but it can reduce the prevalence of the infected individuals remarkably. This result may help us understand epidemic spreading phenomena on real networks and design appropriate strategies to control infections.

Hierarchical Modeling by Recursive Unsupervised Spectral Clustering and Network Extended Importance Measures to Analyze the Reliability Characteristics of Complex Network Systems

The complexity of large-scale network systems made of a large number of nonlinearly interconnected components is a restrictive facet for their modeling and analysis. In this paper, we propose a framework of hierarchical modeling of a complex network system, based on a recursive unsupervised spectral clustering method. The hierarchical model serves the purpose of facilitating the management of complexity in the analysis of real-world critical infrastructures. We exemplify this by referring to the reliability analysis of the 380 kV Italian Power Transmission Network (IPTN). In this work of analysis, the classical component Importance Measures (IMs) of reliability theory have been extended to render them compatible and applicable to a complex distributed network system. By utilizing these extended IMs, the reliability properties of the IPTN system can be evaluated in the framework of the hierarchical system model, with the aim of providing risk managers with information on the risk/safety significance of system structures and components.

Performance-based fractal fracture model for complex fracture network simulation

The paper presents a novel hydraulic fracturing model for the characterization and simulation of the complex fracture network in shale gas reservoirs. We go beyond the existing method that uses planar or orthogonal conjugate fractures for representing the ＇＇complexity＇＇ of the network. Bifurcation of fractures is performed utilizing the Lindenmayer system based on fractal geometry to describe the fracture propagation pattern, density and network connectivity. Four controlling parameters are proposed to describe the details of complex fractures and stimulated reservoir volume（SRV）. The results show that due to the multilevel feature of fractal fractures, the model could provide a simple method for contributing reservoir volume calibration. The primary-and second-stage fracture networks across the overall SRV are the main contributions to the production, while the induced fracture network just contributes another 20% in the late producing period. We also conduct simulation with respect to different refracturing cases and find that increasing the complexity of the fracture network provides better performance than only enhancing the fracture conductivity.

The Complex System Modeling Method Based on Uniform Design and Neural Network

In this paper, the method based on uniform design and neural network is proposed to model the complex system. In order to express the system characteristics all round, uniform design method is used to choose the modeling samples and obtain the overall information of the system;for the purpose of modeling the system or its characteristics, the artificial neural network is used to construct the model. Experiment indicates that this method can model the complex system effectively.

A thermal flux-diffusing model for complex networks and its applications in community structure detection

We introduce a thermal flux-diffusing model for complex networks. Based on this model, we propose a physical method to detect the communities in the complex networks. The method allows us to obtain the temperature distribution of nodes in time that scales linearly with the network size. Then, the local community enclosing a given node can be easily detected for the reason that the dense connections in the local communities lead to the temperatures of nodes in the same community being close to each other. The community structure of a network can be recursively detected by randomly choosing the nodes outside the detected local communities. In the experiments, we apply our method to a set of benchmarking networks with known pre-determined community structures. The experiment results show that our method has higher accuracy and precision than most existing globe methods and is better than the other existing local methods in the selection of the initial node. Finally. several real-world networks are investigated.

The Fuzzy Modeling Algorithm for Complex Systems Based on Stochastic Neural Network

A fuzzy modeling method for complex systems is studied. The notation of general stochastic neural network (GSNN) is presented and a new modeling method is given based on the combination of the modified Takagi and Sugeno's (MTS) fuzzy model and one-order GSNN. Using expectation-maximization(EM) algorithm, parameter estimation and model selection procedures are given. It avoids the shortcomings brought by other methods such as BP algorithm, when the number of parameters is large, BP algorithm is still difficult to apply directly without fine tuning and subjective tinkering. Finally, the simulated example demonstrates the effectiveness.

Dynamic properties of epidemic spreading on finite size complex networks

The Internet presents a complex topological structure, on which computer viruses can easily spread. By using theoretical analysis and computer simulation methods, the dynamic process of disease spreading on finite size networks with complex topological structure is investigated. On the finite size networks, the spreading process of SIS （susceptibleinfected-susceptible） model is a finite Markov chain with an absorbing state. Two parameters, the survival probability and the conditional infecting probability, are introduced to describe the dynamic properties of disease spreading on finite size networks. Our results can help understanding computer virus epidemics and other spreading phenomena on communication and social networks. Also, knowledge about the dynamic character of virus spreading is helpful for adopting immunity policy.

Analyzing the causation of a railway accident based on a complex network

In this paper, a new model is constructed for the causation analysis of railway accident based on the complex network theory. In the model, the nodes are defined as various manifest or latent accident causal factors. By employing the complex network theory, especially its statistical indicators, the railway accident as well as its key causations can be analyzed from the overall perspective. As a case, the ＂7.23＂ China-Yongwen railway accident is illustrated based on this model. The results show that the inspection of signals and the checking of line conditions before trains run played an important role in this railway accident. In conclusion, the constructed model gives a theoretical clue for railway accident prediction and, hence, greatly reduces the occurrence of railway accidents.

Rank-based deactivation model for networks with age

We study the impact of age on network evolution which couples addition of new nodes and deactivation of old ones. During evolution, each node experiences two stages： active and inactive. The transition from the active state to the inactive one is based on the rank of the node. In this paper, we adopt age as a criterion of ranking, and propose two deactivation models that generalize previous research. In model A, the older active node possesses the higher rank, whereas in model B, the younger active node takes the higher rank. We make a comparative study between the two models through the node-degree distribution.

Two-Layer Coupled Network Model for Topic Derivation in Public Opinion Propagation

In view of the fact that news can generate derivative topics when it spreads through micro-blogs,a two-layer coupled SEIR public opinion propagation model is proposed in this paper.The model divides the process of public opinion propagation into two layers:the original topic layer and the derived topic layer.Messages are transmitted separately by the SEIR model in the two topic layers,which are independent and interactive.The influence of the topic derivation rate on the propagation trend is established by solving for the equilibrium point and propagation threshold.Further,we establish the relationship between the original topic and the derived topic by simulation.This paper uses the Baidu index to demonstrate the correctness of the model.The relationship between the derived topic and the original topic is verified by adjusting the parameters by the control variable method.The results show that the proposed model is consistent with the propagation of actual public opinion.

Evolving Network Model with Local-Area Preference for Mobile Ad Hoc Network

To accurately describe the evolving features of Mobile Ad Hoc Networks (MANETs) and to improve the performance of such networks, an evolving topology model with local-area preference is proposed. The aim of the model, which is analyzed by the mean field theory, is to optimize network structures based on users' behaviors in MANETs. The analysis results indicate that the network generated by this evolving model is a kind of scale-free network. This evolving model can improve the fault-tolerance performance of networks by balancing the connectivity and two factors, i.e., the remaining energy and the distance to nodes. The simulation results show that the evolving topology model has superior performance in reducing the traffic load and the energy consumption, prolonging network lifetime and improving the scalability of networks. It is an available approach for establishing and analyzing actual MANETs.

Rapid identifying high-influence nodes in complex networks

A tiny fraction of influential individuals play a critical role in the dynamics on complex systems. Identifying the influential nodes in complex networks has theoretical and practical significance. Considering the uncertainties of network scale and topology, and the timeliness of dynamic behaviors in real networks, we propose a rapid identifying method（RIM）to find the fraction of high-influential nodes. Instead of ranking all nodes, our method only aims at ranking a small number of nodes in network. We set the high-influential nodes as initial spreaders, and evaluate the performance of RIM by the susceptible-infected-recovered（SIR） model. The simulations show that in different networks, RIM performs well on rapid identifying high-influential nodes, which is verified by typical ranking methods, such as degree, closeness, betweenness,and eigenvector centrality methods.

Complex tree: the basic framework of protein-protein interaction networks

In living cells, proteins are dynamically connec ted through biochemical reactions, so its functi onal features are properly encoded into protein protein interaction networks (PINs). Up to pres ent, many efforts have been devoted to exploring the basic feature of PINs. However, it is still a challenging problem to explore a universal pr operty of PINs. Here we employed the complex networks theory to analyze the proteinprotein interactions from Database of Interacting Prot ein. Complex tree: the unique framework of PINs was revealed by three topological properties of the giant component of PINs (GCOP), including rightskewed degree distributions, relatively sm all clustering coefficients and short characteristic path lengths. Furthermore, we proposed a no nlinearly growth model: complex tree model to reflect the tree framework, the simulation resu lts of this model showed that GCOPs were well represented by our model, which could be help ful for understanding the treestructure: basic framework of PINs. Source code and binaries freely available for download at http://cic.scu. edu.cn/bioinformatics/STM/STM_code.rar.

RESEARCH ON KEY NODES OF WIRELESS SENSOR NETWORK BASED ON COMPLEX NETWORK THEORY

On the basis of complex network theory, the issues of key nodes in Wireless Sensor Networks (WSN) are discussed. A model expression of sub-network fault in WSN is given at first; subsequently, the concepts of average path length and clustering coefficient are introduced. Based on the two concepts, a novel attribute description of key nodes related to sub-networks is proposed. Moreover, in terms of node deployment density and transmission range, the concept of single-point key nodes and generalized key nodes of WSN are defined, and their decision theorems are investigated.

Joint optimization scheduling for water conservancy projects incomplex river networks

In this study, we simulated water flow in a water conservancy project consisting of various hydraulic structures, such as sluices, pumping stations, hydropower stations, ship locks, and culverts, and developed a multi-period and multi-variable joint optimization scheduling model for flood control, drainage, and irrigation. In this model, the number of sluice holes, pump units, and hydropower station units to be opened were used as decision variables, and different optimization objectives and constraints were considered. This model was solved with improved genetic algorithms and verified using the Huaian Water Conservancy Project as an example. The results show that the use of the joint optimization scheduling led to a 10% increase in the power generation capacity and a 15% reduction in the total energy consumption. The change in the water level was reduced by 0.25 m upstream of the Yundong Sluice, and by 50% downstream of pumping stations No. 1, No. 2, and No. 4. It is clear that the joint optimization scheduling proposed in this study can effectively improve power generation capacity of the project, minimize operating costs and energy consumption, and enable more stable operation of various hydraulic structures. The results may provide references for the management of water conservancy projects in complex river networks.

基于24model的建筑施工机械伤害事故脆弱性分析

为预防建筑施工机械伤害事故,本研究采用事故致因2-4模型(24model)和复杂网络理论(CN)对施工机械事故进行分析整理。首先采用24model梳理86起典型机械事故报告中各层次事故的致因,对伤害事故中的安全管理体系、习惯性行为、不安全动作和不安全物态进行定性分析;随后根据复杂网络理论构建风险要素网络模型,通过网络攻击的手段找到导致事故的关键要素。研究结果表明:未经允许冒险作业、无相关施工资质、作业环境恶劣是事故关键致因。通过对关键节点的防控,可有效提升建筑施工安全水平。

Step-by-Step Random Walk Network with Power-Law Clique-Degree Distribution

We propose a simple mechanism for generating scale-free networks with degree exponent γ=3, where the new node is connected to the existing nodes by step-by-step random walk. It is found that the clique-degree distribution based on our model obeys a power-law form, which is in agreement with the recently empirical evidences. In addition, our model displays the small-world effect and the hierarchical structure.

Self-Organization of Topology and Weight Dynamics on Networks from Merging and Regeneration

We propose a model of weighted networks in which the structural evolution is coupled with weight dynamics. Based on a simple merging and regeneration process, the model gives powel-law distributions of degree, strength and weight, as observed in many real networks. It should be emphasized that, in our model, the nontrivial degree-strength correlation can be reproduced and in agreement with empirical data. Moreover, the size-growing evolution model is also presented to meet the properties of real-world systems.

Multistage Random Growing Small-World Networks with Power-Law Degree Distribution

We present a simple rule which could generate scale-free networks with very large clustering coefficient and very small average distance. These networks, called the multistage random growing networks （MRGNs）, are constructed by a two-stage adding process for each new node. The analytic results of the power-law exponent = 3 and the clustering coefficient C = 0.81 are obtained, which agree with the simulation results approximately. In addition, we find that the average distance of the networks increases logarithmically with the network size, which is consistent with the theoretical predictions. Since many real-world networks are both scale-free and small-world, the MRGNs may perform well in mimicking reality.

Opinion Spreading with Mobility on Scale-Free Networks

A continuum opinion dynamic model is presented based on two rules. The first one considers the mobilities of the individuals, the second one supposes that the individuals update their opinions independently. The results of the model indicate that the bounded confidence εc, separating consensus and incoherent states, of a scale-free network is much smaller than the one of a lattice. If the system can reach the consensus state, the sum of all individuals＇ opinion change Oc（t） quickly decreases in an exponential form, while if it reaches the incoherent state finally, Oc（t） decreases slowly and has the punctuated equilibrium characteristic.