Growing Brazilian demand to spur gas network in South America

International Nuclear Information System (INIS)

Deffarges, E.H.; Maurer, L.I.A.

1993-01-01

A recent combination in South America of economic and geopolitical factors is prompting development of a new integrated gas-pipeline network in the continent's Southern Cone. The crucial factors include privatization, regional integration, economic growth, and environmental concerns. The area, Latin America's largest regional entity, includes Brazil (population 150 million and a 1990 GNP of about $375 billion, 9th largest in the world), Argentina (population 32 million and the third largest Latin American economy after Brazil and Mexico), Bolivia, Chile, Paraguay, and Uruguay. Argentina, Brazil, Paraguay, and Uruguay are members of the MercoSur economic bloc whose objective is to develop free trade in the region. There are very few integrated pipeline networks in the world. Besides the giant North American system, with hundreds of producers and pipelines, there is only one other large integrated network. It connects continental European countries to their outside suppliers such as Norway, the C.I.S., and Algeria. The emergence of a new pipeline system is therefore important for the natural-gas industry worldwide and even more so if it occurs in a region now growing rapidly after a decade of economic difficulties

Growing Homophilic Networks Are Natural Navigable Small Worlds.

Science.gov (United States)

Malkov, Yury A; Ponomarenko, Alexander

2016-01-01

Navigability, an ability to find a logarithmically short path between elements using only local information, is one of the most fascinating properties of real-life networks. However, the exact mechanism responsible for the formation of navigation properties remained unknown. We show that navigability can be achieved by using only two ingredients present in the majority of networks: network growth and local homophily, giving a persuasive answer how the navigation appears in real-life networks. A very simple algorithm produces hierarchical self-similar optimally wired navigable small world networks with exponential degree distribution by using only local information. Adding preferential attachment produces a scale-free network which has shorter greedy paths, but worse (power law) scaling of the information extraction locality (algorithmic complexity of a search). Introducing saturation of the preferential attachment leads to truncated scale-free degree distribution that offers a good tradeoff between these parameters and can be useful for practical applications. Several features of the model are observed in real-life networks, in particular in the brain neural networks, supporting the earlier suggestions that they are navigable.

Growing Homophilic Networks Are Natural Navigable Small Worlds.

Directory of Open Access Journals (Sweden)

Yury A Malkov

