中国演员和导演网络对电影市场的影响分析

为探讨导演和主演对电影的多维影响,建立了导演联合执导网络、主演合作网络和导演主演双模网络,从网络位置视角对电影市场进行多方位分析。回归结果表明导演执导方式不影响电影评分,但联合执导促进票房增长。导演、主演的程度中心度和结构洞都能促进电影评分、票房的增加,然而两者不具有叠加效应,且程度中心度相对影响更大,共享信息优于独享信息。

An efficient reliability evaluation method for industrial wireless sensor networks

Aimed at the difficulties in accurately, comprehensively and systematically evaluating the reliability of industrial wireless sensor networks （WSNs）, a time-evolving state transition-Monte Carlo （TEST-MC） evaluation method and a novel network function value representation method are proposed to evaluate the reliability of the IWSNs. First, the adjacency matrix method is used to characterize three typical topologies of WSNs including the mesh network, tree network and ribbon network. Secondly, the network function value method is used to evaluate the network connectivity, and the TEST-MC evaluation method is used to evaluate network reliability and availability. Finally, the variations in the reliability, connectivity and availability of these three topologies are presented. Simulation results show that the proposed method can quickly analyze the reliability of the networks containing typical WSN topologies, which provides an effective method for the comprehensive and accurate evaluation of the reliability of WSNs.

STUDY ON MEASURES OF FAULT TOLERANCE FOR DISTRIBUTED SYSTEM

Fault tolerant ability is an important aspect for overall evaluation of distributed system(DS). This paper discusses three measures for the evaluation: node/edge connectivity, number of spanning trees and synthetic connectivity. A numerical example for illustration and analysis is given, and the synthetic connectivity measure presented by this paper is proved to be rational and satisfactory.

两段式P2P流媒体节点选择算法

现有的点对点(P2P)流媒体系统不能很好地兼顾网络拓扑聚集性和流服务质量,存在延迟过长和覆盖网压力过大的问题。为此,比较典型节点选择算法在流服务质量、网络利用率、网络拓扑聚集性等方面的特征,采用拓扑聚集和带宽优先相结合的方法,提出一种两段式的节点选择算法。在PeerSim软件上的仿真结果表明,该算法相比于其他算法,覆盖网压力和流服务质量等性能较好。

Synchronization and Control of Halo-Chaos in Beam Transport Network with Small World Topology

The synchronous conditions of two kinds of the small-world （SW） network are studied. The small world topology can affect on dynamical behaviors of the beam transport network （BTN） largely, if the BTN is constructed with the SW topology, the global linear coupling and special linear feedback can realize the synchronization control of beam halo-chaos as well as periodic state in the BTN with the SW topology, respectively. This important result can provide an effective way for the experimental study and the engineering design of the BTN in the high-current accelerator driven radioactive clean nuclear power systems, and may have potential use in prospective applications for halo-chaos secure communication.

Effects of Scale-Free Topological Properties on Dynamical Synchronization and Control in Coupled Map Lattices

In the paper, we study effects of scale-free （SF） topology on dynamical synchronization and control in coupled map lattices （CIVIL）. Our strategy is to apply three feedback control methods, including constant feedback and two types of time-delayed feedback, to a small fraction of network nodes to reach desired synchronous state. Two controlled bifurcation diagrams verses feedback strength are obtained respectively. It is found that the value of critical feedback strength γc for the first time-delayed feedback control is increased linearly as e is increased linearly. The GML with SF loses synchronization and intermittency occurs if γ 〉 γc. Numerical examples are presented to demonstrate all results.

Analysis on Refinery System as a Complex Task-resource Network

Refinery system, a typical example of process systems, is presented as complex network in this paper. The topology of this system is described by task-resource network and modeled as directed and weighted graph, in which nodes represent various tasks and edges denote the resources exchanged among tasks. Using the properties of node degree distribution, strength distribution and other weighted quantities, we demonstrate the heterogeneity of the network and point out the relation between structural characters of vertices and the functionality of correspond- ing tasks. The above phenomena indicate that the design requirements and principles of production process contrib- ute to the heterogeneous features of the network. Besides, betweenness centrality of nodes can be used as an impor- tance indicator to provide additional information for decision making. The correlations between structure and weighted properties are investigated to further address the influence brought by production schemes in system con- nectivity patterns. Cascading failures model is employed to analyze the robustness of the network when targeted at- tack happens. Two capacity assignment strategies are compared in order to improve the robustness of the network at certain cost. The refinery system displays more reliable behavior when the protecting strategy considers heteroge- neous properties. This phenomenon further implies the structure-activity relationship of the refinery system and provides insightful suggestions for process system design. The results also indicate that robustness analysis is a _promising applicat!on of methodologies from complex networks to process system engineering..

