Generating clustered scale-free networks using Poisson based localization of edges

Science.gov (United States)

Türker, İlker

2018-05-01

We introduce a variety of network models using a Poisson-based edge localization strategy, which result in clustered scale-free topologies. We first verify the success of our localization strategy by realizing a variant of the well-known Watts-Strogatz model with an inverse approach, implying a small-world regime of rewiring from a random network through a regular one. We then apply the rewiring strategy to a pure Barabasi-Albert model and successfully achieve a small-world regime, with a limited capacity of scale-free property. To imitate the high clustering property of scale-free networks with higher accuracy, we adapted the Poisson-based wiring strategy to a growing network with the ingredients of both preferential attachment and local connectivity. To achieve the collocation of these properties, we used a routine of flattening the edges array, sorting it, and applying a mixing procedure to assemble both global connections with preferential attachment and local clusters. As a result, we achieved clustered scale-free networks with a computational fashion, diverging from the recent studies by following a simple but efficient approach.

Power Laws, Scale-Free Networks and Genome Biology

CERN Document Server

Koonin, Eugene V; Karev, Georgy P

2006-01-01

Power Laws, Scale-free Networks and Genome Biology deals with crucial aspects of the theoretical foundations of systems biology, namely power law distributions and scale-free networks which have emerged as the hallmarks of biological organization in the post-genomic era. The chapters in the book not only describe the interesting mathematical properties of biological networks but moves beyond phenomenology, toward models of evolution capable of explaining the emergence of these features. The collection of chapters, contributed by both physicists and biologists, strives to address the problems in this field in a rigorous but not excessively mathematical manner and to represent different viewpoints, which is crucial in this emerging discipline. Each chapter includes, in addition to technical descriptions of properties of biological networks and evolutionary models, a more general and accessible introduction to the respective problems. Most chapters emphasize the potential of theoretical systems biology for disco...

Parameters affecting the resilience of scale-free networks to random failures.

Energy Technology Data Exchange (ETDEWEB)

Link, Hamilton E.; LaViolette, Randall A.; Lane, Terran (University of New Mexico, Albuquerque, NM); Saia, Jared (University of New Mexico, Albuquerque, NM)

2005-09-01

It is commonly believed that scale-free networks are robust to massive numbers of random node deletions. For example, Cohen et al. in (1) study scale-free networks including some which approximate the measured degree distribution of the Internet. Their results suggest that if each node in this network failed independently with probability 0.99, most of the remaining nodes would still be connected in a giant component. In this paper, we show that a large and important subclass of scale-free networks are not robust to massive numbers of random node deletions. In particular, we study scale-free networks which have minimum node degree of 1 and a power-law degree distribution beginning with nodes of degree 1 (power-law networks). We show that, in a power-law network approximating the Internet's reported distribution, when the probability of deletion of each node is 0.5 only about 25% of the surviving nodes in the network remain connected in a giant component, and the giant component does not persist beyond a critical failure rate of 0.9. The new result is partially due to improved analytical accommodation of the large number of degree-0 nodes that result after node deletions. Our results apply to power-law networks with a wide range of power-law exponents, including Internet-like networks. We give both analytical and empirical evidence that such networks are not generally robust to massive random node deletions.

Quantifying the connectivity of scale-free and biological networks

Energy Technology Data Exchange (ETDEWEB)

Shiner, J.S. E-mail: shiner@alumni.duke.edu; Davison, Matt E-mail: mdavison@uwo.ca

2004-07-01

Scale-free and biological networks follow a power law distribution p{sub k}{proportional_to}k{sup -{alpha}} for the probability that a node is connected to k other nodes; the corresponding ranges for {alpha} (biological: 1<{alpha}<2; scale-free: 2<{alpha}{<=}3) yield a diverging variance for the connectivity k and lack of predictability for the average connectivity. Predictability can be achieved with the Renyi, Tsallis and Landsberg-Vedral extended entropies and corresponding 'disorders' for correctly chosen values of the entropy index q. Escort distributions p{sub k}{proportional_to}k{sup -{alpha}}{sup q} with q>3/{alpha} also yield a nondiverging variance and predictability. It is argued that the Tsallis entropies may be the appropriate quantities for the study of scale-free and biological networks.

Sparse cliques trump scale-free networks in coordination and competition

Science.gov (United States)

Gianetto, David A.; Heydari, Babak

2016-02-01

Cooperative behavior, a natural, pervasive and yet puzzling phenomenon, can be significantly enhanced by networks. Many studies have shown how global network characteristics affect cooperation; however, it is difficult to understand how this occurs based on global factors alone, low-level network building blocks, or motifs are necessary. In this work, we systematically alter the structure of scale-free and clique networks and show, through a stochastic evolutionary game theory model, that cooperation on cliques increases linearly with community motif count. We further show that, for reactive stochastic strategies, network modularity improves cooperation in the anti-coordination Snowdrift game and the Prisoner’s Dilemma game but not in the Stag Hunt coordination game. We also confirm the negative effect of the scale-free graph on cooperation when effective payoffs are used. On the flip side, clique graphs are highly cooperative across social environments. Adding cycles to the acyclic scale-free graph increases cooperation when multiple games are considered; however, cycles have the opposite effect on how forgiving agents are when playing the Prisoner’s Dilemma game.

Scale-Free Networks and Commercial Air Carrier Transportation in the United States

Science.gov (United States)

Conway, Sheila R.

2004-01-01

Network science, or the art of describing system structure, may be useful for the analysis and control of large, complex systems. For example, networks exhibiting scale-free structure have been found to be particularly well suited to deal with environmental uncertainty and large demand growth. The National Airspace System may be, at least in part, a scalable network. In fact, the hub-and-spoke structure of the commercial segment of the NAS is an often-cited example of an existing scale-free network After reviewing the nature and attributes of scale-free networks, this assertion is put to the test: is commercial air carrier transportation in the United States well explained by this model? If so, are the positive attributes of these networks, e.g. those of efficiency, flexibility and robustness, fully realized, or could we effect substantial improvement? This paper first outlines attributes of various network types, then looks more closely at the common carrier air transportation network from perspectives of the traveler, the airlines, and Air Traffic Control (ATC). Network models are applied within each paradigm, including discussion of implied strengths and weaknesses of each model. Finally, known limitations of scalable networks are discussed. With an eye towards NAS operations, utilizing the strengths and avoiding the weaknesses of scale-free networks are addressed.

Evaluating the transport in small-world and scale-free networks

International Nuclear Information System (INIS)

Juárez-López, R.; Obregón-Quintana, B.; Hernández-Pérez, R.; Reyes-Ramírez, I.; Guzmán-Vargas, L.

2014-01-01

We present a study of some properties of transport in small-world and scale-free networks. Particularly, we compare two types of transport: subject to friction (electrical case) and in the absence of friction (maximum flow). We found that in clustered networks based on the Watts–Strogatz (WS) model, for both transport types the small-world configurations exhibit the best trade-off between local and global levels. For non-clustered WS networks the local transport is independent of the rewiring parameter, while the transport improves globally. Moreover, we analyzed both transport types in scale-free networks considering tendencies in the assortative or disassortative mixing of nodes. We construct the distribution of the conductance G and flow F to evaluate the effects of the assortative (disassortative) mixing, finding that for scale-free networks, as we introduce different levels of the degree–degree correlations, the power-law decay in the conductances is altered, while for the flow, the power-law tail remains unchanged. In addition, we analyze the effect on the conductance and the flow of the minimum degree and the shortest path between the source and destination nodes, finding notable differences between these two types of transport

Node-node correlations and transport properties in scale-free networks

Science.gov (United States)

Obregon, Bibiana; Guzman, Lev

2011-03-01

We study some transport properties of complex networks. We focus our attention on transport properties of scale-free and small-world networks and compare two types of transport: Electric and max-flow cases. In particular, we construct scale-free networks, with a given degree sequence, to estimate the distribution of conductances for different values of assortative/dissortative mixing. For the electric case we find that the distributions of conductances are affect ed by the assortative mixing of the network whereas for the max-flow case, the distributions almost do not show changes when node-node correlations are altered. Finally, we compare local and global transport in terms of the average conductance for the small-world (Watts-Strogatz) model

Effect of trap position on the efficiency of trapping in treelike scale-free networks

International Nuclear Information System (INIS)

Zhang Zhongzhi; Lin Yuan; Ma Youjun

2011-01-01

The conventional wisdom is that the role and impact of nodes on dynamical processes in scale-free networks are not homogenous, because of the presence of highly connected nodes at the tail of their power-law degree distribution. In this paper, we explore the influence of different nodes as traps on the trapping efficiency of the trapping problem taking place on scale-free networks. To this end, we study in detail the trapping problem in two families of deterministically growing scale-free networks with treelike structure: one family is non-fractal, the other is fractal. In the first part of this work, we attack a special case of random walks on the two network families with a perfect trap located at a hub, i.e. node with the highest degree. The second study addresses the case with trap distributed uniformly over all nodes in the networks. For these two cases, we compute analytically the mean trapping time (MTT), a quantitative indicator characterizing the trapping efficiency of the trapping process. We show that in the non-fractal scale-free networks the MTT for both cases follows different scalings with the network order (number of network nodes), implying that trap's position has a significant effect on the trapping efficiency. In contrast, it is presented that for both cases in the fractal scale-free networks, the two leading scalings exhibit the same dependence on the network order, suggesting that the location of trap has no essential impact on the trapping efficiency. We also show that for both cases of the trapping problem, the trapping efficiency is more efficient in the non-fractal scale-free networks than in their fractal counterparts.

Different behaviors of epidemic spreading in scale-free networks with identical degree sequence

Energy Technology Data Exchange (ETDEWEB)

Chu Xiangwei; Guan Jihong [School of Electronics and Information, Tongji University, 4800 Cao' an Road, Shanghai 201804 (China); Zhang Zhongzhi; Zhou Shuigeng [School of Computer Science, Fudan University, Shanghai 200433 (China); Li Mo, E-mail: zhangzz@fudan.edu.c, E-mail: jhguan@tongj.edu.c, E-mail: sgzhou@fudan.edu.c [Software School, Fudan University, Shanghai 200433 (China)

2010-02-12

Recently, the study of dynamical behaviors of the susceptible-infected (SI) disease model in complex networks, especially in Barabasi-Albert (BA) scale-free networks, has attracted much attention. Although some interesting phenomena have been observed, the formative reasons for those particular dynamical behaviors are still not well understood, despite the speculation that topological properties (for example the degree distribution) have a strong impact on epidemic spreading. In this paper, we study the evolution behaviors of epidemic spreading on a class of scale-free networks sharing identical degree sequence, and observe significantly different evolution behaviors in the whole family of networks. We show that the power-law degree distribution does not suffice to characterize the dynamical behaviors of disease diffusion on scale-free networks.

Different behaviors of epidemic spreading in scale-free networks with identical degree sequence

International Nuclear Information System (INIS)

Chu Xiangwei; Guan Jihong; Zhang Zhongzhi; Zhou Shuigeng; Li Mo

2010-01-01

Recently, the study of dynamical behaviors of the susceptible-infected (SI) disease model in complex networks, especially in Barabasi-Albert (BA) scale-free networks, has attracted much attention. Although some interesting phenomena have been observed, the formative reasons for those particular dynamical behaviors are still not well understood, despite the speculation that topological properties (for example the degree distribution) have a strong impact on epidemic spreading. In this paper, we study the evolution behaviors of epidemic spreading on a class of scale-free networks sharing identical degree sequence, and observe significantly different evolution behaviors in the whole family of networks. We show that the power-law degree distribution does not suffice to characterize the dynamical behaviors of disease diffusion on scale-free networks.

Utilizing Maximal Independent Sets as Dominating Sets in Scale-Free Networks

Science.gov (United States)

Derzsy, N.; Molnar, F., Jr.; Szymanski, B. K.; Korniss, G.

Dominating sets provide key solution to various critical problems in networked systems, such as detecting, monitoring, or controlling the behavior of nodes. Motivated by graph theory literature [Erdos, Israel J. Math. 4, 233 (1966)], we studied maximal independent sets (MIS) as dominating sets in scale-free networks. We investigated the scaling behavior of the size of MIS in artificial scale-free networks with respect to multiple topological properties (size, average degree, power-law exponent, assortativity), evaluated its resilience to network damage resulting from random failure or targeted attack [Molnar et al., Sci. Rep. 5, 8321 (2015)], and compared its efficiency to previously proposed dominating set selection strategies. We showed that, despite its small set size, MIS provides very high resilience against network damage. Using extensive numerical analysis on both synthetic and real-world (social, biological, technological) network samples, we demonstrate that our method effectively satisfies four essential requirements of dominating sets for their practical applicability on large-scale real-world systems: 1.) small set size, 2.) minimal network information required for their construction scheme, 3.) fast and easy computational implementation, and 4.) resiliency to network damage. Supported by DARPA, DTRA, and NSF.

Emergence of fractal scale-free networks from stochastic evolution on the Cayley tree

Energy Technology Data Exchange (ETDEWEB)

Chełminiak, Przemysław, E-mail: geronimo@amu.edu.pl

2013-11-29

An unexpected recognition of fractal topology in some real-world scale-free networks has evoked again an interest in the mechanisms stimulating their evolution. To explain this phenomenon a few models of a deterministic construction as well as a probabilistic growth controlled by a tunable parameter have been proposed so far. A quite different approach based on the fully stochastic evolution of the fractal scale-free networks presented in this Letter counterpoises these former ideas. It is argued that the diffusive evolution of the network on the Cayley tree shapes its fractality, self-similarity and the branching number criticality without any control parameter. The last attribute of the scale-free network is an intrinsic property of the skeleton, a special type of spanning tree which determines its fractality.

Scale-free models for the structure of business firm networks.

Science.gov (United States)

Kitsak, Maksim; Riccaboni, Massimo; Havlin, Shlomo; Pammolli, Fabio; Stanley, H Eugene

2010-03-01

We study firm collaborations in the life sciences and the information and communication technology sectors. We propose an approach to characterize industrial leadership using k -shell decomposition, with top-ranking firms in terms of market value in higher k -shell layers. We find that the life sciences industry network consists of three distinct components: a "nucleus," which is a small well-connected subgraph, "tendrils," which are small subgraphs consisting of small degree nodes connected exclusively to the nucleus, and a "bulk body," which consists of the majority of nodes. Industrial leaders, i.e., the largest companies in terms of market value, are in the highest k -shells of both networks. The nucleus of the life sciences sector is very stable: once a firm enters the nucleus, it is likely to stay there for a long time. At the same time we do not observe the above three components in the information and communication technology sector. We also conduct a systematic study of these three components in random scale-free networks. Our results suggest that the sizes of the nucleus and the tendrils in scale-free networks decrease as the exponent of the power-law degree distribution lambda increases, and disappear for lambda>or=3 . We compare the k -shell structure of random scale-free model networks with two real-world business firm networks in the life sciences and in the information and communication technology sectors. We argue that the observed behavior of the k -shell structure in the two industries is consistent with the coexistence of both preferential and random agreements in the evolution of industrial networks.

Cascading failure in the wireless sensor scale-free networks

Science.gov (United States)

Liu, Hao-Ran; Dong, Ming-Ru; Yin, Rong-Rong; Han, Li

2015-05-01

In the practical wireless sensor networks (WSNs), the cascading failure caused by a failure node has serious impact on the network performance. In this paper, we deeply research the cascading failure of scale-free topology in WSNs. Firstly, a cascading failure model for scale-free topology in WSNs is studied. Through analyzing the influence of the node load on cascading failure, the critical load triggering large-scale cascading failure is obtained. Then based on the critical load, a control method for cascading failure is presented. In addition, the simulation experiments are performed to validate the effectiveness of the control method. The results show that the control method can effectively prevent cascading failure. Project supported by the Natural Science Foundation of Hebei Province, China (Grant No. F2014203239), the Autonomous Research Fund of Young Teacher in Yanshan University (Grant No. 14LGB017) and Yanshan University Doctoral Foundation, China (Grant No. B867).

Network synchronization: optimal and pessimal scale-free topologies

International Nuclear Information System (INIS)

Donetti, Luca; Hurtado, Pablo I; Munoz, Miguel A

2008-01-01

By employing a recently introduced optimization algorithm we construct optimally synchronizable (unweighted) networks for any given scale-free degree distribution. We explore how the optimization process affects degree-degree correlations and observe a generic tendency toward disassortativity. Still, we show that there is not a one-to-one correspondence between synchronizability and disassortativity. On the other hand, we study the nature of optimally un-synchronizable networks, that is, networks whose topology minimizes the range of stability of the synchronous state. The resulting 'pessimal networks' turn out to have a highly assortative string-like structure. We also derive a rigorous lower bound for the Laplacian eigenvalue ratio controlling synchronizability, which helps understanding the impact of degree correlations on network synchronizability

Intermittent exploration on a scale-free network

International Nuclear Information System (INIS)

Ramezanpour, A

2007-02-01

We study an intermittent random walk on a random network of scale-free degree distribution. The walk is a combination of simple random walks of duration t w and random long-range jumps. While the time the walker needs to cover all the nodes increases with t w , the corresponding time for the edges displays a non monotonic behavior with a minimum for some nontrivial value of t w . This is a heterogeneity-induced effect that is not observed in homogeneous small-world networks. The optimal t w increases with the degree of assortativity in the network. Depending on the nature of degree correlations and the elapsed time the walker finds an over/underestimate of the degree distribution exponent. (author)

Trajectory Control of Scale-Free Dynamical Networks with Exogenous Disturbances

International Nuclear Information System (INIS)

Yang Hongyong; Zhang Shun; Zong Guangdeng

2011-01-01

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. (interdisciplinary physics and related areas of science and technology)

Network synchronization: optimal and pessimal scale-free topologies

Energy Technology Data Exchange (ETDEWEB)

Donetti, Luca [Departamento de Electronica y Tecnologia de Computadores and Instituto de Fisica Teorica y Computacional Carlos I, Facultad de Ciencias, Universidad de Granada, 18071 Granada (Spain); Hurtado, Pablo I; Munoz, Miguel A [Departamento de Electromagnetismo y Fisica de la Materia and Instituto Carlos I de Fisica Teorica y Computacional Facultad de Ciencias, Universidad de Granada, 18071 Granada (Spain)], E-mail: mamunoz@onsager.ugr.es

2008-06-06

By employing a recently introduced optimization algorithm we construct optimally synchronizable (unweighted) networks for any given scale-free degree distribution. We explore how the optimization process affects degree-degree correlations and observe a generic tendency toward disassortativity. Still, we show that there is not a one-to-one correspondence between synchronizability and disassortativity. On the other hand, we study the nature of optimally un-synchronizable networks, that is, networks whose topology minimizes the range of stability of the synchronous state. The resulting 'pessimal networks' turn out to have a highly assortative string-like structure. We also derive a rigorous lower bound for the Laplacian eigenvalue ratio controlling synchronizability, which helps understanding the impact of degree correlations on network synchronizability.

Emergence of super cooperation of prisoner's dilemma games on scale-free networks.

Directory of Open Access Journals (Sweden)

Angsheng Li

Full Text Available Recently, the authors proposed a quantum prisoner's dilemma game based on the spatial game of Nowak and May, and showed that the game can be played classically. By using this idea, we proposed three generalized prisoner's dilemma (GPD, for short games based on the weak Prisoner's dilemma game, the full prisoner's dilemma game and the normalized Prisoner's dilemma game, written by GPDW, GPDF and GPDN respectively. Our games consist of two players, each of which has three strategies: cooperator (C, defector (D and super cooperator (denoted by Q, and have a parameter γ to measure the entangled relationship between the two players. We found that our generalised prisoner's dilemma games have new Nash equilibrium principles, that entanglement is the principle of emergence and convergence (i.e., guaranteed emergence of super cooperation in evolutions of our generalised prisoner's dilemma games on scale-free networks, that entanglement provides a threshold for a phase transition of super cooperation in evolutions of our generalised prisoner's dilemma games on scale-free networks, that the role of heterogeneity of the scale-free networks in cooperations and super cooperations is very limited, and that well-defined structures of scale-free networks allow coexistence of cooperators and super cooperators in the evolutions of the weak version of our generalised prisoner's dilemma games.

Self-Organized Criticality in a Simple Neuron Model Based on Scale-Free Networks

International Nuclear Information System (INIS)

Lin Min; Wang Gang; Chen Tianlun

2006-01-01

A simple model for a set of interacting idealized neurons in scale-free networks is introduced. The basic elements of the model are endowed with the main features of a neuron function. We find that our model displays power-law behavior of avalanche sizes and generates long-range temporal correlation. More importantly, we find different dynamical behavior for nodes with different connectivity in the scale-free networks.

A Scalable Weight-Free Learning Algorithm for Regulatory Control of Cell Activity in Spiking Neuronal Networks.

Science.gov (United States)

Zhang, Xu; Foderaro, Greg; Henriquez, Craig; Ferrari, Silvia

2018-03-01

Recent developments in neural stimulation and recording technologies are providing scientists with the ability of recording and controlling the activity of individual neurons in vitro or in vivo, with very high spatial and temporal resolution. Tools such as optogenetics, for example, are having a significant impact in the neuroscience field by delivering optical firing control with the precision and spatiotemporal resolution required for investigating information processing and plasticity in biological brains. While a number of training algorithms have been developed to date for spiking neural network (SNN) models of biological neuronal circuits, exiting methods rely on learning rules that adjust the synaptic strengths (or weights) directly, in order to obtain the desired network-level (or functional-level) performance. As such, they are not applicable to modifying plasticity in biological neuronal circuits, in which synaptic strengths only change as a result of pre- and post-synaptic neuron firings or biological mechanisms beyond our control. This paper presents a weight-free training algorithm that relies solely on adjusting the spatiotemporal delivery of neuron firings in order to optimize the network performance. The proposed weight-free algorithm does not require any knowledge of the SNN model or its plasticity mechanisms. As a result, this training approach is potentially realizable in vitro or in vivo via neural stimulation and recording technologies, such as optogenetics and multielectrode arrays, and could be utilized to control plasticity at multiple scales of biological neuronal circuits. The approach is demonstrated by training SNNs with hundreds of units to control a virtual insect navigating in an unknown environment.

Consensus of Multi-Agent Systems with Prestissimo Scale-Free Networks

International Nuclear Information System (INIS)

Yang Hongyong; Lu Lan; Cao Kecai; Zhang Siying

2010-01-01

In this paper, the relations of the network topology and the moving consensus of multi-agent systems are studied. A consensus-prestissimo scale-free network model with the static preferential-consensus attachment is presented on the rewired link of the regular network. The effects of the static preferential-consensus BA network on the algebraic connectivity of the topology graph are compared with the regular network. The robustness gain to delay is analyzed for variable network topology with the same scale. The time to reach the consensus is studied for the dynamic network with and without communication delays. By applying the computer simulations, it is validated that the speed of the convergence of multi-agent systems can be greatly improved in the preferential-consensus BA network model with different configuration. (interdisciplinary physics and related areas of science and technology)

Small-World and Scale-Free Network Models for IoT Systems

Directory of Open Access Journals (Sweden)

Insoo Sohn

2017-01-01

Full Text Available It is expected that Internet of Things (IoT revolution will enable new solutions and business for consumers and entrepreneurs by connecting billions of physical world devices with varying capabilities. However, for successful realization of IoT, challenges such as heterogeneous connectivity, ubiquitous coverage, reduced network and device complexity, enhanced power savings, and enhanced resource management have to be solved. All these challenges are heavily impacted by the IoT network topology supported by massive number of connected devices. Small-world networks and scale-free networks are important complex network models with massive number of nodes and have been actively used to study the network topology of brain networks, social networks, and wireless networks. These models, also, have been applied to IoT networks to enhance synchronization, error tolerance, and more. However, due to interdisciplinary nature of the network science, with heavy emphasis on graph theory, it is not easy to study the various tools provided by complex network models. Therefore, in this paper, we attempt to introduce basic concepts of graph theory, including small-world networks and scale-free networks, and provide system models that can be easily implemented to be used as a powerful tool in solving various research problems related to IoT.

Efficient weighting strategy for enhancing synchronizability of complex networks

Science.gov (United States)

Wang, Youquan; Yu, Feng; Huang, Shucheng; Tu, Juanjuan; Chen, Yan

2018-04-01

Networks with high propensity to synchronization are desired in many applications ranging from biology to engineering. In general, there are two ways to enhance the synchronizability of a network: link rewiring and/or link weighting. In this paper, we propose a new link weighting strategy based on the concept of the neighborhood subgroup. The neighborhood subgroup of a node i through node j in a network, i.e. Gi→j, means that node u belongs to Gi→j if node u belongs to the first-order neighbors of j (not include i). Our proposed weighting schema used the local and global structural properties of the networks such as the node degree, betweenness centrality and closeness centrality measures. We applied the method on scale-free and Watts-Strogatz networks of different structural properties and show the good performance of the proposed weighting scheme. Furthermore, as model networks cannot capture all essential features of real-world complex networks, we considered a number of undirected and unweighted real-world networks. To the best of our knowledge, the proposed weighting strategy outperformed the previously published weighting methods by enhancing the synchronizability of these real-world networks.

Impact of interaction style and degree on the evolution of cooperation on Barabási-Albert scale-free network.

Directory of Open Access Journals (Sweden)

Fengjie Xie

Full Text Available In this work, we study an evolutionary prisoner's dilemma game (PDG on Barabási-Albert scale-free networks with limited player interactions, and explore the effect of interaction style and degree on cooperation. The results show that high-degree preference interaction, namely the most applicable interaction in the real world, is less beneficial for emergence of cooperation on scale-free networks than random interaction. Besides, cooperation on scale-free networks is enhanced with the increase of interaction degree regardless whether the interaction is high-degree preference or random. If the interaction degree is very low, the cooperation level on scale-free networks is much lower than that on regular ring networks, which is against the common belief that scale-free networks must be more beneficial for cooperation. Our analysis indicates that the interaction relations, the strategy and the game payoff of high-connectivity players play important roles in the evolution of cooperation on scale-free networks. A certain number of interactions are necessary for scale-free networks to exhibit strong capability of facilitating cooperation. Our work provides important insight for members on how to interact with others in a social organization.

Synchronization in scale-free networks: The role of finite-size effects

Science.gov (United States)

Torres, D.; Di Muro, M. A.; La Rocca, C. E.; Braunstein, L. A.

2015-06-01

Synchronization problems in complex networks are very often studied by researchers due to their many applications to various fields such as neurobiology, e-commerce and completion of tasks. In particular, scale-free networks with degree distribution P(k)∼ k-λ , are widely used in research since they are ubiquitous in Nature and other real systems. In this paper we focus on the surface relaxation growth model in scale-free networks with 2.5< λ <3 , and study the scaling behavior of the fluctuations, in the steady state, with the system size N. We find a novel behavior of the fluctuations characterized by a crossover between two regimes at a value of N=N* that depends on λ: a logarithmic regime, found in previous research, and a constant regime. We propose a function that describes this crossover, which is in very good agreement with the simulations. We also find that, for a system size above N* , the fluctuations decrease with λ, which means that the synchronization of the system improves as λ increases. We explain this crossover analyzing the role of the network's heterogeneity produced by the system size N and the exponent of the degree distribution.

Effect of clustering on attack vulnerability of interdependent scale-free networks

International Nuclear Information System (INIS)

Li, Rui-qi; Sun, Shi-wen; Ma, Yi-lin; Wang, Li; Xia, Cheng-yi

2015-01-01

In order to deeply understand the complex interdependent systems, it is of great concern to take clustering coefficient, which is an important feature of many real-world systems, into account. Previous study mainly focused on the impact of clustering on interdependent networks under random attacks, while we extend the study to the case of the more realistic attacking strategy, targeted attack. A system composed of two interdependent scale-free networks with tunable clustering is provided. The effects of coupling strength and coupling preference on attack vulnerability are explored. Numerical simulation results demonstrate that interdependent links between two networks make the entire system much more fragile to attacks. Also, it is found that clustering significantly increases the vulnerability of interdependent scale-free networks. Moreover, for fully coupled network, disassortative coupling is found to be most vulnerable to random attacks, while the random and assortative coupling have little difference. Additionally, enhancing coupling strength can greatly enhance the fragility of interdependent networks against targeted attacks. These results can not only improve the deep understanding of structural complexity of complex systems, but also provide insights into the guidance of designing resilient infrastructures.

Sandpile on scale-free networks with assortative mixing

International Nuclear Information System (INIS)

Yin Yanping; Zhang Duanming; Pan Guijun; He Minhua; Tan Jin

2007-01-01

We numerically investigate the Bak-Tang-Wiesenfeld sandpile model on scale-free networks with assortative mixing, where the threshold height of each node is equal to its degree. It is observed that a large fraction of multiple topplings are included in avalanches on assortative networks, which is absent on uncorrelated networks. We introduce a parameter F-bar(a) to characterize the fraction of multiple topplings in avalanches of area a. The fraction of multiple topplings increases dramatically with the degree of assortativity and has a peak for small a whose height also increase with the assortativity of the networks. Unlike the case on uncorrelated networks, the distributions of avalanche size, area and duration do not follow pure power law, but deviate more obviously from pure power law with the growing degree of assortativity. The results show that the assortative mixing has a strong influence on the behavior of avalanche dynamics on complex networks

Improved Efficient Routing Strategy on Scale-Free Networks

Science.gov (United States)

Jiang, Zhong-Yuan; Liang, Man-Gui

Since the betweenness of nodes in complex networks can theoretically represent the traffic load of nodes under the currently used routing strategy, we propose an improved efficient (IE) routing strategy to enhance to the network traffic capacity based on the betweenness centrality. Any node with the highest betweenness is susceptible to traffic congestion. An efficient way to improve the network traffic capacity is to redistribute the heavy traffic load from these central nodes to non-central nodes, so in this paper, we firstly give a path cost function by considering the sum of node betweenness with a tunable parameter β along the actual path. Then, by minimizing the path cost, our IE routing strategy achieved obvious improvement on the network transport efficiency. Simulations on scale-free Barabási-Albert (BA) networks confirmed the effectiveness of our strategy, when compared with the efficient routing (ER) and the shortest path (SP) routing.

Physics of flow in weighted complex networks

Science.gov (United States)

Wu, Zhenhua

This thesis uses concepts from statistical physics to understand the physics of flow in weighted complex networks. The traditional model for random networks is the Erdoḧs-Renyi (ER.) network, where a network of N nodes is created by connecting each of the N(N - 1)/2 pairs of nodes with a probability p. The degree distribution, which is the probability distribution of the number of links per node, is a Poisson distribution. Recent studies of the topology in many networks such as the Internet and the world-wide airport network (WAN) reveal a power law degree distribution, known as a scale-free (SF) distribution. To yield a better description of network dynamics, we study weighted networks, where each link or node is given a number. One asks how the weights affect the static and the dynamic properties of the network. In this thesis, two important dynamic problems are studied: the current flow problem, described by Kirchhoff's laws, and the maximum flow problem, which maximizes the flow between two nodes. Percolation theory is applied to these studies of the dynamics in complex networks. We find that the current flow in disordered media belongs to the same universality class as the optimal path. In a randomly weighted network, we identify the infinite incipient percolation cluster as the "superhighway", which contains most of the traffic in a network. We propose an efficient strategy to improve significantly the global transport by improving the superhighways, which comprise a small fraction of the network. We also propose a network model with correlated weights to describe weighted networks such as the WAN. Our model agrees with WAN data, and provides insight into the advantages of correlated weights in networks. Lastly, the upper critical dimension is evaluated using two different numerical methods, and the result is consistent with the theoretical prediction.

Cooperative Dynamics in Lattice-Embedded Scale-Free Networks

International Nuclear Information System (INIS)

Shang Lihui; Zhang Mingji; Yang Yanqing

2009-01-01

We investigate cooperative behaviors of lattice-embedded scale-free networking agents in the prisoner's dilemma game model by employing two initial strategy distribution mechanisms, which are specific distribution to the most connected sites (hubs) and random distribution. Our study indicates that the game dynamics crucially depends on the underlying spatial network structure with different strategy distribution mechanism. The cooperators' specific distribution contributes to an enhanced level of cooperation in the system compared with random one, and cooperation is robust to cooperators' specific distribution but fragile to defectors' specific distribution. Especially, unlike the specific case, increasing heterogeneity of network does not always favor the emergence of cooperation under random mechanism. Furthermore, we study the geographical effects and find that the graphically constrained network structure tends to improve the evolution of cooperation in random case and in specific one for a large temptation to defect.

Non-equilibrium mean-field theories on scale-free networks

International Nuclear Information System (INIS)

Caccioli, Fabio; Dall'Asta, Luca

2009-01-01

Many non-equilibrium processes on scale-free networks present anomalous critical behavior that is not explained by standard mean-field theories. We propose a systematic method to derive stochastic equations for mean-field order parameters that implicitly account for the degree heterogeneity. The method is used to correctly predict the dynamical critical behavior of some binary spin models and reaction–diffusion processes. The validity of our non-equilibrium theory is further supported by showing its relation with the generalized Landau theory of equilibrium critical phenomena on networks

Analysis of a large-scale weighted network of one-to-one human communication

International Nuclear Information System (INIS)

Onnela, Jukka-Pekka; Saramaeki, Jari; Hyvoenen, Joerkki; Szabo, Gabor; Menezes, M Argollo de; Kaski, Kimmo; Barabasi, Albert-Laszlo; Kertesz, Janos

2007-01-01

We construct a connected network of 3.9 million nodes from mobile phone call records, which can be regarded as a proxy for the underlying human communication network at the societal level. We assign two weights on each edge to reflect the strength of social interaction, which are the aggregate call duration and the cumulative number of calls placed between the individuals over a period of 18 weeks. We present a detailed analysis of this weighted network by examining its degree, strength, and weight distributions, as well as its topological assortativity and weighted assortativity, clustering and weighted clustering, together with correlations between these quantities. We give an account of motif intensity and coherence distributions and compare them to a randomized reference system. We also use the concept of link overlap to measure the number of common neighbours any two adjacent nodes have, which serves as a useful local measure for identifying the interconnectedness of communities. We report a positive correlation between the overlap and weight of a link, thus providing strong quantitative evidence for the weak ties hypothesis, a central concept in social network analysis. The percolation properties of the network are found to depend on the type and order of removed links, and they can help understand how the local structure of the network manifests itself at the global level. We hope that our results will contribute to modelling weighted large-scale social networks, and believe that the systematic approach followed here can be adopted to study other weighted networks

Analysis of a large-scale weighted network of one-to-one human communication

Science.gov (United States)

Onnela, Jukka-Pekka; Saramäki, Jari; Hyvönen, Jörkki; Szabó, Gábor; Argollo de Menezes, M.; Kaski, Kimmo; Barabási, Albert-László; Kertész, János

2007-06-01

We construct a connected network of 3.9 million nodes from mobile phone call records, which can be regarded as a proxy for the underlying human communication network at the societal level. We assign two weights on each edge to reflect the strength of social interaction, which are the aggregate call duration and the cumulative number of calls placed between the individuals over a period of 18 weeks. We present a detailed analysis of this weighted network by examining its degree, strength, and weight distributions, as well as its topological assortativity and weighted assortativity, clustering and weighted clustering, together with correlations between these quantities. We give an account of motif intensity and coherence distributions and compare them to a randomized reference system. We also use the concept of link overlap to measure the number of common neighbours any two adjacent nodes have, which serves as a useful local measure for identifying the interconnectedness of communities. We report a positive correlation between the overlap and weight of a link, thus providing strong quantitative evidence for the weak ties hypothesis, a central concept in social network analysis. The percolation properties of the network are found to depend on the type and order of removed links, and they can help understand how the local structure of the network manifests itself at the global level. We hope that our results will contribute to modelling weighted large-scale social networks, and believe that the systematic approach followed here can be adopted to study other weighted networks.

Analysis of a large-scale weighted network of one-to-one human communication

Energy Technology Data Exchange (ETDEWEB)

Onnela, Jukka-Pekka [Laboratory of Computational Engineering, Helsinki University of Technology (Finland); Saramaeki, Jari [Laboratory of Computational Engineering, Helsinki University of Technology (Finland); Hyvoenen, Joerkki [Laboratory of Computational Engineering, Helsinki University of Technology (Finland); Szabo, Gabor [Department of Physdics and Center for Complex Networks Research, University of Notre Dame, IN (United States); Menezes, M Argollo de [Department of Physdics and Center for Complex Networks Research, University of Notre Dame, IN (United States); Kaski, Kimmo [Laboratory of Computational Engineering, Helsinki University of Technology (Finland); Barabasi, Albert-Laszlo [Department of Physdics and Center for Complex Networks Research, University of Notre Dame, IN (United States); Kertesz, Janos [Laboratory of Computational Engineering, Helsinki University of Technology (Finland)

2007-06-15

We construct a connected network of 3.9 million nodes from mobile phone call records, which can be regarded as a proxy for the underlying human communication network at the societal level. We assign two weights on each edge to reflect the strength of social interaction, which are the aggregate call duration and the cumulative number of calls placed between the individuals over a period of 18 weeks. We present a detailed analysis of this weighted network by examining its degree, strength, and weight distributions, as well as its topological assortativity and weighted assortativity, clustering and weighted clustering, together with correlations between these quantities. We give an account of motif intensity and coherence distributions and compare them to a randomized reference system. We also use the concept of link overlap to measure the number of common neighbours any two adjacent nodes have, which serves as a useful local measure for identifying the interconnectedness of communities. We report a positive correlation between the overlap and weight of a link, thus providing strong quantitative evidence for the weak ties hypothesis, a central concept in social network analysis. The percolation properties of the network are found to depend on the type and order of removed links, and they can help understand how the local structure of the network manifests itself at the global level. We hope that our results will contribute to modelling weighted large-scale social networks, and believe that the systematic approach followed here can be adopted to study other weighted networks.

Mobile user forecast and power-law acceleration invariance of scale-free networks

International Nuclear Information System (INIS)

Guo Jin-Li; Guo Zhao-Hua; Liu Xue-Jiao

2011-01-01

This paper studies and predicts the number growth of China's mobile users by using the power-law regression. We find that the number growth of the mobile users follows a power law. Motivated by the data on the evolution of the mobile users, we consider scenarios of self-organization of accelerating growth networks into scale-free structures and propose a directed network model, in which the nodes grow following a power-law acceleration. The expressions for the transient and the stationary average degree distributions are obtained by using the Poisson process. This result shows that the model generates appropriate power-law connectivity distributions. Therefore, we find a power-law acceleration invariance of the scale-free networks. The numerical simulations of the models agree with the analytical results well. (interdisciplinary physics and related areas of science and technology)

Efficient routing on scale-free networks based on local information

International Nuclear Information System (INIS)

Yin Chuanyang; Wang Binghong; Wang Wenxu; Zhou Tao; Yang Huijie

2006-01-01

In this Letter, we propose a new routing strategy with a single tunable parameter α only based on local information of network topology. The probability that a given node i with degree k i receives packets from its neighbors is proportional to k i α . In order to maximize the packets handling capacity of underlying structure that can be measured by the critical point of continuous phase transition from free flow to congestion, the optimal value of α is sought out. Through investigating the distributions of queue length on each node in free state, we give an explanation why the delivering capacity of the network can be enhanced by choosing the optimal α. Furthermore, dynamic properties right after the critical point are also studied. Interestingly, it is found that although the system enters the congestion state, it still possesses partial delivering capability which does not depend on α. This phenomenon suggests that the capacity of the scale-free network can be enhanced by increasing the forwarding ability of small important nodes which bear severe congestion

An Efficient Causal Group Communication Protocol for Free Scale Peer-to-Peer Networks

Directory of Open Access Journals (Sweden)

Grigory Evropeytsev

2016-08-01

Full Text Available In peer-to-peer (P2P overlay networks, a group of n (≥2 peer processes have to cooperate with each other. Each peer sends messages to every peer and receives messages from every peer in a group. In group communications, each message sent by a peer is required to be causally delivered to every peer. Most of the protocols designed to ensure causal message order are designed for networks with a plain architecture. These protocols can be adapted to use in free scale and hierarchical topologies; however, the amount of control information is O(n, where n is the number of peers in the system. Some protocols are designed for a free scale or hierarchical networks, but in general they force the whole system to accomplish the same order viewed by a super peer. In this paper, we present a protocol that is specifically designed to work with a free scale peer-to-peer network. By using the information about the network’s architecture and by representing message dependencies on a bit level, the proposed protocol ensures causal message ordering without enforcing super peers order. The designed protocol is simulated and compared with the Immediate Dependency Relation and the Dependency Sequences protocols to show its lower overhead.

Emergence of Scale-Free Syntax Networks

Science.gov (United States)

Corominas-Murtra, Bernat; Valverde, Sergi; Solé, Ricard V.

The evolution of human language allowed the efficient propagation of nongenetic information, thus creating a new form of evolutionary change. Language development in children offers the opportunity of exploring the emergence of such complex communication system and provides a window to understanding the transition from protolanguage to language. Here we present the first analysis of the emergence of syntax in terms of complex networks. A previously unreported, sharp transition is shown to occur around two years of age from a (pre-syntactic) tree-like structure to a scale-free, small world syntax network. The observed combinatorial patterns provide valuable data to understand the nature of the cognitive processes involved in the acquisition of syntax, introducing a new ingredient to understand the possible biological endowment of human beings which results in the emergence of complex language. We explore this problem by using a minimal, data-driven model that is able to capture several statistical traits, but some key features related to the emergence of syntactic complexity display important divergences.

Multiple synchronization transitions in scale-free neuronal networks with electrical and chemical hybrid synapses

International Nuclear Information System (INIS)

Liu, Chen; Wang, Jiang; Wang, Lin; Yu, Haitao; Deng, Bin; Wei, Xile; Tsang, Kaiming; Chan, Wailok

2014-01-01

Highlights: • Synchronization transitions in hybrid scale-free neuronal networks are investigated. • Multiple synchronization transitions can be induced by the time delay. • Effect of synchronization transitions depends on the ratio of the electrical and chemical synapses. • Coupling strength and the density of inter-neuronal links can enhance the synchronization. -- Abstract: The impacts of information transmission delay on the synchronization transitions in scale-free neuronal networks with electrical and chemical hybrid synapses are investigated. Numerical results show that multiple appearances of synchronization regions transitions can be induced by different information transmission delays. With the time delay increasing, the synchronization of neuronal activities can be enhanced or destroyed, irrespective of the probability of chemical synapses in the whole hybrid neuronal network. In particular, for larger probability of electrical synapses, the regions of synchronous activities appear broader with stronger synchronization ability of electrical synapses compared with chemical ones. Moreover, it can be found that increasing the coupling strength can promote synchronization monotonously, playing the similar role of the increasing the probability of the electrical synapses. Interestingly, the structures and parameters of the scale-free neuronal networks, especially the structural evolvement plays a more subtle role in the synchronization transitions. In the network formation process, it is found that every new vertex is attached to the more old vertices already present in the network, the more synchronous activities will be emerge

Self-Organization in Coupled Map Scale-Free Networks

International Nuclear Information System (INIS)

Xiao-Ming, Liang; Zong-Hua, Liu; Hua-Ping, Lü

2008-01-01

We study the self-organization of phase synchronization in coupled map scale-free networks with chaotic logistic map at each node and find that a variety of ordered spatiotemporal patterns emerge spontaneously in a regime of coupling strength. These ordered behaviours will change with the increase of the average links and are robust to both the system size and parameter mismatch. A heuristic theory is given to explain the mechanism of self-organization and to figure out the regime of coupling for the ordered spatiotemporal patterns

Opinion formation on multiplex scale-free networks

Science.gov (United States)

Nguyen, Vu Xuan; Xiao, Gaoxi; Xu, Xin-Jian; Li, Guoqi; Wang, Zhen

2018-01-01

Most individuals, if not all, live in various social networks. The formation of opinion systems is an outcome of social interactions and information propagation occurring in such networks. We study the opinion formation with a new rule of pairwise interactions in the novel version of the well-known Deffuant model on multiplex networks composed of two layers, each of which is a scale-free network. It is found that in a duplex network composed of two identical layers, the presence of the multiplexity helps either diminish or enhance opinion diversity depending on the relative magnitudes of tolerance ranges characterizing the degree of openness/tolerance on both layers: there is a steady separation between different regions of tolerance range values on two network layers where multiplexity plays two different roles, respectively. Additionally, the two critical tolerance ranges follow a one-sum rule; that is, each of the layers reaches a complete consensus only if the sum of the tolerance ranges on the two layers is greater than a constant approximately equaling 1, the double of the critical bound on a corresponding isolated network. A further investigation of the coupling between constituent layers quantified by a link overlap parameter reveals that as the layers are loosely coupled, the two opinion systems co-evolve independently, but when the inter-layer coupling is sufficiently strong, a monotonic behavior is observed: an increase in the tolerance range of a layer causes a decline in the opinion diversity on the other layer regardless of the magnitudes of tolerance ranges associated with the layers in question.

Scale free effects in world currency exchange network

Science.gov (United States)

Górski, A. Z.; Drożdż, S.; Kwapień, J.

2008-11-01

A large collection of daily time series for 60 world currencies' exchange rates is considered. The correlation matrices are calculated and the corresponding Minimal Spanning Tree (MST) graphs are constructed for each of those currencies used as reference for the remaining ones. It is shown that multiplicity of the MST graphs' nodes to a good approximation develops a power like, scale free distribution with the scaling exponent similar as for several other complex systems studied so far. Furthermore, quantitative arguments in favor of the hierarchical organization of the world currency exchange network are provided by relating the structure of the above MST graphs and their scaling exponents to those that are derived from an exactly solvable hierarchical network model. A special status of the USD during the period considered can be attributed to some departures of the MST features, when this currency (or some other tied to it) is used as reference, from characteristics typical to such a hierarchical clustering of nodes towards those that correspond to the random graphs. Even though in general the basic structure of the MST is robust with respect to changing the reference currency some trace of a systematic transition from somewhat dispersed - like the USD case - towards more compact MST topology can be observed when correlations increase.

Heuristic algorithm for determination of local properties of scale-free networks

CERN Document Server

Mitrovic, M

2006-01-01

Complex networks are everywhere. Many phenomena in nature can be modeled as networks: - brain structures - protein-protein interaction networks - social interactions - the Internet and WWW. They can be represented in terms of nodes and edges connecting them. Important characteristics: - these networks are not random; they have a structured architecture. Structure of different networks are similar: - all have power law degree distribution (scale-free property) - despite large size there is usually relatively short path between any two nodes (small world property). Global characteristics: - degree distribution, clustering coefficient and the diameter. Local structure: - frequency of subgraphs of given type (subgraph of order k is a part of the network consisting of k nodes and edges between them). There are different types of subgraphs of the same order.

Weighted tunable clustering in local-world networks with increment behavior

International Nuclear Information System (INIS)

Ma, Ying-Hong; Li, Huijia; Zhang, Xiao-Dong

2010-01-01

Since some realistic networks are influenced not only by increment behavior but also by the tunable clustering mechanism with new nodes to be added to networks, it is interesting to characterize the model for those actual networks. In this paper, a weighted local-world model, which incorporates increment behavior and the tunable clustering mechanism, is proposed and its properties are investigated, such as degree distribution and clustering coefficient. Numerical simulations are fitted to the model and also display good right-skewed scale-free properties. Furthermore, the correlation of vertices in our model is studied which shows the assortative property. The epidemic spreading process by weighted transmission rate on the model shows that the tunable clustering behavior has a great impact on the epidemic dynamic

Global forward-predicting dynamic routing for traffic concurrency space stereo multi-layer scale-free network

International Nuclear Information System (INIS)

Xie Wei-Hao; Zhou Bin; Liu En-Xiao; Lu Wei-Dang; Zhou Ting

2015-01-01

Many real communication networks, such as oceanic monitoring network and land environment observation network, can be described as space stereo multi-layer structure, and the traffic in these networks is concurrent. Understanding how traffic dynamics depend on these real communication networks and finding an effective routing strategy that can fit the circumstance of traffic concurrency and enhance the network performance are necessary. In this light, we propose a traffic model for space stereo multi-layer complex network and introduce two kinds of global forward-predicting dynamic routing strategies, global forward-predicting hybrid minimum queue (HMQ) routing strategy and global forward-predicting hybrid minimum degree and queue (HMDQ) routing strategy, for traffic concurrency space stereo multi-layer scale-free networks. By applying forward-predicting strategy, the proposed routing strategies achieve better performances in traffic concurrency space stereo multi-layer scale-free networks. Compared with the efficient routing strategy and global dynamic routing strategy, HMDQ and HMQ routing strategies can optimize the traffic distribution, alleviate the number of congested packets effectively and reach much higher network capacity. (paper)

Complex networks with scale-free nature and hierarchical modularity

Science.gov (United States)

Shekatkar, Snehal M.; Ambika, G.

2015-09-01

Generative mechanisms which lead to empirically observed structure of networked systems from diverse fields like biology, technology and social sciences form a very important part of study of complex networks. The structure of many networked systems like biological cell, human society and World Wide Web markedly deviate from that of completely random networks indicating the presence of underlying processes. Often the main process involved in their evolution is the addition of links between existing nodes having a common neighbor. In this context we introduce an important property of the nodes, which we call mediating capacity, that is generic to many networks. This capacity decreases rapidly with increase in degree, making hubs weak mediators of the process. We show that this property of nodes provides an explanation for the simultaneous occurrence of the observed scale-free structure and hierarchical modularity in many networked systems. This also explains the high clustering and small-path length seen in real networks as well as non-zero degree-correlations. Our study also provides insight into the local process which ultimately leads to emergence of preferential attachment and hence is also important in understanding robustness and control of real networks as well as processes happening on real networks.

Improved routing strategies for data traffic in scale-free networks

International Nuclear Information System (INIS)

Wu, Zhi-Xi; Peng, Gang; Wong, Wing-Ming; Yeung, Kai-Hau

2008-01-01

We study the information packet routing process in scale-free networks by mimicking Internet traffic delivery. We incorporate both the global shortest paths information and local degree information of the network in the dynamic process, via two tunable parameters, α and β, to guide the packet routing. We measure the performance of the routing method by both the average transit times of packets and the critical packet generation rate (above which packet aggregation occurs in the network). We found that the routing strategies which integrate ingredients of both global and local topological information of the underlying networks perform much better than the traditional shortest path routing protocol taking into account the global topological information only. Moreover, by doing comparative studies with some related works, we found that the performance of our proposed method shows universal efficiency characteristic against the amount of traffic

s-core network decomposition: A generalization of k-core analysis to weighted networks

Science.gov (United States)

Eidsaa, Marius; Almaas, Eivind

2013-12-01

A broad range of systems spanning biology, technology, and social phenomena may be represented and analyzed as complex networks. Recent studies of such networks using k-core decomposition have uncovered groups of nodes that play important roles. Here, we present s-core analysis, a generalization of k-core (or k-shell) analysis to complex networks where the links have different strengths or weights. We demonstrate the s-core decomposition approach on two random networks (ER and configuration model with scale-free degree distribution) where the link weights are (i) random, (ii) correlated, and (iii) anticorrelated with the node degrees. Finally, we apply the s-core decomposition approach to the protein-interaction network of the yeast Saccharomyces cerevisiae in the context of two gene-expression experiments: oxidative stress in response to cumene hydroperoxide (CHP), and fermentation stress response (FSR). We find that the innermost s-cores are (i) different from innermost k-cores, (ii) different for the two stress conditions CHP and FSR, and (iii) enriched with proteins whose biological functions give insight into how yeast manages these specific stresses.

Phase transitions in scale-free neural networks: Departure from the standard mean-field universality class

International Nuclear Information System (INIS)

Aldana, Maximino; Larralde, Hernan

2004-01-01

We investigate the nature of the phase transition from an ordered to a disordered state that occurs in a family of neural network models with noise. These models are closely related to the majority voter model, where a ferromagneticlike interaction between the elements prevails. Each member of the family is distinguished by the network topology, which is determined by the probability distribution of the number of incoming links. We show that for homogeneous random topologies, the phase transition belongs to the standard mean-field universality class, characterized by the order parameter exponent β=1/2. However, for scale-free networks we obtain phase transition exponents ranging from 1/2 to infinity. Furthermore, we show the existence of a phase transition even for values of the scale-free exponent in the interval (1.5,2], where the average network connectivity diverges

Generating Billion-Edge Scale-Free Networks in Seconds: Performance Study of a Novel GPU-based Preferential Attachment Model

Energy Technology Data Exchange (ETDEWEB)

Perumalla, Kalyan S. [Oak Ridge National Lab. (ORNL), Oak Ridge, TN (United States); Alam, Maksudul [Oak Ridge National Lab. (ORNL), Oak Ridge, TN (United States)

2017-10-01

A novel parallel algorithm is presented for generating random scale-free networks using the preferential-attachment model. The algorithm, named cuPPA, is custom-designed for single instruction multiple data (SIMD) style of parallel processing supported by modern processors such as graphical processing units (GPUs). To the best of our knowledge, our algorithm is the first to exploit GPUs, and also the fastest implementation available today, to generate scale free networks using the preferential attachment model. A detailed performance study is presented to understand the scalability and runtime characteristics of the cuPPA algorithm. In one of the best cases, when executed on an NVidia GeForce 1080 GPU, cuPPA generates a scale free network of a billion edges in less than 2 seconds.

Synchronous bursts on scale-free neuronal networks with attractive and repulsive coupling.

Directory of Open Access Journals (Sweden)

Qingyun Wang

Full Text Available This paper investigates the dependence of synchronization transitions of bursting oscillations on the information transmission delay over scale-free neuronal networks with attractive and repulsive coupling. It is shown that for both types of coupling, the delay always plays a subtle role in either promoting or impairing synchronization. In particular, depending on the inherent oscillation period of individual neurons, regions of irregular and regular propagating excitatory fronts appear intermittently as the delay increases. These delay-induced synchronization transitions are manifested as well-expressed minima in the measure for spatiotemporal synchrony. For attractive coupling, the minima appear at every integer multiple of the average oscillation period, while for the repulsive coupling, they appear at every odd multiple of the half of the average oscillation period. The obtained results are robust to the variations of the dynamics of individual neurons, the system size, and the neuronal firing type. Hence, they can be used to characterize attractively or repulsively coupled scale-free neuronal networks with delays.

Opinion Spreading with Mobility on Scale-Free Networks

International Nuclear Information System (INIS)

Qiang, Guo; Xing-Wen, Chen; Jian-Guo, Liu; Bing-Hong, Wang; Tao, Zhou; Yu-Hua, Yao

2008-01-01

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 in 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 O c (t) quickly decreases in an exponential form, while if it reaches the incoherent state finally O c (t) decreases slowly and has the punctuated equilibrium characteristic

A local adaptive algorithm for emerging scale-free hierarchical networks

International Nuclear Information System (INIS)

Gomez Portillo, I J; Gleiser, P M

2010-01-01

In this work we study a growing network model with chaotic dynamical units that evolves using a local adaptive rewiring algorithm. Using numerical simulations we show that the model allows for the emergence of hierarchical networks. First, we show that the networks that emerge with the algorithm present a wide degree distribution that can be fitted by a power law function, and thus are scale-free networks. Using the LaNet-vi visualization tool we present a graphical representation that reveals a central core formed only by hubs, and also show the presence of a preferential attachment mechanism. In order to present a quantitative analysis of the hierarchical structure we analyze the clustering coefficient. In particular, we show that as the network grows the clustering becomes independent of system size, and also presents a power law decay as a function of the degree. Finally, we compare our results with a similar version of the model that has continuous non-linear phase oscillators as dynamical units. The results show that local interactions play a fundamental role in the emergence of hierarchical networks.

Dynamics of an epidemic model with quarantine on scale-free networks

Science.gov (United States)

Kang, Huiyan; Liu, Kaihui; Fu, Xinchu

2017-12-01

Quarantine strategies are frequently used to control or reduce the transmission risks of epidemic diseases such as SARS, tuberculosis and cholera. In this paper, we formulate a susceptible-exposed-infected-quarantined-recovered model on a scale-free network incorporating the births and deaths of individuals. Considering that the infectivity is related to the degrees of infectious nodes, we introduce quarantined rate as a function of degree into the model, and quantify the basic reproduction number, which is shown to be dependent on some parameters, such as quarantined rate, infectivity and network structures. A theoretical result further indicates the heterogeneity of networks and higher infectivity will raise the disease transmission risk while quarantine measure will contribute to the prevention of epidemic spreading. Meanwhile, the contact assumption between susceptibles and infectives may impact the disease transmission. Furthermore, we prove that the basic reproduction number serves as a threshold value for the global stability of the disease-free and endemic equilibria and the uniform persistence of the disease on the network by constructing appropriate Lyapunov functions. Finally, some numerical simulations are illustrated to perform and complement our analytical results.

Increased signaling entropy in cancer requires the scale-free property of protein interaction networks

Science.gov (United States)

Teschendorff, Andrew E.; Banerji, Christopher R. S.; Severini, Simone; Kuehn, Reimer; Sollich, Peter

2015-01-01

One of the key characteristics of cancer cells is an increased phenotypic plasticity, driven by underlying genetic and epigenetic perturbations. However, at a systems-level it is unclear how these perturbations give rise to the observed increased plasticity. Elucidating such systems-level principles is key for an improved understanding of cancer. Recently, it has been shown that signaling entropy, an overall measure of signaling pathway promiscuity, and computable from integrating a sample's gene expression profile with a protein interaction network, correlates with phenotypic plasticity and is increased in cancer compared to normal tissue. Here we develop a computational framework for studying the effects of network perturbations on signaling entropy. We demonstrate that the increased signaling entropy of cancer is driven by two factors: (i) the scale-free (or near scale-free) topology of the interaction network, and (ii) a subtle positive correlation between differential gene expression and node connectivity. Indeed, we show that if protein interaction networks were random graphs, described by Poisson degree distributions, that cancer would generally not exhibit an increased signaling entropy. In summary, this work exposes a deep connection between cancer, signaling entropy and interaction network topology. PMID:25919796

Dynamics of epidemic spreading model with drug-resistant variation on scale-free networks

Science.gov (United States)

Wan, Chen; Li, Tao; Zhang, Wu; Dong, Jing

2018-03-01

Considering the influence of the virus' drug-resistant variation, a novel SIVRS (susceptible-infected-variant-recovered-susceptible) epidemic spreading model with variation characteristic on scale-free networks is proposed in this paper. By using the mean-field theory, the spreading dynamics of the model is analyzed in detail. Then, the basic reproductive number R0 and equilibriums are derived. Studies show that the existence of disease-free equilibrium is determined by the basic reproductive number R0. The relationships between the basic reproductive number R0, the variation characteristic and the topology of the underlying networks are studied in detail. Furthermore, our studies prove the global stability of the disease-free equilibrium, the permanence of epidemic and the global attractivity of endemic equilibrium. Numerical simulations are performed to confirm the analytical results.

Truncation of power law behavior in 'scale-free' network models due to information filtering

International Nuclear Information System (INIS)

Mossa, Stefano; Barthelemy, Marc; Eugene Stanley, H.; Nunes Amaral, Luis A.

2002-01-01

We formulate a general model for the growth of scale-free networks under filtering information conditions--that is, when the nodes can process information about only a subset of the existing nodes in the network. We find that the distribution of the number of incoming links to a node follows a universal scaling form, i.e., that it decays as a power law with an exponential truncation controlled not only by the system size but also by a feature not previously considered, the subset of the network 'accessible' to the node. We test our model with empirical data for the World Wide Web and find agreement

Stability of an SAIRS alcoholism model on scale-free networks

Science.gov (United States)

Xiang, Hong; Liu, Ying-Ping; Huo, Hai-Feng

2017-05-01

A new SAIRS alcoholism model with birth and death on complex heterogeneous networks is proposed. The total population of our model is partitioned into four compartments: the susceptible individual, the light problem alcoholic, the heavy problem alcoholic and the recovered individual. The spread of alcoholism threshold R0 is calculated by the next generation matrix method. When R0 alcohol free equilibrium is globally asymptotically stable, then the alcoholics will disappear. When R0 > 1, the alcoholism equilibrium is global attractivity, then the number of alcoholics will remain stable and alcoholism will become endemic. Furthermore, the modified SAIRS alcoholism model on weighted contact network is introduced. Dynamical behavior of the modified model is also studied. Numerical simulations are also presented to verify and extend theoretical results. Our results show that it is very important to treat alcoholics to control the spread of the alcoholism.

Generating hierarchial scale-free graphs from fractals

Energy Technology Data Exchange (ETDEWEB)

Komjathy, Julia, E-mail: komyju@math.bme.hu [Department of Stochastics, Institute of Mathematics, Technical University of Budapest, H-1529 P.O. Box 91 (Hungary); Simon, Karoly, E-mail: simonk@math.bme.hu [Department of Stochastics, Institute of Mathematics, Technical University of Budapest, H-1529 P.O. Box 91 (Hungary)

2011-08-15

Highlights: > We generate deterministic scale-free networks using graph-directed self similar IFS. > Our model exhibits similar clustering, power law decay properties to real networks. > The average length of shortest path and the diameter of the graph are determined. > Using this model, we generate random graphs with prescribed power law exponent. - Abstract: Motivated by the hierarchial network model of E. Ravasz, A.-L. Barabasi, and T. Vicsek, we introduce deterministic scale-free networks derived from a graph directed self-similar fractal {Lambda}. With rigorous mathematical results we verify that our model captures some of the most important features of many real networks: the scale-free and the high clustering properties. We also prove that the diameter is the logarithm of the size of the system. We point out a connection between the power law exponent of the degree distribution and some intrinsic geometric measure theoretical properties of the underlying fractal. Using our (deterministic) fractal {Lambda} we generate random graph sequence sharing similar properties.

Weighted Evolving Networks with Self-organized Communities

International Nuclear Information System (INIS)

Xie Zhou; Wang Xiaofan; Li Xiang

2008-01-01

In order to describe the self-organization of communities in the evolution of weighted networks, we propose a new evolving model for weighted community-structured networks with the preferential mechanisms functioned in different levels according to community sizes and node strengths, respectively. Theoretical analyses and numerical simulations show that our model captures power-law distributions of community sizes, node strengths, and link weights, with tunable exponents of ν ≥ 1, γ > 2, and α > 2, respectively, sharing large clustering coefficients and scaling clustering spectra, and covering the range from disassortative networks to assortative networks. Finally, we apply our new model to the scientific co-authorship networks with both their weighted and unweighted datasets to verify its effectiveness

Betweenness-based algorithm for a partition scale-free graph

International Nuclear Information System (INIS)

Zhang Bai-Da; Wu Jun-Jie; Zhou Jing; Tang Yu-Hua

2011-01-01

Many real-world networks are found to be scale-free. However, graph partition technology, as a technology capable of parallel computing, performs poorly when scale-free graphs are provided. The reason for this is that traditional partitioning algorithms are designed for random networks and regular networks, rather than for scale-free networks. Multilevel graph-partitioning algorithms are currently considered to be the state of the art and are used extensively. In this paper, we analyse the reasons why traditional multilevel graph-partitioning algorithms perform poorly and present a new multilevel graph-partitioning paradigm, top down partitioning, which derives its name from the comparison with the traditional bottom—up partitioning. A new multilevel partitioning algorithm, named betweenness-based partitioning algorithm, is also presented as an implementation of top—down partitioning paradigm. An experimental evaluation of seven different real-world scale-free networks shows that the betweenness-based partitioning algorithm significantly outperforms the existing state-of-the-art approaches. (interdisciplinary physics and related areas of science and technology)

Scale-free networks of earthquakes and aftershocks

International Nuclear Information System (INIS)

Baiesi, Marco; Paczuski, Maya

2004-01-01

We propose a metric to quantify correlations between earthquakes. The metric consists of a product involving the time interval and spatial distance between two events, as well as the magnitude of the first one. According to this metric, events typically are strongly correlated to only one or a few preceding ones. Thus a classification of events as foreshocks, main shocks, or aftershocks emerges automatically without imposing predetermined space-time windows. In the simplest network construction, each earthquake receives an incoming link from its most correlated predecessor. The number of aftershocks for any event, identified by its outgoing links, is found to be scale free with exponent γ=2.0(1). The original Omori law with p=1 emerges as a robust feature of seismicity, holding up to years even for aftershock sequences initiated by intermediate magnitude events. The broad distribution of distances between earthquakes and their linked aftershocks suggests that aftershock collection with fixed space windows is not appropriate

Improving the Network Scale-Up Estimator: Incorporating Means of Sums, Recursive Back Estimation, and Sampling Weights.

Directory of Open Access Journals (Sweden)

Patrick Habecker

Full Text Available Researchers interested in studying populations that are difficult to reach through traditional survey methods can now draw on a range of methods to access these populations. Yet many of these methods are more expensive and difficult to implement than studies using conventional sampling frames and trusted sampling methods. The network scale-up method (NSUM provides a middle ground for researchers who wish to estimate the size of a hidden population, but lack the resources to conduct a more specialized hidden population study. Through this method it is possible to generate population estimates for a wide variety of groups that are perhaps unwilling to self-identify as such (for example, users of illegal drugs or other stigmatized populations via traditional survey tools such as telephone or mail surveys--by asking a representative sample to estimate the number of people they know who are members of such a "hidden" subpopulation. The original estimator is formulated to minimize the weight a single scaling variable can exert upon the estimates. We argue that this introduces hidden and difficult to predict biases, and instead propose a series of methodological advances on the traditional scale-up estimation procedure, including a new estimator. Additionally, we formalize the incorporation of sample weights into the network scale-up estimation process, and propose a recursive process of back estimation "trimming" to identify and remove poorly performing predictors from the estimation process. To demonstrate these suggestions we use data from a network scale-up mail survey conducted in Nebraska during 2014. We find that using the new estimator and recursive trimming process provides more accurate estimates, especially when used in conjunction with sampling weights.

Complex Quantum Network Manifolds in Dimension d > 2 are Scale-Free

Science.gov (United States)

Bianconi, Ginestra; Rahmede, Christoph

2015-09-01

In quantum gravity, several approaches have been proposed until now for the quantum description of discrete geometries. These theoretical frameworks include loop quantum gravity, causal dynamical triangulations, causal sets, quantum graphity, and energetic spin networks. Most of these approaches describe discrete spaces as homogeneous network manifolds. Here we define Complex Quantum Network Manifolds (CQNM) describing the evolution of quantum network states, and constructed from growing simplicial complexes of dimension . We show that in d = 2 CQNM are homogeneous networks while for d > 2 they are scale-free i.e. they are characterized by large inhomogeneities of degrees like most complex networks. From the self-organized evolution of CQNM quantum statistics emerge spontaneously. Here we define the generalized degrees associated with the -faces of the -dimensional CQNMs, and we show that the statistics of these generalized degrees can either follow Fermi-Dirac, Boltzmann or Bose-Einstein distributions depending on the dimension of the -faces.

The International Trade Network: weighted network analysis and modelling

International Nuclear Information System (INIS)

Bhattacharya, K; Mukherjee, G; Manna, S S; Saramäki, J; Kaski, K

2008-01-01

Tools of the theory of critical phenomena, namely the scaling analysis and universality, are argued to be applicable to large complex web-like network structures. Using a detailed analysis of the real data of the International Trade Network we argue that the scaled link weight distribution has an approximate log-normal distribution which remains robust over a period of 53 years. Another universal feature is observed in the power-law growth of the trade strength with gross domestic product, the exponent being similar for all countries. Using the 'rich-club' coefficient measure of the weighted networks it has been shown that the size of the rich-club controlling half of the world's trade is actually shrinking. While the gravity law is known to describe well the social interactions in the static networks of population migration, international trade, etc, here for the first time we studied a non-conservative dynamical model based on the gravity law which excellently reproduced many empirical features of the ITN

Impacts of hybrid synapses on the noise-delayed decay in scale-free neural networks

International Nuclear Information System (INIS)

Yilmaz, Ergin

2014-01-01

Highlights: • We investigate the NDD phenomenon in a hybrid scale-free network. • Electrical synapses are more impressive on the emergence of NDD. • Electrical synapses are more efficient in suppressing of the NDD. • Average degree has two opposite effects on the appearance time of the first spike. - Abstract: We study the phenomenon of noise-delayed decay in a scale-free neural network consisting of excitable FitzHugh–Nagumo neurons. In contrast to earlier works, where only electrical synapses are considered among neurons, we primarily examine the effects of hybrid synapses on the noise-delayed decay in this study. We show that the electrical synaptic coupling is more impressive than the chemical coupling in determining the appearance time of the first-spike and more efficient on the mitigation of the delay time in the detection of a suprathreshold input signal. We obtain that hybrid networks including inhibitory chemical synapses have higher signal detection capabilities than those of including excitatory ones. We also find that average degree exhibits two different effects, which are strengthening and weakening the noise-delayed decay effect depending on the noise intensity

Boolean decision problems with competing interactions on scale-free networks: Equilibrium and nonequilibrium behavior in an external bias

Science.gov (United States)

Zhu, Zheng; Andresen, Juan Carlos; Moore, M. A.; Katzgraber, Helmut G.

2014-02-01

We study the equilibrium and nonequilibrium properties of Boolean decision problems with competing interactions on scale-free networks in an external bias (magnetic field). Previous studies at zero field have shown a remarkable equilibrium stability of Boolean variables (Ising spins) with competing interactions (spin glasses) on scale-free networks. When the exponent that describes the power-law decay of the connectivity of the network is strictly larger than 3, the system undergoes a spin-glass transition. However, when the exponent is equal to or less than 3, the glass phase is stable for all temperatures. First, we perform finite-temperature Monte Carlo simulations in a field to test the robustness of the spin-glass phase and show that the system has a spin-glass phase in a field, i.e., exhibits a de Almeida-Thouless line. Furthermore, we study avalanche distributions when the system is driven by a field at zero temperature to test if the system displays self-organized criticality. Numerical results suggest that avalanches (damage) can spread across the whole system with nonzero probability when the decay exponent of the interaction degree is less than or equal to 2, i.e., that Boolean decision problems on scale-free networks with competing interactions can be fragile when not in thermal equilibrium.

Birth of scale-free molecular networks and the number of distinct DNA and protein domains per genome.

Science.gov (United States)

Rzhetsky, A; Gomez, S M

2001-10-01

Current growth in the field of genomics has provided a number of exciting approaches to the modeling of evolutionary mechanisms within the genome. Separately, dynamical and statistical analyses of networks such as the World Wide Web and the social interactions existing between humans have shown that these networks can exhibit common fractal properties-including the property of being scale-free. This work attempts to bridge these two fields and demonstrate that the fractal properties of molecular networks are linked to the fractal properties of their underlying genomes. We suggest a stochastic model capable of describing the evolutionary growth of metabolic or signal-transduction networks. This model generates networks that share important statistical properties (so-called scale-free behavior) with real molecular networks. In particular, the frequency of vertices connected to exactly k other vertices follows a power-law distribution. The shape of this distribution remains invariant to changes in network scale: a small subgraph has the same distribution as the complete graph from which it is derived. Furthermore, the model correctly predicts that the frequencies of distinct DNA and protein domains also follow a power-law distribution. Finally, the model leads to a simple equation linking the total number of different DNA and protein domains in a genome with both the total number of genes and the overall network topology. MatLab (MathWorks, Inc.) programs described in this manuscript are available on request from the authors. ar345@columbia.edu.

The Mathematics of Networks Science: Scale-Free, Power-Law Graphs and Continuum Theoretical Analysis

Science.gov (United States)

Padula, Janice

2012-01-01

When hoping to initiate or sustain students' interest in mathematics teachers should always consider relevance, relevance to students' lives and in the middle and later years of instruction in high school and university, accessibility. A topic such as the mathematics behind networks science, more specifically scale-free graphs, is up-to-date,…

The Medieval inquisition: scale-free networks and the suppression of heresy

Science.gov (United States)

Ormerod, Paul; Roach, Andrew P.

2004-08-01

Qualitative evidence suggests that heresy within the medieval Church had many of the characteristics of a scale-free network. From the perspective of the Church, heresy can be seen as an infectious disease. The disease persisted for long periods of time, breaking out again even when the Church believed it to have been eradicated. A principal mechanism of heresy was through a small number of individuals with very large numbers of social contacts. Initial attempts by the inquisition to suppress heresy by general persecution, or even mass slaughter, of populations thought to harbour the ‘disease’ failed. Gradually, however, inquisitors learned about the nature of the social networks by which heresy both spread and persisted. Eventually, a policy of targeting key individuals was implemented, which proved to be much more successful.

Influence of different initial distributions on robust cooperation in scale-free networks: A comparative study

International Nuclear Information System (INIS)

Chen Xiaojie; Fu Feng; Wang Long

2008-01-01

We study the evolutionary Prisoner's dilemma game on scale-free networks, focusing on the influence of different initial distributions for cooperators and defectors on the evolution of cooperation. To address this issue, we consider three types of initial distributions for defectors: uniform distribution at random, occupying the most connected nodes, and occupying the lowest-degree nodes, respectively. It is shown that initial configurations for defectors can crucially influence the cooperation level and the evolution speed of cooperation. Interestingly, the situation where defectors initially occupy the lowest-degree vertices can exhibit the most robust cooperation, compared with two other distributions. That is, the cooperation level is least affected by the initial percentage of defectors. Moreover, in this situation, the whole system evolves fastest to the prevalent cooperation. Besides, we obtain the critical values of initial frequency of defectors above which the extinction of cooperators occurs for the respective initial distributions. Our results might be helpful in explaining the maintenance of high cooperation in scale-free networks

Spreading dynamics of an e-commerce preferential information model on scale-free networks

Science.gov (United States)

Wan, Chen; Li, Tao; Guan, Zhi-Hong; Wang, Yuanmei; Liu, Xiongding

2017-02-01

In order to study the influence of the preferential degree and the heterogeneity of underlying networks on the spread of preferential e-commerce information, we propose a novel susceptible-infected-beneficial model based on scale-free networks. The spreading dynamics of the preferential information are analyzed in detail using the mean-field theory. We determine the basic reproductive number and equilibria. The theoretical analysis indicates that the basic reproductive number depends mainly on the preferential degree and the topology of the underlying networks. We prove the global stability of the information-elimination equilibrium. The permanence of preferential information and the global attractivity of the information-prevailing equilibrium are also studied in detail. Some numerical simulations are presented to verify the theoretical results.

THE BUILDUP OF A SCALE-FREE PHOTOSPHERIC MAGNETIC NETWORK

Energy Technology Data Exchange (ETDEWEB)

Thibault, K.; Charbonneau, P. [Departement de Physique, Universite de Montreal, 2900 Edouard-Montpetit, Montreal, Quebec H3C 3J7 (Canada); Crouch, A. D., E-mail: kim@astro.umontreal.ca-a, E-mail: paulchar@astro.umontreal.ca-b, E-mail: ash@cora.nwra.com-c [CORA/NWRA, 3380 Mitchell Lane, Boulder, CO 80301 (United States)

2012-10-01

We use a global Monte Carlo simulation of the formation of the solar photospheric magnetic network to investigate the origin of the scale invariance characterizing magnetic flux concentrations visible on high-resolution magnetograms. The simulations include spatially and temporally homogeneous injection of small-scale magnetic elements over the whole photosphere, as well as localized episodic injection associated with the emergence and decay of active regions. Network elements form in response to cumulative pairwise aggregation or cancellation of magnetic elements, undergoing a random walk on the sphere and advected on large spatial scales by differential rotation and a poleward meridional flow. The resulting size distribution of simulated network elements is in very good agreement with observational inferences. We find that the fractal index and size distribution of network elements are determined primarily by these post-emergence surface mechanisms, and carry little or no memory of the scales at which magnetic flux is injected in the simulation. Implications for models of dynamo action in the Sun are briefly discussed.

THE BUILDUP OF A SCALE-FREE PHOTOSPHERIC MAGNETIC NETWORK

International Nuclear Information System (INIS)

Thibault, K.; Charbonneau, P.; Crouch, A. D.

2012-01-01

We use a global Monte Carlo simulation of the formation of the solar photospheric magnetic network to investigate the origin of the scale invariance characterizing magnetic flux concentrations visible on high-resolution magnetograms. The simulations include spatially and temporally homogeneous injection of small-scale magnetic elements over the whole photosphere, as well as localized episodic injection associated with the emergence and decay of active regions. Network elements form in response to cumulative pairwise aggregation or cancellation of magnetic elements, undergoing a random walk on the sphere and advected on large spatial scales by differential rotation and a poleward meridional flow. The resulting size distribution of simulated network elements is in very good agreement with observational inferences. We find that the fractal index and size distribution of network elements are determined primarily by these post-emergence surface mechanisms, and carry little or no memory of the scales at which magnetic flux is injected in the simulation. Implications for models of dynamo action in the Sun are briefly discussed.

The Buildup of a Scale-free Photospheric Magnetic Network

Science.gov (United States)

Thibault, K.; Charbonneau, P.; Crouch, A. D.

2012-10-01

We use a global Monte Carlo simulation of the formation of the solar photospheric magnetic network to investigate the origin of the scale invariance characterizing magnetic flux concentrations visible on high-resolution magnetograms. The simulations include spatially and temporally homogeneous injection of small-scale magnetic elements over the whole photosphere, as well as localized episodic injection associated with the emergence and decay of active regions. Network elements form in response to cumulative pairwise aggregation or cancellation of magnetic elements, undergoing a random walk on the sphere and advected on large spatial scales by differential rotation and a poleward meridional flow. The resulting size distribution of simulated network elements is in very good agreement with observational inferences. We find that the fractal index and size distribution of network elements are determined primarily by these post-emergence surface mechanisms, and carry little or no memory of the scales at which magnetic flux is injected in the simulation. Implications for models of dynamo action in the Sun are briefly discussed.

Single or multiple synchronization transitions in scale-free neuronal networks with electrical or chemical coupling

International Nuclear Information System (INIS)

Hao Yinghang; Gong, Yubing; Wang Li; Ma Xiaoguang; Yang Chuanlu

2011-01-01

Research highlights: → Single synchronization transition for gap-junctional coupling. → Multiple synchronization transitions for chemical synaptic coupling. → Gap junctions and chemical synapses have different impacts on synchronization transition. → Chemical synapses may play a dominant role in neurons' information processing. - Abstract: In this paper, we have studied time delay- and coupling strength-induced synchronization transitions in scale-free modified Hodgkin-Huxley (MHH) neuron networks with gap-junctions and chemical synaptic coupling. It is shown that the synchronization transitions are much different for these two coupling types. For gap-junctions, the neurons exhibit a single synchronization transition with time delay and coupling strength, while for chemical synapses, there are multiple synchronization transitions with time delay, and the synchronization transition with coupling strength is dependent on the time delay lengths. For short delays we observe a single synchronization transition, whereas for long delays the neurons exhibit multiple synchronization transitions as the coupling strength is varied. These results show that gap junctions and chemical synapses have different impacts on the pattern formation and synchronization transitions of the scale-free MHH neuronal networks, and chemical synapses, compared to gap junctions, may play a dominant and more active function in the firing activity of the networks. These findings would be helpful for further understanding the roles of gap junctions and chemical synapses in the firing dynamics of neuronal networks.

Single or multiple synchronization transitions in scale-free neuronal networks with electrical or chemical coupling

Energy Technology Data Exchange (ETDEWEB)

Hao Yinghang [School of Physics, Ludong University, Yantai 264025 (China); Gong, Yubing, E-mail: gongyubing09@hotmail.co [School of Physics, Ludong University, Yantai 264025 (China); Wang Li; Ma Xiaoguang; Yang Chuanlu [School of Physics, Ludong University, Yantai 264025 (China)

2011-04-15

Research highlights: Single synchronization transition for gap-junctional coupling. Multiple synchronization transitions for chemical synaptic coupling. Gap junctions and chemical synapses have different impacts on synchronization transition. Chemical synapses may play a dominant role in neurons' information processing. - Abstract: In this paper, we have studied time delay- and coupling strength-induced synchronization transitions in scale-free modified Hodgkin-Huxley (MHH) neuron networks with gap-junctions and chemical synaptic coupling. It is shown that the synchronization transitions are much different for these two coupling types. For gap-junctions, the neurons exhibit a single synchronization transition with time delay and coupling strength, while for chemical synapses, there are multiple synchronization transitions with time delay, and the synchronization transition with coupling strength is dependent on the time delay lengths. For short delays we observe a single synchronization transition, whereas for long delays the neurons exhibit multiple synchronization transitions as the coupling strength is varied. These results show that gap junctions and chemical synapses have different impacts on the pattern formation and synchronization transitions of the scale-free MHH neuronal networks, and chemical synapses, compared to gap junctions, may play a dominant and more active function in the firing activity of the networks. These findings would be helpful for further understanding the roles of gap junctions and chemical synapses in the firing dynamics of neuronal networks.

Self-similarity and scaling theory of complex networks

Science.gov (United States)

Song, Chaoming

Scale-free networks have been studied extensively due to their relevance to many real systems as diverse as the World Wide Web (WWW), the Internet, biological and social networks. We present a novel approach to the analysis of scale-free networks, revealing that their structure is self-similar. This result is achieved by the application of a renormalization procedure which coarse-grains the system into boxes containing nodes within a given "size". Concurrently, we identify a power-law relation between the number of boxes needed to cover the network and the size of the box defining a self-similar exponent, which classifies fractal and non-fractal networks. By using the concept of renormalization as a mechanism for the growth of fractal and non-fractal modular networks, we show that the key principle that gives rise to the fractal architecture of networks is a strong effective "repulsion" between the most connected nodes (hubs) on all length scales, rendering them very dispersed. We show that a robust network comprised of functional modules, such as a cellular network, necessitates a fractal topology, suggestive of a evolutionary drive for their existence. These fundamental properties help to understand the emergence of the scale-free property in complex networks.

A scale-free structure prior for graphical models with applications in functional genomics.

Directory of Open Access Journals (Sweden)

Paul Sheridan

Full Text Available The problem of reconstructing large-scale, gene regulatory networks from gene expression data has garnered considerable attention in bioinformatics over the past decade with the graphical modeling paradigm having emerged as a popular framework for inference. Analysis in a full Bayesian setting is contingent upon the assignment of a so-called structure prior-a probability distribution on networks, encoding a priori biological knowledge either in the form of supplemental data or high-level topological features. A key topological consideration is that a wide range of cellular networks are approximately scale-free, meaning that the fraction, , of nodes in a network with degree is roughly described by a power-law with exponent between and . The standard practice, however, is to utilize a random structure prior, which favors networks with binomially distributed degree distributions. In this paper, we introduce a scale-free structure prior for graphical models based on the formula for the probability of a network under a simple scale-free network model. Unlike the random structure prior, its scale-free counterpart requires a node labeling as a parameter. In order to use this prior for large-scale network inference, we design a novel Metropolis-Hastings sampler for graphical models that includes a node labeling as a state space variable. In a simulation study, we demonstrate that the scale-free structure prior outperforms the random structure prior at recovering scale-free networks while at the same time retains the ability to recover random networks. We then estimate a gene association network from gene expression data taken from a breast cancer tumor study, showing that scale-free structure prior recovers hubs, including the previously unknown hub SLC39A6, which is a zinc transporter that has been implicated with the spread of breast cancer to the lymph nodes. Our analysis of the breast cancer expression data underscores the value of the scale-free

Robustness of weighted networks

Science.gov (United States)

Bellingeri, Michele; Cassi, Davide

2018-01-01

Complex network response to node loss is a central question in different fields of network science because node failure can cause the fragmentation of the network, thus compromising the system functioning. Previous studies considered binary networks where the intensity (weight) of the links is not accounted for, i.e. a link is either present or absent. However, in real-world networks the weights of connections, and thus their importance for network functioning, can be widely different. Here, we analyzed the response of real-world and model networks to node loss accounting for link intensity and the weighted structure of the network. We used both classic binary node properties and network functioning measure, introduced a weighted rank for node importance (node strength), and used a measure for network functioning that accounts for the weight of the links (weighted efficiency). We find that: (i) the efficiency of the attack strategies changed using binary or weighted network functioning measures, both for real-world or model networks; (ii) in some cases, removing nodes according to weighted rank produced the highest damage when functioning was measured by the weighted efficiency; (iii) adopting weighted measure for the network damage changed the efficacy of the attack strategy with respect the binary analyses. Our results show that if the weighted structure of complex networks is not taken into account, this may produce misleading models to forecast the system response to node failure, i.e. consider binary links may not unveil the real damage induced in the system. Last, once weighted measures are introduced, in order to discover the best attack strategy, it is important to analyze the network response to node loss using nodes rank accounting the intensity of the links to the node.

Topology of the Italian airport network: A scale-free small-world network with a fractal structure?

International Nuclear Information System (INIS)

Guida, Michele; Maria, Funaro

2007-01-01

In this paper, for the first time we analyze the structure of the Italian Airport Network (IAN) looking at it as a mathematical graph and investigate its topological properties. We find that it has very remarkable features, being like a scale-free network, since both the degree and the 'betweenness centrality' distributions follow a typical power-law known in literature as a Double Pareto Law. From a careful analysis of the data, the Italian Airport Network turns out to have a self-similar structure. In short, it is characterized by a fractal nature, whose typical dimensions can be easily determined from the values of the power-law scaling exponents. Moreover, we show that, according to the period examined, these distributions exhibit a number of interesting features, such as the existence of some 'hubs', i.e. in the graph theory's jargon, nodes with a very large number of links, and others most probably associated with geographical constraints. Also, we find that the IAN can be classified as a small-world network because the average distance between reachable pairs of airports grows at most as the logarithm of the number of airports. The IAN does not show evidence of 'communities' and this result could be the underlying reason behind the smallness of the value of the clustering coefficient, which is related to the probability that two nearest neighbors of a randomly chosen airport are connected

Reducing weight precision of convolutional neural networks towards large-scale on-chip image recognition

Science.gov (United States)

Ji, Zhengping; Ovsiannikov, Ilia; Wang, Yibing; Shi, Lilong; Zhang, Qiang

2015-05-01

In this paper, we develop a server-client quantization scheme to reduce bit resolution of deep learning architecture, i.e., Convolutional Neural Networks, for image recognition tasks. Low bit resolution is an important factor in bringing the deep learning neural network into hardware implementation, which directly determines the cost and power consumption. We aim to reduce the bit resolution of the network without sacrificing its performance. To this end, we design a new quantization algorithm called supervised iterative quantization to reduce the bit resolution of learned network weights. In the training stage, the supervised iterative quantization is conducted via two steps on server - apply k-means based adaptive quantization on learned network weights and retrain the network based on quantized weights. These two steps are alternated until the convergence criterion is met. In this testing stage, the network configuration and low-bit weights are loaded to the client hardware device to recognize coming input in real time, where optimized but expensive quantization becomes infeasible. Considering this, we adopt a uniform quantization for the inputs and internal network responses (called feature maps) to maintain low on-chip expenses. The Convolutional Neural Network with reduced weight and input/response precision is demonstrated in recognizing two types of images: one is hand-written digit images and the other is real-life images in office scenarios. Both results show that the new network is able to achieve the performance of the neural network with full bit resolution, even though in the new network the bit resolution of both weight and input are significantly reduced, e.g., from 64 bits to 4-5 bits.

Simulating the wealth distribution with a Richest-Following strategy on scale-free network

Science.gov (United States)

Hu, Mao-Bin; Jiang, Rui; Wu, Qing-Song; Wu, Yong-Hong

2007-07-01

In this paper, we investigate the wealth distribution with agents playing evolutionary games on a scale-free social network adopting the Richest-Following strategy. Pareto's power-law distribution (1897) of wealth is demonstrated with power factor in agreement with that of US or Japan. Moreover, the agent's personal wealth is proportional to its number of contacts (connectivity), and this leads to the phenomenon that the rich gets richer and the poor gets relatively poorer, which agrees with the Matthew Effect.

Range-Free Localization Schemes for Large Scale Sensor Networks

National Research Council Canada - National Science Library

He, Tian; Huang, Chengdu; Blum, Brain M; Stankovic, John A; Abdelzaher, Tarek

2003-01-01

.... Because coarse accuracy is sufficient for most sensor network applications, solutions in range-free localization are being pursued as a cost-effective alternative to more expensive range-based approaches...

Coupling effects on turning points of infectious diseases epidemics in scale-free networks.

Science.gov (United States)

Kim, Kiseong; Lee, Sangyeon; Lee, Doheon; Lee, Kwang Hyung

2017-05-31

Pandemic is a typical spreading phenomenon that can be observed in the human society and is dependent on the structure of the social network. The Susceptible-Infective-Recovered (SIR) model describes spreading phenomena using two spreading factors; contagiousness (β) and recovery rate (γ). Some network models are trying to reflect the social network, but the real structure is difficult to uncover. We have developed a spreading phenomenon simulator that can input the epidemic parameters and network parameters and performed the experiment of disease propagation. The simulation result was analyzed to construct a new marker VRTP distribution. We also induced the VRTP formula for three of the network mathematical models. We suggest new marker VRTP (value of recovered on turning point) to describe the coupling between the SIR spreading and the Scale-free (SF) network and observe the aspects of the coupling effects with the various of spreading and network parameters. We also derive the analytic formulation of VRTP in the fully mixed model, the configuration model, and the degree-based model respectively in the mathematical function form for the insights on the relationship between experimental simulation and theoretical consideration. We discover the coupling effect between SIR spreading and SF network through devising novel marker VRTP which reflects the shifting effect and relates to entropy.

Learning free energy landscapes using artificial neural networks.

Science.gov (United States)

Sidky, Hythem; Whitmer, Jonathan K

2018-03-14

Existing adaptive bias techniques, which seek to estimate free energies and physical properties from molecular simulations, are limited by their reliance on fixed kernels or basis sets which hinder their ability to efficiently conform to varied free energy landscapes. Further, user-specified parameters are in general non-intuitive yet significantly affect the convergence rate and accuracy of the free energy estimate. Here we propose a novel method, wherein artificial neural networks (ANNs) are used to develop an adaptive biasing potential which learns free energy landscapes. We demonstrate that this method is capable of rapidly adapting to complex free energy landscapes and is not prone to boundary or oscillation problems. The method is made robust to hyperparameters and overfitting through Bayesian regularization which penalizes network weights and auto-regulates the number of effective parameters in the network. ANN sampling represents a promising innovative approach which can resolve complex free energy landscapes in less time than conventional approaches while requiring minimal user input.

Learning free energy landscapes using artificial neural networks

Science.gov (United States)

Sidky, Hythem; Whitmer, Jonathan K.

2018-03-01

Existing adaptive bias techniques, which seek to estimate free energies and physical properties from molecular simulations, are limited by their reliance on fixed kernels or basis sets which hinder their ability to efficiently conform to varied free energy landscapes. Further, user-specified parameters are in general non-intuitive yet significantly affect the convergence rate and accuracy of the free energy estimate. Here we propose a novel method, wherein artificial neural networks (ANNs) are used to develop an adaptive biasing potential which learns free energy landscapes. We demonstrate that this method is capable of rapidly adapting to complex free energy landscapes and is not prone to boundary or oscillation problems. The method is made robust to hyperparameters and overfitting through Bayesian regularization which penalizes network weights and auto-regulates the number of effective parameters in the network. ANN sampling represents a promising innovative approach which can resolve complex free energy landscapes in less time than conventional approaches while requiring minimal user input.

Generating hierarchical scale free-graphs from fractals

NARCIS (Netherlands)

Komjáthy, J.; Simon, K.

2011-01-01

Motivated by the hierarchial network model of E. Ravasz, A.-L. Barabási, and T. Vicsek, we introduce deterministic scale-free networks derived from a graph directed self-similar fractal ¿. With rigorous mathematical results we verify that our model captures some of the most important features of

Weighted network modules

International Nuclear Information System (INIS)

Farkas, Illes; Abel, Daniel; Palla, Gergely; Vicsek, Tamas

2007-01-01

The inclusion of link weights into the analysis of network properties allows a deeper insight into the (often overlapping) modular structure of real-world webs. We introduce a clustering algorithm clique percolation method with weights (CPMw) for weighted networks based on the concept of percolating k-cliques with high enough intensity. The algorithm allows overlaps between the modules. First, we give detailed analytical and numerical results about the critical point of weighted k-clique percolation on (weighted) Erdos-Renyi graphs. Then, for a scientist collaboration web and a stock correlation graph we compute three-link weight correlations and with the CPMw the weighted modules. After reshuffling link weights in both networks and computing the same quantities for the randomized control graphs as well, we show that groups of three or more strong links prefer to cluster together in both original graphs

Chaotic Modes in Scale Free Opinion Networks

Science.gov (United States)

Kusmartsev, Feo V.; Kürten, Karl E.

2010-12-01

In this paper, we investigate processes associated with formation of public opinion in varies directed random, scale free and small-world social networks. The important factor of the opinion formation is the existence of contrarians which were discovered by Granovetter in various social psychology experiments1,2,3 long ago and later introduced in sociophysics by Galam.4 When the density of contrarians increases the system behavior drastically changes at some critical value. At high density of contrarians the system can never arrive to a consensus state and periodically oscillates with different periods depending on specific structure of the network. At small density of the contrarians the behavior is manifold. It depends primary on the initial state of the system. If initially the majority of the population agrees with each other a state of stable majority may be easily reached. However when originally the population is divided in nearly equal parts consensus can never be reached. We model the emergence of collective decision making by considering N interacting agents, whose opinions are described by two state Ising spin variable associated with YES and NO. We show that the dynamical behaviors are very sensitive not only to the density of the contrarians but also to the network topology. We find that a phase of social chaos may arise in various dynamical processes of opinion formation in many realistic models. We compare the prediction of the theory with data describing the dynamics of the average opinion of the USA population collected on a day-by-day basis by varies media sources during the last six month before the final Obama-McCain election. The qualitative ouctome is in reasonable agreement with the prediction of our theory. In fact, the analyses of these data made within the paradigm of our theory indicates that even in this campaign there were chaotic elements where the public opinion migrated in an unpredictable chaotic way. The existence of such a phase

Fractional parentage analysis and a scale-free reproductive network of brown trout.

Science.gov (United States)

Koyano, Hitoshi; Serbezov, Dimitar; Kishino, Hirohisa; Schweder, Tore

2013-11-07

In this study, we developed a method of fractional parentage analysis using microsatellite markers. We propose a method for calculating parentage probability, which considers missing data and genotyping errors due to null alleles and other causes, by regarding observed alleles as realizations of random variables which take values in the set of alleles at the locus and developing a method for simultaneously estimating the true and null allele frequencies of all alleles at each locus. We then applied our proposed method to a large sample collected from a wild population of brown trout (Salmo trutta). On analyzing the data using our method, we found that the reproductive success of brown trout obeyed a power law, indicating that when the parent-offspring relationship is regarded as a link, the reproductive system of brown trout is a scale-free network. Characteristics of the reproductive network of brown trout include individuals with large bodies as hubs in the network and different power exponents of degree distributions between males and females. © 2013 Elsevier Ltd. All rights reserved.

A dynamic routing strategy with limited buffer on scale-free network

Science.gov (United States)

Wang, Yufei; Liu, Feng

2016-04-01

In this paper, we propose an integrated routing strategy based on global static topology information and local dynamic data packet queue lengths to improve the transmission efficiency of scale-free networks. The proposed routing strategy is a combination of a global static routing strategy (based on the shortest path algorithm) and local dynamic queue length management, in which, instead of using an infinite buffer, the queue length of each node i in the proposed routing strategy is limited by a critical queue length Qic. When the network traffic is lower and the queue length of each node i is shorter than its critical queue length Qic, it forwards packets according to the global routing table. With increasing network traffic, when the buffers of the nodes with higher degree are full, they do not receive packets due to their limited buffers and the packets have to be delivered to the nodes with lower degree. The global static routing strategy can shorten the transmission time that it takes a packet to reach its destination, and the local limited queue length can balance the network traffic. The optimal critical queue lengths of nodes have been analysed. Simulation results show that the proposed routing strategy can get better performance than that of the global static strategy based on topology, and almost the same performance as that of the global dynamic routing strategy with less complexity.

Weighted Complex Network Analysis of Shanghai Rail Transit System

Directory of Open Access Journals (Sweden)

Yingying Xing

2016-01-01

Full Text Available With increasing passenger flows and construction scale, Shanghai rail transit system (RTS has entered a new era of networking operation. In addition, the structure and properties of the RTS network have great implications for urban traffic planning, design, and management. Thus, it is necessary to acquire their network properties and impacts. In this paper, the Shanghai RTS, as well as passenger flows, will be investigated by using complex network theory. Both the topological and dynamic properties of the RTS network are analyzed and the largest connected cluster is introduced to assess the reliability and robustness of the RTS network. Simulation results show that the distribution of nodes strength exhibits a power-law behavior and Shanghai RTS network shows a strong weighted rich-club effect. This study also indicates that the intentional attacks are more detrimental to the RTS network than to the random weighted network, but the random attacks can cause slightly more damage to the random weighted network than to the RTS network. Our results provide a richer view of complex weighted networks in real world and possibilities of risk analysis and policy decisions for the RTS operation department.

Quantum phase transition of the transverse-field quantum Ising model on scale-free networks.

Science.gov (United States)

Yi, Hangmo

2015-01-01

I investigate the quantum phase transition of the transverse-field quantum Ising model in which nearest neighbors are defined according to the connectivity of scale-free networks. Using a continuous-time quantum Monte Carlo simulation method and the finite-size scaling analysis, I identify the quantum critical point and study its scaling characteristics. For the degree exponent λ=6, I obtain results that are consistent with the mean-field theory. For λ=4.5 and 4, however, the results suggest that the quantum critical point belongs to a non-mean-field universality class. Further simulations indicate that the quantum critical point remains mean-field-like if λ>5, but it continuously deviates from the mean-field theory as λ becomes smaller.

Reciprocity of weighted networks.

Science.gov (United States)

Squartini, Tiziano; Picciolo, Francesco; Ruzzenenti, Franco; Garlaschelli, Diego

2013-01-01

In directed networks, reciprocal links have dramatic effects on dynamical processes, network growth, and higher-order structures such as motifs and communities. While the reciprocity of binary networks has been extensively studied, that of weighted networks is still poorly understood, implying an ever-increasing gap between the availability of weighted network data and our understanding of their dyadic properties. Here we introduce a general approach to the reciprocity of weighted networks, and define quantities and null models that consistently capture empirical reciprocity patterns at different structural levels. We show that, counter-intuitively, previous reciprocity measures based on the similarity of mutual weights are uninformative. By contrast, our measures allow to consistently classify different weighted networks according to their reciprocity, track the evolution of a network's reciprocity over time, identify patterns at the level of dyads and vertices, and distinguish the effects of flux (im)balances or other (a)symmetries from a true tendency towards (anti-)reciprocation.

Scaling in public transport networks

Directory of Open Access Journals (Sweden)

C. von Ferber

2005-01-01

Full Text Available We analyse the statistical properties of public transport networks. These networks are defined by a set of public transport routes (bus lines and the stations serviced by these. For larger networks these appear to possess a scale-free structure, as it is demonstrated e.g. by the Zipf law distribution of the number of routes servicing a given station or for the distribution of the number of stations which can be visited from a chosen one without changing the means of transport. Moreover, a rather particular feature of the public transport network is that many routes service common subsets of stations. We discuss the possibility of new scaling laws that govern intrinsic properties of such subsets.

Ordering chaos and synchronization transitions by chemical delay and coupling on scale-free neuronal networks

International Nuclear Information System (INIS)

Gong Yubing; Xie Yanhang; Lin Xiu; Hao Yinghang; Ma Xiaoguang

2010-01-01

Research highlights: → Chemical delay and chemical coupling can tame chaotic bursting. → Chemical delay-induced transitions from bursting synchronization to intermittent multiple spiking synchronizations. → Chemical coupling-induced different types of delay-dependent firing transitions. - Abstract: Chemical synaptic connections are more common than electric ones in neurons, and information transmission delay is especially significant for the synapses of chemical type. In this paper, we report a phenomenon of ordering spatiotemporal chaos and synchronization transitions by the delays and coupling through chemical synapses of modified Hodgkin-Huxley (MHH) neurons on scale-free networks. As the delay τ is increased, the neurons exhibit transitions from bursting synchronization (BS) to intermittent multiple spiking synchronizations (SS). As the coupling g syn is increased, the neurons exhibit different types of firing transitions, depending on the values of τ. For a smaller τ, there are transitions from spatiotemporal chaotic bursting (SCB) to BS or SS; while for a larger τ, there are transitions from SCB to intermittent multiple SS. These findings show that the delays and coupling through chemical synapses can tame the chaotic firings and repeatedly enhance the firing synchronization of neurons, and hence could play important roles in the firing activity of the neurons on scale-free networks.

Walking Across Wikipedia: A Scale-Free Network Model of Semantic Memory Retrieval

Directory of Open Access Journals (Sweden)

Graham William Thompson

2014-02-01

Full Text Available Semantic knowledge has been investigated using both online and offline methods. One common online method is category recall, in which members of a semantic category like animals are retrieved in a given period of time. The order, timing, and number of retrievals are used as assays of semantic memory processes. One common offline method is corpus analysis, in which the structure of semantic knowledge is extracted from texts using co-occurrence or encyclopedic methods. Online measures of semantic processing, as well as offline measures of semantic structure, have yielded data resembling inverse power law distributions. The aim of the present study is to investigate whether these patterns in data might be related. A semantic network model of animal knowledge is formulated on the basis of Wikipedia pages and their overlap in word probability distributions. The network is scale-free, in that node degree is related to node frequency as an inverse power law. A random walk over this network is shown to simulate a number of results from a category recall experiment, including power law-like distributions of inter-response intervals. Results are discussed in terms of theories of semantic structure and processing.

Discrete scale-free distributions and associated limit theorems

International Nuclear Information System (INIS)

Hopcraft, K I; Jakeman, E; Matthews, J O

2004-01-01

Consideration is given to the convergence properties of sums of identical, independently distributed random variables drawn from a class of discrete distributions with power-law tails, which are relevant to scale-free networks. Different limiting distributions, and rates of convergence to these limits, are identified and depend on the index of the tail. For indices ≥2, the topology evolves to a random Poisson network, but the rate of convergence can be extraordinarily slow and unlikely to be yet evident for the current size of the WWW for example. It is shown that treating discrete scale-free behaviour with continuum or mean-field approximations can lead to incorrect results. (letter to the editor)

Epidemic spreading in scale-free networks including the effect of individual vigilance

International Nuclear Information System (INIS)

Gong Yong-Wang; Song Yu-Rong; Jiang Guo-Ping

2012-01-01

In this paper, we study the epidemic spreading in scale-free networks and propose a new susceptible-infected-recovered (SIR) model that includes the effect of individual vigilance. In our model, the effective spreading rate is dynamically adjusted with the time evolution at the vigilance period. Using the mean-field theory, an analytical result is derived. It shows that individual vigilance has no effect on the epidemic threshold. The numerical simulations agree well with the analytical result. Furthermore, we investigate the effect of individual vigilance on the epidemic spreading speed. It is shown that individual vigilance can slow the epidemic spreading speed effectively and delay the arrival of peak epidemic infection. (general)

Optimization and Implementation of Scaling-Free CORDIC-Based Direct Digital Frequency Synthesizer for Body Care Area Network Systems

Directory of Open Access Journals (Sweden)

Ying-Shen Juang

2012-01-01

Full Text Available Coordinate rotation digital computer (CORDIC is an efficient algorithm for computations of trigonometric functions. Scaling-free-CORDIC is one of the famous CORDIC implementations with advantages of speed and area. In this paper, a novel direct digital frequency synthesizer (DDFS based on scaling-free CORDIC is presented. The proposed multiplier-less architecture with small ROM and pipeline data path has advantages of high data rate, high precision, high performance, and less hardware cost. The design procedure with performance and hardware analysis for optimization has also been given. It is verified by Matlab simulations and then implemented with field programmable gate array (FPGA by Verilog. The spurious-free dynamic range (SFDR is over 86.85 dBc, and the signal-to-noise ratio (SNR is more than 81.12 dB. The scaling-free CORDIC-based architecture is suitable for VLSI implementations for the DDFS applications in terms of hardware cost, power consumption, SNR, and SFDR. The proposed DDFS is very suitable for medical instruments and body care area network systems.

Epidemic spreading on dynamical networks with temporary hubs and stable scale-free degree distribution

International Nuclear Information System (INIS)

Wu, An-Cai

2014-01-01

Recent empirical analyses of some realistic dynamical networks have demonstrated that their degree distributions are stable scale-free (SF), but the instantaneous well-connected hubs at one point of time can quickly become weakly connected. Motivated by these empirical results, we propose a simple toy dynamical agent-to-agent contact network model, in which each agent stays at one node of a static underlay network and the nearest neighbors swap their positions with each other. Although the degree distribution of the dynamical network model at any one time is equal to that in the static underlay network, the numbers and identities of each agent’s contacts will change over time. It is found that the dynamic interaction tends to suppress epidemic spreading in terms of larger epidemic threshold, smaller prevalence (the fraction of infected individuals) and smaller velocity of epidemic outbreak. Furthermore, the dynamic interaction results in the prevalence to undergo a phase transition at a finite threshold of the epidemic spread rate in the thermodynamic limit, which is in contradiction to the absence of an epidemic threshold in static SF networks. Some of these findings obtained from heterogeneous mean-field theory are in good agreement with numerical simulations. (paper)

Link prediction in weighted networks

DEFF Research Database (Denmark)

Wind, David Kofoed; Mørup, Morten

2012-01-01

Many complex networks feature relations with weight information. Some models utilize this information while other ignore the weight information when inferring the structure. In this paper we investigate if edge-weights when modeling real networks, carry important information about the network...... is to infer presence of edges, but that simpler models are better at inferring the actual weights....

The relations between network-operation and topological-property in a scale-free and small-world network with community structure

Science.gov (United States)

Ma, Fei; Yao, Bing

2017-10-01

It is always an open, demanding and difficult task for generating available model to simulate dynamical functions and reveal inner principles from complex systems and networks. In this article, due to lots of real-life and artificial networks are built from series of simple and small groups (components), we discuss some interesting and helpful network-operation to generate more realistic network models. In view of community structure (modular topology), we present a class of sparse network models N(t , m) . At the moment, we capture the fact the N(t , 4) has not only scale-free feature, which means that the probability that a randomly selected vertex with degree k decays as a power-law, following P(k) ∼k-γ, where γ is the degree exponent, but also small-world property, which indicates that the typical distance between two uniform randomly chosen vertices grows proportionally to logarithm of the order of N(t , 4) , namely, relatively shorter diameter and lower average path length, simultaneously displays higher clustering coefficient. Next, as a new topological parameter correlating to reliability, synchronization capability and diffusion properties of networks, the number of spanning trees over a network is studied in more detail, an exact analytical solution for the number of spanning trees of the N(t , 4) is obtained. Based on the network-operation, part hub-vertex linking with each other will be helpful for structuring various network models and investigating the rules related with real-life networks.

Microarray analysis and scale-free gene networks identify candidate regulators in drought-stressed roots of loblolly pine (P. taeda L.

Directory of Open Access Journals (Sweden)

Bordeaux John M

2011-05-01

Full Text Available Abstract Background Global transcriptional analysis of loblolly pine (Pinus taeda L. is challenging due to limited molecular tools. PtGen2, a 26,496 feature cDNA microarray, was fabricated and used to assess drought-induced gene expression in loblolly pine propagule roots. Statistical analysis of differential expression and weighted gene correlation network analysis were used to identify drought-responsive genes and further characterize the molecular basis of drought tolerance in loblolly pine. Results Microarrays were used to interrogate root cDNA populations obtained from 12 genotype × treatment combinations (four genotypes, three watering regimes. Comparison of drought-stressed roots with roots from the control treatment identified 2445 genes displaying at least a 1.5-fold expression difference (false discovery rate = 0.01. Genes commonly associated with drought response in pine and other plant species, as well as a number of abiotic and biotic stress-related genes, were up-regulated in drought-stressed roots. Only 76 genes were identified as differentially expressed in drought-recovered roots, indicating that the transcript population can return to the pre-drought state within 48 hours. Gene correlation analysis predicts a scale-free network topology and identifies eleven co-expression modules that ranged in size from 34 to 938 members. Network topological parameters identified a number of central nodes (hubs including those with significant homology (E-values ≤ 2 × 10-30 to 9-cis-epoxycarotenoid dioxygenase, zeatin O-glucosyltransferase, and ABA-responsive protein. Identified hubs also include genes that have been associated previously with osmotic stress, phytohormones, enzymes that detoxify reactive oxygen species, and several genes of unknown function. Conclusion PtGen2 was used to evaluate transcriptome responses in loblolly pine and was leveraged to identify 2445 differentially expressed genes responding to severe drought stress in

Microarray analysis and scale-free gene networks identify candidate regulators in drought-stressed roots of loblolly pine (P. taeda L.)

Science.gov (United States)

2011-01-01

Background Global transcriptional analysis of loblolly pine (Pinus taeda L.) is challenging due to limited molecular tools. PtGen2, a 26,496 feature cDNA microarray, was fabricated and used to assess drought-induced gene expression in loblolly pine propagule roots. Statistical analysis of differential expression and weighted gene correlation network analysis were used to identify drought-responsive genes and further characterize the molecular basis of drought tolerance in loblolly pine. Results Microarrays were used to interrogate root cDNA populations obtained from 12 genotype × treatment combinations (four genotypes, three watering regimes). Comparison of drought-stressed roots with roots from the control treatment identified 2445 genes displaying at least a 1.5-fold expression difference (false discovery rate = 0.01). Genes commonly associated with drought response in pine and other plant species, as well as a number of abiotic and biotic stress-related genes, were up-regulated in drought-stressed roots. Only 76 genes were identified as differentially expressed in drought-recovered roots, indicating that the transcript population can return to the pre-drought state within 48 hours. Gene correlation analysis predicts a scale-free network topology and identifies eleven co-expression modules that ranged in size from 34 to 938 members. Network topological parameters identified a number of central nodes (hubs) including those with significant homology (E-values ≤ 2 × 10-30) to 9-cis-epoxycarotenoid dioxygenase, zeatin O-glucosyltransferase, and ABA-responsive protein. Identified hubs also include genes that have been associated previously with osmotic stress, phytohormones, enzymes that detoxify reactive oxygen species, and several genes of unknown function. Conclusion PtGen2 was used to evaluate transcriptome responses in loblolly pine and was leveraged to identify 2445 differentially expressed genes responding to severe drought stress in roots. Many of the

Scaling Laws in Chennai Bus Network

OpenAIRE

Chatterjee, Atanu; Ramadurai, Gitakrishnan

2015-01-01

In this paper, we study the structural properties of the complex bus network of Chennai. We formulate this extensive network structure by identifying each bus stop as a node, and a bus which stops at any two adjacent bus stops as an edge connecting the nodes. Rigorous statistical analysis of this data shows that the Chennai bus network displays small-world properties and a scale-free degree distribution with the power-law exponent, $\\gamma > 3$.

Collective firing regularity of a scale-free Hodgkin–Huxley neuronal network in response to a subthreshold signal

Energy Technology Data Exchange (ETDEWEB)

Yilmaz, Ergin, E-mail: erginyilmaz@yahoo.com [Department of Biomedical Engineering, Engineering Faculty, Bülent Ecevit University, 67100 Zonguldak (Turkey); Ozer, Mahmut [Department of Electrical and Electronics Engineering, Engineering Faculty, Bülent Ecevit University, 67100 Zonguldak (Turkey)

2013-08-01

We consider a scale-free network of stochastic HH neurons driven by a subthreshold periodic stimulus and investigate how the collective spiking regularity or the collective temporal coherence changes with the stimulus frequency, the intrinsic noise (or the cell size), the network average degree and the coupling strength. We show that the best temporal coherence is obtained for a certain level of the intrinsic noise when the frequencies of the external stimulus and the subthreshold oscillations of the network elements match. We also find that the collective regularity exhibits a resonance-like behavior depending on both the coupling strength and the network average degree at the optimal values of the stimulus frequency and the cell size, indicating that the best temporal coherence also requires an optimal coupling strength and an optimal average degree of the connectivity.

Effects of packet retransmission with finite packet lifetime on traffic capacity in scale-free networks

Science.gov (United States)

Jiang, Zhong-Yuan; Ma, Jian-Feng

Existing routing strategies such as the global dynamic routing [X. Ling, M. B. Hu, R. Jiang and Q. S. Wu, Phys. Rev. E 81, 016113 (2010)] can achieve very high traffic capacity at the cost of extremely long packet traveling delay. In many real complex networks, especially for real-time applications such as the instant communication software, extremely long packet traveling time is unacceptable. In this work, we propose to assign a finite Time-to-Live (TTL) parameter for each packet. To guarantee every packet to arrive at its destination within its TTL, we assume that a packet is retransmitted by its source once its TTL expires. We employ source routing mechanisms in the traffic model to avoid the routing-flaps induced by the global dynamic routing. We compose extensive simulations to verify our proposed mechanisms. With small TTL, the effects of packet retransmission on network traffic capacity are obvious, and the phase transition from flow free state to congested state occurs. For the purpose of reducing the computation frequency of the routing table, we employ a computing cycle Tc within which the routing table is recomputed once. The simulation results show that the traffic capacity decreases with increasing Tc. Our work provides a good insight into the understanding of effects of packet retransmission with finite packet lifetime on traffic capacity in scale-free networks.

Emergence of scale-free close-knit friendship structure in online social networks.

Directory of Open Access Journals (Sweden)

Ai-Xiang Cui

Full Text Available Although the structural properties of online social networks have attracted much attention, the properties of the close-knit friendship structures remain an important question. Here, we mainly focus on how these mesoscale structures are affected by the local and global structural properties. Analyzing the data of four large-scale online social networks reveals several common structural properties. It is found that not only the local structures given by the indegree, outdegree, and reciprocal degree distributions follow a similar scaling behavior, the mesoscale structures represented by the distributions of close-knit friendship structures also exhibit a similar scaling law. The degree correlation is very weak over a wide range of the degrees. We propose a simple directed network model that captures the observed properties. The model incorporates two mechanisms: reciprocation and preferential attachment. Through rate equation analysis of our model, the local-scale and mesoscale structural properties are derived. In the local-scale, the same scaling behavior of indegree and outdegree distributions stems from indegree and outdegree of nodes both growing as the same function of the introduction time, and the reciprocal degree distribution also shows the same power-law due to the linear relationship between the reciprocal degree and in/outdegree of nodes. In the mesoscale, the distributions of four closed triples representing close-knit friendship structures are found to exhibit identical power-laws, a behavior attributed to the negligible degree correlations. Intriguingly, all the power-law exponents of the distributions in the local-scale and mesoscale depend only on one global parameter, the mean in/outdegree, while both the mean in/outdegree and the reciprocity together determine the ratio of the reciprocal degree of a node to its in/outdegree. Structural properties of numerical simulated networks are analyzed and compared with each of the four

Emergence of scale-free close-knit friendship structure in online social networks.

Science.gov (United States)

Cui, Ai-Xiang; Zhang, Zi-Ke; Tang, Ming; Hui, Pak Ming; Fu, Yan

2012-01-01

Although the structural properties of online social networks have attracted much attention, the properties of the close-knit friendship structures remain an important question. Here, we mainly focus on how these mesoscale structures are affected by the local and global structural properties. Analyzing the data of four large-scale online social networks reveals several common structural properties. It is found that not only the local structures given by the indegree, outdegree, and reciprocal degree distributions follow a similar scaling behavior, the mesoscale structures represented by the distributions of close-knit friendship structures also exhibit a similar scaling law. The degree correlation is very weak over a wide range of the degrees. We propose a simple directed network model that captures the observed properties. The model incorporates two mechanisms: reciprocation and preferential attachment. Through rate equation analysis of our model, the local-scale and mesoscale structural properties are derived. In the local-scale, the same scaling behavior of indegree and outdegree distributions stems from indegree and outdegree of nodes both growing as the same function of the introduction time, and the reciprocal degree distribution also shows the same power-law due to the linear relationship between the reciprocal degree and in/outdegree of nodes. In the mesoscale, the distributions of four closed triples representing close-knit friendship structures are found to exhibit identical power-laws, a behavior attributed to the negligible degree correlations. Intriguingly, all the power-law exponents of the distributions in the local-scale and mesoscale depend only on one global parameter, the mean in/outdegree, while both the mean in/outdegree and the reciprocity together determine the ratio of the reciprocal degree of a node to its in/outdegree. Structural properties of numerical simulated networks are analyzed and compared with each of the four real networks. This

Broad-scale small-world network topology induces optimal synchronization of flexible oscillators

International Nuclear Information System (INIS)

Markovič, Rene; Gosak, Marko; Marhl, Marko

2014-01-01

The discovery of small-world and scale-free properties of many man-made and natural complex networks has attracted increasing attention. Of particular interest is how the structural properties of a network facilitate and constrain its dynamical behavior. In this paper we study the synchronization of weakly coupled limit-cycle oscillators in dependence on the network topology as well as the dynamical features of individual oscillators. We show that flexible oscillators, characterized by near zero values of divergence, express maximal correlation in broad-scale small-world networks, whereas the non-flexible (rigid) oscillators are best correlated in more heterogeneous scale-free networks. We found that the synchronization behavior is governed by the interplay between the networks global efficiency and the mutual frequency adaptation. The latter differs for flexible and rigid oscillators. The results are discussed in terms of evolutionary advantages of broad-scale small-world networks in biological systems

An efficient strategy for enhancing traffic capacity by removing links in scale-free networks

International Nuclear Information System (INIS)

Huang, Wei; Chow, Tommy W S

2010-01-01

An efficient link-removal strategy, called the variance-of-neighbor-degree-reduction (VNDR) strategy, for enhancing the traffic capacity of scale-free networks is proposed in this paper. The VNDR strategy, which considers the important role of hub nodes, balances the amounts of packets routed from each node to the node's neighbors. Compared against the outcomes of strategies that remove links among hub nodes, our results show that the traffic capacity can be greatly enhanced, especially under the shortest path routing strategy. It is also found that the average transport time is effectively reduced by using the VNDR strategy only under the shortest path routing strategy

The integration of weighted gene association networks based on information entropy.

Science.gov (United States)

Yang, Fan; Wu, Duzhi; Lin, Limei; Yang, Jian; Yang, Tinghong; Zhao, Jing

2017-01-01

Constructing genome scale weighted gene association networks (WGAN) from multiple data sources is one of research hot spots in systems biology. In this paper, we employ information entropy to describe the uncertain degree of gene-gene links and propose a strategy for data integration of weighted networks. We use this method to integrate four existing human weighted gene association networks and construct a much larger WGAN, which includes richer biology information while still keeps high functional relevance between linked gene pairs. The new WGAN shows satisfactory performance in disease gene prediction, which suggests the reliability of our integration strategy. Compared with existing integration methods, our method takes the advantage of the inherent characteristics of the component networks and pays less attention to the biology background of the data. It can make full use of existing biological networks with low computational effort.

Particle swarm optimization with scale-free interactions.

Directory of Open Access Journals (Sweden)

Chen Liu

Full Text Available The particle swarm optimization (PSO algorithm, in which individuals collaborate with their interacted neighbors like bird flocking to search for the optima, has been successfully applied in a wide range of fields pertaining to searching and convergence. Here we employ the scale-free network to represent the inter-individual interactions in the population, named SF-PSO. In contrast to the traditional PSO with fully-connected topology or regular topology, the scale-free topology used in SF-PSO incorporates the diversity of individuals in searching and information dissemination ability, leading to a quite different optimization process. Systematic results with respect to several standard test functions demonstrate that SF-PSO gives rise to a better balance between the convergence speed and the optimum quality, accounting for its much better performance than that of the traditional PSO algorithms. We further explore the dynamical searching process microscopically, finding that the cooperation of hub nodes and non-hub nodes play a crucial role in optimizing the convergence process. Our work may have implications in computational intelligence and complex networks.

Faster Parallel Traversal of Scale Free Graphs at Extreme Scale with Vertex Delegates

KAUST Repository

Pearce, Roger

2014-11-01

© 2014 IEEE. At extreme scale, irregularities in the structure of scale-free graphs such as social network graphs limit our ability to analyze these important and growing datasets. A key challenge is the presence of high-degree vertices (hubs), that leads to parallel workload and storage imbalances. The imbalances occur because existing partitioning techniques are not able to effectively partition high-degree vertices. We present techniques to distribute storage, computation, and communication of hubs for extreme scale graphs in distributed memory supercomputers. To balance the hub processing workload, we distribute hub data structures and related computation among a set of delegates. The delegates coordinate using highly optimized, yet portable, asynchronous broadcast and reduction operations. We demonstrate scalability of our new algorithmic technique using Breadth-First Search (BFS), Single Source Shortest Path (SSSP), K-Core Decomposition, and Page-Rank on synthetically generated scale-free graphs. Our results show excellent scalability on large scale-free graphs up to 131K cores of the IBM BG/P, and outperform the best known Graph500 performance on BG/P Intrepid by 15%

Faster Parallel Traversal of Scale Free Graphs at Extreme Scale with Vertex Delegates

KAUST Repository

Pearce, Roger; Gokhale, Maya; Amato, Nancy M.

2014-01-01

© 2014 IEEE. At extreme scale, irregularities in the structure of scale-free graphs such as social network graphs limit our ability to analyze these important and growing datasets. A key challenge is the presence of high-degree vertices (hubs), that leads to parallel workload and storage imbalances. The imbalances occur because existing partitioning techniques are not able to effectively partition high-degree vertices. We present techniques to distribute storage, computation, and communication of hubs for extreme scale graphs in distributed memory supercomputers. To balance the hub processing workload, we distribute hub data structures and related computation among a set of delegates. The delegates coordinate using highly optimized, yet portable, asynchronous broadcast and reduction operations. We demonstrate scalability of our new algorithmic technique using Breadth-First Search (BFS), Single Source Shortest Path (SSSP), K-Core Decomposition, and Page-Rank on synthetically generated scale-free graphs. Our results show excellent scalability on large scale-free graphs up to 131K cores of the IBM BG/P, and outperform the best known Graph500 performance on BG/P Intrepid by 15%

A recursive method for calculating the total number of spanning trees and its applications in self-similar small-world scale-free network models

Science.gov (United States)

Ma, Fei; Su, Jing; Yao, Bing

2018-05-01

The problem of determining and calculating the number of spanning trees of any finite graph (model) is a great challenge, and has been studied in various fields, such as discrete applied mathematics, theoretical computer science, physics, chemistry and the like. In this paper, firstly, thank to lots of real-life systems and artificial networks built by all kinds of functions and combinations among some simpler and smaller elements (components), we discuss some helpful network-operation, including link-operation and merge-operation, to design more realistic and complicated network models. Secondly, we present a method for computing the total number of spanning trees. As an accessible example, we apply this method to space of trees and cycles respectively, and our results suggest that it is indeed a better one for such models. In order to reflect more widely practical applications and potentially theoretical significance, we study the enumerating method in some existing scale-free network models. On the other hand, we set up a class of new models displaying scale-free feature, that is to say, following P(k) k-γ, where γ is the degree exponent. Based on detailed calculation, the degree exponent γ of our deterministic scale-free models satisfies γ > 3. In the rest of our discussions, we not only calculate analytically the solutions of average path length, which indicates our models have small-world property being prevailing in amounts of complex systems, but also derive the number of spanning trees by means of the recursive method described in this paper, which clarifies our method is convenient to research these models.

Dynamic Modeling of Cell-Free Biochemical Networks Using Effective Kinetic Models

Directory of Open Access Journals (Sweden)

Joseph A. Wayman

2015-03-01

Full Text Available Cell-free systems offer many advantages for the study, manipulation and modeling of metabolism compared to in vivo processes. Many of the challenges confronting genome-scale kinetic modeling can potentially be overcome in a cell-free system. For example, there is no complex transcriptional regulation to consider, transient metabolic measurements are easier to obtain, and we no longer have to consider cell growth. Thus, cell-free operation holds several significant advantages for model development, identification and validation. Theoretically, genome-scale cell-free kinetic models may be possible for industrially important organisms, such as E. coli, if a simple, tractable framework for integrating allosteric regulation with enzyme kinetics can be formulated. Toward this unmet need, we present an effective biochemical network modeling framework for building dynamic cell-free metabolic models. The key innovation of our approach is the integration of simple effective rules encoding complex allosteric regulation with traditional kinetic pathway modeling. We tested our approach by modeling the time evolution of several hypothetical cell-free metabolic networks. We found that simple effective rules, when integrated with traditional enzyme kinetic expressions, captured complex allosteric patterns such as ultrasensitivity or non-competitive inhibition in the absence of mechanistic information. Second, when integrated into network models, these rules captured classic regulatory patterns such as product-induced feedback inhibition. Lastly, we showed, at least for the network architectures considered here, that we could simultaneously estimate kinetic parameters and allosteric connectivity from synthetic data starting from an unbiased collection of possible allosteric structures using particle swarm optimization. However, when starting with an initial population that was heavily enriched with incorrect structures, our particle swarm approach could converge

Effects of adaptive degrees of trust on coevolution of quantum strategies on scale-free networks

Science.gov (United States)

Li, Qiang; Chen, Minyou; Perc, Matjaž; Iqbal, Azhar; Abbott, Derek

2013-10-01

We study the impact of adaptive degrees of trust on the evolution of cooperation in the quantum prisoner's dilemma game. In addition to the strategies, links between players are also subject to evolution. Starting with a scale-free interaction network, players adjust trust towards their neighbors based on received payoffs. The latter governs the strategy adoption process, while trust governs the rewiring of links. As soon as the degree of trust towards a neighbor drops to zero, the link is rewired to another randomly chosen player within the network. We find that for small temptations to defect cooperators always dominate, while for intermediate and strong temptations a single quantum strategy is able to outperform all other strategies. In general, reciprocal trust remains within close relationships and favors the dominance of a single strategy. Due to coevolution, the power-law degree distributions transform to Poisson distributions.

Evolution of weighted complex bus transit networks with flow

Science.gov (United States)

Huang, Ailing; Xiong, Jie; Shen, Jinsheng; Guan, Wei

2016-02-01

Study on the intrinsic properties and evolutional mechanism of urban public transit networks (PTNs) has great significance for transit planning and control, particularly considering passengers’ dynamic behaviors. This paper presents an empirical analysis for exploring the complex properties of Beijing’s weighted bus transit network (BTN) based on passenger flow in L-space, and proposes a bi-level evolution model to simulate the development of transit routes from the view of complex network. The model is an iterative process that is driven by passengers’ travel demands and dual-controlled interest mechanism, which is composed of passengers’ spatio-temporal requirements and cost constraint of transit agencies. Also, the flow’s dynamic behaviors, including the evolutions of travel demand, sectional flow attracted by a new link and flow perturbation triggered in nearby routes, are taken into consideration in the evolutional process. We present the numerical experiment to validate the model, where the main parameters are estimated by using distribution functions that are deduced from real-world data. The results obtained have proven that our model can generate a BTN with complex properties, such as the scale-free behavior or small-world phenomenon, which shows an agreement with our empirical results. Our study’s results can be exploited to optimize the real BTN’s structure and improve the network’s robustness.

Search in spatial scale-free networks

International Nuclear Information System (INIS)

Thadakamalla, H P; Albert, R; Kumara, S R T

2007-01-01

We study the decentralized search problem in a family of parameterized spatial network models that are heterogeneous in node degree. We investigate several algorithms and illustrate that some of these algorithms exploit the heterogeneity in the network to find short paths by using only local information. In addition, we demonstrate that the spatial network model belongs to a classof searchable networks for a wide range of parameter space. Further, we test these algorithms on the US airline network which belongs to this class of networks and demonstrate that searchability is a generic property of the US airline network. These results provide insights on designing the structure of distributed networks that need effective decentralized search algorithms

Centrality measures for immunization of weighted networks

Directory of Open Access Journals (Sweden)

Mohammad Khansari

2016-03-01

Full Text Available Effective immunization of individual communities with minimal cost in vaccination has made great discussion surrounding the realm of complex networks. Meanwhile, proper realization of relationship among people in society and applying it to social networks brings about substantial improvements in immunization. Accordingly, weighted graph in which link weights represent the intensity and intimacy of relationships is an acceptable approach. In this work we employ weighted graphs and a wide variety of weighted centrality measures to distinguish important individuals in contagion of diseases. Furthermore, we propose new centrality measures for weighted networks. Our experimental results show that Radiality-Degree centrality is satisfying for weighted BA networks. Additionally, PageRank-Degree and Radiality-Degree centralities showmoreacceptable performance in targeted immunization of weighted networks.

Comparative empirical analysis of flow-weighted transit route networks in R-space and evolution modeling

Science.gov (United States)

Huang, Ailing; Zang, Guangzhi; He, Zhengbing; Guan, Wei

2017-05-01

Urban public transit system is a typical mixed complex network with dynamic flow, and its evolution should be a process coupling topological structure with flow dynamics, which has received little attention. This paper presents the R-space to make a comparative empirical analysis on Beijing’s flow-weighted transit route network (TRN) and we found that both the Beijing’s TRNs in the year of 2011 and 2015 exhibit the scale-free properties. As such, we propose an evolution model driven by flow to simulate the development of TRNs with consideration of the passengers’ dynamical behaviors triggered by topological change. The model simulates that the evolution of TRN is an iterative process. At each time step, a certain number of new routes are generated driven by travel demands, which leads to dynamical evolution of new routes’ flow and triggers perturbation in nearby routes that will further impact the next round of opening new routes. We present the theoretical analysis based on the mean-field theory, as well as the numerical simulation for this model. The results obtained agree well with our empirical analysis results, which indicate that our model can simulate the TRN evolution with scale-free properties for distributions of node’s strength and degree. The purpose of this paper is to illustrate the global evolutional mechanism of transit network that will be used to exploit planning and design strategies for real TRNs.

Scaling properties of domain wall networks

International Nuclear Information System (INIS)

Leite, A. M. M.; Martins, C. J. A. P.

2011-01-01

We revisit the cosmological evolution of domain wall networks, taking advantage of recent improvements in computing power. We carry out high-resolution field theory simulations in two, three and four spatial dimensions to study the effects of dimensionality and damping on the evolution of the network. Our results are consistent with the expected scale-invariant evolution of the network, which suggests that previous hints of deviations from this behavior may have been due to the limited dynamical range of those simulations. We also use the results of very large (1024 3 ) simulations in three cosmological epochs to provide a calibration for the velocity-dependent one-scale model for domain walls: we numerically determine the two free model parameters to have the values c w =0.5±0.2 and k w =1.1±0.3.

Analysis of the airport network of India as a complex weighted network

Science.gov (United States)

Bagler, Ganesh

2008-05-01

Transportation infrastructure of a country is one of the most important indicators of its economic growth. Here we study the Airport Network of India (ANI) which represents India’s domestic civil aviation infrastructure as a complex network. We find that ANI, a network of domestic airports connected by air links, is a small-world network characterized by a truncated power-law degree distribution and has a signature of hierarchy. We investigate ANI as a weighted network to explore its various properties and compare them with their topological counterparts. The traffic in ANI, as in the World-wide Airport Network (WAN), is found to be accumulated on interconnected groups of airports and is concentrated between large airports. In contrast to WAN, ANI is found to be having disassortative mixing which is offset by the traffic dynamics. The analysis indicates possible mechanism of formation of a national transportation network, which is different from that on a global scale.

Multilevel Evolutionary Algorithm that Optimizes the Structure of Scale-Free Networks for the Promotion of Cooperation in the Prisoner's Dilemma game.

Science.gov (United States)

Liu, Penghui; Liu, Jing

2017-06-28

Understanding the emergence of cooperation has long been a challenge across disciplines. Even if network reciprocity reflected the importance of population structure in promoting cooperation, it remains an open question how population structures can be optimized, thereby enhancing cooperation. In this paper, we attempt to apply the evolutionary algorithm (EA) to solve this highly complex problem. However, as it is hard to evaluate the fitness (cooperation level) of population structures, simply employing the canonical evolutionary algorithm (EA) may fail in optimization. Thus, we propose a new EA variant named mlEA-C PD -SFN to promote the cooperation level of scale-free networks (SFNs) in the Prisoner's Dilemma Game (PDG). Meanwhile, to verify the preceding conclusions may not be applied to this problem, we also provide the optimization results of the comparative experiment (EA cluster ), which optimizes the clustering coefficient of structures. Even if preceding research concluded that highly clustered scale-free networks enhance cooperation, we find EA cluster does not perform desirably, while mlEA-C PD -SFN performs efficiently in different optimization environments. We hope that mlEA-C PD -SFN may help promote the structure of species in nature and that more general properties that enhance cooperation can be learned from the output structures.

Weighted Distances in Scale-Free Configuration Models

Science.gov (United States)

Adriaans, Erwin; Komjáthy, Júlia

2018-01-01

In this paper we study first-passage percolation in the configuration model with empirical degree distribution that follows a power-law with exponent τ \\in (2,3) . We assign independent and identically distributed (i.i.d.) weights to the edges of the graph. We investigate the weighted distance (the length of the shortest weighted path) between two uniformly chosen vertices, called typical distances. When the underlying age-dependent branching process approximating the local neighborhoods of vertices is found to produce infinitely many individuals in finite time—called explosive branching process—Baroni, Hofstad and the second author showed in Baroni et al. (J Appl Probab 54(1):146-164, 2017) that typical distances converge in distribution to a bounded random variable. The order of magnitude of typical distances remained open for the τ \\in (2,3) case when the underlying branching process is not explosive. We close this gap by determining the first order of magnitude of typical distances in this regime for arbitrary, not necessary continuous edge-weight distributions that produce a non-explosive age-dependent branching process with infinite mean power-law offspring distributions. This sequence tends to infinity with the amount of vertices, and, by choosing an appropriate weight distribution, can be tuned to be any growing function that is O(log log n) , where n is the number of vertices in the graph. We show that the result remains valid for the the erased configuration model as well, where we delete loops and any second and further edges between two vertices.

Topology dependent epidemic spreading velocity in weighted networks

International Nuclear Information System (INIS)

Duan, Wei; Qiu, Xiaogang; Quax, Rick; Lees, Michael; Sloot, Peter M A

2014-01-01

Many diffusive processes occur on structured networks with weighted links, such as disease spread by airplane transport or information diffusion in social networks or blogs. Understanding the impact of weight-connectivity correlations on epidemic spreading in weighted networks is crucial to support decision-making on disease control and other diffusive processes. However, a real understanding of epidemic spreading velocity in weighted networks is still lacking. Here we conduct a numerical study of the velocity of a Reed–Frost epidemic spreading process in various weighted network topologies as a function of the correlations between edge weights and node degrees. We find that a positive weight-connectivity correlation leads to a faster epidemic spreading compared to an unweighted network. In contrast, we find that both uncorrelated and negatively correlated weight distributions lead to slower spreading processes. In the case of positive weight-connectivity correlations, the acceleration of spreading velocity is weak when the heterogeneity of weight distribution increases. (paper)

Fast sparsely synchronized brain rhythms in a scale-free neural network.

Science.gov (United States)

Kim, Sang-Yoon; Lim, Woochang

2015-08-01

We consider a directed version of the Barabási-Albert scale-free network model with symmetric preferential attachment with the same in- and out-degrees and study the emergence of sparsely synchronized rhythms for a fixed attachment degree in an inhibitory population of fast-spiking Izhikevich interneurons. Fast sparsely synchronized rhythms with stochastic and intermittent neuronal discharges are found to appear for large values of J (synaptic inhibition strength) and D (noise intensity). For an intensive study we fix J at a sufficiently large value and investigate the population states by increasing D. For small D, full synchronization with the same population-rhythm frequency fp and mean firing rate (MFR) fi of individual neurons occurs, while for large D partial synchronization with fp>〈fi〉 (〈fi〉: ensemble-averaged MFR) appears due to intermittent discharge of individual neurons; in particular, the case of fp>4〈fi〉 is referred to as sparse synchronization. For the case of partial and sparse synchronization, MFRs of individual neurons vary depending on their degrees. As D passes a critical value D* (which is determined by employing an order parameter), a transition to unsynchronization occurs due to the destructive role of noise to spoil the pacing between sparse spikes. For Dnetwork structure for the case of partial and sparse synchronization, which is in contrast to the case of

Fast sparsely synchronized brain rhythms in a scale-free neural network

Science.gov (United States)

Kim, Sang-Yoon; Lim, Woochang

2015-08-01

We consider a directed version of the Barabási-Albert scale-free network model with symmetric preferential attachment with the same in- and out-degrees and study the emergence of sparsely synchronized rhythms for a fixed attachment degree in an inhibitory population of fast-spiking Izhikevich interneurons. Fast sparsely synchronized rhythms with stochastic and intermittent neuronal discharges are found to appear for large values of J (synaptic inhibition strength) and D (noise intensity). For an intensive study we fix J at a sufficiently large value and investigate the population states by increasing D . For small D , full synchronization with the same population-rhythm frequency fp and mean firing rate (MFR) fi of individual neurons occurs, while for large D partial synchronization with fp> ( : ensemble-averaged MFR) appears due to intermittent discharge of individual neurons; in particular, the case of fp>4 is referred to as sparse synchronization. For the case of partial and sparse synchronization, MFRs of individual neurons vary depending on their degrees. As D passes a critical value D* (which is determined by employing an order parameter), a transition to unsynchronization occurs due to the destructive role of noise to spoil the pacing between sparse spikes. For D network structure for the case of partial and sparse synchronization, which is in contrast to the case of statistically homogeneous

Theoretical Properties for Neural Networks with Weight Matrices of Low Displacement Rank

OpenAIRE

Zhao, Liang; Liao, Siyu; Wang, Yanzhi; Li, Zhe; Tang, Jian; Pan, Victor; Yuan, Bo

2017-01-01

Recently low displacement rank (LDR) matrices, or so-called structured matrices, have been proposed to compress large-scale neural networks. Empirical results have shown that neural networks with weight matrices of LDR matrices, referred as LDR neural networks, can achieve significant reduction in space and computational complexity while retaining high accuracy. We formally study LDR matrices in deep learning. First, we prove the universal approximation property of LDR neural networks with a ...

Epidemic spreading on weighted complex networks

International Nuclear Information System (INIS)

Sun, Ye; Liu, Chuang; Zhang, Chu-Xu; Zhang, Zi-Ke

2014-01-01

Nowadays, the emergence of online services provides various multi-relation information to support the comprehensive understanding of the epidemic spreading process. In this Letter, we consider the edge weights to represent such multi-role relations. In addition, we perform detailed analysis of two representative metrics, outbreak threshold and epidemic prevalence, on SIS and SIR models. Both theoretical and simulation results find good agreements with each other. Furthermore, experiments show that, on fully mixed networks, the weight distribution on edges would not affect the epidemic results once the average weight of whole network is fixed. This work may shed some light on the in-depth understanding of epidemic spreading on multi-relation and weighted networks.

Epidemic spreading on weighted complex networks

Energy Technology Data Exchange (ETDEWEB)

Sun, Ye [Institute of Information Economy, Hangzhou Normal University, Hangzhou 311121 (China); Alibaba Research Center of Complexity Science, Hangzhou Normal University, Hangzhou 311121 (China); Liu, Chuang, E-mail: liuchuang@hznu.edu.cn [Institute of Information Economy, Hangzhou Normal University, Hangzhou 311121 (China); Alibaba Research Center of Complexity Science, Hangzhou Normal University, Hangzhou 311121 (China); Zhang, Chu-Xu [Institute of Information Economy, Hangzhou Normal University, Hangzhou 311121 (China); Alibaba Research Center of Complexity Science, Hangzhou Normal University, Hangzhou 311121 (China); Zhang, Zi-Ke, E-mail: zhangzike@gmail.com [Institute of Information Economy, Hangzhou Normal University, Hangzhou 311121 (China); Alibaba Research Center of Complexity Science, Hangzhou Normal University, Hangzhou 311121 (China)

2014-01-31

Nowadays, the emergence of online services provides various multi-relation information to support the comprehensive understanding of the epidemic spreading process. In this Letter, we consider the edge weights to represent such multi-role relations. In addition, we perform detailed analysis of two representative metrics, outbreak threshold and epidemic prevalence, on SIS and SIR models. Both theoretical and simulation results find good agreements with each other. Furthermore, experiments show that, on fully mixed networks, the weight distribution on edges would not affect the epidemic results once the average weight of whole network is fixed. This work may shed some light on the in-depth understanding of epidemic spreading on multi-relation and weighted networks.

Obtaining Arbitrary Prescribed Mean Field Dynamics for Recurrently Coupled Networks of Type-I Spiking Neurons with Analytically Determined Weights

Directory of Open Access Journals (Sweden)

Wilten eNicola

2016-02-01

Full Text Available A fundamental question in computational neuroscience is how to connect a network of spiking neurons to produce desired macroscopic or mean field dynamics. One possible approach is through the Neural Engineering Framework (NEF. The NEF approach requires quantities called decoders which are solved through an optimization problem requiring large matrix inversion. Here, we show how a decoder can be obtained analytically for type I and certain type II firing rates as a function of the heterogeneity of its associated neuron. These decoders generate approximants for functions that converge to the desired function in mean-squared error like 1/N, where N is the number of neurons in the network. We refer to these decoders as scale-invariant decoders due to their structure. These decoders generate weights for a network of neurons through the NEF formula for weights. These weights force the spiking network to have arbitrary and prescribed mean field dynamics. The weights generated with scale-invariant decoders all lie on low dimensional hypersurfaces asymptotically. We demonstrate the applicability of these scale-invariant decoders and weight surfaces by constructing networks of spiking theta neurons that replicate the dynamics of various well known dynamical systems such as the neural integrator, Van der Pol system and the Lorenz system. As these decoders are analytically determined and non-unique, the weights are also analytically determined and non-unique. We discuss the implications for measured weights of neuronal networks

Obtaining Arbitrary Prescribed Mean Field Dynamics for Recurrently Coupled Networks of Type-I Spiking Neurons with Analytically Determined Weights.

Science.gov (United States)

Nicola, Wilten; Tripp, Bryan; Scott, Matthew

2016-01-01

A fundamental question in computational neuroscience is how to connect a network of spiking neurons to produce desired macroscopic or mean field dynamics. One possible approach is through the Neural Engineering Framework (NEF). The NEF approach requires quantities called decoders which are solved through an optimization problem requiring large matrix inversion. Here, we show how a decoder can be obtained analytically for type I and certain type II firing rates as a function of the heterogeneity of its associated neuron. These decoders generate approximants for functions that converge to the desired function in mean-squared error like 1/N, where N is the number of neurons in the network. We refer to these decoders as scale-invariant decoders due to their structure. These decoders generate weights for a network of neurons through the NEF formula for weights. These weights force the spiking network to have arbitrary and prescribed mean field dynamics. The weights generated with scale-invariant decoders all lie on low dimensional hypersurfaces asymptotically. We demonstrate the applicability of these scale-invariant decoders and weight surfaces by constructing networks of spiking theta neurons that replicate the dynamics of various well known dynamical systems such as the neural integrator, Van der Pol system and the Lorenz system. As these decoders are analytically determined and non-unique, the weights are also analytically determined and non-unique. We discuss the implications for measured weights of neuronal networks.

Topology of the Erasmus student mobility network

Science.gov (United States)

Derzsi, A.; Derzsy, N.; Káptalan, E.; Néda, Z.

2011-07-01

The collaboration network generated by the Erasmus student mobilities in the year 2003 is analyzed and modeled. Nodes of this bipartite network are European universities and links are the Erasmus mobilities between these universities. This network is a complex directed and weighted graph. The non-directed and non-weighted projection of this network does not exhibit a scale-free nature, but proves to be a small-word type random network with a giant component. The connectivity data indicates an exponential degree distribution, a relatively high clustering coefficient and a small radius. It can be easily modeled by using a simple configuration model and arguing the exponential degree distribution. The weighted and directed version of the network can also be described by means of simple random network models.

Modeling Multilevel Supplier Selection Problem Based on Weighted-Directed Network and Its Solution

Directory of Open Access Journals (Sweden)

Chia-Te Wei

2017-01-01

Full Text Available With the rapid development of economy, the supplier network is becoming more and more complicated. It is important to choose the right suppliers for improving the efficiency of the supply chain, so how to choose the right ones is one of the important research directions of supply chain management. This paper studies the partner selection problem from the perspective of supplier network global optimization. Firstly, this paper discusses and forms the evaluation system to estimate the supplier from the two indicators of risk and greenness and then applies the value as the weight of the network between two nodes to build a weighted-directed supplier network; secondly, the study establishes the optimal combination model of supplier selection based on the global network perspective and solves the model by the dynamic programming-tabu search algorithm and the improved ant colony algorithm, respectively; finally, different scale simulation examples are given to testify the efficiency of the two algorithms. The results show that the ant colony algorithm is superior to the tabu search one as a whole, but the latter is slightly better than the former when network scale is small.

Topology dependent epidemic spreading velocity in weighted networks

NARCIS (Netherlands)

Duan, W.; Quax, R.; Lees, M.; Qiu, X.; Sloot, P.M.A.

2014-01-01

Many diffusive processes occur on structured networks with weighted links, such as disease spread by airplane transport or information diffusion in social networks or blogs. Understanding the impact of weight-connectivity correlations on epidemic spreading in weighted networks is crucial to support

Efficiency of quarantine and self-protection processes in epidemic spreading control on scale-free networks

Science.gov (United States)

Esquivel-Gómez, Jose de Jesus; Barajas-Ramírez, Juan Gonzalo

2018-01-01

One of the most effective mechanisms to contain the spread of an infectious disease through a population is the implementation of quarantine policies. However, its efficiency is affected by different aspects, for example, the structure of the underlining social network where highly connected individuals are more likely to become infected; therefore, the speed of the transmission of the decease is directly determined by the degree distribution of the network. Another aspect that influences the effectiveness of the quarantine is the self-protection processes of the individuals in the population, that is, they try to avoid contact with potentially infected individuals. In this paper, we investigate the efficiency of quarantine and self-protection processes in preventing the spreading of infectious diseases over complex networks with a power-law degree distribution [ P ( k ) ˜ k - ν ] for different ν values. We propose two alternative scale-free models that result in power-law degree distributions above and below the exponent ν = 3 associated with the conventional Barabási-Albert model. Our results show that the exponent ν determines the effectiveness of these policies in controlling the spreading process. More precisely, we show that for the ν exponent below three, the quarantine mechanism loses effectiveness. However, the efficiency is improved if the quarantine is jointly implemented with a self-protection process driving the number of infected individuals significantly lower.

A high-level and scalable approach for generating scale-free graphs using active objects

NARCIS (Netherlands)

K. Azadbakht (Keyvan); N. Bezirgiannis (Nikolaos); F.S. de Boer (Frank); Aliakbary, S. (Sadegh)

2016-01-01

textabstractThe Barabasi-Albert model (BA) is designed to generate scale-free networks using the preferential attachment mechanism. In the preferential attachment (PA) model, new nodes are sequentially introduced to the network and they attach preferentially to existing nodes. PA is a classical

Broiler weight estimation based on machine vision and artificial neural network.

Science.gov (United States)

Amraei, S; Abdanan Mehdizadeh, S; Salari, S

2017-04-01

1. Machine vision and artificial neural network (ANN) procedures were used to estimate live body weight of broiler chickens in 30 1-d-old broiler chickens reared for 42 d. 2. Imaging was performed two times daily. To localise chickens within the pen, an ellipse fitting algorithm was used and the chickens' head and tail removed using the Chan-Vese method. 3. The correlations between the body weight and 6 physical extracted features indicated that there were strong correlations between body weight and the 5 features including area, perimeter, convex area, major and minor axis length. 5. According to statistical analysis there was no significant difference between morning and afternoon data over 42 d. 6. In an attempt to improve the accuracy of live weight approximation different ANN techniques, including Bayesian regulation, Levenberg-Marquardt, Scaled conjugate gradient and gradient descent were used. Bayesian regulation with R 2 value of 0.98 was the best network for prediction of broiler weight. 7. The accuracy of the machine vision technique was examined and most errors were less than 50 g.

Mixed random walks with a trap in scale-free networks including nearest-neighbor and next-nearest-neighbor jumps

Science.gov (United States)

Zhang, Zhongzhi; Dong, Yuze; Sheng, Yibin

2015-10-01

Random walks including non-nearest-neighbor jumps appear in many real situations such as the diffusion of adatoms and have found numerous applications including PageRank search algorithm; however, related theoretical results are much less for this dynamical process. In this paper, we present a study of mixed random walks in a family of fractal scale-free networks, where both nearest-neighbor and next-nearest-neighbor jumps are included. We focus on trapping problem in the network family, which is a particular case of random walks with a perfect trap fixed at the central high-degree node. We derive analytical expressions for the average trapping time (ATT), a quantitative indicator measuring the efficiency of the trapping process, by using two different methods, the results of which are consistent with each other. Furthermore, we analytically determine all the eigenvalues and their multiplicities for the fundamental matrix characterizing the dynamical process. Our results show that although next-nearest-neighbor jumps have no effect on the leading scaling of the trapping efficiency, they can strongly affect the prefactor of ATT, providing insight into better understanding of random-walk process in complex systems.

Data Driven Broiler Weight Forecasting using Dynamic Neural Network Models

DEFF Research Database (Denmark)

Johansen, Simon Vestergaard; Bendtsen, Jan Dimon; Riisgaard-Jensen, Martin

2017-01-01

In this article, the dynamic influence of environmental broiler house conditions and broiler growth is investigated. Dynamic neural network forecasting models have been trained on farm-scale broiler batch production data from 12 batches from the same house. The model forecasts future broiler weight...... and uses environmental conditions such as heating, ventilation, and temperature along with broiler behavior such as feed and water consumption. Training data and forecasting data is analyzed to explain when the model might fail at generalizing. We present ensemble broiler weight forecasts to day 7, 14, 21...

English and Chinese languages as weighted complex networks

Science.gov (United States)

Sheng, Long; Li, Chunguang

2009-06-01

In this paper, we analyze statistical properties of English and Chinese written human language within the framework of weighted complex networks. The two language networks are based on an English novel and a Chinese biography, respectively, and both of the networks are constructed in the same way. By comparing the intensity and density of connections between the two networks, we find that high weight connections in Chinese language networks prevail more than those in English language networks. Furthermore, some of the topological and weighted quantities are compared. The results display some differences in the structural organizations between the two language networks. These observations indicate that the two languages may have different linguistic mechanisms and different combinatorial natures.

Stabilizing weighted complex networks

International Nuclear Information System (INIS)

Xiang Linying; Chen Zengqiang; Liu Zhongxin; Chen Fei; Yuan Zhuzhi

2007-01-01

Real networks often consist of local units which interact with each other via asymmetric and heterogeneous connections. In this paper, the V-stability problem is investigated for a class of asymmetric weighted coupled networks with nonidentical node dynamics, which includes the unweighted network as a special case. Pinning control is suggested to stabilize such a coupled network. The complicated stabilization problem is reduced to measuring the semi-negative property of the characteristic matrix which embodies not only the network topology, but also the node self-dynamics and the control gains. It is found that network stabilizability depends critically on the second largest eigenvalue of the characteristic matrix. The smaller the second largest eigenvalue is, the more the network is pinning controllable. Numerical simulations of two representative networks composed of non-chaotic systems and chaotic systems, respectively, are shown for illustration and verification

Model of community emergence in weighted social networks

Science.gov (United States)

Kumpula, J. M.; Onnela, J.-P.; Saramäki, J.; Kertész, J.; Kaski, K.

2009-04-01

Over the years network theory has proven to be rapidly expanding methodology to investigate various complex systems and it has turned out to give quite unparalleled insight to their structure, function, and response through data analysis, modeling, and simulation. For social systems in particular the network approach has empirically revealed a modular structure due to interplay between the network topology and link weights between network nodes or individuals. This inspired us to develop a simple network model that could catch some salient features of mesoscopic community and macroscopic topology formation during network evolution. Our model is based on two fundamental mechanisms of network sociology for individuals to find new friends, namely cyclic closure and focal closure, which are mimicked by local search-link-reinforcement and random global attachment mechanisms, respectively. In addition we included to the model a node deletion mechanism by removing all its links simultaneously, which corresponds for an individual to depart from the network. Here we describe in detail the implementation of our model algorithm, which was found to be computationally efficient and produce many empirically observed features of large-scale social networks. Thus this model opens a new perspective for studying such collective social phenomena as spreading, structure formation, and evolutionary processes.

Features of complex networks in a free-software operating system

International Nuclear Information System (INIS)

Nair, Rajiv; Nagarjuna, G; Ray, Arnab K

2012-01-01

We propose a mathematical model to fit the degree distribution of directed dependency networks in free and open-source software. In this complex system, the intermediate scales of both the in-directed and out-directed dependency networks follow a power-law trend (specifically Zipf's law). Deviations from this feature are found both for the highly linked nodes, and the poorly linked nodes. This is due to finite-size effects in the networks, and the parameters needed to model finite-size behaviour make a quantitative distinction between the in-directed and out-directed networks. We also provide a model to describe the dynamic evolution of the network, and account for its saturation in the long-time limit.

Waste Receiving and Processing (WRAP) Facility Weight Scale Analysis Fairbanks Weight Scale Evaluation Results

International Nuclear Information System (INIS)

JOHNSON, M.D.

1999-01-01

Fairbanks Weight Scales are used at the Waste Receiving and Processing (WRAP) facility to determine the weight of waste drums as they are received, processed, and shipped. Due to recent problems, discovered during calibration, the WRAP Engineering Department has completed this document which outlines both the investigation of the infeed conveyor scale failure in September of 1999 and recommendations for calibration procedure modifications designed to correct deficiencies in the current procedures

Neuromorphic photonic networks using silicon photonic weight banks.

Science.gov (United States)

Tait, Alexander N; de Lima, Thomas Ferreira; Zhou, Ellen; Wu, Allie X; Nahmias, Mitchell A; Shastri, Bhavin J; Prucnal, Paul R

2017-08-07

Photonic systems for high-performance information processing have attracted renewed interest. Neuromorphic silicon photonics has the potential to integrate processing functions that vastly exceed the capabilities of electronics. We report first observations of a recurrent silicon photonic neural network, in which connections are configured by microring weight banks. A mathematical isomorphism between the silicon photonic circuit and a continuous neural network model is demonstrated through dynamical bifurcation analysis. Exploiting this isomorphism, a simulated 24-node silicon photonic neural network is programmed using "neural compiler" to solve a differential system emulation task. A 294-fold acceleration against a conventional benchmark is predicted. We also propose and derive power consumption analysis for modulator-class neurons that, as opposed to laser-class neurons, are compatible with silicon photonic platforms. At increased scale, Neuromorphic silicon photonics could access new regimes of ultrafast information processing for radio, control, and scientific computing.

Poor—rich demarcation of Matthew effect on scale-free systems and its application

International Nuclear Information System (INIS)

Dong, Yan; Sui-Ran, Yu; Ming, Dong; Bouras, Abdelaziz

2011-01-01

In a scale-free network, only a minority of nodes are connected very often, while the majority of nodes are connected rarely. However, what is the ratio of minority nodes to majority nodes resulting from the Matthew effect? In this paper, based on a simple preferential random model, the poor-rich demarcation points are found to vary in a limited range, and form a poor-rich demarcation interval that approximates to k/m in [3,4]. As a result, the (cumulative) degree distribution of a scale-free network can be divided into three intervals: the poor interval, the demarcation interval and the rich interval. The inequality of the degree distribution in each interval is measured. Finally, the Matthew effect is applied to the ABC analysis of project management. (general)

A class of vertex-edge-growth small-world network models having scale-free, self-similar and hierarchical characters

Science.gov (United States)

Ma, Fei; Su, Jing; Hao, Yongxing; Yao, Bing; Yan, Guanghui

2018-02-01

The problem of uncovering the internal operating function of network models is intriguing, demanded and attractive in researches of complex networks. Notice that, in the past two decades, a great number of artificial models are built to try to answer the above mentioned task. Based on the different growth ways, these previous models can be divided into two categories, one type, possessing the preferential attachment, follows a power-law P(k) ∼k-γ, 2 motivated from a new attachment way, vertex-edge-growth network-operation, more precisely, the couple of both them. We report that this model is sparse, small world and hierarchical. And then, not only is scale-free feature in our model, but also lies the degree parameter γ(≈ 3 . 242) out the typical range. Note that, we suggest that the coexistence of multiple vertex growth ways will have a prominent effect on the power-law parameter γ, and the preferential attachment plays a dominate role on the development of networks over time. At the end of this paper, we obtain an exact analytical expression for the total number of spanning trees of models and also capture spanning trees entropy which we have compared with those of their corresponding component elements.

Precision Scaling of Neural Networks for Efficient Audio Processing

OpenAIRE

Ko, Jong Hwan; Fromm, Josh; Philipose, Matthai; Tashev, Ivan; Zarar, Shuayb

2017-01-01

While deep neural networks have shown powerful performance in many audio applications, their large computation and memory demand has been a challenge for real-time processing. In this paper, we study the impact of scaling the precision of neural networks on the performance of two common audio processing tasks, namely, voice-activity detection and single-channel speech enhancement. We determine the optimal pair of weight/neuron bit precision by exploring its impact on both the performance and ...

Distributed weighted least-squares estimation with fast convergence for large-scale systems☆

Science.gov (United States)

Marelli, Damián Edgardo; Fu, Minyue

2015-01-01

In this paper we study a distributed weighted least-squares estimation problem for a large-scale system consisting of a network of interconnected sub-systems. Each sub-system is concerned with a subset of the unknown parameters and has a measurement linear in the unknown parameters with additive noise. The distributed estimation task is for each sub-system to compute the globally optimal estimate of its own parameters using its own measurement and information shared with the network through neighborhood communication. We first provide a fully distributed iterative algorithm to asymptotically compute the global optimal estimate. The convergence rate of the algorithm will be maximized using a scaling parameter and a preconditioning method. This algorithm works for a general network. For a network without loops, we also provide a different iterative algorithm to compute the global optimal estimate which converges in a finite number of steps. We include numerical experiments to illustrate the performances of the proposed methods. PMID:25641976

Distributed weighted least-squares estimation with fast convergence for large-scale systems.

Science.gov (United States)

Marelli, Damián Edgardo; Fu, Minyue

2015-01-01

In this paper we study a distributed weighted least-squares estimation problem for a large-scale system consisting of a network of interconnected sub-systems. Each sub-system is concerned with a subset of the unknown parameters and has a measurement linear in the unknown parameters with additive noise. The distributed estimation task is for each sub-system to compute the globally optimal estimate of its own parameters using its own measurement and information shared with the network through neighborhood communication. We first provide a fully distributed iterative algorithm to asymptotically compute the global optimal estimate. The convergence rate of the algorithm will be maximized using a scaling parameter and a preconditioning method. This algorithm works for a general network. For a network without loops, we also provide a different iterative algorithm to compute the global optimal estimate which converges in a finite number of steps. We include numerical experiments to illustrate the performances of the proposed methods.

Entropy of network ensembles

Science.gov (United States)

Bianconi, Ginestra

2009-03-01

In this paper we generalize the concept of random networks to describe network ensembles with nontrivial features by a statistical mechanics approach. This framework is able to describe undirected and directed network ensembles as well as weighted network ensembles. These networks might have nontrivial community structure or, in the case of networks embedded in a given space, they might have a link probability with a nontrivial dependence on the distance between the nodes. These ensembles are characterized by their entropy, which evaluates the cardinality of networks in the ensemble. In particular, in this paper we define and evaluate the structural entropy, i.e., the entropy of the ensembles of undirected uncorrelated simple networks with given degree sequence. We stress the apparent paradox that scale-free degree distributions are characterized by having small structural entropy while they are so widely encountered in natural, social, and technological complex systems. We propose a solution to the paradox by proving that scale-free degree distributions are the most likely degree distribution with the corresponding value of the structural entropy. Finally, the general framework we present in this paper is able to describe microcanonical ensembles of networks as well as canonical or hidden-variable network ensembles with significant implications for the formulation of network-constructing algorithms.

Small-world effect induced by weight randomization on regular networks

International Nuclear Information System (INIS)

Li, Menghui; Fan, Ying; Wang, Dahui; Li, Daqing; Wu, Jinshan; Di, Zengru

2007-01-01

The concept of edge weight provides additional depth for describing and adjusting the properties of networks. Redistribution of edge weight can effectively change the properties of networks even though the corresponding binary topology remains unchanged. Based on regular networks with initially homogeneous dissimilarity weights, random redistribution of edge weight can be enough to induce small world phenomena. The effects of random weight redistribution on both static properties and dynamical models of networks are investigated. The results reveal that randomization of weight can enhance the ability of synchronization of chaotic systems dramatically

Discovering disease-associated genes in weighted protein-protein interaction networks

Science.gov (United States)

Cui, Ying; Cai, Meng; Stanley, H. Eugene

2018-04-01

Although there have been many network-based attempts to discover disease-associated genes, most of them have not taken edge weight - which quantifies their relative strength - into consideration. We use connection weights in a protein-protein interaction (PPI) network to locate disease-related genes. We analyze the topological properties of both weighted and unweighted PPI networks and design an improved random forest classifier to distinguish disease genes from non-disease genes. We use a cross-validation test to confirm that weighted networks are better able to discover disease-associated genes than unweighted networks, which indicates that including link weight in the analysis of network properties provides a better model of complex genotype-phenotype associations.

Neutral Theory and Scale-Free Neural Dynamics

Science.gov (United States)

Martinello, Matteo; Hidalgo, Jorge; Maritan, Amos; di Santo, Serena; Plenz, Dietmar; Muñoz, Miguel A.

2017-10-01

Neural tissues have been consistently observed to be spontaneously active and to generate highly variable (scale-free distributed) outbursts of activity in vivo and in vitro. Understanding whether these heterogeneous patterns of activity stem from the underlying neural dynamics operating at the edge of a phase transition is a fascinating possibility, as criticality has been argued to entail many possible important functional advantages in biological computing systems. Here, we employ a well-accepted model for neural dynamics to elucidate an alternative scenario in which diverse neuronal avalanches, obeying scaling, can coexist simultaneously, even if the network operates in a regime far from the edge of any phase transition. We show that perturbations to the system state unfold dynamically according to a "neutral drift" (i.e., guided only by stochasticity) with respect to the background of endogenous spontaneous activity, and that such a neutral dynamics—akin to neutral theories of population genetics and of biogeography—implies marginal propagation of perturbations and scale-free distributed causal avalanches. We argue that causal information, not easily accessible to experiments, is essential to elucidate the nature and statistics of neural avalanches, and that neutral dynamics is likely to play an important role in the cortex functioning. We discuss the implications of these findings to design new empirical approaches to shed further light on how the brain processes and stores information.

Spin glass behavior of the antiferromagnetic Heisenberg model on scale free network

International Nuclear Information System (INIS)

Surungan, Tasrief; Zen, Freddy P; Williams, Anthony G

2015-01-01

Randomness and frustration are considered to be the key ingredients for the existence of spin glass (SG) phase. In a canonical system, these ingredients are realized by the random mixture of ferromagnetic (FM) and antiferromagnetic (AF) couplings. The study by Bartolozzi et al. [Phys. Rev. B73, 224419 (2006)] who observed the presence of SG phase on the AF Ising model on scale free network (SFN) is stimulating. It is a new type of SG system where randomness and frustration are not caused by the presence of FM and AF couplings. To further elaborate this type of system, here we study Heisenberg model on AF SFN and search for the SG phase. The canonical SG Heisenberg model is not observed in d-dimensional regular lattices for (d ≤ 3). We can make an analogy for the connectivity density (m) of SFN with the dimensionality of the regular lattice. It should be plausible to find the critical value of m for the existence of SG behaviour, analogous to the lower critical dimension (d l ) for the canonical SG systems. Here we study system with m = 2, 3, 4 and 5. We used Replica Exchange algorithm of Monte Carlo Method and calculated the SG order parameter. We observed SG phase for each value of m and estimated its corersponding critical temperature. (paper)

Surrogate-assisted identification of influences of network construction on evolving weighted functional networks

Science.gov (United States)

Stahn, Kirsten; Lehnertz, Klaus

2017-12-01

We aim at identifying factors that may affect the characteristics of evolving weighted networks derived from empirical observations. To this end, we employ various chains of analysis that are often used in field studies for a data-driven derivation and characterization of such networks. As an example, we consider fully connected, weighted functional brain networks before, during, and after epileptic seizures that we derive from multichannel electroencephalographic data recorded from epilepsy patients. For these evolving networks, we estimate clustering coefficient and average shortest path length in a time-resolved manner. Lastly, we make use of surrogate concepts that we apply at various levels of the chain of analysis to assess to what extent network characteristics are dominated by properties of the electroencephalographic recordings and/or the evolving weighted networks, which may be accessible more easily. We observe that characteristics are differently affected by the unavoidable referencing of the electroencephalographic recording, by the time-series-analysis technique used to derive the properties of network links, and whether or not networks were normalized. Importantly, for the majority of analysis settings, we observe temporal evolutions of network characteristics to merely reflect the temporal evolutions of mean interaction strengths. Such a property of the data may be accessible more easily, which would render the weighted network approach—as used here—as an overly complicated description of simple aspects of the data.

A method for identifying hierarchical sub-networks / modules and weighting network links based on their similarity in sub-network / module affiliation

Directory of Open Access Journals (Sweden)

WenJun Zhang

2016-06-01

Full Text Available Some networks, including biological networks, consist of hierarchical sub-networks / modules. Based on my previous study, in present study a method for both identifying hierarchical sub-networks / modules and weighting network links is proposed. It is based on the cluster analysis in which between-node similarity in sets of adjacency nodes is used. Two matrices, linkWeightMat and linkClusterIDs, are achieved by using the algorithm. Two links with both the same weight in linkWeightMat and the same cluster ID in linkClusterIDs belong to the same sub-network / module. Two links with the same weight in linkWeightMat but different cluster IDs in linkClusterIDs belong to two sub-networks / modules at the same hirarchical level. However, a link with an unique cluster ID in linkClusterIDs does not belong to any sub-networks / modules. A sub-network / module of the greater weight is the more connected sub-network / modules. Matlab codes of the algorithm are presented.

Spatial connections in regional climate model rainfall outputs at different temporal scales: Application of network theory

Science.gov (United States)

Naufan, Ihsan; Sivakumar, Bellie; Woldemeskel, Fitsum M.; Raghavan, Srivatsan V.; Vu, Minh Tue; Liong, Shie-Yui

2018-01-01

Understanding the spatial and temporal variability of rainfall has always been a great challenge, and the impacts of climate change further complicate this issue. The present study employs the concepts of complex networks to study the spatial connections in rainfall, with emphasis on climate change and rainfall scaling. Rainfall outputs (during 1961-1990) from a regional climate model (i.e. Weather Research and Forecasting (WRF) model that downscaled the European Centre for Medium-range Weather Forecasts, ECMWF ERA-40 reanalyses) over Southeast Asia are studied, and data corresponding to eight different temporal scales (6-hr, 12-hr, daily, 2-day, 4-day, weekly, biweekly, and monthly) are analyzed. Two network-based methods are applied to examine the connections in rainfall: clustering coefficient (a measure of the network's local density) and degree distribution (a measure of the network's spread). The influence of rainfall correlation threshold (T) on spatial connections is also investigated by considering seven different threshold levels (ranging from 0.5 to 0.8). The results indicate that: (1) rainfall networks corresponding to much coarser temporal scales exhibit properties similar to that of small-world networks, regardless of the threshold; (2) rainfall networks corresponding to much finer temporal scales may be classified as either small-world networks or scale-free networks, depending upon the threshold; and (3) rainfall spatial connections exhibit a transition phase at intermediate temporal scales, especially at high thresholds. These results suggest that the most appropriate model for studying spatial connections may often be different at different temporal scales, and that a combination of small-world and scale-free network models might be more appropriate for rainfall upscaling/downscaling across all scales, in the strict sense of scale-invariance. The results also suggest that spatial connections in the studied rainfall networks in Southeast Asia are

Multiple coherence resonances and synchronization transitions by time delay in adaptive scale-free neuronal networks with spike-timing-dependent plasticity

International Nuclear Information System (INIS)

Xie, Huijuan; Gong, Yubing

2017-01-01

In this paper, we numerically study the effect of spike-timing-dependent plasticity (STDP) on multiple coherence resonances (MCR) and synchronization transitions (ST) induced by time delay in adaptive scale-free Hodgkin–Huxley neuronal networks. It is found that STDP has a big influence on MCR and ST induced by time delay and on the effect of network average degree on the MCR and ST. MCR is enhanced or suppressed as the adjusting rate A p of STDP decreases or increases, and there is optimal A p by which ST becomes strongest. As network average degree 〈k〉 increases, ST is enhanced and there is optimal 〈k〉 at which MCR becomes strongest. Moreover, for a larger A p value, ST is enhanced more rapidly with increasing 〈k〉 and the optimal 〈k〉 for MCR increases. These results show that STDP can either enhance or suppress MCR, and there is optimal STDP that can most strongly enhance ST induced by time delay in the adaptive neuronal networks. These findings could find potential implication for the information processing and transmission in neural systems.

Fuzzy Weight Cluster-Based Routing Algorithm for Wireless Sensor Networks

Directory of Open Access Journals (Sweden)

Teng Gao

2015-01-01

Full Text Available Cluster-based protocol is a kind of important routing in wireless sensor networks. However, due to the uneven distribution of cluster heads in classical clustering algorithm, some nodes may run out of energy too early, which is not suitable for large-scale wireless sensor networks. In this paper, a distributed clustering algorithm based on fuzzy weighted attributes is put forward to ensure both energy efficiency and extensibility. On the premise of a comprehensive consideration of all attributes, the corresponding weight of each parameter is assigned by using the direct method of fuzzy engineering theory. Then, each node works out property value. These property values will be mapped to the time axis and be triggered by a timer to broadcast cluster headers. At the same time, the radio coverage method is adopted, in order to avoid collisions and to ensure the symmetrical distribution of cluster heads. The aggregated data are forwarded to the sink node in the form of multihop. The simulation results demonstrate that clustering algorithm based on fuzzy weighted attributes has a longer life expectancy and better extensibility than LEACH-like algorithms.

Equilibrium and nonequilibrium properties of Boolean decision problems on scale-free graphs with competing interactions with external biases

Science.gov (United States)

Zhu, Zheng; Andresen, Juan Carlos; Janzen, Katharina; Katzgraber, Helmut G.

2013-03-01

We study the equilibrium and nonequilibrium properties of Boolean decision problems with competing interactions on scale-free graphs in a magnetic field. Previous studies at zero field have shown a remarkable equilibrium stability of Boolean variables (Ising spins) with competing interactions (spin glasses) on scale-free networks. When the exponent that describes the power-law decay of the connectivity of the network is strictly larger than 3, the system undergoes a spin-glass transition. However, when the exponent is equal to or less than 3, the glass phase is stable for all temperatures. First we perform finite-temperature Monte Carlo simulations in a field to test the robustness of the spin-glass phase and show, in agreement with analytical calculations, that the system exhibits a de Almeida-Thouless line. Furthermore, we study avalanches in the system at zero temperature to see if the system displays self-organized criticality. This would suggest that damage (avalanches) can spread across the whole system with nonzero probability, i.e., that Boolean decision problems on scale-free networks with competing interactions are fragile when not in thermal equilibrium.

TruckWeight wireless onboard scale helps oilfield services fleet find profit, compliance

Energy Technology Data Exchange (ETDEWEB)

Anon.

2007-05-15

This article presented a wireless scale that measures temperature and pressure changes in a vehicle's air suspension. The instrument is being used by Alberta-based Rusch Inc., an operator of tank trucks and pup trailers which haul potassium chloride solution, methanol, frac oil, crude oil and other fluids. Made by TruckWeight Inc., the Smart Scale relays data to a handheld receiver using a low-powered safe radio transmitter. It is designed so its power output is not high enough to ignite gases in the atmosphere near wellheads. The information from the Smart Scale is interpreted by a small computer in a handheld receiver. The axle weight and gross vehicle weight measurement is accurate to within 150 pounds. Rusch trucks operate on steep grades all year, encountering soft ground in the summer, and frozen terrain in the winter. When loading is done in the bush, it is impossible to reliably weigh the trucks, whose licensed gross combination weight is 51,300 kilograms. In Alberta, an overweight fine can trigger an audit of a company's safety record and operating practices. Running overweight also places stress on axles, suspensions, wheel-end components tires and brakes. Therefore, adhering to the rated weight is essential. In 2006, Rusch Inc. installed the Smart Scale wireless on-board scale for trucks, tractors and trailers with air suspension. The scale includes a sensor with an integrated antenna and DOT fittings for the vehicle's airline. While the truck is being loaded, the scale produces readings every 3 seconds. This maintenance-free instrument is accurate in temperature extremes ranging from -40 F to 158 F and uses common AA batteries. It is waterproof, weatherproof, shock resistant and non-corrosive. The cost to equip a tractor and trailer with a Smart Scale is $1,590 US, half the cost of a hard-wired scale. 5 figs.

Overlapping community detection in weighted networks via a Bayesian approach

Science.gov (United States)

Chen, Yi; Wang, Xiaolong; Xiang, Xin; Tang, Buzhou; Chen, Qingcai; Fan, Shixi; Bu, Junzhao

2017-02-01

Complex networks as a powerful way to represent complex systems have been widely studied during the past several years. One of the most important tasks of complex network analysis is to detect communities embedded in networks. In the real world, weighted networks are very common and may contain overlapping communities where a node is allowed to belong to multiple communities. In this paper, we propose a novel Bayesian approach, called the Bayesian mixture network (BMN) model, to detect overlapping communities in weighted networks. The advantages of our method are (i) providing soft-partition solutions in weighted networks; (ii) providing soft memberships, which quantify 'how strongly' a node belongs to a community. Experiments on a large number of real and synthetic networks show that our model has the ability in detecting overlapping communities in weighted networks and is competitive with other state-of-the-art models at shedding light on community partition.

Label-based routing for a family of scale-free, modular, planar and unclustered graphs

International Nuclear Information System (INIS)

Comellas, Francesc; Miralles, Alicia

2011-01-01

We give an optimal labeling and routing algorithm for a family of scale-free, modular and planar graphs with zero clustering. The relevant properties of this family match those of some networks associated with technological and biological systems with a low clustering, including some electronic circuits and protein networks. The existence of an efficient routing protocol for this graph model should help when designing communication algorithms in real networks and also in the understanding of their dynamic processes.

Adaptive Learning in Weighted Network Games

NARCIS (Netherlands)

Bayer, Péter; Herings, P. Jean-Jacques; Peeters, Ronald; Thuijsman, Frank

2017-01-01

This paper studies adaptive learning in the class of weighted network games. This class of games includes applications like research and development within interlinked firms, crime within social networks, the economics of pollution, and defense expenditures within allied nations. We show that for

A comparison of free weight squat to Smith machine squat using electromyography.

Science.gov (United States)

Schwanbeck, Shane; Chilibeck, Philip D; Binsted, Gordon

2009-12-01

The purpose of this experiment was to determine whether free weight or Smith machine squats were optimal for activating the prime movers of the legs and the stabilizers of the legs and the trunk. Six healthy participants performed 1 set of 8 repetitions (using a weight they could lift 8 times, i.e., 8RM, or 8 repetition maximum) for each of the free weight squat and Smith machine squat in a randomized order with a minimum of 3 days between sessions, while electromyographic (EMG) activity of the tibialis anterior, gastrocnemius, vastus medialis, vastus lateralis, biceps femoris, lumbar erector spinae, and rectus abdominus were simultaneously measured. Electromyographic activity was significantly higher by 34, 26, and 49 in the gastrocnemius, biceps femoris, and vastus medialis, respectively, during the free weight squat compared to the Smith machine squat (p free weight and Smith machine squat for any of the other muscles; however, the EMG averaged over all muscles during the free weight squat was 43% higher when compared to the Smith machine squat (p free weight squat may be more beneficial than the Smith machine squat for individuals who are looking to strengthen plantar flexors, knee flexors, and knee extensors.

Discretized kinetic theory on scale-free networks

Science.gov (United States)

Bertotti, Maria Letizia; Modanese, Giovanni

2016-10-01

The network of interpersonal connections is one of the possible heterogeneous factors which affect the income distribution emerging from micro-to-macro economic models. In this paper we equip our model discussed in [1, 2] with a network structure. The model is based on a system of n differential equations of the kinetic discretized-Boltzmann kind. The network structure is incorporated in a probabilistic way, through the introduction of a link density P(α) and of correlation coefficients P(β|α), which give the conditioned probability that an individual with α links is connected to one with β links. We study the properties of the equations and give analytical results concerning the existence, normalization and positivity of the solutions. For a fixed network with P(α) = c/α q , we investigate numerically the dependence of the detailed and marginal equilibrium distributions on the initial conditions and on the exponent q. Our results are compatible with those obtained from the Bouchaud-Mezard model and from agent-based simulations, and provide additional information about the dependence of the individual income on the level of connectivity.

Exploring network operations for data and information networks

Science.gov (United States)

Yao, Bing; Su, Jing; Ma, Fei; Wang, Xiaomin; Zhao, Xiyang; Yao, Ming

2017-01-01

Barabási and Albert, in 1999, formulated scale-free models based on some real networks: World-Wide Web, Internet, metabolic and protein networks, language or sexual networks. Scale-free networks not only appear around us, but also have high qualities in the world. As known, high quality information networks can transfer feasibly and efficiently data, clearly, their topological structures are very important for data safety. We build up network operations for constructing large scale of dynamic networks from smaller scale of network models having good property and high quality. We focus on the simplest operators to formulate complex operations, and are interesting on the closeness of operations to desired network properties.

Emergence of scale-free leadership structure in social recommender systems.

Science.gov (United States)

Zhou, Tao; Medo, Matúš; Cimini, Giulio; Zhang, Zi-Ke; Zhang, Yi-Cheng

2011-01-01

The study of the organization of social networks is important for the understanding of opinion formation, rumor spreading, and the emergence of trends and fashion. This paper reports empirical analysis of networks extracted from four leading sites with social functionality (Delicious, Flickr, Twitter and YouTube) and shows that they all display a scale-free leadership structure. To reproduce this feature, we propose an adaptive network model driven by social recommending. Artificial agent-based simulations of this model highlight a "good get richer" mechanism where users with broad interests and good judgments are likely to become popular leaders for the others. Simulations also indicate that the studied social recommendation mechanism can gradually improve the user experience by adapting to tastes of its users. Finally we outline implications for real online resource-sharing systems.

Free space optical networks for ultra-broad band services

CERN Document Server

Kartalopoulos, Stamatios V

2011-01-01

"Free Space Optical Network is a next generation communication network which uses optical waves instead of microwaves, potentially offering faster communication with ultra band width, meaning more complex communication services can be simultaneously offered. This book describes the network concepts in simple language starting with point-to-point free space optics basics and discusses networking, interoperability with existing communication network, and security. An ideal resource for communication professionals just entering the free space optical communication field and graduate students majoring in optical communications"--Provided by publisher.

Perturbation results for the Estrada index in weighted networks

Energy Technology Data Exchange (ETDEWEB)

Shang Yilun, E-mail: shylmath@hotmail.com [Institute for Cyber Security, University of Texas at San Antonio, San Antonio, TX 78249 (United States)

2011-02-18

The logarithm of the Estrada index has been proposed recently as a spectral measure to character efficiently the robustness of complex networks. In this paper, we explore the Estrada index in weighted networks and develop various perturbation results based on spectral graph theory. It is shown that the robustness of a network may be enhanced even when some edge weights are reduced. This is of particular theoretical and practical significance to network design and optimization.

Perturbation results for the Estrada index in weighted networks

International Nuclear Information System (INIS)

Shang Yilun

2011-01-01

The logarithm of the Estrada index has been proposed recently as a spectral measure to character efficiently the robustness of complex networks. In this paper, we explore the Estrada index in weighted networks and develop various perturbation results based on spectral graph theory. It is shown that the robustness of a network may be enhanced even when some edge weights are reduced. This is of particular theoretical and practical significance to network design and optimization.

A Weighted Evolving Network with Community Size Preferential Attachment

International Nuclear Information System (INIS)

Zhuo Zhiwei; Shan Erfang

2010-01-01

Community structure is an important characteristic in real complex network. It is a network consists of groups of nodes within which links are dense but among which links are sparse. In this paper, the evolving network include node, link and community growth and we apply the community size preferential attachment and strength preferential attachment to a growing weighted network model and utilize weight assigning mechanism from BBV model. The resulting network reflects the intrinsic community structure with generalized power-law distributions of nodes' degrees and strengths.

STOCK Market Differences in Correlation-Based Weighted Network

Science.gov (United States)

Youn, Janghyuk; Lee, Junghoon; Chang, Woojin

We examined the sector dynamics of Korean stock market in relation to the market volatility. The daily price data of 360 stocks for 5019 trading days (from January, 1990 to August, 2008) in Korean stock market are used. We performed the weighted network analysis and employed four measures: the average, the variance, the intensity, and the coherence of network weights (absolute values of stock return correlations) to investigate the network structure of Korean stock market. We performed regression analysis using the four measures in the seven major industry sectors and the market (seven sectors combined). We found that the average, the intensity, and the coherence of sector (subnetwork) weights increase as market becomes volatile. Except for the "Financials" sector, the variance of sector weights also grows as market volatility increases. Based on the four measures, we can categorize "Financials," "Information Technology" and "Industrials" sectors into one group, and "Materials" and "Consumer Discretionary" sectors into another group. We investigated the distributions of intrasector and intersector weights for each sector and found the differences in "Financials" sector are most distinct.

Asymmetric network connectivity using weighted harmonic averages

Science.gov (United States)

Morrison, Greg; Mahadevan, L.

2011-02-01

We propose a non-metric measure of the "closeness" felt between two nodes in an undirected, weighted graph using a simple weighted harmonic average of connectivity, that is a real-valued Generalized Erdös Number (GEN). While our measure is developed with a collaborative network in mind, the approach can be of use in a variety of artificial and real-world networks. We are able to distinguish between network topologies that standard distance metrics view as identical, and use our measure to study some simple analytically tractable networks. We show how this might be used to look at asymmetry in authorship networks such as those that inspired the integer Erdös numbers in mathematical coauthorships. We also show the utility of our approach to devise a ratings scheme that we apply to the data from the NetFlix prize, and find a significant improvement using our method over a baseline.

Network rewiring dynamics with convergence towards a star network.

Science.gov (United States)

Whigham, P A; Dick, G; Parry, M

2016-10-01

Network rewiring as a method for producing a range of structures was first introduced in 1998 by Watts & Strogatz ( Nature 393 , 440-442. (doi:10.1038/30918)). This approach allowed a transition from regular through small-world to a random network. The subsequent interest in scale-free networks motivated a number of methods for developing rewiring approaches that converged to scale-free networks. This paper presents a rewiring algorithm (RtoS) for undirected, non-degenerate, fixed size networks that transitions from regular, through small-world and scale-free to star-like networks. Applications of the approach to models for the spread of infectious disease and fixation time for a simple genetics model are used to demonstrate the efficacy and application of the approach.

Neural Network Models for Free Radical Polymerization of Methyl Methacrylate

International Nuclear Information System (INIS)

Curteanu, S.; Leon, F.; Galea, D.

2003-01-01

In this paper, a neural network modeling of the batch bulk methyl methacrylate polymerization is performed. To obtain conversion, number and weight average molecular weights, three neural networks were built. Each was a multilayer perception with one or two hidden layers. The choice of network topology, i.e. the number of hidden layers and the number of neurons in these layers, was based on achieving a compromise between precision and complexity. Thus, it was intended to have an error as small as possible at the end of back-propagation training phases, while using a network with reduced complexity. The performances of the networks were evaluated by comparing network predictions with training data, validation data (which were not uses for training), and with the results of a mechanistic model. The accurate predictions of neural networks for monomer conversion, number average molecular weight and weight average molecular weight proves that this modeling methodology gives a good representation and generalization of the batch bulk methyl methacrylate polymerization. (author)

Improving the Reliability of Network Metrics in Structural Brain Networks by Integrating Different Network Weighting Strategies into a Single Graph

Directory of Open Access Journals (Sweden)

Stavros I. Dimitriadis

2017-12-01

Full Text Available Structural brain networks estimated from diffusion MRI (dMRI via tractography have been widely studied in healthy controls and patients with neurological and psychiatric diseases. However, few studies have addressed the reliability of derived network metrics both node-specific and network-wide. Different network weighting strategies (NWS can be adopted to weight the strength of connection between two nodes yielding structural brain networks that are almost fully-weighted. Here, we scanned five healthy participants five times each, using a diffusion-weighted MRI protocol and computed edges between 90 regions of interest (ROI from the Automated Anatomical Labeling (AAL template. The edges were weighted according to nine different methods. We propose a linear combination of these nine NWS into a single graph using an appropriate diffusion distance metric. We refer to the resulting weighted graph as an Integrated Weighted Structural Brain Network (ISWBN. Additionally, we consider a topological filtering scheme that maximizes the information flow in the brain network under the constraint of the overall cost of the surviving connections. We compared each of the nine NWS and the ISWBN based on the improvement of: (a intra-class correlation coefficient (ICC of well-known network metrics, both node-wise and per network level; and (b the recognition accuracy of each subject compared to the remainder of the cohort, as an attempt to access the uniqueness of the structural brain network for each subject, after first applying our proposed topological filtering scheme. Based on a threshold where the network level ICC should be >0.90, our findings revealed that six out of nine NWS lead to unreliable results at the network level, while all nine NWS were unreliable at the node level. In comparison, our proposed ISWBN performed as well as the best performing individual NWS at the network level, and the ICC was higher compared to all individual NWS at the node

[Consumption of free sugars and excess weight in infants. A longitudinal study].

Science.gov (United States)

Jardí, Cristina; Aranda, Núria; Bedmar, Cristina; Ribot, Blanca; Elias, Irene; Aparicio, Estefania; Arija, Victoria

2018-05-14

The consumption of free sugars has been related to excess weight, with the WHO recommending an intake of <10% of total energy. The aim of this study is to assess the association between the consumption of free sugars at 12 months and the risk of excess weight at 30 months in healthy children. A longitudinal study was conducted on 81 children followed-up from birth to 30 months. A record was made of the clinical history and anthropometry, at birth, and at 12 and 30 months. Weight status was classified as with or without excess weight, according to WHO values. At 12 months, the intake of energy and nutrients was analysed by differentiating the intake of free and natural sugars. Multivariate analyses adjusted for the main confounding variables were performed. Free sugars were consumed by 40.4% of the 12-month-old children, being higher than that recommended, and being significantly higher in children with excess weight at 30 months (60.9%). The higher intake of free sugars at 12 months is associated with an increased risk of excess weight at 30 months (OR: 1.130, 95% CI: 1.032-1.238). The consumption of free sugars is much higher than that recommended in 12-month-old infants. This high intake could be a risk factor for excess weight, even at early ages. Copyright © 2018. Publicado por Elsevier España, S.L.U.

Mapping Koch curves into scale-free small-world networks

International Nuclear Information System (INIS)

Zhang Zhongzhi; Gao Shuyang; Zhou Shuigeng; Chen Lichao; Zhang Hongjuan; Guan Jihong

2010-01-01

The class of Koch fractals is one of the most interesting families of fractals, and the study of complex networks is a central issue in the scientific community. In this paper, inspired by the famous Koch fractals, we propose a mapping technique converting Koch fractals into a family of deterministic networks called Koch networks. This novel class of networks incorporates some key properties characterizing a majority of real-life networked systems-a power-law distribution with exponent in the range between 2 and 3, a high clustering coefficient, a small diameter and average path length and degree correlations. Besides, we enumerate the exact numbers of spanning trees, spanning forests and connected spanning subgraphs in the networks. All these features are obtained exactly according to the proposed generation algorithm of the networks considered. The network representation approach could be used to investigate the complexity of some real-world systems from the perspective of complex networks.

Emergence of scale-free characteristics in socio-ecological systems with bounded rationality.

Science.gov (United States)

Kasthurirathna, Dharshana; Piraveenan, Mahendra

2015-06-11

Socio-ecological systems are increasingly modelled by games played on complex networks. While the concept of Nash equilibrium assumes perfect rationality, in reality players display heterogeneous bounded rationality. Here we present a topological model of bounded rationality in socio-ecological systems, using the rationality parameter of the Quantal Response Equilibrium. We argue that system rationality could be measured by the average Kullback--Leibler divergence between Nash and Quantal Response Equilibria, and that the convergence towards Nash equilibria on average corresponds to increased system rationality. Using this model, we show that when a randomly connected socio-ecological system is topologically optimised to converge towards Nash equilibria, scale-free and small world features emerge. Therefore, optimising system rationality is an evolutionary reason for the emergence of scale-free and small-world features in socio-ecological systems. Further, we show that in games where multiple equilibria are possible, the correlation between the scale-freeness of the system and the fraction of links with multiple equilibria goes through a rapid transition when the average system rationality increases. Our results explain the influence of the topological structure of socio-ecological systems in shaping their collective cognitive behaviour, and provide an explanation for the prevalence of scale-free and small-world characteristics in such systems.

WGCNA: an R package for weighted correlation network analysis.

Science.gov (United States)

Langfelder, Peter; Horvath, Steve

2008-12-29

Correlation networks are increasingly being used in bioinformatics applications. For example, weighted gene co-expression network analysis is a systems biology method for describing the correlation patterns among genes across microarray samples. Weighted correlation network analysis (WGCNA) can be used for finding clusters (modules) of highly correlated genes, for summarizing such clusters using the module eigengene or an intramodular hub gene, for relating modules to one another and to external sample traits (using eigengene network methodology), and for calculating module membership measures. Correlation networks facilitate network based gene screening methods that can be used to identify candidate biomarkers or therapeutic targets. These methods have been successfully applied in various biological contexts, e.g. cancer, mouse genetics, yeast genetics, and analysis of brain imaging data. While parts of the correlation network methodology have been described in separate publications, there is a need to provide a user-friendly, comprehensive, and consistent software implementation and an accompanying tutorial. The WGCNA R software package is a comprehensive collection of R functions for performing various aspects of weighted correlation network analysis. The package includes functions for network construction, module detection, gene selection, calculations of topological properties, data simulation, visualization, and interfacing with external software. Along with the R package we also present R software tutorials. While the methods development was motivated by gene expression data, the underlying data mining approach can be applied to a variety of different settings. The WGCNA package provides R functions for weighted correlation network analysis, e.g. co-expression network analysis of gene expression data. The R package along with its source code and additional material are freely available at http://www.genetics.ucla.edu/labs/horvath/CoexpressionNetwork/Rpackages/WGCNA.

Using Equation-Free Computation to Accelerate Network-Free Stochastic Simulation of Chemical Kinetics.

Science.gov (United States)

Lin, Yen Ting; Chylek, Lily A; Lemons, Nathan W; Hlavacek, William S

2018-06-21

The chemical kinetics of many complex systems can be concisely represented by reaction rules, which can be used to generate reaction events via a kinetic Monte Carlo method that has been termed network-free simulation. Here, we demonstrate accelerated network-free simulation through a novel approach to equation-free computation. In this process, variables are introduced that approximately capture system state. Derivatives of these variables are estimated using short bursts of exact stochastic simulation and finite differencing. The variables are then projected forward in time via a numerical integration scheme, after which a new exact stochastic simulation is initialized and the whole process repeats. The projection step increases efficiency by bypassing the firing of numerous individual reaction events. As we show, the projected variables may be defined as populations of building blocks of chemical species. The maximal number of connected molecules included in these building blocks determines the degree of approximation. Equation-free acceleration of network-free simulation is found to be both accurate and efficient.

Plasma concentrations of free triiodothyronine predict weight change in euthyroid persons2

Science.gov (United States)

Ortega, Emilio; Pannacciulli, Nicola; Bogardus, Clifton; Krakoff, Jonathan

2007-01-01

Background Factors that influence energy metabolism and substrate oxidation, such as thyroid hormones (THs), may be important regulators of body weight. Objective We investigated associations of THs cross-sectionally with obesity, energy expenditure, and substrate oxidation and prospectively with weight change. Design Euthyroid, nondiabetic, healthy, adult Pima Indians (n = 89; 47 M, 42 F) were studied. Percentage body fat (%BF) was measured by using dual-energy X-ray absorptiometry; sleeping metabolic rate (SMR), respiratory quotient, and substrate oxidation rates were measured in a respiratory chamber. Thyroid-stimulating hormone (TSH), free thyroxine (T4), free triiodothyronine (T3), and leptin concentrations were measured in fasting plasma samples. Results TSH, but neither free T3 nor free T4, was associated with %BF and leptin concentrations (r = 0.27 and 0.29, respectively; both: P ≤ 0.01). In multiple regression analyses adjusted for age, sex, fat mass, and fat-free mass, free T3 was a positive predictor of SMR (P = 0.02). After adjustment for age, sex, %BF, and energy balance, free T3 was a negative predictor of 24-h respiratory quotient (P < 0.05) and a positive predictor of 24-h lipid oxidation rate (P = 0.006). Prospectively, after an average follow-up of 4 ± 2 y, the mean increase in weight was 3 ± 9 kg. Baseline T3 concentrations were associated with absolute and annual percentage of changes in weight (r = −0.27, P = 0.02, and r = −0.28, P = 0.009, for the age-and sex-adjusted associations, respectively). Conclusions In euthyroid Pima Indians, lower free T3 but not free T4 concentrations were an independent predictor of SMR and lipid oxidation and a predictor of weight gain. This finding indicates that control of T4-to-T3 conversion may play a role in body weight regulation. PMID:17284741

Spatial analysis of bus transport networks using network theory

Science.gov (United States)

Shanmukhappa, Tanuja; Ho, Ivan Wang-Hei; Tse, Chi Kong

2018-07-01

In this paper, we analyze the bus transport network (BTN) structure considering the spatial embedding of the network for three cities, namely, Hong Kong (HK), London (LD), and Bengaluru (BL). We propose a novel approach called supernode graph structuring for modeling the bus transport network. A static demand estimation procedure is proposed to assign the node weights by considering the points of interests (POIs) and the population distribution in the city over various localized zones. In addition, the end-to-end delay is proposed as a parameter to measure the topological efficiency of the bus networks instead of the shortest distance measure used in previous works. With the aid of supernode graph representation, important network parameters are analyzed for the directed, weighted and geo-referenced bus transport networks. It is observed that the supernode concept has significant advantage in analyzing the inherent topological behavior. For instance, the scale-free and small-world behavior becomes evident with supernode representation as compared to conventional or regular graph representation for the Hong Kong network. Significant improvement in clustering, reduction in path length, and increase in centrality values are observed in all the three networks with supernode representation. The correlation between topologically central nodes and the geographically central nodes reveals the interesting fact that the proposed static demand estimation method for assigning node weights aids in better identifying the geographically significant nodes in the network. The impact of these geographically significant nodes on the local traffic behavior is demonstrated by simulation using the SUMO (Simulation of Urban Mobility) tool which is also supported by real-world empirical data, and our results indicate that the traffic speed around a particular bus stop can reach a jammed state from a free flow state due to the presence of these geographically important nodes. A comparison

Comparison of joint kinetics during free weight and flywheel resistance exercise.

Science.gov (United States)

Chiu, Loren Z F; Salem, George J

2006-08-01

The most common modality for resistance exercise is free weight resistance. Alternative methods of providing external resistance have been investigated, in particular for use in microgravity environments such as space flight. One alternative modality is flywheel inertial resistance, which generates resistance as a function of the mass, distribution of mass, and angular acceleration of the flywheel. The purpose of this investigation was to characterize net joint kinetics of multijoint exercises performed with a flywheel inertial resistance device in comparison to free weights. Eleven trained men and women performed the front squat, lunge, and push press on separate days with free weight or flywheel resistance, while instrumented for biomechanical analysis. Front squats performed with flywheel resistance required greater contribution of the hip and ankle, and less contribution of the knee, compared to free weight. Push presses performed with flywheel resistance had similar impulse requirements at the knee compared to free weight, but greater impulse requirement at the hip and ankle. As used in this investigation, flywheel inertial resistance increases the demand on the hip extensors and ankle plantarflexors and decreases the mechanical demand on the knee extensors for lower extremity exercises such as the front squat and lunge. Exercises involving dynamic lower and upper extremity actions, such as the push press, may benefit from flywheel inertial resistance, due to the increased mechanical demand on the knee extensors.

Scale-free functional connectivity of the brain is maintained in anesthetized healthy participants but not in patients with unresponsive wakefulness syndrome.

Directory of Open Access Journals (Sweden)

Xiaolin Liu

Full Text Available Loss of consciousness in anesthetized healthy participants and in patients with unresponsive wakefulness syndrome (UWS is associated with substantial alterations of functional connectivity across large-scale brain networks. Yet, a prominent distinction between the two cases is that after anesthesia, brain connectivity and consciousness are spontaneously restored, whereas in patients with UWS this restoration fails to occur, but why? A possible explanation is that the self-organizing capability of the brain is compromised in patients with UWS but not in healthy participants undergoing anesthesia. According to the theory of self-organized criticality, many natural complex systems, including the brain, evolve spontaneously to a critical state wherein system behaviors display spatial and/or temporal scale-invariant characteristics. Here we tested the hypothesis that the scale-free property of brain network organization is in fact fundamentally different between anesthetized healthy participants and UWS patients. We introduced a novel, computationally efficient approach to determine anatomical-functional parcellation of the whole-brain network at increasingly finer spatial scales. We found that in healthy participants, scale-free distributions of node size and node degree were present across wakefulness, propofol sedation, and recovery, despite significant propofol-induced functional connectivity changes. In patients with UWS, the scale-free distribution of node degree was absent, reflecting a fundamental difference between the two groups in adaptive reconfiguration of functional interaction between network components. The maintenance of scale-invariance across propofol sedation in healthy participants suggests the presence of persistent, on-going self-organizing processes to a critical state--a capacity that is compromised in patients with UWS.

Do-it-yourself networks: a novel method of generating weighted networks.

Science.gov (United States)

Shanafelt, D W; Salau, K R; Baggio, J A

2017-11-01

Network theory is finding applications in the life and social sciences for ecology, epidemiology, finance and social-ecological systems. While there are methods to generate specific types of networks, the broad literature is focused on generating unweighted networks. In this paper, we present a framework for generating weighted networks that satisfy user-defined criteria. Each criterion hierarchically defines a feature of the network and, in doing so, complements existing algorithms in the literature. We use a general example of ecological species dispersal to illustrate the method and provide open-source code for academic purposes.

Using the Weighted Rich-Club Coefficient to Explore Traffic Organization in Mobility Networks

Science.gov (United States)

Ramasco, José J.; Colizza, Vittoria; Panzarasa, Pietro

The aim of a transportation system is to enable the movement of goods or persons between any two locations with the highest possible efficiency. This simple principle inspires highly complex structures in a number of real-world mobility networks of different kind that often exhibit a hierarchical organization. In this paper, we rely on a framework that has been recently introduced for the study of the management and distribution of resources in different real-world systems. This framework offers a new method for exploring the tendency of the top elements to form clubs with exclusive control over the system’s resources. Such tendency is known as the weighted rich-club effect. We apply the method to three cases of mobility networks at different scales of resolution: the US air transportation network, the US counties daily commuting, and the Italian municipalities commuting datasets. In all cases, a strong weighted rich-club effect is found. We also show that a very simple model can account for part of the intrinsic features of mobility networks, while deviations found between the theoretical predictions and the empirical observations point to the presence of higher levels of organization.

Epidemic spreading on contact networks with adaptive weights.

Science.gov (United States)

Zhu, Guanghu; Chen, Guanrong; Xu, Xin-Jian; Fu, Xinchu

2013-01-21

The heterogeneous patterns of interactions within a population are often described by contact networks, but the variety and adaptivity of contact strengths are usually ignored. This paper proposes a modified epidemic SIS model with a birth-death process and nonlinear infectivity on an adaptive and weighted contact network. The links' weights, named as 'adaptive weights', which indicate the intimacy or familiarity between two connected individuals, will reduce as the disease develops. Through mathematical and numerical analyses, conditions are established for population extermination, disease extinction and infection persistence. Particularly, it is found that the fixed weights setting can trigger the epidemic incidence, and that the adaptivity of weights cannot change the epidemic threshold but it can accelerate the disease decay and lower the endemic level. Finally, some corresponding control measures are suggested. Copyright © 2012 Elsevier Ltd. All rights reserved.

A Complex Network Approach to Distributional Semantic Models.

Directory of Open Access Journals (Sweden)

Akira Utsumi

Full Text Available A number of studies on network analysis have focused on language networks based on free word association, which reflects human lexical knowledge, and have demonstrated the small-world and scale-free properties in the word association network. Nevertheless, there have been very few attempts at applying network analysis to distributional semantic models, despite the fact that these models have been studied extensively as computational or cognitive models of human lexical knowledge. In this paper, we analyze three network properties, namely, small-world, scale-free, and hierarchical properties, of semantic networks created by distributional semantic models. We demonstrate that the created networks generally exhibit the same properties as word association networks. In particular, we show that the distribution of the number of connections in these networks follows the truncated power law, which is also observed in an association network. This indicates that distributional semantic models can provide a plausible model of lexical knowledge. Additionally, the observed differences in the network properties of various implementations of distributional semantic models are consistently explained or predicted by considering the intrinsic semantic features of a word-context matrix and the functions of matrix weighting and smoothing. Furthermore, to simulate a semantic network with the observed network properties, we propose a new growing network model based on the model of Steyvers and Tenenbaum. The idea underlying the proposed model is that both preferential and random attachments are required to reflect different types of semantic relations in network growth process. We demonstrate that this model provides a better explanation of network behaviors generated by distributional semantic models.

Large scale network-centric distributed systems

CERN Document Server

Sarbazi-Azad, Hamid

2014-01-01

A highly accessible reference offering a broad range of topics and insights on large scale network-centric distributed systems Evolving from the fields of high-performance computing and networking, large scale network-centric distributed systems continues to grow as one of the most important topics in computing and communication and many interdisciplinary areas. Dealing with both wired and wireless networks, this book focuses on the design and performance issues of such systems. Large Scale Network-Centric Distributed Systems provides in-depth coverage ranging from ground-level hardware issu

Epidemic spreading in weighted networks: an edge-based mean-field solution.

Science.gov (United States)

Yang, Zimo; Zhou, Tao

2012-05-01

Weight distribution greatly impacts the epidemic spreading taking place on top of networks. This paper presents a study of a susceptible-infected-susceptible model on regular random networks with different kinds of weight distributions. Simulation results show that the more homogeneous weight distribution leads to higher epidemic prevalence, which, unfortunately, could not be captured by the traditional mean-field approximation. This paper gives an edge-based mean-field solution for general weight distribution, which can quantitatively reproduce the simulation results. This method could be applied to characterize the nonequilibrium steady states of dynamical processes on weighted networks.

New backpropagation algorithm with type-2 fuzzy weights for neural networks

CERN Document Server

Gaxiola, Fernando; Valdez, Fevrier

2016-01-01

In this book a neural network learning method with type-2 fuzzy weight adjustment is proposed. The mathematical analysis of the proposed learning method architecture and the adaptation of type-2 fuzzy weights are presented. The proposed method is based on research of recent methods that handle weight adaptation and especially fuzzy weights. The internal operation of the neuron is changed to work with two internal calculations for the activation function to obtain two results as outputs of the proposed method. Simulation results and a comparative study among monolithic neural networks, neural network with type-1 fuzzy weights and neural network with type-2 fuzzy weights are presented to illustrate the advantages of the proposed method. The proposed approach is based on recent methods that handle adaptation of weights using fuzzy logic of type-1 and type-2. The proposed approach is applied to a cases of prediction for the Mackey-Glass (for ô=17) and Dow-Jones time series, and recognition of person with iris bi...

Anchor-Free Localization Method for Mobile Targets in Coal Mine Wireless Sensor Networks

OpenAIRE

Pei, Zhongmin; Deng, Zhidong; Xu, Shuo; Xu, Xiao

2009-01-01

Severe natural conditions and complex terrain make it difficult to apply precise localization in underground mines. In this paper, an anchor-free localization method for mobile targets is proposed based on non-metric multi-dimensional scaling (Multi-dimensional Scaling: MDS) and rank sequence. Firstly, a coal mine wireless sensor network is constructed in underground mines based on the ZigBee technology. Then a non-metric MDS algorithm is imported to estimate the reference nodes’ location. Fi...

Catchment organisation, free energy dynamics and network control on critical zone water flows

Science.gov (United States)

Zehe, E.; Ehret, U.; Kleidon, A.; Jackisch, C.; Scherer, U.; Blume, T.

2012-04-01

processes using the behavioural system architecture and small perturbations and compare them with respect to their efficiency to dissipate free energy which is equivalent to produce entropy. The study will present the underlying theory and discuss simulation results with respect to the following core hypotheses: H1: A macro scale configuration of a hydro-geo-ecosystem, is in stationary non equilibrium closer to a functional optimum as other possible configurations, if it "dissipates" more of the available free energy to maintain the stationary cycles that redistribute and export mass and energy within/from the system. This implies (I1) that the system approaches faster a dynamic equilibrium state characterised by a minimum in free energy, and less free energy from persistent gradients is available to perform work in the system. H2: Macroscopically connected flow networks enhance redistribution of mass against macroscale gradients and thus dissipation of free energy, because they minimise local energy dissipation per unit mass flow along the flow path. This implies (I2) mechanic stability of the flow network, of the textural storage elements and thus of the entire system against frequent disturbances under stationary conditions.

Conflict free network coding for distributed storage networks

KAUST Repository

Al-Habob, Ahmed A.; Sorour, Sameh; Aboutorab, Neda; Sadeghi, Parastoo

2015-01-01

© 2015 IEEE. In this paper, we design a conflict free instantly decodable network coding (IDNC) solution for file download from distributed storage servers. Considering previously downloaded files at the clients from these servers as side

Mining Important Nodes in Directed Weighted Complex Networks

Directory of Open Access Journals (Sweden)

Yunyun Yang

2017-01-01

Full Text Available In complex networks, mining important nodes has been a matter of concern by scholars. In recent years, scholars have focused on mining important nodes in undirected unweighted complex networks. But most of the methods are not applicable to directed weighted complex networks. Therefore, this paper proposes a Two-Way-PageRank method based on PageRank for further discussion of mining important nodes in directed weighted complex networks. We have mainly considered the frequency of contact between nodes and the length of time of contact between nodes. We have considered the source of the nodes (in-degree and the whereabouts of the nodes (out-degree simultaneously. We have given node important performance indicators. Through numerical examples, we analyze the impact of variation of some parameters on node important performance indicators. Finally, the paper has verified the accuracy and validity of the method through empirical network data.

Scaling Techniques for Massive Scale-Free Graphs in Distributed (External) Memory

KAUST Repository

Pearce, Roger

2013-05-01

We present techniques to process large scale-free graphs in distributed memory. Our aim is to scale to trillions of edges, and our research is targeted at leadership class supercomputers and clusters with local non-volatile memory, e.g., NAND Flash. We apply an edge list partitioning technique, designed to accommodate high-degree vertices (hubs) that create scaling challenges when processing scale-free graphs. In addition to partitioning hubs, we use ghost vertices to represent the hubs to reduce communication hotspots. We present a scaling study with three important graph algorithms: Breadth-First Search (BFS), K-Core decomposition, and Triangle Counting. We also demonstrate scalability on BG/P Intrepid by comparing to best known Graph500 results. We show results on two clusters with local NVRAM storage that are capable of traversing trillion-edge scale-free graphs. By leveraging node-local NAND Flash, our approach can process thirty-two times larger datasets with only a 39% performance degradation in Traversed Edges Per Second (TEPS). © 2013 IEEE.

Classification of Company Performance using Weighted Probabilistic Neural Network

Science.gov (United States)

Yasin, Hasbi; Waridi Basyiruddin Arifin, Adi; Warsito, Budi

2018-05-01

Classification of company performance can be judged by looking at its financial status, whether good or bad state. Classification of company performance can be achieved by some approach, either parametric or non-parametric. Neural Network is one of non-parametric methods. One of Artificial Neural Network (ANN) models is Probabilistic Neural Network (PNN). PNN consists of four layers, i.e. input layer, pattern layer, addition layer, and output layer. The distance function used is the euclidean distance and each class share the same values as their weights. In this study used PNN that has been modified on the weighting process between the pattern layer and the addition layer by involving the calculation of the mahalanobis distance. This model is called the Weighted Probabilistic Neural Network (WPNN). The results show that the company's performance modeling with the WPNN model has a very high accuracy that reaches 100%.

Integrative analysis of many weighted co-expression networks using tensor computation.

Directory of Open Access Journals (Sweden)

Wenyuan Li

2011-06-01

Full Text Available The rapid accumulation of biological networks poses new challenges and calls for powerful integrative analysis tools. Most existing methods capable of simultaneously analyzing a large number of networks were primarily designed for unweighted networks, and cannot easily be extended to weighted networks. However, it is known that transforming weighted into unweighted networks by dichotomizing the edges of weighted networks with a threshold generally leads to information loss. We have developed a novel, tensor-based computational framework for mining recurrent heavy subgraphs in a large set of massive weighted networks. Specifically, we formulate the recurrent heavy subgraph identification problem as a heavy 3D subtensor discovery problem with sparse constraints. We describe an effective approach to solving this problem by designing a multi-stage, convex relaxation protocol, and a non-uniform edge sampling technique. We applied our method to 130 co-expression networks, and identified 11,394 recurrent heavy subgraphs, grouped into 2,810 families. We demonstrated that the identified subgraphs represent meaningful biological modules by validating against a large set of compiled biological knowledge bases. We also showed that the likelihood for a heavy subgraph to be meaningful increases significantly with its recurrence in multiple networks, highlighting the importance of the integrative approach to biological network analysis. Moreover, our approach based on weighted graphs detects many patterns that would be overlooked using unweighted graphs. In addition, we identified a large number of modules that occur predominately under specific phenotypes. This analysis resulted in a genome-wide mapping of gene network modules onto the phenome. Finally, by comparing module activities across many datasets, we discovered high-order dynamic cooperativeness in protein complex networks and transcriptional regulatory networks.

Epidemic extinction paths in complex networks

Science.gov (United States)

Hindes, Jason; Schwartz, Ira B.

2017-05-01

We study the extinction of long-lived epidemics on finite complex networks induced by intrinsic noise. Applying analytical techniques to the stochastic susceptible-infected-susceptible model, we predict the distribution of large fluctuations, the most probable or optimal path through a network that leads to a disease-free state from an endemic state, and the average extinction time in general configurations. Our predictions agree with Monte Carlo simulations on several networks, including synthetic weighted and degree-distributed networks with degree correlations, and an empirical high school contact network. In addition, our approach quantifies characteristic scaling patterns for the optimal path and distribution of large fluctuations, both near and away from the epidemic threshold, in networks with heterogeneous eigenvector centrality and degree distributions.

Enhanced reconstruction of weighted networks from strengths and degrees

International Nuclear Information System (INIS)

Mastrandrea, Rossana; Fagiolo, Giorgio; Squartini, Tiziano; Garlaschelli, Diego

2014-01-01

Network topology plays a key role in many phenomena, from the spreading of diseases to that of financial crises. Whenever the whole structure of a network is unknown, one must resort to reconstruction methods that identify the least biased ensemble of networks consistent with the partial information available. A challenging case, frequently encountered due to privacy issues in the analysis of interbank flows and Big Data, is when there is only local (node-specific) aggregate information available. For binary networks, the relevant ensemble is one where the degree (number of links) of each node is constrained to its observed value. However, for weighted networks the problem is much more complicated. While the naïve approach prescribes to constrain the strengths (total link weights) of all nodes, recent counter-intuitive results suggest that in weighted networks the degrees are often more informative than the strengths. This implies that the reconstruction of weighted networks would be significantly enhanced by the specification of both strengths and degrees, a computationally hard and bias-prone procedure. Here we solve this problem by introducing an analytical and unbiased maximum-entropy method that works in the shortest possible time and does not require the explicit generation of reconstructed samples. We consider several real-world examples and show that, while the strengths alone give poor results, the additional knowledge of the degrees yields accurately reconstructed networks. Information-theoretic criteria rigorously confirm that the degree sequence, as soon as it is non-trivial, is irreducible to the strength sequence. Our results have strong implications for the analysis of motifs and communities and whenever the reconstructed ensemble is required as a null model to detect higher-order patterns

Ecological, historical and evolutionary determinants of modularity in weighted seed-dispersal networks

DEFF Research Database (Denmark)

Schleuning, Matthias; Ingmann, Lili; Strauß, Rouven

2014-01-01

Modularity is a recurrent and important property of bipartite ecological networks. Although well-resolved ecological networks describe interaction frequencies between species pairs, modularity of bipartite networks has been analysed only on the basis of binary presence-absence data. We employ a new...... algorithm to detect modularity in weighted bipartite networks in a global analysis of avian seed-dispersal networks. We define roles of species, such as connector values, for weighted and binary networks and associate them with avian species traits and phylogeny. The weighted, but not binary, analysis...... identified a positive relationship between climatic seasonality and modularity, whereas past climate stability and phylogenetic signal were only weakly related to modularity. Connector values were associated with foraging behaviour and were phylogenetically conserved. The weighted modularity analysis...

Randomizing world trade. II. A weighted network analysis

Science.gov (United States)

Squartini, Tiziano; Fagiolo, Giorgio; Garlaschelli, Diego

2011-10-01

Based on the misleading expectation that weighted network properties always offer a more complete description than purely topological ones, current economic models of the International Trade Network (ITN) generally aim at explaining local weighted properties, not local binary ones. Here we complement our analysis of the binary projections of the ITN by considering its weighted representations. We show that, unlike the binary case, all possible weighted representations of the ITN (directed and undirected, aggregated and disaggregated) cannot be traced back to local country-specific properties, which are therefore of limited informativeness. Our two papers show that traditional macroeconomic approaches systematically fail to capture the key properties of the ITN. In the binary case, they do not focus on the degree sequence and hence cannot characterize or replicate higher-order properties. In the weighted case, they generally focus on the strength sequence, but the knowledge of the latter is not enough in order to understand or reproduce indirect effects.

The Existence of a Sticking Region in Free Weight Squats

Directory of Open Access Journals (Sweden)

Tillaar Roland van den

2014-10-01

Full Text Available The aim of this study was to investigate the existence of the sticking region in two legged free weight squats. Fifteen resistance-training males (age 24 ± 4 years, body mass 82 ± 11 kg, body height 179 ± 6 cm with 6 ± 3 years of resistance-training experience performed 6-RM in free weight squats. The last repetition was analyzed for the existence of a sticking region. Only in 10 out of 15 participants a sticking region was observed. The observed sticking region was much shorter than in the bench press. Furthermore, rectus femoris decreased the EMG activity in contrast to increased EMG activity in biceps femoris around the sticking and surrounding region. No significant change in EMG activity was found for the lateral and medial vastus muscles. It is suggested that a combination of these muscle activity changes could be one of the causes of the existence of the sticking region in free weight squats

The existence of a sticking region in free weight squats.

Science.gov (United States)

van den Tillaar, Roland; Andersen, Vidar; Saeterbakken, Atle Hole

2014-09-29

The aim of this study was to investigate the existence of the sticking region in two legged free weight squats. Fifteen resistance-training males (age 24 ± 4 years, body mass 82 ± 11 kg, body height 179 ± 6 cm) with 6 ± 3 years of resistance-training experience performed 6-RM in free weight squats. The last repetition was analyzed for the existence of a sticking region. Only in 10 out of 15 participants a sticking region was observed. The observed sticking region was much shorter than in the bench press. Furthermore, rectus femoris decreased the EMG activity in contrast to increased EMG activity in biceps femoris around the sticking and surrounding region. No significant change in EMG activity was found for the lateral and medial vastus muscles. It is suggested that a combination of these muscle activity changes could be one of the causes of the existence of the sticking region in free weight squats.

Trading leads to scale-free self-organization

Science.gov (United States)

Ebert, M.; Paul, W.

2012-12-01

Financial markets display scale-free behavior in many different aspects. The power-law behavior of part of the distribution of individual wealth has been recognized by Pareto as early as the nineteenth century. Heavy-tailed and scale-free behavior of the distribution of returns of different financial assets have been confirmed in a series of works. The existence of a Pareto-like distribution of the wealth of market participants has been connected with the scale-free distribution of trading volumes and price-returns. The origin of the Pareto-like wealth distribution, however, remained obscure. Here we show that in a market where the imbalance of supply and demand determines the direction of prize changes, it is the process of trading itself that spontaneously leads to a self-organization of the market with a Pareto-like wealth distribution for the market participants and at the same time to a scale-free behavior of return fluctuations and trading volume distributions.

Free-Free Absorption on Parsec Scales in Seyfert Galaxies

Science.gov (United States)

Roy, A. L.; Ulvestad, J. S.; Wilson, A. S.; Colbert, E. J. M.; Mundell, C. G.; Wrobel, J. M.; Norris, R. P.; Falcke, H.; Krichbaum, T.

Seyfert galaxies come in two main types (types 1 and 2) and the difference is probably due to obscuration of the nucleus by a torus of dense molecular material. The inner edge of the torus is expected to be ionized by optical and ultraviolet emission from the active nucleus, and will radiate direct thermal emission (e.g. NGC 1068) and will cause free-free absorption of nuclear radio components viewed through the torus (e.g. Mrk 231, Mrk 348, NGC 2639). However, the nuclear radio sources in Seyfert galaxies are weak compared to radio galaxies and quasars, demanding high sensitivity to study these effects. We have been making sensitive phase referenced VLBI observations at wavelengths between 21 and 2 cm where the free-free turnover is expected, looking for parsec-scale absorption and emission. We find that free-free absorption is common (e.g. in Mrk 348, Mrk 231, NGC 2639, NGC 1068) although compact jets are still visible, and the inferred density of the absorber agrees with the absorption columns inferred from X-ray spectra (Mrk 231, Mrk 348, NGC 2639). We find one-sided parsec-scale jets in Mrk 348 and Mrk 231, and we measure low jet speeds (typically £ 0.1 c). The one-sidedness probably is not due to Doppler boosting, but rather is probably free-free absorption. Plasma density required to produce the absorption is Ne 3 2 105 cm-3 assuming a path length of 0.1 pc, typical of that expected at the inner edge of the obscuring torus.

The integration of weighted human gene association networks based on link prediction.

Science.gov (United States)

Yang, Jian; Yang, Tinghong; Wu, Duzhi; Lin, Limei; Yang, Fan; Zhao, Jing

2017-01-31

Physical and functional interplays between genes or proteins have important biological meaning for cellular functions. Some efforts have been made to construct weighted gene association meta-networks by integrating multiple biological resources, where the weight indicates the confidence of the interaction. However, it is found that these existing human gene association networks share only quite limited overlapped interactions, suggesting their incompleteness and noise. Here we proposed a workflow to construct a weighted human gene association network using information of six existing networks, including two weighted specific PPI networks and four gene association meta-networks. We applied link prediction algorithm to predict possible missing links of the networks, cross-validation approach to refine each network and finally integrated the refined networks to get the final integrated network. The common information among the refined networks increases notably, suggesting their higher reliability. Our final integrated network owns much more links than most of the original networks, meanwhile its links still keep high functional relevance. Being used as background network in a case study of disease gene prediction, the final integrated network presents good performance, implying its reliability and application significance. Our workflow could be insightful for integrating and refining existing gene association data.

Evolutionary-Optimized Photonic Network Structure in White Beetle Wing Scales.

Science.gov (United States)

Wilts, Bodo D; Sheng, Xiaoyuan; Holler, Mirko; Diaz, Ana; Guizar-Sicairos, Manuel; Raabe, Jörg; Hoppe, Robert; Liu, Shu-Hao; Langford, Richard; Onelli, Olimpia D; Chen, Duyu; Torquato, Salvatore; Steiner, Ullrich; Schroer, Christian G; Vignolini, Silvia; Sepe, Alessandro

2018-05-01

Most studies of structural color in nature concern periodic arrays, which through the interference of light create color. The "color" white however relies on the multiple scattering of light within a randomly structured medium, which randomizes the direction and phase of incident light. Opaque white materials therefore must be much thicker than periodic structures. It is known that flying insects create "white" in extremely thin layers. This raises the question, whether evolution has optimized the wing scale morphology for white reflection at a minimum material use. This hypothesis is difficult to prove, since this requires the detailed knowledge of the scattering morphology combined with a suitable theoretical model. Here, a cryoptychographic X-ray tomography method is employed to obtain a full 3D structural dataset of the network morphology within a white beetle wing scale. By digitally manipulating this 3D representation, this study demonstrates that this morphology indeed provides the highest white retroreflection at the minimum use of material, and hence weight for the organism. Changing any of the network parameters (within the parameter space accessible by biological materials) either increases the weight, increases the thickness, or reduces reflectivity, providing clear evidence for the evolutionary optimization of this morphology. © 2017 The Authors. Published by WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim.

Using Incomplete Information for Complete Weight Annotation of Road Networks

DEFF Research Database (Denmark)

Yang, Bin; Kaul, Manohar; Jensen, Christian Søndergaard

2014-01-01

to solve the problem. Specifically, the problem is modeled as a regression problem and solved by minimizing a judiciously designed objective function that takes into account the topology of the road network. In particular, the use of weighted PageRank values of edges is explored for assigning appropriate...... weights to all edges, and the property of directional adjacency of edges is also taken into account to assign weights. Empirical studies with weights capturing travel time and GHG emissions on two road networks (Skagen, Denmark, and North Jutland, Denmark) offer insight into the design properties...

Sensing across large-scale cognitive radio networks: Data processing, algorithms, and testbed for wireless tomography and moving target tracking

Science.gov (United States)

Bonior, Jason David

As the use of wireless devices has become more widespread so has the potential for utilizing wireless networks for remote sensing applications. Regular wireless communication devices are not typically designed for remote sensing. Remote sensing techniques must be carefully tailored to the capabilities of these networks before they can be applied. Experimental verification of these techniques and algorithms requires robust yet flexible testbeds. In this dissertation, two experimental testbeds for the advancement of research into sensing across large-scale cognitive radio networks are presented. System architectures, implementations, capabilities, experimental verification, and performance are discussed. One testbed is designed for the collection of scattering data to be used in RF and wireless tomography research. This system is used to collect full complex scattering data using a vector network analyzer (VNA) and amplitude-only data using non-synchronous software-defined radios (SDRs). Collected data is used to experimentally validate a technique for phase reconstruction using semidefinite relaxation and demonstrate the feasibility of wireless tomography. The second testbed is a SDR network for the collection of experimental data. The development of tools for network maintenance and data collection is presented and discussed. A novel recursive weighted centroid algorithm for device-free target localization using the variance of received signal strength for wireless links is proposed. The signal variance resulting from a moving target is modeled as having contours related to Cassini ovals. This model is used to formulate recursive weights which reduce the influence of wireless links that are farther from the target location estimate. The algorithm and its implementation on this testbed are presented and experimental results discussed.

A GPU-based solution for fast calculation of the betweenness centrality in large weighted networks

Directory of Open Access Journals (Sweden)

Rui Fan

2017-12-01

Full Text Available Betweenness, a widely employed centrality measure in network science, is a decent proxy for investigating network loads and rankings. However, its extremely high computational cost greatly hinders its applicability in large networks. Although several parallel algorithms have been presented to reduce its calculation cost for unweighted networks, a fast solution for weighted networks, which are commonly encountered in many realistic applications, is still lacking. In this study, we develop an efficient parallel GPU-based approach to boost the calculation of the betweenness centrality (BC for large weighted networks. We parallelize the traditional Dijkstra algorithm by selecting more than one frontier vertex each time and then inspecting the frontier vertices simultaneously. By combining the parallel SSSP algorithm with the parallel BC framework, our GPU-based betweenness algorithm achieves much better performance than its CPU counterparts. Moreover, to further improve performance, we integrate the work-efficient strategy, and to address the load-imbalance problem, we introduce a warp-centric technique, which assigns many threads rather than one to a single frontier vertex. Experiments on both realistic and synthetic networks demonstrate the efficiency of our solution, which achieves 2.9× to 8.44× speedups over the parallel CPU implementation. Our algorithm is open-source and free to the community; it is publicly available through https://dx.doi.org/10.6084/m9.figshare.4542405. Considering the pervasive deployment and declining price of GPUs in personal computers and servers, our solution will offer unprecedented opportunities for exploring betweenness-related problems and will motivate follow-up efforts in network science.

Weighted Networks at the Polish Market

Science.gov (United States)

Chmiel, A. M.; Sienkiewicz, J.; Suchecki, K.; Hołyst, J. A.

During the last few years various models of networks [1,2] have become a powerful tool for analysis of complex systems in such distant fields as Internet [3], biology [4], social groups [5], ecology [6] and public transport [7]. Modeling behavior of economical agents is a challenging issue that has also been studied from a network point of view. The examples of such studies are models of financial networks [8], supply chains [9, 10], production networks [11], investment networks [12] or collective bank bankrupcies [13, 14]. Relations between different companies have been already analyzed using several methods: as networks of shareholders [15], networks of correlations between stock prices [16] or networks of board directors [17]. In several cases scaling laws for network characteristics have been observed.

Unwinding the hairball graph: Pruning algorithms for weighted complex networks

Science.gov (United States)

Dianati, Navid

2016-01-01

Empirical networks of weighted dyadic relations often contain "noisy" edges that alter the global characteristics of the network and obfuscate the most important structures therein. Graph pruning is the process of identifying the most significant edges according to a generative null model and extracting the subgraph consisting of those edges. Here, we focus on integer-weighted graphs commonly arising when weights count the occurrences of an "event" relating the nodes. We introduce a simple and intuitive null model related to the configuration model of network generation and derive two significance filters from it: the marginal likelihood filter (MLF) and the global likelihood filter (GLF). The former is a fast algorithm assigning a significance score to each edge based on the marginal distribution of edge weights, whereas the latter is an ensemble approach which takes into account the correlations among edges. We apply these filters to the network of air traffic volume between US airports and recover a geographically faithful representation of the graph. Furthermore, compared with thresholding based on edge weight, we show that our filters extract a larger and significantly sparser giant component.

Scaling architecture-on-demand based optical networks

NARCIS (Netherlands)

Meyer, Hugo; Sancho, Jose Carlos; Mrdakovic, Milica; Peng, Shuping; Simeonidou, Dimitra; Miao, Wang; Calabretta, Nicola

2016-01-01

This paper analyzes methodologies that allow scaling properly Architecture-On-Demand (AoD) based optical networks. As Data Centers and HPC systems are growing in size and complexity, optical networks seem to be the way to scale the bandwidth of current network infrastructures. To scale the number of

Ozone and atmospheric pollution at synoptic scale: the monitoring network Paes

International Nuclear Information System (INIS)

Gheusi, F.; Chevalier, A.; Delmas, R.; Athier, G.; Bouchou, P.; Cousin, J.M.; Meyerfeld, Y.; Laj, P.; Sellegri, K.; Ancellet, G.

2007-01-01

Ozone as an environmental concern extends beyond the questions usually covered by media - stratospheric ozone depletion and urban pollution peaks. Strong expositions to this pollutant are frequent even far from pollution sources, and the background tropospheric content of ozone has been growing fivefold over the last century. In response to this concern at the French national scale, formerly independent monitoring stations have been coordinated since 2004 in a structured network: Paes (French acronym for atmospheric pollution at synoptic scale). The data are put in free access online. (authors)

Weighted Complex Network Analysis of Pakistan Highways

Directory of Open Access Journals (Sweden)

Yasir Tariq Mohmand

2013-01-01

Full Text Available The structure and properties of public transportation networks have great implications in urban planning, public policies, and infectious disease control. This study contributes a weighted complex network analysis of travel routes on the national highway network of Pakistan. The network is responsible for handling 75 percent of the road traffic yet is largely inadequate, poor, and unreliable. The highway network displays small world properties and is assortative in nature. Based on the betweenness centrality of the nodes, the most important cities are identified as this could help in identifying the potential congestion points in the network. Keeping in view the strategic location of Pakistan, such a study is of practical importance and could provide opportunities for policy makers to improve the performance of the highway network.

Growth Limits in Large Scale Networks

DEFF Research Database (Denmark)

Knudsen, Thomas Phillip

limitations. The rising complexity of network management with the convergence of communications platforms is shown as problematic for both automatic management feasibility and for manpower resource management. In the fourth step the scope is extended to include the present society with the DDN project as its......The Subject of large scale networks is approached from the perspective of the network planner. An analysis of the long term planning problems is presented with the main focus on the changing requirements for large scale networks and the potential problems in meeting these requirements. The problems...... the fundamental technological resources in network technologies are analysed for scalability. Here several technological limits to continued growth are presented. The third step involves a survey of major problems in managing large scale networks given the growth of user requirements and the technological...

Using Incomplete Information for Complete Weight Annotation of Road Networks

DEFF Research Database (Denmark)

Yang, Bin; Kaul, Manohar; Jensen, Christian S.

2014-01-01

ground-truth travel cost. A general framework is proposed to solve the problem. Specifically, the problem is modeled as a regression problem and solved by minimizing a judiciously designed objective function that takes into account the topology of the road network. In particular, the use of weighted Page......Rank values of edges is explored for assigning appropriate weights to all edges, and the property of directional adjacency of edges is also taken into account to assign weights. Empirical studies with weights capturing travel time and GHG emissions on two road networks offer insight into the design properties...

A Regularizer Approach for RBF Networks Under the Concurrent Weight Failure Situation.

Science.gov (United States)

Leung, Chi-Sing; Wan, Wai Yan; Feng, Ruibin

2017-06-01

Many existing results on fault-tolerant algorithms focus on the single fault source situation, where a trained network is affected by one kind of weight failure. In fact, a trained network may be affected by multiple kinds of weight failure. This paper first studies how the open weight fault and the multiplicative weight noise degrade the performance of radial basis function (RBF) networks. Afterward, we define the objective function for training fault-tolerant RBF networks. Based on the objective function, we then develop two learning algorithms, one batch mode and one online mode. Besides, the convergent conditions of our online algorithm are investigated. Finally, we develop a formula to estimate the test set error of faulty networks trained from our approach. This formula helps us to optimize some tuning parameters, such as RBF width.

The effects of combined elastic- and free-weight tension vs. free-weight tension on one-repetition maximum strength in the bench press.

Science.gov (United States)

Bellar, David M; Muller, Matthew D; Barkley, Jacob E; Kim, Chul-Ho; Ida, Keisuke; Ryan, Edward J; Bliss, Mathew V; Glickman, Ellen L

2011-02-01

The present study investigated the effects of training combining elastic tension, free weights, and the bench press. Eleven college-aged men (untrained) in the bench press participated in the 13-week study. The participants were first given instructions and then practiced the bench press, followed by a one-repetition maximum (1RM) test of baseline strength. Subjects were then trained in the bench press for 3 weeks to allow for the beginning of neural adaptation. After another 1RM test, participants were assigned to 1 of 2 conditions for the next 3 weeks of training: 85% Free-Weight Tension, 15% Elastic Tension (BAND), or 100% Free-Weight Tension (STAND). After 3 weeks of training and a third 1RM max test, participants switched treatments, under which they completed the final 3 weeks of training and the fourth 1RM test. Analysis via analysis of covariance revealed a significant (p ≤ 0.05) main effect for time and interaction effect for Treatment (BAND vs. STAND). Subsequent analysis via paired-samples t-test revealed the BAND condition was significantly better (p = 0.05) at producing raw gains in 1RM strength. (BAND 9.95 ± 3.7 kg vs. STAND 7.56 ± 2.8 kg). These results suggest that the addition of elastic tension to the bench press may be an effective method of increasing strength.

Light-Weight Free-Standing Carbon Nanotube-Silicon Films for Anodes of Lithium Ion Batteries

KAUST Repository

Cui, Li-Feng

2010-07-27

Silicon is an attractive alloy-type anode material because of its highest known capacity (4200 mAh/g). However, lithium insertion into and extraction from silicon are accompanied by a huge volume change, up to 300%, which induces a strong strain on silicon and causes pulverization and rapid capacity fading due to the loss of the electrical contact between part of silicon and current collector. Si nanostructures such as nanowires, which are chemically and electrically bonded to the current collector, can overcome the pulverization problem, however, the heavy metal current collectors in these systems are larger in weight than Si active material. Herein we report a novel anode structure free of heavy metal current collectors by integrating a flexible, conductive carbon nanotube (CNT) network into a Si anode. The composite film is free-standing and has a structure similar to the steel bar reinforced concrete, where the infiltrated CNT network functions as both mechanical support and electrical conductor and Si as a high capacity anode material for Li-ion battery. Such free-standing film has a low sheet resistance of ∼30 Ohm/sq. It shows a high specific charge storage capacity (∼2000 mAh/g) and a good cycling life, superior to pure sputtered-on silicon films with similar thicknesses. Scanning electron micrographs show that Si is still connected by the CNT network even when small breaking or cracks appear in the film after cycling. The film can also "ripple up" to release the strain of a large volume change during lithium intercalation. The conductive composite film can function as both anode active material and current collector. It offers ∼10 times improvement in specific capacity compared with widely used graphite/copper anode sheets. © 2010 American Chemical Society.

Maximum entropy networks are more controllable than preferential attachment networks

International Nuclear Information System (INIS)

Hou, Lvlin; Small, Michael; Lao, Songyang

2014-01-01

A maximum entropy (ME) method to generate typical scale-free networks has been recently introduced. We investigate the controllability of ME networks and Barabási–Albert preferential attachment networks. Our experimental results show that ME networks are significantly more easily controlled than BA networks of the same size and the same degree distribution. Moreover, the control profiles are used to provide insight into control properties of both classes of network. We identify and classify the driver nodes and analyze the connectivity of their neighbors. We find that driver nodes in ME networks have fewer mutual neighbors and that their neighbors have lower average degree. We conclude that the properties of the neighbors of driver node sensitively affect the network controllability. Hence, subtle and important structural differences exist between BA networks and typical scale-free networks of the same degree distribution. - Highlights: • The controllability of maximum entropy (ME) and Barabási–Albert (BA) networks is investigated. • ME networks are significantly more easily controlled than BA networks of the same degree distribution. • The properties of the neighbors of driver node sensitively affect the network controllability. • Subtle and important structural differences exist between BA networks and typical scale-free networks

WDM networking on a European Scale

DEFF Research Database (Denmark)

Parnis, Noel; Limal, Emmanuel; Hjelme, Dag R.

1998-01-01

Four different topological approaches to designing a pan-European optical network are discussed. For such an ultra-high capacity large-scale network, it is necessary to overcome physical path length limitations and to limit Optical Cross-Connect (OXC) complexity.......Four different topological approaches to designing a pan-European optical network are discussed. For such an ultra-high capacity large-scale network, it is necessary to overcome physical path length limitations and to limit Optical Cross-Connect (OXC) complexity....

Enabling time-dependent uncertain eco-weights for road networks

DEFF Research Database (Denmark)

Hu, Jilin; Yang, Bin; Jensen, Christian S.

2017-01-01

travel costs. Based on the techniques above, different histogram aggregation methods are proposed to accurately estimate time-dependent GHG emissions for routes. Based on a 200-million GPS record data set collected from 150 vehicles in Denmark over two years, a comprehensive empirical study is conducted...... transportation. The foundation of eco-routing is a weighted-graph representation of a road network in which road segments, or edges, are associated with eco-weights that capture the GHG emissions caused by traversing the edges. Due to the dynamics of traffic, the eco-weights are best modeled as being time...... dependent and uncertain. We formalize the problem of assigning a time-dependent, uncertain eco-weight to each edge in a road network based on historical GPS records. In particular, a sequence of histograms is employed to describe the uncertain eco-weight of an edge at different time intervals. Compression...

The QAP weighted network analysis method and its application in international services trade

Science.gov (United States)

Xu, Helian; Cheng, Long

2016-04-01

Based on QAP (Quadratic Assignment Procedure) correlation and complex network theory, this paper puts forward a new method named QAP Weighted Network Analysis Method. The core idea of the method is to analyze influences among relations in a social or economic group by building a QAP weighted network of networks of relations. In the QAP weighted network, a node depicts a relation and an undirect edge exists between any pair of nodes if there is significant correlation between relations. As an application of the QAP weighted network, we study international services trade by using the QAP weighted network, in which nodes depict 10 kinds of services trade relations. After the analysis of international services trade by QAP weighted network, and by using distance indicators, hierarchy tree and minimum spanning tree, the conclusion shows that: Firstly, significant correlation exists in all services trade, and the development of any one service trade will stimulate the other nine. Secondly, as the economic globalization goes deeper, correlations in all services trade have been strengthened continually, and clustering effects exist in those services trade. Thirdly, transportation services trade, computer and information services trade and communication services trade have the most influence and are at the core in all services trade.

The Genome-Scale Integrated Networks in Microorganisms

Directory of Open Access Journals (Sweden)

Tong Hao

2018-02-01

Full Text Available The genome-scale cellular network has become a necessary tool in the systematic analysis of microbes. In a cell, there are several layers (i.e., types of the molecular networks, for example, genome-scale metabolic network (GMN, transcriptional regulatory network (TRN, and signal transduction network (STN. It has been realized that the limitation and inaccuracy of the prediction exist just using only a single-layer network. Therefore, the integrated network constructed based on the networks of the three types attracts more interests. The function of a biological process in living cells is usually performed by the interaction of biological components. Therefore, it is necessary to integrate and analyze all the related components at the systems level for the comprehensively and correctly realizing the physiological function in living organisms. In this review, we discussed three representative genome-scale cellular networks: GMN, TRN, and STN, representing different levels (i.e., metabolism, gene regulation, and cellular signaling of a cell’s activities. Furthermore, we discussed the integration of the networks of the three types. With more understanding on the complexity of microbial cells, the development of integrated network has become an inevitable trend in analyzing genome-scale cellular networks of microorganisms.

A comparison of muscle activation between a Smith machine and free weight bench press.

Science.gov (United States)

Schick, Evan E; Coburn, Jared W; Brown, Lee E; Judelson, Daniel A; Khamoui, Andy V; Tran, Tai T; Uribe, Brandon P

2010-03-01

The bench press exercise exists in multiple forms including the machine and free weight bench press. It is not clear though how each mode differs in its effect on muscle activation. The purpose of this study was to compare muscle activation of the anterior deltoid, medial deltoid, and pectoralis major during a Smith machine and free weight bench press at lower (70% 1 repetition maximum [1RM]) and higher (90% 1RM) intensities. Normalized electromyography amplitude values were used during the concentric phase of the bench press to compare muscle activity between a free weight and Smith machine bench press. Participants were classified as either experienced or inexperienced bench pressers. Two testing sessions were used, each of which entailed either all free weight or all Smith machine testing. In each testing session, each participant's 1RM was established followed by 2 repetitions at 70% of 1RM and 2 repetitions at 90% of 1RM. Results indicated greater activation of the medial deltoid on the free weight bench press than on the Smith machine bench press. Also, there was greater muscle activation at the 90% 1RM load than at the 70% 1RM load. The results of this study suggest that strength coaches should consider choosing the free weight bench press over the Smith machine bench press because of its potential for greater upper-body muscular development.

Epidemic outbreaks in growing scale-free networks with local structure

Science.gov (United States)

Ni, Shunjiang; Weng, Wenguo; Shen, Shifei; Fan, Weicheng

2008-09-01

The class of generative models has already attracted considerable interest from researchers in recent years and much expanded the original ideas described in BA model. Most of these models assume that only one node per time step joins the network. In this paper, we grow the network by adding n interconnected nodes as a local structure into the network at each time step with each new node emanating m new edges linking the node to the preexisting network by preferential attachment. This successfully generates key features observed in social networks. These include power-law degree distribution pk∼k, where μ=(n-1)/m is a tuning parameter defined as the modularity strength of the network, nontrivial clustering, assortative mixing, and modular structure. Moreover, all these features are dependent in a similar way on the parameter μ. We then study the susceptible-infected epidemics on this network with identical infectivity, and find that the initial epidemic behavior is governed by both of the infection scheme and the network structure, especially the modularity strength. The modularity of the network makes the spreading velocity much lower than that of the BA model. On the other hand, increasing the modularity strength will accelerate the propagation velocity.

Importance of small-degree nodes in assortative networks with degree-weight correlations

Science.gov (United States)

Ma, Sijuan; Feng, Ling; Monterola, Christopher Pineda; Lai, Choy Heng

2017-10-01

It has been known that assortative network structure plays an important role in spreading dynamics for unweighted networks. Yet its influence on weighted networks is not clear, in particular when weight is strongly correlated with the degrees of the nodes as we empirically observed in Twitter. Here we use the self-consistent probability method and revised nonperturbative heterogenous mean-field theory method to investigate this influence on both susceptible-infective-recovered (SIR) and susceptible-infective-susceptible (SIS) spreading dynamics. Both our simulation and theoretical results show that while the critical threshold is not significantly influenced by the assortativity, the prevalence in the supercritical regime shows a crossover under different degree-weight correlations. In particular, unlike the case of random mixing networks, in assortative networks, the negative degree-weight correlation leads to higher prevalence in their spreading beyond the critical transmissivity than that of the positively correlated. In addition, the previously observed inhibition effect on spreading velocity by assortative structure is not apparent in negatively degree-weight correlated networks, while it is enhanced for that of the positively correlated. Detailed investigation into the degree distribution of the infected nodes reveals that small-degree nodes play essential roles in the supercritical phase of both SIR and SIS spreadings. Our results have direct implications in understanding viral information spreading over online social networks and epidemic spreading over contact networks.

Scaling up ITO-Free solar cells

NARCIS (Netherlands)

Galagan, Y.O.; Coenen, E.W.C.; Zimmermann, B.; Slooff, L.H.; Verhees, W.J.H.; Veenstra, S.C.; Kroon, J.M.; Jørgensen, M.; Krebs, F.C.; Andriessen, H.A.J.M.

2014-01-01

Indium-tin-oxide-free (ITO-free) polymer solar cells with composite electrodes containing current-collecting grids and a semitransparent poly(3,4-ethylenedioxythiophene):polystyrenesulfonate) (PEDOT:PSS) conductor are demonstrated. The up-scaling of the length of the solar cell from 1 to 6 cm and

Connectivity strategies to enhance the capacity of weight-bearing networks

International Nuclear Information System (INIS)

Janaki, T.M.; Gupte, Neelima

2003-01-01

The connectivity properties of a weight-bearing network are exploited to enhance its capacity. We study a 2D network of sites where the weight-bearing capacity of a given site depends on the capacities of the sites connected to it in the layers above. The network consists of clusters, viz., a set of sites connected with each other with the largest such collection of sites being denoted as the maximal cluster. New connections are made between sites in successive layers using two distinct strategies. The key element of our strategies consists of adding as many disjoint clusters as possible to the sites on the trunk T of the maximal cluster. In the first strategy the reconnections start from the last layer upwards and stop when no new sites are added. In the second case, the reconnections start from the top layer and go all the way down to the last layer. The new networks can bear much higher weights than the original networks and have much lower failure rates. The first strategy leads to a greater enhancement of stability, whereas the second leads to a greater enhancement of capacity compared to the original networks. The original network used here is a typical example of the branching hierarchical class. However, the application of strategies similar to ours can yield useful results in other types of networks as well

The scale-free dynamics of eukaryotic cells.

Directory of Open Access Journals (Sweden)

Miguel A Aon

Full Text Available Temporal organization of biological processes requires massively parallel processing on a synchronized time-base. We analyzed time-series data obtained from the bioenergetic oscillatory outputs of Saccharomyces cerevisiae and isolated cardiomyocytes utilizing Relative Dispersional (RDA and Power Spectral (PSA analyses. These analyses revealed broad frequency distributions and evidence for long-term memory in the observed dynamics. Moreover RDA and PSA showed that the bioenergetic dynamics in both systems show fractal scaling over at least 3 orders of magnitude, and that this scaling obeys an inverse power law. Therefore we conclude that in S. cerevisiae and cardiomyocytes the dynamics are scale-free in vivo. Applying RDA and PSA to data generated from an in silico model of mitochondrial function indicated that in yeast and cardiomyocytes the underlying mechanisms regulating the scale-free behavior are similar. We validated this finding in vivo using single cells, and attenuating the activity of the mitochondrial inner membrane anion channel with 4-chlorodiazepam to show that the oscillation of NAD(PH and reactive oxygen species (ROS can be abated in these two evolutionarily distant species. Taken together these data strongly support our hypothesis that the generation of ROS, coupled to redox cycling, driven by cytoplasmic and mitochondrial processes, are at the core of the observed rhythmicity and scale-free dynamics. We argue that the operation of scale-free bioenergetic dynamics plays a fundamental role to integrate cellular function, while providing a framework for robust, yet flexible, responses to the environment.

Scaling of load in communications networks.

Science.gov (United States)

Narayan, Onuttom; Saniee, Iraj

2010-09-01

We show that the load at each node in a preferential attachment network scales as a power of the degree of the node. For a network whose degree distribution is p(k)∼k{-γ} , we show that the load is l(k)∼k{η} with η=γ-1 , implying that the probability distribution for the load is p(l)∼1/l{2} independent of γ . The results are obtained through scaling arguments supported by finite size scaling studies. They contradict earlier claims, but are in agreement with the exact solution for the special case of tree graphs. Results are also presented for real communications networks at the IP layer, using the latest available data. Our analysis of the data shows relatively poor power-law degree distributions as compared to the scaling of the load versus degree. This emphasizes the importance of the load in network analysis.

[Development of free will and determinism scale in Japanese].

Science.gov (United States)

Goto, Takayuki; Ishibashi, Yuya; Kajimura, Shogo; Oka, Ryunosuke; Kusumi, Takashi

2015-04-01

We developed a free will and determinism scale in Japanese (FAD-J) to assess lay beliefs in free will, scientific determinism, fatalistic determinism, and unpredictability. In Study 1, we translated a free will and determinism scale (FAD-Plus) into Japanese and verified its reliability and validity. In Study 2, we examined the relationship between the FAD-J and eight other scales. Results suggested that lay beliefs in free will and determinism were related to self-regulation, critical thinking, other-oriented empathy, self-esteem, and regret and maximization in decision makings. We discuss the usefulness of the FAD-J for studying the psychological functions of lay beliefs in free will and determinism.

Effects of replacing free weights with elastic band resistance in squats on trunk muscle activation.

Science.gov (United States)

Saeterbakken, Atle H; Andersen, Vidar; Kolnes, Maria K; Fimland, Marius S

2014-11-01

The purpose of this study was to assess the effects of adding elastic bands to free-weight squats on the neuromuscular activation of core muscles. Twenty-five resistance trained women with 4.6 ± 2.1 years of resistance training experience participated in the study. In randomized order, the participants performed 6 repetition maximum in free-weight squats, with and without elastic bands (i.e., matched relative intensity between exercises). During free-weight squats with elastic bands, some of the free weights were replaced with 2 elastic bands attached to the lowest part of the squat rack. Surface electromyography (EMG) activity was measured from the erector spinae, external oblique, and rectus abdominis, whereas a linear encoder measured the vertical displacement. The EMG activities were compared between the 2 lifting modalities for the whole repetition and separately for the eccentric, concentric, and upper and lower eccentric and concentric phases. In the upper (greatest stretch of the elastic band), middle, and lower positions in squats with elastic bands, the resistance values were approximately 117, 105, and 93% of the free weight-only trial. Similar EMG activities were observed for the 2 lifting modalities for the erector spinae (p = 0.112-0.782), external oblique (p = 0.225-0.977), and rectus abdominis (p = 0.315-0.729) in all analyzed phases. In conclusion, there were no effects on the muscle activity of trunk muscles of substituting some resistance from free weights with elastic bands in the free-weight squat.

Fast Weight Long Short-Term Memory

OpenAIRE

Keller, T. Anderson; Sridhar, Sharath Nittur; Wang, Xin

2018-01-01

Associative memory using fast weights is a short-term memory mechanism that substantially improves the memory capacity and time scale of recurrent neural networks (RNNs). As recent studies introduced fast weights only to regular RNNs, it is unknown whether fast weight memory is beneficial to gated RNNs. In this work, we report a significant synergy between long short-term memory (LSTM) networks and fast weight associative memories. We show that this combination, in learning associative retrie...

Geometry of river networks. I. Scaling, fluctuations, and deviations

International Nuclear Information System (INIS)

Dodds, Peter Sheridan; Rothman, Daniel H.

2001-01-01

This paper is the first in a series of three papers investigating the detailed geometry of river networks. Branching networks are a universal structure employed in the distribution and collection of material. Large-scale river networks mark an important class of two-dimensional branching networks, being not only of intrinsic interest but also a pervasive natural phenomenon. In the description of river network structure, scaling laws are uniformly observed. Reported values of scaling exponents vary, suggesting that no unique set of scaling exponents exists. To improve this current understanding of scaling in river networks and to provide a fuller description of branching network structure, here we report a theoretical and empirical study of fluctuations about and deviations from scaling. We examine data for continent-scale river networks such as the Mississippi and the Amazon and draw inspiration from a simple model of directed, random networks. We center our investigations on the scaling of the length of a subbasin's dominant stream with its area, a characterization of basin shape known as Hack's law. We generalize this relationship to a joint probability density, and provide observations and explanations of deviations from scaling. We show that fluctuations about scaling are substantial, and grow with system size. We find strong deviations from scaling at small scales which can be explained by the existence of a linear network structure. At intermediate scales, we find slow drifts in exponent values, indicating that scaling is only approximately obeyed and that universality remains indeterminate. At large scales, we observe a breakdown in scaling due to decreasing sample space and correlations with overall basin shape. The extent of approximate scaling is significantly restricted by these deviations, and will not be improved by increases in network resolution

Vaccination intervention on epidemic dynamics in networks

Science.gov (United States)

Peng, Xiao-Long; Xu, Xin-Jian; Fu, Xinchu; Zhou, Tao

2013-02-01

Vaccination is an important measure available for preventing or reducing the spread of infectious diseases. In this paper, an epidemic model including susceptible, infected, and imperfectly vaccinated compartments is studied on Watts-Strogatz small-world, Barabási-Albert scale-free, and random scale-free networks. The epidemic threshold and prevalence are analyzed. For small-world networks, the effective vaccination intervention is suggested and its influence on the threshold and prevalence is analyzed. For scale-free networks, the threshold is found to be strongly dependent both on the effective vaccination rate and on the connectivity distribution. Moreover, so long as vaccination is effective, it can linearly decrease the epidemic prevalence in small-world networks, whereas for scale-free networks it acts exponentially. These results can help in adopting pragmatic treatment upon diseases in structured populations.

Variable weight spectral amplitude coding for multiservice OCDMA networks

Science.gov (United States)

Seyedzadeh, Saleh; Rahimian, Farzad Pour; Glesk, Ivan; Kakaee, Majid H.

2017-09-01

The emergence of heterogeneous data traffic such as voice over IP, video streaming and online gaming have demanded networks with capability of supporting quality of service (QoS) at the physical layer with traffic prioritisation. This paper proposes a new variable-weight code based on spectral amplitude coding for optical code-division multiple-access (OCDMA) networks to support QoS differentiation. The proposed variable-weight multi-service (VW-MS) code relies on basic matrix construction. A mathematical model is developed for performance evaluation of VW-MS OCDMA networks. It is shown that the proposed code provides an optimal code length with minimum cross-correlation value when compared to other codes. Numerical results for a VW-MS OCDMA network designed for triple-play services operating at 0.622 Gb/s, 1.25 Gb/s and 2.5 Gb/s are considered.

Capacity of oscillatory associative-memory networks with error-free retrieval

International Nuclear Information System (INIS)

Nishikawa, Takashi; Lai Yingcheng; Hoppensteadt, Frank C.

2004-01-01

Networks of coupled periodic oscillators (similar to the Kuramoto model) have been proposed as models of associative memory. However, error-free retrieval states of such oscillatory networks are typically unstable, resulting in a near zero capacity. This puts the networks at disadvantage as compared with the classical Hopfield network. Here we propose a simple remedy for this undesirable property and show rigorously that the error-free capacity of our oscillatory, associative-memory networks can be made as high as that of the Hopfield network. They can thus not only provide insights into the origin of biological memory, but can also be potentially useful for applications in information science and engineering

Robustness of pinning a general complex dynamical network

International Nuclear Information System (INIS)

Wang Lei; Sun Youxian

2010-01-01

This Letter studies the robustness problem of pinning a general complex dynamical network toward an assigned synchronous evolution. Several synchronization criteria are presented to guarantee the convergence of the pinning process locally and globally by construction of Lyapunov functions. In particular, if a pinning strategy has been designed for synchronization of a given complex dynamical network, then no matter what uncertainties occur among the pinned nodes, synchronization can still be guaranteed through the pinning. The analytical results show that pinning control has a certain robustness against perturbations on network architecture: adding, deleting and changing the weights of edges. Numerical simulations illustrated by scale-free complex networks verify the theoretical results above-acquired.

Accelerated weight histogram method for exploring free energy landscapes

Energy Technology Data Exchange (ETDEWEB)

Lindahl, V.; Lidmar, J.; Hess, B. [Department of Theoretical Physics and Swedish e-Science Research Center, KTH Royal Institute of Technology, 10691 Stockholm (Sweden)

2014-07-28

Calculating free energies is an important and notoriously difficult task for molecular simulations. The rapid increase in computational power has made it possible to probe increasingly complex systems, yet extracting accurate free energies from these simulations remains a major challenge. Fully exploring the free energy landscape of, say, a biological macromolecule typically requires sampling large conformational changes and slow transitions. Often, the only feasible way to study such a system is to simulate it using an enhanced sampling method. The accelerated weight histogram (AWH) method is a new, efficient extended ensemble sampling technique which adaptively biases the simulation to promote exploration of the free energy landscape. The AWH method uses a probability weight histogram which allows for efficient free energy updates and results in an easy discretization procedure. A major advantage of the method is its general formulation, making it a powerful platform for developing further extensions and analyzing its relation to already existing methods. Here, we demonstrate its efficiency and general applicability by calculating the potential of mean force along a reaction coordinate for both a single dimension and multiple dimensions. We make use of a non-uniform, free energy dependent target distribution in reaction coordinate space so that computational efforts are not wasted on physically irrelevant regions. We present numerical results for molecular dynamics simulations of lithium acetate in solution and chignolin, a 10-residue long peptide that folds into a β-hairpin. We further present practical guidelines for setting up and running an AWH simulation.

Communication-Free Distributed Coverage for Networked Systems

KAUST Repository

Yazicioglu, A. Yasin

2016-01-15

In this paper, we present a communication-free algorithm for distributed coverage of an arbitrary network by a group of mobile agents with local sensing capabilities. The network is represented as a graph, and the agents are arbitrarily deployed on some nodes of the graph. Any node of the graph is covered if it is within the sensing range of at least one agent. The agents are mobile devices that aim to explore the graph and to optimize their locations in a decentralized fashion by relying only on their sensory inputs. We formulate this problem in a game theoretic setting and propose a communication-free learning algorithm for maximizing the coverage.

Scale-free behavior of networks with the copresence of preferential and uniform attachment rules

Science.gov (United States)

Pachon, Angelica; Sacerdote, Laura; Yang, Shuyi

2018-05-01

Complex networks in different areas exhibit degree distributions with a heavy upper tail. A preferential attachment mechanism in a growth process produces a graph with this feature. We herein investigate a variant of the simple preferential attachment model, whose modifications are interesting for two main reasons: to analyze more realistic models and to study the robustness of the scale-free behavior of the degree distribution. We introduce and study a model which takes into account two different attachment rules: a preferential attachment mechanism (with probability 1 - p) that stresses the rich get richer system, and a uniform choice (with probability p) for the most recent nodes, i.e. the nodes belonging to a window of size w to the left of the last born node. The latter highlights a trend to select one of the last added nodes when no information is available. The recent nodes can be either a given fixed number or a proportion (αn) of the total number of existing nodes. In the first case, we prove that this model exhibits an asymptotically power-law degree distribution. The same result is then illustrated through simulations in the second case. When the window of recent nodes has a constant size, we herein prove that the presence of the uniform rule delays the starting time from which the asymptotic regime starts to hold. The mean number of nodes of degree k and the asymptotic degree distribution are also determined analytically. Finally, a sensitivity analysis on the parameters of the model is performed.

Context-free parsing with connectionist networks

Science.gov (United States)

Fanty, M. A.

1986-08-01

This paper presents a simple algorithm which converts any context-free grammar into a connectionist network which parses strings (of arbitrary but fixed maximum length) in the language defined by that grammar. The network is fast, O(n), and deterministicd. It consists of binary units which compute a simple function of their input. When the grammar is put in Chomsky normal form, O(n3) units needed to parse inputs of length up to n.

Analyses of the response of a complex weighted network to nodes removal strategies considering links weight: The case of the Beijing urban road system

Science.gov (United States)

Bellingeri, Michele; Lu, Zhe-Ming; Cassi, Davide; Scotognella, Francesco

2018-02-01

Complex network response to node loss is a central question in different fields of science ranging from physics, sociology, biology to ecology. Previous studies considered binary networks where the weight of the links is not accounted for. However, in real-world networks the weights of connections can be widely different. Here, we analyzed the response of real-world road traffic complex network of Beijing, the most prosperous city in China. We produced nodes removal attack simulations using classic binary node features and we introduced weighted ranks for node importance. We measured the network functioning during nodes removal with three different parameters: the size of the largest connected cluster (LCC), the binary network efficiency (Bin EFF) and the weighted network efficiency (Weg EFF). We find that removing nodes according to weighted rank, i.e. considering the weight of the links as a number of taxi flows along the roads, produced in general the highest damage in the system. Our results show that: (i) in order to model Beijing road complex networks response to nodes (intersections) failure, it is necessary to consider the weight of the links; (ii) to discover the best attack strategy, it is important to use nodes rank accounting links weight.

Use of a mobile social networking intervention for weight management: a mixed-methods study protocol.

Science.gov (United States)

Laranjo, Liliana; Lau, Annie Y S; Martin, Paige; Tong, Huong Ly; Coiera, Enrico

2017-07-12

Obesity and physical inactivity are major societal challenges and significant contributors to the global burden of disease and healthcare costs. Information and communication technologies are increasingly being used in interventions to promote behaviour change in diet and physical activity. In particular, social networking platforms seem promising for the delivery of weight control interventions.We intend to pilot test an intervention involving the use of a social networking mobile application and tracking devices ( Fitbit Flex 2 and Fitbit Aria scale) to promote the social comparison of weight and physical activity, in order to evaluate whether mechanisms of social influence lead to changes in those outcomes over the course of the study. Mixed-methods study involving semi-structured interviews and a pre-post quasi-experimental pilot with one arm, where healthy participants in different body mass index (BMI) categories, aged between 19 and 35 years old, will be subjected to a social networking intervention over a 6-month period. The primary outcome is the average difference in weight before and after the intervention. Secondary outcomes include BMI, number of steps per day, engagement with the intervention, social support and system usability. Semi-structured interviews will assess participants' expectations and perceptions regarding the intervention. Ethics approval was granted by Macquarie University's Human Research Ethics Committee for Medical Sciences on 3 November 2016 (ethics reference number 5201600716).The social network will be moderated by a researcher with clinical expertise, who will monitor and respond to concerns raised by participants. Monitoring will involve daily observation of measures collected by the fitness tracker and the wireless scale, as well as continuous supervision of forum interactions and posts. Additionally, a protocol is in place to monitor for participant misbehaviour and direct participants-in-need to appropriate sources of help

Organization and scaling in water supply networks

Science.gov (United States)

Cheng, Likwan; Karney, Bryan W.

2017-12-01

Public water supply is one of the society's most vital resources and most costly infrastructures. Traditional concepts of these networks capture their engineering identity as isolated, deterministic hydraulic units, but overlook their physics identity as related entities in a probabilistic, geographic ensemble, characterized by size organization and property scaling. Although discoveries of allometric scaling in natural supply networks (organisms and rivers) raised the prospect for similar findings in anthropogenic supplies, so far such a finding has not been reported in public water or related civic resource supplies. Examining an empirical ensemble of large number and wide size range, we show that water supply networks possess self-organized size abundance and theory-explained allometric scaling in spatial, infrastructural, and resource- and emission-flow properties. These discoveries establish scaling physics for water supply networks and may lead to novel applications in resource- and jurisdiction-scale water governance.

Entanglement percolation on a quantum internet with scale-free and clustering characters

Energy Technology Data Exchange (ETDEWEB)

Wu Liang; Zhu Shiqun [School of Physical Science and Technology, Soochow University, Suzhou, Jiangsu 215006 (China)

2011-11-15

The applicability of entanglement percolation protocol to real Internet structure is investigated. If the current Internet can be used directly in the quantum regime, the protocol can provide a way to establish long-distance entanglement when the links are pure nonmaximally entangled states. This applicability is primarily due to the combination of scale-free degree distribution and a high level of clustering, both of which are widely observed in many natural and artificial networks including the current Internet. It suggests that the topology of real Internet may play an important role in entanglement establishment.

Entanglement percolation on a quantum internet with scale-free and clustering characters

International Nuclear Information System (INIS)

Wu Liang; Zhu Shiqun

2011-01-01

The applicability of entanglement percolation protocol to real Internet structure is investigated. If the current Internet can be used directly in the quantum regime, the protocol can provide a way to establish long-distance entanglement when the links are pure nonmaximally entangled states. This applicability is primarily due to the combination of scale-free degree distribution and a high level of clustering, both of which are widely observed in many natural and artificial networks including the current Internet. It suggests that the topology of real Internet may play an important role in entanglement establishment.

Identifying Vulnerable Nodes of Complex Networks in Cascading Failures Induced by Node-Based Attacks

Directory of Open Access Journals (Sweden)

Shudong Li

2013-01-01

Full Text Available In the research on network security, distinguishing the vulnerable components of networks is very important for protecting infrastructures systems. Here, we probe how to identify the vulnerable nodes of complex networks in cascading failures, which was ignored before. Concerned with random attack (RA and highest load attack (HL on nodes, we model cascading dynamics of complex networks. Then, we introduce four kinds of weighting methods to characterize the nodes of networks including Barabási-Albert scale-free networks (SF, Watts-Strogatz small-world networks (WS, Erdos-Renyi random networks (ER, and two real-world networks. The simulations show that, for SF networks under HL attack, the nodes with small value of the fourth kind of weight are the most vulnerable and the ones with small value of the third weight are also vulnerable. Also, the real-world autonomous system with power-law distribution verifies these findings. Moreover, for WS and ER networks under both RA and HL attack, when the nodes have low tolerant ability, the ones with small value of the fourth kind of weight are more vulnerable and also the ones with high degree are easier to break down. The results give us important theoretical basis for digging the potential safety loophole and making protection strategy.

Empirical study on a directed and weighted bus transport network in China

Science.gov (United States)

Feng, Shumin; Hu, Baoyu; Nie, Cen; Shen, Xianghao

2016-01-01

Bus transport networks are directed complex networks that consist of routes, stations, and passenger flow. In this study, the concept of duplication factor is introduced to analyze the differences between uplinks and downlinks for the bus transport network of Harbin (BTN-H). Further, a new representation model for BTNs is proposed, named as directed-space P. Two empirical characteristics of BTN-H are reported in this paper. First, the cumulative distributions of weighted degree, degree, number of routes that connect to each station, and node weight (peak-hour trips at a station) uniformly follow the exponential law. Meanwhile, the node weight shows positive correlations with the corresponding weighted degree, degree, and number of routes that connect to a station. Second, a new richness parameter of a node is explored by its node weight and the connectivity, weighted connectivity, average shortest path length and efficiency between rich nodes can be fitted by composite exponential functions to demonstrate the rich-club phenomenon.

Elastic Bands in Combination With Free Weights in Strength Training: Neuromuscular Effects.

Science.gov (United States)

Andersen, Vidar; Fimland, Marius S; Kolnes, Maria K; Saeterbakken, Atle H

2015-10-01

This study compared the effects of a variable vs. a constant lower limb resistance training program on muscle strength, muscle activation, and ballistic muscle performance at different knee angles. Thirty-two females were randomized to a constant resistance training free-weight group (FWG) or a variable resistance training group using free weights in combination with elastic bands (EBG). Two variations of the squat exercise (back squat and split) were performed 2 days per week for 10 weeks. Knee extensor maximal voluntary isometric contraction (MVC) and countermovement jump were assessed at knee angles of 60, 90, and 120° before and after the intervention. During the MVCs, muscle activation of the superficial knee extensor muscles was measured using surface electromyography. The FWG increased their MVCs at 60 and 90° (24 and 15%, respectively), whereas the EBG only increased significantly at 60° (15%). The FWG increased their jump height significantly at all angles (12-16%), whereas the EBG only improved significantly at 60 and 90° (15 and 10%, respectively). Both groups improved their 6-repetition maximum free-weight squat performance (EBG: 25% and FWG: 23%). There were no significant changes in muscle activation. In conclusion, constant and variable resistance training provided similar increases in dynamic and isometric strength, and ballistic muscle performance, albeit most consistently for the group training only with free weights.

Scaling Up ITO-free solar cells

DEFF Research Database (Denmark)

Galagan, Yulia; Coenen, Erica W. C.; Zimmermann, Birger

2014-01-01

Indium-tin-oxide-free (ITO-free) polymer solar cells with composite electrodes containing current-collecting grids and a semitransparent poly(3,4-ethylenedioxythiophene):polystyrenesulfonate) (PEDOT:PSS) conductor are demonstrated. The up-scaling of the length of the solar cell from 1 to 6 cm...... resistances. The performance of ITO-free organic solar cells with different dimensions and different electrode resistances are evaluated for different light intensities. The current generation and electric potential distribution are found to not be uniformly distributed in large-area devices at simulated 1...

Scaling Techniques for Massive Scale-Free Graphs in Distributed (External) Memory

KAUST Repository

Pearce, Roger; Gokhale, Maya; Amato, Nancy M.

2013-01-01

We present techniques to process large scale-free graphs in distributed memory. Our aim is to scale to trillions of edges, and our research is targeted at leadership class supercomputers and clusters with local non-volatile memory, e.g., NAND Flash

The acute hormonal response to free weight and machine weight resistance exercise.

Science.gov (United States)

Shaner, Aaron A; Vingren, Jakob L; Hatfield, Disa L; Budnar, Ronald G; Duplanty, Anthony A; Hill, David W

2014-04-01

Resistance exercise can acutely increase the concentrations of circulating neuroendocrine factors, but the effect of mode on this response is not established. The purpose of this study was to examine the effect of resistance exercise selection on the acute hormonal response using similar lower-body multijoint movement free weight and machine weight exercises. Ten resistance trained men (25 ± 3 years, 179 ± 7 cm, 84.2 ± 10.5 kg) completed 6 sets of 10 repetitions of squat or leg press at the same relative intensity separated by 1 week. Blood samples were collected before (PRE), immediately after (IP), and 15 (P15) and 30 minutes (P30) after exercise, and analyzed for testosterone (T), growth hormone (GH), and cortisol (C) concentrations. Exercise increased (p ≤ 0.05) T and GH at IP, but the concentrations at IP were greater for the squat (T: 31.4 ± 10.3 nmol·L(-1); GH: 9.5 ± 7.3 μg·L(-1)) than for the leg press (T: 26.9 ± 7.8 nmol·L(-1); GH: 2.8 ± 3.2 μg·L(-1)). At P15 and P30, GH was greater for the squat (P15: 12.3 ± 8.9 μg·L(-1); P30: 12.0 ± 8.9 μg·L(-1)) than for the leg press (P15: 4.8 ± 3.4 μg·L(-1); P30: 5.4 ± 4.1 μg·L(-1)). C was increased after exercise and was greater for the squat than for the leg press. Although total work (external load and body mass moved) was greater for the squat than for the leg press, rating of perceived exertion did not differ between the modes. Free weight exercises seem to induce greater hormonal responses to resistance exercise than machine weight exercises using similar lower-body multijoint movements and primary movers.

Extracting weights from edge directions to find communities in directed networks

International Nuclear Information System (INIS)

Lai, Darong; Lu, Hongtao; Nardini, Christine

2010-01-01

Community structures are found to exist ubiquitously in real-world complex networks. We address here the problem of community detection in directed networks. Most of the previous literature ignores edge directions and applies methods designed for community detection in undirected networks, which discards valuable information and often fails when different communities are defined on the basis of incoming and outgoing edges. We suggest extracting information about edge directions using a PageRank random walk and translating such information into edge weights. After extraction we obtain a new weighted directed network in which edge directions can then be safely ignored. We thus transform community detection in directed networks into community detection in reweighted undirected networks. Such an approach can benefit directly from the large volume of algorithms for the detection of communities in undirected networks already developed, since it is not obvious how to extend these algorithms to account for directed networks and the procedure is often difficult. Validations on synthetic and real-world networks demonstrate that the proposed framework can effectively detect communities in directed networks

PKI security in large-scale healthcare networks.

Science.gov (United States)

Mantas, Georgios; Lymberopoulos, Dimitrios; Komninos, Nikos

2012-06-01

During the past few years a lot of PKI (Public Key Infrastructures) infrastructures have been proposed for healthcare networks in order to ensure secure communication services and exchange of data among healthcare professionals. However, there is a plethora of challenges in these healthcare PKI infrastructures. Especially, there are a lot of challenges for PKI infrastructures deployed over large-scale healthcare networks. In this paper, we propose a PKI infrastructure to ensure security in a large-scale Internet-based healthcare network connecting a wide spectrum of healthcare units geographically distributed within a wide region. Furthermore, the proposed PKI infrastructure facilitates the trust issues that arise in a large-scale healthcare network including multi-domain PKI infrastructures.

Improving Estimation of Betweenness Centrality for Scale-Free Graphs

Energy Technology Data Exchange (ETDEWEB)

Bromberger, Seth A. [Lawrence Livermore National Lab. (LLNL), Livermore, CA (United States); Klymko, Christine F. [Lawrence Livermore National Lab. (LLNL), Livermore, CA (United States); Henderson, Keith A. [Lawrence Livermore National Lab. (LLNL), Livermore, CA (United States); Pearce, Roger [Lawrence Livermore National Lab. (LLNL), Livermore, CA (United States); Sanders, Geoff [Lawrence Livermore National Lab. (LLNL), Livermore, CA (United States)

2017-11-07

Betweenness centrality is a graph statistic used to nd vertices that are participants in a large number of shortest paths in a graph. This centrality measure is commonly used in path and network interdiction problems and its complete form requires the calculation of all-pairs shortest paths for each vertex. This leads to a time complexity of O(jV jjEj), which is impractical for large graphs. Estimation of betweenness centrality has focused on performing shortest-path calculations on a subset of randomly- selected vertices. This reduces the complexity of the centrality estimation to O(jSjjEj); jSj < jV j, which can be scaled appropriately based on the computing resources available. An estimation strategy that uses random selection of vertices for seed selection is fast and simple to implement, but may not provide optimal estimation of betweenness centrality when the number of samples is constrained. Our experimentation has identi ed a number of alternate seed-selection strategies that provide lower error than random selection in common scale-free graphs. These strategies are discussed and experimental results are presented.

Learning Gene Regulatory Networks Computationally from Gene Expression Data Using Weighted Consensus

KAUST Repository

Fujii, Chisato

2015-04-16

Gene regulatory networks analyze the relationships between genes allowing us to un- derstand the gene regulatory interactions in systems biology. Gene expression data from the microarray experiments is used to obtain the gene regulatory networks. How- ever, the microarray data is discrete, noisy and non-linear which makes learning the networks a challenging problem and existing gene network inference methods do not give consistent results. Current state-of-the-art study uses the average-ranking-based consensus method to combine and average the ranked predictions from individual methods. However each individual method has an equal contribution to the consen- sus prediction. We have developed a linear programming-based consensus approach which uses learned weights from linear programming among individual methods such that the methods have di↵erent weights depending on their performance. Our result reveals that assigning di↵erent weights to individual methods rather than giving them equal weights improves the performance of the consensus. The linear programming- based consensus method is evaluated and it had the best performance on in silico and Saccharomyces cerevisiae networks, and the second best on the Escherichia coli network outperformed by Inferelator Pipeline method which gives inconsistent results across a wide range of microarray data sets.

Scaling a network with positive gains to a lossy or gainy network

NARCIS (Netherlands)

Koene, J.

1979-01-01

Necessary and sufficient conditions are presented under which it is possible to scale a network with positive gains to a lossy or a gainy network. A procedure to perform such a scaling operation is given.

Single-shot secure quantum network coding on butterfly network with free public communication

Science.gov (United States)

Owari, Masaki; Kato, Go; Hayashi, Masahito

2018-01-01

Quantum network coding on the butterfly network has been studied as a typical example of quantum multiple cast network. We propose a secure quantum network code for the butterfly network with free public classical communication in the multiple unicast setting under restricted eavesdropper’s power. This protocol certainly transmits quantum states when there is no attack. We also show the secrecy with shared randomness as additional resource when the eavesdropper wiretaps one of the channels in the butterfly network and also derives the information sending through public classical communication. Our protocol does not require verification process, which ensures single-shot security.

Waste Receiving and Processing (WRAP) Weight Scale Analysis Results

International Nuclear Information System (INIS)

JOHNSON, M.D.

2000-01-01

Fairbanks Weight Scales are used at the Waste Receiving and Processing (WRAP) facility to determine the weight of waste drums as they are received, processed, and shipped. Due to recent problems, discovered during calibration, the WRAP Engineering Department has completed this document which outlines both the investigation of the infeed conveyor scale failure in September of 1999 and recommendations for calibration procedure modifications designed to correct deficiencies in the current procedures

Multilevel method for modeling large-scale networks.

Energy Technology Data Exchange (ETDEWEB)

Safro, I. M. (Mathematics and Computer Science)

2012-02-24

Understanding the behavior of real complex networks is of great theoretical and practical significance. It includes developing accurate artificial models whose topological properties are similar to the real networks, generating the artificial networks at different scales under special conditions, investigating a network dynamics, reconstructing missing data, predicting network response, detecting anomalies and other tasks. Network generation, reconstruction, and prediction of its future topology are central issues of this field. In this project, we address the questions related to the understanding of the network modeling, investigating its structure and properties, and generating artificial networks. Most of the modern network generation methods are based either on various random graph models (reinforced by a set of properties such as power law distribution of node degrees, graph diameter, and number of triangles) or on the principle of replicating an existing model with elements of randomization such as R-MAT generator and Kronecker product modeling. Hierarchical models operate at different levels of network hierarchy but with the same finest elements of the network. However, in many cases the methods that include randomization and replication elements on the finest relationships between network nodes and modeling that addresses the problem of preserving a set of simplified properties do not fit accurately enough the real networks. Among the unsatisfactory features are numerically inadequate results, non-stability of algorithms on real (artificial) data, that have been tested on artificial (real) data, and incorrect behavior at different scales. One reason is that randomization and replication of existing structures can create conflicts between fine and coarse scales of the real network geometry. Moreover, the randomization and satisfying of some attribute at the same time can abolish those topological attributes that have been undefined or hidden from

Multi-scale analysis of the European airspace using network community detection.

Directory of Open Access Journals (Sweden)

Gérald Gurtner

Full Text Available We show that the European airspace can be represented as a multi-scale traffic network whose nodes are airports, sectors, or navigation points and links are defined and weighted according to the traffic of flights between the nodes. By using a unique database of the air traffic in the European airspace, we investigate the architecture of these networks with a special emphasis on their community structure. We propose that unsupervised network community detection algorithms can be used to monitor the current use of the airspace and improve it by guiding the design of new ones. Specifically, we compare the performance of several community detection algorithms, both with fixed and variable resolution, and also by using a null model which takes into account the spatial distance between nodes, and we discuss their ability to find communities that could be used to define new control units of the airspace.

Factors affecting velvet antler weights in free-ranging reindeer in Alaska

Directory of Open Access Journals (Sweden)

Alexander K. Prichard

1999-04-01

Full Text Available Free-ranging reindeer on the Seward Peninsula in western Alaska are rounded up from late May to early July and antlers are removed. We used data collected from 1987 to 1997 to determine how velvet antler weights of males and females varied with age, year, reproductive status, Julian date, and body weight. Male antler weights increased with age up to age five years, and were lower in castrates than in bulls. There was a significant positive relationship between body weight and antler weight in both sexes. Female antler weights increased with age until at least age nine. Lactating females had lower antler weights than non-lactating females, but this effect is better explained by differences in body weight. Antler weight of individual reindeer at age two years was better predicted by their antler weights as yearlings than their body weight as yearlings.

Chain-loaded variable resistance warm-up improves free-weight maximal back squat performance.

Science.gov (United States)

Mina, Minas A; Blazevich, Anthony J; Giakas, Giannis; Seitz, Laurent B; Kay, Anthony D

2016-11-01

The acute influence of chain-loaded variable resistance exercise on subsequent free-weight one-repetition maximum (1-RM) back squat performance was examined in 16 recreationally active men. The participants performed either a free-weight resistance (FWR) or chain-loaded resistance (CLR) back squat warm-up at 85% 1-RM on two separate occasions. After a 5-min rest, the participants attempted a free-weight 1-RM back squat; if successful, subsequent 5% load additions were made until participants failed to complete the lift. During the 1-RM trials, 3D knee joint kinematics and knee extensor and flexor electromyograms (EMG) were recorded simultaneously. Significantly greater 1-RM (6.2 ± 5.0%; p  .05) was found in concentric EMG, eccentric or concentric knee angular velocity, or peak knee flexion angle. Performing a CLR warm-up enhanced subsequent free-weight 1-RM performance without changes in knee flexion angle or eccentric and concentric knee angular velocities; thus a real 1-RM increase was achieved as the mechanics of the lift were not altered. These results are indicative of a potentiating effect of CLR in a warm-up, which may benefit athletes in tasks where high-level strength is required.

Multi-function nuclear weight scale system

International Nuclear Information System (INIS)

Zheng Mingquan; Sun Jinhua; Jia Changchun; Wang Mingqian; Tang Ke

1998-01-01

The author introduces the methods to contrive the hardware and software of a Multi-function Nuclear Weight Scale System based on the communication contract in compliance with RS485 between a master (industrial control computer 386) and a slave (single chip 8098) and its main functions

Evolutionary Artificial Neural Network Weight Tuning to Optimize Decision Making for an Abstract Game

Science.gov (United States)

2010-03-01

EVOLUTIONARY ARTIFICIAL NEURAL NETWORK WEIGHT TUNING TO OPTIMIZE DECISION MAKING FOR AN ABSTRACT...AFIT/GCS/ENG/10-06 EVOLUTIONARY ARTIFICIAL NEURAL NETWORK WEIGHT TUNING TO OPTIMIZE DECISION MAKING FOR AN ABSTRACT GAME THESIS Presented...35 14: Diagram of pLoGANN’s Artificial Neural Network and

Investigating the Influence Relationship Models for Stocks in Indian Equity Market: A Weighted Network Modelling Study.

Science.gov (United States)

Bhattacharjee, Biplab; Shafi, Muhammad; Acharjee, Animesh

2016-01-01

The socio-economic systems today possess high levels of both interconnectedness and interdependencies, and such system-level relationships behave very dynamically. In such situations, it is all around perceived that influence is a perplexing power that has an overseeing part in affecting the dynamics and behaviours of involved ones. As a result of the force & direction of influence, the transformative change of one entity has a cogent aftereffect on the other entities in the system. The current study employs directed weighted networks for investigating the influential relationship patterns existent in a typical equity market as an outcome of inter-stock interactions happening at the market level, the sectorial level and the industrial level. The study dataset is derived from 335 constituent stocks of 'Standard & Poor Bombay Stock Exchange 500 index' and study period is 1st June 2005 to 30th June 2015. The study identifies the set of most dynamically influential stocks & their respective temporal pattern at three hierarchical levels: the complete equity market, different sectors, and constituting industry segments of those sectors. A detailed influence relationship analysis is performed for the sectorial level network of the construction sector, and it was found that stocks belonging to the cement industry possessed high influence within this sector. Also, the detailed network analysis of construction sector revealed that it follows scale-free characteristics and power law distribution. In the industry specific influence relationship analysis for cement industry, methods based on threshold filtering and minimum spanning tree were employed to derive a set of sub-graphs having temporally stable high-correlation structure over this ten years period.

Empirical investigation of topological and weighted properties of a bus transport network from China

Science.gov (United States)

Shu-Min, Feng; Bao-Yu, Hu; Cen, Nie; Xiang-Hao, Shen; Yu-Sheng, Ci

2016-03-01

Many bus transport networks (BTNs) have evolved into directed networks. A new representation model for BTNs is proposed, called directed-space P. The bus transport network of Harbin (BTN-H) is described as a directed and weighted complex network by the proposed representation model and by giving each node weights. The topological and weighted properties are revealed in detail. In-degree and out-degree distributions, in-weight and out-weight distributions are presented as an exponential law, respectively. There is a strong relation between in-weight and in-degree (also between out-weight and out-degree), which can be fitted by a power function. Degree-degree and weight-weight correlations are investigated to reveal that BTN-H has a disassortative behavior as the nodes have relatively high degree (or weight). The disparity distributions of out-degree and in-degree follow an approximate power-law. Besides, the node degree shows a near linear increase with the number of routes that connect to the corresponding station. These properties revealed in this paper can help public transport planners to analyze the status quo of the BTN in nature. Project supported by the National High Technology Research and Development Program of China (Grant No. 2014AA110304).

A neighbourhood evolving network model

International Nuclear Information System (INIS)

Cao, Y.J.; Wang, G.Z.; Jiang, Q.Y.; Han, Z.X.

2006-01-01

Many social, technological, biological and economical systems are best described by evolved network models. In this short Letter, we propose and study a new evolving network model. The model is based on the new concept of neighbourhood connectivity, which exists in many physical complex networks. The statistical properties and dynamics of the proposed model is analytically studied and compared with those of Barabasi-Albert scale-free model. Numerical simulations indicate that this network model yields a transition between power-law and exponential scaling, while the Barabasi-Albert scale-free model is only one of its special (limiting) cases. Particularly, this model can be used to enhance the evolving mechanism of complex networks in the real world, such as some social networks development

Dense power-law networks and simplicial complexes

Science.gov (United States)

Courtney, Owen T.; Bianconi, Ginestra

2018-05-01

There is increasing evidence that dense networks occur in on-line social networks, recommendation networks and in the brain. In addition to being dense, these networks are often also scale-free, i.e., their degree distributions follow P (k ) ∝k-γ with γ ∈(1 ,2 ] . Models of growing networks have been successfully employed to produce scale-free networks using preferential attachment, however these models can only produce sparse networks as the numbers of links and nodes being added at each time step is constant. Here we present a modeling framework which produces networks that are both dense and scale-free. The mechanism by which the networks grow in this model is based on the Pitman-Yor process. Variations on the model are able to produce undirected scale-free networks with exponent γ =2 or directed networks with power-law out-degree distribution with tunable exponent γ ∈(1 ,2 ) . We also extend the model to that of directed two-dimensional simplicial complexes. Simplicial complexes are generalization of networks that can encode the many body interactions between the parts of a complex system and as such are becoming increasingly popular to characterize different data sets ranging from social interacting systems to the brain. Our model produces dense directed simplicial complexes with power-law distribution of the generalized out-degrees of the nodes.

Learning gene regulatory networks from gene expression data using weighted consensus

KAUST Repository

Fujii, Chisato; Kuwahara, Hiroyuki; Yu, Ge; Guo, Lili; Gao, Xin

2016-01-01

An accurate determination of the network structure of gene regulatory systems from high-throughput gene expression data is an essential yet challenging step in studying how the expression of endogenous genes is controlled through a complex interaction of gene products and DNA. While numerous methods have been proposed to infer the structure of gene regulatory networks, none of them seem to work consistently over different data sets with high accuracy. A recent study to compare gene network inference methods showed that an average-ranking-based consensus method consistently performs well under various settings. Here, we propose a linear programming-based consensus method for the inference of gene regulatory networks. Unlike the average-ranking-based one, which treats the contribution of each individual method equally, our new consensus method assigns a weight to each method based on its credibility. As a case study, we applied the proposed consensus method on synthetic and real microarray data sets, and compared its performance to that of the average-ranking-based consensus and individual inference methods. Our results show that our weighted consensus method achieves superior performance over the unweighted one, suggesting that assigning weights to different individual methods rather than giving them equal weights improves the accuracy. © 2016 Elsevier B.V.

Learning gene regulatory networks from gene expression data using weighted consensus

KAUST Repository

Fujii, Chisato

2016-08-25

An accurate determination of the network structure of gene regulatory systems from high-throughput gene expression data is an essential yet challenging step in studying how the expression of endogenous genes is controlled through a complex interaction of gene products and DNA. While numerous methods have been proposed to infer the structure of gene regulatory networks, none of them seem to work consistently over different data sets with high accuracy. A recent study to compare gene network inference methods showed that an average-ranking-based consensus method consistently performs well under various settings. Here, we propose a linear programming-based consensus method for the inference of gene regulatory networks. Unlike the average-ranking-based one, which treats the contribution of each individual method equally, our new consensus method assigns a weight to each method based on its credibility. As a case study, we applied the proposed consensus method on synthetic and real microarray data sets, and compared its performance to that of the average-ranking-based consensus and individual inference methods. Our results show that our weighted consensus method achieves superior performance over the unweighted one, suggesting that assigning weights to different individual methods rather than giving them equal weights improves the accuracy. © 2016 Elsevier B.V.

Scaling properties in time-varying networks with memory

Science.gov (United States)

Kim, Hyewon; Ha, Meesoon; Jeong, Hawoong

2015-12-01

The formation of network structure is mainly influenced by an individual node's activity and its memory, where activity can usually be interpreted as the individual inherent property and memory can be represented by the interaction strength between nodes. In our study, we define the activity through the appearance pattern in the time-aggregated network representation, and quantify the memory through the contact pattern of empirical temporal networks. To address the role of activity and memory in epidemics on time-varying networks, we propose temporal-pattern coarsening of activity-driven growing networks with memory. In particular, we focus on the relation between time-scale coarsening and spreading dynamics in the context of dynamic scaling and finite-size scaling. Finally, we discuss the universality issue of spreading dynamics on time-varying networks for various memory-causality tests.

Fat-free mass mediates the association between birth weight and aerobic fitness in youth

DEFF Research Database (Denmark)

Ridgway, C L; Andresen, Brage Storstein; Anderssen, S

2011-01-01

Abstract Objective. To investigate whether birth weight acts as a biological determinant of later aerobic fitness, and whether fat-free mass may mediate this association. Methods. The European Youth Heart Study (EYHS) is a population-based cohort of two age groups (9 and 15 years) from Denmark...... test. Physical activity was collected in a subset (n = 1 505) using a hip-worn accelerometer and defined as total activity counts/wear time, all children with >600 minutes/day for ≥3 days of wear were included. Results. Lower birth weight was associated with lower aerobic fitness, after adjusting...... may have long-term influences on fat-free mass and differences in fat-free mass mediate the observed association between birth weight and aerobic fitness....

Epidemic dynamics and endemic states in complex networks

OpenAIRE

Pastor-Satorras, Romualdo; Vespignani, Alessandro

2001-01-01

We study by analytical methods and large scale simulations a dynamical model for the spreading of epidemics in complex networks. In networks with exponentially bounded connectivity we recover the usual epidemic behavior with a threshold defining a critical point below which the infection prevalence is null. On the contrary, on a wide range of scale-free networks we observe the absence of an epidemic threshold and its associated critical behavior. This implies that scale-free networks are pron...

On a digital wireless impact-monitoring network for large-scale composite structures

International Nuclear Information System (INIS)

Yuan, Shenfang; Mei, Hanfei; Qiu, Lei; Ren, Yuanqiang

2014-01-01

Impact, which may occur during manufacture, service or maintenance, is one of the major concerns to be monitored throughout the lifetime of aircraft composite structures. Aiming at monitoring impacts online while minimizing the weight added to the aircraft to meet the strict limitations of aerospace engineering, this paper puts forward a new digital wireless network based on miniaturized wireless digital impact-monitoring nodes developed for large-scale composite structures. In addition to investigations on the design methods of the network architecture, time synchronization and implementation method, a conflict resolution method based on the feature parameters of digital sequences is first presented to address impact localization conflicts when several nodes are arranged close together. To verify the feasibility and stability of the wireless network, experiments are performed on a complex aircraft composite wing box and an unmanned aerial vehicle (UAV) composite wing. Experimental results show the successful design of the presented network. (paper)

Critical behavior and correlations on scale-free small-world networks: Application to network design

Science.gov (United States)

Ostilli, M.; Ferreira, A. L.; Mendes, J. F. F.

2011-06-01

We analyze critical phenomena on networks generated as the union of hidden variable models (networks with any desired degree sequence) with arbitrary graphs. The resulting networks are general small worlds similar to those à la Watts and Strogatz, but with a heterogeneous degree distribution. We prove that the critical behavior (thermal or percolative) remains completely unchanged by the presence of finite loops (or finite clustering). Then, we show that, in large but finite networks, correlations of two given spins may be strong, i.e., approximately power-law-like, at any temperature. Quite interestingly, if γ is the exponent for the power-law distribution of the vertex degree, for γ⩽3 and with or without short-range couplings, such strong correlations persist even in the thermodynamic limit, contradicting the common opinion that, in mean-field models, correlations always disappear in this limit. Finally, we provide the optimal choice of rewiring under which percolation phenomena in the rewired network are best performed, a natural criterion to reach best communication features, at least in noncongested regimes.

Central Hemodynamics Measured During 5 Repetition Maximum Free Weight Resistance Exercise.

Science.gov (United States)

Howard, Jonathan S; McLester, Cherilyn N; Evans, Thomas W; McLester, John R; Calloway, Jimmy P

2018-01-01

The PhysioFlow™ is a piece of equipment that uses bioimpedance cardiography to measure central hemodynamics. The purpose of this research was to explore the novel approach of monitoring central hemodynamics during free weight resistance exercise using bioimpedance cardiography throughout a 5 repetition maximum (5RM). Thirty participants ranging from beginner to advanced lifters (16 males and 14 females) completed a 5RM for back squat, seated push press, and bicep curl while connected to the PhysioFlow™ to assess the response of heart rate (HR), stroke volume (SV), cardiac output (Q), and ejection fraction (EF). Participants were cued for form and to breathe normally throughout the lifts. The PhysioFlow™ detected an increase in HR and Q for all lifts between rest and each repetition ( p 0.05) and no changes in EF or SV were detected when all repetitions were compared to each other for all lifts ( p > 0.05). In conclusion, the PhysioFlow™ was able to detect changes in HR and Q during dynamic free weight resistance exercise. This novel approach may provide a mechanism for monitoring central hemodynamics during free weight resistance training. However, more research needs to be conducted as the exercise protocol for this investigation did not allow for a comparison to a reference method.

Co-evolution of the brand effect and competitiveness in evolving networks

Science.gov (United States)

Guo, Jin-Li

2014-07-01

The principle that ‘the brand effect is attractive’ underlies the preferential attachment. Here we show that the brand effect is just one dimension of attractiveness. Another dimension is competitiveness. We firstly introduce a general framework that allows us to investigate the competitive aspect of real networks, instead of simply preferring popular nodes. Our model accurately describes the evolution of social and technological networks. The phenomenon that more competitive nodes become richer can help us to understand the evolution of many competitive systems in nature and society. In general, the paper provides an explicit analytical expression of degree distributions of the network. In particular, the model yields a nontrivial time evolution of nodes' properties and the scale-free behavior with exponents depending on the microscopic parameters characterizing the competition rules. Secondly, through theoretical analyses and numerical simulations, we reveal that our model has not only the universality for the homogeneous weighted network, but also the character for the heterogeneous weighted network. Thirdly, we also develop a model based on the profit-driven mechanism. It can better describe the observed phenomenon in enterprise cooperation networks. We show that the standard preferential attachment, the growing random graph, the initial attractiveness model, the fitness model, and weighted networks can all be seen as degenerate cases of our model.

Analysis on Influential Functions in the Weighted Software Network

Directory of Open Access Journals (Sweden)

Haitao He

2018-01-01

Full Text Available Identifying influential nodes is important for software in terms of understanding the design patterns and controlling the development and the maintenance process. However, there are no efficient methods to discover them so far. Based on the invoking dependency relationships between the nodes, this paper proposes a novel approach to define the node importance for mining the influential software nodes. First, according to the multiple execution information, we construct a weighted software network (WSN to denote the software execution dependency structure. Second, considering the invoking times and outdegree about software nodes, we improve the method PageRank and put forward the targeted algorithm FunctionRank to evaluate the node importance (NI in weighted software network. It has higher influence when the node has lager value of NI. Finally, comparing the NI of nodes, we can obtain the most influential nodes in the software network. In addition, the experimental results show that the proposed approach has good performance in identifying the influential nodes.

The analysis of HIV/AIDS drug-resistant on networks

Science.gov (United States)

Liu, Maoxing

2014-01-01

In this paper, we present an Human Immunodeficiency Virus (HIV)/Acquired Immune Deficiency Syndrome (AIDS) drug-resistant model using an ordinary differential equation (ODE) model on scale-free networks. We derive the threshold for the epidemic to be zero in infinite scale-free network. We also prove the stability of disease-free equilibrium (DFE) and persistence of HIV/AIDS infection. The effects of two immunization schemes, including proportional scheme and targeted vaccination, are studied and compared. We find that targeted strategy compare favorably to a proportional condom using has prominent effect to control HIV/AIDS spread on scale-free networks.

Disease spreading in real-life networks

Science.gov (United States)

Gallos, Lazaros; Argyrakis, Panos

2002-08-01

In recent years the scientific community has shown a vivid interest in the network structure and dynamics of real-life organized systems. Many such systems, covering an extremely wide range of applications, have been recently shown to exhibit scale-free character in their connectivity distribution, meaning that they obey a power law. Modeling of epidemics on lattices and small-world networks suffers from the presence of a critical infection threshold, above which the entire population is infected. For scale-free networks, the original assumption was that the formation of a giant cluster would lead to an epidemic spreading in the same way as in simpler networks. Here we show that modeling epidemics on a scale-free network can greatly improve the predictions on the rate and efficiency of spreading, as compared to lattice models and small-world networks. We also show that the dynamics of a disease are greatly influenced by the underlying population structure. The exact same model can describe a plethora of networks, such as social networks, virus spreading in the Web, rumor spreading, signal transmission etc.

Deformation and concentration fluctuations under stretching in a polymer network with free chains. The ''butterfly'' effect

International Nuclear Information System (INIS)

Ramzi, A.

1994-06-01

Small Angle Neutron Scattering gives access to concentration fluctuations of mobile labeled polymer chains embedded in a polymer network. At rest they appear progressively larger than for random mixing, with increasing ratio. Under uniaxial stretching, they decrease towards ideal mixing along the direction perpendicular to stretching, and can grow strongly along the parallel one, including the zero scattering vector q limit. This gives rise to intensity contours with double-winged patterns, in the shape of the figure '8', or of 'butterfly'. Random crosslinking and end-linking of monodisperse chains have both been studied. The strength of the 'butterfly' effect increases with the molecular weight of the free chains, the crosslinking ratio, the network heterogeneity, and the elongation ratio. Eventually, the signal collapses on an 'asymptotic' function I(q), of increasing correlation length with the elongation ratio. Deformation appears heterogeneous, maximal for soft areas, where the mobile chains localize preferentially. This could be due to spontaneous fluctuations, or linked to frozen fluctuations of the crosslink density. However, disagreement with the corresponding theoretical expressions makes it necessary to account for the spatial correlations of crosslink density, and their progressive unscreening as displayed by the asymptotic behavior. Networks containing pending labeled chains and free labeled stars lead to more precise understanding of the diffusion of free species and the heterogeneity of the deformation. It seems that the latter occurs even without diffusion for heterogeneous enough networks. In extreme cases (of the crosslinking parameters), the spatial correlations display on apparent fractal behavior, of dimensions 2 to 2.5, which is discussed here in terms of random clusters. 200 refs., 95 figs., 21 tabs., 10 appends

Independent functional connectivity networks underpin food and monetary reward sensitivity in excess weight.

Science.gov (United States)

Verdejo-Román, Juan; Fornito, Alex; Soriano-Mas, Carles; Vilar-López, Raquel; Verdejo-García, Antonio

2017-02-01

Overvaluation of palatable food is a primary driver of obesity, and is associated with brain regions of the reward system. However, it remains unclear if this network is specialized in food reward, or generally involved in reward processing. We used functional magnetic resonance imaging (fMRI) to characterize functional connectivity during processing of food and monetary rewards. Thirty-nine adults with excess weight and 37 adults with normal weight performed the Willingness to Pay for Food task and the Monetary Incentive Delay task in the fMRI scanner. A data-driven graph approach was applied to compare whole-brain, task-related functional connectivity between groups. Excess weight was associated with decreased functional connectivity during the processing of food rewards in a network involving primarily frontal and striatal areas, and increased functional connectivity during the processing of monetary rewards in a network involving principally frontal and parietal areas. These two networks were topologically and anatomically distinct, and were independently associated with BMI. The processing of food and monetary rewards involve segregated neural networks, and both are altered in individuals with excess weight. Copyright © 2016 Elsevier Inc. All rights reserved.

Ground reaction force comparison of bilateral symmetry with pneumatic resistance squat device and free weights - biomed 2009.

Science.gov (United States)

Paulus, David C; Schilling, Brian K

2009-01-01

The unloading of spaceflight leads to bone and muscle atrophy, and a pneumatic resistance squat exercise countermeasure has the potential to provide optimized controllable resistance in a lightweight and compact configuration. However each end of the barbell in the proposed device is connected to a separate resistance cylinder which could lead to bilaterally asymmetric loading. Therefore, the purpose of the study is to compare the unilateral ground reaction forces (GRF) of the new squat device compared to free weights. Four previously trained men (mean +/- SD; age = 20+/-2 years, body mass = 99+/-18 kg) performed three sets of three repetitions of maximal exertion squat exercises with pneumatically controlled constant resistance and free weights each with a resistance level set to half of the body weight of each subject. Unilateral GRF data for each lifting modality at the negative to positive transition of the squat exercise was measured with a force plate under each foot. The pneumatic resistance GRF (N; mean +/- SD) was 749+/-114 on the left leg and 786+/-123 on the right leg and the free weight GRF was 786+/-114 left and 861+/-111 right resulting in a 5% difference between left and right GRF with pneumatics and 9% difference with free weights. The correlation coefficient between left and right GRF was 0.92 with pneumatics and 0.80 with free weights. Because the pneumatic device elicited more bilaterally symmetric GRF than traditional free weights, the separate resistance cylinders are an acceptable design configuration.

The networks scale and coupling parameter in synchronization of neural networks with diluted synapses

International Nuclear Information System (INIS)

Li Yanlong; Ma Jun; Chen Yuhong; Xu Wenke; Wang Yinghai

2008-01-01

In this paper the influence of the networks scale on the coupling parameter in the synchronization of neural networks with diluted synapses is investigated. Using numerical simulations, an exponential decay form is observed in the extreme case of global coupling among networks and full connection in each network; the larger linked degree becomes, the larger critical coupling intensity becomes; and the oscillation phenomena in the relationship of critical coupling intensity and the number of neural networks layers in the case of small-scale networks are found

Exponential stability of neural networks with asymmetric connection weights

International Nuclear Information System (INIS)

Yang Jinxiang; Zhong Shouming

2007-01-01

This paper investigates the exponential stability of a class of neural networks with asymmetric connection weights. By dividing the network state variables into various parts according to the characters of the neural networks, some new sufficient conditions of exponential stability are derived via constructing a Lyapunov function and using the method of the variation of constant. The new conditions are associated with the initial values and are described by some blocks of the interconnection matrix, and do not depend on other blocks. Examples are given to further illustrate the theory

Backpack Weight and the Scaling of the Human Frame - II

Science.gov (United States)

O'Shea, Michael J.

2018-02-01

The backpack weight a hiker is capable of carrying depends on several factors. These include the hiker's weight, body mass index (BMI), fitness, and training. It can also depend on the terrain on which the hiker travels, e.g., off-trail or on-trail. However, online advice has tended to focus on the hiker's weight and suggests that pack weight should be a certain percentage of the hiker's weight. We developed a model of how the ability of a hiker to carry a backpack depends on the weight of the hiker. Modeling such real-life situations helps grab the attention of students in introductory physics. We have expanded on our earlier idea and present a more sophisticated model of an adult backpacker. In particular, we generalize our model for scaling of the human frame, and investigate how the ability to carry a backpack (within our model) varies with the form of scaling used.

Scalable Approach To Construct Free-Standing and Flexible Carbon Networks for Lithium–Sulfur Battery

KAUST Repository

Li, Mengliu

2017-02-21

Reconstructing carbon nanomaterials (e.g., fullerene, carbon nanotubes (CNTs), and graphene) to multidimensional networks with hierarchical structure is a critical step in exploring their applications. Herein, a sacrificial template method by casting strategy is developed to prepare highly flexible and free-standing carbon film consisting of CNTs, graphene, or both. The scalable size, ultralight and binder-free characteristics, as well as the tunable process/property are promising for their large-scale applications, such as utilizing as interlayers in lithium-sulfur battery. The capability of holding polysulfides (i.e., suppressing the sulfur diffusion) for the networks made from CNTs, graphene, or their mixture is pronounced, among which CNTs are the best. The diffusion process of polysulfides can be visualized in a specially designed glass tube battery. X-ray photoelectron spectroscopy analysis of discharged electrodes was performed to characterize the species in electrodes. A detailed analysis of lithium diffusion constant, electrochemical impedance, and elementary distribution of sulfur in electrodes has been performed to further illustrate the differences of different carbon interlayers for Li-S batteries. The proposed simple and enlargeable production of carbon-based networks may facilitate their applications in battery industry even as a flexible cathode directly. The versatile and reconstructive strategy is extendable to prepare other flexible films and/or membranes for wider applications.

Weighted radial dimension: an improved fractal measurement for highway transportation networks distribution

Science.gov (United States)

Feng, Yongjiu; Liu, Miaolong; Tong, Xiaohua

2007-06-01

An improved fractal measurement, the weighted radial dimension, is put forward for highway transportation networks distribution. The radial dimension (DL), originated from subway investigation in Stuttgart, is a fractal measurement for transportation systems under ideal assumption considering all the network lines to be homogeneous curves, ignoring the difference on spatial structure, quality and level, especially the highway networks. Considering these defects of radial dimension, an improved fractal measurement called weighted radial dimension (D WL) is introduced and the transportation system in Guangdong province is studied in detail using this novel method. Weighted radial dimensions are measured and calculated, and the spatial structure, intensity and connectivity of transportation networks are discussed in Guangdong province and the four sub-areas: the Pearl River Delta area, the East Costal area, the West Costal area and the Northern Guangdong area. In Guangdong province, the fractal spatial pattern characteristics of transportation system vary remarkably: it is the highest in the Pearl River Delta area, moderate in Costal area and lowest in the Northern Guangdong area. With the Pearl River Delta area as the centre, the weighted radial dimensions decrease with the distance increasing, while the decline level is smaller in the costal area and greater in the Northern Guangdong province. By analysis of the conic of highway density, it is recognized that the density decrease with the distance increasing from the calculation centre (Guangzhou), demonstrating the same trend as weighted radial dimensions shown. Evidently, the improved fractal measurement, weighted radial dimension, is an indictor describing the characteristics of highway transportation system more effectively and accurately.

Allometric scaling of echocardiographic measurements in healthy Spanish foals with different body weight.

Science.gov (United States)

Rovira, S; Muñoz, A; Rodilla, V

2009-04-01

Scaling in biology is usually allometric, and therefore, the size of the heart may be expressed as a power function of body weight (BW). The present research analyses the echocardiographic measurements in 68 healthy Spanish foals weighed between 70 and 347kg in order to determine the correct scaling exponent for the allometric equation. The echocardiographic parameters measured were: left ventricular internal dimensions (LVID), free wall thickness (LVFWT), interventricular septum thickness (IVST) at systole (s) and diastole (d), EPSS (distance between the point E of the mitral valve and the interventricular septum), and aorta diameters at the level of the aortic valve (AOD), base of valve leaflets (ABS), sinus of Valsalva (ASV) and sino-tubular junction (AJT). Indices of left ventricular performance were calculated. It was found that LVIDd, IVSTs, AOD, and ASV have a relationship to BW raised to 0.300-0.368 power, whereas left ventricular end-diastolic volume and stroke volume scaled to BW raised to 0.731-0.712 power. With these data, appropriate values can be calculated for normal Spanish foals.

The Kansas Squat Test Modality Comparison: Free Weights vs. Smith Machine.

Science.gov (United States)

Luebbers, Paul E; Fry, Andrew C

2016-08-01

Luebbers, PE and Fry, AC. The Kansas squat test modality comparison: free weights vs. smith machine. J Strength Cond Res 30(8): 2186-2193, 2016-Standardized methods of testing power are instrumental in planning and implementing training regimens for many athletes, and also in tracking training adaptations. Previous work has demonstrated that the Kansas squat test (KST) is a valid test for measuring indices of mean and peak power when compared with the Wingate anaerobic cycle test. Although the KST was designed for use with a Smith machine (SM), many power athletes use free weights for training. The purpose of this study was to determine the feasibility of using free weights (FW) for the KST by comparing it with the SM modality. Twenty-three track and field athletes participated (mean ± SD; weight, 69.7 ± 10.6 kg; age, 20.1 ± 1.1 years) in this study. Each completed familiarization sessions with the FW and SM modalities before data collection. A 1-repetition maximum squat was also determined for both the FW and SM. Correlation coefficients indicated significant relationships between the FW KST and SM KST on measures of peak test power (r = 0.955; p 0.05) or posttest lactate (r = 0.109; p > 0.05). Paired samples t-tests indicated that the FW KST resulted in significantly higher measures of peak power and mean power (p ≤ 0.01), although no differences were observed for relative fatigue or lactate (p > 0.05). These data indicate that the FW KST is a valid and feasible alternative to the SM KST in measuring peak and mean power.

Networks, complexity and internet regulation scale-free law

OpenAIRE

Guadamuz, Andres

2013-01-01

This book, then, starts with a general statement: that regulators should try, wherever possible, to use the physical methodological tools presently available in order to draft better legislation. While such an assertion may be applied to the law in general, this work will concentrate on the much narrower area of Internet regulation and the science of complex networks The Internet is the subject of this book not only because it is my main area of research, but also because –without...

VOLUME ESTIMATIONS FOR COMBINED FREE-WEIGHT AND RUBBER-BAND RESISTANCE EXERCISE

OpenAIRE

C. Shoepe, Todd; Vejarano, Gustavo; P. Reyes, Nathan; M. Gobreial, Nicole; M. Ricci, Jeanette

2017-01-01

Volume, or the total work performed during resistance training is one of the vital variables of resistance exercise programming. The most common definition in use by practitioners is sets x reps x external weight. While appropriate for linear loading incurred through free-weight resistance exercise, this inadequately addresses the nonlinear loading incurred with rubber resistance, a relatively new loading technique. The purpose of this investigation was to derive a theoretical model to descri...

Multi-Type Directed Scale-Free Percolation

International Nuclear Information System (INIS)

Shang Yilun

2012-01-01

In this paper, we study a long-range percolation model on the lattice ℤ d with multi-type vertices and directed edges. Each vertex x in ℤ d is independently assigned a non-negative weight W x and a type ψ x , where (W x ) xinℤ d are i.i.d. random variables, and (ψ x ) xinℤ d are also i.i.d. Conditionally on weights and types, and given λ, α > 0, the edges are independent and the probability that there is a directed edge from x to y is given by p xy = 1 - exp(-λφ ψ x ψ y W x W y /|x-y| α ), where φ ij 's are entries from a type matrix Φ. We show that, when the tail of the distribution of W x is regularly varying with exponent τ - 1, the tails of the out/in-degree distributions are both regularly varying with exponent γ = α(τ - 1)/d. We formulate conditions under which there exist critical values λ c WCC in (0, ∞) and λ c SCC in (0, ∞) such that an infinite weak component and an infinite strong component emerge, respectively, when λ exceeds them. A phase transition is established for the shortest path lengths of directed and undirected edges in the infinite component at the point γ = 2, where the out/in-degrees switch from having finite to infinite variances. The random graph model studied here features some structures of multi-type vertices and directed edges which appear naturally in many real-world networks, such as the SNS networks and computer communication networks. (condensed matter: structural, mechanical, and thermal properties)

Dynamics of an SAITS alcoholism model on unweighted and weighted networks

Science.gov (United States)

Huo, Hai-Feng; Cui, Fang-Fang; Xiang, Hong

2018-04-01

A novel SAITS alcoholism model on networks is introduced, in which alcoholics are divided into light problem alcoholics and heavy problem alcoholics. Susceptible individuals can enter into the compartment of heavy problem alcoholics directly by contacting with light problem alcoholics or heavy problem alcoholics and the heavy problem alcoholics who receive treatment can relapse into the compartment of heavy problem alcoholics are also considered. First, the dynamics of our model on unweighted networks, including the basic reproduction number, existence and stability of equilibria are studied. Second, the models with fixed weighted and adaptive weighted networks are introduced and investigated. At last, some simulations are presented to illustrate and extend our results. Our results show that it is very important to treat alcoholics to quit the drinking.

Diamond network: template-free fabrication and properties.

Science.gov (United States)

Zhuang, Hao; Yang, Nianjun; Fu, Haiyuan; Zhang, Lei; Wang, Chun; Huang, Nan; Jiang, Xin

2015-03-11

A porous diamond network with three-dimensionally interconnected pores is of technical importance but difficult to be produced. In this contribution, we demonstrate a simple, controllable, and "template-free" approach to fabricate diamond networks. It combines the deposition of diamond/β-SiC nanocomposite film with a wet-chemical selective etching of the β-SiC phase. The porosity of these networks was tuned from 15 to 68%, determined by the ratio of the β-SiC phase in the composite films. The electrochemical working potential and the reactivity of redox probes on the diamond networks are similar to those of a flat nanocrystalline diamond film, while their surface areas are hundreds of times larger than that of a flat diamond film (e.g., 490-fold enhancement for a 3 μm thick diamond network). The marriage of the unprecedented physical/chemical features of diamond with inherent advantages of the porous structure makes the diamond network a potential candidate for various applications such as water treatment, energy conversion (batteries or fuel cells), and storage (capacitors), as well as electrochemical and biochemical sensing.

Robustness of networks against propagating attacks under vaccination strategies

International Nuclear Information System (INIS)

Hasegawa, Takehisa; Masuda, Naoki

2011-01-01

We study the effect of vaccination on the robustness of networks against propagating attacks that obey the susceptible–infected–removed model. By extending the generating function formalism developed by Newman (2005 Phys. Rev. Lett. 95 108701), we analytically determine the robustness of networks that depends on the vaccination parameters. We consider the random defense where nodes are vaccinated randomly and the degree-based defense where hubs are preferentially vaccinated. We show that, when vaccines are inefficient, the random graph is more robust against propagating attacks than the scale-free network. When vaccines are relatively efficient, the scale-free network with the degree-based defense is more robust than the random graph with the random defense and the scale-free network with the random defense

Scaling laws for nonintercommuting cosmic string networks

International Nuclear Information System (INIS)

Martins, C.J.A.P.

2004-01-01

We study the evolution of noninteracting and entangled cosmic string networks in the context of the velocity-dependent one-scale model. Such networks may be formed in several contexts, including brane inflation. We show that the frozen network solution L∝a, although generic, is only a transient one, and that the asymptotic solution is still L∝t as in the case of ordinary (intercommuting) strings, although in the present context the universe will usually be string dominated. Thus the behavior of two strings when they cross does not seem to affect their scaling laws, but only their densities relative to the background

Detecting community structure using label propagation with consensus weight in complex network

International Nuclear Information System (INIS)

Liang Zong-Wen; Li Jian-Ping; Yang Fan; Petropulu Athina

2014-01-01

Community detection is a fundamental work to analyse the structural and functional properties of complex networks. The label propagation algorithm (LPA) is a near linear time algorithm to find a good community structure. Despite various subsequent advances, an important issue of this algorithm has not yet been properly addressed. Random update orders within the algorithm severely hamper the stability of the identified community structure. In this paper, we executed the basic label propagation algorithm on networks multiple times, to obtain a set of consensus partitions. Based on these consensus partitions, we created a consensus weighted graph. In this consensus weighted graph, the weight value of the edge was the proportion value that the number of node pairs allocated in the same cluster was divided by the total number of partitions. Then, we introduced consensus weight to indicate the direction of label propagation. In label update steps, by computing the mixing value of consensus weight and label frequency, a node adopted the label which has the maximum mixing value instead of the most frequent one. For extending to different networks, we introduced a proportion parameter to adjust the proportion of consensus weight and label frequency in computing mixing value. Finally, we proposed an approach named the label propagation algorithm with consensus weight (LPAcw), and the experimental results showed that the LPAcw could enhance considerably both the stability and the accuracy of community partitions. (interdisciplinary physics and related areas of science and technology)

Retardative chain transfer in free radical free-radical polymerisations of vinyl neo-decanoate in low molecular weight polyisoprene and toluene

NARCIS (Netherlands)

Monteiro, M.J.; Subramaniam, N.; Taylor, J.R.; Pham, B.T.T.; Tonge, M.P.; Gilbert, R.G.

2001-01-01

The kinetics of free-radical polymerisation of vinyl neo-decanoate (VneoD) and the molecular weight distributions (MWDs) of the polymers formed in the presence and absence of low molecular weight polyisoprene at 50°C under a variety of conditions were investigated. The bulk reaction was successfully

Vertex centrality as a measure of information flow in Italian Corporate Board Networks

Science.gov (United States)

Grassi, Rosanna

2010-06-01

The aim of this article is to investigate the governance models of companies listed on the Italian Stock Exchange by using a network approach, which describes the interlinks between boards of directors. Following mainstream literature, I construct a weighted graph representing the listed companies (vertices) and their relationships (weighted edges), the Corporate Board Network; I then apply three different vertex centrality measures: degree, betweenness and flow betweenness. What emerges from the network construction and by applying the degree centrality is a structure with a large number of connections but not particularly dense, where the presence of a small number of highly connected nodes (hubs) is evident. Then I focus on betweenness and flow betweenness; indeed I expect that these centrality measures may give a representation of the intensity of the relationship between companies, capturing the volume of information flowing from one vertex to another. Finally, I investigate the possible scale-free structure of the network.

Multi-Scale Residual Convolutional Neural Network for Haze Removal of Remote Sensing Images

Directory of Open Access Journals (Sweden)

Hou Jiang

2018-06-01

Full Text Available Haze removal is a pre-processing step that operates on at-sensor radiance data prior to the physically based image correction step to enhance hazy imagery visually. Most current haze removal methods focus on point-to-point operations and utilize information in the spectral domain, without taking consideration of the multi-scale spatial information of haze. In this paper, we propose a multi-scale residual convolutional neural network (MRCNN for haze removal of remote sensing images. MRCNN utilizes 3D convolutional kernels to extract spatial–spectral correlation information and abstract features from surrounding neighborhoods for haze transmission estimation. It takes advantage of dilated convolution to aggregate multi-scale contextual information for the purpose of improving its prediction accuracy. Meanwhile, residual learning is utilized to avoid the loss of weak information while deepening the network. Our experiments indicate that MRCNN performs accurately, achieving an extremely low validation error and testing error. The haze removal results of several scenes of Landsat 8 Operational Land Imager (OLI data show that the visibility of the dehazed images is significantly improved, and the color of recovered surface is consistent with the actual scene. Quantitative analysis proves that the dehazed results of MRCNN are superior to the traditional methods and other networks. Additionally, a comparison to haze-free data illustrates the spectral consistency after haze removal and reveals the changes in the vegetation index.

Free-flight odor tracking in Drosophila is consistent with an optimal intermittent scale-free search.

Directory of Open Access Journals (Sweden)

Andy M Reynolds

2007-04-01

Full Text Available During their trajectories in still air, fruit flies (Drosophila melanogaster explore their landscape using a series of straight flight paths punctuated by rapid 90 degrees body-saccades [1]. Some saccades are triggered by visual expansion associated with collision avoidance. Yet many saccades are not triggered by visual cues, but rather appear spontaneously. Our analysis reveals that the control of these visually independent saccades and the flight intervals between them constitute an optimal scale-free active searching strategy. Two characteristics of mathematical optimality that are apparent during free-flight in Drosophila are inter-saccade interval lengths distributed according to an inverse square law, which does not vary across landscape scale, and 90 degrees saccade angles, which increase the likelihood that territory will be revisited and thereby reduce the likelihood that near-by targets will be missed. We also show that searching is intermittent, such that active searching phases randomly alternate with relocation phases. Behaviorally, this intermittency is reflected in frequently occurring short, slow speed inter-saccade intervals randomly alternating with rarer, longer, faster inter-saccade intervals. Searching patterns that scale similarly across orders of magnitude of length (i.e., scale-free have been revealed in animals as diverse as microzooplankton, bumblebees, albatrosses, and spider monkeys, but these do not appear to be optimised with respect to turning angle, whereas Drosophila free-flight search does. Also, intermittent searching patterns, such as those reported here for Drosophila, have been observed in foragers such as planktivorous fish and ground foraging birds. Our results with freely flying Drosophila may constitute the first reported example of searching behaviour that is both scale-free and intermittent.

Co-evolution of the brand effect and competitiveness in evolving networks

International Nuclear Information System (INIS)

Guo Jin-Li

2014-01-01

The principle that ‘the brand effect is attractive’ underlies the preferential attachment. Here we show that the brand effect is just one dimension of attractiveness. Another dimension is competitiveness. We firstly introduce a general framework that allows us to investigate the competitive aspect of real networks, instead of simply preferring popular nodes. Our model accurately describes the evolution of social and technological networks. The phenomenon that more competitive nodes become richer can help us to understand the evolution of many competitive systems in nature and society. In general, the paper provides an explicit analytical expression of degree distributions of the network. In particular, the model yields a nontrivial time evolution of nodes' properties and the scale-free behavior with exponents depending on the microscopic parameters characterizing the competition rules. Secondly, through theoretical analyses and numerical simulations, we reveal that our model has not only the universality for the homogeneous weighted network, but also the character for the heterogeneous weighted network. Thirdly, we also develop a model based on the profit-driven mechanism. It can better describe the observed phenomenon in enterprise cooperation networks. We show that the standard preferential attachment, the growing random graph, the initial attractiveness model, the fitness model, and weighted networks can all be seen as degenerate cases of our model. (general)

3 x 3 free-space optical router based on crossbar network and its control algorithm

Science.gov (United States)

Hou, Peipei; Sun, Jianfeng; Yu, Zhou; Lu, Wei; Wang, Lijuan; Liu, Liren

2015-08-01

A 3 × 3 free-space optical router, which comprises optical switches and polarizing beam splitter (PBS) and based on crossbar network, is proposed in this paper. A control algorithm for the 3 × 3 free-space optical router is also developed to achieve rapid control without rearrangement. In order to test the performance of the network based on 3 × 3 free-space optical router and that of the algorithm developed for the optical router, experiments are designed. The experiment results show that the interconnection network based on the 3 × 3 free-space optical router has low cross talk, fast connection speed. Under the control of the algorithm developed, a non-block and real free interconnection network is obtained based on the 3 × 3 free-space optical router we proposed.

Chomsky-Schützenberger parsing for weighted multiple context-free languages

Directory of Open Access Journals (Sweden)

Tobias Denkinger

2017-07-01

Full Text Available We prove a Chomsky-Schützenberger representation theorem for multiple context-free languages weighted over complete commutative strong bimonoids. Using this representation we devise a parsing algorithm for a restricted form of those devices.

Information communication on complex networks

International Nuclear Information System (INIS)

Igarashi, Akito; Kawamoto, Hiroki; Maruyama, Takahiro; Morioka, Atsushi; Naganuma, Yuki

2013-01-01

Since communication networks such as the Internet, which is regarded as a complex network, have recently become a huge scale and a lot of data pass through them, the improvement of packet routing strategies for transport is one of the most significant themes in the study of computer networks. It is especially important to find routing strategies which can bear as many traffic as possible without congestion in complex networks. First, using neural networks, we introduce a strategy for packet routing on complex networks, where path lengths and queue lengths in nodes are taken into account within a framework of statistical physics. Secondly, instead of using shortest paths, we propose efficient paths which avoid hubs, nodes with a great many degrees, on scale-free networks with a weight of each node. We improve the heuristic algorithm proposed by Danila et. al. which optimizes step by step routing properties on congestion by using the information of betweenness, the probability of paths passing through a node in all optimal paths which are defined according to a rule, and mitigates the congestion. We confirm the new heuristic algorithm which balances traffic on networks by achieving minimization of the maximum betweenness in much smaller number of iteration steps. Finally, We model virus spreading and data transfer on peer-to-peer (P2P) networks. Using mean-field approximation, we obtain an analytical formulation and emulate virus spreading on the network and compare the results with those of simulation. Moreover, we investigate the mitigation of information traffic congestion in the P2P networks.

Epidemic dynamics and endemic states in complex networks

Science.gov (United States)

Pastor-Satorras, Romualdo; Vespignani, Alessandro

2001-06-01

We study by analytical methods and large scale simulations a dynamical model for the spreading of epidemics in complex networks. In networks with exponentially bounded connectivity we recover the usual epidemic behavior with a threshold defining a critical point below that the infection prevalence is null. On the contrary, on a wide range of scale-free networks we observe the absence of an epidemic threshold and its associated critical behavior. This implies that scale-free networks are prone to the spreading and the persistence of infections whatever spreading rate the epidemic agents might possess. These results can help understanding computer virus epidemics and other spreading phenomena on communication and social networks.

Epidemic dynamics and endemic states in complex networks

International Nuclear Information System (INIS)

Pastor-Satorras, Romualdo; Vespignani, Alessandro

2001-01-01

We study by analytical methods and large scale simulations a dynamical model for the spreading of epidemics in complex networks. In networks with exponentially bounded connectivity we recover the usual epidemic behavior with a threshold defining a critical point below that the infection prevalence is null. On the contrary, on a wide range of scale-free networks we observe the absence of an epidemic threshold and its associated critical behavior. This implies that scale-free networks are prone to the spreading and the persistence of infections whatever spreading rate the epidemic agents might possess. These results can help understanding computer virus epidemics and other spreading phenomena on communication and social networks

Unifying Inference of Meso-Scale Structures in Networks.

Science.gov (United States)

Tunç, Birkan; Verma, Ragini

2015-01-01

Networks are among the most prevalent formal representations in scientific studies, employed to depict interactions between objects such as molecules, neuronal clusters, or social groups. Studies performed at meso-scale that involve grouping of objects based on their distinctive interaction patterns form one of the main lines of investigation in network science. In a social network, for instance, meso-scale structures can correspond to isolated social groupings or groups of individuals that serve as a communication core. Currently, the research on different meso-scale structures such as community and core-periphery structures has been conducted via independent approaches, which precludes the possibility of an algorithmic design that can handle multiple meso-scale structures and deciding which structure explains the observed data better. In this study, we propose a unified formulation for the algorithmic detection and analysis of different meso-scale structures. This facilitates the investigation of hybrid structures that capture the interplay between multiple meso-scale structures and statistical comparison of competing structures, all of which have been hitherto unavailable. We demonstrate the applicability of the methodology in analyzing the human brain network, by determining the dominant organizational structure (communities) of the brain, as well as its auxiliary characteristics (core-periphery).

Unifying Inference of Meso-Scale Structures in Networks.

Directory of Open Access Journals (Sweden)

Birkan Tunç

Full Text Available Networks are among the most prevalent formal representations in scientific studies, employed to depict interactions between objects such as molecules, neuronal clusters, or social groups. Studies performed at meso-scale that involve grouping of objects based on their distinctive interaction patterns form one of the main lines of investigation in network science. In a social network, for instance, meso-scale structures can correspond to isolated social groupings or groups of individuals that serve as a communication core. Currently, the research on different meso-scale structures such as community and core-periphery structures has been conducted via independent approaches, which precludes the possibility of an algorithmic design that can handle multiple meso-scale structures and deciding which structure explains the observed data better. In this study, we propose a unified formulation for the algorithmic detection and analysis of different meso-scale structures. This facilitates the investigation of hybrid structures that capture the interplay between multiple meso-scale structures and statistical comparison of competing structures, all of which have been hitherto unavailable. We demonstrate the applicability of the methodology in analyzing the human brain network, by determining the dominant organizational structure (communities of the brain, as well as its auxiliary characteristics (core-periphery.

COMPLEX NETWORK SIMULATION OF FOREST NETWORK SPATIAL PATTERN IN PEARL RIVER DELTA

Directory of Open Access Journals (Sweden)

Y. Zeng

2017-09-01

Full Text Available Forest network-construction uses for the method and model with the scale-free features of complex network theory based on random graph theory and dynamic network nodes which show a power-law distribution phenomenon. The model is suitable for ecological disturbance by larger ecological landscape Pearl River Delta consistent recovery. Remote sensing and GIS spatial data are available through the latest forest patches. A standard scale-free network node distribution model calculates the area of forest network’s power-law distribution parameter value size; The recent existing forest polygons which are defined as nodes can compute the network nodes decaying index value of the network’s degree distribution. The parameters of forest network are picked up then make a spatial transition to GIS real world models. Hence the connection is automatically generated by minimizing the ecological corridor by the least cost rule between the near nodes. Based on scale-free network node distribution requirements, select the number compared with less, a huge point of aggregation as a future forest planning network’s main node, and put them with the existing node sequence comparison. By this theory, the forest ecological projects in the past avoid being fragmented, scattered disorderly phenomena. The previous regular forest networks can be reduced the required forest planting costs by this method. For ecological restoration of tropical and subtropical in south China areas, it will provide an effective method for the forest entering city project guidance and demonstration with other ecological networks (water, climate network, etc. for networking a standard and base datum.

Three-dimensional motion analysis of the lumbar spine during "free squat" weight lift training.

Science.gov (United States)

Walsh, James C; Quinlan, John F; Stapleton, Robert; FitzPatrick, David P; McCormack, Damian

2007-06-01

Heavy weight lifting using a squat bar is a commonly used athletic training exercise. Previous in vivo motion studies have concentrated on lifting of everyday objects and not on the vastly increased loads that athletes subject themselves to when performing this exercise. Athletes significantly alter their lumbar spinal motion when performing squat lifting at heavy weights. Controlled laboratory study. Forty-eight athletes (28 men, 20 women) performed 6 lifts at 40% maximum, 4 lifts at 60% maximum, and 2 lifts at 80% maximum. The Zebris 3D motion analysis system was used to measure lumbar spine motion. Exercise was performed as a "free" squat and repeated with a weight lifting support belt. Data obtained were analyzed using SAS. A significant decrease (P free squat or when lifting using a support belt in any of the groups studied. Weight lifting using a squat bar causes athletes to significantly hyperextend their lumbar spines at heavier weights. The use of a weight lifting support belt does not significantly alter spinal motion during lifting.

Acute resistance exercise using free weights on aortic wave reflection characteristics.

Science.gov (United States)

Tai, Yu Lun; Gerhart, Hayden; Mayo, Xián; Kingsley, J Derek

2018-01-01

Aortic wave reflection characteristics such as the augmentation index (AIx), wasted left ventricular pressure energy (ΔE w ) and aortic haemodynamics, such as aortic systolic blood pressure (ASBP), strongly predict cardiovascular events. The effects of acute resistance exercise (ARE) using free-weight exercises on these characteristics are unknown. Therefore, we sought to determine the effects of acute free-weight resistance exercise on aortic wave reflection characteristics and aortic haemodynamics in resistance-trained individuals. Fifteen young, healthy resistance-trained (9 ± 3 years) individuals performed two randomized sessions consisting of an acute bout of free-weight resistance exercise (ARE) or a quiet control (CON). The ARE consisted of three sets of 10 repetitions at 75% one repetition maximum for squat, bench press and deadlift. In CON, the participants rested in the supine position for 30 min. Measurements were made at baseline before sessions and 10 min after sessions. A two-way ANOVA was used to compare the effects of condition across time. There were no significant interactions for aortic or brachial blood pressures. Compared to rest, there were significant increases in augmentation pressure (rest: 5·7 ± 3·0 mmHg; recovery: 10·4 ± 5·7 mmHg, P = 0·002), AIx (rest: 116·8 ± 4·2%; recovery: 123·2 ± 8·4%, P = 0·002), AIx normalized at 75 bpm (rest: 5·2 ± 7·6%; recovery: 27·3 ± 13·2%, Pfree-weight exercises may have no effect on aortic and brachial blood pressure but may significantly alter aortic wave reflection characteristics. © 2016 Scandinavian Society of Clinical Physiology and Nuclear Medicine. Published by John Wiley & Sons Ltd.

Efficacy of manual versus free-weight training to improve maximal strength and performance for microgravity conditions.

Science.gov (United States)

Behringer, Michael; Schüren, Thomas; McCourt, Molly; Mester, Joachim

2016-01-01

We tested a simple and compact device designed for manual resistance training in conditions of microgravity (Self-Powered Rope Trainer Duo (SPoRT Duo)) to increase muscle performance. Twenty-four participants (20.8 ± 2.1 years) were randomly assigned to a manual resistance group (n = 12) and a free-weight group (n = 12). Participants performed eight exercises (three sets; 8-12 efforts) either with free weights or the SPoRT Duo twice a week for 6 weeks. Maximal isometric force of trunk flexion, back extension and chest press increased (P at least 0.01, d at least 0.52) both in the manual resistance group (18.4% ± 15.0%; 32.7% ± 22.7%; 15.3% ± 9.7%) and free-weight group (18.0% ± 13.9%; 26.6% ± 28.9%; 13.3% ± 7.6%). The change in maximal isometric force of wide grip row in both groups (d at best 0.38) did not reach statistical significance (P at best 0.08). The squat one-repetition-maximum increased in the manual resistance group (29.8% ± 22.1%) and the free-weight group (32.4% ± 26.6%). Jump height, determined by a jump-and-reach test, increased in the free-weight group (9.8% ± 13.2%) but not in the manual resistance group (2.0% ± 8.5%). Manual resistance training was equally effective in increasing strength as traditional resistance training with free weights. This apparatus is a useful addition to current in-flight exercise systems.

Concordance of In-Home "Smart" Scale Measurement with Body Weight Measured In-Person.

Science.gov (United States)

Ross, Kathryn M; Wing, Rena R

2016-06-01

Newer "smart" scales that transmit participants' body weights directly to data collection centers offer the opportunity to simplify weight assessment in weight management research; however, little data exist on the concordance of these data compared to weights measured at in-person assessments. We compared the weights of 58 participants (mean±SD BMI = 31.6±4.8, age = 52.1±9.7 years, 86.2% White, 65.5% Female) measured by study staff at an in-person assessment visit to weights measured on the same day at home using BodyTrace "smart" scales. These measures occurred after 3 months of an internet-based weight management intervention. Weight (mean±SD) measured at the 3-month in-person assessment visit was 81.5±14.7kg compared to 80.4±14.5kg measured on the same day using in-home body weight scales; mean bias =1.1±0.8kg, 95% limits of agreement = -0.5 to 2.6. Two outliers in the data suggest that there may be greater variability between measurements for participants weighing above 110 kg. Results suggest good concordance between the measurements and support the use of the BodyTrace smart scale in weight management research. Future trials using BodyTrace scales for outcome assessment should clearly define protocols for measurement and associated instructions to participants (e.g., instruct individuals to weigh at the same time of day, similarly clothed). Finally, measure concordance should be investigated in a group of individuals weighing more than 110kg.

Multifractal analysis of complex networks

International Nuclear Information System (INIS)

Wang Dan-Ling; Yu Zu-Guo; Anh V

2012-01-01

Complex networks have recently attracted much attention in diverse areas of science and technology. Many networks such as the WWW and biological networks are known to display spatial heterogeneity which can be characterized by their fractal dimensions. Multifractal analysis is a useful way to systematically describe the spatial heterogeneity of both theoretical and experimental fractal patterns. In this paper, we introduce a new box-covering algorithm for multifractal analysis of complex networks. This algorithm is used to calculate the generalized fractal dimensions D q of some theoretical networks, namely scale-free networks, small world networks, and random networks, and one kind of real network, namely protein—protein interaction networks of different species. Our numerical results indicate the existence of multifractality in scale-free networks and protein—protein interaction networks, while the multifractal behavior is not clear-cut for small world networks and random networks. The possible variation of D q due to changes in the parameters of the theoretical network models is also discussed. (general)

Green IGP Link Weights for Energy-efficiency and Load-balancing in IP Backbone Networks

OpenAIRE

Francois, Frederic; Wang, Ning; Moessner, Klaus; Georgoulas, Stylianos; Xu, Ke

2013-01-01

The energy consumption of backbone networks has become a primary concern for network operators and regulators due to the pervasive deployment of wired backbone networks to meet the requirements of bandwidth-hungry applications. While traditional optimization of IGP link weights has been used in IP based load-balancing operations, in this paper we introduce a novel link weight setting algorithm, the Green Load-balancing Algorithm (GLA), which is able to jointly optimize both energy efficiency ...

Group Centric Networking: Large Scale Over the Air Testing of Group Centric Networking

Science.gov (United States)

2016-11-01

Large Scale Over-the-Air Testing of Group Centric Networking Logan Mercer, Greg Kuperman, Andrew Hunter, Brian Proulx MIT Lincoln Laboratory...performance of Group Centric Networking (GCN), a networking protocol developed for robust and scalable communications in lossy networks where users are...devices, and the ad-hoc nature of the network . Group Centric Networking (GCN) is a proposed networking protocol that addresses challenges specific to

Emergence, evolution and scaling of online social networks.

Science.gov (United States)

Wang, Le-Zhi; Huang, Zi-Gang; Rong, Zhi-Hai; Wang, Xiao-Fan; Lai, Ying-Cheng

2014-01-01

Online social networks have become increasingly ubiquitous and understanding their structural, dynamical, and scaling properties not only is of fundamental interest but also has a broad range of applications. Such networks can be extremely dynamic, generated almost instantaneously by, for example, breaking-news items. We investigate a common class of online social networks, the user-user retweeting networks, by analyzing the empirical data collected from Sina Weibo (a massive twitter-like microblogging social network in China) with respect to the topic of the 2011 Japan earthquake. We uncover a number of algebraic scaling relations governing the growth and structure of the network and develop a probabilistic model that captures the basic dynamical features of the system. The model is capable of reproducing all the empirical results. Our analysis not only reveals the basic mechanisms underlying the dynamics of the retweeting networks, but also provides general insights into the control of information spreading on such networks.

Emergence, evolution and scaling of online social networks.

Directory of Open Access Journals (Sweden)

Le-Zhi Wang

Full Text Available Online social networks have become increasingly ubiquitous and understanding their structural, dynamical, and scaling properties not only is of fundamental interest but also has a broad range of applications. Such networks can be extremely dynamic, generated almost instantaneously by, for example, breaking-news items. We investigate a common class of online social networks, the user-user retweeting networks, by analyzing the empirical data collected from Sina Weibo (a massive twitter-like microblogging social network in China with respect to the topic of the 2011 Japan earthquake. We uncover a number of algebraic scaling relations governing the growth and structure of the network and develop a probabilistic model that captures the basic dynamical features of the system. The model is capable of reproducing all the empirical results. Our analysis not only reveals the basic mechanisms underlying the dynamics of the retweeting networks, but also provides general insights into the control of information spreading on such networks.

Tree-average distances on certain phylogenetic networks have their weights uniquely determined.

Science.gov (United States)

Willson, Stephen J

2012-01-01

A phylogenetic network N has vertices corresponding to species and arcs corresponding to direct genetic inheritance from the species at the tail to the species at the head. Measurements of DNA are often made on species in the leaf set, and one seeks to infer properties of the network, possibly including the graph itself. In the case of phylogenetic trees, distances between extant species are frequently used to infer the phylogenetic trees by methods such as neighbor-joining. This paper proposes a tree-average distance for networks more general than trees. The notion requires a weight on each arc measuring the genetic change along the arc. For each displayed tree the distance between two leaves is the sum of the weights along the path joining them. At a hybrid vertex, each character is inherited from one of its parents. We will assume that for each hybrid there is a probability that the inheritance of a character is from a specified parent. Assume that the inheritance events at different hybrids are independent. Then for each displayed tree there will be a probability that the inheritance of a given character follows the tree; this probability may be interpreted as the probability of the tree. The tree-average distance between the leaves is defined to be the expected value of their distance in the displayed trees. For a class of rooted networks that includes rooted trees, it is shown that the weights and the probabilities at each hybrid vertex can be calculated given the network and the tree-average distances between the leaves. Hence these weights and probabilities are uniquely determined. The hypotheses on the networks include that hybrid vertices have indegree exactly 2 and that vertices that are not leaves have a tree-child.

Elastic band prediction equations for combined free-weight and elastic band bench presses and squats.

Science.gov (United States)

Shoepe, Todd C; Ramirez, David A; Almstedt, Hawley C

2010-01-01

Elastic bands added to traditional free-weight techniques have become a part of suggested training routines in recent years. Because of the variable loading patterns of elastic bands (i.e., greater stretch produces greater resistance), it is necessary to quantify the exact loading patterns of bands to identify the volume and intensity of training. The purpose of this study was to determine the length vs. tension properties of multiple sizes of a set of commonly used elastic bands to quantify the resistance that would be applied to free-weight plus elastic bench presses (BP) and squats (SQ). Five elastic bands of varying thickness were affixed to an overhead support beam. Dumbbells of varying weights were progressively added to the free end while the linear deformation was recorded with each subsequent weight increment. The resistance was plotted as a factor of linear deformation, and best-fit nonlinear logarithmic regression equations were then matched to the data. For both the BP and SQ loading conditions and all band thicknesses tested, R values were greater than 0.9623. These data suggest that differences in load exist as a result of the thickness of the elastic band, attachment technique, and type of exercise being performed. Facilities should adopt their own form of loading quantification to match their unique set of circumstances when acquiring, researching, and implementing elastic band and free-weight exercises into the training programs.

Degree and connectivity of the Internet's scale-free topology

International Nuclear Information System (INIS)

Zhang Lian-Ming; Wu Xiang-Sheng; Deng Xiao-Heng; Yu Jian-Ping

2011-01-01

This paper theoretically and empirically studies the degree and connectivity of the Internet's scale-free topology at an autonomous system (AS) level. The basic features of scale-free networks influence the normalization constant of degree distribution p(k). It develops a new mathematic model for describing the power-law relationships of Internet topology. From this model we theoretically obtain formulas to calculate the average degree, the ratios of the k min -degree (minimum degree) nodes and the k max -degree (maximum degree) nodes, and the fraction of the degrees (or links) in the hands of the richer (top best-connected) nodes. It finds that the average degree is larger for a smaller power-law exponent λ and a larger minimum or maximum degree. The ratio of the k min -degree nodes is larger for larger λ and smaller k min or k max . The ratio of the k max -degree ones is larger for smaller λ and k max or larger k min . The richer nodes hold most of the total degrees of Internet AS-level topology. In addition, it is revealed that the increased rate of the average degree or the ratio of the k min -degree nodes has power-law decay with the increase of k min . The ratio of the k max -degree nodes has a power-law decay with the increase of k max , and the fraction of the degrees in the hands of the richer 27% nodes is about 73% (the ‘73/27 rule’). Finally, empirically calculations are made, based on the empirical data extracted from the Border Gateway Protocol, of the average degree, ratio and fraction using this method and other methods, and find that this method is rigorous and effective for Internet AS-level topology. (interdisciplinary physics and related areas of science and technology)

Large-scale networks in engineering and life sciences

CERN Document Server

Findeisen, Rolf; Flockerzi, Dietrich; Reichl, Udo; Sundmacher, Kai

2014-01-01

This edited volume provides insights into and tools for the modeling, analysis, optimization, and control of large-scale networks in the life sciences and in engineering. Large-scale systems are often the result of networked interactions between a large number of subsystems, and their analysis and control are becoming increasingly important. The chapters of this book present the basic concepts and theoretical foundations of network theory and discuss its applications in different scientific areas such as biochemical reactions, chemical production processes, systems biology, electrical circuits, and mobile agents. The aim is to identify common concepts, to understand the underlying mathematical ideas, and to inspire discussions across the borders of the various disciplines.  The book originates from the interdisciplinary summer school “Large Scale Networks in Engineering and Life Sciences” hosted by the International Max Planck Research School Magdeburg, September 26-30, 2011, and will therefore be of int...

Topology and computational performance of attractor neural networks

International Nuclear Information System (INIS)

McGraw, Patrick N.; Menzinger, Michael

2003-01-01

To explore the relation between network structure and function, we studied the computational performance of Hopfield-type attractor neural nets with regular lattice, random, small-world, and scale-free topologies. The random configuration is the most efficient for storage and retrieval of patterns by the network as a whole. However, in the scale-free case retrieval errors are not distributed uniformly among the nodes. The portion of a pattern encoded by the subset of highly connected nodes is more robust and efficiently recognized than the rest of the pattern. The scale-free network thus achieves a very strong partial recognition. The implications of these findings for brain function and social dynamics are suggestive

Gain and exposure scheduling to compensate for photorefractive neural-network weight decay

Science.gov (United States)

Goldstein, Adam A.; Petrisor, Gregory C.; Jenkins, B. Keith

1995-03-01

A gain and exposure schedule that theoretically eliminates the effect of photorefractive weight decay for the general class of outer-product neural-network learning algorithms (e.g., backpropagation, Widrow-Hoff, perceptron) is presented. This schedule compensates for photorefractive diffraction-efficiency decay by iteratively increasing the spatial-light-modulator transfer function gain and decreasing the weight-update exposure time. Simulation results for the scheduling procedure, as applied to backpropagation learning for the exclusive-OR problem, show improved learning performance compared with results for networks trained without scheduling.

The Multi-Scale Network Landscape of Collaboration.

Science.gov (United States)

Bae, Arram; Park, Doheum; Ahn, Yong-Yeol; Park, Juyong

2016-01-01

Propelled by the increasing availability of large-scale high-quality data, advanced data modeling and analysis techniques are enabling many novel and significant scientific understanding of a wide range of complex social, natural, and technological systems. These developments also provide opportunities for studying cultural systems and phenomena--which can be said to refer to all products of human creativity and way of life. An important characteristic of a cultural product is that it does not exist in isolation from others, but forms an intricate web of connections on many levels. In the creation and dissemination of cultural products and artworks in particular, collaboration and communication of ideas play an essential role, which can be captured in the heterogeneous network of the creators and practitioners of art. In this paper we propose novel methods to analyze and uncover meaningful patterns from such a network using the network of western classical musicians constructed from a large-scale comprehensive Compact Disc recordings data. We characterize the complex patterns in the network landscape of collaboration between musicians across multiple scales ranging from the macroscopic to the mesoscopic and microscopic that represent the diversity of cultural styles and the individuality of the artists.

Aggregated Representation of Distribution Networks for Large-Scale Transmission Network Simulations

DEFF Research Database (Denmark)

Göksu, Ömer; Altin, Müfit; Sørensen, Poul Ejnar

2014-01-01

As a common practice of large-scale transmission network analysis the distribution networks have been represented as aggregated loads. However, with increasing share of distributed generation, especially wind and solar power, in the distribution networks, it became necessary to include...... the distributed generation within those analysis. In this paper a practical methodology to obtain aggregated behaviour of the distributed generation is proposed. The methodology, which is based on the use of the IEC standard wind turbine models, is applied on a benchmark distribution network via simulations....

How to construct the statistic network? An association network of herbaceous

Directory of Open Access Journals (Sweden)

WenJun Zhang

2012-06-01

constructed network increases. Network compactness also follows the trend. In addition, as the increase of network compactness and connectance, the portion and number of negative association declines dramatically.(2 In an association (interaction network, only a few connections follow the linear relationship. Most connections follow the quasi-linear or non-linear relationships. (3 The association networks constructed from partial linear correlation and linear correlation measures are generally scale-free complex networks. The degree of these networks is power low distributed. (4 Isolated species (families, etc. are likely important in the statistic network. They are the sink species for shaping new network after a community is seriously disturbed. (5 Beween-taxa connections at higher taxonomic level are generally weaker than that at lower taxonomic level.

Weight bias internalization across weight categories among school-aged children. Validation of the Weight Bias Internalization Scale for Children.

Science.gov (United States)

Zuba, Anna; Warschburger, Petra

2018-06-01

Anti-fat bias is widespread and is linked to the internalization of weight bias and psychosocial problems. The purpose of this study was to examine the internalization of weight bias among children across weight categories and to evaluate the psychometric properties of the Weight Bias Internalization Scale for Children (WBIS-C). Data were collected from 1484 primary school children and their parents. WBIS-C demonstrated good internal consistency (α = .86) after exclusion of Item 1. The unitary factor structure was supported using exploratory and confirmatory factor analyses (factorial validity). Girls and overweight children reported higher WBIS-C scores in comparison to boys and non-overweight peers (known-groups validity). Convergent validity was shown by significant correlations with psychosocial problems. Internalization of weight bias explained additional variance in different indicators of psychosocial well-being. The results suggest that the WBIS-C is a psychometrically sound and informative tool to assess weight bias internalization among children. Copyright © 2018 Elsevier Ltd. All rights reserved.

Spatiotemporal Scaling Effect on Rainfall Network Design Using Entropy

Directory of Open Access Journals (Sweden)

Chiang Wei

2014-08-01

Full Text Available Because of high variation in mountainous areas, rainfall data at different spatiotemporal scales may yield potential uncertainty for network design. However, few studies focus on the scaling effect on both the spatial and the temporal scale. By calculating the maximum joint entropy of hourly typhoon events, monthly, six dry and wet months and annual rainfall between 1992 and 2012 for 1-, 3-, and 5-km grids, the relocated candidate rain gauges in the National Taiwan University Experimental Forest of Central Taiwan are prioritized. The results show: (1 the network exhibits different locations for first prioritized candidate rain gauges for different spatiotemporal scales; (2 the effect of spatial scales is insignificant compared to temporal scales; and (3 a smaller number and a lower percentage of required stations (PRS reach stable joint entropy for a long duration at finer spatial scale. Prioritized candidate rain gauges provide key reference points for adjusting the network to capture more accurate information and minimize redundancy.

Scaling of Airborne Ad-hoc Network Metrics with Link Range and Satellite Connectivity

Directory of Open Access Journals (Sweden)

Kai-Daniel BÜCHTER

2018-06-01

Full Text Available In this contribution, large-scale commercial aeronautical ad-hoc networks are evaluated. The investigation is based on a simulation environment with input from 2016 flight schedule and aircraft performance databases for flight movement modelling, along with a defined infrastructure of ground gateways and communication satellites. A cluster-based algorithm is used to build the communication network topology between aircraft. Cloud top pressure data can be considered to estimate cloud height and evaluate the impact of link obscuration on network availability, assuming a free-space optics-based communication network. The effects of communication range, satellite availability, fleet equipage ratio and clouds are discussed. It is shown how network reach and performance can be enhanced by adding taps to the network in the form of high-speed satellite links. The effect of adding these is two-fold: firstly, network reach can be increased by connecting remote aircraft clusters. Secondly, larger clusters can effectively be split into smaller ones in order to increase performance especially with regard to hop count and available overall capacity. In a realistic scenario concerning communication range and with moderate numbers of high-speed satellite terminals, on average, 78% of all widebody aircraft can be reached. With clouds considered (assuming laser links, this number reduces by 10%.

A numerical procedure for transient free surface seepage through fracture networks

Science.gov (United States)

Jiang, Qinghui; Ye, Zuyang; Zhou, Chuangbing

2014-11-01

A parabolic variational inequality (PVI) formulation is presented for the transient free surface seepage problem defined for a whole fracture network. Because the seepage faces are specified as Signorini-type conditions, the PVI formulation can effectively eliminate the singularity of spillpoints that evolve with time. By introducing a continuous penalty function to replace the original Heaviside function, a finite element procedure based on the PVI formulation is developed to predict the transient free surface response in the fracture network. The effects of the penalty parameter on the solution precision are analyzed. A relative error formula for evaluating the flow losses at steady state caused by the penalty parameter is obtained. To validate the proposed method, three typical examples are solved. The solutions for the first example are compared with the experimental results. The results from the last two examples further demonstrate that the orientation, extent and density of fractures significantly affect the free surface seepage behavior in the fracture network.

Anchor-Free Localization Method for Mobile Targets in Coal Mine Wireless Sensor Networks

Directory of Open Access Journals (Sweden)

Xiao Xu

2009-04-01

Full Text Available Severe natural conditions and complex terrain make it difficult to apply precise localization in underground mines. In this paper, an anchor-free localization method for mobile targets is proposed based on non-metric multi-dimensional scaling (Multi-dimensional Scaling: MDS and rank sequence. Firstly, a coal mine wireless sensor network is constructed in underground mines based on the ZigBee technology. Then a non-metric MDS algorithm is imported to estimate the reference nodes’ location. Finally, an improved sequence-based localization algorithm is presented to complete precise localization for mobile targets. The proposed method is tested through simulations with 100 nodes, outdoor experiments with 15 ZigBee physical nodes, and the experiments in the mine gas explosion laboratory with 12 ZigBee nodes. Experimental results show that our method has better localization accuracy and is more robust in underground mines.

Anchor-free localization method for mobile targets in coal mine wireless sensor networks.

Science.gov (United States)

Pei, Zhongmin; Deng, Zhidong; Xu, Shuo; Xu, Xiao

2009-01-01

Severe natural conditions and complex terrain make it difficult to apply precise localization in underground mines. In this paper, an anchor-free localization method for mobile targets is proposed based on non-metric multi-dimensional scaling (Multi-dimensional Scaling: MDS) and rank sequence. Firstly, a coal mine wireless sensor network is constructed in underground mines based on the ZigBee technology. Then a non-metric MDS algorithm is imported to estimate the reference nodes' location. Finally, an improved sequence-based localization algorithm is presented to complete precise localization for mobile targets. The proposed method is tested through simulations with 100 nodes, outdoor experiments with 15 ZigBee physical nodes, and the experiments in the mine gas explosion laboratory with 12 ZigBee nodes. Experimental results show that our method has better localization accuracy and is more robust in underground mines.

Resolving anatomical and functional structure in human brain organization: identifying mesoscale organization in weighted network representations.

Science.gov (United States)

Lohse, Christian; Bassett, Danielle S; Lim, Kelvin O; Carlson, Jean M

2014-10-01

Human brain anatomy and function display a combination of modular and hierarchical organization, suggesting the importance of both cohesive structures and variable resolutions in the facilitation of healthy cognitive processes. However, tools to simultaneously probe these features of brain architecture require further development. We propose and apply a set of methods to extract cohesive structures in network representations of brain connectivity using multi-resolution techniques. We employ a combination of soft thresholding, windowed thresholding, and resolution in community detection, that enable us to identify and isolate structures associated with different weights. One such mesoscale structure is bipartivity, which quantifies the extent to which the brain is divided into two partitions with high connectivity between partitions and low connectivity within partitions. A second, complementary mesoscale structure is modularity, which quantifies the extent to which the brain is divided into multiple communities with strong connectivity within each community and weak connectivity between communities. Our methods lead to multi-resolution curves of these network diagnostics over a range of spatial, geometric, and structural scales. For statistical comparison, we contrast our results with those obtained for several benchmark null models. Our work demonstrates that multi-resolution diagnostic curves capture complex organizational profiles in weighted graphs. We apply these methods to the identification of resolution-specific characteristics of healthy weighted graph architecture and altered connectivity profiles in psychiatric disease.

Identification of influential spreaders in online social networks using interaction weighted K-core decomposition method

Science.gov (United States)

Al-garadi, Mohammed Ali; Varathan, Kasturi Dewi; Ravana, Sri Devi

2017-02-01

Online social networks (OSNs) have become a vital part of everyday living. OSNs provide researchers and scientists with unique prospects to comprehend individuals on a scale and to analyze human behavioral patterns. Influential spreaders identification is an important subject in understanding the dynamics of information diffusion in OSNs. Targeting these influential spreaders is significant in planning the techniques for accelerating the propagation of information that is useful for various applications, such as viral marketing applications or blocking the diffusion of annoying information (spreading of viruses, rumors, online negative behaviors, and cyberbullying). Existing K-core decomposition methods consider links equally when calculating the influential spreaders for unweighted networks. Alternatively, the proposed link weights are based only on the degree of nodes. Thus, if a node is linked to high-degree nodes, then this node will receive high weight and is treated as an important node. Conversely, the degree of nodes in OSN context does not always provide accurate influence of users. In the present study, we improve the K-core method for OSNs by proposing a novel link-weighting method based on the interaction among users. The proposed method is based on the observation that the interaction of users is a significant factor in quantifying the spreading capability of user in OSNs. The tracking of diffusion links in the real spreading dynamics of information verifies the effectiveness of our proposed method for identifying influential spreaders in OSNs as compared with degree centrality, PageRank, and original K-core.

9 CFR 442.3 - Scale requirements for accurate weights, repairs, adjustments, and replacements after inspection.

Science.gov (United States)

2010-01-01

... 9 Animals and Animal Products 2 2010-01-01 2010-01-01 false Scale requirements for accurate... PROCEDURES AND REQUIREMENTS FOR ACCURATE WEIGHTS § 442.3 Scale requirements for accurate weights, repairs, adjustments, and replacements after inspection. (a) All scales used to determine the net weight of meat and...

Effects of Vertex Activity and Self-organized Criticality Behavior on a Weighted Evolving Network

International Nuclear Information System (INIS)

Zhang Guiqing; Yang Qiuying; Chen Tianlun

2008-01-01

Effects of vertex activity have been analyzed on a weighted evolving network. The network is characterized by the probability distribution of vertex strength, each edge weight and evolution of the strength of vertices with different vertex activities. The model exhibits self-organized criticality behavior. The probability distribution of avalanche size for different network sizes is also shown. In addition, there is a power law relation between the size and the duration of an avalanche and the average of avalanche size has been studied for different vertex activities

Application of cool wan flow control weight scale design on belt conveyor

International Nuclear Information System (INIS)

Djokorayono, Rony; Junus; Rivai, A; Gunarwan; Indarzah

2003-01-01

Control of the coal mass flow on the belt conveyor at coal handling unit PLTU Suralaya has been designed by using weight scale of gamma absorption technique where accuracy for the measurement of weight scale system is 0,5% to 0,1%. The absorption gamma radiation will be measured by scintillation or ion chamber detector

The impact of an online social network with wireless monitoring devices on physical activity and weight loss.

Science.gov (United States)

Greene, Jessica; Sacks, Rebecca; Piniewski, Brigitte; Kil, David; Hahn, Jin S

2013-07-01

Online social networks (OSNs) are a new, promising approach for catalyzing health-related behavior change. To date, the empirical evidence on their impact has been limited. Using a randomized trial, we assessed the impact of a health-oriented OSN with accelerometer and scales on participant's physical activity, weight, and clinical indicators. A sample of 349 PeaceHealth Oregon employees and family members were randomized to the iWell OSN or a control group and followed for 6 months in 2010-2011. The iWell OSN enabled participants to connect with "friends," make public postings, view contacts' postings, set goals, download the number of their steps from an accelerometer and their weight from a scale, view trends in physical activity and weight, and compete against others in physical activity. Both control and intervention participants received traditional education material on diet and physical activity. Laboratory data on weight and clinical indicators (triglycerides, high-density lipoprotein, or low-density lipoprotein), and self-reported data on physical activity, were collected at baseline, 3 months, and 6 months. At 6 months, the intervention group increased leisure walking minutes by 164% compared with 47% in the control group. The intervention group also lost more weight than the controls (5.2 pounds compared with 1.5 pounds). There were no observed significant differences in vigorous exercise or clinical indicators between the 2 groups. Among intervention participants, greater OSN use, as measured by number of private messages sent, was associated with a greater increase in leisure walking and greater weight reduction over the study period. The study provides evidence that interventions using OSNs can successfully promote increases in physical activity and weight loss.

Conflict free network coding for distributed storage networks

KAUST Repository

Al-Habob, Ahmed A.

2015-06-01

© 2015 IEEE. In this paper, we design a conflict free instantly decodable network coding (IDNC) solution for file download from distributed storage servers. Considering previously downloaded files at the clients from these servers as side information, IDNC can speed up the current download process. However, transmission conflicts can occur since multiple servers can simultaneously send IDNC combinations of files to the same client, which can tune to only one of them at a time. To avoid such conflicts and design more efficient coded download patterns, we propose a dual conflict IDNC graph model, which extends the conventional IDNC graph model in order to guarantee conflict free server transmissions to each of the clients. We then formulate the download time minimization problem as a stochastic shortest path problem whose action space is defined by the independent sets of this new graph. Given the intractability of the solution, we design a channel-aware heuristic algorithm and show that it achieves a considerable reduction in the file download time, compared to applying the conventional IDNC approach separately at each of the servers.

A Network Contention Model for the Extreme-scale Simulator

Energy Technology Data Exchange (ETDEWEB)

Engelmann, Christian [ORNL; Naughton III, Thomas J [ORNL

2015-01-01

The Extreme-scale Simulator (xSim) is a performance investigation toolkit for high-performance computing (HPC) hardware/software co-design. It permits running a HPC application with millions of concurrent execution threads, while observing its performance in a simulated extreme-scale system. This paper details a newly developed network modeling feature for xSim, eliminating the shortcomings of the existing network modeling capabilities. The approach takes a different path for implementing network contention and bandwidth capacity modeling using a less synchronous and accurate enough model design. With the new network modeling feature, xSim is able to simulate on-chip and on-node networks with reasonable accuracy and overheads.

Your Health Buddies Matter: Preferential Selection and Social Influence on Weight Management in an Online Health Social Network.

Science.gov (United States)

Meng, Jingbo

2016-12-01

A growing number of online social networks are designed with the intention to promote health by providing virtual space wherein individuals can seek and share information and support with similar others. Research has shown that real-world social networks have a significant influence on one's health behavior and outcomes. However, there is a dearth of studies on how individuals form social networks in virtual space and whether such online social networks exert any impact on individuals' health outcomes. Built on the Multi-Theoretical Multilevel (MTML) framework and drawing from literature on social influence, this study examined the mechanisms underlying the formation of an online health social network and empirically tested social influence on individual health outcomes through the network. Situated in a weight management social networking site, the study tracked a health buddy network of 709 users and their weight management activities and outcomes for 4 months. Actor-based modeling was used to test the joint dynamics of preferential selection and social influence among health buddies. The results showed that baseline, inbreeding, and health status homophily significantly predicted preferential selection of health buddies in the weight management social networking site, whereas self-interest in seeking experiential health information did not. The study also found peer influence of online health buddy networks on individual weight outcomes, such that an individual's odds of losing weight increased if, on average, the individual's health buddies were losing weight.

Optimal topologies for maximizing network transmission capacity

Science.gov (United States)

Chen, Zhenhao; Wu, Jiajing; Rong, Zhihai; Tse, Chi K.

2018-04-01

It has been widely demonstrated that the structure of a network is a major factor that affects its traffic dynamics. In this work, we try to identify the optimal topologies for maximizing the network transmission capacity, as well as to build a clear relationship between structural features of a network and the transmission performance in terms of traffic delivery. We propose an approach for designing optimal network topologies against traffic congestion by link rewiring and apply them on the Barabási-Albert scale-free, static scale-free and Internet Autonomous System-level networks. Furthermore, we analyze the optimized networks using complex network parameters that characterize the structure of networks, and our simulation results suggest that an optimal network for traffic transmission is more likely to have a core-periphery structure. However, assortative mixing and the rich-club phenomenon may have negative impacts on network performance. Based on the observations of the optimized networks, we propose an efficient method to improve the transmission capacity of large-scale networks.