iGNM 2.0: the Gaussian network model database for biomolecular structural dynamics.
Li, Hongchun; Chang, Yuan-Yu; Yang, Lee-Wei; Bahar, Ivet
2016-01-04
Gaussian network model (GNM) is a simple yet powerful model for investigating the dynamics of proteins and their complexes. GNM analysis became a broadly used method for assessing the conformational dynamics of biomolecular structures with the development of a user-friendly interface and database, iGNM, in 2005. We present here an updated version, iGNM 2.0 http://gnmdb.csb.pitt.edu/, which covers more than 95% of the structures currently available in the Protein Data Bank (PDB). Advanced search and visualization capabilities, both 2D and 3D, permit users to retrieve information on inter-residue and inter-domain cross-correlations, cooperative modes of motion, the location of hinge sites and energy localization spots. The ability of iGNM 2.0 to provide structural dynamics data on the large majority of PDB structures and, in particular, on their biological assemblies makes it a useful resource for establishing the bridge between structure, dynamics and function. © The Author(s) 2015. Published by Oxford University Press on behalf of Nucleic Acids Research.
Beusen, A.H.W.; van Beek, L.P.H.; Bouwman, Lex; Mogollon, J.M.; Middelburg, J.B.M.
2015-01-01
The Integrated Model to Assess the Global Environment–Global Nutrient Model (IMAGE–GNM) is a global distributed, spatially explicit model using hydrology as the basis for describing nitrogen (N) and phosphorus (P) delivery to surface water, transport and in-stream retention in rivers, lakes,
Beusen, A. H. W.; Van Beek, L. P. H.; Bouwman, A. F.; Mogollón, J. M.; Middelburg, J. J.
2015-12-01
The Integrated Model to Assess the Global Environment-Global Nutrient Model (IMAGE-GNM) is a global distributed, spatially explicit model using hydrology as the basis for describing nitrogen (N) and phosphorus (P) delivery to surface water, transport and in-stream retention in rivers, lakes, wetlands and reservoirs. It is part of the integrated assessment model IMAGE, which studies the interaction between society and the environment over prolonged time periods. In the IMAGE-GNM model, grid cells receive water with dissolved and suspended N and P from upstream grid cells; inside grid cells, N and P are delivered to water bodies via diffuse sources (surface runoff, shallow and deep groundwater, riparian zones; litterfall in floodplains; atmospheric deposition) and point sources (wastewater); N and P retention in a water body is calculated on the basis of the residence time of the water and nutrient uptake velocity; subsequently, water and nutrients are transported to downstream grid cells. Differences between model results and observed concentrations for a range of global rivers are acceptable given the global scale of the uncalibrated model. Sensitivity analysis with data for the year 2000 showed that runoff is a major factor for N and P delivery, retention and river export. For both N and P, uptake velocity and all factors used to compute the subgrid in-stream retention are important for total in-stream retention and river export. Soil N budgets, wastewater and all factors determining litterfall in floodplains are important for N delivery to surface water. For P the factors that determine the P content of the soil (soil P content and bulk density) are important factors for delivery and river export.
Sauerwald, Natalie; Zhang, She; Kingsford, Carl; Bahar, Ivet
2017-04-20
Understanding the three-dimensional (3D) architecture of chromatin and its relation to gene expression and regulation is fundamental to understanding how the genome functions. Advances in Hi-C technology now permit us to study 3D genome organization, but we still lack an understanding of the structural dynamics of chromosomes. The dynamic couplings between regions separated by large genomic distances (>50 Mb) have yet to be characterized. We adapted a well-established protein-modeling framework, the Gaussian Network Model (GNM), to model chromatin dynamics using Hi-C data. We show that the GNM can identify spatial couplings at multiple scales: it can quantify the correlated fluctuations in the positions of gene loci, find large genomic compartments and smaller topologically-associating domains (TADs) that undergo en bloc movements, and identify dynamically coupled distal regions along the chromosomes. We show that the predictions of the GNM correlate well with genome-wide experimental measurements. We use the GNM to identify novel cross-correlated distal domains (CCDDs) representing pairs of regions distinguished by their long-range dynamic coupling and show that CCDDs are associated with increased gene co-expression. Together, these results show that GNM provides a mathematically well-founded unified framework for modeling chromatin dynamics and assessing the structural basis of genome-wide observations. © The Author(s) 2017. Published by Oxford University Press on behalf of Nucleic Acids Research.
Zhang, Hua; Jiang, Tao; Shan, Guogen
2016-01-01
Residue fluctuations in protein structures have been shown to be highly associated with various protein functions. Gaussian network model (GNM), a simple representative coarse-grained model, was widely adopted to reveal function-related protein dynamics. We directly utilized the high frequency modes generated by GNM and further performed Gaussian Naive Bayes (GNB) to identify hot spot residues. Two coding schemes about the feature vectors were implemented with varying distance cutoffs for GNM and sliding window sizes for GNB based on tenfold cross validations: one by using only a single high mode and the other by combining multiple modes with the highest frequency. Our proposed methods outperformed the previous work that did not directly utilize the high frequency modes generated by GNM, with regard to overall performance evaluated using F1 measure. Moreover, we found that inclusion of more high frequency modes for a GNB classifier can significantly improve the sensitivity. The present study provided additional valuable insights into the relation between the hot spots and the residue fluctuations.
Su, Ji-Guo; Zhang, Xiao; Han, Xiao-Ming; Zhao, Shu-Xin; Li, Chun-Hua
2015-12-11
Antibodies have been increasingly used as pharmaceuticals in clinical treatment. Thermal stability and unfolding process are important properties that must be considered in antibody design. In this paper, the structure-encoded dynamical properties and the unfolding process of the Fab fragment of the phosphocholine-binding antibody McPC603 are investigated by use of the normal mode analysis of Gaussian network model (GNM). Firstly, the temperature factors for the residues of the protein were calculated with GNM and then compared with the experimental measurements. A good result was obtained, which provides the validity for the use of GNM to study the dynamical properties of the protein. Then, with this approach, the mean-square fluctuation (MSF) of the residues, as well as the MSF in the internal distance (MSFID) between all pairwise residues, was calculated to investigate the mobility and flexibility of the protein, respectively. It is found that the mobility and flexibility of the constant regions are higher than those of the variable regions, and the six complementarity-determining regions (CDRs) in the variable regions also exhibit relative large mobility and flexibility. The large amplitude motions of the CDRs are considered to be associated with the immune function of the antibody. In addition, the unfolding process of the protein was simulated by iterative use of the GNM. In our method, only the topology of protein native structure is taken into account, and the protein unfolding process is simulated through breaking the native contacts one by one according to the MSFID values between the residues. It is found that the flexible regions tend to unfold earlier. The sequence of the unfolding events obtained by our method is consistent with the hydrogen-deuterium exchange experimental results. Our studies imply that the unfolding behavior of the Fab fragment of antibody McPc603 is largely determined by the intrinsic dynamics of the protein.
Srivastava, Amit; Granek, Rony
2015-02-01
Motivated by single molecule experiments, we study thermal unfolding pathways of four proteins, chymotrypsin inhibitor, barnase, ubiquitin, and adenylate kinase, using bond network models that combine bond energies and elasticity. The protein elasticity is described by the Gaussian network model (GNM), to which we add prescribed bond binding energies that are assigned to all (nonbackbone) connecting bonds in the GNM of native state and assumed identical for simplicity. Using exact calculation of the Helmholtz free energy for this model, we consider bond rupture single events. The bond designated for rupture is chosen by minimizing the free-energy difference for the process, over all (nonbackbone) bonds in the network. Plotting the free-energy profile along this pathway at different temperatures, we observe a few major partial unfolding, metastable or stable, states, that are separated by free-energy barriers and change role as the temperature is raised. In particular, for adenylate kinase we find three major partial unfolding states, which is consistent with single molecule FRET experiments [Pirchi et al., Nat. Commun. 2, 493 (2011), 10.1038/ncomms1504] for which hidden Markov analysis reveals between three and five such states. Such states can play a major role in enzymatic activity.
Chennubhotla, Chakra; Rader, A. J.; Yang, Lee-Wei; Bahar, Ivet
2005-12-01
With advances in structure genomics, it is now recognized that knowledge of structure alone is insufficient to understand and control the mechanisms of biomolecular function. Additional information in the form of dynamics is needed. As demonstrated in a large number of studies, the machinery of proteins and their complexes can be understood to a good approximation by adopting Gaussian (or elastic) network models (GNM) for simplified normal mode analyses. While this approximation lacks chemical details, it provides us with a means for assessing the collective motions of large structures/assemblies and perform a comparative analysis of a series of proteins, thus providing insights into the mechanical aspects of biomolecular dynamics. In this paper, we discuss recent applications of GNM to a series of enzymes as well as large structures such as the HK97 bacteriophage viral capsids. Understanding the dynamics of large protein structures can be computationally challenging. To this end, we introduce a new approach for building a hierarchical, reduced rank representation of the protein topology and consequently the fluctuation dynamics.
Collaborative networks: Reference modeling
Camarinha-Matos, L.M.; Afsarmanesh, H.
2008-01-01
Collaborative Networks: Reference Modeling works to establish a theoretical foundation for Collaborative Networks. Particular emphasis is put on modeling multiple facets of collaborative networks and establishing a comprehensive modeling framework that captures and structures diverse perspectives of
Modeling the citation network by network cosmology.
Xie, Zheng; Ouyang, Zhenzheng; Zhang, Pengyuan; Yi, Dongyun; Kong, Dexing
2015-01-01
Citation between papers can be treated as a causal relationship. In addition, some citation networks have a number of similarities to the causal networks in network cosmology, e.g., the similar in-and out-degree distributions. Hence, it is possible to model the citation network using network cosmology. The casual network models built on homogenous spacetimes have some restrictions when describing some phenomena in citation networks, e.g., the hot papers receive more citations than other simultaneously published papers. We propose an inhomogenous causal network model to model the citation network, the connection mechanism of which well expresses some features of citation. The node growth trend and degree distributions of the generated networks also fit those of some citation networks well.
Modeling the citation network by network cosmology.
Directory of Open Access Journals (Sweden)
Zheng Xie
Full Text Available Citation between papers can be treated as a causal relationship. In addition, some citation networks have a number of similarities to the causal networks in network cosmology, e.g., the similar in-and out-degree distributions. Hence, it is possible to model the citation network using network cosmology. The casual network models built on homogenous spacetimes have some restrictions when describing some phenomena in citation networks, e.g., the hot papers receive more citations than other simultaneously published papers. We propose an inhomogenous causal network model to model the citation network, the connection mechanism of which well expresses some features of citation. The node growth trend and degree distributions of the generated networks also fit those of some citation networks well.
DEFF Research Database (Denmark)
Andersen, Kasper Winther
Three main topics are presented in this thesis. The first and largest topic concerns network modelling of functional Magnetic Resonance Imaging (fMRI) and Diffusion Weighted Imaging (DWI). In particular nonparametric Bayesian methods are used to model brain networks derived from resting state f...... for their ability to reproduce node clustering and predict unseen data. Comparing the models on whole brain networks, BCD and IRM showed better reproducibility and predictability than IDM, suggesting that resting state networks exhibit community structure. This also points to the importance of using models, which...... allow for complex interactions between all pairs of clusters. In addition, it is demonstrated how the IRM can be used for segmenting brain structures into functionally coherent clusters. A new nonparametric Bayesian network model is presented. The model builds upon the IRM and can be used to infer...
Artificial neural network modelling
Samarasinghe, Sandhya
2016-01-01
This book covers theoretical aspects as well as recent innovative applications of Artificial Neural networks (ANNs) in natural, environmental, biological, social, industrial and automated systems. It presents recent results of ANNs in modelling small, large and complex systems under three categories, namely, 1) Networks, Structure Optimisation, Robustness and Stochasticity 2) Advances in Modelling Biological and Environmental Systems and 3) Advances in Modelling Social and Economic Systems. The book aims at serving undergraduates, postgraduates and researchers in ANN computational modelling. .
Modeling network technology deployment rates with different network models
Chung, Yoo
2011-01-01
To understand the factors that encourage the deployment of a new networking technology, we must be able to model how such technology gets deployed. We investigate how network structure influences deployment with a simple deployment model and different network models through computer simulations. The results indicate that a realistic model of networking technology deployment should take network structure into account.
Real-time process optimization based on grey-box neural models
Directory of Open Access Journals (Sweden)
F. A. Cubillos
2007-09-01
Full Text Available This paper investigates the feasibility of using grey-box neural models (GNM in Real Time Optimization (RTO. These models are based on a suitable combination of fundamental conservation laws and neural networks, being used in at least two different ways: to complement available phenomenological knowledge with empirical information, or to reduce dimensionality of complex rigorous physical models. We have observed that the benefits of using these simple adaptable models are counteracted by some difficulties associated with the solution of the optimization problem. Nonlinear Programming (NLP algorithms failed in finding the global optimum due to the fact that neural networks can introduce multimodal objective functions. One alternative considered to solve this problem was the use of some kind of evolutionary algorithms, like Genetic Algorithms (GA. Although these algorithms produced better results in terms of finding the appropriate region, they took long periods of time to reach the global optimum. It was found that a combination of genetic and nonlinear programming algorithms can be use to fast obtain the optimum solution. The proposed approach was applied to the Williams-Otto reactor, considering three different GNM models of increasing complexity. Results demonstrated that the use of GNM models and mixed GA/NLP optimization algorithms is a promissory approach for solving dynamic RTO problems.
Modeling Epidemic Network Failures
DEFF Research Database (Denmark)
Ruepp, Sarah Renée; Fagertun, Anna Manolova
2013-01-01
This paper presents the implementation of a failure propagation model for transport networks when multiple failures occur resulting in an epidemic. We model the Susceptible Infected Disabled (SID) epidemic model and validate it by comparing it to analytical solutions. Furthermore, we evaluate...
Models of educational institutions' networking
Shilova Olga Nikolaevna
2015-01-01
The importance of educational institutions' networking in modern sociocultural conditions and a definition of networking in education are presented in the article. The results of research levels, methods and models of educational institutions' networking are presented and substantially disclosed.
Techniques for Modelling Network Security
Lech Gulbinovič
2012-01-01
The article compares modelling techniques for network security, including the theory of probability, Markov processes, Petri networks and application of stochastic activity networks. The paper introduces the advantages and disadvantages of the above proposed methods and accepts the method of modelling the network of stochastic activity as one of the most relevant. The stochastic activity network allows modelling the behaviour of the dynamic system where the theory of probability is inappropri...
Modeling Network Interdiction Tasks
2015-09-17
allow professionals and families to stay in touch through voice or video calls. Power grids provide electricity to homes , offices, and recreational...instances using IBMr ILOGr CPLEXr Optimization Studio V12.6. For each instance, two solutions are deter- mined. First, the MNDP-a model is solved with no...three values: 0.25, 0.50, or 0.75. The DMP-a model is solved for the various random network instances using IBMr ILOGr CPLEXr Optimization Studio V12.6
Directory of Open Access Journals (Sweden)
Xing-Yuan Li
2015-12-01
Full Text Available Mycobacterium tuberculosis l-alanine dehydrogenase (l-MtAlaDH plays an important role in catalyzing l-alanine to ammonia and pyruvate, which has been considered to be a potential target for tuberculosis treatment. In the present work, the functional domain motions encoded in the structure of l-MtAlaDH were investigated by using the Gaussian network model (GNM and the anisotropy network model (ANM. The slowest modes for the open-apo and closed-holo structures of the enzyme show that the domain motions have a common hinge axis centered in residues Met133 and Met301. Accompanying the conformational transition, both the 1,4-dihydronicotinamide adenine dinucleotide (NAD-binding domain (NBD and the substrate-binding domain (SBD move in a highly coupled way. The first three slowest modes of ANM exhibit the open-closed, rotation and twist motions of l-MtAlaDH, respectively. The calculation of the fast modes reveals the residues responsible for the stability of the protein, and some of them are involved in the interaction with the ligand. Then, the functionally-important residues relevant to the binding of the ligand were identified by using a thermodynamic method. Our computational results are consistent with the experimental data, which will help us to understand the physical mechanism for the function of l-MtAlaDH.
Coevolutionary modeling in network formation
Al-Shyoukh, Ibrahim
2014-12-03
Network coevolution, the process of network topology evolution in feedback with dynamical processes over the network nodes, is a common feature of many engineered and natural networks. In such settings, the change in network topology occurs at a comparable time scale to nodal dynamics. Coevolutionary modeling offers the possibility to better understand how and why network structures emerge. For example, social networks can exhibit a variety of structures, ranging from almost uniform to scale-free degree distributions. While current models of network formation can reproduce these structures, coevolutionary modeling can offer a better understanding of the underlying dynamics. This paper presents an overview of recent work on coevolutionary models of network formation, with an emphasis on the following three settings: (i) dynamic flow of benefits and costs, (ii) transient link establishment costs, and (iii) latent preferential attachment.
Do Network Models Just Model Networks? On The Applicability of Network-Oriented Modeling
Treur, J.; Shmueli, Erez
2017-01-01
In this paper for a Network-Oriented Modelling perspective based on temporal-causal networks it is analysed how generic and applicable it is as a general modelling approach and as a computational paradigm. This results in an answer to the question in the title different from: network models just
A Hybrid 3D Indoor Space Model
Directory of Open Access Journals (Sweden)
A. Jamali
2016-10-01
Full Text Available GIS integrates spatial information and spatial analysis. An important example of such integration is for emergency response which requires route planning inside and outside of a building. Route planning requires detailed information related to indoor and outdoor environment. Indoor navigation network models including Geometric Network Model (GNM, Navigable Space Model, sub-division model and regular-grid model lack indoor data sources and abstraction methods. In this paper, a hybrid indoor space model is proposed. In the proposed method, 3D modeling of indoor navigation network is based on surveying control points and it is less dependent on the 3D geometrical building model. This research proposes a method of indoor space modeling for the buildings which do not have proper 2D/3D geometrical models or they lack semantic or topological information. The proposed hybrid model consists of topological, geometrical and semantical space.
A polar orbit for the Mars Global Network Mission
Knocke, Philip
1990-01-01
The purpose of the Global Network Mission (GNM) is to deploy simple landers on the Martian surface in late 1998. The objective is to create a globally distributed network of ground stations which will collect environmental data, perhaps for as long as several years. The GNM presents unique mission design challenges, which are addressed by the following essay. The GNM mission concept calls for two carrier spacecraft, each equipped with a number of simple landers. Some of the landers may be deployed from approach, either to reduce carrier mass prior to orbit insertion, or to reach latitudes not available from the carrier orbit. The remaining landers are deployed from orbit. One configuration for the Global Network Mission was proposed in a report from the Exploration Precursors Task Team to the Office of Space Science and Applications. This formed the basis of a previous orbit design for the GNM. This mission scenario is used as a point of reference, but results from the current study are generally applicable to a wide range of GNM mission variants. The analysis concluded that a 1/5 sol, polar orbit with a periapse altitude of 275 km offers the best circumstances for orbital deployment of the Global Network Mission landers. It allows easy polar access at nominal entry angles, and global dispersal of landing sites at lighting angles suitable for descent imaging. The polar orbit allows the option of deploying all the landers from orbit. A wait interval of 160 days after arrival is required before deployment can commence.
Modeling semiflexible polymer networks
Broedersz, Chase P.; MacKintosh, Fred C.
2014-01-01
Here, we provide an overview of theoretical approaches to semiflexible polymers and their networks. Such semiflexible polymers have large bending rigidities that can compete with the entropic tendency of a chain to crumple up into a random coil. Many studies on semiflexible polymers and their assemblies have been motivated by their importance in biology. Indeed, crosslinked networks of semiflexible polymers form a major structural component of tissue and living cells. Reconstituted networks o...
Complex Networks in Psychological Models
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.
Developing Personal Network Business Models
DEFF Research Database (Denmark)
Saugstrup, Dan; Henten, Anders
2006-01-01
on the 'state of the art' in the field of business modeling. Furthermore, the paper suggests three generic business models for PNs: a service oriented model, a self-organized model, and a combination model. Finally, examples of relevant services and applications in relation to three different cases......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...... are presented and analyzed in light of business modeling of PN....
A model of coauthorship networks
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
2016-11-09
standpoint remains more of an art than a science . Even when well executed, the ongoing evolution of the network may violate initial, security-critical design...from a security standpoint remains more of an art than a science . Even when well executed, the ongoing evolution of the network may violate initial...is outside the scope of this paper. As such, we focus on event probabilities. The output of the network porosity model is a stream of timestamped
Telecommunications network modelling, planning and design
Evans, Sharon
2003-01-01
Telecommunication Network Modelling, Planning and Design addresses sophisticated modelling techniques from the perspective of the communications industry and covers some of the major issues facing telecommunications network engineers and managers today. Topics covered include network planning for transmission systems, modelling of SDH transport network structures and telecommunications network design and performance modelling, as well as network costs and ROI modelling and QoS in 3G networks.
Campus network security model study
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.
Neural network modeling of emotion
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.
Modeling semiflexible polymer networks
Broedersz, C.P.; MacKintosh, F.C.
2014-01-01
This is an overview of theoretical approaches to semiflexible polymers and their networks. Such semiflexible polymers have large bending rigidities that can compete with the entropic tendency of a chain to crumple up into a random coil. Many studies on semiflexible polymers and their assemblies have
Mobility Model for Tactical Networks
Rollo, Milan; Komenda, Antonín
In this paper a synthetic mobility model which represents behavior and movement pattern of heterogeneous units in disaster relief and battlefield scenarios is proposed. These operations usually take place in environment without preexisting communication infrastructure and units thus have to be connected by wireless communication network. Units cooperate to fulfill common tasks and communication network has to serve high amount of communication requests, especially data, voice and video stream transmissions. To verify features of topology control, routing and interaction protocols software simulations are usually used, because of their scalability, repeatability and speed. Behavior of all these protocols relies on the mobility model of the network nodes, which has to resemble real-life movement pattern. Proposed mobility model is goal-driven and provides support for various types of units, group mobility and realistic environment model with obstacles. Basic characteristics of the mobility model like node spatial distribution and average node degree were analyzed.
Modelling freeway networks by hybrid stochastic models
Boel, R.; Mihaylova, L.
2004-01-01
Traffic flow on freeways is a nonlinear, many-particle phenomenon, with complex interactions between the vehicles. This paper presents a stochastic hybrid model of freeway traffic at a time scale and at a level of detail suitable for on-line flow estimation, for routing and ramp metering control. The model describes the evolution of continuous and discrete state variables. The freeway is considered as a network of components, each component representing a different section of the network. The...
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 Multilayer Model of Computer Networks
Shchurov, Andrey A.
2015-01-01
The fundamental concept of applying the system methodology to network analysis declares that network architecture should take into account services and applications which this network provides and supports. This work introduces a formal model of computer networks on the basis of the hierarchical multilayer networks. In turn, individual layers are represented as multiplex networks. The concept of layered networks provides conditions of top-down consistency of the model. Next, we determined the...
Data modeling of network dynamics
Jaenisch, Holger M.; Handley, James W.; Faucheux, Jeffery P.; Harris, Brad
2004-01-01
This paper highlights Data Modeling theory and its use for text data mining as a graphical network search engine. Data Modeling is then used to create a real-time filter capable of monitoring network traffic down to the port level for unusual dynamics and changes in business as usual. This is accomplished in an unsupervised fashion without a priori knowledge of abnormal characteristics. Two novel methods for converting streaming binary data into a form amenable to graphics based search and change detection are introduced. These techniques are then successfully applied to 1999 KDD Cup network attack data log-on sessions to demonstrate that Data Modeling can detect attacks without prior training on any form of attack behavior. Finally, two new methods for data encryption using these ideas are proposed.
Thermal Network Modelling Handbook
1972-01-01
Thermal mathematical modelling is discussed in detail. A three-fold purpose was established: (1) to acquaint the new user with the terminology and concepts used in thermal mathematical modelling, (2) to present the more experienced and occasional user with quick formulas and methods for solving everyday problems, coupled with study cases which lend insight into the relationships that exist among the various solution techniques and parameters, and (3) to begin to catalog in an orderly fashion the common formulas which may be applied to automated conversational language techniques.
Network Models of Mechanical Assemblies
Whitney, Daniel E.
Recent network research has sought to characterize complex systems with a number of statistical metrics, such as power law exponent (if any), clustering coefficient, community behavior, and degree correlation. Use of such metrics represents a choice of level of abstraction, a balance of generality and detailed accuracy. It has been noted that "social networks" consistently display clustering coefficients that are higher than those of random or generalized random networks, that they have small world properties such as short path lengths, and that they have positive degree correlations (assortative mixing). "Technological" or "non-social" networks display many of these characteristics except that they generally have negative degree correlations (disassortative mixing). [Newman 2003i] In this paper we examine network models of mechanical assemblies. Such systems are well understood functionally. We show that there is a cap on their average nodal degree and that they have negative degree correlations (disassortative mixing). We identify specific constraints arising from first principles, their structural patterns, and engineering practice that suggest why they have these properties. In addition, we note that their main "motif" is closed loops (as it is for electric and electronic circuits), a pattern that conventional network analysis does not detect but which is used by software intended to aid in the design of such systems.
Service entity network virtualization architecture and model
Jin, Xue-Guang; Shou, Guo-Chu; Hu, Yi-Hong; Guo, Zhi-Gang
2017-07-01
Communication network can be treated as a complex network carrying a variety of services and service can be treated as a network composed of functional entities. There are growing interests in multiplex service entities where individual entity and link can be used for different services simultaneously. Entities and their relationships constitute a service entity network. In this paper, we introduced a service entity network virtualization architecture including service entity network hierarchical model, service entity network model, service implementation and deployment of service entity networks. Service entity network oriented multiplex planning model were also studied and many of these multiplex models were characterized by a significant multiplex of the links or entities in different service entity network. Service entity networks were mapped onto shared physical resources by dynamic resource allocation controller. The efficiency of the proposed architecture was illustrated in a simulation environment that allows for comparative performance evaluation. The results show that, compared to traditional networking architecture, this architecture has a better performance.
Polymer networks: Modeling and applications
Masoud, Hassan
Polymer networks are an important class of materials that are ubiquitously found in natural, biological, and man-made systems. The complex mesoscale structure of these soft materials has made it difficult for researchers to fully explore their properties. In this dissertation, we introduce a coarse-grained computational model for permanently cross-linked polymer networks than can properly capture common properties of these materials. We use this model to study several practical problems involving dry and solvated networks. Specifically, we analyze the permeability and diffusivity of polymer networks under mechanical deformations, we examine the release of encapsulated solutes from microgel capsules during volume transitions, and we explore the complex tribological behavior of elastomers. Our simulations reveal that the network transport properties are defined by the network porosity and by the degree of network anisotropy due to mechanical deformations. In particular, the permeability of mechanically deformed networks can be predicted based on the alignment of network filaments that is characterized by a second order orientation tensor. Moreover, our numerical calculations demonstrate that responsive microcapsules can be effectively utilized for steady and pulsatile release of encapsulated solutes. We show that swollen gel capsules allow steady, diffusive release of nanoparticles and polymer chains, whereas gel deswelling causes burst-like discharge of solutes driven by an outward flow of the solvent initially enclosed within a shrinking capsule. We further demonstrate that this hydrodynamic release can be regulated by introducing rigid microscopic rods in the capsule interior. We also probe the effects of velocity, temperature, and normal load on the sliding of elastomers on smooth and corrugated substrates. Our friction simulations predict a bell-shaped curve for the dependence of the friction coefficient on the sliding velocity. Our simulations also illustrate
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......, 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....... Working through these cases, students will learn to manage and evaluate realistic intelligence accounts....
CNEM: Cluster Based Network Evolution Model
Directory of Open Access Journals (Sweden)
Sarwat Nizamani
2015-01-01
Full Text Available This paper presents a network evolution model, which is based on the clustering approach. The proposed approach depicts the network evolution, which demonstrates the network formation from individual nodes to fully evolved network. An agglomerative hierarchical clustering method is applied for the evolution of network. In the paper, we present three case studies which show the evolution of the networks from the scratch. These case studies include: terrorist network of 9/11 incidents, terrorist network of WMD (Weapons Mass Destruction plot against France and a network of tweets discussing a topic. The network of 9/11 is also used for evaluation, using other social network analysis methods which show that the clusters created using the proposed model of network evolution are of good quality, thus the proposed method can be used by law enforcement agencies in order to further investigate the criminal networks
Biological transportation networks: Modeling and simulation
Albi, Giacomo
2015-09-15
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 and angiogenesis) and ion transportation networks (e.g., neural networks) is explained in detail and basic analytical features like the gradient flow structure of the fluid transportation network model and the impact of the model parameters on the geometry and topology of network formation are analyzed. We also present a numerical finite-element based discretization scheme and discuss sample cases of network formation simulations.
Mathematical Modelling Plant Signalling Networks
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.
Energy modelling in sensor networks
Directory of Open Access Journals (Sweden)
D. Schmidt
2007-06-01
Full Text Available 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.
Probabilistic logic modeling of network reliability for hybrid network architectures
Energy Technology Data Exchange (ETDEWEB)
Wyss, G.D.; Schriner, H.K.; Gaylor, T.R.
1996-10-01
Sandia National Laboratories has found that the reliability and failure modes of current-generation network technologies can be effectively modeled using fault tree-based probabilistic logic modeling (PLM) techniques. We have developed fault tree models that include various hierarchical networking technologies and classes of components interconnected in a wide variety of typical and atypical configurations. In this paper we discuss the types of results that can be obtained from PLMs and why these results are of great practical value to network designers and analysts. After providing some mathematical background, we describe the `plug-and-play` fault tree analysis methodology that we have developed for modeling connectivity and the provision of network services in several current- generation network architectures. Finally, we demonstrate the flexibility of the method by modeling the reliability of a hybrid example network that contains several interconnected ethernet, FDDI, and token ring segments. 11 refs., 3 figs., 1 tab.
Generalization performance of regularized neural network models
DEFF Research Database (Denmark)
Larsen, Jan; Hansen, Lars Kai
1994-01-01
Architecture optimization is a fundamental problem of neural network modeling. The optimal architecture is defined as the one which minimizes the generalization error. This paper addresses estimation of the generalization performance of regularized, complete neural network models. Regularization...
Plant Growth Models Using Artificial Neural Networks
Bubenheim, David
1997-01-01
In this paper, we descrive our motivation and approach to devloping models and the neural network architecture. Initial use of the artificial neural network for modeling the single plant process of transpiration is presented.
Introducing Synchronisation in Deterministic Network Models
DEFF Research Database (Denmark)
Schiøler, Henrik; Jessen, Jan Jakob; Nielsen, Jens Frederik D.
2006-01-01
The paper addresses performance analysis for distributed real time systems through deterministic network modelling. Its main contribution is the introduction and analysis of models for synchronisation between tasks and/or network elements. Typical patterns of synchronisation are presented leading...
Modeling the Dynamics of Compromised Networks
Energy Technology Data Exchange (ETDEWEB)
Soper, B; Merl, D M
2011-09-12
Accurate predictive models of compromised networks would contribute greatly to improving the effectiveness and efficiency of the detection and control of network attacks. Compartmental epidemiological models have been applied to modeling attack vectors such as viruses and worms. We extend the application of these models to capture a wider class of dynamics applicable to cyber security. By making basic assumptions regarding network topology we use multi-group epidemiological models and reaction rate kinetics to model the stochastic evolution of a compromised network. The Gillespie Algorithm is used to run simulations under a worst case scenario in which the intruder follows the basic connection rates of network traffic as a method of obfuscation.
GNM-NIPALS: Estimación general no métrica y no lineal por mínimos cuadrados parciales iterativos
Directory of Open Access Journals (Sweden)
Tomás Aluja
2014-04-01
Full Text Available En este trabajo se desarrolla GNM-NIPALS para formar parte de los métodos NM-PLS, el cual permite cuantificar las variables cualitativas de una matriz de datos mixtos mediante una función lineal de k componentes principales, tipo reconstitución, maximizando la inercia en el plano k- dimensional asociado al ACP de la matriz así cuantificada. Es entonces una generalización del algoritmo NM-NIPALS que usa solo la primera componente principal en la cuantificación de variables cualitativas. De la maximización y positividad de la razón de correlación entre cada variable cualitativa y la función reconstituida, se tiene que la inercia acumulada en el plano k-dimensional asociado a la función de cuantificación del mismo rango, es mayor o igual que la generada en planos de igual dimensión pero con funciones de cuantificación de diferente rango. Con las k componentes principales asociadas a la matriz así cuantificada, se desarrolla el análisis de inercia saturada para evaluar si aún existe una dimensión k∗< k, a partir de la cual la inercia acumulada en los ejes de orden igual o superior ya esta explicada, caso en el cual la función de cuantificación definitiva es de rango menor (k∗.
RMBNToolbox: random models for biochemical networks
Directory of Open Access Journals (Sweden)
Niemi Jari
2007-05-01
Full Text Available Abstract Background There is an increasing interest to model biochemical and cell biological networks, as well as to the computational analysis of these models. The development of analysis methodologies and related software is rapid in the field. However, the number of available models is still relatively small and the model sizes remain limited. The lack of kinetic information is usually the limiting factor for the construction of detailed simulation models. Results We present a computational toolbox for generating random biochemical network models which mimic real biochemical networks. The toolbox is called Random Models for Biochemical Networks. The toolbox works in the Matlab environment, and it makes it possible to generate various network structures, stoichiometries, kinetic laws for reactions, and parameters therein. The generation can be based on statistical rules and distributions, and more detailed information of real biochemical networks can be used in situations where it is known. The toolbox can be easily extended. The resulting network models can be exported in the format of Systems Biology Markup Language. Conclusion While more information is accumulating on biochemical networks, random networks can be used as an intermediate step towards their better understanding. Random networks make it possible to study the effects of various network characteristics to the overall behavior of the network. Moreover, the construction of artificial network models provides the ground truth data needed in the validation of various computational methods in the fields of parameter estimation and data analysis.
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.
An acoustical model based monitoring network
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
An adaptive complex network model for brain functional networks.
Directory of Open Access Journals (Sweden)
Ignacio J Gomez Portillo
Full Text Available Brain functional networks are graph representations of activity in the brain, where the vertices represent anatomical regions and the edges their functional connectivity. These networks present a robust small world topological structure, characterized by highly integrated modules connected sparsely by long range links. Recent studies showed that other topological properties such as the degree distribution and the presence (or absence of a hierarchical structure are not robust, and show different intriguing behaviors. In order to understand the basic ingredients necessary for the emergence of these complex network structures we present an adaptive complex network model for human brain functional networks. The microscopic units of the model are dynamical nodes that represent active regions of the brain, whose interaction gives rise to complex network structures. The links between the nodes are chosen following an adaptive algorithm that establishes connections between dynamical elements with similar internal states. We show that the model is able to describe topological characteristics of human brain networks obtained from functional magnetic resonance imaging studies. In particular, when the dynamical rules of the model allow for integrated processing over the entire network scale-free non-hierarchical networks with well defined communities emerge. On the other hand, when the dynamical rules restrict the information to a local neighborhood, communities cluster together into larger ones, giving rise to a hierarchical structure, with a truncated power law degree distribution.
Modeling gene regulatory networks: A network simplification algorithm
Ferreira, Luiz Henrique O.; de Castro, Maria Clicia S.; da Silva, Fabricio A. B.
2016-12-01
Boolean networks have been used for some time to model Gene Regulatory Networks (GRNs), which describe cell functions. Those models can help biologists to make predictions, prognosis and even specialized treatment when some disturb on the GRN lead to a sick condition. However, the amount of information related to a GRN can be huge, making the task of inferring its boolean network representation quite a challenge. The method shown here takes into account information about the interactome to build a network, where each node represents a protein, and uses the entropy of each node as a key to reduce the size of the network, allowing the further inferring process to focus only on the main protein hubs, the ones with most potential to interfere in overall network behavior.
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
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
Марк Миколайович Орел
2015-01-01
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
Modeling Diagnostic Assessments with Bayesian Networks
Almond, Russell G.; DiBello, Louis V.; Moulder, Brad; Zapata-Rivera, Juan-Diego
2007-01-01
This paper defines Bayesian network models and examines their applications to IRT-based cognitive diagnostic modeling. These models are especially suited to building inference engines designed to be synchronous with the finer grained student models that arise in skills diagnostic assessment. Aspects of the theory and use of Bayesian network models…
Bayesian Network Webserver: a comprehensive tool for biological network modeling.
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.
Object Oriented Modeling Of Social Networks
Zeggelink, Evelien P.H.; Oosten, Reinier van; Stokman, Frans N.
1996-01-01
The aim of this paper is to explain principles of object oriented modeling in the scope of modeling dynamic social networks. As such, the approach of object oriented modeling is advocated within the field of organizational research that focuses on networks. We provide a brief introduction into the
Bayesian estimation of the network autocorrelation model
Dittrich, D.; Leenders, R.T.A.J.; Mulder, J.
2017-01-01
The network autocorrelation model has been extensively used by researchers interested modeling social influence effects in social networks. The most common inferential method in the model is classical maximum likelihood estimation. This approach, however, has known problems such as negative bias of
Agent-based modeling and network dynamics
Namatame, Akira
2016-01-01
The book integrates agent-based modeling and network science. It is divided into three parts, namely, foundations, primary dynamics on and of social networks, and applications. The book begins with the network origin of agent-based models, known as cellular automata, and introduce a number of classic models, such as Schelling’s segregation model and Axelrod’s spatial game. The essence of the foundation part is the network-based agent-based models in which agents follow network-based decision rules. Under the influence of the substantial progress in network science in late 1990s, these models have been extended from using lattices into using small-world networks, scale-free networks, etc. The book also shows that the modern network science mainly driven by game-theorists and sociophysicists has inspired agent-based social scientists to develop alternative formation algorithms, known as agent-based social networks. The book reviews a number of pioneering and representative models in this family. Upon the gi...
Modeling data throughput on communication networks
Energy Technology Data Exchange (ETDEWEB)
Eldridge, J.M.
1993-11-01
New challenges in high performance computing and communications are driving the need for fast, geographically distributed networks. Applications such as modeling physical phenomena, interactive visualization, large data set transfers, and distributed supercomputing require high performance networking [St89][Ra92][Ca92]. One measure of a communication network`s performance is the time it takes to complete a task -- such as transferring a data file or displaying a graphics image on a remote monitor. Throughput, defined as the ratio of the number of useful data bits transmitted per the time required to transmit those bits, is a useful gauge of how well a communication system meets this performance measure. This paper develops and describes an analytical model of throughput. The model is a tool network designers can use to predict network throughput. It also provides insight into those parts of the network that act as a performance bottleneck.
Settings in Social Networks : a Measurement Model
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
Settings in social networks : A measurement model
Schweinberger, M; Snijders, TAB
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
Spinal Cord Injury Model System Information Network
... the UAB-SCIMS Contact the UAB-SCIMS UAB Spinal Cord Injury Model System Newly Injured Health Daily Living Consumer ... Information Network The University of Alabama at Birmingham Spinal Cord Injury Model System (UAB-SCIMS) maintains this Information Network ...
Radio Channel Modeling in Body Area Networks
An, L.; Bentum, Marinus Jan; Meijerink, Arjan; Scanlon, W.G.
2009-01-01
A body area network (BAN) is a network of bodyworn or implanted electronic devices, including wireless sensors which can monitor body parameters or to de- tect movements. One of the big challenges in BANs is the propagation channel modeling. Channel models can be used to understand wave propagation
Radio channel modeling in body area networks
An, L.; Bentum, Marinus Jan; Meijerink, Arjan; Scanlon, W.G.
2010-01-01
A body area network (BAN) is a network of bodyworn or implanted electronic devices, including wireless sensors which can monitor body parameters or to detect movements. One of the big challenges in BANs is the propagation channel modeling. Channel models can be used to understand wave propagation in
Network interconnections: an architectural reference model
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
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.
Learning Bayesian Network Model Structure from Data
National Research Council Canada - National Science Library
Margaritis, Dimitris
2003-01-01
In this thesis I address the important problem of the determination of the structure of directed statistical models, with the widely used class of Bayesian network models as a concrete vehicle of my ideas...
NC truck network model development research.
2008-09-01
This research develops a validated prototype truck traffic network model for North Carolina. The model : includes all counties and metropolitan areas of North Carolina and major economic areas throughout the : U.S. Geographic boundaries, population a...
Network models in economics and finance
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.
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......A complex network is a systems in which a discrete set of units interact in a quantifiable manner. Representing systems as complex networks have become increasingly popular in a variety of scientific fields including biology, social sciences and economics. Parallel to this development 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...
A Network Formation Model Based on Subgraphs
Chandrasekhar, Arun
2016-01-01
We develop a new class of random-graph models for the statistical estimation of network formation that allow for substantial correlation in links. Various subgraphs (e.g., links, triangles, cliques, stars) are generated and their union results in a network. We provide estimation techniques for recovering the rates at which the underlying subgraphs were formed. We illustrate the models via a series of applications including testing for incentives to form cross-caste relationships in rural India, testing to see whether network structure is used to enforce risk-sharing, testing as to whether networks change in response to a community's exposure to microcredit, and show that these models significantly outperform stochastic block models in matching observed network characteristics. We also establish asymptotic properties of the models and various estimators, which requires proving a new Central Limit Theorem for correlated random variables.
Gossip spread in social network Models
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.
Synergistic effects in threshold models on networks
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.
Optimized null model for protein structure networks.
Milenković, Tijana; Filippis, Ioannis; Lappe, Michael; Przulj, Natasa
2009-06-26
Much attention has recently been given to the statistical significance of topological features observed in biological networks. Here, we consider residue interaction graphs (RIGs) as network representations of protein structures with residues as nodes and inter-residue interactions as edges. Degree-preserving randomized models have been widely used for this purpose in biomolecular networks. However, such a single summary statistic of a network may not be detailed enough to capture the complex topological characteristics of protein structures and their network counterparts. Here, we investigate a variety of topological properties of RIGs to find a well fitting network null model for them. The RIGs are derived from a structurally diverse protein data set at various distance cut-offs and for different groups of interacting atoms. We compare the network structure of RIGs to several random graph models. We show that 3-dimensional geometric random graphs, that model spatial relationships between objects, provide the best fit to RIGs. We investigate the relationship between the strength of the fit and various protein structural features. We show that the fit depends on protein size, structural class, and thermostability, but not on quaternary structure. We apply our model to the identification of significantly over-represented structural building blocks, i.e., network motifs, in protein structure networks. As expected, choosing geometric graphs as a null model results in the most specific identification of motifs. Our geometric random graph model may facilitate further graph-based studies of protein conformation space and have important implications for protein structure comparison and prediction. The choice of a well-fitting null model is crucial for finding structural motifs that play an important role in protein folding, stability and function. To our knowledge, this is the first study that addresses the challenge of finding an optimized null model for RIGs, by
Optimized null model for protein structure networks.
Directory of Open Access Journals (Sweden)
Tijana Milenković
Full Text Available Much attention has recently been given to the statistical significance of topological features observed in biological networks. Here, we consider residue interaction graphs (RIGs as network representations of protein structures with residues as nodes and inter-residue interactions as edges. Degree-preserving randomized models have been widely used for this purpose in biomolecular networks. However, such a single summary statistic of a network may not be detailed enough to capture the complex topological characteristics of protein structures and their network counterparts. Here, we investigate a variety of topological properties of RIGs to find a well fitting network null model for them. The RIGs are derived from a structurally diverse protein data set at various distance cut-offs and for different groups of interacting atoms. We compare the network structure of RIGs to several random graph models. We show that 3-dimensional geometric random graphs, that model spatial relationships between objects, provide the best fit to RIGs. We investigate the relationship between the strength of the fit and various protein structural features. We show that the fit depends on protein size, structural class, and thermostability, but not on quaternary structure. We apply our model to the identification of significantly over-represented structural building blocks, i.e., network motifs, in protein structure networks. As expected, choosing geometric graphs as a null model results in the most specific identification of motifs. Our geometric random graph model may facilitate further graph-based studies of protein conformation space and have important implications for protein structure comparison and prediction. The choice of a well-fitting null model is crucial for finding structural motifs that play an important role in protein folding, stability and function. To our knowledge, this is the first study that addresses the challenge of finding an optimized null model
Towards Reproducible Descriptions of Neuronal Network Models
Nordlie, Eilen; Gewaltig, Marc-Oliver; Plesser, Hans Ekkehard
2009-01-01
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. PMID:19662159
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.
Characterization and Modeling of Network Traffic
DEFF Research Database (Denmark)
Shawky, Ahmed; Bergheim, Hans; Ragnarsson, Olafur
2011-01-01
This paper attempts to characterize and model backbone network traffic, using a small number of statistics. In order to reduce cost and processing power associated with traffic analysis. The parameters affecting the behaviour of network traffic are investigated and the choice is that inter......-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....... The model investigates the traffic generation mechanisms, and grouping traffic into flows and applications....
Modeling, Optimization & Control of Hydraulic Networks
DEFF Research Database (Denmark)
Tahavori, Maryamsadat
2014-01-01
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....... 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...... to solve nonlinear optimal control problems. In the water supply system model, the hydraulic resistance of the valve is estimated by real data and it is considered to be a disturbance. The disturbance in our system is updated every 24 hours based on the amount of water usage by consumers every day. Model...
A network model of the interbank market
Li, Shouwei; He, Jianmin; Zhuang, Yaming
2010-12-01
This work introduces a network model of an interbank market based on interbank credit lending relationships. It generates some network features identified through empirical analysis. The critical issue to construct an interbank network is to decide the edges among banks, which is realized in this paper based on the interbank’s degree of trust. Through simulation analysis of the interbank network model, some typical structural features are identified in our interbank network, which are also proved to exist in real interbank networks. They are namely, a low clustering coefficient and a relatively short average path length, community structures, and a two-power-law distribution of out-degree and in-degree.
Model for Microcirculation Transportation Network Design
Directory of Open Access Journals (Sweden)
Qun Chen
2012-01-01
Full Text Available The idea of microcirculation transportation was proposed to shunt heavy traffic on arterial roads through branch roads. The optimization model for designing micro-circulation transportation network was developed to pick out branch roads as traffic-shunting channels and determine their required capacity, trying to minimize the total reconstruction expense and land occupancy subject to saturation and reconstruction space constraints, while accounting for the route choice behaviour of network users. Since micro-circulation transportation network design problem includes both discrete and continuous variables, a discretization method was developed to convert two groups of variables (discrete variables and continuous variables into one group of new discrete variables, transforming the mixed network design problem into a new kind of discrete network design problem with multiple values. The genetic algorithm was proposed to solve the new discrete network design problem. Finally a numerical example demonstrated the efficiency of the model and algorithm.
Modelling of virtual production networks
Directory of Open Access Journals (Sweden)
2011-03-01
Full Text Available Nowadays many companies, especially small and medium-sized enterprises (SMEs, specialize in a limited field of production. It requires forming virtual production networks of cooperating enterprises to manufacture better, faster and cheaper. Apart from that, some production orders cannot be realized, because there is not a company of sufficient production potential. In this case the virtual production networks of cooperating companies can realize these production orders. These networks have larger production capacity and many different resources. Therefore it can realize many more production orders together than each of them separately. Such organization allows for executing high quality product. The maintenance costs of production capacity and used resources are not so high. In this paper a methodology of rapid prototyping of virtual production networks is proposed. It allows to execute production orders on time considered existing logistic constraints.
Modeling Epidemics Spreading on Social Contact Networks.
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.
Random graph models for dynamic networks
Zhang, Xiao; Moore, Cristopher; Newman, Mark E. J.
2017-10-01
Recent theoretical work on the modeling of network structure has focused primarily on networks that are static and unchanging, but many real-world networks change their structure over time. There exist natural generalizations to the dynamic case of many static network models, including the classic random graph, the configuration model, and the stochastic block model, where one assumes that the appearance and disappearance of edges are governed by continuous-time Markov processes with rate parameters that can depend on properties of the nodes. Here we give an introduction to this class of models, showing for instance how one can compute their equilibrium properties. We also demonstrate their use in data analysis and statistical inference, giving efficient algorithms for fitting them to observed network data using the method of maximum likelihood. This allows us, for example, to estimate the time constants of network evolution or infer community structure from temporal network data using cues embedded both in the probabilities over time that node pairs are connected by edges and in the characteristic dynamics of edge appearance and disappearance. We illustrate these methods with a selection of applications, both to computer-generated test networks and real-world examples.
Modeling the interdependent network based on two-mode networks
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.
An endogenous model of the credit network
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.
Tensor network models of multiboundary wormholes
Peach, Alex; Ross, Simon F.
2017-05-01
We study the entanglement structure of states dual to multiboundary wormhole geometries using tensor network models. Perfect and random tensor networks tiling the hyperbolic plane have been shown to provide good models of the entanglement structure in holography. We extend this by quotienting the plane by discrete isometries to obtain models of the multiboundary states. We show that there are networks where the entanglement structure is purely bipartite, extending results obtained in the large temperature limit. We analyse the entanglement structure in a range of examples.
Stochastic discrete model of karstic networks
Jaquet, O.; Siegel, P.; Klubertanz, G.; Benabderrhamane, H.
Karst aquifers are characterised by an extreme spatial heterogeneity that strongly influences their hydraulic behaviour and the transport of pollutants. These aquifers are particularly vulnerable to contamination because of their highly permeable networks of conduits. A stochastic model is proposed for the simulation of the geometry of karstic networks at a regional scale. The model integrates the relevant physical processes governing the formation of karstic networks. The discrete simulation of karstic networks is performed with a modified lattice-gas cellular automaton for a representative description of the karstic aquifer geometry. Consequently, more reliable modelling results can be obtained for the management and the protection of karst aquifers. The stochastic model was applied jointly with groundwater modelling techniques to a regional karst aquifer in France for the purpose of resolving surface pollution issues.
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....
Queueing Models for Mobile Ad Hoc Networks
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
Modelling traffic congestion using queuing networks
Indian Academy of Sciences (India)
Traffic Flow-Density diagrams are obtained using simple Jackson queuing network analysis. Such simple analytical models can be used to capture the effect of non- homogenous traffic. Keywords. Flow-density curves; uninterrupted traffic; Jackson networks. 1. Introduction. Traffic management has become very essential in ...
Mathematical model of highways network optimization
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.
Modeling trust context in networks
Adali, Sibel
2013-01-01
We make complex decisions every day, requiring trust in many different entities for different reasons. These decisions are not made by combining many isolated trust evaluations. Many interlocking factors play a role, each dynamically impacting the others.? In this brief, 'trust context' is defined as the system level description of how the trust evaluation process unfolds.Networks today are part of almost all human activity, supporting and shaping it. Applications increasingly incorporate new interdependencies and new trust contexts. Social networks connect people and organizations throughout
Model-based control of networked systems
Garcia, Eloy; Montestruque, Luis A
2014-01-01
This monograph introduces a class of networked control systems (NCS) called model-based networked control systems (MB-NCS) and presents various architectures and control strategies designed to improve the performance of NCS. The overall performance of NCS considers the appropriate use of network resources, particularly network bandwidth, in conjunction with the desired response of the system being controlled. The book begins with a detailed description of the basic MB-NCS architecture that provides stability conditions in terms of state feedback updates . It also covers typical problems in NCS such as network delays, network scheduling, and data quantization, as well as more general control problems such as output feedback control, nonlinear systems stabilization, and tracking control. Key features and topics include: Time-triggered and event-triggered feedback updates Stabilization of uncertain systems subject to time delays, quantization, and extended absence of feedback Optimal control analysis and ...
Complex networks repair strategies: Dynamic models
Fu, Chaoqi; Wang, Ying; Gao, Yangjun; Wang, Xiaoyang
2017-09-01
Network repair strategies are tactical methods that restore the efficiency of damaged networks; however, unreasonable repair strategies not only waste resources, they are also ineffective for network recovery. Most extant research on network repair focuses on static networks, but results and findings on static networks cannot be applied to evolutionary dynamic networks because, in dynamic models, complex network repair has completely different characteristics. For instance, repaired nodes face more severe challenges, and require strategic repair methods in order to have a significant effect. In this study, we propose the Shell Repair Strategy (SRS) to minimize the risk of secondary node failures due to the cascading effect. Our proposed method includes the identification of a set of vital nodes that have a significant impact on network repair and defense. Our identification of these vital nodes reduces the number of switching nodes that face the risk of secondary failures during the dynamic repair process. This is positively correlated with the size of the average degree 〈 k 〉 and enhances network invulnerability.
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.
Gene Regulation Networks for Modeling Drosophila Development
Mjolsness, E.
1999-01-01
This chapter will very briefly introduce and review some computational experiments in using trainable gene regulation network models to simulate and understand selected episodes in the development of the fruit fly, Drosophila Melanogaster.
Graphical Model Theory for Wireless Sensor Networks
Energy Technology Data Exchange (ETDEWEB)
Davis, William B.
2002-12-08
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.
Mitigating risk during strategic supply network modeling
Müssigmann, Nikolaus
2006-01-01
Mitigating risk during strategic supply network modeling. - In: Managing risks in supply chains / ed. by Wolfgang Kersten ... - Berlin : Schmidt, 2006. - S. 213-226. - (Operations and technology management ; 1)
Road maintenance planning using network flow modelling
Yang, Chao; Remenyte-Prescott, Rasa; Andrews, John
2015-01-01
This paper presents a road maintenance planning model that can be used to balance out maintenance cost and road user cost, since performing road maintenance at night can be convenient for road users but costly for highway agency. Based on the platform of the network traffic flow modelling, the traffic through the worksite and its adjacent road links is evaluated. Thus, maintenance arrangements at a worksite can be optimized considering the overall network performance. In addition, genetic alg...
Posterior Predictive Model Checking in Bayesian Networks
Crawford, Aaron
2014-01-01
This simulation study compared the utility of various discrepancy measures within a posterior predictive model checking (PPMC) framework for detecting different types of data-model misfit in multidimensional Bayesian network (BN) models. The investigated conditions were motivated by an applied research program utilizing an operational complex…
A simple model for studying interacting networks
Liu, Wenjia; Jolad, Shivakumar; Schmittmann, Beate; Zia, R. K. P.
2011-03-01
Many specific physical networks (e.g., internet, power grid, interstates), have been characterized in considerable detail, but in isolation from each other. Yet, each of these networks supports the functions of the others, and so far, little is known about how their interactions affect their structure and functionality. To address this issue, we consider two coupled model networks. Each network is relatively simple, with a fixed set of nodes, but dynamically generated set of links which has a preferred degree, κ . In the stationary state, the degree distribution has exponential tails (far from κ), an attribute which we can explain. Next, we consider two such networks with different κ 's, reminiscent of two social groups, e.g., extroverts and introverts. Finally, we let these networks interact by establishing a controllable fraction of cross links. The resulting distribution of links, both within and across the two model networks, is investigated and discussed, along with some potential consequences for real networks. Supported in part by NSF-DMR-0705152 and 1005417.
Modeling gene regulatory network motifs using Statecharts.
Fioravanti, Fabio; Helmer-Citterich, Manuela; Nardelli, Enrico
2012-03-28
Gene regulatory networks are widely used by biologists to describe the interactions among genes, proteins and other components at the intra-cellular level. Recently, a great effort has been devoted to give gene regulatory networks a formal semantics based on existing computational frameworks.For this purpose, we consider Statecharts, which are a modular, hierarchical and executable formal model widely used to represent software systems. We use Statecharts for modeling small and recurring patterns of interactions in gene regulatory networks, called motifs. We present an improved method for modeling gene regulatory network motifs using Statecharts and we describe the successful modeling of several motifs, including those which could not be modeled or whose models could not be distinguished using the method of a previous proposal.We model motifs in an easy and intuitive way by taking advantage of the visual features of Statecharts. Our modeling approach is able to simulate some interesting temporal properties of gene regulatory network motifs: the delay in the activation and the deactivation of the "output" gene in the coherent type-1 feedforward loop, the pulse in the incoherent type-1 feedforward loop, the bistability nature of double positive and double negative feedback loops, the oscillatory behavior of the negative feedback loop, and the "lock-in" effect of positive autoregulation. We present a Statecharts-based approach for the modeling of gene regulatory network motifs in biological systems. The basic motifs used to build more complex networks (that is, simple regulation, reciprocal regulation, feedback loop, feedforward loop, and autoregulation) can be faithfully described and their temporal dynamics can be analyzed.
Neural network approaches for noisy language modeling.
Li, Jun; Ouazzane, Karim; Kazemian, Hassan B; Afzal, Muhammad Sajid
2013-11-01
Text entry from people is not only grammatical and distinct, but also noisy. For example, a user's typing stream contains all the information about the user's interaction with computer using a QWERTY keyboard, which may include the user's typing mistakes as well as specific vocabulary, typing habit, and typing performance. In particular, these features are obvious in disabled users' typing streams. This paper proposes a new concept called noisy language modeling by further developing information theory and applies neural networks to one of its specific application-typing stream. This paper experimentally uses a neural network approach to analyze the disabled users' typing streams both in general and specific ways to identify their typing behaviors and subsequently, to make typing predictions and typing corrections. In this paper, a focused time-delay neural network (FTDNN) language model, a time gap model, a prediction model based on time gap, and a probabilistic neural network model (PNN) are developed. A 38% first hitting rate (HR) and a 53% first three HR in symbol prediction are obtained based on the analysis of a user's typing history through the FTDNN language modeling, while the modeling results using the time gap prediction model and the PNN model demonstrate that the correction rates lie predominantly in between 65% and 90% with the current testing samples, and 70% of all test scores above basic correction rates, respectively. The modeling process demonstrates that a neural network is a suitable and robust language modeling tool to analyze the noisy language stream. The research also paves the way for practical application development in areas such as informational analysis, text prediction, and error correction by providing a theoretical basis of neural network approaches for noisy language modeling.
A quantum-implementable neural network model
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.
Telestroke network business model strategies.
Fanale, Christopher V; Demaerschalk, Bart M
2012-10-01
Our objective is to summarize the evidence that supports the reliability of telemedicine for diagnosis and efficacy in acute stroke treatment, identify strategies for funding the development of a telestroke network, and to present issues with respect to economic sustainability, cost effectiveness, and the status of reimbursement for telestroke. Copyright © 2012 National Stroke Association. Published by Elsevier Inc. All rights reserved.
Complex networks under dynamic repair model
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.
Markov State Models of gene regulatory networks.
Chu, Brian K; Tse, Margaret J; Sato, Royce R; Read, Elizabeth L
2017-02-06
Gene regulatory networks with dynamics characterized by multiple stable states underlie cell fate-decisions. Quantitative models that can link molecular-level knowledge of gene regulation to a global understanding of network dynamics have the potential to guide cell-reprogramming strategies. Networks are often modeled by the stochastic Chemical Master Equation, but methods for systematic identification of key properties of the global dynamics are currently lacking. The method identifies the number, phenotypes, and lifetimes of long-lived states for a set of common gene regulatory network models. Application of transition path theory to the constructed Markov State Model decomposes global dynamics into a set of dominant transition paths and associated relative probabilities for stochastic state-switching. In this proof-of-concept study, we found that the Markov State Model provides a general framework for analyzing and visualizing stochastic multistability and state-transitions in gene networks. Our results suggest that this framework-adopted from the field of atomistic Molecular Dynamics-can be a useful tool for quantitative Systems Biology at the network scale.
Performance modeling, stochastic networks, and statistical multiplexing
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
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
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.
Optimal transportation networks models and theory
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 Transfer Learning Approach for Network Modeling
Huang, Shuai; Li, Jing; Chen, Kewei; Wu, Teresa; Ye, Jieping; Wu, Xia; Yao, Li
2012-01-01
Networks models have been widely used in many domains to characterize the interacting relationship between physical entities. A typical problem faced is to identify the networks of multiple related tasks that share some similarities. In this case, a transfer learning approach that can leverage the knowledge gained during the modeling of one task to help better model another task is highly desirable. In this paper, we propose a transfer learning approach, which adopts a Bayesian hierarchical model framework to characterize task relatedness and additionally uses the L1-regularization to ensure robust learning of the networks with limited sample sizes. A method based on the Expectation-Maximization (EM) algorithm is further developed to learn the networks from data. Simulation studies are performed, which demonstrate the superiority of the proposed transfer learning approach over single task learning that learns the network of each task in isolation. The proposed approach is also applied to identification of brain connectivity networks of Alzheimer’s disease (AD) from functional magnetic resonance image (fMRI) data. The findings are consistent with the AD literature. PMID:24526804
Modelling complex networks by random hierarchical graphs
Directory of Open Access Journals (Sweden)
M.Wróbel
2008-06-01
Full Text Available Numerous complex networks contain special patterns, called network motifs. These are specific subgraphs, which occur oftener than in randomized networks of Erdős-Rényi type. We choose one of them, the triangle, and build a family of random hierarchical graphs, being Sierpiński gasket-based graphs with random "decorations". We calculate the important characteristics of these graphs - average degree, average shortest path length, small-world graph family characteristics. They depend on probability of decorations. We analyze the Ising model on our graphs and describe its critical properties using a renormalization-group technique.
A Network Model of Credit Risk Contagion
Directory of Open Access Journals (Sweden)
Ting-Qiang Chen
2012-01-01
Full Text Available A network model of credit risk contagion is presented, in which the effect of behaviors of credit risk holders and the financial market regulators and the network structure are considered. By introducing the stochastic dominance theory, we discussed, respectively, the effect mechanisms of the degree of individual relationship, individual attitude to credit risk contagion, the individual ability to resist credit risk contagion, the monitoring strength of the financial market regulators, and the network structure on credit risk contagion. Then some derived and proofed propositions were verified through numerical simulations.
Deep space network software cost estimation model
Tausworthe, R. C.
1981-01-01
A parametric software cost estimation model prepared for Jet PRopulsion Laboratory (JPL) Deep Space Network (DSN) Data System implementation tasks is described. The resource estimation mdel modifies and combines a number of existing models. The model calibrates the task magnitude and difficulty, development environment, and software technology effects through prompted responses to a set of approximately 50 questions. Parameters in the model are adjusted to fit JPL software life-cycle statistics.
Continuum Modeling of Biological Network Formation
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.
Stochastic modeling and analysis of telecoms networks
Decreusefond, Laurent
2012-01-01
This book addresses the stochastic modeling of telecommunication networks, introducing the main mathematical tools for that purpose, such as Markov processes, real and spatial point processes and stochastic recursions, and presenting a wide list of results on stability, performances and comparison of systems.The authors propose a comprehensive mathematical construction of the foundations of stochastic network theory: Markov chains, continuous time Markov chains are extensively studied using an original martingale-based approach. A complete presentation of stochastic recursions from an
Neural networks as models of psychopathology.
Aakerlund, L; Hemmingsen, R
1998-04-01
Neural network modeling is situated between neurobiology, cognitive science, and neuropsychology. The structural and functional resemblance with biological computation has made artificial neural networks (ANN) useful for exploring the relationship between neurobiology and computational performance, i.e., cognition and behavior. This review provides an introduction to the theory of ANN and how they have linked theories from neurobiology and psychopathology in schizophrenia, affective disorders, and dementia.
Decomposed Implicit Models of Piecewise - Linear Networks
Directory of Open Access Journals (Sweden)
J. Brzobohaty
1992-05-01
Full Text Available The general matrix form of the implicit description of a piecewise-linear (PWL network and the symbolic block diagram of the corresponding circuit model are proposed. Their decomposed forms enable us to determine quite separately the existence of the individual breakpoints of the resultant PWL characteristic and their coordinates using independent network parameters. For the two-diode and three-diode cases all the attainable types of the PWL characteristic are introduced.
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...
Empirical generalization assessment of neural network models
DEFF Research Database (Denmark)
Larsen, Jan; Hansen, Lars Kai
1995-01-01
This paper addresses the assessment of generalization performance of neural network models by use of empirical techniques. We suggest to use the cross-validation scheme combined with a resampling technique to obtain an estimate of the generalization performance distribution of a specific model...
Evaluation of EOR Processes Using Network Models
DEFF Research Database (Denmark)
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...
Phenomenological network models: Lessons for epilepsy surgery.
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.
Models of network reliability analysis, combinatorics, and Monte Carlo
Gertsbakh, Ilya B
2009-01-01
Unique in its approach, Models of Network Reliability: Analysis, Combinatorics, and Monte Carlo provides a brief introduction to Monte Carlo methods along with a concise exposition of reliability theory ideas. From there, the text investigates a collection of principal network reliability models, such as terminal connectivity for networks with unreliable edges and/or nodes, network lifetime distribution in the process of its destruction, network stationary behavior for renewable components, importance measures of network elements, reliability gradient, and network optimal reliability synthesis
Delay and Disruption Tolerant Networking MACHETE Model
Segui, John S.; Jennings, Esther H.; Gao, Jay L.
2011-01-01
To verify satisfaction of communication requirements imposed by unique missions, as early as 2000, the Communications Networking Group at the Jet Propulsion Laboratory (JPL) saw the need for an environment to support interplanetary communication protocol design, validation, and characterization. JPL's Multi-mission Advanced Communications Hybrid Environment for Test and Evaluation (MACHETE), described in Simulator of Space Communication Networks (NPO-41373) NASA Tech Briefs, Vol. 29, No. 8 (August 2005), p. 44, combines various commercial, non-commercial, and in-house custom tools for simulation and performance analysis of space networks. The MACHETE environment supports orbital analysis, link budget analysis, communications network simulations, and hardware-in-the-loop testing. As NASA is expanding its Space Communications and Navigation (SCaN) capabilities to support planned and future missions, building infrastructure to maintain services and developing enabling technologies, an important and broader role is seen for MACHETE in design-phase evaluation of future SCaN architectures. To support evaluation of the developing Delay Tolerant Networking (DTN) field and its applicability for space networks, JPL developed MACHETE models for DTN Bundle Protocol (BP) and Licklider/Long-haul Transmission Protocol (LTP). DTN is an Internet Research Task Force (IRTF) architecture providing communication in and/or through highly stressed networking environments such as space exploration and battlefield networks. Stressed networking environments include those with intermittent (predictable and unknown) connectivity, large and/or variable delays, and high bit error rates. To provide its services over existing domain specific protocols, the DTN protocols reside at the application layer of the TCP/IP stack, forming a store-and-forward overlay network. The key capabilities of the Bundle Protocol include custody-based reliability, the ability to cope with intermittent connectivity
A comprehensive Network Security Risk Model for process control networks.
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.
Personalized Learning Network Teaching Model
Feng, Zhou
Adaptive learning system on the salient features, expounded personalized learning is adaptive learning system adaptive to learners key to learning. From the perspective of design theory, put forward an adaptive learning system to learn design thinking individual model, and using data mining techniques, the initial establishment of personalized adaptive systems model of learning.
Synthesis of Reliable Telecommunication Networks
Directory of Open Access Journals (Sweden)
Dusan Trstensky
2005-01-01
Full Text Available In many application, the network designer may to know to senthesise a reliable telecommunication network. Assume that a network, denoted Gm,e has the number of nodes n and the number of edges e, and the operational probability of each edge is known. The system reliability of the network is defined to be the reliability that every pair of nodes can communicate with each other. A network synthesis problem considered in this paper is to find a network G*n,e, that maximises system reliability over the class of all networks for the classes of networks Gn,n-1, Gn,m and Gn,n+1 respectively. In addition an upper bound of maximum reliability for the networks with n-node and e-edge (e>n+2 is derived in terms of node. Computational experiments for the reliability upper are also presented. the results show, that the proposed reliability upper bound is effective.
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.
Model Microvascular Networks Can Have Many Equilibria.
Karst, Nathaniel J; Geddes, John B; Carr, Russell T
2017-03-01
We show that large microvascular networks with realistic topologies, geometries, boundary conditions, and constitutive laws can exhibit many steady-state flow configurations. This is in direct contrast to most previous studies which have assumed, implicitly or explicitly, that a given network can only possess one equilibrium state. While our techniques are general and can be applied to any network, we focus on two distinct network types that model human tissues: perturbed honeycomb networks and random networks generated from Voronoi diagrams. We demonstrate that the disparity between observed and predicted flow directions reported in previous studies might be attributable to the presence of multiple equilibria. We show that the pathway effect, in which hematocrit is steadily increased along a series of diverging junctions, has important implications for equilibrium discovery, and that our estimates of the number of equilibria supported by these networks are conservative. If a more complete description of the plasma skimming effect that captures red blood cell allocation at junctions with high feed hematocrit were to be obtained empirically, then the number of equilibria found by our approach would at worst remain the same and would in all likelihood increase significantly.
PREDIKSI FOREX MENGGUNAKAN MODEL NEURAL NETWORK
Directory of Open Access Journals (Sweden)
R. Hadapiningradja Kusumodestoni
2015-11-01
Full Text Available ABSTRAK Prediksi adalah salah satu teknik yang paling penting dalam menjalankan bisnis forex. Keputusan dalam memprediksi adalah sangatlah penting, karena dengan prediksi dapat membantu mengetahui nilai forex di waktu tertentu kedepan sehingga dapat mengurangi resiko kerugian. Tujuan dari penelitian ini dimaksudkan memprediksi bisnis fores menggunakan model neural network dengan data time series per 1 menit untuk mengetahui nilai akurasi prediksi sehingga dapat mengurangi resiko dalam menjalankan bisnis forex. Metode penelitian pada penelitian ini meliputi metode pengumpulan data kemudian dilanjutkan ke metode training, learning, testing menggunakan neural network. Setelah di evaluasi hasil penelitian ini menunjukan bahwa penerapan algoritma Neural Network mampu untuk memprediksi forex dengan tingkat akurasi prediksi 0.431 +/- 0.096 sehingga dengan prediksi ini dapat membantu mengurangi resiko dalam menjalankan bisnis forex. Kata kunci: prediksi, forex, neural network.
Artificial neural network cardiopulmonary modeling and diagnosis
Kangas, Lars J.; Keller, Paul E.
1997-01-01
The present invention is a method of diagnosing a cardiopulmonary condition in an individual by comparing data from a progressive multi-stage test for the individual to a non-linear multi-variate model, preferably a recurrent artificial neural network having sensor fusion. The present invention relies on a cardiovascular model developed from physiological measurements of an individual. Any differences between the modeled parameters and the parameters of an individual at a given time are used for diagnosis.
Spiking modular neural networks: A neural network modeling approach for hydrological processes
National Research Council Canada - National Science Library
Kamban Parasuraman; Amin Elshorbagy; Sean K. Carey
2006-01-01
.... In this study, a novel neural network model called the spiking modular neural networks (SMNNs) is proposed. An SMNN consists of an input layer, a spiking layer, and an associator neural network layer...
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.
Algebraic Statistics for Network Models
2014-02-19
use algebra, combinatorics and Markov bases to give a constructing way of answering this question for ERGMs of interest. Question 2: How do we model...for every function. 06/06/13 Petrović. Manuscripts 8, 10. Invited lecture at the Scientific Session on Commutative Algebra and Combinatorics at the
Network Modeling and Simulation (NEMSE)
2013-07-01
Prioritized Packet Fragmentation", IEEE Trans. Multimedia , Oct. 2012. [13 SYSENG] . Defense Acquisition Guidebook, Chapter 4 System Engineering, and...2012 IEEE High Performance Extreme Computing Conference (HPEC) poster session [1 Ross]. Motivation Air Force Research Lab needs o Capability...is virtual. These eight virtualizations were: System-in-the-Loop (SITL) using OPNET Modeler, COPE, Field Programmable Gate Array ( FPGA Physical
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.
An evolving model of online bipartite networks
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.
Lan Liu; Ryan K. L. Ko; Guangming Ren; Xiaoping Xu
2017-01-01
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 ne...
An autocatalytic network model for stock markets
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.
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.
A Model of Mental State Transition Network
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.
UAV Trajectory Modeling Using Neural Networks
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.
Propagation models for computing biochemical reaction networks
Henzinger, Thomas A; Mateescu, Maria
2011-01-01
We introduce propagation models, a formalism designed to support general and efficient data structures for the transient analysis of biochemical reaction networks. We give two use cases for propagation abstract data types: the uniformization method and numerical integration. We also sketch an implementation of a propagation abstract data type, which uses abstraction to approximate states.
Modelling crime linkage with Bayesian networks
de Zoete, J.; Sjerps, M.; Lagnado, D.; Fenton, N.
2015-01-01
When two or more crimes show specific similarities, such as a very distinct modus operandi, the probability that they were committed by the same offender becomes of interest. This probability depends on the degree of similarity and distinctiveness. We show how Bayesian networks can be used to model
Lagrangian modeling of switching electrical networks
Scherpen, Jacquelien M.A.; Jeltsema, Dimitri; Klaassens, J. Ben
2003-01-01
In this paper, a general and systematic method is presented to model topologically complete electrical networks, with or without multiple or single switches, within the Euler–Lagrange framework. Apart from the physical insight that can be obtained in this way, the framework has proven to be useful
Computational Modeling of Complex Protein Activity Networks
Schivo, Stefano; Leijten, Jeroen; Karperien, Marcel; Post, Janine N.; Prignet, Claude
2017-01-01
Because of the numerous entities interacting, the complexity of the networks that regulate cell fate makes it impossible to analyze and understand them using the human brain alone. Computational modeling is a powerful method to unravel complex systems. We recently described the development of a
Modeling Network Transition Constraints with Hypergraphs
DEFF Research Database (Denmark)
Harrod, Steven
2011-01-01
values. A directed hypergraph formulation is derived to address railway network sequencing constraints, and an experimental problem sample solved to estimate the magnitude of objective inflation when interaction effects are ignored. The model is used to demonstrate the value of advance scheduling...
A neural network model for texture discrimination.
Xing, J; Gerstein, G L
1993-01-01
A model of texture discrimination in visual cortex was built using a feedforward network with lateral interactions among relatively realistic spiking neural elements. The elements have various membrane currents, equilibrium potentials and time constants, with action potentials and synapses. The model is derived from the modified programs of MacGregor (1987). Gabor-like filters are applied to overlapping regions in the original image; the neural network with lateral excitatory and inhibitory interactions then compares and adjusts the Gabor amplitudes in order to produce the actual texture discrimination. Finally, a combination layer selects and groups various representations in the output of the network to form the final transformed image material. We show that both texture segmentation and detection of texture boundaries can be represented in the firing activity of such a network for a wide variety of synthetic to natural images. Performance details depend most strongly on the global balance of strengths of the excitatory and inhibitory lateral interconnections. The spatial distribution of lateral connective strengths has relatively little effect. Detailed temporal firing activities of single elements in the lateral connected network were examined under various stimulus conditions. Results show (as in area 17 of cortex) that a single element's response to image features local to its receptive field can be altered by changes in the global context.
Propagating semantic information in biochemical network models
Directory of Open Access Journals (Sweden)
Schulz Marvin
2012-01-01
Full Text Available Abstract Background To enable automatic searches, alignments, and model combination, the elements of systems biology models need to be compared and matched across models. Elements can be identified by machine-readable biological annotations, but assigning such annotations and matching non-annotated elements is tedious work and calls for automation. Results A new method called "semantic propagation" allows the comparison of model elements based not only on their own annotations, but also on annotations of surrounding elements in the network. One may either propagate feature vectors, describing the annotations of individual elements, or quantitative similarities between elements from different models. Based on semantic propagation, we align partially annotated models and find annotations for non-annotated model elements. Conclusions Semantic propagation and model alignment are included in the open-source library semanticSBML, available on sourceforge. Online services for model alignment and for annotation prediction can be used at http://www.semanticsbml.org.
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...... 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...... efficiently combines distributed learner models without the need to exchange internal structure of local Bayesian networks, nor local evidence between the involved platforms....
Network traffic model using GIPP and GIBP
Lee, Yong Duk; Van de Liefvoort, Appie; Wallace, Victor L.
1998-10-01
In telecommunication networks, the correlated nature of teletraffic patterns can have significant impact on queuing measures such as queue length, blocking and delay. There is, however, not yet a good general analytical description which can easily incorporate the correlation effect of the traffic, while at the same time maintaining the ease of modeling. The authors have shown elsewhere, that the covariance structures of the generalized Interrupted Poisson Process (GIPP) and the generalized Interrupted Bernoulli Process (GIBP) have an invariance property which makes them reasonably general, yet algebraically manageable, models for representing correlated network traffic. The GIPP and GIBP have a surprisingly rich sets of parameters, yet these invariance properties enable us to easily incorporate the covariance function as well as the interarrival time distribution into the model to better matchobservations. In this paper, we show an application of GIPP and GIBP for matching an analytical model to observed or experimental data.
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....
Modeling Multistandard Wireless Networks in OPNET
DEFF Research Database (Denmark)
Zakrzewska, Anna; Berger, Michael Stübert; Ruepp, Sarah Renée
2011-01-01
Future wireless communication is emerging towards one heterogeneous platform. In this new environment wireless access will be provided by multiple radio technologies that are cooperating and complementing one another. The paper investigates the possibilities of developing such a multistandard...... system using OPNET Modeler. A network model consisting of LTE interworking with WLAN and WiMAX is considered from the radio resource management perspective. In particular, implementing a joint packet scheduler across multiple systems is discussed more in detail....
Modelling dendritic ecological networks in space: anintegrated network perspective
Peterson, Erin E.; Ver Hoef, Jay M.; Isaak, Dan J.; Falke, Jeffrey A.; Fortin, Marie-Josée; Jordon, Chris E.; McNyset, Kristina; Monestiez, Pascal; Ruesch, Aaron S.; Sengupta, Aritra; Som, Nicholas; Steel, E. Ashley; Theobald, David M.; Torgersen, Christian E.; Wenger, Seth J.
2013-01-01
Dendritic ecological networks (DENs) are a unique form of ecological networks that exhibit a dendritic network topology (e.g. stream and cave networks or plant architecture). DENs have a dual spatial representation; as points within the network and as points in geographical space. Consequently, some analytical methods used to quantify relationships in other types of ecological networks, or in 2-D space, may be inadequate for studying the influence of structure and connectivity on ecological processes within DENs. We propose a conceptual taxonomy of network analysis methods that account for DEN characteristics to varying degrees and provide a synthesis of the different approaches within
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....... Such systems are known to be stabilized by spatial structure. Finally, I analyse data from a large mobile phone network and show that people who are topologically close in the network have similar communication patterns. This main part of the thesis is based on six different articles, which I have co...
On traffic modelling in GPRS networks
DEFF Research Database (Denmark)
Madsen, Tatiana Kozlova; Schwefel, Hans-Peter; Prasad, Ramjee
2005-01-01
Optimal design and dimensioning of wireless data networks, such as GPRS, requires the knowledge of traffic characteristics of different data services. This paper presents an in-detail analysis of an IP-level traffic measurements taken in an operational GPRS network. The data measurements reported...... here are done at the Gi interface. The aim of this paper is to reveal some key statistics of GPRS data applications and to validate if the existing traffic models can adequately describe traffic volume and inter-arrival time distribution for different services. Additionally, we present a method of user...
Neural Network Model of memory retrieval
Directory of Open Access Journals (Sweden)
Stefano eRecanatesi
2015-12-01
Full Text Available Human memory can store large amount of information. Nevertheless, recalling is often achallenging task. In a classical free recall paradigm, where participants are asked to repeat abriefly presented list of words, people make mistakes for lists as short as 5 words. We present amodel for memory retrieval based on a Hopfield neural network where transition between itemsare determined by similarities in their long-term memory representations. Meanfield analysis ofthe model reveals stable states of the network corresponding (1 to single memory representationsand (2 intersection between memory representations. We show that oscillating feedback inhibitionin the presence of noise induces transitions between these states triggering the retrieval ofdifferent memories. The network dynamics qualitatively predicts the distribution of time intervalsrequired to recall new memory items observed in experiments. It shows that items having largernumber of neurons in their representation are statistically easier to recall and reveals possiblebottlenecks in our ability of retrieving memories. Overall, we propose a neural network model ofinformation retrieval broadly compatible with experimental observations and is consistent with ourrecent graphical model (Romani et al., 2013.
A improved Network Security Situation Awareness Model
Directory of Open Access Journals (Sweden)
Li Fangwei
2015-08-01
Full Text Available In order to reflect the situation of network security assessment performance fully and accurately, a new network security situation awareness model based on information fusion was proposed. Network security situation is the result of fusion three aspects evaluation. In terms of attack, to improve the accuracy of evaluation, a situation assessment method of DDoS attack based on the information of data packet was proposed. In terms of vulnerability, a improved Common Vulnerability Scoring System (CVSS was raised and maked the assessment more comprehensive. In terms of node weights, the method of calculating the combined weights and optimizing the result by Sequence Quadratic Program (SQP algorithm which reduced the uncertainty of fusion was raised. To verify the validity and necessity of the method, a testing platform was built and used to test through evaluating 2000 DAPRA data sets. Experiments show that the method can improve the accuracy of evaluation results.
Performance modeling, loss networks, and statistical multiplexing
Mazumdar, Ravi
2009-01-01
This monograph presents a concise mathematical approach for modeling and analyzing the performance of communication networks with the aim of understanding the phenomenon of statistical multiplexing. The novelty of the monograph is the fresh approach and insights provided by a sample-path methodology for queueing models that highlights the important ideas of Palm distributions associated with traffic models and their role in performance measures. Also presented are recent ideas of large buffer, and many sources asymptotics that play an important role in understanding statistical multiplexing. I
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.
UAV Trajectory Modeling Using Neural Networks
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
Kinematic Structural Modelling in Bayesian Networks
Schaaf, Alexander; de la Varga, Miguel; Florian Wellmann, J.
2017-04-01
We commonly capture our knowledge about the spatial distribution of distinct geological lithologies in the form of 3-D geological models. Several methods exist to create these models, each with its own strengths and limitations. We present here an approach to combine the functionalities of two modeling approaches - implicit interpolation and kinematic modelling methods - into one framework, while explicitly considering parameter uncertainties and thus model uncertainty. In recent work, we proposed an approach to implement implicit modelling algorithms into Bayesian networks. This was done to address the issues of input data uncertainty and integration of geological information from varying sources in the form of geological likelihood functions. However, one general shortcoming of implicit methods is that they usually do not take any physical constraints into consideration, which can result in unrealistic model outcomes and artifacts. On the other hand, kinematic structural modelling intends to reconstruct the history of a geological system based on physically driven kinematic events. This type of modelling incorporates simplified, physical laws into the model, at the cost of a substantial increment of usable uncertain parameters. In the work presented here, we show an integration of these two different modelling methodologies, taking advantage of the strengths of both of them. First, we treat the two types of models separately, capturing the information contained in the kinematic models and their specific parameters in the form of likelihood functions, in order to use them in the implicit modelling scheme. We then go further and combine the two modelling approaches into one single Bayesian network. This enables the direct flow of information between the parameters of the kinematic modelling step and the implicit modelling step and links the exclusive input data and likelihoods of the two different modelling algorithms into one probabilistic inference framework. In
Systems biology of plant molecular networks: from networks to models
Valentim, F.L.
2015-01-01
Developmental processes are controlled by regulatory networks (GRNs), which are tightly coordinated networks of transcription factors (TFs) that activate and repress gene expression within a spatial and temporal context. In Arabidopsis thaliana, the key components and network structures of the GRNs
Advances in dynamic network modeling in complex transportation systems
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.
A NEURAL OSCILLATOR-NETWORK MODEL OF TEMPORAL PATTERN GENERATION
Schomaker, Lambert
Most contemporary neural network models deal with essentially static, perceptual problems of classification and transformation. Models such as multi-layer feedforward perceptrons generally do not incorporate time as an essential dimension, whereas biological neural networks are inherently temporal
Model of Opinion Spreading in Social Networks
Kanovsky, Igor
2011-01-01
We proposed a new model, which capture the main difference between information and opinion spreading. In information spreading additional exposure to certain information has a small effect. Contrary, when an actor is exposed to 2 opinioned actors the probability to adopt the opinion is significant higher than in the case of contact with one such actor (called by J. Kleinberg "the 0-1-2 effect"). In each time step if an actor does not have an opinion, we randomly choose 2 his network neighbors. If one of them has an opinion, the actor adopts opinion with some low probability, if two - with a higher probability. Opinion spreading was simulated on different real world social networks and similar random scale-free networks. The results show that small world structure has a crucial impact on tipping point time. The "0-1-2" effect causes a significant difference between ability of the actors to start opinion spreading. Actor is an influencer according to his topological position in the network.
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.
Mathematical model for spreading dynamics of social network worms
Sun, Xin; Liu, Yan-Heng; Li, Bin; Li, Jin; Han, Jia-Wei; Liu, Xue-Jie
2012-04-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.
Modeling regulatory networks with weight matrices
DEFF Research Database (Denmark)
Weaver, D.C.; Workman, Christopher; Stormo, Gary D.
1999-01-01
Systematic gene expression analyses provide comprehensive information about the transcriptional responseto different environmental and developmental conditions. With enough gene expression data points,computational biologists may eventually generate predictive computer models of transcription...... regulation.Such models will require computational methodologies consistent with the behavior of known biologicalsystems that remain tractable. We represent regulatory relationships between genes as linear coefficients orweights, with the "net" regulation influence on a gene's expression being...... the mathematical summation of theindependent regulatory inputs. Test regulatory networks generated with this approach display stable andcyclically stable gene expression levels, consistent with known biological systems. We include variables tomodel the effect of environmental conditions on transcription regulation...
Artificial Neural Network Modeling of an Inverse Fluidized Bed ...
African Journals Online (AJOL)
The application of neural networks to model a laboratory scale inverse fluidized bed reactor has been studied. 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 ...
Modeling social influence through network autocorrelation : constructing the weight matrix
Leenders, Roger Th. A. J.
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,
Hsieh, Chih-Sheng; Lee, Lung fei
2017-01-01
In this paper, we model network formation and network interactions under a unified framework. The key feature of our model is to allow individuals to respond to incentives stemming from interaction benefits on certain activities when they choose friends (network links), while capturing homophily in terms of unobserved characteristic variables in network formation and activities. There are two advantages of this modeling approach: first, one can evaluate whether incentives from certain interac...
Challenges on Probabilistic Modeling for Evolving Networks
Ding, Jianguo; Bouvry, Pascal
2013-01-01
With the emerging of new networks, such as wireless sensor networks, vehicle networks, P2P networks, cloud computing, mobile Internet, or social networks, the network dynamics and complexity expands from system design, hardware, software, protocols, structures, integration, evolution, application, even to business goals. Thus the dynamics and uncertainty are unavoidable characteristics, which come from the regular network evolution and unexpected hardware defects, unavoidable software errors,...
Aeronautical telecommunications network advances, challenges, and modeling
Musa, Sarhan M
2015-01-01
Addresses the Challenges of Modern-Day Air Traffic Air traffic control (ATC) directs aircraft in the sky and on the ground to safety, while the Aeronautical Telecommunications Network (ATN) comprises all systems and phases that assist in aircraft departure and landing. The Aeronautical Telecommunications Network: Advances, Challenges, and Modeling focuses on the development of ATN and examines the role of the various systems that link aircraft with the ground. The book places special emphasis on ATC-introducing the modern ATC system from the perspective of the user and the developer-and provides a thorough understanding of the operating mechanism of the ATC system. It discusses the evolution of ATC, explaining its structure and how it works; includes design examples; and describes all subsystems of the ATC system. In addition, the book covers relevant tools, techniques, protocols, and architectures in ATN, including MIPv6, air traffic control (ATC), security of air traffic management (ATM), very-high-frequenc...
Neural Network Program Package for Prosody Modeling
Directory of Open Access Journals (Sweden)
J. Santarius
2004-04-01
Full Text Available This contribution describes the programme for one part of theautomatic Text-to-Speech (TTS synthesis. Some experiments (for example[14] documented the considerable improvement of the naturalness ofsynthetic speech, but this approach requires completing the inputfeature values by hand. This completing takes a lot of time for bigfiles. We need to improve the prosody by other approaches which useonly automatically classified features (input parameters. Theartificial neural network (ANN approach is used for the modeling ofprosody parameters. The program package contains all modules necessaryfor the text and speech signal pre-processing, neural network training,sensitivity analysis, result processing and a module for the creationof the input data protocol for Czech speech synthesizer ARTIC [1].
Towards an evolutionary model of transcription networks.
Directory of Open Access Journals (Sweden)
Dan Xie
2011-06-01
Full Text Available DNA evolution models made invaluable contributions to comparative genomics, although it seemed formidable to include non-genomic features into these models. In order to build an evolutionary model of transcription networks (TNs, we had to forfeit the substitution model used in DNA evolution and to start from modeling the evolution of the regulatory relationships. We present a quantitative evolutionary model of TNs, subjecting the phylogenetic distance and the evolutionary changes of cis-regulatory sequence, gene expression and network structure to one probabilistic framework. Using the genome sequences and gene expression data from multiple species, this model can predict regulatory relationships between a transcription factor (TF and its target genes in all species, and thus identify TN re-wiring events. Applying this model to analyze the pre-implantation development of three mammalian species, we identified the conserved and re-wired components of the TNs downstream to a set of TFs including Oct4, Gata3/4/6, cMyc and nMyc. Evolutionary events on the DNA sequence that led to turnover of TF binding sites were identified, including a birth of an Oct4 binding site by a 2nt deletion. In contrast to recent reports of large interspecies differences of TF binding sites and gene expression patterns, the interspecies difference in TF-target relationship is much smaller. The data showed increasing conservation levels from genomic sequences to TF-DNA interaction, gene expression, TN, and finally to morphology, suggesting that evolutionary changes are larger at molecular levels and smaller at functional levels. The data also showed that evolutionarily older TFs are more likely to have conserved target genes, whereas younger TFs tend to have larger re-wiring rates.
Contributions and challenges for network models in cognitive neuroscience.
Sporns, Olaf
2014-05-01
The confluence of new approaches in recording patterns of brain connectivity and quantitative analytic tools from network science has opened new avenues toward understanding the organization and function of brain networks. Descriptive network models of brain structural and functional connectivity have made several important contributions; for example, in the mapping of putative network hubs and network communities. Building on the importance of anatomical and functional interactions, network models have provided insight into the basic structures and mechanisms that enable integrative neural processes. Network models have also been instrumental in understanding the role of structural brain networks in generating spatially and temporally organized brain activity. Despite these contributions, network models are subject to limitations in methodology and interpretation, and they face many challenges as brain connectivity data sets continue to increase in detail and complexity.
Modeling of regional warehouse network generation
Directory of Open Access Journals (Sweden)
Popov Pavel Vladimirovich
2016-08-01
Full Text Available One of the factors that has a significant impact on the socio-economic development of the Russian Federation’s regions is the logistics infrastructure. It provides integrated transportation and distribution service of material flows. One of the main elements of logistics infrastructure is a storage infrastructure, which includes distribution center, distribution-and-sortout and sortout warehouses. It is the most expedient to place distribution center in the vicinity of the regional center. One of the tasks of the distribution network creation within the regions of the Russian Federation is to determine the location, capacity and number of stores. When determining regional network location of general purpose warehouses methodological approaches to solving the problems of location of production and non-production can be used which depend on various economic factors. The mathematical models for solving relevant problems are the deployment models. However, the existing models focus on the dimensionless power storage. The purpose of the given work is to develop a model to determine the optimal location of general-purpose warehouses on the Russian Federation area. At the first stage of the work, the authors assess the main economic indicators influencing the choice of the location of general purpose warehouses. An algorithm for solving the first stage, based on ABC, discriminant and cluster analysis were proposed by the authors in earlier papers. At the second stage the specific locations of general purpose warehouses and their power is chosen to provide the cost minimization for the construction and subsequent maintenance of warehouses and transportation heterogeneous products. In order to solve this problem the authors developed a mathematical model that takes into account the possibility of delivery in heterogeneous goods from suppliers and manufacturers in the distribution and storage sorting with specified set of capacities. The model allows
Bayesian Recurrent Neural Network for Language Modeling.
Chien, Jen-Tzung; Ku, Yuan-Chu
2016-02-01
A language model (LM) is calculated as the probability of a word sequence that provides the solution to word prediction for a variety of information systems. A recurrent neural network (RNN) is powerful to learn the large-span dynamics of a word sequence in the continuous space. However, the training of the RNN-LM is an ill-posed problem because of too many parameters from a large dictionary size and a high-dimensional hidden layer. This paper presents a Bayesian approach to regularize the RNN-LM and apply it for continuous speech recognition. We aim to penalize the too complicated RNN-LM by compensating for the uncertainty of the estimated model parameters, which is represented by a Gaussian prior. The objective function in a Bayesian classification network is formed as the regularized cross-entropy error function. The regularized model is constructed not only by calculating the regularized parameters according to the maximum a posteriori criterion but also by estimating the Gaussian hyperparameter by maximizing the marginal likelihood. A rapid approximation to a Hessian matrix is developed to implement the Bayesian RNN-LM (BRNN-LM) by selecting a small set of salient outer-products. The proposed BRNN-LM achieves a sparser model than the RNN-LM. Experiments on different corpora show the robustness of system performance by applying the rapid BRNN-LM under different conditions.
Optimizing neural network models: motivation and case studies
Harp, S A; T. Samad
2012-01-01
Practical successes have been achieved with neural network models in a variety of domains, including energy-related industry. The large, complex design space presented by neural networks is only minimally explored in current practice. The satisfactory results that nevertheless have been obtained testify that neural networks are a robust modeling technology; at the same time, however, the lack of a systematic design approach implies that the best neural network models generally rem...
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.
Inferring gene regression networks with model trees
Directory of Open Access Journals (Sweden)
Aguilar-Ruiz Jesus S
2010-10-01
Full Text Available Abstract Background Novel strategies are required in order to handle the huge amount of data produced by microarray technologies. To infer gene regulatory networks, the first step is to find direct regulatory relationships between genes building the so-called gene co-expression networks. They are typically generated using correlation statistics as pairwise similarity measures. Correlation-based methods are very useful in order to determine whether two genes have a strong global similarity but do not detect local similarities. Results We propose model trees as a method to identify gene interaction networks. While correlation-based methods analyze each pair of genes, in our approach we generate a single regression tree for each gene from the remaining genes. Finally, a graph from all the relationships among output and input genes is built taking into account whether the pair of genes is statistically significant. For this reason we apply a statistical procedure to control the false discovery rate. The performance of our approach, named REGNET, is experimentally tested on two well-known data sets: Saccharomyces Cerevisiae and E.coli data set. First, the biological coherence of the results are tested. Second the E.coli transcriptional network (in the Regulon database is used as control to compare the results to that of a correlation-based method. This experiment shows that REGNET performs more accurately at detecting true gene associations than the Pearson and Spearman zeroth and first-order correlation-based methods. Conclusions REGNET generates gene association networks from gene expression data, and differs from correlation-based methods in that the relationship between one gene and others is calculated simultaneously. Model trees are very useful techniques to estimate the numerical values for the target genes by linear regression functions. They are very often more precise than linear regression models because they can add just different linear
Two stage neural network modelling for robust model predictive control.
Patan, Krzysztof
2017-11-02
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.
Marsman, M; Borsboom, D; Kruis, J; Epskamp, S; van Bork, R; Waldorp, L J; Maas, H L J van der; Maris, G
2017-11-07
In recent years, network models have been proposed as an alternative representation of psychometric constructs such as depression. In such models, the covariance between observables (e.g., symptoms like depressed mood, feelings of worthlessness, and guilt) is explained in terms of a pattern of causal interactions between these observables, which contrasts with classical interpretations in which the observables are conceptualized as the effects of a reflective latent variable. However, few investigations have been directed at the question how these different models relate to each other. To shed light on this issue, the current paper explores the relation between one of the most important network models-the Ising model from physics-and one of the most important latent variable models-the Item Response Theory (IRT) model from psychometrics. The Ising model describes the interaction between states of particles that are connected in a network, whereas the IRT model describes the probability distribution associated with item responses in a psychometric test as a function of a latent variable. Despite the divergent backgrounds of the models, we show a broad equivalence between them and also illustrate several opportunities that arise from this connection.
Social network models predict movement and connectivity in ecological landscapes
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.
Neural Networks For Electrohydrodynamic Effect Modelling
Directory of Open Access Journals (Sweden)
Wiesław Wajs
2004-01-01
Full Text Available This paper presents currently achieved results concerning methods of electrohydrodynamiceffect used in geophysics simulated with feedforward networks trained with backpropagation algorithm, radial basis function networks and generalized regression networks.
A network-oriented business modeling environment
Bisconti, Cristian; Storelli, Davide; Totaro, Salvatore; Arigliano, Francesco; Savarino, Vincenzo; Vicari, Claudia
The development of formal models related to the organizational aspects of an enterprise is fundamental when these aspects must be re-engineered and digitalized, especially when the enterprise is involved in the dynamics and value flows of a business network. Business modeling provides an opportunity to synthesize and make business processes, business rules and the structural aspects of an organization explicit, allowing business managers to control their complexity and guide an enterprise through effective decisional and strategic activities. This chapter discusses the main results of the TEKNE project in terms of software components that enable enterprises to configure, store, search and share models of any aspects of their business while leveraging standard and business-oriented technologies and languages to bridge the gap between the world of business people and IT experts and to foster effective business-to-business collaborations.
Compartmentalization analysis using discrete fracture network models
Energy Technology Data Exchange (ETDEWEB)
La Pointe, P.R.; Eiben, T.; Dershowitz, W. [Golder Associates, Redmond, VA (United States); Wadleigh, E. [Marathon Oil Co., Midland, TX (United States)
1997-08-01
This paper illustrates how Discrete Fracture Network (DFN) technology can serve as a basis for the calculation of reservoir engineering parameters for the development of fractured reservoirs. It describes the development of quantitative techniques for defining the geometry and volume of structurally controlled compartments. These techniques are based on a combination of stochastic geometry, computational geometry, and graph the theory. The parameters addressed are compartment size, matrix block size and tributary drainage volume. The concept of DFN models is explained and methodologies to compute these parameters are demonstrated.
Some queuing network models of computer systems
Herndon, E. S.
1980-01-01
Queuing network models of a computer system operating with a single workload type are presented. Program algorithms are adapted for use on the Texas Instruments SR-52 programmable calculator. By slightly altering the algorithm to process the G and H matrices row by row instead of column by column, six devices and an unlimited job/terminal population could be handled on the SR-52. Techniques are also introduced for handling a simple load dependent server and for studying interactive systems with fixed multiprogramming limits.
Networks model of the East Turkistan terrorism
Li, Ben-xian; Zhu, Jun-fang; Wang, Shun-guo
2015-02-01
The presence of the East Turkistan terrorist network in China can be traced back to the rebellions on the BAREN region in Xinjiang in April 1990. This article intends to research the East Turkistan networks in China and offer a panoramic view. The events, terrorists and their relationship are described using matrices. Then social network analysis is adopted to reveal the network type and the network structure characteristics. We also find the crucial terrorist leader. Ultimately, some results show that the East Turkistan network has big hub nodes and small shortest path, and that the network follows a pattern of small world network with hierarchical structure.
Fundamentals of complex networks models, structures and dynamics
Chen, Guanrong; Li, Xiang
2014-01-01
Complex networks such as the Internet, WWW, transportationnetworks, power grids, biological neural networks, and scientificcooperation networks of all kinds provide challenges for futuretechnological development. In particular, advanced societies havebecome dependent on large infrastructural networks to an extentbeyond our capability to plan (modeling) and to operate (control).The recent spate of collapses in power grids and ongoing virusattacks on the Internet illustrate the need for knowledge aboutmodeling, analysis of behaviors, optimized planning and performancecontrol in such networks. F
Stochastic simulation of HIV population dynamics through complex network modelling
Sloot, P. M. A.; Ivanov, S. V.; Boukhanovsky, A. V.; van de Vijver, D. A. M. C.; Boucher, C. A. B.
We propose a new way to model HIV infection spreading through the use of dynamic complex networks. The heterogeneous population of HIV exposure groups is described through a unique network degree probability distribution. The time evolution of the network nodes is modelled by a Markov process and
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 c...
Stochastic simulation of HIV population dynamics through complex network modelling
Sloot, P.M.A.; Ivanov, S.V.; Boukhanovsky, A.V.; van de Vijver, D.A.M.C.; Boucher, C.A.B.
2008-01-01
We propose a new way to model HIV infection spreading through the use of dynamic complex networks. The heterogeneous population of HIV exposure groups is described through a unique network degree probability distribution. The time evolution of the network nodes is modelled by a Markov process and
QSAR modelling using combined simple competitive learning networks and RBF neural networks.
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.
VEPCO network model reconciliation of LANL and MZA model data
Energy Technology Data Exchange (ETDEWEB)
NONE
1992-12-15
The LANL DC load flow model of the VEPCO transmission network shows 210 more substations than the AC load flow model produced by MZA utility Consultants. MZA was requested to determine the source of the difference. The AC load flow model used for this study utilizes 2 standard network algorithms (Decoupled or Newton). The solution time of each is affected by the number of substations. The more substations included, the longer the model will take to solve. In addition, the ability of the algorithms to converge to a solution is affected by line loadings and characteristics. Convergence is inhibited by numerous lightly loaded and electrically short lines. The MZA model reduces the total substations to 343 by creating equivalent loads and generation. Most of the omitted substations are lightly loaded and rated at 115 kV. The MZA model includes 16 substations not included in the LANL model. These represent new generation including Non-Utility Generator (NUG) sites, additional substations and an intertie (Wake, to CP and L). This report also contains data from the Italian State AC power flow model and the Duke Power Company AC flow model.
A Model of Genetic Variation in Human Social Networks
Fowler, James H; Christakis, Nicholas A
2008-01-01
Social networks influence the evolution of cooperation and they exhibit strikingly systematic patterns across a wide range of human contexts. Both of these facts suggest that variation in the topological attributes of human social networks might have a genetic basis. While genetic variation accounts for a significant portion of the variation in many complex social behaviors, the heritability of egocentric social network attributes is unknown. Here we show that three of these attributes (in-degree, transitivity, and centrality) are heritable. We then develop a "mirror network" method to test extant network models and show that none accounts for observed genetic variation in human social networks. We propose an alternative "attract and introduce" model that generates significant heritability as well as other important network features, and we show that this model with two simple forms of heterogeneity is well suited to the modeling of real social networks in humans. These results suggest that natural selection ...
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
PageRank model of opinion formation on Ulam networks
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 scale-free neural network for modelling neurogenesis
Perotti, Juan I.; Tamarit, Francisco A.; Cannas, Sergio A.
2006-11-01
In this work we introduce a neural network model for associative memory based on a diluted Hopfield model, which grows through a neurogenesis algorithm that guarantees that the final network is a small-world and scale-free one. We also analyze the storage capacity of the network and prove that its performance is larger than that measured in a randomly dilute network with the same connectivity.
A graph model for opportunistic network coding
Sorour, Sameh
2015-08-12
© 2015 IEEE. Recent advancements in graph-based analysis and solutions of instantly decodable network coding (IDNC) trigger the interest to extend them to more complicated opportunistic network coding (ONC) scenarios, with limited increase in complexity. In this paper, we design a simple IDNC-like graph model for a specific subclass of ONC, by introducing a more generalized definition of its vertices and the notion of vertex aggregation in order to represent the storage of non-instantly-decodable packets in ONC. Based on this representation, we determine the set of pairwise vertex adjacency conditions that can populate this graph with edges so as to guarantee decodability or aggregation for the vertices of each clique in this graph. We then develop the algorithmic procedures that can be applied on the designed graph model to optimize any performance metric for this ONC subclass. A case study on reducing the completion time shows that the proposed framework improves on the performance of IDNC and gets very close to the optimal performance.
Marketing communications model for innovation networks
Directory of Open Access Journals (Sweden)
Tiago João Freitas Correia
2015-10-01
Full Text Available Innovation is an increasingly relevant concept for the success of any organization, but it also represents a set of internal and external considerations, barriers and challenges to overcome. Along the concept of innovation, new paradigms emerge such as open innovation and co-creation that are simultaneously innovation modifiers and intensifiers in organizations, promoting organizational openness and stakeholder integration within the value creation process. Innovation networks composed by a multiplicity of agents in co-creative work perform as innovation mechanisms to face the increasingly complexity of products, services and markets. Technology, especially the Internet, is an enabler of all process among organizations supported by co-creative platforms for innovation. The definition of marketing communication strategies that promote motivation and involvement of all stakeholders in synergic creation and external promotion is the central aspect of this research. The implementation of the projects is performed by participative workshops with stakeholders from Madan Parque through IDEAS(REVOLUTION methodology and the operational model LinkUp parameterized for the project. The project is divided into the first part, the theoretical framework, and the second part where a model is developed for the marketing communication strategies that appeal to the Madan Parque case study. Keywords: Marketing Communication; Open Innovation, Technology; Innovation Networks; Incubator; Co-Creation.
Determining Application Runtimes Using Queueing Network Modeling
Energy Technology Data Exchange (ETDEWEB)
Elliott, Michael L. [Univ. of San Francisco, CA (United States)
2006-12-14
Determination of application times-to-solution for large-scale clustered computers continues to be a difficult problem in high-end computing, which will only become more challenging as multi-core consumer machines become more prevalent in the market. Both researchers and consumers of these multi-core systems desire reasonable estimates of how long their programs will take to run (time-to-solution, or TTS), and how many resources will be consumed in the execution. Currently there are few methods of determining these values, and those that do exist are either overly simplistic in their assumptions or require great amounts of effort to parameterize and understand. One previously untried method is queuing network modeling (QNM), which is easy to parameterize and solve, and produces results that typically fall within 10 to 30% of the actual TTS for our test cases. Using characteristics of the computer network (bandwidth, latency) and communication patterns (number of messages, message length, time spent in communication), the QNM model of the NAS-PB CG application was applied to MCR and ALC, supercomputers at LLNL, and the Keck Cluster at USF, with average errors of 2.41%, 3.61%, and -10.73%, respectively, compared to the actual TTS observed. While additional work is necessary to improve the predictive capabilities of QNM, current results show that QNM has a great deal of promise for determining application TTS for multi-processor computer systems.
Modeling management of research and education networks
Galagan, D.V.
2004-01-01
Computer networks and their services have become an essential part of research and education. Nowadays every modern R&E institution must have a computer network and provide network services to its students and staff. In addition to its internal computer network, every R&E institution must have a
Modeling stochasticity in biochemical reaction networks
Constantino, P. H.; Vlysidis, M.; Smadbeck, P.; Kaznessis, Y. N.
2016-03-01
Small biomolecular systems are inherently stochastic. Indeed, fluctuations of molecular species are substantial in living organisms and may result in significant variation in cellular phenotypes. The chemical master equation (CME) is the most detailed mathematical model that can describe stochastic behaviors. However, because of its complexity the CME has been solved for only few, very small reaction networks. As a result, the contribution of CME-based approaches to biology has been very limited. In this review we discuss the approach of solving CME by a set of differential equations of probability moments, called moment equations. We present different approaches to produce and to solve these equations, emphasizing the use of factorial moments and the zero information entropy closure scheme. We also provide information on the stability analysis of stochastic systems. Finally, we speculate on the utility of CME-based modeling formalisms, especially in the context of synthetic biology efforts.
Modelling of A Trust and Reputation Model in Wireless Networks
Directory of Open Access Journals (Sweden)
Saurabh Mishra
2015-09-01
Full Text Available Security is the major challenge for Wireless Sensor Networks (WSNs. The sensor nodes are deployed in non controlled environment, facing the danger of information leakage, adversary attacks and other threats. Trust and Reputation models are solutions for this problem and to identify malicious, selfish and compromised nodes. This paper aims to evaluate varying collusion effect with respect to static (SW, dynamic (DW, static with collusion (SWC, dynamic with collusion (DWC and oscillating wireless sensor networks to derive the joint resultant of Eigen Trust Model. An attempt has been made for the same by comparing aforementioned networks that are purely dedicated to protect the WSNs from adversary attacks and maintain the security issues. The comparison has been made with respect to accuracy and path length and founded that, collusion for wireless sensor networks seems intractable with the static and dynamic WSNs when varied with specified number of fraudulent nodes in the scenario. Additionally, it consumes more energy and resources in oscillating and collusive environments.
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.
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
CNMO: Towards the Construction of a Communication Network Modelling Ontology
Rahman, Muhammad Azizur; Pakstas, Algirdas; Wang, Frank Zhigang
Ontologies that explicitly identify objects, properties, and relationships in specific domains are essential for collaboration that involves sharing of data, knowledge or resources. A communications network modelling ontology (CNMO) has been designed to represent a network model as well as aspects related to its development and actual network operation. Network nodes/sites, link, traffic sources, protocols as well as aspects of the modeling/simulation scenario and operational aspects are defined with their formal representation. A CNMO may be beneficial for various network design/simulation/research communities due to the uniform representation of network models. This ontology is designed using terminology and concepts from various network modeling, simulation and topology generation tools.
Topological evolution of virtual social networks by modeling social activities
Sun, Xin; Dong, Junyu; Tang, Ruichun; Xu, Mantao; Qi, Lin; Cai, Yang
2015-09-01
With the development of Internet and wireless communication, virtual social networks are becoming increasingly important in the formation of nowadays' social communities. Topological evolution model is foundational and critical for social network related researches. Up to present most of the related research experiments are carried out on artificial networks, however, a study of incorporating the actual social activities into the network topology model is ignored. This paper first formalizes two mathematical abstract concepts of hobbies search and friend recommendation to model the social actions people exhibit. Then a social activities based topology evolution simulation model is developed to satisfy some well-known properties that have been discovered in real-world social networks. Empirical results show that the proposed topology evolution model has embraced several key network topological properties of concern, which can be envisioned as signatures of real social networks.
An Efficient Multitask Scheduling Model for Wireless Sensor Networks
Directory of Open Access Journals (Sweden)
Hongsheng Yin
2014-01-01
Full Text Available The sensor nodes of multitask wireless network are constrained in performance-driven computation. Theoretical studies on the data processing model of wireless sensor nodes suggest satisfying the requirements of high qualities of service (QoS of multiple application networks, thus improving the efficiency of network. In this paper, we present the priority based data processing model for multitask sensor nodes in the architecture of multitask wireless sensor network. The proposed model is deduced with the M/M/1 queuing model based on the queuing theory where the average delay of data packets passing by sensor nodes is estimated. The model is validated with the real data from the Huoerxinhe Coal Mine. By applying the proposed priority based data processing model in the multitask wireless sensor network, the average delay of data packets in a sensor nodes is reduced nearly to 50%. The simulation results show that the proposed model can improve the throughput of network efficiently.
Vehicle Scheduling with Network Flow Models
Directory of Open Access Journals (Sweden)
Gustavo P. Silva
2010-04-01
Full Text Available
Este trabalho retrata a primeira fase de uma pesquisa de doutorado voltada para a utilização de modelos de fluxo em redes para programação de veículos (de ônibus, em particular. A utilização de modelos deste tipo ainda e muito pouco explorada na literatura, principalmente pela dificuldade imposta pelo grande numero de variáveis resultante. Neste trabalho são apresentadas formulações para tratamento do problema de programação de veículos associados a um único depósito (ou garagem como problema de fluxo em redes, incluindo duas técnicas para reduzir o numero de arcos na rede criada e, conseqüentemente, o numero de variáveis a tratar. Uma destas técnicas de redução de arcos foi implementada e o problema de fluxo resultante foi direcionado para ser resolvido, nesta fase da pesquisa, por uma versão disponível do algoritmo Simplex para redes. Problemas teste baseados em dados reais da cidade de Reading, UK, foram resolvidos com a utilização da formulação de fluxo em redes adotada, e os resultados comparados com aqueles obtidos pelo método heurístico BOOST, o qual tem sido largamente testado e comercializado pela School of Computer Studies da Universidade de Leeds, UK. Os resultados alcançados demonstram a possibilidade de tratamento de problemas reais com a técnica de redução de arcos.
ABSTRACT
This paper presents the successful results of a first phase of a doctoral research addressed to solving vehicle (bus, in particular scheduling problems through network flow formulations. Network flow modeling for this kind of problem is a promising, but not a well explored approach, mainly because of the large number of variables related to number of arcs of real case networks. The paper presents and discusses some network flow formulations for the single depot bus vehicle scheduling problem, along with two techniques of arc reduction. One of these arc reduction techniques has been implemented and the underlying
Bicriteria Models of Vehicles Recycling Network Facility Location
Merkisz-Guranowska, Agnieszka
2012-06-01
The paper presents the issues related to modeling of a vehicle recycling network. The functioning of the recycling network is within the realm of interest of a variety of government agendas, companies participating in the network, vehicle manufacturers and vehicle end users. The interests of these groups need to be considered when deciding about the network organization. The paper presents bicriteria models of network entity location that take into account the preferences of the vehicle owners and network participants related to the network construction and reorganization. A mathematical formulation of the optimization tasks has been presented including the objective functions and limitations that the solutions have to comply with. Then, the models were used for the network optimization in Poland.
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.
Natural Models for Evolution on Networks
Mertzios, George B; Raptopoulos, Christoforos; Spirakis, Paul G
2011-01-01
Evolutionary dynamics have been traditionally studied in the context of homogeneous populations, mainly described my the Moran process. Recently, this approach has been generalized in \\cite{LHN} by arranging individuals on the nodes of a network. Undirected networks seem to have a smoother behavior than directed ones, and thus it is more challenging to find suppressors/amplifiers of selection. In this paper we present the first class of undirected graphs which act as suppressors of selection, by achieving a fixation probability that is at most one half of that of the complete graph, as the number of vertices increases. Moreover, we provide some generic upper and lower bounds for the fixation probability of general undirected graphs. As our main contribution, we introduce the natural alternative of the model proposed in \\cite{LHN}, where all individuals interact simultaneously and the result is a compromise between aggressive and non-aggressive individuals. That is, the behavior of the individuals in our new m...
A last updating evolution model for online social networks
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.
Precise Network Modeling of Systems Genetics Data Using the Bayesian Network Webserver.
Ziebarth, Jesse D; Cui, Yan
2017-01-01
The Bayesian Network Webserver (BNW, http://compbio.uthsc.edu/BNW ) is an integrated platform for Bayesian network modeling of biological datasets. It provides a web-based network modeling environment that seamlessly integrates advanced algorithms for probabilistic causal modeling and reasoning with Bayesian networks. BNW is designed for precise modeling of relatively small networks that contain less than 20 nodes. The structure learning algorithms used by BNW guarantee the discovery of the best (most probable) network structure given the data. To facilitate network modeling across multiple biological levels, BNW provides a very flexible interface that allows users to assign network nodes into different tiers and define the relationships between and within the tiers. This function is particularly useful for modeling systems genetics datasets that often consist of multiscalar heterogeneous genotype-to-phenotype data. BNW enables users to, within seconds or minutes, go from having a simply formatted input file containing a dataset to using a network model to make predictions about the interactions between variables and the potential effects of experimental interventions. In this chapter, we will introduce the functions of BNW and show how to model systems genetics datasets with BNW.
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...
Throughput capacity computation model for hybrid wireless networks
African Journals Online (AJOL)
wireless networks. We present in this paper, a computational model for obtaining throughput capacity for hybrid wireless networks. For a hybrid network with n nodes and m base stations, we observe through simulation that the throughput capacity increases linearly with the base station infrastructure connected by the wired ...
Modelling crime linkage with Bayesian networks.
de Zoete, Jacob; Sjerps, Marjan; Lagnado, David; Fenton, Norman
2015-05-01
When two or more crimes show specific similarities, such as a very distinct modus operandi, the probability that they were committed by the same offender becomes of interest. This probability depends on the degree of similarity and distinctiveness. We show how Bayesian networks can be used to model different evidential structures that can occur when linking crimes, and how they assist in understanding the complex underlying dependencies. That is, how evidence that is obtained in one case can be used in another and vice versa. The flip side of this is that the intuitive decision to "unlink" a case in which exculpatory evidence is obtained leads to serious overestimation of the strength of the remaining cases. Copyright © 2014 Forensic Science Society. Published by Elsevier Ireland Ltd. All rights reserved.
Structural equation models from paths to networks
Westland, J Christopher
2015-01-01
This compact reference surveys the full range of available structural equation modeling (SEM) methodologies. It reviews applications in a broad range of disciplines, particularly in the social sciences where many key concepts are not directly observable. This is the first book to present SEM’s development in its proper historical context–essential to understanding the application, strengths and weaknesses of each particular method. This book also surveys the emerging path and network approaches that complement and enhance SEM, and that will grow in importance in the near future. SEM’s ability to accommodate unobservable theory constructs through latent variables is of significant importance to social scientists. Latent variable theory and application are comprehensively explained, and methods are presented for extending their power, including guidelines for data preparation, sample size calculation, and the special treatment of Likert scale data. Tables of software, methodologies and fit st...
A mathematical model for networks with structures in the mesoscale
Criado, Regino; Flores, Julio; Gacia Del Amo, Alejandro Jose; Gómez, Jesus; Romance, Miguel
2011-01-01
Abstract The new concept of multilevel network is introduced in order to embody some topological properties of complex systems with structures in the mesoscale which are not completely captured by the classical models. This new model, which generalizes the hyper-network and hyper-structure models, fits perfectly with several real-life complex systems, including social and public transportation networks. We present an analysis of the structural properties of the mu...
Agent Based Modeling on Organizational Dynamics of Terrorist Network
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 ...
Adaptive Networks Theory, Models and Applications
Gross, Thilo
2009-01-01
With adaptive, complex networks, the evolution of the network topology and the dynamical processes on the network are equally important and often fundamentally entangled. Recent research has shown that such networks can exhibit a plethora of new phenomena which are ultimately required to describe many real-world networks. Some of those phenomena include robust self-organization towards dynamical criticality, formation of complex global topologies based on simple, local rules, and the spontaneous division of "labor" in which an initially homogenous population of network nodes self-organizes into functionally distinct classes. These are just a few. This book is a state-of-the-art survey of those unique networks. In it, leading researchers set out to define the future scope and direction of some of the most advanced developments in the vast field of complex network science and its applications.
A Cascade-Based Emergency Model for Water Distribution Network
Directory of Open Access Journals (Sweden)
Qing Shuang
2015-01-01
Full Text Available Water distribution network is important in the critical physical infrastructure systems. The paper studies the emergency resource strategies on water distribution network with the approach of complex network and cascading failures. The model of cascade-based emergency for water distribution network is built. The cascade-based model considers the network topology analysis and hydraulic analysis to provide a more realistic result. A load redistribution function with emergency recovery mechanisms is established. From the aspects of uniform distribution, node betweenness, and node pressure, six recovery strategies are given to reflect the network topology and the failure information, respectively. The recovery strategies are evaluated with the complex network indicators to describe the failure scale and failure velocity. The proposed method is applied by an illustrative example. The results showed that the recovery strategy considering the node pressure can enhance the network robustness effectively. Besides, this strategy can reduce the failure nodes and generate the least failure nodes per time.
Integrating public transort networks in the axial model
Gil, J.
2012-01-01
This study presents a first step in the development of a model that integrates public transport networks with the space syntax axial model, towards a network model that can describe the multi?modal movement structure of a city and study its patterns and flows. It describes the method for building an
An intercausal cancellation model for Bayesian-network engineering
Woudenberg, Steven P D; Van Der Gaag, Linda C.; Rademaker, Carin M A
2015-01-01
When constructing Bayesian networks with domain experts, network engineers often use the noisy-OR model, and causal interaction models more generally, to alleviate the burden of probability elicitation: the use of such a model serves to reduce the number of probabilities to be elicited on the one
Common quandaries and their practical solutions in Bayesian network modeling
Bruce G. Marcot
2017-01-01
Use and popularity of Bayesian network (BN) modeling has greatly expanded in recent years, but many common problems remain. Here, I summarize key problems in BN model construction and interpretation,along with suggested practical solutions. Problems in BN model construction include parameterizing probability values, variable definition, complex network structures,...
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 q
Modeling the reemergence of information diffusion in social network
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.
Spectral Modelling for Spatial Network Analysis
Nourian, P.; Rezvani, S.; Sariyildiz, I.S.; van der Hoeven, F.D.; Attar, Ramtin; Chronis, Angelos; Hanna, Sean; Turrin, Michela
2016-01-01
Spatial Networks represent the connectivity structure between units of space as a weighted graph whose links are weighted as to the strength of connections. In case of urban spatial networks, the units of space correspond closely to streets and in architectural spatial networks the units correspond
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...
Performance Modeling for Heterogeneous Wireless Networks with Multiservice Overflow Traffic
DEFF Research Database (Denmark)
Huang, Qian; Ko, King-Tim; Iversen, Villy Bæk
2009-01-01
Performance modeling is important for the purpose of developing efficient dimensioning tools for large complicated networks. But it is difficult to achieve in heterogeneous wireless networks, where different networks have different statistical characteristics in service and traffic models....... Multiservice loss analysis based on multi-dimensional Markov chain becomes intractable in these networks due to intensive computations required. This paper focuses on performance modeling for heterogeneous wireless networks based on a hierarchical overlay infrastructure. A method based on decomposition...... of the correlated traffic is used to achieve an approximate performance modeling for multiservice in hierarchical heterogeneous wireless networks with overflow traffic. The accuracy of the approximate performance obtained by our proposed modeling is verified by simulations....
Piecewise linear and Boolean models of chemical reaction networks.
Veliz-Cuba, Alan; Kumar, Ajit; Josić, Krešimir
2014-12-01
Models of biochemical networks are frequently complex and high-dimensional. Reduction methods that preserve important dynamical properties are therefore essential for their study. Interactions in biochemical networks are frequently modeled using Hill functions ([Formula: see text]). Reduced ODEs and Boolean approximations of such model networks have been studied extensively when the exponent [Formula: see text] is large. However, while the case of small constant [Formula: see text] appears in practice, it is not well understood. We provide a mathematical analysis of this limit and show that a reduction to a set of piecewise linear ODEs and Boolean networks can be mathematically justified. The piecewise linear systems have closed-form solutions that closely track those of the fully nonlinear model. The simpler, Boolean network can be used to study the qualitative behavior of the original system. We justify the reduction using geometric singular perturbation theory and compact convergence, and illustrate the results in network models of a toggle switch and an oscillator.
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.
Heterogeneous information network model for equipment-standard system
Yin, Liang; Shi, Li-Chen; Zhao, Jun-Yan; Du, Song-Yang; Xie, Wen-Bo; Yuan, Fei; Chen, Duan-Bing
2018-01-01
Entity information network is used to describe structural relationships between entities. Taking advantage of its extension and heterogeneity, entity information network is more and more widely applied to relationship modeling. Recent years, lots of researches about entity information network modeling have been proposed, while seldom of them concentrate on equipment-standard system with properties of multi-layer, multi-dimension and multi-scale. In order to efficiently deal with some complex issues in equipment-standard system such as standard revising, standard controlling, and production designing, a heterogeneous information network model for equipment-standard system is proposed in this paper. Three types of entities and six types of relationships are considered in the proposed model. Correspondingly, several different similarity-measuring methods are used in the modeling process. The experiments show that the heterogeneous information network model established in this paper can reflect relationships between entities accurately. Meanwhile, the modeling process has a good performance on time consumption.
Modified Penna bit-string network evolution model for scale-free networks with assortative mixing
Kim, Yup; Choi, Woosik; Yook, Soon-Hyung
2012-02-01
Motivated by biological aging dynamics, we introduce a network evolution model for social interaction networks. In order to study the effect of social interactions originating from biological and sociological reasons on the topological properties of networks, we introduce the activitydependent rewiring process. From the numerical simulations, we show that the degree distribution of the obtained networks follows a power-law distribution with an exponentially decaying tail, P( k) ˜ ( k + c)- γ exp(- k/k 0). The obtained value of γ is in the range 2 networks. Moreover, we also show that the degree-degree correlation of the network is positive, which is a characteristic of social interaction networks. The possible applications of our model to real systems are also discussed.
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.
Network models of frugivory and seed dispersal: Challenges and opportunities
Carlo, Tomás A.; Yang, Suann
2011-11-01
Network analyses have emerged as a new tool to study frugivory and seed dispersal (FSD) mutualisms because networks can model and simplify the complexity of multiple community-wide species interactions. Moreover, network theory suggests that structural properties, such as the presence of highly generalist species, are linked to the stability of mutualistic communities. However, we still lack empirical validation of network model predictions. Here we outline new research avenues to connect network models to FSD processes, and illustrate the challenges and opportunities of this tool with a field study. We hypothesized that generalist frugivores would be important for forest stability by dispersing seeds into deforested areas and initiating reforestation. We then constructed a network of plant-frugivore interactions using published data and identified the most generalist frugivores. To test the importance of generalists we measured: 1) the frequency with which frugivores moved between pasture and forest, 2) the bird-generated seed rain under perches in the pasture, and 3) the perching frequency of birds above seed traps. The generalist frugivores in the forest network were not important for seed dispersal into pastures, and thus for forest recovery, because the forest network excluded habitat heterogeneities, frugivore behavior, and movements. More research is needed to develop ways to incorporate relevant FSD processes into network models in order for these models to be more useful to community ecology and conservation. The network framework can serve to spark and renew interest in FSD and further our understanding of plant-animal communities.
Hybrid neural network bushing model for vehicle dynamics simulation
Energy Technology Data Exchange (ETDEWEB)
Sohn, Jeong Hyun [Pukyong National University, Busan (Korea, Republic of); Lee, Seung Kyu [Hyosung Corporation, Changwon (Korea, Republic of); Yoo, Wan Suk [Pusan National University, Busan (Korea, Republic of)
2008-12-15
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
Optical Network Models and Their Application to Software-Defined Network Management
Directory of Open Access Journals (Sweden)
Thomas Szyrkowiec
2017-01-01
Full Text Available Software-defined networking is finding its way into optical networks. Here, it promises a simplification and unification of network management for optical networks allowing automation of operational tasks despite the highly diverse and vendor-specific commercial systems and the complexity and analog nature of optical transmission. Common abstractions and interfaces are a fundamental component for software-defined optical networking. Currently, a number of models for optical networks are available. They all claim to provide open and vendor agnostic management of optical equipment. In this work, we survey and compare the most important models and propose an intent interface for creating virtual topologies which is integrated in the existing model ecosystem.
An image segmentation method based on network clustering model
Jiao, Yang; Wu, Jianshe; Jiao, Licheng
2018-01-01
Network clustering phenomena are ubiquitous in nature and human society. In this paper, a method involving a network clustering model is proposed for mass segmentation in mammograms. First, the watershed transform is used to divide an image into regions, and features of the image are computed. Then a graph is constructed from the obtained regions and features. The network clustering model is applied to realize clustering of nodes in the graph. Compared with two classic methods, the algorithm based on the network clustering model performs more effectively in experiments.
Small is beautiful: models of small neuronal networks.
Lamb, Damon G; Calabrese, Ronald L
2012-08-01
Modeling has contributed a great deal to our understanding of how individual neurons and neuronal networks function. In this review, we focus on models of the small neuronal networks of invertebrates, especially rhythmically active CPG networks. Models have elucidated many aspects of these networks, from identifying key interacting membrane properties to pointing out gaps in our understanding, for example missing neurons. Even the complex CPGs of vertebrates, such as those that underlie respiration, have been reduced to small network models to great effect. Modeling of these networks spans from simplified models, which are amenable to mathematical analyses, to very complicated biophysical models. Some researchers have now adopted a population approach, where they generate and analyze many related models that differ in a few to several judiciously chosen free parameters; often these parameters show variability across animals and thus justify the approach. Models of small neuronal networks will continue to expand and refine our understanding of how neuronal networks in all animals program motor output, process sensory information and learn. Copyright © 2012 Elsevier Ltd. All rights reserved.
Stochastic Online Learning in Dynamic Networks under Unknown Models
2016-08-02
Stochastic Online Learning in Dynamic Networks under Unknown Models This research aims to develop fundamental theories and practical algorithms for...12211 Research Triangle Park, NC 27709-2211 Online learning , multi-armed bandit, dynamic networks REPORT DOCUMENTATION PAGE 11. SPONSOR/MONITOR’S... Online Learning in Dynamic Networks under Unknown Models Report Title This research aims to develop fundamental theories and practical algorithms for
A Cellular Automata Models of Evolution of Transportation Networks
Directory of Open Access Journals (Sweden)
Mariusz Paszkowski
2002-01-01
Full Text Available We present a new approach to modelling of transportation networks. Supply of resources and their influence on the evolution of the consuming environment is a princqral problem considered. ne present two concepts, which are based on cellular automata paradigm. In the first model SCAM4N (Simple Cellular Automata Model of Anastomosing Network, the system is represented by a 2D mesh of elementary cells. The rules of interaction between them are introduced for modelling ofthe water flow and other phenomena connected with anastomosing river: Due to limitations of SCAMAN model, we introduce a supplementary model. The MANGraCA (Model of Anastomosing Network with Graph of Cellular Automata model beside the classical mesh of automata, introduces an additional structure: the graph of cellular automata, which represents the network pattern. Finally we discuss the prospective applications ofthe models. The concepts of juture implementation are also presented.
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....
Castet, Jean-Francois; Saleh, Joseph H
2013-01-01
This article develops a novel approach and algorithmic tools for the modeling and survivability analysis of networks with heterogeneous nodes, and examines their application to space-based networks. Space-based networks (SBNs) allow the sharing of spacecraft on-orbit resources, such as data storage, processing, and downlink. Each spacecraft in the network can have different subsystem composition and functionality, thus resulting in node heterogeneity. Most traditional survivability analyses of networks assume node homogeneity and as a result, are not suited for the analysis of SBNs. This work proposes that heterogeneous networks can be modeled as interdependent multi-layer networks, which enables their survivability analysis. The multi-layer aspect captures the breakdown of the network according to common functionalities across the different nodes, and it allows the emergence of homogeneous sub-networks, while the interdependency aspect constrains the network to capture the physical characteristics of each node. Definitions of primitives of failure propagation are devised. Formal characterization of interdependent multi-layer networks, as well as algorithmic tools for the analysis of failure propagation across the network are developed and illustrated with space applications. The SBN applications considered consist of several networked spacecraft that can tap into each other's Command and Data Handling subsystem, in case of failure of its own, including the Telemetry, Tracking and Command, the Control Processor, and the Data Handling sub-subsystems. Various design insights are derived and discussed, and the capability to perform trade-space analysis with the proposed approach for various network characteristics is indicated. The select results here shown quantify the incremental survivability gains (with respect to a particular class of threats) of the SBN over the traditional monolith spacecraft. Failure of the connectivity between nodes is also examined, and the
Directory of Open Access Journals (Sweden)
Jean-Francois Castet
Full Text Available This article develops a novel approach and algorithmic tools for the modeling and survivability analysis of networks with heterogeneous nodes, and examines their application to space-based networks. Space-based networks (SBNs allow the sharing of spacecraft on-orbit resources, such as data storage, processing, and downlink. Each spacecraft in the network can have different subsystem composition and functionality, thus resulting in node heterogeneity. Most traditional survivability analyses of networks assume node homogeneity and as a result, are not suited for the analysis of SBNs. This work proposes that heterogeneous networks can be modeled as interdependent multi-layer networks, which enables their survivability analysis. The multi-layer aspect captures the breakdown of the network according to common functionalities across the different nodes, and it allows the emergence of homogeneous sub-networks, while the interdependency aspect constrains the network to capture the physical characteristics of each node. Definitions of primitives of failure propagation are devised. Formal characterization of interdependent multi-layer networks, as well as algorithmic tools for the analysis of failure propagation across the network are developed and illustrated with space applications. The SBN applications considered consist of several networked spacecraft that can tap into each other's Command and Data Handling subsystem, in case of failure of its own, including the Telemetry, Tracking and Command, the Control Processor, and the Data Handling sub-subsystems. Various design insights are derived and discussed, and the capability to perform trade-space analysis with the proposed approach for various network characteristics is indicated. The select results here shown quantify the incremental survivability gains (with respect to a particular class of threats of the SBN over the traditional monolith spacecraft. Failure of the connectivity between nodes is also
Artificial Neural Network Modeling of an Inverse Fluidized Bed ...
African Journals Online (AJOL)
MICHAEL
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 obtained from an inverse fluidized bed reactor treating the starch industry wastewater.
A control model for district heating networks with storage
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
A small-world network model of facial emotion recognition.
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.
Systems and methods for modeling and analyzing networks
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.
Ocean wave prediction using numerical and neural network models
Digital Repository Service at National Institute of Oceanography (India)
Mandal, S.; Prabaharan, N.
This paper presents an overview of the development of the numerical wave prediction models and recently used neural networks for ocean wave hindcasting and forecasting. The numerical wave models express the physical concepts of the phenomena...
An information spreading model based on online social networks
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.
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
Completely random measures for modelling block-structured sparse networks
DEFF Research Database (Denmark)
Herlau, Tue; Schmidt, Mikkel Nørgaard; Mørup, Morten
2016-01-01
Many statistical methods for network data parameterize the edge-probability by attributing latent traits to the vertices such as block structure and assume exchangeability in the sense of the Aldous-Hoover representation theorem. Empirical studies of networks indicate that many real-world networks...... [2014] proposed the use of a different notion of exchangeability due to Kallenberg [2006] and obtained a network model which admits power-law behaviour while retaining desirable statistical properties, however this model does not capture latent vertex traits such as block-structure. In this work we re......-introduce the use of block-structure for network models obeying allenberg’s notion of exchangeability and thereby obtain a model which admits the inference of block-structure and edge inhomogeneity. We derive a simple expression for the likelihood and an efficient sampling method. The obtained model...
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.
Application Interaction Model for Opportunistic Networking
de Souza Schwartz, Ramon; van Dijk, H.W.; Scholten, Johan
In Opportunistic Networks, autonomous nodes discover, assess and potentially seize opportunities for communication and distributed processing whenever these emerge. In this paper, we consider prerequisites for a successful implementation of such a way of processing in networks that consist mainly of
A Model for Telestrok Network Evaluation
DEFF Research Database (Denmark)
Storm, Anna; Günzel, Franziska; Theiss, Stephan
2011-01-01
Different telestroke network concepts have been implemented worldwide to enable fast and efficient treatment of stroke patients in underserved rural areas. Networks could demonstrate the improvement in clinical outcome, but have so far excluded a cost-effectiveness analysis. With health economic ...
Concentration dependent model of protein-protein interaction networks
Zhang, Jingshan
2007-01-01
The scale free structure p(k)~k^{-gamma} of protein-protein interaction networks can be produced by a static physical model. We find the earlier study of deterministic threshold models with exponential fitness distributions can be generalized to explain the apparent scale free degree distribution of the physical model, and this explanation provides a generic mechanism of "scale free" networks. We predict the dependence of gamma on experimental protein concentrations. The clustering coefficient distribution of the model is also studied.
Model and simulation of Krause model in dynamic open network
Zhu, Meixia; Xie, Guangqiang
2017-08-01
The construction of the concept of evolution is an effective way to reveal the formation of group consensus. This study is based on the modeling paradigm of the HK model (Hegsekmann-Krause). This paper analyzes the evolution of multi - agent opinion in dynamic open networks with member mobility. The results of the simulation show that when the number of agents is constant, the interval distribution of the initial distribution will affect the number of the final view, The greater the distribution of opinions, the more the number of views formed eventually; The trust threshold has a decisive effect on the number of views, and there is a negative correlation between the trust threshold and the number of opinions clusters. The higher the connectivity of the initial activity group, the more easily the subjective opinion in the evolution of opinion to achieve rapid convergence. The more open the network is more conducive to the unity of view, increase and reduce the number of agents will not affect the consistency of the group effect, but not conducive to stability.
Rumor spreading model with noise interference in complex social networks
Zhu, Liang; Wang, Youguo
2017-03-01
In this paper, a modified susceptible-infected-removed (SIR) model has been proposed to explore rumor diffusion on complex social networks. We take variation of connectivity into consideration and assume the variation as noise. On the basis of related literature on virus networks, the noise is described as standard Brownian motion while stochastic differential equations (SDE) have been derived to characterize dynamics of rumor diffusion both on homogeneous networks and heterogeneous networks. Then, theoretical analysis on homogeneous networks has been demonstrated to investigate the solution of SDE model and the steady state of rumor diffusion. Simulations both on Barabási-Albert (BA) network and Watts-Strogatz (WS) network display that the addition of noise accelerates rumor diffusion and expands diffusion size, meanwhile, the spreading speed on BA network is much faster than on WS network under the same noise intensity. In addition, there exists a rumor diffusion threshold in statistical average meaning on homogeneous network which is absent on heterogeneous network. Finally, we find a positive correlation between peak value of infected individuals and noise intensity while a negative correlation between rumor lifecycle and noise intensity overall.
Hydrometeorological network for flood monitoring and modeling
Efstratiadis, Andreas; Koussis, Antonis D.; Lykoudis, Spyros; Koukouvinos, Antonis; Christofides, Antonis; Karavokiros, George; Kappos, Nikos; Mamassis, Nikos; Koutsoyiannis, Demetris
2013-08-01
Due to its highly fragmented geomorphology, Greece comprises hundreds of small- to medium-size hydrological basins, in which often the terrain is fairly steep and the streamflow regime ephemeral. These are typically affected by flash floods, occasionally causing severe damages. Yet, the vast majority of them lack flow-gauging infrastructure providing systematic hydrometric data at fine time scales. This has obvious impacts on the quality and reliability of flood studies, which typically use simplistic approaches for ungauged basins that do not consider local peculiarities in sufficient detail. In order to provide a consistent framework for flood design and to ensure realistic predictions of the flood risk -a key issue of the 2007/60/EC Directive- it is essential to improve the monitoring infrastructures by taking advantage of modern technologies for remote control and data management. In this context and in the research project DEUCALION, we have recently installed and are operating, in four pilot river basins, a telemetry-based hydro-meteorological network that comprises automatic stations and is linked to and supported by relevant software. The hydrometric stations measure stage, using 50-kHz ultrasonic pulses or piezometric sensors, or both stage (piezometric) and velocity via acoustic Doppler radar; all measurements are being temperature-corrected. The meteorological stations record air temperature, pressure, relative humidity, wind speed and direction, and precipitation. Data transfer is made via GPRS or mobile telephony modems. The monitoring network is supported by a web-based application for storage, visualization and management of geographical and hydro-meteorological data (ENHYDRIS), a software tool for data analysis and processing (HYDROGNOMON), as well as an advanced model for flood simulation (HYDROGEIOS). The recorded hydro-meteorological observations are accessible over the Internet through the www-application. The system is operational and its
A computational model of hemodynamic parameters in cortical capillary networks.
Safaeian, Navid; Sellier, Mathieu; David, Tim
2011-02-21
The analysis of hemodynamic parameters and functional reactivity of cerebral capillaries is still controversial. To assess the hemodynamic parameters in the cortical capillary network, a generic model was created using 2D voronoi tessellation in which each edge represents a capillary segment. This method is capable of creating an appropriate generic model of cerebral capillary network relating to each part of the brain cortex because the geometric model is able to vary the capillary density. The modeling presented here is based on morphometric parameters extracted from physiological data of the human cortex. The pertinent hemodynamic parameters were obtained by numerical simulation based on effective blood viscosity as a function of hematocrit and microvessel diameter, phase separation and plasma skimming effects. The hemodynamic parameters of capillary networks with two different densities (consistent with the variation of the morphometric data in the human cortical capillary network) were analyzed. The results show pertinent hemodynamic parameters for each model. The heterogeneity (coefficient variation) and the mean value of hematocrits, flow rates and velocities of the both network models were specified. The distributions of blood flow throughout the both models seem to confirm the hypothesis in which all capillaries in a cortical network are recruited at rest (normal condition). The results also demonstrate a discrepancy of the network resistance between two models, which are derived from the difference in the number density of capillary segments between the models. Copyright Â© 2010 Elsevier Ltd. All rights reserved.
A modelling and reasoning framework for social networks policies
Governatori, Guido; Iannella, Renato
2011-02-01
Policy languages (such as privacy and rights) have had little impact on the wider community. Now that social networks have taken off, the need to revisit policy languages and realign them towards social networks requirements has become more apparent. One such language is explored as to its applicability to the social networks masses. We also argue that policy languages alone are not sufficient and thus they should be paired with reasoning mechanisms to provide precise and unambiguous execution models of the policies. To this end, we propose a computationally oriented model to represent, reason with and execute policies for social networks.
Constitutive Modelling of INCONEL 718 using Artificial Neural Network
Abiriand Bhekisipho Twala, Olufunminiyi
2017-08-01
Artificial neural network is used to model INCONEL 718 in this paper. The model accounts for precipitate hardening in the alloy. The input variables for the neural network model are strain, strain rate, temperature and microstructure state. The output variable is the flow stress. The early stopping technique is combined with Bayesian regularization process in training the network. Sample and non-sample measurement data were taken from the literature. The model predictions of flow stress of the alloy are in good agreement with experimental measurements.
Modeling Temporal Evolution and Multiscale Structure in Networks
DEFF Research Database (Denmark)
Herlau, Tue; Mørup, Morten; Schmidt, Mikkel Nørgaard
2013-01-01
-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......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...
Gallagher, H. Colin; Robins, Garry
2015-01-01
As part of the shift within second language acquisition (SLA) research toward complex systems thinking, researchers have called for investigations of social network structure. One strand of social network analysis yet to receive attention in SLA is network statistical models, whereby networks are explained in terms of smaller substructures of…
Modeling the propagation of mobile malware on complex networks
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.
Network Inoculation: Heteroclinics and phase transitions in an epidemic model
Yang, Hui; Gross, Thilo
2016-01-01
In epidemiological modelling, dynamics on networks, and in particular adaptive and heterogeneous networks have recently received much interest. Here we present a detailed analysis of a previously proposed model that combines heterogeneity in the individuals with adaptive rewiring of the network structure in response to a disease. We show that in this model qualitative changes in the dynamics occur in two phase transitions. In a macroscopic description one of these corresponds to a local bifurcation whereas the other one corresponds to a non-local heteroclinic bifurcation. This model thus provides a rare example of a system where a phase transition is caused by a non-local bifurcation, while both micro- and macro-level dynamics are accessible to mathematical analysis. The bifurcation points mark the onset of a behaviour that we call network inoculation. In the respective parameter region exposure of the system to a pathogen will lead to an outbreak that collapses, but leaves the network in a configuration wher...
Random field Ising model and community structure in complex networks
Son, S.-W.; Jeong, H.; Noh, J. D.
2006-04-01
We propose a method to determine the community structure of a complex network. In this method the ground state problem of a ferromagnetic random field Ising model is considered on the network with the magnetic field Bs = +∞, Bt = -∞, and Bi≠s,t=0 for a node pair s and t. The ground state problem is equivalent to the so-called maximum flow problem, which can be solved exactly numerically with the help of a combinatorial optimization algorithm. The community structure is then identified from the ground state Ising spin domains for all pairs of s and t. Our method provides a criterion for the existence of the community structure, and is applicable equally well to unweighted and weighted networks. We demonstrate the performance of the method by applying it to the Barabási-Albert network, Zachary karate club network, the scientific collaboration network, and the stock price correlation network. (Ising, Potts, etc.)
Dynamical complexity in the perception-based network formation model
Jo, Hang-Hyun; Moon, Eunyoung
2016-12-01
Many link formation mechanisms for the evolution of social networks have been successful to reproduce various empirical findings in social networks. However, they have largely ignored the fact that individuals make decisions on whether to create links to other individuals based on cost and benefit of linking, and the fact that individuals may use perception of the network in their decision making. In this paper, we study the evolution of social networks in terms of perception-based strategic link formation. Here each individual has her own perception of the actual network, and uses it to decide whether to create a link to another individual. An individual with the least perception accuracy can benefit from updating her perception using that of the most accurate individual via a new link. This benefit is compared to the cost of linking in decision making. Once a new link is created, it affects the accuracies of other individuals' perceptions, leading to a further evolution of the actual network. As for initial actual networks, we consider both homogeneous and heterogeneous cases. The homogeneous initial actual network is modeled by Erdős-Rényi (ER) random networks, while we take a star network for the heterogeneous case. In any cases, individual perceptions of the actual network are modeled by ER random networks with controllable linking probability. Then the stable link density of the actual network is found to show discontinuous transitions or jumps according to the cost of linking. As the number of jumps is the consequence of the dynamical complexity, we discuss the effect of initial conditions on the number of jumps to find that the dynamical complexity strongly depends on how much individuals initially overestimate or underestimate the link density of the actual network. For the heterogeneous case, the role of the highly connected individual as an information spreader is also discussed.
Huisman, Tijs; Boucherie, Richardus J.; van Dijk, N.M.
2002-01-01
The performance of new railway networks cannot be measured or simulated, as no detailed train schedules are available. Railway infrastructure and capacities are to be determined long before the actual traffic is known. This paper therefore proposes a solvable queueing network model to compute
Stochastic modelling and control of communication networks
Zuraniewski, P.W.
2011-01-01
The unprecedented growth of the Information Technologies sector observed within the past years creates an excellent opportunity to conduct new, exciting and interdisciplinary research. Increasing complexity of the communication networks calls for incorporating rigorously developed and reliable
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....... are covered in the categorisation include fixed vs. general networks, specialised vs. general nodes, linear vs. nonlinear costs, single vs. multi commodity, uncapacitated vs. capacitated activities, single vs. multi modal and static vs. dynamic. The models examined address both strategic and tactical planning...
Information Dynamics in Networks: Models and Algorithms
2016-09-13
ICDCS). 29-JUN-15, Columbus, OH, USA. : , . Value-Based Network Externalities and Optimal Auction Design, Conference on Web and Internet Economics...NAME Total Number: NAME Total Number: PERCENT_SUPPORTEDNAME FTE Equivalent: Total Number: ...... ...... Inventions (DD882) Scientific Progress In...Value-based network externalities and optimal auction design. In Web and Internet Economics - 10th International Conference, WINE 2014, Beijing, China, December 14-17, pages 147–160, 2014. 6
Home-Network Security Model in Ubiquitous Environment
Dong-Young Yoo; Jong-Whoi Shin; Jin-Young Choi
2007-01-01
Social interest and demand on Home-Network has been increasing greatly. Although various services are being introduced to respond to such demands, they can cause serious security problems when linked to the open network such as Internet. This paper reviews the security requirements to protect the service users with assumption that the Home-Network environment is connected to Internet and then proposes the security model based on the requirement. The proposed security mode...
A Three-Dimensional Computational Model of Collagen Network Mechanics
Lee, Byoungkoo; Zhou, Xin; Riching, Kristin; Eliceiri, Kevin W.; Keely, Patricia J.; Guelcher, Scott A.; Weaver, Alissa M.; Jiang, Yi
2014-01-01
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. PMID:25386649
Hybrid network defense model based on fuzzy evaluation.
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.
Neurocognitive networks: findings, models, and theory.
Meehan, Timothy P; Bressler, Steven L
2012-11-01
Through its early history, cognitive neuroscience largely followed a modular paradigm wherein high-level cognitive functions were mapped onto locally segregated brain regions. However, recent evidence drives a continuing shift away from modular theories of cognitive brain function, and toward theories which hold that cognition arises from the integrated activity of large-scale, distributed networks of brain regions. A growing consensus favors the fundamental concept of this new paradigm: the large-scale cognitive brain network, or neurocognitive network. This consensus was the motivation for Neurocognitive Networks 2010 (NCN 2010), a conference sponsored by the Cognitive Neuroscience Program of the National Science Foundation, organized by Drs. Steven Bressler and Craig Richter of Florida Atlantic University (FAU), and held at FAU in Boca Raton, FL on January 29-30, 2010. NCN 2010 gathered together some of today's leading investigators of neurocognitive networks. This paper serves to review their presentations as they relate to the paradigm of neurocognitive networks, as well as to compile the emergent themes, questions, and possible future research directions that arose from the conference. Copyright © 2012 Elsevier Ltd. All rights reserved.
Modeling of Bandwidth Aggregation over Heterogeneous Wireless Access Networks
DEFF Research Database (Denmark)
Popovska Avramova, Andrijana; Dittmann, Lars
2012-01-01
Motivated by the multihomming capability of the mobile devices and the fact that the heterogeneous wireless access networks overlap in coverage, mobile operators are looking for solutions that will benefit by simultaneous use of the available multiple access interfaces. Multipath or multilink...... applications. The analysis is performed on a multipath model developed with OPNET Modeler, which is an advanced research tool that supports modeling and integration of various kinds of built-in networks....
When individual behaviour matters: homogeneous and network models in epidemiology
Bansal, Shweta; Grenfell, Bryan T.; Meyers, Lauren Ancel
2007-01-01
Heterogeneity in host contact patterns profoundly shapes population-level disease dynamics. Many epidemiological models make simplifying assumptions about the patterns of disease-causing interactions among hosts. In particular, homogeneous-mixing models assume that all hosts have identical rates of disease-causing contacts. In recent years, several network-based approaches have been developed to explicitly model heterogeneity in host contact patterns. Here, we use a network perspective to qua...
Mathematics of epidemics on networks from exact to approximate models
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...
Multi-mode clustering model for hierarchical wireless sensor networks
Hu, Xiangdong; Li, Yongfu; Xu, Huifen
2017-03-01
The topology management, i.e., clusters maintenance, of wireless sensor networks (WSNs) is still a challenge due to its numerous nodes, diverse application scenarios and limited resources as well as complex dynamics. To address this issue, a multi-mode clustering model (M2 CM) is proposed to maintain the clusters for hierarchical WSNs in this study. In particular, unlike the traditional time-trigger model based on the whole-network and periodic style, the M2 CM is proposed based on the local and event-trigger operations. In addition, an adaptive local maintenance algorithm is designed for the broken clusters in the WSNs using the spatial-temporal demand changes accordingly. Numerical experiments are performed using the NS2 network simulation platform. Results validate the effectiveness of the proposed model with respect to the network maintenance costs, node energy consumption and transmitted data as well as the network lifetime.
An extended differentiated optical services model for WDM optical networks
Ouyang, Yong; Zeng, Qingji; Wei, Wei
2004-04-01
The need to provide QoS-guaranteed services in the WDM optical networks is becoming increasingly important because of a variety of candidate client networks (e.g., IP, ATM, SONET/SDH) and the requirement for QoS-delivery within the transport layers. This article addresses the QoS problem and presents a framework of QoS provisioning in the WDM optical network. We first characterize the QoS problem in the WDM optical network by comparing with that in the traditional networks. Then we propose a QoS service model in the optical domain called extended differentiated optical services (E-DoS) model based on a set of optical parameters that captures the quality, the reliability and the priority of an optical connection. Each component of the E-DoS model has been analyzed in detail in this article.
Exponential random graph models for networks with community structure.
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.
Constraints and entropy in a model of network evolution
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.
Implicit methods for qualitative modeling of gene regulatory networks.
Garg, Abhishek; Mohanram, Kartik; De Micheli, Giovanni; Xenarios, Ioannis
2012-01-01
Advancements in high-throughput technologies to measure increasingly complex biological phenomena at the genomic level are rapidly changing the face of biological research from the single-gene single-protein experimental approach to studying the behavior of a gene in the context of the entire genome (and proteome). This shift in research methodologies has resulted in a new field of network biology that deals with modeling cellular behavior in terms of network structures such as signaling pathways and gene regulatory networks. In these networks, different biological entities such as genes, proteins, and metabolites interact with each other, giving rise to a dynamical system. Even though there exists a mature field of dynamical systems theory to model such network structures, some technical challenges are unique to biology such as the inability to measure precise kinetic information on gene-gene or gene-protein interactions and the need to model increasingly large networks comprising thousands of nodes. These challenges have renewed interest in developing new computational techniques for modeling complex biological systems. This chapter presents a modeling framework based on Boolean algebra and finite-state machines that are reminiscent of the approach used for digital circuit synthesis and simulation in the field of very-large-scale integration (VLSI). The proposed formalism enables a common mathematical framework to develop computational techniques for modeling different aspects of the regulatory networks such as steady-state behavior, stochasticity, and gene perturbation experiments.
Stochastic S-system modeling of gene regulatory network.
Chowdhury, Ahsan Raja; Chetty, Madhu; Evans, Rob
2015-10-01
Microarray gene expression data can provide insights into biological processes at a system-wide level and is commonly used for reverse engineering gene regulatory networks (GRN). Due to the amalgamation of noise from different sources, microarray expression profiles become inherently noisy leading to significant impact on the GRN reconstruction process. Microarray replicates (both biological and technical), generated to increase the reliability of data obtained under noisy conditions, have limited influence in enhancing the accuracy of reconstruction . Therefore, instead of the conventional GRN modeling approaches which are deterministic, stochastic techniques are becoming increasingly necessary for inferring GRN from noisy microarray data. In this paper, we propose a new stochastic GRN model by investigating incorporation of various standard noise measurements in the deterministic S-system model. Experimental evaluations performed for varying sizes of synthetic network, representing different stochastic processes, demonstrate the effect of noise on the accuracy of genetic network modeling and the significance of stochastic modeling for GRN reconstruction . The proposed stochastic model is subsequently applied to infer the regulations among genes in two real life networks: (1) the well-studied IRMA network, a real-life in-vivo synthetic network constructed within the Saccharomyces cerevisiae yeast, and (2) the SOS DNA repair network in Escherichia coli.
Metrics for evaluating performance and uncertainty of Bayesian network models
Bruce G. Marcot
2012-01-01
This paper presents a selected set of existing and new metrics for gauging Bayesian network model performance and uncertainty. Selected existing and new metrics are discussed for conducting model sensitivity analysis (variance reduction, entropy reduction, case file simulation); evaluating scenarios (influence analysis); depicting model complexity (numbers of model...
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...
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.
Towards a Social Networks Model for Online Learning & Performance
Chung, Kon Shing Kenneth; Paredes, Walter Christian
2015-01-01
In this study, we develop a theoretical model to investigate the association between social network properties, "content richness" (CR) in academic learning discourse, and performance. CR is the extent to which one contributes content that is meaningful, insightful and constructive to aid learning and by social network properties we…
Energy Model of Networks-on-Chip and a Bus
Wolkotte, P.T.; Smit, Gerardus Johannes Maria; Kavaldjiev, N.K.; Becker, Jens E.; Becker, Jürgen; Nurmi, J.; Takala, J.; Hamalainen, T.D.
2005-01-01
A Network-on-Chip (NoC) is an energy-efficient onchip communication architecture for Multi-Processor Systemon-Chip (MPSoC) architectures. In earlier papers we proposed two Network-on-Chip architectures based on packet-switching and circuit-switching. In this paper we derive an energy model for both
Modeling and optimization of an electric power distribution network ...
African Journals Online (AJOL)
EDNEPP) was solved by a mixed binary integer programming (MBIP) formulation of the network, where the steady-state operation of the network was modelled with non-linear mathematical expressions. The non-linear terms are linearized, using ...
Modelling flow dynamics in water distribution networks using ...
African Journals Online (AJOL)
Computational approaches can be used to detect leakages in water distribution networks. One such approach is the Artificial Neural Networks (ANNs) technique. The advantage of ANNs is that they are robust and can be used to model complex linear and non-linear systems without making implicit assumptions. ANNs can ...
Water distribution network modelling of a small community using ...
African Journals Online (AJOL)
In this study a network model was constructed for the hydraulic analysis and design of a small community (Sakwa) water distribution network in North Eastern geopolitical region of Nigeria using WaterCAD simulator. The analysis included a review of pressures, velocities and head loss gradients under steady state average ...
An artificial neural network based fast radiative transfer model for ...
Indian Academy of Sciences (India)
In the present study, a fast radiative transfer model using neural networks is proposed to simulate radiances corresponding to the wavenumbers of INSAT-3D. Realistic atmospheric temperature and humidity profiles have been used for training the network. Spectral response functions of GOES-13, a satellite similar in ...
Radio Channel Modelling for UAV Communication over Cellular Networks
DEFF Research Database (Denmark)
Amorim, Rafhael Medeiros de; Nguyen, Huan Cong; Mogensen, Preben Elgaard
2017-01-01
The main goal of this paper is to obtain models for path loss exponents and shadowing for the radio channel between airborne Unmanned Aerial Vehicles (UAVs) and cellular networks. In this pursuit, field measurements were conducted in live LTE networks at the 800 MHz frequency band, using a commer...
Distribution Of Wealth In A Network Model Of The Economy
Tao Ma; Holden, John G.; Serota, R. A.
2012-01-01
We show, analytically and numerically, that wealth distribution in the Bouchaud-M\\'ezard network model of the economy is described by a three-parameter generalized inverse gamma distribution. In the mean-field limit of a network with any two agents linked, it reduces to the inverse gamma distribution.
Water Distribution Network Modelling of a Small Community using ...
African Journals Online (AJOL)
Water Distribution Network Modelling of a Small Community using Watercad Simulator. ... Global Journal of Engineering Research ... with respect to pressure or available fire flow for the proposed service area and also that flow velocities are not excessive while head loss gradients in the network are within acceptable limits.
Capacity allocation in wireless communication networks - models and analyses
Litjens, Remco
2003-01-01
This monograph has concentrated on capacity allocation in cellular and Wireless Local Area Networks, primarily with a network operator’s perspective. In the introduc- tory chapter, a reference model has been proposed for the extensive suite of capacity allocation mechanisms that can be applied at
Line and lattice networks under deterministic interference models
Goseling, Jasper; Gastpar, Michael; Weber, Jos H.
Capacity bounds are compared for four different deterministic models of wireless networks, representing four different ways of handling broadcast and superposition in the physical layer. In particular, the transport capacity under a multiple unicast traffic pattern is studied for a 1-D network of
Energy Model of Networks-on-Chip and a Bus
Wolkotte, P.T.; Smit, Gerardus Johannes Maria; Kavaldjiev, N.K.; Becker, Jens E.; Becker, Jurgen
A Network-on-Chip (NoC) is an energy-efficient onchip communication architecture for Multi-Processor Systemon- Chip (MPSoC) architectures. In earlier papers we proposed two Network-on-Chip architectures based on packet-switching and circuit-switching. In this paper we derive an energy model for both
Modeling Verdict Outcomes Using Social Network Measures: The Watergate and Caviar Network Cases
2016-01-01
Modelling criminal trial verdict outcomes using social network measures is an emerging research area in quantitative criminology. Few studies have yet analyzed which of these measures are the most important for verdict modelling or which data classification techniques perform best for this application. To compare the performance of different techniques in classifying members of a criminal network, this article applies three different machine learning classifiers–Logistic Regression, Naïve Bayes and Random Forest–with a range of social network measures and the necessary databases to model the verdicts in two real–world cases: the U.S. Watergate Conspiracy of the 1970’s and the now–defunct Canada–based international drug trafficking ring known as the Caviar Network. In both cases it was found that the Random Forest classifier did better than either Logistic Regression or Naïve Bayes, and its superior performance was statistically significant. This being so, Random Forest was used not only for classification but also to assess the importance of the measures. For the Watergate case, the most important one proved to be betweenness centrality while for the Caviar Network, it was the effective size of the network. These results are significant because they show that an approach combining machine learning with social network analysis not only can generate accurate classification models but also helps quantify the importance social network variables in modelling verdict outcomes. We conclude our analysis with a discussion and some suggestions for future work in verdict modelling using social network measures. PMID:26824351
Non-consensus Opinion Models on Complex Networks
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
Hybrid modeling and empirical analysis of automobile supply chain network
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.
When individual behaviour matters: homogeneous and network models in epidemiology.
Bansal, Shweta; Grenfell, Bryan T; Meyers, Lauren Ancel
2007-10-22
Heterogeneity in host contact patterns profoundly shapes population-level disease dynamics. Many epidemiological models make simplifying assumptions about the patterns of disease-causing interactions among hosts. In particular, homogeneous-mixing models assume that all hosts have identical rates of disease-causing contacts. In recent years, several network-based approaches have been developed to explicitly model heterogeneity in host contact patterns. Here, we use a network perspective to quantify the extent to which real populations depart from the homogeneous-mixing assumption, in terms of both the underlying network structure and the resulting epidemiological dynamics. We find that human contact patterns are indeed more heterogeneous than assumed by homogeneous-mixing models, but are not as variable as some have speculated. We then evaluate a variety of methodologies for incorporating contact heterogeneity, including network-based models and several modifications to the simple SIR compartmental model. We conclude that the homogeneous-mixing compartmental model is appropriate when host populations are nearly homogeneous, and can be modified effectively for a few classes of non-homogeneous networks. In general, however, network models are more intuitive and accurate for predicting disease spread through heterogeneous host populations.
Destabilization of Terrorist Networks through Argument Driven Hypothesis Model
DEFF Research Database (Denmark)
Hussain, Dil Muhammad Akbar
2007-01-01
Social network analysis has been used for quite some time to analyze and understand the behavior of nodes in the network. Theses nodes could be individuals or group of persons, events or organizations etc. Infact these nodes could be any thing importantly, these nodes propagate and obviously ha......) to predict a path for its destabilization. This network is selected to benchmark our proposed model framework. The results obtained with various network analysis shows that it works better than other analysis measures for example based on degree, betweeness and closeness etc. ...
Mutual Interference Models for CDMA Mobile Communication Networks
Directory of Open Access Journals (Sweden)
K. Hrudkay
2002-12-01
Full Text Available Nowadays we are witnesses of a huge development one of the mostprogressive communication technology - mobile networks. The mainproblem in these networks is an elimination of the mutual interference,which, mainly in non-orthogonal CDMA networks, is the principalobstacle for reaching high transmission rates The aim of thiscontribution is to give simplified view to mutual interference modelsfor orthogonal and non-orthogonal CDMA networks. The contribution isintended mainly for PhD. students to help them to obtain an orientationin such a complicated areas, as the interference models for CDMAnetworks are.
Neural network models: Insights and prescriptions from practical applications
Energy Technology Data Exchange (ETDEWEB)
Samad, T. [Honeywell Technology Center, Minneapolis, MN (United States)
1995-12-31
Neural networks are no longer just a research topic; numerous applications are now testament to their practical utility. In the course of developing these applications, researchers and practitioners have been faced with a variety of issues. This paper briefly discusses several of these, noting in particular the rich connections between neural networks and other, more conventional technologies. A more comprehensive version of this paper is under preparation that will include illustrations on real examples. Neural networks are being applied in several different ways. Our focus here is on neural networks as modeling technology. However, much of the discussion is also relevant to other types of applications such as classification, control, and optimization.
DEFF Research Database (Denmark)
Sindbæk, Søren Michael
2015-01-01
Long-distance communication has emerged as a particular focus for archaeologicalexploration using network theory, analysis, and modelling. The promise is apparentlyobvious: communication in the past doubtlessly had properties of complex, dynamicnetworks, and archaeological datasets almost certainly...... preserve patterns of thisinteraction. Formal network analysis and modelling holds the potential to identify anddemonstrate such patterns, where traditional methods often prove inadequate. Thearchaeological study of communication networks in the past, however, calls for radically different analytical......,and use patterns. This point is demonstrated with reference to a study of Viking-period communication in the North Sea region...
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.
Liu, Zugang
Network systems, including transportation and logistic systems, electric power generation and distribution networks as well as financial networks, provide the critical infrastructure for the functioning of our societies and economies. The understanding of the dynamic behavior of such systems is also crucial to national security and prosperity. The identification of new connections between distinct network systems is the inspiration for the research in this dissertation. In particular, I answer two questions raised by Beckmann, McGuire, and Winsten (1956) and Copeland (1952) over half a century ago, which are, respectively, how are electric power flows related to transportation flows and does money flow like water or electricity? In addition, in this dissertation, I achieve the following: (1) I establish the relationships between transportation networks and three other classes of complex network systems: supply chain networks, electric power generation and transmission networks, and financial networks with intermediation. The establishment of such connections provides novel theoretical insights as well as new pricing mechanisms, and efficient computational methods. (2) I develop new modeling frameworks based on evolutionary variational inequality theory that capture the dynamics of such network systems in terms of the time-varying flows and incurred costs, prices, and, where applicable, profits. This dissertation studies the dynamics of such network systems by addressing both internal competition and/or cooperation, and external changes, such as varying costs and demands. (3) I focus, in depth, on electric power supply chains. By exploiting the relationships between transportation networks and electric power supply chains, I develop a large-scale network model that integrates electric power supply chains and fuel supply markets. The model captures both the economic transactions as well as the physical transmission constraints. The model is then applied to the New
A DUAL NETWORK MODEL OF INTERLOCKING DIRECTORATES
Directory of Open Access Journals (Sweden)
Humphry Hung
2003-01-01
Full Text Available The article proposes an integrative framework for the study of interlocking directorates by using an approach that encompasses the concepts of multiple networks and resource endowment. This serves to integrate the traditional views of interorganizational linkages and intra-class cohesion. Through appropriate strategic analysis of relevant resource endowment of internal environment and external networks of organizations and corporate elites, this article argues that the selection of directors, if used effectively, can be adopted as a strategic device to enhance the corporation's overall performance.
ARCHITECTURES AND ALGORITHMS FOR COGNITIVE NETWORKS ENABLED BY QUALITATIVE MODELS
DEFF Research Database (Denmark)
Balamuralidhar, P.
2013-01-01
Complexity of communication networks is ever increasing and getting complicated by their heterogeneity and dynamism. Traditional techniques are facing challenges in network performance management. Cognitive networking is an emerging paradigm to make networks more intelligent, thereby overcoming...... traditional limitations and potentially achieving better performance. The vision is that, networks should be able to monitor themselves, reason upon changes in self and environment, act towards the achievement of specific goals and learn from experience. The concept of a Cognitive Engine (CE) supporting...... cognitive functions, as part of network elements, enabling above said autonomic capabilities is gathering attention. Awareness of the self and the world is an important aspect of the cognitive engine to be autonomic. This is achieved through embedding their models in the engine, but the complexity...
A Gaussian graphical model approach to climate networks
Energy Technology Data Exchange (ETDEWEB)
Zerenner, Tanja, E-mail: tanjaz@uni-bonn.de [Meteorological Institute, University of Bonn, Auf dem Hügel 20, 53121 Bonn (Germany); Friederichs, Petra; Hense, Andreas [Meteorological Institute, University of Bonn, Auf dem Hügel 20, 53121 Bonn (Germany); Interdisciplinary Center for Complex Systems, University of Bonn, Brühler Straße 7, 53119 Bonn (Germany); Lehnertz, Klaus [Department of Epileptology, University of Bonn, Sigmund-Freud-Straße 25, 53105 Bonn (Germany); Helmholtz Institute for Radiation and Nuclear Physics, University of Bonn, Nussallee 14-16, 53115 Bonn (Germany); Interdisciplinary Center for Complex Systems, University of Bonn, Brühler Straße 7, 53119 Bonn (Germany)
2014-06-15
Distinguishing between direct and indirect connections is essential when interpreting network structures in terms of dynamical interactions and stability. When constructing networks from climate data the nodes are usually defined on a spatial grid. The edges are usually derived from a bivariate dependency measure, such as Pearson correlation coefficients or mutual information. Thus, the edges indistinguishably represent direct and indirect dependencies. Interpreting climate data fields as realizations of Gaussian Random Fields (GRFs), we have constructed networks according to the Gaussian Graphical Model (GGM) approach. In contrast to the widely used method, the edges of GGM networks are based on partial correlations denoting direct dependencies. Furthermore, GRFs can be represented not only on points in space, but also by expansion coefficients of orthogonal basis functions, such as spherical harmonics. This leads to a modified definition of network nodes and edges in spectral space, which is motivated from an atmospheric dynamics perspective. We construct and analyze networks from climate data in grid point space as well as in spectral space, and derive the edges from both Pearson and partial correlations. Network characteristics, such as mean degree, average shortest path length, and clustering coefficient, reveal that the networks posses an ordered and strongly locally interconnected structure rather than small-world properties. Despite this, the network structures differ strongly depending on the construction method. Straightforward approaches to infer networks from climate data while not regarding any physical processes may contain too strong simplifications to describe the dynamics of the climate system appropriately.
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 and simulation of the USAVRE network and radiology operations
Martinez, Ralph; Bradford, Daniel Q.; Hatch, Jay; Sochan, John; Chimiak, William J.
1998-07-01
The U.S. Army Medical Command, lead by the Brooke Army Medical Center, has embarked on a visionary project. The U.S. Army Virtual Radiology Environment (USAVRE) is a CONUS-based network that connects all the Army's major medical centers and Regional Medical Commands (RMC). The purpose of the USAVRE is to improve the quality, access, and cost of radiology services in the Army via the use of state-of-the-art medical imaging, computer, and networking technologies. The USAVRE contains multimedia viewing workstations; database archive systems are based on a distributed computing environment using Common Object Request Broker Architecture (CORBA) middleware protocols. The underlying telecommunications network is an ATM-based backbone network that connects the RMC regional networks and PACS networks at medical centers and RMC clinics. This project is a collaborative effort between Army, university, and industry centers with expertise in teleradiology and Global PACS applications. This paper describes a model and simulation of the USAVRE for performance evaluation purposes. As a first step the results of a Technology Assessment and Requirements Analysis (TARA) -- an analysis of the workload in Army radiology departments, their equipment and their staffing. Using the TARA data and other workload information, we have developed a very detailed analysis of the workload and workflow patterns of our Medical Treatment Facilities. We are embarking on modeling and simulation strategies, which will form the foundation for the VRE network. The workload analysis is performed for each radiology modality in a RMC site. The workload consists of the number of examinations per modality, type of images per exam, number of images per exam, and size of images. The frequency for store and forward cases, second readings, and interactive consultation cases are also determined. These parameters are translated into the model described below. The model for the USAVRE is hierarchical in nature
Numerical analysis of modeling based on improved Elman neural network.
Jie, Shao; Li, Wang; WeiSong, Zhao; YaQin, Zhong; Malekian, Reza
2014-01-01
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.
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.
Neural network models of learning and categorization in multigame experiments
Directory of Open Access Journals (Sweden)
Davide eMarchiori
2011-12-01
Full Text Available Previous research has shown that regret-driven neural networks predict behavior in repeated completely mixed games remarkably well, substantially equating the performance of the most accurate established models of learning. This result prompts the question of what is the added value of modeling learning through neural networks. We submit that this modeling approach allows for models that are able to distinguish among and respond differently to different payoff structures. Moreover, the process of categorization of a game is implicitly carried out by these models, thus without the need of any external explicit theory of similarity between games. To validate our claims, we designed and ran two multigame experiments in which subjects faced, in random sequence, different instances of two completely mixed 2x2 games. Then, we tested on our experimental data two regret-driven neural network models, and compared their performance with that of other established models of learning and Nash equilibrium.
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.)
SCYNet: testing supersymmetric models at the LHC with neural networks
Bechtle, Philip; Belkner, Sebastian; Dercks, Daniel; Hamer, Matthias; Keller, Tim; Krämer, Michael; Sarrazin, Björn; Schütte-Engel, Jan; Tattersall, Jamie
2017-10-01
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.
Modelling the self-organization and collapse of complex networks
Indian Academy of Sciences (India)
Modelling the self-organization and collapse of complex networks. Sanjay Jain Department of Physics and Astrophysics, University of Delhi Jawaharlal Nehru Centre for Advanced Scientific Research, Bangalore Santa Fe Institute, Santa Fe, New Mexico.
A model reduction method for biochemical reaction networks
National Research Council Canada - National Science Library
Rao, Shodhan; van der Schaft, Arjan; van Eunen, Karen; Bakker, Barbara; Jayawardhana, Bayu
2014-01-01
Background: In this paper we propose a model reduction method for biochemical reaction networks governed by a variety of reversible and irreversible enzyme kinetic rate laws, including reversible Michaelis-Menten and Hill kinetics...
Water distribution network modelling of a small community using ...
African Journals Online (AJOL)
Water distribution network modelling of a small community using watercad simulator. ... Global Journal of Engineering Research ... Pipes P-6, P-12, P-15 and P-19 expectedly have relatively low flow velocities due to the low average day ...
Computational modeling of signal transduction networks: a pedagogical exposition.
Prasad, Ashok
2012-01-01
We give a pedagogical introduction to computational modeling of signal transduction networks, starting from explaining the representations of chemical reactions by differential equations via the law of mass action. We discuss elementary biochemical reactions such as Michaelis-Menten enzyme kinetics and cooperative binding, and show how these allow the representation of large networks as systems of differential equations. We discuss the importance of looking for simpler or reduced models, such as network motifs or dynamical motifs within the larger network, and describe methods to obtain qualitative behavior by bifurcation analysis, using freely available continuation software. We then discuss stochastic kinetics and show how to implement easy-to-use methods of rule-based modeling for stochastic simulations. We finally suggest some methods for comprehensive parameter sensitivity analysis, and discuss the insights that it could yield. Examples, including code to try out, are provided based on a paper that modeled Ras kinetics in thymocytes.
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.
Bayesian network models for error detection in radiotherapy plans.
Kalet, Alan M; Gennari, John H; Ford, Eric C; Phillips, Mark H
2015-04-07
The purpose of this study is to design and develop a probabilistic network for detecting errors in radiotherapy plans for use at the time of initial plan verification. Our group has initiated a multi-pronged approach to reduce these errors. We report on our development of Bayesian models of radiotherapy plans. Bayesian networks consist of joint probability distributions that define the probability of one event, given some set of other known information. Using the networks, we find the probability of obtaining certain radiotherapy parameters, given a set of initial clinical information. A low probability in a propagated network then corresponds to potential errors to be flagged for investigation. To build our networks we first interviewed medical physicists and other domain experts to identify the relevant radiotherapy concepts and their associated interdependencies and to construct a network topology. Next, to populate the network's conditional probability tables, we used the Hugin Expert software to learn parameter distributions from a subset of de-identified data derived from a radiation oncology based clinical information database system. These data represent 4990 unique prescription cases over a 5 year period. Under test case scenarios with approximately 1.5% introduced error rates, network performance produced areas under the ROC curve of 0.88, 0.98, and 0.89 for the lung, brain and female breast cancer error detection networks, respectively. Comparison of the brain network to human experts performance (AUC of 0.90 ± 0.01) shows the Bayes network model performs better than domain experts under the same test conditions. Our results demonstrate the feasibility and effectiveness of comprehensive probabilistic models as part of decision support systems for improved detection of errors in initial radiotherapy plan verification procedures.
Infection dynamics on spatial small-world network models
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.
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....
A Neural Network Model for Prediction of Sound Quality
DEFF Research Database (Denmark)
Nielsen,, Lars Bramsløw
An artificial neural network structure has been specified, implemented and optimized for the purpose of predicting the perceived sound quality for normal-hearing and hearing-impaired subjects. The network was implemented by means of commercially available software and optimized to predict results...... error on the test set. The overall concept proved functional, but further testing with data obtained from a new rating experiment is necessary to better assess the utility of this measure. The weights in the trained neural networks were analyzed to qualitatively interpret the relation between...... obtained in subjective sound quality rating experiments based on input data from an auditory model. Various types of input data and data representations from the auditory model were used as input data for the chosen network structure, which was a three-layer perceptron. This network was trained by means...
Molecular modeling of amorphous, non-woven polymer networks.
Krausse, Constantin A; Milek, Theodor; Zahn, Dirk
2015-10-01
We outline a simple and efficient approach to generating molecular models of amorphous polymer networks. Similar to established techniques of preparing woven polymer networks from quenching high-temperature molecular simulation runs, we use a molecular dynamics simulations of a generic melt as starting points. This generic melt is however only used to describe parts of the polymers, namely the cross-linker units which positions are adopted from particle positions of the quenched melt. Specific degrees of network connectivity are tuned by geometric criteria for linker-linker connections and by suitable multi-body interaction potentials applied to the generic melt simulations. Using this technique we demonstrate adjusting fourfold linker coordination in amorphous polymer networks comprising 10-20% under-coordinated linkers. Graphical Abstract Molecular modeling of amorphous, non-woven polymer networks.
Modeling and Analysis of New Products Diffusion on Heterogeneous Networks
Directory of Open Access Journals (Sweden)
Shuping Li
2014-01-01
Full Text Available We present a heterogeneous networks model with the awareness stage and the decision-making stage to explain the process of new products diffusion. If mass media is neglected in the decision-making stage, there is a threshold whether the innovation diffusion is successful or not, or else it is proved that the network model has at least one positive equilibrium. For networks with the power-law degree distribution, numerical simulations confirm analytical results, and also at the same time, by numerical analysis of the influence of the network structure and persuasive advertisements on the density of adopters, we give two different products propagation strategies for two classes of nodes in scale-free networks.
Modeling pedestrian's conformity violation behavior: a complex network based approach.
Zhou, Zhuping; Hu, Qizhou; Wang, Wei
2014-01-01
Pedestrian injuries and fatalities present a problem all over the world. Pedestrian conformity violation behaviors, which lead to many pedestrian crashes, are common phenomena at the signalized intersections in China. The concepts and metrics of complex networks are applied to analyze the structural characteristics and evolution rules of pedestrian network about the conformity violation crossings. First, a network of pedestrians crossing the street is established, and the network's degree distributions are analyzed. Then, by using the basic idea of SI model, a spreading model of pedestrian illegal crossing behavior is proposed. Finally, through simulation analysis, pedestrian's illegal crossing behavior trends are obtained in different network structures and different spreading rates. Some conclusions are drawn: as the waiting time increases, more pedestrians will join in the violation crossing once a pedestrian crosses on red firstly. And pedestrian's conformity violation behavior will increase as the spreading rate increases.
Optimization of recurrent neural networks for time series modeling
DEFF Research Database (Denmark)
Pedersen, Morten With
1997-01-01
series. The overall objective s are to improve training by application of second-order methods and to improve generalization ability by architecture optimization accomplished by pruning. The major topics covered in the thesis are: 1. The problem of training recurrent networks is analyzed from a numerical...... of solution obtained as well as computation time required. 3. A theoretical definition of the generalization error for recurrent networks is provided. This definition justifies a commonly adopted approach for estimating generalization ability. 4. The viability of pruning recurrent networks by the Optimal...... networks is proposed. The tool allows for assessment of the length of the effe ctive memory of previous inputs built up in the recurrent network during application. Time series modeling is also treated from a more general point of view, namely modeling of the joint probability distribution function...
Message Integrity Model for Wireless Sensor Networks
Qleibo, Haider W.
2009-01-01
WSNs are susceptible to a variety of attacks. These attacks vary in the way they are performed and executed; they include but not limited to node capture, physical tampering, denial of service, and message alteration. It is of paramount importance to protect gathered data by WSNs and defend the network against illegal access and malicious…
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
Reconstruction of social group networks from friendship networks using a tag-based model
Guan, Yuan-Pan; You, Zhi-Qiang; Han, Xiao-Pu
2016-12-01
Social group is a type of mesoscopic structure that connects human individuals in microscopic level and the global structure of society. In this paper, we propose a tag-based model considering that social groups expand along the edge that connects two neighbors with a similar tag of interest. The model runs on a real-world friendship network, and its simulation results show that various properties of simulated group network can well fit the empirical analysis on real-world social groups, indicating that the model catches the major mechanism driving the evolution of social groups and successfully reconstructs the social group network from a friendship network and throws light on digging of relationships between social functional organizations.
Probabilistic Priority Message Checking Modeling Based on Controller Area Networks
Lin, Cheng-Min
Although the probabilistic model checking tool called PRISM has been applied in many communication systems, such as wireless local area network, Bluetooth, and ZigBee, the technique is not used in a controller area network (CAN). In this paper, we use PRISM to model the mechanism of priority messages for CAN because the mechanism has allowed CAN to become the leader in serial communication for automobile and industry control. Through modeling CAN, it is easy to analyze the characteristic of CAN for further improving the security and efficiency of automobiles. The Markov chain model helps us to model the behaviour of priority messages.
Network models in optimization and their applications in practice
Glover, Fred; Phillips, Nancy V
2011-01-01
Unique in that it focuses on formulation and case studies rather than solutions procedures covering applications for pure, generalized and integer networks, equivalent formulations plus successful techniques of network models. Every chapter contains a simple model which is expanded to handle more complicated developments, a synopsis of existing applications, one or more case studies, at least 20 exercises and invaluable references. An Instructor's Manual presenting detailed solutions to all the problems in the book is available upon request from the Wiley editorial department.
Wei-Bo Chen; Wen-Cheng Liu
2015-01-01
In this study, two artificial neural network models (i.e., a radial basis function neural network, RBFN, and an adaptive neurofuzzy inference system approach, ANFIS) and a multilinear regression (MLR) model were developed to simulate the DO, TP, Chl a, and SD in the Mingder Reservoir of central Taiwan. The input variables of the neural network and the MLR models were determined using linear regression. The performances were evaluated using the RBFN, ANFIS, and MLR models based on statistical ...
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.
Spatial-temporal modeling of malware propagation in networks.
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.
Artificial neural network modeling of dissolved oxygen in reservoir.
Chen, Wei-Bo; Liu, Wen-Cheng
2014-02-01
The water quality of reservoirs is one of the key factors in the operation and water quality management of reservoirs. Dissolved oxygen (DO) in water column is essential for microorganisms and a significant indicator of the state of aquatic ecosystems. In this study, two artificial neural network (ANN) models including back propagation neural network (BPNN) and adaptive neural-based fuzzy inference system (ANFIS) approaches and multilinear regression (MLR) model were developed to estimate the DO concentration in the Feitsui Reservoir of northern Taiwan. The input variables of the neural network are determined as water temperature, pH, conductivity, turbidity, suspended solids, total hardness, total alkalinity, and ammonium nitrogen. The performance of the ANN models and MLR model was assessed through the mean absolute error, root mean square error, and correlation coefficient computed from the measured and model-simulated DO values. The results reveal that ANN estimation performances were superior to those of MLR. Comparing to the BPNN and ANFIS models through the performance criteria, the ANFIS model is better than the BPNN model for predicting the DO values. Study results show that the neural network particularly using ANFIS model is able to predict the DO concentrations with reasonable accuracy, suggesting that the neural network is a valuable tool for reservoir management in Taiwan.
Extending a configuration model to find communities in complex networks
Jin, Di; He, Dongxiao; Hu, Qinghua; Baquero, Carlos; Yang, Bo
2013-09-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.
Innovative research of AD HOC network mobility model
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.
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.
A model reduction method for biochemical reaction networks.
Rao, Shodhan; van der Schaft, Arjan; van Eunen, Karen; Bakker, Barbara M; Jayawardhana, Bayu
2014-05-03
In this paper we propose a model reduction method for biochemical reaction networks governed by a variety of reversible and irreversible enzyme kinetic rate laws, including reversible Michaelis-Menten and Hill kinetics. The method proceeds by a stepwise reduction in the number of complexes, defined as the left and right-hand sides of the reactions in the network. It is based on the Kron reduction of the weighted Laplacian matrix, which describes the graph structure of the complexes and reactions in the network. It does not rely on prior knowledge of the dynamic behaviour of the network and hence can be automated, as we demonstrate. The reduced network has fewer complexes, reactions, variables and parameters as compared to the original network, and yet the behaviour of a preselected set of significant metabolites in the reduced network resembles that of the original network. Moreover the reduced network largely retains the structure and kinetics of the original model. We apply our method to a yeast glycolysis model and a rat liver fatty acid beta-oxidation model. When the number of state variables in the yeast model is reduced from 12 to 7, the difference between metabolite concentrations in the reduced and the full model, averaged over time and species, is only 8%. Likewise, when the number of state variables in the rat-liver beta-oxidation model is reduced from 42 to 29, the difference between the reduced model and the full model is 7.5%. The method has improved our understanding of the dynamics of the two networks. We found that, contrary to the general disposition, the first few metabolites which were deleted from the network during our stepwise reduction approach, are not those with the shortest convergence times. It shows that our reduction approach performs differently from other approaches that are based on time-scale separation. The method can be used to facilitate fitting of the parameters or to embed a detailed model of interest in a more coarse
An ART neural network model of discrimination shift learning
Raijmakers, M.E.J.; Coffey, E.; Stevenson, C.; Winkel, J.; Berkeljon, A.; Taatgen, N.; van Rijn, H.
2009-01-01
We present an ART-based neural network model (adapted from [2]) of the development of discrimination-shift learning that models the trial-by-trial learning process in great detail. In agreement with the results of human participants (4-20 years of age) in [1] the model revealed two distinct learning
Threat model framework and methodology for personal networks (PNs)
DEFF Research Database (Denmark)
Prasad, Neeli R.
2007-01-01
is to give a structured, convenient approach for building threat models. A framework for the threat model is presented with a list of requirements for methodology. The methodology will be applied to build a threat model for Personal Networks. Practical tools like UML sequence diagrams and attack trees have...
Geometric and Network Model for Knowledge Structure and Mindspace
Chris Arney
2012-01-01
This paper describes an adaptive, complex network architecture for knowledge representation in virtual mindspace. Structures and processes for knowing, remembering, thinking, learning, deciding, and communicating describe a virtual geometric space (mathematical model) of a notional mind. This mindspace model can be visualized as a workspace and this paper provides a glimpse of a virtual model of the mind.
Geometric and Network Model for Knowledge Structure and Mindspace
Directory of Open Access Journals (Sweden)
Chris Arney
2012-02-01
Full Text Available This paper describes an adaptive, complex network architecture for knowledge representation in virtual mindspace. Structures and processes for knowing, remembering, thinking, learning, deciding, and communicating describe a virtual geometric space (mathematical model of a notional mind. This mindspace model can be visualized as a workspace and this paper provides a glimpse of a virtual model of the mind.
Bayesian Network Models for Local Dependence among Observable Outcome Variables
Almond, Russell G.; Mulder, Joris; Hemat, Lisa A.; Yan, Duanli
2009-01-01
Bayesian network models offer a large degree of flexibility for modeling dependence among observables (item outcome variables) from the same task, which may be dependent. This article explores four design patterns for modeling locally dependent observations: (a) no context--ignores dependence among observables; (b) compensatory context--introduces…
Network and adaptive system of systems modeling and analysis.
Energy Technology Data Exchange (ETDEWEB)
Lawton, Craig R.; Campbell, James E. Dr. (.; .); Anderson, Dennis James; Eddy, John P.
2007-05-01
This report documents the results of an LDRD program entitled ''Network and Adaptive System of Systems Modeling and Analysis'' that was conducted during FY 2005 and FY 2006. The purpose of this study was to determine and implement ways to incorporate network communications modeling into existing System of Systems (SoS) modeling capabilities. Current SoS modeling, particularly for the Future Combat Systems (FCS) program, is conducted under the assumption that communication between the various systems is always possible and occurs instantaneously. A more realistic representation of these communications allows for better, more accurate simulation results. The current approach to meeting this objective has been to use existing capabilities to model network hardware reliability and adding capabilities to use that information to model the impact on the sustainment supply chain and operational availability.
Constructing Neuronal Network Models in Massively Parallel Environments
Directory of Open Access Journals (Sweden)
Tammo Ippen
2017-05-01
Full Text Available Recent advances in the development of data structures to represent spiking neuron network models enable us to exploit the complete memory of petascale computers for a single brain-scale network simulation. In this work, we investigate how well we can exploit the computing power of such supercomputers for the creation of neuronal networks. Using an established benchmark, we divide the runtime of simulation code into the phase of network construction and the phase during which the dynamical state is advanced in time. We find that on multi-core compute nodes network creation scales well with process-parallel code but exhibits a prohibitively large memory consumption. Thread-parallel network creation, in contrast, exhibits speedup only up to a small number of threads but has little overhead in terms of memory. We further observe that the algorithms creating instances of model neurons and their connections scale well for networks of ten thousand neurons, but do not show the same speedup for networks of millions of neurons. Our work uncovers that the lack of scaling of thread-parallel network creation is due to inadequate memory allocation strategies and demonstrates that thread-optimized memory allocators recover excellent scaling. An analysis of the loop order used for network construction reveals that more complex tests on the locality of operations significantly improve scaling and reduce runtime by allowing construction algorithms to step through large networks more efficiently than in existing code. The combination of these techniques increases performance by an order of magnitude and harnesses the increasingly parallel compute power of the compute nodes in high-performance clusters and supercomputers.
Constructing Neuronal Network Models in Massively Parallel Environments.
Ippen, Tammo; Eppler, Jochen M; Plesser, Hans E; Diesmann, Markus
2017-01-01
Recent advances in the development of data structures to represent spiking neuron network models enable us to exploit the complete memory of petascale computers for a single brain-scale network simulation. In this work, we investigate how well we can exploit the computing power of such supercomputers for the creation of neuronal networks. Using an established benchmark, we divide the runtime of simulation code into the phase of network construction and the phase during which the dynamical state is advanced in time. We find that on multi-core compute nodes network creation scales well with process-parallel code but exhibits a prohibitively large memory consumption. Thread-parallel network creation, in contrast, exhibits speedup only up to a small number of threads but has little overhead in terms of memory. We further observe that the algorithms creating instances of model neurons and their connections scale well for networks of ten thousand neurons, but do not show the same speedup for networks of millions of neurons. Our work uncovers that the lack of scaling of thread-parallel network creation is due to inadequate memory allocation strategies and demonstrates that thread-optimized memory allocators recover excellent scaling. An analysis of the loop order used for network construction reveals that more complex tests on the locality of operations significantly improve scaling and reduce runtime by allowing construction algorithms to step through large networks more efficiently than in existing code. The combination of these techniques increases performance by an order of magnitude and harnesses the increasingly parallel compute power of the compute nodes in high-performance clusters and supercomputers.
Social Insects: A Model System for Network Dynamics
Charbonneau, Daniel; Blonder, Benjamin; Dornhaus, Anna
Social insect colonies (ants, bees, wasps, and termites) show sophisticated collective problem-solving in the face of variable constraints. Individuals exchange information and materials such as food. The resulting network structure and dynamics can inform us about the mechanisms by which the insects achieve particular collective behaviors and these can be transposed to man-made and social networks. We discuss how network analysis can answer important questions about social insects, such as how effective task allocation or information flow is realized. We put forward the idea that network analysis methods are under-utilized in social insect research, and that they can provide novel ways to view the complexity of collective behavior, particularly if network dynamics are taken into account. To illustrate this, we present an example of network tasks performed by ant workers, linked by instances of workers switching from one task to another. We show how temporal network analysis can propose and test new hypotheses on mechanisms of task allocation, and how adding temporal elements to static networks can drastically change results. We discuss the benefits of using social insects as models for complex systems in general. There are multiple opportunities emergent technologies and analysis methods in facilitating research on social insect network. The potential for interdisciplinary work could significantly advance diverse fields such as behavioral ecology, computer sciences, and engineering.
Language Networks as Models of Cognition: Understanding Cognition through Language
Beckage, Nicole M.; Colunga, Eliana
Language is inherently cognitive and distinctly human. Separating the object of language from the human mind that processes and creates language fails to capture the full language system. Linguistics traditionally has focused on the study of language as a static representation, removed from the human mind. Network analysis has traditionally been focused on the properties and structure that emerge from network representations. Both disciplines could gain from looking at language as a cognitive process. In contrast, psycholinguistic research has focused on the process of language without committing to a representation. However, by considering language networks as approximations of the cognitive system we can take the strength of each of these approaches to study human performance and cognition as related to language. This paper reviews research showcasing the contributions of network science to the study of language. Specifically, we focus on the interplay of cognition and language as captured by a network representation. To this end, we review different types of language network representations before considering the influence of global level network features. We continue by considering human performance in relation to network structure and conclude with theoretical network models that offer potential and testable explanations of cognitive and linguistic phenomena.
Regional Computation of TEC Using a Neural Network Model
Leandro, R. F.; Santos, M. C.
2004-05-01
One of the main sources of errors of GPS measurements is the ionosphere refraction. As a dispersive medium, the ionosphere allow its influence to be computed by using dual frequency receivers. In the case of single frequency receivers it is necessary to use models that tell us how big the ionospheric refraction is. The GPS broadcast message carries parameters of this model, namely Klobuchar model. Dual frequency receivers allow to estimate the influence of ionosphere in the GPS signal by the computation of TEC (Total Electron Content) values, that have a direct relationship with the magnitude of the delay caused by the ionosphere. One alternative is to create a regional model based on a network of dual frequency receivers. In this case, the regional behaviour of ionosphere is modelled in a way that it is possible to estimate the TEC values into or near this region. This regional model can be based on polynomials, for example. In this work we will present a Neural Network-based model to the regional computation of TEC. The advantage of using a Neural Network is that it is not necessary to have a great knowledge on the behaviour of the modelled surface due to the adaptation capability of neural networks training process, that is an iterative adjust of the synaptic weights in function of residuals, using the training parameters. Therefore, the previous knowledge of the modelled phenomena is important to define what kind of and how many parameters are needed to train the neural network so that reasonable results are obtained from the estimations. We have used data from the GPS tracking network in Brazil, and we have tested the accuracy of the new model to all locations where there is a station, accessing the efficiency of the model everywhere. TEC values were computed for each station of the network. After that the training parameters data set for the test station was formed, with the TEC values of all others (all stations, except the test one). The Neural Network was
Modeling of axonal endoplasmic reticulum network by spastic paraplegia proteins.
Yalçın, Belgin; Zhao, Lu; Stofanko, Martin; O'Sullivan, Niamh C; Kang, Zi Han; Roost, Annika; Thomas, Matthew R; Zaessinger, Sophie; Blard, Olivier; Patto, Alex L; Sohail, Anood; Baena, Valentina; Terasaki, Mark; O'Kane, Cahir J
2017-07-25
Axons contain a smooth tubular endoplasmic reticulum (ER) network that is thought to be continuous with ER throughout the neuron; the mechanisms that form this axonal network are unknown. Mutations affecting reticulon or REEP proteins, with intramembrane hairpin domains that model ER membranes, cause an axon degenerative disease, hereditary spastic paraplegia (HSP). We show that Drosophila axons have a dynamic axonal ER network, which these proteins help to model. Loss of HSP hairpin proteins causes ER sheet expansion, partial loss of ER from distal motor axons, and occasional discontinuities in axonal ER. Ultrastructural analysis reveals an extensive ER network in axons, which shows larger and fewer tubules in larvae that lack reticulon and REEP proteins, consistent with loss of membrane curvature. Therefore HSP hairpin-containing proteins are required for shaping and continuity of axonal ER, thus suggesting roles for ER modeling in axon maintenance and function.
PageRank model of opinion formation on social networks
Kandiah, Vivek; Shepelyansky, Dima L.
2012-11-01
We propose the PageRank model of opinion formation and investigate its rich properties on real directed networks of the Universities of Cambridge and Oxford, LiveJournal, and Twitter. In this model, the opinion formation of linked electors is weighted with their PageRank probability. Such a probability is used by the Google search engine for ranking of web pages. We find that the society elite, corresponding to the top PageRank nodes, can impose its opinion on a significant fraction of the society. However, for a homogeneous distribution of two opinions, there exists a bistability range of opinions which depends on a conformist parameter characterizing the opinion formation. We find that the LiveJournal and Twitter networks have a stronger tendency to a totalitarian opinion formation than the university networks. We also analyze the Sznajd model generalized for scale-free networks with the weighted PageRank vote of electors.
A growing social network model in geographical space
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.
Approaches to modeling gene regulatory networks: a gentle introduction.
Schlitt, Thomas
2013-01-01
This chapter is split into two main sections; first, I will present an introduction to gene networks. Second, I will discuss various approaches to gene network modeling which will include some examples for using different data sources. Computational modeling has been used for many different biological systems and many approaches have been developed addressing the different needs posed by the different application fields. The modeling approaches presented here are not limited to gene regulatory networks and occasionally I will present other examples. The material covered here is an update based on several previous publications by Thomas Schlitt and Alvis Brazma (FEBS Lett 579(8),1859-1866, 2005; Philos Trans R Soc Lond B Biol Sci 361(1467), 483-494, 2006; BMC Bioinformatics 8(suppl 6), S9, 2007) that formed the foundation for a lecture on gene regulatory networks at the In Silico Systems Biology workshop series at the European Bioinformatics Institute in Hinxton.
Joint Modelling of Structural and Functional Brain Networks
DEFF Research Database (Denmark)
Andersen, Kasper Winther; Herlau, Tue; Mørup, Morten
Functional and structural magnetic resonance imaging have become the most important noninvasive windows to the human brain. A major challenge in the analysis of brain networks is to establish the similarities and dissimilarities between functional and structural connectivity. We formulate a non......-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...... significant structures that are consistently shared across subjects and data splits. This provides an unsupervised approach for modeling of structure-function relations in the brain and provides a general framework for multimodal integration....
Modeling and Simulation Network Data Standards
2011-09-30
12.1 Open Shortest Path First ( OSPF ) Protocol commonly used to find the shortest path between two nodes. User defined. 12.2 Border Gateway Protocol...Element Definition 12.7 Request for Comments – 1256 (RFC-1256) Router discovery protocol. 13.0 OSPF Sub-elements define OSPF parameters 13.1...resolution network analysis simulation tool OSPF open shortest path first OV operational view PEO-I Program Executive Office - Information
Network Analysis and Modeling in Systems Biology
Bosque Chacón, Gabriel
2017-01-01
This thesis is dedicated to the study and comprehension of biological networks at the molecular level. The objectives were to analyse their topology, integrate it in a genotype-phenotype analysis, develop richer mathematical descriptions for them, study their community structure and compare different methodologies for estimating their internal fluxes. The work presented in this document moves around three main axes. The first one is the biological. Which organisms were studied in this ...
Network Security Threats and Protection Models
Kumar, Amit; Malhotra, Santosh
2015-01-01
In a brave new age of global connectivity and e-commerce, interconnections via networks have heightened, creating for both individuals and organizations, a state of complete dependence upon vulnerable systems for storage and transfer of information. Never before, have so many people had power in their own hands. The power to deface websites, access personal mail accounts, and worse more the potential to bring down entire governments, and financial corporations through openly documented softwa...
Stochastic modelling and control of communication networks
Zuraniewski, P.W.
2011-01-01
The unprecedented growth of the Information Technologies sector observed within the past years creates an excellent opportunity to conduct new, exciting and interdisciplinary research. Increasing complexity of the communication networks calls for incorporating rigorously developed and reliable methods for traffic control and management. Mathematics may offer extremely valuable tools to achieve these goals but transforming an engineering problem into the mathematical one requires a good unders...
Bayesian network models for error detection in radiotherapy plans
Kalet, Alan M.; Gennari, John H.; Ford, Eric C.; Phillips, Mark H.
2015-04-01
The purpose of this study is to design and develop a probabilistic network for detecting errors in radiotherapy plans for use at the time of initial plan verification. Our group has initiated a multi-pronged approach to reduce these errors. We report on our development of Bayesian models of radiotherapy plans. Bayesian networks consist of joint probability distributions that define the probability of one event, given some set of other known information. Using the networks, we find the probability of obtaining certain radiotherapy parameters, given a set of initial clinical information. A low probability in a propagated network then corresponds to potential errors to be flagged for investigation. To build our networks we first interviewed medical physicists and other domain experts to identify the relevant radiotherapy concepts and their associated interdependencies and to construct a network topology. Next, to populate the network’s conditional probability tables, we used the Hugin Expert software to learn parameter distributions from a subset of de-identified data derived from a radiation oncology based clinical information database system. These data represent 4990 unique prescription cases over a 5 year period. Under test case scenarios with approximately 1.5% introduced error rates, network performance produced areas under the ROC curve of 0.88, 0.98, and 0.89 for the lung, brain and female breast cancer error detection networks, respectively. Comparison of the brain network to human experts performance (AUC of 0.90 ± 0.01) shows the Bayes network model performs better than domain experts under the same test conditions. Our results demonstrate the feasibility and effectiveness of comprehensive probabilistic models as part of decision support systems for improved detection of errors in initial radiotherapy plan verification procedures.
Social Network Analyses and Nutritional Behavior: An Integrated Modeling Approach
Directory of Open Access Journals (Sweden)
Alistair McNair Senior
2016-01-01
Full Text Available Animals have evolved complex foraging strategies to obtain a nutritionally balanced diet and associated fitness benefits. Recent advances in nutrition research, combining state-space models of nutritional geometry with agent-based models of systems biology, show how nutrient targeted foraging behavior can also influence animal social interactions, ultimately affecting collective dynamics and group structures. Here we demonstrate how social network analyses can be integrated into such a modeling framework and provide a tangible and practical analytical tool to compare experimental results with theory. We illustrate our approach by examining the case of nutritionally mediated dominance hierarchies. First we show how nutritionally explicit agent-based models that simulate the emergence of dominance hierarchies can be used to generate social networks. Importantly the structural properties of our simulated networks bear similarities to dominance networks of real animals (where conflicts are not always directly related to nutrition. Finally, we demonstrate how metrics from social network analyses can be used to predict the fitness of agents in these simulated competitive environments. Our results highlight the potential importance of nutritional mechanisms in shaping dominance interactions in a wide range of social and ecological contexts. Nutrition likely influences social interaction in many species, and yet a theoretical framework for exploring these effects is currently lacking. Combining social network analyses with computational models from nutritional ecology may bridge this divide, representing a pragmatic approach for generating theoretical predictions for nutritional experiments.
Developing Network Location Model in Uncertainty Mode (Robust Mode
Directory of Open Access Journals (Sweden)
AMINI Mousa
2013-01-01
Full Text Available In this research, facility location problem - network design under uncertainty robust mode has been discussed. In this regard a model will be developed, so that the uncertainty in parameters such as demand and problem’s various costs considered. Facility location- network design, unlike classical facility location models, which are assumed that network structure is pre-defined and specified- will also decide on the structure of the network. This has been in many actual applications such as road network, communication systems and etc and finding facility location and main network designing simultaneously has deemed important and the need for simultaneous design and optimization models to meet the mentioned items is felt. Different approaches have been developed in the uncertainty optimization literature. Amongst them, robust and stochastic optimizations are well- known. To deal with uncertainty and problem modeling, in this research robust optimization approach have been used. In addition, by using generated random samples, the proposed model has been tested and computational analysis is presented for various parameters.
Soh, Keng Cher; Miskovic, Ljubisa; Hatzimanikatis, Vassily
2012-03-01
Many important problems in cell biology arise from the dense nonlinear interactions between functional modules. The importance of mathematical modelling and computer simulation in understanding cellular processes is now indisputable and widely appreciated. Genome-scale metabolic models have gained much popularity and utility in helping us to understand and test hypotheses about these complex networks. However, there are some caveats that come with the use and interpretation of different types of metabolic models, which we aim to highlight here. We discuss and illustrate how the integration of thermodynamic and kinetic properties of the yeast metabolic networks in network analyses can help in understanding and utilizing this organism more successfully in the areas of metabolic engineering, synthetic biology and disease treatment. © 2011 Federation of European Microbiological Societies. Published by Blackwell Publishing Ltd. All rights reserved.
Generalized memory associativity in a network model for the neuroses
Wedemann, Roseli S.; Donangelo, Raul; de Carvalho, Luís A. V.
2009-03-01
We review concepts introduced in earlier work, where a neural network mechanism describes some mental processes in neurotic pathology and psychoanalytic working-through, as associative memory functioning, according to the findings of Freud. We developed a complex network model, where modules corresponding to sensorial and symbolic memories interact, representing unconscious and conscious mental processes. The model illustrates Freud's idea that consciousness is related to symbolic and linguistic memory activity in the brain. We have introduced a generalization of the Boltzmann machine to model memory associativity. Model behavior is illustrated with simulations and some of its properties are analyzed with methods from statistical mechanics.
Constitutive models for rubber networks undergoing simultaneous crosslinking and scission.
Energy Technology Data Exchange (ETDEWEB)
Thompson, Aidan Patrick; Curro, John G.; Rottach, Dana R. (University of New Mexico, Albuquerque, NM); Grest, Gary Stephen; Budzien, Joanne L.; Lo, David Chi S.
2006-01-01
Constitutive models for chemically reacting networks are formulated based on a generalization of the independent network hypothesis. These models account for the coupling between chemical reaction and strain histories, and have been tested by comparison with microscopic molecular dynamics simulations. An essential feature of these models is the introduction of stress transfer functions that describe the interdependence between crosslinks formed and broken at various strains. Efforts are underway to implement these constitutive models into the finite element code Adagio. Preliminary results are shown that illustrate the effects of changing crosslinking and scission rates and history.
ICA model order selection of task co-activation networks.
Ray, Kimberly L; McKay, D Reese; Fox, Peter M; Riedel, Michael C; Uecker, Angela M; Beckmann, Christian F; Smith, Stephen M; Fox, Peter T; Laird, Angela R
2013-01-01
Independent component analysis (ICA) has become a widely used method for extracting functional networks in the brain during rest and task. Historically, preferred ICA dimensionality has widely varied within the neuroimaging community, but typically varies between 20 and 100 components. This can be problematic when comparing results across multiple studies because of the impact ICA dimensionality has on the topology of its resultant components. Recent studies have demonstrated that ICA can be applied to peak activation coordinates archived in a large neuroimaging database (i.e., BrainMap Database) to yield whole-brain task-based co-activation networks. A strength of applying ICA to BrainMap data is that the vast amount of metadata in BrainMap can be used to quantitatively assess tasks and cognitive processes contributing to each component. In this study, we investigated the effect of model order on the distribution of functional properties across networks as a method for identifying the most informative decompositions of BrainMap-based ICA components. Our findings suggest dimensionality of 20 for low model order ICA to examine large-scale brain networks, and dimensionality of 70 to provide insight into how large-scale networks fractionate into sub-networks. We also provide a functional and organizational assessment of visual, motor, emotion, and interoceptive task co-activation networks as they fractionate from low to high model-orders.
The new challenges of multiplex networks: Measures and models
Battiston, Federico; Nicosia, Vincenzo; Latora, Vito
2017-02-01
What do societies, the Internet, and the human brain have in common? They are all examples of complex relational systems, whose emerging behaviours are largely determined by the non-trivial networks of interactions among their constituents, namely individuals, computers, or neurons, rather than only by the properties of the units themselves. In the last two decades, network scientists have proposed models of increasing complexity to better understand real-world systems. Only recently we have realised that multiplexity, i.e. the coexistence of several types of interactions among the constituents of a complex system, is responsible for substantial qualitative and quantitative differences in the type and variety of behaviours that a complex system can exhibit. As a consequence, multilayer and multiplex networks have become a hot topic in complexity science. Here we provide an overview of some of the measures proposed so far to characterise the structure of multiplex networks, and a selection of models aiming at reproducing those structural properties and quantifying their statistical significance. Focusing on a subset of relevant topics, this brief review is a quite comprehensive introduction to the most basic tools for the analysis of multiplex networks observed in the real-world. The wide applicability of multiplex networks as a framework to model complex systems in different fields, from biology to social sciences, and the colloquial tone of the paper will make it an interesting read for researchers working on both theoretical and experimental analysis of networked systems.
Modeling Marine Electromagnetic Survey with Radial Basis Function Networks
Directory of Open Access Journals (Sweden)
Agus Arif
2014-11-01
Full Text Available A marine electromagnetic survey is an engineering endeavour to discover the location and dimension of a hydrocarbon layer under an ocean floor. In this kind of survey, an array of electric and magnetic receivers are located on the sea floor and record the scattered, refracted and reflected electromagnetic wave, which has been transmitted by an electric dipole antenna towed by a vessel. The data recorded in receivers must be processed and further analysed to estimate the hydrocarbon location and dimension. To conduct those analyses successfuly, a radial basis function (RBF network could be employed to become a forward model of the input-output relationship of the data from a marine electromagnetic survey. This type of neural networks is working based on distances between its inputs and predetermined centres of some basis functions. A previous research had been conducted to model the same marine electromagnetic survey using another type of neural networks, which is a multi layer perceptron (MLP network. By comparing their validation and training performances (mean-squared errors and correlation coefficients, it is concluded that, in this case, the MLP network is comparatively better than the RBF network[1].[1] This manuscript is an extended version of our previous paper, entitled Radial Basis Function Networks for Modeling Marine Electromagnetic Survey, which had been presented on 2011 International Conference on Electrical Engineering and Informatics, 17-19 July 2011, Bandung, Indonesia.
A mixture copula Bayesian network model for multimodal genomic data
Directory of Open Access Journals (Sweden)
Qingyang Zhang
2017-04-01
Full Text Available Gaussian Bayesian networks have become a widely used framework to estimate directed associations between joint Gaussian variables, where the network structure encodes the decomposition of multivariate normal density into local terms. However, the resulting estimates can be inaccurate when the normality assumption is moderately or severely violated, making it unsuitable for dealing with recent genomic data such as the Cancer Genome Atlas data. In the present paper, we propose a mixture copula Bayesian network model which provides great flexibility in modeling non-Gaussian and multimodal data for causal inference. The parameters in mixture copula functions can be efficiently estimated by a routine expectation–maximization algorithm. A heuristic search algorithm based on Bayesian information criterion is developed to estimate the network structure, and prediction can be further improved by the best-scoring network out of multiple predictions from random initial values. Our method outperforms Gaussian Bayesian networks and regular copula Bayesian networks in terms of modeling flexibility and prediction accuracy, as demonstrated using a cell signaling data set. We apply the proposed methods to the Cancer Genome Atlas data to study the genetic and epigenetic pathways that underlie serous ovarian cancer.
A mixture copula Bayesian network model for multimodal genomic data.
Zhang, Qingyang; Shi, Xuan
2017-01-01
Gaussian Bayesian networks have become a widely used framework to estimate directed associations between joint Gaussian variables, where the network structure encodes the decomposition of multivariate normal density into local terms. However, the resulting estimates can be inaccurate when the normality assumption is moderately or severely violated, making it unsuitable for dealing with recent genomic data such as the Cancer Genome Atlas data. In the present paper, we propose a mixture copula Bayesian network model which provides great flexibility in modeling non-Gaussian and multimodal data for causal inference. The parameters in mixture copula functions can be efficiently estimated by a routine expectation-maximization algorithm. A heuristic search algorithm based on Bayesian information criterion is developed to estimate the network structure, and prediction can be further improved by the best-scoring network out of multiple predictions from random initial values. Our method outperforms Gaussian Bayesian networks and regular copula Bayesian networks in terms of modeling flexibility and prediction accuracy, as demonstrated using a cell signaling data set. We apply the proposed methods to the Cancer Genome Atlas data to study the genetic and epigenetic pathways that underlie serous ovarian cancer.
Applying Model Based Systems Engineering to NASA's Space Communications Networks
Bhasin, Kul; Barnes, Patrick; Reinert, Jessica; Golden, Bert
2013-01-01
System engineering practices for complex systems and networks now require that requirement, architecture, and concept of operations product development teams, simultaneously harmonize their activities to provide timely, useful and cost-effective products. When dealing with complex systems of systems, traditional systems engineering methodology quickly falls short of achieving project objectives. This approach is encumbered by the use of a number of disparate hardware and software tools, spreadsheets and documents to grasp the concept of the network design and operation. In case of NASA's space communication networks, since the networks are geographically distributed, and so are its subject matter experts, the team is challenged to create a common language and tools to produce its products. Using Model Based Systems Engineering methods and tools allows for a unified representation of the system in a model that enables a highly related level of detail. To date, Program System Engineering (PSE) team has been able to model each network from their top-level operational activities and system functions down to the atomic level through relational modeling decomposition. These models allow for a better understanding of the relationships between NASA's stakeholders, internal organizations, and impacts to all related entities due to integration and sustainment of existing systems. Understanding the existing systems is essential to accurate and detailed study of integration options being considered. In this paper, we identify the challenges the PSE team faced in its quest to unify complex legacy space communications networks and their operational processes. We describe the initial approaches undertaken and the evolution toward model based system engineering applied to produce Space Communication and Navigation (SCaN) PSE products. We will demonstrate the practice of Model Based System Engineering applied to integrating space communication networks and the summary of its
Boolean network model predicts cell cycle sequence of fission yeast.
Directory of Open Access Journals (Sweden)
Maria I Davidich
Full Text Available A Boolean network model of the cell-cycle regulatory network of fission yeast (Schizosaccharomyces Pombe is constructed solely on the basis of the known biochemical interaction topology. Simulating the model in the computer faithfully reproduces the known activity sequence of regulatory proteins along the cell cycle of the living cell. Contrary to existing differential equation models, no parameters enter the model except the structure of the regulatory circuitry. The dynamical properties of the model indicate that the biological dynamical sequence is robustly implemented in the regulatory network, with the biological stationary state G1 corresponding to the dominant attractor in state space, and with the biological regulatory sequence being a strongly attractive trajectory. Comparing the fission yeast cell-cycle model to a similar model of the corresponding network in S. cerevisiae, a remarkable difference in circuitry, as well as dynamics is observed. While the latter operates in a strongly damped mode, driven by external excitation, the S. pombe network represents an auto-excited system with external damping.
A Cayley Tree Immune Network Model with Antibody Dynamics
Anderson, R W; Perelson, A S; Anderson, Russell W.; Neumann, Avidan U.; Perelson, Alan S.
1993-01-01
Abstract: A Cayley tree model of idiotypic networks that includes both B cell and antibody dynamics is formulated and analyzed. As in models with B cells only, localized states exist in the network with limited numbers of activated clones surrounded by virgin or near-virgin clones. The existence and stability of these localized network states are explored as a function of model parameters. As in previous models that have included antibody, the stability of immune and tolerant localized states are shown to depend on the ratio of antibody to B cell lifetimes as well as the rate of antibody complex removal. As model parameters are varied, localized steady-states can break down via two routes: dynamically, into chaotic attractors, or structurally into percolation attractors. For a given set of parameters, percolation and chaotic attractors can coexist with localized attractors, and thus there do not exist clear cut boundaries in parameter space that separate regions of localized attractors from regions of percola...
Modeling the Merger of the Classified Networks of the DDN (Defense Data Network): BLACKER
1988-11-01
Cain (1983) presented ’The DoD Internet Architecture Model" approach where a common internal host-to-host packet or datagram service is proposed for...The baseline model was a simulation similar to the model of *The DoD Internet Architecture Model" presented by Cerf and Cain. (1983) Parameters for...in each network can be redirected, what would be the optimal method for allocation? Third, what are the impacts of interdomain messages? What happens
Multi-Topic Tracking Model for dynamic social network
Li, Yuhua; Liu, Changzheng; Zhao, Ming; Li, Ruixuan; Xiao, Hailing; Wang, Kai; Zhang, Jun
2016-07-01
The topic tracking problem has attracted much attention in the last decades. However, existing approaches rarely consider network structures and textual topics together. In this paper, we propose a novel statistical model based on dynamic bayesian network, namely Multi-Topic Tracking Model for Dynamic Social Network (MTTD). It takes influence phenomenon, selection phenomenon, document generative process and the evolution of textual topics into account. Specifically, in our MTTD model, Gibbs Random Field is defined to model the influence of historical status of users in the network and the interdependency between them in order to consider the influence phenomenon. To address the selection phenomenon, a stochastic block model is used to model the link generation process based on the users' interests to topics. Probabilistic Latent Semantic Analysis (PLSA) is used to describe the document generative process according to the users' interests. Finally, the dependence on the historical topic status is also considered to ensure the continuity of the topic itself in topic evolution model. Expectation Maximization (EM) algorithm is utilized to estimate parameters in the proposed MTTD model. Empirical experiments on real datasets show that the MTTD model performs better than Popular Event Tracking (PET) and Dynamic Topic Model (DTM) in generalization performance, topic interpretability performance, topic content evolution and topic popularity evolution performance.
Enterprise Networks for Competences Exchange: A Simulation Model
Remondino, Marco; Pironti, Marco; Pisano, Paola
A business process is a set of logically related tasks performed to achieve a defined business and related to improving organizational processes. Process innovation can happen at various levels: incrementally, redesign of existing processes, new processes. The knowledge behind process innovation can be shared, acquired, changed and increased by the enterprises inside a network. An enterprise can decide to exploit innovative processes it owns, thus potentially gaining competitive advantage, but risking, in turn, that other players could reach the same technological levels. Or it could decide to share it, in exchange for other competencies or money. These activities could be the basis for a network formation and/or impact the topology of an existing network. In this work an agent based model is introduced (E3), aiming to explore how a process innovation can facilitate network formation, affect its topology, induce new players to enter the market and spread onto the network by being shared or developed by new players.
Robustness and Optimization of Complex Networks : Reconstructability, Algorithms and Modeling
Liu, D.
2013-01-01
The infrastructure networks, including the Internet, telecommunication networks, electrical power grids, transportation networks (road, railway, waterway, and airway networks), gas networks and water networks, are becoming more and more complex. The complex infrastructure networks are crucial to our
ARTIFICIAL NEURAL NETWORK FOR MODELS OF HUMAN OPERATOR
Directory of Open Access Journals (Sweden)
Martin Ruzek
2017-12-01
Full Text Available This paper presents a new approach to mental functions modeling with the use of artificial neural networks. The artificial neural networks seems to be a promising method for the modeling of a human operator because the architecture of the ANN is directly inspired by the biological neuron. On the other hand, the classical paradigms of artificial neural networks are not suitable because they simplify too much the real processes in biological neural network. The search for a compromise between the complexity of biological neural network and the practical feasibility of the artificial network led to a new learning algorithm. This algorithm is based on the classical multilayered neural network; however, the learning rule is different. The neurons are updating their parameters in a way that is similar to real biological processes. The basic idea is that the neurons are competing for resources and the criterion to decide which neuron will survive is the usefulness of the neuron to the whole neural network. The neuron is not using "teacher" or any kind of superior system, the neuron receives only the information that is present in the biological system. The learning process can be seen as searching of some equilibrium point that is equal to a state with maximal importance of the neuron for the neural network. This position can change if the environment changes. The name of this type of learning, the homeostatic artificial neural network, originates from this idea, as it is similar to the process of homeostasis known in any living cell. The simulation results suggest that this type of learning can be useful also in other tasks of artificial learning and recognition.
Fast reconstruction of compact context-specific metabolic network models.
Directory of Open Access Journals (Sweden)
Nikos Vlassis
2014-01-01
Full Text Available Systemic approaches to the study of a biological cell or tissue rely increasingly on the use of context-specific metabolic network models. The reconstruction of such a model from high-throughput data can routinely involve large numbers of tests under different conditions and extensive parameter tuning, which calls for fast algorithms. We present fastcore, a generic algorithm for reconstructing context-specific metabolic network models from global genome-wide metabolic network models such as Recon X. fastcore takes as input a core set of reactions that are known to be active in the context of interest (e.g., cell or tissue, and it searches for a flux consistent subnetwork of the global network that contains all reactions from the core set and a minimal set of additional reactions. Our key observation is that a minimal consistent reconstruction can be defined via a set of sparse modes of the global network, and fastcore iteratively computes such a set via a series of linear programs. Experiments on liver data demonstrate speedups of several orders of magnitude, and significantly more compact reconstructions, over a rival method. Given its simplicity and its excellent performance, fastcore can form the backbone of many future metabolic network reconstruction algorithms.
Clustering network layers with the strata multilayer stochastic block model.
Stanley, Natalie; Shai, Saray; Taylor, Dane; Mucha, Peter J
2016-01-01
Multilayer networks are a useful data structure for simultaneously capturing multiple types of relationships between a set of nodes. In such networks, each relational definition gives rise to a layer. While each layer provides its own set of information, community structure across layers can be collectively utilized to discover and quantify underlying relational patterns between nodes. To concisely extract information from a multilayer network, we propose to identify and combine sets of layers with meaningful similarities in community structure. In this paper, we describe the "strata multilayer stochastic block model" (sMLSBM), a probabilistic model for multilayer community structure. The central extension of the model is that there exist groups of layers, called "strata", which are defined such that all layers in a given stratum have community structure described by a common stochastic block model (SBM). That is, layers in a stratum exhibit similar node-to-community assignments and SBM probability parameters. Fitting the sMLSBM to a multilayer network provides a joint clustering that yields node-to-community and layer-to-stratum assignments, which cooperatively aid one another during inference. We describe an algorithm for separating layers into their appropriate strata and an inference technique for estimating the SBM parameters for each stratum. We demonstrate our method using synthetic networks and a multilayer network inferred from data collected in the Human Microbiome Project.
Navy Network Dependability: Models, Metrics, and Tools
2010-01-01
surveillance; TCDL = Tactical Common Data Link; UHF = ultra high frequency; UFO = ultra-high-frequency follow-on; WGS = Wideband Gapfiller Satellite. RAND...VOICE (DMR VALUES) UFO OE-82 UHF LOS VOICE (DMR VALUES) UHF SATCOM VOICE DMR UHF LOS VOICE DMR TVs ADMS KIV-7 COMSEC ADNS SW ADNS II HW ISNS SW ISNS HW...Data Link; UHF = ultra high frequency; UFO = ultra-high-frequency follow-on; WGS = Wideband Gapfiller Satellite. RAND MG1003-1.1 4 Navy Network
Computer-Supported Modelling of Multi modal Transportation Networks Rationalization
Directory of Open Access Journals (Sweden)
Ratko Zelenika
2007-09-01
Full Text Available This paper deals with issues of shaping and functioning ofcomputer programs in the modelling and solving of multimoda Itransportation network problems. A methodology of an integrateduse of a programming language for mathematical modellingis defined, as well as spreadsheets for the solving of complexmultimodal transportation network problems. The papercontains a comparison of the partial and integral methods ofsolving multimodal transportation networks. The basic hypothesisset forth in this paper is that the integral method results inbetter multimodal transportation network rationalization effects,whereas a multimodal transportation network modelbased on the integral method, once built, can be used as the basisfor all kinds of transportation problems within multimodaltransport. As opposed to linear transport problems, multimodaltransport network can assume very complex shapes. This papercontains a comparison of the partial and integral approach totransp01tation network solving. In the partial approach, astraightforward model of a transp01tation network, which canbe solved through the use of the Solver computer tool within theExcel spreadsheet inteiface, is quite sufficient. In the solving ofa multimodal transportation problem through the integralmethod, it is necessmy to apply sophisticated mathematicalmodelling programming languages which supp01t the use ofcomplex matrix functions and the processing of a vast amountof variables and limitations. The LINGO programming languageis more abstract than the Excel spreadsheet, and it requiresa certain programming knowledge. The definition andpresentation of a problem logic within Excel, in a manner whichis acceptable to computer software, is an ideal basis for modellingin the LINGO programming language, as well as a fasterand more effective implementation of the mathematical model.This paper provides proof for the fact that it is more rational tosolve the problem of multimodal transportation networks by
Forecast of consumer behaviour based on neural networks models comparison
Directory of Open Access Journals (Sweden)
Michael Štencl
2012-01-01
Full Text Available The aim of this article is comparison of accuracy level of forecasted values of several artificial neural network models. The comparison is performed on datasets of Czech household consumption values. Several statistical models often resolve this task with more or fewer restrictions. In previous work where models’ input conditions were not so strict and model with missing data was used (the time series didn’t contain many values we have obtained comparably good results with artificial neural networks. Two views – practical and theoretical, motivate the purpose of this study. Forecasting models for medium term prognosis of the main trends of Czech household consumption is part of the faculty research design grant MSM 6215648904/03/02 (Sub-task 5.3 which defines the practical purpose. Testing of nonlinear autoregressive artificial neural network model compared with feed-forward neural network and radial basis function neural network defines the theoretical purpose. The performance metrics of the models were evaluated using a combination of common error metrics, namely Correlation Coefficient and Mean Square Error, together with the number of epochs and/or main prediction error.
Artificial neural networks modeling gene-environment interaction
Directory of Open Access Journals (Sweden)
Günther Frauke
2012-05-01
Full Text Available Abstract Background Gene-environment interactions play an important role in the etiological pathway of complex diseases. An appropriate statistical method for handling a wide variety of complex situations involving interactions between variables is still lacking, especially when continuous variables are involved. The aim of this paper is to explore the ability of neural networks to model different structures of gene-environment interactions. A simulation study is set up to compare neural networks with standard logistic regression models. Eight different structures of gene-environment interactions are investigated. These structures are characterized by penetrance functions that are based on sigmoid functions or on combinations of linear and non-linear effects of a continuous environmental factor and a genetic factor with main effect or with a masking effect only. Results In our simulation study, neural networks are more successful in modeling gene-environment interactions than logistic regression models. This outperfomance is especially pronounced when modeling sigmoid penetrance functions, when distinguishing between linear and nonlinear components, and when modeling masking effects of the genetic factor. Conclusion Our study shows that neural networks are a promising approach for analyzing gene-environment interactions. Especially, if no prior knowledge of the correct nature of the relationship between co-variables and response variable is present, neural networks provide a valuable alternative to regression methods that are limited to the analysis of linearly separable data.
Directory of Open Access Journals (Sweden)
Elston Timothy C
2004-03-01
Full Text Available Abstract Background Intrinsic fluctuations due to the stochastic nature of biochemical reactions can have large effects on the response of biochemical networks. This is particularly true for pathways that involve transcriptional regulation, where generally there are two copies of each gene and the number of messenger RNA (mRNA molecules can be small. Therefore, there is a need for computational tools for developing and investigating stochastic models of biochemical networks. Results We have developed the software package Biochemical Network Stochastic Simulator (BioNetS for efficientlyand accurately simulating stochastic models of biochemical networks. BioNetS has a graphical user interface that allows models to be entered in a straightforward manner, and allows the user to specify the type of random variable (discrete or continuous for each chemical species in the network. The discrete variables are simulated using an efficient implementation of the Gillespie algorithm. For the continuous random variables, BioNetS constructs and numerically solvesthe appropriate chemical Langevin equations. The software package has been developed to scale efficiently with network size, thereby allowing large systems to be studied. BioNetS runs as a BioSpice agent and can be downloaded from http://www.biospice.org. BioNetS also can be run as a stand alone package. All the required files are accessible from http://x.amath.unc.edu/BioNetS. Conclusions We have developed BioNetS to be a reliable tool for studying the stochastic dynamics of large biochemical networks. Important features of BioNetS are its ability to handle hybrid models that consist of both continuous and discrete random variables and its ability to model cell growth and division. We have verified the accuracy and efficiency of the numerical methods by considering several test systems.
Stochastic population dynamic models as probability networks
M.E. and D.C. Lee. Borsuk
2009-01-01
The dynamics of a population and its response to environmental change depend on the balance of birth, death and age-at-maturity, and there have been many attempts to mathematically model populations based on these characteristics. Historically, most of these models were deterministic, meaning that the results were strictly determined by the equations of the model and...
New approaches to model and study social networks
Lind, P. G.; Herrmann, H. J.
2007-07-01
We describe and develop three recent novelties in network research which are particularly useful for studying social systems. The first one concerns the discovery of some basic dynamical laws that enable the emergence of the fundamental features observed in social networks, namely the nontrivial clustering properties, the existence of positive degree correlations and the subdivision into communities. To reproduce all these features, we describe a simple model of mobile colliding agents, whose collisions define the connections between the agents which are the nodes in the underlying network, and develop some analytical considerations. The second point addresses the particular feature of clustering and its relationship with global network measures, namely with the distribution of the size of cycles in the network. Since in social bipartite networks it is not possible to measure the clustering from standard procedures, we propose an alternative clustering coefficient that can be used to extract an improved normalized cycle distribution in any network. Finally, the third point addresses dynamical processes occurring on networks, namely when studying the propagation of information in them. In particular, we focus on the particular features of gossip propagation which impose some restrictions in the propagation rules. To this end we introduce a quantity, the spread factor, which measures the average maximal fraction of nearest neighbours which get in contact with the gossip, and find the striking result that there is an optimal non-trivial number of friends for which the spread factor is minimized, decreasing the danger of being gossiped about.
Modeling the Relationship Between Social Network Activity, Inactivity, and Growth
Ribeiro, Bruno
2013-01-01
Online Social Networks (OSNs) are multi-billion dollar enterprises. Surprisingly, little is known about the mechanisms that drive them to growth, stability, or death. This study sheds light on these mechanisms. We are particularly interested in OSNs where current subscribers can invite new users to join the network (e.g., Facebook, LinkedIn). Measuring the relationship between subscriber activity and network growth of a large OSN over five years, we formulate three hypotheses that together describe the observed OSN subscriber behavior. We then provide a model (and extensions) that simultaneously satisfies all three hypotheses. Our model provides deep insights into the dynamics of subscriber activity, inactivity, and network growth rates, even predicting four types of OSNs with respect to subscriber activity evolution. Finally, we present activity data of nearly thirty OSN websites, measured over five years, and show that the observed activity is well described by one of the four activity time series predicted...
Metabolic robustness and network modularity: a model study.
Holme, Petter
2011-02-02
Several studies have mentioned network modularity-that a network can easily be decomposed into subgraphs that are densely connected within and weakly connected between each other-as a factor affecting metabolic robustness. In this paper we measure the relation between network modularity and several aspects of robustness directly in a model system of metabolism. By using a model for generating chemical reaction systems where one can tune the network modularity, we find that robustness increases with modularity for changes in the concentrations of metabolites, whereas it decreases with changes in the expression of enzymes. The same modularity scaling is true for the speed of relaxation after the perturbations. Modularity is not a general principle for making metabolism either more or less robust; this question needs to be addressed specifically for different types of perturbations of the system.
WDM Systems and Networks Modeling, Simulation, Design and Engineering
Ellinas, Georgios; Roudas, Ioannis
2012-01-01
WDM Systems and Networks: Modeling, Simulation, Design and Engineering provides readers with the basic skills, concepts, and design techniques used to begin design and engineering of optical communication systems and networks at various layers. The latest semi-analytical system simulation techniques are applied to optical WDM systems and networks, and a review of the various current areas of optical communications is presented. Simulation is mixed with experimental verification and engineering to present the industry as well as state-of-the-art research. This contributed volume is divided into three parts, accommodating different readers interested in various types of networks and applications. The first part of the book presents modeling approaches and simulation tools mainly for the physical layer including transmission effects, devices, subsystems, and systems), whereas the second part features more engineering/design issues for various types of optical systems including ULH, access, and in-building system...
A Reference Model for Semantic Peer-to-Peer Networks
Mawlood-Yunis, Abdul-Rahman; Weiss, Michael; Santoro, Nicola
Today’s information systems are highly networked and need to operate in a global world. With this comes the problem of semantic heterogeneity of information representations. Semantic peer-to- peer networks have been proposed as a solution to this problem. They are based around two components: a peer-to-peer infrastructure for information exchange between information system, and the use of ontologies to define application semantics. However, progress in this area is hampered by a lack of commonality between these approaches, which makes their comparison and translation into practical implementations difficult. In this paper, we describe a reference model for semantic peer-to-peer networks in an effort to remedy this problem. The reference model will (1) enable the establishment of a common terminology for describing semantic peer-to-peer networks, and (2) pave the way for an emerging standardized API that will promote information system interoperability.
Joint physical and numerical modeling of water distribution networks.
Energy Technology Data Exchange (ETDEWEB)
Zimmerman, Adam; O' Hern, Timothy John; Orear, Leslie Jr.; Kajder, Karen C.; Webb, Stephen Walter; Cappelle, Malynda A.; Khalsa, Siri Sahib; Wright, Jerome L.; Sun, Amy Cha-Tien; Chwirka, J. Benjamin; Hartenberger, Joel David; McKenna, Sean Andrew; van Bloemen Waanders, Bart Gustaaf; McGrath, Lucas K.; Ho, Clifford Kuofei
2009-01-01
This report summarizes the experimental and modeling effort undertaken to understand solute mixing in a water distribution network conducted during the last year of a 3-year project. The experimental effort involves measurement of extent of mixing within different configurations of pipe networks, measurement of dynamic mixing in a single mixing tank, and measurement of dynamic solute mixing in a combined network-tank configuration. High resolution analysis of turbulence mixing is carried out via high speed photography as well as 3D finite-volume based Large Eddy Simulation turbulence models. Macroscopic mixing rules based on flow momentum balance are also explored, and in some cases, implemented in EPANET. A new version EPANET code was developed to yield better mixing predictions. The impact of a storage tank on pipe mixing in a combined pipe-tank network during diurnal fill-and-drain cycles is assessed. Preliminary comparison between dynamic pilot data and EPANET-BAM is also reported.
Network modeling of PM10 concentration in Malaysia
Supian, Muhammad Nazirul Aiman Abu; Bakar, Sakhinah Abu; Razak, Fatimah Abdul
2017-08-01
Air pollution is not a new phenomenon in Malaysia. The Department of Environment (DOE) monitors the country's ambient air quality through a network of 51 stations. The air quality is measured using the Air Pollution Index (API) which is mainly recorded based on the concentration of particulate matter, PM10 readings. The Continuous Air Quality Monitoring (CAQM) stations are located in various places across the country. In this study, a network model of air quality based on PM10 concen tration for selected CAQM stations in Malaysia has been developed. The model is built using a graph formulation, G = (V, E) where vertex, V is a set of CAQM stations and edges, E is a set of correlation values for each pair of vertices. The network measurements such as degree distributions, closeness centrality, and betweenness centrality are computed to analyse the behaviour of the network. As a result, a rank of CAQM stations has been produced based on their centrality characteristics.
a Model for Brand Competition Within a Social Network
Huerta-Quintanilla, R.; Canto-Lugo, E.; Rodríguez-Achach, M.
An agent-based model was built representing an economic environment in which m brands are competing for a product market. These agents represent companies that interact within a social network in which a certain agent persuades others to update or shift their brands; the brands of the products they are using. Decision rules were established that caused each agent to react according to the economic benefits it would receive; they updated/shifted only if it was beneficial. Each agent can have only one of the m possible brands, and she can interact with its two nearest neighbors and another set of agents which are chosen according to a particular set of rules in the network topology. An absorbing state was always reached in which a single brand monopolized the network (known as condensation). The condensation time varied as a function of model parameters is studied including an analysis of brand competition using different networks.
Numerical study on the perception-based network formation model
Jo, Hang-Hyun
2015-01-01
In order to understand the evolution of social networks in terms of perception-based strategic link formation, we numerically study a perception-based network formation model. Here each individual is assumed to have his/her own perception of the actual network, and use it to decide whether to create a link to other individual. An individual with the least perception accuracy can benefit from updating his/her perception using that of the most accurate individual via a new link. This benefit is compared to the cost of linking in decision making. Once a new link is created, it affects the accuracies of other individuals' perceptions, leading to a further evolution of the actual network. The initial actual network and initial perceptions are modeled by Erd\\H{o}s-R\\'enyi random networks but with different linking probabilities. Then the stable link density of the actual network is found to show discontinuous transitions or jumps according to the cost of linking. The effect of initial conditions on the complexity o...
Computational Data Modeling for Network-Constrained Moving Objects
DEFF Research Database (Denmark)
Jensen, Christian Søndergaard; Speicys, L.; Kligys, A.
2003-01-01
Advances in wireless communications, positioning technology, and other hardware technologies combine to enable a range of applications that use a mobile users geo-spatial data to deliver online, location-enhanced services, often referred to as location-based services. Assuming that the service...... users are constrained to a transportation network, this paper develops data structures that model road networks, the mobile users, and stationary objects of interest. The proposed framework encompasses two supplementary road network representations, namely a two-dimensional representation and a graph...
Developed hydraulic simulation model for water pipeline networks
Directory of Open Access Journals (Sweden)
A. Ayad
2013-03-01
Full Text Available A numerical method that uses linear graph theory is presented for both steady state, and extended period simulation in a pipe network including its hydraulic components (pumps, valves, junctions, etc.. The developed model is based on the Extended Linear Graph Theory (ELGT technique. This technique is modified to include new network components such as flow control valves and tanks. The technique also expanded for extended period simulation (EPS. A newly modified method for the calculation of updated flows improving the convergence rate is being introduced. Both benchmarks, ad Actual networks are analyzed to check the reliability of the proposed method. The results reveal the finer performance of the proposed method.
A Spatial Clustering Approach for Stochastic Fracture Network Modelling
Seifollahi, S.; Dowd, P. A.; Xu, C.; Fadakar, A. Y.
2014-07-01
Fracture network modelling plays an important role in many application areas in which the behaviour of a rock mass is of interest. These areas include mining, civil, petroleum, water and environmental engineering and geothermal systems modelling. The aim is to model the fractured rock to assess fluid flow or the stability of rock blocks. One important step in fracture network modelling is to estimate the number of fractures and the properties of individual fractures such as their size and orientation. Due to the lack of data and the complexity of the problem, there are significant uncertainties associated with fracture network modelling in practice. Our primary interest is the modelling of fracture networks in geothermal systems and, in this paper, we propose a general stochastic approach to fracture network modelling for this application. We focus on using the seismic point cloud detected during the fracture stimulation of a hot dry rock reservoir to create an enhanced geothermal system; these seismic points are the conditioning data in the modelling process. The seismic points can be used to estimate the geographical extent of the reservoir, the amount of fracturing and the detailed geometries of fractures within the reservoir. The objective is to determine a fracture model from the conditioning data by minimizing the sum of the distances of the points from the fitted fracture model. Fractures are represented as line segments connecting two points in two-dimensional applications or as ellipses in three-dimensional (3D) cases. The novelty of our model is twofold: (1) it comprises a comprehensive fracture modification scheme based on simulated annealing and (2) it introduces new spatial approaches, a goodness-of-fit measure for the fitted fracture model, a measure for fracture similarity and a clustering technique for proposing a locally optimal solution for fracture parameters. We use a simulated dataset to demonstrate the application of the proposed approach
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.
Modelling hierarchical and modular complex networks: division and independence
Kim, D.-H.; Rodgers, G. J.; Kahng, B.; Kim, D.
2005-06-01
We introduce a growing network model which generates both modular and hierarchical structure in a self-organized way. To this end, we modify the Barabási-Albert model into the one evolving under the principles of division and independence as well as growth and preferential attachment (PA). A newly added vertex chooses one of the modules composed of existing vertices, and attaches edges to vertices belonging to that module following the PA rule. When the module size reaches a proper size, the module is divided into two, and a new module is created. The karate club network studied by Zachary is a simple version of the current model. We find that the model can reproduce both modular and hierarchical properties, characterized by the hierarchical clustering function of a vertex with degree k, C(k), being in good agreement with empirical measurements for real-world networks.
Neural Networks and Their Application to Air Force Personnel Modeling
1991-11-01
breadth of techniques provides fertile ground against which to compare the results obtained with neural networks. ", Most of the models in reenlistment or...Specialties (MOSs) receiving SRBs were taken from the 1980 and 1981 Enlisted Master Files ( EMFs ). These 98 MOSs were then aggregated into 15 Career Management... mechanisms , and architectures. Neural Networks, 1(1), 17-62. Hagiwara, M. (1990). Accelerated backpropagation using unlearning based on a Hebb rule
Modelling and evaluation of optical WDM transport networks
Wauters, Nico
1997-10-01
In this PhD thesis optical WDM transport networks are investigated that use novel optical components to transmit simultaneously multiple datasignals using WDM and which route in their nodes incoming datasignals to one of the outlet fibers without converting these signals to the electrical domain. The goal of the thesis is twofold. On the one hand developing new models that lead to a classification of components, nodes, network architectures and network management techniques such as monitoring and signalling. On the other hand to investigate to which extent wavelength convertors are required for an optimal use of the available wavelength channels. At the same time the tuneability of the WDM terminal multiplexers is questioned. Part 1 gives a general introduction to optical transmission and network techniques by an extensive study of the literature and a limited market survey. In part 2 we propose a number of new models to represent WDM networks and their main building blocks. This leads to a black box model and a classification of all the OXC architectures. Secondly we extend the G.803 layer structure with new layers allowing the representation of hybrid WDM and SDH networks. Finally the model is used to classify different signalling and monitoring options that can be followed. In part 3 we investigate the requirement of wavelength convertors and the tuneability of the WDM terminal multiplexers. The main conclusion of this part is that wavelength translation is not a conditio sine qua non to achieve low blocking probabilities. This contrasts to the much larger difference that appeared between WPa and WPb and which allowed us to conclude that tuneability of the WDM terminal multiplexers is thoroughly required. We do not want to disregard other consequences of not using wavelength convertors in the network as e.g., simplified wavelength management in networks with wavelength convertors and the regeneration capabilities of new all- optical wavelength conversion devices.
Behavioral modeling approach for optical communication network design
Vuorinen, Kimmo; Jacquemod, Gilles; Gaffiot, Frederic; Seassal, Christian
1997-12-01
An optical communication networks can be divided in two levels: communication level, which defines the protocols, the control and the management of the networks and physical level formed by photonic and electronic components in order to transmit and receive the data between different nodes of the network. Traditionally, these two levels are considered separately in the optical communication network design process. This can lead to an erroneous or non-ideal networks implementation, due to the fact that the communication and physical levels are not independent. For example, in WDM communication network the maximum achievable data rate is limited not only by the networks protocol, but depends also on the implementation of the physical level: tuning delay of the optical multiplexers. Also the lack of the possibilities for co-verification of the communication and the physical levels together could lead to misinterpretations between the designers of the different levels and thus induce design faults. Since the prototyping is extremely expensive and time consuming, an integrated simulation of both communication and physical levels is necessary, at least in some extend. In this paper, a behavioral modeling approach that allows a co- simulation of the communication and the physical levels is presented. It is based on the use of a VHDL-AMS-like hardware description language, dedicated to electronic system modeling, but also suitable for modeling and simulation of non- electronic and mixed-domain systems. The behavioral models for photonic and electronic components, as well as the software are integrated in a unique simulator in order to co-simulate the communication (control) and the physical level (data path) of a WDM optical communication network.
Dependency structure matrix modelling for stakeholder value networks
Feng, Wen; Crawley, Edward F.; de Weck, Olivier L.; Keller, Rene; Robinson, Bob
2010-01-01
This paper develops a qualitative/quantitative network approach, namely a “Stakeholder Value Network”, to understand the impacts of both direct and indirect relationships between stakeholders on the success of large engineering projects. Specifically, this paper explores the feasibility and benefit of applying the Dependency Structure Matrix (DSM) as the modelling platform for Stakeholder Value Networks. Further, an efficient algorithm is designed for computing indirect stakeholder influence ...
The Italian Interbank Network: statistical properties and a simple model
De Masi, G.; Iori, G.; Caldarelli, G.
2007-06-01
We use the theory of complex networks in order to quantitatively characterize the structure of reciprocal expositions of Italian banks in the interbank money market market. We observe two main different strategies of banks: small banks tend to be the lender of the system, while large banks are borrowers. We propose a model to reproduce the main statistical features of this market. Moreover the network analysis allows us to investigate properties of robustness of this system.
Model-based clustering in networks with Stochastic Community Finding
McDaid, Aaron F.; Murphy, Brendan Thomas; Friel, Nial; Hurley, Neil J.
2012-01-01
In the model-based clustering of networks, blockmodelling may be used to identify roles in the network. We identify a special case of the Stochastic Block Model (SBM) where we constrain the cluster-cluster interactions such that the density inside the clusters of nodes is expected to be greater than the density between clusters. This corresponds to the intuition behind community-finding methods, where nodes tend to clustered together if they link to each other. We call this model Stochastic C...
Modelling of word usage frequency dynamics using artificial neural network
Maslennikova, Yu S.; Bochkarev, V. V.; Voloskov, D. S.
2014-03-01
In this paper the method for modelling of word usage frequency time series is proposed. An artificial feedforward neural network was used to predict word usage frequencies. The neural network was trained using the maximum likelihood criterion. The Google Books Ngram corpus was used for the analysis. This database provides a large amount of data on frequency of specific word forms for 7 languages. Statistical modelling of word usage frequency time series allows finding optimal fitting and filtering algorithm for subsequent lexicographic analysis and verification of frequency trend models.
A Random Dot Product Model for Weighted Networks
DeFord, Daryl R
2016-01-01
This paper presents a generalization of the random dot product model for networks whose edge weights are drawn from a parametrized probability distribution. We focus on the case of integer weight edges and show that many previously studied models can be recovered as special cases of this generalization. Our model also determines a dimension--reducing embedding process that gives geometric interpretations of community structure and centrality. The dimension of the embedding has consequences for the derived community structure and we exhibit a stress function for determining appropriate dimensions. We use this approach to analyze a coauthorship network and voting data from the U.S. Senate.
Insertion algorithms for network model database management systems
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.
Tamada, Yoshinori; Bannai, Hideo; Imoto, Seiya; Katayama, Toshiaki; Kanehisa, Minoru; Miyano, Satoru
2005-12-01
Since microarray gene expression data do not contain sufficient information for estimating accurate gene networks, other biological information has been considered to improve the estimated networks. Recent studies have revealed that highly conserved proteins that exhibit similar expression patterns in different organisms, have almost the same function in each organism. Such conserved proteins are also known to play similar roles in terms of the regulation of genes. Therefore, this evolutionary information can be used to refine regulatory relationships among genes, which are estimated from gene expression data. We propose a statistical method for estimating gene networks from gene expression data by utilizing evolutionarily conserved relationships between genes. Our method simultaneously estimates two gene networks of two distinct organisms, with a Bayesian network model utilizing the evolutionary information so that gene expression data of one organism helps to estimate the gene network of the other. We show the effectiveness of the method through the analysis on Saccharomyces cerevisiae and Homo sapiens cell cycle gene expression data. Our method was successful in estimating gene networks that capture many known relationships as well as several unknown relationships which are likely to be novel. Supplementary information is available at http://bonsai.ims.u-tokyo.ac.jp/~tamada/bayesnet/.
Prediction of Multiphase Flow Properties from Network Models ...
African Journals Online (AJOL)
The prediction of multiphase transport properties of reservoir rocks has been undertaken. This was done by numerical flow simulation of relative permeability and capillary pressure curves from pore network models extracted from Pore Architecture Models (PAMs). These PAMs are three-dimensional images obtained from ...
Systematic assignment of thermodynamic constraints in metabolic network models
Kümmel, Anne; Panke, Sven; Heinemann, Matthias
2006-01-01
Background: The availability of genome sequences for many organisms enabled the reconstruction of several genome-scale metabolic network models. Currently, significant efforts are put into the automated reconstruction of such models. For this, several computational tools have been developed that
Assessment of neural networks performance in modeling rainfall ...
African Journals Online (AJOL)
This paper presents the evaluation of performance of Neural Network (NN) model in predicting the behavioral pattern of rainfall depths of some locations in the North Central zones of Nigeria. The input to the model is the consecutive rainfall depths data obtained from the Nigerian Meteorological (NiMET) Agency. The neural ...
Data Driven Broiler Weight Forecasting using Dynamic Neural Network Models
DEFF Research Database (Denmark)
Johansen, Simon Vestergaard; Bendtsen, Jan Dimon; Riisgaard-Jensen, Martin
2017-01-01
In this article, the dynamic influence of environmental broiler house conditions and broiler growth is investigated. Dynamic neural network forecasting models have been trained on farm-scale broiler batch production data from 12 batches from the same house. The model forecasts future broiler weight...
An artificial neural network based fast radiative transfer model for ...
Indian Academy of Sciences (India)
the present study, a fast radiative transfer model using neural networks is proposed to simulate radiances corresponding to the wavenumbers of ... in construction, purpose and design and already in use are used. The fast RT model is able to ... porates measurements from various instruments in comparison with other ...
Complex networks and agent-based models of HIV epidemic
Zarrabi, N.
2013-01-01
In this thesis, we explore the limits of multi-scale models by looking into the HIV data present at different scales (from molecular and cellular to epidemiological scales). We build data-driven models and perform network analysis in order to understand the dynamics of HIV epidemic at different
Modelling Mobility in Mobile AD-HOC Network Environments ...
African Journals Online (AJOL)
We show how to implement the random waypoint mobility model for ad-hoc networks without pausing, through a more efficient and reliable computer simulation, using MATrix LABoratory 7.5.0 (R2007b). Simulation results obtained verify the correctness of the model. Keywords : Stationary, random waypoint, simulation, ...
Artificial Neural Networks for Modeling Knowing and Learning in Science.
Roth, Wolff-Michael
2000-01-01
Advocates artificial neural networks as models for cognition and development. Provides an example of how such models work in the context of a well-known Piagetian developmental task and school science activity: balance beam problems. (Contains 59 references.) (Author/WRM)
On infrastructure network design with agent-based modelling
Chappin, E.J.L.; Heijnen, P.W.
2014-01-01
We have developed an agent-based model to optimize green-field network design in an industrial area. We aim to capture some of the deep uncertainties surrounding infrastructure design by modelling it developing specific ant colony optimizations. Hence, we propose a variety of extensions to our
Model-order reduction of biochemical reaction networks
Rao, Shodhan; Schaft, Arjan van der; Eunen, Karen van; Bakker, Barbara M.; Jayawardhana, Bayu
2013-01-01
In this paper we propose a model-order reduction method for chemical reaction networks governed by general enzyme kinetics, including the mass-action and Michaelis-Menten kinetics. The model-order reduction method is based on the Kron reduction of the weighted Laplacian matrix which describes the
Role of neural network models for developing speech systems
Indian Academy of Sciences (India)
These prosody models are further examined for applications such as text to speech synthesis, speech recognition, speaker recognition and language identiﬁcation. Neural network models in voice conversion system are explored for capturing the mapping functions between source and target speakers at source, system and ...
Inferential ecosystem models, from network data to prediction
James S. Clark; Pankaj Agarwal; David M. Bell; Paul G. Flikkema; Alan Gelfand; Xuanlong Nguyen; Eric Ward; Jun. Yang
2011-01-01
Recent developments suggest that predictive modeling could begin to play a larger role not only for data analysis, but also for data collection. We address the example of efficient wireless sensor networks, where inferential ecosystem models can be used to weigh the value of an observation against the cost of data collection. Transmission costs make observations ââ...
A model for evolution of overlapping community networks
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.
3D data model of transportation network in city
Zuo, Xiao-qing; Li, Qing-quan; Yang, Bi-sheng
2005-10-01
Modern data-capture technology, especially digital photogrammetry technology, provides abundant data resources for digital city. Transportation network, forming framework of city, is an important component of city and a vital fundamental data of ITS and LBS (Location-based Services). Therefore, developing a data model is very valuable and significant which can describe 3D feature of city road network and support 3D navigation. Nowadays existing 3D GIS data models pay less attention to the support of transportation application, such as 3D vehicle navigation and traffic simulation, and previous GIS for transportation (GIS-T) data models failed to support 3D visualization. In view of it, we developed a 3D data model for transportation network that (1) supports of linear referencing system (LRS) and dynamic segmentation, (2) makes network topology build on the basis of 3D geometry network, and (3) realizes the transformation between linear coordinate and spatial coordinate. A performance study depicts that the proposed model can not only realize 3D visualization but also have transportation analysis (such 3D Vehicle navigation) more efficiently and conveniently.
de la Mata, Tamara; Llano, Carlos
2013-07-01
Recent literature on border effect has fostered research on informal barriers to trade and the role played by network dependencies. In relation to social networks, it has been shown that intensity of trade in goods is positively correlated with migration flows between pairs of countries/regions. In this article, we investigate whether such a relation also holds for interregional trade of services. We also consider whether interregional trade flows in services linked with tourism exhibit spatial and/or social network dependence. Conventional empirical gravity models assume the magnitude of bilateral flows between regions is independent of flows to/from regions located nearby in space, or flows to/from regions related through social/cultural/ethic network connections. With this aim, we provide estimates from a set of gravity models showing evidence of statistically significant spatial and network (demographic) dependence in the bilateral flows of the trade of services considered. The analysis has been applied to the Spanish intra- and interregional monetary flows of services from the accommodation, restaurants and travel agencies for the period 2000-2009, using alternative datasets for the migration stocks and definitions of network effects.
Business Model Exploration for Software Defined Networks
Xu, Yudi; Jansen, Slinger|info:eu-repo/dai/nl/270902902; España, Sergio|info:eu-repo/dai/nl/412500949; Zhang, Dong; Gao, Xuesong
2017-01-01
Business modeling is becoming a foundational process in the information technology industry. Many ICT companies are constructing their business models to stay competitive on the cutting edge of the technology world. However, when comes to new technologies or emerging markets, it remains difficult
Network Design Models for Container Shipping
DEFF Research Database (Denmark)
Reinhardt, Line Blander; Kallehauge, Brian; Nielsen, Anders Nørrelund
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...
Dynamic Bayesian Networks for Student Modeling
Kaser, Tanja; Klingler, Severin; Schwing, Alexander G.; Gross, Markus
2017-01-01
Intelligent tutoring systems adapt the curriculum to the needs of the individual student. Therefore, an accurate representation and prediction of student knowledge is essential. Bayesian Knowledge Tracing (BKT) is a popular approach for student modeling. The structure of BKT models, however, makes it impossible to represent the hierarchy and…
Queueing models for token and slotted ring networks. Thesis
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.
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.
Optimization model for the design of distributed wastewater treatment networks
Directory of Open Access Journals (Sweden)
Ibrić Nidret
2012-01-01
Full Text Available In this paper we address the synthesis problem of distributed wastewater networks using mathematical programming approach based on the superstructure optimization. We present a generalized superstructure and optimization model for the design of the distributed wastewater treatment networks. The superstructure includes splitters, treatment units, mixers, with all feasible interconnections including water recirculation. Based on the superstructure the optimization model is presented. The optimization model is given as a nonlinear programming (NLP problem where the objective function can be defined to minimize the total amount of wastewater treated in treatment operations or to minimize the total treatment costs. The NLP model is extended to a mixed integer nonlinear programming (MINLP problem where binary variables are used for the selection of the wastewater treatment technologies. The bounds for all flowrates and concentrations in the wastewater network are specified as general equations. The proposed models are solved using the global optimization solvers (BARON and LINDOGlobal. The application of the proposed models is illustrated on the two wastewater network problems of different complexity. First one is formulated as the NLP and the second one as the MINLP. For the second one the parametric and structural optimization is performed at the same time where optimal flowrates, concentrations as well as optimal technologies for the wastewater treatment are selected. Using the proposed model both problems are solved to global optimality.
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.
A Dynamic Evolutionary Game Model of Modular Production Network
Directory of Open Access Journals (Sweden)
Wei He
2016-01-01
Full Text Available As a new organization mode of production in the 21st century, modular production network is deemed extensively to be a source of competitiveness for lead firms in manufacturing industries. However, despite the abundant studies on the modular production network, there are very few studies from a dynamic perspective to discuss the conditions on which a modular production network develops. Based on the dynamic evolutionary game theory, this paper constructs a model, which incorporates several main factors influencing the development of modular production network. By calculating the replicator dynamics equations and analyzing the evolutionary stable strategies, this paper discusses the evolution process of cooperation strategies of member enterprises in a modular production network. Furthermore, by using NetLogo software to simulate the model, this paper verifies the effectiveness of the model. From the model, we can find that the final stable equilibrium strategy is related to such factors as the initial cost, the extra payoff, the cooperation willingness of both parties, the cooperation efforts, and the proportion each party can get from the extra payoff. To encourage the cooperation of production integrator and modular supplier, some suggestions are also provided.
An information search model for online social Networks - MOBIRSE
Directory of Open Access Journals (Sweden)
J. A. Astaiza
2015-12-01
Full Text Available Online Social Networks (OSNs have been gaining great importance among Internet users in recent years. These are sites where it is possible to meet people, publish, and share content in a way that is both easy and free of charge. As a result, the volume of information contained in these websites has grown exponentially, and web search has consequently become an important tool for users to easily find information relevant to their social networking objectives. Making use of ontologies and user profiles can make these searches more effective. This article presents a model for Information Retrieval in OSNs (MOBIRSE based on user profile and ontologies which aims to improve the relevance of retrieved information on these websites. The social network Facebook was chosen for a case study and as the instance for the proposed model. The model was validated using measures such as At-k Precision and Kappa statistics, to assess its efficiency.
A Neuron Model for FPGA Spiking Neuronal Network Implementation
Directory of Open Access Journals (Sweden)
BONTEANU, G.
2011-11-01
Full Text Available We propose a neuron model, able to reproduce the basic elements of the neuronal dynamics, optimized for digital implementation of Spiking Neural Networks. Its architecture is structured in two major blocks, a datapath and a control unit. The datapath consists of a membrane potential circuit, which emulates the neuronal dynamics at the soma level, and a synaptic circuit used to update the synaptic weight according to the spike timing dependent plasticity (STDP mechanism. The proposed model is implemented into a Cyclone II-Altera FPGA device. Our results indicate the neuron model can be used to build up 1K Spiking Neural Networks on reconfigurable logic suport, to explore various network topologies.
Modeling human dynamics of face-to-face interaction networks
Starnini, Michele; Pastor-Satorras, Romualdo
2013-01-01
Face-to-face interaction networks describe social interactions in human gatherings, and are the substrate for processes such as epidemic spreading and gossip propagation. The bursty nature of human behavior characterizes many aspects of empirical data, such as the distribution of conversation lengths, of conversations per person, or of inter-conversation times. Despite several recent attempts, a general theoretical understanding of the global picture emerging from data is still lacking. Here we present a simple model that reproduces quantitatively most of the relevant features of empirical face-to-face interaction networks. The model describes agents which perform a random walk in a two dimensional space and are characterized by an attractiveness whose effect is to slow down the motion of people around them. The proposed framework sheds light on the dynamics of human interactions and can improve the modeling of dynamical processes taking place on the ensuing dynamical social networks.
Automated Modeling of Microwave Structures by Enhanced Neural Networks
Directory of Open Access Journals (Sweden)
Z. Raida
2006-12-01
Full Text Available The paper describes the methodology of the automated creation of neural models of microwave structures. During the creation process, artificial neural networks are trained using the combination of the particle swarm optimization and the quasi-Newton method to avoid critical training problems of the conventional neural nets. In the paper, neural networks are used to approximate the behavior of a planar microwave filter (moment method, Zeland IE3D. In order to evaluate the efficiency of neural modeling, global optimizations are performed using numerical models and neural ones. Both approaches are compared from the viewpoint of CPU-time demands and the accuracy. Considering conclusions, methodological recommendations for including neural networks to the microwave design are formulated.
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
Network Models for Cognitive Development and Intelligence
National Research Council Canada - National Science Library
van der Maas, H.L.J; Kan, K.J; Marsman, M; Stevenson, C.E
2017-01-01
... (dimensionality of individual differences). The welcome integration of the two fields requires the construction of mechanistic models of cognition and cognitive development that explain key phenomena in individual differences research...
A source-controlled data center network model.
Directory of Open Access Journals (Sweden)
Yang Yu
Full Text Available 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.
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
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
Logical Modeling and Dynamical Analysis of Cellular Networks.
Abou-Jaoudé, Wassim; Traynard, Pauline; Monteiro, Pedro T; Saez-Rodriguez, Julio; Helikar, Tomáš; Thieffry, Denis; Chaouiya, Claudine
2016-01-01
The logical (or logic) formalism is increasingly used to model regulatory and signaling networks. Complementing these applications, several groups contributed various methods and tools to support the definition and analysis of logical models. After an introduction to the logical modeling framework and to several of its variants, we review here a number of recent methodological advances to ease the analysis of large and intricate networks. In particular, we survey approaches to determine model attractors and their reachability properties, to assess the dynamical impact of variations of external signals, and to consistently reduce large models. To illustrate these developments, we further consider several published logical models for two important biological processes, namely the differentiation of T helper cells and the control of mammalian cell cycle.
Biological networks 101: computational modeling for molecular biologists.
Scholma, Jetse; Schivo, Stefano; Urquidi Camacho, Ricardo A; van de Pol, Jaco; Karperien, Marcel; Post, Janine N
2014-01-01
Computational modeling of biological networks permits the comprehensive analysis of cells and tissues to define molecular phenotypes and novel hypotheses. Although a large number of software tools have been developed, the versatility of these tools is limited by mathematical complexities that prevent their broad adoption and effective use by molecular biologists. This study clarifies the basic aspects of molecular modeling, how to convert data into useful input, as well as the number of time points and molecular parameters that should be considered for molecular regulatory models with both explanatory and predictive potential. We illustrate the necessary experimental preconditions for converting data into a computational model of network dynamics. This model requires neither a thorough background in mathematics nor precise data on intracellular concentrations, binding affinities or reaction kinetics. Finally, we show how an interactive model of crosstalk between signal transduction pathways in primary human articular chondrocytes allows insight into processes that regulate gene expression. © 2013 Elsevier B.V. All rights reserved.
A bridge role metric model for nodes in software networks.
Directory of Open Access Journals (Sweden)
Bo Li
Full Text Available A bridge role metric model is put forward in this paper. Compared with previous metric models, our solution of a large-scale object-oriented software system as a complex network is inherently more realistic. To acquire nodes and links in an undirected network, a new model that presents the crucial connectivity of a module or the hub instead of only centrality as in previous metric models is presented. Two previous metric models are described for comparison. In addition, it is obvious that the fitting curve between the Bre results and degrees can well be fitted by a power law. The model represents many realistic characteristics of actual software structures, and a hydropower simulation system is taken as an example. This paper makes additional contributions to an accurate understanding of module design of software systems and is expected to be beneficial to software engineering practices.
Network modeling links breast cancer susceptibility and centrosome dysfunction.
Pujana, Miguel Angel; Han, Jing-Dong J; Starita, Lea M; Stevens, Kristen N; Tewari, Muneesh; Ahn, Jin Sook; Rennert, Gad; Moreno, Víctor; Kirchhoff, Tomas; Gold, Bert; Assmann, Volker; Elshamy, Wael M; Rual, Jean-François; Levine, Douglas; Rozek, Laura S; Gelman, Rebecca S; Gunsalus, Kristin C; Greenberg, Roger A; Sobhian, Bijan; Bertin, Nicolas; Venkatesan, Kavitha; Ayivi-Guedehoussou, Nono; Solé, Xavier; Hernández, Pilar; Lázaro, Conxi; Nathanson, Katherine L; Weber, Barbara L; Cusick, Michael E; Hill, David E; Offit, Kenneth; Livingston, David M; Gruber, Stephen B; Parvin, Jeffrey D; Vidal, Marc
2007-11-01
Many cancer-associated genes remain to be identified to clarify the underlying molecular mechanisms of cancer susceptibility and progression. Better understanding is also required of how mutations in cancer genes affect their products in the context of complex cellular networks. Here we have used a network modeling strategy to identify genes potentially associated with higher risk of breast cancer. Starting with four known genes encoding tumor suppressors of breast cancer, we combined gene expression profiling with functional genomic and proteomic (or 'omic') data from various species to generate a network containing 118 genes linked by 866 potential functional associations. This network shows higher connectivity than expected by chance, suggesting that its components function in biologically related pathways. One of the components of the network is HMMR, encoding a centrosome subunit, for which we demonstrate previously unknown functional associations with the breast cancer-associated gene BRCA1. Two case-control studies of incident breast cancer indicate that the HMMR locus is associated with higher risk of breast cancer in humans. Our network modeling strategy should be useful for the discovery of additional cancer-associated genes.
Distinct Tensile Response of Model Semi-flexible Elastomer Networks
Aguilera-Mercado, Bernardo M.; Cohen, Claude; Escobedo, Fernando A.
2011-03-01
Through coarse-grained molecular modeling, we study how the elastic response strongly depends upon nanostructural heterogeneities in model networks made of semi-flexible chains exhibiting both regular and realistic connectivity. Idealized regular polymer networks have been shown to display a peculiar elastic response similar to that of super-tough natural materials (e.g., organic adhesives inside abalone shells). We investigate the impact of chain stiffness, and the effect of including tri-block copolymer chains, on the network's topology and elastic response. We find in some systems a dual tensile response: a liquid-like behavior at small deformations, and a distinct saw-tooth shaped stress-strain curve at moderate to large deformations. Additionally, stiffer regular networks exhibit a marked hysteresis over loading-unloading cycles that can be deleted by heating-cooling cycles or by performing deformations along different axes. Furthermore, small variations of chain stiffness may entirely change the nature of the network's tensile response from an entropic to an enthalpic elastic regime, and micro-phase separation of different blocks within elastomer networks may significantly enhance their mechanical strength. This work was supported by the American Chemical Society.
Modeling Broadband Microwave Structures by Artificial Neural Networks
Directory of Open Access Journals (Sweden)
V. Otevrel
2004-06-01
Full Text Available The paper describes the exploitation of feed-forward neural networksand recurrent neural networks for replacing full-wave numerical modelsof microwave structures in complex microwave design tools. Building aneural model, attention is turned to the modeling accuracy and to theefficiency of building a model. Dealing with the accuracy, we describea method of increasing it by successive completing a training set.Neural models are mutually compared in order to highlight theiradvantages and disadvantages. As a reference model for comparisons,approximations based on standard cubic splines are used. Neural modelsare used to replace both the time-domain numeric models and thefrequency-domain ones.
Modeling structure and resilience of the dark network.
De Domenico, Manlio; Arenas, Alex
2017-02-01
While the statistical and resilience properties of the Internet are no longer changing significantly across time, the Darknet, a network devoted to keep anonymous its traffic, still experiences rapid changes to improve the security of its users. Here we study the structure of the Darknet and find that its topology is rather peculiar, being characterized by a nonhomogeneous distribution of connections, typical of scale-free networks; very short path lengths and high clustering, typical of small-world networks; and lack of a core of highly connected nodes. We propose a model to reproduce such features, demonstrating that the mechanisms used to improve cybersecurity are responsible for the observed topology. Unexpectedly, we reveal that its peculiar structure makes the Darknet much more resilient than the Internet (used as a benchmark for comparison at a descriptive level) to random failures, targeted attacks, and cascade failures, as a result of adaptive changes in response to the attempts of dismantling the network across time.
Modeling structure and resilience of the dark network
De Domenico, Manlio; Arenas, Alex
2017-02-01
While the statistical and resilience properties of the Internet are no longer changing significantly across time, the Darknet, a network devoted to keep anonymous its traffic, still experiences rapid changes to improve the security of its users. Here we study the structure of the Darknet and find that its topology is rather peculiar, being characterized by a nonhomogeneous distribution of connections, typical of scale-free networks; very short path lengths and high clustering, typical of small-world networks; and lack of a core of highly connected nodes. We propose a model to reproduce such features, demonstrating that the mechanisms used to improve cybersecurity are responsible for the observed topology. Unexpectedly, we reveal that its peculiar structure makes the Darknet much more resilient than the Internet (used as a benchmark for comparison at a descriptive level) to random failures, targeted attacks, and cascade failures, as a result of adaptive changes in response to the attempts of dismantling the network across time.
Modelling opinion formation driven communities in social networks
Iñiguez, Gerardo; Kertész, János; Kaski, Kimmo K
2010-01-01
In a previous paper we proposed a model to study the dynamics of opinion formation in human societies by a co-evolution process involving two distinct time scales of fast transaction and slower network evolution dynamics. In the transaction dynamics we take into account short range interactions as discussions between individuals and long range interactions to describe the attitude to the overall mood of society. The latter is handled by a uniformly distributed parameter $\\alpha$, assigned randomly to each individual, as quenched personal bias. The network evolution dynamics is realized by rewiring the societal network due to state variable changes as a result of transaction dynamics. The main consequence of this complex dynamics is that communities emerge in the social network for a range of values in the ratio between time scales. In this paper we focus our attention on the attitude parameter $\\alpha$ and its influence on the conformation of opinion and the size of the resulting communities. We present numer...
CIME course on Modelling and Optimisation of Flows on Networks
Ambrosio, Luigi; Helbing, Dirk; Klar, Axel; Zuazua, Enrique
2013-01-01
In recent years flows in networks have attracted the interest of many researchers from different areas, e.g. applied mathematicians, engineers, physicists, economists. The main reason for this ubiquity is the wide and diverse range of applications, such as vehicular traffic, supply chains, blood flow, irrigation channels, data networks and others. This book presents an extensive set of notes by world leaders on the main mathematical techniques used to address such problems, together with investigations into specific applications. The main focus is on partial differential equations in networks, but ordinary differential equations and optimal transport are also included. Moreover, the modeling is completed by analysis, numerics, control and optimization of flows in networks. The book will be a valuable resource for every researcher or student interested in the subject.
Energy model for rumor propagation on social networks
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.
Studies on the population dynamics of a rumor-spreading model in online social networks
Dong, Suyalatu; Fan, Feng-Hua; Huang, Yong-Chang
2018-02-01
This paper sets up a rumor spreading model in online social networks based on the European fox rabies SIR model. The model considers the impact of changing number of online social network users, combines the transmission dynamics to set up a population dynamics of rumor spreading model in online social networks. Simulation is carried out on online social network, and results show that the new rumor spreading model is in accordance with the real propagation characteristics in online social networks.
Tools and Models for Integrating Multiple Cellular Networks
Energy Technology Data Exchange (ETDEWEB)
Gerstein, Mark [Yale Univ., New Haven, CT (United States). Gerstein Lab.
2015-11-06
CRIT for correlation analysis in systems biology [5]. For Aim 3, we have further investigated the scaling relationship that the number of Transcription Factors (TFs) in a genome is proportional to the square of the total number of genes. We have extended the analysis from transcription factors to various classes of functional categories, and from individual categories to joint distribution [6]. By introducing a new analytical framework, we have generalized the original toolbox model to take into account of metabolic network with arbitrary network topology [7].
Aplication of artificial neural network model in aviation specialist training
Directory of Open Access Journals (Sweden)
Висиль Миколайович Казак
2016-02-01
Full Text Available This paper reviews the application of artificial neural network (ANN model in aviation specialist training. The ANN model is based on the dependence of residual knowledge of subjects of study on their individual abilities. The residual knowledge is the skills acquired by the subject before he is going for an occupation. The presented ANN model gives the possibility to predict the level of professional training of the specialists with high accuracy
Models and algorithms for biomolecules and molecular networks
DasGupta, Bhaskar
2016-01-01
By providing expositions to modeling principles, theories, computational solutions, and open problems, this reference presents a full scope on relevant biological phenomena, modeling frameworks, technical challenges, and algorithms. * Up-to-date developments of structures of biomolecules, systems biology, advanced models, and algorithms * Sampling techniques for estimating evolutionary rates and generating molecular structures * Accurate computation of probability landscape of stochastic networks, solving discrete chemical master equations * End-of-chapter exercises
AN AUTOMATED 3D INDOOR TOPOLOGICAL NAVIGATION NETWORK MODELLING
JAMALI, A.; Rahman, A.A.; Boguslawski, P.; Gold, C. M.
2015-01-01
Indoor navigation is important for various applications such as disaster management and safety analysis. In the last decade, indoor environment has been a focus of wide research; that includes developing techniques for acquiring indoor data (e.g. Terrestrial laser scanning), 3D indoor modelling and 3D indoor navigation models. In this paper, an automated 3D topological indoor network generated from inaccurate 3D building models is proposed. In a normal scenario, 3D indoor navigation ...
Open innovation, networking, and business model dynamics: The two sides
Gay, Brigitte
2014-01-01
A business model describes the design of the value creation and capture mechanisms needed to yield profit. We contend that for a business model to be viable in turbulent and hypercompetitive environments, its dynamics are important and must leverage, out of all key business model modules proposed in different studies, on a combined value and network perspective. These different elements present, however, distinctive challenges for small innovative companies and larger firms. Moreover, the bus...
Analysis and Simulation of Hybrid Models for Reaction Networks
Kreim, Michael
2014-01-01
The dynamics of biochemical reaction networks can be described by a variety of models, like the Reaction Rate equation (RRE), the Chemical Master equation (CME) or the Fokker-Planck equation (FPE). In this thesis, the behaviour of these different models is analysed. It is shown that the FPE can be motivated as an approximation of the CME and convergence is proven. Furthermore, two hybrid models are constructed by combining different approaches and convergence properties are proven and discussed.
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
Explicit examples of DIM constraints for network matrix models
Energy Technology Data Exchange (ETDEWEB)
Awata, Hidetoshi [Graduate School of Mathematics, Nagoya University,Nagoya, 464-8602 (Japan); Kanno, Hiroaki [Graduate School of Mathematics, Nagoya University,Nagoya, 464-8602 (Japan); KMI, Nagoya University,Nagoya, 464-8602 (Japan); Matsumoto, Takuya [Graduate School of Mathematics, Nagoya University,Nagoya, 464-8602 (Japan); Mironov, Andrei [Theory Department, Lebedev Physics Institute,Leninsky pr., 53, Moscow 119991 (Russian Federation); ITEP,Bol.Cheremushkinskaya, 25, Moscow 117218 (Russian Federation); Institute for Information Transmission Problems,Bol.Karetny, 19 (1), Moscow 127994 (Russian Federation); National Research Nuclear University MEPhI,Kashirskoe sh., 31, Moscow 115409 (Russian Federation); Morozov, Alexei [ITEP,Bol.Cheremushkinskaya, 25, Moscow 117218 (Russian Federation); Institute for Information Transmission Problems,Bol.Karetny, 19 (1), Moscow 127994 (Russian Federation); National Research Nuclear University MEPhI,Kashirskoe sh., 31, Moscow 115409 (Russian Federation); Morozov, Andrey [Institute for Information Transmission Problems,Bol.Karetny, 19 (1), Moscow 127994 (Russian Federation); National Research Nuclear University MEPhI,Kashirskoe sh., 31, Moscow 115409 (Russian Federation); Laboratory of Quantum Topology, Chelyabinsk State University,Bratiev Kashirinyh, 129, Chelyabinsk 454001 (Russian Federation); Ohkubo, Yusuke [Graduate School of Mathematics, Nagoya University,Nagoya, 464-8602 (Japan); Zenkevich, Yegor [ITEP,Bol.Cheremushkinskaya, 25, Moscow 117218 (Russian Federation); Institute for Nuclear Research,60-letiya Oktyabrya pr., 7a, Moscow 117312 (Russian Federation); National Research Nuclear University MEPhI,Kashirskoe sh., 31, Moscow 115409 (Russian Federation)
2016-07-20
Dotsenko-Fateev and Chern-Simons matrix models, which describe Nekrasov functions for SYM theories in different dimensions, are all incorporated into network matrix models with the hidden Ding-Iohara-Miki (DIM) symmetry. This lifting is especially simple for what we call balanced networks. Then, the Ward identities (known under the names of Virasoro/W-constraints or loop equations or regularity condition for qq-characters) are also promoted to the DIM level, where they all become corollaries of a single identity.
Modeling the Chinese language as an evolving network
Liang, Wei; Shi, Yuming; Huang, Qiuling
2014-01-01
The evolution of Chinese language has three main features: the total number of characters is gradually increasing, new words are generated in the existing characters, and some old words are no longer used in daily-life language. Based on the features, we propose an evolving language network model. Finally, we use this model to simulate the character co-occurrence networks (nodes are characters, and two characters are connected by an edge if they are adjacent to each other) constructed from essays in 11 different periods of China, and find that characters that appear with high frequency in old words are likely to be reused when new words are formed.
A Formal Model and Verification Problems for Software Defined Networks
Directory of Open Access Journals (Sweden)
V. A. Zakharov
2013-01-01
Full Text Available Software-defined networking (SDN is an approach to building computer networks that separate and abstract data planes and control planes of these systems. In a SDN a centralized controller manages a distributed set of switches. A set of open commands for packet forwarding and flow-table updating was defined in the form of a protocol known as OpenFlow. In this paper we describe an abstract formal model of SDN, introduce a tentative language for specification of SDN forwarding policies, and set up formally model-checking problems for SDN.
Neural Networks for Modeling and Control of Particle Accelerators
Edelen, A. L.; Biedron, S. G.; Chase, B. E.; Edstrom, D.; Milton, S. V.; Stabile, P.
2016-04-01
Particle accelerators are host to myriad nonlinear and complex physical phenomena. They often involve a multitude of interacting systems, are subject to tight performance demands, and should be able to run for extended periods of time with minimal interruptions. Often times, traditional control techniques cannot fully meet these requirements. One promising avenue is to introduce machine learning and sophisticated control techniques inspired by artificial intelligence, particularly in light of recent theoretical and practical advances in these fields. Within machine learning and artificial intelligence, neural networks are particularly well-suited to modeling, control, and diagnostic analysis of complex, nonlinear, and time-varying systems, as well as systems with large parameter spaces. Consequently, the use of neural network-based modeling and control techniques could be of significant benefit to particle accelerators. For the same reasons, particle accelerators are also ideal test-beds for these techniques. Many early attempts to apply neural networks to particle accelerators yielded mixed results due to the relative immaturity of the technology for such tasks. The purpose of this paper is to re-introduce neural networks to the particle accelerator community and report on some work in neural network control that is being conducted as part of a dedicated collaboration between Fermilab and Colorado State University (CSU). We describe some of the challenges of particle accelerator control, highlight recent advances in neural network techniques, discuss some promising avenues for incorporating neural networks into particle accelerator control systems, and describe a neural network-based control system that is being developed for resonance control of an RF electron gun at the Fermilab Accelerator Science and Technology (FAST) facility, including initial experimental results from a benchmark controller.
The Healthy Aging Research Network: Modeling Collaboration for Community Impact.
Belza, Basia; Altpeter, Mary; Smith, Matthew Lee; Ory, Marcia G
2017-03-01
As the first Centers for Disease Control and Prevention (CDC) Prevention Research Centers Program thematic network, the Healthy Aging Research Network was established to better understand the determinants of healthy aging within older adult populations, identify interventions that promote healthy aging, and assist in translating research into sustainable community-based programs throughout the nation. To achieve these goals requires concerted efforts of a collaborative network of academic, community, and public health organizational partnerships. For the 2001-2014 Prevention Research Center funding cycles, the Healthy Aging Research Network conducted prevention research and promoted the wide use of practices known to foster optimal health. Organized around components necessary for successful collaborations (i.e., governance and infrastructure, shaping focus, community involvement, and evaluation and improvement), this commentary highlights exemplars that demonstrate the Healthy Aging Research Network's unique contributions to the field. The Healthy Aging Research Network's collaboration provided a means to collectively build capacity for practice and policy, reduce fragmentation and duplication in health promotion and aging research efforts, maximize the efficient use of existing resources and generate additional resources, and ultimately, create synergies for advancing the healthy aging agenda. This collaborative model was built upon a backbone organization (coordinating center); setting of common agendas and mutually reinforcing activities; and continuous communications. Given its successes, the Healthy Aging Research Network model could be used to create new and evaluate existing thematic networks to guide the translation of research into policy and practice. Copyright © 2016 American Journal of Preventive Medicine. Published by Elsevier Inc. All rights reserved.
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.
Game-Theoretic Models of Information Overload in Social Networks
Borgs, Christian; Chayes, Jennifer; Karrer, Brian; Meeder, Brendan; Ravi, R.; Reagans, Ray; Sayedi, Amin
We study the effect of information overload on user engagement in an asymmetric social network like Twitter. We introduce simple game-theoretic models that capture rate competition between celebrities producing updates in such networks where users non-strategically choose a subset of celebrities to follow based on the utility derived from high quality updates as well as disutility derived from having to wade through too many updates. Our two variants model the two behaviors of users dropping some potential connections (followership model) or leaving the network altogether (engagement model). We show that under a simple formulation of celebrity rate competition, there is no pure strategy Nash equilibrium under the first model. We then identify special cases in both models when pure rate equilibria exist for the celebrities: For the followership model, we show existence of a pure rate equilibrium when there is a global ranking of the celebrities in terms of the quality of their updates to users. This result also generalizes to the case when there is a partial order consistent with all the linear orders of the celebrities based on their qualities to the users. Furthermore, these equilibria can be computed in polynomial time. For the engagement model, pure rate equilibria exist when all users are interested in the same number of celebrities, or when they are interested in at most two. Finally, we also give a finite though inefficient procedure to determine if pure equilibria exist in the general case of the followership model.
Non-consensus opinion models on complex networks
Li, Qian; Wang, Huijuan; Shao, Jia; Stanldy, H Eugene; Havline, Shlomo
2012-01-01
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. We generalize the NCO model by adding a weight factor W to individual's own opinion when determining its future opinion (NCOW model). We find that as W increases the minority opinion holders tend to form stable clusters with a smaller initial minority fraction compared to the NCO model. We also revisit another non-consensus opinion, the inflexible contrarian opinion (ICO) model, which introduces inflexible contrarians to model a competition between two opinions in the steady state. In the ICO model, the inflexible contrarians effectively decrease the size of the largest cluster of the rival opinion. All of the above models have previously been explored in terms of a single network. However opinions propagate not only within single networks but also between networks, we study here the opinion dynamics in couple...
An Alignment Model for Collaborative Value Networks
Bremer, Carlos; Azevedo, Rodrigo Cambiaghi; Klen, Alexandra Pereira
This paper presents parts of the work carried out in several global organizations through the development of strategic projects with high tactical and operational complexity. By investing in long-term relationships, strongly operating in the transformation of the competitive model and focusing on the value chain management, the main aim of these projects was the alignment of multiple value chains. The projects were led by the Axia Transformation Methodology as well as by its Management Model and following the principles of Project Management. As a concrete result of the efforts made in the last years in the Brazilian market this work also introduces the Alignment Model which supports the transformation process that the companies undergo.
Broadband model of the distribution network
DEFF Research Database (Denmark)
Jensen, Martin Høgdahl
of this component, and it is chosen to focus on the development of such a model. Based on the electromagnetic field equations, the shunt admittance and series impedance parameters of the four-wire cable are derived. The influence of the conductance is considered negligible and is not included in the shunt...... admittance. Two expressions are derived for the capacitance to ground, one of which is based on the cable forming a plate capacitor to ground, the other is based on the cable and ground forming a coaxial cable. For the modelling of the series impedance, specific attention is given to include the influence...... of non-ideal ground, skin effect and proximity effect. Non ideal ground is modelled on the basis of Carson expressions for overhead lines. A new method is developed for the calculation of skin effect based on the depth of penetration. The result of this method is compared with the general expressions...
Energy Technology Data Exchange (ETDEWEB)
Hwangbo, Soonho; Lee, In-Beum [POSTECH, Pohang (Korea, Republic of); Han, Jeehoon [University of Wisconsin-Madison, Madison (United States)
2014-10-15
Lots of networks are constructed in a large scale industrial complex. Each network meet their demands through production or transportation of materials which are needed to companies in a network. Network directly produces materials for satisfying demands in a company or purchase form outside due to demand uncertainty, financial factor, and so on. Especially utility network and hydrogen network are typical and major networks in a large scale industrial complex. Many studies have been done mainly with focusing on minimizing the total cost or optimizing the network structure. But, few research tries to make an integrated network model by connecting utility network and hydrogen network. In this study, deterministic mixed integer linear programming model is developed for integrating utility network and hydrogen network. Steam Methane Reforming process is necessary for combining two networks. After producing hydrogen from Steam-Methane Reforming process whose raw material is steam vents from utility network, produced hydrogen go into hydrogen network and fulfill own needs. Proposed model can suggest optimized case in integrated network model, optimized blueprint, and calculate optimal total cost. The capability of the proposed model is tested by applying it to Yeosu industrial complex in Korea. Yeosu industrial complex has the one of the biggest petrochemical complex and various papers are based in data of Yeosu industrial complex. From a case study, the integrated network model suggests more optimal conclusions compared with previous results obtained by individually researching utility network and hydrogen network.
Discrete Network Modeling for Field-Scale Flow and Transport Through Porous Media
National Research Council Canada - National Science Library
Howington, Stacy
1997-01-01
.... Specifically, a stochastic, high-resolution, discrete network model is developed and explored for simulating macroscopic flow and conservative transport through macroscopic porous media Networks...
Computational social network modeling of terrorist recruitment.
Energy Technology Data Exchange (ETDEWEB)
Berry, Nina M.; Turnley, Jessica Glicken (Sandia National Laboratories, Albuquerque, NM); Smrcka, Julianne D. (Sandia National Laboratories, Albuquerque, NM); Ko, Teresa H.; Moy, Timothy David (Sandia National Laboratories, Albuquerque, NM); Wu, Benjamin C.
2004-10-01
The Seldon terrorist model represents a multi-disciplinary approach to developing organization software for the study of terrorist recruitment and group formation. The need to incorporate aspects of social science added a significant contribution to the vision of the resulting Seldon toolkit. The unique addition of and abstract agent category provided a means for capturing social concepts like cliques, mosque, etc. in a manner that represents their social conceptualization and not simply as a physical or economical institution. This paper provides an overview of the Seldon terrorist model developed to study the formation of cliques, which are used as the major recruitment entity for terrorist organizations.
A Brownian model for multiclass queueing networks with finite buffers
Dai, Wanyang
2002-07-01
This paper is concerned with the heavy traffic behavior of a type of multiclass queueing networks with finite buffers. The network consists of d single server stations and is populated by K classes of customers. Each station has a finite capacity waiting buffer and operates under first-in first-out (FIFO) service discipline. The network is assumed to have a feedforward routing structure under a blocking scheme. A server stops working when the downstream buffer is full. The focus of this paper is on the Brownian model formulation. More specifically, the approximating Brownian model for the networks is proposed via the method of showing a pseudo-heavy-traffic limit theorem which states that the limit process is a reflecting Brownian motion (RBM) if the properly normalized d-dimensional workload process converges in distribution to a continuous process. Numerical algorithm with finite element method has been designed to effectively compute the solution of the Brownian model (W. Dai, Ph.D. thesis (1996); X. Shen et al. The finite element method for computing the stationary distribution of an SRBM in a hypercube with applications to finite buffer queueing networks, under revision for Queueing Systems).
Vortex network community based reduced-order force model
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).
Degeneracy estimation in interference models on wireless networks
McBride, Neal; Bulava, John; Galiotto, Carlo; Marchetti, Nicola; Macaluso, Irene; Doyle, Linda
2017-03-01
We present a Monte Carlo study of interference in real-world wireless networks using the Potts model. Our approach maps the Potts energy to discrete interference levels. These levels depend on the configurations of radio frequency allocation in the network. For the first time, we estimate the degeneracy of these interference levels using the Wang-Landau algorithm. The cumulative distribution function of the resulting density of states is found to increase rapidly at a critical interference value. We compare these critical values for several different real-world interference networks and Potts models. Our results show that models with a greater number of available frequency channels and less dense interference networks result in the majority of configurations having lower interference levels. Consequently, their critical interference levels occur at lower values. Furthermore, the area under the density of states increases and shifts to lower interference values. Therefore, the probability of randomly sampling low interference configurations is higher under these conditions. This result can be used to consider dynamic and distributed spectrum allocation in future wireless networks.
Ising models of strongly coupled biological networks with multivariate interactions
Merchan, Lina; Nemenman, Ilya
2013-03-01
Biological networks consist of a large number of variables that can be coupled by complex multivariate interactions. However, several neuroscience and cell biology experiments have reported that observed statistics of network states can be approximated surprisingly well by maximum entropy models that constrain correlations only within pairs of variables. We would like to verify if this reduction in complexity results from intricacies of biological organization, or if it is a more general attribute of these networks. We generate random networks with p-spin (p > 2) interactions, with N spins and M interaction terms. The probability distribution of the network states is then calculated and approximated with a maximum entropy model based on constraining pairwise spin correlations. Depending on the M/N ratio and the strength of the interaction terms, we observe a transition where the pairwise approximation is very good to a region where it fails. This resembles the sat-unsat transition in constraint satisfaction problems. We argue that the pairwise model works when the number of highly probable states is small. We argue that many biological systems must operate in a strongly constrained regime, and hence we expect the pairwise approximation to be accurate for a wide class of problems. This research has been partially supported by the James S McDonnell Foundation grant No.220020321.