Full Text Available Navigability, an ability to find a logarithmically short path between elements using only local information, is one of the most fascinating properties of real-life networks. However, the exact mechanism responsible for the formation of navigation properties remained unknown. We show that navigability can be achieved by using only two ingredients present in the majority of networks: network growth and local homophily, giving a persuasive answer how the navigation appears in real-life networks. A very simple algorithm produces hierarchical self-similar optimally wired navigable small world networks with exponential degree distribution by using only local information. Adding preferential attachment produces a scale-free network which has shorter greedy paths, but worse (power law scaling of the information extraction locality (algorithmic complexity of a search. Introducing saturation of the preferential attachment leads to truncated scale-free degree distribution that offers a good tradeoff between these parameters and can be useful for practical applications. Several features of the model are observed in real-life networks, in particular in the brain neural networks, supporting the earlier suggestions that they are navigable.

Complex growing networks with intrinsic vertex fitness

International Nuclear Information System (INIS)

Bedogne, C.; Rodgers, G. J.

2006-01-01

One of the major questions in complex network research is to identify the range of mechanisms by which a complex network can self organize into a scale-free state. In this paper we investigate the interplay between a fitness linking mechanism and both random and preferential attachment. In our models, each vertex is assigned a fitness x, drawn from a probability distribution ρ(x). In Model A, at each time step a vertex is added and joined to an existing vertex, selected at random, with probability p and an edge is introduced between vertices with fitnesses x and y, with a rate f(x,y), with probability 1-p. Model B differs from Model A in that, with probability p, edges are added with preferential attachment rather than randomly. The analysis of Model A shows that, for every fixed fitness x, the network's degree distribution decays exponentially. In Model B we recover instead a power-law degree distribution whose exponent depends only on p, and we show how this result can be generalized. The properties of a number of particular networks are examined

Neural Network Classifier Based on Growing Hyperspheres

Czech Academy of Sciences Publication Activity Database

Jiřina Jr., Marcel; Jiřina, Marcel

2000-01-01

Roč. 10, č. 3 (2000), s. 417-428 ISSN 1210-0552. [Neural Network World 2000. Prague, 09.07.2000-12.07.2000] Grant - others:MŠMT ČR(CZ) VS96047; MPO(CZ) RP-4210 Institutional research plan: AV0Z1030915 Keywords : neural network * classifier * hyperspheres * big -dimensional data Subject RIV: BA - General Mathematics

On-line identification of hybrid systems using an adaptive growing and pruning RBF neural network

DEFF Research Database (Denmark)

Alizadeh, Tohid

2008-01-01

This paper introduces an adaptive growing and pruning radial basis function (GAP-RBF) neural network for on-line identification of hybrid systems. The main idea is to identify a global nonlinear model that can predict the continuous outputs of hybrid systems. In the proposed approach, GAP......-RBF neural network uses a modified unscented kalman filter (UKF) with forgetting factor scheme as the required on-line learning algorithm. The effectiveness of the resulting identification approach is tested and evaluated on a simulated benchmark hybrid system....

A multivariate extension of mutual information for growing neural networks.

Science.gov (United States)

Ball, Kenneth R; Grant, Christopher; Mundy, William R; Shafer, Timothy J

2017-11-01

Recordings of neural network activity in vitro are increasingly being used to assess the development of neural network activity and the effects of drugs, chemicals and disease states on neural network function. The high-content nature of the data derived from such recordings can be used to infer effects of compounds or disease states on a variety of important neural functions, including network synchrony. Historically, synchrony of networks in vitro has been assessed either by determination of correlation coefficients (e.g. Pearson's correlation), by statistics estimated from cross-correlation histograms between pairs of active electrodes, and/or by pairwise mutual information and related measures. The present study examines the application of Normalized Multiinformation (NMI) as a scalar measure of shared information content in a multivariate network that is robust with respect to changes in network size. Theoretical simulations are designed to investigate NMI as a measure of complexity and synchrony in a developing network relative to several alternative approaches. The NMI approach is applied to these simulations and also to data collected during exposure of in vitro neural networks to neuroactive compounds during the first 12 days in vitro, and compared to other common measures, including correlation coefficients and mean firing rates of neurons. NMI is shown to be more sensitive to developmental effects than first order synchronous and nonsynchronous measures of network complexity. Finally, NMI is a scalar measure of global (rather than pairwise) mutual information in a multivariate network, and hence relies on less assumptions for cross-network comparisons than historical approaches. Copyright © 2017 Elsevier Ltd. All rights reserved.

Structural phase transition in a growing network model with tunable member intimacy

Science.gov (United States)

Kim, Kibum; Jo, Woo Seong; Kim, Beom Jun

2017-05-01

Users of online communities become more intimate in time by writing posts and exchanging comments to each other. Although a certain level of intimacy among a group of members can be beneficial for the activity of the whole community, too strong intimacy among existing members can make newcomers feel alienated, driving them to leave the community. In this letter, we introduce a growing network model in which we systematically study the effect of member intimacy on the formation of connected component of the network. We introduce a parameter called clinginess and control how the member intimacy affects the communication activity. We observe that cumulative number of users who leave the community exhibits a transition-like behavior, similarly to the discontinuous transition in statistical mechanics models. Implication of our result in constructing a sustainable online community is also discussed.

Network Security: Policies and Guidelines for Effective Network Management

Directory of Open Access Journals (Sweden)

Jonathan Gana KOLO

2008-12-01

Full Text Available Network security and management in Information and Communication Technology (ICT is the ability to maintain the integrity of a system or network, its data and its immediate environment. The various innovations and uses to which networks are being put are growing by the day and hence are becoming complex and invariably more difficult to manage by the day. Computers are found in every business such as banking, insurance, hospital, education, manufacturing, etc. The widespread use of these systems implies crime and insecurity on a global scale. In addition, the tremendous benefits brought about by Internet have also widened the scope of crime and insecurity at an alarming rate. Also, ICT has fast become a primary differentiator for institution/organization leaders as it offers effective and convenient means of interaction with each other across the globe. This upsurge in the population of organizations depending on ICT for business transaction has brought with it a growing number of security threats and attacks on poorly managed and secured networks primarily to steal personal data, particularly financial information and password.This paper therefore proposes some policies and guidelines that should be followed by network administrators in organizations to help them ensure effective network management and security of ICT facilities and data.

Cisco Networking Essentials

CERN Document Server

McMillan, Troy

2011-01-01

An engaging approach for anyone beginning a career in networking As the world leader of networking products and services, Cisco products are constantly growing in demand. Yet, few books are aimed at those who are beginning a career in IT--until now. Cisco Networking Essentials provides a solid foundation on the Cisco networking products and services with thorough coverage of fundamental networking concepts. Author Troy McMillan applies his years of classroom instruction to effectively present high-level topics in easy-to-understand terms for beginners. With this indispensable full-color resour

ENERGY AWARE NETWORK: BAYESIAN BELIEF NETWORKS BASED DECISION MANAGEMENT SYSTEM

Directory of Open Access Journals (Sweden)

Santosh Kumar Chaudhari

2011-06-01

Full Text Available A Network Management System (NMS plays a very important role in managing an ever-evolving telecommunication network. Generally an NMS monitors & maintains the health of network elements. The growing size of the network warrants extra functionalities from the NMS. An NMS provides all kinds of information about networks which can be used for other purposes apart from monitoring & maintaining networks like improving QoS & saving energy in the network. In this paper, we add another dimension to NMS services, namely, making an NMS energy aware. We propose a Decision Management System (DMS framework which uses a machine learning technique called Bayesian Belief Networks (BBN, to make the NMS energy aware. The DMS is capable of analysing and making control decisions based on network traffic. We factor in the cost of rerouting and power saving per port. Simulations are performed on standard network topologies, namely, ARPANet and IndiaNet. It is found that ~2.5-6.5% power can be saved.

Temporal network epidemiology

CERN Document Server

Holme, Petter

2017-01-01

This book covers recent developments in epidemic process models and related data on temporally varying networks. It is widely recognized that contact networks are indispensable for describing, understanding, and intervening to stop the spread of infectious diseases in human and animal populations; “network epidemiology” is an umbrella term to describe this research field. More recently, contact networks have been recognized as being highly dynamic. This observation, also supported by an increasing amount of new data, has led to research on temporal networks, a rapidly growing area. Changes in network structure are often informed by epidemic (or other) dynamics, in which case they are referred to as adaptive networks. This volume gathers contributions by prominent authors working in temporal and adaptive network epidemiology, a field essential to understanding infectious diseases in real society.

Accelerating networks

International Nuclear Information System (INIS)

Smith, David M D; Onnela, Jukka-Pekka; Johnson, Neil F

2007-01-01

Evolving out-of-equilibrium networks have been under intense scrutiny recently. In many real-world settings the number of links added per new node is not constant but depends on the time at which the node is introduced in the system. This simple idea gives rise to the concept of accelerating networks, for which we review an existing definition and-after finding it somewhat constrictive-offer a new definition. The new definition provided here views network acceleration as a time dependent property of a given system as opposed to being a property of the specific algorithm applied to grow the network. The definition also covers both unweighted and weighted networks. As time-stamped network data becomes increasingly available, the proposed measures may be easily applied to such empirical datasets. As a simple case study we apply the concepts to study the evolution of three different instances of Wikipedia, namely, those in English, German, and Japanese, and find that the networks undergo different acceleration regimes in their evolution

Ad-hoc networking towards seamless communications

CERN Document Server

Gavrilovska, Liljana

2006-01-01

Ad-Hoc Networking Towards Seamless Communications is dedicated to an area that attracts growing interest in academia and industry and concentrates on wireless ad hoc networking paradigm. The persistent efforts to acquire the ability to establish dynamic wireless connections from anywhere to anyone with any device without prerequisite imbedded infrastructure move the communications boundaries towards ad-hoc networks. Recently, ad hoc networking has attracted growing interest due to advances in wireless communications, and developed framework for running IP based protocols. The expected degree of penetration of these networks will depend on the successful resolution of the key features. Ad-hoc networks pose many complex and open problems for researchers. Ad-Hoc Networking Towards Seamless Communications reveals the state-of-the-art in wireless ad-hoc networking and discusses some of the key research topics that are expected to promote and accelerate the commercial applications of these networks (e.g., MAC, rout...

Performance and complexity of tunable sparse network coding with gradual growing tuning functions over wireless networks

OpenAIRE

Garrido Ortiz, Pablo; Sørensen, Chres W.; Lucani Roetter, Daniel Enrique; Agüero Calvo, Ramón

2016-01-01

Random Linear Network Coding (RLNC) has been shown to be a technique with several benefits, in particular when applied over wireless mesh networks, since it provides robustness against packet losses. On the other hand, Tunable Sparse Network Coding (TSNC) is a promising concept, which leverages a trade-off between computational complexity and goodput. An optimal density tuning function has not been found yet, due to the lack of a closed-form expression that links density, performance and comp...

Language Networks as Complex Systems

Science.gov (United States)

Lee, Max Kueiming; Ou, Sheue-Jen

2008-01-01

Starting in the late eighties, with a growing discontent with analytical methods in science and the growing power of computers, researchers began to study complex systems such as living organisms, evolution of genes, biological systems, brain neural networks, epidemics, ecology, economy, social networks, etc. In the early nineties, the research…

Performance and Complexity of Tunable Sparse Network Coding with Gradual Growing Tuning Functions over Wireless Networks

DEFF Research Database (Denmark)

Garrido, Pablo; Sørensen, Chres Wiant; Roetter, Daniel Enrique Lucani

2016-01-01

Random Linear Network Coding (RLNC) has been shown to be a technique with several benefits, in particular when applied over wireless mesh networks, since it provides robustness against packet losses. On the other hand, Tunable Sparse Network Coding (TSNC) is a promising concept, which leverages...... a trade-off between computational complexity and goodput. An optimal density tuning function has not been found yet, due to the lack of a closed-form expression that links density, performance and computational cost. In addition, it would be difficult to implement, due to the feedback delay. In this work...

Competing edge networks

Science.gov (United States)

Parsons, Mark; Grindrod, Peter

2012-06-01

We introduce a model for a pair of nonlinear evolving networks, defined over a common set of vertices, subject to edgewise competition. Each network may grow new edges spontaneously or through triad closure. Both networks inhibit the other's growth and encourage the other's demise. These nonlinear stochastic competition equations yield to a mean field analysis resulting in a nonlinear deterministic system. There may be multiple equilibria; and bifurcations of different types are shown to occur within a reduced parameter space. This situation models competitive communication networks such as BlackBerry Messenger displacing SMS; or instant messaging displacing emails.

Hierarchical regular small-world networks

International Nuclear Information System (INIS)

Boettcher, Stefan; Goncalves, Bruno; Guclu, Hasan

2008-01-01

Two new networks are introduced that resemble small-world properties. These networks are recursively constructed but retain a fixed, regular degree. They possess a unique one-dimensional lattice backbone overlaid by a hierarchical sequence of long-distance links, mixing real-space and small-world features. Both networks, one 3-regular and the other 4-regular, lead to distinct behaviors, as revealed by renormalization group studies. The 3-regular network is planar, has a diameter growing as √N with system size N, and leads to super-diffusion with an exact, anomalous exponent d w = 1.306..., but possesses only a trivial fixed point T c = 0 for the Ising ferromagnet. In turn, the 4-regular network is non-planar, has a diameter growing as ∼2 √(log 2 N 2 ) , exhibits 'ballistic' diffusion (d w = 1), and a non-trivial ferromagnetic transition, T c > 0. It suggests that the 3-regular network is still quite 'geometric', while the 4-regular network qualifies as a true small world with mean-field properties. As an engineering application we discuss synchronization of processors on these networks. (fast track communication)

Network-assisted crop systems genetics: network inference and integrative analysis.

Science.gov (United States)

Lee, Tak; Kim, Hyojin; Lee, Insuk

2015-04-01

Although next-generation sequencing (NGS) technology has enabled the decoding of many crop species genomes, most of the underlying genetic components for economically important crop traits remain to be determined. Network approaches have proven useful for the study of the reference plant, Arabidopsis thaliana, and the success of network-based crop genetics will also require the availability of a genome-scale functional networks for crop species. In this review, we discuss how to construct functional networks and elucidate the holistic view of a crop system. The crop gene network then can be used for gene prioritization and the analysis of resequencing-based genome-wide association study (GWAS) data, the amount of which will rapidly grow in the field of crop science in the coming years. Copyright © 2015 Elsevier Ltd. All rights reserved.

Modeling online social signed networks

Science.gov (United States)

Li, Le; Gu, Ke; Zeng, An; Fan, Ying; Di, Zengru

2018-04-01

People's online rating behavior can be modeled by user-object bipartite networks directly. However, few works have been devoted to reveal the hidden relations between users, especially from the perspective of signed networks. We analyze the signed monopartite networks projected by the signed user-object bipartite networks, finding that the networks are highly clustered with obvious community structure. Interestingly, the positive clustering coefficient is remarkably higher than the negative clustering coefficient. Then, a Signed Growing Network model (SGN) based on local preferential attachment is proposed to generate a user's signed network that has community structure and high positive clustering coefficient. Other structural properties of the modeled networks are also found to be similar to the empirical networks.

Network-induced oscillatory behavior in material flow networks and irregular business cycles

Science.gov (United States)

Helbing, Dirk; Lämmer, Stefen; Witt, Ulrich; Brenner, Thomas

2004-11-01

Network theory is rapidly changing our understanding of complex systems, but the relevance of topological features for the dynamic behavior of metabolic networks, food webs, production systems, information networks, or cascade failures of power grids remains to be explored. Based on a simple model of supply networks, we offer an interpretation of instabilities and oscillations observed in biological, ecological, economic, and engineering systems. We find that most supply networks display damped oscillations, even when their units—and linear chains of these units—behave in a nonoscillatory way. Moreover, networks of damped oscillators tend to produce growing oscillations. This surprising behavior offers, for example, a different interpretation of business cycles and of oscillating or pulsating processes. The network structure of material flows itself turns out to be a source of instability, and cyclical variations are an inherent feature of decentralized adjustments.

The effect of the neural activity on topological properties of growing neural networks.

Science.gov (United States)

Gafarov, F M; Gafarova, V R

2016-09-01

The connectivity structure in cortical networks defines how information is transmitted and processed, and it is a source of the complex spatiotemporal patterns of network's development, and the process of creation and deletion of connections is continuous in the whole life of the organism. In this paper, we study how neural activity influences the growth process in neural networks. By using a two-dimensional activity-dependent growth model we demonstrated the neural network growth process from disconnected neurons to fully connected networks. For making quantitative investigation of the network's activity influence on its topological properties we compared it with the random growth network not depending on network's activity. By using the random graphs theory methods for the analysis of the network's connections structure it is shown that the growth in neural networks results in the formation of a well-known "small-world" network.

Network attacks and defenses a hands-on approach

CERN Document Server

Trabelsi, Zouheir; Al Braiki, Arwa; Mathew, Sujith Samuel

2012-01-01

The attacks on computers and business networks are growing daily, and the need for security professionals who understand how malfeasants perform attacks and compromise networks is a growing requirement to counter the threat. Network security education generally lacks appropriate textbooks with detailed, hands-on exercises that include both offensive and defensive techniques. Using step-by-step processes to build and generate attacks using offensive techniques, Network Attacks and Defenses: A Hands-on Approach enables students to implement appropriate network security solutions within a laborat

Languages for Software-Defined Networks

Science.gov (United States)

2013-02-01

switches, firewalls, and middleboxes) with closed and proprietary configuration inter- faces. Software - Defined Networks ( SDN ) are poised to change...how- ever, have seen growing interest in software - defined networks ( SDNs ), in which a logically-centralized controller manages the packet-processing...switches, firewalls, and middleboxes) with closed and proprietary configuration interfaces. Software - Defined Networks ( SDN ) are poised to change this

Cloud Radio Access Network architecture. Towards 5G mobile networks

DEFF Research Database (Denmark)

Checko, Aleksandra

Cloud Radio Access Network (C-RAN) is a novel mobile network architecture which can address a number of challenges that mobile operators face while trying to support ever-growing end-users’ needs towards 5th generation of mobile networks (5G). The main idea behind C-RAN is to split the base...... stations into radio and baseband parts, and pool the Baseband Units (BBUs) from multiple base stations into a centralized and virtualized BBU Pool. This gives a number of benefits in terms of cost and capacity. However, the challenge is then to find an optimal functionality splitting point as well...... as to design the socalled fronthaul network, interconnecting those parts. This thesis focuses on quantifying those benefits and proposing a flexible and capacity-optimized fronthaul network. It is shown that a C-RAN with a functional split resulting in a variable bit rate on the fronthaul links brings cost...

Noise suppress or express exponential growth for hybrid Hopfield neural networks

International Nuclear Information System (INIS)

Zhu Song; Shen Yi; Chen Guici

2010-01-01

In this Letter, we will show that noise can make the given hybrid Hopfield neural networks whose solution may grows exponentially become the new stochastic hybrid Hopfield neural networks whose solution will grows at most polynomially. On the other hand, we will also show that noise can make the given hybrid Hopfield neural networks whose solution grows at most polynomially become the new stochastic hybrid Hopfield neural networks whose solution will grows at exponentially. In other words, we will reveal that the noise can suppress or express exponential growth for hybrid Hopfield neural networks.

Structure of a randomly grown 2-d network

DEFF Research Database (Denmark)

Ajazi, Fioralba; Napolitano, George M.; Turova, Tatyana

2015-01-01

We introduce a growing random network on a plane as a model of a growing neuronal network. The properties of the structure of the induced graph are derived. We compare our results with available data. In particular, it is shown that depending on the parameters of the model the system undergoes in...... in time different phases of the structure. We conclude with a possible explanation of some empirical data on the connections between neurons.......We introduce a growing random network on a plane as a model of a growing neuronal network. The properties of the structure of the induced graph are derived. We compare our results with available data. In particular, it is shown that depending on the parameters of the model the system undergoes...

Random walks on generalized Koch networks

International Nuclear Information System (INIS)

Sun, Weigang

2013-01-01

For deterministically growing networks, it is a theoretical challenge to determine the topological properties and dynamical processes. In this paper, we study random walks on generalized Koch networks with features that include an initial state that is a globally connected network to r nodes. In each step, every existing node produces m complete graphs. We then obtain the analytical expressions for first passage time (FPT), average return time (ART), i.e. the average of FPTs for random walks from node i to return to the starting point i for the first time, and average sending time (AST), defined as the average of FPTs from a hub node to all other nodes, excluding the hub itself with regard to network parameters m and r. For this family of Koch networks, the ART of the new emerging nodes is identical and increases with the parameters m or r. In addition, the AST of our networks grows with network size N as N ln N and also increases with parameter m. The results obtained in this paper are the generalizations of random walks for the original Koch network. (paper)

When business networks “kill” social networks

DEFF Research Database (Denmark)

Jackson, Laurel; Young, L.

2016-01-01

that considers the changes to a community's social network and the associated norms emerging from the growing influence of a microfinance providers' network. A case study reports the impact of microfinance on a particular Bangladesh rural community. We show there is a breakdown in traditional social networks...... in this and other poor rural villages brought about by the taking of micro loans when the families have no means of paying them back. This increased indebtedness to NGOs is perpetuating their poverty and diminishing the community's quality of life including their traditions of bounded solidarity, where families...... in the economic structure of rural Bangladesh and changing norms, in particular the changes to traditional forms of financial exchange and associated support and risk management. We conclude that public policy and a different business model that is more accountable and altruistic are needed to guide...

A fusion networking model for smart grid power distribution backbone communication network based on PTN

Directory of Open Access Journals (Sweden)

Wang Hao

2016-01-01

Full Text Available In current communication network for distribution in Chinese power grid systems, the fiber communication backbone network for distribution and TD-LTE power private wireless backhaul network of power grid are both bearing by the SDH optical transmission network, which also carries the communication network of transformer substation and main electric. As the data traffic of the distribution communication and TD-LTE power private wireless network grow rapidly in recent years, it will have a big impact with the SDH network’s bearing capacity which is mainly used for main electric communication in high security level. This paper presents a fusion networking model which use a multiple-layer PTN network as the unified bearing of the TD-LTE power private wireless backhaul network and fiber communication backbone network for distribution. Network dataflow analysis shows that this model can greatly reduce the capacity pressure of the traditional SDH network as well as ensure the reliability of the transmission of the communication network for distribution and TD-LTE power private wireless network.

Physical-layer Network Coding in Two-Way Heterogeneous Cellular Networks with Power Imbalance

OpenAIRE

Thampi, Ajay K; Liew, Soung Chang; Armour, Simon M D; Fan, Zhong; You, Lizhao; Kaleshi, Dritan

2016-01-01

The growing demand for high-speed data, quality of service (QoS) assurance and energy efficiency has triggered the evolution of 4G LTE-A networks to 5G and beyond. Interference is still a major performance bottleneck. This paper studies the application of physical-layer network coding (PNC), a technique that exploits interference, in heterogeneous cellular networks. In particular, we propose a rate-maximising relay selection algorithm for a single cell with multiple relays assuming the decode...

Competing edge networks

International Nuclear Information System (INIS)

Parsons, Mark; Grindrod, Peter

2012-01-01

We introduce a model for a pair of nonlinear evolving networks, defined over a common set of vertices, subject to edgewise competition. Each network may grow new edges spontaneously or through triad closure. Both networks inhibit the other's growth and encourage the other's demise. These nonlinear stochastic competition equations yield to a mean field analysis resulting in a nonlinear deterministic system. There may be multiple equilibria; and bifurcations of different types are shown to occur within a reduced parameter space. This situation models competitive communication networks such as BlackBerry Messenger displacing SMS; or instant messaging displacing emails. -- Highlights: ► A model for edgewise-competing evolving network pairs is introduced. ► Defined competition equations yield to a mean field analysis. ► Multiple equilibrium states and different bifurcation types can occur. ► The system is sensitive to sparse initial conditions and near unstable equilibriums.

Complex quantum network geometries: Evolution and phase transitions

Science.gov (United States)

Bianconi, Ginestra; Rahmede, Christoph; Wu, Zhihao

2015-08-01

Networks are topological and geometric structures used to describe systems as different as the Internet, the brain, or the quantum structure of space-time. Here we define complex quantum network geometries, describing the underlying structure of growing simplicial 2-complexes, i.e., simplicial complexes formed by triangles. These networks are geometric networks with energies of the links that grow according to a nonequilibrium dynamics. The evolution in time of the geometric networks is a classical evolution describing a given path of a path integral defining the evolution of quantum network states. The quantum network states are characterized by quantum occupation numbers that can be mapped, respectively, to the nodes, links, and triangles incident to each link of the network. We call the geometric networks describing the evolution of quantum network states the quantum geometric networks. The quantum geometric networks have many properties common to complex networks, including small-world property, high clustering coefficient, high modularity, and scale-free degree distribution. Moreover, they can be distinguished between the Fermi-Dirac network and the Bose-Einstein network obeying, respectively, the Fermi-Dirac and Bose-Einstein statistics. We show that these networks can undergo structural phase transitions where the geometrical properties of the networks change drastically. Finally, we comment on the relation between quantum complex network geometries, spin networks, and triangulations.

A Collaborative Learning Network Approach to Improvement: The CUSP Learning Network.

Science.gov (United States)

Weaver, Sallie J; Lofthus, Jennifer; Sawyer, Melinda; Greer, Lee; Opett, Kristin; Reynolds, Catherine; Wyskiel, Rhonda; Peditto, Stephanie; Pronovost, Peter J

2015-04-01

Collaborative improvement networks draw on the science of collaborative organizational learning and communities of practice to facilitate peer-to-peer learning, coaching, and local adaption. Although significant improvements in patient safety and quality have been achieved through collaborative methods, insight regarding how collaborative networks are used by members is needed. Improvement Strategy: The Comprehensive Unit-based Safety Program (CUSP) Learning Network is a multi-institutional collaborative network that is designed to facilitate peer-to-peer learning and coaching specifically related to CUSP. Member organizations implement all or part of the CUSP methodology to improve organizational safety culture, patient safety, and care quality. Qualitative case studies developed by participating members examine the impact of network participation across three levels of analysis (unit, hospital, health system). In addition, results of a satisfaction survey designed to evaluate member experiences were collected to inform network development. Common themes across case studies suggest that members found value in collaborative learning and sharing strategies across organizational boundaries related to a specific improvement strategy. The CUSP Learning Network is an example of network-based collaborative learning in action. Although this learning network focuses on a particular improvement methodology-CUSP-there is clear potential for member-driven learning networks to grow around other methods or topic areas. Such collaborative learning networks may offer a way to develop an infrastructure for longer-term support of improvement efforts and to more quickly diffuse creative sustainment strategies.

Medicinal plants growing in the Judea region: network approach for searching potential therapeutic targets

Directory of Open Access Journals (Sweden)

Arie Budovsky

2012-09-01

Full Text Available Plants growing in the Judea region are widely used in traditional medicine of the Levant region. Nevertheless, they have not so far been sufficiently analyzed and their medicinal potential has not been evaluated. This study is the first attempt to fill the gap in the knowledge of the plants growing in the region. Comprehensive data mining of online botanical databases and peer-reviewed scientific literature including ethno-pharmacological surveys from the Levant region was applied to compile a full list of plants growing in the Judea region, with the focus on their medicinal applications. Around 1300 plants growing in the Judea region were identified. Of them, 25% have medicinal applications which were analyzed in this study. Screening for chemical-protein interactions, together with the network-based analysis of potential targets, will facilitate discovery and therapeutic applications of the Judea region plants. Such an approach could also be applied as an integrative platform for further searching the potential therapeutic targets of plants growing in other regions of the world.

S-curve networks and an approximate method for estimating degree distributions of complex networks

Science.gov (United States)

Guo, Jin-Li

2010-12-01

In the study of complex networks almost all theoretical models have the property of infinite growth, but the size of actual networks is finite. According to statistics from the China Internet IPv4 (Internet Protocol version 4) addresses, this paper proposes a forecasting model by using S curve (logistic curve). The growing trend of IPv4 addresses in China is forecasted. There are some reference values for optimizing the distribution of IPv4 address resource and the development of IPv6. Based on the laws of IPv4 growth, that is, the bulk growth and the finitely growing limit, it proposes a finite network model with a bulk growth. The model is said to be an S-curve network. Analysis demonstrates that the analytic method based on uniform distributions (i.e., Barabási-Albert method) is not suitable for the network. It develops an approximate method to predict the growth dynamics of the individual nodes, and uses this to calculate analytically the degree distribution and the scaling exponents. The analytical result agrees with the simulation well, obeying an approximately power-law form. This method can overcome a shortcoming of Barabási-Albert method commonly used in current network research.

S-curve networks and an approximate method for estimating degree distributions of complex networks

International Nuclear Information System (INIS)

Guo Jin-Li

2010-01-01

In the study of complex networks almost all theoretical models have the property of infinite growth, but the size of actual networks is finite. According to statistics from the China Internet IPv4 (Internet Protocol version 4) addresses, this paper proposes a forecasting model by using S curve (logistic curve). The growing trend of IPv4 addresses in China is forecasted. There are some reference values for optimizing the distribution of IPv4 address resource and the development of IPv6. Based on the laws of IPv4 growth, that is, the bulk growth and the finitely growing limit, it proposes a finite network model with a bulk growth. The model is said to be an S-curve network. Analysis demonstrates that the analytic method based on uniform distributions (i.e., Barabási-Albert method) is not suitable for the network. It develops an approximate method to predict the growth dynamics of the individual nodes, and uses this to calculate analytically the degree distribution and the scaling exponents. The analytical result agrees with the simulation well, obeying an approximately power-law form. This method can overcome a shortcoming of Barabási-Albert method commonly used in current network research. (general)

Analysis of the Chinese air route network as a complex network

Science.gov (United States)

Cai, Kai-Quan; Zhang, Jun; Du, Wen-Bo; Cao, Xian-Bin

2012-02-01

The air route network, which supports all the flight activities of the civil aviation, is the most fundamental infrastructure of air traffic management system. In this paper, we study the Chinese air route network (CARN) within the framework of complex networks. We find that CARN is a geographical network possessing exponential degree distribution, low clustering coefficient, large shortest path length and exponential spatial distance distribution that is obviously different from that of the Chinese airport network (CAN). Besides, via investigating the flight data from 2002 to 2010, we demonstrate that the topology structure of CARN is homogeneous, howbeit the distribution of flight flow on CARN is rather heterogeneous. In addition, the traffic on CARN keeps growing in an exponential form and the increasing speed of west China is remarkably larger than that of east China. Our work will be helpful to better understand Chinese air traffic systems.

Mobile ad hoc networking

CERN Document Server

John Wiley & Sons

2004-01-01

"Assimilating the most up-to-date information on research and development activities in this rapidly growing area, Mobile Ad Hoc Networking covers physical, data link, network, and transport layers, as well as application, security, simulation, and power management issues in sensor, local area, personal, and mobile ad hoc networks. Each of the book's sixteen chapters has been written by a top expert and discusses in-depth the most important topics in the field. Mobile Ad Hoc Networking is an excellent reference and guide for professionals seeking an in-depth examination of topics that also provides a comprehensive overview of the current state-of-the-art."--Jacket.

Ranking shortest paths in Stochastic time-denpendent networks

DEFF Research Database (Denmark)

Nielsen, Lars Relund; Andersen, Kim Allan; Pretolani, Daniele

A substantial amount of research has been devoted to the shortest path problem in networks where travel times are stochastic or (deterministic and) time-dependent. More recently, a growing interest has been attracted by networks that are both stochastic and time-dependent. In these networks, the ...... present a computational comparison of time-adaptive and a priori route choices, pointing out the effect of travel time and cost distributions. The reported results show that, under realistic distributions, our solution methods are effective.......A substantial amount of research has been devoted to the shortest path problem in networks where travel times are stochastic or (deterministic and) time-dependent. More recently, a growing interest has been attracted by networks that are both stochastic and time-dependent. In these networks...

K shortest paths in stochastic time-dependent networks

DEFF Research Database (Denmark)

Nielsen, Lars Relund; Pretolani, Daniele; Andersen, Kim Allan

2004-01-01

A substantial amount of research has been devoted to the shortest path problem in networks where travel times are stochastic or (deterministic and) time-dependent. More recently, a growing interest has been attracted by networks that are both stochastic and time-dependent. In these networks, the ...... present a computational comparison of time-adaptive and a priori route choices, pointing out the effect of travel time and cost distributions. The reported results show that, under realistic distributions, our solution methods are effective.......A substantial amount of research has been devoted to the shortest path problem in networks where travel times are stochastic or (deterministic and) time-dependent. More recently, a growing interest has been attracted by networks that are both stochastic and time-dependent. In these networks...

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.

Malware Propagation and Prevention Model for Time-Varying Community Networks within Software Defined Networks

Directory of Open Access Journals (Sweden)

Lan Liu

2017-01-01

Full Text Available As the adoption of Software Defined Networks (SDNs grows, the security of SDN still has several unaddressed limitations. A key network security research area is in the study of malware propagation across the SDN-enabled networks. To analyze the spreading processes of network malware (e.g., viruses in SDN, we propose a dynamic model with a time-varying community network, inspired by research models on the spread of epidemics in complex networks across communities. We assume subnets of the network as communities and links that are dense in subnets but sparse between subnets. Using numerical simulation and theoretical analysis, we find that the efficiency of network malware propagation in this model depends on the mobility rate q of the nodes between subnets. We also find that there exists a mobility rate threshold qc. The network malware will spread in the SDN when the mobility rate q>qc. The malware will survive when q>qc and perish when qnetwork malware and provide a theoretical basis to reduce and prevent network security incidents.

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

Innovation incentives and the design of value networks

OpenAIRE

Jarimo, Toni

2008-01-01

Participation in value networks is vital for companies as competition has moved increasingly to the level of company networks. Consequently, the growing complexity of the globally networked business environment necessitates the use of supportive tools in the management of network relations. This Dissertation studies the value networks from two perspectives. First, as companies expect a return on their contributions to the network, the Dissertation constructs profit-sharing rules that ser...

Artificial neural networks in NDT

International Nuclear Information System (INIS)

Abdul Aziz Mohamed

2001-01-01

Artificial neural networks, simply known as neural networks, have attracted considerable interest in recent years largely because of a growing recognition of the potential of these computational paradigms as powerful alternative models to conventional pattern recognition or function approximation techniques. The neural networks approach is having a profound effect on almost all fields, and has been utilised in fields Where experimental inter-disciplinary work is being carried out. Being a multidisciplinary subject with a broad knowledge base, Nondestructive Testing (NDT) or Nondestructive Evaluation (NDE) is no exception. This paper explains typical applications of neural networks in NDT/NDE. Three promising types of neural networks are highlighted, namely, back-propagation, binary Hopfield and Kohonen's self-organising maps. (Author)

Circuit switched optical networks

DEFF Research Database (Denmark)

Kloch, Allan

2003-01-01

Some of the most important components required for enabling optical networking are investigated through both experiments and modelling. These all-optical components are the wavelength converter, the regenerator and the space switch. When these devices become "off-the-shelf" products, optical cross......, it is expected that the optical solution will offer an economical benefit for hight bit rate networks. This thesis begins with a discussion of the expected impact on communications systems from the rapidly growing IP traffic, which is expected to become the dominant source for traffic. IP traffic has some...... characteristics, which are best supported by an optical network. The interest for such an optical network is exemplified by the formation of the ACTS OPEN project which aim was to investigate the feasibility of an optical network covering Europe. Part of the work presented in this thesis is carried out within...

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

Task vs. rest-different network configurations between the coactivation and the resting-state brain networks.

Science.gov (United States)

Di, Xin; Gohel, Suril; Kim, Eun H; Biswal, Bharat B

2013-01-01

There is a growing interest in studies of human brain networks using resting-state functional magnetic resonance imaging (fMRI). However, it is unclear whether and how brain networks measured during the resting-state exhibit comparable properties to brain networks during task performance. In the present study, we investigated meta-analytic coactivation patterns among brain regions based upon published neuroimaging studies, and compared the coactivation network configurations with those in the resting-state network. The strength of resting-state functional connectivity between two regions were strongly correlated with the coactivation strength. However, the coactivation network showed greater global efficiency, smaller mean clustering coefficient, and lower modularity compared with the resting-state network, which suggest a more efficient global information transmission and between system integrations during task performing. Hub shifts were also observed within the thalamus and the left inferior temporal cortex. The thalamus and the left inferior temporal cortex exhibited higher and lower degrees, respectively in the coactivation network compared with the resting-state network. These results shed light regarding the reconfiguration of the brain networks between task and resting-state conditions, and highlight the role of the thalamus in change of network configurations in task vs. rest.

Implementation of quantum key distribution network simulation module in the network simulator NS-3

Science.gov (United States)

Mehic, Miralem; Maurhart, Oliver; Rass, Stefan; Voznak, Miroslav

2017-10-01

As the research in quantum key distribution (QKD) technology grows larger and becomes more complex, the need for highly accurate and scalable simulation technologies becomes important to assess the practical feasibility and foresee difficulties in the practical implementation of theoretical achievements. Due to the specificity of the QKD link which requires optical and Internet connection between the network nodes, to deploy a complete testbed containing multiple network hosts and links to validate and verify a certain network algorithm or protocol would be very costly. Network simulators in these circumstances save vast amounts of money and time in accomplishing such a task. The simulation environment offers the creation of complex network topologies, a high degree of control and repeatable experiments, which in turn allows researchers to conduct experiments and confirm their results. In this paper, we described the design of the QKD network simulation module which was developed in the network simulator of version 3 (NS-3). The module supports simulation of the QKD network in an overlay mode or in a single TCP/IP mode. Therefore, it can be used to simulate other network technologies regardless of QKD.

Campus network security model study

Science.gov (United States)

Zhang, Yong-ku; Song, Li-ren

2011-12-01

Campus network security is growing importance, Design a very effective defense hacker attacks, viruses, data theft, and internal defense system, is the focus of the study in this paper. This paper compared the firewall; IDS based on the integrated, then design of a campus network security model, and detail the specific implementation principle.

Network Analysis in Community Psychology: Looking Back, Looking Forward

OpenAIRE

Neal, Zachary P.; Neal, Jennifer Watling

2017-01-01

Highlights Network analysis is ideally suited for community psychology research because it focuses on context. Use of network analysis in community psychology is growing. Network analysis in community psychology has employed some potentially problematic practices. Recommended practices are identified to improve network analysis in community psychology.

Efficient Networks Communication Routing Using Swarm Intelligence

OpenAIRE

Koushal Kumar

2012-01-01

As demonstrated by natural biological swarm’s collective intelligence has an abundance of desirable properties for problem-solving like in network routing. The focus of this paper is in the applications of swarm based intelligence in information routing for communication networks. As we know networks are growing and adopting new platforms as new technologies comes. Also according to new demands and requirements networks topologies and its complexity is increasing with time. Thus it is becomin...

Modelling the structure of complex networks

DEFF Research Database (Denmark)

Herlau, Tue

networks has been independently studied as mathematical objects in their own right. As such, there has been both an increased demand for statistical methods for complex networks as well as a quickly growing mathematical literature on the subject. In this dissertation we explore aspects of modelling complex....... The next chapters will treat some of the various symmetries, representer theorems and probabilistic structures often deployed in the modelling complex networks, the construction of sampling methods and various network models. The introductory chapters will serve to provide context for the included written...

An Optimal Routing Algorithm in Service Customized 5G Networks

Directory of Open Access Journals (Sweden)

Haipeng Yao

2016-01-01

Full Text Available With the widespread use of Internet, the scale of mobile data traffic grows explosively, which makes 5G networks in cellular networks become a growing concern. Recently, the ideas related to future network, for example, Software Defined Networking (SDN, Content-Centric Networking (CCN, and Big Data, have drawn more and more attention. In this paper, we propose a service-customized 5G network architecture by introducing the ideas of separation between control plane and data plane, in-network caching, and Big Data processing and analysis to resolve the problems traditional cellular radio networks face. Moreover, we design an optimal routing algorithm for this architecture, which can minimize average response hops in the network. Simulation results reveal that, by introducing the cache, the network performance can be obviously improved in different network conditions compared to the scenario without a cache. In addition, we explore the change of cache hit rate and average response hops under different cache replacement policies, cache sizes, content popularity, and network topologies, respectively.

Task vs. rest—different network configurations between the coactivation and the resting-state brain networks

Science.gov (United States)

Di, Xin; Gohel, Suril; Kim, Eun H.; Biswal, Bharat B.

2013-01-01

There is a growing interest in studies of human brain networks using resting-state functional magnetic resonance imaging (fMRI). However, it is unclear whether and how brain networks measured during the resting-state exhibit comparable properties to brain networks during task performance. In the present study, we investigated meta-analytic coactivation patterns among brain regions based upon published neuroimaging studies, and compared the coactivation network configurations with those in the resting-state network. The strength of resting-state functional connectivity between two regions were strongly correlated with the coactivation strength. However, the coactivation network showed greater global efficiency, smaller mean clustering coefficient, and lower modularity compared with the resting-state network, which suggest a more efficient global information transmission and between system integrations during task performing. Hub shifts were also observed within the thalamus and the left inferior temporal cortex. The thalamus and the left inferior temporal cortex exhibited higher and lower degrees, respectively in the coactivation network compared with the resting-state network. These results shed light regarding the reconfiguration of the brain networks between task and resting-state conditions, and highlight the role of the thalamus in change of network configurations in task vs. rest. PMID:24062654

Network chemistry, network toxicology, network informatics, and network behavioristics: A scientific outline

OpenAIRE

WenJun Zhang

2016-01-01

In present study, I proposed some new sciences: network chemistry, network toxicology, network informatics, and network behavioristics. The aims, scope and scientific foundation of these sciences are outlined.

MIMO Communication for Cellular Networks

CERN Document Server

Huang, Howard; Venkatesan, Sivarama

2012-01-01

As the theoretical foundations of multiple-antenna techniques evolve and as these multiple-input multiple-output (MIMO) techniques become essential for providing high data rates in wireless systems, there is a growing need to understand the performance limits of MIMO in practical networks. To address this need, MIMO Communication for Cellular Networks presents a systematic description of MIMO technology classes and a framework for MIMO system design that takes into account the essential physical-layer features of practical cellular networks. In contrast to works that focus on the theoretical performance of abstract MIMO channels, MIMO Communication for Cellular Networks emphasizes the practical performance of realistic MIMO systems. A unified set of system simulation results highlights relative performance gains of different MIMO techniques and provides insights into how best to use multiple antennas in cellular networks under various conditions. MIMO Communication for Cellular Networks describes single-user,...

Growing complex network of citations of scientific papers: Modeling and measurements.

Science.gov (United States)

Golosovsky, Michael; Solomon, Sorin

2017-01-01

We consider the network of citations of scientific papers and use a combination of the theoretical and experimental tools to uncover microscopic details of this network growth. Namely, we develop a stochastic model of citation dynamics based on the copying-redirection-triadic closure mechanism. In a complementary and coherent way, the model accounts both for statistics of references of scientific papers and for their citation dynamics. Originating in empirical measurements, the model is cast in such a way that it can be verified quantitatively in every aspect. Such validation is performed by measuring citation dynamics of physics papers. The measurements revealed nonlinear citation dynamics, the nonlinearity being intricately related to network topology. The nonlinearity has far-reaching consequences including nonstationary citation distributions, diverging citation trajectories of similar papers, runaways or "immortal papers" with infinite citation lifetime, etc. Thus nonlinearity in complex network growth is our most important finding. In a more specific context, our results can be a basis for quantitative probabilistic prediction of citation dynamics of individual papers and of the journal impact factor.

Researching Design, Experience and Practice of Networked Learning

DEFF Research Database (Denmark)

Hodgson, Vivien; de Laat, Maarten; McConnell, David

2014-01-01

and final section draws attention to a growing topic of interest within networked learning: that of networked learning in informal practices. In addition, we provide a reflection on the theories, methods and settings featured in the networked learning research of the chapters. We conclude the introduction...

Test experience on an ultrareliable computer communication network

Science.gov (United States)

Abbott, L. W.

1984-01-01

The dispersed sensor processing mesh (DSPM) is an experimental, ultra-reliable, fault-tolerant computer communications network that exhibits an organic-like ability to regenerate itself after suffering damage. The regeneration is accomplished by two routines - grow and repair. This paper discusses the DSPM concept for achieving fault tolerance and provides a brief description of the mechanization of both the experiment and the six-node experimental network. The main topic of this paper is the system performance of the growth algorithm contained in the grow routine. The characteristics imbued to DSPM by the growth algorithm are also discussed. Data from an experimental DSPM network and software simulation of larger DSPM-type networks are used to examine the inherent limitation on growth time by the growth algorithm and the relationship of growth time to network size and topology.

Statistical Mechanics of Temporal and Interacting Networks

Science.gov (United States)

Zhao, Kun

In the last ten years important breakthroughs in the understanding of the topology of complexity have been made in the framework of network science. Indeed it has been found that many networks belong to the universality classes called small-world networks or scale-free networks. Moreover it was found that the complex architecture of real world networks strongly affects the critical phenomena defined on these structures. Nevertheless the main focus of the research has been the characterization of single and static networks. Recently, temporal networks and interacting networks have attracted large interest. Indeed many networks are interacting or formed by a multilayer structure. Example of these networks are found in social networks where an individual might be at the same time part of different social networks, in economic and financial networks, in physiology or in infrastructure systems. Moreover, many networks are temporal, i.e. the links appear and disappear on the fast time scale. Examples of these networks are social networks of contacts such as face-to-face interactions or mobile-phone communication, the time-dependent correlations in the brain activity and etc. Understanding the evolution of temporal and multilayer networks and characterizing critical phenomena in these systems is crucial if we want to describe, predict and control the dynamics of complex system. In this thesis, we investigate several statistical mechanics models of temporal and interacting networks, to shed light on the dynamics of this new generation of complex networks. First, we investigate a model of temporal social networks aimed at characterizing human social interactions such as face-to-face interactions and phone-call communication. Indeed thanks to the availability of data on these interactions, we are now in the position to compare the proposed model to the real data finding good agreement. Second, we investigate the entropy of temporal networks and growing networks , to provide

Polymorphic Attacks and Network Topology: Application of Concepts from Natural Systems

Science.gov (United States)

Rangan, Prahalad

2010-01-01

The growing complexity of interactions between computers and networks makes the subject of network security a very interesting one. As our dependence on the services provided by computing networks grows, so does our investment in such technology. In this situation, there is a greater risk of occurrence of targeted malicious attacks on computers…

Visual Network Asymmetry and Default Mode Network Function in ADHD: An fMRI Study

Directory of Open Access Journals (Sweden)

T. Sigi eHale

2014-07-01

Full Text Available Background: A growing body of research has identified abnormal visual information processing in ADHD. In particular, slow processing speed and increased reliance on visuo-perceptual strategies have become evident. Objective: The current study used recently developed fMRI methods to replicate and further examine abnormal rightward biased visual information processing in ADHD and to further characterize the nature of this effect; we tested its association to several large-scale distributed network systems. Method: We examined fMRI BOLD response during letter and location judgment tasks, and directly assessed visual network asymmetry and its association to large-scale networks using both a voxelwise and an averaged signal approach. Results: Initial within-group analyses revealed a pattern of left lateralized visual cortical activity in controls but right lateralized visual cortical activity in ADHD children. Direct analyses of visual network asymmetry confirmed atypical rightward bias in ADHD children compared to controls. This ADHD characteristic was atypically associated with reduced activation across several extra-visual networks, including the default mode network (DMN. We also found atypical associations between DMN activation and ADHD subjects’ inattentive symptoms and task performance. Conclusion: The current study demonstrated rightward VNA in ADHD during a simple letter discrimination task. This result adds an important novel consideration to the growing literature identifying abnormal visual processing in ADHD. We postulate that this characteristic reflects greater perceptual engagement of task-extraneous content, and that it may be a basic feature of less efficient top-down task-directed control over visual processing. We additionally argue that abnormal DMN function may contribute to this characteristic.

Growing up with Social Networks and Online Communities

Science.gov (United States)

Strom, Paris; Strom, Robert

2012-01-01

This presentation examines child and adolescent social networking with an emphasis on how this unprecedented form of communication can be used to contribute to healthy growth and development. Most literature about child and adolescent relationships reflects yesterday's world, a time when face-to-face encounters were the only concern. Students saw…

MODA: an efficient algorithm for network motif discovery in biological networks.

Science.gov (United States)

Omidi, Saeed; Schreiber, Falk; Masoudi-Nejad, Ali

2009-10-01

In recent years, interest has been growing in the study of complex networks. Since Erdös and Rényi (1960) proposed their random graph model about 50 years ago, many researchers have investigated and shaped this field. Many indicators have been proposed to assess the global features of networks. Recently, an active research area has developed in studying local features named motifs as the building blocks of networks. Unfortunately, network motif discovery is a computationally hard problem and finding rather large motifs (larger than 8 nodes) by means of current algorithms is impractical as it demands too much computational effort. In this paper, we present a new algorithm (MODA) that incorporates techniques such as a pattern growth approach for extracting larger motifs efficiently. We have tested our algorithm and found it able to identify larger motifs with more than 8 nodes more efficiently than most of the current state-of-the-art motif discovery algorithms. While most of the algorithms rely on induced subgraphs as motifs of the networks, MODA is able to extract both induced and non-induced subgraphs simultaneously. The MODA source code is freely available at: http://LBB.ut.ac.ir/Download/LBBsoft/MODA/

Adoption of Social Networking in Education: A Study of the Use of Social Networks by Higher Education Students in Oman

Science.gov (United States)

Al-Mukhaini, Elham M.; Al-Qayoudhi, Wafa S.; Al-Badi, Ali H.

2014-01-01

The use of social networks is a growing phenomenon, being increasingly important in both private and academic life. Social networks are used as tools to enable users to have social interaction. The use of social networks (SNs) complements and enhances the teaching in traditional classrooms. For example, YouTube, Facebook, wikis, and blogs provide…

A Preliminary Survey on the Security of Software-Defined Networks

OpenAIRE

Akbaş, Muhammet Fatih; Karaarslan, Enis; Güngör, Cengiz

2016-01-01

The number of devices connected to theInternet is increasing, data centers are growing continuously and computernetworks are getting more complex. Traditional network management approach isbecoming more difficult and insufficient. Software-Defined Networks (SDN) is anew generation networking approach which is expected to take place of thetraditional computer networks. SDN architecture provides effective managementof the large and complex networks. Although SDN have benefits from the network s...

Handoff Between a Wireless Local Area Network (WLAN and a Wide Area Network (UMTS

Directory of Open Access Journals (Sweden)

J. Sánchez–García

2009-04-01

Full Text Available With the appearance of wireless data networks with variable coverage, band width and handoff strategies, in addition to the growing need of mobile nodes to freely roam among these networks, the support of an interoperable handoff strategy for hybrid wireless data networks is a requirement that needs to be addressed. The current trend in wireless data networks is to offer multimedia access to mobile users by employing the wireless local area network (WLAN standard IEEE802.11 while the user is located indoors; on the other hand, 3rd generation wireless networks (WAN are being deployed to provide coverage while the user is located outdoors. As a result, the mobile node will require a handoff mechanism to allow the user to roam between WLAN and WAN environments; up to this date several strategies have been proposed (Sattari et al., 2004 and HyoJin, 2007 in the literature, however, none of these have been standardized to date. To support this interoperability, the mobile node must be equipped with configurable wireless inetrfaces to support the handoff between the WLAN and the WAN networks. In this work a new algorithm is proposed to allow a mobile node to roam between a wireless local area network (IEEE802.11 and a WAN base station (UMTS, while employing IP mobility support. The algorithm is implemented in simulation, using the Network Simulator 2.

WDM Network and Multicasting Protocol Strategies

Directory of Open Access Journals (Sweden)

Pinar Kirci

2014-01-01

Full Text Available Optical technology gains extensive attention and ever increasing improvement because of the huge amount of network traffic caused by the growing number of internet users and their rising demands. However, with wavelength division multiplexing (WDM, it is easier to take the advantage of optical networks and optical burst switching (OBS and to construct WDM networks with low delay rates and better data transparency these technologies are the best choices. Furthermore, multicasting in WDM is an urgent solution for bandwidth-intensive applications. In the paper, a new multicasting protocol with OBS is proposed. The protocol depends on a leaf initiated structure. The network is composed of source, ingress switches, intermediate switches, edge switches, and client nodes. The performance of the protocol is examined with Just Enough Time (JET and Just In Time (JIT reservation protocols. Also, the paper involves most of the recent advances about WDM multicasting in optical networks. WDM multicasting in optical networks is given as three common subtitles: Broadcast and-select networks, wavelength-routed networks, and OBS networks. Also, in the paper, multicast routing protocols are briefly summarized and optical burst switched WDM networks are investigated with the proposed multicast schemes.

Direct2Experts: a pilot national network to demonstrate interoperability among research-networking platforms

OpenAIRE

Weber, Griffin M; Barnett, William; Conlon, Mike; Eichmann, David; Kibbe, Warren; Falk-Krzesinski, Holly; Halaas, Michael; Johnson, Layne; Meeks, Eric; Mitchell, Donald; Schleyer, Titus; Stallings, Sarah; Warden, Michael; Kahlon, Maninder

2011-01-01

Research-networking tools use data-mining and social networking to enable expertise discovery, matchmaking and collaboration, which are important facets of team science and translational research. Several commercial and academic platforms have been built, and many institutions have deployed these products to help their investigators find local collaborators. Recent studies, though, have shown the growing importance of multiuniversity teams in science. Unfortunately, the lack of a standard dat...

Replicability and generalizability of PTSD networks

DEFF Research Database (Denmark)

Eiko I., Fried; Eidhof, Marloes B.; Palic, Sabina

2018-01-01

The growing literature conceptualizing mental disorders like Posttraumatic Stress Disorder (PTSD) as networks of interacting symptoms faces three key challenges. Prior studies predominantly used (a) small samples with low power for precise estimation, (b) non-clinical samples, and (c) single...... samples. This renders network structures in clinical data, and the extent to which networks replicate across datasets, unknown. To overcome these limitations, the present cross-cultural multisite study estimated regularized partial correlation networks of 16 PTSD symptoms across four datasets...... of traumatized patients receiving treatment for PTSD (total N=2,782). Despite differences in culture, trauma-type and severity of the samples, considerable similarities emerged, with moderate to high correlations between symptom profiles (0.43-0.82), network structures (0.62-0.74), and centrality estimates (0...

Percolation of interdependent network of networks

International Nuclear Information System (INIS)

Havlin, Shlomo; Stanley, H. Eugene; Bashan, Amir; Gao, Jianxi; Kenett, Dror Y.

2015-01-01

Complex networks appear in almost every aspect of science and technology. Previous work in network theory has focused primarily on analyzing single networks that do not interact with other networks, despite the fact that many real-world networks interact with and depend on each other. Very recently an analytical framework for studying the percolation properties of interacting networks has been introduced. Here we review the analytical framework and the results for percolation laws for a Network Of Networks (NONs) formed by n interdependent random networks. The percolation properties of a network of networks differ greatly from those of single isolated networks. In particular, because the constituent networks of a NON are connected by node dependencies, a NON is subject to cascading failure. When there is strong interdependent coupling between networks, the percolation transition is discontinuous (first-order) phase transition, unlike the well-known continuous second-order transition in single isolated networks. Moreover, although networks with broader degree distributions, e.g., scale-free networks, are more robust when analyzed as single networks, they become more vulnerable in a NON. We also review the effect of space embedding on network vulnerability. It is shown that for spatially embedded networks any finite fraction of dependency nodes will lead to abrupt transition

Growth strategies and governance of horizontal business networks: the case of the biggest German cooperative food retail network

Directory of Open Access Journals (Sweden)

Douglas Wegner

2011-08-01

Full Text Available Several growth strategies may be adopted by cooperative retail networks, but these strategies create dilemmas about how to organize business networks with a large number of participants and the adjustments in the governance system that are necessary to facilitate growth. The article examines the relations between the growth strategies adopted by a horizontal business network and its governance system. We analyze the case of Edeka, a centennial cooperative network, leader in food retail in Germany, showing its growth strategies and implications for the network structure. The case study was based on various secondary data sources and focuses the whole network – and not the networked firms – as the unit of analysis. Results indicate that, in order to grow, the network changed its governance structure and the process of participation of members in decision making, creating a hierarchical structure with professional management. The paper contributes to the discussions on cooperative governance and demonstrates that governance systems are transient and adapt to the network strategies. From a management viewpoint, the results show the effects of the growth strategies adopted by business networks, regarding the role of network managers and entrepreneurs in network management.

[Social networks in drinking behaviors among Japanese: support network, drinking network, and intervening network].

Science.gov (United States)

Yoshihara, Chika; Shimizu, Shinji

2005-10-01

The national representative sample was analyzed to examine the relationship between respondents' drinking practice and the social network which was constructed of three different types of network: support network, drinking network, and intervening network. Non-parametric statistical analysis was conducted with chi square method and ANOVA analysis, due to the risk of small samples in some basic tabulation cells. The main results are as follows: (1) In the support network of workplace associates, moderate drinkers enjoyed much more sociable support care than both nondrinkers and hard drinkers, which might suggest a similar effect as the French paradox. Meanwhile in the familial and kinship network, the more intervening care support was provided, the harder respondents' drinking practice. (2) The drinking network among Japanese people for both sexes is likely to be convergent upon certain types of network categories and not decentralized in various categories. This might reflect of the drinking culture of Japan, which permits people to drink everyday as a practice, especially male drinkers. Subsequently, solitary drinking is not optional for female drinkers. (3) Intervening network analysis showed that the harder the respondents' drinking practices, the more frequently their drinking behaviors were checked in almost all the categories of network. A rather complicated gender double-standard was found in the network of hard drinkers with their friends, particularly for female drinkers. Medical professionals played a similar intervening role for men as family and kinship networks but to a less degree than friends for females. The social network is considerably associated with respondents' drinking, providing both sociability for moderate drinkers and intervention for hard drinkers, depending on network categories. To minimize the risk of hard drinking and advance self-healthy drinking there should be more research development on drinking practice and the social network.

Network Neutrality : A Survey of the Economic Literature

NARCIS (Netherlands)

Schuett, F.

2010-01-01

This paper reviews the small but growing economic literature on network neutrality. It considers a number of possible departures from network neutrality, in particular termination fees, second-degree price discrimination, and vertical foreclosure.

TopoGen: A Network Topology Generation Architecture with application to automating simulations of Software Defined Networks

CERN Document Server

Laurito, Andres; The ATLAS collaboration

2017-01-01

Simulation is an important tool to validate the performance impact of control decisions in Software Defined Networks (SDN). Yet, the manual modeling of complex topologies that may change often during a design process can be a tedious error-prone task. We present TopoGen, a general purpose architecture and tool for systematic translation and generation of network topologies. TopoGen can be used to generate network simulation models automatically by querying information available at diverse sources, notably SDN controllers. The DEVS modeling and simulation framework facilitates a systematic translation of structured knowledge about a network topology into a formal modular and hierarchical coupling of preexisting or new models of network entities (physical or logical). TopoGen can be flexibly extended with new parsers and generators to grow its scope of applicability. This permits to design arbitrary workflows of topology transformations. We tested TopoGen in a network engineering project for the ATLAS detector ...

TopoGen: A Network Topology Generation Architecture with application to automating simulations of Software Defined Networks

CERN Document Server

Laurito, Andres; The ATLAS collaboration

2018-01-01

Simulation is an important tool to validate the performance impact of control decisions in Software Defined Networks (SDN). Yet, the manual modeling of complex topologies that may change often during a design process can be a tedious error-prone task. We present TopoGen, a general purpose architecture and tool for systematic translation and generation of network topologies. TopoGen can be used to generate network simulation models automatically by querying information available at diverse sources, notably SDN controllers. The DEVS modeling and simulation framework facilitates a systematic translation of structured knowledge about a network topology into a formal modular and hierarchical coupling of preexisting or new models of network entities (physical or logical). TopoGen can be flexibly extended with new parsers and generators to grow its scope of applicability. This permits to design arbitrary workflows of topology transformations. We tested TopoGen in a network engineering project for the ATLAS detector ...

Wireless Local Area Network (WLAN) Vulnerability Assessment and Security

National Research Council Canada - National Science Library

Kessel, Adam; Goodwin, Shane

2005-01-01

The proliferation of wireless computer equipment and Local Area Networks (LANs) create an increasingly common and growing threat to Marine Corps Network infrastructure and communication security (COMSEC...

A network architecture for International Business Satellite communications

Science.gov (United States)

Takahata, Fumio; Nohara, Mitsuo; Takeuchi, Yoshio

Demand Assignment (DA) control is expected to be introduced in the International Business Satellte communications (IBS) network in order to cope with a growing international business traffic. The paper discusses the DA/IBS network from the viewpoints of network configuration, satellite channel configuration and DA control. The network configuration proposed here consists of one Central Station with network management function and several Network Coordination Stations with user management function. A satellite channel configuration is also presented along with a tradeoff study on transmission bit rate, high power amplifier output power requirement, and service quality. The DA control flow and protocol based on CCITT Signalling System No. 7 are also proposed.

Complex networks principles, methods and applications

CERN Document Server

Latora, Vito; Russo, Giovanni

2017-01-01

Networks constitute the backbone of complex systems, from the human brain to computer communications, transport infrastructures to online social systems and metabolic reactions to financial markets. Characterising their structure improves our understanding of the physical, biological, economic and social phenomena that shape our world. Rigorous and thorough, this textbook presents a detailed overview of the new theory and methods of network science. Covering algorithms for graph exploration, node ranking and network generation, among the others, the book allows students to experiment with network models and real-world data sets, providing them with a deep understanding of the basics of network theory and its practical applications. Systems of growing complexity are examined in detail, challenging students to increase their level of skill. An engaging presentation of the important principles of network science makes this the perfect reference for researchers and undergraduate and graduate students in physics, ...

Regional Network on HIV/AIDS, Rural Livelihoods and Food ...

International Development Research Centre (IDRC) Digital Library (Canada)

Launched in 2001, the Regional Network on HIV/AIDS, Rural Livelihoods and Food Security (RENEWAL) is a growing network of networks made up of national food and nutrition organizations (public, private and nongovernmental) and partners in AIDS and public health. RENEWAL aims to understand and facilitate a ...

Growth and containment of a hierarchical criminal network

Science.gov (United States)

Marshak, Charles Z.; Rombach, M. Puck; Bertozzi, Andrea L.; D'Orsogna, Maria R.

2016-02-01

We model the hierarchical evolution of an organized criminal network via antagonistic recruitment and pursuit processes. Within the recruitment phase, a criminal kingpin enlists new members into the network, who in turn seek out other affiliates. New recruits are linked to established criminals according to a probability distribution that depends on the current network structure. At the same time, law enforcement agents attempt to dismantle the growing organization using pursuit strategies that initiate on the lower level nodes and that unfold as self-avoiding random walks. The global details of the organization are unknown to law enforcement, who must explore the hierarchy node by node. We halt the pursuit when certain local criteria of the network are uncovered, encoding if and when an arrest is made; the criminal network is assumed to be eradicated if the kingpin is arrested. We first analyze recruitment and study the large scale properties of the growing network; later we add pursuit and use numerical simulations to study the eradication probability in the case of three pursuit strategies, the time to first eradication, and related costs. Within the context of this model, we find that eradication becomes increasingly costly as the network increases in size and that the optimal way of arresting the kingpin is to intervene at the early stages of network formation. We discuss our results in the context of dark network disruption and their implications on possible law enforcement strategies.

The Emergence of Denmark’s Tax Treaty Network

DEFF Research Database (Denmark)

Schmidt, Peter Koerver

2018-01-01

This contribution analyzes the origin and creation of Denmark’s tax treaty network in a historical perspective. The development of the Danish treaty network is studied through an international perspective and by discussing a number of milestone events. It is concluded that the general tendency has...... pointed toward a continuously growing Danish treaty network and also that the question on abuse of the treaties has become of greater concern during the past decades. Moreover, it is argued that the growing number and importance of Denmark’s tax treaties over time created a need for the Danish parliament...... to be more directly involved in the conclusion of new tax treaties...

Computing and Network - Overview

International Nuclear Information System (INIS)

Jakubowski, Z.

1999-01-01

Full text: The responsibility of the Network Group covers: - providing central services like WWW, DNS (Domain Name Server), mail, etc.; - maintenance and support of the Local Area Networks,; - operation of the Wide Area Networks (LAN); - the support of the central UNIX servers and desktop workstations; - VAX/VMS cluster operation and support. The two-processor HP-UNIX K-200 and 6-processor SGI Challenge XL servers were delivering stable services to our users. Both servers were upgraded during the past year. SGI Challenge received additional 256 MB of memory. It was necessary in order to get all benefits of true 64-bit architecture of the SGI IRIX 6.2. The upgrade of our HP K-200 server were problematic so we decided to buy a new powerful machine and join the old and new machine via the fast network. Besides these main servers we have more than 30 workstations from IBM, DEC, HP, SGI and SUN. We observed a real race in PC technology in the past year. Intel processors deliver currently a performance that is comparable with HP or SUN workstations at very low costs. These CPU power is especially visible under Linux that is free Unix-like operating system. The clusters of cheap PC computers should be seriously considered in planning the computing power for the future experiments. The CPU power was further decentralized-smaller but powerful computers cover growing computing demands of our work-groups creating a small ''local computing centers''. The stable network and the concept of central services plays the essential role in this scenario. Unfortunately the network performance for the international communications is persistently unacceptable. We believe that attempts to join the European Quantum project is the only way to achieve the reasonable international network performance. In these plan polish scientific community will gain 34 Mbps international link. The growing costs of the ''real meetings'' give us no alternative to ''virtual meetings'' via the network in the

Modification Propagation in Complex Networks

Science.gov (United States)

Mouronte, Mary Luz; Vargas, María Luisa; Moyano, Luis Gregorio; Algarra, Francisco Javier García; Del Pozo, Luis Salvador

To keep up with rapidly changing conditions, business systems and their associated networks are growing increasingly intricate as never before. By doing this, network management and operation costs not only rise, but are difficult even to measure. This fact must be regarded as a major constraint to system optimization initiatives, as well as a setback to derived economic benefits. In this work we introduce a simple model in order to estimate the relative cost associated to modification propagation in complex architectures. Our model can be used to anticipate costs caused by network evolution, as well as for planning and evaluating future architecture development while providing benefit optimization.

Emerging localized food networks in Denmark

DEFF Research Database (Denmark)

Hansen, Mette Weinreich; Kristensen, Niels Heine

2012-01-01

, together with an analysis of how this has evolved and expanded. The challenges this rapid expansion puts on the internal network and organisation, and on the local food supplieres - the organic farmers - are elaborated in this paper. Also – from a rural sociology perspective – the interaction......One of the fastest growing food related social movements are citizen driven food networks. The Danish initiatives emerged in Copenhagen from an open culinary, social, environmental and organic oriented network. The theories and strategies of the original initiative is presented in this paper...

Vulnerability of network of networks

Science.gov (United States)

Havlin, S.; Kenett, D. Y.; Bashan, A.; Gao, J.; Stanley, H. E.

2014-10-01

Our dependence on networks - be they infrastructure, economic, social or others - leaves us prone to crises caused by the vulnerabilities of these networks. There is a great need to develop new methods to protect infrastructure networks and prevent cascade of failures (especially in cases of coupled networks). Terrorist attacks on transportation networks have traumatized modern societies. With a single blast, it has become possible to paralyze airline traffic, electric power supply, ground transportation or Internet communication. How, and at which cost can one restructure the network such that it will become more robust against malicious attacks? The gradual increase in attacks on the networks society depends on - Internet, mobile phone, transportation, air travel, banking, etc. - emphasize the need to develop new strategies to protect and defend these crucial networks of communication and infrastructure networks. One example is the threat of liquid explosives a few years ago, which completely shut down air travel for days, and has created extreme changes in regulations. Such threats and dangers warrant the need for new tools and strategies to defend critical infrastructure. In this paper we review recent advances in the theoretical understanding of the vulnerabilities of interdependent networks with and without spatial embedding, attack strategies and their affect on such networks of networks as well as recently developed strategies to optimize and repair failures caused by such attacks.

Information and influence propagation in social networks

CERN Document Server

Chen, Wei; Lakshmanan, Laks V S

2013-01-01

Research on social networks has exploded over the last decade. To a large extent, this has been fueled by the spectacular growth of social media and online social networking sites, which continue growing at a very fast pace, as well as by the increasing availability of very large social network datasets for purposes of research. A rich body of this research has been devoted to the analysis of the propagation of information, influence, innovations, infections, practices and customs through networks. Can we build models to explain the way these propagations occur? How can we validate our models

Mobile opportunistic networks architectures, protocols and applications

CERN Document Server

Denko, Mieso K

2011-01-01

Widespread availability of pervasive and mobile devices coupled with recent advances in networking technologies make opportunistic networks one of the most promising communication technologies for a growing number of future mobile applications. Covering the basics as well as advanced concepts, this book introduces state-of-the-art research findings, technologies, tools, and innovations. Prominent researchers from academia and industry report on communication architectures, network algorithms and protocols, emerging applications, experimental studies, simulation tools, implementation test beds,

Networks of networks – An introduction

International Nuclear Information System (INIS)

Kenett, Dror Y.; Perc, Matjaž; Boccaletti, Stefano

2015-01-01

Graphical abstract: Interdependent network reciprocity. Only those blue cooperative domains that are initially present on both networks survive. Abstract: This is an introduction to the special issue titled “Networks of networks” that is in the making at Chaos, Solitons & Fractals. Recent research and reviews attest to the fact that networks of networks are the next frontier in network science [1–7]. Not only are interactions limited and thus inadequately described by well-mixed models, it is also a fact that the networks that should be an integral part of such models are often interconnected, thus making the processes that are unfolding on them interdependent. From the World economy and transportation systems to social media, it is clear that processes taking place in one network might significantly affect what is happening in many other networks. Within an interdependent system, each type of interaction has a certain relevance and meaning, so that treating all the links identically inevitably leads to information loss. Networks of networks, interdependent networks, or multilayer networks are therefore a much better and realistic description of such systems, and this Special Issue is devoted to their structure, dynamics and evolution, as well as to the study of emergent properties in multi-layered systems in general. Topics of interest include but are not limited to the spread of epidemics and information, percolation, diffusion, synchronization, collective behavior, and evolutionary games on networks of networks. Interdisciplinary work on all aspects of networks of networks, regardless of background and motivation, is very welcome.

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.

Modeling of fluctuating reaction networks

International Nuclear Information System (INIS)

Lipshtat, A.; Biham, O.

2004-01-01

Full Text:Various dynamical systems are organized as reaction networks, where the population size of one component affects the populations of all its neighbors. Such networks can be found in interstellar surface chemistry, cell biology, thin film growth and other systems. I cases where the populations of reactive species are large, the network can be modeled by rate equations which provide all reaction rates within mean field approximation. However, in small systems that are partitioned into sub-micron size, these populations strongly fluctuate. Under these conditions rate equations fail and the master equation is needed for modeling these reactions. However, the number of equations in the master equation grows exponentially with the number of reactive species, severely limiting its feasibility for complex networks. Here we present a method which dramatically reduces the number of equations, thus enabling the incorporation of the master equation in complex reaction networks. The method is examplified in the context of reaction network on dust grains. Its applicability for genetic networks will be discussed. 1. Efficient simulations of gas-grain chemistry in interstellar clouds. Azi Lipshtat and Ofer Biham, Phys. Rev. Lett. 93 (2004), 170601. 2. Modeling of negative autoregulated genetic networks in single cells. Azi Lipshtat, Hagai B. Perets, Nathalie Q. Balaban and Ofer Biham, Gene: evolutionary genomics (2004), In press

Leveraging social networks for agricultural development in Africa

NARCIS (Netherlands)

Ross, Martha

2017-01-01

This thesis contributes to a growing literature that explores relationships between social networks and innovation diffusion within a developing country context. Given this context, the networks of interest within this thesis are the offline interpersonal relationships between community members.

Networks as systems.

Science.gov (United States)

Best, Allan; Berland, Alex; Greenhalgh, Trisha; Bourgeault, Ivy L; Saul, Jessie E; Barker, Brittany

2018-03-19

, and flexible structures and processes to accommodate the dynamic reality of these networks. Originality/value This case study builds on growing interest in the role of networks to foster large-scale change. The particular value rests on the longitudinal perspective on the evolution of a large, complex global network, and the use of theory to guide understanding.

Bootstrapping disaster: The challenge of growing and maintaining a cross-sector collaborative network.

Science.gov (United States)

Wachhaus, Aaron

This article examines the interaction of nonprofit and private actors with the traditional bureaucratic structures of government in central Pennsylvania&s recovery from hurricane Irene and tropical storm Lee. That effort relied heavily on private and nonprofit organizations as drivers of the response and recovery. The author maps the organizations involved in the recovery effort and explores the impact of the recovery effort on those organizations. A social network analysis was conducted and complemented with follow-up interviews with key actors. The network analysis reveals weak communication between sectors and a reliance on nonprofits to deliver services; interviews uncover the challenges of intersectoral collaboration. The author addresses the successes and limitations of the means by which a network of nonprofit efforts were coordinated with federal and state relief efforts and draw lessons for improving future practices. The author finds that this case deviates from theory in several ways that complicated community response and recovery. In particular, the challenges of developing and maintaining a recovery network while simultaneously delivering services placed great strain on several organizations, as well as on the fledgling network as a whole.

Selecting Optimal Parameters of Random Linear Network Coding for Wireless Sensor Networks

DEFF Research Database (Denmark)

Heide, J; Zhang, Qi; Fitzek, F H P

2013-01-01

This work studies how to select optimal code parameters of Random Linear Network Coding (RLNC) in Wireless Sensor Networks (WSNs). With Rateless Deluge [1] the authors proposed to apply Network Coding (NC) for Over-the-Air Programming (OAP) in WSNs, and demonstrated that with NC a significant...... reduction in the number of transmitted packets can be achieved. However, NC introduces additional computations and potentially a non-negligible transmission overhead, both of which depend on the chosen coding parameters. Therefore it is necessary to consider the trade-off that these coding parameters...... present in order to obtain the lowest energy consumption per transmitted bit. This problem is analyzed and suitable coding parameters are determined for the popular Tmote Sky platform. Compared to the use of traditional RLNC, these parameters enable a reduction in the energy spent per bit which grows...

S-curve networks and an approximate method for estimating degree distributions of complex networks

OpenAIRE

Guo, Jin-Li

2010-01-01

In the study of complex networks almost all theoretical models have the property of infinite growth, but the size of actual networks is finite. According to statistics from the China Internet IPv4 (Internet Protocol version 4) addresses, this paper proposes a forecasting model by using S curve (Logistic curve). The growing trend of IPv4 addresses in China is forecasted. There are some reference value for optimizing the distribution of IPv4 address resource and the development of IPv6. Based o...

Measuring the democratic anchorage of governance networks

DEFF Research Database (Denmark)

Fotel, Trine; Sørensen, Eva; Torfing, Jacob

There has been a growing debate about the democratic problems and potentials of governance networks among political scientists and public managers. While some claim that governance networks tend to undermine democracy, others argue that they have the potential to improve and strengthen democracy....... This debate is found wanting in two respects. First of all, there has been far too little discussion about what democracy means in relation to pluricentric governance networks. Second, the current debate builds on the assumption that it is possible to give a clear-cut answer to the question of the democratic...... problems and merits of governance networks. This assumption is highly questionable, and prevents a more nuanced assessment of the democratic performance of governance networks. As such, it diverts the focus of attention away from the fact that governance networks may be democratic in some respects...

Two statistical mechanics aspects of complex networks

Science.gov (United States)

Thurner, Stefan; Biely, Christoly

2006-12-01

By adopting an ensemble interpretation of non-growing rewiring networks, network theory can be reduced to a counting problem of possible network states and an identification of their associated probabilities. We present two scenarios of how different rewirement schemes can be used to control the state probabilities of the system. In particular, we review how by generalizing the linking rules of random graphs, in combination with superstatistics and quantum mechanical concepts, one can establish an exact relation between the degree distribution of any given network and the nodes’ linking probability distributions. In a second approach, we control state probabilities by a network Hamiltonian, whose characteristics are motivated by biological and socio-economical statistical systems. We demonstrate that a thermodynamics of networks becomes a fully consistent concept, allowing to study e.g. ‘phase transitions’ and computing entropies through thermodynamic relations.

Network Coded Software Defined Networking

DEFF Research Database (Denmark)

Krigslund, Jeppe; Hansen, Jonas; Roetter, Daniel Enrique Lucani

2015-01-01

Software Defined Networking (SDN) and Network Coding (NC) are two key concepts in networking that have garnered a large attention in recent years. On the one hand, SDN's potential to virtualize services in the Internet allows a large flexibility not only for routing data, but also to manage....... This paper advocates for the use of SDN to bring about future Internet and 5G network services by incorporating network coding (NC) functionalities. The inherent flexibility of both SDN and NC provides a fertile ground to envision more efficient, robust, and secure networking designs, that may also...

A network growth model based on the evolutionary ultimatum game

International Nuclear Information System (INIS)

Deng, L L; Zhou, G G; Cai, J H; Wang, C; Tang, W S

2012-01-01

In this paper, we provide a network growth model with incorporation into the ultimatum game dynamics. The network grows on the basis of the payoff-oriented preferential attachment mechanism, where a new node is added into the network and attached preferentially to nodes with higher payoffs. The interplay between the network growth and the game dynamics gives rise to quite interesting dynamical behaviors. Simulation results show the emergence of altruistic behaviors in the ultimatum game, which is affected by the growing network structure. Compared with the static counterpart case, the levels of altruistic behaviors are promoted. The corresponding strategy distributions and wealth distributions are also presented to further demonstrate the strategy evolutionary dynamics. Subsequently, we turn to the topological properties of the evolved network, by virtue of some statistics. The most studied characteristic path length and the clustering coefficient of the network are shown to indicate their small-world effect. Then the degree distributions are analyzed to clarify the interplay of structure and evolutionary dynamics. In particular, the difference between our growth network and the static counterpart is revealed. To explain clearly the evolved networks, the rich-club ordering and the assortative mixing coefficient are exploited to reveal the degree correlation. (paper)

Broadband network selection issues

Science.gov (United States)

Leimer, Michael E.

1996-01-01

Selecting the best network for a given cable or telephone company provider is not as obvious as it appears. The cost and performance trades between Hybrid Fiber Coax (HFC), Fiber to the Curb (FTTC) and Asymmetric Digital Subscriber Line networks lead to very different choices based on the existing plant and the expected interactive subscriber usage model. This paper presents some of the issues and trades that drive network selection. The majority of the Interactive Television trials currently underway or planned are based on HFC networks. As a throw away market trial or a short term strategic incursion into a cable market, HFC may make sense. In the long run, if interactive services see high demand, HFC costs per node and an ever shrinking neighborhood node size to service large numbers of subscribers make FTTC appear attractive. For example, thirty-three 64-QAM modulators are required to fill the 550 MHz to 750 MHz spectrum with compressed video streams in 6 MHz channels. This large amount of hardware at each node drives not only initial build-out costs, but operations and maintenance costs as well. FTTC, with its potential for digitally switching large amounts of bandwidth to an given home, offers the potential to grow with the interactive subscriber base with less downstream cost. Integrated telephony on these networks is an issue that appears to be an afterthought for most of the networks being selected at the present time. The major players seem to be videocentric and include telephony as a simple add-on later. This may be a reasonable view point for the telephone companies that plan to leave their existing phone networks untouched. However, a phone company planning a network upgrade or a cable company jumping into the telephony business needs to carefully weigh the cost and performance issues of the various network choices. Each network type provides varying capability in both upstream and downstream bandwidth for voice channels. The noise characteristics

Social networking sites as business tool: a study of user behavior

NARCIS (Netherlands)

Constantinides, Efthymios; Lorenzo-Romero, C.; Alarcon-del-Amo, M.d.C.; Glykas, M.

2013-01-01

Social Networking Sites (SNS) are second generation web applications allowing the creation of personal online networks; the social networking domain has become one of the fastest growing online environments connecting hundreds of millions of people worldwide. Businesses are increasingly interested

Modeling the citation network by network cosmology.

Science.gov (United States)

Xie, Zheng; Ouyang, Zhenzheng; Zhang, Pengyuan; Yi, Dongyun; Kong, Dexing

2015-01-01

Citation between papers can be treated as a causal relationship. In addition, some citation networks have a number of similarities to the causal networks in network cosmology, e.g., the similar in-and out-degree distributions. Hence, it is possible to model the citation network using network cosmology. The casual network models built on homogenous spacetimes have some restrictions when describing some phenomena in citation networks, e.g., the hot papers receive more citations than other simultaneously published papers. We propose an inhomogenous causal network model to model the citation network, the connection mechanism of which well expresses some features of citation. The node growth trend and degree distributions of the generated networks also fit those of some citation networks well.

Loss surface of XOR artificial neural networks

Science.gov (United States)

Mehta, Dhagash; Zhao, Xiaojun; Bernal, Edgar A.; Wales, David J.

2018-05-01

Training an artificial neural network involves an optimization process over the landscape defined by the cost (loss) as a function of the network parameters. We explore these landscapes using optimization tools developed for potential energy landscapes in molecular science. The number of local minima and transition states (saddle points of index one), as well as the ratio of transition states to minima, grow rapidly with the number of nodes in the network. There is also a strong dependence on the regularization parameter, with the landscape becoming more convex (fewer minima) as the regularization term increases. We demonstrate that in our formulation, stationary points for networks with Nh hidden nodes, including the minimal network required to fit the XOR data, are also stationary points for networks with Nh+1 hidden nodes when all the weights involving the additional node are zero. Hence, smaller networks trained on XOR data are embedded in the landscapes of larger networks. Our results clarify certain aspects of the classification and sensitivity (to perturbations in the input data) of minima and saddle points for this system, and may provide insight into dropout and network compression.

Network tomography : recent developments

NARCIS (Netherlands)

Castro, R.M.; Coates, M.; Liang, G.; Nowak, R.; Yu, B.

2004-01-01

Today’s Internet is a massive, distributed network which continues to explode in size as e-commerce and related activities grow. The heterogeneous and largely unregulated structure of the Internet renders tasks such as dynamic routing, optimized service provision, service level verification and

On IPTV network design

Science.gov (United States)

Li, Guangzhi; Wang, Dongmei

2007-11-01

With more service providers making considerable investments to roll out multimedia services using IP technology, multimedia distribution, especially broadcast TV distribution over an IP network, the so called IPTV, is expected to grow impressively over coming years. However, there are confusing concepts and claims for this new technology: What is IPTV? Why do we need IPTV? How does it work? What are the requirements to design an efficient IPTV network? Are there any research problems? What are the solutions? In this paper, we will try to provide initial answers to all those questions based on our understanding and research work.

Social networking mining, visualization, and security

CERN Document Server

Dehuri, Satchidananda; Wang, Gi-Nam

2014-01-01

With the proliferation of social media and on-line communities in networked world a large gamut of data has been collected and stored in databases. The rate at which such data is stored is growing at a phenomenal rate and pushing the classical methods of data analysis to their limits. This book presents an integrated framework of recent empirical and theoretical research on social network analysis based on a wide range of techniques from various disciplines like data mining, social sciences, mathematics, statistics, physics, network science, machine learning with visualization techniques, and security. The book illustrates the potential of multi-disciplinary techniques in various real life problems and intends to motivate researchers in social network analysis to design more effective tools by integrating swarm intelligence and data mining.  

Network Coded Software Defined Networking

DEFF Research Database (Denmark)

Hansen, Jonas; Roetter, Daniel Enrique Lucani; Krigslund, Jeppe

2015-01-01

Software defined networking has garnered large attention due to its potential to virtualize services in the Internet, introducing flexibility in the buffering, scheduling, processing, and routing of data in network routers. SDN breaks the deadlock that has kept Internet network protocols stagnant...... for decades, while applications and physical links have evolved. This article advocates for the use of SDN to bring about 5G network services by incorporating network coding (NC) functionalities. The latter constitutes a major leap forward compared to the state-of-the- art store and forward Internet paradigm...

Green mobile networks a networking perspective

CERN Document Server

Ansari, Nirwan

2016-01-01

Combines the hot topics of energy efficiency and next generation mobile networking, examining techniques and solutions. Green communications is a very hot topic. Ever increasing mobile network bandwidth rates significantly impacts on operating costs due to aggregate network energy consumption. As such, design on 4G networks and beyond has increasingly started to focus on 'energy efficiency' or so-called 'green' networks. Many techniques and solutions have been proposed to enhance the energy efficiency of mobile networks, yet no book has provided an in-depth analysis of the energy consumption issues in mobile networks nor offers detailed theories, tools and solutions for solving the energy efficiency problems.

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.

Structural properties and complexity of a new network class: Collatz step graphs.

Directory of Open Access Journals (Sweden)

Frank Emmert-Streib

Full Text Available In this paper, we introduce a biologically inspired model to generate complex networks. In contrast to many other construction procedures for growing networks introduced so far, our method generates networks from one-dimensional symbol sequences that are related to the so called Collatz problem from number theory. The major purpose of the present paper is, first, to derive a symbol sequence from the Collatz problem, we call the step sequence, and investigate its structural properties. Second, we introduce a construction procedure for growing networks that is based on these step sequences. Third, we investigate the structural properties of this new network class including their finite scaling and asymptotic behavior of their complexity, average shortest path lengths and clustering coefficients. Interestingly, in contrast to many other network models including the small-world network from Watts & Strogatz, we find that CS graphs become 'smaller' with an increasing size.

Topology of the European Network of Earth Observation Networks and the need for an European Network of Networks

Science.gov (United States)

Masó, Joan; Serral, Ivette; McCallum, Ian; Blonda, Palma; Plag, Hans-Peter

2016-04-01

ConnectinGEO (Coordinating an Observation Network of Networks EnCompassing saTellite and IN-situ to fill the Gaps in European Observations" is an H2020 Coordination and Support Action with the primary goal of linking existing Earth Observation networks with science and technology (S&T) communities, the industry sector, the Group on Earth Observations (GEO), and Copernicus. The project will end in February 2017. ConnectinGEO will initiate a European Network of Earth Observation Networks (ENEON) that will encompass space-based, airborne and in-situ observations networks. ENEON will be composed of project partners representing thematic observation networks along with the GEOSS Science and Technology Stakeholder Network, GEO Communities of Practices, Copernicus services, Sentinel missions and in-situ support data representatives, representatives of the European space-based, airborne and in-situ observations networks. This communication presents the complex panorama of Earth Observations Networks in Europe. The list of networks is classified by discipline, variables, geospatial scope, etc. We also capture the membership and relations with other networks and umbrella organizations like GEO. The result is a complex interrelation between networks that can not be clearly expressed in a flat list. Technically the networks can be represented as nodes with relations between them as lines connecting the nodes in a graph. We have chosen RDF as a language and an AllegroGraph 3.3 triple store that is visualized in several ways using for example Gruff 5.7. Our final aim is to identify gaps in the EO Networks and justify the need for a more structured coordination between them.

Network traffic intelligence using a low interaction honeypot

Science.gov (United States)

Nyamugudza, Tendai; Rajasekar, Venkatesh; Sen, Prasad; Nirmala, M.; Madhu Viswanatham, V.

2017-11-01

Advancements in networking technology have seen more and more devices becoming connected day by day. This has given organizations capacity to extend their networks beyond their boundaries to remote offices and remote employees. However as the network grows security becomes a major challenge since the attack surface also increases. There is need to guard the network against different types of attacks like intrusion and malware through using different tools at different networking levels. This paper describes how network intelligence can be acquired through implementing a low-interaction honeypot which detects and track network intrusion. Honeypot allows an organization to interact and gather information about an attack earlier before it compromises the network. This process is important because it allows the organization to learn about future attacks of the same nature and allows them to develop counter measures. The paper further shows how honeypot-honey net based model for interruption detection system (IDS) can be used to get the best valuable information about the attacker and prevent unexpected harm to the network.

Stability of glassy hierarchical networks

Science.gov (United States)

Zamani, M.; Camargo-Forero, L.; Vicsek, T.

2018-02-01

The structure of interactions in most animal and human societies can be best represented by complex hierarchical networks. In order to maintain close-to-optimal function both stability and adaptability are necessary. Here we investigate the stability of hierarchical networks that emerge from the simulations of an organization type with an efficiency function reminiscent of the Hamiltonian of spin glasses. Using this quantitative approach we find a number of expected (from everyday observations) and highly non-trivial results for the obtained locally optimal networks, including, for example: (i) stability increases with growing efficiency and level of hierarchy; (ii) the same perturbation results in a larger change for more efficient states; (iii) networks with a lower level of hierarchy become more efficient after perturbation; (iv) due to the huge number of possible optimal states only a small fraction of them exhibit resilience and, finally, (v) ‘attacks’ targeting the nodes selectively (regarding their position in the hierarchy) can result in paradoxical outcomes.

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.

LHCb: F.E.C. for DAQ networks

CERN Multimedia

Floros, G; Neufeld, N

2014-01-01

The demand for faster and more reliable networks is growing day by day both in commercial and scientific applications, driving many innovations in network protocols, fiber optics and network-controllers. Operating fast links on relatively inexpensive hardware is a very important challenging aspect of this. One important way to enable this is to provide the network with an existing mechanism of error correction, called Forward Error Correction (F.E.C.). Although error-correcting codes exist for over six decades and F.E.C. is applied in various projects, it is still not widespread in Ethernet networks. F.E.C. introduces a very cost effective way to expand the limits of any network based on micro-controllers synthesized on FPGAs, but it is provided only for specific applications, such as backplane systems. Most of the FPGA and/or IP core vendors either do not provide this feature on their Ethernet implementations or their F.E.C. implementations are based on Ethernet micro-controllers that have a different struct...

Functional Topology of Evolving Urban Drainage Networks

Science.gov (United States)

Yang, Soohyun; Paik, Kyungrock; McGrath, Gavan S.; Urich, Christian; Krueger, Elisabeth; Kumar, Praveen; Rao, P. Suresh C.

2017-11-01

We investigated the scaling and topology of engineered urban drainage networks (UDNs) in two cities, and further examined UDN evolution over decades. UDN scaling was analyzed using two power law scaling characteristics widely employed for river networks: (1) Hack's law of length (L)-area (A) [L∝Ah] and (2) exceedance probability distribution of upstream contributing area (δ) [P>(A≥δ>)˜aδ-ɛ]. For the smallest UDNs ((A≥δ>) plots for river networks are abruptly truncated, those for UDNs display exponential tempering [P>(A≥δ>)=aδ-ɛexp⁡>(-cδ>)]. The tempering parameter c decreases as the UDNs grow, implying that the distribution evolves in time to resemble those for river networks. However, the power law exponent ɛ for large UDNs tends to be greater than the range reported for river networks. Differences in generative processes and engineering design constraints contribute to observed differences in the evolution of UDNs and river networks, including subnet heterogeneity and nonrandom branching.

An evolving network model with modular growth

International Nuclear Information System (INIS)

Zou Zhi-Yun; Liu Peng; Lei Li; Gao Jian-Zhi

2012-01-01

In this paper, we propose an evolving network model growing fast in units of module, according to the analysis of the evolution characteristics in real complex networks. Each module is a small-world network containing several interconnected nodes and the nodes between the modules are linked by preferential attachment on degree of nodes. We study the modularity measure of the proposed model, which can be adjusted by changing the ratio of the number of inner-module edges and the number of inter-module edges. In view of the mean-field theory, we develop an analytical function of the degree distribution, which is verified by a numerical example and indicates that the degree distribution shows characteristics of the small-world network and the scale-free network distinctly at different segments. The clustering coefficient and the average path length of the network are simulated numerically, indicating that the network shows the small-world property and is affected little by the randomness of the new module. (interdisciplinary physics and related areas of science and technology)

Cloud networking understanding cloud-based data center networks

CERN Document Server

Lee, Gary

2014-01-01

Cloud Networking: Understanding Cloud-Based Data Center Networks explains the evolution of established networking technologies into distributed, cloud-based networks. Starting with an overview of cloud technologies, the book explains how cloud data center networks leverage distributed systems for network virtualization, storage networking, and software-defined networking. The author offers insider perspective to key components that make a cloud network possible such as switch fabric technology and data center networking standards. The final chapters look ahead to developments in architectures

On achieving network throughput demand in cognitive radio-based home area networks

NARCIS (Netherlands)

Sarijari, M.A.B.; Abdullah, M.S.; Janssen, G.J.M.; Van der Veen, A.J.

2015-01-01

The growing number of wireless devices for in-house use is causing a more intense use of the spectrum to satisfy the required quality-of-service such as throughput. This has contributed to spectrum scarcity and interference problems particularly in home area networks (HAN). Cognitive radio (CR) has

Corporate governance in a networked age

NARCIS (Netherlands)

Vermeulen, Erik

2015-01-01

In a networked and digital age, we need to rethink the structure of the modern corporation. In order to survive and grow, corporations must operate with a new set of assumptions and principles in order to remain relevant, competitive, and successful. Consider the growing number of technology startup

Deterministic bound for avionics switched networks according to networking features using network calculus

Directory of Open Access Journals (Sweden)

Feng HE

2017-12-01

Full Text Available The state of the art avionics system adopts switched networks for airborne communications. A major concern in the design of the networks is the end-to-end guarantee ability. Analytic methods have been developed to compute the worst-case delays according to the detailed configurations of flows and networks within avionics context, such as network calculus and trajectory approach. It still lacks a relevant method to make a rapid performance estimation according to some typically switched networking features, such as networking scale, bandwidth utilization and average flow rate. The goal of this paper is to establish a deterministic upper bound analysis method by using these networking features instead of the complete network configurations. Two deterministic upper bounds are proposed from network calculus perspective: one is for a basic estimation, and another just shows the benefits from grouping strategy. Besides, a mathematic expression for grouping ability is established based on the concept of network connecting degree, which illustrates the possibly minimal grouping benefit. For a fully connected network with 4 switches and 12 end systems, the grouping ability coming from grouping strategy is 15–20%, which just coincides with the statistical data (18–22% from the actual grouping advantage. Compared with the complete network calculus analysis method for individual flows, the effectiveness of the two deterministic upper bounds is no less than 38% even with remarkably varied packet lengths. Finally, the paper illustrates the design process for an industrial Avionics Full DupleX switched Ethernet (AFDX networking case according to the two deterministic upper bounds and shows that a better control for network connecting, when designing a switched network, can improve the worst-case delays dramatically. Keywords: Deterministic bound, Grouping ability, Network calculus, Networking features, Switched networks

Integrated computer network high-speed parallel interface

International Nuclear Information System (INIS)

Frank, R.B.

1979-03-01

As the number and variety of computers within Los Alamos Scientific Laboratory's Central Computer Facility grows, the need for a standard, high-speed intercomputer interface has become more apparent. This report details the development of a High-Speed Parallel Interface from conceptual through implementation stages to meet current and future needs for large-scle network computing within the Integrated Computer Network. 4 figures

Cloud RAN for Mobile Networks - a Technology Overview

DEFF Research Database (Denmark)

Checko, Aleksandra; Christiansen, Henrik Lehrmann; Yan, Ying

2014-01-01

Cloud Radio Access Network (C-RAN) is a novel mobile network architecture which can address a number of challenges the operators face while trying to support growing end-user’s needs. The main idea behind C-RAN is to pool the Baseband Units (BBUs) from multiple base stations into centralized BBU...

Traffic dynamics on coupled spatial networks

International Nuclear Information System (INIS)

Du, Wen-Bo; Zhou, Xing-Lian; Chen, Zhen; Cai, Kai-Quan; Cao, Xian-Bin

2014-01-01

With the rapid development of modern traffic, various means of transportation systems make it more convenient and diversified for passengers to travel out. In this paper, we establish a two-layered spatial network model where the low-speed lower layer is a regular lattice and the high-speed upper layer is a scale-free network embedded in the lattice. Passengers will travel along the path with the minimal travel time, and they can transfer from one layer to the other, which will induce extra transfer cost. We extensively investigate the traffic process on these coupled spatial networks and focus on the effect of the parameter α, the speed ratio between two networks. It is found that, as α grows, the network capacity of the coupled networks increases in the early stage and then decreases, indicating that cooperation between the coupled networks will induce the highest network capacity at an optimal α. We then provide an explanation for this non-monotonous dependence from a micro-scope point of view. The travel time reliability is also examined. Both in free-flow state and congestion state, the travel time is linearly related to the Euclidean distance. However, the variance of travel time in the congestion state is remarkably larger than that in the free-flow state, namely, people have to set aside more redundant time in an unreliable traffic system

Towards green high capacity optical networks

Science.gov (United States)

Glesk, I.; Mohd Warip, M. N.; Idris, S. K.; Osadola, T. B.; Andonovic, I.

2011-09-01

The demand for fast, secure, energy efficient high capacity networks is growing. It is fuelled by transmission bandwidth needs which will support among other things the rapid penetration of multimedia applications empowering smart consumer electronics and E-businesses. All the above trigger unparallel needs for networking solutions which must offer not only high-speed low-cost "on demand" mobile connectivity but should be ecologically friendly and have low carbon footprint. The first answer to address the bandwidth needs was deployment of fibre optic technologies into transport networks. After this it became quickly obvious that the inferior electronic bandwidth (if compared to optical fiber) will further keep its upper hand on maximum implementable serial data rates. A new solution was found by introducing parallelism into data transport in the form of Wavelength Division Multiplexing (WDM) which has helped dramatically to improve aggregate throughput of optical networks. However with these advancements a new bottleneck has emerged at fibre endpoints where data routers must process the incoming and outgoing traffic. Here, even with the massive and power hungry electronic parallelism routers today (still relying upon bandwidth limiting electronics) do not offer needed processing speeds networks demands. In this paper we will discuss some novel unconventional approaches to address network scalability leading to energy savings via advance optical signal processing. We will also investigate energy savings based on advanced network management through nodes hibernation proposed for Optical IP networks. The hibernation reduces the network overall power consumption by forming virtual network reconfigurations through selective nodes groupings and by links segmentations and partitionings.

Cascading Failures and Recovery in Networks of Networks

Science.gov (United States)

Havlin, Shlomo

Network science have been focused on the properties of a single isolated network that does not interact or depends on other networks. In reality, many real-networks, such as power grids, transportation and communication infrastructures interact and depend on other networks. I will present a framework for studying the vulnerability and the recovery of networks of interdependent networks. In interdependent networks, when nodes in one network fail, they cause dependent nodes in other networks to also fail. This is also the case when some nodes like certain locations play a role in two networks -multiplex. This may happen recursively and can lead to a cascade of failures and to a sudden fragmentation of the system. I will present analytical solutions for the critical threshold and the giant component of a network of n interdependent networks. I will show, that the general theory has many novel features that are not present in the classical network theory. When recovery of components is possible global spontaneous recovery of the networks and hysteresis phenomena occur and the theory suggests an optimal repairing strategy of system of systems. I will also show that interdependent networks embedded in space are significantly more vulnerable compared to non embedded networks. In particular, small localized attacks may lead to cascading failures and catastrophic consequences.Thus, analyzing data of real network of networks is highly required to understand the system vulnerability. DTRA, ONR, Israel Science Foundation.

Cloud RAN for Mobile Networks - a Technology Overview

OpenAIRE

Checko, Aleksandra; Christiansen, Henrik Lehrmann; Yan, Ying; Scolari, Lara; Kardaras, Georgios; Berger, Michael Stübert; Dittmann, Lars

2014-01-01

Cloud Radio Access Network (C-RAN) is a novel mobile network architecture which can address a number of challenges the operators face while trying to support growing end-user’s needs. The main idea behind C-RAN is to pool the Baseband Units (BBUs) from multiple base stations into centralized BBU Pool for statistical multiplexing gain, while shifting the burden to the high-speed wireline transmission of In-phase and Quadrature (IQ) data. C-RAN enables energy efficient network operation and pos...

Performance in wireless networks and industrial wireless networks on control processes in real time under industrial environments

Directory of Open Access Journals (Sweden)

Juan F. Monsalve-Posada

2015-01-01

Full Text Available The growing use of Ethernet networks on the industrial automation pyramid has led many companies to develop new devices to operate in requirements of this level, nowadays it is called Industrial Ethernet network, on the market there are various sensors and actuators to industrial scale equipped with this technology, many of these devices are very expensive. In this paper, the performance of two wireless networks is evaluated, the first network has conventional Ethernet devices, and the second network has Industrial Ethernet devices. For the process we vary four parameters such as distance, number of bytes, the signal to noise ratio, and the packet error rate, and then we measure delays and compare with metric statistics results, Box Plot graphs were used for the analysis. Finally, we conclude that under the parameters and conditions tested, wireless networks can serve as a communication system in control applications with allowable delays of up to 50 ms, in addition, the results show a better performance of Industrial Ethernet networks over conventional networks, with differences in the RTT of milliseconds. Therefore, it is recommended to establish what risk is for the process to control these delays to determine if the equipment conventional applies, since under certain features like humidity and temperature can operate properly for a considerable time and at lower cost than devices to Industrial Ethernet.

Characterizing Topology of Probabilistic Biological Networks.

Science.gov (United States)

Todor, Andrei; Dobra, Alin; Kahveci, Tamer

2013-09-06

Biological interactions are often uncertain events, that may or may not take place with some probability. Existing studies analyze the degree distribution of biological networks by assuming that all the given interactions take place under all circumstances. This strong and often incorrect assumption can lead to misleading results. Here, we address this problem and develop a sound mathematical basis to characterize networks in the presence of uncertain interactions. We develop a method that accurately describes the degree distribution of such networks. We also extend our method to accurately compute the joint degree distributions of node pairs connected by edges. The number of possible network topologies grows exponentially with the number of uncertain interactions. However, the mathematical model we develop allows us to compute these degree distributions in polynomial time in the number of interactions. It also helps us find an adequate mathematical model using maximum likelihood estimation. Our results demonstrate that power law and log-normal models best describe degree distributions for probabilistic networks. The inverse correlation of degrees of neighboring nodes shows that, in probabilistic networks, nodes with large number of interactions prefer to interact with those with small number of interactions more frequently than expected.

A Bayesian Approach to Measurement Bias in Networking Studies

NARCIS (Netherlands)

Zhu, Ling; Robinson, Scott E.; Torenvlied, René

2014-01-01

The study of managerial networking has been growing in the field of public administration; a field that analyzes how managers in open system organizations interact with different external actors and organizations. Coincident with this interest in managerial networking is the use of self-reported

Stability indicators in network reconstruction.

Directory of Open Access Journals (Sweden)

Michele Filosi

Full Text Available The number of available algorithms to infer a biological network from a dataset of high-throughput measurements is overwhelming and keeps growing. However, evaluating their performance is unfeasible unless a 'gold standard' is available to measure how close the reconstructed network is to the ground truth. One measure of this is the stability of these predictions to data resampling approaches. We introduce NetSI, a family of Network Stability Indicators, to assess quantitatively the stability of a reconstructed network in terms of inference variability due to data subsampling. In order to evaluate network stability, the main NetSI methods use a global/local network metric in combination with a resampling (bootstrap or cross-validation procedure. In addition, we provide two normalized variability scores over data resampling to measure edge weight stability and node degree stability, and then introduce a stability ranking for edges and nodes. A complete implementation of the NetSI indicators, including the Hamming-Ipsen-Mikhailov (HIM network distance adopted in this paper is available with the R package nettools. We demonstrate the use of the NetSI family by measuring network stability on four datasets against alternative network reconstruction methods. First, the effect of sample size on stability of inferred networks is studied in a gold standard framework on yeast-like data from the Gene Net Weaver simulator. We also consider the impact of varying modularity on a set of structurally different networks (50 nodes, from 2 to 10 modules, and then of complex feature covariance structure, showing the different behaviours of standard reconstruction methods based on Pearson correlation, Maximum Information Coefficient (MIC and False Discovery Rate (FDR strategy. Finally, we demonstrate a strong combined effect of different reconstruction methods and phenotype subgroups on a hepatocellular carcinoma miRNA microarray dataset (240 subjects, and we

Telecommunications energy and greenhouse gas emissions management for future network growth

International Nuclear Information System (INIS)

Chan, Chien Aun; Gygax, André F.; Leckie, Christopher; Wong, Elaine; Nirmalathas, Ampalavanapillai; Hinton, Kerry

2016-01-01

Highlights: • Model to evaluate key interdependencies of a fast growing telecommunications network. • Network growth analysis using real data and Monte Carlo simulation. • Importance of both operational and embodied energy efficiency improvements. • Embodied energy expected to dominate in the future under current energy efficiency trends. • Carbon footprint and energy management through optimum network replacement cycle. - Abstract: A key aspect of greener network deployment is how to achieve sustainable growth of a telecommunications network, both in terms of operational and embodied energy. Hence, in this paper we investigate how the overall energy consumption and greenhouse gas emissions of a fast growing telecommunications network can be minimized. Due to the complexities in modeling the embodied energy of networks, this aspect of energy consumption has received limited attention by network operators. Here, we present the first model to evaluate the interdependencies of the four main contributing factors in managing the sustainable growth of a telecommunications network: (i) the network’s operational energy consumption; (ii) the embodied energy of network equipment; (iii) network traffic growth; and (iv) the expected energy efficiency improvements in both the operational and embodied phases. Using Monte Carlo techniques with real network data, our results demonstrate that under the current trends in overall energy efficiency improvements the network embodied energy will account for over 40% of the total network energy in 2025 compared to 20% in 2015. Further, we find that the optimum equipment replacement cycle, which will result in the lowest total network life cycle energy, is directly dependent on the technological progress in energy efficiency improvements of both operational and embodied phases. Our model and analysis highlight the need for a comprehensive approach to better understand the interactions between network growth, technological

Traffic Dynamics of Computer Networks

Science.gov (United States)

Fekete, Attila

2008-10-01

Two important aspects of the Internet, namely the properties of its topology and the characteristics of its data traffic, have attracted growing attention of the physics community. My thesis has considered problems of both aspects. First I studied the stochastic behavior of TCP, the primary algorithm governing traffic in the current Internet, in an elementary network scenario consisting of a standalone infinite-sized buffer and an access link. The effect of the fast recovery and fast retransmission (FR/FR) algorithms is also considered. I showed that my model can be extended further to involve the effect of link propagation delay, characteristic of WAN. I continued my thesis with the investigation of finite-sized semi-bottleneck buffers, where packets can be dropped not only at the link, but also at the buffer. I demonstrated that the behavior of the system depends only on a certain combination of the parameters. Moreover, an analytic formula was derived that gives the ratio of packet loss rate at the buffer to the total packet loss rate. This formula makes it possible to treat buffer-losses as if they were link-losses. Finally, I studied computer networks from a structural perspective. I demonstrated through fluid simulations that the distribution of resources, specifically the link bandwidth, has a serious impact on the global performance of the network. Then I analyzed the distribution of edge betweenness in a growing scale-free tree under the condition that a local property, the in-degree of the "younger" node of an arbitrary edge, is known in order to find an optimum distribution of link capacity. The derived formula is exact even for finite-sized networks. I also calculated the conditional expectation of edge betweenness, rescaled for infinite networks.

Energy efficiency analysis for flexible-grid OFDM-based optical networks

DEFF Research Database (Denmark)

Vizcaíno, Jorge López; Ye, Yabin; Tafur Monroy, Idelfonso

2012-01-01

As the Internet traffic grows, the energy efficiency gains more attention as a design factor for the planning and operation of telecommunication networks. This paper is devoted to the study of energy efficiency in optical transport networks, comparing the performance of an innovative flexible......-grid network based on Orthogonal Frequency Division Multiplexing (OFDM) with that of conventional fixed-grid Wavelength Division Multiplexing (WDM) networks with a Single Line Rate (SLR) and with a Mixed Line Rate (MLR) operation. The power consumption values of the network elements are introduced. Energy......-aware heuristic algorithms are proposed for the resource allocation both in static (offline) and dynamic (online) scenarios with time-varying demands for the Elastic-bandwidth OFDM-based network and the WDM networks (with SLR and MLR). The energy efficiency performance of the two network technologies under...

DOE Network 2025: Network Research Problems and Challenges for DOE Scientists. Workshop Report

Energy Technology Data Exchange (ETDEWEB)

None, None

2016-02-01

The growing investments in large science instruments and supercomputers by the US Department of Energy (DOE) hold enormous promise for accelerating the scientific discovery process. They facilitate unprecedented collaborations of geographically dispersed teams of scientists that use these resources. These collaborations critically depend on the production, sharing, moving, and management of, as well as interactive access to, large, complex data sets at sites dispersed across the country and around the globe. In particular, they call for significant enhancements in network capacities to sustain large data volumes and, equally important, the capabilities to collaboratively access the data across computing, storage, and instrument facilities by science users and automated scripts and systems. Improvements in network backbone capacities of several orders of magnitude are essential to meet these challenges, in particular, to support exascale initiatives. Yet, raw network speed represents only a part of the solution. Indeed, the speed must be matched by network and transport layer protocols and higher layer tools that scale in ways that aggregate, compose, and integrate the disparate subsystems into a complete science ecosystem. Just as important, agile monitoring and management services need to be developed to operate the network at peak performance levels. Finally, these solutions must be made an integral part of the production facilities by using sound approaches to develop, deploy, diagnose, operate, and maintain them over the science infrastructure.

Data center networks and network architecture

Science.gov (United States)

Esaki, Hiroshi

2014-02-01

This paper discusses and proposes the architectural framework, which is for data center networks. The data center networks require new technical challenges, and it would be good opportunity to change the functions, which are not need in current and future networks. Based on the observation and consideration on data center networks, this paper proposes; (i) Broadcast-free layer 2 network (i.e., emulation of broadcast at the end-node), (ii) Full-mesh point-to-point pipes, and (iii) IRIDES (Invitation Routing aDvertisement for path Engineering System).

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.

Vulnerability and controllability of networks of networks

International Nuclear Information System (INIS)

Liu, Xueming; Peng, Hao; Gao, Jianxi

2015-01-01

Network science is a highly interdisciplinary field ranging from natural science to engineering technology and it has been applied to model complex systems and used to explain their behaviors. Most previous studies have been focus on isolated networks, but many real-world networks do in fact interact with and depend on other networks via dependency connectivities, forming “networks of networks” (NON). The interdependence between networks has been found to largely increase the vulnerability of interacting systems, when a node in one network fails, it usually causes dependent nodes in other networks to fail, which, in turn, may cause further damage on the first network and result in a cascade of failures with sometimes catastrophic consequences, e.g., electrical blackouts caused by the interdependence of power grids and communication networks. The vulnerability of a NON can be analyzed by percolation theory that can be used to predict the critical threshold where a NON collapses. We review here the analytic framework for analyzing the vulnerability of NON, which yields novel percolation laws for n-interdependent networks and also shows that percolation theory of a single network studied extensively in physics and mathematics in the last 50 years is a specific limited case of the more general case of n interacting networks. Understanding the mechanism behind the cascading failure in NON enables us finding methods to decrease the vulnerability of the natural systems and design of more robust infrastructure systems. By examining the vulnerability of NON under targeted attack and studying the real interdependent systems, we find two methods to decrease the systems vulnerability: (1) protect the high-degree nodes, and (2) increase the degree correlation between networks. Furthermore, the ultimate proof of our understanding of natural and technological systems is reflected in our ability to control them. We also review the recent studies and challenges on the

Data and Network Science for Noisy Heterogeneous Systems

Science.gov (United States)

Rider, Andrew Kent

2013-01-01

Data in many growing fields has an underlying network structure that can be taken advantage of. In this dissertation we apply data and network science to problems in the domains of systems biology and healthcare. Data challenges in these fields include noisy, heterogeneous data, and a lack of ground truth. The primary thesis of this work is that…

Network coding at different layers in wireless networks

CERN Document Server

2016-01-01

This book focuses on how to apply network coding at different layers in wireless networks – including MAC, routing, and TCP – with special focus on cognitive radio networks. It discusses how to select parameters in network coding (e.g., coding field, number of packets involved, and redundant information ration) in order to be suitable for the varying wireless environments. The book explores how to deploy network coding in MAC to improve network performance and examines joint network coding with opportunistic routing to improve the successful rate of routing. In regards to TCP and network coding, the text considers transport layer protocol working with network coding to overcome the transmission error rate, particularly with how to use the ACK feedback of TCP to enhance the efficiency of network coding. The book pertains to researchers and postgraduate students, especially whose interests are in opportunistic routing and TCP in cognitive radio networks.

Distributed Data Networks That Support Public Health Information Needs.

Science.gov (United States)

Tabano, David C; Cole, Elizabeth; Holve, Erin; Davidson, Arthur J

Data networks, consisting of pooled electronic health data assets from health care providers serving different patient populations, promote data sharing, population and disease monitoring, and methods to assess interventions. Better understanding of data networks, and their capacity to support public health objectives, will help foster partnerships, expand resources, and grow learning health systems. We conducted semistructured interviews with 16 key informants across the United States, identified as network stakeholders based on their respective experience in advancing health information technology and network functionality. Key informants were asked about their experience with and infrastructure used to develop data networks, including each network's utility to identify and characterize populations, usage, and sustainability. Among 11 identified data networks representing hundreds of thousands of patients, key informants described aggregated health care clinical data contributing to population health measures. Key informant interview responses were thematically grouped to illustrate how networks support public health, including (1) infrastructure and information sharing; (2) population health measures; and (3) network sustainability. Collaboration between clinical data networks and public health entities presents an opportunity to leverage infrastructure investments to support public health. Data networks can provide resources to enhance population health information and infrastructure.

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.

Beyond the networks

DEFF Research Database (Denmark)

Andreasen, Manja Hoppe; Møller-Jensen, Lasse

2016-01-01

This paper offers insights from comprehensive case studies of rapidly growing peripheral settlements of Dar es Salaam. The paper explores how a broad range of services and infrastructures have developed and improved over time, and how residents have been engaged in this in various ways. The gradual...... improvements in services and infrastructure are to some extent created, organized and financed by residents through informal self-help solutions, which are often costly and place huge strains on residents' time and resources. Alongside this, residents are also involved in attracting formal service providers...... through applications, co-financing of network extensions as well as lobbying efforts towards urban authorities and service providers. The formal service providers primarily take a reactive role, responding to demand, requests and political pressure from residents. Post-settlement network extensions...

Fast network centrality analysis using GPUs

Directory of Open Access Journals (Sweden)

Shi Zhiao

2011-05-01

Full Text Available Abstract Background With the exploding volume of data generated by continuously evolving high-throughput technologies, biological network analysis problems are growing larger in scale and craving for more computational power. General Purpose computation on Graphics Processing Units (GPGPU provides a cost-effective technology for the study of large-scale biological networks. Designing algorithms that maximize data parallelism is the key in leveraging the power of GPUs. Results We proposed an efficient data parallel formulation of the All-Pairs Shortest Path problem, which is the key component for shortest path-based centrality computation. A betweenness centrality algorithm built upon this formulation was developed and benchmarked against the most recent GPU-based algorithm. Speedup between 11 to 19% was observed in various simulated scale-free networks. We further designed three algorithms based on this core component to compute closeness centrality, eccentricity centrality and stress centrality. To make all these algorithms available to the research community, we developed a software package gpu-fan (GPU-based Fast Analysis of Networks for CUDA enabled GPUs. Speedup of 10-50× compared with CPU implementations was observed for simulated scale-free networks and real world biological networks. Conclusions gpu-fan provides a significant performance improvement for centrality computation in large-scale networks. Source code is available under the GNU Public License (GPL at http://bioinfo.vanderbilt.edu/gpu-fan/.

Innovation networking between stability and political dynamics

DEFF Research Database (Denmark)

Koch, Christian

2004-01-01

of the contribution is to challenge and transcend these notions and develop an understanding of innovation networks as an interplay between stable and dynamic elements, where political processes in innovation are much more than a disruptive and even a counterproductive feature. It reviews the growing number...... of studies that highlight the political aspect of innovation. The paper reports on a study of innovation processes conducted within the EU—TSER-programme and a study made under the banner of management of technology. Intensive field studies in two constellations of enterprises were carried out. One......This contribution views innovation as a social activity of building networks, using software product development in multicompany alliances and networks as example. Innovation networks are frequently understood as quite stable arrangements characterised by high trust among the participants. The aim...

On the Control of Consensus Networks: Theory and Applications

Science.gov (United States)

Hudoba de Badyn, Mathias

Signed networks allow the study of positive and negative interactions between agents. In this thesis, three papers are presented that address controllability of networked dynamics. First, controllability of signed consensus networks is approached from a symmetry perspective, for both linear and nonlinear consensus protocols. It is shown that the graph-theoretic property of signed networks known as structural balance renders the consensus protocol uncontrollable when coupled with a certain type of symmetry. Stabilizability and output controllability of signed linear consensus is also examined, as well as a data-driven approach to finding bipartite consensus stemming from structural balance for signed nonlinear consensus. Second, an algorithm is constructed that allows one to grow a network while preserving controllability, and some generalizations of this algorithm are presented. Submodular optimization is used to analyze a second algorithm that adds nodes to a network to maximize the network connectivity.

Mobile ad hoc networking the cutting edge directions

CERN Document Server

Basagni, Stefano; Giordano, Silvia; Stojmenovic, Ivan

2013-01-01

""An excellent book for those who are interested in learning the current status of research and development . . . [and] who want to get a comprehensive overview of the current state-of-the-art.""-E-Streams This book provides up-to-date information on research and development in the rapidly growing area of networks based on the multihop ad hoc networking paradigm. It reviews all classes of networks that have successfully adopted this paradigm, pointing out how they penetrated the mass market and sparked breakthrough research. Covering both physical issues and applica

Towards a resilient and programmable optical network with dynamic lightpath as a service

CSIR Research Space (South Africa)

Nkosi, Mpho C

2016-09-01

Full Text Available With the growing adoption of programmable networks, the protection and restoration schemes for optical networks needs to be thoroughly looked into so as to guarantee efficiency and resiliency for the new Software Defined Network (SDN) architectures...

Encryption for confidentiality of the network and influence of this to the quality of streaming video through network

Science.gov (United States)

Sevcik, L.; Uhrin, D.; Frnda, J.; Voznak, M.; Toral-Cruz, Homer; Mikulec, M.; Jakovlev, Sergej

2015-05-01

Nowadays, the interest in real-time services, like audio and video, is growing. These services are mostly transmitted over packet networks, which are based on IP protocol. It leads to analyses of these services and their behavior in such networks which are becoming more frequent. Video has become the significant part of all data traffic sent via IP networks. In general, a video service is one-way service (except e.g. video calls) and network delay is not such an important factor as in a voice service. Dominant network factors that influence the final video quality are especially packet loss, delay variation and the capacity of the transmission links. Analysis of video quality concentrates on the resistance of video codecs to packet loss in the network, which causes artefacts in the video. IPsec provides confidentiality in terms of safety, integrity and non-repudiation (using HMAC-SHA1 and 3DES encryption for confidentiality and AES in CBC mode) with an authentication header and ESP (Encapsulating Security Payload). The paper brings a detailed view of the performance of video streaming over an IP-based network. We compared quality of video with packet loss and encryption as well. The measured results demonstrated the relation between the video codec type and bitrate to the final video quality.

The Evolution of Wikipedia’s Norm Network

Directory of Open Access Journals (Sweden)

Bradi Heaberlin

2016-04-01

Full Text Available Social norms have traditionally been difficult to quantify. In any particular society, their sheer number and complex interdependencies often limit a system-level analysis. One exception is that of the network of norms that sustain the online Wikipedia community. We study the fifteen-year evolution of this network using the interconnected set of pages that establish, describe, and interpret the community’s norms. Despite Wikipedia’s reputation for ad hoc governance, we find that its normative evolution is highly conservative. The earliest users create norms that both dominate the network and persist over time. These core norms govern both content and interpersonal interactions using abstract principles such as neutrality, verifiability, and assume good faith. As the network grows, norm neighborhoods decouple topologically from each other, while increasing in semantic coherence. Taken together, these results suggest that the evolution of Wikipedia’s norm network is akin to bureaucratic systems that predate the information age.

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.

Gradient networks on uncorrelated random scale-free networks

International Nuclear Information System (INIS)

Pan Guijun; Yan Xiaoqing; Huang Zhongbing; Ma Weichuan

2011-01-01

Uncorrelated random scale-free (URSF) networks are useful null models for checking the effects of scale-free topology on network-based dynamical processes. Here, we present a comparative study of the jamming level of gradient networks based on URSF networks and Erdos-Renyi (ER) random networks. We find that the URSF networks are less congested than ER random networks for the average degree (k)>k c (k c ∼ 2 denotes a critical connectivity). In addition, by investigating the topological properties of the two kinds of gradient networks, we discuss the relations between the topological structure and the transport efficiency of the gradient networks. These findings show that the uncorrelated scale-free structure might allow more efficient transport than the random structure.

Reconfigurable network systems and software-defined networking

OpenAIRE

Zilberman, N.; Watts, P. M.; Rotsos, C.; Moore, A. W.

2015-01-01

Modern high-speed networks have evolved from relatively static networks to highly adaptive networks facilitating dynamic reconfiguration. This evolution has influenced all levels of network design and management, introducing increased programmability and configuration flexibility. This influence has extended from the lowest level of physical hardware interfaces to the highest level of network management by software. A key representative of this evolution is the emergence of software-defined n...

Improving network management with Software Defined Networking

International Nuclear Information System (INIS)

Dzhunev, Pavel

2013-01-01

Software-defined networking (SDN) is developed as an alternative to closed networks in centers for data processing by providing a means to separate the control layer data layer switches, and routers. SDN introduces new possibilities for network management and configuration methods. In this article, we identify problems with the current state-of-the-art network configuration and management mechanisms and introduce mechanisms to improve various aspects of network management

Environment Aware Cellular Networks

KAUST Repository

Ghazzai, Hakim

2015-02-01

The unprecedented rise of mobile user demand over the years have led to an enormous growth of the energy consumption of wireless networks as well as the greenhouse gas emissions which are estimated currently to be around 70 million tons per year. This significant growth of energy consumption impels network companies to pay huge bills which represent around half of their operating expenditures. Therefore, many service providers, including mobile operators, are looking for new and modern green solutions to help reduce their expenses as well as the level of their CO2 emissions. Base stations are the most power greedy element in cellular networks: they drain around 80% of the total network energy consumption even during low traffic periods. Thus, there is a growing need to develop more energy-efficient techniques to enhance the green performance of future 4G/5G cellular networks. Due to the problem of traffic load fluctuations in cellular networks during different periods of the day and between different areas (shopping or business districts and residential areas), the base station sleeping strategy has been one of the main popular research topics in green communications. In this presentation, we present several practical green techniques that provide significant gains for mobile operators. Indeed, combined with the base station sleeping strategy, these techniques achieve not only a minimization of the fossil fuel consumption but also an enhancement of mobile operator profits. We start with an optimized cell planning method that considers varying spatial and temporal user densities. We then use the optimal transport theory in order to define the cell boundaries such that the network total transmit power is reduced. Afterwards, we exploit the features of the modern electrical grid, the smart grid, as a new tool of power management for cellular networks and we optimize the energy procurement from multiple energy retailers characterized by different prices and pollutant

Network Restoration for Next-Generation Communication and Computing Networks

Directory of Open Access Journals (Sweden)

B. S. Awoyemi

2018-01-01

Full Text Available Network failures are undesirable but inevitable occurrences for most modern communication and computing networks. A good network design must be robust enough to handle sudden failures, maintain traffic flow, and restore failed parts of the network within a permissible time frame, at the lowest cost achievable and with as little extra complexity in the network as possible. Emerging next-generation (xG communication and computing networks such as fifth-generation networks, software-defined networks, and internet-of-things networks have promises of fast speeds, impressive data rates, and remarkable reliability. To achieve these promises, these complex and dynamic xG networks must be built with low failure possibilities, high network restoration capacity, and quick failure recovery capabilities. Hence, improved network restoration models have to be developed and incorporated in their design. In this paper, a comprehensive study on network restoration mechanisms that are being developed for addressing network failures in current and emerging xG networks is carried out. Open-ended problems are identified, while invaluable ideas for better adaptation of network restoration to evolving xG communication and computing paradigms are discussed.

An Analysis of the Structure and Evolution of Networks

Science.gov (United States)

Hua, Guangying

2011-01-01

As network research receives more and more attention from both academic researchers and practitioners, network analysis has become a fast growing field attracting many researchers from diverse fields such as physics, computer science, and sociology. This dissertation provides a review of theory and research on different real data sets from the…

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

Data Network Equipment Energy Use and Savings Potential in Buildings

Energy Technology Data Exchange (ETDEWEB)

Lanzisera, Steven; Nordman, Bruce; Brown, Richard E.

2010-06-09

Network connectivity has become nearly ubiquitous, and the energy use of the equipment required for this connectivity is growing. Network equipment consists of devices that primarily switch and route Internet Protocol (IP) packets from a source to a destination, and this category specifically excludes edge devices like PCs, servers and other sources and sinks of IP traffic. This paper presents the results of a study of network equipment energy use and includes case studies of networks in a campus, a medium commercial building, and a typical home. The total energy use of network equipment is the product of the stock of equipment in use, the power of each device, and their usage patterns. This information was gathered from market research reports, broadband market penetration studies, field metering, and interviews with network administrators and service providers. We estimate that network equipment in the USA used 18 TWh, or about 1percent of building electricity, in 2008 and that consumption is expected to grow at roughly 6percent per year to 23 TWh in 2012; world usage in 2008 was 51 TWh. This study shows that office building network switches and residential equipment are the two largest categories of energy use consuming 40percent and 30percent of the total respectively. We estimate potential energy savings for different scenarios using forecasts of equipment stock and energy use, and savings estimates range from 20percent to 50percent based on full market penetration of efficient technologies.

Modeling of contact tracing in social networks

Science.gov (United States)

Tsimring, Lev S.; Huerta, Ramón

2003-07-01

Spreading of certain infections in complex networks is effectively suppressed by using intelligent strategies for epidemic control. One such standard epidemiological strategy consists in tracing contacts of infected individuals. In this paper, we use a recently introduced generalization of the standard susceptible-infectious-removed stochastic model for epidemics in sparse random networks which incorporates an additional (traced) state. We describe a deterministic mean-field description which yields quantitative agreement with stochastic simulations on random graphs. We also discuss the role of contact tracing in epidemics control in small-world and scale-free networks. Effectiveness of contact tracing grows as the rewiring probability is reduced.

The DSFPN, a new neural network for optical character recognition.

Science.gov (United States)

Morns, L P; Dlay, S S

1999-01-01

A new type of neural network for recognition tasks is presented in this paper. The network, called the dynamic supervised forward-propagation network (DSFPN), is based on the forward only version of the counterpropagation network (CPN). The DSFPN, trains using a supervised algorithm and can grow dynamically during training, allowing subclasses in the training data to be learnt in an unsupervised manner. It is shown to train in times comparable to the CPN while giving better classification accuracies than the popular backpropagation network. Both Fourier descriptors and wavelet descriptors are used for image preprocessing and the wavelets are proven to give a far better performance.

An Embedded Multi-Agent Systems Based Industrial Wireless Sensor Network.

Science.gov (United States)

Taboun, Mohammed S; Brennan, Robert W

2017-09-14

With the emergence of cyber-physical systems, there has been a growing interest in network-connected devices. One of the key requirements of a cyber-physical device is the ability to sense its environment. Wireless sensor networks are a widely-accepted solution for this requirement. In this study, an embedded multi-agent systems-managed wireless sensor network is presented. A novel architecture is proposed, along with a novel wireless sensor network architecture. Active and passive wireless sensor node types are defined, along with their communication protocols, and two application-specific examples are presented. A series of three experiments is conducted to evaluate the performance of the agent-embedded wireless sensor network.

A smarter way to network.

Science.gov (United States)

Cross, Rob; Thomas, Robert

2011-01-01

The adage "It's not what you know, it's who you know" is true. The right social network can have a huge impact on your success. But many people have misguided ideas about what makes a network strong: They believe the key is having a large circle filled with high-powered contacts. That's not the right approach, say Cross, of UVA's McIntire School of Commerce, and Thomas, of the Accenture Institute for High Performance. The authors, who have spent years researching how organizations can capitalize on employees' social networks, have seen that the happiest, highest-performing executives have a different kind of network: select but diverse, made up of high-quality relationships with people who come from varying spheres and from up and down the corporate ladder. Effective networks typically range in size from 12 to 18 people. They help managers learn, make decisions with less bias, and grow personally. Cross and Thomas have found that they include six critical kinds of connections: people who provide information, ideas, or expertise; formally and informally powerful people, who offer mentoring and political support; people who give developmental feedback; people who lend personal support; people who increase your sense of purpose or worth; and people who promote work/life balance. Moreover, the best kind of connections are "energizers"--positive, trustworthy individuals who enjoy other people and always see opportunities, even in challenging situations. If your network doesn't look like this, you can follow a four-step process to improve it. You'll need to identify who your connections are and what they offer you, back away from redundant and energy-draining connections, fill holes in your network with the right kind of people, and work to make the most of your contacts. Do this, and in due course, you'll have a network that steers the best opportunities, ideas, and talent your way.

Gradual DropIn of Layers to Train Very Deep Neural Networks

OpenAIRE

Smith, Leslie N.; Hand, Emily M.; Doster, Timothy

2015-01-01

We introduce the concept of dynamically growing a neural network during training. In particular, an untrainable deep network starts as a trainable shallow network and newly added layers are slowly, organically added during training, thereby increasing the network's depth. This is accomplished by a new layer, which we call DropIn. The DropIn layer starts by passing the output from a previous layer (effectively skipping over the newly added layers), then increasingly including units from the ne...

Malaysian Users’ Perception towards Facebook as a Social Networking Site

OpenAIRE

Ahasanul Haque; Abdullah Sarwar; Farzana Yasmin

2013-01-01

Social network sites constitute a rapidly growing phenomenon. Thus, understanding users perception toward social network sites become essential. Realizing this present needs, this study strives to determine the user’s perception towards Facebook in Malaysia. This paper commences by examining the relevance of the privacy, features, sharing social information, and accessibility provided by the social network sites. A self-administered questionnaire survey was conducted. A convenience sampling m...

Energy Efficiency Analysis for Dynamic Routing in Optical Transport Networks

DEFF Research Database (Denmark)

Vizcaíno, Jorge López; Ye, Yabin; Tafur Monroy, Idelfonso

2012-01-01

The energy efficiency in telecommunication networks is gaining more relevance as the Internet traffic is growing. The introduction of OFDM and dynamic operation opens new horizons in the operation of optical networks, improving the network flexibility and its efficiency. In this paper, we compare...... the performance in terms of energy efficiency of a flexible-grid OFDM-based solution with a fixed-grid WDM network in a dynamic scenario with time-varying connections. We highlight the benefits that the bandwidth elasticity and the flexibility of selecting different modulation formats can offer compared...

Learning Networks, Networked Learning

NARCIS (Netherlands)

Sloep, Peter; Berlanga, Adriana

2010-01-01

Sloep, P. B., & Berlanga, A. J. (2011). Learning Networks, Networked Learning [Redes de Aprendizaje, Aprendizaje en Red]. Comunicar, XIX(37), 55-63. Retrieved from http://dx.doi.org/10.3916/C37-2011-02-05

Network cosmology.

Science.gov (United States)

Krioukov, Dmitri; Kitsak, Maksim; Sinkovits, Robert S; Rideout, David; Meyer, David; Boguñá, Marián

2012-01-01

Prediction and control of the dynamics of complex networks is a central problem in network science. Structural and dynamical similarities of different real networks suggest that some universal laws might accurately describe the dynamics of these networks, albeit the nature and common origin of such laws remain elusive. Here we show that the causal network representing the large-scale structure of spacetime in our accelerating universe is a power-law graph with strong clustering, similar to many complex networks such as the Internet, social, or biological networks. We prove that this structural similarity is a consequence of the asymptotic equivalence between the large-scale growth dynamics of complex networks and causal networks. This equivalence suggests that unexpectedly similar laws govern the dynamics of complex networks and spacetime in the universe, with implications to network science and cosmology.

Network marketing on a small-world network

Science.gov (United States)

Kim, Beom Jun; Jun, Tackseung; Kim, Jeong-Yoo; Choi, M. Y.

2006-02-01

We investigate a dynamic model of network marketing in a small-world network structure artificially constructed similarly to the Watts-Strogatz network model. Different from the traditional marketing, consumers can also play the role of the manufacturer's selling agents in network marketing, which is stimulated by the referral fee the manufacturer offers. As the wiring probability α is increased from zero to unity, the network changes from the one-dimensional regular directed network to the star network where all but one player are connected to one consumer. The price p of the product and the referral fee r are used as free parameters to maximize the profit of the manufacturer. It is observed that at α=0 the maximized profit is constant independent of the network size N while at α≠0, it increases linearly with N. This is in parallel to the small-world transition. It is also revealed that while the optimal value of p stays at an almost constant level in a broad range of α, that of r is sensitive to a change in the network structure. The consumer surplus is also studied and discussed.

Growing up wired: social networking sites and adolescent psychosocial development.

Science.gov (United States)

Spies Shapiro, Lauren A; Margolin, Gayla

2014-03-01

Since the advent of social networking site (SNS) technologies, adolescents' use of these technologies has expanded and is now a primary way of communicating with and acquiring information about others in their social network. Overall, adolescents and young adults' stated motivations for using SNSs are quite similar to more traditional forms of communication-to stay in touch with friends, make plans, get to know people better, and present oneself to others. We begin with a summary of theories that describe the role of SNSs in adolescents' interpersonal relationships, as well as common methodologies used in this field of research thus far. Then, with the social changes that occur throughout adolescence as a backdrop, we address the ways in which SNSs intersect with key tasks of adolescent psychosocial development, specifically peer affiliation and friendship quality, as well as identity development. Evidence suggests that SNSs differentially relate to adolescents' social connectivity and identity development, with sociability, self-esteem, and nature of SNS feedback as important potential moderators. We synthesize current findings, highlight unanswered questions, and recommend both methodological and theoretical directions for future research.

Reference Architecture for Multi-Layer Software Defined Optical Data Center Networks

Directory of Open Access Journals (Sweden)

Casimer DeCusatis

2015-09-01

Full Text Available As cloud computing data centers grow larger and networking devices proliferate; many complex issues arise in the network management architecture. We propose a framework for multi-layer; multi-vendor optical network management using open standards-based software defined networking (SDN. Experimental results are demonstrated in a test bed consisting of three data centers interconnected by a 125 km metropolitan area network; running OpenStack with KVM and VMW are components. Use cases include inter-data center connectivity via a packet-optical metropolitan area network; intra-data center connectivity using an optical mesh network; and SDN coordination of networking equipment within and between multiple data centers. We create and demonstrate original software to implement virtual network slicing and affinity policy-as-a-service offerings. Enhancements to synchronous storage backup; cloud exchanges; and Fibre Channel over Ethernet topologies are also discussed.

A neural network approach to job-shop scheduling.

Science.gov (United States)

Zhou, D N; Cherkassky, V; Baldwin, T R; Olson, D E

1991-01-01

A novel analog computational network is presented for solving NP-complete constraint satisfaction problems, i.e. job-shop scheduling. In contrast to most neural approaches to combinatorial optimization based on quadratic energy cost function, the authors propose to use linear cost functions. As a result, the network complexity (number of neurons and the number of resistive interconnections) grows only linearly with problem size, and large-scale implementations become possible. The proposed approach is related to the linear programming network described by D.W. Tank and J.J. Hopfield (1985), which also uses a linear cost function for a simple optimization problem. It is shown how to map a difficult constraint-satisfaction problem onto a simple neural net in which the number of neural processors equals the number of subjobs (operations) and the number of interconnections grows linearly with the total number of operations. Simulations show that the authors' approach produces better solutions than existing neural approaches to job-shop scheduling, i.e. the traveling salesman problem-type Hopfield approach and integer linear programming approach of J.P.S. Foo and Y. Takefuji (1988), in terms of the quality of the solution and the network complexity.

Weighted Scale-Free Network Properties of Ecological Network

International Nuclear Information System (INIS)

Lee, Jae Woo; Maeng, Seong Eun

2013-01-01

We investigate the scale-free network properties of the bipartite ecological network, in particular, the plant-pollinator network. In plant-pollinator network, the pollinators visit the plant to get the nectars. In contrast to the other complex network, the plant-pollinator network has not only the trophic relationships among the interacting partners but also the complexities of the coevolutionary effects. The interactions between the plant and pollinators are beneficial relations. The plant-pollinator network is a bipartite and weighted network. The networks have two types of the nodes: plant and pollinator. We consider the visiting frequency of a pollinator to a plant as the weighting value of the link. We defined the strength of a node as the sum of the weighting value of the links. We reported the cumulative distribution function (CDF) of the degree and the strength of the plant-pollinator network. The CDF of the plants followed stretched exponential functions for both degree and strength, but the CDF of the pollinators showed the power law for both degree and strength. The average strength of the links showed the nonlinear dependence on the degree of the networks.

A Network Traffic Control Enhancement Approach over Bluetooth Networks

DEFF Research Database (Denmark)

Son, L.T.; Schiøler, Henrik; Madsen, Ole Brun

2003-01-01

This paper analyzes network traffic control issues in Bluetooth data networks as convex optimization problem. We formulate the problem of maximizing of total network flows and minimizing the costs of flows. An adaptive distributed network traffic control scheme is proposed as an approximated solu...... as capacity limitations and flow requirements in the network. Simulation shows that the performance of Bluetooth networks could be improved by applying the adaptive distributed network traffic control scheme...... solution of the stated optimization problem that satisfies quality of service requirements and topologically induced constraints in Bluetooth networks, such as link capacity and node resource limitations. The proposed scheme is decentralized and complies with frequent changes of topology as well......This paper analyzes network traffic control issues in Bluetooth data networks as convex optimization problem. We formulate the problem of maximizing of total network flows and minimizing the costs of flows. An adaptive distributed network traffic control scheme is proposed as an approximated...

Network structure exploration in networks with node attributes

Science.gov (United States)

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

2016-05-01

Complex networks provide a powerful way to represent complex systems and have been widely studied during the past several years. One of the most important tasks of network analysis is to detect structures (also called structural regularities) embedded in networks by determining group number and group partition. Most of network structure exploration models only consider network links. However, in real world networks, nodes may have attributes that are useful for network structure exploration. In this paper, we propose a novel Bayesian nonparametric (BNP) model to explore structural regularities in networks with node attributes, called Bayesian nonparametric attribute (BNPA) model. This model does not only take full advantage of both links between nodes and node attributes for group partition via shared hidden variables, but also determine group number automatically via the Bayesian nonparametric theory. Experiments conducted on a number of real and synthetic networks show that our BNPA model is able to automatically explore structural regularities in networks with node attributes and is competitive with other state-of-the-art models.

Integrated Analysis of Environment-driven Operational Effects in Sensor Networks

Energy Technology Data Exchange (ETDEWEB)

Park, Alfred J [ORNL; Perumalla, Kalyan S [ORNL

2007-07-01

There is a rapidly growing need to evaluate sensor network functionality and performance in the context of the larger environment of infrastructure and applications in which the sensor network is organically embedded. This need, which is motivated by complex applications related to national security operations, leads to a paradigm fundamentally different from that of traditional data networks. In the sensor networks of interest to us, the network dynamics depend strongly on sensor activity, which in turn is triggered by events in the environment. Because the behavior of sensor networks is sensitive to these driving phenomena, the integrity of the sensed observations, measurements and resource usage by the network can widely vary. It is therefore imperative to accurately capture the environmental phenomena, and drive the simulation of the sensor network operation by accounting fully for the environment effects. In this paper, we illustrate the strong, intimate coupling between the sensor network operation and the driving phenomena in their applications with an example sensor network designed to detect and track gaseous plumes.

Online Identities and Social Networking

Science.gov (United States)

Maheswaran, Muthucumaru; Ali, Bader; Ozguven, Hatice; Lord, Julien

Online identities play a critical role in the social web that is taking shape on the Internet. Despite many technical proposals for creating and managing online identities, none has received widespread acceptance. Design and implementation of online identities that are socially acceptable on the Internet remains an open problem. This chapter discusses the interplay between online identities and social networking. Online social networks (OSNs) are growing at a rapid pace and has millions of members in them. While the recent trend is to create explicit OSNs such as Facebook and MySpace, we also have implicit OSNs such as interaction graphs created by email and instant messaging services. Explicit OSNs allow users to create profiles and use them to project their identities on the web. There are many interesting identity related issues in the context of social networking including how OSNs help and hinder the definition of online identities.

"A Lifelong Classroom": Social Studies Educators' Engagement with Professional Learning Networks on Twitter

Science.gov (United States)

Noble, Anna; McQuillan, Patrick; Littenberg-Tobias, Josh

2016-01-01

Growing numbers of educators are using social media platforms to connect with other educators to form professional learning networks. These networks serve as alternative sources of professional development for teachers who seek to enrich their professional growth beyond school-based programs. This study aims to add to the small but growing body of…

Characterizing the topology of probabilistic biological networks.

Science.gov (United States)

Todor, Andrei; Dobra, Alin; Kahveci, Tamer

2013-01-01

Biological interactions are often uncertain events, that may or may not take place with some probability. This uncertainty leads to a massive number of alternative interaction topologies for each such network. The existing studies analyze the degree distribution of biological networks by assuming that all the given interactions take place under all circumstances. This strong and often incorrect assumption can lead to misleading results. In this paper, we address this problem and develop a sound mathematical basis to characterize networks in the presence of uncertain interactions. Using our mathematical representation, we develop a method that can accurately describe the degree distribution of such networks. We also take one more step and extend our method to accurately compute the joint-degree distributions of node pairs connected by edges. The number of possible network topologies grows exponentially with the number of uncertain interactions. However, the mathematical model we develop allows us to compute these degree distributions in polynomial time in the number of interactions. Our method works quickly even for entire protein-protein interaction (PPI) networks. It also helps us find an adequate mathematical model using MLE. We perform a comparative study of node-degree and joint-degree distributions in two types of biological networks: the classical deterministic networks and the more flexible probabilistic networks. Our results confirm that power-law and log-normal models best describe degree distributions for both probabilistic and deterministic networks. Moreover, the inverse correlation of degrees of neighboring nodes shows that, in probabilistic networks, nodes with large number of interactions prefer to interact with those with small number of interactions more frequently than expected. We also show that probabilistic networks are more robust for node-degree distribution computation than the deterministic ones. all the data sets used, the software

Energy savings in mobile broadband network based on load predictions

DEFF Research Database (Denmark)

Samulevicius, Saulius; Pedersen, Torben Bach; Sørensen, Troels Bundgaard

2012-01-01

Abstract—The deployment of new network equipment is resulting in increasing energy consumption in mobile broadband networks (MBNs). This contributes to higher CO2 emissions. Over the last 10 years MBNs have grown considerably, and are still growing to meet the evolution in traffic volume carried...

Scalability analysis of large-scale LoRaWAN networks in ns-3

OpenAIRE

Abeele, Floris Van den; Haxhibeqiri, Jetmir; Moerman, Ingrid; Hoebeke, Jeroen

2017-01-01

As LoRaWAN networks are actively being deployed in the field, it is important to comprehend the limitations of this Low Power Wide Area Network technology. Previous work has raised questions in terms of the scalability and capacity of LoRaWAN networks as the number of end devices grows to hundreds or thousands per gateway. Some works have modeled LoRaWAN networks as pure ALOHA networks, which fails to capture important characteristics such as the capture effect and the effects of interference...

Undermining and Strengthening Social Networks through Network Modification

Science.gov (United States)

Mellon, Jonathan; Yoder, Jordan; Evans, Daniel

2016-10-01

Social networks have well documented effects at the individual and aggregate level. Consequently it is often useful to understand how an attempt to influence a network will change its structure and consequently achieve other goals. We develop a framework for network modification that allows for arbitrary objective functions, types of modification (e.g. edge weight addition, edge weight removal, node removal, and covariate value change), and recovery mechanisms (i.e. how a network responds to interventions). The framework outlined in this paper helps both to situate the existing work on network interventions but also opens up many new possibilities for intervening in networks. In particular use two case studies to highlight the potential impact of empirically calibrating the objective function and network recovery mechanisms as well as showing how interventions beyond node removal can be optimised. First, we simulate an optimal removal of nodes from the Noordin terrorist network in order to reduce the expected number of attacks (based on empirically predicting the terrorist collaboration network from multiple types of network ties). Second, we simulate optimally strengthening ties within entrepreneurial ecosystems in six developing countries. In both cases we estimate ERGM models to simulate how a network will endogenously evolve after intervention.

Declarative Networking

CERN Document Server

Loo, Boon Thau

2012-01-01

Declarative Networking is a programming methodology that enables developers to concisely specify network protocols and services, which are directly compiled to a dataflow framework that executes the specifications. Declarative networking proposes the use of a declarative query language for specifying and implementing network protocols, and employs a dataflow framework at runtime for communication and maintenance of network state. The primary goal of declarative networking is to greatly simplify the process of specifying, implementing, deploying and evolving a network design. In addition, decla

Recent advances on failure and recovery in networks of networks

International Nuclear Information System (INIS)

Shekhtman, Louis M.; Danziger, Michael M.; Havlin, Shlomo

2016-01-01

Until recently, network science has focused on the properties of single isolated networks that do not interact or depend on other networks. However it has now been recognized that many real-networks, such as power grids, transportation systems, and communication infrastructures interact and depend on other networks. Here, we will present a review of the framework developed in recent years for studying the vulnerability and recovery of networks composed of interdependent networks. In interdependent networks, when nodes in one network fail, they cause dependent nodes in other networks to also fail. This is also the case when some nodes, like for example certain people, play a role in two networks, i.e. in a multiplex. Dependency relations may act recursively and can lead to cascades of failures concluding in sudden fragmentation of the system. We review the analytical solutions for the critical threshold and the giant component of a network of n interdependent networks. The general theory and behavior of interdependent networks has many novel features that are not present in classical network theory. Interdependent networks embedded in space are significantly more vulnerable compared to non-embedded networks. In particular, small localized attacks may lead to cascading failures and catastrophic consequences. Finally, when recovery of components is possible, global spontaneous recovery of the networks and hysteresis phenomena occur. The theory developed for this process points to an optimal repairing strategy for a network of networks. Understanding realistic effects present in networks of networks is required in order to move towards determining system vulnerability.

An Embedded Multi-Agent Systems Based Industrial Wireless Sensor Network

Science.gov (United States)

Brennan, Robert W.

2017-01-01

With the emergence of cyber-physical systems, there has been a growing interest in network-connected devices. One of the key requirements of a cyber-physical device is the ability to sense its environment. Wireless sensor networks are a widely-accepted solution for this requirement. In this study, an embedded multi-agent systems-managed wireless sensor network is presented. A novel architecture is proposed, along with a novel wireless sensor network architecture. Active and passive wireless sensor node types are defined, along with their communication protocols, and two application-specific examples are presented. A series of three experiments is conducted to evaluate the performance of the agent-embedded wireless sensor network. PMID:28906452

Social Networks in the workplace - some data protection issues

OpenAIRE

Haynes, D.

2011-01-01

There are many benefits to be gained from using social networks in the workplace but there is a downside – a growing concern about privacy and misuse of personal information. Using the results from a survey he conducted to highlight the issues, David Haynes puts forward an approach to managing social networks through the introduction of organisational policy.

A Survey on Mobile Edge Networks: Convergence of Computing, Caching and Communications

OpenAIRE

Wang, Shuo; Zhang, Xing; Zhang, Yan; Wang, Lin; Yang, Juwo; Wang, Wenbo

2017-01-01

As the explosive growth of smart devices and the advent of many new applications, traffic volume has been growing exponentially. The traditional centralized network architecture cannot accommodate such user demands due to heavy burden on the backhaul links and long latency. Therefore, new architectures which bring network functions and contents to the network edge are proposed, i.e., mobile edge computing and caching. Mobile edge networks provide cloud computing and caching capabilities at th...

Web 2.0 Socail Network Sites And Facebook Marketing

Directory of Open Access Journals (Sweden)

Andreas Chang

2011-11-01

Full Text Available The use of Web 2.0 and Social Network Sites (SNS has become an amazing phenomenon. In fact, one of the fastest-growing arenas of the World Wide Web is the space of so-called social networking sites. Face book, Tweeter, MySpace and other Social Network Sites have huge population of users. Almost seven hundred million people use Facebook, and hundreds of million others use other social networking sites. More and more advertisers switch their marketing budget to these SNS. This study contributes to our understanding of the Web 2.0 and the use of social networking websites by examining available literature. It seeks to understand what Web 2.0 and SNS mean, the trends, its functions and how they can be leveraged for marketing purposes.

vhv supply networks, problems of network structure

Energy Technology Data Exchange (ETDEWEB)

Raimbault, J

1966-04-01

The present and future power requirements of the Paris area and the structure of the existing networks are discussed. The various limitations that will have to be allowed for to lay down the structure of a regional transmission network leading in the power of the large national transmission network to within the Paris built up area are described. The theoretical solution that has been adopted, and the features of its final achievement, which is planned for about the year 2000, and the intermediate stages are given. The problem of the structure of the National Power Transmission network which is to supply the regional network was studied. To solve this problem, a 730 kV voltage network will have to be introduced.

Network configuration of global R&D networks

DEFF Research Database (Denmark)

Hansen, Zaza Nadja Lee; Srai, Jagjit Singh

2011-01-01

, network configuration of global R&D has tended to focus on strategic elements with limited attention given operational effectiveness, or to interfaces with downstream manufacturing operations. Within OM literature, the drivers of configuration of global networks within, engineering, production, supply...... to R&D networks emerged, e.g. product features were more prominent in R&D networks. Furthermore, the study has shown extensive interaction with other operations, including many downstream manufacturing operations. By extending the OM configuration concepts to the configuration of R&D networks......Companies are increasingly globalising their R&D activities, both within the firms and with external partners, with consequent implications for their interaction with manufacturing operations. Previous research in R&D networks has focused on coordination, governance and support elements. However...

Innovation in Multiple Networks and Networks of Networks: The Case of the Fruit Sector in Emilia‐Romagna

Directory of Open Access Journals (Sweden)

Davide Viaggi

2013-02-01

Full Text Available In the paper we examine the issue of food systems in which farms participate in multiple networks that, for their part, tend also to be members of networks of networks. The issue is addressed through a descriptive analysis of the fruit sector in Emilia‐Romagna (Italy. The farms in the area tend to join a different network for each product/product type. Innovation networks are embedded in commercialization or input provider networks, but separate (parallel networks also exist, particularly for basic research activities. Networks of networks are largely a product of the cooperative system. The paper concludes by emphasising the need for further research in multiple networking strategies and the connection betweencommercialisation networks and innovation.

Applying Physical-Layer Network Coding in Wireless Networks

Directory of Open Access Journals (Sweden)

Liew SoungChang

2010-01-01

Full Text Available A main distinguishing feature of a wireless network compared with a wired network is its broadcast nature, in which the signal transmitted by a node may reach several other nodes, and a node may receive signals from several other nodes, simultaneously. Rather than a blessing, this feature is treated more as an interference-inducing nuisance in most wireless networks today (e.g., IEEE 802.11. This paper shows that the concept of network coding can be applied at the physical layer to turn the broadcast property into a capacity-boosting advantage in wireless ad hoc networks. Specifically, we propose a physical-layer network coding (PNC scheme to coordinate transmissions among nodes. In contrast to "straightforward" network coding which performs coding arithmetic on digital bit streams after they have been received, PNC makes use of the additive nature of simultaneously arriving electromagnetic (EM waves for equivalent coding operation. And in doing so, PNC can potentially achieve 100% and 50% throughput increases compared with traditional transmission and straightforward network coding, respectively, in 1D regular linear networks with multiple random flows. The throughput improvements are even larger in 2D regular networks: 200% and 100%, respectively.

Network cohesion

OpenAIRE

Cavalcanti, Tiago Vanderlei; Giannitsarou, Chrysi; Johnson, CR

2017-01-01

We define a measure of network cohesion and show how it arises naturally in a broad class of dynamic models of endogenous perpetual growth with network externalities. Via a standard growth model, we show why network cohesion is crucial for conditional convergence and explain that as cohesion increases, convergence is faster. We prove properties of network cohesion and define a network aggregator that preserves network cohesion.

Spatial networks

Science.gov (United States)

Barthélemy, Marc

2011-02-01

Complex systems are very often organized under the form of networks where nodes and edges are embedded in space. Transportation and mobility networks, Internet, mobile phone networks, power grids, social and contact networks, and neural networks, are all examples where space is relevant and where topology alone does not contain all the information. Characterizing and understanding the structure and the evolution of spatial networks is thus crucial for many different fields, ranging from urbanism to epidemiology. An important consequence of space on networks is that there is a cost associated with the length of edges which in turn has dramatic effects on the topological structure of these networks. We will thoroughly explain the current state of our understanding of how the spatial constraints affect the structure and properties of these networks. We will review the most recent empirical observations and the most important models of spatial networks. We will also discuss various processes which take place on these spatial networks, such as phase transitions, random walks, synchronization, navigation, resilience, and disease spread.

Towards energy aware optical networks and interconnects

Science.gov (United States)

Glesk, Ivan; Osadola, Tolulope; Idris, Siti

2013-10-01

In a today's world, information technology has been identified as one of the major factors driving economic prosperity. Datacenters businesses have been growing significantly in the past few years. The equipments in these datacenters need to be efficiently connected to each other and also to the outside world in order to enable effective exchange of information. This is why there is need for highly scalable, energy savvy and reliable network connectivity infrastructure that is capable of accommodating the large volume of data being exchanged at any time within the datacenter network and the outside network in general. These devices that can ensure such effective connectivity currently require large amount of energy in order to meet up with these increasing demands. In this paper, an overview of works being done towards realizing energy aware optical networks and interconnects for datacenters is presented. Also an OCDMA approach is discussed as potential multiple access technique for future optical network interconnections. We also presented some challenges that might inhibit effective implementation of the OCDMA multiplexing scheme.

Neural networks and applications tutorial

Science.gov (United States)

Guyon, I.

1991-09-01

The importance of neural networks has grown dramatically during this decade. While only a few years ago they were primarily of academic interest, now dozens of companies and many universities are investigating the potential use of these systems and products are beginning to appear. The idea of building a machine whose architecture is inspired by that of the brain has roots which go far back in history. Nowadays, technological advances of computers and the availability of custom integrated circuits, permit simulations of hundreds or even thousands of neurons. In conjunction, the growing interest in learning machines, non-linear dynamics and parallel computation spurred renewed attention in artificial neural networks. Many tentative applications have been proposed, including decision systems (associative memories, classifiers, data compressors and optimizers), or parametric models for signal processing purposes (system identification, automatic control, noise canceling, etc.). While they do not always outperform standard methods, neural network approaches are already used in some real world applications for pattern recognition and signal processing tasks. The tutorial is divided into six lectures, that where presented at the Third Graduate Summer Course on Computational Physics (September 3-7, 1990) on Parallel Architectures and Applications, organized by the European Physical Society: (1) Introduction: machine learning and biological computation. (2) Adaptive artificial neurons (perceptron, ADALINE, sigmoid units, etc.): learning rules and implementations. (3) Neural network systems: architectures, learning algorithms. (4) Applications: pattern recognition, signal processing, etc. (5) Elements of learning theory: how to build networks which generalize. (6) A case study: a neural network for on-line recognition of handwritten alphanumeric characters.

Network Ambivalence

Directory of Open Access Journals (Sweden)

Patrick Jagoda

2015-08-01

Full Text Available The language of networks now describes everything from the Internet to the economy to terrorist organizations. In distinction to a common view of networks as a universal, originary, or necessary form that promises to explain everything from neural structures to online traffic, this essay emphasizes the contingency of the network imaginary. Network form, in its role as our current cultural dominant, makes scarcely imaginable the possibility of an alternative or an outside uninflected by networks. If so many things and relationships are figured as networks, however, then what is not a network? If a network points towards particular logics and qualities of relation in our historical present, what others might we envision in the future? In  many ways, these questions are unanswerable from within the contemporary moment. Instead of seeking an avant-garde approach (to move beyond networks or opting out of networks (in some cases, to recover elements of pre-networked existence, this essay proposes a third orientation: one of ambivalence that operates as a mode of extreme presence. I propose the concept of "network aesthetics," which can be tracked across artistic media and cultural forms, as a model, style, and pedagogy for approaching interconnection in the twenty-first century. The following essay is excerpted from Network Ambivalence (Forthcoming from University of Chicago Press. 

A statistical analysis of UK financial networks

Science.gov (United States)

Chu, J.; Nadarajah, S.

2017-04-01

In recent years, with a growing interest in big or large datasets, there has been a rise in the application of large graphs and networks to financial big data. Much of this research has focused on the construction and analysis of the network structure of stock markets, based on the relationships between stock prices. Motivated by Boginski et al. (2005), who studied the characteristics of a network structure of the US stock market, we construct network graphs of the UK stock market using same method. We fit four distributions to the degree density of the vertices from these graphs, the Pareto I, Fréchet, lognormal, and generalised Pareto distributions, and assess the goodness of fit. Our results show that the degree density of the complements of the market graphs, constructed using a negative threshold value close to zero, can be fitted well with the Fréchet and lognormal distributions.

Inferring general relations between network characteristics from specific network ensembles.

Science.gov (United States)

Cardanobile, Stefano; Pernice, Volker; Deger, Moritz; Rotter, Stefan

2012-01-01

Different network models have been suggested for the topology underlying complex interactions in natural systems. These models are aimed at replicating specific statistical features encountered in real-world networks. However, it is rarely considered to which degree the results obtained for one particular network class can be extrapolated to real-world networks. We address this issue by comparing different classical and more recently developed network models with respect to their ability to generate networks with large structural variability. In particular, we consider the statistical constraints which the respective construction scheme imposes on the generated networks. After having identified the most variable networks, we address the issue of which constraints are common to all network classes and are thus suitable candidates for being generic statistical laws of complex networks. In fact, we find that generic, not model-related dependencies between different network characteristics do exist. This makes it possible to infer global features from local ones using regression models trained on networks with high generalization power. Our results confirm and extend previous findings regarding the synchronization properties of neural networks. Our method seems especially relevant for large networks, which are difficult to map completely, like the neural networks in the brain. The structure of such large networks cannot be fully sampled with the present technology. Our approach provides a method to estimate global properties of under-sampled networks in good approximation. Finally, we demonstrate on three different data sets (C. elegans neuronal network, R. prowazekii metabolic network, and a network of synonyms extracted from Roget's Thesaurus) that real-world networks have statistical relations compatible with those obtained using regression models.

Mathematical modelling of complex contagion on clustered networks

Science.gov (United States)

O'sullivan, David J.; O'Keeffe, Gary; Fennell, Peter; Gleeson, James

2015-09-01

The spreading of behavior, such as the adoption of a new innovation, is influenced bythe structure of social networks that interconnect the population. In the experiments of Centola (Science, 2010), adoption of new behavior was shown to spread further and faster across clustered-lattice networks than across corresponding random networks. This implies that the “complex contagion” effects of social reinforcement are important in such diffusion, in contrast to “simple” contagion models of disease-spread which predict that epidemics would grow more efficiently on random networks than on clustered networks. To accurately model complex contagion on clustered networks remains a challenge because the usual assumptions (e.g. of mean-field theory) regarding tree-like networks are invalidated by the presence of triangles in the network; the triangles are, however, crucial to the social reinforcement mechanism, which posits an increased probability of a person adopting behavior that has been adopted by two or more neighbors. In this paper we modify the analytical approach that was introduced by Hebert-Dufresne et al. (Phys. Rev. E, 2010), to study disease-spread on clustered networks. We show how the approximation method can be adapted to a complex contagion model, and confirm the accuracy of the method with numerical simulations. The analytical results of the model enable us to quantify the level of social reinforcement that is required to observe—as in Centola’s experiments—faster diffusion on clustered topologies than on random networks.

Mathematical modelling of complex contagion on clustered networks

Directory of Open Access Journals (Sweden)

David J. P. O'Sullivan

2015-09-01

Full Text Available The spreading of behavior, such as the adoption of a new innovation, is influenced bythe structure of social networks that interconnect the population. In the experiments of Centola (Science, 2010, adoption of new behavior was shown to spread further and faster across clustered-lattice networks than across corresponding random networks. This implies that the complex contagion effects of social reinforcement are important in such diffusion, in contrast to simple contagion models of disease-spread which predict that epidemics would grow more efficiently on random networks than on clustered networks. To accurately model complex contagion on clustered networks remains a challenge because the usual assumptions (e.g. of mean-field theory regarding tree-like networks are invalidated by the presence of triangles in the network; the triangles are, however, crucial to the social reinforcement mechanism, which posits an increased probability of a person adopting behavior that has been adopted by two or more neighbors. In this paper we modify the analytical approach that was introduced by Hebert-Dufresne et al. (Phys. Rev. E, 2010, to study disease-spread on clustered networks. We show how the approximation method can be adapted to a complex contagion model, and confirm the accuracy of the method with numerical simulations. The analytical results of the model enable us to quantify the level of social reinforcement that is required to observe—as in Centola’s experiments—faster diffusion on clustered topologies than on random networks.

Transport link scanner: simulating geographic transport network expansion through individual investments

NARCIS (Netherlands)

Koopmans, C.C.; Jacobs, C.G.W.

2016-01-01

This paper introduces a GIS-based model that simulates the geographic expansion of transport networks by several decision-makers with varying objectives. The model progressively adds extensions to a growing network by choosing the most attractive investments from a limited choice set. Attractiveness

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

Network Learning and Innovation in SME Formal Networks

Directory of Open Access Journals (Sweden)

Jivka Deiters

2013-02-01

Full Text Available The driver for this paper is the need to better understand the potential for learning and innovation that networks canprovide especially for small and medium sized enterprises (SMEs which comprise by far the majority of enterprises in the food sector. With the challenges the food sector is facing in the near future, learning and innovation or more focused, as it is being discussed in the paper, ‘learning for innovation’ are not just opportunities but pre‐conditions for the sustainability of the sector. Network initiatives that could provide appropriate support involve social interaction and knowledge exchange, learning, competence development, and coordination (organization and management of implementation. The analysis identifies case studies in any of these orientations which serve different stages of the innovation process: invention and implementation. The variety of network case studies cover networks linked to a focus group for training, research, orconsulting, networks dealing with focused market oriented product or process development, promotional networks, and networks for open exchange and social networking.

Interconnected networks

CERN Document Server

2016-01-01

This volume provides an introduction to and overview of the emerging field of interconnected networks which include multi layer or multiplex networks, as well as networks of networks. Such networks present structural and dynamical features quite different from those observed in isolated networks. The presence of links between different networks or layers of a network typically alters the way such interconnected networks behave – understanding the role of interconnecting links is therefore a crucial step towards a more accurate description of real-world systems. While examples of such dissimilar properties are becoming more abundant – for example regarding diffusion, robustness and competition – the root of such differences remains to be elucidated. Each chapter in this topical collection is self-contained and can be read on its own, thus making it also suitable as reference for experienced researchers wishing to focus on a particular topic.

Do Policy Networks lead to Network Governing?

DEFF Research Database (Denmark)

Damgaard, Bodil

This paper challenges the notion that creation of local policy networks necessarily leads to network governing. Through actor-centred case studies in the area of municipally implemented employment policy in Denmark it was found that the local governing mode is determined mainly by the municipality......’s approach to local co-governing as well as by the capacity and interest of key private actors. It is argued that national legislation requesting the creation of local policy networks was not enough to assure network governing and the case studies show that local policy networks may subsist also under...... hierarchical governing modes. Reasons why hierarchical governing modes prevail over network governing in some settings are identified pointing to both actor borne and structural factors. Output indicators of the four cases do not show that a particular governing mode is more efficient in its employment policy...

Networking for High Energy and Nuclear Physics

Science.gov (United States)

Newman, Harvey B.

2007-07-01

This report gives an overview of the status and outlook for the world's research networks and major international links used by the high energy physics and other scientific communities, network technology advances on which our community depends and in which we have an increasingly important role, and the problem of the Digital Divide, which is a primary focus of ICFA's Standing Committee on Inter-regional Connectivity (SCIC). Wide area networks of sufficient, and rapidly increasing end-to-end capability are vital for every phase of high energy physicists' work. Our bandwidth usage, and the typical capacity of the major national backbones and intercontinental links used by our field have progressed by a factor of more than 1000 over the past decade, and the outlook is for a similar increase over the next decade. This striking exponential growth trend, outstripping the growth rates in other areas of information technology, has continued in the past year, with many of the major national, continental and transoceanic networks supporting research and education progressing from a 10 Gigabits/sec (Gbps) backbone to multiple 10 Gbps links in their core. This is complemented by the use of point-to-point "light paths" to support the most demanding applications, including high energy physics, in a growing list of cases. As we approach the era of LHC physics, the growing need to access and transport Terabyte-scale and later 10 to 100 Terabyte datasets among more than 100 "Tier1" and "Tier2" centers at universities and laboratories spread throughout the world has brought the key role of networks, and the ongoing need for their development, sharply into focus. Bandwidth itself on an increasing scale is not enough. Realizing the scientific wealth of the LHC and our other major scientific programs depends crucially on our ability to use the bandwidth efficiently and reliably, with reliable high rates of data throughput, and effectively, where many parallel large-scale data

Application of Butterfly Clos-Network in Network-on-Chip

Directory of Open Access Journals (Sweden)

Hui Liu

2014-01-01

Full Text Available This paper studied the topology of NoC (Network-on-Chip. By combining the characteristics of the Clos network and butterfly network, a new topology named BFC (Butterfly Clos-network network was proposed. This topology integrates several modules, which belongs to the same layer but different dimensions, into a new module. In the BFC network, a bidirectional link is used to complete information exchange, instead of information exchange between different layers in the original network. During the routing period, other nondestination nodes can be used as middle stages to transfer data packets to complete the routing mission. Therefore, this topology has the characteristic of multistage. Simulation analyses show that BFC inherits the rich path diversity of Clos network, and it has a better performance than butterfly network in throughput and delay in a quite congested traffic pattern.

Analyses of resource reservation schemes for optical burst switching networks

Science.gov (United States)

Solanska, Michaela; Scholtz, Lubomir; Ladanyi, Libor; Mullerova, Jarmila

2017-12-01

With growing demands of Internet Protocol services for transmission capacity and speed, the Optical Burst Switching presents the solution for future high-speed optical networks. Optical Burst Switching is a technology for transmitting large amounts of data bursts through a transparent optical switching network. To successfully transmit bursts over OBS network and reach the destination node, resource reservation schemes have to be implemented to allocate resources and configure optical switches for that burst at each node. The one-way resource reservation schemes and the performance evaluation of reservation schemes are presented. The OBS network model is performed using OMNeT++ simulation environment. During the reservation of network resources, the optical cross-connect based on semiconductor optical amplifier is used as the core node. Optical switches based on semiconductor optical amplifiers are a promising technology for high-speed optical communication networks.

Constructing ordinal partition transition networks from multivariate time series.

Science.gov (United States)

Zhang, Jiayang; Zhou, Jie; Tang, Ming; Guo, Heng; Small, Michael; Zou, Yong

2017-08-10

A growing number of algorithms have been proposed to map a scalar time series into ordinal partition transition networks. However, most observable phenomena in the empirical sciences are of a multivariate nature. We construct ordinal partition transition networks for multivariate time series. This approach yields weighted directed networks representing the pattern transition properties of time series in velocity space, which hence provides dynamic insights of the underling system. Furthermore, we propose a measure of entropy to characterize ordinal partition transition dynamics, which is sensitive to capturing the possible local geometric changes of phase space trajectories. We demonstrate the applicability of pattern transition networks to capture phase coherence to non-coherence transitions, and to characterize paths to phase synchronizations. Therefore, we conclude that the ordinal partition transition network approach provides complementary insight to the traditional symbolic analysis of nonlinear multivariate time series.

Exploring the challenges of energy and resources network governance

International Nuclear Information System (INIS)

Poocharoen, Ora-orn; Sovacool, Benjamin K.

2012-01-01

While a growing amount of literature has recently emerged describing network governance, less attention has been paid to evaluating the actual performance of networks. Our paper looks at the challenges facing network governance for natural resources (primarily logging and forestry) and energy (primarily renewable energy and energy efficiency) in Asia. The paper investigates what network governance is, and what types of challenges networks have to tackle. It then develops a qualitative analytical framework to evaluate the effectiveness of networks consisting of five criteria: (1) clarity of roles and objectives among members, (2) having strong, independent, continual sources of funding, (3) institutional formality (having a permanent secretariat, budget, full time staff, etc.), (4) efficacy (ability to accomplish its mission and goals at the least possible cost); and (5) level of interdependency among members. Finally, we apply this framework to four case studies: the Association of Southeast Asian Nations (ASEAN) Centre for Energy, Renewable Energy and Energy Efficiency Partnership (REEEP), ASEAN Regional Knowledge Network on Forests and Climate Change (FCC), and ASEAN Regional Knowledge Network on Forest Law Enforcement and Governance (FLEG). These cases illustrate effective (or ineffective) environmental and energy networks and the factors that are associated with network governance. - Highlights: ► This article evaluates four cases of energy and resources network governance. ► We assess these cases according to five criteria. ► We illustrate the effectiveness (and ineffectiveness) of these networks.

Biological Networks Entropies: Examples in Neural Memory Networks, Genetic Regulation Networks and Social Epidemic Networks

Directory of Open Access Journals (Sweden)

Jacques Demongeot

2018-01-01

Full Text Available Networks used in biological applications at different scales (molecule, cell and population are of different types: neuronal, genetic, and social, but they share the same dynamical concepts, in their continuous differential versions (e.g., non-linear Wilson-Cowan system as well as in their discrete Boolean versions (e.g., non-linear Hopfield system; in both cases, the notion of interaction graph G(J associated to its Jacobian matrix J, and also the concepts of frustrated nodes, positive or negative circuits of G(J, kinetic energy, entropy, attractors, structural stability, etc., are relevant and useful for studying the dynamics and the robustness of these systems. We will give some general results available for both continuous and discrete biological networks, and then study some specific applications of three new notions of entropy: (i attractor entropy, (ii isochronal entropy and (iii entropy centrality; in three domains: a neural network involved in the memory evocation, a genetic network responsible of the iron control and a social network accounting for the obesity spread in high school environment.

Evolution of Linux operating system network

Science.gov (United States)

Xiao, Guanping; Zheng, Zheng; Wang, Haoqin

2017-01-01

Linux operating system (LOS) is a sophisticated man-made system and one of the most ubiquitous operating systems. However, there is little research on the structure and functionality evolution of LOS from the prospective of networks. In this paper, we investigate the evolution of the LOS network. 62 major releases of LOS ranging from versions 1.0 to 4.1 are modeled as directed networks in which functions are denoted by nodes and function calls are denoted by edges. It is found that the size of the LOS network grows almost linearly, while clustering coefficient monotonically decays. The degree distributions are almost the same: the out-degree follows an exponential distribution while both in-degree and undirected degree follow power-law distributions. We further explore the functionality evolution of the LOS network. It is observed that the evolution of functional modules is shown as a sequence of seven events (changes) succeeding each other, including continuing, growth, contraction, birth, splitting, death and merging events. By means of a statistical analysis of these events in the top 4 largest components (i.e., arch, drivers, fs and net), it is shown that continuing, growth and contraction events occupy more than 95% events. Our work exemplifies a better understanding and describing of the dynamics of LOS evolution.

Temporal networks

CERN Document Server

Saramäki, Jari

2013-01-01

The concept of temporal networks is an extension of complex networks as a modeling framework to include information on when interactions between nodes happen. Many studies of the last decade examine how the static network structure affect dynamic systems on the network. In this traditional approach  the temporal aspects are pre-encoded in the dynamic system model. Temporal-network methods, on the other hand, lift the temporal information from the level of system dynamics to the mathematical representation of the contact network itself. This framework becomes particularly useful for cases where there is a lot of structure and heterogeneity both in the timings of interaction events and the network topology. The advantage compared to common static network approaches is the ability to design more accurate models in order to explain and predict large-scale dynamic phenomena (such as, e.g., epidemic outbreaks and other spreading phenomena). On the other hand, temporal network methods are mathematically and concept...

Big Data Analytics for Flow-based Anomaly Detection in High-Speed Networks

OpenAIRE

Garofalo, Mauro

2017-01-01

The Cisco VNI Complete Forecast Highlights clearly states that the Internet traffic is growing in three different directions, Volume, Velocity, and Variety, bringing computer network into the big data era. At the same time, sophisticated network attacks are growing exponentially. Such growth making the existing signature-based security tools, like firewall and traditional intrusion detection systems, ineffective against new kind of attacks or variations of known attacks. In this dissertati...

Fiber Access Networks: Reliability Analysis and Swedish Broadband Market

Science.gov (United States)

Wosinska, Lena; Chen, Jiajia; Larsen, Claus Popp

Fiber access network architectures such as active optical networks (AONs) and passive optical networks (PONs) have been developed to support the growing bandwidth demand. Whereas particularly Swedish operators prefer AON, this may not be the case for operators in other countries. The choice depends on a combination of technical requirements, practical constraints, business models, and cost. Due to the increasing importance of reliable access to the network services, connection availability is becoming one of the most crucial issues for access networks, which should be reflected in the network owner's architecture decision. In many cases protection against failures is realized by adding backup resources. However, there is a trade off between the cost of protection and the level of service reliability since improving reliability performance by duplication of network resources (and capital expenditures CAPEX) may be too expensive. In this paper we present the evolution of fiber access networks and compare reliability performance in relation to investment and management cost for some representative cases. We consider both standard and novel architectures for deployment in both sparsely and densely populated areas. While some recent works focused on PON protection schemes with reduced CAPEX the current and future effort should be put on minimizing the operational expenditures (OPEX) during the access network lifetime.

Application of neural networks in CRM systems

Directory of Open Access Journals (Sweden)

Bojanowska Agnieszka

2017-01-01

Full Text Available The central aim of this study is to investigate how to apply artificial neural networks in Customer Relationship Management (CRM. The paper presents several business applications of neural networks in software systems designed to aid CRM, e.g. in deciding on the profitability of building a relationship with a given customer. Furthermore, a framework for a neural-network based CRM software tool is developed. Building beneficial relationships with customers is generating considerable interest among various businesses, and is often mentioned as one of the crucial objectives of enterprises, next to their key aim: to bring satisfactory profit. There is a growing tendency among businesses to invest in CRM systems, which together with an organisational culture of a company aid managing customer relationships. It is the sheer amount of gathered data as well as the need for constant updating and analysis of this breadth of information that may imply the suitability of neural networks for the application in question. Neural networks exhibit considerably higher computational capabilities than sequential calculations because the solution to a problem is obtained without the need for developing a special algorithm. In the majority of presented CRM applications neural networks constitute and are presented as a managerial decision-taking optimisation tool.

Mitigating Inter-Network Interference in LoRa Networks

OpenAIRE

Voigt, Thiemo; Bor, Martin; Roedig, Utz; Alonso, Juan

2017-01-01

Long Range (LoRa) is a popular technology used to construct Low-Power Wide-Area Network (LPWAN) networks. Given the popularity of LoRa it is likely that multiple independent LoRa networks are deployed in close proximity. In this situation, neighbouring networks interfere and methods have to be found to combat this interference. In this paper we investigate the use of directional antennae and the use of multiple base stations as methods of dealing with inter-network interference. Directional a...

Maximal network reliability for a stochastic power transmission network

International Nuclear Information System (INIS)

Lin, Yi-Kuei; Yeh, Cheng-Ta

2011-01-01

Many studies regarded a power transmission network as a binary-state network and constructed it with several arcs and vertices to evaluate network reliability. In practice, the power transmission network should be stochastic because each arc (transmission line) combined with several physical lines is multistate. Network reliability is the probability that the network can transmit d units of electric power from a power plant (source) to a high voltage substation at a specific area (sink). This study focuses on searching for the optimal transmission line assignment to the power transmission network such that network reliability is maximized. A genetic algorithm based method integrating the minimal paths and the Recursive Sum of Disjoint Products is developed to solve this assignment problem. A real power transmission network is adopted to demonstrate the computational efficiency of the proposed method while comparing with the random solution generation approach.

Social network models predict movement and connectivity in ecological landscapes

Science.gov (United States)

Fletcher, Robert J.; Acevedo, M.A.; Reichert, Brian E.; Pias, Kyle E.; Kitchens, Wiley M.

2011-01-01

Network analysis is on the rise across scientific disciplines because of its ability to reveal complex, and often emergent, patterns and dynamics. Nonetheless, a growing concern in network analysis is the use of limited data for constructing networks. This concern is strikingly relevant to ecology and conservation biology, where network analysis is used to infer connectivity across landscapes. In this context, movement among patches is the crucial parameter for interpreting connectivity but because of the difficulty of collecting reliable movement data, most network analysis proceeds with only indirect information on movement across landscapes rather than using observed movement to construct networks. Statistical models developed for social networks provide promising alternatives for landscape network construction because they can leverage limited movement information to predict linkages. Using two mark-recapture datasets on individual movement and connectivity across landscapes, we test whether commonly used network constructions for interpreting connectivity can predict actual linkages and network structure, and we contrast these approaches to social network models. We find that currently applied network constructions for assessing connectivity consistently, and substantially, overpredict actual connectivity, resulting in considerable overestimation of metapopulation lifetime. Furthermore, social network models provide accurate predictions of network structure, and can do so with remarkably limited data on movement. Social network models offer a flexible and powerful way for not only understanding the factors influencing connectivity but also for providing more reliable estimates of connectivity and metapopulation persistence in the face of limited data.

Social network models predict movement and connectivity in ecological landscapes.

Science.gov (United States)

Fletcher, Robert J; Acevedo, Miguel A; Reichert, Brian E; Pias, Kyle E; Kitchens, Wiley M

2011-11-29

Network analysis is on the rise across scientific disciplines because of its ability to reveal complex, and often emergent, patterns and dynamics. Nonetheless, a growing concern in network analysis is the use of limited data for constructing networks. This concern is strikingly relevant to ecology and conservation biology, where network analysis is used to infer connectivity across landscapes. In this context, movement among patches is the crucial parameter for interpreting connectivity but because of the difficulty of collecting reliable movement data, most network analysis proceeds with only indirect information on movement across landscapes rather than using observed movement to construct networks. Statistical models developed for social networks provide promising alternatives for landscape network construction because they can leverage limited movement information to predict linkages. Using two mark-recapture datasets on individual movement and connectivity across landscapes, we test whether commonly used network constructions for interpreting connectivity can predict actual linkages and network structure, and we contrast these approaches to social network models. We find that currently applied network constructions for assessing connectivity consistently, and substantially, overpredict actual connectivity, resulting in considerable overestimation of metapopulation lifetime. Furthermore, social network models provide accurate predictions of network structure, and can do so with remarkably limited data on movement. Social network models offer a flexible and powerful way for not only understanding the factors influencing connectivity but also for providing more reliable estimates of connectivity and metapopulation persistence in the face of limited data.

Analysis of Road Network Pattern Considering Population Distribution and Central Business District.

Directory of Open Access Journals (Sweden)

Fangxia Zhao

Full Text Available This paper proposes a road network growing model with the consideration of population distribution and central business district (CBD attraction. In the model, the relative neighborhood graph (RNG is introduced as the connection mechanism to capture the characteristics of road network topology. The simulation experiment is set up to illustrate the effects of population distribution and CBD attraction on the characteristics of road network. Moreover, several topological attributes of road network is evaluated by using coverage, circuitness, treeness and total length in the experiment. Finally, the suggested model is verified in the simulation of China and Beijing Highway networks.

Coupling effect of nodes popularity and similarity on social network persistence.

Science.gov (United States)

Jin, Xiaogang; Jin, Cheng; Huang, Jiaxuan; Min, Yong

2017-02-21

Network robustness represents the ability of networks to withstand failures and perturbations. In social networks, maintenance of individual activities, also called persistence, is significant towards understanding robustness. Previous works usually consider persistence on pre-generated network structures; while in social networks, the network structure is growing with the cascading inactivity of existed individuals. Here, we address this challenge through analysis for nodes under a coevolution model, which characterizes individual activity changes under three network growth modes: following the descending order of nodes' popularity, similarity or uniform random. We show that when nodes possess high spontaneous activities, a popularity-first growth mode obtains highly persistent networks; otherwise, with low spontaneous activities, a similarity-first mode does better. Moreover, a compound growth mode, with the consecutive joining of similar nodes in a short period and mixing a few high popularity nodes, obtains the highest persistence. Therefore, nodes similarity is essential for persistent social networks, while properly coupling popularity with similarity further optimizes the persistence. This demonstrates the evolution of nodes activity not only depends on network topology, but also their connective typology.

Network workshop

DEFF Research Database (Denmark)

Bruun, Jesper; Evans, Robert Harry

2014-01-01

This paper describes the background for, realisation of and author reflections on a network workshop held at ESERA2013. As a new research area in science education, networks offer a unique opportunity to visualise and find patterns and relationships in complicated social or academic network data....... These include student relations and interactions and epistemic and linguistic networks of words, concepts and actions. Network methodology has already found use in science education research. However, while networks hold the potential for new insights, they have not yet found wide use in the science education...... research community. With this workshop, participants were offered a way into network science based on authentic educational research data. The workshop was constructed as an inquiry lesson with emphasis on user autonomy. Learning activities had participants choose to work with one of two cases of networks...

On the Design of Energy Efficient Optical Networks with Software Defined Networking Control Across Core and Access Networks

DEFF Research Database (Denmark)

Wang, Jiayuan; Yan, Ying; Dittmann, Lars

2013-01-01

This paper presents a Software Defined Networking (SDN) control plane based on an overlay GMPLS control model. The SDN control platform manages optical core networks (WDM/DWDM networks) and the associated access networks (GPON networks), which makes it possible to gather global information...... and enable wider areas' energy efficiency networking. The energy related information of the networks and the types of the traffic flows are collected and utilized for the end-to-end QoS provision. Dynamic network simulation results show that by applying different routing algorithms according to the type...... of traffic in the core networks, the energy efficiency of the network is improved without compromising the quality of service....

Exploring biological network structure with clustered random networks

Directory of Open Access Journals (Sweden)

Bansal Shweta

2009-12-01

Full Text Available Abstract Background Complex biological systems are often modeled as networks of interacting units. Networks of biochemical interactions among proteins, epidemiological contacts among hosts, and trophic interactions in ecosystems, to name a few, have provided useful insights into the dynamical processes that shape and traverse these systems. The degrees of nodes (numbers of interactions and the extent of clustering (the tendency for a set of three nodes to be interconnected are two of many well-studied network properties that can fundamentally shape a system. Disentangling the interdependent effects of the various network properties, however, can be difficult. Simple network models can help us quantify the structure of empirical networked systems and understand the impact of various topological properties on dynamics. Results Here we develop and implement a new Markov chain simulation algorithm to generate simple, connected random graphs that have a specified degree sequence and level of clustering, but are random in all other respects. The implementation of the algorithm (ClustRNet: Clustered Random Networks provides the generation of random graphs optimized according to a local or global, and relative or absolute measure of clustering. We compare our algorithm to other similar methods and show that ours more successfully produces desired network characteristics. Finding appropriate null models is crucial in bioinformatics research, and is often difficult, particularly for biological networks. As we demonstrate, the networks generated by ClustRNet can serve as random controls when investigating the impacts of complex network features beyond the byproduct of degree and clustering in empirical networks. Conclusion ClustRNet generates ensembles of graphs of specified edge structure and clustering. These graphs allow for systematic study of the impacts of connectivity and redundancies on network function and dynamics. This process is a key step in

Network Degradation Effects on Different Codec Types and Characteristics of Video Streaming

Directory of Open Access Journals (Sweden)

Jaroslav Frnda

2014-01-01

Full Text Available Nowadays, there is a quickly growing demand for the transmission of voice, video and data over an IP based network. Multimedia, whether we are talking about broadcast, audio and video transmission and others, from a global perspective is growing exponentially with time. With incoming requests from users, new technologies for data transfer are continually developing. Data must be delivered reliably and with the fewest losses at such high speed. Video quality as part of multimedia technology has a very important role nowadays. It is influenced by several factors, where each of them can have many forms and processing. Network performance is the major degradation effect that influences the quality of resulting image. Poor network performance (lack of link capacity, high network load… causes data packet losses or different delivery time for each packet. This work focuses exactly on these network phenomena. It examines the impact of different delays and packet losses on the quality parameters of triple play services, to evaluate the results using objective methods. The aim of this work is to bring a detailed view on the performance of video streaming over IP-based networks.

Modelling dendritic ecological networks in space: anintegrated network perspective

Science.gov (United States)

Peterson, Erin E.; Ver Hoef, Jay M.; Isaak, Dan J.; Falke, Jeffrey A.; Fortin, Marie-Josée; Jordon, Chris E.; McNyset, Kristina; Monestiez, Pascal; Ruesch, Aaron S.; Sengupta, Aritra; Som, Nicholas; Steel, E. Ashley; Theobald, David M.; Torgersen, Christian E.; Wenger, Seth J.

2013-01-01

Dendritic ecological networks (DENs) are a unique form of ecological networks that exhibit a dendritic network topology (e.g. stream and cave networks or plant architecture). DENs have a dual spatial representation; as points within the network and as points in geographical space. Consequently, some analytical methods used to quantify relationships in other types of ecological networks, or in 2-D space, may be inadequate for studying the influence of structure and connectivity on ecological processes within DENs. We propose a conceptual taxonomy of network analysis methods that account for DEN characteristics to varying degrees and provide a synthesis of the different approaches within

The performance analysis of linux networking - packet receiving

Energy Technology Data Exchange (ETDEWEB)

Wu, Wenji; Crawford, Matt; Bowden, Mark; /Fermilab

2006-11-01

The computing models for High-Energy Physics experiments are becoming ever more globally distributed and grid-based, both for technical reasons (e.g., to place computational and data resources near each other and the demand) and for strategic reasons (e.g., to leverage equipment investments). To support such computing models, the network and end systems, computing and storage, face unprecedented challenges. One of the biggest challenges is to transfer scientific data sets--now in the multi-petabyte (10{sup 15} bytes) range and expected to grow to exabytes within a decade--reliably and efficiently among facilities and computation centers scattered around the world. Both the network and end systems should be able to provide the capabilities to support high bandwidth, sustained, end-to-end data transmission. Recent trends in technology are showing that although the raw transmission speeds used in networks are increasing rapidly, the rate of advancement of microprocessor technology has slowed down. Therefore, network protocol-processing overheads have risen sharply in comparison with the time spent in packet transmission, resulting in degraded throughput for networked applications. More and more, it is the network end system, instead of the network, that is responsible for degraded performance of network applications. In this paper, the Linux system's packet receive process is studied from NIC to application. We develop a mathematical model to characterize the Linux packet receiving process. Key factors that affect Linux systems network performance are analyzed.

Energy-aware virtual network embedding in flexi-grid networks.

Science.gov (United States)

Lin, Rongping; Luo, Shan; Wang, Haoran; Wang, Sheng

2017-11-27

Network virtualization technology has been proposed to allow multiple heterogeneous virtual networks (VNs) to coexist on a shared substrate network, which increases the utilization of the substrate network. Efficiently mapping VNs on the substrate network is a major challenge on account of the VN embedding (VNE) problem. Meanwhile, energy efficiency has been widely considered in the network design in terms of operation expenses and the ecological awareness. In this paper, we aim to solve the energy-aware VNE problem in flexi-grid optical networks. We provide an integer linear programming (ILP) formulation to minimize the electricity cost of each arriving VN request. We also propose a polynomial-time heuristic algorithm where virtual links are embedded sequentially to keep a reasonable acceptance ratio and maintain a low electricity cost. Numerical results show that the heuristic algorithm performs closely to the ILP for a small size network, and we also demonstrate its applicability to larger networks.

Resilient Disaster Network Based on Software Defined Cognitive Wireless Network Technology

Directory of Open Access Journals (Sweden)

Goshi Sato

2015-01-01

Full Text Available In order to temporally recover the information network infrastructure in disaster areas from the Great East Japan Earthquake in 2011, various wireless network technologies such as satellite IP network, 3G, and Wi-Fi were effectively used. However, since those wireless networks are individually introduced and installed but not totally integrated, some of networks were congested due to the sudden network traffic generation and unbalanced traffic distribution, and eventually the total network could not effectively function. In this paper, we propose a disaster resilient network which integrates various wireless networks into a cognitive wireless network that users can use as an access network to the Internet at the serious disaster occurrence. We designed and developed the disaster resilient network based on software defined network (SDN technology to automatically select the best network link and route among the possible access networks to the Internet by periodically monitoring their network states and evaluate those using extended AHP method. In order to verify the usefulness of our proposed system, a prototype system is constructed and its performance is evaluated.

Making Wireless Networks Secure for NASA Mission Critical Applications Using Virtual Private Network (VPN) Technology

Science.gov (United States)

Nichols, Kelvin F.; Best, Susan; Schneider, Larry

2004-01-01

With so many security issues involved with wireless networks, the technology has not been fully utilized in the area of mission critical applications. These applications would include the areas of telemetry, commanding, voice and video. Wireless networking would allow payload operators the mobility to take computers outside of the control room to their off ices and anywhere else in the facility that the wireless network was extended. But the risk is too great of having someone sit just inside of your wireless network coverage and intercept enough of your network traffic to steal proprietary data from a payload experiment or worse yet hack back into your system and do even greater harm by issuing harmful commands. Wired Equivalent Privacy (WEP) is improving but has a ways to go before it can be trusted to protect mission critical data. Today s hackers are becoming more aggressive and innovative, and in order to take advantage of the benefits that wireless networking offer, appropriate security measures need to be in place that will thwart hackers. The Virtual Private Network (VPN) offers a solution to the security problems that have kept wireless networks from being used for mission critical applications. VPN provides a level of encryption that will ensure that data is protected while it is being transmitted over a wireless local area network (LAN). The VPN allows a user to authenticate to the site that the user needs to access. Once this authentication has taken place the network traffic between that site and the user is encapsulated in VPN packets with the Triple Data Encryption Standard (3DES). 3DES is an encryption standard that uses a single secret key to encrypt and decrypt data. The length of the encryption key is 168 bits as opposed to its predecessor DES that has a 56-bit encryption key. Even though 3DES is the common encryption standard for today, the Advance Encryption Standard (AES), which provides even better encryption at a lower cycle cost is growing

Deploying temporary networks for upscaling of sparse network stations

Science.gov (United States)

Coopersmith, Evan J.; Cosh, Michael H.; Bell, Jesse E.; Kelly, Victoria; Hall, Mark; Palecki, Michael A.; Temimi, Marouane

2016-10-01

Soil observations networks at the national scale play an integral role in hydrologic modeling, drought assessment, agricultural decision support, and our ability to understand climate change. Understanding soil moisture variability is necessary to apply these measurements to model calibration, business and consumer applications, or even human health issues. The installation of soil moisture sensors as sparse, national networks is necessitated by limited financial resources. However, this results in the incomplete sampling of the local heterogeneity of soil type, vegetation cover, topography, and the fine spatial distribution of precipitation events. To this end, temporary networks can be installed in the areas surrounding a permanent installation within a sparse network. The temporary networks deployed in this study provide a more representative average at the 3 km and 9 km scales, localized about the permanent gauge. The value of such temporary networks is demonstrated at test sites in Millbrook, New York and Crossville, Tennessee. The capacity of a single U.S. Climate Reference Network (USCRN) sensor set to approximate the average of a temporary network at the 3 km and 9 km scales using a simple linear scaling function is tested. The capacity of a temporary network to provide reliable estimates with diminishing numbers of sensors, the temporal stability of those networks, and ultimately, the relationship of the variability of those networks to soil moisture conditions at the permanent sensor are investigated. In this manner, this work demonstrates the single-season installation of a temporary network as a mechanism to characterize the soil moisture variability at a permanent gauge within a sparse network.

NETWORK, HOW? Perceptions of business people on networking practices

Directory of Open Access Journals (Sweden)

Saskia De Klerk

2010-12-01

Full Text Available Purpose: The purpose of this paper was to contribute to literature on networking from a South African perspective. Literature on networking is mainly concentrated on the European and American contexts with homogeneous groups and traditional divisions. The business landscape of South Africa thus requires more investigation. Problem investigated: Literature regarding networking in an South African context with its dynamic business environment is limited. This article addresses the concerns of how South African business owners and managers perceive networking in their businesses and specifically focus on the South African perspective. Therefore, the focus is on the perceptions of business owners and managers on current networking practices in South Africa. Methodology: A qualitative research design to uncover the rich underlying feelings of business owners and managers was used. The qualitative enquiry consisted of five focus group discussions (n=41 participants among prominent business owners and managers in the Gauteng Province, South Africa. The Gauteng Province was selected since it is the economic and innovation hub of South Africa. Findings and implications: The main findings showed the following main themes of networking that emerged from the data, and included (1 networking as a skill versus a natural ability; (2 the motivation behind networking; (3 the loci of networking; (4 the type of relationships that determine the character of the network; and (5 the relationship characteristics of successful networking. The main contribution of this is that there seems to be different networking situations and applications for different circumstances. According to the participants, it seems that networking in the South African landscape appears to be either relationship or business based. Originality and value of the research: The value of these findings lies in the fact that they contribute to networking literature from a South African perspective

Localizing and placement of network node functions in a network

NARCIS (Netherlands)

Strijkers, R.J.; Meulenhoff, P.J.

2014-01-01

The invention enables placement and use of a network node function in a second network node instead of using the network node function in a first network node. The network node function is e.g. a server function or a router function. The second network node is typically located in or close to the

How democratic are Networks?- A framework for Assessing the Democratic Effects of Networks

DEFF Research Database (Denmark)

Agger, Annika; Löfgren, Karl

: How can we assess the democratic effects of formal network mobilisation?  The article will present a tentative framework deriving criteria from both traditional democratic theory, as well as new theories on democratic governance and collaborative planning, which can be deployed for empirical studies......There has, since the end of the 1980s, been a growing interest in western democracies for formally involving citizens in various local planning activities through network governance. The overarching goal has been to increase efficiency in local planning. Equally, it has also been accompanied...... by an underlying idea of enhancing public participation and mobilising the citizens, thereby strengthening local democracy. Even though much is written about these initiatives, the actual democratic effects of these activities have been notably overlooked in the literature. Both among scholars, as well...

Facilitating conditions for boundary-spanning behavior in governance networks

OpenAIRE

Meerkerk, Ingmar; Edelenbos, Jurian

2017-01-01

textabstractThis article examines the impact of two facilitating conditions for boundary-spanning behaviour in urban governance networks. While research on boundary spanning is growing, there is little attention for antecedents. Combining governance network literature on project management and organizational literature on facilitative and servant leadership, we examine two potential conditions: a facilitative project management style and executive support. We conducted survey research among p...

Creative Network Communities in the Translocal Space of Digital Networks

Directory of Open Access Journals (Sweden)

Rasa Smite

2013-01-01

Full Text Available What should sociological research be in the age of Web 2.0? Considering that the task of “network sociology” is not only empirical research but also the interpretation of tendencies of the network culture, this research explores the rise of network communities within Eastern and Western Europe in the early Internet era. I coined the term creative networks to distinguish these early creative and social activities from today’s popular social networking. Thus I aimed to interpret the meaning of social action; the motivation of creative community actors, their main fields of activities and social organization forms; and the potential that these early developments contain for the future sustainability of networks. Data comprise interviews with networking experts and founders and members of various networks. Investigating respondents’ motivations for creating online networks and communities, and interpreting those terms, allows for comparing the creative networks of the 1990s with today’s social networks and for drawing conclusions.

A SURVEY on WIRELESS MESH NETWORKS, ROUTING METRICS and PROTOCOLS

Directory of Open Access Journals (Sweden)

Safak DURUKAN ODABASI

2013-01-01

Full Text Available Today, Internet has become an indispensable part of our daily lives. It has a growing user community in many fields from banking transactions to online entertainment. It will be very efficient for users, as the next generation internet access becomes wireless like frequently used services such as cellular phones. But for providing this, a new network is needed to be designed or an existing network must be improved as well as making changes on infrastructure. At this point, mesh network infrastructure arises and offers more sophisticated internet access with less need. The most important advantage of mesh networks is the capability of working without infrastructure. Mesh networks are an additional access technology more than being a renewed one in the next generation wireless networks called 4G. In this study, wireless mesh networks and example applications are mentioned. Base architecture and design factors are emphasized, current routing protocols that are used on wireless mesh networks and routing metrics on which these protocols are based, are explained. Finally, the performance effects of these protocols and metrics on different network topologies are referred.

Software-Enabled Distributed Network Governance: The PopMedNet Experience.

Science.gov (United States)

Davies, Melanie; Erickson, Kyle; Wyner, Zachary; Malenfant, Jessica; Rosen, Rob; Brown, Jeffrey

2016-01-01

The expanded availability of electronic health information has led to increased interest in distributed health data research networks. The distributed research network model leaves data with and under the control of the data holder. Data holders, network coordinating centers, and researchers have distinct needs and challenges within this model. The concerns of network stakeholders are addressed in the design and governance models of the PopMedNet software platform. PopMedNet features include distributed querying, customizable workflows, and auditing and search capabilities. Its flexible role-based access control system enables the enforcement of varying governance policies. Four case studies describe how PopMedNet is used to enforce network governance models. Trust is an essential component of a distributed research network and must be built before data partners may be willing to participate further. The complexity of the PopMedNet system must be managed as networks grow and new data, analytic methods, and querying approaches are developed. The PopMedNet software platform supports a variety of network structures, governance models, and research activities through customizable features designed to meet the needs of network stakeholders.

Coupled disease-behavior dynamics on complex networks: A review

Science.gov (United States)

Wang, Zhen; Andrews, Michael A.; Wu, Zhi-Xi; Wang, Lin; Bauch, Chris T.

2015-12-01

It is increasingly recognized that a key component of successful infection control efforts is understanding the complex, two-way interaction between disease dynamics and human behavioral and social dynamics. Human behavior such as contact precautions and social distancing clearly influence disease prevalence, but disease prevalence can in turn alter human behavior, forming a coupled, nonlinear system. Moreover, in many cases, the spatial structure of the population cannot be ignored, such that social and behavioral processes and/or transmission of infection must be represented with complex networks. Research on studying coupled disease-behavior dynamics in complex networks in particular is growing rapidly, and frequently makes use of analysis methods and concepts from statistical physics. Here, we review some of the growing literature in this area. We contrast network-based approaches to homogeneous-mixing approaches, point out how their predictions differ, and describe the rich and often surprising behavior of disease-behavior dynamics on complex networks, and compare them to processes in statistical physics. We discuss how these models can capture the dynamics that characterize many real-world scenarios, thereby suggesting ways that policy makers can better design effective prevention strategies. We also describe the growing sources of digital data that are facilitating research in this area. Finally, we suggest pitfalls which might be faced by researchers in the field, and we suggest several ways in which the field could move forward in the coming years.

Comparison analysis on vulnerability of metro networks based on complex network

Science.gov (United States)

Zhang, Jianhua; Wang, Shuliang; Wang, Xiaoyuan

2018-04-01

This paper analyzes the networked characteristics of three metro networks, and two malicious attacks are employed to investigate the vulnerability of metro networks based on connectivity vulnerability and functionality vulnerability. Meanwhile, the networked characteristics and vulnerability of three metro networks are compared with each other. The results show that Shanghai metro network has the largest transport capacity, Beijing metro network has the best local connectivity and Guangzhou metro network has the best global connectivity, moreover Beijing metro network has the best homogeneous degree distribution. Furthermore, we find that metro networks are very vulnerable subjected to malicious attacks, and Guangzhou metro network has the best topological structure and reliability among three metro networks. The results indicate that the proposed methodology is feasible and effective to investigate the vulnerability and to explore better topological structure of metro networks.

Developing a Framework for Effective Network Capacity Planning

Science.gov (United States)

Yaprak, Ece

2005-01-01

As Internet traffic continues to grow exponentially, developing a clearer understanding of, and appropriately measuring, network's performance is becoming ever more critical. An important challenge faced by the Information Resources Directorate (IRD) at the Johnson Space Center in this context remains not only monitoring and maintaining a secure network, but also better understanding the capacity and future growth potential boundaries of its network. This requires capacity planning which involves modeling and simulating different network alternatives, and incorporating changes in design as technologies, components, configurations, and applications change, to determine optimal solutions in light of IRD's goals, objectives and strategies. My primary task this summer was to address this need. I evaluated network-modeling tools from OPNET Technologies Inc. and Compuware Corporation. I generated a baseline model for Building 45 using both tools by importing "real" topology/traffic information using IRD's various network management tools. I compared each tool against the other in terms of the advantages and disadvantages of both tools to accomplish IRD's goals. I also prepared step-by-step "how to design a baseline model" tutorial for both OPNET and Compuware products.

Hierarchical Network Design

DEFF Research Database (Denmark)

Thomadsen, Tommy

2005-01-01

Communication networks are immensely important today, since both companies and individuals use numerous services that rely on them. This thesis considers the design of hierarchical (communication) networks. Hierarchical networks consist of layers of networks and are well-suited for coping...... with changing and increasing demands. Two-layer networks consist of one backbone network, which interconnects cluster networks. The clusters consist of nodes and links, which connect the nodes. One node in each cluster is a hub node, and the backbone interconnects the hub nodes of each cluster and thus...... the clusters. The design of hierarchical networks involves clustering of nodes, hub selection, and network design, i.e. selection of links and routing of ows. Hierarchical networks have been in use for decades, but integrated design of these networks has only been considered for very special types of networks...

Telecommunication networks

CERN Document Server

Iannone, Eugenio

2011-01-01

Many argue that telecommunications network infrastructure is the most impressive and important technology ever developed. Analyzing the telecom market's constantly evolving trends, research directions, infrastructure, and vital needs, Telecommunication Networks responds with revolutionized engineering strategies to optimize network construction. Omnipresent in society, telecom networks integrate a wide range of technologies. These include quantum field theory for the study of optical amplifiers, software architectures for network control, abstract algebra required to design error correction co

Temporal networks

Science.gov (United States)

Holme, Petter; Saramäki, Jari

2012-10-01

A great variety of systems in nature, society and technology-from the web of sexual contacts to the Internet, from the nervous system to power grids-can be modeled as graphs of vertices coupled by edges. The network structure, describing how the graph is wired, helps us understand, predict and optimize the behavior of dynamical systems. In many cases, however, the edges are not continuously active. As an example, in networks of communication via e-mail, text messages, or phone calls, edges represent sequences of instantaneous or practically instantaneous contacts. In some cases, edges are active for non-negligible periods of time: e.g., the proximity patterns of inpatients at hospitals can be represented by a graph where an edge between two individuals is on throughout the time they are at the same ward. Like network topology, the temporal structure of edge activations can affect dynamics of systems interacting through the network, from disease contagion on the network of patients to information diffusion over an e-mail network. In this review, we present the emergent field of temporal networks, and discuss methods for analyzing topological and temporal structure and models for elucidating their relation to the behavior of dynamical systems. In the light of traditional network theory, one can see this framework as moving the information of when things happen from the dynamical system on the network, to the network itself. Since fundamental properties, such as the transitivity of edges, do not necessarily hold in temporal networks, many of these methods need to be quite different from those for static networks. The study of temporal networks is very interdisciplinary in nature. Reflecting this, even the object of study has many names-temporal graphs, evolving graphs, time-varying graphs, time-aggregated graphs, time-stamped graphs, dynamic networks, dynamic graphs, dynamical graphs, and so on. This review covers different fields where temporal graphs are considered

Linear network theory

CERN Document Server

Sander, K F

1964-01-01

Linear Network Theory covers the significant algebraic aspect of network theory, with minimal reference to practical circuits. The book begins the presentation of network analysis with the exposition of networks containing resistances only, and follows it up with a discussion of networks involving inductance and capacity by way of the differential equations. Classification and description of certain networks, equivalent networks, filter circuits, and network functions are also covered. Electrical engineers, technicians, electronics engineers, electricians, and students learning the intricacies

An Overview of Sensor networks for Environmental Noise Monitoring

NARCIS (Netherlands)

Basten, T.G.H.; Wessels, P.W.

2014-01-01

The last decade has shown a growing number and wide variety of systems for monitoring environmental noise. This ongoing development is made possible by the availability of cheaper and smaller hardware and innovations in communication networks. The developments are fed by a growing interest in

From network structure to network reorganization: implications for adult neurogenesis

International Nuclear Information System (INIS)

Schneider-Mizell, Casey M; Zochowski, Michal R; Sander, Leonard M; Parent, Jack M; Ben-Jacob, Eshel

2010-01-01

Networks can be dynamical systems that undergo functional and structural reorganization. One example of such a process is adult hippocampal neurogenesis, in which new cells are continuously born and incorporate into the existing network of the dentate gyrus region of the hippocampus. Many of these introduced cells mature and become indistinguishable from established neurons, joining the existing network. Activity in the network environment is known to promote birth, survival and incorporation of new cells. However, after epileptogenic injury, changes to the connectivity structure around the neurogenic niche are known to correlate with aberrant neurogenesis. The possible role of network-level changes in the development of epilepsy is not well understood. In this paper, we use a computational model to investigate how the structural and functional outcomes of network reorganization, driven by addition of new cells during neurogenesis, depend on the original network structure. We find that there is a stable network topology that allows the network to incorporate new neurons in a manner that enhances activity of the persistently active region, but maintains global network properties. In networks having other connectivity structures, new cells can greatly alter the distribution of firing activity and destroy the initial activity patterns. We thus find that new cells are able to provide focused enhancement of network only for small-world networks with sufficient inhibition. Network-level deviations from this topology, such as those caused by epileptogenic injury, can set the network down a path that develops toward pathological dynamics and aberrant structural integration of new cells

Green networking and communications ICT for sustainability

CERN Document Server

Khan, Shafiullah

2013-01-01

Although the information and communication technology (ICT) industry accounted for only 2 percent of global greenhouse gas emissions in 2007, the explosive increase in data traffic brought about by a rapidly growing user base of more than a billion wireless subscribers is expected to nearly double that number by 2020. It is clear that now is the time to rethink how we design and build our networks.Green Networking and Communications: ICT for Sustainability brings together leading academic and industrial researchers from around the world to discuss emerging developments in energy-efficient netw

SOFTWARE DEFINED NETWORKS (SDN): APPROACHES NEEDED FOR UP-GRADATION OF SDN'S

OpenAIRE

Deepak Kumar*, Manu Sood

2017-01-01

SDN has changed the way of thinking about networks. SDN networks are flexible, scalable and easily manageable. Application that runs on the management plane actually utilize the network efficiency, So application developed should be capable of handling the controllers functionality. Each of the application that runs should be free from viruses, so that it does not affect the controller. Also we need to increase the level of security in all layers of the SDN architecture. SDN is growing faster...

Correlated network of networks enhances robustness against catastrophic failures.

Science.gov (United States)

Min, Byungjoon; Zheng, Muhua

2018-01-01

Networks in nature rarely function in isolation but instead interact with one another with a form of a network of networks (NoN). A network of networks with interdependency between distinct networks contains instability of abrupt collapse related to the global rule of activation. As a remedy of the collapse instability, here we investigate a model of correlated NoN. We find that the collapse instability can be removed when hubs provide the majority of interconnections and interconnections are convergent between hubs. Thus, our study identifies a stable structure of correlated NoN against catastrophic failures. Our result further suggests a plausible way to enhance network robustness by manipulating connection patterns, along with other methods such as controlling the state of node based on a local rule.

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

Directory of Open Access Journals (Sweden)

WenJun Zhang

2012-06-01

Full Text Available In present study I defined a new type of network, the statistic network. The statistic network is a weighted and non-deterministic network. In the statistic network, a connection value, i.e., connection weight, represents connection strength and connection likelihood between two nodes and its absolute value falls in the interval (0,1]. The connection value is expressed as a statistical measure such as correlation coefficient, association coefficient, or Jaccard coefficient, etc. In addition, all connections of the statistic network can be statistically tested for their validity. A connection is true if the connection value is statistically significant. If all connection values of a node are not statistically significant, it is an isolated node. An isolated node has not any connection to other nodes in the statistic network. Positive and negative connection values denote distinct connectiontypes (positive or negative association or interaction. In the statistic network, two nodes with the greater connection value will show more similar trend in the change of their states. At any time we can obtain a sample network of the statistic network. A sample network is a non-weighted and deterministic network. Thestatistic network, in particular the plant association network that constructed from field sampling, is mostly an information network. Most of the interspecific relationships in plant community are competition and cooperation. Therefore in comparison to animal networks, the methodology of statistic network is moresuitable to construct plant association networks. Some conclusions were drawn from this study: (1 in the plant association network, most connections are weak and positive interactions. The association network constructed from Spearman rank correlation has most connections and isolated taxa are fewer. From net linear correlation,linear correlation, to Spearman rank correlation, the practical number of connections and connectance in the

The Emergence of Denmark’s Tax Treaty Network — A Historical View

Directory of Open Access Journals (Sweden)

Schmidt Peter Koerver

2018-04-01

Full Text Available This contribution analyzes the origin and creation of Denmark’s tax treaty network in a historical perspective. The development of the Danish treaty network is studied through an international perspective and by discussing a number of milestone events. It is concluded that the general tendency has pointed toward a continuously growing Danish treaty network and also that the question on abuse of the treaties has become of greater concern during the past decades. Moreover, it is argued that the growing number and importance of Denmark’s tax treaties over time created a need for the Danish parliament to be more directly involved in the conclusion of new tax treaties.

The Network Completion Problem: Inferring Missing Nodes and Edges in Networks

Energy Technology Data Exchange (ETDEWEB)

Kim, M; Leskovec, J

2011-11-14

Network structures, such as social networks, web graphs and networks from systems biology, play important roles in many areas of science and our everyday lives. In order to study the networks one needs to first collect reliable large scale network data. While the social and information networks have become ubiquitous, the challenge of collecting complete network data still persists. Many times the collected network data is incomplete with nodes and edges missing. Commonly, only a part of the network can be observed and we would like to infer the unobserved part of the network. We address this issue by studying the Network Completion Problem: Given a network with missing nodes and edges, can we complete the missing part? We cast the problem in the Expectation Maximization (EM) framework where we use the observed part of the network to fit a model of network structure, and then we estimate the missing part of the network using the model, re-estimate the parameters and so on. We combine the EM with the Kronecker graphs model and design a scalable Metropolized Gibbs sampling approach that allows for the estimation of the model parameters as well as the inference about missing nodes and edges of the network. Experiments on synthetic and several real-world networks show that our approach can effectively recover the network even when about half of the nodes in the network are missing. Our algorithm outperforms not only classical link-prediction approaches but also the state of the art Stochastic block modeling approach. Furthermore, our algorithm easily scales to networks with tens of thousands of nodes.

Network maintenance

CERN Multimedia

GS Department

2009-01-01

A site-wide network maintenance operation has been scheduled for Saturday 28 February. Most of the network devices of the general purpose network will be upgraded to a newer software version, in order to improve our network monitoring capabilities. This will result in a series of short (2-5 minutes) random interruptions everywhere on the CERN sites throughout the day. This upgrade will not affect the Computer Centre itself, Building 613, the Technical Network and the LHC experiments, dedicated networks at the pits. For further details of this intervention, please contact Netops by phone 74927 or e-mail mailto:Netops@cern.ch. IT/CS Group

Network maintenance

CERN Multimedia

IT Department

2009-01-01

A site wide network maintenance has been scheduled for Saturday 28 February. Most of the network devices of the General Purpose network will be upgraded to a newer software version, in order to improve our network monitoring capabilities. This will result in a series of short (2-5 minutes) random interruptions everywhere on the CERN sites along this day. This upgrade will not affect: the Computer centre itself, building 613, the Technical Network and the LHC experiments dedicated networks at the pits. Should you need more details on this intervention, please contact Netops by phone 74927 or email mailto:Netops@cern.ch. IT/CS Group

Network reconfiguration and neuronal plasticity in rhythm-generating networks.

Science.gov (United States)

Koch, Henner; Garcia, Alfredo J; Ramirez, Jan-Marino

2011-12-01

Neuronal networks are highly plastic and reconfigure in a state-dependent manner. The plasticity at the network level emerges through multiple intrinsic and synaptic membrane properties that imbue neurons and their interactions with numerous nonlinear properties. These properties are continuously regulated by neuromodulators and homeostatic mechanisms that are critical to maintain not only network stability and also adapt networks in a short- and long-term manner to changes in behavioral, developmental, metabolic, and environmental conditions. This review provides concrete examples from neuronal networks in invertebrates and vertebrates, and illustrates that the concepts and rules that govern neuronal networks and behaviors are universal.

Social networks of patients with psychosis: a systematic review.

Science.gov (United States)

Palumbo, Claudia; Volpe, Umberto; Matanov, Aleksandra; Priebe, Stefan; Giacco, Domenico

2015-10-12

Social networks are important for mental health outcomes as they can mobilise resources and help individuals to cope with social stressors. Individuals with psychosis may have specific difficulties in establishing and maintaining social relationships which impacts on their well-being and quality of life. There has been a growing interest in developing social network interventions for patients with psychotic disorders. A systematic literature review was conducted to investigate the size of social networks of patients with psychotic disorders, as well as their friendship networks. A systematic electronic search was carried out in MEDLINE, EMBASE and PsychINFO databases using a combination of search terms relating to 'social network', 'friendship' and 'psychotic disorder'. The search identified 23 relevant papers. Out of them, 20 reported patient social network size. Four papers reported the mean number of friends in addition to whole network size, while three further papers focused exclusively on the number of friends. Findings varied substantially across the studies, with a weighted mean size of 11.7 individuals for whole social networks and 3.4 individuals for friendship networks. On average, 43.1 % of the whole social network was composed of family members, while friends accounted for 26.5 %. Studies assessing whole social network size and friendship networks of people with psychosis are difficult to compare as different concepts and methods of assessment were applied. The extent of the overlap between different social roles assessed in the networks was not always clear. Greater conceptual and methodological clarity is needed in order to help the development of effective strategies to increase social resources of patients with psychosis.

Psychology and social networks: a dynamic network theory perspective.

Science.gov (United States)

Westaby, James D; Pfaff, Danielle L; Redding, Nicholas

2014-04-01

Research on social networks has grown exponentially in recent years. However, despite its relevance, the field of psychology has been relatively slow to explain the underlying goal pursuit and resistance processes influencing social networks in the first place. In this vein, this article aims to demonstrate how a dynamic network theory perspective explains the way in which social networks influence these processes and related outcomes, such as goal achievement, performance, learning, and emotional contagion at the interpersonal level of analysis. The theory integrates goal pursuit, motivation, and conflict conceptualizations from psychology with social network concepts from sociology and organizational science to provide a taxonomy of social network role behaviors, such as goal striving, system supporting, goal preventing, system negating, and observing. This theoretical perspective provides psychologists with new tools to map social networks (e.g., dynamic network charts), which can help inform the development of change interventions. Implications for social, industrial-organizational, and counseling psychology as well as conflict resolution are discussed, and new opportunities for research are highlighted, such as those related to dynamic network intelligence (also known as cognitive accuracy), levels of analysis, methodological/ethical issues, and the need to theoretically broaden the study of social networking and social media behavior. (PsycINFO Database Record (c) 2014 APA, all rights reserved).

Statistical network analysis for analyzing policy networks

DEFF Research Database (Denmark)

Robins, Garry; Lewis, Jenny; Wang, Peng

2012-01-01

and policy network methodology is the development of statistical modeling approaches that can accommodate such dependent data. In this article, we review three network statistical methods commonly used in the current literature: quadratic assignment procedures, exponential random graph models (ERGMs......To analyze social network data using standard statistical approaches is to risk incorrect inference. The dependencies among observations implied in a network conceptualization undermine standard assumptions of the usual general linear models. One of the most quickly expanding areas of social......), and stochastic actor-oriented models. We focus most attention on ERGMs by providing an illustrative example of a model for a strategic information network within a local government. We draw inferences about the structural role played by individuals recognized as key innovators and conclude that such an approach...

Animal transportation networks

Science.gov (United States)

Perna, Andrea; Latty, Tanya

2014-01-01

Many group-living animals construct transportation networks of trails, galleries and burrows by modifying the environment to facilitate faster, safer or more efficient movement. Animal transportation networks can have direct influences on the fitness of individuals, whereas the shape and structure of transportation networks can influence community dynamics by facilitating contacts between different individuals and species. In this review, we discuss three key areas in the study of animal transportation networks: the topological properties of networks, network morphogenesis and growth, and the behaviour of network users. We present a brief primer on elements of network theory, and then discuss the different ways in which animal groups deal with the fundamental trade-off between the competing network properties of travel efficiency, robustness and infrastructure cost. We consider how the behaviour of network users can impact network efficiency, and call for studies that integrate both network topology and user behaviour. We finish with a prospectus for future research. PMID:25165598

Disentangling bipartite and core-periphery structure in financial networks

International Nuclear Information System (INIS)

Barucca, Paolo; Lillo, Fabrizio

2016-01-01

A growing number of systems are represented as networks whose architecture conveys significant information and determines many of their properties. Examples of network architecture include modular, bipartite, and core-periphery structures. However inferring the network structure is a non trivial task and can depend sometimes on the chosen null model. Here we propose a method for classifying network structures and ranking its nodes in a statistically well-grounded fashion. The method is based on the use of Belief Propagation for learning through Entropy Maximization on both the Stochastic Block Model (SBM) and the degree-corrected Stochastic Block Model (dcSBM). As a specific application we show how the combined use of the two ensembles—SBM and dcSBM—allows to disentangle the bipartite and the core-periphery structure in the case of the e-MID interbank network. Specifically we find that, taking into account the degree, this interbank network is better described by a bipartite structure, while using the SBM the core-periphery structure emerges only when data are aggregated for more than a week.

A key heterogeneous structure of fractal networks based on inverse renormalization scheme

Science.gov (United States)

Bai, Yanan; Huang, Ning; Sun, Lina

2018-06-01

Self-similarity property of complex networks was found by the application of renormalization group theory. Based on this theory, network topologies can be classified into universality classes in the space of configurations. In return, through inverse renormalization scheme, a given primitive structure can grow into a pure fractal network, then adding different types of shortcuts, it exhibits different characteristics of complex networks. However, the effect of primitive structure on networks structural property has received less attention. In this paper, we introduce a degree variance index to measure the dispersion of nodes degree in the primitive structure, and investigate the effect of the primitive structure on network structural property quantified by network efficiency. Numerical simulations and theoretical analysis show a primitive structure is a key heterogeneous structure of generated networks based on inverse renormalization scheme, whether or not adding shortcuts, and the network efficiency is positively correlated with degree variance of the primitive structure.

Analyzing Multimode Wireless Sensor Networks Using the Network Calculus

Directory of Open Access Journals (Sweden)

Xi Jin

2015-01-01

Full Text Available The network calculus is a powerful tool to analyze the performance of wireless sensor networks. But the original network calculus can only model the single-mode wireless sensor network. In this paper, we combine the original network calculus with the multimode model to analyze the maximum delay bound of the flow of interest in the multimode wireless sensor network. There are two combined methods A-MM and N-MM. The method A-MM models the whole network as a multimode component, and the method N-MM models each node as a multimode component. We prove that the maximum delay bound computed by the method A-MM is tighter than or equal to that computed by the method N-MM. Experiments show that our proposed methods can significantly decrease the analytical delay bound comparing with the separate flow analysis method. For the large-scale wireless sensor network with 32 thousands of sensor nodes, our proposed methods can decrease about 70% of the analytical delay bound.

Toward Designing a Quantum Key Distribution Network Simulation Model

OpenAIRE

Miralem Mehic; Peppino Fazio; Miroslav Voznak; Erik Chromy

2016-01-01

As research in quantum key distribution network technologies grows larger and more complex, the need for highly accurate and scalable simulation technologies becomes important to assess the practical feasibility and foresee difficulties in the practical implementation of theoretical achievements. In this paper, we described the design of simplified simulation environment of the quantum key distribution network with multiple links and nodes. In such simulation environment, we analyzed several ...

A SURVEY ON WAVELENGTH DIVISION MULTIPLEXING (WDM NETWORKS

Directory of Open Access Journals (Sweden)

G. Ramesh

2010-03-01

Full Text Available Communication networks have emerged as a source of empowerment in today’s society. At the global level, the Internet is becoming the backbone of the modern economy. The new generations in developed countries cannot even conceive of a world without broadband access to the Internet. The inability of the current Internet infrastructure to cope with the wide variety and ever growing number of users, emerging networked applications, usage patterns and business models is increasingly being recognized worldwide. The dynamic growth of Internet traffic and its bursty nature requires high transmission rate. With the advances and the progress in Wavelength Division Multiplexing (WDM technology, the amount of raw bandwidth available in fiber links has increased to high magnitude. This paper presents a survey on WDM networks from its development to the current status. Also an analysis on buffer size in optical networks for real time traffic was performed.

Local Social Networks

DEFF Research Database (Denmark)

Sapuppo, Antonio; Sørensen, Lene Tolstrup

2011-01-01

Online social networks have become essential for many users in their daily communication. Through a combination of the online social networks with opportunistic networks, a new concept arises: Local Social Networks. The target of local social networks is to promote social networking benefits...... in physical environment in order to leverage personal affinities in the users' surroundings. The purpose of this paper is to present and discuss the concept of local social networks as a new social communication system. Particularly, the preliminary architecture and the prototype of local social networks...

From Offline Social Networks to Online Social Networks: Changes in Entrepreneurship

Directory of Open Access Journals (Sweden)

Yang SONG

2015-01-01

Full Text Available The paper reviewed studies of entrepreneurship based on the emergency of online social networks. Similar to offline social networks, entrepreneurs’ online social networks have their own unique characteristics. We first reviewed the offline network based research on entrepreneurship. Then we reviewed the studies of entrepreneurship in the context of online social networks including those focusing on topics of network structures and network ties. We highlighted online network communities based on the data collected from LinkedIn, Facebook and Twitter. Our research implies that both researcher and entrepreneurs are facing new opportunities due to the emergence of online social networks.

Investigation of the network delay on Profibus-DP based network

OpenAIRE

Yılmaz, C.; Gürdal, O.; Sayan, H.H.

2008-01-01

The mathematical model of the network-induced delay control systems (NDCS) is given. Also the role of the NDCS’s components such as controller, sensor and network environment on the network-induced delay are included in the mathematical model of the system. The network delay is investigated on Profibus-DP based network application and experimental results obtained are presented graphically. The experimental results obtained show that the network induced delay is randomly changed according to ...

Study of social network and its impact in the adolescence

Directory of Open Access Journals (Sweden)

Isabel PAGADOR OTERO

2014-11-01

Full Text Available In the following article the social networks and his implication are analyzed and approach in the teenagers since, nowadays, to belong to a social network in certain ages is a need to be able to be in touch with the company and the environment that surrounds us. This term, social network is linked to the integration of the technologies, technologies that accompany the teenagers in every moment since these have turned into the principal actors/consumers of this opportunity arisen in the Internet bosom. It has turned into a risky fact for a generation who are in a growing period, setting out values and forming their personality. It is here where the problems appear, these social networks could become a major enemy to youngsters. For it there will be approached each of the following questions: what sound the social networks and that you differentiate can we find between them?, how is friendship constituted in the social networks and the privacy?, what risks can they find when these social networks are in use with acquaintances or strangers?

INPRO – Networking Practices and Opportunities

International Nuclear Information System (INIS)

Grigoriev, Alexey; Kazennov, Alexey

2013-01-01

INPRO cooperates with Member States to ensure that sustainable nuclear energy is available to help meet the energy needs of the 21st century. To bring together – i.e. to network - technology holders and users so that they can jointly consider international and national actions required for achieving desired innovations in nuclear reactors and fuel cycles. INPRO is part of the integrated services of the IAEA provided to Member States considering initial development or expansion of nuclear energy programmes. INPRO is an effective mechanisms for networking, and for growing new generations of researchers and managers ultimately required for the development and deployment of innovative sustainable nuclear energy systems

Vulnerability of complex networks

Science.gov (United States)

Mishkovski, Igor; Biey, Mario; Kocarev, Ljupco

2011-01-01

We consider normalized average edge betweenness of a network as a metric of network vulnerability. We suggest that normalized average edge betweenness together with is relative difference when certain number of nodes and/or edges are removed from the network is a measure of network vulnerability, called vulnerability index. Vulnerability index is calculated for four synthetic networks: Erdős-Rényi (ER) random networks, Barabási-Albert (BA) model of scale-free networks, Watts-Strogatz (WS) model of small-world networks, and geometric random networks. Real-world networks for which vulnerability index is calculated include: two human brain networks, three urban networks, one collaboration network, and two power grid networks. We find that WS model of small-world networks and biological networks (human brain networks) are the most robust networks among all networks studied in the paper.

Friendly network robotics; Friendly network robotics

Energy Technology Data Exchange (ETDEWEB)

NONE

1997-03-01

This paper summarizes the research results on the friendly network robotics in fiscal 1996. This research assumes an android robot as an ultimate robot and the future robot system utilizing computer network technology. The robot aiming at human daily work activities in factories or under extreme environments is required to work under usual human work environments. The human robot with similar size, shape and functions to human being is desirable. Such robot having a head with two eyes, two ears and mouth can hold a conversation with human being, can walk with two legs by autonomous adaptive control, and has a behavior intelligence. Remote operation of such robot is also possible through high-speed computer network. As a key technology to use this robot under coexistence with human being, establishment of human coexistent robotics was studied. As network based robotics, use of robots connected with computer networks was also studied. In addition, the R-cube (R{sup 3}) plan (realtime remote control robot technology) was proposed. 82 refs., 86 figs., 12 tabs.

Networked Identities

DEFF Research Database (Denmark)

Ryberg, Thomas; Larsen, Malene Charlotte

2008-01-01

of CoPs we shall argue that the metaphor or theory of networked learning is itself confronted with some central tensions and challenges that need to be addressed. We then explore these theoretical and analytic challenges to the network metaphor, through an analysis of a Danish social networking site. We......In this article we take up a critique of the concept of Communities of Practice (CoP) voiced by several authors, who suggest that networks may provide a better metaphor to understand social forms of organisation and learning. Through a discussion of the notion of networked learning and the critique...... argue that understanding meaning-making and ‘networked identities’ may be relevant analytic entry points in navigating the challenges....

Analysis of network-wide transit passenger flows based on principal component analysis

NARCIS (Netherlands)

Luo, D.; Cats, O.; van Lint, J.W.C.

2017-01-01

Transit networks are complex systems in which the passenger flow dynamics are difficult to capture and understand. While there is a growing ability to monitor and record travelers' behavior in the past decade, knowledge on network-wide passenger flows, which are essentially high-dimensional

The small world of osteocytes: connectomics of the lacuno-canalicular network in bone

Science.gov (United States)

Kollmannsberger, Philip; Kerschnitzki, Michael; Repp, Felix; Wagermaier, Wolfgang; Weinkamer, Richard; Fratzl, Peter

2017-07-01

Osteocytes and their cell processes reside in a large, interconnected network of voids pervading the mineralized bone matrix of most vertebrates. This osteocyte lacuno-canalicular network (OLCN) is believed to play important roles in mechanosensing, mineral homeostasis, and for the mechanical properties of bone. While the extracellular matrix structure of bone is extensively studied on ultrastructural and macroscopic scales, there is a lack of quantitative knowledge on how the cellular network is organized. Using a recently introduced imaging and quantification approach, we analyze the OLCN in different bone types from mouse and sheep that exhibit different degrees of structural organization not only of the cell network but also of the fibrous matrix deposited by the cells. We define a number of robust, quantitative measures that are derived from the theory of complex networks. These measures enable us to gain insights into how efficient the network is organized with regard to intercellular transport and communication. Our analysis shows that the cell network in regularly organized, slow-growing bone tissue from sheep is less connected, but more efficiently organized compared to irregular and fast-growing bone tissue from mice. On the level of statistical topological properties (edges per node, edge length and degree distribution), both network types are indistinguishable, highlighting that despite pronounced differences at the tissue level, the topological architecture of the osteocyte canalicular network at the subcellular level may be independent of species and bone type. Our results suggest a universal mechanism underlying the self-organization of individual cells into a large, interconnected network during bone formation and mineralization.

The small world of osteocytes: connectomics of the lacuno-canalicular network in bone

International Nuclear Information System (INIS)

Kollmannsberger, Philip; Kerschnitzki, Michael; Repp, Felix; Wagermaier, Wolfgang; Weinkamer, Richard; Fratzl, Peter

2017-01-01

Osteocytes and their cell processes reside in a large, interconnected network of voids pervading the mineralized bone matrix of most vertebrates. This osteocyte lacuno-canalicular network (OLCN) is believed to play important roles in mechanosensing, mineral homeostasis, and for the mechanical properties of bone. While the extracellular matrix structure of bone is extensively studied on ultrastructural and macroscopic scales, there is a lack of quantitative knowledge on how the cellular network is organized. Using a recently introduced imaging and quantification approach, we analyze the OLCN in different bone types from mouse and sheep that exhibit different degrees of structural organization not only of the cell network but also of the fibrous matrix deposited by the cells. We define a number of robust, quantitative measures that are derived from the theory of complex networks. These measures enable us to gain insights into how efficient the network is organized with regard to intercellular transport and communication. Our analysis shows that the cell network in regularly organized, slow-growing bone tissue from sheep is less connected, but more efficiently organized compared to irregular and fast-growing bone tissue from mice. On the level of statistical topological properties (edges per node, edge length and degree distribution), both network types are indistinguishable, highlighting that despite pronounced differences at the tissue level, the topological architecture of the osteocyte canalicular network at the subcellular level may be independent of species and bone type. Our results suggest a universal mechanism underlying the self-organization of individual cells into a large, interconnected network during bone formation and mineralization. (paper)

Location based Network Optimizations for Mobile Wireless Networks

DEFF Research Database (Denmark)

Nielsen, Jimmy Jessen

selection in Wi-Fi networks and predictive handover optimization in heterogeneous wireless networks. The investigations in this work have indicated that location based network optimizations are beneficial compared to typical link measurement based approaches. Especially the knowledge of geographical...

Network Performance Improvement under Epidemic Failures in Optical Transport Networks

DEFF Research Database (Denmark)

Fagertun, Anna Manolova; Ruepp, Sarah Renée

2013-01-01

In this paper we investigate epidemic failure spreading in large- scale GMPLS-controlled transport networks. By evaluating the effect of the epidemic failure spreading on the network, we design several strategies for cost-effective network performance improvement via differentiated repair times....... First we identify the most vulnerable and the most strategic nodes in the network. Then, via extensive simulations we show that strategic placement of resources for improved failure recovery has better performance than randomly assigning lower repair times among the network nodes. Our OPNET simulation...... model can be used during the network planning process for facilitating cost- effective network survivability design....

Divisibility patterns of natural numbers on a complex network.

Science.gov (United States)

Shekatkar, Snehal M; Bhagwat, Chandrasheel; Ambika, G

2015-09-16

Investigation of divisibility properties of natural numbers is one of the most important themes in the theory of numbers. Various tools have been developed over the centuries to discover and study the various patterns in the sequence of natural numbers in the context of divisibility. In the present paper, we study the divisibility of natural numbers using the framework of a growing complex network. In particular, using tools from the field of statistical inference, we show that the network is scale-free but has a non-stationary degree distribution. Along with this, we report a new kind of similarity pattern for the local clustering, which we call "stretching similarity", in this network. We also show that the various characteristics like average degree, global clustering coefficient and assortativity coefficient of the network vary smoothly with the size of the network. Using analytical arguments we estimate the asymptotic behavior of global clustering and average degree which is validated using numerical analysis.

Contribution to design a communication framework for vehicular ad hoc networks in urban scenarios

OpenAIRE

Tripp Barba, Carolina

2013-01-01

The constant mobility of people, the growing need to be always connected, the large number of vehicles that nowadays can be found in the roads and the advances in technology make Vehicular Ad hoc Networks (VANETs) be a major area of research. Vehicular Ad hoc Networks are a special type of wireless Mobile Ad hoc Networks (MANETs), which allow a group of mobile nodes configure a temporary network and maintain it without the need of a fixed infrastructure. A vehicular network presents some spec...

Network Traffic Prediction Based on Deep Belief Network and Spatiotemporal Compressive Sensing in Wireless Mesh Backbone Networks

Directory of Open Access Journals (Sweden)

Laisen Nie

2018-01-01

Full Text Available Wireless mesh network is prevalent for providing a decentralized access for users and other intelligent devices. Meanwhile, it can be employed as the infrastructure of the last few miles connectivity for various network applications, for example, Internet of Things (IoT and mobile networks. For a wireless mesh backbone network, it has obtained extensive attention because of its large capacity and low cost. Network traffic prediction is important for network planning and routing configurations that are implemented to improve the quality of service for users. This paper proposes a network traffic prediction method based on a deep learning architecture and the Spatiotemporal Compressive Sensing method. The proposed method first adopts discrete wavelet transform to extract the low-pass component of network traffic that describes the long-range dependence of itself. Then, a prediction model is built by learning a deep architecture based on the deep belief network from the extracted low-pass component. Otherwise, for the remaining high-pass component that expresses the gusty and irregular fluctuations of network traffic, the Spatiotemporal Compressive Sensing method is adopted to predict it. Based on the predictors of two components, we can obtain a predictor of network traffic. From the simulation, the proposed prediction method outperforms three existing methods.

Experimental performance evaluation of software defined networking (SDN) based data communication networks for large scale flexi-grid optical networks.

Science.gov (United States)

Zhao, Yongli; He, Ruiying; Chen, Haoran; Zhang, Jie; Ji, Yuefeng; Zheng, Haomian; Lin, Yi; Wang, Xinbo

2014-04-21

Software defined networking (SDN) has become the focus in the current information and communication technology area because of its flexibility and programmability. It has been introduced into various network scenarios, such as datacenter networks, carrier networks, and wireless networks. Optical transport network is also regarded as an important application scenario for SDN, which is adopted as the enabling technology of data communication networks (DCN) instead of general multi-protocol label switching (GMPLS). However, the practical performance of SDN based DCN for large scale optical networks, which is very important for the technology selection in the future optical network deployment, has not been evaluated up to now. In this paper we have built a large scale flexi-grid optical network testbed with 1000 virtual optical transport nodes to evaluate the performance of SDN based DCN, including network scalability, DCN bandwidth limitation, and restoration time. A series of network performance parameters including blocking probability, bandwidth utilization, average lightpath provisioning time, and failure restoration time have been demonstrated under various network environments, such as with different traffic loads and different DCN bandwidths. The demonstration in this work can be taken as a proof for the future network deployment.

Networks around entrepreneurs

DEFF Research Database (Denmark)

Bertelsen, Rasmus Gjedssø; Ashourizadeh, Shayegheh; Jensen, Kent Wickstrøm

2017-01-01

Purpose: Entrepreneurs are networking with others to get advice for their businesses. The networking differs between men and women; notably, men are more often networking in the public sphere and women are more often networking in the private sphere. The aim here is to account for how such gender......Purpose: Entrepreneurs are networking with others to get advice for their businesses. The networking differs between men and women; notably, men are more often networking in the public sphere and women are more often networking in the private sphere. The aim here is to account for how...... such gendering of entrepreneurs’ networks differ between societies and cultures. Research Design: Based on survey data from the Global Entrepreneurships Monitor, a sample of 16,365 entrepreneurs is used to compare the gendering of entrepreneurs’ networks in China, and five countries largely located around...... the Persian Gulf, namely Yemen, Iran, Saudi Arabia, Qatar and United Arab Emirates. Findings: Analyses show that female entrepreneurs tend to have slightly larger private sphere networks than male entrepreneurs. The differences between male and female entrepreneurs’ networking in the public sphere...

Networks: structure and action : steering in and steering by policy networks

NARCIS (Netherlands)

Dassen, A.

2010-01-01

This thesis explores the opportunities to build a structural policy network model that is rooted in social network theories. By making a distinction between a process of steering in networks, and a process of steering by networks, it addresses the effects of network structures on network dynamics as

The Evolving Wide Area Network Infrastructure in the LHC era

CERN Multimedia

CERN. Geneva

2004-01-01

The global network is more than ever taking its role as the great "enabler" for many branches of science and research. Foremost amongst such science drivers is of course the LHC/LCG programme, although there are several other sectors with growing demands of the network. Common to all of these is the realisation that a straightforward over provisioned best efforts wide area IP service is probably not enough for the future. This talk will summarise the needs of several science sectors, and the advances being made to exploit the current best efforts infrastructure. It will then describe current projects aimed as provisioning "better than best efforts" services (such bandwidth on demand), the global optical R&D testbeds and the strategy of the research network providers to move towards hybrid multi-service networks for the next generation of the global wide area production network.

Social Network Mixing Patterns In Mergers & Acquisitions - A Simulation Experiment

Directory of Open Access Journals (Sweden)

Robert Fabac

2011-01-01

Full Text Available In the contemporary world of global business and continuously growing competition, organizations tend to use mergers and acquisitions to enforce their position on the market. The future organization’s design is a critical success factor in such undertakings. The field of social network analysis can enhance our uderstanding of these processes as it lets us reason about the development of networks, regardless of their origin. The analysis of mixing patterns is particularly useful as it provides an insight into how nodes in a network connect with each other. We hypothesize that organizational networks with compatible mixing patterns will be integrated more successfully. After conducting a simulation experiment, we suggest an integration model based on the analysis of network assortativity. The model can be a guideline for organizational integration, such as occurs in mergers and acquisitions.

Modelling dendritic ecological networks in space: An integrated network perspective

Science.gov (United States)

Erin E. Peterson; Jay M. Ver Hoef; Dan J. Isaak; Jeffrey A. Falke; Marie-Josee Fortin; Chris E. Jordan; Kristina McNyset; Pascal Monestiez; Aaron S. Ruesch; Aritra Sengupta; Nicholas Som; E. Ashley Steel; David M. Theobald; Christian E. Torgersen; Seth J. Wenger

2013-01-01

Dendritic ecological networks (DENs) are a unique form of ecological networks that exhibit a dendritic network topology (e.g. stream and cave networks or plant architecture). DENs have a dual spatial representation; as points within the network and as points in geographical space. Consequently, some analytical methods used to quantify relationships in other types of...

Framework for network modularization and Bayesian network analysis to investigate the perturbed metabolic network

Directory of Open Access Journals (Sweden)

Kim Hyun

2011-12-01

Full Text Available Abstract Background Genome-scale metabolic network models have contributed to elucidating biological phenomena, and predicting gene targets to engineer for biotechnological applications. With their increasing importance, their precise network characterization has also been crucial for better understanding of the cellular physiology. Results We herein introduce a framework for network modularization and Bayesian network analysis (FMB to investigate organism’s metabolism under perturbation. FMB reveals direction of influences among metabolic modules, in which reactions with similar or positively correlated flux variation patterns are clustered, in response to specific perturbation using metabolic flux data. With metabolic flux data calculated by constraints-based flux analysis under both control and perturbation conditions, FMB, in essence, reveals the effects of specific perturbations on the biological system through network modularization and Bayesian network analysis at metabolic modular level. As a demonstration, this framework was applied to the genetically perturbed Escherichia coli metabolism, which is a lpdA gene knockout mutant, using its genome-scale metabolic network model. Conclusions After all, it provides alternative scenarios of metabolic flux distributions in response to the perturbation, which are complementary to the data obtained from conventionally available genome-wide high-throughput techniques or metabolic flux analysis.

Framework for network modularization and Bayesian network analysis to investigate the perturbed metabolic network.

Science.gov (United States)

Kim, Hyun Uk; Kim, Tae Yong; Lee, Sang Yup

2011-01-01

Genome-scale metabolic network models have contributed to elucidating biological phenomena, and predicting gene targets to engineer for biotechnological applications. With their increasing importance, their precise network characterization has also been crucial for better understanding of the cellular physiology. We herein introduce a framework for network modularization and Bayesian network analysis (FMB) to investigate organism's metabolism under perturbation. FMB reveals direction of influences among metabolic modules, in which reactions with similar or positively correlated flux variation patterns are clustered, in response to specific perturbation using metabolic flux data. With metabolic flux data calculated by constraints-based flux analysis under both control and perturbation conditions, FMB, in essence, reveals the effects of specific perturbations on the biological system through network modularization and Bayesian network analysis at metabolic modular level. As a demonstration, this framework was applied to the genetically perturbed Escherichia coli metabolism, which is a lpdA gene knockout mutant, using its genome-scale metabolic network model. After all, it provides alternative scenarios of metabolic flux distributions in response to the perturbation, which are complementary to the data obtained from conventionally available genome-wide high-throughput techniques or metabolic flux analysis.

Understanding Knowledge Network, Learning and Connectivism

Science.gov (United States)

AlDahdouh, Alaa A.; Osório, António J.; Caires, Susana

2015-01-01

Behaviorism, Cognitivism, Constructivism and other growing theories such as Actor-Network and Connectivism are circulating in the educational field. For each, there are allies who stand behind research evidence and consistency of observation. Meantime, those existing theories dominate the field until the background is changed or new concrete…

Virtualized Network Function Orchestration System and Experimental Network Based QR Recognition for a 5G Mobile Access Network

Directory of Open Access Journals (Sweden)

Misun Ahn

2017-12-01

Full Text Available This paper proposes a virtualized network function orchestration system based on Network Function Virtualization (NFV, one of the main technologies in 5G mobile networks. This system should provide connectivity between network devices and be able to create flexible network function and distribution. This system focuses more on access networks. By experimenting with various scenarios of user service established and activated in a network, we examine whether rapid adoption of new service is possible and whether network resources can be managed efficiently. The proposed method is based on Bluetooth transfer technology and mesh networking to provide automatic connections between network machines and on a Docker flat form, which is a container virtualization technology for setting and managing key functions. Additionally, the system includes a clustering and recovery measure regarding network function based on the Docker platform. We will briefly introduce the QR code perceived service as a user service to examine the proposal and based on this given service, we evaluate the function of the proposal and present analysis. Through the proposed approach, container relocation has been implemented according to a network device’s CPU usage and we confirm successful service through function evaluation on a real test bed. We estimate QR code recognition speed as the amount of network equipment is gradually increased, improving user service and confirm that the speed of recognition is increased as the assigned number of network devices is increased by the user service.

A Network of Networks Perspective on Global Trade.

Science.gov (United States)

Maluck, Julian; Donner, Reik V

2015-01-01

Mutually intertwined supply chains in contemporary economy result in a complex network of trade relationships with a highly non-trivial topology that varies with time. In order to understand the complex interrelationships among different countries and economic sectors, as well as their dynamics, a holistic view on the underlying structural properties of this network is necessary. This study employs multi-regional input-output data to decompose 186 national economies into 26 industry sectors and utilizes the approach of interdependent networks to analyze the substructure of the resulting international trade network for the years 1990-2011. The partition of the network into national economies is observed to be compatible with the notion of communities in the sense of complex network theory. By studying internal versus cross-subgraph contributions to established complex network metrics, new insights into the architecture of global trade are obtained, which allow to identify key elements of global economy. Specifically, financial services and business activities dominate domestic trade whereas electrical and machinery industries dominate foreign trade. In order to further specify each national sector's role individually, (cross-)clustering coefficients and cross-betweenness are obtained for different pairs of subgraphs. The corresponding analysis reveals that specific industrial sectors tend to favor distinct directionality patterns and that the cross-clustering coefficient for geographically close country pairs is remarkably high, indicating that spatial factors are still of paramount importance for the organization of trade patterns in modern economy. Regarding the evolution of the trade network's substructure, globalization is well-expressed by trends of several structural characteristics (e.g., link density and node strength) in the interacting network framework. Extreme events, such as the financial crisis 2008/2009, are manifested as anomalies superimposed to

COalitions in COOperation Networks (COCOON): Social Network Analysis and Game Theory to Enhance Cooperation Networks

NARCIS (Netherlands)

Sie, Rory

2012-01-01

Sie, R. L. L. (2012). COalitions in COOperation Networks (COCOON): Social Network Analysis and Game Theory to Enhance Cooperation Networks (Unpublished doctoral dissertation). September, 28, 2012, Open Universiteit in the Netherlands (CELSTEC), Heerlen, The Netherlands.

Managing Network Partitions in Structured P2P Networks

Science.gov (United States)

Shafaat, Tallat M.; Ghodsi, Ali; Haridi, Seif

Structured overlay networks form a major class of peer-to-peer systems, which are touted for their abilities to scale, tolerate failures, and self-manage. Any long-lived Internet-scale distributed system is destined to face network partitions. Consequently, the problem of network partitions and mergers is highly related to fault-tolerance and self-management in large-scale systems. This makes it a crucial requirement for building any structured peer-to-peer systems to be resilient to network partitions. Although the problem of network partitions and mergers is highly related to fault-tolerance and self-management in large-scale systems, it has hardly been studied in the context of structured peer-to-peer systems. Structured overlays have mainly been studied under churn (frequent joins/failures), which as a side effect solves the problem of network partitions, as it is similar to massive node failures. Yet, the crucial aspect of network mergers has been ignored. In fact, it has been claimed that ring-based structured overlay networks, which constitute the majority of the structured overlays, are intrinsically ill-suited for merging rings. In this chapter, we motivate the problem of network partitions and mergers in structured overlays. We discuss how a structured overlay can automatically detect a network partition and merger. We present an algorithm for merging multiple similar ring-based overlays when the underlying network merges. We examine the solution in dynamic conditions, showing how our solution is resilient to churn during the merger, something widely believed to be difficult or impossible. We evaluate the algorithm for various scenarios and show that even when falsely detecting a merger, the algorithm quickly terminates and does not clutter the network with many messages. The algorithm is flexible as the tradeoff between message complexity and time complexity can be adjusted by a parameter.

Enabling software defined networking experiments in networked critical infrastructures

Directory of Open Access Journals (Sweden)

Béla Genge

2014-05-01

Full Text Available Nowadays, the fact that Networked Critical Infrastructures (NCI, e.g., power plants, water plants, oil and gas distribution infrastructures, and electricity grids, are targeted by significant cyber threats is well known. Nevertheless, recent research has shown that specific characteristics of NCI can be exploited in the enabling of more efficient mitigation techniques, while novel techniques from the field of IP networks can bring significant advantages. In this paper we explore the interconnection of NCI communication infrastructures with Software Defined Networking (SDN-enabled network topologies. SDN provides the means to create virtual networking services and to implement global networking decisions. It relies on OpenFlow to enable communication with remote devices and has been recently categorized as the “Next Big Technology”, which will revolutionize the way decisions are implemented in switches and routers. Therefore, the paper documents the first steps towards enabling an SDN-NCI and presents the impact of a Denial of Service experiment over traffic resulting from an XBee sensor network which is routed across an emulated SDN network.

Spatiotemporal Recurrent Convolutional Networks for Traffic Prediction in Transportation Networks

Directory of Open Access Journals (Sweden)

Haiyang Yu

2017-06-01

Full Text Available Predicting large-scale transportation network traffic has become an important and challenging topic in recent decades. Inspired by the domain knowledge of motion prediction, in which the future motion of an object can be predicted based on previous scenes, we propose a network grid representation method that can retain the fine-scale structure of a transportation network. Network-wide traffic speeds are converted into a series of static images and input into a novel deep architecture, namely, spatiotemporal recurrent convolutional networks (SRCNs, for traffic forecasting. The proposed SRCNs inherit the advantages of deep convolutional neural networks (DCNNs and long short-term memory (LSTM neural networks. The spatial dependencies of network-wide traffic can be captured by DCNNs, and the temporal dynamics can be learned by LSTMs. An experiment on a Beijing transportation network with 278 links demonstrates that SRCNs outperform other deep learning-based algorithms in both short-term and long-term traffic prediction.

Spatiotemporal Recurrent Convolutional Networks for Traffic Prediction in Transportation Networks.

Science.gov (United States)

Yu, Haiyang; Wu, Zhihai; Wang, Shuqin; Wang, Yunpeng; Ma, Xiaolei

2017-06-26

Predicting large-scale transportation network traffic has become an important and challenging topic in recent decades. Inspired by the domain knowledge of motion prediction, in which the future motion of an object can be predicted based on previous scenes, we propose a network grid representation method that can retain the fine-scale structure of a transportation network. Network-wide traffic speeds are converted into a series of static images and input into a novel deep architecture, namely, spatiotemporal recurrent convolutional networks (SRCNs), for traffic forecasting. The proposed SRCNs inherit the advantages of deep convolutional neural networks (DCNNs) and long short-term memory (LSTM) neural networks. The spatial dependencies of network-wide traffic can be captured by DCNNs, and the temporal dynamics can be learned by LSTMs. An experiment on a Beijing transportation network with 278 links demonstrates that SRCNs outperform other deep learning-based algorithms in both short-term and long-term traffic prediction.

Evaluation of Network Reliability for Computer Networks with Multiple Sources

Directory of Open Access Journals (Sweden)

Yi-Kuei Lin

2012-01-01

Full Text Available Evaluating the reliability of a network with multiple sources to multiple sinks is a critical issue from the perspective of quality management. Due to the unrealistic definition of paths of network models in previous literature, existing models are not appropriate for real-world computer networks such as the Taiwan Advanced Research and Education Network (TWAREN. This paper proposes a modified stochastic-flow network model to evaluate the network reliability of a practical computer network with multiple sources where data is transmitted through several light paths (LPs. Network reliability is defined as being the probability of delivering a specified amount of data from the sources to the sink. It is taken as a performance index to measure the service level of TWAREN. This paper studies the network reliability of the international portion of TWAREN from two sources (Taipei and Hsinchu to one sink (New York that goes through a submarine and land surface cable between Taiwan and the United States.

Formation of community-based hypertension practice networks: success, obstacles, and lessons learned.

Science.gov (United States)

Dart, Richard A; Egan, Brent M

2014-06-01

Community-based practice networks for research and improving the quality of care are growing in size and number but have variable success rates. In this paper, the authors review recent efforts to initiate a community-based hypertension network modeled after the successful Outpatient Quality Improvement Network (O'QUIN) project, located at the Medical University of South Carolina. Key lessons learned and new directions to be explored are highlighted. ©2014 Wiley Periodicals, Inc.

Federated queries of clinical data repositories: Scaling to a national network.

Science.gov (United States)

Weber, Griffin M

2015-06-01

Federated networks of clinical research data repositories are rapidly growing in size from a handful of sites to true national networks with more than 100 hospitals. This study creates a conceptual framework for predicting how various properties of these systems will scale as they continue to expand. Starting with actual data from Harvard's four-site Shared Health Research Information Network (SHRINE), the framework is used to imagine a future 4000 site network, representing the majority of hospitals in the United States. From this it becomes clear that several common assumptions of small networks fail to scale to a national level, such as all sites being online at all times or containing data from the same date range. On the other hand, a large network enables researchers to select subsets of sites that are most appropriate for particular research questions. Developers of federated clinical data networks should be aware of how the properties of these networks change at different scales and design their software accordingly. Copyright © 2015 Elsevier Inc. All rights reserved.

Network science

CERN Document Server

Barabasi, Albert-Laszlo

2016-01-01

Networks are everywhere, from the Internet, to social networks, and the genetic networks that determine our biological existence. Illustrated throughout in full colour, this pioneering textbook, spanning a wide range of topics from physics to computer science, engineering, economics and the social sciences, introduces network science to an interdisciplinary audience. From the origins of the six degrees of separation to explaining why networks are robust to random failures, the author explores how viruses like Ebola and H1N1 spread, and why it is that our friends have more friends than we do. Using numerous real-world examples, this innovatively designed text includes clear delineation between undergraduate and graduate level material. The mathematical formulas and derivations are included within Advanced Topics sections, enabling use at a range of levels. Extensive online resources, including films and software for network analysis, make this a multifaceted companion for anyone with an interest in network sci...

Improving the security of the Hwang-Su protocol for mobile networks ...

African Journals Online (AJOL)

The mobile networks are experiencing a growing success. This success is mainly due to the fact that these networks providing the mobility of users, the transmission of data through open air and the requirement of low power. But, it is threatened by weak security, especially at the level of authentication. Hwang and Su have ...

Impact of noise on molecular network inference.

Directory of Open Access Journals (Sweden)

Radhakrishnan Nagarajan

Full Text Available Molecular entities work in concert as a system and mediate phenotypic outcomes and disease states. There has been recent interest in modelling the associations between molecular entities from their observed expression profiles as networks using a battery of algorithms. These networks have proven to be useful abstractions of the underlying pathways and signalling mechanisms. Noise is ubiquitous in molecular data and can have a pronounced effect on the inferred network. Noise can be an outcome of several factors including: inherent stochastic mechanisms at the molecular level, variation in the abundance of molecules, heterogeneity, sensitivity of the biological assay or measurement artefacts prevalent especially in high-throughput settings. The present study investigates the impact of discrepancies in noise variance on pair-wise dependencies, conditional dependencies and constraint-based Bayesian network structure learning algorithms that incorporate conditional independence tests as a part of the learning process. Popular network motifs and fundamental connections, namely: (a common-effect, (b three-chain, and (c coherent type-I feed-forward loop (FFL are investigated. The choice of these elementary networks can be attributed to their prevalence across more complex networks. Analytical expressions elucidating the impact of discrepancies in noise variance on pairwise dependencies and conditional dependencies for special cases of these motifs are presented. Subsequently, the impact of noise on two popular constraint-based Bayesian network structure learning algorithms such as Grow-Shrink (GS and Incremental Association Markov Blanket (IAMB that implicitly incorporate tests for conditional independence is investigated. Finally, the impact of noise on networks inferred from publicly available single cell molecular expression profiles is investigated. While discrepancies in noise variance are overlooked in routine molecular network inference, the

Optical interconnection networks for high-performance computing systems

International Nuclear Information System (INIS)

Biberman, Aleksandr; Bergman, Keren

2012-01-01

Enabled by silicon photonic technology, optical interconnection networks have the potential to be a key disruptive technology in computing and communication industries. The enduring pursuit of performance gains in computing, combined with stringent power constraints, has fostered the ever-growing computational parallelism associated with chip multiprocessors, memory systems, high-performance computing systems and data centers. Sustaining these parallelism growths introduces unique challenges for on- and off-chip communications, shifting the focus toward novel and fundamentally different communication approaches. Chip-scale photonic interconnection networks, enabled by high-performance silicon photonic devices, offer unprecedented bandwidth scalability with reduced power consumption. We demonstrate that the silicon photonic platforms have already produced all the high-performance photonic devices required to realize these types of networks. Through extensive empirical characterization in much of our work, we demonstrate such feasibility of waveguides, modulators, switches and photodetectors. We also demonstrate systems that simultaneously combine many functionalities to achieve more complex building blocks. We propose novel silicon photonic devices, subsystems, network topologies and architectures to enable unprecedented performance of these photonic interconnection networks. Furthermore, the advantages of photonic interconnection networks extend far beyond the chip, offering advanced communication environments for memory systems, high-performance computing systems, and data centers. (review article)

Network traffic anomaly prediction using Artificial Neural Network

Science.gov (United States)

Ciptaningtyas, Hening Titi; Fatichah, Chastine; Sabila, Altea

2017-03-01

As the excessive increase of internet usage, the malicious software (malware) has also increase significantly. Malware is software developed by hacker for illegal purpose(s), such as stealing data and identity, causing computer damage, or denying service to other user[1]. Malware which attack computer or server often triggers network traffic anomaly phenomena. Based on Sophos's report[2], Indonesia is the riskiest country of malware attack and it also has high network traffic anomaly. This research uses Artificial Neural Network (ANN) to predict network traffic anomaly based on malware attack in Indonesia which is recorded by Id-SIRTII/CC (Indonesia Security Incident Response Team on Internet Infrastructure/Coordination Center). The case study is the highest malware attack (SQL injection) which has happened in three consecutive years: 2012, 2013, and 2014[4]. The data series is preprocessed first, then the network traffic anomaly is predicted using Artificial Neural Network and using two weight update algorithms: Gradient Descent and Momentum. Error of prediction is calculated using Mean Squared Error (MSE) [7]. The experimental result shows that MSE for SQL Injection is 0.03856. So, this approach can be used to predict network traffic anomaly.

Phoebus: Network Middleware for Next-Generation Network Computing

Energy Technology Data Exchange (ETDEWEB)

Martin Swany

2012-06-16

The Phoebus project investigated algorithms, protocols, and middleware infrastructure to improve end-to-end performance in high speed, dynamic networks. The Phoebus system essentially serves as an adaptation point for networks with disparate capabilities or provisioning. This adaptation can take a variety of forms including acting as a provisioning agent across multiple signaling domains, providing transport protocol adaptation points, and mapping between distributed resource reservation paradigms and the optical network control plane. We have successfully developed the system and demonstrated benefits. The Phoebus system was deployed in Internet2 and in ESnet, as well as in GEANT2, RNP in Brazil and over international links to Korea and Japan. Phoebus is a system that implements a new protocol and associated forwarding infrastructure for improving throughput in high-speed dynamic networks. It was developed to serve the needs of large DOE applications on high-performance networks. The idea underlying the Phoebus model is to embed Phoebus Gateways (PGs) in the network as on-ramps to dynamic circuit networks. The gateways act as protocol translators that allow legacy applications to use dedicated paths with high performance.

Online networks, social interaction and segregation: An evolutionary approach

OpenAIRE

Antoci, Angelo; Sabatini, Fabio

2018-01-01

There is growing evidence that face-to-face interaction is declining in many countries, exacerbating the phenomenon of social isolation. On the other hand, social interaction through online networking sites is steeply rising. To analyze these societal dynamics, we have built an evolutionary game model in which agents can choose between three strategies of social participation: 1) interaction via both online social networks and face-to-face encounters; 2) interaction by exclusive means of face...

Identification of important nodes in directed biological networks: a network motif approach.

Directory of Open Access Journals (Sweden)

Pei Wang

Full Text Available Identification of important nodes in complex networks has attracted an increasing attention over the last decade. Various measures have been proposed to characterize the importance of nodes in complex networks, such as the degree, betweenness and PageRank. Different measures consider different aspects of complex networks. Although there are numerous results reported on undirected complex networks, few results have been reported on directed biological networks. Based on network motifs and principal component analysis (PCA, this paper aims at introducing a new measure to characterize node importance in directed biological networks. Investigations on five real-world biological networks indicate that the proposed method can robustly identify actually important nodes in different networks, such as finding command interneurons, global regulators and non-hub but evolutionary conserved actually important nodes in biological networks. Receiver Operating Characteristic (ROC curves for the five networks indicate remarkable prediction accuracy of the proposed measure. The proposed index provides an alternative complex network metric. Potential implications of the related investigations include identifying network control and regulation targets, biological networks modeling and analysis, as well as networked medicine.

Traffic Rules in Electronic Financial Transactions (EFT Networks

Directory of Open Access Journals (Sweden)

Vedran Batoš

2002-01-01

Full Text Available This paper presents the traffic rules in the EFT (ElectronicFinancial Transactions networks, based on the implementationof the solution called Gold-Net developed and implementedby Euronet Worldwide Inc. Following the traffic rulesin EFT networks, out of its worldwide experience, Gold-Netevolved a comprehensive and expandable EFT network solutiondesigned to meet an institution's needs today and in the future.It is an ITM (Integrated Transaction Management solution,modular and expandable, and consists of a comprehensiveEFT software modules with ATM and POS driving capabilities.The combination of ATM management and the onlineconnection form the intercept processing control module. Asthe marketplace grows, this solution ensures that an ente1prisemay position itself for future growth and expanded service offerings.

Functional Module Analysis for Gene Coexpression Networks with Network Integration.

Science.gov (United States)

Zhang, Shuqin; Zhao, Hongyu; Ng, Michael K

2015-01-01

Network has been a general tool for studying the complex interactions between different genes, proteins, and other small molecules. Module as a fundamental property of many biological networks has been widely studied and many computational methods have been proposed to identify the modules in an individual network. However, in many cases, a single network is insufficient for module analysis due to the noise in the data or the tuning of parameters when building the biological network. The availability of a large amount of biological networks makes network integration study possible. By integrating such networks, more informative modules for some specific disease can be derived from the networks constructed from different tissues, and consistent factors for different diseases can be inferred. In this paper, we have developed an effective method for module identification from multiple networks under different conditions. The problem is formulated as an optimization model, which combines the module identification in each individual network and alignment of the modules from different networks together. An approximation algorithm based on eigenvector computation is proposed. Our method outperforms the existing methods, especially when the underlying modules in multiple networks are different in simulation studies. We also applied our method to two groups of gene coexpression networks for humans, which include one for three different cancers, and one for three tissues from the morbidly obese patients. We identified 13 modules with three complete subgraphs, and 11 modules with two complete subgraphs, respectively. The modules were validated through Gene Ontology enrichment and KEGG pathway enrichment analysis. We also showed that the main functions of most modules for the corresponding disease have been addressed by other researchers, which may provide the theoretical basis for further studying the modules experimentally.

Temporal Information Partitioning Networks (TIPNets): Characterizing emergent behavior in complex ecohydrologic systems

Science.gov (United States)

Goodwell, Allison; Kumar, Praveen

2017-04-01

Within an ecosystem, components of the atmosphere, vegetation, and the root-soil system participate in forcing and feedback reactions at varying time scales and intensities. These interactions constitute a complex network that exhibits behavioral shifts due to perturbations ranging from weather events to long-term drought or land use change. However, it is challenging to characterize this shifting network due to multiple drivers, non-linear interactions, and synchronization due to feedback. To overcome these issues, we implement a process network approach where eco-hydrologic time-series variables are nodes and information measures are links. We introduce a Temporal Information Partition Network (TIPNet) framework in which multivariate lagged mutual information between source and target nodes is decomposed into synergistic, redundant, and unique components, each of which reveals different aspects of interactions within the network. We use methods to compute information measures given as few as 200 data points to construct TIPNets based on 1-minute weather station data (radiation Rg, air temperature Ta, wind speed WS, relative humidity RH, precipitation PPT, and leaf wetness LWet) from Central Illinois during the growing season of 2015. We assess temporal shifts in network behavior for various weather conditions and over the growing season. We find that wet time periods are associated with complex and synergistic network structures compared to dry conditions, and that seasonal network patterns reveal responses to vegetation growth and rainfall trends. This framework is applicable to study a broad range of complex systems composed of multiple interacting components, and may aid process understanding, model improvement, and resilience and vulnerability assessments.

Drivers and barriers to the development of local food networks in rural Denmark

DEFF Research Database (Denmark)

Eriksen, Safania Normann; Sundbo, Jon

2016-01-01

This article examines the growing interest in local food by focusing on local food networks. The objective is to explore what factors drive or hinder the development of local food networks in rural Denmark. For this purpose, we have combined three bodies of theory: local food networks; entrepreneur...... networks; and the experience economy. This provides a valuable contribution to the current discourse on local food networks, as it introduces a novel framework to investigate the localisation of food dynamics. The article presents an explorative, case-based investigation of three Danish local food networks....... The findings demonstrate that the main drivers of the development of local food networks are the pursuance of transparency and knowledge of origin, the existence of entrepreneurship potential, the coordination of networks by means of joint strategies, and the overcoming of conflict patterns. However...

Network Analysis Tools: from biological networks to clusters and pathways.

Science.gov (United States)

Brohée, Sylvain; Faust, Karoline; Lima-Mendez, Gipsi; Vanderstocken, Gilles; van Helden, Jacques

2008-01-01

Network Analysis Tools (NeAT) is a suite of computer tools that integrate various algorithms for the analysis of biological networks: comparison between graphs, between clusters, or between graphs and clusters; network randomization; analysis of degree distribution; network-based clustering and path finding. The tools are interconnected to enable a stepwise analysis of the network through a complete analytical workflow. In this protocol, we present a typical case of utilization, where the tasks above are combined to decipher a protein-protein interaction network retrieved from the STRING database. The results returned by NeAT are typically subnetworks, networks enriched with additional information (i.e., clusters or paths) or tables displaying statistics. Typical networks comprising several thousands of nodes and arcs can be analyzed within a few minutes. The complete protocol can be read and executed in approximately 1 h.

Growing a professional network to over 3000 members in less than 4 years: evaluation of InspireNet, British Columbia's virtual nursing health services research network.

Science.gov (United States)

Frisch, Noreen; Atherton, Pat; Borycki, Elizabeth; Mickelson, Grace; Cordeiro, Jennifer; Novak Lauscher, Helen; Black, Agnes

2014-02-21

Use of Web 2.0 and social media technologies has become a new area of research among health professionals. Much of this work has focused on the use of technologies for health self-management and the ways technologies support communication between care providers and consumers. This paper addresses a new use of technology in providing a platform for health professionals to support professional development, increase knowledge utilization, and promote formal/informal professional communication. Specifically, we report on factors necessary to attract and sustain health professionals' use of a network designed to increase nurses' interest in and use of health services research and to support knowledge utilization activities in British Columbia, Canada. "InspireNet", a virtual professional network for health professionals, is a living laboratory permitting documentation of when and how professionals take up Web 2.0 and social media. Ongoing evaluation documents our experiences in establishing, operating, and evaluating this network. Overall evaluation methods included (1) tracking website use, (2) conducting two member surveys, and (3) soliciting member feedback through focus groups and interviews with those who participated in electronic communities of practice (eCoPs) and other stakeholders. These data have been used to learn about the types of support that seem relevant to network growth. Network growth exceeded all expectations. Members engaged with varying aspects of the network's virtual technologies, such as teams of professionals sharing a common interest, research teams conducting their work, and instructional webinars open to network members. Members used wikis, blogs, and discussion groups to support professional work, as well as a members' database with contact information and areas of interest. The database is accessed approximately 10 times per day. InspireNet public blog posts are accessed roughly 500 times each. At the time of writing, 21 research teams

Energy-aware virtual network embedding in flexi-grid optical networks

Science.gov (United States)

Lin, Rongping; Luo, Shan; Wang, Haoran; Wang, Sheng; Chen, Bin

2018-01-01

Virtual network embedding (VNE) problem is to map multiple heterogeneous virtual networks (VN) on a shared substrate network, which mitigate the ossification of the substrate network. Meanwhile, energy efficiency has been widely considered in the network design. In this paper, we aim to solve the energy-aware VNE problem in flexi-grid optical networks. We provide an integer linear programming (ILP) formulation to minimize the power increment of each arriving VN request. We also propose a polynomial-time heuristic algorithm where virtual links are embedded sequentially to keep a reasonable acceptance ratio and maintain a low energy consumption. Numerical results show the functionality of the heuristic algorithm in a 24-node network.

Technical Network

CERN Multimedia

2007-01-01

In order to optimise the management of the Technical Network (TN), to facilitate understanding of the purpose of devices connected to the TN and to improve security incident handling, the Technical Network Administrators and the CNIC WG have asked IT/CS to verify the "description" and "tag" fields of devices connected to the TN. Therefore, persons responsible for systems connected to the TN will receive e-mails from IT/CS asking them to add the corresponding information in the network database at "network-cern-ch". Thank you very much for your cooperation. The Technical Network Administrators & the CNIC WG

An examination of a reciprocal relationship between network governance and network structure

DEFF Research Database (Denmark)

Bergenholtz, Carsten; Goduscheit, René Chester

The present article examines the network structure and governance of inter-organisational innovation networks. Network governance refers to the issue of how to manage and coordinate the relational activities and processes in the network while research on network structure deals with the overall...... structural relations between the actors in the network. These streams of research do contain references to each other but mostly rely on a static conception of the relationship between network structure and the applied network governance. The paper is based on a primarily qualitative case study of a loosely...... coupled Danish inter-organisational innovation network. The proposition is that a reciprocal relation between network governance and network structure can be identified....

An examination of the relationship between athlete leadership and cohesion using social network analysis.

Science.gov (United States)

Loughead, Todd M; Fransen, Katrien; Van Puyenbroeck, Stef; Hoffmann, Matt D; De Cuyper, Bert; Vanbeselaere, Norbert; Boen, Filip

2016-11-01

Two studies investigated the structure of different athlete leadership networks and its relationship to cohesion using social network analysis. In Study 1, we examined the relationship between a general leadership quality network and task and social cohesion as measured by the Group Environment Questionnaire (GEQ). In Study 2, we investigated the leadership networks for four different athlete leadership roles (task, motivational, social and external) and their association with task and social cohesion networks. In Study 1, the results demonstrated that the general leadership quality network was positively related to task and social cohesion. The results from Study 2 indicated positive correlations between the four leadership networks and task and social cohesion networks. Further, the motivational leadership network emerged as the strongest predictor of the task cohesion network, while the social leadership network was the strongest predictor of the social cohesion network. The results complement a growing body of research indicating that athlete leadership has a positive association with cohesion.

CORPORATE SOCIAL NETWORKS IN EDUCATION: EXPERIENCE OF USE

Directory of Open Access Journals (Sweden)

Lytvynova S.

2017-12-01

Full Text Available The paper discusses methods, forms and safety issues of social network usage for school students. Taking into consideration the growing interest of students to electronic communication in social networks (ESN, their place in the information educational environment is described. The classification of objects and use of ESNs was made to help teachers and school authority to teach students in the corporate social network. The basic components of corporate social networks (СESN were revealed: forms of learning activity (individual, group, and collective, forms of learning organization (quiz, debates, discussions, photo-story, essay contest, a virtual tour, mini design web quest, and conference video-lesson, and database. Particular aspects of the use of certain forms for students training in ESN aсcording to the type of social objects (messages, individual messages, video files, photos, audio files, documents, comments, and blitz-survey were defined. Student safety when using ESN and СESN impact on a student social and cultural intelligence development are discussed as well.

Statistical Network Analysis for Functional MRI: Mean Networks and Group Comparisons.

Directory of Open Access Journals (Sweden)

Cedric E Ginestet

2014-05-01

Full Text Available Comparing networks in neuroscience is hard, because the topological properties of a given network are necessarily dependent on the number of edges of that network. This problem arises in the analysis of both weighted and unweighted networks. The term density is often used in this context, in order to refer to the mean edge weight of a weighted network, or to the number of edges in an unweighted one. Comparing families of networks is therefore statistically difficult because differences in topology are necessarily associated with differences in density. In this review paper, we consider this problem from two different perspectives, which include (i the construction of summary networks, such as how to compute and visualize the mean network from a sample of network-valued data points; and (ii how to test for topological differences, when two families of networks also exhibit significant differences in density. In the first instance, we show that the issue of summarizing a family of networks can be conducted by either adopting a mass-univariate approach, which produces a statistical parametric network (SPN, or by directly computing the mean network, provided that a metric has been specified on the space of all networks with a given number of nodes. In the second part of this review, we then highlight the inherent problems associated with the comparison of topological functions of families of networks that differ in density. In particular, we show that a wide range of topological summaries, such as global efficiency and network modularity are highly sensitive to differences in density. Moreover, these problems are not restricted to unweighted metrics, as we demonstrate that the same issues remain present when considering the weighted versions of these metrics. We conclude by encouraging caution, when reporting such statistical comparisons, and by emphasizing the importance of constructing summary networks.

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.

In-Network Adaptation of Video Streams Using Network Processors

Directory of Open Access Journals (Sweden)

Mohammad Shorfuzzaman

2009-01-01

problem can be addressed, near the network edge, by applying dynamic, in-network adaptation (e.g., transcoding of video streams to meet available connection bandwidth, machine characteristics, and client preferences. In this paper, we extrapolate from earlier work of Shorfuzzaman et al. 2006 in which we implemented and assessed an MPEG-1 transcoding system on the Intel IXP1200 network processor to consider the feasibility of in-network transcoding for other video formats and network processor architectures. The use of “on-the-fly” video adaptation near the edge of the network offers the promise of simpler support for a wide range of end devices with different display, and so forth, characteristics that can be used in different types of environments.

Analysis of Semantic Networks using Complex Networks Concepts

DEFF Research Database (Denmark)

Ortiz-Arroyo, Daniel

2013-01-01

In this paper we perform a preliminary analysis of semantic networks to determine the most important terms that could be used to optimize a summarization task. In our experiments, we measure how the properties of a semantic network change, when the terms in the network are removed. Our preliminar...

Network survivability performance

Science.gov (United States)

1993-11-01

This technical report has been developed to address the survivability of telecommunications networks including services. It responds to the need for a common understanding of, and assessment techniques for network survivability, availability, integrity, and reliability. It provides a basis for designing and operating telecommunications networks to user expectations for network survivability and a foundation for continuing industry activities in the subject area. This report focuses on the survivability of both public and private networks and covers a wide range of users. Two frameworks are established for quantifying and categorizing service outages, and for classifying network survivability techniques and measures. The performance of the network survivability techniques is considered; however, recommended objectives are not established for network survivability performance.

Networks and network analysis for defence and security

CERN Document Server

Masys, Anthony J

2014-01-01

Networks and Network Analysis for Defence and Security discusses relevant theoretical frameworks and applications of network analysis in support of the defence and security domains. This book details real world applications of network analysis to support defence and security. Shocks to regional, national and global systems stemming from natural hazards, acts of armed violence, terrorism and serious and organized crime have significant defence and security implications. Today, nations face an uncertain and complex security landscape in which threats impact/target the physical, social, economic

Network analysis literacy a practical approach to the analysis of networks

CERN Document Server

Zweig, Katharina A

2014-01-01

Network Analysis Literacy focuses on design principles for network analytics projects. The text enables readers to: pose a defined network analytic question; build a network to answer the question; choose or design the right network analytic methods for a particular purpose, and more.

Network-Embedded Management and Applications Understanding Programmable Networking Infrastructure

CERN Document Server

Wolter, Ralf

2013-01-01

Despite the explosion of networking services and applications in the past decades, the basic technological underpinnings of the Internet have remained largely unchanged. At its heart are special-purpose appliances that connect us to the digital world, commonly known as switches and routers. Now, however, the traditional framework is being increasingly challenged by new methods that are jostling for a position in the next-generation Internet. The concept of a network that is becoming more programmable is one of the aspects that are taking center stage. This opens new possibilities to embed software applications inside the network itself and to manage networks and communications services with unprecedented ease and efficiency. In this edited volume, distinguished experts take the reader on a tour of different facets of programmable network infrastructure and application exploit it. Presenting the state of the art in network embedded management and applications and programmable network infrastructure, the book c...

Nationwide Network of TalentPoints: The Hungarian Approach to Talent Support

Science.gov (United States)

Csermely, Peter; Rajnai, Gabor; Sulyok, Katalin

2013-01-01

In 2006 a novel approach to talent support was promoted by several talent support programmes in Hungary. The new idea was a network approach. The nationwide network of so-called TalentPoints and its framework, the Hungarian Genius Program, gained substantial European Union funding in 2009, and today it is growing rapidly. A novel concept of talent…

Stochastic dynamical model of a growing citation network based on a self-exciting point process.

Science.gov (United States)

Golosovsky, Michael; Solomon, Sorin

2012-08-31

We put under experimental scrutiny the preferential attachment model that is commonly accepted as a generating mechanism of the scale-free complex networks. To this end we chose a citation network of physics papers and traced the citation history of 40,195 papers published in one year. Contrary to common belief, we find that the citation dynamics of the individual papers follows the superlinear preferential attachment, with the exponent α=1.25-1.3. Moreover, we show that the citation process cannot be described as a memoryless Markov chain since there is a substantial correlation between the present and recent citation rates of a paper. Based on our findings we construct a stochastic growth model of the citation network, perform numerical simulations based on this model and achieve an excellent agreement with the measured citation distributions.

Virtualized cognitive network architecture for 5G cellular networks

KAUST Repository

Elsawy, Hesham

2015-07-17

Cellular networks have preserved an application agnostic and base station (BS) centric architecture1 for decades. Network functionalities (e.g. user association) are decided and performed regardless of the underlying application (e.g. automation, tactile Internet, online gaming, multimedia). Such an ossified architecture imposes several hurdles against achieving the ambitious metrics of next generation cellular systems. This article first highlights the features and drawbacks of such architectural ossification. Then the article proposes a virtualized and cognitive network architecture, wherein network functionalities are implemented via software instances in the cloud, and the underlying architecture can adapt to the application of interest as well as to changes in channels and traffic conditions. The adaptation is done in terms of the network topology by manipulating connectivities and steering traffic via different paths, so as to attain the applications\\' requirements and network design objectives. The article presents cognitive strategies to implement some of the classical network functionalities, along with their related implementation challenges. The article further presents a case study illustrating the performance improvement of the proposed architecture as compared to conventional cellular networks, both in terms of outage probability and handover rate.

The entire network topology display system of terminal communication access network

OpenAIRE

An Yi

2016-01-01

Now order terminal communication access network is network technology in Shanxi Province is diversiform, device type complex, lack of unified technical standard, the terminal communication access network management system of construction constitutes a great obstacle. Need to build a “unified communication interface and communication standard, unified communications network management” of the terminal communication access network cut in the integrated network management system, for the termina...

Network function virtualization concepts and applicability in 5G networks

CERN Document Server

Zhang, Ying

2018-01-01

A horizontal view of newly emerged technologies in the field of network function virtualization (NFV), introducing the open source implementation efforts that bring NFV from design to reality This book explores the newly emerged technique of network function virtualization (NFV) through use cases, architecture, and challenges, as well as standardization and open source implementations. It is the first systematic source of information about cloud technologies' usage in the cellular network, covering the interplay of different technologies, the discussion of different design choices, and its impact on our future cellular network. Network Function Virtualization: Concepts and Applicability in 5G Networks reviews new technologies that enable NFV, such as Software Defined Networks (SDN), network virtualization, and cloud computing. It also provides an in-depth investigation of the most advanced open source initiatives in this area, including OPNFV, Openstack, and Opendaylight. Finally, this book goes beyond li...

Building skills for sustainability: a role for regional research networks

Directory of Open Access Journals (Sweden)

Pranab Mukhopadhyay

2014-12-01

Full Text Available In South Asia, as local and regional environment problems grow, societal demand for new sustainability knowledge has outpaced its supply by traditional institutions and created a niche for research networks and think tanks. We discuss the role of networks in producing knowledge by using the South Asian Network for Development and Environmental Economics (SANDEE as a case study. We argue that geographic research networks can contribute to the growth of sustainability knowledge through (1 knowledge transfer, (2 knowledge sharing, and (3 knowledge deepening. By analyzing qualitative and quantitative information, we showed that although SANDEE participants gained significant intangible advantages from the network, there was also a noted tangible gain is in terms of a higher international publication rate. The SANDEE experience also suggests that policy outcomes are more likely to emerge from the buildup of human capital rather than from direct research interventions.

A Squeezed Artificial Neural Network for the Symbolic Network Reliability Functions of Binary-State Networks.

Science.gov (United States)

Yeh, Wei-Chang

Network reliability is an important index to the provision of useful information for decision support in the modern world. There is always a need to calculate symbolic network reliability functions (SNRFs) due to dynamic and rapid changes in network parameters. In this brief, the proposed squeezed artificial neural network (SqANN) approach uses the Monte Carlo simulation to estimate the corresponding reliability of a given designed matrix from the Box-Behnken design, and then the Taguchi method is implemented to find the appropriate number of neurons and activation functions of the hidden layer and the output layer in ANN to evaluate SNRFs. According to the experimental results of the benchmark networks, the comparison appears to support the superiority of the proposed SqANN method over the traditional ANN-based approach with at least 16.6% improvement in the median absolute deviation in the cost of extra 2 s on average for all experiments.Network reliability is an important index to the provision of useful information for decision support in the modern world. There is always a need to calculate symbolic network reliability functions (SNRFs) due to dynamic and rapid changes in network parameters. In this brief, the proposed squeezed artificial neural network (SqANN) approach uses the Monte Carlo simulation to estimate the corresponding reliability of a given designed matrix from the Box-Behnken design, and then the Taguchi method is implemented to find the appropriate number of neurons and activation functions of the hidden layer and the output layer in ANN to evaluate SNRFs. According to the experimental results of the benchmark networks, the comparison appears to support the superiority of the proposed SqANN method over the traditional ANN-based approach with at least 16.6% improvement in the median absolute deviation in the cost of extra 2 s on average for all experiments.

GraphAlignment: Bayesian pairwise alignment of biological networks

Directory of Open Access Journals (Sweden)

Kolář Michal

2012-11-01

Full Text Available Abstract Background With increased experimental availability and accuracy of bio-molecular networks, tools for their comparative and evolutionary analysis are needed. A key component for such studies is the alignment of networks. Results We introduce the Bioconductor package GraphAlignment for pairwise alignment of bio-molecular networks. The alignment incorporates information both from network vertices and network edges and is based on an explicit evolutionary model, allowing inference of all scoring parameters directly from empirical data. We compare the performance of our algorithm to an alternative algorithm, Græmlin 2.0. On simulated data, GraphAlignment outperforms Græmlin 2.0 in several benchmarks except for computational complexity. When there is little or no noise in the data, GraphAlignment is slower than Græmlin 2.0. It is faster than Græmlin 2.0 when processing noisy data containing spurious vertex associations. Its typical case complexity grows approximately as O(N2.6. On empirical bacterial protein-protein interaction networks (PIN and gene co-expression networks, GraphAlignment outperforms Græmlin 2.0 with respect to coverage and specificity, albeit by a small margin. On large eukaryotic PIN, Græmlin 2.0 outperforms GraphAlignment. Conclusions The GraphAlignment algorithm is robust to spurious vertex associations, correctly resolves paralogs, and shows very good performance in identification of homologous vertices defined by high vertex and/or interaction similarity. The simplicity and generality of GraphAlignment edge scoring makes the algorithm an appropriate choice for global alignment of networks.

Low Computational Complexity Network Coding For Mobile Networks

DEFF Research Database (Denmark)

Heide, Janus

2012-01-01

Network Coding (NC) is a technique that can provide benefits in many types of networks, some examples from wireless networks are: In relay networks, either the physical or the data link layer, to reduce the number of transmissions. In reliable multicast, to reduce the amount of signaling and enable......-flow coding technique. One of the key challenges of this technique is its inherent computational complexity which can lead to high computational load and energy consumption in particular on the mobile platforms that are the target platform in this work. To increase the coding throughput several...

Computer network time synchronization the network time protocol

CERN Document Server

Mills, David L

2006-01-01

What started with the sundial has, thus far, been refined to a level of precision based on atomic resonance: Time. Our obsession with time is evident in this continued scaling down to nanosecond resolution and beyond. But this obsession is not without warrant. Precision and time synchronization are critical in many applications, such as air traffic control and stock trading, and pose complex and important challenges in modern information networks.Penned by David L. Mills, the original developer of the Network Time Protocol (NTP), Computer Network Time Synchronization: The Network Time Protocol

Facebook, Social Networking, and Business Education

Science.gov (United States)

Taylor, Steven A.; Mulligan, Jamie R.; Ishida, Chiharu

2012-01-01

Brown (2012) asserts that faculty perceptions of Web 2.0 for teaching will influence its adoption. For example, social media's influence on educational delivery is growing (Hrastinski and Dennon 2012). Zulu et al. (2011) note that business educators are only beginning to understand social networking related to education. We report an exploratory…

Assessing the influence of motivations and attitude on mobile social networking use

OpenAIRE

Sanz Blas, Silvia; Ruiz Mafé, Carla; Martí Parreño, José; Hernández Fernández, Asunción

2013-01-01

Social media have become one of the strongest growing Web 2.0 services worldwide as they are a powerful tool for consumers to recommend products and services. The influence of social networking sites in purchase behaviour and their growing use by consumers justify the need to further study key drivers of users’ behaviour. Although there is now a significant body of literature on the use of social networks from a computer, there is scant literature on their use from mobile devices. As media co...

The Security Plan for the Joint Euratom/IAEA Remote Monitoring Network

International Nuclear Information System (INIS)

Stronkhorst, J.; Schoop, K.; Ruuska, K.; Kurek, S.; Levert, J.F.

2015-01-01

The European Commission and the IAEA have installed surveillance systems in all larger civil European nuclear facilities. The monitoring data is gathered by optical surveillance systems, electronic sealing systems and numerous measuring devices. The on-site joint Euratom/IAEA monitoring networks operate in general completely isolated from the operator's IT systems. To largely improve data security and reliability, remote data transmission (RDT) is installed on a growing number of sites, and the inspection data is daily transferred to the Data Collect Servers in Luxembourg and Vienna. A growing number of RDT connections and a growing number of security threats require an IT security policy that is pro-active as well as reactive in an efficient way. The risk based approach used in setting up the security plans assesses all elements of the monitoring network, from the implemented technical solution and the assessment of the security needs and threats, up to the incident handling and lessons learned. The results of the assessments are, for each individual RDT connection, described in the technical paragraphs and annexes, including system descriptions, network plans and contact information. The principles of secure data handling as implemented in the shared Euratom /IAEA monitoring network can apply to a broad range of industrial monitoring systems, where human interaction is in general the largest security risk. (author)

Resilience of networks formed of interdependent modular networks

Science.gov (United States)

Shekhtman, Louis M.; Shai, Saray; Havlin, Shlomo

2015-12-01

Many infrastructure networks have a modular structure and are also interdependent with other infrastructures. While significant research has explored the resilience of interdependent networks, there has been no analysis of the effects of modularity. Here we develop a theoretical framework for attacks on interdependent modular networks and support our results through simulations. We focus, for simplicity, on the case where each network has the same number of communities and the dependency links are restricted to be between pairs of communities of different networks. This is particularly realistic for modeling infrastructure across cities. Each city has its own infrastructures and different infrastructures are dependent only within the city. However, each infrastructure is connected within and between cities. For example, a power grid will connect many cities as will a communication network, yet a power station and communication tower that are interdependent will likely be in the same city. It has previously been shown that single networks are very susceptible to the failure of the interconnected nodes (between communities) (Shai et al 2014 arXiv:1404.4748) and that attacks on these nodes are even more crippling than attacks based on betweenness (da Cunha et al 2015 arXiv:1502.00353). In our example of cities these nodes have long range links which are more likely to fail. For both treelike and looplike interdependent modular networks we find distinct regimes depending on the number of modules, m. (i) In the case where there are fewer modules with strong intraconnections, the system first separates into modules in an abrupt first-order transition and then each module undergoes a second percolation transition. (ii) When there are more modules with many interconnections between them, the system undergoes a single transition. Overall, we find that modular structure can significantly influence the type of transitions observed in interdependent networks and should be

A Network of Networks Perspective on Global Trade

Science.gov (United States)

Maluck, Julian; Donner, Reik V.

2015-01-01

Mutually intertwined supply chains in contemporary economy result in a complex network of trade relationships with a highly non-trivial topology that varies with time. In order to understand the complex interrelationships among different countries and economic sectors, as well as their dynamics, a holistic view on the underlying structural properties of this network is necessary. This study employs multi-regional input-output data to decompose 186 national economies into 26 industry sectors and utilizes the approach of interdependent networks to analyze the substructure of the resulting international trade network for the years 1990–2011. The partition of the network into national economies is observed to be compatible with the notion of communities in the sense of complex network theory. By studying internal versus cross-subgraph contributions to established complex network metrics, new insights into the architecture of global trade are obtained, which allow to identify key elements of global economy. Specifically, financial services and business activities dominate domestic trade whereas electrical and machinery industries dominate foreign trade. In order to further specify each national sector’s role individually, (cross-)clustering coefficients and cross-betweenness are obtained for different pairs of subgraphs. The corresponding analysis reveals that specific industrial sectors tend to favor distinct directionality patterns and that the cross-clustering coefficient for geographically close country pairs is remarkably high, indicating that spatial factors are still of paramount importance for the organization of trade patterns in modern economy. Regarding the evolution of the trade network’s substructure, globalization is well-expressed by trends of several structural characteristics (e.g., link density and node strength) in the interacting network framework. Extreme events, such as the financial crisis 2008/2009, are manifested as anomalies superimposed

Dominating biological networks.

Directory of Open Access Journals (Sweden)

Tijana Milenković

Full Text Available Proteins are essential macromolecules of life that carry out most cellular processes. Since proteins aggregate to perform function, and since protein-protein interaction (PPI networks model these aggregations, one would expect to uncover new biology from PPI network topology. Hence, using PPI networks to predict protein function and role of protein pathways in disease has received attention. A debate remains open about whether network properties of "biologically central (BC" genes (i.e., their protein products, such as those involved in aging, cancer, infectious diseases, or signaling and drug-targeted pathways, exhibit some topological centrality compared to the rest of the proteins in the human PPI network.To help resolve this debate, we design new network-based approaches and apply them to get new insight into biological function and disease. We hypothesize that BC genes have a topologically central (TC role in the human PPI network. We propose two different concepts of topological centrality. We design a new centrality measure to capture complex wirings of proteins in the network that identifies as TC those proteins that reside in dense extended network neighborhoods. Also, we use the notion of domination and find dominating sets (DSs in the PPI network, i.e., sets of proteins such that every protein is either in the DS or is a neighbor of the DS. Clearly, a DS has a TC role, as it enables efficient communication between different network parts. We find statistically significant enrichment in BC genes of TC nodes and outperform the existing methods indicating that genes involved in key biological processes occupy topologically complex and dense regions of the network and correspond to its "spine" that connects all other network parts and can thus pass cellular signals efficiently throughout the network. To our knowledge, this is the first study that explores domination in the context of PPI networks.

Universal data access for run-time resource management in resource constrained wireless networks

OpenAIRE

Rerkrai, Krisakorn

2012-01-01

Resource-constrainedwireless networks, e.g.wireless sensor networks (WSNs), small embedded devices with limited computational power and energy, have been the subject of intense research in the past decade. Moreover, recent technological advances and growing demand for better efficiency have led to a great number of link and network protocols for WSNs. The protocols depend on specific interfaces to exchange necessary information. Unfortunately these interfaces are often proprietary and highly ...

SCM: A method to improve network service layout efficiency with network evolution

Science.gov (United States)

Zhao, Qi; Zhang, Chuanhao

2017-01-01

Network services are an important component of the Internet, which are used to expand network functions for third-party developers. Network function virtualization (NFV) can improve the speed and flexibility of network service deployment. However, with the evolution of the network, network service layout may become inefficient. Regarding this problem, this paper proposes a service chain migration (SCM) method with the framework of “software defined network + network function virtualization” (SDN+NFV), which migrates service chains to adapt to network evolution and improves the efficiency of the network service layout. SCM is modeled as an integer linear programming problem and resolved via particle swarm optimization. An SCM prototype system is designed based on an SDN controller. Experiments demonstrate that SCM could reduce the network traffic cost and energy consumption efficiently. PMID:29267299

SCM: A method to improve network service layout efficiency with network evolution.

Science.gov (United States)

Zhao, Qi; Zhang, Chuanhao; Zhao, Zheng

2017-01-01

Network services are an important component of the Internet, which are used to expand network functions for third-party developers. Network function virtualization (NFV) can improve the speed and flexibility of network service deployment. However, with the evolution of the network, network service layout may become inefficient. Regarding this problem, this paper proposes a service chain migration (SCM) method with the framework of "software defined network + network function virtualization" (SDN+NFV), which migrates service chains to adapt to network evolution and improves the efficiency of the network service layout. SCM is modeled as an integer linear programming problem and resolved via particle swarm optimization. An SCM prototype system is designed based on an SDN controller. Experiments demonstrate that SCM could reduce the network traffic cost and energy consumption efficiently.

Allocating resources between network nodes for providing a network node function

NARCIS (Netherlands)

Strijkers, R.J.; Meulenhoff, P.J.

2014-01-01

The invention provides a method wherein a first network node advertises available resources that a second network node may use to offload network node functions transparently to the first network node. Examples of the first network node are a client device (e.g. PC, notebook, tablet, smart phone), a

Energy challenges in optical access and aggregation networks.

Science.gov (United States)

Kilper, Daniel C; Rastegarfar, Houman

2016-03-06

Scalability is a critical issue for access and aggregation networks as they must support the growth in both the size of data capacity demands and the multiplicity of access points. The number of connected devices, the Internet of Things, is growing to the tens of billions. Prevailing communication paradigms are reaching physical limitations that make continued growth problematic. Challenges are emerging in electronic and optical systems and energy increasingly plays a central role. With the spectral efficiency of optical systems approaching the Shannon limit, increasing parallelism is required to support higher capacities. For electronic systems, as the density and speed increases, the total system energy, thermal density and energy per bit are moving into regimes that become impractical to support-for example requiring single-chip processor powers above the 100 W limit common today. We examine communication network scaling and energy use from the Internet core down to the computer processor core and consider implications for optical networks. Optical switching in data centres is identified as a potential model from which scalable access and aggregation networks for the future Internet, with the application of integrated photonic devices and intelligent hybrid networking, will emerge. © 2016 The Author(s).

Multilayer Brain Networks

Science.gov (United States)

Vaiana, Michael; Muldoon, Sarah Feldt

2018-01-01

The field of neuroscience is facing an unprecedented expanse in the volume and diversity of available data. Traditionally, network models have provided key insights into the structure and function of the brain. With the advent of big data in neuroscience, both more sophisticated models capable of characterizing the increasing complexity of the data and novel methods of quantitative analysis are needed. Recently, multilayer networks, a mathematical extension of traditional networks, have gained increasing popularity in neuroscience due to their ability to capture the full information of multi-model, multi-scale, spatiotemporal data sets. Here, we review multilayer networks and their applications in neuroscience, showing how incorporating the multilayer framework into network neuroscience analysis has uncovered previously hidden features of brain networks. We specifically highlight the use of multilayer networks to model disease, structure-function relationships, network evolution, and link multi-scale data. Finally, we close with a discussion of promising new directions of multilayer network neuroscience research and propose a modified definition of multilayer networks designed to unite and clarify the use of the multilayer formalism in describing real-world systems.

Collaborative Multi-Layer Network Coding in Hybrid Cellular Cognitive Radio Networks

KAUST Repository

Moubayed, Abdallah J.

2015-05-01

In this paper, as an extension to [1], we propose a prioritized multi-layer network coding scheme for collaborative packet recovery in hybrid (interweave and underlay) cellular cognitive radio networks. This scheme allows the uncoordinated collaboration between the collocated primary and cognitive radio base-stations in order to minimize their own as well as each other\\'s packet recovery overheads, thus by improving their throughput. The proposed scheme ensures that each network\\'s performance is not degraded by its help to the other network. Moreover, it guarantees that the primary network\\'s interference threshold is not violated in the same and adjacent cells. Yet, the scheme allows the reduction of the recovery overhead in the collocated primary and cognitive radio networks. The reduction in the cognitive radio network is further amplified due to the perfect detection of spectrum holes which allows the cognitive radio base station to transmit at higher power without fear of violating the interference threshold of the primary network. For the secondary network, simulation results show reductions of 20% and 34% in the packet recovery overhead, compared to the non-collaborative scheme, for low and high probabilities of primary packet arrivals, respectively. For the primary network, this reduction was found to be 12%. © 2015 IEEE.

Optical network control plane for multi-domain networking

DEFF Research Database (Denmark)

Manolova, Anna Vasileva

This thesis focuses on multi-domain routing for traffice engineering and survivability support in optical transport networks under the Generalized Multi-Protocol Label Switching (GMPLS) control framework. First, different extensions to the Border Gateway Protocol for multi-domain Traffic...... process are not enough for efficient TE in mesh multi-domain networks. Enhancing the protocol with multi-path dissemination capability, combined with the employment of an end-to-end TE metric proves to be a highly efficient solution. Simulation results show good performance characteristics of the proposed...... is not as essential for improved network performance as the length of the provided paths. Second, the issue of multi-domain survivability support is analyzed. An AS-disjoint paths is beneficial not only for resilience support, but also for facilitating adequate network reactions to changes in the network, which...

Resilience of networks to environmental stress: From regular to random networks

Science.gov (United States)

Eom, Young-Ho

2018-04-01

Despite the huge interest in network resilience to stress, most of the studies have concentrated on internal stress damaging network structure (e.g., node removals). Here we study how networks respond to environmental stress deteriorating their external conditions. We show that, when regular networks gradually disintegrate as environmental stress increases, disordered networks can suddenly collapse at critical stress with hysteresis and vulnerability to perturbations. We demonstrate that this difference results from a trade-off between node resilience and network resilience to environmental stress. The nodes in the disordered networks can suppress their collapses due to the small-world topology of the networks but eventually collapse all together in return. Our findings indicate that some real networks can be highly resilient against environmental stress to a threshold yet extremely vulnerable to the stress above the threshold because of their small-world topology.

Introductory note on Emergent Unconscious Knowledge Networks (Asygnodic Networks

Directory of Open Access Journals (Sweden)

Henry Bakis

2016-05-01

Full Text Available This note introduces the following paper on the concept of Emergent Unconscious Knowledge Networks (Asygnodic Networks created by E. Roche and M. Blaine. The concept of asyngnosis explains a large number of diverse phenomena involving organizations, groups and decision making. It will present the genesis and definition of Asygnodic Networks and will focus on how they raise challenges to traditional theories of decision making and emerging social networks.

Hyperconnectivity in juvenile myoclonic epilepsy: a network analysis.

Science.gov (United States)

Caeyenberghs, K; Powell, H W R; Thomas, R H; Brindley, L; Church, C; Evans, J; Muthukumaraswamy, S D; Jones, D K; Hamandi, K

2015-01-01

Juvenile myoclonic epilepsy (JME) is a common idiopathic (genetic) generalized epilepsy (IGE) syndrome characterized by impairments in executive and cognitive control, affecting independent living and psychosocial functioning. There is a growing consensus that JME is associated with abnormal function of diffuse brain networks, typically affecting frontal and fronto-thalamic areas. Using diffusion MRI and a graph theoretical analysis, we examined bivariate (network-based statistic) and multivariate (global and local) properties of structural brain networks in patients with JME (N = 34) and matched controls. Neuropsychological assessment was performed in a subgroup of 14 patients. Neuropsychometry revealed impaired visual memory and naming in JME patients despite a normal full scale IQ (mean = 98.6). Both JME patients and controls exhibited a small world topology in their white matter networks, with no significant differences in the global multivariate network properties between the groups. The network-based statistic approach identified one subnetwork of hyperconnectivity in the JME group, involving primary motor, parietal and subcortical regions. Finally, there was a significant positive correlation in structural connectivity with cognitive task performance. Our findings suggest that structural changes in JME patients are distributed at a network level, beyond the frontal lobes. The identified subnetwork includes key structures in spike wave generation, along with primary motor areas, which may contribute to myoclonic jerks. We conclude that analyzing the affected subnetworks may provide new insights into understanding seizure generation, as well as the cognitive deficits observed in JME patients.

Maximization Network Throughput Based on Improved Genetic Algorithm and Network Coding for Optical Multicast Networks

Science.gov (United States)

Wei, Chengying; Xiong, Cuilian; Liu, Huanlin

2017-12-01

Maximal multicast stream algorithm based on network coding (NC) can improve the network's throughput for wavelength-division multiplexing (WDM) networks, which however is far less than the network's maximal throughput in terms of theory. And the existing multicast stream algorithms do not give the information distribution pattern and routing in the meantime. In the paper, an improved genetic algorithm is brought forward to maximize the optical multicast throughput by NC and to determine the multicast stream distribution by hybrid chromosomes construction for multicast with single source and multiple destinations. The proposed hybrid chromosomes are constructed by the binary chromosomes and integer chromosomes, while the binary chromosomes represent optical multicast routing and the integer chromosomes indicate the multicast stream distribution. A fitness function is designed to guarantee that each destination can receive the maximum number of decoding multicast streams. The simulation results showed that the proposed method is far superior over the typical maximal multicast stream algorithms based on NC in terms of network throughput in WDM networks.

The network researchers' network

DEFF Research Database (Denmark)

Henneberg, Stephan C.; Jiang, Zhizhong; Naudé, Peter

2009-01-01

The Industrial Marketing and Purchasing (IMP) Group is a network of academic researchers working in the area of business-to-business marketing. The group meets every year to discuss and exchange ideas, with a conference having been held every year since 1984 (there was no meeting in 1987). In thi......The Industrial Marketing and Purchasing (IMP) Group is a network of academic researchers working in the area of business-to-business marketing. The group meets every year to discuss and exchange ideas, with a conference having been held every year since 1984 (there was no meeting in 1987......). In this paper, based upon the papers presented at the 22 conferences held to date, we undertake a Social Network Analysis in order to examine the degree of co-publishing that has taken place between this group of researchers. We identify the different components in this database, and examine the large main...

Managerial Challenges Within Networks - Emphasizing the Paradox of Network Participation

DEFF Research Database (Denmark)

Jakobsen, Morten

2003-01-01

Flexibility and access to numerous resources are essential benefits associated with network participation. An important aspect of managing the network participation of a company is to maintain a dynamic portfolio of partners, and thereby keep up the strategic opportunities for development. However......, maintaining the dynamics within a network seems to be a complex challenge. There is a risk that the network ends up in The Paradox of Network Participation. The desired renewal and flexibility are not utilised because the involved parties preserve the existing networks structure consisting of the same...... and thereby sort out the paradox of network participation. Trust and information are mechanisms employed to absorb uncertainty. The relationship between trust and the requirement for information depends on the maturity of the relationship. When trust becomes too important as uncertainty absorption mechanism...

Managerial challenges within networks: emphasizing the paradox of network participation

DEFF Research Database (Denmark)

Jakobsen, Morten

Flexibility and access to numerous resources are essential benefits associated with network participation. An important aspect of managing the network participation of a company is to maintain a dynamic portfolio of partners, and thereby keep up the strategic opportunities for development. However......, maintaining the dynamics within a network seems to be a complex challenge. There is a risk that the network ends up in The Paradox of Network Participation. The desired renewal and flexibility are not utilised because the involved parties preserve the existing networks structure consisting of the same...... and thereby sort out the paradox of network participation. Trust and information are mechanisms employed to absorb uncertainty. The relationship between trust and the requirement for information depends on the maturity of the relationship. When trust becomes too important as uncertainty absorption mechanism...

Network synchronization in a population of star-coupled fractional nonlinear oscillators

Energy Technology Data Exchange (ETDEWEB)

Wang Junwei, E-mail: wangjunweilj@yahoo.com.c [School of Informatics, Guangdong University of Foreign Studies, Guangzhou 510006 (China); Zhang Yanbin [School of Computer Science, Hangzhou Dianzi University, Hangzhou 310018 (China)

2010-03-29

The topic of fractional calculus is enjoying growing interest among mathematicians, physicists and engineers in recent years. For complex network consisting of more than two fractional-order systems, however, it is difficult to establish its synchronization behavior. In this Letter, we study the synchronized motions in a star network of coupled fractional-order systems in which the major element is coupled to each of the noninteracting individual elements. On the basis of the stability theory of linear fractional-order differential equations, we derive a sufficient condition for the stability of the synchronization behavior in such a network. Furthermore, we verify our theoretical results by numerical simulations of star-coupled network with fractional-order chaotic nodes.

Energy Efficient Network Protocols for Wireless and Mobile Networks

National Research Council Canada - National Science Library

Sivalingam, Krishna

2001-01-01

... (also called power aware) network protocols for wireless and mobile networks. Battery power limitations are a very serious concern, and it is essential to study energy efficient protocol design at different layers of the network protocol stack...

Collaborative multi-layer network coding for cellular cognitive radio networks

KAUST Repository

Sorour, Sameh

2013-06-01

In this paper, we propose a prioritized multi-layer network coding scheme for collaborative packet recovery in underlay cellular cognitive radio networks. This scheme allows the collocated primary and cognitive radio base-stations to collaborate with each other, in order to minimize their own and each other\\'s packet recovery overheads, and thus improve their throughput, without any coordination between them. This non-coordinated collaboration is done using a novel multi-layer instantly decodable network coding scheme, which guarantees that each network\\'s help to the other network does not result in any degradation in its own performance. It also does not cause any violation to the primary networks interference thresholds in the same and adjacent cells. Yet, our proposed scheme both guarantees the reduction of the recovery overhead in collocated primary and cognitive radio networks, and allows early recovery of their packets compared to non-collaborative schemes. Simulation results show that a recovery overhead reduction of 15% and 40% can be achieved by our proposed scheme in the primary and cognitive radio networks, respectively, compared to the corresponding non-collaborative scheme. © 2013 IEEE.

Network Simulation

CERN Document Server

Fujimoto, Richard

2006-01-01

"Network Simulation" presents a detailed introduction to the design, implementation, and use of network simulation tools. Discussion topics include the requirements and issues faced for simulator design and use in wired networks, wireless networks, distributed simulation environments, and fluid model abstractions. Several existing simulations are given as examples, with details regarding design decisions and why those decisions were made. Issues regarding performance and scalability are discussed in detail, describing how one can utilize distributed simulation methods to increase the

Morphological neural networks

Energy Technology Data Exchange (ETDEWEB)

Ritter, G.X.; Sussner, P. [Univ. of Florida, Gainesville, FL (United States)

1996-12-31

The theory of artificial neural networks has been successfully applied to a wide variety of pattern recognition problems. In this theory, the first step in computing the next state of a neuron or in performing the next layer neural network computation involves the linear operation of multiplying neural values by their synaptic strengths and adding the results. Thresholding usually follows the linear operation in order to provide for nonlinearity of the network. In this paper we introduce a novel class of neural networks, called morphological neural networks, in which the operations of multiplication and addition are replaced by addition and maximum (or minimum), respectively. By taking the maximum (or minimum) of sums instead of the sum of products, morphological network computation is nonlinear before thresholding. As a consequence, the properties of morphological neural networks are drastically different than those of traditional neural network models. In this paper we consider some of these differences and provide some particular examples of morphological neural network.

Directed network modules

International Nuclear Information System (INIS)

Palla, Gergely; Farkas, Illes J; Pollner, Peter; Derenyi, Imre; Vicsek, Tamas

2007-01-01

A search technique locating network modules, i.e. internally densely connected groups of nodes in directed networks is introduced by extending the clique percolation method originally proposed for undirected networks. After giving a suitable definition for directed modules we investigate their percolation transition in the Erdos-Renyi graph both analytically and numerically. We also analyse four real-world directed networks, including Google's own web-pages, an email network, a word association graph and the transcriptional regulatory network of the yeast Saccharomyces cerevisiae. The obtained directed modules are validated by additional information available for the nodes. We find that directed modules of real-world graphs inherently overlap and the investigated networks can be classified into two major groups in terms of the overlaps between the modules. Accordingly, in the word-association network and Google's web-pages, overlaps are likely to contain in-hubs, whereas the modules in the email and transcriptional regulatory network tend to overlap via out-hubs

Network connectivity value.

Science.gov (United States)

Dragicevic, Arnaud; Boulanger, Vincent; Bruciamacchie, Max; Chauchard, Sandrine; Dupouey, Jean-Luc; Stenger, Anne

2017-04-21

In order to unveil the value of network connectivity, we formalize the construction of ecological networks in forest environments as an optimal control dynamic graph-theoretic problem. The network is based on a set of bioreserves and patches linked by ecological corridors. The node dynamics, built upon the consensus protocol, form a time evolutive Mahalanobis distance weighted by the opportunity costs of timber production. We consider a case of complete graph, where the ecological network is fully connected, and a case of incomplete graph, where the ecological network is partially connected. The results show that the network equilibrium depends on the size of the reception zone, while the network connectivity depends on the environmental compatibility between the ecological areas. Through shadow prices, we find that securing connectivity in partially connected networks is more expensive than in fully connected networks, but should be undertaken when the opportunity costs are significant. Copyright © 2017 Elsevier Ltd. All rights reserved.

Tunable Sparse Network Coding for Multicast Networks

DEFF Research Database (Denmark)

Feizi, Soheil; Roetter, Daniel Enrique Lucani; Sørensen, Chres Wiant

2014-01-01

This paper shows the potential and key enabling mechanisms for tunable sparse network coding, a scheme in which the density of network coded packets varies during a transmission session. At the beginning of a transmission session, sparsely coded packets are transmitted, which benefits decoding...... complexity. At the end of a transmission, when receivers have accumulated degrees of freedom, coding density is increased. We propose a family of tunable sparse network codes (TSNCs) for multicast erasure networks with a controllable trade-off between completion time performance to decoding complexity...... a mechanism to perform efficient Gaussian elimination over sparse matrices going beyond belief propagation but maintaining low decoding complexity. Supporting simulation results are provided showing the trade-off between decoding complexity and completion time....

A COMPARATIVE STUDY OF SYSTEM NETWORK ARCHITECTURE Vs DIGITAL NETWORK ARCHITECTURE

OpenAIRE

Seema; Mukesh Arya

2011-01-01

The efficient managing system of sources is mandatory for the successful running of any network. Here this paper describes the most popular network architectures one of developed by IBM, System Network Architecture (SNA) and other is Digital Network Architecture (DNA). As we know that the network standards and protocols are needed for the network developers as well as users. Some standards are The IEEE 802.3 standards (The Institute of Electrical and Electronics Engineers 1980) (LAN), IBM Sta...

Vestigial preference functions in neural networks and túngara frogs.

OpenAIRE

Phelps, S. M.; Ryan, M. J.; Rand, A. S.

2001-01-01

Although there is a growing interest in understanding how perceptual mechanisms influence behavioral evolution, few studies have addressed how perception itself is shaped by evolutionary forces. We used a combination of artificial neural network models and behavioral experiments to investigate how evolutionary history influenced the perceptual processes used in mate choice by female túngara frogs. We manipulated the evolutionary history of artificial neural network models and observed an emer...

Utilizing social networks, blogging and YouTube in allergy and immunology practices.

Science.gov (United States)

Dimov, Ves; Eidelman, Frank

2015-01-01

Online social networks are used to connect with friends and family members, and increasingly, to stay up-to-date with the latest news and developments in allergy and immunology. As communication is a central part of healthcare delivery, the utilization of such networking channels in allergy and immunology will continue to grow. There are inherent risks to online social networks related to breaches of patient confidentiality, professionalism and privacy. Malpractice and liability risks should also be considered. There is a paucity of information in the literature on how social network interventions affect patient outcomes. The allergy and immunology community should direct future studies towards investigating how the use of social networks and other technology tools and services can improve patient care.

A research on the application of software defined networking in satellite network architecture

Science.gov (United States)

Song, Huan; Chen, Jinqiang; Cao, Suzhi; Cui, Dandan; Li, Tong; Su, Yuxing

2017-10-01

Software defined network is a new type of network architecture, which decouples control plane and data plane of traditional network, has the feature of flexible configurations and is a direction of the next generation terrestrial Internet development. Satellite network is an important part of the space-ground integrated information network, while the traditional satellite network has the disadvantages of difficult network topology maintenance and slow configuration. The application of SDN technology in satellite network can solve these problems that traditional satellite network faces. At present, the research on the application of SDN technology in satellite network is still in the stage of preliminary study. In this paper, we start with introducing the SDN technology and satellite network architecture. Then we mainly introduce software defined satellite network architecture, as well as the comparison of different software defined satellite network architecture and satellite network virtualization. Finally, the present research status and development trend of SDN technology in satellite network are analyzed.