Energy efficient evolution of mobile broadband networks

Energy Technology Data Exchange (ETDEWEB)

Micallef, G.

2013-04-15

Over the last decade, the mobile communications industry has broken through some remarkable barriers, pushing further and transforming the way people communicate and access information. As the volume of traffic carried by mobile networks maintains an insatiable growth, mobile network operators are required to ensure that networks can scale accordingly. In addition to upgrading existing networks, a number of operators have already started to rollout a further radio access technology layer, Long Term Evolution, or LTE. In addition to enhancing network capacity, operators are also required to adhere to public commitments for reducing their energy and carbon footprint. In 2008 Vodafone stated that by the year 2020, efforts for reducing emissions are expected to halve emissions registered in the year 2006/7. In addition to presenting a more environmentally conscious brand, this is also hoped to reduce costs, which, based on increasing energy prices and necessary network upgrades are likely to increase. Since base station sites make up for about 75% of the power consumption in mobile networks, studies are focused on this specific network element. A number of factors believed to play a role in the power consumption of mobile networks are separately investigated and later combined, providing a realistic indication of how the consumption is expected to evolve. This is also used as an indication to determine how likely it is for operators to achieve power consumption and emission targets. In order for mobile network operators to upgrade existing infrastructure different options are available. Irrespective of the selected option, capacity upgrades are bound to increase the power consumption of the network. Carried through case studies, a first analysis compares a number of network evolution strategies, determining which provides the necessary performance while limiting the increase in power consumption. Overall, it is noted that a hybrid solution involving the upgrade of

Energy efficient evolution of mobile broadband networks

Energy Technology Data Exchange (ETDEWEB)

Micallef, G.

2013-04-15

Over the last decade, the mobile communications industry has broken through some remarkable barriers, pushing further and transforming the way people communicate and access information. As the volume of traffic carried by mobile networks maintains an insatiable growth, mobile network operators are required to ensure that networks can scale accordingly. In addition to upgrading existing networks, a number of operators have already started to rollout a further radio access technology layer, Long Term Evolution, or LTE. In addition to enhancing network capacity, operators are also required to adhere to public commitments for reducing their energy and carbon footprint. In 2008 Vodafone stated that by the year 2020, efforts for reducing emissions are expected to halve emissions registered in the year 2006/7. In addition to presenting a more environmentally conscious brand, this is also hoped to reduce costs, which, based on increasing energy prices and necessary network upgrades are likely to increase. Since base station sites make up for about 75% of the power consumption in mobile networks, studies are focused on this specific network element. A number of factors believed to play a role in the power consumption of mobile networks are separately investigated and later combined, providing a realistic indication of how the consumption is expected to evolve. This is also used as an indication to determine how likely it is for operators to achieve power consumption and emission targets. In order for mobile network operators to upgrade existing infrastructure different options are available. Irrespective of the selected option, capacity upgrades are bound to increase the power consumption of the network. Carried through case studies, a first analysis compares a number of network evolution strategies, determining which provides the necessary performance while limiting the increase in power consumption. Overall, it is noted that a hybrid solution involving the upgrade of

Analyzing complex networks evolution through Information Theory quantifiers

International Nuclear Information System (INIS)

Carpi, Laura C.; Rosso, Osvaldo A.; Saco, Patricia M.; Ravetti, Martin Gomez

2011-01-01

A methodology to analyze dynamical changes in complex networks based on Information Theory quantifiers is proposed. The square root of the Jensen-Shannon divergence, a measure of dissimilarity between two probability distributions, and the MPR Statistical Complexity are used to quantify states in the network evolution process. Three cases are analyzed, the Watts-Strogatz model, a gene network during the progression of Alzheimer's disease and a climate network for the Tropical Pacific region to study the El Nino/Southern Oscillation (ENSO) dynamic. We find that the proposed quantifiers are able not only to capture changes in the dynamics of the processes but also to quantify and compare states in their evolution.

Cross-linked structure of network evolution

International Nuclear Information System (INIS)

Bassett, Danielle S.; Wymbs, Nicholas F.; Grafton, Scott T.; Porter, Mason A.; Mucha, Peter J.

2014-01-01

We study the temporal co-variation of network co-evolution via the cross-link structure of networks, for which we take advantage of the formalism of hypergraphs to map cross-link structures back to network nodes. We investigate two sets of temporal network data in detail. In a network of coupled nonlinear oscillators, hyperedges that consist of network edges with temporally co-varying weights uncover the driving co-evolution patterns of edge weight dynamics both within and between oscillator communities. In the human brain, networks that represent temporal changes in brain activity during learning exhibit early co-evolution that then settles down with practice. Subsequent decreases in hyperedge size are consistent with emergence of an autonomous subgraph whose dynamics no longer depends on other parts of the network. Our results on real and synthetic networks give a poignant demonstration of the ability of cross-link structure to uncover unexpected co-evolution attributes in both real and synthetic dynamical systems. This, in turn, illustrates the utility of analyzing cross-links for investigating the structure of temporal networks

Cross-linked structure of network evolution

Energy Technology Data Exchange (ETDEWEB)

Bassett, Danielle S., E-mail: dsb@seas.upenn.edu [Department of Bioengineering, University of Pennsylvania, Philadelphia, Pennsylvania 19104 (United States); Department of Physics, University of California, Santa Barbara, California 93106 (United States); Sage Center for the Study of the Mind, University of California, Santa Barbara, California 93106 (United States); Wymbs, Nicholas F.; Grafton, Scott T. [Department of Psychology and UCSB Brain Imaging Center, University of California, Santa Barbara, California 93106 (United States); Porter, Mason A. [Oxford Centre for Industrial and Applied Mathematics, Mathematical Institute, University of Oxford, Oxford OX2 6GG (United Kingdom); CABDyN Complexity Centre, University of Oxford, Oxford, OX1 1HP (United Kingdom); Mucha, Peter J. [Carolina Center for Interdisciplinary Applied Mathematics, Department of Mathematics, University of North Carolina, Chapel Hill, North Carolina 27599 (United States); Department of Applied Physical Sciences, University of North Carolina, Chapel Hill, North Carolina 27599 (United States)

2014-03-15

We study the temporal co-variation of network co-evolution via the cross-link structure of networks, for which we take advantage of the formalism of hypergraphs to map cross-link structures back to network nodes. We investigate two sets of temporal network data in detail. In a network of coupled nonlinear oscillators, hyperedges that consist of network edges with temporally co-varying weights uncover the driving co-evolution patterns of edge weight dynamics both within and between oscillator communities. In the human brain, networks that represent temporal changes in brain activity during learning exhibit early co-evolution that then settles down with practice. Subsequent decreases in hyperedge size are consistent with emergence of an autonomous subgraph whose dynamics no longer depends on other parts of the network. Our results on real and synthetic networks give a poignant demonstration of the ability of cross-link structure to uncover unexpected co-evolution attributes in both real and synthetic dynamical systems. This, in turn, illustrates the utility of analyzing cross-links for investigating the structure of temporal networks.

Analyzing complex networks evolution through Information Theory quantifiers

Energy Technology Data Exchange (ETDEWEB)

Carpi, Laura C., E-mail: Laura.Carpi@studentmail.newcastle.edu.a [Civil, Surveying and Environmental Engineering, University of Newcastle, University Drive, Callaghan NSW 2308 (Australia); Departamento de Fisica, Instituto de Ciencias Exatas, Universidade Federal de Minas Gerais, Av. Antonio Carlos 6627, Belo Horizonte (31270-901), MG (Brazil); Rosso, Osvaldo A., E-mail: rosso@fisica.ufmg.b [Departamento de Fisica, Instituto de Ciencias Exatas, Universidade Federal de Minas Gerais, Av. Antonio Carlos 6627, Belo Horizonte (31270-901), MG (Brazil); Chaos and Biology Group, Instituto de Calculo, Facultad de Ciencias Exactas y Naturales, Universidad de Buenos Aires, Pabellon II, Ciudad Universitaria, 1428 Ciudad de Buenos Aires (Argentina); Saco, Patricia M., E-mail: Patricia.Saco@newcastle.edu.a [Civil, Surveying and Environmental Engineering, University of Newcastle, University Drive, Callaghan NSW 2308 (Australia); Departamento de Hidraulica, Facultad de Ciencias Exactas, Ingenieria y Agrimensura, Universidad Nacional de Rosario, Avenida Pellegrini 250, Rosario (Argentina); Ravetti, Martin Gomez, E-mail: martin.ravetti@dep.ufmg.b [Departamento de Engenharia de Producao, Universidade Federal de Minas Gerais, Av. Antonio Carlos, 6627, Belo Horizonte (31270-901), MG (Brazil)

2011-01-24

A methodology to analyze dynamical changes in complex networks based on Information Theory quantifiers is proposed. The square root of the Jensen-Shannon divergence, a measure of dissimilarity between two probability distributions, and the MPR Statistical Complexity are used to quantify states in the network evolution process. Three cases are analyzed, the Watts-Strogatz model, a gene network during the progression of Alzheimer's disease and a climate network for the Tropical Pacific region to study the El Nino/Southern Oscillation (ENSO) dynamic. We find that the proposed quantifiers are able not only to capture changes in the dynamics of the processes but also to quantify and compare states in their evolution.

A contribution to the study of plant development evolution based on gene co-expression networks

Directory of Open Access Journals (Sweden)

Francisco J. Romero-Campero

2013-08-01

Full Text Available Phototrophic eukaryotes are among the most successful organisms on Earth due to their unparalleled efficiency at capturing light energy and fixing carbon dioxide to produce organic molecules. A conserved and efficient network of light-dependent regulatory modules could be at the bases of this success. This regulatory system conferred early advantages to phototrophic eukaryotes that allowed for specialization, complex developmental processes and modern plant characteristics. We have studied light-dependent gene regulatory modules from algae to plants employing integrative-omics approaches based on gene co-expression networks. Our study reveals some remarkably conserved ways in which eukaryotic phototrophs deal with day length and light signaling. Here we describe how a family of Arabidopsis transcription factors involved in photoperiod response has evolved from a single algal gene according to the innovation, amplification and divergence theory of gene evolution by duplication. These modifications of the gene co-expression networks from the ancient unicellular green algae Chlamydomonas reinhardtii to the modern brassica Arabidopsis thaliana may hint on the evolution and specialization of plants and other organisms.

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

Network evolution model for supply chain with manufactures as the core

Science.gov (United States)

Jiang, Dali; Fang, Ling; Yang, Jian; Li, Wu; Zhao, Jing

2018-01-01

Building evolution model of supply chain networks could be helpful to understand its development law. However, specific characteristics and attributes of real supply chains are often neglected in existing evolution models. This work proposes a new evolution model of supply chain with manufactures as the core, based on external market demand and internal competition-cooperation. The evolution model assumes the external market environment is relatively stable, considers several factors, including specific topology of supply chain, external market demand, ecological growth and flow conservation. The simulation results suggest that the networks evolved by our model have similar structures as real supply chains. Meanwhile, the influences of external market demand and internal competition-cooperation to network evolution are analyzed. Additionally, 38 benchmark data sets are applied to validate the rationality of our evolution model, in which, nine manufacturing supply chains match the features of the networks constructed by our model. PMID:29370201

Network evolution model for supply chain with manufactures as the core.

Science.gov (United States)

Fang, Haiyang; Jiang, Dali; Yang, Tinghong; Fang, Ling; Yang, Jian; Li, Wu; Zhao, Jing

2018-01-01

Building evolution model of supply chain networks could be helpful to understand its development law. However, specific characteristics and attributes of real supply chains are often neglected in existing evolution models. This work proposes a new evolution model of supply chain with manufactures as the core, based on external market demand and internal competition-cooperation. The evolution model assumes the external market environment is relatively stable, considers several factors, including specific topology of supply chain, external market demand, ecological growth and flow conservation. The simulation results suggest that the networks evolved by our model have similar structures as real supply chains. Meanwhile, the influences of external market demand and internal competition-cooperation to network evolution are analyzed. Additionally, 38 benchmark data sets are applied to validate the rationality of our evolution model, in which, nine manufacturing supply chains match the features of the networks constructed by our model.

Network evolution model for supply chain with manufactures as the core.

Directory of Open Access Journals (Sweden)

Haiyang Fang

Full Text Available Building evolution model of supply chain networks could be helpful to understand its development law. However, specific characteristics and attributes of real supply chains are often neglected in existing evolution models. This work proposes a new evolution model of supply chain with manufactures as the core, based on external market demand and internal competition-cooperation. The evolution model assumes the external market environment is relatively stable, considers several factors, including specific topology of supply chain, external market demand, ecological growth and flow conservation. The simulation results suggest that the networks evolved by our model have similar structures as real supply chains. Meanwhile, the influences of external market demand and internal competition-cooperation to network evolution are analyzed. Additionally, 38 benchmark data sets are applied to validate the rationality of our evolution model, in which, nine manufacturing supply chains match the features of the networks constructed by our model.

Evolution of Wireless Sensor Networks for Industrial Control

Directory of Open Access Journals (Sweden)

Arthur Low

2013-05-01

Full Text Available Technologies evolve in a process of gradual scientific change, but the commercial application of technologies is discontinuous. Managers interested in technology evolution can integrate these contrasting ideas using a powerful theoretical framework, based on the concept of punctuated equilibrium from evolutionary biology. The framework, which enables the differentiation of the technical evolution of a technology from its market application, is used in this article to compare the two standards for wireless sensor networks (WSN for industrial instrumentation and control: WirelessHART and ISA100.11a. The two WSN standards are the product of two different market contexts, which have selected different minimum viable technologies for evolution in their respective niches. Network security issues present some important selection criteria. Both WSN standards implement security countermeasures against localized wireless network attacks based on the application of the AES encryption standard, but some specific security threats – some local, others remotely launched – are only well-defended by the adoption of public-key cryptographic (PKC protocols, which only ISA100.11a supports. This article concludes that the mainstream market potential of the Internet has influenced the evolution of ISA100.11a and will continue to demand that each WSN standard evolve in ways that are difficult to predict.

Molecular dynamics study on the evolution of interfacial dislocation network and mechanical properties of Ni-based single crystal superalloys

Science.gov (United States)

Li, Nan-Lin; Wu, Wen-Ping; Nie, Kai

2018-05-01

The evolution of misfit dislocation network at γ /γ‧ phase interface and tensile mechanical properties of Ni-based single crystal superalloys at various temperatures and strain rates are studied by using molecular dynamics (MD) simulations. From the simulations, it is found that with the increase of loading, the dislocation network effectively inhibits dislocations emitted in the γ matrix cutting into the γ‧ phase and absorbs the matrix dislocations to strengthen itself which increases the stability of structure. Under the influence of the temperature, the initial mosaic structure of dislocation network gradually becomes irregular, and the initial misfit stress and the elastic modulus slowly decline as temperature increasing. On the other hand, with the increase of the strain rate, it almost has no effect on the elastic modulus and the way of evolution of dislocation network, but contributes to the increases of the yield stress and tensile strength. Moreover, tension-compression asymmetry of Ni-based single crystal superalloys is also presented based on MD simulations.

A model for evolution of overlapping community networks

Science.gov (United States)

Karan, Rituraj; Biswal, Bibhu

2017-05-01

A model is proposed for the evolution of network topology in social networks with overlapping community structure. Starting from an initial community structure that is defined in terms of group affiliations, the model postulates that the subsequent growth and loss of connections is similar to the Hebbian learning and unlearning in the brain and is governed by two dominant factors: the strength and frequency of interaction between the members, and the degree of overlap between different communities. The temporal evolution from an initial community structure to the current network topology can be described based on these two parameters. It is possible to quantify the growth occurred so far and predict the final stationary state to which the network is likely to evolve. Applications in epidemiology or the spread of email virus in a computer network as well as finding specific target nodes to control it are envisaged. While facing the challenge of collecting and analyzing large-scale time-resolved data on social groups and communities one faces the most basic questions: how do communities evolve in time? This work aims to address this issue by developing a mathematical model for the evolution of community networks and studying it through computer simulation.

Pareto evolution of gene networks: an algorithm to optimize multiple fitness objectives

International Nuclear Information System (INIS)

Warmflash, Aryeh; Siggia, Eric D; Francois, Paul

2012-01-01

The computational evolution of gene networks functions like a forward genetic screen to generate, without preconceptions, all networks that can be assembled from a defined list of parts to implement a given function. Frequently networks are subject to multiple design criteria that cannot all be optimized simultaneously. To explore how these tradeoffs interact with evolution, we implement Pareto optimization in the context of gene network evolution. In response to a temporal pulse of a signal, we evolve networks whose output turns on slowly after the pulse begins, and shuts down rapidly when the pulse terminates. The best performing networks under our conditions do not fall into categories such as feed forward and negative feedback that also encode the input–output relation we used for selection. Pareto evolution can more efficiently search the space of networks than optimization based on a single ad hoc combination of the design criteria. (paper)

Pareto evolution of gene networks: an algorithm to optimize multiple fitness objectives.

Science.gov (United States)

Warmflash, Aryeh; Francois, Paul; Siggia, Eric D

2012-10-01

The computational evolution of gene networks functions like a forward genetic screen to generate, without preconceptions, all networks that can be assembled from a defined list of parts to implement a given function. Frequently networks are subject to multiple design criteria that cannot all be optimized simultaneously. To explore how these tradeoffs interact with evolution, we implement Pareto optimization in the context of gene network evolution. In response to a temporal pulse of a signal, we evolve networks whose output turns on slowly after the pulse begins, and shuts down rapidly when the pulse terminates. The best performing networks under our conditions do not fall into categories such as feed forward and negative feedback that also encode the input-output relation we used for selection. Pareto evolution can more efficiently search the space of networks than optimization based on a single ad hoc combination of the design criteria.

Nation-Wide Mobile Network Energy Evolution Analysis

DEFF Research Database (Denmark)

Perez, Eva; Frank, Philipp; Micallef, Gilbert

2013-01-01

Mobile network operators are facing a challenging dilemma. While on the one hand they are committed to reducing their carbon emissions, and energy consumption, they are also required to continuously upgrade existing networks, ensuring that the relentless growth in data traffic can still be suppor......Mobile network operators are facing a challenging dilemma. While on the one hand they are committed to reducing their carbon emissions, and energy consumption, they are also required to continuously upgrade existing networks, ensuring that the relentless growth in data traffic can still...... be supported. In most cases, these upgrades increase the energy consumption of the network even further. This paper presents a nation-wide case study, based on a commercial network of a leading European operator, intended to provide a clear understanding of how the energy consumption of mobile networks...... is expected to evolve from 2012 until 2020. The study also considers an efficient network capacity evolution path, including base station equipment improvement forecasts....

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.

Regulation, Competition and Network Evolution in Aviation

Science.gov (United States)

Gillen, David; Morrison, William

2003-01-01

Our focus is the evolution of business strategies and network structure decisions in the commercial passenger aviation industry. The paper reviews the growth of hub-and-spoke networks as the dominant business model following deregulation in the latter part of the 20 century, followed by the emergence of value-based airlines as a global phenomenon at the end of the century. The paper highlights the link between airline business strategies and network structures, and examines the resulting competition between divergent network structure business models. In this context we discuss issues of market structure stability and the role played by competition policy.

Predicting Community Evolution in Social Networks

Directory of Open Access Journals (Sweden)

Stanisław Saganowski

2015-05-01

Full Text Available Nowadays, sustained development of different social media can be observed worldwide. One of the relevant research domains intensively explored recently is analysis of social communities existing in social media as well as prediction of their future evolution taking into account collected historical evolution chains. These evolution chains proposed in the paper contain group states in the previous time frames and its historical transitions that were identified using one out of two methods: Stable Group Changes Identification (SGCI and Group Evolution Discovery (GED. Based on the observed evolution chains of various length, structural network features are extracted, validated and selected as well as used to learn classification models. The experimental studies were performed on three real datasets with different profile: DBLP, Facebook and Polish blogosphere. The process of group prediction was analysed with respect to different classifiers as well as various descriptive feature sets extracted from evolution chains of different length. The results revealed that, in general, the longer evolution chains the better predictive abilities of the classification models. However, chains of length 3 to 7 enabled the GED-based method to almost reach its maximum possible prediction quality. For SGCI, this value was at the level of 3–5 last periods.

Modeling evolution of crosstalk in noisy signal transduction networks

Science.gov (United States)

Tareen, Ammar; Wingreen, Ned S.; Mukhopadhyay, Ranjan

2018-02-01

Signal transduction networks can form highly interconnected systems within cells due to crosstalk between constituent pathways. To better understand the evolutionary design principles underlying such networks, we study the evolution of crosstalk for two parallel signaling pathways that arise via gene duplication. We use a sequence-based evolutionary algorithm and evolve the network based on two physically motivated fitness functions related to information transmission. We find that one fitness function leads to a high degree of crosstalk while the other leads to pathway specificity. Our results offer insights on the relationship between network architecture and information transmission for noisy biomolecular networks.

Analytic models for the evolution of semilocal string networks

International Nuclear Information System (INIS)

Nunes, A. S.; Martins, C. J. A. P.; Avgoustidis, A.; Urrestilla, J.

2011-01-01

We revisit previously developed analytic models for defect evolution and adapt them appropriately for the study of semilocal string networks. We thus confirm the expectation (based on numerical simulations) that linear scaling evolution is the attractor solution for a broad range of model parameters. We discuss in detail the evolution of individual semilocal segments, focusing on the phenomenology of segment growth, and also provide a preliminary comparison with existing numerical simulations.

The evolution analysis of listed companies co-holding non-listed financial companies based on two-mode heterogeneous networks

Science.gov (United States)

An, Pengli; Li, Huajiao; Zhou, Jinsheng; Chen, Fan

2017-10-01

Complex network theory is a widely used tool in the empirical research of financial markets. Two-mode and multi-mode networks are new trends and represent new directions in that they can more accurately simulate relationships between entities. In this paper, we use data for Chinese listed companies holding non-listed financial companies over a ten-year period to construct two networks: a two-mode primitive network in which listed companies and non-listed financial companies are considered actors and events, respectively, and a one-mode network that is constructed based on the decreasing-mode method in which listed companies are considered nodes. We analyze the evolution of the listed company co-holding network from several perspectives, including that of the whole network, of information control ability, of implicit relationships, of community division and of small-world characteristics. The results of the analysis indicate that (1) China's developing stock market affects the share-holding condition of listed companies holding non-listed financial companies; (2) the information control ability of co-holding networks is focused on a few listed companies and the implicit relationship of investment preference between listed companies is determined by the co-holding behavior; (3) the community division of the co-holding network is increasingly obvious, as determined by the investment preferences among listed companies; and (4) the small-world characteristics of the co-holding network are increasingly obvious, resulting in reduced communication costs. In this paper, we conduct an evolution analysis and develop an understanding of the factors that influence the listed companies co-holding network. This study will help illuminate research on evolution analysis.

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.

Evolution of semilocal string networks. II. Velocity estimators

Science.gov (United States)

Lopez-Eiguren, A.; Urrestilla, J.; Achúcarro, A.; Avgoustidis, A.; Martins, C. J. A. P.

2017-07-01

We continue a comprehensive numerical study of semilocal string networks and their cosmological evolution. These can be thought of as hybrid networks comprised of (nontopological) string segments, whose core structure is similar to that of Abelian Higgs vortices, and whose ends have long-range interactions and behavior similar to that of global monopoles. Our study provides further evidence of a linear scaling regime, already reported in previous studies, for the typical length scale and velocity of the network. We introduce a new algorithm to identify the position of the segment cores. This allows us to determine the length and velocity of each individual segment and follow their evolution in time. We study the statistical distribution of segment lengths and velocities for radiation- and matter-dominated evolution in the regime where the strings are stable. Our segment detection algorithm gives higher length values than previous studies based on indirect detection methods. The statistical distribution shows no evidence of (anti)correlation between the speed and the length of the segments.

Modular co-evolution of metabolic networks

Directory of Open Access Journals (Sweden)

Yu Zhong-Hao

2007-08-01

Full Text Available Abstract Background The architecture of biological networks has been reported to exhibit high level of modularity, and to some extent, topological modules of networks overlap with known functional modules. However, how the modular topology of the molecular network affects the evolution of its member proteins remains unclear. Results In this work, the functional and evolutionary modularity of Homo sapiens (H. sapiens metabolic network were investigated from a topological point of view. Network decomposition shows that the metabolic network is organized in a highly modular core-periphery way, in which the core modules are tightly linked together and perform basic metabolism functions, whereas the periphery modules only interact with few modules and accomplish relatively independent and specialized functions. Moreover, over half of the modules exhibit co-evolutionary feature and belong to specific evolutionary ages. Peripheral modules tend to evolve more cohesively and faster than core modules do. Conclusion The correlation between functional, evolutionary and topological modularity suggests that the evolutionary history and functional requirements of metabolic systems have been imprinted in the architecture of metabolic networks. Such systems level analysis could demonstrate how the evolution of genes may be placed in a genome-scale network context, giving a novel perspective on molecular evolution.

Energy Efficient Evolution of Mobile Networks

DEFF Research Database (Denmark)

Micallef, Gilbert; Mogensen, Preben

2011-01-01

options for how to evolve their networks, allowing them to carry the expected increase in traffic. The best solution is generally selected based on two main criteria, performance and cost. However, pushed by a variety of environmental and energy challenges, MNOs are now also showing interest...... in understanding the impact that different options can have on the energy consumption of their networks. This paper investigates the possible energy gains of evolving a mobile network through a joint pico deployment and macro upgrade solution over a period of 8 years. Besides the network energy consumption, energy...... efficiency in Mbps/kWh is also analyzed. Furthermore, a cost analysis is carried out, to give a more complete picture of the different options being considered. Focusing on the last year of the evolution analysis, results show that deploying more pico sites reduces the energy consumption of the network...

An Overview on Wireless Sensor Networks Technology and Evolution

Directory of Open Access Journals (Sweden)

Chiara Buratti

2009-08-01

Full Text Available Wireless sensor networks (WSNs enable new applications and require non-conventional paradigms for protocol design due to several constraints. Owing to the requirement for low device complexity together with low energy consumption (i.e., long network lifetime, a proper balance between communication and signal/data processing capabilities must be found. This motivates a huge effort in research activities, standardization process, and industrial investments on this field since the last decade. This survey paper aims at reporting an overview of WSNs technologies, main applications and standards, features in WSNs design, and evolutions. In particular, some peculiar applications, such as those based on environmental monitoring, are discussed and design strategies highlighted; a case study based on a real implementation is also reported. Trends and possible evolutions are traced. Emphasis is given to the IEEE 802.15.4 technology, which enables many applications of WSNs. Some example of performance characteristics of 802.15.4-based networks are shown and discussed as a function of the size of the WSN and the data type to be exchanged among nodes.

Evolution of a protein domain interaction network

International Nuclear Information System (INIS)

Li-Feng, Gao; Jian-Jun, Shi; Shan, Guan

2010-01-01

In this paper, we attempt to understand complex network evolution from the underlying evolutionary relationship between biological organisms. Firstly, we construct a Pfam domain interaction network for each of the 470 completely sequenced organisms, and therefore each organism is correlated with a specific Pfam domain interaction network; secondly, we infer the evolutionary relationship of these organisms with the nearest neighbour joining method; thirdly, we use the evolutionary relationship between organisms constructed in the second step as the evolutionary course of the Pfam domain interaction network constructed in the first step. This analysis of the evolutionary course shows: (i) there is a conserved sub-network structure in network evolution; in this sub-network, nodes with lower degree prefer to maintain their connectivity invariant, and hubs tend to maintain their role as a hub is attached preferentially to new added nodes; (ii) few nodes are conserved as hubs; most of the other nodes are conserved as one with very low degree; (iii) in the course of network evolution, new nodes are added to the network either individually in most cases or as clusters with relative high clustering coefficients in a very few cases. (general)

Evolution of Cooperation in Adaptive Social Networks

Science.gov (United States)

Segbroeck, Sven Van; Santos, Francisco C.; Traulsen, Arne; Lenaerts, Tom; Pacheco, Jorge M.

Humans are organized in societies, a phenomenon that would never have been possible without the evolution of cooperative behavior. Several mechanisms that foster this evolution have been unraveled over the years, with population structure as a prominent promoter of cooperation. Modern networks of exchange and cooperation are, however, becoming increasingly volatile, and less and less based on long-term stable structure. Here, we address how this change of paradigm aspects the evolution of cooperation. We discuss analytical and numerical models in which individuals can break social ties and create new ones. Interactions are modeled as two-player dilemmas of cooperation. Once a link between two individuals has formed, the productivity of this link is evaluated. Links can be broken off at different rates. This individual capacity of forming new links or severing inconvenient ones can effectively change the nature of the game. We address random formation of new links and local linking rules as well as different individual capacities to maintain social interactions. We conclude by discussing how adaptive social networks can become an important step towards more realistic models of cultural dynamics.

Evolution of a large online social network

International Nuclear Information System (INIS)

Hu Haibo; Wang Xiaofan

2009-01-01

Although recently there are extensive research on the collaborative networks and online communities, there is very limited knowledge about the actual evolution of the online social networks (OSN). In the Letter, we study the structural evolution of a large online virtual community. We find that the scale growth of the OSN shows non-trivial S shape which may provide a proper exemplification for Bass diffusion model. We reveal that the evolutions of many network properties, such as density, clustering, heterogeneity and modularity, show non-monotone feature, and shrink phenomenon occurs for the path length and diameter of the network. Furthermore, the OSN underwent a transition from degree assortativity characteristic of collaborative networks to degree disassortativity characteristic of many OSNs. Our study has revealed the evolutionary pattern of interpersonal interactions in a specific population and provided a valuable platform for theoretical modeling and further analysis

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.

Evolution of hybrid defect networks

International Nuclear Information System (INIS)

Martins, C. J. A. P.

2009-01-01

We apply a recently developed analytic model for the evolution of monopole networks to the case of monopoles attached to one string, usually known as hybrid networks. We discuss scaling solutions for both local and global hybrid networks, and also find an interesting application for the case of vortons. Our quantitative results agree with previous estimates in indicating that the hybrid networks will usually annihilate soon after the string-forming phase transition. However, we also show that in some specific circumstances these networks can survive considerably more than a Hubble time.

Modeling Temporal Evolution and Multiscale Structure in Networks

DEFF Research Database (Denmark)

Herlau, Tue; Mørup, Morten; Schmidt, Mikkel Nørgaard

2013-01-01

Many real-world networks exhibit both temporal evolution and multiscale structure. We propose a model for temporally correlated multifurcating hierarchies in complex networks which jointly capture both effects. We use the Gibbs fragmentation tree as prior over multifurcating trees and a change......-point model to account for the temporal evolution of each vertex. We demonstrate that our model is able to infer time-varying multiscale structure in synthetic as well as three real world time-evolving complex networks. Our modeling of the temporal evolution of hierarchies brings new insights...

Complex networks-based energy-efficient evolution model for wireless sensor networks

Energy Technology Data Exchange (ETDEWEB)

Zhu Hailin [Beijing Key Laboratory of Intelligent Telecommunications Software and Multimedia, Beijing University of Posts and Telecommunications, P.O. Box 106, Beijing 100876 (China)], E-mail: zhuhailin19@gmail.com; Luo Hong [Beijing Key Laboratory of Intelligent Telecommunications Software and Multimedia, Beijing University of Posts and Telecommunications, P.O. Box 106, Beijing 100876 (China); Peng Haipeng; Li Lixiang; Luo Qun [Information Secure Center, State Key Laboratory of Networking and Switching Technology, Beijing University of Posts and Telecommunications, P.O. Box 145, Beijing 100876 (China)

2009-08-30

Based on complex networks theory, we present two self-organized energy-efficient models for wireless sensor networks in this paper. The first model constructs the wireless sensor networks according to the connectivity and remaining energy of each sensor node, thus it can produce scale-free networks which have a performance of random error tolerance. In the second model, we not only consider the remaining energy, but also introduce the constraint of links to each node. This model can make the energy consumption of the whole network more balanced. Finally, we present the numerical experiments of the two models.

Complex networks-based energy-efficient evolution model for wireless sensor networks

International Nuclear Information System (INIS)

Zhu Hailin; Luo Hong; Peng Haipeng; Li Lixiang; Luo Qun

2009-01-01

Based on complex networks theory, we present two self-organized energy-efficient models for wireless sensor networks in this paper. The first model constructs the wireless sensor networks according to the connectivity and remaining energy of each sensor node, thus it can produce scale-free networks which have a performance of random error tolerance. In the second model, we not only consider the remaining energy, but also introduce the constraint of links to each node. This model can make the energy consumption of the whole network more balanced. Finally, we present the numerical experiments of the two models.

Evolution of tag-based cooperation with emotion on complex networks

Science.gov (United States)

Lima, F. W. S.

2018-04-01

We study the evolution of the four strategies: Ethnocentric, altruistic, egoistic and cosmopolitan in one community of individuals through Monte Carlo simulations. Interactions and reproduction among computational agents are simulated on undirected Barabási-Albert (UBA) networks and Erdös-Rènyi random graphs (ER).We study the Hammond-Axelrod model on both UBA networks and ER random graphs for the asexual reproduction case. We use a modified version of the traditional Hammond-Axelrod model and we also allow the agents’ decisions about one of the strategies to take into account the emotion among their equals. Our simulations showed that egoism and altruism win, differently from other results found in the literature where ethnocentric strategy is common.

Space evolution model and empirical analysis of an urban public transport network

Science.gov (United States)

Sui, Yi; Shao, Feng-jing; Sun, Ren-cheng; Li, Shu-jing

2012-07-01

This study explores the space evolution of an urban public transport network, using empirical evidence and a simulation model validated on that data. Public transport patterns primarily depend on traffic spatial-distribution, demands of passengers and expected utility of investors. Evolution is an iterative process of satisfying the needs of passengers and investors based on a given traffic spatial-distribution. The temporal change of urban public transport network is evaluated both using topological measures and spatial ones. The simulation model is validated using empirical data from nine big cities in China. Statistical analyses on topological and spatial attributes suggest that an evolution network with traffic demands characterized by power-law numerical values which distribute in a mode of concentric circles tallies well with these nine cities.

Evolution of the social network of scientific collaborations

Science.gov (United States)

Barabási, A. L.; Jeong, H.; Néda, Z.; Ravasz, E.; Schubert, A.; Vicsek, T.

2002-08-01

The co-authorship network of scientists represents a prototype of complex evolving networks. In addition, it offers one of the most extensive database to date on social networks. By mapping the electronic database containing all relevant journals in mathematics and neuro-science for an 8-year period (1991-98), we infer the dynamic and the structural mechanisms that govern the evolution and topology of this complex system. Three complementary approaches allow us to obtain a detailed characterization. First, empirical measurements allow us to uncover the topological measures that characterize the network at a given moment, as well as the time evolution of these quantities. The results indicate that the network is scale-free, and that the network evolution is governed by preferential attachment, affecting both internal and external links. However, in contrast with most model predictions the average degree increases in time, and the node separation decreases. Second, we propose a simple model that captures the network's time evolution. In some limits the model can be solved analytically, predicting a two-regime scaling in agreement with the measurements. Third, numerical simulations are used to uncover the behavior of quantities that could not be predicted analytically. The combined numerical and analytical results underline the important role internal links play in determining the observed scaling behavior and network topology. The results and methodologies developed in the context of the co-authorship network could be useful for a systematic study of other complex evolving networks as well, such as the world wide web, Internet, or other social networks.

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

Science.gov (United States)

Guo, Jin-Li

2014-07-01

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

A random walk evolution model of wireless sensor networks and virus spreading

International Nuclear Information System (INIS)

Wang Ya-Qi; Yang Xiao-Yuan

2013-01-01

In this paper, considering both cluster heads and sensor nodes, we propose a novel evolving a network model based on a random walk to study the fault tolerance decrease of wireless sensor networks (WSNs) due to node failure, and discuss the spreading dynamic behavior of viruses in the evolution model. A theoretical analysis shows that the WSN generated by such an evolution model not only has a strong fault tolerance, but also can dynamically balance the energy loss of the entire network. It is also found that although the increase of the density of cluster heads in the network reduces the network efficiency, it can effectively inhibit the spread of viruses. In addition, the heterogeneity of the network improves the network efficiency and enhances the virus prevalence. We confirm all the theoretical results with sufficient numerical simulations. (general)

Toward Agent-Based Models of the Development And Evolution of Business Relations and Networks

Science.gov (United States)

Wilkinson, Ian F.; Marks, Robert E.; Young, Louise

Firms achieve competitive advantage in part through the development of cooperative relations with other firms and organisations. We describe a program of research designed to map and model the development of cooperative inter-firm relations, including the processes and paths by which firms may evolve from adversarial to more cooperative relations. Narrative-event-history methods will be used to develop stylised histories of the emergence of business relations in various contexts and to identify relevant causal mechanisms to be included in the agent-based models of relationship and network evolution. The relationship histories will provide the means of assuring the agent-based models developed.

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

Energy Technology Data Exchange (ETDEWEB)

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

2013-11-29

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

Structuring evolution: biochemical networks and metabolic diversification in birds.

Science.gov (United States)

Morrison, Erin S; Badyaev, Alexander V

2016-08-25

Recurrence and predictability of evolution are thought to reflect the correspondence between genomic and phenotypic dimensions of organisms, and the connectivity in deterministic networks within these dimensions. Direct examination of the correspondence between opportunities for diversification imbedded in such networks and realized diversity is illuminating, but is empirically challenging because both the deterministic networks and phenotypic diversity are modified in the course of evolution. Here we overcome this problem by directly comparing the structure of a "global" carotenoid network - comprising of all known enzymatic reactions among naturally occurring carotenoids - with the patterns of evolutionary diversification in carotenoid-producing metabolic networks utilized by birds. We found that phenotypic diversification in carotenoid networks across 250 species was closely associated with enzymatic connectivity of the underlying biochemical network - compounds with greater connectivity occurred the most frequently across species and were the hotspots of metabolic pathway diversification. In contrast, we found no evidence for diversification along the metabolic pathways, corroborating findings that the utilization of the global carotenoid network was not strongly influenced by history in avian evolution. The finding that the diversification in species-specific carotenoid networks is qualitatively predictable from the connectivity of the underlying enzymatic network points to significant structural determinism in phenotypic evolution.

Energy Efficient Evolution of Mobile Broadband Networks

DEFF Research Database (Denmark)

Micallef, Gilbert

to public commitments for reducing their energy and carbon footprint. In 2008 Vodafone stated that by the year 2020, efforts for reducing emissions are expected to halve emissions registered in the year 2006/7. In addition to presenting a more environmentally conscious brand, this is also hoped to reduce...... for mobile network operators to upgrade existing infrastructure different options are available. Irrespective of the selected option, capacity upgrades are bound to increase the power consumption of the network. Carried through case studies, a first analysis compares a number of network evolution strategies......, determining which provides the necessary performance while limiting the increase in power consumption. Overall, it is noted that a hybrid solution involving the upgrade of existing macro base station sites together with the deployment of outdoor or indoor small cells (heterogeneous network) provide the best...

Evolution of weighted complex bus transit networks with flow

Science.gov (United States)

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

2016-02-01

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

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

International Nuclear Information System (INIS)

Guo Jin-Li

2014-01-01

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

Measuring microscopic evolution processes of complex networks based on empirical data

International Nuclear Information System (INIS)

Chi, Liping

2015-01-01

Aiming at understanding the microscopic mechanism of complex systems in real world, we perform the measurement that characterizes the evolution properties on two empirical data sets. In the Autonomous Systems Internet data, the network size keeps growing although the system suffers a high rate of node deletion (r = 0.4) and link deletion (q = 0.81). However, the average degree keeps almost unchanged during the whole time range. At each time step the external links attached to a new node are about c = 1.1 and the internal links added between existing nodes are approximately m = 8. For the Scientific Collaboration data, it is a cumulated result of all the authors from 1893 up to the considered year. There is no deletion of nodes and links, r = q = 0. The external and internal links at each time step are c = 1.04 and m = 0, correspondingly. The exponents of degree distribution p(k) ∼ k -γ of these two empirical datasets γ data are in good agreement with that obtained theoretically γ theory . The results indicate that these evolution quantities may provide an insight into capturing the microscopic dynamical processes that govern the network topology. (paper)

Cooperative behavior evolution of small groups on interconnected networks

International Nuclear Information System (INIS)

Huang, Keke; Cheng, Yuan; Zheng, Xiaoping; Yang, Yeqing

2015-01-01

Highlights: • Small groups are modeled on interconnected networks. • Players face different dilemmas inside and outside small groups. • Impact of the ratio and strength of link on the behavioral evolution are studied. - Abstract: Understanding the behavioral evolution in evacuation is significant for guiding and controlling the evacuation process. Based on the fact that the population consists of many small groups, here we model the small groups which are separated in space but linked by other methods, such as kinship, on interconnected networks. Namely, the players in the same layer belong to an identical small group, while the players located in different layers belong to different small groups. And the players of different layers establish interaction by edge crossed layers. In addition, players face different dilemmas inside and outside small groups, in detail, the players in the same layer play prisoner’s dilemma, but players in different layers play harmony game. By means of numerous simulations, we study the impact of the ratio and strength of link on the behavioral evolution. Because the framework of this work takes the space distribution into account, which is close to the realistic life, we hope that it can provide a new insight to reveal the law of behavioral evolution of evacuation population.

A novel Random Walk algorithm with Compulsive Evolution for heat exchanger network synthesis

International Nuclear Information System (INIS)

Xiao, Yuan; Cui, Guomin

2017-01-01

Highlights: • A novel Random Walk Algorithm with Compulsive Evolution is proposed for HENS. • A simple and feasible evolution strategy is presented in RWCE algorithm. • The integer and continuous variables of HEN are optimized simultaneously in RWCE. • RWCE is demonstrated a relatively strong global search ability in HEN optimization. - Abstract: The heat exchanger network (HEN) synthesis can be characterized as highly combinatorial, nonlinear and nonconvex, contributing to unmanageable computational time and a challenge in identifying the global optimal network design. Stochastic methods are robust and show a powerful global optimizing ability. Based on the common characteristic of different stochastic methods, namely randomness, a novel Random Walk algorithm with Compulsive Evolution (RWCE) is proposed to achieve the best possible total annual cost of heat exchanger network with the relatively simple and feasible evolution strategy. A population of heat exchanger networks is first randomly initialized. Next, the heat load of heat exchanger for each individual is randomly expanded or contracted in order to optimize both the integer and continuous variables simultaneously and to obtain the lowest total annual cost. Besides, when individuals approach to local optima, there is a certain probability for them to compulsively accept the imperfect networks in order to keep the population diversity and ability of global optimization. The presented method is then applied to heat exchanger network synthesis cases from the literature to compare the best results published. RWCE consistently has a lower computed total annual cost compared to previously published results.

Topology evolution in macromolecular networks

NARCIS (Netherlands)

Kryven, I.

2014-01-01

Governed by various intermolecular forces, molecular networks tend to evolve from simple to very complex formations that have random structure. This randomness in the connectivity of the basic units can still be captured employing distributional description of the state of the system; the evolution

Network analysis of metabolic enzyme evolution in Escherichia coli

Directory of Open Access Journals (Sweden)

Kraulis Per

2004-02-01

Full Text Available Abstract Background The two most common models for the evolution of metabolism are the patchwork evolution model, where enzymes are thought to diverge from broad to narrow substrate specificity, and the retrograde evolution model, according to which enzymes evolve in response to substrate depletion. Analysis of the distribution of homologous enzyme pairs in the metabolic network can shed light on the respective importance of the two models. We here investigate the evolution of the metabolism in E. coli viewed as a single network using EcoCyc. Results Sequence comparison between all enzyme pairs was performed and the minimal path length (MPL between all enzyme pairs was determined. We find a strong over-representation of homologous enzymes at MPL 1. We show that the functionally similar and functionally undetermined enzyme pairs are responsible for most of the over-representation of homologous enzyme pairs at MPL 1. Conclusions The retrograde evolution model predicts that homologous enzymes pairs are at short metabolic distances from each other. In general agreement with previous studies we find that homologous enzymes occur close to each other in the network more often than expected by chance, which lends some support to the retrograde evolution model. However, we show that the homologous enzyme pairs which may have evolved through retrograde evolution, namely the pairs that are functionally dissimilar, show a weaker over-representation at MPL 1 than the functionally similar enzyme pairs. Our study indicates that, while the retrograde evolution model may have played a small part, the patchwork evolution model is the predominant process of metabolic enzyme evolution.

Semigroup methods for evolution equations on networks

CERN Document Server

Mugnolo, Delio

2014-01-01

This concise text is based on a series of lectures held only a few years ago and originally intended as an introduction to known results on linear hyperbolic and parabolic equations.  Yet the topic of differential equations on graphs, ramified spaces, and more general network-like objects has recently gained significant momentum and, well beyond the confines of mathematics, there is a lively interdisciplinary discourse on all aspects of so-called complex networks. Such network-like structures can be found in virtually all branches of science, engineering and the humanities, and future research thus calls for solid theoretical foundations.      This book is specifically devoted to the study of evolution equations – i.e., of time-dependent differential equations such as the heat equation, the wave equation, or the Schrödinger equation (quantum graphs) – bearing in mind that the majority of the literature in the last ten years on the subject of differential equations of graphs has been devoted to ellip...

A Bayesian approach to the evolution of metabolic networks on a phylogeny.

Directory of Open Access Journals (Sweden)

Aziz Mithani

2010-08-01

Full Text Available The availability of genomes of many closely related bacteria with diverse metabolic capabilities offers the possibility of tracing metabolic evolution on a phylogeny relating the genomes to understand the evolutionary processes and constraints that affect the evolution of metabolic networks. Using simple (independent loss/gain of reactions or complex (incorporating dependencies among reactions stochastic models of metabolic evolution, it is possible to study how metabolic networks evolve over time. Here, we describe a model that takes the reaction neighborhood into account when modeling metabolic evolution. The model also allows estimation of the strength of the neighborhood effect during the course of evolution. We present Gibbs samplers for sampling networks at the internal node of a phylogeny and for estimating the parameters of evolution over a phylogeny without exploring the whole search space by iteratively sampling from the conditional distributions of the internal networks and parameters. The samplers are used to estimate the parameters of evolution of metabolic networks of bacteria in the genus Pseudomonas and to infer the metabolic networks of the ancestral pseudomonads. The results suggest that pathway maps that are conserved across the Pseudomonas phylogeny have a stronger neighborhood structure than those which have a variable distribution of reactions across the phylogeny, and that some Pseudomonas lineages are going through genome reduction resulting in the loss of a number of reactions from their metabolic networks.

Convergent evolution of gene networks by single-gene duplications in higher eukaryotes.

Science.gov (United States)

Amoutzias, Gregory D; Robertson, David L; Oliver, Stephen G; Bornberg-Bauer, Erich

2004-03-01

By combining phylogenetic, proteomic and structural information, we have elucidated the evolutionary driving forces for the gene-regulatory interaction networks of basic helix-loop-helix transcription factors. We infer that recurrent events of single-gene duplication and domain rearrangement repeatedly gave rise to distinct networks with almost identical hub-based topologies, and multiple activators and repressors. We thus provide the first empirical evidence for scale-free protein networks emerging through single-gene duplications, the dominant importance of molecular modularity in the bottom-up construction of complex biological entities, and the convergent evolution of networks.

Social network analysis community detection and evolution

CERN Document Server

Missaoui, Rokia

2015-01-01

This book is devoted to recent progress in social network analysis with a high focus on community detection and evolution. The eleven chapters cover the identification of cohesive groups, core components and key players either in static or dynamic networks of different kinds and levels of heterogeneity. Other important topics in social network analysis such as influential detection and maximization, information propagation, user behavior analysis, as well as network modeling and visualization are also presented. Many studies are validated through real social networks such as Twitter. This edit

Structural Approaches to Sequence Evolution Molecules, Networks, Populations

CERN Document Server

Bastolla, Ugo; Roman, H. Eduardo; Vendruscolo, Michele

2007-01-01

Structural requirements constrain the evolution of biological entities at all levels, from macromolecules to their networks, right up to populations of biological organisms. Classical models of molecular evolution, however, are focused at the level of the symbols - the biological sequence - rather than that of their resulting structure. Now recent advances in understanding the thermodynamics of macromolecules, the topological properties of gene networks, the organization and mutation capabilities of genomes, and the structure of populations make it possible to incorporate these key elements into a broader and deeply interdisciplinary view of molecular evolution. This book gives an account of such a new approach, through clear tutorial contributions by leading scientists specializing in the different fields involved.

A Multilevel Network Study of the Effects of Delinquent Behavior on Friendship Evolution

NARCIS (Netherlands)

Snijders, T.A.B.; Baerveldt, Chris

2003-01-01

A multilevel approach is proposed to the study of the evolution of multiple networks. In this approach, the basic evolution process is assumed to be the same, while parameter values may differ between different networks. For the network evolution process, stochastic actor-oriented models are used,

PageRank versatility analysis of multilayer modality-based network for exploring the evolution of oil-water slug flow.

Science.gov (United States)

Gao, Zhong-Ke; Dang, Wei-Dong; Li, Shan; Yang, Yu-Xuan; Wang, Hong-Tao; Sheng, Jing-Ran; Wang, Xiao-Fan

2017-07-14

Numerous irregular flow structures exist in the complicated multiphase flow and result in lots of disparate spatial dynamical flow behaviors. The vertical oil-water slug flow continually attracts plenty of research interests on account of its significant importance. Based on the spatial transient flow information acquired through our designed double-layer distributed-sector conductance sensor, we construct multilayer modality-based network to encode the intricate spatial flow behavior. Particularly, we calculate the PageRank versatility and multilayer weighted clustering coefficient to quantitatively explore the inferred multilayer modality-based networks. Our analysis allows characterizing the complicated evolution of oil-water slug flow, from the opening formation of oil slugs, to the succedent inter-collision and coalescence among oil slugs, and then to the dispersed oil bubbles. These properties render our developed method particularly powerful for mining the essential flow features from the multilayer sensor measurements.

The evolution of cooperation on geographical networks

Science.gov (United States)

Li, Yixiao; Wang, Yi; Sheng, Jichuan

2017-11-01

We study evolutionary public goods game on geographical networks, i.e., complex networks which are located on a geographical plane. The geographical feature effects in two ways: In one way, the geographically-induced network structure influences the overall evolutionary dynamics, and, in the other way, the geographical length of an edge influences the cost when the two players at the two ends interact. For the latter effect, we design a new cost function of cooperators, which simply assumes that the longer the distance between two players, the higher cost the cooperator(s) of them have to pay. In this study, network substrates are generated by a previous spatial network model with a cost-benefit parameter controlling the network topology. Our simulations show that the greatest promotion of cooperation is achieved in the intermediate regime of the parameter, in which empirical estimates of various railway networks fall. Further, we investigate how the distribution of edges' geographical costs influences the evolutionary dynamics and consider three patterns of the distribution: an approximately-equal distribution, a diverse distribution, and a polarized distribution. For normal geographical networks which are generated using intermediate values of the cost-benefit parameter, a diverse distribution hinders the evolution of cooperation, whereas a polarized distribution lowers the threshold value of the amplification factor for cooperation in public goods game. These results are helpful for understanding the evolution of cooperation on real-world geographical networks.

Network evolution: rewiring and signatures of conservation in signaling.

Directory of Open Access Journals (Sweden)

Mark G F Sun

Full Text Available The analysis of network evolution has been hampered by limited availability of protein interaction data for different organisms. In this study, we investigate evolutionary mechanisms in Src Homology 3 (SH3 domain and kinase interaction networks using high-resolution specificity profiles. We constructed and examined networks for 23 fungal species ranging from Saccharomyces cerevisiae to Schizosaccharomyces pombe. We quantify rates of different rewiring mechanisms and show that interaction change through binding site evolution is faster than through gene gain or loss. We found that SH3 interactions evolve swiftly, at rates similar to those found in phosphoregulation evolution. Importantly, we show that interaction changes are sufficiently rapid to exhibit saturation phenomena at the observed timescales. Finally, focusing on the SH3 interaction network, we observe extensive clustering of binding sites on target proteins by SH3 domains and a strong correlation between the number of domains that bind a target protein (target in-degree and interaction conservation. The relationship between in-degree and interaction conservation is driven by two different effects, namely the number of clusters that correspond to interaction interfaces and the number of domains that bind to each cluster leads to sequence specific conservation, which in turn results in interaction conservation. In summary, we uncover several network evolution mechanisms likely to generalize across peptide recognition modules.

Evolution of students’ friendship networks: Examining the influence of group size

Directory of Open Access Journals (Sweden)

Valentina Sokolovska

2017-01-01

Full Text Available  The main aim of this study was to examine the effect of the network size on formation and evolution of students’ friendship relations. Data was collected from two groups of sociology freshmen: a group from the University of Belgrade, which represents a larger group, and a group from the University of Novi Sad, which represents a smaller group. The data was collected in three periods of one academic year. We analyzed the structural features of students’ networks and constructed a stochastic model of network evolution in order to explore how friendships form and change during one year. The results showed that structural features of the larger and the smaller group differ in each stage of friendship formation. At the beginning of group forming, small world structure was noticeable in the larger group, although full small world structure was not confirmed in both groups. Furthermore, transitivity of triads had effect on the evolution of the larger network, while balance or structural equivalence had effect on the evolution of the smaller network. Results of the structural analysis are in line with findings of the network evolution model and together they provide an insight into how friendship evolves in groups of different sizes.

Optimizing Transmission Network Expansion Planning With The Mean Of Chaotic Differential Evolution Algorithm

Directory of Open Access Journals (Sweden)

Ahmed R. Abdelaziz

2015-08-01

Full Text Available This paper presents an application of Chaotic differential evolution optimization approach meta-heuristics in solving transmission network expansion planning TNEP using an AC model associated with reactive power planning RPP. The reliabilityredundancy of network analysis optimization problems implicate selection of components with multiple choices and redundancy levels that produce maximum benefits can be subject to the cost weight and volume constraints is presented in this paper. Classical mathematical methods have failed in handling non-convexities and non-smoothness in optimization problems. As an alternative to the classical optimization approaches the meta-heuristics have attracted lot of attention due to their ability to find an almost global optimal solution in reliabilityredundancy optimization problems. Evolutionary algorithms EAs paradigms of evolutionary computation field are stochastic and robust meta-heuristics useful to solve reliabilityredundancy optimization problems. EAs such as genetic algorithm evolutionary programming evolution strategies and differential evolution are being used to find global or near global optimal solution. The Differential Evolution Algorithm DEA population-based algorithm is an optimal algorithm with powerful global searching capability but it is usually in low convergence speed and presents bad searching capability in the later evolution stage. A new Chaotic Differential Evolution algorithm CDE based on the cat map is recommended which combines DE and chaotic searching algorithm. Simulation results and comparisons show that the chaotic differential evolution algorithm using Cat map is competitive and stable in performance with other optimization approaches and other maps.

Limited Influence of Oxygen on the Evolution of Chemical Diversity in Metabolic Networks

Directory of Open Access Journals (Sweden)

Kazuhiro Takemoto

2013-10-01

Full Text Available Oxygen is thought to promote species and biomolecule diversity. Previous studies have suggested that oxygen expands metabolic networks by acquiring metabolites with different chemical properties (higher hydrophobicity, for example. However, such conclusions are typically based on biased evaluation, and are therefore non-conclusive. Thus, we re-investigated the effect of oxygen on metabolic evolution using a phylogenetic comparative method and metadata analysis to reduce the bias as much as possible. Notably, we found no difference in metabolic network expansion between aerobes and anaerobes when evaluating phylogenetic relationships. Furthermore, we showed that previous studies have overestimated or underestimated the degrees of differences in the chemical properties (e.g., hydrophobicity between oxic and anoxic metabolites in metabolic networks of unicellular organisms; however, such overestimation was not observed when considering the metabolic networks of multicellular organisms. These findings indicate that the contribution of oxygen to increased chemical diversity in metabolic networks is lower than previously thought; rather, phylogenetic signals and cell-cell communication result in increased chemical diversity. However, this conclusion does not contradict the effect of oxygen on metabolic evolution; instead, it provides a deeper understanding of how oxygen contributes to metabolic evolution despite several limitations in data analysis methods.

Evolution of individual versus social learning on social networks.

Science.gov (United States)

Tamura, Kohei; Kobayashi, Yutaka; Ihara, Yasuo

2015-03-06

A number of studies have investigated the roles played by individual and social learning in cultural phenomena and the relative advantages of the two learning strategies in variable environments. Because social learning involves the acquisition of behaviours from others, its utility depends on the availability of 'cultural models' exhibiting adaptive behaviours. This indicates that social networks play an essential role in the evolution of learning. However, possible effects of social structure on the evolution of learning have not been fully explored. Here, we develop a mathematical model to explore the evolutionary dynamics of learning strategies on social networks. We first derive the condition under which social learners (SLs) are selectively favoured over individual learners in a broad range of social network. We then obtain an analytical approximation of the long-term average frequency of SLs in homogeneous networks, from which we specify the condition, in terms of three relatedness measures, for social structure to facilitate the long-term evolution of social learning. Finally, we evaluate our approximation by Monte Carlo simulations in complete graphs, regular random graphs and scale-free networks. We formally show that whether social structure favours the evolution of social learning is determined by the relative magnitudes of two effects of social structure: localization in competition, by which competition between learning strategies is evaded, and localization in cultural transmission, which slows down the spread of adaptive traits. In addition, our estimates of the relatedness measures suggest that social structure disfavours the evolution of social learning when selection is weak. © 2015 The Author(s) Published by the Royal Society. All rights reserved.

Evolution properties of the community members for dynamic networks

Science.gov (United States)

Yang, Kai; Guo, Qiang; Li, Sheng-Nan; Han, Jing-Ti; Liu, Jian-Guo

2017-03-01

The collective behaviors of community members for dynamic social networks are significant for understanding evolution features of communities. In this Letter, we empirically investigate the evolution properties of the new community members for dynamic networks. Firstly, we separate data sets into different slices, and analyze the statistical properties of new members as well as communities they joined in for these data sets. Then we introduce a parameter φ to describe community evolution between different slices and investigate the dynamic community properties of the new community members. The empirical analyses for the Facebook, APS, Enron and Wiki data sets indicate that both the number of new members and joint communities increase, the ratio declines rapidly and then becomes stable over time, and most of the new members will join in the small size communities that is s ≤ 10. Furthermore, the proportion of new members in existed communities decreases firstly and then becomes stable and relatively small for these data sets. Our work may be helpful for deeply understanding the evolution properties of community members for social networks.

Convergent evolution of modularity in metabolic networks through different community structures

Directory of Open Access Journals (Sweden)

Zhou Wanding

2012-09-01

Full Text Available Abstract Background It has been reported that the modularity of metabolic networks of bacteria is closely related to the variability of their living habitats. However, given the dependency of the modularity score on the community structure, it remains unknown whether organisms achieve certain modularity via similar or different community structures. Results In this work, we studied the relationship between similarities in modularity scores and similarities in community structures of the metabolic networks of 1021 species. Both similarities are then compared against the genetic distances. We revisited the association between modularity and variability of the microbial living environments and extended the analysis to other aspects of their life style such as temperature and oxygen requirements. We also tested both topological and biological intuition of the community structures identified and investigated the extent of their conservation with respect to the taxomony. Conclusions We find that similar modularities are realized by different community structures. We find that such convergent evolution of modularity is closely associated with the number of (distinct enzymes in the organism’s metabolome, a consequence of different life styles of the species. We find that the order of modularity is the same as the order of the number of the enzymes under the classification based on the temperature preference but not on the oxygen requirement. Besides, inspection of modularity-based communities reveals that these communities are graph-theoretically meaningful yet not reflective of specific biological functions. From an evolutionary perspective, we find that the community structures are conserved only at the level of kingdoms. Our results call for more investigation into the interplay between evolution and modularity: how evolution shapes modularity, and how modularity affects evolution (mainly in terms of fitness and evolvability. Further, our results

Convergent evolution of modularity in metabolic networks through different community structures.

Science.gov (United States)

Zhou, Wanding; Nakhleh, Luay

2012-09-14

It has been reported that the modularity of metabolic networks of bacteria is closely related to the variability of their living habitats. However, given the dependency of the modularity score on the community structure, it remains unknown whether organisms achieve certain modularity via similar or different community structures. In this work, we studied the relationship between similarities in modularity scores and similarities in community structures of the metabolic networks of 1021 species. Both similarities are then compared against the genetic distances. We revisited the association between modularity and variability of the microbial living environments and extended the analysis to other aspects of their life style such as temperature and oxygen requirements. We also tested both topological and biological intuition of the community structures identified and investigated the extent of their conservation with respect to the taxonomy. We find that similar modularities are realized by different community structures. We find that such convergent evolution of modularity is closely associated with the number of (distinct) enzymes in the organism's metabolome, a consequence of different life styles of the species. We find that the order of modularity is the same as the order of the number of the enzymes under the classification based on the temperature preference but not on the oxygen requirement. Besides, inspection of modularity-based communities reveals that these communities are graph-theoretically meaningful yet not reflective of specific biological functions. From an evolutionary perspective, we find that the community structures are conserved only at the level of kingdoms. Our results call for more investigation into the interplay between evolution and modularity: how evolution shapes modularity, and how modularity affects evolution (mainly in terms of fitness and evolvability). Further, our results call for exploring new measures of modularity and network

Large-scale transportation network congestion evolution prediction using deep learning theory.

Science.gov (United States)

Ma, Xiaolei; Yu, Haiyang; Wang, Yunpeng; Wang, Yinhai

2015-01-01

Understanding how congestion at one location can cause ripples throughout large-scale transportation network is vital for transportation researchers and practitioners to pinpoint traffic bottlenecks for congestion mitigation. Traditional studies rely on either mathematical equations or simulation techniques to model traffic congestion dynamics. However, most of the approaches have limitations, largely due to unrealistic assumptions and cumbersome parameter calibration process. With the development of Intelligent Transportation Systems (ITS) and Internet of Things (IoT), transportation data become more and more ubiquitous. This triggers a series of data-driven research to investigate transportation phenomena. Among them, deep learning theory is considered one of the most promising techniques to tackle tremendous high-dimensional data. This study attempts to extend deep learning theory into large-scale transportation network analysis. A deep Restricted Boltzmann Machine and Recurrent Neural Network architecture is utilized to model and predict traffic congestion evolution based on Global Positioning System (GPS) data from taxi. A numerical study in Ningbo, China is conducted to validate the effectiveness and efficiency of the proposed method. Results show that the prediction accuracy can achieve as high as 88% within less than 6 minutes when the model is implemented in a Graphic Processing Unit (GPU)-based parallel computing environment. The predicted congestion evolution patterns can be visualized temporally and spatially through a map-based platform to identify the vulnerable links for proactive congestion mitigation.

Moran-evolution of cooperation: From well-mixed to heterogeneous complex networks

Science.gov (United States)

Sarkar, Bijan

2018-05-01

Configurational arrangement of network architecture and interaction character of individuals are two most influential factors on the mechanisms underlying the evolutionary outcome of cooperation, which is explained by the well-established framework of evolutionary game theory. In the current study, not only qualitatively but also quantitatively, we measure Moran-evolution of cooperation to support an analytical agreement based on the consequences of the replicator equation in a finite population. The validity of the measurement has been double-checked in the well-mixed network by the Langevin stochastic differential equation and the Gillespie-algorithmic version of Moran-evolution, while in a structured network, the measurement of accuracy is verified by the standard numerical simulation. Considering the Birth-Death and Death-Birth updating rules through diffusion of individuals, the investigation is carried out in the wide range of game environments those relate to the various social dilemmas where we are able to draw a new rigorous mathematical track to tackle the heterogeneity of complex networks. The set of modified criteria reveals the exact fact about the emergence and maintenance of cooperation in the structured population. We find that in general, nature promotes the environment of coexistent traits.

Evolution of regulatory networks towards adaptability and stability in a changing environment

Science.gov (United States)

Lee, Deok-Sun

2014-11-01

Diverse biological networks exhibit universal features distinguished from those of random networks, calling much attention to their origins and implications. Here we propose a minimal evolution model of Boolean regulatory networks, which evolve by selectively rewiring links towards enhancing adaptability to a changing environment and stability against dynamical perturbations. We find that sparse and heterogeneous connectivity patterns emerge, which show qualitative agreement with real transcriptional regulatory networks and metabolic networks. The characteristic scaling behavior of stability reflects the balance between robustness and flexibility. The scaling of fluctuation in the perturbation spread shows a dynamic crossover, which is analyzed by investigating separately the stochasticity of internal dynamics and the network structure differences depending on the evolution pathways. Our study delineates how the ambivalent pressure of evolution shapes biological networks, which can be helpful for studying general complex systems interacting with environments.

Earth Regimes Network Evolution Study (ERNESt): Introducing the Space Mobile Network

Science.gov (United States)

Menrad, Bob

2016-01-01

Speaker and Presenter at the Lincoln Laboratory Communications Workshop on April 5, 2016 at the Massachusetts Institute of Technology Lincoln Laboratory in Lexington, MA. A visual presentation titled Earth Regimes Network Evolution Study (ERNESt).

Interworking evolution of mobile satellite and terrestrial networks

Science.gov (United States)

Matyas, R.; Kelleher, P.; Moller, P.; Jones, T.

1993-01-01

There is considerable interest among mobile satellite service providers in interworking with terrestrial networks to provide a universal global network. With such interworking, subscribers may be provided a common set of services such as those planned for the Public Switched Telephone Network (PSTN), the Integrated Services Digital Network (ISDN), and future Intelligent Networks (IN's). This paper first reviews issues in satellite interworking. Next the status and interworking plans of terrestrial mobile communications service providers are examined with early examples of mobile satellite interworking including a discussion of the anticipated evolution towards full interworking between mobile satellite and both fixed and mobile terrestrial networks.

Evolution of Cooperation in Social Dilemmas on Complex Networks

Science.gov (United States)

Iyer, Swami; Killingback, Timothy

2016-01-01

Cooperation in social dilemmas is essential for the functioning of systems at multiple levels of complexity, from the simplest biological organisms to the most sophisticated human societies. Cooperation, although widespread, is fundamentally challenging to explain evolutionarily, since natural selection typically favors selfish behavior which is not socially optimal. Here we study the evolution of cooperation in three exemplars of key social dilemmas, representing the prisoner’s dilemma, hawk-dove and coordination classes of games, in structured populations defined by complex networks. Using individual-based simulations of the games on model and empirical networks, we give a detailed comparative study of the effects of the structural properties of a network, such as its average degree, variance in degree distribution, clustering coefficient, and assortativity coefficient, on the promotion of cooperative behavior in all three classes of games. PMID:26928428

On the Adaptive Design Rules of Biochemical Networks in Evolution

Directory of Open Access Journals (Sweden)

Bor-Sen Chen

2007-01-01

Full Text Available Biochemical networks are the backbones of physiological systems of organisms. Therefore, a biochemical network should be sufficiently robust (not sensitive to tolerate genetic mutations and environmental changes in the evolutionary process. In this study, based on the robustness and sensitivity criteria of biochemical networks, the adaptive design rules are developed for natural selection in the evolutionary process. This will provide insights into the robust adaptive mechanism of biochemical networks in the evolutionary process. We find that if a mutated biochemical network satisfies the robustness and sensitivity criteria of natural selection, there is a high probability for the biochemical network to prevail during natural selection in the evolutionary process. Since there are various mutated biochemical networks that can satisfy these criteria but have some differences in phenotype, the biochemical networks increase their diversities in the evolutionary process. The robustness of a biochemical network enables co-option so that new phenotypes can be generated in evolution. The proposed robust adaptive design rules of natural selection gain much insight into the evolutionary mechanism and provide a systematic robust biochemical circuit design method of biochemical networks for biotechnological and therapeutic purposes in the future.

Identifiability of tree-child phylogenetic networks under a probabilistic recombination-mutation model of evolution.

Science.gov (United States)

Francis, Andrew; Moulton, Vincent

2018-06-07

Phylogenetic networks are an extension of phylogenetic trees which are used to represent evolutionary histories in which reticulation events (such as recombination and hybridization) have occurred. A central question for such networks is that of identifiability, which essentially asks under what circumstances can we reliably identify the phylogenetic network that gave rise to the observed data? Recently, identifiability results have appeared for networks relative to a model of sequence evolution that generalizes the standard Markov models used for phylogenetic trees. However, these results are quite limited in terms of the complexity of the networks that are considered. In this paper, by introducing an alternative probabilistic model for evolution along a network that is based on some ground-breaking work by Thatte for pedigrees, we are able to obtain an identifiability result for a much larger class of phylogenetic networks (essentially the class of so-called tree-child networks). To prove our main theorem, we derive some new results for identifying tree-child networks combinatorially, and then adapt some techniques developed by Thatte for pedigrees to show that our combinatorial results imply identifiability in the probabilistic setting. We hope that the introduction of our new model for networks could lead to new approaches to reliably construct phylogenetic networks. Copyright © 2018 Elsevier Ltd. All rights reserved.

Dynamic Evolution of Financial Network and its Relation to Economic Crises

Science.gov (United States)

Gao, Ya-Chun; Wei, Zong-Wen; Wang, Bing-Hong

2013-02-01

The static topology properties of financial networks have been widely investigated since the work done by Mantegna, yet their dynamic evolution with time is little considered. In this paper, we comprehensively study the dynamic evolution of financial network by a sliding window technique. The vertices and edges of financial network are represented by the stocks from S&P500 components and correlations between pairs of daily returns of price fluctuation, respectively. Furthermore, the duration of stock price fluctuation, spanning from January 4, 1985 to September 14, 2009, makes us to carefully observe the relation between the dynamic topological properties and big financial crashes. The empirical results suggest that the financial network has the robust small-world property when the time evolves, and the topological structure drastically changes when the big financial crashes occur. This correspondence between the dynamic evolution of financial network and big financial crashes may provide a novel view to understand the origin of economic crisis.

Understanding the process of social network evolution: Online-offline integrated analysis of social tie formation.

Science.gov (United States)

Kwak, Doyeon; Kim, Wonjoon

2017-01-01

It is important to consider the interweaving nature of online and offline social networks when we examine social network evolution. However, it is difficult to find any research that examines the process of social tie formation from an integrated perspective. In our study, we quantitatively measure offline interactions and examine the corresponding evolution of online social network in order to understand the significance of interrelationship between online and offline social factors in generating social ties. We analyze the radio signal strength indicator sensor data from a series of social events to understand offline interactions among the participants and measure the structural attributes of their existing online Facebook social networks. By monitoring the changes in their online social networks before and after offline interactions in a series of social events, we verify that the ability to develop an offline interaction into an online friendship is tied to the number of social connections that participants previously had, while the presence of shared mutual friends between a pair of participants disrupts potential new connections within the pre-designed offline social events. Thus, while our integrative approach enables us to confirm the theory of preferential attachment in the process of network formation, the common neighbor theory is not supported. Our dual-dimensional network analysis allows us to observe the actual process of social network evolution rather than to make predictions based on the assumption of self-organizing networks.

Understanding the process of social network evolution: Online-offline integrated analysis of social tie formation.

Directory of Open Access Journals (Sweden)

Doyeon Kwak

Full Text Available It is important to consider the interweaving nature of online and offline social networks when we examine social network evolution. However, it is difficult to find any research that examines the process of social tie formation from an integrated perspective. In our study, we quantitatively measure offline interactions and examine the corresponding evolution of online social network in order to understand the significance of interrelationship between online and offline social factors in generating social ties. We analyze the radio signal strength indicator sensor data from a series of social events to understand offline interactions among the participants and measure the structural attributes of their existing online Facebook social networks. By monitoring the changes in their online social networks before and after offline interactions in a series of social events, we verify that the ability to develop an offline interaction into an online friendship is tied to the number of social connections that participants previously had, while the presence of shared mutual friends between a pair of participants disrupts potential new connections within the pre-designed offline social events. Thus, while our integrative approach enables us to confirm the theory of preferential attachment in the process of network formation, the common neighbor theory is not supported. Our dual-dimensional network analysis allows us to observe the actual process of social network evolution rather than to make predictions based on the assumption of self-organizing networks.

Large-scale transportation network congestion evolution prediction using deep learning theory.

Directory of Open Access Journals (Sweden)

Xiaolei Ma

Full Text Available Understanding how congestion at one location can cause ripples throughout large-scale transportation network is vital for transportation researchers and practitioners to pinpoint traffic bottlenecks for congestion mitigation. Traditional studies rely on either mathematical equations or simulation techniques to model traffic congestion dynamics. However, most of the approaches have limitations, largely due to unrealistic assumptions and cumbersome parameter calibration process. With the development of Intelligent Transportation Systems (ITS and Internet of Things (IoT, transportation data become more and more ubiquitous. This triggers a series of data-driven research to investigate transportation phenomena. Among them, deep learning theory is considered one of the most promising techniques to tackle tremendous high-dimensional data. This study attempts to extend deep learning theory into large-scale transportation network analysis. A deep Restricted Boltzmann Machine and Recurrent Neural Network architecture is utilized to model and predict traffic congestion evolution based on Global Positioning System (GPS data from taxi. A numerical study in Ningbo, China is conducted to validate the effectiveness and efficiency of the proposed method. Results show that the prediction accuracy can achieve as high as 88% within less than 6 minutes when the model is implemented in a Graphic Processing Unit (GPU-based parallel computing environment. The predicted congestion evolution patterns can be visualized temporally and spatially through a map-based platform to identify the vulnerable links for proactive congestion mitigation.

Modeling online social networks based on preferential linking

International Nuclear Information System (INIS)

Hu Hai-Bo; Chen Jun; Guo Jin-Li

2012-01-01

We study the phenomena of preferential linking in a large-scale evolving online social network and find that the linear preference holds for preferential creation, preferential acceptance, and preferential attachment. Based on the linear preference, we propose an analyzable model, which illustrates the mechanism of network growth and reproduces the process of network evolution. Our simulations demonstrate that the degree distribution of the network produced by the model is in good agreement with that of the real network. This work provides a possible bridge between the micro-mechanisms of network growth and the macrostructures of online social networks

Unconventional computing using evolution-in-nanomaterio: neural networks meet nanoparticle networks

NARCIS (Netherlands)

Greff, Klaus; van Damme, Rudolf M.J.; Koutnik, Jan; Broersma, Haitze J.; Mikhal, Julia Olegivna; Lawrence, Celestine Preetham; van der Wiel, Wilfred Gerard; Schmidhuber, Jürgen

2016-01-01

Recently published experimental work on evolution-in-materio applied to nanoscale materials shows promising results for future reconfigurable devices. These experiments were performed on disordered nano-particle networks that have no predefined design. The material has been treated as a blackbox,

Predicting the evolution of social networks with life cycle events

NARCIS (Netherlands)

Sharmeen, F.; Arentze, T.A.; Timmermans, H.J.P.

2015-01-01

This paper presents a model of social network evolution, to predict and simulate changes in social networks induced by lifecycle events. We argue that social networks change with lifecycle events, and we extend a model of friendship selection to incorporate these dynamics of personal social

A study on the evolution of crack networks under thermal fatigue loading

International Nuclear Information System (INIS)

Kamaya, Masayuki; Taheri, Said

2008-01-01

The crack network is a typical cracking morphology caused by thermal fatigue loading. It was pointed out that the crack network appeared under relatively small temperature fluctuations and did not grow deeply. In this study, the mechanism of evolution of crack network and its influence on crack growth was examined by numerical calculation. First, the stress field near two interacting cracks was investigated. It was shown that there are stress-concentration and stress-shielding zones around interacting cracks, and that cracks can form a network under the bi-axial stress condition. Secondly, a Monte Carlo simulation was developed in order to simulate the initiation and growth of cracks under thermal fatigue loading and the evolution of the crack network. The local stress field formed by pre-existing cracks was evaluated by the body force method and its role in the initiation and growth of cracks was considered. The simulation could simulate the evolution of the crack network and change in number of cracks observed in the experiments. It was revealed that reduction in the stress intensity factor due to stress feature in the depth direction under high cycle thermal fatigue loading plays an important role in the evolution of the crack network and that mechanical interaction between cracks in the network affects initiation rather than growth of cracks. The crack network appears only when the crack growth in the depth direction is interrupted. It was concluded that the emergence of the crack network is preferable for the structural integrity of cracked components

Co-evolution of social networks and continuous actor attributes

NARCIS (Netherlands)

Niezink, Nynke M.D.; Snijders, Tom A.B.

2017-01-01

Social networks and the attributes of the actors in these networks are not static; they may develop interdependently over time. The stochastic actor-oriented model allows for statistical inference on the mechanisms driving this co-evolution process. In earlier versions of this model, dynamic actor

Evolving dynamics of trading behavior based on coordination game in complex networks

Science.gov (United States)

Bian, Yue-tang; Xu, Lu; Li, Jin-sheng

2016-05-01

This work concerns the modeling of evolvement of trading behavior in stock markets. Based on the assumption of the investors' limited rationality, the evolution mechanism of trading behavior is modeled according to the investment strategy of coordination game in network, that investors are prone to imitate their neighbors' activity through comprehensive analysis on the risk dominance degree of certain investment behavior, the network topology of their relationship and its heterogeneity. We investigate by mean-field analysis and extensive simulations the evolution of investors' trading behavior in various typical networks under different risk dominance degree of investment behavior. Our results indicate that the evolution of investors' behavior is affected by the network structure of stock market and the effect of risk dominance degree of investment behavior; the stability of equilibrium states of investors' behavior dynamics is directly related with the risk dominance degree of some behavior; connectivity and heterogeneity of the network plays an important role in the evolution of the investment behavior in stock market.

Exploring the evolution of node neighborhoods in Dynamic Networks

Science.gov (United States)

Orman, Günce Keziban; Labatut, Vincent; Naskali, Ahmet Teoman

2017-09-01

Dynamic Networks are a popular way of modeling and studying the behavior of evolving systems. However, their analysis constitutes a relatively recent subfield of Network Science, and the number of available tools is consequently much smaller than for static networks. In this work, we propose a method specifically designed to take advantage of the longitudinal nature of dynamic networks. It characterizes each individual node by studying the evolution of its direct neighborhood, based on the assumption that the way this neighborhood changes reflects the role and position of the node in the whole network. For this purpose, we define the concept of neighborhood event, which corresponds to the various transformations such groups of nodes can undergo, and describe an algorithm for detecting such events. We demonstrate the interest of our method on three real-world networks: DBLP, LastFM and Enron. We apply frequent pattern mining to extract meaningful information from temporal sequences of neighborhood events. This results in the identification of behavioral trends emerging in the whole network, as well as the individual characterization of specific nodes. We also perform a cluster analysis, which reveals that, in all three networks, one can distinguish two types of nodes exhibiting different behaviors: a very small group of active nodes, whose neighborhood undergo diverse and frequent events, and a very large group of stable nodes.

Developmental evolution in social insects: regulatory networks from genes to societies.

Science.gov (United States)

Linksvayer, Timothy A; Fewell, Jennifer H; Gadau, Jürgen; Laubichler, Manfred D

2012-05-01

The evolution and development of complex phenotypes in social insect colonies, such as queen-worker dimorphism or division of labor, can, in our opinion, only be fully understood within an expanded mechanistic framework of Developmental Evolution. Conversely, social insects offer a fertile research area in which fundamental questions of Developmental Evolution can be addressed empirically. We review the concept of gene regulatory networks (GRNs) that aims to fully describe the battery of interacting genomic modules that are differentially expressed during the development of individual organisms. We discuss how distinct types of network models have been used to study different levels of biological organization in social insects, from GRNs to social networks. We propose that these hierarchical networks spanning different organizational levels from genes to societies should be integrated and incorporated into full GRN models to elucidate the evolutionary and developmental mechanisms underlying social insect phenotypes. Finally, we discuss prospects and approaches to achieve such an integration. © 2012 WILEY PERIODICALS, INC.

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

Science.gov (United States)

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

2017-05-01

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

Fitness-driven deactivation in network evolution

International Nuclear Information System (INIS)

Xu, Xin-Jian; Peng, Xiao-Long; Fu, Xin-Chu; Small, Michael

2010-01-01

Individual nodes in evolving real-world networks typically experience growth and decay—that is, the popularity and influence of individuals peaks and then fades. In this paper, we study this phenomenon via an intrinsic nodal fitness function and an intuitive ageing mechanism. Each node of the network is endowed with a fitness which represents its activity. All the nodes have two discrete stages: active and inactive. The evolution of the network combines the addition of new active nodes randomly connected to existing active ones and the deactivation of old active nodes with a possibility inversely proportional to their fitnesses. We obtain a structured exponential network when the fitness distribution of the individuals is homogeneous and a structured scale-free network with heterogeneous fitness distributions. Furthermore, we recover two universal scaling laws of the clustering coefficient for both cases, C(k) ∼ k −1 and C ∼ n −1 , where k and n refer to the node degree and the number of active individuals, respectively. These results offer a new simple description of the growth and ageing of networks where intrinsic features of individual nodes drive their popularity, and hence degree

Functional evolution of new and expanded attention networks in humans.

Science.gov (United States)

Patel, Gaurav H; Yang, Danica; Jamerson, Emery C; Snyder, Lawrence H; Corbetta, Maurizio; Ferrera, Vincent P

2015-07-28

Macaques are often used as a model system for invasive investigations of the neural substrates of cognition. However, 25 million years of evolution separate humans and macaques from their last common ancestor, and this has likely substantially impacted the function of the cortical networks underlying cognitive processes, such as attention. We examined the homology of frontoparietal networks underlying attention by comparing functional MRI data from macaques and humans performing the same visual search task. Although there are broad similarities, we found fundamental differences between the species. First, humans have more dorsal attention network areas than macaques, indicating that in the course of evolution the human attention system has expanded compared with macaques. Second, potentially homologous areas in the dorsal attention network have markedly different biases toward representing the contralateral hemifield, indicating that the underlying neural architecture of these areas may differ in the most basic of properties, such as receptive field distribution. Third, despite clear evidence of the temporoparietal junction node of the ventral attention network in humans as elicited by this visual search task, we did not find functional evidence of a temporoparietal junction in macaques. None of these differences were the result of differences in training, experimental power, or anatomical variability between the two species. The results of this study indicate that macaque data should be applied to human models of cognition cautiously, and demonstrate how evolution may shape cortical networks.

US long distance fiber optic networks: Technology, evolution and advanced concepts. Volume 3: Advanced networks and economics

Science.gov (United States)

1986-10-01

This study projects until 2000 the evolution of long distance fiber optic networks in the U.S. Volume 1 is the executive Summary. Volume 2 focuses on fiber optic components and systems that are directly related to the operation of long-haul networks. Optimistic, pessimistic and most likely scenarios of technology development are presented. The activities of national and regional companies implementing fiber long haul networks are also highlighted, along with an analysis of the market and regulatory forces affecting network evolution. Volume 3 presents advanced fiber optic network concept definitions. Inter-LATA traffic is quantified and forms the basis for the construction of 11-, 15-, 17-, and 23-node networks. Using the technology projections from Volume 2, a financial model identifies cost drivers and determines circuit mile costs between any two LATAs. A comparison of fiber optics with alternative transmission concludes the report.

Constraints and entropy in a model of network evolution

Science.gov (United States)

Tee, Philip; Wakeman, Ian; Parisis, George; Dawes, Jonathan; Kiss, István Z.

2017-11-01

Barabási-Albert's "Scale Free" model is the starting point for much of the accepted theory of the evolution of real world communication networks. Careful comparison of the theory with a wide range of real world networks, however, indicates that the model is in some cases, only a rough approximation to the dynamical evolution of real networks. In particular, the exponent γ of the power law distribution of degree is predicted by the model to be exactly 3, whereas in a number of real world networks it has values between 1.2 and 2.9. In addition, the degree distributions of real networks exhibit cut offs at high node degree, which indicates the existence of maximal node degrees for these networks. In this paper we propose a simple extension to the "Scale Free" model, which offers better agreement with the experimental data. This improvement is satisfying, but the model still does not explain why the attachment probabilities should favor high degree nodes, or indeed how constraints arrive in non-physical networks. Using recent advances in the analysis of the entropy of graphs at the node level we propose a first principles derivation for the "Scale Free" and "constraints" model from thermodynamic principles, and demonstrate that both preferential attachment and constraints could arise as a natural consequence of the second law of thermodynamics.

Evolution of quantum and classical strategies on networks by group interactions

International Nuclear Information System (INIS)

Li Qiang; Chen Minyou; Iqbal, Azhar; Abbott, Derek

2012-01-01

In this paper, quantum strategies are introduced within evolutionary games in order to investigate the evolution of quantum and classical strategies on networks in the public goods game. Comparing the results of evolution on a scale-free network and a square lattice, we find that a quantum strategy outperforms the classical strategies, regardless of the network. Moreover, a quantum strategy dominates the population earlier in group interactions than it does in pairwise interactions. In particular, if the hub node in a scale-free network is occupied by a cooperator initially, the strategy of cooperation will prevail in the population. However, in other situations, a quantum strategy can defeat the classical ones and finally becomes the dominant strategy in the population. (paper)

Social dilemmas in an online social network: The structure and evolution of cooperation

International Nuclear Information System (INIS)

Fu Feng; Chen Xiaojie; Liu Lianghuan; Wang Long

2007-01-01

We investigate two paradigms for studying the evolution of cooperation-Prisoner's Dilemma and Snowdrift game in an online friendship network, obtained from a social networking site. By structural analysis, it is revealed that the empirical social network has small-world and scale-free properties. Besides, it exhibits assortative mixing pattern. Then, we study the evolutionary version of the two types of games on it. It is found that cooperation is substantially promoted with small values of game matrix parameters in both games. Whereas the competent cooperators induced by the underlying network of contacts will be dramatically inhibited with increasing values of the game parameters. Further, we explore the role of assortativity in evolution of cooperation by random edge rewiring. We find that increasing amount of assortativity will to a certain extent diminish the cooperation level. We also show that connected large hubs are capable of maintaining cooperation. The evolution of cooperation on empirical networks is influenced by various network effects in a combined manner, compared with that on model networks. Our results can help understand the cooperative behaviors in human groups and society

Spectral properties of the temporal evolution of brain network structure.

Science.gov (United States)

Wang, Rong; Zhang, Zhen-Zhen; Ma, Jun; Yang, Yong; Lin, Pan; Wu, Ying

2015-12-01

The temporal evolution properties of the brain network are crucial for complex brain processes. In this paper, we investigate the differences in the dynamic brain network during resting and visual stimulation states in a task-positive subnetwork, task-negative subnetwork, and whole-brain network. The dynamic brain network is first constructed from human functional magnetic resonance imaging data based on the sliding window method, and then the eigenvalues corresponding to the network are calculated. We use eigenvalue analysis to analyze the global properties of eigenvalues and the random matrix theory (RMT) method to measure the local properties. For global properties, the shifting of the eigenvalue distribution and the decrease in the largest eigenvalue are linked to visual stimulation in all networks. For local properties, the short-range correlation in eigenvalues as measured by the nearest neighbor spacing distribution is not always sensitive to visual stimulation. However, the long-range correlation in eigenvalues as evaluated by spectral rigidity and number variance not only predicts the universal behavior of the dynamic brain network but also suggests non-consistent changes in different networks. These results demonstrate that the dynamic brain network is more random for the task-positive subnetwork and whole-brain network under visual stimulation but is more regular for the task-negative subnetwork. Our findings provide deeper insight into the importance of spectral properties in the functional brain network, especially the incomparable role of RMT in revealing the intrinsic properties of complex systems.

Evolution of metabolic network organization

Directory of Open Access Journals (Sweden)

Bonchev Danail

2010-05-01

Full Text Available Abstract Background Comparison of metabolic networks across species is a key to understanding how evolutionary pressures shape these networks. By selecting taxa representative of different lineages or lifestyles and using a comprehensive set of descriptors of the structure and complexity of their metabolic networks, one can highlight both qualitative and quantitative differences in the metabolic organization of species subject to distinct evolutionary paths or environmental constraints. Results We used a novel representation of metabolic networks, termed network of interacting pathways or NIP, to focus on the modular, high-level organization of the metabolic capabilities of the cell. Using machine learning techniques we identified the most relevant aspects of cellular organization that change under evolutionary pressures. We considered the transitions from prokarya to eukarya (with a focus on the transitions among the archaea, bacteria and eukarya, from unicellular to multicellular eukarya, from free living to host-associated bacteria, from anaerobic to aerobic, as well as the acquisition of cell motility or growth in an environment of various levels of salinity or temperature. Intuitively, we expect organisms with more complex lifestyles to have more complex and robust metabolic networks. Here we demonstrate for the first time that such organisms are not only characterized by larger, denser networks of metabolic pathways but also have more efficiently organized cross communications, as revealed by subtle changes in network topology. These changes are unevenly distributed among metabolic pathways, with specific categories of pathways being promoted to more central locations as an answer to environmental constraints. Conclusions Combining methods from graph theory and machine learning, we have shown here that evolutionary pressures not only affects gene and protein sequences, but also specific details of the complex wiring of functional modules

Perception Evolution Network Based on Cognition Deepening Model--Adapting to the Emergence of New Sensory Receptor.

Science.gov (United States)

Xing, Youlu; Shen, Furao; Zhao, Jinxi

2016-03-01

The proposed perception evolution network (PEN) is a biologically inspired neural network model for unsupervised learning and online incremental learning. It is able to automatically learn suitable prototypes from learning data in an incremental way, and it does not require the predefined prototype number or the predefined similarity threshold. Meanwhile, being more advanced than the existing unsupervised neural network model, PEN permits the emergence of a new dimension of perception in the perception field of the network. When a new dimension of perception is introduced, PEN is able to integrate the new dimensional sensory inputs with the learned prototypes, i.e., the prototypes are mapped to a high-dimensional space, which consists of both the original dimension and the new dimension of the sensory inputs. In the experiment, artificial data and real-world data are used to test the proposed PEN, and the results show that PEN can work effectively.

Evolution of an artificial neural network based autonomous land vehicle controller.

Science.gov (United States)

Baluja, S

1996-01-01

This paper presents an evolutionary method for creating an artificial neural network based autonomous land vehicle controller. The evolved controllers perform better in unseen situations than those trained with an error backpropagation learning algorithm designed for this task. In this paper, an overview of the previous connectionist based approaches to this task is given, and the evolutionary algorithms used in this study are described in detail. Methods for reducing the high computational costs of training artificial neural networks with evolutionary algorithms are explored. Error metrics specific to the task of autonomous vehicle control are introduced; the evolutionary algorithms guided by these error metrics reveal improved performance over those guided by the standard sum-squared error metric. Finally, techniques for integrating evolutionary search and error backpropagation are presented. The evolved networks are designed to control Carnegie Mellon University's NAVLAB vehicles in road following tasks.

Evolution of the Converged NGN Service Platforms Towards Future Networks

Directory of Open Access Journals (Sweden)

Eugen Mikóczy

2011-03-01

Full Text Available This article presents a comparison of main characteristics of the Next Generation Networks (NGN and Future Generation Internet (FGI. The aim is to discuss and compare two approaches to Future Networks (FN and services: the evolution of NGN, and the revolutionary approach of a new FGI. We present both frameworks from the services point of view as they are delivered to the end-user, as well as from the architectural point of view. We compare selected properties of both approaches to explain commonalities and differences. Their challenges are similar: managing the quality of experience, mobility, security, scalability and providing openness to applications. Based on this comparison, we evaluate possible areas for future convergence in the approach of the two architectures to the Future Network concept. Our analysis shows that despite their different backgrounds, the internet’s FGI and telco’s NGN are not that different after all. The convergence of the two approaches therefore seems the only logical way forward.

Evolution of the Converged NGN Service Platforms Towards Future Networks

NARCIS (Netherlands)

Mikóczy, E.; Kotuliak, I.; Deventer, M.O. van

2011-01-01

This article presents a comparison of main characteristics of the Next Generation Networks (NGN) and Future Generation Internet (FGI). The aim is to discuss and compare two approaches to Future Networks (FN) and services: the evolution of NGN, and the revolutionary approach of a new FGI. We present

Social dilemmas in an online social network: The structure and evolution of cooperation

Energy Technology Data Exchange (ETDEWEB)

Fu Feng [Center for Systems and Control, College of Engineering, Peking University, Beijing 100871 (China); Department of Industrial Engineering and Management, College of Engineering, Peking University, Beijing 100871 (China)], E-mail: fufeng@pku.edu.cn; Chen Xiaojie; Liu Lianghuan [Center for Systems and Control, College of Engineering, Peking University, Beijing 100871 (China); Department of Industrial Engineering and Management, College of Engineering, Peking University, Beijing 100871 (China); Wang Long [Center for Systems and Control, College of Engineering, Peking University, Beijing 100871 (China); Department of Industrial Engineering and Management, College of Engineering, Peking University, Beijing 100871 (China)], E-mail: longwang@pku.edu.cn

2007-11-05

We investigate two paradigms for studying the evolution of cooperation-Prisoner's Dilemma and Snowdrift game in an online friendship network, obtained from a social networking site. By structural analysis, it is revealed that the empirical social network has small-world and scale-free properties. Besides, it exhibits assortative mixing pattern. Then, we study the evolutionary version of the two types of games on it. It is found that cooperation is substantially promoted with small values of game matrix parameters in both games. Whereas the competent cooperators induced by the underlying network of contacts will be dramatically inhibited with increasing values of the game parameters. Further, we explore the role of assortativity in evolution of cooperation by random edge rewiring. We find that increasing amount of assortativity will to a certain extent diminish the cooperation level. We also show that connected large hubs are capable of maintaining cooperation. The evolution of cooperation on empirical networks is influenced by various network effects in a combined manner, compared with that on model networks. Our results can help understand the cooperative behaviors in human groups and society.

Evolution of Cis-Regulatory Elements and Regulatory Networks in Duplicated Genes of Arabidopsis.

Science.gov (United States)

Arsovski, Andrej A; Pradinuk, Julian; Guo, Xu Qiu; Wang, Sishuo; Adams, Keith L

2015-12-01

Plant genomes contain large numbers of duplicated genes that contribute to the evolution of new functions. Following duplication, genes can exhibit divergence in their coding sequence and their expression patterns. Changes in the cis-regulatory element landscape can result in changes in gene expression patterns. High-throughput methods developed recently can identify potential cis-regulatory elements on a genome-wide scale. Here, we use a recent comprehensive data set of DNase I sequencing-identified cis-regulatory binding sites (footprints) at single-base-pair resolution to compare binding sites and network connectivity in duplicated gene pairs in Arabidopsis (Arabidopsis thaliana). We found that duplicated gene pairs vary greatly in their cis-regulatory element architecture, resulting in changes in regulatory network connectivity. Whole-genome duplicates (WGDs) have approximately twice as many footprints in their promoters left by potential regulatory proteins than do tandem duplicates (TDs). The WGDs have a greater average number of footprint differences between paralogs than TDs. The footprints, in turn, result in more regulatory network connections between WGDs and other genes, forming denser, more complex regulatory networks than shown by TDs. When comparing regulatory connections between duplicates, WGDs had more pairs in which the two genes are either partially or fully diverged in their network connections, but fewer genes with no network connections than the TDs. There is evidence of younger TDs and WGDs having fewer unique connections compared with older duplicates. This study provides insights into cis-regulatory element evolution and network divergence in duplicated genes. © 2015 American Society of Plant Biologists. All Rights Reserved.

Modeling community succession and assembly: A novel method for network evolution

Directory of Open Access Journals (Sweden)

WenJun Zhang

2012-06-01

Full Text Available The process of modeling community succession and assembly is in some sense a method for network evolution, as done by Barabasi and Albert (1999. It is also one of the methods to create a sample networkfrom the statistic network I proposed earlier. I think that the mechanism of network evolution supposed by Barabasi and Albert is most likely applicable to the natural phenomena with emergency property. For natural phenomena without emergency property, the present study indicated that a scale-free network may be produced through a new mechanism, i.e., whether the connection of a taxon x occurs, dependent on the type and property of taxon y (in particular, the degree of its direct correlation with x to be connected but not necessarily the existing number of connections of taxon y, as proposed in present study.

Tree-Based Unrooted Phylogenetic Networks.

Science.gov (United States)

Francis, A; Huber, K T; Moulton, V

2018-02-01

Phylogenetic networks are a generalization of phylogenetic trees that are used to represent non-tree-like evolutionary histories that arise in organisms such as plants and bacteria, or uncertainty in evolutionary histories. An unrooted phylogenetic network on a non-empty, finite set X of taxa, or network, is a connected, simple graph in which every vertex has degree 1 or 3 and whose leaf set is X. It is called a phylogenetic tree if the underlying graph is a tree. In this paper we consider properties of tree-based networks, that is, networks that can be constructed by adding edges into a phylogenetic tree. We show that although they have some properties in common with their rooted analogues which have recently drawn much attention in the literature, they have some striking differences in terms of both their structural and computational properties. We expect that our results could eventually have applications to, for example, detecting horizontal gene transfer or hybridization which are important factors in the evolution of many organisms.

DSTATCOM allocation in distribution networks considering reconfiguration using differential evolution algorithm

International Nuclear Information System (INIS)

Jazebi, S.; Hosseinian, S.H.; Vahidi, B.

2011-01-01

Highlights: → Reconfiguration and DSTATCOM allocation are implemented for RDS planning. → Differential evolution algorithm is applied to solve the nonlinear problem. → Optimal status of tie switches, DSTATCOM size and location are determined. → The goal is to minimize network losses and to improve voltage profile. → The results show the effectiveness of the proposed method to satisfy objectives. -- Abstract: The main idea in distribution network reconfiguration is usually to reduce loss by changing the status of sectionalizing switches and determining appropriate tie switches. Recently Distribution FACTS (DFACTS) devices such as DSTATCOM also have been planned for loss reduction and voltage profile improvement in steady state conditions. This paper implements a combinatorial process based on reconfiguration and DSTATCOM allocation in order to mitigate losses and improve voltage profile in power distribution networks. The distribution system tie switches, DSTATCOM location and size have been optimally determined to obtain an appropriate operational condition. Differential evolution algorithm (DEA) has been used to solve and overcome the complicity of this combinatorial nonlinear optimization problem. To validate the accuracy of results a comparison with particle swarm optimization (PSO) has been made. Simulations have been applied on 69 and 83 busses distribution test systems. All optimization results show the effectiveness of the combinatorial approach in loss reduction and voltage profile improvement.

Energy-Aware Topology Evolution Model with Link and Node Deletion in Wireless Sensor Networks

Directory of Open Access Journals (Sweden)

Xiaojuan Luo

2012-01-01

Full Text Available Based on the complex network theory, a new topological evolving model is proposed. In the evolution of the topology of sensor networks, the energy-aware mechanism is taken into account, and the phenomenon of change of the link and node in the network is discussed. Theoretical analysis and numerical simulation are conducted to explore the topology characteristics and network performance with different node energy distribution. We find that node energy distribution has the weak effect on the degree distribution P(k that evolves into the scale-free state, nodes with more energy carry more connections, and degree correlation is nontrivial disassortative. Moreover, the results show that, when nodes energy is more heterogeneous, the network is better clustered and enjoys higher performance in terms of the network efficiency and the average path length for transmitting data.

Simulating individual-based models of epidemics in hierarchical networks

NARCIS (Netherlands)

Quax, R.; Bader, D.A.; Sloot, P.M.A.

2009-01-01

Current mathematical modeling methods for the spreading of infectious diseases are too simplified and do not scale well. We present the Simulator of Epidemic Evolution in Complex Networks (SEECN), an efficient simulator of detailed individual-based models by parameterizing separate dynamics

Unified model for vortex-string network evolution

International Nuclear Information System (INIS)

Martins, C.J.A.P.; Moore, J.N.; Shellard, E.P.S.

2004-01-01

We describe and numerically test the velocity-dependent one-scale string evolution model, a simple analytic approach describing a string network with the averaged correlation length and velocity. We show that it accurately reproduces the large-scale behavior (in particular the scaling laws) of numerical simulations of both Goto-Nambu and field theory string networks. We explicitly demonstrate the relation between the high-energy physics approach and the damped and nonrelativistic limits which are relevant for condensed matter physics. We also reproduce experimental results in this context and show that the vortex-string density is significantly reduced by loop production, an effect not included in the usual 'coarse-grained' approach

On the role of sparseness in the evolution of modularity in gene regulatory networks.

Science.gov (United States)

Espinosa-Soto, Carlos

2018-05-01

Modularity is a widespread property in biological systems. It implies that interactions occur mainly within groups of system elements. A modular arrangement facilitates adjustment of one module without perturbing the rest of the system. Therefore, modularity of developmental mechanisms is a major factor for evolvability, the potential to produce beneficial variation from random genetic change. Understanding how modularity evolves in gene regulatory networks, that create the distinct gene activity patterns that characterize different parts of an organism, is key to developmental and evolutionary biology. One hypothesis for the evolution of modules suggests that interactions between some sets of genes become maladaptive when selection favours additional gene activity patterns. The removal of such interactions by selection would result in the formation of modules. A second hypothesis suggests that modularity evolves in response to sparseness, the scarcity of interactions within a system. Here I simulate the evolution of gene regulatory networks and analyse diverse experimentally sustained networks to study the relationship between sparseness and modularity. My results suggest that sparseness alone is neither sufficient nor necessary to explain modularity in gene regulatory networks. However, sparseness amplifies the effects of forms of selection that, like selection for additional gene activity patterns, already produce an increase in modularity. That evolution of new gene activity patterns is frequent across evolution also supports that it is a major factor in the evolution of modularity. That sparseness is widespread across gene regulatory networks indicates that it may have facilitated the evolution of modules in a wide variety of cases.

The Co-evolution of Business Incubators and National Incubator Networks in Emerging Markets

Directory of Open Access Journals (Sweden)

David F. Robinson

2010-11-01

Full Text Available The study proposes a three stage model of the development of business incubation practices in emerging markets. The model addresses the diffusion of incubation practices to new markets, the institutionalization of those practices and the co-evolution of incubators and national networks of incubation. The model is based on interviews conducted in Bolivia, Peru, Chile, Argentina, and Brazil. New incubators in emerging markets often face strong cultural norms and institutional impediments to helping entrepreneurs start new businesses. As incubation becomes better established in a country, incubators provide more advanced technical, legal and market-based advice. Networks of incubators form to share specialized services across many incubators, to allocate government funding to incubators, and to lobby for public and private support of innovation.

Structure and evolution of a European Parliament via a network and correlation analysis

Science.gov (United States)

Puccio, Elena; Pajala, Antti; Piilo, Jyrki; Tumminello, Michele

2016-11-01

We present a study of the network of relationships among elected members of the Finnish parliament, based on a quantitative analysis of initiative co-signatures, and its evolution over 16 years. To understand the structure of the parliament, we constructed a statistically validated network of members, based on the similarity between the patterns of initiatives they signed. We looked for communities within the network and characterized them in terms of members' attributes, such as electoral district and party. To gain insight on the nested structure of communities, we constructed a hierarchical tree of members from the correlation matrix. Afterwards, we studied parliament dynamics yearly, with a focus on correlations within and between parties, by also distinguishing between government and opposition. Finally, we investigated the role played by specific individuals, at a local level. In particular, whether they act as proponents who gather consensus, or as signers. Our results provide a quantitative background to current theories in political science. From a methodological point of view, our network approach has proven able to highlight both local and global features of a complex social system.

Network homophily and the evolution of the pay-it-forward reciprocity.

Directory of Open Access Journals (Sweden)

Yen-Sheng Chiang

Full Text Available The pay-it-forward reciprocity is a type of cooperative behavior that people who have benefited from others return favors to third parties other than the benefactors, thus pushing forward a cascade of kindness. The phenomenon of the pay-it-forward reciprocity is ubiquitous, yet how it evolves to be part of human sociality has not been fully understood. We develop an evolutionary dynamics model to investigate how network homophily influences the evolution of the pay-it-forward reciprocity. Manipulating the extent to which actors carrying the same behavioral trait are linked in networks, the computer simulation model shows that strong network homophily helps consolidate the adaptive advantage of cooperation, yet introducing some heterophily to the formation of network helps advance cooperation's scale further. Our model enriches the literature of inclusive fitness theory by demonstrating the conditions under which cooperation or reciprocity can be selected for in evolution when social interaction is not confined exclusively to relatives.

Network homophily and the evolution of the pay-it-forward reciprocity.

Science.gov (United States)

Chiang, Yen-Sheng; Takahashi, Nobuyuki

2011-01-01

The pay-it-forward reciprocity is a type of cooperative behavior that people who have benefited from others return favors to third parties other than the benefactors, thus pushing forward a cascade of kindness. The phenomenon of the pay-it-forward reciprocity is ubiquitous, yet how it evolves to be part of human sociality has not been fully understood. We develop an evolutionary dynamics model to investigate how network homophily influences the evolution of the pay-it-forward reciprocity. Manipulating the extent to which actors carrying the same behavioral trait are linked in networks, the computer simulation model shows that strong network homophily helps consolidate the adaptive advantage of cooperation, yet introducing some heterophily to the formation of network helps advance cooperation's scale further. Our model enriches the literature of inclusive fitness theory by demonstrating the conditions under which cooperation or reciprocity can be selected for in evolution when social interaction is not confined exclusively to relatives.

Cooperation in memory-based prisoner's dilemma game on interdependent networks

Science.gov (United States)

Luo, Chao; Zhang, Xiaolin; Liu, Hong; Shao, Rui

2016-05-01

Memory or so-called experience normally plays the important role to guide the human behaviors in real world, that is essential for rational decisions made by individuals. Hence, when the evolutionary behaviors of players with bounded rationality are investigated, it is reasonable to make an assumption that players in system are with limited memory. Besides, in order to unravel the intricate variability of complex systems in real world and make a highly integrative understanding of their dynamics, in recent years, interdependent networks as a comprehensive network structure have obtained more attention in this community. In this article, the evolution of cooperation in memory-based prisoner's dilemma game (PDG) on interdependent networks composed by two coupled square lattices is studied. Herein, all or part of players are endowed with finite memory ability, and we focus on the mutual influence of memory effect and interdependent network reciprocity on cooperation of spatial PDG. We show that the density of cooperation can be significantly promoted within an optimal region of memory length and interdependent strength. Furthermore, distinguished by whether having memory ability/external links or not, each kind of players on networks would have distinct evolutionary behaviors. Our work could be helpful to understand the emergence and maintenance of cooperation under the evolution of memory-based players on interdependent networks.

Evolution of Positioning Techniques in Cellular Networks, from 2G to 4G

Directory of Open Access Journals (Sweden)

Rafael Saraiva Campos

2017-01-01

Full Text Available This review paper presents within a common framework the mobile station positioning methods applied in 2G, 3G, and 4G cellular networks, as well as the structure of the related 3GPP technical specifications. The evolution path through the generations is explored in three steps at each level: first, the new network elements supporting localization features are introduced; then, the standard localization methods are described; finally, the protocols providing specific support to mobile station positioning are studied. To allow a better understanding, this paper also brings a brief review of the cellular networks evolution paths.

Modeling Evolution on Nearly Neutral Network Fitness Landscapes

Science.gov (United States)

Yakushkina, Tatiana; Saakian, David B.

2017-08-01

To describe virus evolution, it is necessary to define a fitness landscape. In this article, we consider the microscopic models with the advanced version of neutral network fitness landscapes. In this problem setting, we suppose a fitness difference between one-point mutation neighbors to be small. We construct a modification of the Wright-Fisher model, which is related to ordinary infinite population models with nearly neutral network fitness landscape at the large population limit. From the microscopic models in the realistic sequence space, we derive two versions of nearly neutral network models: with sinks and without sinks. We claim that the suggested model describes the evolutionary dynamics of RNA viruses better than the traditional Wright-Fisher model with few sequences.

Evolutionary features of academic articles co-keyword network and keywords co-occurrence network: Based on two-mode affiliation network

Science.gov (United States)

Li, Huajiao; An, Haizhong; Wang, Yue; Huang, Jiachen; Gao, Xiangyun

2016-05-01

Keeping abreast of trends in the articles and rapidly grasping a body of article's key points and relationship from a holistic perspective is a new challenge in both literature research and text mining. As the important component, keywords can present the core idea of the academic article. Usually, articles on a single theme or area could share one or some same keywords, and we can analyze topological features and evolution of the articles co-keyword networks and keywords co-occurrence networks to realize the in-depth analysis of the articles. This paper seeks to integrate statistics, text mining, complex networks and visualization to analyze all of the academic articles on one given theme, complex network(s). All 5944 ;complex networks; articles that were published between 1990 and 2013 and are available on the Web of Science are extracted. Based on the two-mode affiliation network theory, a new frontier of complex networks, we constructed two different networks, one taking the articles as nodes, the co-keyword relationships as edges and the quantity of co-keywords as the weight to construct articles co-keyword network, and another taking the articles' keywords as nodes, the co-occurrence relationships as edges and the quantity of simultaneous co-occurrences as the weight to construct keyword co-occurrence network. An integrated method for analyzing the topological features and evolution of the articles co-keyword network and keywords co-occurrence networks is proposed, and we also defined a new function to measure the innovation coefficient of the articles in annual level. This paper provides a useful tool and process for successfully achieving in-depth analysis and rapid understanding of the trends and relationships of articles in a holistic perspective.

Effect of local information within network layers on the evolution of cooperation in duplex public goods games

International Nuclear Information System (INIS)

Zhou, Yifeng; Zheng, Xiaoming; Wu, Weiwei

2015-01-01

Traditional works of public goods game (PGG) are often studied in simplex networks where agents play games through the same type of social interactions. In order to promote cooperation against the defection in PGGs in simplex network environment, many mechanisms have been proposed from different perspectives, such as the volunteering mechanisms, and the punishment and reward approaches. However, due to diverse types of interactions between agents in reality, the study of PGG should also consider the characteristic of multiplexity of networks. Hence, we firstly model the public goods game in the duplex network (for simplification of analysis, the duplex network is considered), in which agents have two types of social interactions, and thus the network is modeled as two network layers. This type of PGG is naturally named as duplex public goods game (D-PGG), in which agents can select one of the network layers to allocate their limited resources. Then for the new game environment (D-PGG), we propose a novel perspective to promote cooperation: degrading the information integrity, i.e., agents get information just from one network layer (local information) rather than from the whole duplex network (global information) in the evolution process. Finally, through theoretical analyses and simulations, we find that if agents imitate based on the local information of the payoff in the evolution, cooperation can be generally promoted; and the extent of promotion depends on both the network structure and the similarity of the network layers

US long distance fiber optic networks: Technology, evolution and advanced concepts. Volume 2: Fiber optic technology and long distance networks

Science.gov (United States)

1986-10-01

The study projects until 2000 the evolution of long distance fiber optic networks in the U.S. Volume 1 is the Executive Summary. Volume 2 focuses on fiber optic components and systems that are directly related to the operation of long-haul networks. Optimistic, pessimistic and most likely scenarios of technology development are presented. The activities of national and regional companies implementing fiber long haul networks are also highlighted, along with an analysis of the market and regulatory forces affecting network evolution. Volume 3 presents advanced fiber optic network concept definitions. Inter-LATA traffic is quantified and forms the basis for the construction of 11-, 15-, 17-, and 23-node networks. Using the technology projections from Volume 2, a financial model identifies cost drivers and determines circuit mile costs between any two LATAs. A comparison of fiber optics with alternative transmission concludes the report.

The genesis and evolution of the African Field Epidemiology Network

African Journals Online (AJOL)

The genesis and evolution of the African Field Epidemiology Network. David Mukanga, Mufuta Tshimanga, Frederick Wurapa, David Serwada, George Pariyo, Fred Wabwire-Mangen, Sheba Gitta, Stella Chungong, Murray Trostle, Peter Nsubuga ...

Chaotic evolution of prisoner's dilemma game with volunteering on interdependent networks

Science.gov (United States)

Luo, Chao; Zhang, Xiaolin; Zheng, YuanJie

2017-06-01

In this article, the evolution of prisoner's dilemma game with volunteering on interdependent networks is investigated. Different from the traditional two-strategy game, voluntary participation as an additional strategy is involved in repeated game, that can introduce more complex evolutionary dynamics. And, interdependent networks provide a more generalized network architecture to study the intricate variability of dynamics. We have showed that voluntary participation could effectively promote the density of co-operation, that is also greatly affected by interdependent strength between two coupled networks. We further discussed the influence of interdependent strength on the densities of different strategies and found that an intermediate interdependence would play a bigger role on the evolution of dynamics. Subsequently, the critical values of the defection temptation for phase transitions under different conditions have been studied. Moreover, the global oscillations induced by the circle of dominance of three strategies on interdependent networks have been quantitatively investigated. Counter-intuitively, the oscillations of strategy densities are not periodic or stochastic, but have rich dynamical behaviors. By means of various analysis tools, we have demonstrated the global oscillations of strategy densities possessed chaotic characteristics.

Network-based recommendation algorithms: A review

Science.gov (United States)

Yu, Fei; Zeng, An; Gillard, Sébastien; Medo, Matúš

2016-06-01

Recommender systems are a vital tool that helps us to overcome the information overload problem. They are being used by most e-commerce web sites and attract the interest of a broad scientific community. A recommender system uses data on users' past preferences to choose new items that might be appreciated by a given individual user. While many approaches to recommendation exist, the approach based on a network representation of the input data has gained considerable attention in the past. We review here a broad range of network-based recommendation algorithms and for the first time compare their performance on three distinct real datasets. We present recommendation topics that go beyond the mere question of which algorithm to use-such as the possible influence of recommendation on the evolution of systems that use it-and finally discuss open research directions and challenges.

A complex network based model for detecting isolated communities in water distribution networks

Science.gov (United States)

Sheng, Nan; Jia, Youwei; Xu, Zhao; Ho, Siu-Lau; Wai Kan, Chi

2013-12-01

Water distribution network (WDN) is a typical real-world complex network of major infrastructure that plays an important role in human's daily life. In this paper, we explore the formation of isolated communities in WDN based on complex network theory. A graph-algebraic model is proposed to effectively detect the potential communities due to pipeline failures. This model can properly illustrate the connectivity and evolution of WDN during different stages of contingency events, and identify the emerging isolated communities through spectral analysis on Laplacian matrix. A case study on a practical urban WDN in China is conducted, and the consistency between the simulation results and the historical data are reported to showcase the feasibility and effectiveness of the proposed model.

Self-organized Criticality in a Modified Evolution Model on Generalized Barabasi-Albert Scale-Free Networks

International Nuclear Information System (INIS)

Lin Min; Wang Gang; Chen Tianlun

2007-01-01

A modified evolution model of self-organized criticality on generalized Barabasi-Albert (GBA) scale-free networks is investigated. In our model, we find that spatial and temporal correlations exhibit critical behaviors. More importantly, these critical behaviors change with the parameter b, which weights the distance in comparison with the degree in the GBA network evolution.

Energy Savings through Site Renewal in an HSPA/LTE Network Evolution Scenario

DEFF Research Database (Denmark)

Micallef, Gilbert; Mogensen, Preben

Mobile network operators are committing themselves to reduce the energy consumption of their networks. However, the expected growth in traffic and the upgrades required to sustain this growth pose a serious question on whether these targets are achievable. Through a case study, this paper looks a...... to just 12%. In some cases, when a less aggressive traffic growth is assumed, the energy savings are enough to balance any increase in energy. In a best case scenario, where all sites are replaced when new equipment is available, energy savings close to 40% are achievable....... at how the energy consumption of a mobile network is likely to develop over a period of nine years, considering the evolution of an existing HSPA layer into a multi-layered (HSPA+LTE) network. Besides, this study also considers four different equipment versions released throughout the years, which...... are introduced in the network based on a replacement strategy. In addition, the two most modern sites are assumed to be configured with remote radio head. In comparison to the reference case which leads to an increase in energy consumption of almost 200%, considering these site upgrades can limit the increase...

Social roles and the evolution of networks in extreme and isolated environments

Science.gov (United States)

Johnson, Jeffrey C.; Boster, James S.; Palinkas, Lawrence A.

2003-01-01

This article reports on the evolution of network structure as it relates to formal and informal social roles in well-bounded, isolated groups. Research was conducted at the Amundsen-Scott South Pole Station. Data were collected on crewmembers' networks of social interaction over each of three winter-over periods, when the station is completely isolated. In addition, data were collected on the informal roles played by crewmembers (e.g., instrumental leadership, expressive leadership). The study found that globally coherent networks in winter-over groups were associated with group consensus on the presence of critically important informal social roles (e.g., expressive leadership) where global coherence is the extent to which a network forms a single group composed of a unitary core and periphery as opposed to being factionalized into two or more subgroups. Conversely, the evolution of multiple subgroups was associated with the absence of consensus on critical informal social roles, above all the critically important role of instrumental leader.

Leveraging social networks for understanding the evolution of epidemics

Science.gov (United States)

2011-01-01

Background To understand how infectious agents disseminate throughout a population it is essential to capture the social model in a realistic manner. This paper presents a novel approach to modeling the propagation of the influenza virus throughout a realistic interconnection network based on actual individual interactions which we extract from online social networks. The advantage is that these networks can be extracted from existing sources which faithfully record interactions between people in their natural environment. We additionally allow modeling the characteristics of each individual as well as customizing his daily interaction patterns by making them time-dependent. Our purpose is to understand how the infection spreads depending on the structure of the contact network and the individuals who introduce the infection in the population. This would help public health authorities to respond more efficiently to epidemics. Results We implement a scalable, fully distributed simulator and validate the epidemic model by comparing the simulation results against the data in the 2004-2005 New York State Department of Health Report (NYSDOH), with similar temporal distribution results for the number of infected individuals. We analyze the impact of different types of connection models on the virus propagation. Lastly, we analyze and compare the effects of adopting several different vaccination policies, some of them based on individual characteristics -such as age- while others targeting the super-connectors in the social model. Conclusions This paper presents an approach to modeling the propagation of the influenza virus via a realistic social model based on actual individual interactions extracted from online social networks. We implemented a scalable, fully distributed simulator and we analyzed both the dissemination of the infection and the effect of different vaccination policies on the progress of the epidemics. The epidemic values predicted by our simulator match

Leveraging social networks for understanding the evolution of epidemics

Directory of Open Access Journals (Sweden)

Martín Gonzalo

2011-12-01

Full Text Available Abstract Background To understand how infectious agents disseminate throughout a population it is essential to capture the social model in a realistic manner. This paper presents a novel approach to modeling the propagation of the influenza virus throughout a realistic interconnection network based on actual individual interactions which we extract from online social networks. The advantage is that these networks can be extracted from existing sources which faithfully record interactions between people in their natural environment. We additionally allow modeling the characteristics of each individual as well as customizing his daily interaction patterns by making them time-dependent. Our purpose is to understand how the infection spreads depending on the structure of the contact network and the individuals who introduce the infection in the population. This would help public health authorities to respond more efficiently to epidemics. Results We implement a scalable, fully distributed simulator and validate the epidemic model by comparing the simulation results against the data in the 2004-2005 New York State Department of Health Report (NYSDOH, with similar temporal distribution results for the number of infected individuals. We analyze the impact of different types of connection models on the virus propagation. Lastly, we analyze and compare the effects of adopting several different vaccination policies, some of them based on individual characteristics -such as age- while others targeting the super-connectors in the social model. Conclusions This paper presents an approach to modeling the propagation of the influenza virus via a realistic social model based on actual individual interactions extracted from online social networks. We implemented a scalable, fully distributed simulator and we analyzed both the dissemination of the infection and the effect of different vaccination policies on the progress of the epidemics. The epidemic values

Evolution of networks for body plan patterning; interplay of modularity, robustness and evolvability.

Directory of Open Access Journals (Sweden)

Kirsten H Ten Tusscher

2011-10-01

Full Text Available A major goal of evolutionary developmental biology (evo-devo is to understand how multicellular body plans of increasing complexity have evolved, and how the corresponding developmental programs are genetically encoded. It has been repeatedly argued that key to the evolution of increased body plan complexity is the modularity of the underlying developmental gene regulatory networks (GRNs. This modularity is considered essential for network robustness and evolvability. In our opinion, these ideas, appealing as they may sound, have not been sufficiently tested. Here we use computer simulations to study the evolution of GRNs' underlying body plan patterning. We select for body plan segmentation and differentiation, as these are considered to be major innovations in metazoan evolution. To allow modular networks to evolve, we independently select for segmentation and differentiation. We study both the occurrence and relation of robustness, evolvability and modularity of evolved networks. Interestingly, we observed two distinct evolutionary strategies to evolve a segmented, differentiated body plan. In the first strategy, first segments and then differentiation domains evolve (SF strategy. In the second scenario segments and domains evolve simultaneously (SS strategy. We demonstrate that under indirect selection for robustness the SF strategy becomes dominant. In addition, as a byproduct of this larger robustness, the SF strategy is also more evolvable. Finally, using a combined functional and architectural approach, we determine network modularity. We find that while SS networks generate segments and domains in an integrated manner, SF networks use largely independent modules to produce segments and domains. Surprisingly, we find that widely used, purely architectural methods for determining network modularity completely fail to establish this higher modularity of SF networks. Finally, we observe that, as a free side effect of evolving segmentation

Efficient parsimony-based methods for phylogenetic network reconstruction.

Science.gov (United States)

Jin, Guohua; Nakhleh, Luay; Snir, Sagi; Tuller, Tamir

2007-01-15

Phylogenies--the evolutionary histories of groups of organisms-play a major role in representing relationships among biological entities. Although many biological processes can be effectively modeled as tree-like relationships, others, such as hybrid speciation and horizontal gene transfer (HGT), result in networks, rather than trees, of relationships. Hybrid speciation is a significant evolutionary mechanism in plants, fish and other groups of species. HGT plays a major role in bacterial genome diversification and is a significant mechanism by which bacteria develop resistance to antibiotics. Maximum parsimony is one of the most commonly used criteria for phylogenetic tree inference. Roughly speaking, inference based on this criterion seeks the tree that minimizes the amount of evolution. In 1990, Jotun Hein proposed using this criterion for inferring the evolution of sequences subject to recombination. Preliminary results on small synthetic datasets. Nakhleh et al. (2005) demonstrated the criterion's application to phylogenetic network reconstruction in general and HGT detection in particular. However, the naive algorithms used by the authors are inapplicable to large datasets due to their demanding computational requirements. Further, no rigorous theoretical analysis of computing the criterion was given, nor was it tested on biological data. In the present work we prove that the problem of scoring the parsimony of a phylogenetic network is NP-hard and provide an improved fixed parameter tractable algorithm for it. Further, we devise efficient heuristics for parsimony-based reconstruction of phylogenetic networks. We test our methods on both synthetic and biological data (rbcL gene in bacteria) and obtain very promising results.

Comparing genomes to computer operating systems in terms of the topology and evolution of their regulatory control networks.

Science.gov (United States)

Yan, Koon-Kiu; Fang, Gang; Bhardwaj, Nitin; Alexander, Roger P; Gerstein, Mark

2010-05-18

The genome has often been called the operating system (OS) for a living organism. A computer OS is described by a regulatory control network termed the call graph, which is analogous to the transcriptional regulatory network in a cell. To apply our firsthand knowledge of the architecture of software systems to understand cellular design principles, we present a comparison between the transcriptional regulatory network of a well-studied bacterium (Escherichia coli) and the call graph of a canonical OS (Linux) in terms of topology and evolution. We show that both networks have a fundamentally hierarchical layout, but there is a key difference: The transcriptional regulatory network possesses a few global regulators at the top and many targets at the bottom; conversely, the call graph has many regulators controlling a small set of generic functions. This top-heavy organization leads to highly overlapping functional modules in the call graph, in contrast to the relatively independent modules in the regulatory network. We further develop a way to measure evolutionary rates comparably between the two networks and explain this difference in terms of network evolution. The process of biological evolution via random mutation and subsequent selection tightly constrains the evolution of regulatory network hubs. The call graph, however, exhibits rapid evolution of its highly connected generic components, made possible by designers' continual fine-tuning. These findings stem from the design principles of the two systems: robustness for biological systems and cost effectiveness (reuse) for software systems.

Long-Term Evolution of Email Networks: Statistical Regularities, Predictability and Stability of Social Behaviors.

Science.gov (United States)

Godoy-Lorite, Antonia; Guimerà, Roger; Sales-Pardo, Marta

2016-01-01

In social networks, individuals constantly drop ties and replace them by new ones in a highly unpredictable fashion. This highly dynamical nature of social ties has important implications for processes such as the spread of information or of epidemics. Several studies have demonstrated the influence of a number of factors on the intricate microscopic process of tie replacement, but the macroscopic long-term effects of such changes remain largely unexplored. Here we investigate whether, despite the inherent randomness at the microscopic level, there are macroscopic statistical regularities in the long-term evolution of social networks. In particular, we analyze the email network of a large organization with over 1,000 individuals throughout four consecutive years. We find that, although the evolution of individual ties is highly unpredictable, the macro-evolution of social communication networks follows well-defined statistical patterns, characterized by exponentially decaying log-variations of the weight of social ties and of individuals' social strength. At the same time, we find that individuals have social signatures and communication strategies that are remarkably stable over the scale of several years.

Non-dominated sorting binary differential evolution for the multi-objective optimization of cascading failures protection in complex networks

International Nuclear Information System (INIS)

Li, Y.F.; Sansavini, G.; Zio, E.

2013-01-01

A number of research works have been devoted to the optimization of protection strategies (e.g. transmission line switch off) of critical infrastructures (e.g. power grids, telecommunication networks, computer networks, etc) to avoid cascading failures. This work aims at improving a previous optimization approach proposed by some of the authors [1], based on the modified binary differential evolution (MBDE) algorithm. The improvements are three-fold: (1) in the optimization problem formulation, we introduce a third objective function to minimize the impacts of the switching off operations onto the existing network topology; (2) in the optimization problem formulation, we use the final results of cascades, rather than only a short horizon of one step cascading, to evaluate the effects of the switching off strategies; (3) in the optimization algorithm, the fast non-dominated sorting mechanisms are incorporated into the MBDE algorithm: a new algorithm, namely non-dominated sorting binary differential evolution algorithm (NSBDE) is then proposed. The numerical application to the topological structure of the 380 kV Italian power transmission network proves the benefits of the improvements.

Transcription Factor Networks Directing the Development, Function, and Evolution of Innate Lymphoid Effectors

Science.gov (United States)

Kang, Joonsoo; Malhotra, Nidhi

2015-01-01

Mammalian lymphoid immunity is mediated by fast and slow responders to pathogens. Fast innate lymphocytes are active within hours after infections in mucosal tissues. Slow adaptive lymphocytes are conventional T and B cells with clonal antigen receptors that function days after pathogen exposure. A transcription factor (TF) regulatory network guiding early T cell development is at the core of effector function diversification in all innate lymphocytes, and the kinetics of immune responses is set by developmental programming. Operational units within the innate lymphoid system are not classified by the types of pathogen-sensing machineries but rather by discrete effector functions programmed by regulatory TF networks. Based on the evolutionary history of TFs of the regulatory networks, fast effectors likely arose earlier in the evolution of animals to fortify body barriers, and in mammals they often develop in fetal ontogeny prior to the establishment of fully competent adaptive immunity. PMID:25650177

A genotype network reveals homoplastic cycles of convergent evolution in influenza A (H3N2) haemagglutinin.

Science.gov (United States)

Wagner, Andreas

2014-07-07

Networks of evolving genotypes can be constructed from the worldwide time-resolved genotyping of pathogens like influenza viruses. Such genotype networks are graphs where neighbouring vertices (viral strains) differ in a single nucleotide or amino acid. A rich trove of network analysis methods can help understand the evolutionary dynamics reflected in the structure of these networks. Here, I analyse a genotype network comprising hundreds of influenza A (H3N2) haemagglutinin genes. The network is rife with cycles that reflect non-random parallel or convergent (homoplastic) evolution. These cycles also show patterns of sequence change characteristic for strong and local evolutionary constraints, positive selection and mutation-limited evolution. Such cycles would not be visible on a phylogenetic tree, illustrating that genotype network analysis can complement phylogenetic analyses. The network also shows a distinct modular or community structure that reflects temporal more than spatial proximity of viral strains, where lowly connected bridge strains connect different modules. These and other organizational patterns illustrate that genotype networks can help us study evolution in action at an unprecedented level of resolution. © 2014 The Author(s) Published by the Royal Society. All rights reserved.

Intelligent Resource Management for Local Area Networks: Approach and Evolution

Science.gov (United States)

Meike, Roger

1988-01-01

The Data Management System network is a complex and important part of manned space platforms. Its efficient operation is vital to crew, subsystems and experiments. AI is being considered to aid in the initial design of the network and to augment the management of its operation. The Intelligent Resource Management for Local Area Networks (IRMA-LAN) project is concerned with the application of AI techniques to network configuration and management. A network simulation was constructed employing real time process scheduling for realistic loads, and utilizing the IEEE 802.4 token passing scheme. This simulation is an integral part of the construction of the IRMA-LAN system. From it, a causal model is being constructed for use in prediction and deep reasoning about the system configuration. An AI network design advisor is being added to help in the design of an efficient network. The AI portion of the system is planned to evolve into a dynamic network management aid. The approach, the integrated simulation, project evolution, and some initial results are described.

Network formation, governance, and evolution in public health: the North American Quitline Consortium case.

Science.gov (United States)

Provan, Keith G; Beagles, Jonathan E; Leischow, Scott J

2011-01-01

Collaborative networks of health organizations have received a great deal of attention in recent years as a way of enhancing the flow of information and coordination of services. However, relatively little is known about how such networks are formed and evolve, especially outside a local, community-based setting. This article is an in-depth discussion of the evolution of the North American Quitline Consortium (NAQC). The NAQC is a network of U.S. and Canadian organizations that provide telephone-based counseling and related services to people trying to quit smoking. The research draws on data from interviews, documents, and a survey of NAQC members to assess how the network emerged, became formalized, and effectively governed. The findings provide an understanding of how multiregional public health networks evolve, while building on and extending the broader literature on organizational networks in other sectors and settings. Specifically, we found that the network form that ultimately emerged was a product of the back-and-forth interplay between the internal needs and goals of those organizations that would ultimately become network members, in this case, state-, and provincial-level tobacco quitline organizations. We also found that network formation, and then governance through a network administrative organization, was driven by important events and shifts in the external environment, including the impact and influence of major national organizations. The results of the study provide health care leaders and policy officials an understanding of how the activities of a large number of organizations having a common health goal, but spanning multiple states and countries, might be coordinated and integrated through the establishment of a formal network.

Isolation and evolution of labile sulfur allotropes via kinetic encapsulation in interactive porous networks

Directory of Open Access Journals (Sweden)

Hakuba Kitagawa

2016-07-01

Full Text Available The isolation and characterization of small sulfur allotropes have long remained unachievable because of their extreme lability. This study reports the first direct observation of disulfur (S2 with X-ray crystallography. Sulfur gas was kinetically trapped and frozen into the pores of two Cu-based porous coordination networks containing interactive iodide sites. Stabilization of S2 was achieved either through physisorption or chemisorption on iodide anions. One of the networks displayed shape selectivity for linear molecules only, therefore S2 was trapped and remained stable within the material at room temperature and higher. In the second network, however, the S2 molecules reacted further to produce bent-S3 species as the temperature was increased. Following the thermal evolution of the S2 species in this network using X-ray diffraction and Raman spectroscopy unveiled the generation of a new reaction intermediate never observed before, the cyclo-trisulfur dication (cyclo-S32+. It is envisaged that kinetic guest trapping in interactive crystalline porous networks will be a promising method to investigate transient chemical species.

Time evolution of Wikipedia network ranking

Science.gov (United States)

Eom, Young-Ho; Frahm, Klaus M.; Benczúr, András; Shepelyansky, Dima L.

2013-12-01

We study the time evolution of ranking and spectral properties of the Google matrix of English Wikipedia hyperlink network during years 2003-2011. The statistical properties of ranking of Wikipedia articles via PageRank and CheiRank probabilities, as well as the matrix spectrum, are shown to be stabilized for 2007-2011. A special emphasis is done on ranking of Wikipedia personalities and universities. We show that PageRank selection is dominated by politicians while 2DRank, which combines PageRank and CheiRank, gives more accent on personalities of arts. The Wikipedia PageRank of universities recovers 80% of top universities of Shanghai ranking during the considered time period.

Network evolution driven by dynamics applied to graph coloring

International Nuclear Information System (INIS)

Wu Jian-She; Li Li-Guang; Yu Xin; Jiao Li-Cheng; Wang Xiao-Hua

2013-01-01

An evolutionary network driven by dynamics is studied and applied to the graph coloring problem. From an initial structure, both the topology and the coupling weights evolve according to the dynamics. On the other hand, the dynamics of the network are determined by the topology and the coupling weights, so an interesting structure-dynamics co-evolutionary scheme appears. By providing two evolutionary strategies, a network described by the complement of a graph will evolve into several clusters of nodes according to their dynamics. The nodes in each cluster can be assigned the same color and nodes in different clusters assigned different colors. In this way, a co-evolution phenomenon is applied to the graph coloring problem. The proposed scheme is tested on several benchmark graphs for graph coloring

Solving Bi-Objective Optimal Power Flow using Hybrid method of Biogeography-Based Optimization and Differential Evolution Algorithm: A case study of the Algerian Electrical Network

Directory of Open Access Journals (Sweden)

Ouafa Herbadji

2016-03-01

Full Text Available This paper proposes a new hybrid metaheuristique algorithm based on the hybridization of Biogeography-based optimization with the Differential Evolution for solving the optimal power flow problem with emission control. The biogeography-based optimization (BBO algorithm is strongly influenced by equilibrium theory of island biogeography, mainly through two steps: Migration and Mutation. Differential Evolution (DE is one of the best Evolutionary Algorithms for global optimization. The hybridization of these two methods is used to overcome traps of local optimal solutions and problems of time consumption. The objective of this paper is to minimize the total fuel cost of generation, total emission, total real power loss and also maintain an acceptable system performance in terms of limits on generator real power, bus voltages and power flow of transmission lines. In the present work, BBO/DE has been applied to solve the optimal power flow problems on IEEE 30-bus test system and the Algerian electrical network 114 bus. The results obtained from this method show better performances compared with DE, BBO and other well known metaheuristique and evolutionary optimization methods.

Anatomical Network Analysis Shows Decoupling of Modular Lability and Complexity in the Evolution of the Primate Skull

Science.gov (United States)

Esteve-Altava, Borja; Boughner, Julia C.; Diogo, Rui; Villmoare, Brian A.; Rasskin-Gutman, Diego

2015-01-01

Modularity and complexity go hand in hand in the evolution of the skull of primates. Because analyses of these two parameters often use different approaches, we do not know yet how modularity evolves within, or as a consequence of, an also-evolving complex organization. Here we use a novel network theory-based approach (Anatomical Network Analysis) to assess how the organization of skull bones constrains the co-evolution of modularity and complexity among primates. We used the pattern of bone contacts modeled as networks to identify connectivity modules and quantify morphological complexity. We analyzed whether modularity and complexity evolved coordinately in the skull of primates. Specifically, we tested Herbert Simon’s general theory of near-decomposability, which states that modularity promotes the evolution of complexity. We found that the skulls of extant primates divide into one conserved cranial module and up to three labile facial modules, whose composition varies among primates. Despite changes in modularity, statistical analyses reject a positive feedback between modularity and complexity. Our results suggest a decoupling of complexity and modularity that translates to varying levels of constraint on the morphological evolvability of the primate skull. This study has methodological and conceptual implications for grasping the constraints that underlie the developmental and functional integration of the skull of humans and other primates. PMID:25992690

Effects of biases in domain wall network evolution. II. Quantitative analysis

Science.gov (United States)

Correia, J. R. C. C. C.; Leite, I. S. C. R.; Martins, C. J. A. P.

2018-04-01

Domain walls form at phase transitions which break discrete symmetries. In a cosmological context, they often overclose the Universe (contrary to observational evidence), although one may prevent this by introducing biases or forcing anisotropic evolution of the walls. In a previous work [Correia et al., Phys. Rev. D 90, 023521 (2014), 10.1103/PhysRevD.90.023521], we numerically studied the evolution of various types of biased domain wall networks in the early Universe, confirming that anisotropic networks ultimately reach scaling while those with a biased potential or biased initial conditions decay. We also found that the analytic decay law obtained by Hindmarsh was in good agreement with simulations of biased potentials, but not of biased initial conditions, and suggested that the difference was related to the Gaussian approximation underlying the analytic law. Here, we extend our previous work in several ways. For the cases of biased potential and biased initial conditions, we study in detail the field distributions in the simulations, confirming that the validity (or not) of the Gaussian approximation is the key difference between the two cases. For anisotropic walls, we carry out a more extensive set of numerical simulations and compare them to the canonical velocity-dependent one-scale model for domain walls, finding that the model accurately predicts the linear scaling regime after isotropization. Overall, our analysis provides a quantitative description of the cosmological evolution of these networks.

Finite size effects and symmetry breaking in the evolution of networks of competing Boolean nodes

International Nuclear Information System (INIS)

Liu, M; Bassler, K E

2011-01-01

Finite size effects on the evolutionary dynamics of Boolean networks are analyzed. In the model considered, Boolean networks evolve via a competition between nodes that punishes those in the majority. Previous studies have found that large networks evolve to a statistical steady state that is both critical and highly canalized, and that the evolution of canalization, which is a form of robustness found in genetic regulatory networks, is associated with a particular symmetry of the evolutionary dynamics. Here, it is found that finite size networks evolve in a fundamentally different way than infinitely large networks do. The symmetry of the evolutionary dynamics of infinitely large networks that selects for canalizing Boolean functions is broken in the evolutionary dynamics of finite size networks. In finite size networks, there is an additional selection for input-inverting Boolean functions that output a value opposite to the majority of input values. The reason for the symmetry breaking in the evolutionary dynamics is found to be due to the need for nodes in finite size networks to behave differently in order to cooperate so that the system collectively performs as efficiently as possible. The results suggest that both finite size effects and symmetry are fundamental for understanding the evolution of real-world complex networks, including genetic regulatory networks.

Codon based co-occurrence network motifs in human mitochondria

Directory of Open Access Journals (Sweden)

Pramod Shinde

2017-10-01

Full Text Available The nucleotide polymorphism in human mitochondrial genome (mtDNA tolled by codon position bias plays an indispensable role in human population dispersion and expansion. Herein, we constructed genome-wide nucleotide co-occurrence networks using a massive data consisting of five different geographical regions and around 3000 samples for each region. We developed a powerful network model to describe complex mitochondrial evolutionary patterns between codon and non-codon positions. It was interesting to report a different evolution of Asian genomes than those of the rest which is divulged by network motifs. We found evidence that mtDNA undergoes substantial amounts of adaptive evolution, a finding which was supported by a number of previous studies. The dominance of higher order motifs indicated the importance of long-range nucleotide co-occurrence in genomic diversity. Most notably, codon motifs apparently underpinned the preferences among codon positions for co-evolution which is probably highly biased during the origin of the genetic code. Our analyses manifested that codon position co-evolution is very well conserved across human sub-populations and independently maintained within human sub-populations implying the selective role of evolutionary processes on codon position co-evolution. Ergo, this study provided a framework to investigate cooperative genomic interactions which are critical in underlying complex mitochondrial evolution.

Long-term evolution of upper stratospheric ozone at selected stations of the Network for the Detection of Stratospheric Change (NDSC)

NARCIS (Netherlands)

Steinbrecht, W; Claude, H; Schönenborn, F; McDermid, I S; Leblanc, T; Godin, S; Song, T; Swart, D P J; Meijer, Y J; Bodeker, G E; Connor, B J; Kämpfer, N; Hocke, K; Calisesi, Y; Schneider, N; Noë, J de la; Parrish, A D; Boyd, I S; Brühl, C; Steil, B; Giorgetta, M A; Manzini, E; Thomason, L W; Zawodny, J M; McCormick, M P; Russell, J M; Bhartia, P K; Stolarski, R S; Hollandsworth-Frith, S M

2006-01-01

The long-term evolution of upper stratospheric ozone has been recorded by lidars and microwave radiometers within the ground-based Network for the Detection of Stratospheric Change (NDSC), and by the space-borne Solar Backscatter Ultra-Violet instruments (SBUV), Stratospheric Aerosol and Gas

Randomly biased investments and the evolution of public goods on interdependent networks

Science.gov (United States)

Chen, Wei; Wu, Te; Li, Zhiwu; Wang, Long

2017-08-01

Deciding how to allocate resources between interdependent systems is significant to optimize efficiency. We study the effects of heterogeneous contribution, induced by such interdependency, on the evolution of cooperation, through implementing the public goods games on two-layer networks. The corresponding players on different layers try to share a fixed amount of resources as the initial investment properly. The symmetry breaking of investments between players located on different layers is able to either prevent investments from, or extract them out of the deadlock. Results show that a moderate investment heterogeneity is best favorable for the evolution of cooperation, and random allocation of investment bias suppresses the cooperators at a wide range of the investment bias and the enhancement effect. Further studies on time evolution with different initial strategy configurations show that the non-interdependent cooperators along the interface of interdependent cooperators also are an indispensable factor in facilitating cooperative behavior. Our main results are qualitatively unchanged even diversifying investment bias that is subject to uniform distribution. Our study may shed light on the understanding of the origin of cooperative behavior on interdependent networks.

Evolution-development congruence in pattern formation dynamics: Bifurcations in gene expression and regulation of networks structures.

Science.gov (United States)

Kohsokabe, Takahiro; Kaneko, Kunihiko

2016-01-01

Search for possible relationships between phylogeny and ontogeny is important in evolutionary-developmental biology. Here we uncover such relationships by numerical evolution and unveil their origin in terms of dynamical systems theory. By representing developmental dynamics of spatially located cells with gene expression dynamics with cell-to-cell interaction under external morphogen gradient, gene regulation networks are evolved under mutation and selection with the fitness to approach a prescribed spatial pattern of expressed genes. For most numerical evolution experiments, evolution of pattern over generations and development of pattern by an evolved network exhibit remarkable congruence. Both in the evolution and development pattern changes consist of several epochs where stripes are formed in a short time, while for other temporal regimes, pattern hardly changes. In evolution, these quasi-stationary regimes are generations needed to hit relevant mutations, while in development, they are due to some gene expression that varies slowly and controls the pattern change. The morphogenesis is regulated by combinations of feedback or feedforward regulations, where the upstream feedforward network reads the external morphogen gradient, and generates a pattern used as a boundary condition for the later patterns. The ordering from up to downstream is common in evolution and development, while the successive epochal changes in development and evolution are represented as common bifurcations in dynamical-systems theory, which lead to the evolution-development congruence. Mechanism of exceptional violation of the congruence is also unveiled. Our results provide a new look on developmental stages, punctuated equilibrium, developmental bottlenecks, and evolutionary acquisition of novelty in morphogenesis. © 2015 The Authors. Journal of Experimental Zoology Part B: Molecular and Developmental Evolution Published by Wiley Periodicals, Inc.

Network evolution induced by the dynamical rules of two populations

International Nuclear Information System (INIS)

Platini, Thierry; Zia, R K P

2010-01-01

We study the dynamical properties of a finite dynamical network composed of two interacting populations, namely extrovert (a) and introvert (b). In our model, each group is characterized by its size (N a and N b ) and preferred degree (κ a and κ b a ). The network dynamics is governed by the competing microscopic rules of each population that consist of the creation and destruction of links. Starting from an unconnected network, we give a detailed analysis of the mean field approach which is compared to Monte Carlo simulation data. The time evolution of the restricted degrees (k bb ) and (k ab ) presents three time regimes and a non-monotonic behavior well captured by our theory. Surprisingly, when the population sizes are equal N a = N b , the ratio of the restricted degree θ 0 = (k ab )/(k bb ) appears to be an integer in the asymptotic limits of the three time regimes. For early times (defined by t 1 = κ b ) the total number of links presents a linear evolution, where the two populations are indistinguishable and where θ 0 = 1. Interestingly, in the intermediate time regime (defined for t 1 2 ∝κ a and for which θ 0 = 5), the system reaches a transient stationary state, where the number of contacts among introverts remains constant while the number of connections increases linearly in the extrovert population. Finally, due to the competing dynamics, the network presents a frustrated stationary state characterized by a ratio θ 0 = 3

Statistically validated mobile communication networks: the evolution of motifs in European and Chinese data

International Nuclear Information System (INIS)

Li, Ming-Xia; Jiang, Zhi-Qiang; Zhou, Wei-Xing; Palchykov, Vasyl; Kaski, Kimmo; Kertész, János; Miccichè, Salvatore; Tumminello, Michele; N Mantegna, Rosario

2014-01-01

Big data open up unprecedented opportunities for investigating complex systems, including society. In particular, communication data serve as major sources for computational social sciences, but they have to be cleaned and filtered as they may contain spurious information due to recording errors as well as interactions, like commercial and marketing activities, not directly related to the social network. The network constructed from communication data can only be considered as a proxy for the network of social relationships. Here we apply a systematic method, based on multiple-hypothesis testing, to statistically validate the links and then construct the corresponding Bonferroni network, generalized to the directed case. We study two large datasets of mobile phone records, one from Europe and the other from China. For both datasets we compare the raw data networks with the corresponding Bonferroni networks and point out significant differences in the structures and in the basic network measures. We show evidence that the Bonferroni network provides a better proxy for the network of social interactions than the original one. Using the filtered networks, we investigated the statistics and temporal evolution of small directed 3-motifs and concluded that closed communication triads have a formation time scale, which is quite fast and typically intraday. We also find that open communication triads preferentially evolve into other open triads with a higher fraction of reciprocated calls. These stylized facts were observed for both datasets. (paper)

Statistically validated mobile communication networks: the evolution of motifs in European and Chinese data

Science.gov (United States)

Li, Ming-Xia; Palchykov, Vasyl; Jiang, Zhi-Qiang; Kaski, Kimmo; Kertész, János; Miccichè, Salvatore; Tumminello, Michele; Zhou, Wei-Xing; Mantegna, Rosario N.

2014-08-01

Big data open up unprecedented opportunities for investigating complex systems, including society. In particular, communication data serve as major sources for computational social sciences, but they have to be cleaned and filtered as they may contain spurious information due to recording errors as well as interactions, like commercial and marketing activities, not directly related to the social network. The network constructed from communication data can only be considered as a proxy for the network of social relationships. Here we apply a systematic method, based on multiple-hypothesis testing, to statistically validate the links and then construct the corresponding Bonferroni network, generalized to the directed case. We study two large datasets of mobile phone records, one from Europe and the other from China. For both datasets we compare the raw data networks with the corresponding Bonferroni networks and point out significant differences in the structures and in the basic network measures. We show evidence that the Bonferroni network provides a better proxy for the network of social interactions than the original one. Using the filtered networks, we investigated the statistics and temporal evolution of small directed 3-motifs and concluded that closed communication triads have a formation time scale, which is quite fast and typically intraday. We also find that open communication triads preferentially evolve into other open triads with a higher fraction of reciprocated calls. These stylized facts were observed for both datasets.

Evolution of Cooperation in Continuous Prisoner's Dilemma Games on Barabasi—Albert Networks with Degree-Dependent Guilt Mechanism

Science.gov (United States)

Wang, Xian-Jia; Quan, Ji; Liu, Wei-Bing

2012-05-01

This paper studies the continuous prisoner's dilemma games (CPDG) on Barabasi—Albert (BA) networks. In the model, each agent on a vertex of the networks makes an investment and interacts with all of his neighboring agents. Making an investment is costly, but which benefits its neighboring agents, where benefit and cost depend on the level of investment made. The payoff of each agent is given by the sum of payoffs it receives in its interactions with all its neighbors. Not only payoff, individual's guilty emotion in the games has also been considered. The negative guilty emotion produced in comparing with its neighbors can reduce the utility of individuals directly. We assume that the reduction amount depends on the individual's degree and a baseline level parameter. The group's cooperative level is characterized by the average investment of the population. Each player makes his investment in the next step based on a convex combination of the investment of his best neighbors in the last step, his best history strategies in the latest steps which number is controlled by a memory length parameter, and a uniformly distributed random number. Simulation results show that this degree-dependent guilt mechanism can promote the evolution of cooperation dramatically comparing with degree-independent guilt or no guilt cases. Imitation, memory, uncertainty coefficients and network structure also play determinant roles in the cooperation level of the population. All our results may shed some new light on studying the evolution of cooperation based on network reciprocity mechanisms.

Evolution of Cooperation in Continuous Prisoner's Dilemma Games on Barabasi-Albert Networks with Degree-Dependent Guilt Mechanism

International Nuclear Information System (INIS)

Wang Xianjia; Quan Ji; Liu Weibing

2012-01-01

This paper studies the continuous prisoner's dilemma games (CPDG) on Barabasi-Albert (BA) networks. In the model, each agent on a vertex of the networks makes an investment and interacts with all of his neighboring agents. Making an investment is costly, but which benefits its neighboring agents, where benefit and cost depend on the level of investment made. The payoff of each agent is given by the sum of payoffs it receives in its interactions with all its neighbors. Not only payoff, individual's guilty emotion in the games has also been considered. The negative guilty emotion produced in comparing with its neighbors can reduce the utility of individuals directly. We assume that the reduction amount depends on the individual's degree and a baseline level parameter. The group's cooperative level is characterized by the average investment of the population. Each player makes his investment in the next step based on a convex combination of the investment of his best neighbors in the last step, his best history strategies in the latest steps which number is controlled by a memory length parameter, and a uniformly distributed random number. Simulation results show that this degree-dependent guilt mechanism can promote the evolution of cooperation dramatically comparing with degree-independent guilt or no guilt cases. Imitation, memory, uncertainty coefficients and network structure also play determinant roles in the cooperation level of the population. All our results may shed some new light on studying the evolution of cooperation based on network reciprocity mechanisms. (interdisciplinary physics and related areas of science and technology)

Interplay between chaperones and protein disorder promotes the evolution of protein networks.

Directory of Open Access Journals (Sweden)

Sebastian Pechmann

2014-06-01

Full Text Available Evolution is driven by mutations, which lead to new protein functions but come at a cost to protein stability. Non-conservative substitutions are of interest in this regard because they may most profoundly affect both function and stability. Accordingly, organisms must balance the benefit of accepting advantageous substitutions with the possible cost of deleterious effects on protein folding and stability. We here examine factors that systematically promote non-conservative mutations at the proteome level. Intrinsically disordered regions in proteins play pivotal roles in protein interactions, but many questions regarding their evolution remain unanswered. Similarly, whether and how molecular chaperones, which have been shown to buffer destabilizing mutations in individual proteins, generally provide robustness during proteome evolution remains unclear. To this end, we introduce an evolutionary parameter λ that directly estimates the rate of non-conservative substitutions. Our analysis of λ in Escherichia coli, Saccharomyces cerevisiae, and Homo sapiens sequences reveals how co- and post-translationally acting chaperones differentially promote non-conservative substitutions in their substrates, likely through buffering of their destabilizing effects. We further find that λ serves well to quantify the evolution of intrinsically disordered proteins even though the unstructured, thus generally variable regions in proteins are often flanked by very conserved sequences. Crucially, we show that both intrinsically disordered proteins and highly re-wired proteins in protein interaction networks, which have evolved new interactions and functions, exhibit a higher λ at the expense of enhanced chaperone assistance. Our findings thus highlight an intricate interplay of molecular chaperones and protein disorder in the evolvability of protein networks. Our results illuminate the role of chaperones in enabling protein evolution, and underline the

Structural Behavioral Study on the General Aviation Network Based on Complex Network

Science.gov (United States)

Zhang, Liang; Lu, Na

2017-12-01

The general aviation system is an open and dissipative system with complex structures and behavioral features. This paper has established the system model and network model for general aviation. We have analyzed integral attributes and individual attributes by applying the complex network theory and concluded that the general aviation network has influential enterprise factors and node relations. We have checked whether the network has small world effect, scale-free property and network centrality property which a complex network should have by applying degree distribution of functions and proved that the general aviation network system is a complex network. Therefore, we propose to achieve the evolution process of the general aviation industrial chain to collaborative innovation cluster of advanced-form industries by strengthening network multiplication effect, stimulating innovation performance and spanning the structural hole path.

An Analysis for the Use of Research and Education Networks and Commercial Network Vendors in Support of Space Based Mission Critical and Non-Critical Networking

Science.gov (United States)

Bradford, Robert N.

2002-01-01

Currently, and in the past, dedicated communication circuits and "network services" with very stringent performance requirements are being used to support manned and unmanned mission critical ground operations at GSFC, JSC, MSFC, KSC and other NASA facilities. Because of the evolution of network technology, it is time to investigate using other approaches to providing mission services for space ground operations. The current NASA approach is not in keeping with the evolution of network technologies. In the past decade various research and education networks dedicated to scientific and educational endeavors have emerged, as well as commercial networking providers, that employ advanced networking technologies. These technologies have significantly changed networking in recent years. Significant advances in network routing techniques, various topologies and equipment have made commercial networks very stable and virtually error free. Advances in Dense Wave Division Multiplexing will provide tremendous amounts of bandwidth for the future. The question is: Do these networks, which are controlled and managed centrally, provide a level of service that equals the stringent NASA performance requirements. If they do, what are the implication(s) of using them for critical space based ground operations as they are, without adding high cost contractual performance requirements? A second question is the feasibility of applying the emerging grid technology in space operations. Is it feasible to develop a Space Operations Grid and/or a Space Science Grid? Since these network's connectivity is substantial, both nationally and internationally, development of these sorts of grids may be feasible. The concept of research and education networks has evolved to the international community as well. Currently there are international RENs connecting the US in Chicago to and from Europe, South America, Asia and the Pacific rim, Russia and Canada. And most countries in these areas have their

Exploring online evolution of network stacks

OpenAIRE

Imai, Pierre

2013-01-01

Network stacks today follow a one-size-fits-all philosophy. They are mostly kept unmodified due to often prohibitive costs of engineering, deploying and administrating customisation of the networking software, with the Internet stack architecture still largely being based on designs and assumptions made for the ARPANET 40 years ago. We venture that heterogeneous and rapidly changing networks of the future require, in order to be successful, run-time self-adaptation mechanisms at different tim...

Cost- and reliability-oriented aggregation point association in long-term evolution and passive optical network hybrid access infrastructure for smart grid neighborhood area network

Science.gov (United States)

Cheng, Xiao; Feng, Lei; Zhou, Fanqin; Wei, Lei; Yu, Peng; Li, Wenjing

2018-02-01

With the rapid development of the smart grid, the data aggregation point (AP) in the neighborhood area network (NAN) is becoming increasingly important for forwarding the information between the home area network and wide area network. Due to limited budget, it is unable to use one-single access technology to meet the ongoing requirements on AP coverage. This paper first introduces the wired and wireless hybrid access network with the integration of long-term evolution (LTE) and passive optical network (PON) system for NAN, which allows a good trade-off among cost, flexibility, and reliability. Then, based on the already existing wireless LTE network, an AP association optimization model is proposed to make the PON serve as many APs as possible, considering both the economic efficiency and network reliability. Moreover, since the features of the constraints and variables of this NP-hard problem, a hybrid intelligent optimization algorithm is proposed, which is achieved by the mixture of the genetic, ant colony and dynamic greedy algorithm. By comparing with other published methods, simulation results verify the performance of the proposed method in improving the AP coverage and the performance of the proposed algorithm in terms of convergence.

Protein-protein interaction network-based detection of functionally similar proteins within species.

Science.gov (United States)

Song, Baoxing; Wang, Fen; Guo, Yang; Sang, Qing; Liu, Min; Li, Dengyun; Fang, Wei; Zhang, Deli

2012-07-01

Although functionally similar proteins across species have been widely studied, functionally similar proteins within species showing low sequence similarity have not been examined in detail. Identification of these proteins is of significant importance for understanding biological functions, evolution of protein families, progression of co-evolution, and convergent evolution and others which cannot be obtained by detection of functionally similar proteins across species. Here, we explored a method of detecting functionally similar proteins within species based on graph theory. After denoting protein-protein interaction networks using graphs, we split the graphs into subgraphs using the 1-hop method. Proteins with functional similarities in a species were detected using a method of modified shortest path to compare these subgraphs and to find the eligible optimal results. Using seven protein-protein interaction networks and this method, some functionally similar proteins with low sequence similarity that cannot detected by sequence alignment were identified. By analyzing the results, we found that, sometimes, it is difficult to separate homologous from convergent evolution. Evaluation of the performance of our method by gene ontology term overlap showed that the precision of our method was excellent. Copyright © 2012 Wiley Periodicals, Inc.

Molecular networks and the evolution of human cognitive specializations.

Science.gov (United States)

Fontenot, Miles; Konopka, Genevieve

2014-12-01

Inroads into elucidating the origins of human cognitive specializations have taken many forms, including genetic, genomic, anatomical, and behavioral assays that typically compare humans to non-human primates. While the integration of all of these approaches is essential for ultimately understanding human cognition, here, we review the usefulness of coexpression network analysis for specifically addressing this question. An increasing number of studies have incorporated coexpression networks into brain expression studies comparing species, disease versus control tissue, brain regions, or developmental time periods. A clearer picture has emerged of the key genes driving brain evolution, as well as the developmental and regional contributions of gene expression patterns important for normal brain development and those misregulated in cognitive diseases. Copyright © 2014 Elsevier Ltd. All rights reserved.

Evolution of opinions on social networks in the presence of competing committed groups.

Science.gov (United States)

Xie, Jierui; Emenheiser, Jeffrey; Kirby, Matthew; Sreenivasan, Sameet; Szymanski, Boleslaw K; Korniss, Gyorgy

2012-01-01

Public opinion is often affected by the presence of committed groups of individuals dedicated to competing points of view. Using a model of pairwise social influence, we study how the presence of such groups within social networks affects the outcome and the speed of evolution of the overall opinion on the network. Earlier work indicated that a single committed group within a dense social network can cause the entire network to quickly adopt the group's opinion (in times scaling logarithmically with the network size), so long as the committed group constitutes more than about 10% of the population (with the findings being qualitatively similar for sparse networks as well). Here we study the more general case of opinion evolution when two groups committed to distinct, competing opinions A and B, and constituting fractions pA and pB of the total population respectively, are present in the network. We show for stylized social networks (including Erdös-Rényi random graphs and Barabási-Albert scale-free networks) that the phase diagram of this system in parameter space (pA,pB) consists of two regions, one where two stable steady-states coexist, and the remaining where only a single stable steady-state exists. These two regions are separated by two fold-bifurcation (spinodal) lines which meet tangentially and terminate at a cusp (critical point). We provide further insights to the phase diagram and to the nature of the underlying phase transitions by investigating the model on infinite (mean-field limit), finite complete graphs and finite sparse networks. For the latter case, we also derive the scaling exponent associated with the exponential growth of switching times as a function of the distance from the critical point.

Preferential attachment in the evolution of metabolic networks

Directory of Open Access Journals (Sweden)

Elofsson Arne

2005-11-01

Full Text Available Abstract Background Many biological networks show some characteristics of scale-free networks. Scale-free networks can evolve through preferential attachment where new nodes are preferentially attached to well connected nodes. In networks which have evolved through preferential attachment older nodes should have a higher average connectivity than younger nodes. Here we have investigated preferential attachment in the context of metabolic networks. Results The connectivities of the enzymes in the metabolic network of Escherichia coli were determined and representatives for these enzymes were located in 11 eukaryotes, 17 archaea and 46 bacteria. E. coli enzymes which have representatives in eukaryotes have a higher average connectivity while enzymes which are represented only in the prokaryotes, and especially the enzymes only present in βγ-proteobacteria, have lower connectivities than expected by chance. Interestingly, the enzymes which have been proposed as candidates for horizontal gene transfer have a higher average connectivity than the other enzymes. Furthermore, It was found that new edges are added to the highly connected enzymes at a faster rate than to enzymes with low connectivities which is consistent with preferential attachment. Conclusion Here, we have found indications of preferential attachment in the metabolic network of E. coli. A possible biological explanation for preferential attachment growth of metabolic networks is that novel enzymes created through gene duplication maintain some of the compounds involved in the original reaction, throughout its future evolution. In addition, we found that enzymes which are candidates for horizontal gene transfer have a higher average connectivity than other enzymes. This indicates that while new enzymes are attached preferentially to highly connected enzymes, these highly connected enzymes have sometimes been introduced into the E. coli genome by horizontal gene transfer. We speculate

Research on Information Sharing Mechanism of Network Organization Based on Evolutionary Game

Science.gov (United States)

Wang, Lin; Liu, Gaozhi

2018-02-01

This article first elaborates the concept and effect of network organization, and the ability to share information is analyzed, secondly introduces the evolutionary game theory, network organization for information sharing all kinds of limitations, establishes the evolutionary game model, analyzes the dynamic evolution of network organization of information sharing, through reasoning and evolution. The network information sharing by the initial state and two sides of the game payoff matrix of excess profits and information is the information sharing of cost and risk sharing are the influence of network organization node information sharing decision.

Evolution of the large Deep Space Network antennas

Science.gov (United States)

Imbriale, William A.

1991-12-01

The evolution of the largest antenna of the US NASA Deep Space Network (DSN) is described. The design, performance analysis, and measurement techniques, beginning with its initial 64-m operation at S-band (2295 MHz) in 1966 and continuing through the present ka-band (32-GHz) operation at 70 m, is described. Although their diameters and mountings differ, these parabolic antennas all employ a Cassegrainian feed system, and each antenna dish surface is constructed of precision-shaped perforated-aluminum panels that are secured to an open steel framework

An Airway Network Flow Assignment Approach Based on an Efficient Multiobjective Optimization Framework

Directory of Open Access Journals (Sweden)

Xiangmin Guan

2015-01-01

Full Text Available Considering reducing the airspace congestion and the flight delay simultaneously, this paper formulates the airway network flow assignment (ANFA problem as a multiobjective optimization model and presents a new multiobjective optimization framework to solve it. Firstly, an effective multi-island parallel evolution algorithm with multiple evolution populations is employed to improve the optimization capability. Secondly, the nondominated sorting genetic algorithm II is applied for each population. In addition, a cooperative coevolution algorithm is adapted to divide the ANFA problem into several low-dimensional biobjective optimization problems which are easier to deal with. Finally, in order to maintain the diversity of solutions and to avoid prematurity, a dynamic adjustment operator based on solution congestion degree is specifically designed for the ANFA problem. Simulation results using the real traffic data from China air route network and daily flight plans demonstrate that the proposed approach can improve the solution quality effectively, showing superiority to the existing approaches such as the multiobjective genetic algorithm, the well-known multiobjective evolutionary algorithm based on decomposition, and a cooperative coevolution multiobjective algorithm as well as other parallel evolution algorithms with different migration topology.

Evolution of cooperation under social pressure in multiplex networks.

Science.gov (United States)

Pereda, María

2016-09-01

In this work, we aim to contribute to the understanding of human prosocial behavior by studying the influence that a particular form of social pressure, "being watched," has on the evolution of cooperative behavior. We study how cooperation emerges in multiplex complex topologies by analyzing a particular bidirectionally coupled dynamics on top of a two-layer multiplex network (duplex). The coupled dynamics appears between the prisoner's dilemma game in a network and a threshold cascade model in the other. The threshold model is intended to abstract the behavior of a network of vigilant nodes that impose the pressure of being observed altering hence the temptation to defect of the dilemma. Cooperation or defection in the game also affects the state of a node of being vigilant. We analyze these processes on different duplex networks structures and assess the influence of the topology, average degree and correlated multiplexity, on the outcome of cooperation. Interestingly, we find that the social pressure of vigilance may impact cooperation positively or negatively, depending on the duplex structure, specifically the degree correlations between layers is determinant. Our results give further quantitative insights in the promotion of cooperation under social pressure.

The evolution of your success lies at the centre of your co-authorship network.

Directory of Open Access Journals (Sweden)

Sandra Servia-Rodríguez

Full Text Available Collaboration among scholars and institutions is progressively becoming essential to the success of research grant procurement and to allow the emergence and evolution of scientific disciplines. Our work focuses on analysing if the volume of collaborations of one author together with the relevance of his collaborators is somewhat related to his research performance over time. In order to prove this relation we collected the temporal distributions of scholars' publications and citations from the Google Scholar platform and the co-authorship network (of Computer Scientists underlying the well-known DBLP bibliographic database. By the application of time series clustering, social network analysis and non-parametric statistics, we observe that scholars with similar publications (citations patterns also tend to have a similar centrality in the co-authorship network. To our knowledge, this is the first work that considers success evolution with respect to co-authorship.

The Evolution of Network-based Business Models Illustrated Through the Case Study of an Entrepreneurship Project

Directory of Open Access Journals (Sweden)

Morten Lund

2014-08-01

Full Text Available Purpose: Existing frameworks for understanding and analyzing the value configuration and structuring of partnerships in relation such network-based business models are found to be inferior. The purpose of this paper is therefore to broaden our understanding of how business models may change over time and how the role of strategic partners may differ over time too. Design/methodology/approach: A longitudinal case study spanning over years and mobilising multiple qualitative methods such as interviews, observation and participative observation forms the basis of the data collection. Findings: This paper illustrates how a network-based business model arises and evolves and how the forces of a network structure impact the development of its partner relationships. The contribution of this article is to understanding how partners positioned around a business model can be organized into a network-based business model that generates additional value for the core business model and for both the partners and the customers. Research limitations/implications: The results should be taken with caution as they are based on the case study of a single network-based business model. Practical implications: Managers can gain insight into barriers and enablers relating to different types of loose organisations and how to best manage such relationships and interactions Originality/value: This study adds value to the existing literature by reflecting the dynamics created in the interactions between a business model’s strategic partners and how a how a business model can evolve in a series of distinct phases

Pleiotropy constrains the evolution of protein but not regulatory sequences in a transcription regulatory network influencing complex social behaviours

Directory of Open Access Journals (Sweden)

Daria eMolodtsova

2014-12-01

Full Text Available It is increasingly apparent that genes and networks that influence complex behaviour are evolutionary conserved, which is paradoxical considering that behaviour is labile over evolutionary timescales. How does adaptive change in behaviour arise if behaviour is controlled by conserved, pleiotropic, and likely evolutionary constrained genes? Pleiotropy and connectedness are known to constrain the general rate of protein evolution, prompting some to suggest that the evolution of complex traits, including behaviour, is fuelled by regulatory sequence evolution. However, we seldom have data on the strength of selection on mutations in coding and regulatory sequences, and this hinders our ability to study how pleiotropy influences coding and regulatory sequence evolution. Here we use population genomics to estimate the strength of selection on coding and regulatory mutations for a transcriptional regulatory network that influences complex behaviour of honey bees. We found that replacement mutations in highly connected transcription factors and target genes experience significantly stronger negative selection relative to weakly connected transcription factors and targets. Adaptively evolving proteins were significantly more likely to reside at the periphery of the regulatory network, while proteins with signs of negative selection were near the core of the network. Interestingly, connectedness and network structure had minimal influence on the strength of selection on putative regulatory sequences for both transcription factors and their targets. Our study indicates that adaptive evolution of complex behaviour can arise because of positive selection on protein-coding mutations in peripheral genes, and on regulatory sequence mutations in both transcription factors and their targets throughout the network.

Overlay networks toward information networking

CERN Document Server

Tarkoma, Sasu

2010-01-01

With their ability to solve problems in massive information distribution and processing, while keeping scaling costs low, overlay systems represent a rapidly growing area of R&D with important implications for the evolution of Internet architecture. Inspired by the author's articles on content based routing, Overlay Networks: Toward Information Networking provides a complete introduction to overlay networks. Examining what they are and what kind of structures they require, the text covers the key structures, protocols, and algorithms used in overlay networks. It reviews the current state of th

Opinion evolution based on cellular automata rules in small world networks

Science.gov (United States)

Shi, Xiao-Ming; Shi, Lun; Zhang, Jie-Fang

2010-03-01

In this paper, we apply cellular automata rules, which can be given by a truth table, to human memory. We design each memory as a tracking survey mode that keeps the most recent three opinions. Each cellular automata rule, as a personal mechanism, gives the final ruling in one time period based on the data stored in one's memory. The key focus of the paper is to research the evolution of people's attitudes to the same question. Based on a great deal of empirical observations from computer simulations, all the rules can be classified into 20 groups. We highlight the fact that the phenomenon shown by some rules belonging to the same group will be altered within several steps by other rules in different groups. It is truly amazing that, compared with the last hundreds of presidential voting in America, the eras of important events in America's history coincide with the simulation results obtained by our model.

Evolution of SH2 domains and phosphotyrosine signalling networks

Science.gov (United States)

Liu, Bernard A.; Nash, Piers D.

2012-01-01

Src homology 2 (SH2) domains mediate selective protein–protein interactions with tyrosine phosphorylated proteins, and in doing so define specificity of phosphotyrosine (pTyr) signalling networks. SH2 domains and protein-tyrosine phosphatases expand alongside protein-tyrosine kinases (PTKs) to coordinate cellular and organismal complexity in the evolution of the unikont branch of the eukaryotes. Examination of conserved families of PTKs and SH2 domain proteins provides fiduciary marks that trace the evolutionary landscape for the development of complex cellular systems in the proto-metazoan and metazoan lineages. The evolutionary provenance of conserved SH2 and PTK families reveals the mechanisms by which diversity is achieved through adaptations in tissue-specific gene transcription, altered ligand binding, insertions of linear motifs and the gain or loss of domains following gene duplication. We discuss mechanisms by which pTyr-mediated signalling networks evolve through the development of novel and expanded families of SH2 domain proteins and the elaboration of connections between pTyr-signalling proteins. These changes underlie the variety of general and specific signalling networks that give rise to tissue-specific functions and increasingly complex developmental programmes. Examination of SH2 domains from an evolutionary perspective provides insight into the process by which evolutionary expansion and modification of molecular protein interaction domain proteins permits the development of novel protein-interaction networks and accommodates adaptation of signalling networks. PMID:22889907

Modelling of synchronisation and energy performance of FBE- and LBE-based standalone LTE-U networks

Directory of Open Access Journals (Sweden)

Jiamin Li

2017-06-01

Full Text Available Without the aid of licensed channel, deploying long-term evolution (LTE networks over unlicensed spectrum (named standalone LTE-U networks faces the difficulty of establishing and maintaining synchronisation between user equipments and base stations. In this work, considering the two modes of listen-before-talk-based channel access scheme, frame-based equipment (FBE and load-based equipment (LBE, the authors propose analytical frameworks to study the successful probability of synchronisation and the energy consumption of synchronisation in a standalone LTE-U network. Specifically, for the LBE mode, the authors also propose a Lattice-Poisson algorithm-based approach to derive the distribution of the channel non-occupancy period of a standalone LTE-U network. Furthermore, the authors explore the impact of diverse protocol parameters of both FBE and LBE modes on the two studied performance metrics. Simulation results demonstrate the accuracy of the analysis, and shed some light on the selection of FBE and LBE for standalone LTE-U networks, in terms of synchronisation, energy consumption, and throughput of standalone LTE-U and Wi-Fi networks.

Managerial capabilities of the home base in an intra-organisational global network

DEFF Research Database (Denmark)

Mykhaylenko, Alona

of the HB change in the process of its global intra-organisational network evolution. In particular, the four papers constituting this thesis investigate how global intra-organisational networks evolve, how the types of network management capabilities of the HB change along with such network evolution....... This investigation was conducted through a retrospective longitudinal case study of one Danish original equipment manufacturer and its three subsidiaries in China, Slovakia, and the US. The findings, first of all, support, extend, and modify the revised Uppsala globalisation model with regard to the types...

Evolution and development of brain networks: from Caenorhabditis elegans to Homo sapiens.

Science.gov (United States)

Kaiser, Marcus; Varier, Sreedevi

2011-01-01

Neural networks show a progressive increase in complexity during the time course of evolution. From diffuse nerve nets in Cnidaria to modular, hierarchical systems in macaque and humans, there is a gradual shift from simple processes involving a limited amount of tasks and modalities to complex functional and behavioral processing integrating different kinds of information from highly specialized tissue. However, studies in a range of species suggest that fundamental similarities, in spatial and topological features as well as in developmental mechanisms for network formation, are retained across evolution. 'Small-world' topology and highly connected regions (hubs) are prevalent across the evolutionary scale, ensuring efficient processing and resilience to internal (e.g. lesions) and external (e.g. environment) changes. Furthermore, in most species, even the establishment of hubs, long-range connections linking distant components, and a modular organization, relies on similar mechanisms. In conclusion, evolutionary divergence leads to greater complexity while following essential developmental constraints.

Building Service Delivery Networks: Partnership Evolution Among Children's Behavioral Health Agencies in Response to New Funding.

Science.gov (United States)

Bunger, Alicia C; Doogan, Nathan J; Cao, Yiwen

2014-12-01

Meeting the complex needs of youth with behavioral health problems requires a coordinated network of community-based agencies. Although fiscal scarcity or retrenchment can limit coordinated services, munificence can stimulate service delivery partnerships as agencies expand programs, hire staff, and spend more time coordinating services. This study examines the 2-year evolution of referral and staff expertise sharing networks in response to substantial new funding for services within a regional network of children's mental health organizations. Quantitative network survey data were collected from directors of 22 nonprofit organizations that receive funding from a county government-based behavioral health service fund. Both referral and staff expertise sharing networks changed over time, but results of a stochastic actor-oriented model of network dynamics suggest the nature of this change varies for these networks. Agencies with higher numbers of referral and staff expertise sharing partners tend to maintain these ties and/or develop new relationships over the 2 years. Agencies tend to refer to agencies they trust, but trust was not associated with staff expertise sharing ties. However, agencies maintain or form staff expertise sharing ties with referral partners, or with organizations that provide similar services. In addition, agencies tend to reciprocate staff expertise sharing, but not referrals. Findings suggest that during periods of resource munificence and service expansion, behavioral health organizations build service delivery partnerships in complex ways that build upon prior collaborative history and coordinate services among similar types of providers. Referral partnerships can pave the way for future information sharing relationships.

Mapping the evolution of scientific ideas

Energy Technology Data Exchange (ETDEWEB)

Roberts, David C [Los Alamos National Laboratory; Herrera, Mark [UNIV OF MARYLAND; Gulbahce, Natali [NORTHEASTERN UNIV

2008-01-01

The importance of interdisciplinary research is ever increasing as challenging world problems require expertise across diverse fields. Despite the apparent conceptual boundaries of scientific fields, a formal description for their evolution is lacking. Here we describe a novel approach to study the dynamics and evolution of scientific ideas and fields using a network-based analysis. We build a idea network consisting of American Physical Society Pacs numbers as nodes representing scientific concepts. Two Pacs numbers are linked in the network if there exist publications that reference them simultaneously. We locate scientific fields using an overlapping community finding algorithm and describe the time evolution of these fields using a community evolution method over the course of 1985-2006. We find that the communities we find map to scientific fields, the lifetime of these fields strongly depends on their size, impact and activity, and longest living communities are least volatile. The described approach to quantify the evolution of ideas is expected to be relevant in making predictions about the future of science and how to guide its development.

Heading in the right direction: thermodynamics-based network analysis and pathway engineering.

Science.gov (United States)

Ataman, Meric; Hatzimanikatis, Vassily

2015-12-01

Thermodynamics-based network analysis through the introduction of thermodynamic constraints in metabolic models allows a deeper analysis of metabolism and guides pathway engineering. The number and the areas of applications of thermodynamics-based network analysis methods have been increasing in the last ten years. We review recent applications of these methods and we identify the areas that such analysis can contribute significantly, and the needs for future developments. We find that organisms with multiple compartments and extremophiles present challenges for modeling and thermodynamics-based flux analysis. The evolution of current and new methods must also address the issues of the multiple alternatives in flux directionalities and the uncertainties and partial information from analytical methods. Copyright © 2015 The Authors. Published by Elsevier Ltd.. All rights reserved.

The evolution of technology-based alliance networks in pharmaceutical biotechnology

NARCIS (Netherlands)

Gilsing, V.A.; Cloodt, M.M.A.H.; Roijakkers, A.H.W.M.

2008-01-01

The dominant focus in the literature until now has been on how networks enable and constrain action, whereas the question what factors enable and constrain networks has been largely ignored. To fill this void, the paper aims to develop an understanding of the role of ex-ante factors and processes

A Unified Framework for Complex Networks with Degree Trichotomy Based on Markov Chains.

Science.gov (United States)

Hui, David Shui Wing; Chen, Yi-Chao; Zhang, Gong; Wu, Weijie; Chen, Guanrong; Lui, John C S; Li, Yingtao

2017-06-16

This paper establishes a Markov chain model as a unified framework for describing the evolution processes in complex networks. The unique feature of the proposed model is its capability in addressing the formation mechanism that can reflect the "trichotomy" observed in degree distributions, based on which closed-form solutions can be derived. Important special cases of the proposed unified framework are those classical models, including Poisson, Exponential, Power-law distributed networks. Both simulation and experimental results demonstrate a good match of the proposed model with real datasets, showing its superiority over the classical models. Implications of the model to various applications including citation analysis, online social networks, and vehicular networks design, are also discussed in the paper.

The development and evolution of landform based on neotectonic ...

Indian Academy of Sciences (India)

Lingmin Zhong

2018-02-14

Feb 14, 2018 ... involving integration of data from the aspects of structural geology ... regions is very sensitive to crustal movement such as folding and faulting ...... drainage network evolution in the upper Narmada Valley: Implication to ...

Micro-droplet based directed evolution outperforms conventional laboratory evolution

DEFF Research Database (Denmark)

Sjostrom, Staffan L.; Huang, Mingtao; Nielsen, Jens

2014-01-01

We present droplet adaptive laboratory evolution (DrALE), a directed evolution method used to improve industrial enzyme producing microorganisms for e.g. feedstock digestion. DrALE is based linking a desired phenotype to growth rate allowing only desired cells to proliferate. Single cells are con...... a whole-genome mutated library of yeast cells for α-amylase activity....

Dynamical graph theory networks techniques for the analysis of sparse connectivity networks in dementia

Science.gov (United States)

Tahmassebi, Amirhessam; Pinker-Domenig, Katja; Wengert, Georg; Lobbes, Marc; Stadlbauer, Andreas; Romero, Francisco J.; Morales, Diego P.; Castillo, Encarnacion; Garcia, Antonio; Botella, Guillermo; Meyer-Bäse, Anke

2017-05-01

Graph network models in dementia have become an important computational technique in neuroscience to study fundamental organizational principles of brain structure and function of neurodegenerative diseases such as dementia. The graph connectivity is reflected in the connectome, the complete set of structural and functional connections of the graph network, which is mostly based on simple Pearson correlation links. In contrast to simple Pearson correlation networks, the partial correlations (PC) only identify direct correlations while indirect associations are eliminated. In addition to this, the state-of-the-art techniques in brain research are based on static graph theory, which is unable to capture the dynamic behavior of the brain connectivity, as it alters with disease evolution. We propose a new research avenue in neuroimaging connectomics based on combining dynamic graph network theory and modeling strategies at different time scales. We present the theoretical framework for area aggregation and time-scale modeling in brain networks as they pertain to disease evolution in dementia. This novel paradigm is extremely powerful, since we can derive both static parameters pertaining to node and area parameters, as well as dynamic parameters, such as system's eigenvalues. By implementing and analyzing dynamically both disease driven PC-networks and regular concentration networks, we reveal differences in the structure of these network that play an important role in the temporal evolution of this disease. The described research is key to advance biomedical research on novel disease prediction trajectories and dementia therapies.

Effect of users' opinion evolution on information diffusion in online social networks

Science.gov (United States)

Zhu, Hengmin; Kong, Yuehan; Wei, Jing; Ma, Jing

2018-02-01

The process of topic propagation always interweaves information diffusion and opinion evolution, but most previous works studied the models of information diffusion and opinion evolution separately, and seldom focused on their interaction of each other. To shed light on the effect of users' opinion evolution on information diffusion in online social networks, we proposed a model which incorporates opinion evolution into the process of topic propagation. Several real topics propagating on Sina Microblog were collected to analyze individuals' propagation intentions, and different propagation intentions were considered in the model. The topic propagation was simulated to explore the impact of different opinion distributions and intervention with opposite opinion on information diffusion. Results show that the topic with one-sided opinions can spread faster and more widely, and intervention with opposite opinion is an effective measure to guide the topic propagation. The earlier to intervene, the more effectively the topic propagation would be guided.

Evidence for the additions of clustered interacting nodes during the evolution of protein interaction networks from network motifs

Directory of Open Access Journals (Sweden)

Guo Hao

2011-05-01

Full Text Available Abstract Background High-throughput screens have revealed large-scale protein interaction networks defining most cellular functions. How the proteins were added to the protein interaction network during its growth is a basic and important issue. Network motifs represent the simplest building blocks of cellular machines and are of biological significance. Results Here we study the evolution of protein interaction networks from the perspective of network motifs. We find that in current protein interaction networks, proteins of the same age class tend to form motifs and such co-origins of motif constituents are affected by their topologies and biological functions. Further, we find that the proteins within motifs whose constituents are of the same age class tend to be densely interconnected, co-evolve and share the same biological functions, and these motifs tend to be within protein complexes. Conclusions Our findings provide novel evidence for the hypothesis of the additions of clustered interacting nodes and point out network motifs, especially the motifs with the dense topology and specific function may play important roles during this process. Our results suggest functional constraints may be the underlying driving force for such additions of clustered interacting nodes.

Prospective study related to the evolution of energy distribution networks. Needs of evolution of technical and organisational models of energy distribution networks with respect to energy transition scenarios in the Provence-Alpes-Cote d'Azur region. Part 1 - Hypotheses and perspectives, Part 2 - Needs of network evolution. Study related to the impact of the electric vehicle and of photovoltaic production on electric distribution networks - Case study for Provence-Alpes-Cote d'Azur

International Nuclear Information System (INIS)

Dauphin, Francois; Fontaine, Frederick

2013-02-01

The first part of this document aims at presenting perspectives of emergence of new energy production, consumption and storage sources, and their impacts on energy (electricity, gas, heat) distribution and transport networks. It is based on two scenarios: the regional climate-air-energy scheme, and the regional Negawatt scenario. The objective was to select a limited number of aspects: solutions enabling an optimal injection of biogas produced in the concerned region, development of photovoltaic energy and electric vehicles and their impact on the balance of medium-voltage and low-voltage networks, and smart grid technologies and their possible impact on the optimisation of electric network management. The second part reports the detailed study of these issues. It more particularly addresses technical impacts of different sectors on electric and gas networks in Provence-Alpes-Cote d'Azur, technical, economic and organisational assets of smart grid technologies, investments policies and implementation planning, and resulting evolutions for energy markets. Related documents published by ERDF and GrDF are provided

Simulated evolution of fractures and fracture networks subject to thermal cooling: A coupled discrete element and heat conduction model

Energy Technology Data Exchange (ETDEWEB)

Huang, Hai; Plummer, Mitchell; Podgorney, Robert

2013-02-01

Advancement of EGS requires improved prediction of fracture development and growth during reservoir stimulation and long-term operation. This, in turn, requires better understanding of the dynamics of the strongly coupled thermo-hydro-mechanical (THM) processes within fractured rocks. We have developed a physically based rock deformation and fracture propagation simulator by using a quasi-static discrete element model (DEM) to model mechanical rock deformation and fracture propagation induced by thermal stress and fluid pressure changes. We also developed a network model to simulate fluid flow and heat transport in both fractures and porous rock. In this paper, we describe results of simulations in which the DEM model and network flow & heat transport model are coupled together to provide realistic simulation of the changes of apertures and permeability of fractures and fracture networks induced by thermal cooling and fluid pressure changes within fractures. Various processes, such as Stokes flow in low velocity pores, convection-dominated heat transport in fractures, heat exchange between fluid-filled fractures and solid rock, heat conduction through low-permeability matrices and associated mechanical deformations are all incorporated into the coupled model. The effects of confining stresses, developing thermal stress and injection pressure on the permeability evolution of fracture and fracture networks are systematically investigated. Results are summarized in terms of implications for the development and evolution of fracture distribution during hydrofracturing and thermal stimulation for EGS.

A Cluster-based Approach Towards Detecting and Modeling Network Dictionary Attacks

Directory of Open Access Journals (Sweden)

A. Tajari Siahmarzkooh

2016-12-01

Full Text Available In this paper, we provide an approach to detect network dictionary attacks using a data set collected as flows based on which a clustered graph is resulted. These flows provide an aggregated view of the network traffic in which the exchanged packets in the network are considered so that more internally connected nodes would be clustered. We show that dictionary attacks could be detected through some parameters namely the number and the weight of clusters in time series and their evolution over the time. Additionally, the Markov model based on the average weight of clusters,will be also created. Finally, by means of our suggested model, we demonstrate that artificial clusters of the flows are created for normal and malicious traffic. The results of the proposed approach on CAIDA 2007 data set suggest a high accuracy for the model and, therefore, it provides a proper method for detecting the dictionary attack.

Network evolution induced by the dynamical rules of two populations

Science.gov (United States)

Platini, Thierry; Zia, R. K. P.

2010-10-01

We study the dynamical properties of a finite dynamical network composed of two interacting populations, namely extrovert (a) and introvert (b). In our model, each group is characterized by its size (Na and Nb) and preferred degree (κa and \\kappa_b\\ll \\kappa_a ). The network dynamics is governed by the competing microscopic rules of each population that consist of the creation and destruction of links. Starting from an unconnected network, we give a detailed analysis of the mean field approach which is compared to Monte Carlo simulation data. The time evolution of the restricted degrees langkbbrang and langkabrang presents three time regimes and a non-monotonic behavior well captured by our theory. Surprisingly, when the population sizes are equal Na = Nb, the ratio of the restricted degree θ0 = langkabrang/langkbbrang appears to be an integer in the asymptotic limits of the three time regimes. For early times (defined by t introverts remains constant while the number of connections increases linearly in the extrovert population. Finally, due to the competing dynamics, the network presents a frustrated stationary state characterized by a ratio θ0 = 3.

An overview of structurally complex network-based modeling of public opinion in the “We the Media” era

Science.gov (United States)

Wang, Guanghui; Wang, Yufei; Liu, Yijun; Chi, Yuxue

2018-05-01

As the transmission of public opinion on the Internet in the “We the Media” era tends to be supraterritorial, concealed and complex, the traditional “point-to-surface” transmission of information has been transformed into “point-to-point” reciprocal transmission. A foundation for studies of the evolution of public opinion and its transmission on the Internet in the “We the Media” era can be laid by converting the massive amounts of fragmented information on public opinion that exists on “We the Media” platforms into structurally complex networks of information. This paper describes studies of structurally complex network-based modeling of public opinion on the Internet in the “We the Media” era from the perspective of the development and evolution of complex networks. The progress that has been made in research projects relevant to the structural modeling of public opinion on the Internet is comprehensively summarized. The review considers aspects such as regular grid-based modeling of the rules that describe the propagation of public opinion on the Internet in the “We the Media” era, social network modeling, dynamic network modeling, and supernetwork modeling. Moreover, an outlook for future studies that address complex network-based modeling of public opinion on the Internet is put forward as a summary from the perspective of modeling conducted using the techniques mentioned above.

Structure and evolution of the global seafood trade network

Science.gov (United States)

Gephart, Jessica A.; Pace, Michael L.

2015-12-01

The food production system is increasingly global and seafood is among the most highly traded commodities. Global trade can improve food security by providing access to a greater variety of foods, increasing wealth, buffering against local supply shocks, and benefit the environment by increasing overall use efficiency for some resources. However, global trade can also expose countries to external supply shocks and degrade the environment by increasing resource demand and loosening feedbacks between consumers and the impacts of food production. As a result, changes in global food trade can have important implications for both food security and the environmental impacts of production. Measurements of globalization and the environmental impacts of food production require data on both total trade and the origin and destination of traded goods (the network structure). While the global trade network of agricultural and livestock products has previously been studied, seafood products have been excluded. This study describes the structure and evolution of the global seafood trade network, including metrics quantifying the globalization of seafood, shifts in bilateral trade flows, changes in centrality and comparisons of seafood to agricultural and industrial trade networks. From 1994 to 2012 the number of countries trading in the network remained relatively constant, while the number of trade partnerships increased by over 65%. Over this same period, the total quantity of seafood traded increased by 58% and the value increased 85% in real terms. These changes signify the increasing globalization of seafood products. Additionally, the trade patterns in the network indicate: increased influence of Thailand and China, strengthened intraregional trade, and increased exports from South America and Asia. In addition to characterizing these network changes, this study identifies data needs in order to connect seafood trade with environmental impacts and food security outcomes.

Day-to-day evolution of the traffic network with Advanced Traveler Information System

International Nuclear Information System (INIS)

Han Linghui; Sun Huijun; Wu Jianjun; Zhu Chengjuan

2011-01-01

Highlights: → We develop a dynamical system with Advanced Travelers Information System (ATIS). → We use the dynamical system to study stability of the traffic network with ATIS. → It is found that some periodic attractors appear in some cases. → A road pricing is implemented to alleviate the instability of the traffic network with ATIS. - Abstract: Since the notion of user equilibrium (UE) was proposed by Wardrop , it has become a cornerstone for traffic assignment analysis. But, it is not sufficient to only ask whether equilibrium exists or not; it is equally important to ask whether and how the system can achieve equilibrium. Meanwhile, stability is an important performance in the sense that if equilibrium is unsustainable, both the equilibrium and the trajectory are sensitive to disturbances, even a small perturbation will result in the system evolution away from the equilibrium point. These incentive a growing interest in day-to-day dynamics. In this paper, we develop a dynamical system with Advanced Traveler Information System (ATIS) and study the stability of the network with ATIS. A simple network is used to simulate the model, and the results show that there exist periodic attractors in the traffic network in some cases (for example, the market penetration level of ATIS is 0.25 and traffic demand is 2 unit). It is found that the logit parameter of the dynamical model and the traffic demand can also affect the stability of the traffic network. More periodic attractors appear in the system when the traffic demand is large and the low logit parameter can delay the appearance of periodic attractors. By simulation, it can be concluded that if the range of the periodic attractors' domain of the simple network is known, the road pricing based on the range of the attraction domain is effective to alleviate the instability of the system.

Selfish cellular networks and the evolution of complex organisms.

Science.gov (United States)

Kourilsky, Philippe

2012-03-01

Human gametogenesis takes years and involves many cellular divisions, particularly in males. Consequently, gametogenesis provides the opportunity to acquire multiple de novo mutations. A significant portion of these is likely to impact the cellular networks linking genes, proteins, RNA and metabolites, which constitute the functional units of cells. A wealth of literature shows that these individual cellular networks are complex, robust and evolvable. To some extent, they are able to monitor their own performance, and display sufficient autonomy to be termed "selfish". Their robustness is linked to quality control mechanisms which are embedded in and act upon the individual networks, thereby providing a basis for selection during gametogenesis. These selective processes are equally likely to affect cellular functions that are not gamete-specific, and the evolution of the most complex organisms, including man, is therefore likely to occur via two pathways: essential housekeeping functions would be regulated and evolve during gametogenesis within the parents before being transmitted to their progeny, while classical selection would operate on other traits of the organisms that shape their fitness with respect to the environment. Copyright © 2012 Académie des sciences. Published by Elsevier SAS. All rights reserved.

Improved Differential Evolution Algorithm for Wireless Sensor Network Coverage Optimization

Directory of Open Access Journals (Sweden)

Xing Xu

2014-04-01

Full Text Available In order to serve for the ecological monitoring efficiency of Poyang Lake, an improved hybrid algorithm, mixed with differential evolution and particle swarm optimization, is proposed and applied to optimize the coverage problem of wireless sensor network. And then, the affect of the population size and the number of iterations on the coverage performance are both discussed and analyzed. The four kinds of statistical results about the coverage rate are obtained through lots of simulation experiments.

Competition, transmission and pattern evolution: A network analysis of global oil trade

International Nuclear Information System (INIS)

Zhang, Hai-Ying; Ji, Qiang; Fan, Ying

2014-01-01

This paper studies the competition among oil importers using complex network theory, combined with several alternative measures of competition intensity, to analyze the evolution of the pattern and transmission of oil-trading competition. The results indicate that oil trade has formed a global competition pattern and that the role played by the Asian-Pacific region in the evolution of this competition pattern is becoming increasingly prominent. In addition, global competition intensity has continued to rise, and non-OECD countries have become the main driving force for this increase in global competition intensity. The large oil importers are the most significant parts of the global oil-trading competition pattern. They are not only the major participants in the competition for oil resources but also play important roles in the transmission of oil-trading competition. China and the United States especially display the feature of globalization, whose impacts of transmission reach across the whole oil-trading competition network. Finally, a “5C” (changeability, contestability, cooperation, commitment and circumstances) policy framework is put forward to maintain the stability of oil trade and improve the energy security of oil importers in various aspects. - Highlights: • An oil-trading competition network is constructed using complex network theory. • Oil trade has formed a global competition pattern and its intensity has kept rising. • The status of the Asian-Pacific region in the competition pattern becomes prominent. • Large oil importers play important roles in transmitting the trading competition. • A “5C” policy framework is put forward to cope with the intensive competition

Implementation and Outcomes of a Collaborative Multi-Center Network Aimed at Web-Based Cognitive Training - COGWEB Network.

Science.gov (United States)

Tedim Cruz, Vítor; Pais, Joana; Ruano, Luis; Mateus, Cátia; Colunas, Márcio; Alves, Ivânia; Barreto, Rui; Conde, Eduardo; Sousa, Andreia; Araújo, Isabel; Bento, Virgílio; Coutinho, Paula; Rocha, Nelson

2014-01-01

Cognitive care for the most prevalent neurologic and psychiatric conditions will only improve through the implementation of new sustainable approaches. Innovative cognitive training methodologies and collaborative professional networks are necessary evolutions in the mental health sector. The objective of the study was to describe the implementation process and early outcomes of a nationwide multi-organizational network supported on a Web-based cognitive training system (COGWEB). The setting for network implementation was the Portuguese mental health system and the hospital-, academic-, community-based institutions and professionals providing cognitive training. The network started in August 2012, with 16 centers, and was monitored until September 2013 (inclusions were open). After onsite training, all were allowed to use COGWEB in their clinical or research activities. For supervision and maintenance were implemented newsletters, questionnaires, visits and webinars. The following outcomes were prospectively measured: (1) number, (2) type, (3) time to start, and (4) activity state of centers; age, gender, level of education, and medical diagnosis of patients enrolled. The network included 68 professionals from 41 centers, (33/41) 80% clinical, (8/41) 19% nonclinical. A total of 298 patients received cognitive training; 45.3% (n=135) female, mean age 54.4 years (SD 18.7), mean educational level 9.8 years (SD 4.8). The number enrolled each month increased significantly (r=0.6; P=.031). At 12 months, 205 remained on treatment. The major causes of cognitive impairment were: (1) neurodegenerative (115/298, 38.6%), (2) structural brain lesions (63/298, 21.1%), (3) autoimmune (40/298, 13.4%), (4) schizophrenia (30/298, 10.1%), and (5) others (50/298, 16.8%). The comparison of the patient profiles, promoter versus all other clinical centers, showed significant increases in the diversity of causes and spectrums of ages and education. Over its first year, there was a major

Room temperature synthesis of heptazine-based microporous polymer networks as photocatalysts for hydrogen evolution.

Science.gov (United States)

Kailasam, Kamalakannan; Schmidt, Johannes; Bildirir, Hakan; Zhang, Guigang; Blechert, Siegfried; Wang, Xinchen; Thomas, Arne

2013-06-25

Two emerging material classes are combined in this work, namely polymeric carbon nitrides and microporous polymer networks. The former, polymeric carbon nitrides, are composed of amine-bridged heptazine moieties and showed interesting performance as a metal-free photocatalyst. These materials have, however, to be prepared at high temperatures, making control of their chemical structure difficult. The latter, microporous polymer networks have received increasing interest due to their high surface area, giving rise to interesting applications in gas storage or catalysis. Here, the central building block of carbon nitrides, a functionalized heptazine as monomer, and tecton are used to create microporous polymer networks. The resulting heptazine-based microporous polymers show high porosity, while their chemical structure resembles the ones of carbon nitrides. The polymers show activity for the photocatalytic production of hydrogen from water, even under visible light illumination. Copyright © 2013 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim.

Prebiological evolution and the metabolic origins of life.

Science.gov (United States)

Pratt, Andrew J

2011-01-01

The chemoton model of cells posits three subsystems: metabolism, compartmentalization, and information. A specific model for the prebiological evolution of a reproducing system with rudimentary versions of these three interdependent subsystems is presented. This is based on the initial emergence and reproduction of autocatalytic networks in hydrothermal microcompartments containing iron sulfide. The driving force for life was catalysis of the dissipation of the intrinsic redox gradient of the planet. The codependence of life on iron and phosphate provides chemical constraints on the ordering of prebiological evolution. The initial protometabolism was based on positive feedback loops associated with in situ carbon fixation in which the initial protometabolites modified the catalytic capacity and mobility of metal-based catalysts, especially iron-sulfur centers. A number of selection mechanisms, including catalytic efficiency and specificity, hydrolytic stability, and selective solubilization, are proposed as key determinants for autocatalytic reproduction exploited in protometabolic evolution. This evolutionary process led from autocatalytic networks within preexisting compartments to discrete, reproducing, mobile vesicular protocells with the capacity to use soluble sugar phosphates and hence the opportunity to develop nucleic acids. Fidelity of information transfer in the reproduction of these increasingly complex autocatalytic networks is a key selection pressure in prebiological evolution that eventually leads to the selection of nucleic acids as a digital information subsystem and hence the emergence of fully functional chemotons capable of Darwinian evolution.

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...

Networks of Learning

Science.gov (United States)

Bettencourt, Luis; Kaiser, David

2004-03-01

Based on an a historically documented example of scientific discovery - Feynman diagrams as the main calculational tool of theoretical high energy Physics - we map the time evolution of the social network of early adopters through in the US, UK, Japan and the USSR. The spread of the technique for total number of users in each region is then modelled in terms of epidemic models, highlighting parallel and divergent aspects of this analogy. We also show that transient social arrangements develop as the idea is introduced and learned, which later disappear as the technique becomes common knowledge. Such early transient is characterized by abnormally low connectivity distribution powers and by high clustering. This interesting early non-equilibrium stage of network evolution is captured by a new dynamical model for network evolution, which coincides in its long time limit with familiar preferential aggregation dynamics.

Adventures in the evolution of a high-bandwidth network for central servers

International Nuclear Information System (INIS)

Swartz, K.L.; Cottrell, L.; Dart, M.

1994-08-01

In a small network, clients and servers may all be connected to a single Ethernet without significant performance concerns. As the number of clients on a network grows, the necessity of splitting the network into multiple sub-networks, each with a manageable number of clients, becomes clear. Less obvious is what to do with the servers. Group file servers on subnets and multihomed servers offer only partial solutions -- many other types of servers do not lend themselves to a decentralized model, and tend to collect on another, well-connected but overloaded Ethernet. The higher speed of FDDI seems to offer an easy solution, but in practice both expense and interoperability problems render FDDI a poor choice. Ethernet switches appear to permit cheaper and more reliable networking to the servers while providing an aggregate network bandwidth greater than a simple Ethernet. This paper studies the evolution of the server networks at SLAC. Difficulties encountered in the deployment of FDDI are described, as are the tools and techniques used to characterize the traffic patterns on the server network. Performance of Ethernet, FDDI, and switched Ethernet networks is analyzed, as are reliability and maintainability issues for these alternatives. The motivations for re-designing the SLAC general server network to use a switched Ethernet instead of FDDI are described, as are the reasons for choosing FDDI for the farm and firewall networks at SLAC. Guidelines are developed which may help in making this choice for other networks

Evolution of a G protein-coupled receptor response by mutations in regulatory network interactions

DEFF Research Database (Denmark)

Di Roberto, Raphaël B; Chang, Belinda; Trusina, Ala

2016-01-01

All cellular functions depend on the concerted action of multiple proteins organized in complex networks. To understand how selection acts on protein networks, we used the yeast mating receptor Ste2, a pheromone-activated G protein-coupled receptor, as a model system. In Saccharomyces cerevisiae......, Ste2 is a hub in a network of interactions controlling both signal transduction and signal suppression. Through laboratory evolution, we obtained 21 mutant receptors sensitive to the pheromone of a related yeast species and investigated the molecular mechanisms behind this newfound sensitivity. While...... demonstrate that a new receptor-ligand pair can evolve through network-altering mutations independently of receptor-ligand binding, and suggest a potential role for such mutations in disease....

Nonbinary Tree-Based Phylogenetic Networks.

Science.gov (United States)

Jetten, Laura; van Iersel, Leo

2018-01-01

Rooted phylogenetic networks are used to describe evolutionary histories that contain non-treelike evolutionary events such as hybridization and horizontal gene transfer. In some cases, such histories can be described by a phylogenetic base-tree with additional linking arcs, which can, for example, represent gene transfer events. Such phylogenetic networks are called tree-based. Here, we consider two possible generalizations of this concept to nonbinary networks, which we call tree-based and strictly-tree-based nonbinary phylogenetic networks. We give simple graph-theoretic characterizations of tree-based and strictly-tree-based nonbinary phylogenetic networks. Moreover, we show for each of these two classes that it can be decided in polynomial time whether a given network is contained in the class. Our approach also provides a new view on tree-based binary phylogenetic networks. Finally, we discuss two examples of nonbinary phylogenetic networks in biology and show how our results can be applied to them.

On Tree-Based Phylogenetic Networks.

Science.gov (United States)

Zhang, Louxin

2016-07-01

A large class of phylogenetic networks can be obtained from trees by the addition of horizontal edges between the tree edges. These networks are called tree-based networks. We present a simple necessary and sufficient condition for tree-based networks and prove that a universal tree-based network exists for any number of taxa that contains as its base every phylogenetic tree on the same set of taxa. This answers two problems posted by Francis and Steel recently. A byproduct is a computer program for generating random binary phylogenetic networks under the uniform distribution model.

Hybrid discrete-time neural networks.

Science.gov (United States)

Cao, Hongjun; Ibarz, Borja

2010-11-13

Hybrid dynamical systems combine evolution equations with state transitions. When the evolution equations are discrete-time (also called map-based), the result is a hybrid discrete-time system. A class of biological neural network models that has recently received some attention falls within this category: map-based neuron models connected by means of fast threshold modulation (FTM). FTM is a connection scheme that aims to mimic the switching dynamics of a neuron subject to synaptic inputs. The dynamic equations of the neuron adopt different forms according to the state (either firing or not firing) and type (excitatory or inhibitory) of their presynaptic neighbours. Therefore, the mathematical model of one such network is a combination of discrete-time evolution equations with transitions between states, constituting a hybrid discrete-time (map-based) neural network. In this paper, we review previous work within the context of these models, exemplifying useful techniques to analyse them. Typical map-based neuron models are low-dimensional and amenable to phase-plane analysis. In bursting models, fast-slow decomposition can be used to reduce dimensionality further, so that the dynamics of a pair of connected neurons can be easily understood. We also discuss a model that includes electrical synapses in addition to chemical synapses with FTM. Furthermore, we describe how master stability functions can predict the stability of synchronized states in these networks. The main results are extended to larger map-based neural networks.

Mapping the evolution of scientific fields.

Science.gov (United States)

Herrera, Mark; Roberts, David C; Gulbahce, Natali

2010-05-04

Despite the apparent cross-disciplinary interactions among scientific fields, a formal description of their evolution is lacking. Here we describe a novel approach to study the dynamics and evolution of scientific fields using a network-based analysis. We build an idea network consisting of American Physical Society Physics and Astronomy Classification Scheme (PACS) numbers as nodes representing scientific concepts. Two PACS numbers are linked if there exist publications that reference them simultaneously. We locate scientific fields using a community finding algorithm, and describe the time evolution of these fields over the course of 1985-2006. The communities we identify map to known scientific fields, and their age depends on their size and activity. We expect our approach to quantifying the evolution of ideas to be relevant for making predictions about the future of science and thus help to guide its development.

The evolution of network-based business models illustrated through the case study of an entrepreneurship project

DEFF Research Database (Denmark)

Lund, Morten; Nielsen, Christian

2014-01-01

can gain insight into barriers and enablers relating to different types of loose organisations and how to best manage such relationships and interactions Originality/value: This study adds value to the existing literature by reflecting the dynamics created in the interactions between a business model......-based business model that generates additional value for the core business model and for both the partners and the customers. Research limitations/implications: The results should be taken with caution as they are based on the case study of a single network-based business model. Practical implications: Managers......Purpose: Existing frameworks for understanding and analyzing the value configuration and structuring of partnerships in relation such network-based business models are found to be inferior. The purpose of this paper is therefore to broaden our understanding of how business models may change over...

Evolution of egoism on semi-directed and undirected Barabási-Albert networks

Science.gov (United States)

Lima, F. W. S.

2015-05-01

Through Monte Carlo simulations, we study the evolution of the four strategies: Ethnocentric, altruistic, egoistic and cosmopolitan in one community of individuals. Interactions and reproduction among computational agents are simulated on undirected and semi-directed Barabási-Albert (BA) networks. We study the Hammond-Axelrod (HA) model on undirected and semi-directed BA networks for the asexual reproduction case. With a small modification in the traditional HA model, our simulations showed that egoism wins, differently from other results found in the literature where ethnocentric strategy is common. Here, mechanisms such as reciprocity are absent.

Base Station Placement Algorithm for Large-Scale LTE Heterogeneous Networks.

Science.gov (United States)

Lee, Seungseob; Lee, SuKyoung; Kim, Kyungsoo; Kim, Yoon Hyuk

2015-01-01

Data traffic demands in cellular networks today are increasing at an exponential rate, giving rise to the development of heterogeneous networks (HetNets), in which small cells complement traditional macro cells by extending coverage to indoor areas. However, the deployment of small cells as parts of HetNets creates a key challenge for operators' careful network planning. In particular, massive and unplanned deployment of base stations can cause high interference, resulting in highly degrading network performance. Although different mathematical modeling and optimization methods have been used to approach various problems related to this issue, most traditional network planning models are ill-equipped to deal with HetNet-specific characteristics due to their focus on classical cellular network designs. Furthermore, increased wireless data demands have driven mobile operators to roll out large-scale networks of small long term evolution (LTE) cells. Therefore, in this paper, we aim to derive an optimum network planning algorithm for large-scale LTE HetNets. Recently, attempts have been made to apply evolutionary algorithms (EAs) to the field of radio network planning, since they are characterized as global optimization methods. Yet, EA performance often deteriorates rapidly with the growth of search space dimensionality. To overcome this limitation when designing optimum network deployments for large-scale LTE HetNets, we attempt to decompose the problem and tackle its subcomponents individually. Particularly noting that some HetNet cells have strong correlations due to inter-cell interference, we propose a correlation grouping approach in which cells are grouped together according to their mutual interference. Both the simulation and analytical results indicate that the proposed solution outperforms the random-grouping based EA as well as an EA that detects interacting variables by monitoring the changes in the objective function algorithm in terms of system

[The motive force of evolution based on the principle of organismal adjustment evolution.].

Science.gov (United States)

Cao, Jia-Shu

2010-08-01

From the analysis of the existing problems of the prevalent theories of evolution, this paper discussed the motive force of evolution based on the knowledge of the principle of organismal adjustment evolution to get a new understanding of the evolution mechanism. In the guide of Schrodinger's theory - "life feeds on negative entropy", the author proposed that "negative entropy flow" actually includes material flow, energy flow and information flow, and the "negative entropy flow" is the motive force for living and development. By modifying my own theory of principle of organismal adjustment evolution (not adaptation evolution), a new theory of "regulation system of organismal adjustment evolution involved in DNA, RNA and protein interacting with environment" is proposed. According to the view that phylogenetic development is the "integral" of individual development, the difference of negative entropy flow between organisms and environment is considered to be a motive force for evolution, which is a new understanding of the mechanism of evolution. Based on such understanding, evolution is regarded as "a changing process that one subsystem passes all or part of its genetic information to the next generation in a larger system, and during the adaptation process produces some new elements, stops some old ones, and thereby lasts in the larger system". Some other controversial questions related to evolution are also discussed.

Recruitment of pre-existing networks during the evolution of C4 photosynthesis.

Science.gov (United States)

Reyna-Llorens, Ivan; Hibberd, Julian M

2017-09-26

During C 4 photosynthesis, CO 2 is concentrated around the enzyme RuBisCO. The net effect is to reduce photorespiration while increasing water and nitrogen use efficiencies. Species that use C 4 photosynthesis have evolved independently from their C 3 ancestors on more than 60 occasions. Along with mimicry and the camera-like eye, the C 4 pathway therefore represents a remarkable example of the repeated evolution of a highly complex trait. In this review, we provide evidence that the polyphyletic evolution of C 4 photosynthesis is built upon pre-existing metabolic and genetic networks. For example, cells around veins of C 3 species show similarities to those of the C 4 bundle sheath in terms of C 4 acid decarboxylase activity and also the photosynthetic electron transport chain. Enzymes of C 4 photosynthesis function together in gluconeogenesis during early seedling growth of C 3 Arabidopsis thaliana Furthermore, multiple C 4 genes appear to be under control of both light and chloroplast signals in the ancestral C 3 state. We, therefore, hypothesize that relatively minor rewiring of pre-existing genetic and metabolic networks has facilitated the recurrent evolution of this trait. Understanding how these changes are likely to have occurred could inform attempts to install C 4 traits into C 3 crops.This article is part of the themed issue 'Enhancing photosynthesis in crop plants: targets for improvement'. © 2017 The Author(s).

Evolution of coauthorship networks: worldwide scientific production on leishmaniasis

Directory of Open Access Journals (Sweden)

Gregorio Gonzalez-Alcaide

2013-12-01

Full Text Available Introduction Collaboration is one of the defining features of contemporary scientific research, and it is particularly important with regard to neglected diseases that primarily affect developing countries. Methods The present study has identified publications on leishmaniasis in the Medline database from 1945 to 2010, analyzing them according to bibliometric indicators and statistics from social network analysis. Examining aspects such as scientific production, diachronic evolution, and collaboration and configuration of the research groups in the field, we have considered the different types of Leishmania studied and the institutional affiliation and nationality of the authors. Results Seven-hundred and thirty-five authors participate in 154 prominent research clusters or groups. Although the most predominant and consolidated collaborations are characterized by members from the same country studying the same type of Leishmania, there are also notable links between authors from different countries or who study different clinical strains of the disease. Brazil took the lead in this research, with numerous Brazilian researchers heading different clusters in the center of the collaboration network. Investigators from the USA, India, and European countries, such as France, Spain, the United Kingdom, and Italy, also stand out within the network. Conclusions Research should be fostered in countries such as Bangladesh, Nepal, Sudan, and Ethiopia, where there is a high prevalence of different forms of the disease but limited research development with reference authors integrated into the collaboration networks.

Exploring the patterns and evolution of self-organized urban street networks through modeling

Science.gov (United States)

Rui, Yikang; Ban, Yifang; Wang, Jiechen; Haas, Jan

2013-03-01

As one of the most important subsystems in cities, urban street networks have recently been well studied by using the approach of complex networks. This paper proposes a growing model for self-organized urban street networks. The model involves a competition among new centers with different values of attraction radius and a local optimal principle of both geometrical and topological factors. We find that with the model growth, the local optimization in the connection process and appropriate probability for the loop construction well reflect the evolution strategy in real-world cities. Moreover, different values of attraction radius in centers competition process lead to morphological change in patterns including urban network, polycentric and monocentric structures. The model succeeds in reproducing a large diversity of road network patterns by varying parameters. The similarity between the properties of our model and empirical results implies that a simple universal growth mechanism exists in self-organized cities.

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...

Evolution of the global virtual water trade network.

Science.gov (United States)

Dalin, Carole; Konar, Megan; Hanasaki, Naota; Rinaldo, Andrea; Rodriguez-Iturbe, Ignacio

2012-04-17

Global freshwater resources are under increasing pressure from economic development, population growth, and climate change. The international trade of water-intensive products (e.g., agricultural commodities) or virtual water trade has been suggested as a way to save water globally. We focus on the virtual water trade network associated with international food trade built with annual trade data and annual modeled virtual water content. The evolution of this network from 1986 to 2007 is analyzed and linked to trade policies, socioeconomic circumstances, and agricultural efficiency. We find that the number of trade connections and the volume of water associated with global food trade more than doubled in 22 years. Despite this growth, constant organizational features were observed in the network. However, both regional and national virtual water trade patterns significantly changed. Indeed, Asia increased its virtual water imports by more than 170%, switching from North America to South America as its main partner, whereas North America oriented to a growing intraregional trade. A dramatic rise in China's virtual water imports is associated with its increased soy imports after a domestic policy shift in 2000. Significantly, this shift has led the global soy market to save water on a global scale, but it also relies on expanding soy production in Brazil, which contributes to deforestation in the Amazon. We find that the international food trade has led to enhanced savings in global water resources over time, indicating its growing efficiency in terms of global water use.

Networks in biological systems: An investigation of the Gene Ontology as an evolving network

International Nuclear Information System (INIS)

Coronnello, C; Tumminello, M; Micciche, S; Mantegna, R.N.

2009-01-01

Many biological systems can be described as networks where different elements interact, in order to perform biological processes. We introduce a network associated with the Gene Ontology. Specifically, we construct a correlation-based network where the vertices are the terms of the Gene Ontology and the link between each two terms is weighted on the basis of the number of genes that they have in common. We analyze a filtered network obtained from the correlation-based network and we characterize its evolution over different releases of the Gene Ontology.

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...

Limitation of degree information for analyzing the interaction evolution in online social networks

Science.gov (United States)

Shang, Ke-Ke; Yan, Wei-Sheng; Xu, Xiao-Ke

2014-04-01

Previously many studies on online social networks simply analyze the static topology in which the friend relationship once established, then the links and nodes will not disappear, but this kind of static topology may not accurately reflect temporal interactions on online social services. In this study, we define four types of users and interactions in the interaction (dynamic) network. We found that active, disappeared, new and super nodes (users) have obviously different strength distribution properties and this result also can be revealed by the degree characteristics of the unweighted interaction and friendship (static) networks. However, the active, disappeared, new and super links (interactions) only can be reflected by the strength distribution in the weighted interaction network. This result indicates the limitation of the static topology data on analyzing social network evolutions. In addition, our study uncovers the approximately stable statistics for the dynamic social network in which there are a large variation for users and interaction intensity. Our findings not only verify the correctness of our definitions, but also helped to study the customer churn and evaluate the commercial value of valuable customers in online social networks.

Applying Model Based Systems Engineering to NASA's Space Communications Networks

Science.gov (United States)

Bhasin, Kul; Barnes, Patrick; Reinert, Jessica; Golden, Bert

2013-01-01

System engineering practices for complex systems and networks now require that requirement, architecture, and concept of operations product development teams, simultaneously harmonize their activities to provide timely, useful and cost-effective products. When dealing with complex systems of systems, traditional systems engineering methodology quickly falls short of achieving project objectives. This approach is encumbered by the use of a number of disparate hardware and software tools, spreadsheets and documents to grasp the concept of the network design and operation. In case of NASA's space communication networks, since the networks are geographically distributed, and so are its subject matter experts, the team is challenged to create a common language and tools to produce its products. Using Model Based Systems Engineering methods and tools allows for a unified representation of the system in a model that enables a highly related level of detail. To date, Program System Engineering (PSE) team has been able to model each network from their top-level operational activities and system functions down to the atomic level through relational modeling decomposition. These models allow for a better understanding of the relationships between NASA's stakeholders, internal organizations, and impacts to all related entities due to integration and sustainment of existing systems. Understanding the existing systems is essential to accurate and detailed study of integration options being considered. In this paper, we identify the challenges the PSE team faced in its quest to unify complex legacy space communications networks and their operational processes. We describe the initial approaches undertaken and the evolution toward model based system engineering applied to produce Space Communication and Navigation (SCaN) PSE products. We will demonstrate the practice of Model Based System Engineering applied to integrating space communication networks and the summary of its

Agent-based modeling and network dynamics

CERN Document Server

Namatame, Akira

2016-01-01

The book integrates agent-based modeling and network science. It is divided into three parts, namely, foundations, primary dynamics on and of social networks, and applications. The book begins with the network origin of agent-based models, known as cellular automata, and introduce a number of classic models, such as Schelling’s segregation model and Axelrod’s spatial game. The essence of the foundation part is the network-based agent-based models in which agents follow network-based decision rules. Under the influence of the substantial progress in network science in late 1990s, these models have been extended from using lattices into using small-world networks, scale-free networks, etc. The book also shows that the modern network science mainly driven by game-theorists and sociophysicists has inspired agent-based social scientists to develop alternative formation algorithms, known as agent-based social networks. The book reviews a number of pioneering and representative models in this family. Upon the gi...

Rapid molecular evolution across amniotes of the IIS/TOR network.

Science.gov (United States)

McGaugh, Suzanne E; Bronikowski, Anne M; Kuo, Chih-Horng; Reding, Dawn M; Addis, Elizabeth A; Flagel, Lex E; Janzen, Fredric J; Schwartz, Tonia S

2015-06-02

The insulin/insulin-like signaling and target of rapamycin (IIS/TOR) network regulates lifespan and reproduction, as well as metabolic diseases, cancer, and aging. Despite its vital role in health, comparative analyses of IIS/TOR have been limited to invertebrates and mammals. We conducted an extensive evolutionary analysis of the IIS/TOR network across 66 amniotes with 18 newly generated transcriptomes from nonavian reptiles and additional available genomes/transcriptomes. We uncovered rapid and extensive molecular evolution between reptiles (including birds) and mammals: (i) the IIS/TOR network, including the critical nodes insulin receptor substrate (IRS) and phosphatidylinositol 3-kinase (PI3K), exhibit divergent evolutionary rates between reptiles and mammals; (ii) compared with a proxy for the rest of the genome, genes of the IIS/TOR extracellular network exhibit exceptionally fast evolutionary rates; and (iii) signatures of positive selection and coevolution of the extracellular network suggest reptile- and mammal-specific interactions between members of the network. In reptiles, positively selected sites cluster on the binding surfaces of insulin-like growth factor 1 (IGF1), IGF1 receptor (IGF1R), and insulin receptor (INSR); whereas in mammals, positively selected sites clustered on the IGF2 binding surface, suggesting that these hormone-receptor binding affinities are targets of positive selection. Further, contrary to reports that IGF2R binds IGF2 only in marsupial and placental mammals, we found positively selected sites clustered on the hormone binding surface of reptile IGF2R that suggest that IGF2R binds to IGF hormones in diverse taxa and may have evolved in reptiles. These data suggest that key IIS/TOR paralogs have sub- or neofunctionalized between mammals and reptiles and that this network may underlie fundamental life history and physiological differences between these amniote sister clades.

Evolution and convergence in telecommunications

Energy Technology Data Exchange (ETDEWEB)

Radicella, S; Grilli, D [Abdus Salam ICTP, Trieste (Italy)

2002-12-15

These lectures throw a spotlight on different aspects of the evolution of telecommunications networks, namely on the various facets of service and network convergence. The last years progress in data and telecommunications technologies, such as P-based networks, and the enormous potential of mobile communication systems and users' demands for comprehensive and network-independent have led to a convergence of data and telecommunications infrastructures in many aspects. In order to help the reader to an easier understanding of the phenomenon convergence, in the first two parts of this volume the evolution of the basic technologies is described one by one. This is done briefly and is focused on the principle topics, just to build a basis for the third part devoted to problems of convergence in telecommunications. These notes are addressed to those readers, who in a quick overview want to be informed on the future service and network landscape. The notes are equally suited for professionals with the desire to extend their horizon as well as for students looking for an introduction into telecommunications under more general aspects. The authors clearly understand the difficulties in writing a book devoted to the evolution in telecommunications. Today, telecom landscape varies at very high speed. Every few months new network technologies, new products and new services are developed. Attempts to present them in time can be accessible only for magazine publications or contributions to conferences. Therefore, in a number of areas, such as Voice over IP and new switching technologies not much more than the starting point of new paradigms is described. However, the content is up-to-date to a degree, that the phenomenon convergence can be fully understood. Partially, these notes are based on a number of lecture courses that were delivered during recent ICTP winter schools devoted to multimedia and digital communications.

Evolution and convergence in telecommunications

International Nuclear Information System (INIS)

Radicella, S.; Grilli, D.

2002-01-01

These lectures throw a spotlight on different aspects of the evolution of telecommunications networks, namely on the various facets of service and network convergence. The last years progress in data and telecommunications technologies, such as P-based networks, and the enormous potential of mobile communication systems and users' demands for comprehensive and network-independent have led to a convergence of data and telecommunications infrastructures in many aspects. In order to help the reader to an easier understanding of the phenomenon convergence, in the first two parts of this volume the evolution of the basic technologies is described one by one. This is done briefly and is focused on the principle topics, just to build a basis for the third part devoted to problems of convergence in telecommunications. These notes are addressed to those readers, who in a quick overview want to be informed on the future service and network landscape. The notes are equally suited for professionals with the desire to extend their horizon as well as for students looking for an introduction into telecommunications under more general aspects. The authors clearly understand the difficulties in writing a book devoted to the evolution in telecommunications. Today, telecom landscape varies at very high speed. Every few months new network technologies, new products and new services are developed. Attempts to present them in time can be accessible only for magazine publications or contributions to conferences. Therefore, in a number of areas, such as Voice over IP and new switching technologies not much more than the starting point of new paradigms is described. However, the content is up-to-date to a degree, that the phenomenon convergence can be fully understood. Partially, these notes are based on a number of lecture courses that were delivered during recent ICTP winter schools devoted to multimedia and digital communications

Origin and evolution of the self-organizing cytoskeleton in the network of eukaryotic organelles.

Science.gov (United States)

Jékely, Gáspár

2014-09-02

The eukaryotic cytoskeleton evolved from prokaryotic cytomotive filaments. Prokaryotic filament systems show bewildering structural and dynamic complexity and, in many aspects, prefigure the self-organizing properties of the eukaryotic cytoskeleton. Here, the dynamic properties of the prokaryotic and eukaryotic cytoskeleton are compared, and how these relate to function and evolution of organellar networks is discussed. The evolution of new aspects of filament dynamics in eukaryotes, including severing and branching, and the advent of molecular motors converted the eukaryotic cytoskeleton into a self-organizing "active gel," the dynamics of which can only be described with computational models. Advances in modeling and comparative genomics hold promise of a better understanding of the evolution of the self-organizing cytoskeleton in early eukaryotes, and its role in the evolution of novel eukaryotic functions, such as amoeboid motility, mitosis, and ciliary swimming. Copyright © 2014 Cold Spring Harbor Laboratory Press; all rights reserved.

Evolution of Hierarchical Structure and Spatial Pattern of Coastal Cities in China – Based on the Data of Distribution of Marine-Related Enterprises

Directory of Open Access Journals (Sweden)

Wang Lili

2017-11-01

Full Text Available In this paper, a comprehensive research of the evolution of the hierarchical structure and spatial pattern of coastal cities in China was conducted based on the data of distribution of the headquarters and subsidiaries of marine-related enterprises in 1995, 2005 and 2015 using the city network research method proposed by Taylor. The results of the empirical research showed: China’s coastal city network had an obvious hierarchical characteristics of “national coastal cityregional coastal city-sub-regional coastal city-local coastal city”, in the 20 years of development process, the hierarchies of coastal cities in China showed a hierarchical progressive evolution; in past 20 years, the spatial pattern and network structure of coastal cities in China tended to be complete, and the city network was more uniform, forming a “three tiers and three urban agglomerations” network structure; the strength of connection among the cities was obviously strengthened, and the efficiency of urban spatial connection was improved overall.

An extensible and customizable framework for the management and orchestration of emerging software-based networks

OpenAIRE

Carella, Giuseppe Antonio

2018-01-01

The 5th Generation Mobile Telecommunications (5G) is supposed to drastically change network operators’ infrastructures. The evolution of telecommunication networks has always been influenced by the parallel evolution within the Information and Communication Technology (ICT) domain. What started with intelligent networks in the 90’s, namely the centralization of service programs and data in central computers controlling remote switching layers in order to simplify the service creation, depl...

PV-Powered CoMP-Based Green Cellular Networks with a Standby Grid Supply

Directory of Open Access Journals (Sweden)

Abu Jahid

2017-01-01

Full Text Available This paper proposes a novel framework for PV-powered cellular networks with a standby grid supply and an essential energy management technique for achieving envisaged green networks. The proposal considers an emerging cellular network architecture employing two types of coordinated multipoint (CoMP transmission techniques for serving the subscribers. Under the proposed framework, each base station (BS is powered by an individual PV solar energy module having an independent storage device. BSs are also connected to the conventional grid supply for meeting additional energy demand. We also propose a dynamic inter-BS solar energy sharing policy through a transmission line for further greening the proposed network by minimizing the consumption from the grid supply. An extensive simulation-based study in the downlink of a Long-Term Evolution (LTE cellular system is carried out for evaluating the energy efficiency performance of the proposed framework. System performance is also investigated for identifying the impact of various system parameters including storage factor, storage capacity, solar generation capacity, transmission line loss, and different CoMP techniques.

Mobile networks architecture

CERN Document Server

Perez, Andre

2013-01-01

This book explains the evolutions of architecture for mobiles and summarizes the different technologies:- 2G: the GSM (Global System for Mobile) network, the GPRS (General Packet Radio Service) network and the EDGE (Enhanced Data for Global Evolution) evolution;- 3G: the UMTS (Universal Mobile Telecommunications System) network and the HSPA (High Speed Packet Access) evolutions:- HSDPA (High Speed Downlink Packet Access),- HSUPA (High Speed Uplink Packet Access),- HSPA+;- 4G: the EPS (Evolved Packet System) network.The telephone service and data transmission are the

Visualization maps for the evolution of research hotspots in the field of regional health information networks.

Science.gov (United States)

Wang, Yanjun; Zheng, Jianzhong; Zhang, Ailian; Zhou, Wei; Dong, Haiyuan

2018-03-01

The aim of this study was to reveal research hotspots in the field of regional health information networks (RHINs) and use visualization techniques to explore their evolution over time and differences between countries. We conducted a literature review for a 50-year period and compared the prevalence of certain index terms during the periods 1963-1993 and 1994-2014 and in six countries. We applied keyword frequency analysis, keyword co-occurrence analysis, multidimensional scaling analysis, and network visualization technology. The total number of keywords was found to increase with time. From 1994 to 2014, the research priorities shifted from hospital planning to community health planning. The number of keywords reflecting information-based research increased. The density of the knowledge network increased significantly, and partial keywords condensed into knowledge groups. All six countries focus on keywords including Information Systems; Telemedicine; Information Service; Medical Records Systems, Computerized; Internet; etc.; however, the level of development and some research priorities are different. RHIN research has generally increased in popularity over the past 50 years. The research hotspots are evolving and are at different levels of development in different countries. Knowledge network mapping and perceptual maps provide useful information for scholars, managers, and policy-makers.

Impact of Loss Synchronization on Reliable High Speed Networks: A Model Based Simulation

Directory of Open Access Journals (Sweden)

Suman Kumar

2014-01-01

Full Text Available Contemporary nature of network evolution demands for simulation models which are flexible, scalable, and easily implementable. In this paper, we propose a fluid based model for performance analysis of reliable high speed networks. In particular, this paper aims to study the dynamic relationship between congestion control algorithms and queue management schemes, in order to develop a better understanding of the causal linkages between the two. We propose a loss synchronization module which is user configurable. We validate our model through simulations under controlled settings. Also, we present a performance analysis to provide insights into two important issues concerning 10 Gbps high speed networks: (i impact of bottleneck buffer size on the performance of 10 Gbps high speed network and (ii impact of level of loss synchronization on link utilization-fairness tradeoffs. The practical impact of the proposed work is to provide design guidelines along with a powerful simulation tool to protocol designers and network developers.

A Low-Carbon-Based Bilevel Optimization Model for Public Transit Network

Directory of Open Access Journals (Sweden)

Xu Sun

2013-01-01

Full Text Available To satisfy the demand of low-carbon transportation, this paper studies the optimization of public transit network based on the concept of low carbon. Taking travel time, operation cost, energy consumption, pollutant emission, and traffic efficiency as the optimization objectives, a bilevel model is proposed in order to maximize the benefits of both travelers and operators and minimize the environmental cost. Then the model is solved with the differential evolution (DE algorithm and applied to a real network of Baoji city. The results show that the model can not only ensure the benefits of travelers and operators, but can also reduce pollutant emission and energy consumption caused by the operations of buses, which reflects the concept of low carbon.

The Evolution of Gene Regulatory Networks that Define Arthropod Body Plans.

Science.gov (United States)

Auman, Tzach; Chipman, Ariel D

2017-09-01

Our understanding of the genetics of arthropod body plan development originally stems from work on Drosophila melanogaster from the late 1970s and onward. In Drosophila, there is a relatively detailed model for the network of gene interactions that proceeds in a sequential-hierarchical fashion to define the main features of the body plan. Over the years, we have a growing understanding of the networks involved in defining the body plan in an increasing number of arthropod species. It is now becoming possible to tease out the conserved aspects of these networks and to try to reconstruct their evolution. In this contribution, we focus on several key nodes of these networks, starting from early patterning in which the main axes are determined and the broad morphological domains of the embryo are defined, and on to later stage wherein the growth zone network is active in sequential addition of posterior segments. The pattern of conservation of networks is very patchy, with some key aspects being highly conserved in all arthropods and others being very labile. Many aspects of early axis patterning are highly conserved, as are some aspects of sequential segment generation. In contrast, regional patterning varies among different taxa, and some networks, such as the terminal patterning network, are only found in a limited range of taxa. The growth zone segmentation network is ancient and is probably plesiomorphic to all arthropods. In some insects, it has undergone significant modification to give rise to a more hardwired network that generates individual segments separately. In other insects and in most arthropods, the sequential segmentation network has undergone a significant amount of systems drift, wherein many of the genes have changed. However, it maintains a conserved underlying logic and function. © The Author 2017. Published by Oxford University Press on behalf of the Society for Integrative and Comparative Biology. All rights reserved. For permissions please

Regional scale analysis of the altimetric stream network evolution

Directory of Open Access Journals (Sweden)

T. Ghizzoni

2006-01-01

Full Text Available Floods result from the limited carrying capacity of stream channels when compared to the discharge peak value. The transit of flood waves - with the associated erosion and sedimentation processes - often modifies local stream geometry. In some cases this results in a reduction of the stream carrying capacity, and consequently in an enhancement of the flooding risk. A mathematical model for the prediction of potential altimetric stream network evolution due to erosion and sedimentation processes is here formalized. It works at the regional scale, identifying the tendency of river segments to sedimentation, stability, or erosion. The model builds on geomorphologic concepts, and derives its parameters from extensive surveys. As a case study, tendencies of rivers pertaining to the Valle d'Aosta region are analyzed. Some validation is provided both at regional and local scales of analysis. Local validation is performed both through a mathematical model able to simulate the temporal evolution of the stream profile, and through comparison of the prediction with ante and post-event river surveys, where available. Overall results are strongly encouraging. Possible use of the information derived from the model in the context of flood and landslide hazard mitigation is briefly discussed.

Research on Evolutionary Mechanism of Agile Supply Chain Network via Complex Network Theory

Directory of Open Access Journals (Sweden)

Nai-Ru Xu

2016-01-01

Full Text Available The paper establishes the evolutionary mechanism model of agile supply chain network by means of complex network theory which can be used to describe the growth process of the agile supply chain network and analyze the complexity of the agile supply chain network. After introducing the process and the suitability of taking complex network theory into supply chain network research, the paper applies complex network theory into the agile supply chain network research, analyzes the complexity of agile supply chain network, presents the evolutionary mechanism of agile supply chain network based on complex network theory, and uses Matlab to simulate degree distribution, average path length, clustering coefficient, and node betweenness. Simulation results show that the evolution result displays the scale-free property. It lays the foundations of further research on agile supply chain network based on complex network theory.

Controls on stream network branching angles, tested using landscape evolution models

Science.gov (United States)

Theodoratos, Nikolaos; Seybold, Hansjörg; Kirchner, James W.

2016-04-01

Stream networks are striking landscape features. The topology of stream networks has been extensively studied, but their geometry has received limited attention. Analyses of nearly 1 million stream junctions across the contiguous United States [1] have revealed that stream branching angles vary systematically with climate and topographic gradients at continental scale. Stream networks in areas with wet climates and gentle slopes tend to have wider branching angles than in areas with dry climates or steep slopes, but the mechanistic linkages underlying these empirical correlations remain unclear. Under different climatic and topographic conditions different runoff generation mechanisms and, consequently, transport processes are dominant. Models [2] and experiments [3] have shown that the relative strength of channel incision versus diffusive hillslope transport controls the spacing between valleys, an important geometric property of stream networks. We used landscape evolution models (LEMs) to test whether similar factors control network branching angles as well. We simulated stream networks using a wide range of hillslope diffusion and channel incision parameters. The resulting branching angles vary systematically with the parameters, but by much less than the regional variability in real-world stream networks. Our results suggest that the competition between hillslope and channeling processes influences branching angles, but that other mechanisms may also be needed to account for the variability in branching angles observed in the field. References: [1] H. Seybold, D. H. Rothman, and J. W. Kirchner, 2015, Climate's watermark in the geometry of river networks, Submitted manuscript. [2] J. T. Perron, W. E. Dietrich, and J. W. Kirchner, 2008, Controls on the spacing of first-order valleys, Journal of Geophysical Research, 113, F04016. [3] K. E. Sweeney, J. J. Roering, and C. Ellis, 2015, Experimental evidence for hillslope control of landscape scale, Science, 349

A simple model for the evolution of a non-Abelian cosmic string network

Energy Technology Data Exchange (ETDEWEB)

Cella, G. [Istituto Nazionale di Fisica Nucleare, sez. Pisa, Largo Bruno Pontecorvo 3, 56126 Pisa (Italy); Pieroni, M., E-mail: giancarlo.cella@pi.infn.it, E-mail: mauro.pieroni@apc.univ-paris7.fr [AstroParticule et Cosmologie, Université Paris Diderot, CNRS, CEA, Observatoire de Paris, Sorbonne Paris Cité, F-75205 Paris Cedex 13 (France)

2016-06-01

In this paper we present the results of numerical simulations intended to study the behavior of non-Abelian cosmic strings networks. In particular we are interested in discussing the variations in the asymptotic behavior of the system as we variate the number of generators for the topological defects. A simple model which allows for cosmic strings is presented and its lattice discretization is discussed. The evolution of the generated cosmic string networks is then studied for different values for the number of generators for the topological defects. Scaling solution appears to be approached in most cases and we present an argument to justify the lack of scaling for the residual cases.

Following the Social Media: Aspect Evolution of Online Discussion

Science.gov (United States)

Tang, Xuning; Yang, Christopher C.

Due to the advance of Internet and Web 2.0 technologies, it is easy to extract thousands of threads about a topic of interest from an online forum but it is nontrivial to capture the blueprint of different aspects (i.e., subtopic, or facet) associated with the topic. To better understand and analyze a forum discussion given topic, it is important to uncover the evolution relationships (temporal dependencies) between different topic aspects (i.e. how the discussion topic is evolving). Traditional Topic Detection and Tracking (TDT) techniques usually organize topics as a flat structure but it does not present the evolution relationships between topic aspects. In addition, the properties of short and sparse messages make the content-based TDT techniques difficult to perform well in identifying evolution relationships. The contributions in this paper are two-folded. We formally define a topic aspect evolution graph modeling framework and propose to utilize social network information, content similarity and temporal proximity to model evolution relationships between topic aspects. The experimental results showed that, by incorporating social network information, our technique significantly outperformed content-based technique in the task of extracting evolution relationships between topic aspects.

Hidden long evolutionary memory in a model biochemical network

Science.gov (United States)

Ali, Md. Zulfikar; Wingreen, Ned S.; Mukhopadhyay, Ranjan

2018-04-01

We introduce a minimal model for the evolution of functional protein-interaction networks using a sequence-based mutational algorithm, and apply the model to study neutral drift in networks that yield oscillatory dynamics. Starting with a functional core module, random evolutionary drift increases network complexity even in the absence of specific selective pressures. Surprisingly, we uncover a hidden order in sequence space that gives rise to long-term evolutionary memory, implying strong constraints on network evolution due to the topology of accessible sequence space.

Optimal Location and Sizing of UPQC in Distribution Networks Using Differential Evolution Algorithm

Directory of Open Access Journals (Sweden)

Seyed Abbas Taher

2012-01-01

Full Text Available Differential evolution (DE algorithm is used to determine optimal location of unified power quality conditioner (UPQC considering its size in the radial distribution systems. The problem is formulated to find the optimum location of UPQC based on an objective function (OF defined for improving of voltage and current profiles, reducing power loss and minimizing the investment costs considering the OF's weighting factors. Hence, a steady-state model of UPQC is derived to set in forward/backward sweep load flow. Studies are performed on two IEEE 33-bus and 69-bus standard distribution networks. Accuracy was evaluated by reapplying the procedures using both genetic (GA and immune algorithms (IA. Comparative results indicate that DE is capable of offering a nearer global optimal in minimizing the OF and reaching all the desired conditions than GA and IA.

Disentangling the effects of reputation and network position on the evolution of alliance networks

NARCIS (Netherlands)

Ebbers, J.J.; Wijnberg, N.M.

2010-01-01

This study uses the panel data social network analysis program SIENA to estimate the effect of actor reputation derived from past performance on alliance formation, while controlling for other constant actor attributes and network position. The authors distinguish between individual reputation based

Network-based Approaches in Pharmacology.

Science.gov (United States)

Boezio, Baptiste; Audouze, Karine; Ducrot, Pierre; Taboureau, Olivier

2017-10-01

In drug discovery, network-based approaches are expected to spotlight our understanding of drug action across multiple layers of information. On one hand, network pharmacology considers the drug response in the context of a cellular or phenotypic network. On the other hand, a chemical-based network is a promising alternative for characterizing the chemical space. Both can provide complementary support for the development of rational drug design and better knowledge of the mechanisms underlying the multiple actions of drugs. Recent progress in both concepts is discussed here. In addition, a network-based approach using drug-target-therapy data is introduced as an example. © 2017 Wiley-VCH Verlag GmbH & Co. KGaA, Weinheim.

Single- and Multiple-Objective Optimization with Differential Evolution and Neural Networks

Science.gov (United States)

Rai, Man Mohan

2006-01-01

Genetic and evolutionary algorithms have been applied to solve numerous problems in engineering design where they have been used primarily as optimization procedures. These methods have an advantage over conventional gradient-based search procedures became they are capable of finding global optima of multi-modal functions and searching design spaces with disjoint feasible regions. They are also robust in the presence of noisy data. Another desirable feature of these methods is that they can efficiently use distributed and parallel computing resources since multiple function evaluations (flow simulations in aerodynamics design) can be performed simultaneously and independently on ultiple processors. For these reasons genetic and evolutionary algorithms are being used more frequently in design optimization. Examples include airfoil and wing design and compressor and turbine airfoil design. They are also finding increasing use in multiple-objective and multidisciplinary optimization. This lecture will focus on an evolutionary method that is a relatively new member to the general class of evolutionary methods called differential evolution (DE). This method is easy to use and program and it requires relatively few user-specified constants. These constants are easily determined for a wide class of problems. Fine-tuning the constants will off course yield the solution to the optimization problem at hand more rapidly. DE can be efficiently implemented on parallel computers and can be used for continuous, discrete and mixed discrete/continuous optimization problems. It does not require the objective function to be continuous and is noise tolerant. DE and applications to single and multiple-objective optimization will be included in the presentation and lecture notes. A method for aerodynamic design optimization that is based on neural networks will also be included as a part of this lecture. The method offers advantages over traditional optimization methods. It is more

Parallel or convergent evolution in human population genomic data revealed by genotype networks.

Science.gov (United States)

R Vahdati, Ali; Wagner, Andreas

2016-08-02

Genotype networks are representations of genetic variation data that are complementary to phylogenetic trees. A genotype network is a graph whose nodes are genotypes (DNA sequences) with the same broadly defined phenotype. Two nodes are connected if they differ in some minimal way, e.g., in a single nucleotide. We analyze human genome variation data from the 1,000 genomes project, and construct haploid genotype (haplotype) networks for 12,235 protein coding genes. The structure of these networks varies widely among genes, indicating different patterns of variation despite a shared evolutionary history. We focus on those genes whose genotype networks show many cycles, which can indicate homoplasy, i.e., parallel or convergent evolution, on the sequence level. For 42 genes, the observed number of cycles is so large that it cannot be explained by either chance homoplasy or recombination. When analyzing possible explanations, we discovered evidence for positive selection in 21 of these genes and, in addition, a potential role for constrained variation and purifying selection. Balancing selection plays at most a small role. The 42 genes with excess cycles are enriched in functions related to immunity and response to pathogens. Genotype networks are representations of genetic variation data that can help understand unusual patterns of genomic variation.

Discovering Multimodal Behavior in Ms. Pac-Man through Evolution of Modular Neural Networks.

Science.gov (United States)

Schrum, Jacob; Miikkulainen, Risto

2016-03-12

Ms. Pac-Man is a challenging video game in which multiple modes of behavior are required: Ms. Pac-Man must escape ghosts when they are threats and catch them when they are edible, in addition to eating all pills in each level. Past approaches to learning behavior in Ms. Pac-Man have treated the game as a single task to be learned using monolithic policy representations. In contrast, this paper uses a framework called Modular Multi-objective NEAT (MM-NEAT) to evolve modular neural networks. Each module defines a separate behavior. The modules are used at different times according to a policy that can be human-designed (i.e. Multitask) or discovered automatically by evolution. The appropriate number of modules can be fixed or discovered using a genetic operator called Module Mutation. Several versions of Module Mutation are evaluated in this paper. Both fixed modular networks and Module Mutation networks outperform monolithic networks and Multitask networks. Interestingly, the best networks dedicate modules to critical behaviors (such as escaping when surrounded after luring ghosts near a power pill) that do not follow the customary division of the game into chasing edible and escaping threat ghosts. The results demonstrate that MM-NEAT can discover interesting and effective behavior for agents in challenging games.

An Analysis on a Negotiation Model Based on Multiagent Systems with Symbiotic Learning and Evolution

Science.gov (United States)

Hossain, Md. Tofazzal

This study explores an evolutionary analysis on a negotiation model based on Masbiole (Multiagent Systems with Symbiotic Learning and Evolution) which has been proposed as a new methodology of Multiagent Systems (MAS) based on symbiosis in the ecosystem. In Masbiole, agents evolve in consideration of not only their own benefits and losses, but also the benefits and losses of opponent agents. To aid effective application of Masbiole, we develop a competitive negotiation model where rigorous and advanced intelligent decision-making mechanisms are required for agents to achieve solutions. A Negotiation Protocol is devised aiming at developing a set of rules for agents' behavior during evolution. Simulations use a newly developed evolutionary computing technique, called Genetic Network Programming (GNP) which has the directed graph-type gene structure that can develop and design the required intelligent mechanisms for agents. In a typical scenario, competitive negotiation solutions are reached by concessions that are usually predetermined in the conventional MAS. In this model, however, not only concession is determined automatically by symbiotic evolution (making the system intelligent, automated, and efficient) but the solution also achieves Pareto optimal automatically.

On the Dual-Decomposition-Based Resource and Power Allocation with Sleeping Strategy for Heterogeneous Networks

KAUST Repository

Alsharoa, Ahmad M.

2015-05-01

In this paper, the problem of radio and power resource management in long term evolution heterogeneous networks (LTE HetNets) is investigated. The goal is to minimize the total power consumption of the network while satisfying the user quality of service determined by each target data rate. We study the model where one macrocell base station is placed in the cell center, and multiple small cell base stations and femtocell access points are distributed around it. The dual decomposition technique is adopted to jointly optimize the power and carrier allocation in the downlink direction in addition to the selection of turned off small cell base stations. Our numerical results investigate the performance of the proposed scheme versus different system parameters and show an important saving in terms of total power consumption. © 2015 IEEE.

Mapping the evolution of scientific ideas

Energy Technology Data Exchange (ETDEWEB)

Roberts, David [Los Alamos National Laboratory; Herrera, Mark [UNIV OF MARYLAND; Gulbahce, Natali [UNIV OF BOSTON

2009-01-01

Despite the apparent conceptual boundaries of scientific fields, a formal description for their evolution is lacking. Here we describe a novel approach to study the dynamics and evolution of scientific fields using a network-based analysis. We build an idea network consisting of American Physical Society PACS numbers as nodes representing scientific concepts. Two PACS numbers are linked if there exist publications that reference them simultaneously. We locate scientific fields using Cfinder, an overlapping community finding algorithm, and describe the time evolution of these fields using a community evolution method over the course of 1985-2006. The communities we identify map to known scientific fields, and their age strongly depends on t.heir size, impact and activity. Our analysis further suggests that communities that redefine themselves by merging and creating new groups of ideas tend to have more fitness as measured by the impact per paper, and hence communities with a higher fitness tend to be short-lived. The described approach to quantify the evolution of ideas may be relevant in making predictions about the future of science and how to guide its development.

Environmental Noise, Genetic Diversity and the Evolution of Evolvability and Robustness in Model Gene Networks

Science.gov (United States)

Steiner, Christopher F.

2012-01-01

The ability of organisms to adapt and persist in the face of environmental change is accepted as a fundamental feature of natural systems. More contentious is whether the capacity of organisms to adapt (or “evolvability”) can itself evolve and the mechanisms underlying such responses. Using model gene networks, I provide evidence that evolvability emerges more readily when populations experience positively autocorrelated environmental noise (red noise) compared to populations in stable or randomly varying (white noise) environments. Evolvability was correlated with increasing genetic robustness to effects on network viability and decreasing robustness to effects on phenotypic expression; populations whose networks displayed greater viability robustness and lower phenotypic robustness produced more additive genetic variation and adapted more rapidly in novel environments. Patterns of selection for robustness varied antagonistically with epistatic effects of mutations on viability and phenotypic expression, suggesting that trade-offs between these properties may constrain their evolutionary responses. Evolution of evolvability and robustness was stronger in sexual populations compared to asexual populations indicating that enhanced genetic variation under fluctuating selection combined with recombination load is a primary driver of the emergence of evolvability. These results provide insight into the mechanisms potentially underlying rapid adaptation as well as the environmental conditions that drive the evolution of genetic interactions. PMID:23284934

Nonbinary tree-based phylogenetic networks

OpenAIRE

Jetten, Laura; van Iersel, Leo

2016-01-01

Rooted phylogenetic networks are used to describe evolutionary histories that contain non-treelike evolutionary events such as hybridization and horizontal gene transfer. In some cases, such histories can be described by a phylogenetic base-tree with additional linking arcs, which can for example represent gene transfer events. Such phylogenetic networks are called tree-based. Here, we consider two possible generalizations of this concept to nonbinary networks, which we call tree-based and st...

Centrality measures in temporal networks with time series analysis

Science.gov (United States)

Huang, Qiangjuan; Zhao, Chengli; Zhang, Xue; Wang, Xiaojie; Yi, Dongyun

2017-05-01

The study of identifying important nodes in networks has a wide application in different fields. However, the current researches are mostly based on static or aggregated networks. Recently, the increasing attention to networks with time-varying structure promotes the study of node centrality in temporal networks. In this paper, we define a supra-evolution matrix to depict the temporal network structure. With using of the time series analysis, the relationships between different time layers can be learned automatically. Based on the special form of the supra-evolution matrix, the eigenvector centrality calculating problem is turned into the calculation of eigenvectors of several low-dimensional matrices through iteration, which effectively reduces the computational complexity. Experiments are carried out on two real-world temporal networks, Enron email communication network and DBLP co-authorship network, the results of which show that our method is more efficient at discovering the important nodes than the common aggregating method.

Dynamics of functional failures and recovery in complex road networks

Science.gov (United States)

Zhan, Xianyuan; Ukkusuri, Satish V.; Rao, P. Suresh C.

2017-11-01

We propose a new framework for modeling the evolution of functional failures and recoveries in complex networks, with traffic congestion on road networks as the case study. Differently from conventional approaches, we transform the evolution of functional states into an equivalent dynamic structural process: dual-vertex splitting and coalescing embedded within the original network structure. The proposed model successfully explains traffic congestion and recovery patterns at the city scale based on high-resolution data from two megacities. Numerical analysis shows that certain network structural attributes can amplify or suppress cascading functional failures. Our approach represents a new general framework to model functional failures and recoveries in flow-based networks and allows understanding of the interplay between structure and function for flow-induced failure propagation and recovery.

Evolution and Function of the Insulin and Insulin-like Signaling Network in Ectothermic Reptiles: Some Answers and More Questions.

Science.gov (United States)

Schwartz, Tonia S; Bronikowski, Anne M

2016-08-01

The insulin and insulin-like signaling (IIS) molecular network regulates cellular growth and division, and influences organismal metabolism, growth and development, reproduction, and lifespan. As a group, reptiles have incredible diversity in the complex life history traits that have been associated with the IIS network, yet the research on the IIS network in ectothermic reptiles is sparse. Here, we review the IIS network and synthesize what is known about the function and evolution of the IIS network in ectothermic reptiles. The primary hormones of this network-the insulin-like growth factors 1 and 2 (IGFs) likely function in reproduction in ectothermic reptiles, but the precise mechanisms are unclear, and likely range from influencing mating and ovulation to maternal investment in embryonic development. In general, plasma levels of IGF1 increase with food intake in ectothermic reptiles, but the magnitude of the response to food varies across species or populations and the ages of animals. Long-term temperature treatments as well as thermal stress can alter expression of genes within the IIS network. Although relatively little work has been done on IGF2 in ectothermic reptiles, IGF2 is consistently expressed at higher levels than IGF1 in juvenile ectothermic reptiles. Furthermore, in contrast to mammals that have genetic imprinting that silences the maternal IGF2 allele, in reptiles IGF2 is bi-allelically expressed (based on findings in chickens, a snake, and a lizard). Evolutionary analyses indicate some members of the IIS network are rapidly evolving across reptile species, including IGF1, insulin (INS), and their receptors. In particular, IGF1 displays extensive nucleotide variation across lizards and snakes, which suggests that its functional role may vary across this group. In addition, genetic variation across families and populations in the response of the IIS network to environmental conditions illustrates that components of this network may be evolving in

Analyzing the factors affecting network lifetime cluster-based wireless sensor network

International Nuclear Information System (INIS)

Malik, A.S.; Qureshi, A.

2010-01-01

Cluster-based wireless sensor networks enable the efficient utilization of the limited energy resources of the deployed sensor nodes and hence prolong the node as well as network lifetime. Low Energy Adaptive Clustering Hierarchy (Leach) is one of the most promising clustering protocol proposed for wireless sensor networks. This paper provides the energy utilization and lifetime analysis for cluster-based wireless sensor networks based upon LEACH protocol. Simulation results identify some important factors that induce unbalanced energy utilization between the sensor nodes and hence affect the network lifetime in these types of networks. These results highlight the need for a standardized, adaptive and distributed clustering technique that can increase the network lifetime by further balancing the energy utilization among sensor nodes. (author)

On the Use of Local Search in the Evolution of Neural Networks for the Diagnosis of Breast Cancer

Directory of Open Access Journals (Sweden)

Agam Gupta

2015-07-01

Full Text Available With the advancement in the field of Artificial Intelligence, there have been considerable efforts to develop technologies for pattern recognition related to medical diagnosis. Artificial Neural Networks (ANNs, a significant piece of Artificial Intelligence forms the base for most of the marvels in the former field. However, ANNs face the problem of premature convergence at a local minimum and inability to set hyper-parameters (like the number of neurons, learning rate, etc. while using Back Propagation Algorithm (BPA. In this paper, we have used the Genetic Algorithm (GA for the evolution of the ANN, which overcomes the limitations of the BPA. Since GA alone cannot fit for a high-dimensional, complex and multi-modal optimization landscape of the ANN, BPA is used as a local search algorithm to aid the evolution. The contributions of GA and BPA in the resultant approach are adjudged to determine the magnitude of local search necessary for optimization, striking a clear balance between exploration and exploitation in the evolution. The algorithm was applied to deal with the problem of Breast Cancer diagnosis. Results showed that under optimal settings, hybrid algorithm performs better than BPA or GA alone.

Beyond Traditional DTN Routing: Social Networks for Opportunistic Communication

OpenAIRE

Schurgot, Mary R.; Comaniciu, Cristina; Jaffrès-Runser, Katia

2011-01-01

This article examines the evolution of routing protocols for intermittently connected ad hoc networks and discusses the trend toward social-based routing protocols. A survey of current routing solutions is presented, where routing protocols for opportunistic networks are classified based on the network graph employed. The need to capture performance tradeoffs from a multi-objective perspective is highlighted.

Evolution of complex dynamics

Science.gov (United States)

Wilds, Roy; Kauffman, Stuart A.; Glass, Leon

2008-09-01

We study the evolution of complex dynamics in a model of a genetic regulatory network. The fitness is associated with the topological entropy in a class of piecewise linear equations, and the mutations are associated with changes in the logical structure of the network. We compare hill climbing evolution, in which only mutations that increase the fitness are allowed, with neutral evolution, in which mutations that leave the fitness unchanged are allowed. The simple structure of the fitness landscape enables us to estimate analytically the rates of hill climbing and neutral evolution. In this model, allowing neutral mutations accelerates the rate of evolutionary advancement for low mutation frequencies. These results are applicable to evolution in natural and technological systems.

Automatic Knowledge Base Evolution by Learning Instances

OpenAIRE

Kim, Sundong

2016-01-01

Knowledge base is the way to store structured and unstructured data throughout the web. Since the size of the web is increasing rapidly, there are huge needs to structure the knowledge in a fully automated way. However fully-automated knowledge-base evolution on the Semantic Web is a major challenges, although there are many ontology evolution techniques available. Therefore learning ontology automatically can contribute to the semantic web society significantly. In this paper, we propose ful...

Information-theoretic metamodel of organizational evolution

Science.gov (United States)

Sepulveda, Alfredo

2011-12-01

Social organizations are abstractly modeled by holarchies---self-similar connected networks---and intelligent complex adaptive multiagent systems---large networks of autonomous reasoning agents interacting via scaled processes. However, little is known of how information shapes evolution in such organizations, a gap that can lead to misleading analytics. The research problem addressed in this study was the ineffective manner in which classical model-predict-control methods used in business analytics attempt to define organization evolution. The purpose of the study was to construct an effective metamodel for organization evolution based on a proposed complex adaptive structure---the info-holarchy. Theoretical foundations of this study were holarchies, complex adaptive systems, evolutionary theory, and quantum mechanics, among other recently developed physical and information theories. Research questions addressed how information evolution patterns gleamed from the study's inductive metamodel more aptly explained volatility in organization. In this study, a hybrid grounded theory based on abstract inductive extensions of information theories was utilized as the research methodology. An overarching heuristic metamodel was framed from the theoretical analysis of the properties of these extension theories and applied to business, neural, and computational entities. This metamodel resulted in the synthesis of a metaphor for, and generalization of organization evolution, serving as the recommended and appropriate analytical tool to view business dynamics for future applications. This study may manifest positive social change through a fundamental understanding of complexity in business from general information theories, resulting in more effective management.

Directory Enabled Policy Based Networking; TOPICAL

International Nuclear Information System (INIS)

KELIIAA, CURTIS M.

2001-01-01

This report presents a discussion of directory-enabled policy-based networking with an emphasis on its role as the foundation for securely scalable enterprise networks. A directory service provides the object-oriented logical environment for interactive cyber-policy implementation. Cyber-policy implementation includes security, network management, operational process and quality of service policies. The leading network-technology vendors have invested in these technologies for secure universal connectivity that transverses Internet, extranet and intranet boundaries. Industry standards are established that provide the fundamental guidelines for directory deployment scalable to global networks. The integration of policy-based networking with directory-service technologies provides for intelligent management of the enterprise network environment as an end-to-end system of related clients, services and resources. This architecture allows logical policies to protect data, manage security and provision critical network services permitting a proactive defense-in-depth cyber-security posture. Enterprise networking imposes the consideration of supporting multiple computing platforms, sites and business-operation models. An industry-standards based approach combined with principled systems engineering in the deployment of these technologies allows these issues to be successfully addressed. This discussion is focused on a directory-based policy architecture for the heterogeneous enterprise network-computing environment and does not propose specific vendor solutions. This document is written to present practical design methodology and provide an understanding of the risks, complexities and most important, the benefits of directory-enabled policy-based networking

Network modularity reveals critical scales for connectivity in ecology and evolution

Science.gov (United States)

Fletcher, Robert J.; Revell, Andre; Reichert, Brian E.; Kitchens, Wiley M.; Dixon, J.; Austin, James D.

2013-01-01

For nearly a century, biologists have emphasized the profound importance of spatial scale for ecology, evolution and conservation. Nonetheless, objectively identifying critical scales has proven incredibly challenging. Here we extend new techniques from physics and social sciences that estimate modularity on networks to identify critical scales for movement and gene flow in animals. Using four species that vary widely in dispersal ability and include both mark-recapture and population genetic data, we identify significant modularity in three species, two of which cannot be explained by geographic distance alone. Importantly, the inclusion of modularity in connectivity and population viability assessments alters conclusions regarding patch importance to connectivity and suggests higher metapopulation viability than when ignoring this hidden spatial scale. We argue that network modularity reveals critical meso-scales that are probably common in populations, providing a powerful means of identifying fundamental scales for biology and for conservation strategies aimed at recovering imperilled species.

A network-base analysis of CMIP5 "historical" experiments

Science.gov (United States)

Bracco, A.; Foudalis, I.; Dovrolis, C.

2012-12-01

In computer science, "complex network analysis" refers to a set of metrics, modeling tools and algorithms commonly used in the study of complex nonlinear dynamical systems. Its main premise is that the underlying topology or network structure of a system has a strong impact on its dynamics and evolution. By allowing to investigate local and non-local statistical interaction, network analysis provides a powerful, but only marginally explored, framework to validate climate models and investigate teleconnections, assessing their strength, range, and impacts on the climate system. In this work we propose a new, fast, robust and scalable methodology to examine, quantify, and visualize climate sensitivity, while constraining general circulation models (GCMs) outputs with observations. The goal of our novel approach is to uncover relations in the climate system that are not (or not fully) captured by more traditional methodologies used in climate science and often adopted from nonlinear dynamical systems analysis, and to explain known climate phenomena in terms of the network structure or its metrics. Our methodology is based on a solid theoretical framework and employs mathematical and statistical tools, exploited only tentatively in climate research so far. Suitably adapted to the climate problem, these tools can assist in visualizing the trade-offs in representing global links and teleconnections among different data sets. Here we present the methodology, and compare network properties for different reanalysis data sets and a suite of CMIP5 coupled GCM outputs. With an extensive model intercomparison in terms of the climate network that each model leads to, we quantify how each model reproduces major teleconnections, rank model performances, and identify common or specific errors in comparing model outputs and observations.

WING/WORLD: An Open Experimental Toolkit for the Design and Deployment of IEEE 802.11-Based Wireless Mesh Networks Testbeds

Directory of Open Access Journals (Sweden)

Daniele Miorandi

2010-01-01

Full Text Available Wireless Mesh Networks represent an interesting instance of light-infrastructure wireless networks. Due to their flexibility and resiliency to network failures, wireless mesh networks are particularly suitable for incremental and rapid deployments of wireless access networks in both metropolitan and rural areas. This paper illustrates the design and development of an open toolkit aimed at supporting the design of different solutions for wireless mesh networking by enabling real evaluation, validation, and demonstration. The resulting testbed is based on off-the-shelf hardware components and open-source software and is focused on IEEE 802.11 commodity devices. The software toolkit is based on an “open” philosophy and aims at providing the scientific community with a tool for effective and reproducible performance analysis of WMNs. The paper describes the architecture of the toolkit, and its core functionalities, as well as its potential evolutions.

Policy-based Network Management in Home Area Networks: Interim Test Results

OpenAIRE

Ibrahim Rana, Annie; Ó Foghlú, Mícheál

2009-01-01

This paper argues that Home Area Networks (HANs) are a good candidate for advanced network management automation techniques, such as Policy-Based Network Management (PBNM). What is proposed is a simple use of policy based network management to introduce some level of Quality of Service (QoS) and Security management in the HAN, whilst hiding this complexity from the home user. In this paper we have presented the interim test results of our research experiments (based on a scenario) using the H...

Network-based analysis of software change propagation.

Science.gov (United States)

Wang, Rongcun; Huang, Rubing; Qu, Binbin

2014-01-01

The object-oriented software systems frequently evolve to meet new change requirements. Understanding the characteristics of changes aids testers and system designers to improve the quality of softwares. Identifying important modules becomes a key issue in the process of evolution. In this context, a novel network-based approach is proposed to comprehensively investigate change distributions and the correlation between centrality measures and the scope of change propagation. First, software dependency networks are constructed at class level. And then, the number of times of cochanges among classes is minded from software repositories. According to the dependency relationships and the number of times of cochanges among classes, the scope of change propagation is calculated. Using Spearman rank correlation analyzes the correlation between centrality measures and the scope of change propagation. Three case studies on java open source software projects Findbugs, Hibernate, and Spring are conducted to research the characteristics of change propagation. Experimental results show that (i) change distribution is very uneven; (ii) PageRank, Degree, and CIRank are significantly correlated to the scope of change propagation. Particularly, CIRank shows higher correlation coefficient, which suggests it can be a more useful indicator for measuring the scope of change propagation of classes in object-oriented software system.

Network evolution of body plans.

Directory of Open Access Journals (Sweden)

Koichi Fujimoto

Full Text Available One of the major goals in evolutionary developmental biology is to understand the relationship between gene regulatory networks and the diverse morphologies and their functionalities. Are the diversities solely triggered by random events, or are they inevitable outcomes of an interplay between evolving gene networks and natural selection? Segmentation in arthropod embryogenesis represents a well-known example of body plan diversity. Striped patterns of gene expression that lead to the future body segments appear simultaneously or sequentially in long and short germ-band development, respectively. Moreover, a combination of both is found in intermediate germ-band development. Regulatory genes relevant for stripe formation are evolutionarily conserved among arthropods, therefore the differences in the observed traits are thought to have originated from how the genes are wired. To reveal the basic differences in the network structure, we have numerically evolved hundreds of gene regulatory networks that produce striped patterns of gene expression. By analyzing the topologies of the generated networks, we show that the characteristics of stripe formation in long and short germ-band development are determined by Feed-Forward Loops (FFLs and negative Feed-Back Loops (FBLs respectively, and those of intermediate germ-band development are determined by the interconnections between FFL and negative FBL. Network architectures, gene expression patterns and knockout responses exhibited by the artificially evolved networks agree with those reported in the fly Drosophila melanogaster and the beetle Tribolium castaneum. For other arthropod species, principal network architectures that remain largely unknown are predicted. Our results suggest that the emergence of the three modes of body segmentation in arthropods is an inherent property of the evolving networks.

Rolling Force Prediction in Heavy Plate Rolling Based on Uniform Differential Neural Network

Directory of Open Access Journals (Sweden)

Fei Zhang

2016-01-01

Full Text Available Accurate prediction of the rolling force is critical to assuring the quality of the final product in steel manufacturing. Exit thickness of plate for each pass is calculated from roll gap, mill spring, and predicted roll force. Ideal pass scheduling is dependent on a precise prediction of the roll force in each pass. This paper will introduce a concept that allows obtaining the material model parameters directly from the rolling process on an industrial scale by the uniform differential neural network. On the basis of the characteristics that the uniform distribution can fully characterize the solution space and enhance the diversity of the population, uniformity research on differential evolution operator is made to get improved crossover with uniform distribution. When its original function is transferred with a transfer function, the uniform differential evolution algorithms can quickly solve complex optimization problems. Neural network structure and weights threshold are optimized by uniform differential evolution algorithm, and a uniform differential neural network is formed to improve rolling force prediction accuracy in process control system.

Interaction in agent-based economics: A survey on the network approach

Science.gov (United States)

Bargigli, Leonardo; Tedeschi, Gabriele

2014-04-01

In this paper we aim to introduce the reader to some basic concepts and instruments used in a wide range of economic networks models. In particular, we adopt the theory of random networks as the main tool to describe the relationship between the organization of interaction among individuals within different components of the economy and overall aggregate behavior. The focus is on the ways in which economic agents interact and the possible consequences of their interaction on the system. We show that network models are able to introduce complex phenomena in economic systems by allowing for the endogenous evolution of networks.

Network-Based Community Brings forth Sustainable Society

Science.gov (United States)

Kikuchi, Toshiko

It has already been shown that an artificial society based on the three relations of social configuration (market, communal, and obligatory relations) functioning in balance with each other formed a sustainable society which the social reproduction is possible. In this artificial society model, communal relations exist in a network-based community with alternating members rather than a conventional community with cooperative mutual assistance practiced in some agricultural communities. In this paper, using the comparison between network-based communities with alternating members and conventional communities with fixed members, the significance of a network-based community is considered. In concrete terms, the difference in appearance rate for sustainable society, economic activity and asset inequality between network-based communities and conventional communities is analyzed. The appearance rate for a sustainable society of network-based community is higher than that of conventional community. Moreover, most of network-based communities had a larger total number of trade volume than conventional communities. But, the value of Gini coefficient in conventional community is smaller than that of network-based community. These results show that communal relations based on a network-based community is significant for the social reproduction and economic efficiency. However, in such an artificial society, the inequality is sacrificed.

A Quantum Cryptography Communication Network Based on Software Defined Network

Directory of Open Access Journals (Sweden)

Zhang Hongliang

2018-01-01

Full Text Available With the development of the Internet, information security has attracted great attention in today’s society, and quantum cryptography communication network based on quantum key distribution (QKD is a very important part of this field, since the quantum key distribution combined with one-time-pad encryption scheme can guarantee the unconditional security of the information. The secret key generated by quantum key distribution protocols is a very valuable resource, so making full use of key resources is particularly important. Software definition network (SDN is a new type of network architecture, and it separates the control plane and the data plane of network devices through OpenFlow technology, thus it realizes the flexible control of the network resources. In this paper, a quantum cryptography communication network model based on SDN is proposed to realize the flexible control of quantum key resources in the whole cryptography communication network. Moreover, we propose a routing algorithm which takes into account both the hops and the end-to-end availible keys, so that the secret key generated by QKD can be used effectively. We also simulate this quantum cryptography communication network, and the result shows that based on SDN and the proposed routing algorithm the performance of this network is improved since the effective use of the quantum key resources.

Effect of network topology on the evolutionary ultimatum game based on the net-profit decision

Science.gov (United States)

Ye, Shun-Qiang; Wang, Lu; Jones, Michael C.; Ye, Ye; Wang, Meng; Xie, Neng-Gang

2016-04-01

The ubiquity of altruist behavior amongst humans has long been a significant puzzle in the social sciences. Ultimatum game has proved to be a useful tool for explaining altruistic behavior among selfish individuals. In an ultimatum game where alternating roles exist, we suppose that players make their decisions based on the net profit of their own. In this paper, we specify a player's strategy with two parameters: offer level α ∈ [ 0,1) and net profit acceptance level β ∈ [ - 1,1). By Monte Carlo simulation, we analyze separately the effect of the size of the neighborhood, the small-world property and the heterogeneity of the degree distributions of the networks. Results show that compared with results observed for homogeneous networks, heterogeneous networks lead to more rational outcomes. Moreover, network structure has no effect on the evolution of kindness level, so moderate kindness is adaptable to any social groups and organizations.

Reconstructible phylogenetic networks: do not distinguish the indistinguishable.

Science.gov (United States)

Pardi, Fabio; Scornavacca, Celine

2015-04-01

Phylogenetic networks represent the evolution of organisms that have undergone reticulate events, such as recombination, hybrid speciation or lateral gene transfer. An important way to interpret a phylogenetic network is in terms of the trees it displays, which represent all the possible histories of the characters carried by the organisms in the network. Interestingly, however, different networks may display exactly the same set of trees, an observation that poses a problem for network reconstruction: from the perspective of many inference methods such networks are "indistinguishable". This is true for all methods that evaluate a phylogenetic network solely on the basis of how well the displayed trees fit the available data, including all methods based on input data consisting of clades, triples, quartets, or trees with any number of taxa, and also sequence-based approaches such as popular formalisations of maximum parsimony and maximum likelihood for networks. This identifiability problem is partially solved by accounting for branch lengths, although this merely reduces the frequency of the problem. Here we propose that network inference methods should only attempt to reconstruct what they can uniquely identify. To this end, we introduce a novel definition of what constitutes a uniquely reconstructible network. For any given set of indistinguishable networks, we define a canonical network that, under mild assumptions, is unique and thus representative of the entire set. Given data that underwent reticulate evolution, only the canonical form of the underlying phylogenetic network can be uniquely reconstructed. While on the methodological side this will imply a drastic reduction of the solution space in network inference, for the study of reticulate evolution this is a fundamental limitation that will require an important change of perspective when interpreting phylogenetic networks.

Reconstructible phylogenetic networks: do not distinguish the indistinguishable.

Directory of Open Access Journals (Sweden)

Fabio Pardi

2015-04-01

Full Text Available Phylogenetic networks represent the evolution of organisms that have undergone reticulate events, such as recombination, hybrid speciation or lateral gene transfer. An important way to interpret a phylogenetic network is in terms of the trees it displays, which represent all the possible histories of the characters carried by the organisms in the network. Interestingly, however, different networks may display exactly the same set of trees, an observation that poses a problem for network reconstruction: from the perspective of many inference methods such networks are "indistinguishable". This is true for all methods that evaluate a phylogenetic network solely on the basis of how well the displayed trees fit the available data, including all methods based on input data consisting of clades, triples, quartets, or trees with any number of taxa, and also sequence-based approaches such as popular formalisations of maximum parsimony and maximum likelihood for networks. This identifiability problem is partially solved by accounting for branch lengths, although this merely reduces the frequency of the problem. Here we propose that network inference methods should only attempt to reconstruct what they can uniquely identify. To this end, we introduce a novel definition of what constitutes a uniquely reconstructible network. For any given set of indistinguishable networks, we define a canonical network that, under mild assumptions, is unique and thus representative of the entire set. Given data that underwent reticulate evolution, only the canonical form of the underlying phylogenetic network can be uniquely reconstructed. While on the methodological side this will imply a drastic reduction of the solution space in network inference, for the study of reticulate evolution this is a fundamental limitation that will require an important change of perspective when interpreting phylogenetic networks.

Dynamics and spike trains statistics in conductance-based integrate-and-fire neural networks with chemical and electric synapses

International Nuclear Information System (INIS)

Cofré, Rodrigo; Cessac, Bruno

2013-01-01

We investigate the effect of electric synapses (gap junctions) on collective neuronal dynamics and spike statistics in a conductance-based integrate-and-fire neural network, driven by Brownian noise, where conductances depend upon spike history. We compute explicitly the time evolution operator and show that, given the spike-history of the network and the membrane potentials at a given time, the further dynamical evolution can be written in a closed form. We show that spike train statistics is described by a Gibbs distribution whose potential can be approximated with an explicit formula, when the noise is weak. This potential form encompasses existing models for spike trains statistics analysis such as maximum entropy models or generalized linear models (GLM). We also discuss the different types of correlations: those induced by a shared stimulus and those induced by neurons interactions

Combining Host-based and network-based intrusion detection system

African Journals Online (AJOL)

These attacks were simulated using hping. The proposed system is implemented in Java. The results show that the proposed system is able to detect attacks both from within (host-based) and outside sources (network-based). Key Words: Intrusion Detection System (IDS), Host-based, Network-based, Signature, Security log.

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 ...

Leader's opinion priority bounded confidence model for network opinion evolution

Science.gov (United States)

Zhu, Meixia; Xie, Guangqiang

2017-08-01

Aiming at the weight of trust someone given to participate in the interaction in Hegselmann-Krause's type consensus model is the same and virtual social networks among individuals with different level of education, personal influence, etc. For differences between agents, a novelty bounded confidence model was proposed with leader's opinion considered priority. Interaction neighbors can be divided into two kinds. The first kind is made up of "opinion leaders" group, another kind is made up of ordinary people. For different groups to give different weights of trust. We also analyzed the related characteristics of the new model under the symmetrical bounded confidence parameters and combined with the classical HK model were analyzed. Simulation experiment results show that no matter the network size and initial view is subject to uniform distribution or discrete distribution. We can control the "opinion-leader" good change the number of views and values, and even improve the convergence speed. Experiment also found that the choice of "opinion leaders" is not the more the better, the model well explain how the "opinion leader" in the process of the evolution of the public opinion play the role of the leader.

An acoustical model based monitoring network

NARCIS (Netherlands)

Wessels, P.W.; Basten, T.G.H.; Eerden, F.J.M. van der

2010-01-01

In this paper the approach for an acoustical model based monitoring network is demonstrated. This network is capable of reconstructing a noise map, based on the combination of measured sound levels and an acoustic model of the area. By pre-calculating the sound attenuation within the network the

Landslide and Flood Warning System Prototypes based on Wireless Sensor Networks

Science.gov (United States)

Hloupis, George; Stavrakas, Ilias; Triantis, Dimos

2010-05-01

Wireless sensor networks (WSNs) are one of the emerging areas that received great attention during the last few years. This is mainly due to the fact that WSNs have provided scientists with the capability of developing real-time monitoring systems equipped with sensors based on Micro-Electro-Mechanical Systems (MEMS). WSNs have great potential for many applications in environmental monitoring since the sensor nodes that comprised from can host several MEMS sensors (such as temperature, humidity, inertial, pressure, strain-gauge) and transducers (such as position, velocity, acceleration, vibration). The resulting devices are small and inexpensive but with limited memory and computing resources. Each sensor node contains a sensing module which along with an RF transceiver. The communication is broadcast-based since the network topology can change rapidly due to node failures [1]. Sensor nodes can transmit their measurements to central servers through gateway nodes without any processing or they make preliminary calculations locally in order to produce results that will be sent to central servers [2]. Based on the above characteristics, two prototypes using WSNs are presented in this paper: A Landslide detection system and a Flood warning system. Both systems sent their data to central processing server where the core of processing routines exists. Transmission is made using Zigbee and IEEE 802.11b protocol but is capable to use VSAT communication also. Landslide detection system uses structured network topology. Each measuring node comprises of a columnar module that is half buried to the area under investigation. Each sensing module contains a geophone, an inclinometer and a set of strain gauges. Data transmitted to central processing server where possible landslide evolution is monitored. Flood detection system uses unstructured network topology since the failure rate of sensor nodes is expected higher. Each sensing module contains a custom water level sensor

SDN based millimetre wave radio over fiber (RoF) network

Science.gov (United States)

Amate, Ahmed; Milosavljevic, Milos; Kourtessis, Pandelis; Robinson, Matthew; Senior, John M.

2015-01-01

This paper introduces software-defined, millimeter Wave (mm-Wave) networks with Radio over Fiber (RoF) for the delivery of gigabit connectivity required to develop fifth generation (5G) mobile. This network will enable an effective open access system allowing providers to manage and lease the infrastructure to service providers through unbundling new business models. Exploiting the inherited benefits of RoF, complete base station functionalities are centralized at the edges of the metro and aggregation network, leaving remote radio heads (RRHs) with only tunable filtering and amplification. A Software Defined Network (SDN) Central Controller (SCC) is responsible for managing the resource across several mm-Wave Radio Access Networks (RANs) providing a global view of the several network segments. This ensures flexible resource allocation for reduced overall latency and increased throughput. The SDN based mm-Wave RAN also allows for inter edge node communication. Therefore, certain packets can be routed between different RANs supported by the same edge node, reducing latency. System level simulations of the complete network have shown significant improvement of the overall throughput and SINR for wireless users by providing effective resource allocation and coordination among interfering cells. A new Coordinated Multipoint (CoMP) algorithm exploiting the benefits of the SCC global network view for reduced delay in control message exchange is presented, accounting for a minimum packet delay and limited Channel State Information (CSI) in a Long Term Evolution-Advanced (LTE-A), Cloud RAN (CRAN) configuration. The algorithm does not require detailed CSI feedback from UEs but it rather considers UE location (determined by the eNB) as the required parameter. UE throughput in the target sector is represented using a Cumulative Distributive Function (CDF). The drawn characteristics suggest that there is a significant 60% improvement in UE cell edge throughput following the

Heterogeneous Deployment Analysis for Cost-Effective Mobile Network Evolution

DEFF Research Database (Denmark)

Coletti, Claudio

2013-01-01

network coverage and boosting network capacity in traffic hot-spot areas. The thesis deals with the deployment of both outdoor small cells and indoor femto cells. Amongst the outdoor solution, particular emphasis is put on relay base stations as backhaul costs can be reduced by utilizing LTE spectrum...... statistical models of deployment areas, the performance analysis is carried out in the form of operator case studies for large-scale deployment scenarios, including realistic macro network layouts and inhomogeneous spatial traffic distributions. Deployment of small cells is performed by means of proposed...... heuristic deployment algorithms, which combine network coverage and spatial user density information. As a secondary aspect, deployment solutions achieving the same coverage performance are compared in terms of Total Cost of Ownership (TCO), in order to investigate the viability of different deployment...

Evolution of Heterogeneous Wireless Networks

DEFF Research Database (Denmark)

Zhang, Q.; Fitzek, Frank; Katz, Marcos

2006-01-01

Mobile and wireless content, services and networks - Short-term and long-term development trends......Mobile and wireless content, services and networks - Short-term and long-term development trends...

Q-Speciation and Network Structure Evolution in Invert Calcium Silicate Glasses.

Science.gov (United States)

Kaseman, Derrick C; Retsinas, A; Kalampounias, A G; Papatheodorou, G N; Sen, S

2015-07-02

Binary silicate glasses in the system CaO-SiO2 are synthesized over an extended composition range (42 mol % ≤ CaO ≤ 61 mol %), using container-less aerodynamic levitation techniques and CO2-laser heating. The compositional evolution of Q speciation in these glasses is quantified using (29)Si and (17)O magic angle spinning nuclear magnetic resonance spectroscopy. The results indicate progressive depolymerization of the silicate network upon addition of CaO and significant deviation of the Q speciation from the binary model. The equilibrium constants for the various Q species disproportionation reactions for these glasses are found to be similar to (much smaller than) those characteristic of Li (Mg)-silicate glasses, consistent with the corresponding trends in the field strengths of these modifier cations. Increasing CaO concentration results in an increase in the packing density and structural rigidity of these glasses and consequently in their glass transition temperature Tg. This apparent role reversal of conventional network-modifying cations in invert alkaline-earth silicate glasses are compared and contrasted with that in their alkali silicate counterparts.

Phase Diagram of Spiking Neural Networks

Directory of Open Access Journals (Sweden)

Hamed eSeyed-Allaei

2015-03-01

Full Text Available In computer simulations of spiking neural networks, often it is assumed that every two neurons of the network are connected by a probablilty of 2%, 20% of neurons are inhibitory and 80% are excitatory. These common values are based on experiments, observations. but here, I take a different perspective, inspired by evolution. I simulate many networks, each with a different set of parameters, and then I try to figure out what makes the common values desirable by nature. Networks which are configured according to the common values, have the best dynamic range in response to an impulse and their dynamic range is more robust in respect to synaptic weights. In fact, evolution has favored networks of best dynamic range. I present a phase diagram that shows the dynamic ranges of different networks of different parameteres. This phase diagram gives an insight into the space of parameters -- excitatory to inhibitory ratio, sparseness of connections and synaptic weights. It may serve as a guideline to decide about the values of parameters in a simulation of spiking neural network.

Carrier ethernet network control plane based on the Next Generation Network

DEFF Research Database (Denmark)

Fu, Rong; Wang, Yanmeng; Berger, Michael Stubert

2008-01-01

This paper contributes on presenting a step towards the realization of Carrier Ethernet control plane based on the next generation network (NGN). Specifically, transport MPLS (T-MPLS) is taken as the transport technology in Carrier Ethernet. It begins with providing an overview of the evolving...... architecture of the next generation network (NGN). As an essential candidate among the NGN transport technologies, the definition of Carrier Ethernet (CE) is also introduced here. The second part of this paper depicts the contribution on the T-MPLS based Carrier Ethernet network with control plane based on NGN...... at illustrating the improvement of the Carrier Ethernet network with the NGN control plane....

Optimising TCP for cloud-based mobile networks

DEFF Research Database (Denmark)

Artuso, Matteo; Christiansen, Henrik Lehrmann

2016-01-01

Cloud-based mobile networks are foreseen to be a technological enabler for the next generation of mobile networks. Their design requires substantial research as they pose unique challenges, especially from the point of view of additional delays in the fronthaul network. Commonly used network...... implementations of 3 popular operating systems are investigated in our network model. The results on the most influential parameters are used to design an optimized TCP for cloud-based mobile networks....

Epigenomic Co-localization and Co-evolution Reveal a Key Role for 5hmC as a Communication Hub in the Chromatin Network of ESCs

Directory of Open Access Journals (Sweden)

David Juan

2016-02-01

Full Text Available Summary: Epigenetic communication through histone and cytosine modifications is essential for gene regulation and cell identity. Here, we propose a framework that is based on a chromatin communication model to get insight on the function of epigenetic modifications in ESCs. The epigenetic communication network was inferred from genome-wide location data plus extensive manual annotation. Notably, we found that 5-hydroxymethylcytosine (5hmC is the most-influential hub of this network, connecting DNA demethylation to nucleosome remodeling complexes and to key transcription factors of pluripotency. Moreover, an evolutionary analysis revealed a central role of 5hmC in the co-evolution of chromatin-related proteins. Further analysis of regions where 5hmC co-localizes with specific interactors shows that each interaction points to chromatin remodeling, stemness, differentiation, or metabolism. Our results highlight the importance of cytosine modifications in the epigenetic communication of ESCs. : 5-hydroxymethylcytosine (5hmC plays a key role in the epigenomic communication network of embryonic stem cells. Juan et al. build a communication network based in co-localization of epigenomic data and literature. The analysis of the network and its components reveals that proteins reading and editing 5hmC co-evolve and serve as links between diverse molecular processes.

Network-Based Effectiveness

National Research Council Canada - National Science Library

Friman, Henrik

2006-01-01

...) to increase competitive advantage, innovation, and mission effectiveness. Network-based effectiveness occurs due to the influence of various factors such as people, procedures, technology, and organizations...

Sinc-function based Network

DEFF Research Database (Denmark)

Madsen, Per Printz

1998-01-01

The purpose of this paper is to describe a neural network (SNN), that is based on Shannons ideas of reconstruction of a real continuous function from its samples. The basic function, used in this network, is the Sinc-function. Two learning algorithms are described. A simple one called IM...

Horizontal and vertical growth of S. cerevisiae metabolic network.

KAUST Repository

Grassi, Luigi

2011-10-14

BACKGROUND: The growth and development of a biological organism is reflected by its metabolic network, the evolution of which relies on the essential gene duplication mechanism. There are two current views about the evolution of metabolic networks. The retrograde model hypothesizes that a pathway evolves by recruiting novel enzymes in a direction opposite to the metabolic flow. The patchwork model is instead based on the assumption that the evolution is based on the exploitation of broad-specificity enzymes capable of catalysing a variety of metabolic reactions. RESULTS: We analysed a well-studied unicellular eukaryotic organism, S. cerevisiae, and studied the effect of the removal of paralogous gene products on its metabolic network. Our results, obtained using different paralog and network definitions, show that, after an initial period when gene duplication was indeed instrumental in expanding the metabolic space, the latter reached an equilibrium and subsequent gene duplications were used as a source of more specialized enzymes rather than as a source of novel reactions. We also show that the switch between the two evolutionary strategies in S. cerevisiae can be dated to about 350 million years ago. CONCLUSIONS: Our data, obtained through a novel analysis methodology, strongly supports the hypothesis that the patchwork model better explains the more recent evolution of the S. cerevisiae metabolic network. Interestingly, the effects of a patchwork strategy acting before the Euascomycete-Hemiascomycete divergence are still detectable today.

Shared protection based virtual network mapping in space division multiplexing optical networks

Science.gov (United States)

Zhang, Huibin; Wang, Wei; Zhao, Yongli; Zhang, Jie

2018-05-01

Space Division Multiplexing (SDM) has been introduced to improve the capacity of optical networks. In SDM optical networks, there are multiple cores/modes in each fiber link, and spectrum resources are multiplexed in both frequency and core/modes dimensions. Enabled by network virtualization technology, one SDM optical network substrate can be shared by several virtual networks operators. Similar with point-to-point connection services, virtual networks (VN) also need certain survivability to guard against network failures. Based on customers' heterogeneous requirements on the survivability of their virtual networks, this paper studies the shared protection based VN mapping problem and proposes a Minimum Free Frequency Slots (MFFS) mapping algorithm to improve spectrum efficiency. Simulation results show that the proposed algorithm can optimize SDM optical networks significantly in terms of blocking probability and spectrum utilization.

Bluetooth-based wireless sensor networks

Science.gov (United States)

You, Ke; Liu, Rui Qiang

2007-11-01

In this work a Bluetooth-based wireless sensor network is proposed. In this bluetooth-based wireless sensor networks, information-driven star topology and energy-saved mode are used, through which a blue master node can control more than seven slave node, the energy of each sensor node is reduced and secure management of each sensor node is improved.

Autonomous power networks based power system

International Nuclear Information System (INIS)

Jokic, A.; Van den Bosch, P.P.J.

2006-01-01

This paper presented the concept of autonomous networks to cope with this increased complexity in power systems while enhancing market-based operation. The operation of future power systems will be more challenging and demanding than present systems because of increased uncertainties, less inertia in the system, replacement of centralized coordinating activities by decentralized parties and the reliance on dynamic markets for both power balancing and system reliability. An autonomous network includes the aggregation of networked producers and consumers in a relatively small area with respect to the overall system. The operation of an autonomous network is coordinated and controlled with one central unit acting as an interface between internal producers/consumers and the rest of the power system. In this study, the power balance problem and system reliability through provision of ancillary services was formulated as an optimization problem for the overall autonomous networks based power system. This paper described the simulation of an optimal autonomous network dispatching in day ahead markets, based on predicted spot prices for real power, and two ancillary services. It was concluded that large changes occur in a power systems structure and operation, most of them adding to the uncertainty and complexity of the system. The introduced concept of an autonomous power network-based power system was shown to be a realistic and consistent approach to formulate and operate a market-based dispatch of both power and ancillary services. 9 refs., 4 figs

Network Structure and Community Evolution on Twitter: Human Behavior Change in Response to the 2011 Japanese Earthquake and Tsunami

Science.gov (United States)

Lu, Xin; Brelsford, Christa

2014-10-01

To investigate the dynamics of social networks and the formation and evolution of online communities in response to extreme events, we collected three datasets from Twitter shortly before and after the 2011 earthquake and tsunami in Japan. We find that while almost all users increased their online activity after the earthquake, Japanese speakers, who are assumed to be more directly affected by the event, expanded the network of people they interact with to a much higher degree than English speakers or the global average. By investigating the evolution of communities, we find that the behavior of joining or quitting a community is far from random: users tend to stay in their current status and are less likely to join new communities from solitary or shift to other communities from their current community. While non-Japanese speakers did not change their conversation topics significantly after the earthquake, nearly all Japanese users changed their conversations to earthquake-related content. This study builds a systematic framework for investigating human behaviors under extreme events with online social network data and our findings on the dynamics of networks and communities may provide useful insight for understanding how patterns of social interaction are influenced by extreme events.

Social and place-focused communities in location-based online social networks

Science.gov (United States)

Brown, Chloë; Nicosia, Vincenzo; Scellato, Salvatore; Noulas, Anastasios; Mascolo, Cecilia

2013-06-01

Thanks to widely available, cheap Internet access and the ubiquity of smartphones, millions of people around the world now use online location-based social networking services. Understanding the structural properties of these systems and their dependence upon users' habits and mobility has many potential applications, including resource recommendation and link prediction. Here, we construct and characterise social and place-focused graphs by using longitudinal information about declared social relationships and about users' visits to physical places collected from a popular online location-based social service. We show that although the social and place-focused graphs are constructed from the same data set, they have quite different structural properties. We find that the social and location-focused graphs have different global and meso-scale structure, and in particular that social and place-focused communities have negligible overlap. Consequently, group inference based on community detection performed on the social graph alone fails to isolate place-focused groups, even though these do exist in the network. By studying the evolution of tie structure within communities, we show that the time period over which location data are aggregated has a substantial impact on the stability of place-focused communities, and that information about place-based groups may be more useful for user-centric applications than that obtained from the analysis of social communities alone.

Network-Based Effectiveness

National Research Council Canada - National Science Library

Friman, Henrik

2006-01-01

... (extended from Leavitt, 1965). This text identifies aspects of network-based effectiveness that can benefit from a better understanding of leadership and management development of people, procedures, technology, and organizations...

On the Dual-Decomposition-Based Resource and Power Allocation with Sleeping Strategy for Heterogeneous Networks

KAUST Repository

Alsharoa, Ahmad M.; Ghazzai, Hakim; Yaacoub, Elias; Alouini, Mohamed-Slim

2015-01-01

In this paper, the problem of radio and power resource management in long term evolution heterogeneous networks (LTE HetNets) is investigated. The goal is to minimize the total power consumption of the network while satisfying the user quality

Dynamics-based centrality for directed networks.

Science.gov (United States)

Masuda, Naoki; Kori, Hiroshi

2010-11-01

Determining the relative importance of nodes in directed networks is important in, for example, ranking websites, publications, and sports teams, and for understanding signal flows in systems biology. A prevailing centrality measure in this respect is the PageRank. In this work, we focus on another class of centrality derived from the Laplacian of the network. We extend the Laplacian-based centrality, which has mainly been applied to strongly connected networks, to the case of general directed networks such that we can quantitatively compare arbitrary nodes. Toward this end, we adopt the idea used in the PageRank to introduce global connectivity between all the pairs of nodes with a certain strength. Numerical simulations are carried out on some networks. We also offer interpretations of the Laplacian-based centrality for general directed networks in terms of various dynamical and structural properties of networks. Importantly, the Laplacian-based centrality defined as the stationary density of the continuous-time random walk with random jumps is shown to be equivalent to the absorption probability of the random walk with sinks at each node but without random jumps. Similarly, the proposed centrality represents the importance of nodes in dynamics on the original network supplied with sinks but not with random jumps.

Community Based Networks and 5G

DEFF Research Database (Denmark)

Williams, Idongesit

2016-01-01

The deployment of previous wireless standards has provided more benefits for urban dwellers than rural dwellers. 5G deployment may not be different. This paper identifies that Community Based Networks as carriers that deserve recognition as potential 5G providers may change this. The argument....... The findings indicate that 5G connectivity can be extended to rural areas by these networks, via heterogenous networks. Hence the delivery of 5G data rates delivery via Wireless WAN in rural areas can be achieved by utilizing the causal factors of the identified models for Community Based Networks....

Adaptive co-evolution of strategies and network leading to optimal cooperation level in spatial prisoner's dilemma game

International Nuclear Information System (INIS)

Han-Shuang, Chen; Zhong-Huai, Hou; Hou-Wen, Xin; Ji-Qian, Zhang

2010-01-01

We study evolutionary prisoner's dilemma game on adaptive networks where a population of players co-evolves with their interaction networks. During the co-evolution process, interacted players with opposite strategies either rewire the link between them with probability p or update their strategies with probability 1 – p depending on their payoffs. Numerical simulation shows that the final network is either split into some disconnected communities whose players share the same strategy within each community or forms a single connected network in which all nodes are in the same strategy. Interestingly, the density of cooperators in the final state can be maximised in an intermediate range of p via the competition between time scale of the network dynamics and that of the node dynamics. Finally, the mean-field analysis helps to understand the results of numerical simulation. Our results may provide some insight into understanding the emergence of cooperation in the real situation where the individuals' behaviour and their relationship adaptively co-evolve. (general)

Metal phosphonate coordination networks and frameworks as precursors of electrocatalysts for the hydrogen and oxygen evolution reactions

Science.gov (United States)

Zhang, Rui; El-Refaei, Sayed M.; Russo, Patrícia A.; Pinna, Nicola

2018-05-01

The hydrogen evolution reaction (HER) and the oxygen evolution reaction (OER) play key roles in the conversion of energy derived from renewable energy sources into chemical energy. Efficient, robust, and inexpensive electrocatalysts are necessary for driving these reactions at high rates at low overpotentials and minimize energetic losses. Recently, electrocatalysts derived from hybrid metal phosphonate compounds have shown high activity for the HER or OER. We review here the utilization of metal phosphonate coordination networks and metal-organic frameworks as precursors/templates for transition-metal phosphides, phosphates, or oxyhydroxides generated in situ in alkaline solutions, and their electrocatalytic performance in HER or OER.

An Improved Routing Optimization Algorithm Based on Travelling Salesman Problem for Social Networks

Directory of Open Access Journals (Sweden)

Naixue Xiong

2017-06-01

Full Text Available A social network is a social structure, which is organized by the relationships or interactions between individuals or groups. Humans link the physical network with social network, and the services in the social world are based on data and analysis, which directly influence decision making in the physical network. In this paper, we focus on a routing optimization algorithm, which solves a well-known and popular problem. Ant colony algorithm is proposed to solve this problem effectively, but random selection strategy of the traditional algorithm causes evolution speed to be slow. Meanwhile, positive feedback and distributed computing model make the algorithm quickly converge. Therefore, how to improve convergence speed and search ability of algorithm is the focus of the current research. The paper proposes the improved scheme. Considering the difficulty about searching for next better city, new parameters are introduced to improve probability of selection, and delay convergence speed of algorithm. To avoid the shortest path being submerged, and improve sensitive speed of finding the shortest path, it updates pheromone regulation formula. The results show that the improved algorithm can effectively improve convergence speed and search ability for achieving higher accuracy and optimal results.

Optical burst switching based satellite backbone network

Science.gov (United States)

Li, Tingting; Guo, Hongxiang; Wang, Cen; Wu, Jian

2018-02-01

We propose a novel time slot based optical burst switching (OBS) architecture for GEO/LEO based satellite backbone network. This architecture can provide high speed data transmission rate and high switching capacity . Furthermore, we design the control plane of this optical satellite backbone network. The software defined network (SDN) and network slice (NS) technologies are introduced. Under the properly designed control mechanism, this backbone network is flexible to support various services with diverse transmission requirements. Additionally, the LEO access and handoff management in this network is also discussed.

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.

Construction of phylogenetic trees by kernel-based comparative analysis of metabolic networks.

Science.gov (United States)

Oh, S June; Joung, Je-Gun; Chang, Jeong-Ho; Zhang, Byoung-Tak

2006-06-06

To infer the tree of life requires knowledge of the common characteristics of each species descended from a common ancestor as the measuring criteria and a method to calculate the distance between the resulting values of each measure. Conventional phylogenetic analysis based on genomic sequences provides information about the genetic relationships between different organisms. In contrast, comparative analysis of metabolic pathways in different organisms can yield insights into their functional relationships under different physiological conditions. However, evaluating the similarities or differences between metabolic networks is a computationally challenging problem, and systematic methods of doing this are desirable. Here we introduce a graph-kernel method for computing the similarity between metabolic networks in polynomial time, and use it to profile metabolic pathways and to construct phylogenetic trees. To compare the structures of metabolic networks in organisms, we adopted the exponential graph kernel, which is a kernel-based approach with a labeled graph that includes a label matrix and an adjacency matrix. To construct the phylogenetic trees, we used an unweighted pair-group method with arithmetic mean, i.e., a hierarchical clustering algorithm. We applied the kernel-based network profiling method in a comparative analysis of nine carbohydrate metabolic networks from 81 biological species encompassing Archaea, Eukaryota, and Eubacteria. The resulting phylogenetic hierarchies generally support the tripartite scheme of three domains rather than the two domains of prokaryotes and eukaryotes. By combining the kernel machines with metabolic information, the method infers the context of biosphere development that covers physiological events required for adaptation by genetic reconstruction. The results show that one may obtain a global view of the tree of life by comparing the metabolic pathway structures using meta-level information rather than sequence

Construction of phylogenetic trees by kernel-based comparative analysis of metabolic networks

Directory of Open Access Journals (Sweden)

Chang Jeong-Ho

2006-06-01

Full Text Available Abstract Background To infer the tree of life requires knowledge of the common characteristics of each species descended from a common ancestor as the measuring criteria and a method to calculate the distance between the resulting values of each measure. Conventional phylogenetic analysis based on genomic sequences provides information about the genetic relationships between different organisms. In contrast, comparative analysis of metabolic pathways in different organisms can yield insights into their functional relationships under different physiological conditions. However, evaluating the similarities or differences between metabolic networks is a computationally challenging problem, and systematic methods of doing this are desirable. Here we introduce a graph-kernel method for computing the similarity between metabolic networks in polynomial time, and use it to profile metabolic pathways and to construct phylogenetic trees. Results To compare the structures of metabolic networks in organisms, we adopted the exponential graph kernel, which is a kernel-based approach with a labeled graph that includes a label matrix and an adjacency matrix. To construct the phylogenetic trees, we used an unweighted pair-group method with arithmetic mean, i.e., a hierarchical clustering algorithm. We applied the kernel-based network profiling method in a comparative analysis of nine carbohydrate metabolic networks from 81 biological species encompassing Archaea, Eukaryota, and Eubacteria. The resulting phylogenetic hierarchies generally support the tripartite scheme of three domains rather than the two domains of prokaryotes and eukaryotes. Conclusion By combining the kernel machines with metabolic information, the method infers the context of biosphere development that covers physiological events required for adaptation by genetic reconstruction. The results show that one may obtain a global view of the tree of life by comparing the metabolic pathway

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 Scalable Policy and SNMP Based Network Management Framework

Institute of Scientific and Technical Information of China (English)

LIU Su-ping; DING Yong-sheng

2009-01-01

Traditional SNMP-based network management can not deal with the task of managing large-scaled distributed network,while policy-based management is one of the effective solutions in network and distributed systems management. However,cross-vendor hardware compatibility is one of the limitations in policy-based management. Devices existing in current network mostly support SNMP rather than Common Open Policy Service (COPS) protocol. By analyzing traditional network management and policy-based network management, a scalable network management framework is proposed. It is combined with Internet Engineering Task Force (IETF) framework for policybased management and SNMP-based network management. By interpreting and translating policy decision to SNMP message,policy can be executed in traditional SNMP-based device.

CUFID-query: accurate network querying through random walk based network flow estimation.

Science.gov (United States)

Jeong, Hyundoo; Qian, Xiaoning; Yoon, Byung-Jun

2017-12-28

Functional modules in biological networks consist of numerous biomolecules and their complicated interactions. Recent studies have shown that biomolecules in a functional module tend to have similar interaction patterns and that such modules are often conserved across biological networks of different species. As a result, such conserved functional modules can be identified through comparative analysis of biological networks. In this work, we propose a novel network querying algorithm based on the CUFID (Comparative network analysis Using the steady-state network Flow to IDentify orthologous proteins) framework combined with an efficient seed-and-extension approach. The proposed algorithm, CUFID-query, can accurately detect conserved functional modules as small subnetworks in the target network that are expected to perform similar functions to the given query functional module. The CUFID framework was recently developed for probabilistic pairwise global comparison of biological networks, and it has been applied to pairwise global network alignment, where the framework was shown to yield accurate network alignment results. In the proposed CUFID-query algorithm, we adopt the CUFID framework and extend it for local network alignment, specifically to solve network querying problems. First, in the seed selection phase, the proposed method utilizes the CUFID framework to compare the query and the target networks and to predict the probabilistic node-to-node correspondence between the networks. Next, the algorithm selects and greedily extends the seed in the target network by iteratively adding nodes that have frequent interactions with other nodes in the seed network, in a way that the conductance of the extended network is maximally reduced. Finally, CUFID-query removes irrelevant nodes from the querying results based on the personalized PageRank vector for the induced network that includes the fully extended network and its neighboring nodes. Through extensive

Epidemic dynamics on a risk-based evolving social network

Science.gov (United States)

Antwi, Shadrack; Shaw, Leah

2013-03-01

Social network models have been used to study how behavior affects the dynamics of an infection in a population. Motivated by HIV, we consider how a trade-off between benefits and risks of sexual connections determine network structure and disease prevalence. We define a stochastic network model with formation and breaking of links as changes in sexual contacts. Each node has an intrinsic benefit its neighbors derive from connecting to it. Nodes' infection status is not apparent to others, but nodes with more connections (higher degree) are assumed more likely to be infected. The probability to form and break links is determined by a payoff computed from the benefit and degree-dependent risk. The disease is represented by a SI (susceptible-infected) model. We study network and epidemic evolution via Monte Carlo simulation and analytically predict the behavior with a heterogeneous mean field approach. The dependence of network connectivity and infection threshold on parameters is determined, and steady state degree distribution and epidemic levels are obtained. We also study a situation where system-wide infection levels alter perception of risk and cause nodes to adjust their behavior. This is a case of an adaptive network, where node status feeds back to change network geometry.

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.

Study on Reverse Reconstruction Method of Vehicle Group Situation in Urban Road Network Based on Driver-Vehicle Feature Evolution

Directory of Open Access Journals (Sweden)

Xiaoyuan Wang

2017-01-01

Full Text Available Vehicle group situation is the status and situation of dynamic permutation which is composed of target vehicle and neighboring traffic entities. It is a concept which is frequently involved in the research of traffic flow theory, especially the active vehicle security. Studying vehicle group situation in depth is of great significance for traffic safety. Three-lane condition was taken as an example; the characteristics of target vehicle and its neighboring vehicles were synthetically considered to restructure the vehicle group situation in this paper. The Gamma distribution theory was used to identify the vehicle group situation when target vehicle arrived at the end of the study area. From the perspective of driver-vehicle feature evolution, the reverse reconstruction method of vehicle group situation in the urban road network was proposed. Results of actual driving, virtual driving, and simulation experiments showed that the model established in this paper was reasonable and feasible.

A NEURAL NETWORK BASED TRAFFIC-AWARE FORWARDING STRATEGY IN NAMED DATA NETWORKING

OpenAIRE

Parisa Bazmi; Manijeh Keshtgary

2016-01-01

Named Data Networking (NDN) is a new Internet architecture which has been proposed to eliminate TCP/IP Internet architecture restrictions. This architecture is abstracting away the notion of host and working based on naming datagrams. However, one of the major challenges of NDN is supporting QoS-aware forwarding strategy so as to forward Interest packets intelligently over multiple paths based on the current network condition. In this paper, Neural Network (NN) Based Traffic-aware Forwarding ...

Emergent explosive synchronization in adaptive complex networks

Science.gov (United States)

Avalos-Gaytán, Vanesa; Almendral, Juan A.; Leyva, I.; Battiston, F.; Nicosia, V.; Latora, V.; Boccaletti, S.

2018-04-01

Adaptation plays a fundamental role in shaping the structure of a complex network and improving its functional fitting. Even when increasing the level of synchronization in a biological system is considered as the main driving force for adaptation, there is evidence of negative effects induced by excessive synchronization. This indicates that coherence alone cannot be enough to explain all the structural features observed in many real-world networks. In this work, we propose an adaptive network model where the dynamical evolution of the node states toward synchronization is coupled with an evolution of the link weights based on an anti-Hebbian adaptive rule, which accounts for the presence of inhibitory effects in the system. We found that the emergent networks spontaneously develop the structural conditions to sustain explosive synchronization. Our results can enlighten the shaping mechanisms at the heart of the structural and dynamical organization of some relevant biological systems, namely, brain networks, for which the emergence of explosive synchronization has been observed.

Density-based and transport-based core-periphery structures in networks.

Science.gov (United States)

Lee, Sang Hoon; Cucuringu, Mihai; Porter, Mason A

2014-03-01

Networks often possess mesoscale structures, and studying them can yield insights into both structure and function. It is most common to study community structure, but numerous other types of mesoscale structures also exist. In this paper, we examine core-periphery structures based on both density and transport. In such structures, core network components are well-connected both among themselves and to peripheral components, which are not well-connected to anything. We examine core-periphery structures in a wide range of examples of transportation, social, and financial networks-including road networks in large urban areas, a rabbit warren, a dolphin social network, a European interbank network, and a migration network between counties in the United States. We illustrate that a recently developed transport-based notion of node coreness is very useful for characterizing transportation networks. We also generalize this notion to examine core versus peripheral edges, and we show that the resulting diagnostic is also useful for transportation networks. To examine the properties of transportation networks further, we develop a family of generative models of roadlike networks. We illustrate the effect of the dimensionality of the embedding space on transportation networks, and we demonstrate that the correlations between different measures of coreness can be very different for different types of networks.

Modeling the interdependent network based on two-mode networks

Science.gov (United States)

An, Feng; Gao, Xiangyun; Guan, Jianhe; Huang, Shupei; Liu, Qian

2017-10-01

Among heterogeneous networks, there exist obviously and closely interdependent linkages. Unlike existing research primarily focus on the theoretical research of physical interdependent network model. We propose a two-layer interdependent network model based on two-mode networks to explore the interdependent features in the reality. Specifically, we construct a two-layer interdependent loan network and develop several dependent features indices. The model is verified to enable us to capture the loan dependent features of listed companies based on loan behaviors and shared shareholders. Taking Chinese debit and credit market as case study, the main conclusions are: (1) only few listed companies shoulder the main capital transmission (20% listed companies occupy almost 70% dependent degree). (2) The control of these key listed companies will be more effective of avoiding the spreading of financial risks. (3) Identifying the companies with high betweenness centrality and controlling them could be helpful to monitor the financial risk spreading. (4) The capital transmission channel among Chinese financial listed companies and Chinese non-financial listed companies are relatively strong. However, under greater pressure of demand of capital transmission (70% edges failed), the transmission channel, which constructed by debit and credit behavior, will eventually collapse.

Networks as systems.

Science.gov (United States)

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

2018-03-19

Purpose The purpose of this paper is to present a case study of the World Health Organization's Global Healthcare Workforce Alliance (GHWA). Based on a commissioned evaluation of GHWA, it applies network theory and key concepts from systems thinking to explore network emergence, effectiveness, and evolution to over a ten-year period. The research was designed to provide high-level strategic guidance for further evolution of global governance in human resources for health (HRH). Design/methodology/approach Methods included a review of published literature on HRH governance and current practice in the field and an in-depth case study whose main data sources were relevant GHWA background documents and key informant interviews with GHWA leaders, staff, and stakeholders. Sampling was purposive and at a senior level, focusing on board members, executive directors, funders, and academics. Data were analyzed thematically with reference to systems theory and Shiffman's theory of network development. Findings Five key lessons emerged: effective management and leadership are critical; networks need to balance "tight" and "loose" approaches to their structure and processes; an active communication strategy is key to create and maintain support; the goals, priorities, and membership must be carefully focused; and the network needs to support shared measurement of progress on agreed-upon goals. Shiffman's middle-range network theory is a useful tool when guided by the principles of complex systems that illuminate dynamic situations and shifting interests as global alliances evolve. Research limitations/implications This study was implemented at the end of the ten-year funding cycle. A more continuous evaluation throughout the term would have provided richer understanding of issues. Experience and perspectives at the country level were not assessed. Practical implications Design and management of large, complex networks requires ongoing attention to key issues like leadership

General purpose graphics-processing-unit implementation of cosmological domain wall network evolution.

Science.gov (United States)

Correia, J R C C C; Martins, C J A P

2017-10-01

Topological defects unavoidably form at symmetry breaking phase transitions in the early universe. To probe the parameter space of theoretical models and set tighter experimental constraints (exploiting the recent advances in astrophysical observations), one requires more and more demanding simulations, and therefore more hardware resources and computation time. Improving the speed and efficiency of existing codes is essential. Here we present a general purpose graphics-processing-unit implementation of the canonical Press-Ryden-Spergel algorithm for the evolution of cosmological domain wall networks. This is ported to the Open Computing Language standard, and as a consequence significant speedups are achieved both in two-dimensional (2D) and 3D simulations.

General purpose graphics-processing-unit implementation of cosmological domain wall network evolution

Science.gov (United States)

Correia, J. R. C. C. C.; Martins, C. J. A. P.

2017-10-01

Topological defects unavoidably form at symmetry breaking phase transitions in the early universe. To probe the parameter space of theoretical models and set tighter experimental constraints (exploiting the recent advances in astrophysical observations), one requires more and more demanding simulations, and therefore more hardware resources and computation time. Improving the speed and efficiency of existing codes is essential. Here we present a general purpose graphics-processing-unit implementation of the canonical Press-Ryden-Spergel algorithm for the evolution of cosmological domain wall networks. This is ported to the Open Computing Language standard, and as a consequence significant speedups are achieved both in two-dimensional (2D) and 3D simulations.

Resilience-based optimal design of water distribution network

Science.gov (United States)

Suribabu, C. R.

2017-11-01

Optimal design of water distribution network is generally aimed to minimize the capital cost of the investments on tanks, pipes, pumps, and other appurtenances. Minimizing the cost of pipes is usually considered as a prime objective as its proportion in capital cost of the water distribution system project is very high. However, minimizing the capital cost of the pipeline alone may result in economical network configuration, but it may not be a promising solution in terms of resilience point of view. Resilience of the water distribution network has been considered as one of the popular surrogate measures to address ability of network to withstand failure scenarios. To improve the resiliency of the network, the pipe network optimization can be performed with two objectives, namely minimizing the capital cost as first objective and maximizing resilience measure of the configuration as secondary objective. In the present work, these two objectives are combined as single objective and optimization problem is solved by differential evolution technique. The paper illustrates the procedure for normalizing the objective functions having distinct metrics. Two of the existing resilience indices and power efficiency are considered for optimal design of water distribution network. The proposed normalized objective function is found to be efficient under weighted method of handling multi-objective water distribution design problem. The numerical results of the design indicate the importance of sizing pipe telescopically along shortest path of flow to have enhanced resiliency indices.

Directed weighted network structure analysis of complex impedance measurements for characterizing oil-in-water bubbly flow.

Science.gov (United States)

Gao, Zhong-Ke; Dang, Wei-Dong; Xue, Le; Zhang, Shan-Shan

2017-03-01

Characterizing the flow structure underlying the evolution of oil-in-water bubbly flow remains a contemporary challenge of great interests and complexity. In particular, the oil droplets dispersing in a water continuum with diverse size make the study of oil-in-water bubbly flow really difficult. To study this issue, we first design a novel complex impedance sensor and systematically conduct vertical oil-water flow experiments. Based on the multivariate complex impedance measurements, we define modalities associated with the spatial transient flow structures and construct modality transition-based network for each flow condition to study the evolution of flow structures. In order to reveal the unique flow structures underlying the oil-in-water bubbly flow, we filter the inferred modality transition-based network by removing the edges with small weight and resulting isolated nodes. Then, the weighted clustering coefficient entropy and weighted average path length are employed for quantitatively assessing the original network and filtered network. The differences in network measures enable to efficiently characterize the evolution of the oil-in-water bubbly flow structures.

Insights on fluid-rock interaction evolution during deformation from fracture network geochemistry at reservoir-scale

Science.gov (United States)

Beaudoin, Nicolas; Koehn, Daniel; Lacombe, Olivier; Bellahsen, Nicolas; Emmanuel, Laurent

2015-04-01

Fluid migration and fluid-rock interactions during deformation is a challenging problematic to picture. Numerous interplays, as between porosity-permeability creation and clogging, or evolution of the mechanical properties of rock, are key features when it comes to monitor reservoir evolution, or to better understand seismic cycle n the shallow crust. These phenomenoms are especially important in foreland basins, where various fluids can invade strata and efficiently react with limestones, altering their physical properties. Stable isotopes (O, C, Sr) measurements and fluid inclusion microthermometry of faults cement and veins cement lead to efficient reconstruction of the origin, temperature and migration pathways for fluids (i.e. fluid system) that precipitated during joints opening or faults activation. Such a toolbox can be used on a diffuse fracture network that testifies the local and/or regional deformation history experienced by the rock at reservoir-scale. This contribution underlines the advantages and limits of geochemical studies of diffuse fracture network at reservoir-scale by presenting results of fluid system reconstruction during deformation in folded structures from various thrust-belts, tectonic context and deformation history. We compare reconstructions of fluid-rock interaction evolution during post-deposition, post-burial growth of basement-involved folds in the Sevier-Laramide American Rocky Mountains foreland, a reconstruction of fluid-rock interaction evolution during syn-depostion shallow detachment folding in the Southern Pyrenean foreland, and a preliminary reconstruction of fluid-rock interactions in a post-deposition, post-burial development of a detachment fold in the Appenines. Beyond regional specification for the nature of fluids, a common behavior appears during deformation as in every fold, curvature-related joints (related either to folding or to foreland flexure) connected vertically the pre-existing stratified fluid system

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.

A protein interaction atlas for the nuclear receptors: properties and quality of a hub-based dimerisation network

Directory of Open Access Journals (Sweden)

De Graaf David

2007-07-01

Full Text Available Abstract Background The nuclear receptors are a large family of eukaryotic transcription factors that constitute major pharmacological targets. They exert their combinatorial control through homotypic heterodimerisation. Elucidation of this dimerisation network is vital in order to understand the complex dynamics and potential cross-talk involved. Results Phylogeny, protein-protein interactions, protein-DNA interactions and gene expression data have been integrated to provide a comprehensive and up-to-date description of the topology and properties of the nuclear receptor interaction network in humans. We discriminate between DNA-binding and non-DNA-binding dimers, and provide a comprehensive interaction map, that identifies potential cross-talk between the various pathways of nuclear receptors. Conclusion We infer that the topology of this network is hub-based, and much more connected than previously thought. The hub-based topology of the network and the wide tissue expression pattern of NRs create a highly competitive environment for the common heterodimerising partners. Furthermore, a significant number of negative feedback loops is present, with the hub protein SHP [NR0B2] playing a major role. We also compare the evolution, topology and properties of the nuclear receptor network with the hub-based dimerisation network of the bHLH transcription factors in order to identify both unique themes and ubiquitous properties in gene regulation. In terms of methodology, we conclude that such a comprehensive picture can only be assembled by semi-automated text-mining, manual curation and integration of data from various sources.

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.

Multi-Equilibria Regulation Agent-Based Model of Opinion Dynamics in Social Networks

Directory of Open Access Journals (Sweden)

Andreas Koulouris

2013-01-01

Full Text Available This article investigates the Multiple Equilibria Regulation (MER model, i.e., an agent-based simulation model, to represent opinion dynamics in social networks. It relies on a small set of micro-prerequisites (intra-individual balance and confidence bound, leading to emergence of (nonstationary macro-outcomes. These outcomes may refer to consensus, polarization or fragmentation of opinions about taxation (e.g., congestion pricing or other policy measures, according to the way communication is structured. In contrast with other models of opinion dynamics, it allows for the impact of both the regulation of intra-personal discrepancy and the interpersonal variability of opinions on social learning and network dynamics. Several simulation experiments are presented to demonstrate, through the MER model, the role of different network structures (complete, star, cellular automata, small-world and random graphs on opinion formation dynamics and the overall evolution of the system. The findings can help to identify specific topological characteristics, such as density, number of neighbourhoods and critical nodes-agents, that affect the stability and system dynamics. This knowledge can be used to better organize the information diffusion and learning in the community, enhance the predictability of outcomes and manage possible conflicts. It is shown that a small-world organization, which depicts more realistic aspects of real-life and virtual social systems, provides increased predictability and stability towards a less fragmented and more manageable grouping of opinions, compared to random networks. Such macro-level organizations may be enhanced with use of web-based technologies to increase the density of communication and public acceptability of policy measures.

Community Evolution

OpenAIRE

Saganowski, Stanisław; Bródka, Piotr; Kazienko, Przemysław

2016-01-01

The continuous interest in the social network area contributes to the fast development of this field. The new possibilities of obtaining and storing data facilitate deeper analysis of the entire social network, extracted social groups and single individuals as well. One of the most interesting research topic is the network dynamics and dynamics of social groups in particular, it means analysis of group evolution over time. It is the natural step forward after social community extraction. Havi...

Evolution and strengthening of the Calabrian Regional Seismic Network during the Pollino sequence

Science.gov (United States)

D'Alessandro, Antonino; Gervasi, Anna; Guerra, Ignazio

2013-04-01

In the last three years the Calabria-Lucania border area is affected by an intense seismic activity generated by the activation of geological structures which be seat of clusters of microearthquakes, with energy release sufficient to be felt and to generate alarm and bother. Besides to the historical memory of the inhabitants of Mormanno (the town most affected of macroseismic effects) there are some historical documents that indicate the occurrence of a similar seismic crisis in 1888. A more recent seismic sequence, the first monitored by seismic instruments, occurred in 1973-1974. In the last case, the activity started in early 2010 and is still ongoing. The two shocks of ML = 4.3 and 5.0 and the the very long time duration differs this crisis from the previous ones. Given this background, in 1981 was installed at Mormanno a seismic station (MMN) belonging to Regional Seismic Network of the University of Calabria (RSRC), now also a station of the Italian National Seismic Network of the Istituto Nazionale di Geofisica Vulcanolgia (INSN-INGV). This seismic station made it possible to follow the evolution of seismicity in this area and in particular the progressive increase in seismic activity started in 2010. Since 2010, some 3D stand-alone, was installed by the University of Calabria. Further stations of INGV were installed in November 2011 after a sharp increase of the energy release and subsequently by the INGV and the GeoForschungsZentrum (Potsdam) after the main shock of the whole sequence. Seismic networks are powerful tools for understanding active tectonic processes in a monitored seismically active region. However, the optimal monitoring of a seismic region requires the assessment of the seismic network capabilities to identify seismogenic areas that are not adequately covered and to quantify measures that will allow the network improvement. In this paper we examine in detail the evolution and the strengthening of the RSRC in the last years analyzing the

Resource Discovery in Activity-Based Sensor Networks

DEFF Research Database (Denmark)

Bucur, Doina; Bardram, Jakob

This paper proposes a service discovery protocol for sensor networks that is specifically tailored for use in humancentered pervasive environments. It uses the high-level concept of computational activities (as logical bundles of data and resources) to give sensors in Activity-Based Sensor Networ....... ABSN enhances the generic Extended Zone Routing Protocol with logical sensor grouping and greatly lowers network overhead during the process of discovery, while keeping discovery latency close to optimal.......This paper proposes a service discovery protocol for sensor networks that is specifically tailored for use in humancentered pervasive environments. It uses the high-level concept of computational activities (as logical bundles of data and resources) to give sensors in Activity-Based Sensor Networks...... (ABSNs) knowledge about their usage even at the network layer. ABSN redesigns classical network-level service discovery protocols to include and use this logical structuring of the network for a more practically applicable service discovery scheme. Noting that in practical settings activity-based sensor...

Resource Discovery in Activity-Based Sensor Networks

DEFF Research Database (Denmark)

Bucur, Doina; Bardram, Jakob

This paper proposes a service discovery protocol for sensor networks that is specifically tailored for use in humancentered pervasive environments. It uses the high-level concept of computational activities (as logical bundles of data and resources) to give sensors in Activity-Based Sensor Networks...... (ABSNs) knowledge about their usage even at the network layer. ABSN redesigns classical network-level service discovery protocols to include and use this logical structuring of the network for a more practically applicable service discovery scheme. Noting that in practical settings activity-based sensor...

Deployment strategy for battery energy storage system in distribution network based on voltage violation regulation

Science.gov (United States)

Wu, H.; Zhou, L.; Xu, T.; Fang, W. L.; He, W. G.; Liu, H. M.

2017-11-01

In order to improve the situation of voltage violation caused by the grid-connection of photovoltaic (PV) system in a distribution network, a bi-level programming model is proposed for battery energy storage system (BESS) deployment. The objective function of inner level programming is to minimize voltage violation, with the power of PV and BESS as the variables. The objective function of outer level programming is to minimize the comprehensive function originated from inner layer programming and all the BESS operating parameters, with the capacity and rated power of BESS as the variables. The differential evolution (DE) algorithm is applied to solve the model. Based on distribution network operation scenarios with photovoltaic generation under multiple alternative output modes, the simulation results of IEEE 33-bus system prove that the deployment strategy of BESS proposed in this paper is well adapted to voltage violation regulation invariable distribution network operation scenarios. It contributes to regulating voltage violation in distribution network, as well as to improve the utilization of PV systems.

Five Rules for the Evolution of Cooperation

Science.gov (United States)

Nowak, Martin A.

2006-12-01

Cooperation is needed for evolution to construct new levels of organization. Genomes, cells, multicellular organisms, social insects, and human society are all based on cooperation. Cooperation means that selfish replicators forgo some of their reproductive potential to help one another. But natural selection implies competition and therefore opposes cooperation unless a specific mechanism is at work. Here I discuss five mechanisms for the evolution of cooperation: kin selection, direct reciprocity, indirect reciprocity, network reciprocity, and group selection. For each mechanism, a simple rule is derived that specifies whether natural selection can lead to cooperation.

MANAGING GLOBAL OPERATIONS NETWORKS IN MOTION

DEFF Research Database (Denmark)

Slepniov, Dmitrij; Jørgensen, Claus; Sørensen, Brian Vejrum

2008-01-01

capabilities and intensified need for transfer, assimilation and augmentation of activities and know-how within the network. Based on these the paper highlights some organisational effects and managerial challenges the companies face regarding rapid changes in their networks configurations and capabilities.......Most industrial companies are, for reasons related to cost, market access or knowledge, working with some aspect of offshore operations. This may take form of captive operations or through outsourcing of activities overseas. With this trend, global operations networks are emerging resulting...... in corporate strategic repositioning, re-configurations of sites, and changes to the underlying capabilities. The paper is based on cases of 3 Danish companies and their global supply networks. These networks are not in a steady state, they evolve as a consequence of the ongoing co-evolution between the focal...

Evaluating airline energy efficiency: An integrated approach with Network Epsilon-based Measure and Network Slacks-based Measure

International Nuclear Information System (INIS)

Xu, Xin; Cui, Qiang

2017-01-01

This paper focuses on evaluating airline energy efficiency, which is firstly divided into four stages: Operations Stage, Fleet Maintenance Stage, Services Stage and Sales Stage. The new four-stage network structure of airline energy efficiency is a modification of existing models. A new approach, integrated with Network Epsilon-based Measure and Network Slacks-based Measure, is applied to assess the overall energy efficiency and divisional efficiency of 19 international airlines from 2008 to 2014. The influencing factors of airline energy efficiency are analyzed through the regression analysis. The results indicate the followings: 1. The integrated model can identify the benchmarking airlines in the overall system and stages. 2. Most airlines' energy efficiencies keep steady during the period, except for some sharply fluctuations. The efficiency decreases mainly centralized in the year 2008–2011, affected by the financial crisis in the USA. 3. The average age of fleet is positively correlated with the overall energy efficiency, and each divisional efficiency has different significant influencing factors. - Highlights: • An integrated approach with Network Epsilon-based Measure and Network Slacks-based Measure is developed. • 19 airlines' energy efficiencies are evaluated. • Garuda Indonesia has the highest overall energy efficiency.

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.

Next generation passive optical networks based on orthogonal frequency division multiplexing techniques

OpenAIRE

Escayola Elias, Francesc Xavier

2015-01-01

In recent decades, the industry of communications has acquired huge significance, and nowadays constitutes an essential tool for the society information. Thus, the exponential growth in demand of broadband services and the increasing amount of information to be transmitted have spurred the evolution of the access network infrastructure to effectively meet the user needs in an effective way in terms of costs of both installation and maintenance. Passive optical networks (PON) are current...

EAP-Based Authentication for Ad Hoc Network

OpenAIRE

Bhakti, Muhammad Agni Catur; Abdullah, Azween; Jung, Low Tan

2007-01-01

Wireless network has been deployed worldwide, but some security issues in wireless network might haveprevented its further acceptance. One of the solutions to overcome the limitation of wireless network security isthe IEEE 802.1X specification, a mechanism for port-based network access control, which is based onExtensible Authentication Protocol (EAP). It is an authentication framework that can support multipleauthentication methods. EAP can run over many types of data-link layer and it is fl...

The dynamic evolution of social ties and user-generated content: a case study on a Douban group

Science.gov (United States)

Shan, Siqing; Ren, Jie; Li, Cangyan

2017-11-01

As platforms based on user-generated content (UGC), social media platforms emphasise the social ties between users and user participation, which promote the communication and propagation of ideas and help to build and maintain relationships. However, many researchers have studied only predefined social networks, such as academic social networks. We believe that there are certain characteristics associated with the network's UGC worth evaluating. We conducted research in communities in which content attracts discussion and new members and examined the evolution patterns of social and content networks in a topic-oriented Douban group. Datasets of user and content information in communities of interest were collected through web crawler software. Networks based on social and content ties were constructed and analysed. We chose scale, density, centrality, average path length and cluster coefficient as measures for exploring the evolution and correlation of both types of networks. These findings are valuable for social media marketing and helpful in directing and controlling public opinion.

Research on Fault Diagnosis Method Based on Rule Base Neural Network

Directory of Open Access Journals (Sweden)

Zheng Ni

2017-01-01

Full Text Available The relationship between fault phenomenon and fault cause is always nonlinear, which influences the accuracy of fault location. And neural network is effective in dealing with nonlinear problem. In order to improve the efficiency of uncertain fault diagnosis based on neural network, a neural network fault diagnosis method based on rule base is put forward. At first, the structure of BP neural network is built and the learning rule is given. Then, the rule base is built by fuzzy theory. An improved fuzzy neural construction model is designed, in which the calculated methods of node function and membership function are also given. Simulation results confirm the effectiveness of this method.

Evolution of a Computer-Based Testing Laboratory

Science.gov (United States)

Moskal, Patrick; Caldwell, Richard; Ellis, Taylor

2009-01-01

In 2003, faced with increasing growth in technology-based and large-enrollment courses, the College of Business Administration at the University of Central Florida opened a computer-based testing lab to facilitate administration of course examinations. Patrick Moskal, Richard Caldwell, and Taylor Ellis describe the development and evolution of the…

IDMA-Based MAC Protocol for Satellite Networks with Consideration on Channel Quality

Directory of Open Access Journals (Sweden)

Gongliang Liu

2014-01-01

Full Text Available In order to overcome the shortcomings of existing medium access control (MAC protocols based on TDMA or CDMA in satellite networks, interleave division multiple access (IDMA technique is introduced into satellite communication networks. Therefore, a novel wide-band IDMA MAC protocol based on channel quality is proposed in this paper, consisting of a dynamic power allocation algorithm, a rate adaptation algorithm, and a call admission control (CAC scheme. Firstly, the power allocation algorithm combining the technique of IDMA SINR-evolution and channel quality prediction is developed to guarantee high power efficiency even in terrible channel conditions. Secondly, the effective rate adaptation algorithm, based on accurate channel information per timeslot and by the means of rate degradation, can be realized. What is more, based on channel quality prediction, the CAC scheme, combining the new power allocation algorithm, rate scheduling, and buffering strategies together, is proposed for the emerging IDMA systems, which can support a variety of traffic types, and offering quality of service (QoS requirements corresponding to different priority levels. Simulation results show that the new wide-band IDMA MAC protocol can make accurate estimation of available resource considering the effect of multiuser detection (MUD and QoS requirements of multimedia traffic, leading to low outage probability as well as high overall system throughput.

NM-Net Gigabit-based Implementation on Core Network Facilities and Network Design Hierarchy

International Nuclear Information System (INIS)

Raja Murzaferi Raja Moktar; Mohd Fauzi Haris; Siti Nurbahyah Hamdan

2011-01-01

Nuclear Malaysia computing network or NM the main backbone of internet working on operational staffs. Main network operating center or NOC is situated in Block 15 and linkup via fiber cabling to adjacent main network blocks (18, 29, 11 connections. Pre 2009 infrastructure; together to form the core networking switch. of the core network infrastructure were limited by the up link between core switches that is the Pair (UTP) Category 6 Cable. Furthermore, majority of the networking infrastructure throughout the agency were mainly built with Fast Ethernet Based specifications to date. With current research and operational tasks highly dependent on IT infrastructure that is being enabled through NM-Net, the performance NM-Net implementing gigabit-based networking system achieve optimal performance of internet networking services in the agency thus catalyze initiative. (author)

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.

A NEURAL NETWORK BASED TRAFFIC-AWARE FORWARDING STRATEGY IN NAMED DATA NETWORKING

Directory of Open Access Journals (Sweden)

Parisa Bazmi

2016-11-01

Full Text Available Named Data Networking (NDN is a new Internet architecture which has been proposed to eliminate TCP/IP Internet architecture restrictions. This architecture is abstracting away the notion of host and working based on naming datagrams. However, one of the major challenges of NDN is supporting QoS-aware forwarding strategy so as to forward Interest packets intelligently over multiple paths based on the current network condition. In this paper, Neural Network (NN Based Traffic-aware Forwarding strategy (NNTF is introduced in order to determine an optimal path for Interest forwarding. NN is embedded in NDN routers to select next hop dynamically based on the path overload probability achieved from the NN. This solution is characterized by load balancing and QoS-awareness via monitoring the available path and forwarding data on the traffic-aware shortest path. The performance of NNTF is evaluated using ndnSIM which shows the efficiency of this scheme in terms of network QoS improvementof17.5% and 72% reduction in network delay and packet drop respectively.

A link prediction method for heterogeneous networks based on BP neural network

Science.gov (United States)

Li, Ji-chao; Zhao, Dan-ling; Ge, Bing-Feng; Yang, Ke-Wei; Chen, Ying-Wu

2018-04-01

Most real-world systems, composed of different types of objects connected via many interconnections, can be abstracted as various complex heterogeneous networks. Link prediction for heterogeneous networks is of great significance for mining missing links and reconfiguring networks according to observed information, with considerable applications in, for example, friend and location recommendations and disease-gene candidate detection. In this paper, we put forward a novel integrated framework, called MPBP (Meta-Path feature-based BP neural network model), to predict multiple types of links for heterogeneous networks. More specifically, the concept of meta-path is introduced, followed by the extraction of meta-path features for heterogeneous networks. Next, based on the extracted meta-path features, a supervised link prediction model is built with a three-layer BP neural network. Then, the solution algorithm of the proposed link prediction model is put forward to obtain predicted results by iteratively training the network. Last, numerical experiments on the dataset of examples of a gene-disease network and a combat network are conducted to verify the effectiveness and feasibility of the proposed MPBP. It shows that the MPBP with very good performance is superior to the baseline methods.

Musculoskeletal networks reveal topological disparity in mammalian neck evolution.

Science.gov (United States)

Arnold, Patrick; Esteve-Altava, Borja; Fischer, Martin S

2017-12-13

The increase in locomotor and metabolic performance during mammalian evolution was accompanied by the limitation of the number of cervical vertebrae to only seven. In turn, nuchal muscles underwent a reorganization while forelimb muscles expanded into the neck region. As variation in the cervical spine is low, the variation in the arrangement of the neck muscles and their attachment sites (i.e., the variability of the neck's musculoskeletal organization) is thus proposed to be an important source of neck disparity across mammals. Anatomical network analysis provides a novel framework to study the organization of the anatomical arrangement, or connectivity pattern, of the bones and muscles that constitute the mammalian neck in an evolutionary context. Neck organization in mammals is characterized by a combination of conserved and highly variable network properties. We uncovered a conserved regionalization of the musculoskeletal organization of the neck into upper, mid and lower cervical modules. In contrast, there is a varying degree of complexity or specialization and of the integration of the pectoral elements. The musculoskeletal organization of the monotreme neck is distinctively different from that of therian mammals. Our findings reveal that the limited number of vertebrae in the mammalian neck does not result in a low musculoskeletal disparity when examined in an evolutionary context. However, this disparity evolved late in mammalian history in parallel with the radiation of certain lineages (e.g., cetartiodactyls, xenarthrans). Disparity is further facilitated by the enhanced incorporation of forelimb muscles into the neck and their variability in attachment sites.

Software-Defined Networks as a Stage of the Network Technology Evolution

Directory of Open Access Journals (Sweden)

A. A. Krasotin

2013-01-01

Full Text Available The authors of the article focus on the concept of a software defined network. In the beginning, the brief historical account is given concerning software defined networks as a scientific concept, its formation and technological and scientific meaning. The software defined network concept is treated in the article not as the final state-of-the-art in networking, but rather as a possible step and direction in the development of a networking paradigm. The article touches on pros and cons as well of the software defined networking and gives an account of possible stages of development of this technology in the context of other technologies, considering its hybrid with MPLS, as an example. OpenFlow protocol constitutes the main part of the article. The authors further discuss various kinds of existing libraries realizing programmable management routines for a software defined network using OpenFlow. All of these libraries provide API for building modular applications for software defined network management. Touching on practical side of implementation the results of comparative tests of throughput and latency, achieved with these libraries are shown.

Network-Aware DHT-Based P2P Systems

Science.gov (United States)

Fayçal, Marguerite; Serhrouchni, Ahmed

P2P networks lay over existing IP networks and infrastructure. This chapter investigates the relation between both layers, details the motivations for network awareness in P2P systems, and elucidates the requirements P2P systems have to meet for efficient network awareness. Since new P2P systems are mostly based on DHTs, we also present and analyse DHT-based architectures. And after a brief presentation of different existing network-awareness solutions, the chapter goes on effective cooperation between P2P traffic and network providers' business agreements, and introduces emerging DHT-based P2P systems that are network aware through a semantic defined for resource sharing. These new systems ensure also a certain context-awareness. So, they are analyzed and compared before an open end on prospects of network awareness in P2P systems.

Host Event Based Network Monitoring

Energy Technology Data Exchange (ETDEWEB)

Jonathan Chugg

2013-01-01

The purpose of INL’s research on this project is to demonstrate the feasibility of a host event based network monitoring tool and the effects on host performance. Current host based network monitoring tools work on polling which can miss activity if it occurs between polls. Instead of polling, a tool could be developed that makes use of event APIs in the operating system to receive asynchronous notifications of network activity. Analysis and logging of these events will allow the tool to construct the complete real-time and historical network configuration of the host while the tool is running. This research focused on three major operating systems commonly used by SCADA systems: Linux, WindowsXP, and Windows7. Windows 7 offers two paths that have minimal impact on the system and should be seriously considered. First is the new Windows Event Logging API, and, second, Windows 7 offers the ALE API within WFP. Any future work should focus on these methods.

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

Biological signatures of dynamic river networks from a coupled landscape evolution and neutral community model

Science.gov (United States)

Stokes, M.; Perron, J. T.

2017-12-01

Freshwater systems host exceptionally species-rich communities whose spatial structure is dictated by the topology of the river networks they inhabit. Over geologic time, river networks are dynamic; drainage basins shrink and grow, and river capture establishes new connections between previously separated regions. It has been hypothesized that these changes in river network structure influence the evolution of life by exchanging and isolating species, perhaps boosting biodiversity in the process. However, no general model exists to predict the evolutionary consequences of landscape change. We couple a neutral community model of freshwater organisms to a landscape evolution model in which the river network undergoes drainage divide migration and repeated river capture. Neutral community models are macro-ecological models that include stochastic speciation and dispersal to produce realistic patterns of biodiversity. We explore the consequences of three modes of speciation - point mutation, time-protracted, and vicariant (geographic) speciation - by tracking patterns of diversity in time and comparing the final result to an equilibrium solution of the neutral model on the final landscape. Under point mutation, a simple model of stochastic and instantaneous speciation, the results are identical to the equilibrium solution and indicate the dominance of the species-area relationship in forming patterns of diversity. The number of species in a basin is proportional to its area, and regional species richness reaches its maximum when drainage area is evenly distributed among sub-basins. Time-protracted speciation is also modeled as a stochastic process, but in order to produce more realistic rates of diversification, speciation is not assumed to be instantaneous. Rather, each new species must persist for a certain amount of time before it is considered to be established. When vicariance (geographic speciation) is included, there is a transient signature of increased

Network-based functional enrichment

Directory of Open Access Journals (Sweden)

Poirel Christopher L

2011-11-01

Full Text Available Abstract Background Many methods have been developed to infer and reason about molecular interaction networks. These approaches often yield networks with hundreds or thousands of nodes and up to an order of magnitude more edges. It is often desirable to summarize the biological information in such networks. A very common approach is to use gene function enrichment analysis for this task. A major drawback of this method is that it ignores information about the edges in the network being analyzed, i.e., it treats the network simply as a set of genes. In this paper, we introduce a novel method for functional enrichment that explicitly takes network interactions into account. Results Our approach naturally generalizes Fisher’s exact test, a gene set-based technique. Given a function of interest, we compute the subgraph of the network induced by genes annotated to this function. We use the sequence of sizes of the connected components of this sub-network to estimate its connectivity. We estimate the statistical significance of the connectivity empirically by a permutation test. We present three applications of our method: i determine which functions are enriched in a given network, ii given a network and an interesting sub-network of genes within that network, determine which functions are enriched in the sub-network, and iii given two networks, determine the functions for which the connectivity improves when we merge the second network into the first. Through these applications, we show that our approach is a natural alternative to network clustering algorithms. Conclusions We presented a novel approach to functional enrichment that takes into account the pairwise relationships among genes annotated by a particular function. Each of the three applications discovers highly relevant functions. We used our methods to study biological data from three different organisms. Our results demonstrate the wide applicability of our methods. Our algorithms are

Reputation-Based Investment Helps to Optimize Group Behaviors in Spatial Lattice Networks.

Science.gov (United States)

Ding, Hong; Cao, Lin; Ren, Yizhi; Choo, Kim-Kwang Raymond; Shi, Benyun

2016-01-01

Encouraging cooperation among selfish individuals is crucial in many real-world systems, where individuals' collective behaviors can be analyzed using evolutionary public goods game. Along this line, extensive studies have shown that reputation is an effective mechanism to investigate the evolution of cooperation. In most existing studies, participating individuals in a public goods game are assumed to contribute unconditionally into the public pool, or they can choose partners based on a common reputation standard (e.g., preferences or characters). However, to assign one reputation standard for all individuals is impractical in many real-world deployment. In this paper, we introduce a reputation tolerance mechanism that allows an individual to select its potential partners and decide whether or not to contribute an investment to the public pool based on its tolerance to other individuals' reputation. Specifically, an individual takes part in a public goods game only if the number of participants with higher reputation exceeds the value of its tolerance. Moreover, in this paper, an individual's reputation can increase or decrease in a bounded interval based on its historical behaviors. We explore the principle that how the reputation tolerance and conditional investment mechanisms can affect the evolution of cooperation in spatial lattice networks. Our simulation results demonstrate that a larger tolerance value can achieve an environment that promote the cooperation of participants.

Strategies for Power Line Communications Smart Metering Network Deployment

Directory of Open Access Journals (Sweden)

Alberto Sendin

2014-04-01

Full Text Available Smart Grids are becoming a reality all over the world. Nowadays, the research efforts for the introduction and deployment of these grids are mainly focused on the development of the field of Smart Metering. This emerging application requires the use of technologies to access the significant number of points of supply (PoS existing in the grid, covering the Low Voltage (LV segment with the lowest possible costs. Power Line Communications (PLC have been extensively used in electricity grids for a variety of purposes and, of late, have been the focus of renewed interest. PLC are really well suited for quick and inexpensive pervasive deployments. However, no LV grid is the same in any electricity company (utility, and the particularities of each grid evolution, architecture, circumstances and materials, makes it a challenge to deploy Smart Metering networks with PLC technologies, with the Smart Grid as an ultimate goal. This paper covers the evolution of Smart Metering networks, together with the evolution of PLC technologies until both worlds have converged to project PLC-enabled Smart Metering networks towards Smart Grid. This paper develops guidelines over a set of strategic aspects of PLC Smart Metering network deployment based on the knowledge gathered on real field; and introduces the future challenges of these networks in their evolution towards the Smart Grid.

Improved Maximum Parsimony Models for Phylogenetic Networks.

Science.gov (United States)

Van Iersel, Leo; Jones, Mark; Scornavacca, Celine

2018-05-01

Phylogenetic networks are well suited to represent evolutionary histories comprising reticulate evolution. Several methods aiming at reconstructing explicit phylogenetic networks have been developed in the last two decades. In this article, we propose a new definition of maximum parsimony for phylogenetic networks that permits to model biological scenarios that cannot be modeled by the definitions currently present in the literature (namely, the "hardwired" and "softwired" parsimony). Building on this new definition, we provide several algorithmic results that lay the foundations for new parsimony-based methods for phylogenetic network reconstruction.

Remote radio heads and the evolution towards 4G networks

DEFF Research Database (Denmark)

Lanzani, Christian; Kardaras, Georgios; Boppana, Deepak

2009-01-01

Distributed base stations with remote radio head (RRH) capability greatly help mobile operators to resolve cost, performance, and efficiency challenges when deploying new base stations on the road to fully developed 4G networks. Multi-mode radios capable of operating according to GSM, HSPA, LTE...

A Performance Analysis for UMTS Packet Switched Network Based on Multivariate KPIS

OpenAIRE

Ouyang, Ye; Fallah, M. Hosein

2010-01-01

Mobile data services are penetrating mobile markets rapidly. The mobile industry relies heavily on data service to replace the traditional voice services with the evolution of the wireless technology and market. A reliable packet service network is critical to the mobile operators to maintain their core competence in data service market. Furthermore, mobile operators need to develop effective operational models to manage the varying mix of voice, data and video traffic on a single network. Ap...

Social power and opinion formation in complex networks

Science.gov (United States)

Jalili, Mahdi

2013-02-01

In this paper we investigate the effects of social power on the evolution of opinions in model networks as well as in a number of real social networks. A continuous opinion formation model is considered and the analysis is performed through numerical simulation. Social power is given to a proportion of agents selected either randomly or based on their degrees. As artificial network structures, we consider scale-free networks constructed through preferential attachment and Watts-Strogatz networks. Numerical simulations show that scale-free networks with degree-based social power on the hub nodes have an optimal case where the largest number of the nodes reaches a consensus. However, given power to a random selection of nodes could not improve consensus properties. Introducing social power in Watts-Strogatz networks could not significantly change the consensus profile.

The Banat seismic network: Evolution and performance

International Nuclear Information System (INIS)

Oros, E.

2002-01-01

In the Banat Seismic Region, with its important seismogenic zones (Banat and Danube), operates today the Banat Seismic Network. This network has four short period seismic stations telemetered at the Timisoara Seismological Observatory (since 1995): Siria, Banloc, Buzias and Timisoara. The stations are equipped with short-period S13 seismometers (1 second). The data recorded by the short-period stations are telemetered to Timisoara where they are digitized at 50 samples per second, with 16 bit resolution. At Timisoara works SAPS, an automated system for data acquisition and processing, which performs real-time event detection (based on Allen algorithm), discrimination between local and teleseismic events, automatic P and S waves picking, location and magnitude determination for local events and teleseisms, 'feeding' of an Automatic Data Request Manager with phases, locations and waveforms, sending of earthquake information (as phases and location), by e-mail to Bucharest. The beginning of the seismological observations in Banat is in the 1880's (Timisoara Meteorological Observatory). The first seismograph was installed in Timisoara in 1901, and its systematic observations began in 1902. The World War I interrupted its work. In 1942 Prof. I. Curea founded the Seismic Station Timisoara, and since 1967 until today this station worked into a special building. After 1972 two stations with high amplification were installed in Retezat Mts (Gura Zlata) and on Nera Valey (Susara), as a consequence of the research results. Since 1982 Buzias station began to work completing the Banat Seismic Network. Therefore, the network could detect and locate any local seismic event with M > 2.2. Moreover, up to 20 km distance from each station any seismic event could be detected over M = 0.5. The paper also presents the quality of the locations versus different local seismic sources. (author)