Complex Networks in Psychological Models

Science.gov (United States)

Wedemann, R. S.; Carvalho, L. S. A. V. D.; Donangelo, R.

We develop schematic, self-organizing, neural-network models to describe mechanisms associated with mental processes, by a neurocomputational substrate. These models are examples of real world complex networks with interesting general topological structures. Considering dopaminergic signal-to-noise neuronal modulation in the central nervous system, we propose neural network models to explain development of cortical map structure and dynamics of memory access, and unify different mental processes into a single neurocomputational substrate. Based on our neural network models, neurotic behavior may be understood as an associative memory process in the brain, and the linguistic, symbolic associative process involved in psychoanalytic working-through can be mapped onto a corresponding process of reconfiguration of the neural network. The models are illustrated through computer simulations, where we varied dopaminergic modulation and observed the self-organizing emergent patterns at the resulting semantic map, interpreting them as different manifestations of mental functioning, from psychotic through to normal and neurotic behavior, and creativity.

Brand Marketing Model on Social Networks

Directory of Open Access Journals (Sweden)

Jolita Jezukevičiūtė

2014-04-01

Full Text Available The paper analyzes the brand and its marketing solutions onsocial networks. This analysis led to the creation of improvedbrand marketing model on social networks, which will contributeto the rapid and cheap organization brand recognition, increasecompetitive advantage and enhance consumer loyalty. Therefore,the brand and a variety of social networks are becoming a hotresearch area for brand marketing model on social networks.The world‘s most successful brand marketing models exploratoryanalysis of a single case study revealed a brand marketingsocial networking tools that affect consumers the most. Basedon information analysis and methodological studies, develop abrand marketing model on social networks.

Neural network modeling of emotion

Science.gov (United States)

Levine, Daniel S.

2007-03-01

This article reviews the history and development of computational neural network modeling of cognitive and behavioral processes that involve emotion. The exposition starts with models of classical conditioning dating from the early 1970s. Then it proceeds toward models of interactions between emotion and attention. Then models of emotional influences on decision making are reviewed, including some speculative (not and not yet simulated) models of the evolution of decision rules. Through the late 1980s, the neural networks developed to model emotional processes were mainly embodiments of significant functional principles motivated by psychological data. In the last two decades, network models of these processes have become much more detailed in their incorporation of known physiological properties of specific brain regions, while preserving many of the psychological principles from the earlier models. Most network models of emotional processes so far have dealt with positive and negative emotion in general, rather than specific emotions such as fear, joy, sadness, and anger. But a later section of this article reviews a few models relevant to specific emotions: one family of models of auditory fear conditioning in rats, and one model of induced pleasure enhancing creativity in humans. Then models of emotional disorders are reviewed. The article concludes with philosophical statements about the essential contributions of emotion to intelligent behavior and the importance of quantitative theories and models to the interdisciplinary enterprise of understanding the interactions of emotion, cognition, and behavior.

Eight challenges for network epidemic models

Directory of Open Access Journals (Sweden)

Lorenzo Pellis

2015-03-01