Local adaptive transmit power assignment strategy for wireless sensor networks

A distributed local adaptive transmit power assignment (LA-TPA) strategy was proposed to construct a topology with better performance according to the environment and application scenario and prolong the network lifetime.It takes the path loss exponent and the energy control coefficient into consideration with the aim to accentuate the minimum covering district of each node more accurately and precisely according to various network application scenarios.Besides,a self-healing scheme that enhances the robustness of the network was provided.It makes the topology tolerate more dead nodes than existing algorithms.Simulation was done under OMNeT++ platform and the results show that the LA-TPA strategy is more effective in constructing a well-performance network topology based on various application scenarios and can prolong the network lifetime significantly.

An Ideal Assortative Network and Synchronization

This paper proposes a novel complex network with assortative property based on multi-center networks. The average path length and clustering coefficient of the network are calculated, and the impact on the network topology is investigated. A simple dynamic system established on the proposed network is used to analyze how the assortative property of the network affects synchronization.

A statistical end-to-end performance model for networks with complex topologies

Network calculus provides new tools for performance analysis of networks, but analyzing networks with complex topologies is a challenging research issue using statistical network calculus. A service model is proposed to characterize a service process of network with complex topologies. To obtain closed-form expression of statistical end-to-end performance bounds for a wide range of traffic source models, the traffic model and service model are expanded according to error function. Based on the proposed models, the explicit end-to-end delay bound of Fractional Brownian Motion（FBM） traffic is derived, the factors that affect the delay bound are analyzed, and a comparison between theoretical and simulation results is performed. The results illustrate that the proposed models not only fit the network behaviors well, but also facilitate the network performance analysis.

Topology Based Reliable Virtual Network Embedding from a QoE Perspective

In the network virtualization environments, one of the most challenges is how to map the virtual networks(VNs) onto a shared substrate network managed by an infrastructure provider(In P), which is termed as virtual network embedding problem. Prior studies on this issue only emphasize on maximizing the revenue or minimizing the energy consumption while ignoring the reliability requirements of end-users. In our work, we incorporate the reliability probability into the virtual network embedding process with an aim to improve the Qo S/Qo E of end users from a new perspective. We devised two novel reliable virtual network embedding algorithms called RRW-Max Match and RDCC-VNE based on RW-Max Match and DCC-VNE, respectively. Extensive simulations demonstrated that the efficiency of our proposed algorithms is better than those of two primitive algorithms in terms of the reliability demands, the acceptance ratio of virtual networks and the long-term average revenue.

AN ALGORITHM FOR END-TO-END PERFORMANCE ANALYSIS OF NETWORK BASED ON TRAFFIC ENGINEERING

Based on traffic engineering, the network topology is described with network graph. An algorithm for the derivation of data communication capability in network links and the analysis of connectivity performance between node pairs is given through standardized transformation of the original descriptive matrix for the link performance, and resolution of transitive closure for adjacent-incident matrix of network in view of randomness of network events, which provides a feasible way for analysis and improvement of network performance.

Topological Properties of Complex Networks with Different Types of Nodes

Nodes play different roles or have different functions in many natural and social networks.In this paper,a simple model with different types of nodes and deterministic selective linking rule is proposed.The structural properties by theoretical predictions are investigated that the given model exhibits a power-law distribution.

Properties of Bottleneck on Complex Networks

The traffic bottleneck plays a key role in most of the natural and artificial network. Here we present a simply model for bottleneck dynamical characteristics consideration the reliability on the complex network by taking into account the network topology characteristics and system size. We find that there is a critical rate of flow generation below which the network traffic is free but above which traffic congestion occurs. Also, it is found that random networks have larger critical flow generating rate than scale free ones. Analytical results may be practically useful for designing networks, especially for the urban traffic network.

Trajectory Control of Scale-Free Dynamical Networks with Exogenous Disturbances