Full Text Available Networks offer a fertile framework for studying the spread of infection in human and animal populations. However, owing to the inherent high-dimensionality of networks themselves, modelling transmission through networks is mathematically and computationally challenging. Even the simplest network epidemic models present unanswered questions. Attempts to improve the practical usefulness of network models by including realistic features of contact networks and of host–pathogen biology (e.g. waning immunity have made some progress, but robust analytical results remain scarce. A more general theory is needed to understand the impact of network structure on the dynamics and control of infection. Here we identify a set of challenges that provide scope for active research in the field of network epidemic models.

Gossip spread in social network Models

Science.gov (United States)

Johansson, Tobias

2017-04-01

Gossip almost inevitably arises in real social networks. In this article we investigate the relationship between the number of friends of a person and limits on how far gossip about that person can spread in the network. How far gossip travels in a network depends on two sets of factors: (a) factors determining gossip transmission from one person to the next and (b) factors determining network topology. For a simple model where gossip is spread among people who know the victim it is known that a standard scale-free network model produces a non-monotonic relationship between number of friends and expected relative spread of gossip, a pattern that is also observed in real networks (Lind et al., 2007). Here, we study gossip spread in two social network models (Toivonen et al., 2006; Vázquez, 2003) by exploring the parameter space of both models and fitting them to a real Facebook data set. Both models can produce the non-monotonic relationship of real networks more accurately than a standard scale-free model while also exhibiting more realistic variability in gossip spread. Of the two models, the one given in Vázquez (2003) best captures both the expected values and variability of gossip spread.

Network Bandwidth Utilization Forecast Model on High Bandwidth Network

Energy Technology Data Exchange (ETDEWEB)

Yoo, Wucherl; Sim, Alex

2014-07-07

With the increasing number of geographically distributed scientific collaborations and the scale of the data size growth, it has become more challenging for users to achieve the best possible network performance on a shared network. We have developed a forecast model to predict expected bandwidth utilization for high-bandwidth wide area network. The forecast model can improve the efficiency of resource utilization and scheduling data movements on high-bandwidth network to accommodate ever increasing data volume for large-scale scientific data applications. Univariate model is developed with STL and ARIMA on SNMP path utilization data. Compared with traditional approach such as Box-Jenkins methodology, our forecast model reduces computation time by 83.2percent. It also shows resilience against abrupt network usage change. The accuracy of the forecast model is within the standard deviation of the monitored measurements.

Network bandwidth utilization forecast model on high bandwidth networks

Energy Technology Data Exchange (ETDEWEB)

Yoo, Wuchert (William) [Lawrence Berkeley National Lab. (LBNL), Berkeley, CA (United States); Sim, Alex [Lawrence Berkeley National Lab. (LBNL), Berkeley, CA (United States)

2015-03-30

With the increasing number of geographically distributed scientific collaborations and the scale of the data size growth, it has become more challenging for users to achieve the best possible network performance on a shared network. We have developed a forecast model to predict expected bandwidth utilization for high-bandwidth wide area network. The forecast model can improve the efficiency of resource utilization and scheduling data movements on high-bandwidth network to accommodate ever increasing data volume for large-scale scientific data applications. Univariate model is developed with STL and ARIMA on SNMP path utilization data. Compared with traditional approach such as Box-Jenkins methodology, our forecast model reduces computation time by 83.2%. It also shows resilience against abrupt network usage change. The accuracy of the forecast model is within the standard deviation of the monitored measurements.

Target-Centric Network Modeling

DEFF Research Database (Denmark)

Mitchell, Dr. William L.; Clark, Dr. Robert M.

In Target-Centric Network Modeling: Case Studies in Analyzing Complex Intelligence Issues, authors Robert Clark and William Mitchell take an entirely new approach to teaching intelligence analysis. Unlike any other book on the market, it offers case study scenarios using actual intelligence...... reporting formats, along with a tested process that facilitates the production of a wide range of analytical products for civilian, military, and hybrid intelligence environments. Readers will learn how to perform the specific actions of problem definition modeling, target network modeling......, and collaborative sharing in the process of creating a high-quality, actionable intelligence product. The case studies reflect the complexity of twenty-first century intelligence issues by dealing with multi-layered target networks that cut across political, economic, social, technological, and military issues...

A model of coauthorship networks

Science.gov (United States)

Zhou, Guochang; Li, Jianping; Xie, Zonglin

2017-10-01

A natural way of representing the coauthorship of authors is to use a generalization of graphs known as hypergraphs. A random geometric hypergraph model is proposed here to model coauthorship networks, which is generated by placing nodes on a region of Euclidean space randomly and uniformly, and connecting some nodes if the nodes satisfy particular geometric conditions. Two kinds of geometric conditions are designed to model the collaboration patterns of academic authorities and basic researches respectively. The conditions give geometric expressions of two causes of coauthorship: the authority and similarity of authors. By simulation and calculus, we show that the forepart of the degree distribution of the network generated by the model is mixture Poissonian, and the tail is power-law, which are similar to these of some coauthorship networks. Further, we show more similarities between the generated network and real coauthorship networks: the distribution of cardinalities of hyperedges, high clustering coefficient, assortativity, and small-world property

Brand Marketing Model on Social Networks

OpenAIRE

Jolita Jezukevičiūtė; Vida Davidavičienė

2014-01-01

The paper analyzes the brand and its marketing solutions onsocial networks. This analysis led to the creation of improvedbrand marketing model on social networks, which will contributeto the rapid and cheap organization brand recognition, increasecompetitive advantage and enhance consumer loyalty. Therefore,the brand and a variety of social networks are becoming a hotresearch area for brand marketing model on social networks.The world‘s most successful brand marketing models exploratoryanalys...

Generalized Network Psychometrics : Combining Network and Latent Variable Models

NARCIS (Netherlands)

Epskamp, S.; Rhemtulla, M.; Borsboom, D.

2017-01-01

We introduce the network model as a formal psychometric model, conceptualizing the covariance between psychometric indicators as resulting from pairwise interactions between observable variables in a network structure. This contrasts with standard psychometric models, in which the covariance between

Brand marketing model on social networks

OpenAIRE

Jezukevičiūtė, Jolita; Davidavičienė, Vida

2014-01-01

Paper analyzes the brand and its marketing solutions on social networks. This analysis led to the creation of improved brand marketing model on social networks, which will contribute to the rapid and cheap organization brand recognition, increase competitive advantage and enhance consumer loyalty. Therefore, the brand and a variety of social networks are becoming a hot research area for brand marketing model on social networks. The world‘s most successful brand marketing models exploratory an...

Spatial Epidemic Modelling in Social Networks

Science.gov (United States)

Simoes, Joana Margarida

2005-06-01

The spread of infectious diseases is highly influenced by the structure of the underlying social network. The target of this study is not the network of acquaintances, but the social mobility network: the daily movement of people between locations, in regions. It was already shown that this kind of network exhibits small world characteristics. The model developed is agent based (ABM) and comprehends a movement model and a infection model. In the movement model, some assumptions are made about its structure and the daily movement is decomposed into four types: neighborhood, intra region, inter region and random. The model is Geographical Information Systems (GIS) based, and uses real data to define its geometry. Because it is a vector model, some optimization techniques were used to increase its efficiency.

Bayesian latent feature modeling for modeling bipartite networks with overlapping groups

DEFF Research Database (Denmark)

Jørgensen, Philip H.; Mørup, Morten; Schmidt, Mikkel Nørgaard

2016-01-01

Bi-partite networks are commonly modelled using latent class or latent feature models. Whereas the existing latent class models admit marginalization of parameters specifying the strength of interaction between groups, existing latent feature models do not admit analytical marginalization...... by the notion of community structure such that the edge density within groups is higher than between groups. Our model further assumes that entities can have different propensities of generating links in one of the modes. The proposed framework is contrasted on both synthetic and real bi-partite networks...... feature representations in bipartite networks provides a new framework for accounting for structure in bi-partite networks using binary latent feature representations providing interpretable representations that well characterize structure as quantified by link prediction....

Nonparametric Bayesian Modeling of Complex Networks

DEFF Research Database (Denmark)

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

2013-01-01

an infinite mixture model as running example, we go through the steps of deriving the model as an infinite limit of a finite parametric model, inferring the model parameters by Markov chain Monte Carlo, and checking the model?s fit and predictive performance. We explain how advanced nonparametric models......Modeling structure in complex networks using Bayesian nonparametrics makes it possible to specify flexible model structures and infer the adequate model complexity from the observed data. This article provides a gentle introduction to nonparametric Bayesian modeling of complex networks: Using...

Network model of security system

Directory of Open Access Journals (Sweden)

Adamczyk Piotr

2016-01-01

Full Text Available The article presents the concept of building a network security model and its application in the process of risk analysis. It indicates the possibility of a new definition of the role of the network models in the safety analysis. Special attention was paid to the development of the use of an algorithm describing the process of identifying the assets, vulnerability and threats in a given context. The aim of the article is to present how this algorithm reduced the complexity of the problem by eliminating from the base model these components that have no links with others component and as a result and it was possible to build a real network model corresponding to reality.

A Complex Network Approach to Distributional Semantic Models.

Directory of Open Access Journals (Sweden)

Akira Utsumi

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

Linear approximation model network and its formation via ...

Indian Academy of Sciences (India)

To overcome the deficiency of `local model network' (LMN) techniques, an alternative `linear approximation model' (LAM) network approach is proposed. Such a network models a nonlinear or practical system with multiple linear models fitted along operating trajectories, where individual models are simply networked ...

Complex networks under dynamic repair model

Science.gov (United States)

Chaoqi, Fu; Ying, Wang; Kun, Zhao; Yangjun, Gao

2018-01-01

Invulnerability is not the only factor of importance when considering complex networks' security. It is also critical to have an effective and reasonable repair strategy. Existing research on network repair is confined to the static model. The dynamic model makes better use of the redundant capacity of repaired nodes and repairs the damaged network more efficiently than the static model; however, the dynamic repair model is complex and polytropic. In this paper, we construct a dynamic repair model and systematically describe the energy-transfer relationships between nodes in the repair process of the failure network. Nodes are divided into three types, corresponding to three structures. We find that the strong coupling structure is responsible for secondary failure of the repaired nodes and propose an algorithm that can select the most suitable targets (nodes or links) to repair the failure network with minimal cost. Two types of repair strategies are identified, with different effects under the two energy-transfer rules. The research results enable a more flexible approach to network repair.

An evolving network model with community structure

International Nuclear Information System (INIS)

Li Chunguang; Maini, Philip K

2005-01-01

Many social and biological networks consist of communities-groups of nodes within which connections are dense, but between which connections are sparser. Recently, there has been considerable interest in designing algorithms for detecting community structures in real-world complex networks. In this paper, we propose an evolving network model which exhibits community structure. The network model is based on the inner-community preferential attachment and inter-community preferential attachment mechanisms. The degree distributions of this network model are analysed based on a mean-field method. Theoretical results and numerical simulations indicate that this network model has community structure and scale-free properties

Deterministic ripple-spreading model for complex networks.

Science.gov (United States)

Hu, Xiao-Bing; Wang, Ming; Leeson, Mark S; Hines, Evor L; Di Paolo, Ezequiel

2011-04-01

This paper proposes a deterministic complex network model, which is inspired by the natural ripple-spreading phenomenon. The motivations and main advantages of the model are the following: (i) The establishment of many real-world networks is a dynamic process, where it is often observed that the influence of a few local events spreads out through nodes, and then largely determines the final network topology. Obviously, this dynamic process involves many spatial and temporal factors. By simulating the natural ripple-spreading process, this paper reports a very natural way to set up a spatial and temporal model for such complex networks. (ii) Existing relevant network models are all stochastic models, i.e., with a given input, they cannot output a unique topology. Differently, the proposed ripple-spreading model can uniquely determine the final network topology, and at the same time, the stochastic feature of complex networks is captured by randomly initializing ripple-spreading related parameters. (iii) The proposed model can use an easily manageable number of ripple-spreading related parameters to precisely describe a network topology, which is more memory efficient when compared with traditional adjacency matrix or similar memory-expensive data structures. (iv) The ripple-spreading model has a very good potential for both extensions and applications.

Designing Network-based Business Model Ontology

DEFF Research Database (Denmark)

Hashemi Nekoo, Ali Reza; Ashourizadeh, Shayegheh; Zarei, Behrouz

2015-01-01

Survival on dynamic environment is not achieved without a map. Scanning and monitoring of the market show business models as a fruitful tool. But scholars believe that old-fashioned business models are dead; as they are not included the effect of internet and network in themselves. This paper...... is going to propose e-business model ontology from the network point of view and its application in real world. The suggested ontology for network-based businesses is composed of individuals` characteristics and what kind of resources they own. also, their connections and pre-conceptions of connections...... such as shared-mental model and trust. However, it mostly covers previous business model elements. To confirm the applicability of this ontology, it has been implemented in business angel network and showed how it works....

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.

Towards reproducible descriptions of neuronal network models.

Directory of Open Access Journals (Sweden)

Eilen Nordlie

2009-08-01

Full Text Available Progress in science depends on the effective exchange of ideas among scientists. New ideas can be assessed and criticized in a meaningful manner only if they are formulated precisely. This applies to simulation studies as well as to experiments and theories. But after more than 50 years of neuronal network simulations, we still lack a clear and common understanding of the role of computational models in neuroscience as well as established practices for describing network models in publications. This hinders the critical evaluation of network models as well as their re-use. We analyze here 14 research papers proposing neuronal network models of different complexity and find widely varying approaches to model descriptions, with regard to both the means of description and the ordering and placement of material. We further observe great variation in the graphical representation of networks and the notation used in equations. Based on our observations, we propose a good model description practice, composed of guidelines for the organization of publications, a checklist for model descriptions, templates for tables presenting model structure, and guidelines for diagrams of networks. The main purpose of this good practice is to trigger a debate about the communication of neuronal network models in a manner comprehensible to humans, as opposed to machine-readable model description languages. We believe that the good model description practice proposed here, together with a number of other recent initiatives on data-, model-, and software-sharing, may lead to a deeper and more fruitful exchange of ideas among computational neuroscientists in years to come. We further hope that work on standardized ways of describing--and thinking about--complex neuronal networks will lead the scientific community to a clearer understanding of high-level concepts in network dynamics, and will thus lead to deeper insights into the function of the brain.

Bayesian Network Webserver: a comprehensive tool for biological network modeling.

Science.gov (United States)

Ziebarth, Jesse D; Bhattacharya, Anindya; Cui, Yan

2013-11-01

The Bayesian Network Webserver (BNW) is a platform for comprehensive network modeling of systems genetics and other biological datasets. It allows users to quickly and seamlessly upload a dataset, learn the structure of the network model that best explains the data and use the model to understand relationships between network variables. Many datasets, including those used to create genetic network models, contain both discrete (e.g. genotype) and continuous (e.g. gene expression traits) variables, and BNW allows for modeling hybrid datasets. Users of BNW can incorporate prior knowledge during structure learning through an easy-to-use structural constraint interface. After structure learning, users are immediately presented with an interactive network model, which can be used to make testable hypotheses about network relationships. BNW, including a downloadable structure learning package, is available at http://compbio.uthsc.edu/BNW. (The BNW interface for adding structural constraints uses HTML5 features that are not supported by current version of Internet Explorer. We suggest using other browsers (e.g. Google Chrome or Mozilla Firefox) when accessing BNW). ycui2@uthsc.edu. Supplementary data are available at Bioinformatics online.

Modeling Network Interdiction Tasks

Science.gov (United States)

2015-09-17

118 xiii Table Page 36 Computation times for weighted, 100-node random networks for GAND Approach testing in Python ...in Python . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 120 38 Accuracy measures for weighted, 100-node random networks for GAND...networks [15:p. 1]. A common approach to modeling network interdiction is to formulate the problem in terms of a two-stage strategic game between two

Modeling Temporal Behavior in Large Networks: A Dynamic Mixed-Membership Model

Energy Technology Data Exchange (ETDEWEB)

Rossi, R; Gallagher, B; Neville, J; Henderson, K

2011-11-11

Given a large time-evolving network, how can we model and characterize the temporal behaviors of individual nodes (and network states)? How can we model the behavioral transition patterns of nodes? We propose a temporal behavior model that captures the 'roles' of nodes in the graph and how they evolve over time. The proposed dynamic behavioral mixed-membership model (DBMM) is scalable, fully automatic (no user-defined parameters), non-parametric/data-driven (no specific functional form or parameterization), interpretable (identifies explainable patterns), and flexible (applicable to dynamic and streaming networks). Moreover, the interpretable behavioral roles are generalizable, computationally efficient, and natively supports attributes. We applied our model for (a) identifying patterns and trends of nodes and network states based on the temporal behavior, (b) predicting future structural changes, and (c) detecting unusual temporal behavior transitions. We use eight large real-world datasets from different time-evolving settings (dynamic and streaming). In particular, we model the evolving mixed-memberships and the corresponding behavioral transitions of Twitter, Facebook, IP-Traces, Email (University), Internet AS, Enron, Reality, and IMDB. The experiments demonstrate the scalability, flexibility, and effectiveness of our model for identifying interesting patterns, detecting unusual structural transitions, and predicting the future structural changes of the network and individual nodes.

Multilevel method for modeling large-scale networks.

Energy Technology Data Exchange (ETDEWEB)

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

2012-02-24

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

Neural network modeling of associative memory: Beyond the Hopfield model

Science.gov (United States)

Dasgupta, Chandan

1992-07-01

A number of neural network models, in which fixed-point and limit-cycle attractors of the underlying dynamics are used to store and associatively recall information, are described. In the first class of models, a hierarchical structure is used to store an exponentially large number of strongly correlated memories. The second class of models uses limit cycles to store and retrieve individual memories. A neurobiologically plausible network that generates low-amplitude periodic variations of activity, similar to the oscillations observed in electroencephalographic recordings, is also described. Results obtained from analytic and numerical studies of the properties of these networks are discussed.

Modelling the structure of complex networks

DEFF Research Database (Denmark)

Herlau, Tue

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

Developing Personal Network Business Models

DEFF Research Database (Denmark)

Saugstrup, Dan; Henten, Anders

2006-01-01

The aim of the paper is to examine the issue of business modeling in relation to personal networks, PNs. The paper builds on research performed on business models in the EU 1ST MAGNET1 project (My personal Adaptive Global NET). The paper presents the Personal Network concept and briefly reports...

Non-consensus Opinion Models on Complex Networks

Science.gov (United States)

Li, Qian; Braunstein, Lidia A.; Wang, Huijuan; Shao, Jia; Stanley, H. Eugene; Havlin, Shlomo

2013-04-01

Social dynamic opinion models have been widely studied to understand how interactions among individuals cause opinions to evolve. Most opinion models that utilize spin interaction models usually produce a consensus steady state in which only one opinion exists. Because in reality different opinions usually coexist, we focus on non-consensus opinion models in which above a certain threshold two opinions coexist in a stable relationship. We revisit and extend the non-consensus opinion (NCO) model introduced by Shao et al. (Phys. Rev. Lett. 103:01870, 2009). The NCO model in random networks displays a second order phase transition that belongs to regular mean field percolation and is characterized by the appearance (above a certain threshold) of a large spanning cluster of the minority opinion. We generalize the NCO model by adding a weight factor W to each individual's original opinion when determining their future opinion (NCO W model). We find that as W increases the minority opinion holders tend to form stable clusters with a smaller initial minority fraction than in the NCO model. We also revisit another non-consensus opinion model based on the NCO model, the inflexible contrarian opinion (ICO) model (Li et al. in Phys. Rev. E 84:066101, 2011), which introduces inflexible contrarians to model the competition between two opinions in a steady state. Inflexible contrarians are individuals that never change their original opinion but may influence the opinions of others. To place the inflexible contrarians in the ICO model we use two different strategies, random placement and one in which high-degree nodes are targeted. The inflexible contrarians effectively decrease the size of the largest rival-opinion cluster in both strategies, but the effect is more pronounced under the targeted method. All of the above models have previously been explored in terms of a single network, but human communities are usually interconnected, not isolated. Because opinions propagate not

Adaptive-network models of collective dynamics

Science.gov (United States)

Zschaler, G.

2012-09-01

Complex systems can often be modelled as networks, in which their basic units are represented by abstract nodes and the interactions among them by abstract links. This network of interactions is the key to understanding emergent collective phenomena in such systems. In most cases, it is an adaptive network, which is defined by a feedback loop between the local dynamics of the individual units and the dynamical changes of the network structure itself. This feedback loop gives rise to many novel phenomena. Adaptive networks are a promising concept for the investigation of collective phenomena in different systems. However, they also present a challenge to existing modelling approaches and analytical descriptions due to the tight coupling between local and topological degrees of freedom. In this work, which is essentially my PhD thesis, I present a simple rule-based framework for the investigation of adaptive networks, using which a wide range of collective phenomena can be modelled and analysed from a common perspective. In this framework, a microscopic model is defined by the local interaction rules of small network motifs, which can be implemented in stochastic simulations straightforwardly. Moreover, an approximate emergent-level description in terms of macroscopic variables can be derived from the microscopic rules, which we use to analyse the system's collective and long-term behaviour by applying tools from dynamical systems theory. We discuss three adaptive-network models for different collective phenomena within our common framework. First, we propose a novel approach to collective motion in insect swarms, in which we consider the insects' adaptive interaction network instead of explicitly tracking their positions and velocities. We capture the experimentally observed onset of collective motion qualitatively in terms of a bifurcation in this non-spatial model. We find that three-body interactions are an essential ingredient for collective motion to emerge

Modeling Network Traffic in Wavelet Domain

Directory of Open Access Journals (Sweden)

Sheng Ma

2004-12-01

Full Text Available This work discovers that although network traffic has the complicated short- and long-range temporal dependence, the corresponding wavelet coefficients are no longer long-range dependent. Therefore, a "short-range" dependent process can be used to model network traffic in the wavelet domain. Both independent and Markov models are investigated. Theoretical analysis shows that the independent wavelet model is sufficiently accurate in terms of the buffer overflow probability for Fractional Gaussian Noise traffic. Any model, which captures additional correlations in the wavelet domain, only improves the performance marginally. The independent wavelet model is then used as a unified approach to model network traffic including VBR MPEG video and Ethernet data. The computational complexity is O(N for developing such wavelet models and generating synthesized traffic of length N, which is among the lowest attained.

Network models in economics and finance

CERN Document Server

Pardalos, Panos; Rassias, Themistocles

2014-01-01

Using network models to investigate the interconnectivity in modern economic systems allows researchers to better understand and explain some economic phenomena. This volume presents contributions by known experts and active researchers in economic and financial network modeling. Readers are provided with an understanding of the latest advances in network analysis as applied to economics, finance, corporate governance, and investments. Moreover, recent advances in market network analysis  that focus on influential techniques for market graph analysis are also examined. Young researchers will find this volume particularly useful in facilitating their introduction to this new and fascinating field. Professionals in economics, financial management, various technologies, and network analysis, will find the network models presented in this book beneficial in analyzing the interconnectivity in modern economic systems.

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

Tool wear modeling using abductive networks

Science.gov (United States)

Masory, Oren

1992-09-01

A tool wear model based on Abductive Networks, which consists of a network of `polynomial' nodes, is described. The model relates the cutting parameters, components of the cutting force, and machining time to flank wear. Thus real time measurements of the cutting force can be used to monitor the machining process. The model is obtained by a training process in which the connectivity between the network's nodes and the polynomial coefficients of each node are determined by optimizing a performance criteria. Actual wear measurements of coated and uncoated carbide inserts were used for training and evaluating the established model.

Multiplicative Attribute Graph Model of Real-World Networks

Energy Technology Data Exchange (ETDEWEB)

Kim, Myunghwan [Stanford Univ., CA (United States); Leskovec, Jure [Stanford Univ., CA (United States)

2010-10-20

Large scale real-world network data, such as social networks, Internet andWeb graphs, is ubiquitous in a variety of scientific domains. The study of such social and information networks commonly finds patterns and explain their emergence through tractable models. In most networks, especially in social networks, nodes also have a rich set of attributes (e.g., age, gender) associatedwith them. However, most of the existing network models focus only on modeling the network structure while ignoring the features of nodes in the network. Here we present a class of network models that we refer to as the Multiplicative Attribute Graphs (MAG), which naturally captures the interactions between the network structure and node attributes. We consider a model where each node has a vector of categorical features associated with it. The probability of an edge between a pair of nodes then depends on the product of individual attributeattribute similarities. The model yields itself to mathematical analysis as well as fit to real data. We derive thresholds for the connectivity, the emergence of the giant connected component, and show that the model gives rise to graphs with a constant diameter. Moreover, we analyze the degree distribution to show that the model can produce networks with either lognormal or power-law degree distribution depending on certain conditions.

Feature network models for proximity data : statistical inference, model selection, network representations and links with related models

NARCIS (Netherlands)

Frank, Laurence Emmanuelle

2006-01-01

Feature Network Models (FNM) are graphical structures that represent proximity data in a discrete space with the use of features. A statistical inference theory is introduced, based on the additivity properties of networks and the linear regression framework. Considering features as predictor

Agent based modeling of energy networks

International Nuclear Information System (INIS)

Gonzalez de Durana, José María; Barambones, Oscar; Kremers, Enrique; Varga, Liz

2014-01-01

Highlights: • A new approach for energy network modeling is designed and tested. • The agent-based approach is general and no technology dependent. • The models can be easily extended. • The range of applications encompasses from small to large energy infrastructures. - Abstract: Attempts to model any present or future power grid face a huge challenge because a power grid is a complex system, with feedback and multi-agent behaviors, integrated by generation, distribution, storage and consumption systems, using various control and automation computing systems to manage electricity flows. Our approach to modeling is to build upon an established model of the low voltage electricity network which is tested and proven, by extending it to a generalized energy model. But, in order to address the crucial issues of energy efficiency, additional processes like energy conversion and storage, and further energy carriers, such as gas, heat, etc., besides the traditional electrical one, must be considered. Therefore a more powerful model, provided with enhanced nodes or conversion points, able to deal with multidimensional flows, is being required. This article addresses the issue of modeling a local multi-carrier energy network. This problem can be considered as an extension of modeling a low voltage distribution network located at some urban or rural geographic area. But instead of using an external power flow analysis package to do the power flow calculations, as used in electric networks, in this work we integrate a multiagent algorithm to perform the task, in a concurrent way to the other simulation tasks, and not only for the electric fluid but also for a number of additional energy carriers. As the model is mainly focused in system operation, generation and load models are not developed

Mobility Models for Next Generation Wireless Networks Ad Hoc, Vehicular and Mesh Networks

CERN Document Server

Santi, Paolo

2012-01-01

Mobility Models for Next Generation Wireless Networks: Ad Hoc, Vehicular and Mesh Networks provides the reader with an overview of mobility modelling, encompassing both theoretical and practical aspects related to the challenging mobility modelling task. It also: Provides up-to-date coverage of mobility models for next generation wireless networksOffers an in-depth discussion of the most representative mobility models for major next generation wireless network application scenarios, including WLAN/mesh networks, vehicular networks, wireless sensor networks, and

Biological transportation networks: Modeling and simulation

KAUST Repository

Albi, Giacomo; Artina, Marco; Foransier, Massimo; Markowich, Peter A.

2015-01-01

We present a model for biological network formation originally introduced by Cai and Hu [Adaptation and optimization of biological transport networks, Phys. Rev. Lett. 111 (2013) 138701]. The modeling of fluid transportation (e.g., leaf venation

Implementing network constraints in the EMPS model

Energy Technology Data Exchange (ETDEWEB)

Helseth, Arild; Warland, Geir; Mo, Birger; Fosso, Olav B.

2010-02-15

This report concerns the coupling of detailed market and network models for long-term hydro-thermal scheduling. Currently, the EPF model (Samlast) is the only tool available for this task for actors in the Nordic market. A new prototype for solving the coupled market and network problem has been developed. The prototype is based on the EMPS model (Samkjoeringsmodellen). Results from the market model are distributed to a detailed network model, where a DC load flow detects if there are overloads on monitored lines or intersections. In case of overloads, network constraints are generated and added to the market problem. Theoretical and implementation details for the new prototype are elaborated in this report. The performance of the prototype is tested against the EPF model on a 20-area Nordic dataset. (Author)

Modeling acquaintance networks based on balance theory

Directory of Open Access Journals (Sweden)

Vukašinović Vida

2014-09-01

Full Text Available An acquaintance network is a social structure made up of a set of actors and the ties between them. These ties change dynamically as a consequence of incessant interactions between the actors. In this paper we introduce a social network model called the Interaction-Based (IB model that involves well-known sociological principles. The connections between the actors and the strength of the connections are influenced by the continuous positive and negative interactions between the actors and, vice versa, the future interactions are more likely to happen between the actors that are connected with stronger ties. The model is also inspired by the social behavior of animal species, particularly that of ants in their colony. A model evaluation showed that the IB model turned out to be sparse. The model has a small diameter and an average path length that grows in proportion to the logarithm of the number of vertices. The clustering coefficient is relatively high, and its value stabilizes in larger networks. The degree distributions are slightly right-skewed. In the mature phase of the IB model, i.e., when the number of edges does not change significantly, most of the network properties do not change significantly either. The IB model was found to be the best of all the compared models in simulating the e-mail URV (University Rovira i Virgili of Tarragona network because the properties of the IB model more closely matched those of the e-mail URV network than the other models

Entropy Characterization of Random Network Models

Directory of Open Access Journals (Sweden)

Pedro J. Zufiria

2017-06-01

Full Text Available This paper elaborates on the Random Network Model (RNM as a mathematical framework for modelling and analyzing the generation of complex networks. Such framework allows the analysis of the relationship between several network characterizing features (link density, clustering coefficient, degree distribution, connectivity, etc. and entropy-based complexity measures, providing new insight on the generation and characterization of random networks. Some theoretical and computational results illustrate the utility of the proposed framework.

The model of social crypto-network

Directory of Open Access Journals (Sweden)

Марк Миколайович Орел

2015-06-01

Full Text Available The article presents the theoretical model of social network with the enhanced mechanism of privacy policy. It covers the problems arising in the process of implementing the mentioned type of network. There are presented the methods of solving problems arising in the process of building the social network with privacy policy. It was built a theoretical model of social networks with enhanced information protection methods based on information and communication blocks

Research on the model of home networking

Science.gov (United States)

Yun, Xiang; Feng, Xiancheng

2007-11-01

It is the research hotspot of current broadband network to combine voice service, data service and broadband audio-video service by IP protocol to transport various real time and mutual services to terminal users (home). Home Networking is a new kind of network and application technology which can provide various services. Home networking is called as Digital Home Network. It means that PC, home entertainment equipment, home appliances, Home wirings, security, illumination system were communicated with each other by some composing network technology, constitute a networking internal home, and connect with WAN by home gateway. It is a new network technology and application technology, and can provide many kinds of services inside home or between homes. Currently, home networking can be divided into three kinds: Information equipment, Home appliances, Communication equipment. Equipment inside home networking can exchange information with outer networking by home gateway, this information communication is bidirectional, user can get information and service which provided by public networking by using home networking internal equipment through home gateway connecting public network, meantime, also can get information and resource to control the internal equipment which provided by home networking internal equipment. Based on the general network model of home networking, there are four functional entities inside home networking: HA, HB, HC, and HD. (1) HA (Home Access) - home networking connects function entity; (2) HB (Home Bridge) Home networking bridge connects function entity; (3) HC (Home Client) - Home networking client function entity; (4) HD (Home Device) - decoder function entity. There are many physical ways to implement four function entities. Based on theses four functional entities, there are reference model of physical layer, reference model of link layer, reference model of IP layer and application reference model of high layer. In the future home network

Modelling and designing electric energy networks

International Nuclear Information System (INIS)

Retiere, N.

2003-11-01

The author gives an overview of his research works in the field of electric network modelling. After a brief overview of technological evolutions from the telegraph to the all-electric fly-by-wire aircraft, he reports and describes various works dealing with a simplified modelling of electric systems and with fractal simulation. Then, he outlines the challenges for the design of electric networks, proposes a design process, gives an overview of various design models, methods and tools, and reports an application in the design of electric networks for future jumbo jets

Synergistic effects in threshold models on networks

Science.gov (United States)

Juul, Jonas S.; Porter, Mason A.

2018-01-01

Network structure can have a significant impact on the propagation of diseases, memes, and information on social networks. Different types of spreading processes (and other dynamical processes) are affected by network architecture in different ways, and it is important to develop tractable models of spreading processes on networks to explore such issues. In this paper, we incorporate the idea of synergy into a two-state ("active" or "passive") threshold model of social influence on networks. Our model's update rule is deterministic, and the influence of each meme-carrying (i.e., active) neighbor can—depending on a parameter—either be enhanced or inhibited by an amount that depends on the number of active neighbors of a node. Such a synergistic system models social behavior in which the willingness to adopt either accelerates or saturates in a way that depends on the number of neighbors who have adopted that behavior. We illustrate that our model's synergy parameter has a crucial effect on system dynamics, as it determines whether degree-k nodes are possible or impossible to activate. We simulate synergistic meme spreading on both random-graph models and networks constructed from empirical data. Using a heterogeneous mean-field approximation, which we derive under the assumption that a network is locally tree-like, we are able to determine which synergy-parameter values allow degree-k nodes to be activated for many networks and for a broad family of synergistic models.

Modeling of fluctuating reaction networks

International Nuclear Information System (INIS)

Lipshtat, A.; Biham, O.

2004-01-01

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

Mathematical Modelling Plant Signalling Networks

KAUST Repository

Muraro, D.

2013-01-01

During the last two decades, molecular genetic studies and the completion of the sequencing of the Arabidopsis thaliana genome have increased knowledge of hormonal regulation in plants. These signal transduction pathways act in concert through gene regulatory and signalling networks whose main components have begun to be elucidated. Our understanding of the resulting cellular processes is hindered by the complex, and sometimes counter-intuitive, dynamics of the networks, which may be interconnected through feedback controls and cross-regulation. Mathematical modelling provides a valuable tool to investigate such dynamics and to perform in silico experiments that may not be easily carried out in a laboratory. In this article, we firstly review general methods for modelling gene and signalling networks and their application in plants. We then describe specific models of hormonal perception and cross-talk in plants. This mathematical analysis of sub-cellular molecular mechanisms paves the way for more comprehensive modelling studies of hormonal transport and signalling in a multi-scale setting. © EDP Sciences, 2013.

How to model wireless mesh networks topology

International Nuclear Information System (INIS)

Sanni, M L; Hashim, A A; Anwar, F; Ali, S; Ahmed, G S M

2013-01-01

The specification of network connectivity model or topology is the beginning of design and analysis in Computer Network researches. Wireless Mesh Networks is an autonomic network that is dynamically self-organised, self-configured while the mesh nodes establish automatic connectivity with the adjacent nodes in the relay network of wireless backbone routers. Researches in Wireless Mesh Networks range from node deployment to internetworking issues with sensor, Internet and cellular networks. These researches require modelling of relationships and interactions among nodes including technical characteristics of the links while satisfying the architectural requirements of the physical network. However, the existing topology generators model geographic topologies which constitute different architectures, thus may not be suitable in Wireless Mesh Networks scenarios. The existing methods of topology generation are explored, analysed and parameters for their characterisation are identified. Furthermore, an algorithm for the design of Wireless Mesh Networks topology based on square grid model is proposed in this paper. The performance of the topology generated is also evaluated. This research is particularly important in the generation of a close-to-real topology for ensuring relevance of design to the intended network and validity of results obtained in Wireless Mesh Networks researches

Modelling traffic congestion using queuing networks

Indian Academy of Sciences (India)

Flow-density curves; uninterrupted traffic; Jackson networks. ... ness - also suffer from a big handicap vis-a-vis the Indian scenario: most of these models do .... more well-known queuing network models and onsite data, a more exact Road Cell ...

Modeling geomagnetic induced currents in Australian power networks

Science.gov (United States)

Marshall, R. A.; Kelly, A.; Van Der Walt, T.; Honecker, A.; Ong, C.; Mikkelsen, D.; Spierings, A.; Ivanovich, G.; Yoshikawa, A.

2017-07-01

Geomagnetic induced currents (GICs) have been considered an issue for high-latitude power networks for some decades. More recently, GICs have been observed and studied in power networks located in lower latitude regions. This paper presents the results of a model aimed at predicting and understanding the impact of geomagnetic storms on power networks in Australia, with particular focus on the Queensland and Tasmanian networks. The model incorporates a "geoelectric field" determined using a plane wave magnetic field incident on a uniform conducting Earth, and the network model developed by Lehtinen and Pirjola (1985). Model results for two intense geomagnetic storms of solar cycle 24 are compared with transformer neutral monitors at three locations within the Queensland network and one location within the Tasmanian network. The model is then used to assess the impacts of the superintense geomagnetic storm of 29-31 October 2003 on the flow of GICs within these networks. The model results show good correlation with the observations with coefficients ranging from 0.73 to 0.96 across the observing sites. For Queensland, modeled GIC magnitudes during the superstorm of 29-31 October 2003 exceed 40 A with the larger GICs occurring in the south-east section of the network. Modeled GICs in Tasmania for the same storm do not exceed 30 A. The larger distance spans and general east-west alignment of the southern section of the Queensland network, in conjunction with some relatively low branch resistance values, result in larger modeled GICs despite Queensland being a lower latitude network than Tasmania.

Network interconnections: an architectural reference model

NARCIS (Netherlands)

Butscher, B.; Lenzini, L.; Morling, R.; Vissers, C.A.; Popescu-Zeletin, R.; van Sinderen, Marten J.; Heger, D.; Krueger, G.; Spaniol, O.; Zorn, W.

1985-01-01

One of the major problems in understanding the different approaches in interconnecting networks of different technologies is the lack of reference to a general model. The paper develops the rationales for a reference model of network interconnection and focuses on the architectural implications for

Modeling Epidemics Spreading on Social Contact Networks.

Science.gov (United States)

Zhang, Zhaoyang; Wang, Honggang; Wang, Chonggang; Fang, Hua

2015-09-01

Social contact networks and the way people interact with each other are the key factors that impact on epidemics spreading. However, it is challenging to model the behavior of epidemics based on social contact networks due to their high dynamics. Traditional models such as susceptible-infected-recovered (SIR) model ignore the crowding or protection effect and thus has some unrealistic assumption. In this paper, we consider the crowding or protection effect and develop a novel model called improved SIR model. Then, we use both deterministic and stochastic models to characterize the dynamics of epidemics on social contact networks. The results from both simulations and real data set conclude that the epidemics are more likely to outbreak on social contact networks with higher average degree. We also present some potential immunization strategies, such as random set immunization, dominating set immunization, and high degree set immunization to further prove the conclusion.

Cyber threat model for tactical radio networks

Science.gov (United States)

Kurdziel, Michael T.

2014-05-01

The shift to a full information-centric paradigm in the battlefield has allowed ConOps to be developed that are only possible using modern network communications systems. Securing these Tactical Networks without impacting their capabilities has been a challenge. Tactical networks with fixed infrastructure have similar vulnerabilities to their commercial counterparts (although they need to be secure against adversaries with greater capabilities, resources and motivation). However, networks with mobile infrastructure components and Mobile Ad hoc Networks (MANets) have additional unique vulnerabilities that must be considered. It is useful to examine Tactical Network based ConOps and use them to construct a threat model and baseline cyber security requirements for Tactical Networks with fixed infrastructure, mobile infrastructure and/or ad hoc modes of operation. This paper will present an introduction to threat model assessment. A definition and detailed discussion of a Tactical Network threat model is also presented. Finally, the model is used to derive baseline requirements that can be used to design or evaluate a cyber security solution that can be scaled and adapted to the needs of specific deployments.

Stochastic actor-oriented models for network change

NARCIS (Netherlands)

Snijders, T.A.B.

1996-01-01

A class of models is proposed for longitudinal network data. These models are along the lines of methodological individualism: actors use heuristics to try to achieve their individual goals, subject to constraints. The current network structure is among these constraints. The models are continuous

A novel Direct Small World network model

Directory of Open Access Journals (Sweden)

LIN Tao

2016-10-01

Full Text Available There is a certain degree of redundancy and low efficiency of existing computer networks.This paper presents a novel Direct Small World network model in order to optimize networks.In this model,several nodes construct a regular network.Then,randomly choose and replot some nodes to generate Direct Small World network iteratively.There is no change in average distance and clustering coefficient.However,the network performance,such as hops,is improved.The experiments prove that compared to traditional small world network,the degree,average of degree centrality and average of closeness centrality are lower in Direct Small World network.This illustrates that the nodes in Direct Small World networks are closer than Watts-Strogatz small world network model.The Direct Small World can be used not only in the communication of the community information,but also in the research of epidemics.

Optimal transportation networks models and theory

CERN Document Server

Bernot, Marc; Morel, Jean-Michel

2009-01-01

The transportation problem can be formalized as the problem of finding the optimal way to transport a given measure into another with the same mass. In contrast to the Monge-Kantorovitch problem, recent approaches model the branched structure of such supply networks as minima of an energy functional whose essential feature is to favour wide roads. Such a branched structure is observable in ground transportation networks, in draining and irrigation systems, in electrical power supply systems and in natural counterparts such as blood vessels or the branches of trees. These lectures provide mathematical proof of several existence, structure and regularity properties empirically observed in transportation networks. The link with previous discrete physical models of irrigation and erosion models in geomorphology and with discrete telecommunication and transportation models is discussed. It will be mathematically proven that the majority fit in the simple model sketched in this volume.

A random spatial network model based on elementary postulates

Science.gov (United States)

Karlinger, Michael R.; Troutman, Brent M.

1989-01-01

A model for generating random spatial networks that is based on elementary postulates comparable to those of the random topology model is proposed. In contrast to the random topology model, this model ascribes a unique spatial specification to generated drainage networks, a distinguishing property of some network growth models. The simplicity of the postulates creates an opportunity for potential analytic investigations of the probabilistic structure of the drainage networks, while the spatial specification enables analyses of spatially dependent network properties. In the random topology model all drainage networks, conditioned on magnitude (number of first-order streams), are equally likely, whereas in this model all spanning trees of a grid, conditioned on area and drainage density, are equally likely. As a result, link lengths in the generated networks are not independent, as usually assumed in the random topology model. For a preliminary model evaluation, scale-dependent network characteristics, such as geometric diameter and link length properties, and topologic characteristics, such as bifurcation ratio, are computed for sets of drainage networks generated on square and rectangular grids. Statistics of the bifurcation and length ratios fall within the range of values reported for natural drainage networks, but geometric diameters tend to be relatively longer than those for natural networks.

Network structure exploration via Bayesian nonparametric models

International Nuclear Information System (INIS)

Chen, Y; Wang, X L; Xiang, X; Tang, B Z; Bu, J Z

2015-01-01

Complex networks provide a powerful mathematical representation of complex systems in nature and society. To understand complex networks, it is crucial to explore their internal structures, also called structural regularities. The task of network structure exploration is to determine how many groups there are in a complex network and how to group the nodes of the network. Most existing structure exploration methods need to specify either a group number or a certain type of structure when they are applied to a network. In the real world, however, the group number and also the certain type of structure that a network has are usually unknown in advance. To explore structural regularities in complex networks automatically, without any prior knowledge of the group number or the certain type of structure, we extend a probabilistic mixture model that can handle networks with any type of structure but needs to specify a group number using Bayesian nonparametric theory. We also propose a novel Bayesian nonparametric model, called the Bayesian nonparametric mixture (BNPM) model. Experiments conducted on a large number of networks with different structures show that the BNPM model is able to explore structural regularities in networks automatically with a stable, state-of-the-art performance. (paper)

QSAR modelling using combined simple competitive learning networks and RBF neural networks.

Science.gov (United States)

Sheikhpour, R; Sarram, M A; Rezaeian, M; Sheikhpour, E

2018-04-01

The aim of this study was to propose a QSAR modelling approach based on the combination of simple competitive learning (SCL) networks with radial basis function (RBF) neural networks for predicting the biological activity of chemical compounds. The proposed QSAR method consisted of two phases. In the first phase, an SCL network was applied to determine the centres of an RBF neural network. In the second phase, the RBF neural network was used to predict the biological activity of various phenols and Rho kinase (ROCK) inhibitors. The predictive ability of the proposed QSAR models was evaluated and compared with other QSAR models using external validation. The results of this study showed that the proposed QSAR modelling approach leads to better performances than other models in predicting the biological activity of chemical compounds. This indicated the efficiency of simple competitive learning networks in determining the centres of RBF neural networks.

Discrete dynamic modeling of cellular signaling networks.

Science.gov (United States)

Albert, Réka; Wang, Rui-Sheng

2009-01-01

Understanding signal transduction in cellular systems is a central issue in systems biology. Numerous experiments from different laboratories generate an abundance of individual components and causal interactions mediating environmental and developmental signals. However, for many signal transduction systems there is insufficient information on the overall structure and the molecular mechanisms involved in the signaling network. Moreover, lack of kinetic and temporal information makes it difficult to construct quantitative models of signal transduction pathways. Discrete dynamic modeling, combined with network analysis, provides an effective way to integrate fragmentary knowledge of regulatory interactions into a predictive mathematical model which is able to describe the time evolution of the system without the requirement for kinetic parameters. This chapter introduces the fundamental concepts of discrete dynamic modeling, particularly focusing on Boolean dynamic models. We describe this method step-by-step in the context of cellular signaling networks. Several variants of Boolean dynamic models including threshold Boolean networks and piecewise linear systems are also covered, followed by two examples of successful application of discrete dynamic modeling in cell biology.

Hybrid neural network bushing model for vehicle dynamics simulation

International Nuclear Information System (INIS)

Sohn, Jeong Hyun; Lee, Seung Kyu; Yoo, Wan Suk

2008-01-01

Although the linear model was widely used for the bushing model in vehicle suspension systems, it could not express the nonlinear characteristics of bushing in terms of the amplitude and the frequency. An artificial neural network model was suggested to consider the hysteretic responses of bushings. This model, however, often diverges due to the uncertainties of the neural network under the unexpected excitation inputs. In this paper, a hybrid neural network bushing model combining linear and neural network is suggested. A linear model was employed to represent linear stiffness and damping effects, and the artificial neural network algorithm was adopted to take into account the hysteretic responses. A rubber test was performed to capture bushing characteristics, where sine excitation with different frequencies and amplitudes is applied. Random test results were used to update the weighting factors of the neural network model. It is proven that the proposed model has more robust characteristics than a simple neural network model under step excitation input. A full car simulation was carried out to verify the proposed bushing models. It was shown that the hybrid model results are almost identical to the linear model under several maneuvers

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

Directory of Open Access Journals (Sweden)

Joseph A. Wayman

2015-03-01

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

Port Hamiltonian modeling of Power Networks

NARCIS (Netherlands)

van Schaik, F.; van der Schaft, Abraham; Scherpen, Jacquelien M.A.; Zonetti, Daniele; Ortega, R

2012-01-01

In this talk a full nonlinear model for the power network in port–Hamiltonian framework is derived to study its stability properties. For this we use the modularity approach i.e., we first derive the models of individual components in power network as port-Hamiltonian systems and then we combine all

A quantum-implementable neural network model

Science.gov (United States)

Chen, Jialin; Wang, Lingli; Charbon, Edoardo

2017-10-01

A quantum-implementable neural network, namely quantum probability neural network (QPNN) model, is proposed in this paper. QPNN can use quantum parallelism to trace all possible network states to improve the result. Due to its unique quantum nature, this model is robust to several quantum noises under certain conditions, which can be efficiently implemented by the qubus quantum computer. Another advantage is that QPNN can be used as memory to retrieve the most relevant data and even to generate new data. The MATLAB experimental results of Iris data classification and MNIST handwriting recognition show that much less neuron resources are required in QPNN to obtain a good result than the classical feedforward neural network. The proposed QPNN model indicates that quantum effects are useful for real-life classification tasks.

Functional model of biological neural networks.

Science.gov (United States)

Lo, James Ting-Ho

2010-12-01

A functional model of biological neural networks, called temporal hierarchical probabilistic associative memory (THPAM), is proposed in this paper. THPAM comprises functional models of dendritic trees for encoding inputs to neurons, a first type of neuron for generating spike trains, a second type of neuron for generating graded signals to modulate neurons of the first type, supervised and unsupervised Hebbian learning mechanisms for easy learning and retrieving, an arrangement of dendritic trees for maximizing generalization, hardwiring for rotation-translation-scaling invariance, and feedback connections with different delay durations for neurons to make full use of present and past informations generated by neurons in the same and higher layers. These functional models and their processing operations have many functions of biological neural networks that have not been achieved by other models in the open literature and provide logically coherent answers to many long-standing neuroscientific questions. However, biological justifications of these functional models and their processing operations are required for THPAM to qualify as a macroscopic model (or low-order approximate) of biological neural networks.

Constitutive modelling of composite biopolymer networks.

Science.gov (United States)

Fallqvist, B; Kroon, M

2016-04-21

The mechanical behaviour of biopolymer networks is to a large extent determined at a microstructural level where the characteristics of individual filaments and the interactions between them determine the response at a macroscopic level. Phenomena such as viscoelasticity and strain-hardening followed by strain-softening are observed experimentally in these networks, often due to microstructural changes (such as filament sliding, rupture and cross-link debonding). Further, composite structures can also be formed with vastly different mechanical properties as compared to the individual networks. In this present paper, we present a constitutive model presented in a continuum framework aimed at capturing these effects. Special care is taken to formulate thermodynamically consistent evolution laws for dissipative effects. This model, incorporating possible anisotropic network properties, is based on a strain energy function, split into an isochoric and a volumetric part. Generalisation to three dimensions is performed by numerical integration over the unit sphere. Model predictions indicate that the constitutive model is well able to predict the elastic and viscoelastic response of biological networks, and to an extent also composite structures. Copyright © 2016 Elsevier Ltd. All rights reserved.

Graphical Model Theory for Wireless Sensor Networks

International Nuclear Information System (INIS)

Davis, William B.

2002-01-01

Information processing in sensor networks, with many small processors, demands a theory of computation that allows the minimization of processing effort, and the distribution of this effort throughout the network. Graphical model theory provides a probabilistic theory of computation that explicitly addresses complexity and decentralization for optimizing network computation. The junction tree algorithm, for decentralized inference on graphical probability models, can be instantiated in a variety of applications useful for wireless sensor networks, including: sensor validation and fusion; data compression and channel coding; expert systems, with decentralized data structures, and efficient local queries; pattern classification, and machine learning. Graphical models for these applications are sketched, and a model of dynamic sensor validation and fusion is presented in more depth, to illustrate the junction tree algorithm

Infinite Multiple Membership Relational Modeling for Complex Networks

DEFF Research Database (Denmark)

Mørup, Morten; Schmidt, Mikkel Nørgaard; Hansen, Lars Kai

Learning latent structure in complex networks has become an important problem fueled by many types of networked data originating from practically all fields of science. In this paper, we propose a new non-parametric Bayesian multiplemembership latent feature model for networks. Contrary to existing...... multiplemembership models that scale quadratically in the number of vertices the proposedmodel scales linearly in the number of links admittingmultiple-membership analysis in large scale networks. We demonstrate a connection between the single membership relational model and multiple membership models and show...

Homophyly/Kinship Model: Naturally Evolving Networks

Science.gov (United States)

Li, Angsheng; Li, Jiankou; Pan, Yicheng; Yin, Xianchen; Yong, Xi

2015-10-01

It has been a challenge to understand the formation and roles of social groups or natural communities in the evolution of species, societies and real world networks. Here, we propose the hypothesis that homophyly/kinship is the intrinsic mechanism of natural communities, introduce the notion of the affinity exponent and propose the homophyly/kinship model of networks. We demonstrate that the networks of our model satisfy a number of topological, probabilistic and combinatorial properties and, in particular, that the robustness and stability of natural communities increase as the affinity exponent increases and that the reciprocity of the networks in our model decreases as the affinity exponent increases. We show that both homophyly/kinship and reciprocity are essential to the emergence of cooperation in evolutionary games and that the homophyly/kinship and reciprocity determined by the appropriate affinity exponent guarantee the emergence of cooperation in evolutionary games, verifying Darwin’s proposal that kinship and reciprocity are the means of individual fitness. We propose the new principle of structure entropy minimisation for detecting natural communities of networks and verify the functional module property and characteristic properties by a healthy tissue cell network, a citation network, some metabolic networks and a protein interaction network.

Model of community emergence in weighted social networks

Science.gov (United States)

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

2009-04-01

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

Mathematical model for spreading dynamics of social network worms

International Nuclear Information System (INIS)

Sun, Xin; Liu, Yan-Heng; Han, Jia-Wei; Liu, Xue-Jie; Li, Bin; Li, Jin

2012-01-01

In this paper, a mathematical model for social network worm spreading is presented from the viewpoint of social engineering. This model consists of two submodels. Firstly, a human behavior model based on game theory is suggested for modeling and predicting the expected behaviors of a network user encountering malicious messages. The game situation models the actions of a user under the condition that the system may be infected at the time of opening a malicious message. Secondly, a social network accessing model is proposed to characterize the dynamics of network users, by which the number of online susceptible users can be determined at each time step. Several simulation experiments are carried out on artificial social networks. The results show that (1) the proposed mathematical model can well describe the spreading dynamics of social network worms; (2) weighted network topology greatly affects the spread of worms; (3) worms spread even faster on hybrid social networks

A comprehensive multi-local-world model for complex networks

International Nuclear Information System (INIS)

Fan Zhengping; Chen Guanrong; Zhang Yunong

2009-01-01

The nodes in a community within a network are much more connected to each other than to the others outside the community in the same network. This phenomenon has been commonly observed from many real-world networks, ranging from social to biological even to technical networks. Meanwhile, the number of communities in some real-world networks, such as the Internet and most social networks, are evolving with time. To model this kind of networks, the present Letter proposes a multi-local-world (MLW) model to capture and describe their essential topological properties. Based on the mean-field theory, the degree distribution of this model is obtained analytically, showing that the generated network has a novel topological feature as being not completely random nor completely scale-free but behaving somewhere between them. As a typical application, the MLW model is applied to characterize the Internet against some other models such as the BA, GBA, Fitness and HOT models, demonstrating the superiority of the new model.

A Search Model with a Quasi-Network

DEFF Research Database (Denmark)

Ejarque, Joao Miguel

This paper adds a quasi-network to a search model of the labor market. Fitting the model to an average unemployment rate and to other moments in the data implies the presence of the network is not noticeable in the basic properties of the unemployment and job finding rates. However, the network...

Thermal conductivity model for nanofiber networks

Science.gov (United States)

Zhao, Xinpeng; Huang, Congliang; Liu, Qingkun; Smalyukh, Ivan I.; Yang, Ronggui

2018-02-01

Understanding thermal transport in nanofiber networks is essential for their applications in thermal management, which are used extensively as mechanically sturdy thermal insulation or high thermal conductivity materials. In this study, using the statistical theory and Fourier's law of heat conduction while accounting for both the inter-fiber contact thermal resistance and the intrinsic thermal resistance of nanofibers, an analytical model is developed to predict the thermal conductivity of nanofiber networks as a function of their geometric and thermal properties. A scaling relation between the thermal conductivity and the geometric properties including volume fraction and nanofiber length of the network is revealed. This model agrees well with both numerical simulations and experimental measurements found in the literature. This model may prove useful in analyzing the experimental results and designing nanofiber networks for both high and low thermal conductivity applications.

Thermal conductivity model for nanofiber networks

Energy Technology Data Exchange (ETDEWEB)

Zhao, Xinpeng [Department of Mechanical Engineering, University of Colorado, Boulder, Colorado 80309, USA; Huang, Congliang [Department of Mechanical Engineering, University of Colorado, Boulder, Colorado 80309, USA; School of Electrical and Power Engineering, China University of Mining and Technology, Xuzhou 221116, China; Liu, Qingkun [Department of Physics, University of Colorado, Boulder, Colorado 80309, USA; Smalyukh, Ivan I. [Department of Physics, University of Colorado, Boulder, Colorado 80309, USA; Materials Science and Engineering Program, University of Colorado, Boulder, Colorado 80309, USA; Yang, Ronggui [Department of Mechanical Engineering, University of Colorado, Boulder, Colorado 80309, USA; Materials Science and Engineering Program, University of Colorado, Boulder, Colorado 80309, USA; Buildings and Thermal Systems Center, National Renewable Energy Laboratory, Golden, Colorado 80401, USA

2018-02-28

Understanding thermal transport in nanofiber networks is essential for their applications in thermal management, which are used extensively as mechanically sturdy thermal insulation or high thermal conductivity materials. In this study, using the statistical theory and Fourier's law of heat conduction while accounting for both the inter-fiber contact thermal resistance and the intrinsic thermal resistance of nanofibers, an analytical model is developed to predict the thermal conductivity of nanofiber networks as a function of their geometric and thermal properties. A scaling relation between the thermal conductivity and the geometric properties including volume fraction and nanofiber length of the network is revealed. This model agrees well with both numerical simulations and experimental measurements found in the literature. This model may prove useful in analyzing the experimental results and designing nanofiber networks for both high and low thermal conductivity applications.

Mathematical Modelling Plant Signalling Networks

KAUST Repository

Muraro, D.; Byrne, H.M.; King, J.R.; Bennett, M.J.

2013-01-01

methods for modelling gene and signalling networks and their application in plants. We then describe specific models of hormonal perception and cross-talk in plants. This mathematical analysis of sub-cellular molecular mechanisms paves the way for more

Two stage neural network modelling for robust model predictive control.

Science.gov (United States)

Patan, Krzysztof

2018-01-01

The paper proposes a novel robust model predictive control scheme realized by means of artificial neural networks. The neural networks are used twofold: to design the so-called fundamental model of a plant and to catch uncertainty associated with the plant model. In order to simplify the optimization process carried out within the framework of predictive control an instantaneous linearization is applied which renders it possible to define the optimization problem in the form of constrained quadratic programming. Stability of the proposed control system is also investigated by showing that a cost function is monotonically decreasing with respect to time. Derived robust model predictive control is tested and validated on the example of a pneumatic servomechanism working at different operating regimes. Copyright © 2017 ISA. Published by Elsevier Ltd. All rights reserved.

Road network safety evaluation using Bayesian hierarchical joint model.

Science.gov (United States)

Wang, Jie; Huang, Helai

2016-05-01

Safety and efficiency are commonly regarded as two significant performance indicators of transportation systems. In practice, road network planning has focused on road capacity and transport efficiency whereas the safety level of a road network has received little attention in the planning stage. This study develops a Bayesian hierarchical joint model for road network safety evaluation to help planners take traffic safety into account when planning a road network. The proposed model establishes relationships between road network risk and micro-level variables related to road entities and traffic volume, as well as socioeconomic, trip generation and network density variables at macro level which are generally used for long term transportation plans. In addition, network spatial correlation between intersections and their connected road segments is also considered in the model. A road network is elaborately selected in order to compare the proposed hierarchical joint model with a previous joint model and a negative binomial model. According to the results of the model comparison, the hierarchical joint model outperforms the joint model and negative binomial model in terms of the goodness-of-fit and predictive performance, which indicates the reasonableness of considering the hierarchical data structure in crash prediction and analysis. Moreover, both random effects at the TAZ level and the spatial correlation between intersections and their adjacent segments are found to be significant, supporting the employment of the hierarchical joint model as an alternative in road-network-level safety modeling as well. Copyright © 2016 Elsevier Ltd. All rights reserved.

EpiModel: An R Package for Mathematical Modeling of Infectious Disease over Networks.

Science.gov (United States)

Jenness, Samuel M; Goodreau, Steven M; Morris, Martina

2018-04-01

Package EpiModel provides tools for building, simulating, and analyzing mathematical models for the population dynamics of infectious disease transmission in R. Several classes of models are included, but the unique contribution of this software package is a general stochastic framework for modeling the spread of epidemics on networks. EpiModel integrates recent advances in statistical methods for network analysis (temporal exponential random graph models) that allow the epidemic modeling to be grounded in empirical data on contacts that can spread infection. This article provides an overview of both the modeling tools built into EpiModel , designed to facilitate learning for students new to modeling, and the application programming interface for extending package EpiModel , designed to facilitate the exploration of novel research questions for advanced modelers.

Dynamic thermo-hydraulic model of district cooling networks

International Nuclear Information System (INIS)

Oppelt, Thomas; Urbaneck, Thorsten; Gross, Ulrich; Platzer, Bernd

2016-01-01

Highlights: • A dynamic thermo-hydraulic model for district cooling networks is presented. • The thermal modelling is based on water segment tracking (Lagrangian approach). • Thus, numerical errors and balance inaccuracies are avoided. • Verification and validation studies proved the reliability of the model. - Abstract: In the present paper, the dynamic thermo-hydraulic model ISENA is presented which can be applied for answering different questions occurring in design and operation of district cooling networks—e.g. related to economic and energy efficiency. The network model consists of a quasistatic hydraulic model and a transient thermal model based on tracking water segments through the whole network (Lagrangian method). Applying this approach, numerical errors and balance inaccuracies can be avoided which leads to a higher quality of results compared to other network models. Verification and validation calculations are presented in order to show that ISENA provides reliable results and is suitable for practical application.

UAV Trajectory Modeling Using Neural Networks

Science.gov (United States)

Xue, Min

2017-01-01

Massive small unmanned aerial vehicles are envisioned to operate in the near future. While there are lots of research problems need to be addressed before dense operations can happen, trajectory modeling remains as one of the keys to understand and develop policies, regulations, and requirements for safe and efficient unmanned aerial vehicle operations. The fidelity requirement of a small unmanned vehicle trajectory model is high because these vehicles are sensitive to winds due to their small size and low operational altitude. Both vehicle control systems and dynamic models are needed for trajectory modeling, which makes the modeling a great challenge, especially considering the fact that manufactures are not willing to share their control systems. This work proposed to use a neural network approach for modelling small unmanned vehicle's trajectory without knowing its control system and bypassing exhaustive efforts for aerodynamic parameter identification. As a proof of concept, instead of collecting data from flight tests, this work used the trajectory data generated by a mathematical vehicle model for training and testing the neural network. The results showed great promise because the trained neural network can predict 4D trajectories accurately, and prediction errors were less than 2:0 meters in both temporal and spatial dimensions.

Neural network tagging in a toy model

International Nuclear Information System (INIS)

Milek, Marko; Patel, Popat

1999-01-01

The purpose of this study is a comparison of Artificial Neural Network approach to HEP analysis against the traditional methods. A toy model used in this analysis consists of two types of particles defined by four generic properties. A number of 'events' was created according to the model using standard Monte Carlo techniques. Several fully connected, feed forward multi layered Artificial Neural Networks were trained to tag the model events. The performance of each network was compared to the standard analysis mechanisms and significant improvement was observed

Continuum Modeling of Biological Network Formation

KAUST Repository

Albi, Giacomo

2017-04-10

We present an overview of recent analytical and numerical results for the elliptic–parabolic system of partial differential equations proposed by Hu and Cai, which models the formation of biological transportation networks. The model describes the pressure field using a Darcy type equation and the dynamics of the conductance network under pressure force effects. Randomness in the material structure is represented by a linear diffusion term and conductance relaxation by an algebraic decay term. We first introduce micro- and mesoscopic models and show how they are connected to the macroscopic PDE system. Then, we provide an overview of analytical results for the PDE model, focusing mainly on the existence of weak and mild solutions and analysis of the steady states. The analytical part is complemented by extensive numerical simulations. We propose a discretization based on finite elements and study the qualitative properties of network structures for various parameter values.

A general evolving model for growing bipartite networks

International Nuclear Information System (INIS)

Tian, Lixin; He, Yinghuan; Liu, Haijun; Du, Ruijin

2012-01-01

In this Letter, we propose and study an inner evolving bipartite network model. Significantly, we prove that the degree distribution of two different kinds of nodes both obey power-law form with adjustable exponents. Furthermore, the joint degree distribution of any two nodes for bipartite networks model is calculated analytically by the mean-field method. The result displays that such bipartite networks are nearly uncorrelated networks, which is different from one-mode networks. Numerical simulations and empirical results are given to verify the theoretical results. -- Highlights: ► We proposed a general evolving bipartite network model which was based on priority connection, reconnection and breaking edges. ► We prove that the degree distribution of two different kinds of nodes both obey power-law form with adjustable exponents. ► The joint degree distribution of any two nodes for bipartite networks model is calculated analytically by the mean-field method. ► The result displays that such bipartite networks are nearly uncorrelated networks, which is different from one-mode networks.

Evaluation of EOR Processes Using Network Models

DEFF Research Database (Denmark)

Winter, Anatol; Larsen, Jens Kjell; Krogsbøll, Anette

1998-01-01

The report consists of the following parts: 1) Studies of wetting properties of model fluids and fluid mixtures aimed at an optimal selection of candidates for micromodel experiments. 2) Experimental studies of multiphase transport properties using physical models of porous networks (micromodels......) including estimation of their "petrophysical" properties (e.g. absolute permeability). 3) Mathematical modelling and computer studies of multiphase transport through pore space using mathematical network models. 4) Investigation of link between pore-scale and macroscopic recovery mechanisms....

The Jackson Queueing Network Model Built Using Poisson Measures. Application To A Bank Model

Directory of Open Access Journals (Sweden)

Ciuiu Daniel

2014-07-01

Full Text Available In this paper we will build a bank model using Poisson measures and Jackson queueing networks. We take into account the relationship between the Poisson and the exponential distributions, and we consider for each credit/deposit type a node where shocks are modeled as the compound Poisson processes. The transmissions of the shocks are modeled as moving between nodes in Jackson queueing networks, the external shocks are modeled as external arrivals, and the absorption of shocks as departures from the network.

Lukasiewicz-Topos Models of Neural Networks, Cell Genome and Interactome Nonlinear Dynamic Models

CERN Document Server

Baianu, I C

2004-01-01

A categorical and Lukasiewicz-Topos framework for Lukasiewicz Algebraic Logic models of nonlinear dynamics in complex functional systems such as neural networks, genomes and cell interactomes is proposed. Lukasiewicz Algebraic Logic models of genetic networks and signaling pathways in cells are formulated in terms of nonlinear dynamic systems with n-state components that allow for the generalization of previous logical models of both genetic activities and neural networks. An algebraic formulation of variable 'next-state functions' is extended to a Lukasiewicz Topos with an n-valued Lukasiewicz Algebraic Logic subobject classifier description that represents non-random and nonlinear network activities as well as their transformations in developmental processes and carcinogenesis.

Steady state analysis of Boolean molecular network models via model reduction and computational algebra.

Science.gov (United States)

Veliz-Cuba, Alan; Aguilar, Boris; Hinkelmann, Franziska; Laubenbacher, Reinhard

2014-06-26

A key problem in the analysis of mathematical models of molecular networks is the determination of their steady states. The present paper addresses this problem for Boolean network models, an increasingly popular modeling paradigm for networks lacking detailed kinetic information. For small models, the problem can be solved by exhaustive enumeration of all state transitions. But for larger models this is not feasible, since the size of the phase space grows exponentially with the dimension of the network. The dimension of published models is growing to over 100, so that efficient methods for steady state determination are essential. Several methods have been proposed for large networks, some of them heuristic. While these methods represent a substantial improvement in scalability over exhaustive enumeration, the problem for large networks is still unsolved in general. This paper presents an algorithm that consists of two main parts. The first is a graph theoretic reduction of the wiring diagram of the network, while preserving all information about steady states. The second part formulates the determination of all steady states of a Boolean network as a problem of finding all solutions to a system of polynomial equations over the finite number system with two elements. This problem can be solved with existing computer algebra software. This algorithm compares favorably with several existing algorithms for steady state determination. One advantage is that it is not heuristic or reliant on sampling, but rather determines algorithmically and exactly all steady states of a Boolean network. The code for the algorithm, as well as the test suite of benchmark networks, is available upon request from the corresponding author. The algorithm presented in this paper reliably determines all steady states of sparse Boolean networks with up to 1000 nodes. The algorithm is effective at analyzing virtually all published models even those of moderate connectivity. The problem for

Model checking mobile ad hoc networks

NARCIS (Netherlands)

Ghassemi, Fatemeh; Fokkink, Wan

2016-01-01

Modeling arbitrary connectivity changes within mobile ad hoc networks (MANETs) makes application of automated formal verification challenging. We use constrained labeled transition systems as a semantic model to represent mobility. To model check MANET protocols with respect to the underlying

Systems and methods for modeling and analyzing networks

Science.gov (United States)

Hill, Colin C; Church, Bruce W; McDonagh, Paul D; Khalil, Iya G; Neyarapally, Thomas A; Pitluk, Zachary W

2013-10-29

The systems and methods described herein utilize a probabilistic modeling framework for reverse engineering an ensemble of causal models, from data and then forward simulating the ensemble of models to analyze and predict the behavior of the network. In certain embodiments, the systems and methods described herein include data-driven techniques for developing causal models for biological networks. Causal network models include computational representations of the causal relationships between independent variables such as a compound of interest and dependent variables such as measured DNA alterations, changes in mRNA, protein, and metabolites to phenotypic readouts of efficacy and toxicity.

Ripple-Spreading Network Model Optimization by Genetic Algorithm

Directory of Open Access Journals (Sweden)

Xiao-Bing Hu

2013-01-01

Full Text Available Small-world and scale-free properties are widely acknowledged in many real-world complex network systems, and many network models have been developed to capture these network properties. The ripple-spreading network model (RSNM is a newly reported complex network model, which is inspired by the natural ripple-spreading phenomenon on clam water surface. The RSNM exhibits good potential for describing both spatial and temporal features in the development of many real-world networks where the influence of a few local events spreads out through nodes and then largely determines the final network topology. However, the relationships between ripple-spreading related parameters (RSRPs of RSNM and small-world and scale-free topologies are not as obvious or straightforward as in many other network models. This paper attempts to apply genetic algorithm (GA to tune the values of RSRPs, so that the RSNM may generate these two most important network topologies. The study demonstrates that, once RSRPs are properly tuned by GA, the RSNM is capable of generating both network topologies and therefore has a great flexibility to study many real-world complex network systems.

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.

Modeling the reemergence of information diffusion in social network

Science.gov (United States)

Yang, Dingda; Liao, Xiangwen; Shen, Huawei; Cheng, Xueqi; Chen, Guolong

2018-01-01

Information diffusion in networks is an important research topic in various fields. Existing studies either focus on modeling the process of information diffusion, e.g., independent cascade model and linear threshold model, or investigate information diffusion in networks with certain structural characteristics such as scale-free networks and small world networks. However, there are still several phenomena that have not been captured by existing information diffusion models. One of the prominent phenomena is the reemergence of information diffusion, i.e., a piece of information reemerges after the completion of its initial diffusion process. In this paper, we propose an optimized information diffusion model by introducing a new informed state into traditional susceptible-infected-removed model. We verify the proposed model via simulations in real-world social networks, and the results indicate that the model can reproduce the reemergence of information during the diffusion process.

A Network Contention Model for the Extreme-scale Simulator

Energy Technology Data Exchange (ETDEWEB)

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

2015-01-01

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

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.

Modeling, Optimization & Control of Hydraulic Networks

DEFF Research Database (Denmark)

Tahavori, Maryamsadat

2014-01-01

. The nonlinear network model is derived based on the circuit theory. A suitable projection is used to reduce the state vector and to express the model in standard state-space form. Then, the controllability of nonlinear nonaffine hydraulic networks is studied. The Lie algebra-based controllability matrix is used......Water supply systems consist of a number of pumping stations, which deliver water to the customers via pipeline networks and elevated reservoirs. A huge amount of drinking water is lost before it reaches to end-users due to the leakage in pipe networks. A cost effective solution to reduce leakage...... in water network is pressure management. By reducing the pressure in the water network, the leakage can be reduced significantly. Also it reduces the amount of energy consumption in water networks. The primary purpose of this work is to develop control algorithms for pressure control in water supply...

Hybrid simulation models of production networks

CERN Document Server

Kouikoglou, Vassilis S

2001-01-01

This book is concerned with a most important area of industrial production, that of analysis and optimization of production lines and networks using discrete-event models and simulation. The book introduces a novel approach that combines analytic models and discrete-event simulation. Unlike conventional piece-by-piece simulation, this method observes a reduced number of events between which the evolution of the system is tracked analytically. Using this hybrid approach, several models are developed for the analysis of production lines and networks. The hybrid approach combines speed and accuracy for exceptional analysis of most practical situations. A number of optimization problems, involving buffer design, workforce planning, and production control, are solved through the use of hybrid models.

An evolving model of online bipartite networks

Science.gov (United States)

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

2013-12-01

Understanding the structure and evolution of online bipartite networks is a significant task since they play a crucial role in various e-commerce services nowadays. Recently, various attempts have been tried to propose different models, resulting in either power-law or exponential degree distributions. However, many empirical results show that the user degree distribution actually follows a shifted power-law distribution, the so-called Mandelbrot’s law, which cannot be fully described by previous models. In this paper, we propose an evolving model, considering two different user behaviors: random and preferential attachment. Extensive empirical results on two real bipartite networks, Delicious and CiteULike, show that the theoretical model can well characterize the structure of real networks for both user and object degree distributions. In addition, we introduce a structural parameter p, to demonstrate that the hybrid user behavior leads to the shifted power-law degree distribution, and the region of power-law tail will increase with the increment of p. The proposed model might shed some lights in understanding the underlying laws governing the structure of real online bipartite networks.

Flood routing modelling with Artificial Neural Networks

Directory of Open Access Journals (Sweden)

R. Peters

2006-01-01

Full Text Available For the modelling of the flood routing in the lower reaches of the Freiberger Mulde river and its tributaries the one-dimensional hydrodynamic modelling system HEC-RAS has been applied. Furthermore, this model was used to generate a database to train multilayer feedforward networks. To guarantee numerical stability for the hydrodynamic modelling of some 60 km of streamcourse an adequate resolution in space requires very small calculation time steps, which are some two orders of magnitude smaller than the input data resolution. This leads to quite high computation requirements seriously restricting the application – especially when dealing with real time operations such as online flood forecasting. In order to solve this problem we tested the application of Artificial Neural Networks (ANN. First studies show the ability of adequately trained multilayer feedforward networks (MLFN to reproduce the model performance.

Spatial-temporal modeling of malware propagation in networks.

Science.gov (United States)

Chen, Zesheng; Ji, Chuanyi

2005-09-01

Network security is an important task of network management. One threat to network security is malware (malicious software) propagation. One type of malware is called topological scanning that spreads based on topology information. The focus of this work is on modeling the spread of topological malwares, which is important for understanding their potential damages, and for developing countermeasures to protect the network infrastructure. Our model is motivated by probabilistic graphs, which have been widely investigated in machine learning. We first use a graphical representation to abstract the propagation of malwares that employ different scanning methods. We then use a spatial-temporal random process to describe the statistical dependence of malware propagation in arbitrary topologies. As the spatial dependence is particularly difficult to characterize, the problem becomes how to use simple (i.e., biased) models to approximate the spatially dependent process. In particular, we propose the independent model and the Markov model as simple approximations. We conduct both theoretical analysis and extensive simulations on large networks using both real measurements and synthesized topologies to test the performance of the proposed models. Our results show that the independent model can capture temporal dependence and detailed topology information and, thus, outperforms the previous models, whereas the Markov model incorporates a certain spatial dependence and, thus, achieves a greater accuracy in characterizing both transient and equilibrium behaviors of malware propagation.

System-level Modeling of Wireless Integrated Sensor Networks

DEFF Research Database (Denmark)

Virk, Kashif M.; Hansen, Knud; Madsen, Jan

2005-01-01

Wireless integrated sensor networks have emerged as a promising infrastructure for a new generation of monitoring and tracking applications. In order to efficiently utilize the extremely limited resources of wireless sensor nodes, accurate modeling of the key aspects of wireless sensor networks...... is necessary so that system-level design decisions can be made about the hardware and the software (applications and real-time operating system) architecture of sensor nodes. In this paper, we present a SystemC-based abstract modeling framework that enables system-level modeling of sensor network behavior...... by modeling the applications, real-time operating system, sensors, processor, and radio transceiver at the sensor node level and environmental phenomena, including radio signal propagation, at the sensor network level. We demonstrate the potential of our modeling framework by simulating and analyzing a small...

Settings in Social Networks : a Measurement Model

NARCIS (Netherlands)

Schweinberger, Michael; Snijders, Tom A.B.

2003-01-01

A class of statistical models is proposed that aims to recover latent settings structures in social networks. Settings may be regarded as clusters of vertices. The measurement model is based on two assumptions. (1) The observed network is generated by hierarchically nested latent transitive

SPLAI: Computational Finite Element Model for Sensor Networks

Directory of Open Access Journals (Sweden)

Ruzana Ishak

2006-01-01

Full Text Available Wireless sensor network refers to a group of sensors, linked by a wireless medium to perform distributed sensing task. The primary interest is their capability in monitoring the physical environment through the deployment of numerous tiny, intelligent, wireless networked sensor nodes. Our interest consists of a sensor network, which includes a few specialized nodes called processing elements that can perform some limited computational capabilities. In this paper, we propose a model called SPLAI that allows the network to compute a finite element problem where the processing elements are modeled as the nodes in the linear triangular approximation problem. Our model also considers the case of some failures of the sensors. A simulation model to visualize this network has been developed using C++ on the Windows environment.

An endogenous model of the credit network

Science.gov (United States)

He, Jianmin; Sui, Xin; Li, Shouwei

2016-01-01

In this paper, an endogenous credit network model of firm-bank agents is constructed. The model describes the endogenous formation of firm-firm, firm-bank and bank-bank credit relationships. By means of simulations, the model is capable of showing some obvious similarities with empirical evidence found by other scholars: the upper-tail of firm size distribution can be well fitted with a power-law; the bank size distribution can be lognormally distributed with a power-law tail; the bank in-degrees of the interbank credit network as well as the firm-bank credit network fall into two-power-law distributions.

Network Modeling and Simulation A Practical Perspective

CERN Document Server

Guizani, Mohsen; Khan, Bilal

2010-01-01

Network Modeling and Simulation is a practical guide to using modeling and simulation to solve real-life problems. The authors give a comprehensive exposition of the core concepts in modeling and simulation, and then systematically address the many practical considerations faced by developers in modeling complex large-scale systems. The authors provide examples from computer and telecommunication networks and use these to illustrate the process of mapping generic simulation concepts to domain-specific problems in different industries and disciplines. Key features: Provides the tools and strate

Performance modeling, stochastic networks, and statistical multiplexing

CERN Document Server

Mazumdar, Ravi R

2013-01-01

This monograph presents a concise mathematical approach for modeling and analyzing the performance of communication networks with the aim of introducing an appropriate mathematical framework for modeling and analysis as well as understanding the phenomenon of statistical multiplexing. The models, techniques, and results presented form the core of traffic engineering methods used to design, control and allocate resources in communication networks.The novelty of the monograph is the fresh approach and insights provided by a sample-path methodology for queueing models that highlights the importan

Phenomenological network models: Lessons for epilepsy surgery.

Science.gov (United States)

Hebbink, Jurgen; Meijer, Hil; Huiskamp, Geertjan; van Gils, Stephan; Leijten, Frans

2017-10-01

The current opinion in epilepsy surgery is that successful surgery is about removing pathological cortex in the anatomic sense. This contrasts with recent developments in epilepsy research, where epilepsy is seen as a network disease. Computational models offer a framework to investigate the influence of networks, as well as local tissue properties, and to explore alternative resection strategies. Here we study, using such a model, the influence of connections on seizures and how this might change our traditional views of epilepsy surgery. We use a simple network model consisting of four interconnected neuronal populations. One of these populations can be made hyperexcitable, modeling a pathological region of cortex. Using model simulations, the effect of surgery on the seizure rate is studied. We find that removal of the hyperexcitable population is, in most cases, not the best approach to reduce the seizure rate. Removal of normal populations located at a crucial spot in the network, the "driver," is typically more effective in reducing seizure rate. This work strengthens the idea that network structure and connections may be more important than localizing the pathological node. This can explain why lesionectomy may not always be sufficient. © 2017 The Authors. Epilepsia published by Wiley Periodicals, Inc. on behalf of International League Against Epilepsy.

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

Network Design Models for Container Shipping

DEFF Research Database (Denmark)

Reinhardt, Line Blander; Kallehauge, Brian; Nielsen, Anders Nørrelund

This paper presents a study of the network design problem in container shipping. The paper combines the network design and fleet assignment problem into a mixed integer linear programming model minimizing the overall cost. The major contributions of this paper is that the time of a vessel route...... is included in the calculation of the capacity and that a inhomogeneous fleet is modeled. The model also includes the cost of transshipment which is one of the major cost for the shipping companies. The concept of pseudo simple routes is introduced to expand the set of feasible routes. The linearization...

UAV Trajectory Modeling Using Neural Networks

Science.gov (United States)

Xue, Min

2017-01-01

Large amount of small Unmanned Aerial Vehicles (sUAVs) are projected to operate in the near future. Potential sUAV applications include, but not limited to, search and rescue, inspection and surveillance, aerial photography and video, precision agriculture, and parcel delivery. sUAVs are expected to operate in the uncontrolled Class G airspace, which is at or below 500 feet above ground level (AGL), where many static and dynamic constraints exist, such as ground properties and terrains, restricted areas, various winds, manned helicopters, and conflict avoidance among sUAVs. How to enable safe, efficient, and massive sUAV operations at the low altitude airspace remains a great challenge. NASA's Unmanned aircraft system Traffic Management (UTM) research initiative works on establishing infrastructure and developing policies, requirement, and rules to enable safe and efficient sUAVs' operations. To achieve this goal, it is important to gain insights of future UTM traffic operations through simulations, where the accurate trajectory model plays an extremely important role. On the other hand, like what happens in current aviation development, trajectory modeling should also serve as the foundation for any advanced concepts and tools in UTM. Accurate models of sUAV dynamics and control systems are very important considering the requirement of the meter level precision in UTM operations. The vehicle dynamics are relatively easy to derive and model, however, vehicle control systems remain unknown as they are usually kept by manufactures as a part of intellectual properties. That brings challenges to trajectory modeling for sUAVs. How to model the vehicle's trajectories with unknown control system? This work proposes to use a neural network to model a vehicle's trajectory. The neural network is first trained to learn the vehicle's responses at numerous conditions. Once being fully trained, given current vehicle states, winds, and desired future trajectory, the neural

Exploring Neural Network Models with Hierarchical Memories and Their Use in Modeling Biological Systems

Science.gov (United States)

Pusuluri, Sai Teja

Energy landscapes are often used as metaphors for phenomena in biology, social sciences and finance. Different methods have been implemented in the past for the construction of energy landscapes. Neural network models based on spin glass physics provide an excellent mathematical framework for the construction of energy landscapes. This framework uses a minimal number of parameters and constructs the landscape using data from the actual phenomena. In the past neural network models were used to mimic the storage and retrieval process of memories (patterns) in the brain. With advances in the field now, these models are being used in machine learning, deep learning and modeling of complex phenomena. Most of the past literature focuses on increasing the storage capacity and stability of stored patterns in the network but does not study these models from a modeling perspective or an energy landscape perspective. This dissertation focuses on neural network models both from a modeling perspective and from an energy landscape perspective. I firstly show how the cellular interconversion phenomenon can be modeled as a transition between attractor states on an epigenetic landscape constructed using neural network models. The model allows the identification of a reaction coordinate of cellular interconversion by analyzing experimental and simulation time course data. Monte Carlo simulations of the model show that the initial phase of cellular interconversion is a Poisson process and the later phase of cellular interconversion is a deterministic process. Secondly, I explore the static features of landscapes generated using neural network models, such as sizes of basins of attraction and densities of metastable states. The simulation results show that the static landscape features are strongly dependent on the correlation strength and correlation structure between patterns. Using different hierarchical structures of the correlation between patterns affects the landscape features

Building functional networks of spiking model neurons.

Science.gov (United States)

Abbott, L F; DePasquale, Brian; Memmesheimer, Raoul-Martin

2016-03-01

Most of the networks used by computer scientists and many of those studied by modelers in neuroscience represent unit activities as continuous variables. Neurons, however, communicate primarily through discontinuous spiking. We review methods for transferring our ability to construct interesting networks that perform relevant tasks from the artificial continuous domain to more realistic spiking network models. These methods raise a number of issues that warrant further theoretical and experimental study.

The Kuramoto model in complex networks

Science.gov (United States)

Rodrigues, Francisco A.; Peron, Thomas K. DM.; Ji, Peng; Kurths, Jürgen

2016-01-01

Synchronization of an ensemble of oscillators is an emergent phenomenon present in several complex systems, ranging from social and physical to biological and technological systems. The most successful approach to describe how coherent behavior emerges in these complex systems is given by the paradigmatic Kuramoto model. This model has been traditionally studied in complete graphs. However, besides being intrinsically dynamical, complex systems present very heterogeneous structure, which can be represented as complex networks. This report is dedicated to review main contributions in the field of synchronization in networks of Kuramoto oscillators. In particular, we provide an overview of the impact of network patterns on the local and global dynamics of coupled phase oscillators. We cover many relevant topics, which encompass a description of the most used analytical approaches and the analysis of several numerical results. Furthermore, we discuss recent developments on variations of the Kuramoto model in networks, including the presence of noise and inertia. The rich potential for applications is discussed for special fields in engineering, neuroscience, physics and Earth science. Finally, we conclude by discussing problems that remain open after the last decade of intensive research on the Kuramoto model and point out some promising directions for future research.

A comprehensive probabilistic analysis model of oil pipelines network based on Bayesian network

Science.gov (United States)

Zhang, C.; Qin, T. X.; Jiang, B.; Huang, C.

2018-02-01

Oil pipelines network is one of the most important facilities of energy transportation. But oil pipelines network accident may result in serious disasters. Some analysis models for these accidents have been established mainly based on three methods, including event-tree, accident simulation and Bayesian network. Among these methods, Bayesian network is suitable for probabilistic analysis. But not all the important influencing factors are considered and the deployment rule of the factors has not been established. This paper proposed a probabilistic analysis model of oil pipelines network based on Bayesian network. Most of the important influencing factors, including the key environment condition and emergency response are considered in this model. Moreover, the paper also introduces a deployment rule for these factors. The model can be used in probabilistic analysis and sensitive analysis of oil pipelines network accident.

Combination of Bayesian Network and Overlay Model in User Modeling

Directory of Open Access Journals (Sweden)

Loc Nguyen

2009-12-01

Full Text Available The core of adaptive system is user model containing personal information such as knowledge, learning styles, goals… which is requisite for learning personalized process. There are many modeling approaches, for example: stereotype, overlay, plan recognition… but they don’t bring out the solid method for reasoning from user model. This paper introduces the statistical method that combines Bayesian network and overlay modeling so that it is able to infer user’s knowledge from evidences collected during user’s learning process.

Innovative research of AD HOC network mobility model

Science.gov (United States)

Chen, Xin

2017-08-01

It is difficult for researchers of AD HOC network to conduct actual deployment during experimental stage as the network topology is changeable and location of nodes is unfixed. Thus simulation still remains the main research method of the network. Mobility model is an important component of AD HOC network simulation. It is used to describe the movement pattern of nodes in AD HOC network (including location and velocity, etc.) and decides the movement trail of nodes, playing as the abstraction of the movement modes of nodes. Therefore, mobility model which simulates node movement is an important foundation for simulation research. In AD HOC network research, mobility model shall reflect the movement law of nodes as truly as possible. In this paper, node generally refers to the wireless equipment people carry. The main research contents include how nodes avoid obstacles during movement process and the impacts of obstacles on the mutual relation among nodes, based on which a Node Self Avoiding Obstacle, i.e. NASO model is established in AD HOC network.

Modelling the impact of social network on energy savings

International Nuclear Information System (INIS)

Du, Feng; Zhang, Jiangfeng; Li, Hailong; Yan, Jinyue; Galloway, Stuart; Lo, Kwok L.

2016-01-01

Highlights: • Energy saving propagation along a social network is modelled. • This model consists of a time evolving weighted directed network. • Network weights and information decay are applied in savings calculation. - Abstract: It is noted that human behaviour changes can have a significant impact on energy consumption, however, qualitative study on such an impact is still very limited, and it is necessary to develop the corresponding mathematical models to describe how much energy savings can be achieved through human engagement. In this paper a mathematical model of human behavioural dynamic interactions on a social network is derived to calculate energy savings. This model consists of a weighted directed network with time evolving information on each node. Energy savings from the whole network is expressed as mathematical expectation from probability theory. This expected energy savings model includes both direct and indirect energy savings of individuals in the network. The savings model is obtained by network weights and modified by the decay of information. Expected energy savings are calculated for cases where individuals in the social network are treated as a single information source or multiple sources. This model is tested on a social network consisting of 40 people. The results show that the strength of relations between individuals is more important to information diffusion than the number of connections individuals have. The expected energy savings of optimally chosen node can be 25.32% more than randomly chosen nodes at the end of the second month for the case of single information source in the network, and 16.96% more than random nodes for the case of multiple information sources. This illustrates that the model presented in this paper can be used to determine which individuals will have the most influence on the social network, which in turn provides a useful guide to identify targeted customers in energy efficiency technology rollout

Security Modeling on the Supply Chain Networks

Directory of Open Access Journals (Sweden)

Marn-Ling Shing

2007-10-01

Full Text Available In order to keep the price down, a purchaser sends out the request for quotation to a group of suppliers in a supply chain network. The purchaser will then choose a supplier with the best combination of price and quality. A potential supplier will try to collect the related information about other suppliers so he/she can offer the best bid to the purchaser. Therefore, confidentiality becomes an important consideration for the design of a supply chain network. Chen et al. have proposed the application of the Bell-LaPadula model in the design of a secured supply chain network. In the Bell-LaPadula model, a subject can be in one of different security clearances and an object can be in one of various security classifications. All the possible combinations of (Security Clearance, Classification pair in the Bell-LaPadula model can be thought as different states in the Markov Chain model. This paper extends the work done by Chen et al., provides more details on the Markov Chain model and illustrates how to use it to monitor the security state transition in the supply chain network.

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.

Equity venture capital platform model based on complex network

Science.gov (United States)

Guo, Dongwei; Zhang, Lanshu; Liu, Miao

2018-05-01

This paper uses the small-world network and the random-network to simulate the relationship among the investors, construct the network model of the equity venture capital platform to explore the impact of the fraud rate and the bankruptcy rate on the robustness of the network model while observing the impact of the average path length and the average agglomeration coefficient of the investor relationship network on the income of the network model. The study found that the fraud rate and bankruptcy rate exceeded a certain threshold will lead to network collapse; The bankruptcy rate has a great influence on the income of the platform; The risk premium exists, and the average return is better under a certain range of bankruptcy risk; The structure of the investor relationship network has no effect on the income of the investment model.

Recurrent neural network based hybrid model for reconstructing gene regulatory network.

Science.gov (United States)

Raza, Khalid; Alam, Mansaf

2016-10-01

One of the exciting problems in systems biology research is to decipher how genome controls the development of complex biological system. The gene regulatory networks (GRNs) help in the identification of regulatory interactions between genes and offer fruitful information related to functional role of individual gene in a cellular system. Discovering GRNs lead to a wide range of applications, including identification of disease related pathways providing novel tentative drug targets, helps to predict disease response, and also assists in diagnosing various diseases including cancer. Reconstruction of GRNs from available biological data is still an open problem. This paper proposes a recurrent neural network (RNN) based model of GRN, hybridized with generalized extended Kalman filter for weight update in backpropagation through time training algorithm. The RNN is a complex neural network that gives a better settlement between biological closeness and mathematical flexibility to model GRN; and is also able to capture complex, non-linear and dynamic relationships among variables. Gene expression data are inherently noisy and Kalman filter performs well for estimation problem even in noisy data. Hence, we applied non-linear version of Kalman filter, known as generalized extended Kalman filter, for weight update during RNN training. The developed model has been tested on four benchmark networks such as DNA SOS repair network, IRMA network, and two synthetic networks from DREAM Challenge. We performed a comparison of our results with other state-of-the-art techniques which shows superiority of our proposed model. Further, 5% Gaussian noise has been induced in the dataset and result of the proposed model shows negligible effect of noise on results, demonstrating the noise tolerance capability of the model. Copyright © 2016 Elsevier Ltd. All rights reserved.

Stability of a neural network model with small-world connections

International Nuclear Information System (INIS)

Li Chunguang; Chen Guanrong

2003-01-01

Small-world networks are highly clustered networks with small distances among the nodes. There are many biological neural networks that present this kind of connection. There are no special weightings in the connections of most existing small-world network models. However, this kind of simply connected model cannot characterize biological neural networks, in which there are different weights in synaptic connections. In this paper, we present a neural network model with weighted small-world connections and further investigate the stability of this model

An Improved Car-Following Model in Vehicle Networking Based on Network Control

Directory of Open Access Journals (Sweden)

D. Y. Kong

2014-01-01

Full Text Available Vehicle networking is a system to realize information interoperability between vehicles and people, vehicles and roads, vehicles and vehicles, and cars and transport facilities, through the network information exchange, in order to achieve the effective monitoring of the vehicle and traffic flow. Realizing information interoperability between vehicles and vehicles, which can affect the traffic flow, is an important application of network control system (NCS. In this paper, a car-following model using vehicle networking theory is established, based on network control principle. The car-following model, which is an improvement of the traditional traffic model, describes the traffic in vehicle networking condition. The impact that vehicle networking has on the traffic flow is quantitatively assessed in a particular scene of one-way, no lane changing highway. The examples show that the capacity of the road is effectively enhanced by using vehicle networking.

Sparsity in Model Gene Regulatory Networks

International Nuclear Information System (INIS)

Zagorski, M.

2011-01-01

We propose a gene regulatory network model which incorporates the microscopic interactions between genes and transcription factors. In particular the gene's expression level is determined by deterministic synchronous dynamics with contribution from excitatory interactions. We study the structure of networks that have a particular '' function '' and are subject to the natural selection pressure. The question of network robustness against point mutations is addressed, and we conclude that only a small part of connections defined as '' essential '' for cell's existence is fragile. Additionally, the obtained networks are sparse with narrow in-degree and broad out-degree, properties well known from experimental study of biological regulatory networks. Furthermore, during sampling procedure we observe that significantly different genotypes can emerge under mutation-selection balance. All the preceding features hold for the model parameters which lay in the experimentally relevant range. (author)

Keystone Business Models for Network Security Processors

Directory of Open Access Journals (Sweden)

Arthur Low

2013-07-01

Full Text Available Network security processors are critical components of high-performance systems built for cybersecurity. Development of a network security processor requires multi-domain experience in semiconductors and complex software security applications, and multiple iterations of both software and hardware implementations. Limited by the business models in use today, such an arduous task can be undertaken only by large incumbent companies and government organizations. Neither the “fabless semiconductor” models nor the silicon intellectual-property licensing (“IP-licensing” models allow small technology companies to successfully compete. This article describes an alternative approach that produces an ongoing stream of novel network security processors for niche markets through continuous innovation by both large and small companies. This approach, referred to here as the "business ecosystem model for network security processors", includes a flexible and reconfigurable technology platform, a “keystone” business model for the company that maintains the platform architecture, and an extended ecosystem of companies that both contribute and share in the value created by innovation. New opportunities for business model innovation by participating companies are made possible by the ecosystem model. This ecosystem model builds on: i the lessons learned from the experience of the first author as a senior integrated circuit architect for providers of public-key cryptography solutions and as the owner of a semiconductor startup, and ii the latest scholarly research on technology entrepreneurship, business models, platforms, and business ecosystems. This article will be of interest to all technology entrepreneurs, but it will be of particular interest to owners of small companies that provide security solutions and to specialized security professionals seeking to launch their own companies.

Stabilization of model-based networked control systems

Energy Technology Data Exchange (ETDEWEB)

Miranda, Francisco [CIDMA, Universidade de Aveiro, Aveiro (Portugal); Instituto Politécnico de Viana do Castelo, Viana do Castelo (Portugal); Abreu, Carlos [Instituto Politécnico de Viana do Castelo, Viana do Castelo (Portugal); CMEMS-UMINHO, Universidade do Minho, Braga (Portugal); Mendes, Paulo M. [CMEMS-UMINHO, Universidade do Minho, Braga (Portugal)

2016-06-08

A class of networked control systems called Model-Based Networked Control Systems (MB-NCSs) is considered. Stabilization of MB-NCSs is studied using feedback controls and simulation of stabilization for different feedbacks is made with the purpose to reduce the network trafic. The feedback control input is applied in a compensated model of the plant that approximates the plant dynamics and stabilizes the plant even under slow network conditions. Conditions for global exponential stabilizability and for the choosing of a feedback control input for a given constant time between the information moments of the network are derived. An optimal control problem to obtain an optimal feedback control is also presented.

Unification and mechanistic detail as drivers of model construction: models of networks in economics and sociology.

Science.gov (United States)

Kuorikoski, Jaakko; Marchionni, Caterina

2014-12-01

We examine the diversity of strategies of modelling networks in (micro) economics and (analytical) sociology. Field-specific conceptions of what explaining (with) networks amounts to or systematic preference for certain kinds of explanatory factors are not sufficient to account for differences in modelling methodologies. We argue that network models in both sociology and economics are abstract models of network mechanisms and that differences in their modelling strategies derive to a large extent from field-specific conceptions of the way in which a good model should be a general one. Whereas the economics models aim at unification, the sociological models aim at a set of mechanism schemas that are extrapolatable to the extent that the underlying psychological mechanisms are general. These conceptions of generality induce specific biases in mechanistic explanation and are related to different views of when knowledge from different fields should be seen as relevant.

Joint Modelling of Structural and Functional Brain Networks

DEFF Research Database (Denmark)

Andersen, Kasper Winther; Herlau, Tue; Mørup, Morten

-parametric Bayesian network model which allows for joint modelling and integration of multiple networks. We demonstrate the model’s ability to detect vertices that share structure across networks jointly in functional MRI (fMRI) and diffusion MRI (dMRI) data. Using two fMRI and dMRI scans per subject, we establish...

Continuum Modeling of Biological Network Formation

KAUST Repository

Albi, Giacomo; Burger, Martin; Haskovec, Jan; Markowich, Peter A.; Schlottbom, Matthias

2017-01-01

We present an overview of recent analytical and numerical results for the elliptic–parabolic system of partial differential equations proposed by Hu and Cai, which models the formation of biological transportation networks. The model describes

Using structural equation modeling for network meta-analysis.

Science.gov (United States)

Tu, Yu-Kang; Wu, Yun-Chun

2017-07-14

Network meta-analysis overcomes the limitations of traditional pair-wise meta-analysis by incorporating all available evidence into a general statistical framework for simultaneous comparisons of several treatments. Currently, network meta-analyses are undertaken either within the Bayesian hierarchical linear models or frequentist generalized linear mixed models. Structural equation modeling (SEM) is a statistical method originally developed for modeling causal relations among observed and latent variables. As random effect is explicitly modeled as a latent variable in SEM, it is very flexible for analysts to specify complex random effect structure and to make linear and nonlinear constraints on parameters. The aim of this article is to show how to undertake a network meta-analysis within the statistical framework of SEM. We used an example dataset to demonstrate the standard fixed and random effect network meta-analysis models can be easily implemented in SEM. It contains results of 26 studies that directly compared three treatment groups A, B and C for prevention of first bleeding in patients with liver cirrhosis. We also showed that a new approach to network meta-analysis based on the technique of unrestricted weighted least squares (UWLS) method can also be undertaken using SEM. For both the fixed and random effect network meta-analysis, SEM yielded similar coefficients and confidence intervals to those reported in the previous literature. The point estimates of two UWLS models were identical to those in the fixed effect model but the confidence intervals were greater. This is consistent with results from the traditional pairwise meta-analyses. Comparing to UWLS model with common variance adjusted factor, UWLS model with unique variance adjusted factor has greater confidence intervals when the heterogeneity was larger in the pairwise comparison. The UWLS model with unique variance adjusted factor reflects the difference in heterogeneity within each comparison

Campus network security model study

Science.gov (United States)

Zhang, Yong-ku; Song, Li-ren

2011-12-01

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

Resolving structural variability in network models and the brain.

Directory of Open Access Journals (Sweden)

Florian Klimm

2014-03-01

Full Text Available Large-scale white matter pathways crisscrossing the cortex create a complex pattern of connectivity that underlies human cognitive function. Generative mechanisms for this architecture have been difficult to identify in part because little is known in general about mechanistic drivers of structured networks. Here we contrast network properties derived from diffusion spectrum imaging data of the human brain with 13 synthetic network models chosen to probe the roles of physical network embedding and temporal network growth. We characterize both the empirical and synthetic networks using familiar graph metrics, but presented here in a more complete statistical form, as scatter plots and distributions, to reveal the full range of variability of each measure across scales in the network. We focus specifically on the degree distribution, degree assortativity, hierarchy, topological Rentian scaling, and topological fractal scaling--in addition to several summary statistics, including the mean clustering coefficient, the shortest path-length, and the network diameter. The models are investigated in a progressive, branching sequence, aimed at capturing different elements thought to be important in the brain, and range from simple random and regular networks, to models that incorporate specific growth rules and constraints. We find that synthetic models that constrain the network nodes to be physically embedded in anatomical brain regions tend to produce distributions that are most similar to the corresponding measurements for the brain. We also find that network models hardcoded to display one network property (e.g., assortativity do not in general simultaneously display a second (e.g., hierarchy. This relative independence of network properties suggests that multiple neurobiological mechanisms might be at play in the development of human brain network architecture. Together, the network models that we develop and employ provide a potentially useful

Modeling polyvinyl chloride Plasma Modification by Neural Networks

Science.gov (United States)

Wang, Changquan

2018-03-01

Neural networks model were constructed to analyze the connection between dielectric barrier discharge parameters and surface properties of material. The experiment data were generated from polyvinyl chloride plasma modification by using uniform design. Discharge voltage, discharge gas gap and treatment time were as neural network input layer parameters. The measured values of contact angle were as the output layer parameters. A nonlinear mathematical model of the surface modification for polyvinyl chloride was developed based upon the neural networks. The optimum model parameters were obtained by the simulation evaluation and error analysis. The results of the optimal model show that the predicted value is very close to the actual test value. The prediction model obtained here are useful for discharge plasma surface modification analysis.

A last updating evolution model for online social networks

Science.gov (United States)

Bu, Zhan; Xia, Zhengyou; Wang, Jiandong; Zhang, Chengcui

2013-05-01

As information technology has advanced, people are turning to electronic media more frequently for communication, and social relationships are increasingly found on online channels. However, there is very limited knowledge about the actual evolution of the online social networks. In this paper, we propose and study a novel evolution network model with the new concept of “last updating time”, which exists in many real-life online social networks. The last updating evolution network model can maintain the robustness of scale-free networks and can improve the network reliance against intentional attacks. What is more, we also found that it has the “small-world effect”, which is the inherent property of most social networks. Simulation experiment based on this model show that the results and the real-life data are consistent, which means that our model is valid.

Research on network information security model and system construction

OpenAIRE

Wang Haijun

2016-01-01

It briefly describes the impact of large data era on China’s network policy, but also brings more opportunities and challenges to the network information security. This paper reviews for the internationally accepted basic model and characteristics of network information security, and analyses the characteristics of network information security and their relationship. On the basis of the NIST security model, this paper describes three security control schemes in safety management model and the...

Generalized Tavis-Cummings models and quantum networks

Science.gov (United States)

Gorokhov, A. V.

2018-04-01

The properties of quantum networks based on generalized Tavis-Cummings models are theoretically investigated. We have calculated the information transfer success rate from one node to another in a simple model of a quantum network realized with two-level atoms placed in the cavities and interacting with an external laser field and cavity photons. The method of dynamical group of the Hamiltonian and technique of corresponding coherent states were used for investigation of the temporal dynamics of the two nodes model.

Switching performance of OBS network model under prefetched real traffic

Science.gov (United States)

Huang, Zhenhua; Xu, Du; Lei, Wen

2005-11-01

Optical Burst Switching (OBS) [1] is now widely considered as an efficient switching technique in building the next generation optical Internet .So it's very important to precisely evaluate the performance of the OBS network model. The performance of the OBS network model is variable in different condition, but the most important thing is that how it works under real traffic load. In the traditional simulation models, uniform traffics are usually generated by simulation software to imitate the data source of the edge node in the OBS network model, and through which the performance of the OBS network is evaluated. Unfortunately, without being simulated by real traffic, the traditional simulation models have several problems and their results are doubtable. To deal with this problem, we present a new simulation model for analysis and performance evaluation of the OBS network, which uses prefetched IP traffic to be data source of the OBS network model. The prefetched IP traffic can be considered as real IP source of the OBS edge node and the OBS network model has the same clock rate with a real OBS system. So it's easy to conclude that this model is closer to the real OBS system than the traditional ones. The simulation results also indicate that this model is more accurate to evaluate the performance of the OBS network system and the results of this model are closer to the actual situation.

Modeling and optimization of an electric power distribution network ...

African Journals Online (AJOL)

Modeling and optimization of an electric power distribution network planning system using ... of the network was modelled with non-linear mathematical expressions. ... given feasible locations, re-conductoring of existing feeders in the network, ...

Modeling integrated cellular machinery using hybrid Petri-Boolean networks.

Directory of Open Access Journals (Sweden)

Natalie Berestovsky

Full Text Available The behavior and phenotypic changes of cells are governed by a cellular circuitry that represents a set of biochemical reactions. Based on biological functions, this circuitry is divided into three types of networks, each encoding for a major biological process: signal transduction, transcription regulation, and metabolism. This division has generally enabled taming computational complexity dealing with the entire system, allowed for using modeling techniques that are specific to each of the components, and achieved separation of the different time scales at which reactions in each of the three networks occur. Nonetheless, with this division comes loss of information and power needed to elucidate certain cellular phenomena. Within the cell, these three types of networks work in tandem, and each produces signals and/or substances that are used by the others to process information and operate normally. Therefore, computational techniques for modeling integrated cellular machinery are needed. In this work, we propose an integrated hybrid model (IHM that combines Petri nets and Boolean networks to model integrated cellular networks. Coupled with a stochastic simulation mechanism, the model simulates the dynamics of the integrated network, and can be perturbed to generate testable hypotheses. Our model is qualitative and is mostly built upon knowledge from the literature and requires fine-tuning of very few parameters. We validated our model on two systems: the transcriptional regulation of glucose metabolism in human cells, and cellular osmoregulation in S. cerevisiae. The model produced results that are in very good agreement with experimental data, and produces valid hypotheses. The abstract nature of our model and the ease of its construction makes it a very good candidate for modeling integrated networks from qualitative data. The results it produces can guide the practitioner to zoom into components and interconnections and investigate them

Feed forward neural networks modeling for K-P interactions

International Nuclear Information System (INIS)

El-Bakry, M.Y.

2003-01-01

Artificial intelligence techniques involving neural networks became vital modeling tools where model dynamics are difficult to track with conventional techniques. The paper make use of the feed forward neural networks (FFNN) to model the charged multiplicity distribution of K-P interactions at high energies. The FFNN was trained using experimental data for the multiplicity distributions at different lab momenta. Results of the FFNN model were compared to that generated using the parton two fireball model and the experimental data. The proposed FFNN model results showed good fitting to the experimental data. The neural network model performance was also tested at non-trained space and was found to be in good agreement with the experimental data

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

Models as Tools of Analysis of a Network Organisation

Directory of Open Access Journals (Sweden)

Wojciech Pająk

2013-06-01

Full Text Available The paper presents models which may be applied as tools of analysis of a network organisation. The starting point of the discussion is defining the following terms: supply chain and network organisation. Further parts of the paper present basic assumptions analysis of a network organisation. Then the study characterises the best known models utilised in analysis of a network organisation. The purpose of the article is to define the notion and the essence of network organizations and to present the models used for their analysis.

Dynamic Pathloss Model for Future Mobile Communication Networks

DEFF Research Database (Denmark)

Kumar, Ambuj; Mihovska, Albena Dimitrova; Prasad, Ramjee

2016-01-01

that are essentially static. Therefore, once the signal level drops beyond the predicted values due to any variance in the environmental conditions, very crowded areas may not be catered well enough by the deployed network that had been designed with the static path loss model. This paper proposes an approach......— Future mobile communication networks (MCNs) are expected to be more intelligent and proactive based on new capabilities that increase agility and performance. However, for any successful mobile network service, the dexterity in network deployment is a key factor. The efficiency of the network...... planning depends on how congruent the chosen path loss model and real propagation are. Various path loss models have been developed that predict the signal propagation in various morphological and climatic environments; however they consider only those physical parameters of the network environment...

Modeling and control of magnetorheological fluid dampers using neural networks

Science.gov (United States)

Wang, D. H.; Liao, W. H.

2005-02-01

Due to the inherent nonlinear nature of magnetorheological (MR) fluid dampers, one of the challenging aspects for utilizing these devices to achieve high system performance is the development of accurate models and control algorithms that can take advantage of their unique characteristics. In this paper, the direct identification and inverse dynamic modeling for MR fluid dampers using feedforward and recurrent neural networks are studied. The trained direct identification neural network model can be used to predict the damping force of the MR fluid damper on line, on the basis of the dynamic responses across the MR fluid damper and the command voltage, and the inverse dynamic neural network model can be used to generate the command voltage according to the desired damping force through supervised learning. The architectures and the learning methods of the dynamic neural network models and inverse neural network models for MR fluid dampers are presented, and some simulation results are discussed. Finally, the trained neural network models are applied to predict and control the damping force of the MR fluid damper. Moreover, validation methods for the neural network models developed are proposed and used to evaluate their performance. Validation results with different data sets indicate that the proposed direct identification dynamic model using the recurrent neural network can be used to predict the damping force accurately and the inverse identification dynamic model using the recurrent neural network can act as a damper controller to generate the command voltage when the MR fluid damper is used in a semi-active mode.

Modeling the propagation of mobile malware on complex networks

Science.gov (United States)

Liu, Wanping; Liu, Chao; Yang, Zheng; Liu, Xiaoyang; Zhang, Yihao; Wei, Zuxue

2016-08-01

In this paper, the spreading behavior of malware across mobile devices is addressed. By introducing complex networks to model mobile networks, which follows the power-law degree distribution, a novel epidemic model for mobile malware propagation is proposed. The spreading threshold that guarantees the dynamics of the model is calculated. Theoretically, the asymptotic stability of the malware-free equilibrium is confirmed when the threshold is below the unity, and the global stability is further proved under some sufficient conditions. The influences of different model parameters as well as the network topology on malware propagation are also analyzed. Our theoretical studies and numerical simulations show that networks with higher heterogeneity conduce to the diffusion of malware, and complex networks with lower power-law exponents benefit malware spreading.

A Simplified Network Model for Travel Time Reliability Analysis in a Road Network

Directory of Open Access Journals (Sweden)

Kenetsu Uchida

2017-01-01

Full Text Available This paper proposes a simplified network model which analyzes travel time reliability in a road network. A risk-averse driver is assumed in the simplified model. The risk-averse driver chooses a path by taking into account both a path travel time variance and a mean path travel time. The uncertainty addressed in this model is that of traffic flows (i.e., stochastic demand flows. In the simplified network model, the path travel time variance is not calculated by considering all travel time covariance between two links in the network. The path travel time variance is calculated by considering all travel time covariance between two adjacent links in the network. Numerical experiments are carried out to illustrate the applicability and validity of the proposed model. The experiments introduce the path choice behavior of a risk-neutral driver and several types of risk-averse drivers. It is shown that the mean link flows calculated by introducing the risk-neutral driver differ as a whole from those calculated by introducing several types of risk-averse drivers. It is also shown that the mean link flows calculated by the simplified network model are almost the same as the flows calculated by using the exact path travel time variance.

Model for the growth of the world airline network

Science.gov (United States)

Verma, T.; Araújo, N. A. M.; Nagler, J.; Andrade, J. S.; Herrmann, H. J.

2016-06-01

We propose a probabilistic growth model for transport networks which employs a balance between popularity of nodes and the physical distance between nodes. By comparing the degree of each node in the model network and the World Airline Network (WAN), we observe that the difference between the two is minimized for α≈2. Interestingly, this is the value obtained for the node-node correlation function in the WAN. This suggests that our model explains quite well the growth of airline networks.

A Model for Telestrok Network Evaluation

DEFF Research Database (Denmark)

Storm, Anna; Günzel, Franziska; Theiss, Stephan

2011-01-01

analysis lacking, current telestroke reimbursement by third-party payers is limited to special contracts and not included in the regular billing system. Based on a systematic literature review and expert interviews with health care economists, third-party payers and neurologists, a Markov model...... was developed from the third-party payer perspective. In principle, it enables telestroke networks to conduct cost-effectiveness studies, because the majority of the required data can be extracted from health insurance companies’ databases and the telestroke network itself. The model presents a basis...

Analysis and Comparison of Typical Models within Distribution Network Design

DEFF Research Database (Denmark)

Jørgensen, Hans Jacob; Larsen, Allan; Madsen, Oli B.G.

This paper investigates the characteristics of typical optimisation models within Distribution Network Design. During the paper fourteen models known from the literature will be thoroughly analysed. Through this analysis a schematic approach to categorisation of distribution network design models...... for educational purposes. Furthermore, the paper can be seen as a practical introduction to network design modelling as well as a being an art manual or recipe when constructing such a model....

Modelling of solar energy potential in Nigeria using an artificial neural network model

International Nuclear Information System (INIS)

Fadare, D.A.

2009-01-01

In this study, an artificial neural network (ANN) based model for prediction of solar energy potential in Nigeria (lat. 4-14 o N, log. 2-15 o E) was developed. Standard multilayered, feed-forward, back-propagation neural networks with different architecture were designed using neural toolbox for MATLAB. Geographical and meteorological data of 195 cities in Nigeria for period of 10 years (1983-1993) from the NASA geo-satellite database were used for the training and testing the network. Meteorological and geographical data (latitude, longitude, altitude, month, mean sunshine duration, mean temperature, and relative humidity) were used as inputs to the network, while the solar radiation intensity was used as the output of the network. The results show that the correlation coefficients between the ANN predictions and actual mean monthly global solar radiation intensities for training and testing datasets were higher than 90%, thus suggesting a high reliability of the model for evaluation of solar radiation in locations where solar radiation data are not available. The predicted solar radiation values from the model were given in form of monthly maps. The monthly mean solar radiation potential in northern and southern regions ranged from 7.01-5.62 to 5.43-3.54 kW h/m 2 day, respectively. A graphical user interface (GUI) was developed for the application of the model. The model can be used easily for estimation of solar radiation for preliminary design of solar applications.

Mathematical model of highways network optimization

Science.gov (United States)

Sakhapov, R. L.; Nikolaeva, R. V.; Gatiyatullin, M. H.; Makhmutov, M. M.

2017-12-01

The article deals with the issue of highways network design. Studies show that the main requirement from road transport for the road network is to ensure the realization of all the transport links served by it, with the least possible cost. The goal of optimizing the network of highways is to increase the efficiency of transport. It is necessary to take into account a large number of factors that make it difficult to quantify and qualify their impact on the road network. In this paper, we propose building an optimal variant for locating the road network on the basis of a mathematical model. The article defines the criteria for optimality and objective functions that reflect the requirements for the road network. The most fully satisfying condition for optimality is the minimization of road and transport costs. We adopted this indicator as a criterion of optimality in the economic-mathematical model of a network of highways. Studies have shown that each offset point in the optimal binding road network is associated with all other corresponding points in the directions providing the least financial costs necessary to move passengers and cargo from this point to the other corresponding points. The article presents general principles for constructing an optimal network of roads.

Analyzing energy consumption of wireless networks. A model-based approach

Energy Technology Data Exchange (ETDEWEB)

Yue, Haidi

2013-03-04

During the last decades, wireless networking has been continuously a hot topic both in academy and in industry. Many different wireless networks have been introduced like wireless local area networks, wireless personal networks, wireless ad hoc networks, and wireless sensor networks. If these networks want to have a long term usability, the power consumed by the wireless devices in each of these networks needs to be managed efficiently. Hence, a lot of effort has been carried out for the analysis and improvement of energy efficiency, either for a specific network layer (protocol), or new cross-layer designs. In this thesis, we apply model-based approach for the analysis of energy consumption of different wireless protocols. The protocols under consideration are: one leader election protocol, one routing protocol, and two medium access control protocols. By model-based approach we mean that all these four protocols are formalized as some formal models, more precisely, as discrete-time Markov chains (DTMCs), Markov decision processes (MDPs), or stochastic timed automata (STA). For the first two models, DTMCs and MDPs, we model them in PRISM, a prominent model checker for probabilistic model checking, and apply model checking technique to analyze them. Model checking belongs to the family of formal methods. It discovers exhaustively all possible (reachable) states of the models, and checks whether these models meet a given specification. Specifications are system properties that we want to study, usually expressed by some logics, for instance, probabilistic computer tree logic (PCTL). However, while model checking relies on rigorous mathematical foundations and automatically explores the entire state space of a model, its applicability is also limited by the so-called state space explosion problem -- even systems of moderate size often yield models with an exponentially larger state space that thwart their analysis. Hence for the STA models in this thesis, since there

Mathematical modelling of complex contagion on clustered networks

Science.gov (United States)

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

2015-09-01

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

Mathematical modelling of complex contagion on clustered networks

Directory of Open Access Journals (Sweden)

David J. P. O'Sullivan

2015-09-01

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

Agent Based Modeling on Organizational Dynamics of Terrorist Network

OpenAIRE

Bo Li; Duoyong Sun; Renqi Zhu; Ze Li

2015-01-01

Modeling organizational dynamics of terrorist network is a critical issue in computational analysis of terrorism research. The first step for effective counterterrorism and strategic intervention is to investigate how the terrorists operate with the relational network and what affects the performance. In this paper, we investigate the organizational dynamics by employing a computational experimentation methodology. The hierarchical cellular network model and the organizational dynamics model ...

Quebec mental health services networks: models and implementation

Directory of Open Access Journals (Sweden)

Marie-Josée Fleury

2005-06-01

Full Text Available Purpose: In the transformation of health care systems, the introduction of integrated service networks is considered to be one of the main solutions for enhancing efficiency. In the last few years, a wealth of literature has emerged on the topic of services integration. However, the question of how integrated service networks should be modelled to suit different implementation contexts has barely been touched. To fill that gap, this article presents four models for the organization of mental health integrated networks. Data sources: The proposed models are drawn from three recently published studies on mental health integrated services in the province of Quebec (Canada with the author as principal investigator. Description: Following an explanation of the concept of integrated service network and a description of the Quebec context for mental health networks, the models, applicable in all settings: rural, urban or semi-urban, and metropolitan, and summarized in four figures, are presented. Discussion and conclusion: To apply the models successfully, the necessity of rallying all the actors of a system, from the strategic, tactical and operational levels, according to the type of integration involved: functional/administrative, clinical and physician-system is highlighted. The importance of formalizing activities among organizations and actors in a network and reinforcing the governing mechanisms at the local level is also underlined. Finally, a number of integration strategies and key conditions of success to operationalize integrated service networks are suggested.

Modeling stochasticity and robustness in gene regulatory networks.

Science.gov (United States)

Garg, Abhishek; Mohanram, Kartik; Di Cara, Alessandro; De Micheli, Giovanni; Xenarios, Ioannis

2009-06-15

Understanding gene regulation in biological processes and modeling the robustness of underlying regulatory networks is an important problem that is currently being addressed by computational systems biologists. Lately, there has been a renewed interest in Boolean modeling techniques for gene regulatory networks (GRNs). However, due to their deterministic nature, it is often difficult to identify whether these modeling approaches are robust to the addition of stochastic noise that is widespread in gene regulatory processes. Stochasticity in Boolean models of GRNs has been addressed relatively sparingly in the past, mainly by flipping the expression of genes between different expression levels with a predefined probability. This stochasticity in nodes (SIN) model leads to over representation of noise in GRNs and hence non-correspondence with biological observations. In this article, we introduce the stochasticity in functions (SIF) model for simulating stochasticity in Boolean models of GRNs. By providing biological motivation behind the use of the SIF model and applying it to the T-helper and T-cell activation networks, we show that the SIF model provides more biologically robust results than the existing SIN model of stochasticity in GRNs. Algorithms are made available under our Boolean modeling toolbox, GenYsis. The software binaries can be downloaded from http://si2.epfl.ch/ approximately garg/genysis.html.

A growing social network model in geographical space

Science.gov (United States)

Antonioni, Alberto; Tomassini, Marco

2017-09-01

In this work we propose a new model for the generation of social networks that includes their often ignored spatial aspects. The model is a growing one and links are created either taking space into account, or disregarding space and only considering the degree of target nodes. These two effects can be mixed linearly in arbitrary proportions through a parameter. We numerically show that for a given range of the combination parameter, and for given mean degree, the generated network class shares many important statistical features with those observed in actual social networks, including the spatial dependence of connections. Moreover, we show that the model provides a good qualitative fit to some measured social networks.

Modelling and predicting biogeographical patterns in river networks

Directory of Open Access Journals (Sweden)

Sabela Lois

2016-04-01

Full Text Available Statistical analysis and interpretation of biogeographical phenomena in rivers is now possible using a spatially explicit modelling framework, which has seen significant developments in the past decade. I used this approach to identify a spatial extent (geostatistical range in which the abundance of the parasitic freshwater pearl mussel (Margaritifera margaritifera L. is spatially autocorrelated in river networks. I show that biomass and abundance of host fish are a likely explanation for the autocorrelation in mussel abundance within a 15-km spatial extent. The application of universal kriging with the empirical model enabled precise prediction of mussel abundance within segments of river networks, something that has the potential to inform conservation biogeography. Although I used a variety of modelling approaches in my thesis, I focus here on the details of this relatively new spatial stream network model, thus advancing the study of biogeographical patterns in river networks.

Distributed Bayesian Networks for User Modeling

DEFF Research Database (Denmark)

Tedesco, Roberto; Dolog, Peter; Nejdl, Wolfgang

2006-01-01

The World Wide Web is a popular platform for providing eLearning applications to a wide spectrum of users. However – as users differ in their preferences, background, requirements, and goals – applications should provide personalization mechanisms. In the Web context, user models used by such ada......The World Wide Web is a popular platform for providing eLearning applications to a wide spectrum of users. However – as users differ in their preferences, background, requirements, and goals – applications should provide personalization mechanisms. In the Web context, user models used...... by such adaptive applications are often partial fragments of an overall user model. The fragments have then to be collected and merged into a global user profile. In this paper we investigate and present algorithms able to cope with distributed, fragmented user models – based on Bayesian Networks – in the context...... of Web-based eLearning platforms. The scenario we are tackling assumes learners who use several systems over time, which are able to create partial Bayesian Networks for user models based on the local system context. In particular, we focus on how to merge these partial user models. Our merge mechanism...

Learning and Model-checking Networks of I/O Automata

DEFF Research Database (Denmark)

Mao, Hua; Jaeger, Manfred

2012-01-01

We introduce a new statistical relational learning (SRL) approach in which models for structured data, especially network data, are constructed as networks of communicating nite probabilistic automata. Leveraging existing automata learning methods from the area of grammatical inference, we can...... learn generic models for network entities in the form of automata templates. As is characteristic for SRL techniques, the abstraction level aorded by learning generic templates enables one to apply the learned model to new domains. A main benet of learning models based on nite automata lies in the fact...

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.

A Model of Mental State Transition Network

Science.gov (United States)

Xiang, Hua; Jiang, Peilin; Xiao, Shuang; Ren, Fuji; Kuroiwa, Shingo

Emotion is one of the most essential and basic attributes of human intelligence. Current AI (Artificial Intelligence) research is concentrating on physical components of emotion, rarely is it carried out from the view of psychology directly(1). Study on the model of artificial psychology is the first step in the development of human-computer interaction. As affective computing remains unpredictable, creating a reasonable mental model becomes the primary task for building a hybrid system. A pragmatic mental model is also the fundament of some key topics such as recognition and synthesis of emotions. In this paper a Mental State Transition Network Model(2) is proposed to detect human emotions. By a series of psychological experiments, we present a new way to predict coming human's emotions depending on the various current emotional states under various stimuli. Besides, people in different genders and characters are taken into consideration in our investigation. According to the psychological experiments data derived from 200 questionnaires, a Mental State Transition Network Model for describing the transitions in distribution among the emotions and relationships between internal mental situations and external are concluded. Further more the coefficients of the mental transition network model were achieved. Comparing seven relative evaluating experiments, an average precision rate of 0.843 is achieved using a set of samples for the proposed model.

Dynamic Evolution Model Based on Social Network Services

Science.gov (United States)

Xiong, Xi; Gou, Zhi-Jian; Zhang, Shi-Bin; Zhao, Wen

2013-11-01

Based on the analysis of evolutionary characteristics of public opinion in social networking services (SNS), in the paper we propose a dynamic evolution model, in which opinions are coupled with topology. This model shows the clustering phenomenon of opinions in dynamic network evolution. The simulation results show that the model can fit the data from a social network site. The dynamic evolution of networks accelerates the opinion, separation and aggregation. The scale and the number of clusters are influenced by confidence limit and rewiring probability. Dynamic changes of the topology reduce the number of isolated nodes, while the increased confidence limit allows nodes to communicate more sufficiently. The two effects make the distribution of opinion more neutral. The dynamic evolution of networks generates central clusters with high connectivity and high betweenness, which make it difficult to control public opinions in SNS.

Equivalent model and power flow model for electric railway traction network

Science.gov (United States)

Wang, Feng

2018-05-01

An equivalent model of the Cable Traction Network (CTN) considering the distributed capacitance effect of the cable system is proposed. The model can be divided into 110kV side and 27.5kV side two kinds. The 110kV side equivalent model can be used to calculate the power supply capacity of the CTN. The 27.5kV side equivalent model can be used to solve the voltage of the catenary. Based on the equivalent simplified model of CTN, the power flow model of CTN which involves the reactive power compensation coefficient and the interaction of voltage and current, is derived.

Network modelling of fluid retention behaviour in unsaturated soils

Directory of Open Access Journals (Sweden)

Athanasiadis Ignatios

2016-01-01

Full Text Available The paper describes discrete modelling of the retention behaviour of unsaturated porous materials. A network approach is used within a statistical volume element (SVE, suitable for subsequent use in hydro-mechanical analysis and incorporation within multi-scale numerical modelling. The soil pore structure is modelled by a network of cylindrical pipes connecting spheres, with the spheres representing soil voids and the pipes representing inter-connecting throats. The locations of pipes and spheres are determined by a Voronoi tessellation of the domain. Original aspects of the modelling include a form of periodic boundary condition implementation applied for the first time to this type of network, a new pore volume scaling technique to provide more realistic modelling and a new procedure for initiating drying or wetting paths in a network model employing periodic boundary conditions. Model simulations, employing two linear cumulative probability distributions to represent the distributions of sphere and pipe radii, are presented for the retention behaviour reported from a mercury porosimetry test on a sandstone.

Efficient Neural Network Modeling for Flight and Space Dynamics Simulation

Directory of Open Access Journals (Sweden)

Ayman Hamdy Kassem

2011-01-01

Full Text Available This paper represents an efficient technique for neural network modeling of flight and space dynamics simulation. The technique will free the neural network designer from guessing the size and structure for the required neural network model and will help to minimize the number of neurons. For linear flight/space dynamics systems, the technique can find the network weights and biases directly by solving a system of linear equations without the need for training. Nonlinear flight dynamic systems can be easily modeled by training its linearized models keeping the same network structure. The training is fast, as it uses the linear system knowledge to speed up the training process. The technique is tested on different flight/space dynamic models and showed promising results.

Mixture models with entropy regularization for community detection in networks

Science.gov (United States)

Chang, Zhenhai; Yin, Xianjun; Jia, Caiyan; Wang, Xiaoyang

2018-04-01

Community detection is a key exploratory tool in network analysis and has received much attention in recent years. NMM (Newman's mixture model) is one of the best models for exploring a range of network structures including community structure, bipartite and core-periphery structures, etc. However, NMM needs to know the number of communities in advance. Therefore, in this study, we have proposed an entropy regularized mixture model (called EMM), which is capable of inferring the number of communities and identifying network structure contained in a network, simultaneously. In the model, by minimizing the entropy of mixing coefficients of NMM using EM (expectation-maximization) solution, the small clusters contained little information can be discarded step by step. The empirical study on both synthetic networks and real networks has shown that the proposed model EMM is superior to the state-of-the-art methods.

Combinatorial explosion in model gene networks

Science.gov (United States)

Edwards, R.; Glass, L.

2000-09-01

The explosive growth in knowledge of the genome of humans and other organisms leaves open the question of how the functioning of genes in interacting networks is coordinated for orderly activity. One approach to this problem is to study mathematical properties of abstract network models that capture the logical structures of gene networks. The principal issue is to understand how particular patterns of activity can result from particular network structures, and what types of behavior are possible. We study idealized models in which the logical structure of the network is explicitly represented by Boolean functions that can be represented by directed graphs on n-cubes, but which are continuous in time and described by differential equations, rather than being updated synchronously via a discrete clock. The equations are piecewise linear, which allows significant analysis and facilitates rapid integration along trajectories. We first give a combinatorial solution to the question of how many distinct logical structures exist for n-dimensional networks, showing that the number increases very rapidly with n. We then outline analytic methods that can be used to establish the existence, stability and periods of periodic orbits corresponding to particular cycles on the n-cube. We use these methods to confirm the existence of limit cycles discovered in a sample of a million randomly generated structures of networks of 4 genes. Even with only 4 genes, at least several hundred different patterns of stable periodic behavior are possible, many of them surprisingly complex. We discuss ways of further classifying these periodic behaviors, showing that small mutations (reversal of one or a few edges on the n-cube) need not destroy the stability of a limit cycle. Although these networks are very simple as models of gene networks, their mathematical transparency reveals relationships between structure and behavior, they suggest that the possibilities for orderly dynamics in such

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

Directory of Open Access Journals (Sweden)

Lan Liu

2017-01-01

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

A Network Model of Interpersonal Alignment in Dialog

Directory of Open Access Journals (Sweden)

Alexander Mehler

2010-06-01

Full Text Available In dyadic communication, both interlocutors adapt to each other linguistically, that is, they align interpersonally. In this article, we develop a framework for modeling interpersonal alignment in terms of the structural similarity of the interlocutors’ dialog lexica. This is done by means of so-called two-layer time-aligned network series, that is, a time-adjusted graph model. The graph model is partitioned into two layers, so that the interlocutors’ lexica are captured as subgraphs of an encompassing dialog graph. Each constituent network of the series is updated utterance-wise. Thus, both the inherent bipartition of dyadic conversations and their gradual development are modeled. The notion of alignment is then operationalized within a quantitative model of structure formation based on the mutual information of the subgraphs that represent the interlocutor’s dialog lexica. By adapting and further developing several models of complex network theory, we show that dialog lexica evolve as a novel class of graphs that have not been considered before in the area of complex (linguistic networks. Additionally, we show that our framework allows for classifying dialogs according to their alignment status. To the best of our knowledge, this is the first approach to measuring alignment in communication that explores the similarities of graph-like cognitive representations.

Energy model for rumor propagation on social networks

Science.gov (United States)

Han, Shuo; Zhuang, Fuzhen; He, Qing; Shi, Zhongzhi; Ao, Xiang

2014-01-01

With the development of social networks, the impact of rumor propagation on human lives is more and more significant. Due to the change of propagation mode, traditional rumor propagation models designed for word-of-mouth process may not be suitable for describing the rumor spreading on social networks. To overcome this shortcoming, we carefully analyze the mechanisms of rumor propagation and the topological properties of large-scale social networks, then propose a novel model based on the physical theory. In this model, heat energy calculation formula and Metropolis rule are introduced to formalize this problem and the amount of heat energy is used to measure a rumor’s impact on a network. Finally, we conduct track experiments to show the evolution of rumor propagation, make comparison experiments to contrast the proposed model with the traditional models, and perform simulation experiments to study the dynamics of rumor spreading. The experiments show that (1) the rumor propagation simulated by our model goes through three stages: rapid growth, fluctuant persistence and slow decline; (2) individuals could spread a rumor repeatedly, which leads to the rumor’s resurgence; (3) rumor propagation is greatly influenced by a rumor’s attraction, the initial rumormonger and the sending probability.

neural network based model o work based model of an industrial oil

African Journals Online (AJOL)

eobe

technique. g, Neural Network Model, Regression, Mean Square Error, PID controller. ... during the training processes. An additio ... used to carry out simulation studies of the mode .... A two-layer feed-forward neural network with Matlab.

Entanglement effects in model polymer networks

Science.gov (United States)

Everaers, R.; Kremer, K.

The influence of topological constraints on the local dynamics in cross-linked polymer melts and their contribution to the elastic properties of rubber elastic systems are a long standing problem in statistical mechanics. Polymer networks with diamond lattice connectivity (Everaers and Kremer 1995, Everaers and Kremer 1996a) are idealized model systems which isolate the effect of topology conservation from other sources of quenched disorder. We study their behavior in molecular dynamics simulations under elongational strain. In our analysis we compare the measured, purely entropic shear moduli G to the predictions of statistical mechanical models of rubber elasticity, making extensive use of the microscopic structural and topological information available in computer simulations. We find (Everaers and Kremer 1995) that the classical models of rubber elasticity underestimate the true change in entropy in a deformed network significantly, because they neglect the tension along the contour of the strands which cannot relax due to entanglements (Everaers and Kremer (in preparation)). This contribution and the fluctuations in strained systems seem to be well described by the constrained mode model (Everaers 1998) which allows to treat the crossover from classical rubber elasticity to the tube model for polymer networks with increasing strand length within one transparant formalism. While this is important for the description of the effects we try to do a first quantitative step towards their explanation by topological considerations. We show (Everaers and Kremer 1996a) that for the comparatively short strand lengths of our diamond networks the topology contribution to the shear modulus is proportional to the density of entangled mesh pairs with non-zero Gauss linking number. Moreover, the prefactor can be estimated consistently within a rather simple model developed by Vologodskii et al. and by Graessley and Pearson, which is based on the definition of an entropic

Continuum Model for River Networks

Science.gov (United States)

Giacometti, Achille; Maritan, Amos; Banavar, Jayanth R.

1995-07-01

The effects of erosion, avalanching, and random precipitation are captured in a simple stochastic partial differential equation for modeling the evolution of river networks. Our model leads to a self-organized structured landscape and to abstraction and piracy of the smaller tributaries as the evolution proceeds. An algebraic distribution of the average basin areas and a power law relationship between the drainage basin area and the river length are found.

Artificial Neural Network Modeling of an Inverse Fluidized Bed ...

African Journals Online (AJOL)

A Radial Basis Function neural network has been successfully employed for the modeling of the inverse fluidized bed reactor. In the proposed model, the trained neural network represents the kinetics of biological decomposition of pollutants in the reactor. The neural network has been trained with experimental data ...

Modeling Insurgent Network Structure and Dynamics

Science.gov (United States)

Gabbay, Michael; Thirkill-Mackelprang, Ashley

2010-03-01

We present a methodology for mapping insurgent network structure based on their public rhetoric. Indicators of cooperative links between insurgent groups at both the leadership and rank-and-file levels are used, such as joint policy statements or joint operations claims. In addition, a targeting policy measure is constructed on the basis of insurgent targeting claims. Network diagrams which integrate these measures of insurgent cooperation and ideology are generated for different periods of the Iraqi and Afghan insurgencies. The network diagrams exhibit meaningful changes which track the evolution of the strategic environment faced by insurgent groups. Correlations between targeting policy and network structure indicate that insurgent targeting claims are aimed at establishing a group identity among the spectrum of rank-and-file insurgency supporters. A dynamical systems model of insurgent alliance formation and factionalism is presented which evolves the relationship between insurgent group dyads as a function of their ideological differences and their current relationships. The ability of the model to qualitatively and quantitatively capture insurgent network dynamics observed in the data is discussed.

Analysis of organizational culture with social network models

OpenAIRE

Titov, S.

2015-01-01

Organizational culture is nowadays an object of numerous scientific papers. However, only marginal part of existing research attempts to use the formal models of organizational cultures. The lack of organizational culture models significantly limits the further research in this area and restricts the application of the theory to practice of organizational culture change projects. The article consists of general views on potential application of network models and social network analysis to th...

Modeling of the pyruvate production with Escherichia coli: comparison of mechanistic and neural networks-based models.

Science.gov (United States)

Zelić, B; Bolf, N; Vasić-Racki, D

2006-06-01

Three different models: the unstructured mechanistic black-box model, the input-output neural network-based model and the externally recurrent neural network model were used to describe the pyruvate production process from glucose and acetate using the genetically modified Escherichia coli YYC202 ldhA::Kan strain. The experimental data were used from the recently described batch and fed-batch experiments [ Zelić B, Study of the process development for Escherichia coli-based pyruvate production. PhD Thesis, University of Zagreb, Faculty of Chemical Engineering and Technology, Zagreb, Croatia, July 2003. (In English); Zelić et al. Bioproc Biosyst Eng 26:249-258 (2004); Zelić et al. Eng Life Sci 3:299-305 (2003); Zelić et al Biotechnol Bioeng 85:638-646 (2004)]. The neural networks were built out of the experimental data obtained in the fed-batch pyruvate production experiments with the constant glucose feed rate. The model validation was performed using the experimental results obtained from the batch and fed-batch pyruvate production experiments with the constant acetate feed rate. Dynamics of the substrate and product concentration changes was estimated using two neural network-based models for biomass and pyruvate. It was shown that neural networks could be used for the modeling of complex microbial fermentation processes, even in conditions in which mechanistic unstructured models cannot be applied.

A Comparison of Geographic Information Systems, Complex Networks, and Other Models for Analyzing Transportation Network Topologies

Science.gov (United States)

Alexandrov, Natalia (Technical Monitor); Kuby, Michael; Tierney, Sean; Roberts, Tyler; Upchurch, Christopher

2005-01-01

This report reviews six classes of models that are used for studying transportation network topologies. The report is motivated by two main questions. First, what can the "new science" of complex networks (scale-free, small-world networks) contribute to our understanding of transport network structure, compared to more traditional methods? Second, how can geographic information systems (GIS) contribute to studying transport networks? The report defines terms that can be used to classify different kinds of models by their function, composition, mechanism, spatial and temporal dimensions, certainty, linearity, and resolution. Six broad classes of models for analyzing transport network topologies are then explored: GIS; static graph theory; complex networks; mathematical programming; simulation; and agent-based modeling. Each class of models is defined and classified according to the attributes introduced earlier. The paper identifies some typical types of research questions about network structure that have been addressed by each class of model in the literature.

PROJECT ACTIVITY ANALYSIS WITHOUT THE NETWORK MODEL

Directory of Open Access Journals (Sweden)

S. Munapo

2012-01-01

Full Text Available

ENGLISH ABSTRACT: This paper presents a new procedure for analysing and managing activity sequences in projects. The new procedure determines critical activities, critical path, start times, free floats, crash limits, and other useful information without the use of the network model. Even though network models have been successfully used in project management so far, there are weaknesses associated with the use. A network is not easy to generate, and dummies that are usually associated with it make the network diagram complex – and dummy activities have no meaning in the original project management problem. The network model for projects can be avoided while still obtaining all the useful information that is required for project management. What are required are the activities, their accurate durations, and their predecessors.

AFRIKAANSE OPSOMMING: Die navorsing beskryf ’n nuwerwetse metode vir die ontleding en bestuur van die sekwensiële aktiwiteite van projekte. Die voorgestelde metode bepaal kritiese aktiwiteite, die kritieke pad, aanvangstye, speling, verhasing, en ander groothede sonder die gebruik van ’n netwerkmodel. Die metode funksioneer bevredigend in die praktyk, en omseil die administratiewe rompslomp van die tradisionele netwerkmodelle.

Characterization and Modeling of Network Traffic

DEFF Research Database (Denmark)

Shawky, Ahmed; Bergheim, Hans; Ragnarsson, Olafur

2011-01-01

-arrival time, IP addresses, port numbers and transport protocol are the only necessary parameters to model network traffic behaviour. In order to recreate this behaviour, a complex model is needed which is able to recreate traffic behaviour based on a set of statistics calculated from the parameters values...

Network model for fine coal dewatering. Part I. The model

Energy Technology Data Exchange (ETDEWEB)

Qamar, I.; Tierney, J.W.; Chiang, S.H.

1985-08-01

There is a body of well established research in filtration and related subjects, but much of it has been empirical - based on correlations from experimental data. This approach has the disadvantage that it lacks generality, and it is difficult to predict the behavior of new or different systems. A more general method for studying dewatering is needed-one which will include the microscopic characteristics of the filter cake, which, like other porous media, contains a complicated network of interconnected pores through which the fluid must flow. These pores play an important role in dewatering because they give rise to capillary forces when one fluid is displacing another. In this report, we describe a network model which we believe satisfies these requirements. In the main body of this report, the model is described in detail. Background information is given where appropriate, and a brief description is given of the experimental work being done in our laboratories to verify the model. A detailed description of the experimental procedures and results is given in other DOE reports. The computer programs which are needed to solve the model are described in detail in the Appendices and are accompanied by flow charts, sample problems, and sample outputs. Sufficient detail is given in order to use the model programs on other computer systems. 32 refs., 7 figs., 5 tabs.

Bayesian network modelling of upper gastrointestinal bleeding

Science.gov (United States)

Aisha, Nazziwa; Shohaimi, Shamarina; Adam, Mohd Bakri

2013-09-01

Bayesian networks are graphical probabilistic models that represent causal and other relationships between domain variables. In the context of medical decision making, these models have been explored to help in medical diagnosis and prognosis. In this paper, we discuss the Bayesian network formalism in building medical support systems and we learn a tree augmented naive Bayes Network (TAN) from gastrointestinal bleeding data. The accuracy of the TAN in classifying the source of gastrointestinal bleeding into upper or lower source is obtained. The TAN achieves a high classification accuracy of 86% and an area under curve of 92%. A sensitivity analysis of the model shows relatively high levels of entropy reduction for color of the stool, history of gastrointestinal bleeding, consistency and the ratio of blood urea nitrogen to creatinine. The TAN facilitates the identification of the source of GIB and requires further validation.

Modeling the future evolution of the virtual water trade network: A combination of network and gravity models

Science.gov (United States)

Sartori, Martina; Schiavo, Stefano; Fracasso, Andrea; Riccaboni, Massimo

2017-12-01

The paper investigates how the topological features of the virtual water (VW) network and the size of the associated VW flows are likely to change over time, under different socio-economic and climate scenarios. We combine two alternative models of network formation -a stochastic and a fitness model, used to describe the structure of VW flows- with a gravity model of trade to predict the intensity of each bilateral flow. This combined approach is superior to existing methodologies in its ability to replicate the observed features of VW trade. The insights from the models are used to forecast future VW flows in 2020 and 2050, under different climatic scenarios, and compare them with future water availability. Results suggest that the current trend of VW exports is not sustainable for all countries. Moreover, our approach highlights that some VW importers might be exposed to "imported water stress" as they rely heavily on imports from countries whose water use is unsustainable.

Modeling of methane emissions using artificial neural network approach

Directory of Open Access Journals (Sweden)

Stamenković Lidija J.

2015-01-01

Full Text Available The aim of this study was to develop a model for forecasting CH4 emissions at the national level, using Artificial Neural Networks (ANN with broadly available sustainability, economical and industrial indicators as their inputs. ANN modeling was performed using two different types of architecture; a Backpropagation Neural Network (BPNN and a General Regression Neural Network (GRNN. A conventional multiple linear regression (MLR model was also developed in order to compare model performance and assess which model provides the best results. ANN and MLR models were developed and tested using the same annual data for 20 European countries. The ANN model demonstrated very good performance, significantly better than the MLR model. It was shown that a forecast of CH4 emissions at the national level using the ANN model can be made successfully and accurately for a future period of up to two years, thereby opening the possibility to apply such a modeling technique which can be used to support the implementation of sustainable development strategies and environmental management policies. [Projekat Ministarstva nauke Republike Srbije, br. 172007

Agent Based Modeling on Organizational Dynamics of Terrorist Network

Directory of Open Access Journals (Sweden)

Bo Li

2015-01-01

Full Text Available Modeling organizational dynamics of terrorist network is a critical issue in computational analysis of terrorism research. The first step for effective counterterrorism and strategic intervention is to investigate how the terrorists operate with the relational network and what affects the performance. In this paper, we investigate the organizational dynamics by employing a computational experimentation methodology. The hierarchical cellular network model and the organizational dynamics model are developed for modeling the hybrid relational structure and complex operational processes, respectively. To intuitively elucidate this method, the agent based modeling is used to simulate the terrorist network and test the performance in diverse scenarios. Based on the experimental results, we show how the changes of operational environments affect the development of terrorist organization in terms of its recovery and capacity to perform future tasks. The potential strategies are also discussed, which can be used to restrain the activities of terrorists.

Modeling the dynamics of evaluation: a multilevel neural network implementation of the iterative reprocessing model.

Science.gov (United States)

Ehret, Phillip J; Monroe, Brian M; Read, Stephen J

2015-05-01

We present a neural network implementation of central components of the iterative reprocessing (IR) model. The IR model argues that the evaluation of social stimuli (attitudes, stereotypes) is the result of the IR of stimuli in a hierarchy of neural systems: The evaluation of social stimuli develops and changes over processing. The network has a multilevel, bidirectional feedback evaluation system that integrates initial perceptual processing and later developing semantic processing. The network processes stimuli (e.g., an individual's appearance) over repeated iterations, with increasingly higher levels of semantic processing over time. As a result, the network's evaluations of stimuli evolve. We discuss the implications of the network for a number of different issues involved in attitudes and social evaluation. The success of the network supports the IR model framework and provides new insights into attitude theory. © 2014 by the Society for Personality and Social Psychology, Inc.

Degree distribution of a new model for evolving networks

Indian Academy of Sciences (India)

on intuitive but realistic consideration that nodes are added to the network with both preferential and random attachments. The degree distribution of the model is between a power-law and an exponential decay. Motivated by the features of network evolution, we introduce a new model of evolving networks, incorporating the ...

Short-Term Load Forecasting Model Based on Quantum Elman Neural Networks

Directory of Open Access Journals (Sweden)

Zhisheng Zhang

2016-01-01

Full Text Available Short-term load forecasting model based on quantum Elman neural networks was constructed in this paper. The quantum computation and Elman feedback mechanism were integrated into quantum Elman neural networks. Quantum computation can effectively improve the approximation capability and the information processing ability of the neural networks. Quantum Elman neural networks have not only the feedforward connection but also the feedback connection. The feedback connection between the hidden nodes and the context nodes belongs to the state feedback in the internal system, which has formed specific dynamic memory performance. Phase space reconstruction theory is the theoretical basis of constructing the forecasting model. The training samples are formed by means of K-nearest neighbor approach. Through the example simulation, the testing results show that the model based on quantum Elman neural networks is better than the model based on the quantum feedforward neural network, the model based on the conventional Elman neural network, and the model based on the conventional feedforward neural network. So the proposed model can effectively improve the prediction accuracy. The research in the paper makes a theoretical foundation for the practical engineering application of the short-term load forecasting model based on quantum Elman neural networks.

Creating, generating and comparing random network models with NetworkRandomizer.

Science.gov (United States)

Tosadori, Gabriele; Bestvina, Ivan; Spoto, Fausto; Laudanna, Carlo; Scardoni, Giovanni

2016-01-01

Biological networks are becoming a fundamental tool for the investigation of high-throughput data in several fields of biology and biotechnology. With the increasing amount of information, network-based models are gaining more and more interest and new techniques are required in order to mine the information and to validate the results. To fill the validation gap we present an app, for the Cytoscape platform, which aims at creating randomised networks and randomising existing, real networks. Since there is a lack of tools that allow performing such operations, our app aims at enabling researchers to exploit different, well known random network models that could be used as a benchmark for validating real, biological datasets. We also propose a novel methodology for creating random weighted networks, i.e. the multiplication algorithm, starting from real, quantitative data. Finally, the app provides a statistical tool that compares real versus randomly computed attributes, in order to validate the numerical findings. In summary, our app aims at creating a standardised methodology for the validation of the results in the context of the Cytoscape platform.

Modeling and Control of CSTR using Model based Neural Network Predictive Control

OpenAIRE

Shrivastava, Piyush

2012-01-01

This paper presents a predictive control strategy based on neural network model of the plant is applied to Continuous Stirred Tank Reactor (CSTR). This system is a highly nonlinear process; therefore, a nonlinear predictive method, e.g., neural network predictive control, can be a better match to govern the system dynamics. In the paper, the NN model and the way in which it can be used to predict the behavior of the CSTR process over a certain prediction horizon are described, and some commen...

Energy modelling in sensor networks

Science.gov (United States)

Schmidt, D.; Krämer, M.; Kuhn, T.; Wehn, N.

2007-06-01

Wireless sensor networks are one of the key enabling technologies for the vision of ambient intelligence. Energy resources for sensor nodes are very scarce. A key challenge is the design of energy efficient communication protocols. Models of the energy consumption are needed to accurately simulate the efficiency of a protocol or application design, and can also be used for automatic energy optimizations in a model driven design process. We propose a novel methodology to create models for sensor nodes based on few simple measurements. In a case study the methodology was used to create models for MICAz nodes. The models were integrated in a simulation environment as well as in a SDL runtime framework of a model driven design process. Measurements on a test application that was created automatically from an SDL specification showed an 80% reduction in energy consumption compared to an implementation without power saving strategies.

Stochastic Boolean networks: An efficient approach to modeling gene regulatory networks

Directory of Open Access Journals (Sweden)

Liang Jinghang

2012-08-01

Full Text Available Abstract Background Various computational models have been of interest due to their use in the modelling of gene regulatory networks (GRNs. As a logical model, probabilistic Boolean networks (PBNs consider molecular and genetic noise, so the study of PBNs provides significant insights into the understanding of the dynamics of GRNs. This will ultimately lead to advances in developing therapeutic methods that intervene in the process of disease development and progression. The applications of PBNs, however, are hindered by the complexities involved in the computation of the state transition matrix and the steady-state distribution of a PBN. For a PBN with n genes and N Boolean networks, the complexity to compute the state transition matrix is O(nN22n or O(nN2n for a sparse matrix. Results This paper presents a novel implementation of PBNs based on the notions of stochastic logic and stochastic computation. This stochastic implementation of a PBN is referred to as a stochastic Boolean network (SBN. An SBN provides an accurate and efficient simulation of a PBN without and with random gene perturbation. The state transition matrix is computed in an SBN with a complexity of O(nL2n, where L is a factor related to the stochastic sequence length. Since the minimum sequence length required for obtaining an evaluation accuracy approximately increases in a polynomial order with the number of genes, n, and the number of Boolean networks, N, usually increases exponentially with n, L is typically smaller than N, especially in a network with a large number of genes. Hence, the computational efficiency of an SBN is primarily limited by the number of genes, but not directly by the total possible number of Boolean networks. Furthermore, a time-frame expanded SBN enables an efficient analysis of the steady-state distribution of a PBN. These findings are supported by the simulation results of a simplified p53 network, several randomly generated networks and a

Analysis and logical modeling of biological signaling transduction networks

Science.gov (United States)

Sun, Zhongyao

The study of network theory and its application span across a multitude of seemingly disparate fields of science and technology: computer science, biology, social science, linguistics, etc. It is the intrinsic similarities embedded in the entities and the way they interact with one another in these systems that link them together. In this dissertation, I present from both the aspect of theoretical analysis and the aspect of application three projects, which primarily focus on signal transduction networks in biology. In these projects, I assembled a network model through extensively perusing literature, performed model-based simulations and validation, analyzed network topology, and proposed a novel network measure. The application of network modeling to the system of stomatal opening in plants revealed a fundamental question about the process that has been left unanswered in decades. The novel measure of the redundancy of signal transduction networks with Boolean dynamics by calculating its maximum node-independent elementary signaling mode set accurately predicts the effect of single node knockout in such signaling processes. The three projects as an organic whole advance the understanding of a real system as well as the behavior of such network models, giving me an opportunity to take a glimpse at the dazzling facets of the immense world of network science.

Related work on reference modeling for collaborative networks

NARCIS (Netherlands)

Afsarmanesh, H.; Camarinha-Matos, L.M.; Camarinha-Matos, L.M.; Afsarmanesh, H.

2008-01-01

Several international research and development initiatives have led to development of models for organizations and organization interactions. These models and their approaches constitute a background for development of reference models for collaborative networks. A brief survey of work on modeling

A source-controlled data center network model.

Science.gov (United States)

Yu, Yang; Liang, Mangui; Wang, Zhe

2017-01-01

The construction of data center network by applying SDN technology has become a hot research topic. The SDN architecture has innovatively separated the control plane from the data plane which makes the network more software-oriented and agile. Moreover, it provides virtual multi-tenancy, effective scheduling resources and centralized control strategies to meet the demand for cloud computing data center. However, the explosion of network information is facing severe challenges for SDN controller. The flow storage and lookup mechanisms based on TCAM device have led to the restriction of scalability, high cost and energy consumption. In view of this, a source-controlled data center network (SCDCN) model is proposed herein. The SCDCN model applies a new type of source routing address named the vector address (VA) as the packet-switching label. The VA completely defines the communication path and the data forwarding process can be finished solely relying on VA. There are four advantages in the SCDCN architecture. 1) The model adopts hierarchical multi-controllers and abstracts large-scale data center network into some small network domains that has solved the restriction for the processing ability of single controller and reduced the computational complexity. 2) Vector switches (VS) developed in the core network no longer apply TCAM for table storage and lookup that has significantly cut down the cost and complexity for switches. Meanwhile, the problem of scalability can be solved effectively. 3) The SCDCN model simplifies the establishment process for new flows and there is no need to download flow tables to VS. The amount of control signaling consumed when establishing new flows can be significantly decreased. 4) We design the VS on the NetFPGA platform. The statistical results show that the hardware resource consumption in a VS is about 27% of that in an OFS.

A source-controlled data center network model

Science.gov (United States)

Yu, Yang; Liang, Mangui; Wang, Zhe

2017-01-01

The construction of data center network by applying SDN technology has become a hot research topic. The SDN architecture has innovatively separated the control plane from the data plane which makes the network more software-oriented and agile. Moreover, it provides virtual multi-tenancy, effective scheduling resources and centralized control strategies to meet the demand for cloud computing data center. However, the explosion of network information is facing severe challenges for SDN controller. The flow storage and lookup mechanisms based on TCAM device have led to the restriction of scalability, high cost and energy consumption. In view of this, a source-controlled data center network (SCDCN) model is proposed herein. The SCDCN model applies a new type of source routing address named the vector address (VA) as the packet-switching label. The VA completely defines the communication path and the data forwarding process can be finished solely relying on VA. There are four advantages in the SCDCN architecture. 1) The model adopts hierarchical multi-controllers and abstracts large-scale data center network into some small network domains that has solved the restriction for the processing ability of single controller and reduced the computational complexity. 2) Vector switches (VS) developed in the core network no longer apply TCAM for table storage and lookup that has significantly cut down the cost and complexity for switches. Meanwhile, the problem of scalability can be solved effectively. 3) The SCDCN model simplifies the establishment process for new flows and there is no need to download flow tables to VS. The amount of control signaling consumed when establishing new flows can be significantly decreased. 4) We design the VS on the NetFPGA platform. The statistical results show that the hardware resource consumption in a VS is about 27% of that in an OFS. PMID:28328925

Modeling GMPLS and Optical MPLS Networks

DEFF Research Database (Denmark)

Christiansen, Henrik Lehrmann; Wessing, Henrik

2003-01-01

. The MPLS concept is attractive because it can work as a unifying control structure. covering all technologies. This paper describes how a novel scheme for optical MPLS and circuit switched GMPLS based networks can incorporated in such multi-domain, MPLS-based scenarios and how it could be modeled. Network...

Growth of cortical neuronal network in vitro: Modeling and analysis

International Nuclear Information System (INIS)

Lai, P.-Y.; Jia, L. C.; Chan, C. K.

2006-01-01

We present a detailed analysis and theoretical growth models to account for recent experimental data on the growth of cortical neuronal networks in vitro [Phys. Rev. Lett. 93, 088101 (2004)]. The experimentally observed synchronized firing frequency of a well-connected neuronal network is shown to be proportional to the mean network connectivity. The growth of the network is consistent with the model of an early enhanced growth of connection, but followed by a retarded growth once the synchronized cluster is formed. Microscopic models with dominant excluded volume interactions are consistent with the observed exponential decay of the mean connection probability as a function of the mean network connectivity. The biological implications of the growth model are also discussed

Queueing models for token and slotted ring networks. Thesis

Science.gov (United States)

Peden, Jeffery H.

1990-01-01

Currently the end-to-end delay characteristics of very high speed local area networks are not well understood. The transmission speed of computer networks is increasing, and local area networks especially are finding increasing use in real time systems. Ring networks operation is generally well understood for both token rings and slotted rings. There is, however, a severe lack of queueing models for high layer operation. There are several factors which contribute to the processing delay of a packet, as opposed to the transmission delay, e.g., packet priority, its length, the user load, the processor load, the use of priority preemption, the use of preemption at packet reception, the number of processors, the number of protocol processing layers, the speed of each processor, and queue length limitations. Currently existing medium access queueing models are extended by adding modeling techniques which will handle exhaustive limited service both with and without priority traffic, and modeling capabilities are extended into the upper layers of the OSI model. Some of the model are parameterized solution methods, since it is shown that certain models do not exist as parameterized solutions, but rather as solution methods.

English Writing Teaching Model Dependent on Computer Network Corpus Drive Model

Directory of Open Access Journals (Sweden)

Shi Lei

2018-03-01

Full Text Available At present, the mainstream lexicalized English writing methods take only the corpus dependence between words into consideration, without introducing the corpus collocation and other issues. “Drive” is a relatively essential feature of words. And once the drive structure of a word is determined, it will be relatively clear what kinds of words to collocate with, hence the structure of the sentence can be derived relatively directly. In this paper, the English writing model that relies on the computer network corpus drive model is put forward. In this model, rich English corpus is introduced in the decomposition of the rules and the calculation of the probability, which includes not only the corpus dependence information, but also the drive structure and other corpus collocation information. Improved computer network corpus drive model is used to carry out the English writing teaching experiment. The experimental results show that the precision and the recall rate are 88.76% and 87.43%, respectively. The F value of the comprehensive index is improved by 6.65% compared with the Collins headword driven English modes of writing.

Vortex network community based reduced-order force model

Science.gov (United States)

Gopalakrishnan Meena, Muralikrishnan; Nair, Aditya; Taira, Kunihiko

2017-11-01

We characterize the vortical wake interactions by utilizing network theory and cluster-based approaches, and develop a data-inspired unsteady force model. In the present work, the vortical interaction network is defined by nodes representing vortical elements and the edges quantified by induced velocity measures amongst the vortices. The full vorticity field is reduced to a finite number of vortical clusters based on network community detection algorithm, which serves as a basis for a skeleton network that captures the essence of the wake dynamics. We use this reduced representation of the wake to develop a data-inspired reduced-order force model that can predict unsteady fluid forces on the body. The overall formulation is demonstrated for laminar flows around canonical bluff body wake and stalled flow over an airfoil. We also show the robustness of the present network-based model against noisy data, which motivates applications towards turbulent flows and experimental measurements. Supported by the National Science Foundation (Grant 1632003).

A game theory-based trust measurement model for social networks.

Science.gov (United States)

Wang, Yingjie; Cai, Zhipeng; Yin, Guisheng; Gao, Yang; Tong, Xiangrong; Han, Qilong

2016-01-01

In social networks, trust is a complex social network. Participants in online social networks want to share information and experiences with as many reliable users as possible. However, the modeling of trust is complicated and application dependent. Modeling trust needs to consider interaction history, recommendation, user behaviors and so on. Therefore, modeling trust is an important focus for online social networks. We propose a game theory-based trust measurement model for social networks. The trust degree is calculated from three aspects, service reliability, feedback effectiveness, recommendation credibility, to get more accurate result. In addition, to alleviate the free-riding problem, we propose a game theory-based punishment mechanism for specific trust and global trust, respectively. We prove that the proposed trust measurement model is effective. The free-riding problem can be resolved effectively through adding the proposed punishment mechanism.

A three-dimensional computational model of collagen network mechanics.

Directory of Open Access Journals (Sweden)

Byoungkoo Lee

Full Text Available Extracellular matrix (ECM strongly influences cellular behaviors, including cell proliferation, adhesion, and particularly migration. In cancer, the rigidity of the stromal collagen environment is thought to control tumor aggressiveness, and collagen alignment has been linked to tumor cell invasion. While the mechanical properties of collagen at both the single fiber scale and the bulk gel scale are quite well studied, how the fiber network responds to local stress or deformation, both structurally and mechanically, is poorly understood. This intermediate scale knowledge is important to understanding cell-ECM interactions and is the focus of this study. We have developed a three-dimensional elastic collagen fiber network model (bead-and-spring model and studied fiber network behaviors for various biophysical conditions: collagen density, crosslinker strength, crosslinker density, and fiber orientation (random vs. prealigned. We found the best-fit crosslinker parameter values using shear simulation tests in a small strain region. Using this calibrated collagen model, we simulated both shear and tensile tests in a large linear strain region for different network geometry conditions. The results suggest that network geometry is a key determinant of the mechanical properties of the fiber network. We further demonstrated how the fiber network structure and mechanics evolves with a local formation, mimicking the effect of pulling by a pseudopod during cell migration. Our computational fiber network model is a step toward a full biomechanical model of cellular behaviors in various ECM conditions.

A comprehensive Network Security Risk Model for process control networks.

Science.gov (United States)

Henry, Matthew H; Haimes, Yacov Y

2009-02-01

The risk of cyber attacks on process control networks (PCN) is receiving significant attention due to the potentially catastrophic extent to which PCN failures can damage the infrastructures and commodity flows that they support. Risk management addresses the coupled problems of (1) reducing the likelihood that cyber attacks would succeed in disrupting PCN operation and (2) reducing the severity of consequences in the event of PCN failure or manipulation. The Network Security Risk Model (NSRM) developed in this article provides a means of evaluating the efficacy of candidate risk management policies by modeling the baseline risk and assessing expectations of risk after the implementation of candidate measures. Where existing risk models fall short of providing adequate insight into the efficacy of candidate risk management policies due to shortcomings in their structure or formulation, the NSRM provides model structure and an associated modeling methodology that captures the relevant dynamics of cyber attacks on PCN for risk analysis. This article develops the NSRM in detail in the context of an illustrative example.

An adaptive wavelet-network model for forecasting daily total solar-radiation

International Nuclear Information System (INIS)

Mellit, A.; Benghanem, M.; Kalogirou, S.A.

2006-01-01

The combination of wavelet theory and neural networks has lead to the development of wavelet networks. Wavelet-networks are feed-forward networks using wavelets as activation functions. Wavelet-networks have been used successfully in various engineering applications such as classification, identification and control problems. In this paper, the use of adaptive wavelet-network architecture in finding a suitable forecasting model for predicting the daily total solar-radiation is investigated. Total solar-radiation is considered as the most important parameter in the performance prediction of renewable energy systems, particularly in sizing photovoltaic (PV) power systems. For this purpose, daily total solar-radiation data have been recorded during the period extending from 1981 to 2001, by a meteorological station in Algeria. The wavelet-network model has been trained by using either the 19 years of data or one year of the data. In both cases the total solar radiation data corresponding to year 2001 was used for testing the model. The network was trained to accept and handle a number of unusual cases. Results indicate that the model predicts daily total solar-radiation values with a good accuracy of approximately 97% and the mean absolute percentage error is not more than 6%. In addition, the performance of the model was compared with different neural network structures and classical models. Training algorithms for wavelet-networks require smaller numbers of iterations when compared with other neural networks. The model can be used to fill missing data in weather databases. Additionally, the proposed model can be generalized and used in different locations and for other weather data, such as sunshine duration and ambient temperature. Finally, an application using the model for sizing a PV-power system is presented in order to confirm the validity of this model

Advances in dynamic network modeling in complex transportation systems

CERN Document Server

Ukkusuri, Satish V

2013-01-01

This book focuses on the latest in dynamic network modeling, including route guidance and traffic control in transportation systems and other complex infrastructure networks. Covers dynamic traffic assignment, flow modeling, mobile sensor deployment and more.

Transport energy demand modeling of South Korea using artificial neural network

International Nuclear Information System (INIS)

Geem, Zong Woo

2011-01-01

Artificial neural network models were developed to forecast South Korea's transport energy demand. Various independent variables, such as GDP, population, oil price, number of vehicle registrations, and passenger transport amount, were considered and several good models (Model 1 with GDP, population, and passenger transport amount; Model 2 with GDP, number of vehicle registrations, and passenger transport amount; and Model 3 with oil price, number of vehicle registrations, and passenger transport amount) were selected by comparing with multiple linear regression models. Although certain regression models obtained better R-squared values than neural network models, this does not guarantee the fact that the former is better than the latter because root mean squared errors of the former were much inferior to those of the latter. Also, certain regression model had structural weakness based on P-value. Instead, neural network models produced more robust results. Forecasted results using the neural network models show that South Korea will consume around 37 MTOE of transport energy in 2025. - Highlights: → Transport energy demand of South Korea was forecasted using artificial neural network. → Various variables (GDP, population, oil price, number of registrations, etc.) were considered. → Results of artificial neural network were compared with those of multiple linear regression.

Hybrid modeling and empirical analysis of automobile supply chain network

Science.gov (United States)

Sun, Jun-yan; Tang, Jian-ming; Fu, Wei-ping; Wu, Bing-ying

2017-05-01

Based on the connection mechanism of nodes which automatically select upstream and downstream agents, a simulation model for dynamic evolutionary process of consumer-driven automobile supply chain is established by integrating ABM and discrete modeling in the GIS-based map. Firstly, the rationality is proved by analyzing the consistency of sales and changes in various agent parameters between the simulation model and a real automobile supply chain. Second, through complex network theory, hierarchical structures of the model and relationships of networks at different levels are analyzed to calculate various characteristic parameters such as mean distance, mean clustering coefficients, and degree distributions. By doing so, it verifies that the model is a typical scale-free network and small-world network. Finally, the motion law of this model is analyzed from the perspective of complex self-adaptive systems. The chaotic state of the simulation system is verified, which suggests that this system has typical nonlinear characteristics. This model not only macroscopically illustrates the dynamic evolution of complex networks of automobile supply chain but also microcosmically reflects the business process of each agent. Moreover, the model construction and simulation of the system by means of combining CAS theory and complex networks supplies a novel method for supply chain analysis, as well as theory bases and experience for supply chain analysis of auto companies.

Systems approach to modeling the Token Bucket algorithm in computer networks

Directory of Open Access Journals (Sweden)

Ahmed N. U.

2002-01-01

Full Text Available In this paper, we construct a new dynamic model for the Token Bucket (TB algorithm used in computer networks and use systems approach for its analysis. This model is then augmented by adding a dynamic model for a multiplexor at an access node where the TB exercises a policing function. In the model, traffic policing, multiplexing and network utilization are formally defined. Based on the model, we study such issues as (quality of service QoS, traffic sizing and network dimensioning. Also we propose an algorithm using feedback control to improve QoS and network utilization. Applying MPEG video traces as the input traffic to the model, we verify the usefulness and effectiveness of our model.

The hippocampal network model: A transdiagnostic metaconnectomic approach

Directory of Open Access Journals (Sweden)

Eithan Kotkowski

Full Text Available Purpose: The hippocampus plays a central role in cognitive and affective processes and is commonly implicated in neurodegenerative diseases. Our study aimed to identify and describe a hippocampal network model (HNM using trans-diagnostic MRI data from the BrainMap® database. We used meta-analysis to test the network degeneration hypothesis (NDH (Seeley et al., 2009 by identifying structural and functional covariance in this hippocampal network. Methods: To generate our network model, we used BrainMap's VBM database to perform a region-to-whole-brain (RtWB meta-analysis of 269 VBM experiments from 165 published studies across a range of 38 psychiatric and neurological diseases reporting hippocampal gray matter density alterations. This step identified 11 significant gray matter foci, or nodes. We subsequently used meta-analytic connectivity modeling (MACM to define edges of structural covariance between nodes from VBM data as well as functional covariance using the functional task-activation database, also from BrainMap. Finally, we applied a correlation analysis using Pearson's r to assess the similarities and differences between the structural and functional covariance models. Key findings: Our hippocampal RtWB meta-analysis reported consistent and significant structural covariance in 11 key regions. The subsequent structural and functional MACMs showed a strong correlation between HNM nodes with a significant structural-functional covariance correlation of r = .377 (p = .000049. Significance: This novel method of studying network covariance using VBM and functional meta-analytic techniques allows for the identification of generalizable patterns of functional and structural abnormalities pertaining to the hippocampus. In accordance with the NDH, this framework could have major implications in studying and predicting spatial disease patterns using network-based assays. Keywords: Anatomic likelihood estimation, ALE, BrainMap, Functional

An evolving network model with modular growth

International Nuclear Information System (INIS)

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

2012-01-01

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

Probabilistic Models and Generative Neural Networks: Towards an Unified Framework for Modeling Normal and Impaired Neurocognitive Functions.

Science.gov (United States)

Testolin, Alberto; Zorzi, Marco

2016-01-01

Connectionist models can be characterized within the more general framework of probabilistic graphical models, which allow to efficiently describe complex statistical distributions involving a large number of interacting variables. This integration allows building more realistic computational models of cognitive functions, which more faithfully reflect the underlying neural mechanisms at the same time providing a useful bridge to higher-level descriptions in terms of Bayesian computations. Here we discuss a powerful class of graphical models that can be implemented as stochastic, generative neural networks. These models overcome many limitations associated with classic connectionist models, for example by exploiting unsupervised learning in hierarchical architectures (deep networks) and by taking into account top-down, predictive processing supported by feedback loops. We review some recent cognitive models based on generative networks, and we point out promising research directions to investigate neuropsychological disorders within this approach. Though further efforts are required in order to fill the gap between structured Bayesian models and more realistic, biophysical models of neuronal dynamics, we argue that generative neural networks have the potential to bridge these levels of analysis, thereby improving our understanding of the neural bases of cognition and of pathologies caused by brain damage.

Dynamic Pathloss Model for Place and Time Itinerant Networks

DEFF Research Database (Denmark)

Kumar, Ambuj; Mihovska, Albena; Prasad, Ramjee

2018-01-01

that are essentially static. Therefore, once the signal level drops beyond the predicted values due to any variance in the environmental conditions, very crowded areas may not be catered well enough by the deployed network that had been designed with the static path loss model. This paper proposes an approach......t Future mobile communication networks are expected to be more intelligent and proactive based on new capabilities that increase agility and performance. However, for any successful mobile network service, the dexterity in network deployment is a key factor. The efficiency of the network planning...... depends on how congruent the chosen path loss model and real propagation are. Various path loss models have been developed that predict the signal propagation in various morphological and climatic environments; however they consider only those physical parameters of the network environment...

Spinal Cord Injury Model System Information Network

Science.gov (United States)

... the UAB-SCIMS More The UAB-SCIMS Information Network The University of Alabama at Birmingham Spinal Cord Injury Model System (UAB-SCIMS) maintains this Information Network as a resource to promote knowledge in the ...

The Channel Network model and field applications

International Nuclear Information System (INIS)

Khademi, B.; Moreno, L.; Neretnieks, I.

1999-01-01

The Channel Network model describes the fluid flow and solute transport in fractured media. The model is based on field observations, which indicate that flow and transport take place in a three-dimensional network of connected channels. The channels are generated in the model from observed stochastic distributions and solute transport is modeled taking into account advection and rock interactions, such as matrix diffusion and sorption within the rock. The most important site-specific data for the Channel Network model are the conductance distribution of the channels and the flow-wetted surface. The latter is the surface area of the rock in contact with the flowing water. These parameters may be estimated from hydraulic measurements. For the Aespoe site, several borehole data sets are available, where a packer distance of 3 meters was used. Numerical experiments were performed in order to study the uncertainties in the determination of the flow-wetted surface and conductance distribution. Synthetic data were generated along a borehole and hydraulic tests with different packer distances were simulated. The model has previously been used to study the Long-term Pumping and Tracer Test (LPT2) carried out in the Aespoe Hard Rock Laboratory (HRL) in Sweden, where the distance travelled by the tracers was of the order hundreds of meters. Recently, the model has been used to simulate the tracer tests performed in the TRUE experiment at HRL, with travel distance of the order of tens of meters. Several tracer tests with non-sorbing and sorbing species have been performed

A Mathematical Model to Improve the Performance of Logistics Network

Directory of Open Access Journals (Sweden)

Muhammad Izman Herdiansyah

2012-01-01

Full Text Available The role of logistics nowadays is expanding from just providing transportation and warehousing to offering total integrated logistics. To remain competitive in the global market environment, business enterprises need to improve their logistics operations performance. The improvement will be achieved when we can provide a comprehensive analysis and optimize its network performances. In this paper, a mixed integer linier model for optimizing logistics network performance is developed. It provides a single-product multi-period multi-facilities model, as well as the multi-product concept. The problem is modeled in form of a network flow problem with the main objective to minimize total logistics cost. The problem can be solved using commercial linear programming package like CPLEX or LINDO. Even in small case, the solver in Excel may also be used to solve such model.Keywords: logistics network, integrated model, mathematical programming, network optimization

Fracture network modeling and GoldSim simulation support

International Nuclear Information System (INIS)

Sugita, Kenichiro; Dershowitz, William

2004-01-01

During Heisei-15, Golder Associates provided support for JNC Tokai through discrete fracture network data analysis and simulation of the MIU Underground Rock Laboratory, participation in Task 6 of the Aespoe Task Force on Modelling of Groundwater Flow and Transport, and development of methodologies for analysis of repository site characterization strategies and safety assessment. MIU Underground Rock Laboratory support during H-15 involved development of new discrete fracture network (DFN) models for the MIU Shoba-sama Site, in the region of shaft development. Golder developed three DFN models for the site using discrete fracture network, equivalent porous medium (EPM), and nested DFN/EPM approaches. Each of these models were compared based upon criteria established for the multiple modeling project (MMP). Golder supported JNC participation in Task 6AB, 6D and 6E of the Aespoe Task Force on Modelling of Groundwater Flow and Transport during H-15. For Task 6AB, Golder implemented an updated microstructural model in GoldSim, and used this updated model to simulate the propagation of uncertainty from experimental to safety assessment time scales, for 5 m scale transport path lengths. Task 6D and 6E compared safety assessment (PA) and experimental time scale simulations in a 200 m scale discrete fracture network. For Task 6D, Golder implemented a DFN model using FracMan/PA Works, and determined the sensitivity of solute transport to a range of material property and geometric assumptions. For Task 6E, Golder carried out demonstration FracMan/PA Works transport calculations at a 1 million year time scale, to ensure that task specifications are realistic. The majority of work for Task 6E will be carried out during H-16. During H-15, Golder supported JNC's Total System Performance Assessment (TSPO) strategy by developing technologies for the analysis of precipitant concentration. These approaches were based on the GoldSim precipitant data management features, and were

Modelling, Synthesis, and Configuration of Networks-on-Chips

DEFF Research Database (Denmark)

Stuart, Matthias Bo

This thesis presents three contributions in two different areas of network-on-chip and system-on-chip research: Application modelling and identifying and solving different optimization problems related to two specific network-on-chip architectures. The contribution related to application modelling...... is an analytical method for deriving the worst-case traffic pattern caused by an application and the cache-coherence protocol in a cache-coherent shared-memory system. The contributions related to network-on-chip optimization problems consist of two parts: The development and evaluation of six heuristics...... for solving the network synthesis problem in the MANGO network-on-chip, and the identification and formalization of the ReNoC configuration problem together with three heuristics for solving it....

Image/video understanding systems based on network-symbolic models

Science.gov (United States)

Kuvich, Gary

2004-03-01

Vision is a part of a larger information system that converts visual information into knowledge structures. These structures drive vision process, resolve ambiguity and uncertainty via feedback projections, and provide image understanding that is an interpretation of visual information in terms of such knowledge models. Computer simulation models are built on the basis of graphs/networks. The ability of human brain to emulate similar graph/network models is found. Symbols, predicates and grammars naturally emerge in such networks, and logic is simply a way of restructuring such models. Brain analyzes an image as a graph-type relational structure created via multilevel hierarchical compression of visual information. Primary areas provide active fusion of image features on a spatial grid-like structure, where nodes are cortical columns. Spatial logic and topology naturally present in such structures. Mid-level vision processes like perceptual grouping, separation of figure from ground, are special kinds of network transformations. They convert primary image structure into the set of more abstract ones, which represent objects and visual scene, making them easy for analysis by higher-level knowledge structures. Higher-level vision phenomena are results of such analysis. Composition of network-symbolic models combines learning, classification, and analogy together with higher-level model-based reasoning into a single framework, and it works similar to frames and agents. Computational intelligence methods transform images into model-based knowledge representation. Based on such principles, an Image/Video Understanding system can convert images into the knowledge models, and resolve uncertainty and ambiguity. This allows creating intelligent computer vision systems for design and manufacturing.

Performance modeling of network data services

Energy Technology Data Exchange (ETDEWEB)

Haynes, R.A.; Pierson, L.G.

1997-01-01

Networks at major computational organizations are becoming increasingly complex. The introduction of large massively parallel computers and supercomputers with gigabyte memories are requiring greater and greater bandwidth for network data transfers to widely dispersed clients. For networks to provide adequate data transfer services to high performance computers and remote users connected to them, the networking components must be optimized from a combination of internal and external performance criteria. This paper describes research done at Sandia National Laboratories to model network data services and to visualize the flow of data from source to sink when using the data services.

Super capacitor modeling with artificial neural network (ANN)

Energy Technology Data Exchange (ETDEWEB)

Marie-Francoise, J.N.; Gualous, H.; Berthon, A. [Universite de Franche-Comte, Lab. en Electronique, Electrotechnique et Systemes (L2ES), UTBM, INRETS (LRE T31) 90 - Belfort (France)

2004-07-01

This paper presents super-capacitors modeling using Artificial Neural Network (ANN). The principle consists on a black box nonlinear multiple inputs single output (MISO) model. The system inputs are temperature and current, the output is the super-capacitor voltage. The learning and the validation of the ANN model from experimental charge and discharge of super-capacitor establish the relationship between inputs and output. The learning and the validation of the ANN model use experimental results of 2700 F, 3700 F and a super-capacitor pack. Once the network is trained, the ANN model can predict the super-capacitor behaviour with temperature variations. The update parameters of the ANN model are performed thanks to Levenberg-Marquardt method in order to minimize the error between the output of the system and the predicted output. The obtained results with the ANN model of super-capacitor and experimental ones are in good agreement. (authors)

Artificial Neural Network Model for Predicting Compressive

Directory of Open Access Journals (Sweden)

Salim T. Yousif

2013-05-01

Full Text Available   Compressive strength of concrete is a commonly used criterion in evaluating concrete. Although testing of the compressive strength of concrete specimens is done routinely, it is performed on the 28th day after concrete placement. Therefore, strength estimation of concrete at early time is highly desirable. This study presents the effort in applying neural network-based system identification techniques to predict the compressive strength of concrete based on concrete mix proportions, maximum aggregate size (MAS, and slump of fresh concrete. Back-propagation neural networks model is successively developed, trained, and tested using actual data sets of concrete mix proportions gathered from literature.    The test of the model by un-used data within the range of input parameters shows that the maximum absolute error for model is about 20% and 88% of the output results has absolute errors less than 10%. The parametric study shows that water/cement ratio (w/c is the most significant factor  affecting the output of the model.     The results showed that neural networks has strong potential as a feasible tool for predicting compressive strength of concrete.

Extending a configuration model to find communities in complex networks

International Nuclear Information System (INIS)

Jin, Di; Hu, Qinghua; He, Dongxiao; Yang, Bo; Baquero, Carlos

2013-01-01

Discovery of communities in complex networks is a fundamental data analysis task in various domains. Generative models are a promising class of techniques for identifying modular properties from networks, which has been actively discussed recently. However, most of them cannot preserve the degree sequence of networks, which will distort the community detection results. Rather than using a blockmodel as most current works do, here we generalize a configuration model, namely, a null model of modularity, to solve this problem. Towards decomposing and combining sub-graphs according to the soft community memberships, our model incorporates the ability to describe community structures, something the original model does not have. Also, it has the property, as with the original model, that it fixes the expected degree sequence to be the same as that of the observed network. We combine both the community property and degree sequence preserving into a single unified model, which gives better community results compared with other models. Thereafter, we learn the model using a technique of nonnegative matrix factorization and determine the number of communities by applying consensus clustering. We test this approach both on synthetic benchmarks and on real-world networks, and compare it with two similar methods. The experimental results demonstrate the superior performance of our method over competing methods in detecting both disjoint and overlapping communities. (paper)

Modelling students' knowledge organisation: Genealogical conceptual networks

Science.gov (United States)

Koponen, Ismo T.; Nousiainen, Maija

2018-04-01

Learning scientific knowledge is largely based on understanding what are its key concepts and how they are related. The relational structure of concepts also affects how concepts are introduced in teaching scientific knowledge. We model here how students organise their knowledge when they represent their understanding of how physics concepts are related. The model is based on assumptions that students use simple basic linking-motifs in introducing new concepts and mostly relate them to concepts that were introduced a few steps earlier, i.e. following a genealogical ordering. The resulting genealogical networks have relatively high local clustering coefficients of nodes but otherwise resemble networks obtained with an identical degree distribution of nodes but with random linking between them (i.e. the configuration-model). However, a few key nodes having a special structural role emerge and these nodes have a higher than average communicability betweenness centralities. These features agree with the empirically found properties of students' concept networks.

Modelling Users` Trust in Online Social Networks

Directory of Open Access Journals (Sweden)

Iacob Cătoiu

2014-02-01

Full Text Available Previous studies (McKnight, Lankton and Tripp, 2011; Liao, Lui and Chen, 2011 have shown the crucial role of trust when choosing to disclose sensitive information online. This is the case of online social networks users, who must disclose a certain amount of personal data in order to gain access to these online services. Taking into account privacy calculus model and the risk/benefit ratio, we propose a model of users’ trust in online social networks with four variables. We have adapted metrics for the purpose of our study and we have assessed their reliability and validity. We use a Partial Least Squares (PLS based structural equation modelling analysis, which validated all our initial assumptions, indicating that our three predictors (privacy concerns, perceived benefits and perceived risks explain 48% of the variation of users’ trust in online social networks, the resulting variable of our study. We also discuss the implications and further research opportunities of our study.

An information spreading model based on online social networks

Science.gov (United States)

Wang, Tao; He, Juanjuan; Wang, Xiaoxia

2018-01-01

Online social platforms are very popular in recent years. In addition to spreading information, users could review or collect information on online social platforms. According to the information spreading rules of online social network, a new information spreading model, namely IRCSS model, is proposed in this paper. It includes sharing mechanism, reviewing mechanism, collecting mechanism and stifling mechanism. Mean-field equations are derived to describe the dynamics of the IRCSS model. Moreover, the steady states of reviewers, collectors and stiflers and the effects of parameters on the peak values of reviewers, collectors and sharers are analyzed. Finally, numerical simulations are performed on different networks. Results show that collecting mechanism and reviewing mechanism, as well as the connectivity of the network, make information travel wider and faster, and compared to WS network and ER network, the speed of reviewing, sharing and collecting information is fastest on BA network.

Disruption of River Networks in Nature and Models

Science.gov (United States)

Perron, J. T.; Black, B. A.; Stokes, M.; McCoy, S. W.; Goldberg, S. L.

2017-12-01

Many natural systems display especially informative behavior as they respond to perturbations. Landscapes are no exception. For example, longitudinal elevation profiles of rivers responding to changes in uplift rate can reveal differences among erosional mechanisms that are obscured while the profiles are in equilibrium. The responses of erosional river networks to perturbations, including disruption of their network structure by diversion, truncation, resurfacing, or river capture, may be equally revealing. In this presentation, we draw attention to features of disrupted erosional river networks that a general model of landscape evolution should be able to reproduce, including the consequences of different styles of planetary tectonics and the response to heterogeneous bedrock structure and deformation. A comparison of global drainage directions with long-wavelength topography on Earth, Mars, and Saturn's moon Titan reveals the extent to which persistent and relatively rapid crustal deformation has disrupted river networks on Earth. Motivated by this example and others, we ask whether current models of river network evolution adequately capture the disruption of river networks by tectonic, lithologic, or climatic perturbations. In some cases the answer appears to be no, and we suggest some processes that models may be missing.

Mathematics of epidemics on networks from exact to approximate models

CERN Document Server

Kiss, István Z; Simon, Péter L

2017-01-01

This textbook provides an exciting new addition to the area of network science featuring a stronger and more methodical link of models to their mathematical origin and explains how these relate to each other with special focus on epidemic spread on networks. The content of the book is at the interface of graph theory, stochastic processes and dynamical systems. The authors set out to make a significant contribution to closing the gap between model development and the supporting mathematics. This is done by: Summarising and presenting the state-of-the-art in modeling epidemics on networks with results and readily usable models signposted throughout the book; Presenting different mathematical approaches to formulate exact and solvable models; Identifying the concrete links between approximate models and their rigorous mathematical representation; Presenting a model hierarchy and clearly highlighting the links between model assumptions and model complexity; Providing a reference source for advanced undergraduate...

A network model for Ebola spreading.

Science.gov (United States)

Rizzo, Alessandro; Pedalino, Biagio; Porfiri, Maurizio

2016-04-07

The availability of accurate models for the spreading of infectious diseases has opened a new era in management and containment of epidemics. Models are extensively used to plan for and execute vaccination campaigns, to evaluate the risk of international spreadings and the feasibility of travel bans, and to inform prophylaxis campaigns. Even when no specific therapeutical protocol is available, as for the Ebola Virus Disease (EVD), models of epidemic spreading can provide useful insight to steer interventions in the field and to forecast the trend of the epidemic. Here, we propose a novel mathematical model to describe EVD spreading based on activity driven networks (ADNs). Our approach overcomes the simplifying assumption of homogeneous mixing, which is central to most of the mathematically tractable models of EVD spreading. In our ADN-based model, each individual is not bound to contact every other, and its network of contacts varies in time as a function of an activity potential. Our model contemplates the possibility of non-ideal and time-varying intervention policies, which are critical to accurately describe EVD spreading in afflicted countries. The model is calibrated from field data of the 2014 April-to-December spreading in Liberia. We use the model as a predictive tool, to emulate the dynamics of EVD in Liberia and offer a one-year projection, until December 2015. Our predictions agree with the current vision expressed by professionals in the field, who consider EVD in Liberia at its final stage. The model is also used to perform a what-if analysis to assess the efficacy of timely intervention policies. In particular, we show that an earlier application of the same intervention policy would have greatly reduced the number of EVD cases, the duration of the outbreak, and the infrastructures needed for the implementation of the intervention. Copyright © 2016 Elsevier Ltd. All rights reserved.

Neural network modeling of nonlinear systems based on Volterra series extension of a linear model

Science.gov (United States)

Soloway, Donald I.; Bialasiewicz, Jan T.

1992-01-01

A Volterra series approach was applied to the identification of nonlinear systems which are described by a neural network model. A procedure is outlined by which a mathematical model can be developed from experimental data obtained from the network structure. Applications of the results to the control of robotic systems are discussed.

Randomizing growing networks with a time-respecting null model

Science.gov (United States)

Ren, Zhuo-Ming; Mariani, Manuel Sebastian; Zhang, Yi-Cheng; Medo, Matúš

2018-05-01

Complex networks are often used to represent systems that are not static but grow with time: People make new friendships, new papers are published and refer to the existing ones, and so forth. To assess the statistical significance of measurements made on such networks, we propose a randomization methodology—a time-respecting null model—that preserves both the network's degree sequence and the time evolution of individual nodes' degree values. By preserving the temporal linking patterns of the analyzed system, the proposed model is able to factor out the effect of the system's temporal patterns on its structure. We apply the model to the citation network of Physical Review scholarly papers and the citation network of US movies. The model reveals that the two data sets are strikingly different with respect to their degree-degree correlations, and we discuss the important implications of this finding on the information provided by paradigmatic node centrality metrics such as indegree and Google's PageRank. The randomization methodology proposed here can be used to assess the significance of any structural property in growing networks, which could bring new insights into the problems where null models play a critical role, such as the detection of communities and network motifs.

Energy efficiency optimisation for distillation column using artificial neural network models

International Nuclear Information System (INIS)

Osuolale, Funmilayo N.; Zhang, Jie

2016-01-01

This paper presents a neural network based strategy for the modelling and optimisation of energy efficiency in distillation columns incorporating the second law of thermodynamics. Real-time optimisation of distillation columns based on mechanistic models is often infeasible due to the effort in model development and the large computation effort associated with mechanistic model computation. This issue can be addressed by using neural network models which can be quickly developed from process operation data. The computation time in neural network model evaluation is very short making them ideal for real-time optimisation. Bootstrap aggregated neural networks are used in this study for enhanced model accuracy and reliability. Aspen HYSYS is used for the simulation of the distillation systems. Neural network models for exergy efficiency and product compositions are developed from simulated process operation data and are used to maximise exergy efficiency while satisfying products qualities constraints. Applications to binary systems of methanol-water and benzene-toluene separations culminate in a reduction of utility consumption of 8.2% and 28.2% respectively. Application to multi-component separation columns also demonstrate the effectiveness of the proposed method with a 32.4% improvement in the exergy efficiency. - Highlights: • Neural networks can accurately model exergy efficiency in distillation columns. • Bootstrap aggregated neural network offers improved model prediction accuracy. • Improved exergy efficiency is obtained through model based optimisation. • Reductions of utility consumption by 8.2% and 28.2% were achieved for binary systems. • The exergy efficiency for multi-component distillation is increased by 32.4%.

Modeling documents with Generative Adversarial Networks

OpenAIRE

Glover, John

2016-01-01

This paper describes a method for using Generative Adversarial Networks to learn distributed representations of natural language documents. We propose a model that is based on the recently proposed Energy-Based GAN, but instead uses a Denoising Autoencoder as the discriminator network. Document representations are extracted from the hidden layer of the discriminator and evaluated both quantitatively and qualitatively.

DAILY RAINFALL-RUNOFF MODELLING BY NEURAL NETWORKS ...

African Journals Online (AJOL)

K. Benzineb, M. Remaoun

2016-09-01

Sep 1, 2016 ... The hydrologic behaviour modelling of w. Journal of ... i Ouahrane's basin from rainfall-runoff relation which is non-linea networks ... will allow checking efficiency of formal neural networks for flows simulation in semi-arid zone.

SCYNet. Testing supersymmetric models at the LHC with neural networks

Energy Technology Data Exchange (ETDEWEB)

Bechtle, Philip; Belkner, Sebastian; Hamer, Matthias [Universitaet Bonn, Bonn (Germany); Dercks, Daniel [Universitaet Hamburg, Hamburg (Germany); Keller, Tim; Kraemer, Michael; Sarrazin, Bjoern; Schuette-Engel, Jan; Tattersall, Jamie [RWTH Aachen University, Institute for Theoretical Particle Physics and Cosmology, Aachen (Germany)

2017-10-15

SCYNet (SUSY Calculating Yield Net) is a tool for testing supersymmetric models against LHC data. It uses neural network regression for a fast evaluation of the profile likelihood ratio. Two neural network approaches have been developed: one network has been trained using the parameters of the 11-dimensional phenomenological Minimal Supersymmetric Standard Model (pMSSM-11) as an input and evaluates the corresponding profile likelihood ratio within milliseconds. It can thus be used in global pMSSM-11 fits without time penalty. In the second approach, the neural network has been trained using model-independent signature-related objects, such as energies and particle multiplicities, which were estimated from the parameters of a given new physics model. (orig.)

An Improved Walk Model for Train Movement on Railway Network

International Nuclear Information System (INIS)

Li Keping; Mao Bohua; Gao Ziyou

2009-01-01

In this paper, we propose an improved walk model for simulating the train movement on railway network. In the proposed method, walkers represent trains. The improved walk model is a kind of the network-based simulation analysis model. Using some management rules for walker movement, walker can dynamically determine its departure and arrival times at stations. In order to test the proposed method, we simulate the train movement on a part of railway network. The numerical simulation and analytical results demonstrate that the improved model is an effective tool for simulating the train movement on railway network. Moreover, it can well capture the characteristic behaviors of train scheduling in railway traffic. (general)

Stylized facts in social networks: Community-based static modeling

Science.gov (United States)

Jo, Hang-Hyun; Murase, Yohsuke; Török, János; Kertész, János; Kaski, Kimmo

2018-06-01

The past analyses of datasets of social networks have enabled us to make empirical findings of a number of aspects of human society, which are commonly featured as stylized facts of social networks, such as broad distributions of network quantities, existence of communities, assortative mixing, and intensity-topology correlations. Since the understanding of the structure of these complex social networks is far from complete, for deeper insight into human society more comprehensive datasets and modeling of the stylized facts are needed. Although the existing dynamical and static models can generate some stylized facts, here we take an alternative approach by devising a community-based static model with heterogeneous community sizes and larger communities having smaller link density and weight. With these few assumptions we are able to generate realistic social networks that show most stylized facts for a wide range of parameters, as demonstrated numerically and analytically. Since our community-based static model is simple to implement and easily scalable, it can be used as a reference system, benchmark, or testbed for further applications.

Neural network modeling for near wall turbulent flow

International Nuclear Information System (INIS)

Milano, Michele; Koumoutsakos, Petros

2002-01-01

A neural network methodology is developed in order to reconstruct the near wall field in a turbulent flow by exploiting flow fields provided by direct numerical simulations. The results obtained from the neural network methodology are compared with the results obtained from prediction and reconstruction using proper orthogonal decomposition (POD). Using the property that the POD is equivalent to a specific linear neural network, a nonlinear neural network extension is presented. It is shown that for a relatively small additional computational cost nonlinear neural networks provide us with improved reconstruction and prediction capabilities for the near wall velocity fields. Based on these results advantages and drawbacks of both approaches are discussed with an outlook toward the development of near wall models for turbulence modeling and control

Modeling Markov Switching ARMA-GARCH Neural Networks Models and an Application to Forecasting Stock Returns

Directory of Open Access Journals (Sweden)

Melike Bildirici

2014-01-01

Full Text Available The study has two aims. The first aim is to propose a family of nonlinear GARCH models that incorporate fractional integration and asymmetric power properties to MS-GARCH processes. The second purpose of the study is to augment the MS-GARCH type models with artificial neural networks to benefit from the universal approximation properties to achieve improved forecasting accuracy. Therefore, the proposed Markov-switching MS-ARMA-FIGARCH, APGARCH, and FIAPGARCH processes are further augmented with MLP, Recurrent NN, and Hybrid NN type neural networks. The MS-ARMA-GARCH family and MS-ARMA-GARCH-NN family are utilized for modeling the daily stock returns in an emerging market, the Istanbul Stock Index (ISE100. Forecast accuracy is evaluated in terms of MAE, MSE, and RMSE error criteria and Diebold-Mariano equal forecast accuracy tests. The results suggest that the fractionally integrated and asymmetric power counterparts of Gray’s MS-GARCH model provided promising results, while the best results are obtained for their neural network based counterparts. Further, among the models analyzed, the models based on the Hybrid-MLP and Recurrent-NN, the MS-ARMA-FIAPGARCH-HybridMLP, and MS-ARMA-FIAPGARCH-RNN provided the best forecast performances over the baseline single regime GARCH models and further, over the Gray’s MS-GARCH model. Therefore, the models are promising for various economic applications.

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

Science.gov (United States)

2015-03-03

based whole-cell models of E. coli [6]. Conversely , highly abstracted kinetic frameworks, such as the cybernetic framework, represented a paradigm shift...metabolic objective function has been the optimization of biomass formation [18], although other metabolic objectives have also been estimated [19...experimental data. Toward these questions, we explored five hypothetical cell-free networks. Each network shared the same enzymatic connectivity, but

Multivariate Analysis and Modeling of Sediment Pollution Using Neural Network Models and Geostatistics

Science.gov (United States)

Golay, Jean; Kanevski, Mikhaïl

2013-04-01

The present research deals with the exploration and modeling of a complex dataset of 200 measurement points of sediment pollution by heavy metals in Lake Geneva. The fundamental idea was to use multivariate Artificial Neural Networks (ANN) along with geostatistical models and tools in order to improve the accuracy and the interpretability of data modeling. The results obtained with ANN were compared to those of traditional geostatistical algorithms like ordinary (co)kriging and (co)kriging with an external drift. Exploratory data analysis highlighted a great variety of relationships (i.e. linear, non-linear, independence) between the 11 variables of the dataset (i.e. Cadmium, Mercury, Zinc, Copper, Titanium, Chromium, Vanadium and Nickel as well as the spatial coordinates of the measurement points and their depth). Then, exploratory spatial data analysis (i.e. anisotropic variography, local spatial correlations and moving window statistics) was carried out. It was shown that the different phenomena to be modeled were characterized by high spatial anisotropies, complex spatial correlation structures and heteroscedasticity. A feature selection procedure based on General Regression Neural Networks (GRNN) was also applied to create subsets of variables enabling to improve the predictions during the modeling phase. The basic modeling was conducted using a Multilayer Perceptron (MLP) which is a workhorse of ANN. MLP models are robust and highly flexible tools which can incorporate in a nonlinear manner different kind of high-dimensional information. In the present research, the input layer was made of either two (spatial coordinates) or three neurons (when depth as auxiliary information could possibly capture an underlying trend) and the output layer was composed of one (univariate MLP) to eight neurons corresponding to the heavy metals of the dataset (multivariate MLP). MLP models with three input neurons can be referred to as Artificial Neural Networks with EXternal

Different Epidemic Models on Complex Networks

International Nuclear Information System (INIS)

Zhang Haifeng; Small, Michael; Fu Xinchu

2009-01-01

Models for diseases spreading are not just limited to SIS or SIR. For instance, for the spreading of AIDS/HIV, the susceptible individuals can be classified into different cases according to their immunity, and similarly, the infected individuals can be sorted into different classes according to their infectivity. Moreover, some diseases may develop through several stages. Many authors have shown that the individuals' relation can be viewed as a complex network. So in this paper, in order to better explain the dynamical behavior of epidemics, we consider different epidemic models on complex networks, and obtain the epidemic threshold for each case. Finally, we present numerical simulations for each case to verify our results.

Generalized network modeling of capillary-dominated two-phase flow.

Science.gov (United States)

Raeini, Ali Q; Bijeljic, Branko; Blunt, Martin J

2018-02-01

We present a generalized network model for simulating capillary-dominated two-phase flow through porous media at the pore scale. Three-dimensional images of the pore space are discretized using a generalized network-described in a companion paper [A. Q. Raeini, B. Bijeljic, and M. J. Blunt, Phys. Rev. E 96, 013312 (2017)2470-004510.1103/PhysRevE.96.013312]-which comprises pores that are divided into smaller elements called half-throats and subsequently into corners. Half-throats define the connectivity of the network at the coarsest level, connecting each pore to half-throats of its neighboring pores from their narrower ends, while corners define the connectivity of pore crevices. The corners are discretized at different levels for accurate calculation of entry pressures, fluid volumes, and flow conductivities that are obtained using direct simulation of flow on the underlying image. This paper discusses the two-phase flow model that is used to compute the averaged flow properties of the generalized network, including relative permeability and capillary pressure. We validate the model using direct finite-volume two-phase flow simulations on synthetic geometries, and then present a comparison of the model predictions with a conventional pore-network model and experimental measurements of relative permeability in the literature.

Sparse Power-Law Network Model for Reliable Statistical Predictions Based on Sampled Data

Directory of Open Access Journals (Sweden)

Alexander P. Kartun-Giles

2018-04-01

Full Text Available A projective network model is a model that enables predictions to be made based on a subsample of the network data, with the predictions remaining unchanged if a larger sample is taken into consideration. An exchangeable model is a model that does not depend on the order in which nodes are sampled. Despite a large variety of non-equilibrium (growing and equilibrium (static sparse complex network models that are widely used in network science, how to reconcile sparseness (constant average degree with the desired statistical properties of projectivity and exchangeability is currently an outstanding scientific problem. Here we propose a network process with hidden variables which is projective and can generate sparse power-law networks. Despite the model not being exchangeable, it can be closely related to exchangeable uncorrelated networks as indicated by its information theory characterization and its network entropy. The use of the proposed network process as a null model is here tested on real data, indicating that the model offers a promising avenue for statistical network modelling.

Design and realization of a network security model

OpenAIRE

WANG, Jiahai; HAN, Fangxi; Tang, Zheng; TAMURA, Hiroki; Ishii, Masahiro

2002-01-01

The security of information is a key problem in the development of network technology. The basic requirements of security of information clearly include confidentiality, integrity, authentication and non-repudiation. This paper proposes a network security model that is composed of security system, security connection and communication, and key management. The model carries out encrypting, decrypting, signature and ensures confidentiality, integrity, authentication and non-repudiation. Finally...

The influence of digital elevation model resolution on overland flow networks for modelling urban pluvial flooding.

Science.gov (United States)

Leitão, J P; Boonya-Aroonnet, S; Prodanović, D; Maksimović, C

2009-01-01

This paper presents the developments towards the next generation of overland flow modelling of urban pluvial flooding. Using a detailed analysis of the Digital Elevation Model (DEM) the developed GIS tools can automatically generate surface drainage networks which consist of temporary ponds (floodable areas) and flow paths and link them with the underground network through inlets. For different commercially-available Rainfall-Runoff simulation models, the tool will generate the overland flow network needed to model the surface runoff and pluvial flooding accurately. In this paper the emphasis is placed on a sensitivity analysis of ponds and preferential overland flow paths creation. Different DEMs for three areas were considered in order to compare the results obtained. The DEMs considered were generated using different acquisition techniques and hence represent terrain with varying levels of resolution and accuracy. The results show that DEMs can be used to generate surface flow networks reliably. As expected, the quality of the surface network generated is highly dependent on the quality and resolution of the DEMs and successful representation of buildings and streets.

Modeling of quasistatic magnetic hysteresis with feed-forward neural networks

International Nuclear Information System (INIS)

Makaveev, Dimitre; Dupre, Luc; De Wulf, Marc; Melkebeek, Jan

2001-01-01

A modeling technique for rate-independent (quasistatic) scalar magnetic hysteresis is presented, using neural networks. Based on the theory of dynamic systems and the wiping-out and congruency properties of the classical scalar Preisach hysteresis model, the choice of a feed-forward neural network model is motivated. The neural network input parameters at each time step are the corresponding magnetic field strength and memory state, thereby assuring accurate prediction of the change of magnetic induction. For rate-independent hysteresis, the current memory state can be determined by the last extreme magnetic field strength and induction values, kept in memory. The choice of a network training set is motivated and the performance of the network is illustrated for a test set not used during training. Very accurate prediction of both major and minor hysteresis loops is observed, proving that the neural network technique is suitable for hysteresis modeling. [copyright] 2001 American Institute of Physics

PageRank model of opinion formation on Ulam networks

Science.gov (United States)

Chakhmakhchyan, L.; Shepelyansky, D.

2013-12-01

We consider a PageRank model of opinion formation on Ulam networks, generated by the intermittency map and the typical Chirikov map. The Ulam networks generated by these maps have certain similarities with such scale-free networks as the World Wide Web (WWW), showing an algebraic decay of the PageRank probability. We find that the opinion formation process on Ulam networks has certain similarities but also distinct features comparing to the WWW. We attribute these distinctions to internal differences in network structure of the Ulam and WWW networks. We also analyze the process of opinion formation in the frame of generalized Sznajd model which protects opinion of small communities.

A small-world network model of facial emotion recognition.

Science.gov (United States)

Takehara, Takuma; Ochiai, Fumio; Suzuki, Naoto

2016-01-01

Various models have been proposed to increase understanding of the cognitive basis of facial emotions. Despite those efforts, interactions between facial emotions have received minimal attention. If collective behaviours relating to each facial emotion in the comprehensive cognitive system could be assumed, specific facial emotion relationship patterns might emerge. In this study, we demonstrate that the frameworks of complex networks can effectively capture those patterns. We generate 81 facial emotion images (6 prototypes and 75 morphs) and then ask participants to rate degrees of similarity in 3240 facial emotion pairs in a paired comparison task. A facial emotion network constructed on the basis of similarity clearly forms a small-world network, which features an extremely short average network distance and close connectivity. Further, even if two facial emotions have opposing valences, they are connected within only two steps. In addition, we show that intermediary morphs are crucial for maintaining full network integration, whereas prototypes are not at all important. These results suggest the existence of collective behaviours in the cognitive systems of facial emotions and also describe why people can efficiently recognize facial emotions in terms of information transmission and propagation. For comparison, we construct three simulated networks--one based on the categorical model, one based on the dimensional model, and one random network. The results reveal that small-world connectivity in facial emotion networks is apparently different from those networks, suggesting that a small-world network is the most suitable model for capturing the cognitive basis of facial emotions.

Social network models predict movement and connectivity in ecological landscapes

Science.gov (United States)

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

2011-01-01

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

Social network models predict movement and connectivity in ecological landscapes.

Science.gov (United States)

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

2011-11-29

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

Threshold model of cascades in empirical temporal networks

Science.gov (United States)

Karimi, Fariba; Holme, Petter

2013-08-01

Threshold models try to explain the consequences of social influence like the spread of fads and opinions. Along with models of epidemics, they constitute a major theoretical framework of social spreading processes. In threshold models on static networks, an individual changes her state if a certain fraction of her neighbors has done the same. When there are strong correlations in the temporal aspects of contact patterns, it is useful to represent the system as a temporal network. In such a system, not only contacts but also the time of the contacts are represented explicitly. In many cases, bursty temporal patterns slow down disease spreading. However, as we will see, this is not a universal truth for threshold models. In this work we propose an extension of Watts’s classic threshold model to temporal networks. We do this by assuming that an agent is influenced by contacts which lie a certain time into the past. I.e., the individuals are affected by contacts within a time window. In addition to thresholds in the fraction of contacts, we also investigate the number of contacts within the time window as a basis for influence. To elucidate the model’s behavior, we run the model on real and randomized empirical contact datasets.

Network modeling for reverse flows of end-of-life vehicles

International Nuclear Information System (INIS)

Ene, Seval; Öztürk, Nursel

2015-01-01

Highlights: • We developed a network model for reverse flows of end-of-life vehicles. • The model considers all recovery operations for end-of-life vehicles. • A scenario-based model is used for uncertainty to improve real case applications. • The model is adequate to real case applications for end-of-life vehicles recovery. • Considerable insights are gained from the model by sensitivity analyses. - Abstract: Product recovery operations are of critical importance for the automotive industry in complying with environmental regulations concerning end-of-life products management. Manufacturers must take responsibility for their products over the entire life cycle. In this context, there is a need for network design methods for effectively managing recovery operations and waste. The purpose of this study is to develop a mathematical programming model for managing reverse flows in end-of-life vehicles’ recovery network. A reverse flow is the collection of used products from consumers and the transportation of these products for the purpose of recycling, reuse or disposal. The proposed model includes all operations in a product recovery and waste management network for used vehicles and reuse for vehicle parts such as collection, disassembly, refurbishing, processing (shredding), recycling, disposal and reuse of vehicle parts. The scope of the network model is to determine the numbers and locations of facilities in the network and the material flows between these facilities. The results show the performance of the model and its applicability for use in the planning of recovery operations in the automotive industry. The main objective of recovery and waste management is to maximize revenue and minimize pollution in end-of-life product operations. This study shows that with an accurate model, these activities may provide economic benefits and incentives in addition to protecting the environment

Network modeling for reverse flows of end-of-life vehicles

Energy Technology Data Exchange (ETDEWEB)

Ene, Seval; Öztürk, Nursel

2015-04-15

Highlights: • We developed a network model for reverse flows of end-of-life vehicles. • The model considers all recovery operations for end-of-life vehicles. • A scenario-based model is used for uncertainty to improve real case applications. • The model is adequate to real case applications for end-of-life vehicles recovery. • Considerable insights are gained from the model by sensitivity analyses. - Abstract: Product recovery operations are of critical importance for the automotive industry in complying with environmental regulations concerning end-of-life products management. Manufacturers must take responsibility for their products over the entire life cycle. In this context, there is a need for network design methods for effectively managing recovery operations and waste. The purpose of this study is to develop a mathematical programming model for managing reverse flows in end-of-life vehicles’ recovery network. A reverse flow is the collection of used products from consumers and the transportation of these products for the purpose of recycling, reuse or disposal. The proposed model includes all operations in a product recovery and waste management network for used vehicles and reuse for vehicle parts such as collection, disassembly, refurbishing, processing (shredding), recycling, disposal and reuse of vehicle parts. The scope of the network model is to determine the numbers and locations of facilities in the network and the material flows between these facilities. The results show the performance of the model and its applicability for use in the planning of recovery operations in the automotive industry. The main objective of recovery and waste management is to maximize revenue and minimize pollution in end-of-life product operations. This study shows that with an accurate model, these activities may provide economic benefits and incentives in addition to protecting the environment.

Green Network Planning Model for Optical Backbones

DEFF Research Database (Denmark)

Gutierrez Lopez, Jose Manuel; Riaz, M. Tahir; Jensen, Michael

2010-01-01

on the environment in general. In network planning there are existing planning models focused on QoS provisioning, investment minimization or combinations of both and other parameters. But there is a lack of a model for designing green optical backbones. This paper presents novel ideas to be able to define......Communication networks are becoming more essential for our daily lives and critically important for industry and governments. The intense growth in the backbone traffic implies an increment of the power demands of the transmission systems. This power usage might have a significant negative effect...

Numerical Analysis of Modeling Based on Improved Elman Neural Network

Directory of Open Access Journals (Sweden)

Shao Jie

2014-01-01

Full Text Available A modeling based on the improved Elman neural network (IENN is proposed to analyze the nonlinear circuits with the memory effect. The hidden layer neurons are activated by a group of Chebyshev orthogonal basis functions instead of sigmoid functions in this model. The error curves of the sum of squared error (SSE varying with the number of hidden neurons and the iteration step are studied to determine the number of the hidden layer neurons. Simulation results of the half-bridge class-D power amplifier (CDPA with two-tone signal and broadband signals as input have shown that the proposed behavioral modeling can reconstruct the system of CDPAs accurately and depict the memory effect of CDPAs well. Compared with Volterra-Laguerre (VL model, Chebyshev neural network (CNN model, and basic Elman neural network (BENN model, the proposed model has better performance.

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.

Numeral eddy current sensor modelling based on genetic neural network

International Nuclear Information System (INIS)

Yu Along

2008-01-01

This paper presents a method used to the numeral eddy current sensor modelling based on the genetic neural network to settle its nonlinear problem. The principle and algorithms of genetic neural network are introduced. In this method, the nonlinear model parameters of the numeral eddy current sensor are optimized by genetic neural network (GNN) according to measurement data. So the method remains both the global searching ability of genetic algorithm and the good local searching ability of neural network. The nonlinear model has the advantages of strong robustness, on-line modelling and high precision. The maximum nonlinearity error can be reduced to 0.037% by using GNN. However, the maximum nonlinearity error is 0.075% using the least square method

Maritime piracy situation modelling with dynamic Bayesian networks

CSIR Research Space (South Africa)

Dabrowski, James M

2015-05-01

Full Text Available A generative model for modelling maritime vessel behaviour is proposed. The model is a novel variant of the dynamic Bayesian network (DBN). The proposed DBN is in the form of a switching linear dynamic system (SLDS) that has been extended into a...

Transmission network expansion planning based on hybridization model of neural networks and harmony search algorithm

Directory of Open Access Journals (Sweden)

Mohammad Taghi Ameli

2012-01-01

Full Text Available Transmission Network Expansion Planning (TNEP is a basic part of power network planning that determines where, when and how many new transmission lines should be added to the network. So, the TNEP is an optimization problem in which the expansion purposes are optimized. Artificial Intelligence (AI tools such as Genetic Algorithm (GA, Simulated Annealing (SA, Tabu Search (TS and Artificial Neural Networks (ANNs are methods used for solving the TNEP problem. Today, by using the hybridization models of AI tools, we can solve the TNEP problem for large-scale systems, which shows the effectiveness of utilizing such models. In this paper, a new approach to the hybridization model of Probabilistic Neural Networks (PNNs and Harmony Search Algorithm (HSA was used to solve the TNEP problem. Finally, by considering the uncertain role of the load based on a scenario technique, this proposed model was tested on the Garver’s 6-bus network.

Local difference measures between complex networks for dynamical system model evaluation.

Science.gov (United States)

Lange, Stefan; Donges, Jonathan F; Volkholz, Jan; Kurths, Jürgen

2015-01-01

A faithful modeling of real-world dynamical systems necessitates model evaluation. A recent promising methodological approach to this problem has been based on complex networks, which in turn have proven useful for the characterization of dynamical systems. In this context, we introduce three local network difference measures and demonstrate their capabilities in the field of climate modeling, where these measures facilitate a spatially explicit model evaluation.Building on a recent study by Feldhoff et al. [8] we comparatively analyze statistical and dynamical regional climate simulations of the South American monsoon system [corrected]. types of climate networks representing different aspects of rainfall dynamics are constructed from the modeled precipitation space-time series. Specifically, we define simple graphs based on positive as well as negative rank correlations between rainfall anomaly time series at different locations, and such based on spatial synchronizations of extreme rain events. An evaluation against respective networks built from daily satellite data provided by the Tropical Rainfall Measuring Mission 3B42 V7 reveals far greater differences in model performance between network types for a fixed but arbitrary climate model than between climate models for a fixed but arbitrary network type. We identify two sources of uncertainty in this respect. Firstly, climate variability limits fidelity, particularly in the case of the extreme event network; and secondly, larger geographical link lengths render link misplacements more likely, most notably in the case of the anticorrelation network; both contributions are quantified using suitable ensembles of surrogate networks. Our model evaluation approach is applicable to any multidimensional dynamical system and especially our simple graph difference measures are highly versatile as the graphs to be compared may be constructed in whatever way required. Generalizations to directed as well as edge- and node

Model Predictive Control of Sewer Networks

DEFF Research Database (Denmark)

Pedersen, Einar B.; Herbertsson, Hannes R.; Niemann, Henrik

2016-01-01

The developments in solutions for management of urban drainage are of vital importance, as the amount of sewer water from urban areas continues to increase due to the increase of the world’s population and the change in the climate conditions. How a sewer network is structured, monitored and cont...... benchmark model. Due to the inherent constraints the applied approach is based on Model Predictive Control....

Modelling of the PROTO-II crossover network

International Nuclear Information System (INIS)

Proulx, G.A.; Lackner, H.; Spence, P.; Wright, T.P.

1985-01-01

In order to drive a double ring, symmetrically fed bremsstrahlung diode, the PROTO II accelerator was redesigned. The radially converging triplate water line was reconfigured to drive two radial converging triplate lines in parallel. The four output lines were connected to the two input lines via an electrically enclosed tubular crossover network. Low-voltage Time Domain Reflectrometry (TDR) experiments were conducted on a full scale water immersed model of one section of the crossover network as an aid in this design. A lumped element analysis of the power flow through the network was inadequate in explaining the observed wave transmission and reflection characteristics. A more detailed analysis was performed with a circuit code in which we considered both localized lump-element and transmission line features of the crossover network. Experimental results of the model tests are given and compared with the circuit simulations. 7 figs

Insertion algorithms for network model database management systems

Science.gov (United States)

Mamadolimov, Abdurashid; Khikmat, Saburov

2017-12-01

The network model is a database model conceived as a flexible way of representing objects and their relationships. Its distinguishing feature is that the schema, viewed as a graph in which object types are nodes and relationship types are arcs, forms partial order. When a database is large and a query comparison is expensive then the efficiency requirement of managing algorithms is minimizing the number of query comparisons. We consider updating operation for network model database management systems. We develop a new sequantial algorithm for updating operation. Also we suggest a distributed version of the algorithm.

The ASAC Flight Segment and Network Cost Models

Science.gov (United States)

Kaplan, Bruce J.; Lee, David A.; Retina, Nusrat; Wingrove, Earl R., III; Malone, Brett; Hall, Stephen G.; Houser, Scott A.

1997-01-01

To assist NASA in identifying research art, with the greatest potential for improving the air transportation system, two models were developed as part of its Aviation System Analysis Capability (ASAC). The ASAC Flight Segment Cost Model (FSCM) is used to predict aircraft trajectories, resource consumption, and variable operating costs for one or more flight segments. The Network Cost Model can either summarize the costs for a network of flight segments processed by the FSCM or can be used to independently estimate the variable operating costs of flying a fleet of equipment given the number of departures and average flight stage lengths.

Modeling wormhole growth and wormhole networks in unconsolidated sand media using the BP CHOPS model

Energy Technology Data Exchange (ETDEWEB)

Vanderheyden, W.B. [BP America, Inc. Exploration and Production Technology Unconventional Oil Flagship (United States); Zhang, D. Z.; Jayaraman, B. [Los Alamos National Laboratory Theoretical Division Solid and Fluid Dynamics Group (United States)

2011-07-01

Cold Heavy Oil Production with Sand (CHOPS) is a recovery method used in unconsolidated sands to produce heavy oil. During the use of the CHOPS method, wormholes originating from production wells are generated. The aim of this paper is to present 2 modeling tools developed by BP in order to improve reservoir simulation of CHOPS operations with wormholes. The first tool developed is a CHOPS modeling framework representing wormhole networks through reservoir simulation and its wellbore model. The second one consists of the application of advanced fluid-structure interaction modeling into the simulation of wormhole and its network growth. Experiments were carried out and a qualitative agreement was achieved with the model. In addition the BP CHOPS model can predict probable oil production without calibration. This paper presented an improved model for reservoir simulation with wormholes but further work is required to predict wormhole shape in a more accurate manner.

A large deformation viscoelastic model for double-network hydrogels

Science.gov (United States)

Mao, Yunwei; Lin, Shaoting; Zhao, Xuanhe; Anand, Lallit

2017-03-01

We present a large deformation viscoelasticity model for recently synthesized double network hydrogels which consist of a covalently-crosslinked polyacrylamide network with long chains, and an ionically-crosslinked alginate network with short chains. Such double-network gels are highly stretchable and at the same time tough, because when stretched the crosslinks in the ionically-crosslinked alginate network rupture which results in distributed internal microdamage which dissipates a substantial amount of energy, while the configurational entropy of the covalently-crosslinked polyacrylamide network allows the gel to return to its original configuration after deformation. In addition to the large hysteresis during loading and unloading, these double network hydrogels also exhibit a substantial rate-sensitive response during loading, but exhibit almost no rate-sensitivity during unloading. These features of large hysteresis and asymmetric rate-sensitivity are quite different from the response of conventional hydrogels. We limit our attention to modeling the complex viscoelastic response of such hydrogels under isothermal conditions. Our model is restricted in the sense that we have limited our attention to conditions under which one might neglect any diffusion of the water in the hydrogel - as might occur when the gel has a uniform initial value of the concentration of water, and the mobility of the water molecules in the gel is low relative to the time scale of the mechanical deformation. We also do not attempt to model the final fracture of such double-network hydrogels.

Exponential random graph models for networks with community structure.

Science.gov (United States)

Fronczak, Piotr; Fronczak, Agata; Bujok, Maksymilian

2013-09-01

Although the community structure organization is an important characteristic of real-world networks, most of the traditional network models fail to reproduce the feature. Therefore, the models are useless as benchmark graphs for testing community detection algorithms. They are also inadequate to predict various properties of real networks. With this paper we intend to fill the gap. We develop an exponential random graph approach to networks with community structure. To this end we mainly built upon the idea of blockmodels. We consider both the classical blockmodel and its degree-corrected counterpart and study many of their properties analytically. We show that in the degree-corrected blockmodel, node degrees display an interesting scaling property, which is reminiscent of what is observed in real-world fractal networks. A short description of Monte Carlo simulations of the models is also given in the hope of being useful to others working in the field.

Modeling and optimization of cloud-ready and content-oriented networks

CERN Document Server

Walkowiak, Krzysztof

2016-01-01

This book focuses on modeling and optimization of cloud-ready and content-oriented networks in the context of different layers and accounts for specific constraints following from protocols and technologies used in a particular layer. It addresses a wide range of additional constraints important in contemporary networks, including various types of network flows, survivability issues, multi-layer networking, and resource location. The book presents recent existing and new results in a comprehensive and cohesive way. The contents of the book are organized in five chapters, which are mostly self-contained. Chapter 1 briefly presents information on cloud computing and content-oriented services, and introduces basic notions and concepts of network modeling and optimization. Chapter 2 covers various optimization problems that arise in the context of connection-oriented networks. Chapter 3 focuses on modeling and optimization of Elastic Optical Networks. Chapter 4 is devoted to overlay networks. The book concludes w...

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.

Network modelling methods for FMRI.

Science.gov (United States)

Smith, Stephen M; Miller, Karla L; Salimi-Khorshidi, Gholamreza; Webster, Matthew; Beckmann, Christian F; Nichols, Thomas E; Ramsey, Joseph D; Woolrich, Mark W

2011-01-15

There is great interest in estimating brain "networks" from FMRI data. This is often attempted by identifying a set of functional "nodes" (e.g., spatial ROIs or ICA maps) and then conducting a connectivity analysis between the nodes, based on the FMRI timeseries associated with the nodes. Analysis methods range from very simple measures that consider just two nodes at a time (e.g., correlation between two nodes' timeseries) to sophisticated approaches that consider all nodes simultaneously and estimate one global network model (e.g., Bayes net models). Many different methods are being used in the literature, but almost none has been carefully validated or compared for use on FMRI timeseries data. In this work we generate rich, realistic simulated FMRI data for a wide range of underlying networks, experimental protocols and problematic confounds in the data, in order to compare different connectivity estimation approaches. Our results show that in general correlation-based approaches can be quite successful, methods based on higher-order statistics are less sensitive, and lag-based approaches perform very poorly. More specifically: there are several methods that can give high sensitivity to network connection detection on good quality FMRI data, in particular, partial correlation, regularised inverse covariance estimation and several Bayes net methods; however, accurate estimation of connection directionality is more difficult to achieve, though Patel's τ can be reasonably successful. With respect to the various confounds added to the data, the most striking result was that the use of functionally inaccurate ROIs (when defining the network nodes and extracting their associated timeseries) is extremely damaging to network estimation; hence, results derived from inappropriate ROI definition (such as via structural atlases) should be regarded with great caution. Copyright © 2010 Elsevier Inc. All rights reserved.

Infection dynamics on spatial small-world network models

Science.gov (United States)

Iotti, Bryan; Antonioni, Alberto; Bullock, Seth; Darabos, Christian; Tomassini, Marco; Giacobini, Mario

2017-11-01

The study of complex networks, and in particular of social networks, has mostly concentrated on relational networks, abstracting the distance between nodes. Spatial networks are, however, extremely relevant in our daily lives, and a large body of research exists to show that the distances between nodes greatly influence the cost and probability of establishing and maintaining a link. A random geometric graph (RGG) is the main type of synthetic network model used to mimic the statistical properties and behavior of many social networks. We propose a model, called REDS, that extends energy-constrained RGGs to account for the synergic effect of sharing the cost of a link with our neighbors, as is observed in real relational networks. We apply both the standard Watts-Strogatz rewiring procedure and another method that conserves the degree distribution of the network. The second technique was developed to eliminate unwanted forms of spatial correlation between the degree of nodes that are affected by rewiring, limiting the effect on other properties such as clustering and assortativity. We analyze both the statistical properties of these two network types and their epidemiological behavior when used as a substrate for a standard susceptible-infected-susceptible compartmental model. We consider and discuss the differences in properties and behavior between RGGs and REDS as rewiring increases and as infection parameters are changed. We report considerable differences both between the network types and, in the case of REDS, between the two rewiring schemes. We conclude that REDS represent, with the application of these rewiring mechanisms, extremely useful and interesting tools in the study of social and epidemiological phenomena in synthetic complex networks.

A control model for district heating networks with storage

NARCIS (Netherlands)

Scholten, Tjeert; De Persis, Claudio; Tesi, Pietro

2014-01-01

In [1] pressure control of hydraulic networks is investigated. We extend this work to district heating systems with storage capabilities and derive a model taking the topology of the network into account. The goal for the derived model is that it should allow for control of the storage level and

Travel Time Reliability for Urban Networks : Modelling and Empirics

NARCIS (Netherlands)

Zheng, F.; Liu, Xiaobo; van Zuylen, H.J.; Li, Jie; Lu, Chao

2017-01-01

The importance of travel time reliability in traffic management, control, and network design has received a lot of attention in the past decade. In this paper, a network travel time distribution model based on the Johnson curve system is proposed. The model is applied to field travel time data

Modelling Pollutant Dispersion in a Street Network

Science.gov (United States)

Salem, N. Ben; Garbero, V.; Salizzoni, P.; Lamaison, G.; Soulhac, L.

2015-04-01

This study constitutes a further step in the analysis of the performances of a street network model to simulate atmospheric pollutant dispersion in urban areas. The model, named SIRANE, is based on the decomposition of the urban atmosphere into two sub-domains: the urban boundary layer, whose dynamics is assumed to be well established, and the urban canopy, represented as a series of interconnected boxes. Parametric laws govern the mass exchanges between the boxes under the assumption that the pollutant dispersion within the canopy can be fully simulated by modelling three main bulk transfer phenomena: channelling along street axes, transfers at street intersections, and vertical exchange between street canyons and the overlying atmosphere. Here, we aim to evaluate the reliability of the parametrizations adopted to simulate these phenomena, by focusing on their possible dependence on the external wind direction. To this end, we test the model against concentration measurements within an idealized urban district whose geometrical layout closely matches the street network represented in SIRANE. The analysis is performed for an urban array with a fixed geometry and a varying wind incidence angle. The results show that the model provides generally good results with the reference parametrizations adopted in SIRANE and that its performances are quite robust for a wide range of the model parameters. This proves the reliability of the street network approach in simulating pollutant dispersion in densely built city districts. The results also show that the model performances may be improved by considering a dependence of the wind fluctuations at street intersections and of the vertical exchange velocity on the direction of the incident wind. This opens the way for further investigations to clarify the dependence of these parameters on wind direction and street aspect ratios.

Queueing Models for Mobile Ad Hoc Networks

NARCIS (Netherlands)

de Haan, Roland

2009-01-01

This thesis presents models for the performance analysis of a recent communication paradigm: \\emph{mobile ad hoc networking}. The objective of mobile ad hoc networking is to provide wireless connectivity between stations in a highly dynamic environment. These dynamics are driven by the mobility of

Runoff Modelling in Urban Storm Drainage by Neural Networks

DEFF Research Database (Denmark)

Rasmussen, Michael R.; Brorsen, Michael; Schaarup-Jensen, Kjeld

1995-01-01

A neural network is used to simulate folw and water levels in a sewer system. The calibration of th neural network is based on a few measured events and the network is validated against measureed events as well as flow simulated with the MOUSE model (Lindberg and Joergensen, 1986). The neural...... network is used to compute flow or water level at selected points in the sewer system, and to forecast the flow from a small residential area. The main advantages of the neural network are the build-in self calibration procedure and high speed performance, but the neural network cannot be used to extract...... knowledge of the runoff process. The neural network was found to simulate 150 times faster than e.g. the MOUSE model....

A Fluid Model for Performance Analysis in Cellular Networks

Directory of Open Access Journals (Sweden)

Coupechoux Marceau

2010-01-01

Full Text Available We propose a new framework to study the performance of cellular networks using a fluid model and we derive from this model analytical formulas for interference, outage probability, and spatial outage probability. The key idea of the fluid model is to consider the discrete base station (BS entities as a continuum of transmitters that are spatially distributed in the network. This model allows us to obtain simple analytical expressions to reveal main characteristics of the network. In this paper, we focus on the downlink other-cell interference factor (OCIF, which is defined for a given user as the ratio of its outer cell received power to its inner cell received power. A closed-form formula of the OCIF is provided in this paper. From this formula, we are able to obtain the global outage probability as well as the spatial outage probability, which depends on the location of a mobile station (MS initiating a new call. Our analytical results are compared to Monte Carlo simulations performed in a traditional hexagonal network. Furthermore, we demonstrate an application of the outage probability related to cell breathing and densification of cellular networks.

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.

Energy flow models for the estimation of technical losses in distribution network

International Nuclear Information System (INIS)

Au, Mau Teng; Tan, Chin Hooi

2013-01-01

This paper presents energy flow models developed to estimate technical losses in distribution network. Energy flow models applied in this paper is based on input energy and peak demand of distribution network, feeder length and peak demand, transformer loading capacity, and load factor. Two case studies, an urban distribution network and a rural distribution network are used to illustrate application of the energy flow models. Results on technical losses obtained for the two distribution networks are consistent and comparable to network of similar types and characteristics. Hence, the energy flow models are suitable for practical application.

Hybrid Scheme for Modeling Local Field Potentials from Point-Neuron Networks

DEFF Research Database (Denmark)

Hagen, Espen; Dahmen, David; Stavrinou, Maria L

2016-01-01

on populations of network-equivalent multicompartment neuron models with layer-specific synaptic connectivity, can be used with an arbitrary number of point-neuron network populations, and allows for a full separation of simulated network dynamics and LFPs. We apply the scheme to a full-scale cortical network......With rapidly advancing multi-electrode recording technology, the local field potential (LFP) has again become a popular measure of neuronal activity in both research and clinical applications. Proper understanding of the LFP requires detailed mathematical modeling incorporating the anatomical...... and electrophysiological features of neurons near the recording electrode, as well as synaptic inputs from the entire network. Here we propose a hybrid modeling scheme combining efficient point-neuron network models with biophysical principles underlying LFP generation by real neurons. The LFP predictions rely...

Spatial Models and Networks of Living Systems

DEFF Research Database (Denmark)

Juul, Jeppe Søgaard

When studying the dynamics of living systems, insight can often be gained by developing a mathematical model that can predict future behaviour of the system or help classify system characteristics. However, in living cells, organisms, and especially groups of interacting individuals, a large number...... variables of the system. However, this approach disregards any spatial structure of the system, which may potentially change the behaviour drastically. An alternative approach is to construct a cellular automaton with nearest neighbour interactions, or even to model the system as a complex network...... with interactions defined by network topology. In this thesis I first describe three different biological models of ageing and cancer, in which spatial structure is important for the system dynamics. I then turn to describe characteristics of ecosystems consisting of three cyclically interacting species...

Multiple Social Networks, Data Models and Measures for

DEFF Research Database (Denmark)

Magnani, Matteo; Rossi, Luca

2017-01-01

Multiple Social Network Analysis is a discipline defining models, measures, methodologies, and algorithms to study multiple social networks together as a single social system. It is particularly valuable when the networks are interconnected, e.g., the same actors are present in more than one...

Neural networks in economic modelling : An empirical study

NARCIS (Netherlands)

Verkooijen, W.J.H.

1996-01-01

This dissertation addresses the statistical aspects of neural networks and their usability for solving problems in economics and finance. Neural networks are discussed in a framework of modelling which is generally accepted in econometrics. Within this framework a neural network is regarded as a

Trojan detection model based on network behavior analysis

International Nuclear Information System (INIS)

Liu Junrong; Liu Baoxu; Wang Wenjin

2012-01-01

Based on the analysis of existing Trojan detection technology, this paper presents a Trojan detection model based on network behavior analysis. First of all, we abstract description of the Trojan network behavior, then according to certain rules to establish the characteristic behavior library, and then use the support vector machine algorithm to determine whether a Trojan invasion. Finally, through the intrusion detection experiments, shows that this model can effectively detect Trojans. (authors)

Unloading arm movement modeling using neural networks for a rotary hearth furnace

Directory of Open Access Journals (Sweden)

Iulia Inoan

2011-12-01

Full Text Available Neural networks are being applied in many fields of engineering having nowadays a wide range of application. Neural networks are very useful for modeling dynamic processes for which the mathematical modeling is hard to obtain, or for processes that can’t be modeled using mathematical equations. This paper describes the modeling process for the unloading arm movement from a rotary hearth furnace using neural networks with back propagation algorithm. In this case the designed network was trained using the simulation results from a previous calculated mathematical model.

Fitting Latent Cluster Models for Networks with latentnet

Directory of Open Access Journals (Sweden)

Pavel N. Krivitsky

2007-12-01

Full Text Available latentnet is a package to fit and evaluate statistical latent position and cluster models for networks. Hoff, Raftery, and Handcock (2002 suggested an approach to modeling networks based on positing the existence of an latent space of characteristics of the actors. Relationships form as a function of distances between these characteristics as well as functions of observed dyadic level covariates. In latentnet social distances are represented in a Euclidean space. It also includes a variant of the extension of the latent position model to allow for clustering of the positions developed in Handcock, Raftery, and Tantrum (2007.The package implements Bayesian inference for the models based on an Markov chain Monte Carlo algorithm. It can also compute maximum likelihood estimates for the latent position model and a two-stage maximum likelihood method for the latent position cluster model. For latent position cluster models, the package provides a Bayesian way of assessing how many groups there are, and thus whether or not there is any clustering (since if the preferred number of groups is 1, there is little evidence for clustering. It also estimates which cluster each actor belongs to. These estimates are probabilistic, and provide the probability of each actor belonging to each cluster. It computes four types of point estimates for the coefficients and positions: maximum likelihood estimate, posterior mean, posterior mode and the estimator which minimizes Kullback-Leibler divergence from the posterior. You can assess the goodness-of-fit of the model via posterior predictive checks. It has a function to simulate networks from a latent position or latent position cluster model.

A Network-Individual-Resource Model for HIV Prevention

Science.gov (United States)

Johnson, Blair T.; Redding, Colleen A.; DiClemente, Ralph J.; Mustanski, Brian S.; Dodge, Brian M.; Sheeran, Paschal; Warren, Michelle R.; Zimmerman, Rick S.; Fisher, William A.; Conner, Mark T.; Carey, Michael P.; Fisher, Jeffrey D.; Stall, Ronald D.; Fishbein, Martin

2014-01-01

HIV is transmitted through dyadic exchanges of individuals linked in transitory or permanent networks of varying sizes. To optimize prevention efficacy, a complementary theoretical perspective that bridges key individual level elements with important network elements can be a foundation for developing and implementing HIV interventions with outcomes that are more sustainable over time and have greater dissemination potential. Toward that end, we introduce a Network-Individual-Resource (NIR) model for HIV prevention that recognizes how exchanges of resources between individuals and their networks underlies and sustains HIV-risk behaviors. Individual behavior change for HIV prevention, then, may be dependent on increasing the supportiveness of that individual's relevant networks for such change. Among other implications, an NIR model predicts that the success of prevention efforts depends on whether the prevention efforts (1) prompt behavior changes that can be sustained by the resources the individual or their networks possess; (2) meet individual and network needs and are consistent with the individual's current situation/developmental stage; (3) are trusted and valued; and (4) target high HIV-prevalence networks. PMID:20862606

The specification of weight structures in network autocorrelation models of social influence

NARCIS (Netherlands)

Leenders, Roger Th.A.J.

2002-01-01

Many physical and social phenomena are embedded within networks of interdependencies, the so-called 'context' of these phenomena. In network analysis, this type of process is typically modeled as a network autocorrelation model. Parameter estimates and inferences based on autocorrelation models,

Hybrid network defense model based on fuzzy evaluation.

Science.gov (United States)

Cho, Ying-Chiang; Pan, Jen-Yi

2014-01-01

With sustained and rapid developments in the field of information technology, the issue of network security has become increasingly prominent. The theme of this study is network data security, with the test subject being a classified and sensitive network laboratory that belongs to the academic network. The analysis is based on the deficiencies and potential risks of the network's existing defense technology, characteristics of cyber attacks, and network security technologies. Subsequently, a distributed network security architecture using the technology of an intrusion prevention system is designed and implemented. In this paper, first, the overall design approach is presented. This design is used as the basis to establish a network defense model, an improvement over the traditional single-technology model that addresses the latter's inadequacies. Next, a distributed network security architecture is implemented, comprising a hybrid firewall, intrusion detection, virtual honeynet projects, and connectivity and interactivity between these three components. Finally, the proposed security system is tested. A statistical analysis of the test results verifies the feasibility and reliability of the proposed architecture. The findings of this study will potentially provide new ideas and stimuli for future designs of network security architecture.

An autocatalytic network model for stock markets

Science.gov (United States)

Caetano, Marco Antonio Leonel; Yoneyama, Takashi

2015-02-01

The stock prices of companies with businesses that are closely related within a specific sector of economy might exhibit movement patterns and correlations in their dynamics. The idea in this work is to use the concept of autocatalytic network to model such correlations and patterns in the trends exhibited by the expected returns. The trends are expressed in terms of positive or negative returns within each fixed time interval. The time series derived from these trends is then used to represent the movement patterns by a probabilistic boolean network with transitions modeled as an autocatalytic network. The proposed method might be of value in short term forecasting and identification of dependencies. The method is illustrated with a case study based on four stocks of companies in the field of natural resource and technology.

Modified network simulation model with token method of bus access

Directory of Open Access Journals (Sweden)

L.V. Stribulevich

2013-08-01

Full Text Available Purpose. To study the characteristics of the local network with the marker method of access to the bus its modified simulation model was developed. Methodology. Defining characteristics of the network is carried out on the developed simulation model, which is based on the state diagram-layer network station with the mechanism of processing priorities, both in steady state and in the performance of control procedures: the initiation of a logical ring, the entrance and exit of the station network with a logical ring. Findings. A simulation model, on the basis of which can be obtained the dependencies of the application the maximum waiting time in the queue for different classes of access, and the reaction time usable bandwidth on the data rate, the number of network stations, the generation rate applications, the number of frames transmitted per token holding time, frame length was developed. Originality. The technique of network simulation reflecting its work in the steady condition and during the control procedures, the mechanism of priority ranking and handling was proposed. Practical value. Defining network characteristics in the real-time systems on railway transport based on the developed simulation model.

Modeling interdependent socio-technical networks: The smart grid—an agent-based modeling approach

NARCIS (Netherlands)

Worm, D.; Langley, D.J.; Becker, J.

2014-01-01

The aim of this paper is to improve scientific modeling of interdependent socio-technical networks. In these networks the interplay between technical or infrastructural elements on the one hand and social and behavioral aspects on the other hand, plays an important role. Examples include electricity

Hybrid Scheme for Modeling Local Field Potentials from Point-Neuron Networks.

Science.gov (United States)

Hagen, Espen; Dahmen, David; Stavrinou, Maria L; Lindén, Henrik; Tetzlaff, Tom; van Albada, Sacha J; Grün, Sonja; Diesmann, Markus; Einevoll, Gaute T

2016-12-01

With rapidly advancing multi-electrode recording technology, the local field potential (LFP) has again become a popular measure of neuronal activity in both research and clinical applications. Proper understanding of the LFP requires detailed mathematical modeling incorporating the anatomical and electrophysiological features of neurons near the recording electrode, as well as synaptic inputs from the entire network. Here we propose a hybrid modeling scheme combining efficient point-neuron network models with biophysical principles underlying LFP generation by real neurons. The LFP predictions rely on populations of network-equivalent multicompartment neuron models with layer-specific synaptic connectivity, can be used with an arbitrary number of point-neuron network populations, and allows for a full separation of simulated network dynamics and LFPs. We apply the scheme to a full-scale cortical network model for a ∼1 mm 2 patch of primary visual cortex, predict laminar LFPs for different network states, assess the relative LFP contribution from different laminar populations, and investigate effects of input correlations and neuron density on the LFP. The generic nature of the hybrid scheme and its public implementation in hybridLFPy form the basis for LFP predictions from other and larger point-neuron network models, as well as extensions of the current application with additional biological detail. © The Author 2016. Published by Oxford University Press.

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

Directory of Open Access Journals (Sweden)

Insoo Sohn

2017-01-01

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

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.

A network security situation prediction model based on wavelet neural network with optimized parameters

Directory of Open Access Journals (Sweden)

Haibo Zhang

2016-08-01

Full Text Available The security incidents ion networks are sudden and uncertain, it is very hard to precisely predict the network security situation by traditional methods. In order to improve the prediction accuracy of the network security situation, we build a network security situation prediction model based on Wavelet Neural Network (WNN with optimized parameters by the Improved Niche Genetic Algorithm (INGA. The proposed model adopts WNN which has strong nonlinear ability and fault-tolerance performance. Also, the parameters for WNN are optimized through the adaptive genetic algorithm (GA so that WNN searches more effectively. Considering the problem that the adaptive GA converges slowly and easily turns to the premature problem, we introduce a novel niche technology with a dynamic fuzzy clustering and elimination mechanism to solve the premature convergence of the GA. Our final simulation results show that the proposed INGA-WNN prediction model is more reliable and effective, and it achieves faster convergence-speed and higher prediction accuracy than the Genetic Algorithm-Wavelet Neural Network (GA-WNN, Genetic Algorithm-Back Propagation Neural Network (GA-BPNN and WNN.

GraphCrunch 2: Software tool for network modeling, alignment and clustering.

Science.gov (United States)

Kuchaiev, Oleksii; Stevanović, Aleksandar; Hayes, Wayne; Pržulj, Nataša

2011-01-19

Recent advancements in experimental biotechnology have produced large amounts of protein-protein interaction (PPI) data. The topology of PPI networks is believed to have a strong link to their function. Hence, the abundance of PPI data for many organisms stimulates the development of computational techniques for the modeling, comparison, alignment, and clustering of networks. In addition, finding representative models for PPI networks will improve our understanding of the cell just as a model of gravity has helped us understand planetary motion. To decide if a model is representative, we need quantitative comparisons of model networks to real ones. However, exact network comparison is computationally intractable and therefore several heuristics have been used instead. Some of these heuristics are easily computable "network properties," such as the degree distribution, or the clustering coefficient. An important special case of network comparison is the network alignment problem. Analogous to sequence alignment, this problem asks to find the "best" mapping between regions in two networks. It is expected that network alignment might have as strong an impact on our understanding of biology as sequence alignment has had. Topology-based clustering of nodes in PPI networks is another example of an important network analysis problem that can uncover relationships between interaction patterns and phenotype. We introduce the GraphCrunch 2 software tool, which addresses these problems. It is a significant extension of GraphCrunch which implements the most popular random network models and compares them with the data networks with respect to many network properties. Also, GraphCrunch 2 implements the GRAph ALigner algorithm ("GRAAL") for purely topological network alignment. GRAAL can align any pair of networks and exposes large, dense, contiguous regions of topological and functional similarities far larger than any other existing tool. Finally, GraphCruch 2 implements an

GraphCrunch 2: Software tool for network modeling, alignment and clustering

Directory of Open Access Journals (Sweden)

Hayes Wayne

2011-01-01

Full Text Available Abstract Background Recent advancements in experimental biotechnology have produced large amounts of protein-protein interaction (PPI data. The topology of PPI networks is believed to have a strong link to their function. Hence, the abundance of PPI data for many organisms stimulates the development of computational techniques for the modeling, comparison, alignment, and clustering of networks. In addition, finding representative models for PPI networks will improve our understanding of the cell just as a model of gravity has helped us understand planetary motion. To decide if a model is representative, we need quantitative comparisons of model networks to real ones. However, exact network comparison is computationally intractable and therefore several heuristics have been used instead. Some of these heuristics are easily computable "network properties," such as the degree distribution, or the clustering coefficient. An important special case of network comparison is the network alignment problem. Analogous to sequence alignment, this problem asks to find the "best" mapping between regions in two networks. It is expected that network alignment might have as strong an impact on our understanding of biology as sequence alignment has had. Topology-based clustering of nodes in PPI networks is another example of an important network analysis problem that can uncover relationships between interaction patterns and phenotype. Results We introduce the GraphCrunch 2 software tool, which addresses these problems. It is a significant extension of GraphCrunch which implements the most popular random network models and compares them with the data networks with respect to many network properties. Also, GraphCrunch 2 implements the GRAph ALigner algorithm ("GRAAL" for purely topological network alignment. GRAAL can align any pair of networks and exposes large, dense, contiguous regions of topological and functional similarities far larger than any other

Value shaping in networked business modeling : Case studies of sustainability-oriented innovations

NARCIS (Netherlands)

Oskam, I.F.; Bossink, Bart; de Man, Ard-Pieter

2018-01-01

A stream of literature is emerging where network development and business modeling intersect. Various authors emphasize that networks influence business models. This paper extends this stream of literature by studying two cases in which we analyze how business modeling and networking interact over

Agent-based modeling of the energy network for hybrid cars

International Nuclear Information System (INIS)

Gonzalez de Durana, José María; Barambones, Oscar; Kremers, Enrique; Varga, Liz

2015-01-01

Highlights: • An approach to represent and calculate multicarrier energy networks has been developed. • It provides a modeling method based on agents, for multicarrier energy networks. • It allows the system representation on a single sheet. • Energy flows circulating in the system can be observed dynamically during simulation. • The method is technology independent. - Abstract: Studies in complex energy networks devoted to the modeling of electrical power grids, were extended in previous work, where a computational multi-layered ontology, implemented using agent-based methods, was adopted. This structure is compatible with recently introduced Multiplex Networks which using Multi-linear Algebra generalize some of classical results for single-layer networks, to multilayer networks in steady state. Static results do not assist overly in understanding dynamic networks in which the values of the variables in the nodes and edges can change suddenly, driven by events, and even where new nodes or edges may appear or disappear, also because of other events. To address this gap, a computational agent-based model is developed to extend the multi-layer and multiplex approaches. In order to demonstrate the benefits of a dynamical extension, a model of the energy network in a hybrid car is presented as a case study

Time-dependent Networks as Models to Achieve Fast Exact Time-table Queries

DEFF Research Database (Denmark)

Brodal, Gerth Stølting; Jacob, Rico

2001-01-01

We consider efficient algorithms for exact time-table queries, i.e. algorithms that find optimal itineraries. We propose to use time-dependent networks as a model and show advantages of this approach over space-time networks as models.......We consider efficient algorithms for exact time-table queries, i.e. algorithms that find optimal itineraries. We propose to use time-dependent networks as a model and show advantages of this approach over space-time networks as models....

Modeling and prediction of Turkey's electricity consumption using Artificial Neural Networks

International Nuclear Information System (INIS)

Kavaklioglu, Kadir; Ozturk, Harun Kemal; Canyurt, Olcay Ersel; Ceylan, Halim

2009-01-01

Artificial Neural Networks are proposed to model and predict electricity consumption of Turkey. Multi layer perceptron with backpropagation training algorithm is used as the neural network topology. Tangent-sigmoid and pure-linear transfer functions are selected in the hidden and output layer processing elements, respectively. These input-output network models are a result of relationships that exist among electricity consumption and several other socioeconomic variables. Electricity consumption is modeled as a function of economic indicators such as population, gross national product, imports and exports. It is also modeled using export-import ratio and time input only. Performance comparison among different models is made based on absolute and percentage mean square error. Electricity consumption of Turkey is predicted until 2027 using data from 1975 to 2006 along with other economic indicators. The results show that electricity consumption can be modeled using Artificial Neural Networks, and the models can be used to predict future electricity consumption. (author)

Perception of similarity: a model for social network dynamics

International Nuclear Information System (INIS)

Javarone, Marco Alberto; Armano, Giuliano

2013-01-01

Some properties of social networks (e.g., the mixing patterns and the community structure) appear deeply influenced by the individual perception of people. In this work we map behaviors by considering similarity and popularity of people, also assuming that each person has his/her proper perception and interpretation of similarity. Although investigated in different ways (depending on the specific scientific framework), from a computational perspective similarity is typically calculated as a distance measure. In accordance with this view, to represent social network dynamics we developed an agent-based model on top of a hyperbolic space on which individual distance measures are calculated. Simulations, performed in accordance with the proposed model, generate small-world networks that exhibit a community structure. We deem this model to be valuable for analyzing the relevant properties of real social networks. (paper)

Comparison of Control Approaches in Genetic Regulatory Networks by Using Stochastic Master Equation Models, Probabilistic Boolean Network Models and Differential Equation Models and Estimated Error Analyzes

Science.gov (United States)

Caglar, Mehmet Umut; Pal, Ranadip

2011-03-01

Central dogma of molecular biology states that ``information cannot be transferred back from protein to either protein or nucleic acid''. However, this assumption is not exactly correct in most of the cases. There are a lot of feedback loops and interactions between different levels of systems. These types of interactions are hard to analyze due to the lack of cell level data and probabilistic - nonlinear nature of interactions. Several models widely used to analyze and simulate these types of nonlinear interactions. Stochastic Master Equation (SME) models give probabilistic nature of the interactions in a detailed manner, with a high calculation cost. On the other hand Probabilistic Boolean Network (PBN) models give a coarse scale picture of the stochastic processes, with a less calculation cost. Differential Equation (DE) models give the time evolution of mean values of processes in a highly cost effective way. The understanding of the relations between the predictions of these models is important to understand the reliability of the simulations of genetic regulatory networks. In this work the success of the mapping between SME, PBN and DE models is analyzed and the accuracy and affectivity of the control policies generated by using PBN and DE models is compared.

Quantum-Like Bayesian Networks for Modeling Decision Making

Directory of Open Access Journals (Sweden)

Catarina eMoreira

2016-01-01

Full Text Available In this work, we explore an alternative quantum structure to perform quantum probabilistic inferences to accommodate the paradoxical findings of the Sure Thing Principle. We propose a Quantum-Like Bayesian Network, which consists in replacing classical probabilities by quantum probability amplitudes. However, since this approach suffers from the problem of exponential growth of quantum parameters, we also propose a similarity heuristic that automatically fits quantum parameters through vector similarities. This makes the proposed model general and predictive in contrast to the current state of the art models, which cannot be generalized for more complex decision scenarios and that only provide an explanatory nature for the observed paradoxes. In the end, the model that we propose consists in a nonparametric method for estimating inference effects from a statistical point of view. It is a statistical model that is simpler than the previous quantum dynamic and quantum-like models proposed in the literature. We tested the proposed network with several empirical data from the literature, mainly from the Prisoner's Dilemma game and the Two Stage Gambling game. The results obtained show that the proposed quantum Bayesian Network is a general method that can accommodate violations of the laws of classical probability theory and make accurate predictions regarding human decision-making in these scenarios.

Synchronous versus asynchronous modeling of gene regulatory networks.

Science.gov (United States)

Garg, Abhishek; Di Cara, Alessandro; Xenarios, Ioannis; Mendoza, Luis; De Micheli, Giovanni

2008-09-01

In silico modeling of gene regulatory networks has gained some momentum recently due to increased interest in analyzing the dynamics of biological systems. This has been further facilitated by the increasing availability of experimental data on gene-gene, protein-protein and gene-protein interactions. The two dynamical properties that are often experimentally testable are perturbations and stable steady states. Although a lot of work has been done on the identification of steady states, not much work has been reported on in silico modeling of cellular differentiation processes. In this manuscript, we provide algorithms based on reduced ordered binary decision diagrams (ROBDDs) for Boolean modeling of gene regulatory networks. Algorithms for synchronous and asynchronous transition models have been proposed and their corresponding computational properties have been analyzed. These algorithms allow users to compute cyclic attractors of large networks that are currently not feasible using existing software. Hereby we provide a framework to analyze the effect of multiple gene perturbation protocols, and their effect on cell differentiation processes. These algorithms were validated on the T-helper model showing the correct steady state identification and Th1-Th2 cellular differentiation process. The software binaries for Windows and Linux platforms can be downloaded from http://si2.epfl.ch/~garg/genysis.html.

Artificial Neural Network L* from different magnetospheric field models

Science.gov (United States)

Yu, Y.; Koller, J.; Zaharia, S. G.; Jordanova, V. K.

2011-12-01

The third adiabatic invariant L* plays an important role in modeling and understanding the radiation belt dynamics. The popular way to numerically obtain the L* value follows the recipe described by Roederer [1970], which is, however, slow and computational expensive. This work focuses on a new technique, which can compute the L* value in microseconds without losing much accuracy: artificial neural networks. Since L* is related to the magnetic flux enclosed by a particle drift shell, global magnetic field information needed to trace the drift shell is required. A series of currently popular empirical magnetic field models are applied to create the L* data pool using 1 million data samples which are randomly selected within a solar cycle and within the global magnetosphere. The networks, trained from the above L* data pool, can thereby be used for fairly efficient L* calculation given input parameters valid within the trained temporal and spatial range. Besides the empirical magnetospheric models, a physics-based self-consistent inner magnetosphere model (RAM-SCB) developed at LANL is also utilized to calculate L* values and then to train the L* neural network. This model better predicts the magnetospheric configuration and therefore can significantly improve the L*. The above neural network L* technique will enable, for the first time, comprehensive solar-cycle long studies of radiation belt processes. However, neural networks trained from different magnetic field models can result in different L* values, which could cause mis-interpretation of radiation belt dynamics, such as where the source of the radiation belt charged particle is and which mechanism is dominant in accelerating the particles. Such a fact calls for attention to cautiously choose a magnetospheric field model for the L* calculation.

Forecasting macroeconomic variables using neural network models and three automated model selection techniques

DEFF Research Database (Denmark)

Kock, Anders Bredahl; Teräsvirta, Timo

2016-01-01

When forecasting with neural network models one faces several problems, all of which influence the accuracy of the forecasts. First, neural networks are often hard to estimate due to their highly nonlinear structure. To alleviate the problem, White (2006) presented a solution (QuickNet) that conv...

Mathematical model of transmission network static state estimation

Directory of Open Access Journals (Sweden)

Ivanov Aleksandar

2012-01-01

Full Text Available In this paper the characteristics and capabilities of the power transmission network static state estimator are presented. The solving process of the mathematical model containing the measurement errors and their processing is developed. To evaluate difference between the general model of state estimation and the fast decoupled state estimation model, the both models are applied to an example, and so derived results are compared.

Econometric model as a regulatory tool in electricity distribution - Case Network Performance Assessment Model

International Nuclear Information System (INIS)

Honkapuro, S.; Lassila, J.; Viljainen, S.; Tahvanainen, K.; Partanen, J.

2004-01-01

Electricity distribution companies operate in the state of natural monopolies since building of parallel networks is not cost-effective. Monopoly companies do not have pressure from the open markets to keep their prices and costs at reasonable level. The regulation of these companies is needed to prevent the misuse of the monopoly position. Regulation is usually focused either on the profit of company or on the price of electricity. In this document, the usability of an econometric model in the regulation of electricity distribution companies is evaluated. Regulation method which determines allowed income for each company with generic computation model can be seen as an econometric model. As the special case of an econometric model, the method called Network Performance Assessment Model, NPAM (Naetnyttomodellen in Swedish), is analysed. NPAM is developed by Swedish Energy Agency (STEM) for the regulation of electricity distribution companies. Both theoretical analysis and calculations of an example network area are presented in this document to find the major directing effects of the model. The parameters of NPAM, which are used in the calculations of this research report, were dated on 30th of March 2004. These parameters were most recent available at the time when analysis was done. However, since NPAM is under development, the parameters have been constantly changing. Therefore slightly changes in the results can occur if calculations were made with latest parameters. However, main conclusions are same and do not depend on exact parameters. (orig.)

Multiobjective Bak-Sneppen model on a small-world network

International Nuclear Information System (INIS)

Elettreby, M.F.

2005-01-01

Small-world networks (SWN) are relevant to biological systems. We study the dynamics of the Bak-Sneppen (BS) model on small-world network, including the concepts of extremal dynamics, multiobjective optimization and coherent noise. We find that the small-world structure stabilizes the system. Also, it is more realistic to augment the Bak-Sneppen model by these concepts

Multiobjective Bak-Sneppen model on a small-world network

International Nuclear Information System (INIS)

Elettreby, M.

2004-09-01

Small-world networks (SWN) are relevant to biological systems. We study the dynamics of the Bak-Sneppen (BS) model on small-world network, including the concepts of extremal dynamics, multiobjective optimization and coherent noise. We find that the small-world structure stabilizes the system. Also, it is more realistic to augment the Bak-Sneppen model by these concepts. (author)

Friendship Dissolution Within Social Networks Modeled Through Multilevel Event History Analysis

Science.gov (United States)

Dean, Danielle O.; Bauer, Daniel J.; Prinstein, Mitchell J.

2018-01-01

A social network perspective can bring important insight into the processes that shape human behavior. Longitudinal social network data, measuring relations between individuals over time, has become increasingly common—as have the methods available to analyze such data. A friendship duration model utilizing discrete-time multilevel survival analysis with a multiple membership random effect structure is developed and applied here to study the processes leading to undirected friendship dissolution within a larger social network. While the modeling framework is introduced in terms of understanding friendship dissolution, it can be used to understand microlevel dynamics of a social network more generally. These models can be fit with standard generalized linear mixed-model software, after transforming the data to a pair-period data set. An empirical example highlights how the model can be applied to understand the processes leading to friendship dissolution between high school students, and a simulation study is used to test the use of the modeling framework under representative conditions that would be found in social network data. Advantages of the modeling framework are highlighted, and potential limitations and future directions are discussed. PMID:28463022

A Quantum Implementation Model for Artificial Neural Networks

Directory of Open Access Journals (Sweden)

Ammar Daskin

2018-02-01

Full Text Available The learning process for multilayered neural networks with many nodes makes heavy demands on computational resources. In some neural network models, the learning formulas, such as the Widrow–Hoff formula, do not change the eigenvectors of the weight matrix while flatting the eigenvalues. In infinity, these iterative formulas result in terms formed by the principal components of the weight matrix, namely, the eigenvectors corresponding to the non-zero eigenvalues. In quantum computing, the phase estimation algorithm is known to provide speedups over the conventional algorithms for the eigenvalue-related problems. Combining the quantum amplitude amplification with the phase estimation algorithm, a quantum implementation model for artificial neural networks using the Widrow–Hoff learning rule is presented. The complexity of the model is found to be linear in the size of the weight matrix. This provides a quadratic improvement over the classical algorithms. Quanta 2018; 7: 7–18.

Models for QoS-Aware Capacity Management in Cable Access Networks

NARCIS (Netherlands)

Attema, T.; van den Berg, Hans Leo; Kempker, P.C.; Worm, D.; van der Vliet-Hameeteman, C.

In this article, mathematical models are presented that “map‿ measured or predicted network utilisations to user throughputs for given network configurations (segment capacity, subscription speeds etc.). They provide valuable insights into the user experience in cable access networks. The models,

Limitations of demand- and pressure-driven modeling for large deficient networks

Science.gov (United States)

Braun, Mathias; Piller, Olivier; Deuerlein, Jochen; Mortazavi, Iraj

2017-10-01

The calculation of hydraulic state variables for a network is an important task in managing the distribution of potable water. Over the years the mathematical modeling process has been improved by numerous researchers for utilization in new computer applications and the more realistic modeling of water distribution networks. But, in spite of these continuous advances, there are still a number of physical phenomena that may not be tackled correctly by current models. This paper will take a closer look at the two modeling paradigms given by demand- and pressure-driven modeling. The basic equations are introduced and parallels are drawn with the optimization formulations from electrical engineering. These formulations guarantee the existence and uniqueness of the solution. One of the central questions of the French and German research project ResiWater is the investigation of the network resilience in the case of extreme events or disasters. Under such extraordinary conditions where models are pushed beyond their limits, we talk about deficient network models. Examples of deficient networks are given by highly regulated flow, leakage or pipe bursts and cases where pressure falls below the vapor pressure of water. These examples will be presented and analyzed on the solvability and physical correctness of the solution with respect to demand- and pressure-driven models.

A general model for metabolic scaling in self-similar asymmetric networks.

Directory of Open Access Journals (Sweden)

Alexander Byers Brummer

2017-03-01

Full Text Available How a particular attribute of an organism changes or scales with its body size is known as an allometry. Biological allometries, such as metabolic scaling, have been hypothesized to result from selection to maximize how vascular networks fill space yet minimize internal transport distances and resistances. The West, Brown, Enquist (WBE model argues that these two principles (space-filling and energy minimization are (i general principles underlying the evolution of the diversity of biological networks across plants and animals and (ii can be used to predict how the resulting geometry of biological networks then governs their allometric scaling. Perhaps the most central biological allometry is how metabolic rate scales with body size. A core assumption of the WBE model is that networks are symmetric with respect to their geometric properties. That is, any two given branches within the same generation in the network are assumed to have identical lengths and radii. However, biological networks are rarely if ever symmetric. An open question is: Does incorporating asymmetric branching change or influence the predictions of the WBE model? We derive a general network model that relaxes the symmetric assumption and define two classes of asymmetrically bifurcating networks. We show that asymmetric branching can be incorporated into the WBE model. This asymmetric version of the WBE model results in several theoretical predictions for the structure, physiology, and metabolism of organisms, specifically in the case for the cardiovascular system. We show how network asymmetry can now be incorporated in the many allometric scaling relationships via total network volume. Most importantly, we show that the 3/4 metabolic scaling exponent from Kleiber's Law can still be attained within many asymmetric networks.