In this paper, the trajectory control of multi-agent dynamical systems with exogenous disturbances is studied. Suppose multiple agents composing of a scale-free network topology, the performance of rejecting disturbances for the low degree node and high degree node is analyzed. Firstly, the consensus of multi-agent systems without disturbances is studied by designing a pinning control strategy on a part of agents, where this pinning control can bring multiple agents＇ states to an expected consensus track. Then, the influence of the disturbances is considered by developing disturbance observers, and disturbance observers based control （DOBC） are developed for disturbances generated by an exogenous system to estimate the disturbances. Asymptotical consensus of the multi-agent systems with disturbances under the composite controller can be achieved for scale-free network topology. Finally, by analyzing examples of multi-agent systems with scale-free network topology and exogenous disturbances, the verities of the results are proved. Under the DOBC with the designed parameters, the trajectory convergence of multi-agent systems is researched by pinning two class of the nodes. We have found that it has more stronger robustness to exogenous disturbances for the high degree node pinned than that of the low degree node pinned.

Estimation of Data Transfer Routes Fractal Dimension in Large Scale Networks

The article is devoted to the evaluation of fractal properties of routing data in computer large scale networks. Implemented the study of percolation network topological structures of large dimension and made their transformation into fractal macrostructure. An example of calculating the fractal dimension of the data path for the boundary of the phase transition between the states of network connectivity. The dependence of the fractal dimension of the percolation cluster on the size of the square δ-cover and conductivity value network of large dimension. It is shown that for the value of the fractal dimension of the route dc ≈ 1.5, network has a stable dynamics of development and size of clusters are optimized with respect to the current load on the network.

Anti-synchronization Between Coupled Networks with Two Active Forms

This paper studies anti-synchronization and its control between two coupled networks with nonlinear signal＇s connection and the inter-network actions. If anti-synchronization does not exist between two such networks, adaptive controllers are designed to anti-synchronize them. Different node dynamics and nonidentical topological structures are considered and useful criteria for anti-synchronization between two networks are given. Numerical examples are presented to show the efficiency of our derived results.

Estimating Topology of Discrete Dynamical Networks

In this paper,by applying Lasalle's in variance principle and some results about the trace of a matrix,we propose a method for estimating the topological structure of a discrete dynamical network based on the dynamicalevolution of the network.The network concerned can be directed or undirected,weighted or unweighted,and the localdynamics of each node can be nonidentical.The connections among the nodes can be all unknown or partially known.Finally,two examples,including a Henon map and a central network,are illustrated to verify the theoretical results.

Prediction of preferential fluid flow in porous structures based on topological network models: Algorithm and experimental validation

The understanding and prediction of preferential fluid flow in porous media have attracted considerable attention in various engineering fields because of the implications of such flows in leading to a non-equilibrium fluid flow in the subsurface. In this study, a novel algorithm is proposed to predict preferential flow paths based on the topologically equivalent network of a porous structure and the flow resistance of flow paths. The equivalent flow network was constructed using Poiseuille's law and the maximal inscribed sphere algorithm. The flow resistance of each path was then determined based on Darcy's law. It was determined that fluid tends to follow paths with lower flow resistance. A computer program was developed and applied to an actual porous structure. To validate the algorithm and program, we tested and recorded two-dimensional(2 D) water flow using an ablated Perspex sheet featuring the same porous structure investigated using the analytical calculations. The results show that the measured preferential flow paths are consistent with the predictions.

Virtual network embedding based on real-time topological attributes

As a great challenge of network virtualization, virtual network embedding/mapping is increasingly important. It aims to successfully and efficiently assign the nodes and links of a virtual network （VN） onto a shared substrate network. The problem has been proved to be NP-hard and some heuristic algorithms have been proposed. However, most of the algorithms use only the local information of a node, such as CPU capacity and bandwidth, to determine how to map a VN, without considering the top- ological attributes which may pose significant impact on the performance of the embedding. In this paper, a new embedding algorithm is proposed based on real-time topological attributes. The concept ofbetweenness centrality in graph theory is borrowed to sort the nodes of VNs, and the nodes of the substrate network are sorted according to the correlation properties between the former selected and unselected nodes. In this way, node mapping and link mapping can be well coupled. A simulator is built to evaluate the performance of the proposed virtual network embedding （VNE） algorithm. The results show that the new algorithm significantly increases the revenue/cost （R/C） ratio and acceptance ratio as well as reduces the runtime.