Set-base dynamical parameter estimation and model invalidation for biochemical reaction networks.

Science.gov (United States)

Rumschinski, Philipp; Borchers, Steffen; Bosio, Sandro; Weismantel, Robert; Findeisen, Rolf

2010-05-25

Mathematical modeling and analysis have become, for the study of biological and cellular processes, an important complement to experimental research. However, the structural and quantitative knowledge available for such processes is frequently limited, and measurements are often subject to inherent and possibly large uncertainties. This results in competing model hypotheses, whose kinetic parameters may not be experimentally determinable. Discriminating among these alternatives and estimating their kinetic parameters is crucial to improve the understanding of the considered process, and to benefit from the analytical tools at hand. In this work we present a set-based framework that allows to discriminate between competing model hypotheses and to provide guaranteed outer estimates on the model parameters that are consistent with the (possibly sparse and uncertain) experimental measurements. This is obtained by means of exact proofs of model invalidity that exploit the polynomial/rational structure of biochemical reaction networks, and by making use of an efficient strategy to balance solution accuracy and computational effort. The practicability of our approach is illustrated with two case studies. The first study shows that our approach allows to conclusively rule out wrong model hypotheses. The second study focuses on parameter estimation, and shows that the proposed method allows to evaluate the global influence of measurement sparsity, uncertainty, and prior knowledge on the parameter estimates. This can help in designing further experiments leading to improved parameter estimates.

Least-squares methods for identifying biochemical regulatory networks from noisy measurements

Directory of Open Access Journals (Sweden)

Heslop-Harrison Pat

2007-01-01

Full Text Available Abstract Background We consider the problem of identifying the dynamic interactions in biochemical networks from noisy experimental data. Typically, approaches for solving this problem make use of an estimation algorithm such as the well-known linear Least-Squares (LS estimation technique. We demonstrate that when time-series measurements are corrupted by white noise and/or drift noise, more accurate and reliable identification of network interactions can be achieved by employing an estimation algorithm known as Constrained Total Least Squares (CTLS. The Total Least Squares (TLS technique is a generalised least squares method to solve an overdetermined set of equations whose coefficients are noisy. The CTLS is a natural extension of TLS to the case where the noise components of the coefficients are correlated, as is usually the case with time-series measurements of concentrations and expression profiles in gene networks. Results The superior performance of the CTLS method in identifying network interactions is demonstrated on three examples: a genetic network containing four genes, a network describing p53 activity and mdm2 messenger RNA interactions, and a recently proposed kinetic model for interleukin (IL-6 and (IL-12b messenger RNA expression as a function of ATF3 and NF-κB promoter binding. For the first example, the CTLS significantly reduces the errors in the estimation of the Jacobian for the gene network. For the second, the CTLS reduces the errors from the measurements that are corrupted by white noise and the effect of neglected kinetics. For the third, it allows the correct identification, from noisy data, of the negative regulation of (IL-6 and (IL-12b by ATF3. Conclusion The significant improvements in performance demonstrated by the CTLS method under the wide range of conditions tested here, including different levels and types of measurement noise and different numbers of data points, suggests that its application will enable

Modularization of biochemical networks based on classification of Petri net t-invariants.

Science.gov (United States)

Grafahrend-Belau, Eva; Schreiber, Falk; Heiner, Monika; Sackmann, Andrea; Junker, Björn H; Grunwald, Stefanie; Speer, Astrid; Winder, Katja; Koch, Ina

2008-02-08

Structural analysis of biochemical networks is a growing field in bioinformatics and systems biology. The availability of an increasing amount of biological data from molecular biological networks promises a deeper understanding but confronts researchers with the problem of combinatorial explosion. The amount of qualitative network data is growing much faster than the amount of quantitative data, such as enzyme kinetics. In many cases it is even impossible to measure quantitative data because of limitations of experimental methods, or for ethical reasons. Thus, a huge amount of qualitative data, such as interaction data, is available, but it was not sufficiently used for modeling purposes, until now. New approaches have been developed, but the complexity of data often limits the application of many of the methods. Biochemical Petri nets make it possible to explore static and dynamic qualitative system properties. One Petri net approach is model validation based on the computation of the system's invariant properties, focusing on t-invariants. T-invariants correspond to subnetworks, which describe the basic system behavior.With increasing system complexity, the basic behavior can only be expressed by a huge number of t-invariants. According to our validation criteria for biochemical Petri nets, the necessary verification of the biological meaning, by interpreting each subnetwork (t-invariant) manually, is not possible anymore. Thus, an automated, biologically meaningful classification would be helpful in analyzing t-invariants, and supporting the understanding of the basic behavior of the considered biological system. Here, we introduce a new approach to automatically classify t-invariants to cope with network complexity. We apply clustering techniques such as UPGMA, Complete Linkage, Single Linkage, and Neighbor Joining in combination with different distance measures to get biologically meaningful clusters (t-clusters), which can be interpreted as modules. To find

Modularization of biochemical networks based on classification of Petri net t-invariants

Directory of Open Access Journals (Sweden)

Grunwald Stefanie

2008-02-01

Full Text Available Abstract Background Structural analysis of biochemical networks is a growing field in bioinformatics and systems biology. The availability of an increasing amount of biological data from molecular biological networks promises a deeper understanding but confronts researchers with the problem of combinatorial explosion. The amount of qualitative network data is growing much faster than the amount of quantitative data, such as enzyme kinetics. In many cases it is even impossible to measure quantitative data because of limitations of experimental methods, or for ethical reasons. Thus, a huge amount of qualitative data, such as interaction data, is available, but it was not sufficiently used for modeling purposes, until now. New approaches have been developed, but the complexity of data often limits the application of many of the methods. Biochemical Petri nets make it possible to explore static and dynamic qualitative system properties. One Petri net approach is model validation based on the computation of the system's invariant properties, focusing on t-invariants. T-invariants correspond to subnetworks, which describe the basic system behavior. With increasing system complexity, the basic behavior can only be expressed by a huge number of t-invariants. According to our validation criteria for biochemical Petri nets, the necessary verification of the biological meaning, by interpreting each subnetwork (t-invariant manually, is not possible anymore. Thus, an automated, biologically meaningful classification would be helpful in analyzing t-invariants, and supporting the understanding of the basic behavior of the considered biological system. Methods Here, we introduce a new approach to automatically classify t-invariants to cope with network complexity. We apply clustering techniques such as UPGMA, Complete Linkage, Single Linkage, and Neighbor Joining in combination with different distance measures to get biologically meaningful clusters (t

Biophysical constraints on the computational capacity of biochemical signaling networks

Science.gov (United States)

Wang, Ching-Hao; Mehta, Pankaj

Biophysics fundamentally constrains the computations that cells can carry out. Here, we derive fundamental bounds on the computational capacity of biochemical signaling networks that utilize post-translational modifications (e.g. phosphorylation). To do so, we combine ideas from the statistical physics of disordered systems and the observation by Tony Pawson and others that the biochemistry underlying protein-protein interaction networks is combinatorial and modular. Our results indicate that the computational capacity of signaling networks is severely limited by the energetics of binding and the need to achieve specificity. We relate our results to one of the theoretical pillars of statistical learning theory, Cover's theorem, which places bounds on the computational capacity of perceptrons. PM and CHW were supported by a Simons Investigator in the Mathematical Modeling of Living Systems Grant, and NIH Grant No. 1R35GM119461 (both to PM).

Deterministic modelling and stochastic simulation of biochemical pathways using MATLAB.

Science.gov (United States)

Ullah, M; Schmidt, H; Cho, K H; Wolkenhauer, O

2006-03-01

The analysis of complex biochemical networks is conducted in two popular conceptual frameworks for modelling. The deterministic approach requires the solution of ordinary differential equations (ODEs, reaction rate equations) with concentrations as continuous state variables. The stochastic approach involves the simulation of differential-difference equations (chemical master equations, CMEs) with probabilities as variables. This is to generate counts of molecules for chemical species as realisations of random variables drawn from the probability distribution described by the CMEs. Although there are numerous tools available, many of them free, the modelling and simulation environment MATLAB is widely used in the physical and engineering sciences. We describe a collection of MATLAB functions to construct and solve ODEs for deterministic simulation and to implement realisations of CMEs for stochastic simulation using advanced MATLAB coding (Release 14). The program was successfully applied to pathway models from the literature for both cases. The results were compared to implementations using alternative tools for dynamic modelling and simulation of biochemical networks. The aim is to provide a concise set of MATLAB functions that encourage the experimentation with systems biology models. All the script files are available from www.sbi.uni-rostock.de/ publications_matlab-paper.html.

Parametric sensitivity analysis for biochemical reaction networks based on pathwise information theory.

Science.gov (United States)

Pantazis, Yannis; Katsoulakis, Markos A; Vlachos, Dionisios G

2013-10-22

Stochastic modeling and simulation provide powerful predictive methods for the intrinsic understanding of fundamental mechanisms in complex biochemical networks. Typically, such mathematical models involve networks of coupled jump stochastic processes with a large number of parameters that need to be suitably calibrated against experimental data. In this direction, the parameter sensitivity analysis of reaction networks is an essential mathematical and computational tool, yielding information regarding the robustness and the identifiability of model parameters. However, existing sensitivity analysis approaches such as variants of the finite difference method can have an overwhelming computational cost in models with a high-dimensional parameter space. We develop a sensitivity analysis methodology suitable for complex stochastic reaction networks with a large number of parameters. The proposed approach is based on Information Theory methods and relies on the quantification of information loss due to parameter perturbations between time-series distributions. For this reason, we need to work on path-space, i.e., the set consisting of all stochastic trajectories, hence the proposed approach is referred to as "pathwise". The pathwise sensitivity analysis method is realized by employing the rigorously-derived Relative Entropy Rate, which is directly computable from the propensity functions. A key aspect of the method is that an associated pathwise Fisher Information Matrix (FIM) is defined, which in turn constitutes a gradient-free approach to quantifying parameter sensitivities. The structure of the FIM turns out to be block-diagonal, revealing hidden parameter dependencies and sensitivities in reaction networks. As a gradient-free method, the proposed sensitivity analysis provides a significant advantage when dealing with complex stochastic systems with a large number of parameters. In addition, the knowledge of the structure of the FIM can allow to efficiently address

Automated analysis of information processing, kinetic independence and modular architecture in biochemical networks using MIDIA.

Science.gov (United States)

Bowsher, Clive G

2011-02-15

Understanding the encoding and propagation of information by biochemical reaction networks and the relationship of such information processing properties to modular network structure is of fundamental importance in the study of cell signalling and regulation. However, a rigorous, automated approach for general biochemical networks has not been available, and high-throughput analysis has therefore been out of reach. Modularization Identification by Dynamic Independence Algorithms (MIDIA) is a user-friendly, extensible R package that performs automated analysis of how information is processed by biochemical networks. An important component is the algorithm's ability to identify exact network decompositions based on both the mass action kinetics and informational properties of the network. These modularizations are visualized using a tree structure from which important dynamic conditional independence properties can be directly read. Only partial stoichiometric information needs to be used as input to MIDIA, and neither simulations nor knowledge of rate parameters are required. When applied to a signalling network, for example, the method identifies the routes and species involved in the sequential propagation of information between its multiple inputs and outputs. These routes correspond to the relevant paths in the tree structure and may be further visualized using the Input-Output Path Matrix tool. MIDIA remains computationally feasible for the largest network reconstructions currently available and is straightforward to use with models written in Systems Biology Markup Language (SBML). The package is distributed under the GNU General Public License and is available, together with a link to browsable Supplementary Material, at http://code.google.com/p/midia. Further information is at www.maths.bris.ac.uk/~macgb/Software.html.

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.

Emergence of switch-like behavior in a large family of simple biochemical networks.

Directory of Open Access Journals (Sweden)

Dan Siegal-Gaskins

2011-05-01

Full Text Available Bistability plays a central role in the gene regulatory networks (GRNs controlling many essential biological functions, including cellular differentiation and cell cycle control. However, establishing the network topologies that can exhibit bistability remains a challenge, in part due to the exceedingly large variety of GRNs that exist for even a small number of components. We begin to address this problem by employing chemical reaction network theory in a comprehensive in silico survey to determine the capacity for bistability of more than 40,000 simple networks that can be formed by two transcription factor-coding genes and their associated proteins (assuming only the most elementary biochemical processes. We find that there exist reaction rate constants leading to bistability in ∼90% of these GRN models, including several circuits that do not contain any of the TF cooperativity commonly associated with bistable systems, and the majority of which could only be identified as bistable through an original subnetwork-based analysis. A topological sorting of the two-gene family of networks based on the presence or absence of biochemical reactions reveals eleven minimal bistable networks (i.e., bistable networks that do not contain within them a smaller bistable subnetwork. The large number of previously unknown bistable network topologies suggests that the capacity for switch-like behavior in GRNs arises with relative ease and is not easily lost through network evolution. To highlight the relevance of the systematic application of CRNT to bistable network identification in real biological systems, we integrated publicly available protein-protein interaction, protein-DNA interaction, and gene expression data from Saccharomyces cerevisiae, and identified several GRNs predicted to behave in a bistable fashion.

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

Science.gov (United States)

2015-03-03

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

HSimulator: Hybrid Stochastic/Deterministic Simulation of Biochemical Reaction Networks

Directory of Open Access Journals (Sweden)

Luca Marchetti

2017-01-01

Full Text Available HSimulator is a multithread simulator for mass-action biochemical reaction systems placed in a well-mixed environment. HSimulator provides optimized implementation of a set of widespread state-of-the-art stochastic, deterministic, and hybrid simulation strategies including the first publicly available implementation of the Hybrid Rejection-based Stochastic Simulation Algorithm (HRSSA. HRSSA, the fastest hybrid algorithm to date, allows for an efficient simulation of the models while ensuring the exact simulation of a subset of the reaction network modeling slow reactions. Benchmarks show that HSimulator is often considerably faster than the other considered simulators. The software, running on Java v6.0 or higher, offers a simulation GUI for modeling and visually exploring biological processes and a Javadoc-documented Java library to support the development of custom applications. HSimulator is released under the COSBI Shared Source license agreement (COSBI-SSLA.

Modeling stochasticity in biochemical reaction networks

International Nuclear Information System (INIS)

Constantino, P H; Vlysidis, M; Smadbeck, P; Kaznessis, Y N

2016-01-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. (topical review)

Shape, size, and robustness: feasible regions in the parameter space of biochemical networks.

Directory of Open Access Journals (Sweden)

Adel Dayarian

2009-01-01

Full Text Available The concept of robustness of regulatory networks has received much attention in the last decade. One measure of robustness has been associated with the volume of the feasible region, namely, the region in the parameter space in which the system is functional. In this paper, we show that, in addition to volume, the geometry of this region has important consequences for the robustness and the fragility of a network. We develop an approximation within which we could algebraically specify the feasible region. We analyze the segment polarity gene network to illustrate our approach. The study of random walks in the parameter space and how they exit the feasible region provide us with a rich perspective on the different modes of failure of this network model. In particular, we found that, between two alternative ways of activating Wingless, one is more robust than the other. Our method provides a more complete measure of robustness to parameter variation. As a general modeling strategy, our approach is an interesting alternative to Boolean representation of biochemical networks.

A probabilistic approach to identify putative drug targets in biochemical networks.

NARCIS (Netherlands)

Murabito, E.; Smalbone, K.; Swinton, J.; Westerhoff, H.V.; Steuer, R.

2011-01-01

Network-based drug design holds great promise in clinical research as a way to overcome the limitations of traditional approaches in the development of drugs with high efficacy and low toxicity. This novel strategy aims to study how a biochemical network as a whole, rather than its individual

Modeling of uncertainties in biochemical reactions.

Science.gov (United States)

Mišković, Ljubiša; Hatzimanikatis, Vassily

2011-02-01

Mathematical modeling is an indispensable tool for research and development in biotechnology and bioengineering. The formulation of kinetic models of biochemical networks depends on knowledge of the kinetic properties of the enzymes of the individual reactions. However, kinetic data acquired from experimental observations bring along uncertainties due to various experimental conditions and measurement methods. In this contribution, we propose a novel way to model the uncertainty in the enzyme kinetics and to predict quantitatively the responses of metabolic reactions to the changes in enzyme activities under uncertainty. The proposed methodology accounts explicitly for mechanistic properties of enzymes and physico-chemical and thermodynamic constraints, and is based on formalism from systems theory and metabolic control analysis. We achieve this by observing that kinetic responses of metabolic reactions depend: (i) on the distribution of the enzymes among their free form and all reactive states; (ii) on the equilibrium displacements of the overall reaction and that of the individual enzymatic steps; and (iii) on the net fluxes through the enzyme. Relying on this observation, we develop a novel, efficient Monte Carlo sampling procedure to generate all states within a metabolic reaction that satisfy imposed constrains. Thus, we derive the statistics of the expected responses of the metabolic reactions to changes in enzyme levels and activities, in the levels of metabolites, and in the values of the kinetic parameters. We present aspects of the proposed framework through an example of the fundamental three-step reversible enzymatic reaction mechanism. We demonstrate that the equilibrium displacements of the individual enzymatic steps have an important influence on kinetic responses of the enzyme. Furthermore, we derive the conditions that must be satisfied by a reversible three-step enzymatic reaction operating far away from the equilibrium in order to respond to

A variational principle for computing nonequilibrium fluxes and potentials in genome-scale biochemical networks.

Science.gov (United States)

Fleming, R M T; Maes, C M; Saunders, M A; Ye, Y; Palsson, B Ø

2012-01-07

We derive a convex optimization problem on a steady-state nonequilibrium network of biochemical reactions, with the property that energy conservation and the second law of thermodynamics both hold at the problem solution. This suggests a new variational principle for biochemical networks that can be implemented in a computationally tractable manner. We derive the Lagrange dual of the optimization problem and use strong duality to demonstrate that a biochemical analogue of Tellegen's theorem holds at optimality. Each optimal flux is dependent on a free parameter that we relate to an elementary kinetic parameter when mass action kinetics is assumed. Copyright © 2011 Elsevier Ltd. All rights reserved.

Identification of neutral biochemical network models from time series data.

Science.gov (United States)

Vilela, Marco; Vinga, Susana; Maia, Marco A Grivet Mattoso; Voit, Eberhard O; Almeida, Jonas S

2009-05-05

The major difficulty in modeling biological systems from multivariate time series is the identification of parameter sets that endow a model with dynamical behaviors sufficiently similar to the experimental data. Directly related to this parameter estimation issue is the task of identifying the structure and regulation of ill-characterized systems. Both tasks are simplified if the mathematical model is canonical, i.e., if it is constructed according to strict guidelines. In this report, we propose a method for the identification of admissible parameter sets of canonical S-systems from biological time series. The method is based on a Monte Carlo process that is combined with an improved version of our previous parameter optimization algorithm. The method maps the parameter space into the network space, which characterizes the connectivity among components, by creating an ensemble of decoupled S-system models that imitate the dynamical behavior of the time series with sufficient accuracy. The concept of sloppiness is revisited in the context of these S-system models with an exploration not only of different parameter sets that produce similar dynamical behaviors but also different network topologies that yield dynamical similarity. The proposed parameter estimation methodology was applied to actual time series data from the glycolytic pathway of the bacterium Lactococcus lactis and led to ensembles of models with different network topologies. In parallel, the parameter optimization algorithm was applied to the same dynamical data upon imposing a pre-specified network topology derived from prior biological knowledge, and the results from both strategies were compared. The results suggest that the proposed method may serve as a powerful exploration tool for testing hypotheses and the design of new experiments.

Linear analysis near a steady-state of biochemical networks: control analysis, correlation metrics and circuit theory

Directory of Open Access Journals (Sweden)

Qian Hong

2008-05-01

Full Text Available Abstract Background: Several approaches, including metabolic control analysis (MCA, flux balance analysis (FBA, correlation metric construction (CMC, and biochemical circuit theory (BCT, have been developed for the quantitative analysis of complex biochemical networks. Here, we present a comprehensive theory of linear analysis for nonequilibrium steady-state (NESS biochemical reaction networks that unites these disparate approaches in a common mathematical framework and thermodynamic basis. Results: In this theory a number of relationships between key matrices are introduced: the matrix A obtained in the standard, linear-dynamic-stability analysis of the steady-state can be decomposed as A = SRT where R and S are directly related to the elasticity-coefficient matrix for the fluxes and chemical potentials in MCA, respectively; the control-coefficients for the fluxes and chemical potentials can be written in terms of RT BS and ST BS respectively where matrix B is the inverse of A; the matrix S is precisely the stoichiometric matrix in FBA; and the matrix eAt plays a central role in CMC. Conclusion: One key finding that emerges from this analysis is that the well-known summation theorems in MCA take different forms depending on whether metabolic steady-state is maintained by flux injection or concentration clamping. We demonstrate that if rate-limiting steps exist in a biochemical pathway, they are the steps with smallest biochemical conductances and largest flux control-coefficients. We hypothesize that biochemical networks for cellular signaling have a different strategy for minimizing energy waste and being efficient than do biochemical networks for biosynthesis. We also discuss the intimate relationship between MCA and biochemical systems analysis (BSA.

Identification of neutral biochemical network models from time series data

Directory of Open Access Journals (Sweden)

Maia Marco

2009-05-01

Full Text Available Abstract Background The major difficulty in modeling biological systems from multivariate time series is the identification of parameter sets that endow a model with dynamical behaviors sufficiently similar to the experimental data. Directly related to this parameter estimation issue is the task of identifying the structure and regulation of ill-characterized systems. Both tasks are simplified if the mathematical model is canonical, i.e., if it is constructed according to strict guidelines. Results In this report, we propose a method for the identification of admissible parameter sets of canonical S-systems from biological time series. The method is based on a Monte Carlo process that is combined with an improved version of our previous parameter optimization algorithm. The method maps the parameter space into the network space, which characterizes the connectivity among components, by creating an ensemble of decoupled S-system models that imitate the dynamical behavior of the time series with sufficient accuracy. The concept of sloppiness is revisited in the context of these S-system models with an exploration not only of different parameter sets that produce similar dynamical behaviors but also different network topologies that yield dynamical similarity. Conclusion The proposed parameter estimation methodology was applied to actual time series data from the glycolytic pathway of the bacterium Lactococcus lactis and led to ensembles of models with different network topologies. In parallel, the parameter optimization algorithm was applied to the same dynamical data upon imposing a pre-specified network topology derived from prior biological knowledge, and the results from both strategies were compared. The results suggest that the proposed method may serve as a powerful exploration tool for testing hypotheses and the design of new experiments.

A moment-convergence method for stochastic analysis of biochemical reaction networks.

Science.gov (United States)

Zhang, Jiajun; Nie, Qing; Zhou, Tianshou

2016-05-21

Traditional moment-closure methods need to assume that high-order cumulants of a probability distribution approximate to zero. However, this strong assumption is not satisfied for many biochemical reaction networks. Here, we introduce convergent moments (defined in mathematics as the coefficients in the Taylor expansion of the probability-generating function at some point) to overcome this drawback of the moment-closure methods. As such, we develop a new analysis method for stochastic chemical kinetics. This method provides an accurate approximation for the master probability equation (MPE). In particular, the connection between low-order convergent moments and rate constants can be more easily derived in terms of explicit and analytical forms, allowing insights that would be difficult to obtain through direct simulation or manipulation of the MPE. In addition, it provides an accurate and efficient way to compute steady-state or transient probability distribution, avoiding the algorithmic difficulty associated with stiffness of the MPE due to large differences in sizes of rate constants. Applications of the method to several systems reveal nontrivial stochastic mechanisms of gene expression dynamics, e.g., intrinsic fluctuations can induce transient bimodality and amplify transient signals, and slow switching between promoter states can increase fluctuations in spatially heterogeneous signals. The overall approach has broad applications in modeling, analysis, and computation of complex biochemical networks with intrinsic noise.

A moment-convergence method for stochastic analysis of biochemical reaction networks

Energy Technology Data Exchange (ETDEWEB)

Zhang, Jiajun [School of Mathematics and Computational Science, Sun Yat-Sen University, Guangzhou 510275 (China); Nie, Qing [Department of Mathematics, University of California at Irvine, Irvine, California 92697 (United States); Zhou, Tianshou, E-mail: mcszhtsh@mail.sysu.edu.cn [School of Mathematics and Computational Science, Sun Yat-Sen University, Guangzhou 510275 (China); Guangdong Province Key Laboratory of Computational Science and School of Mathematics and Computational Science, Sun Yat-Sen University, Guangzhou 510275 (China)

2016-05-21

Traditional moment-closure methods need to assume that high-order cumulants of a probability distribution approximate to zero. However, this strong assumption is not satisfied for many biochemical reaction networks. Here, we introduce convergent moments (defined in mathematics as the coefficients in the Taylor expansion of the probability-generating function at some point) to overcome this drawback of the moment-closure methods. As such, we develop a new analysis method for stochastic chemical kinetics. This method provides an accurate approximation for the master probability equation (MPE). In particular, the connection between low-order convergent moments and rate constants can be more easily derived in terms of explicit and analytical forms, allowing insights that would be difficult to obtain through direct simulation or manipulation of the MPE. In addition, it provides an accurate and efficient way to compute steady-state or transient probability distribution, avoiding the algorithmic difficulty associated with stiffness of the MPE due to large differences in sizes of rate constants. Applications of the method to several systems reveal nontrivial stochastic mechanisms of gene expression dynamics, e.g., intrinsic fluctuations can induce transient bimodality and amplify transient signals, and slow switching between promoter states can increase fluctuations in spatially heterogeneous signals. The overall approach has broad applications in modeling, analysis, and computation of complex biochemical networks with intrinsic noise.

Hybrid modeling of the crosstalk between signaling and transcriptional networks using ordinary differential equations and multi-valued logic.

Science.gov (United States)

Khan, Faiz M; Schmitz, Ulf; Nikolov, Svetoslav; Engelmann, David; Pützer, Brigitte M; Wolkenhauer, Olaf; Vera, Julio

2014-01-01

A decade of successful results indicates that systems biology is the appropriate approach to investigate the regulation of complex biochemical networks involving transcriptional and post-transcriptional regulations. It becomes mandatory when dealing with highly interconnected biochemical networks, composed of hundreds of compounds, or when networks are enriched in non-linear motifs like feedback and feedforward loops. An emerging dilemma is to conciliate models of massive networks and the adequate description of non-linear dynamics in a suitable modeling framework. Boolean networks are an ideal representation of massive networks that are humble in terms of computational complexity and data demand. However, they are inappropriate when dealing with nested feedback/feedforward loops, structural motifs common in biochemical networks. On the other hand, models of ordinary differential equations (ODEs) cope well with these loops, but they require enormous amounts of quantitative data for a full characterization of the model. Here we propose hybrid models, composed of ODE and logical sub-modules, as a strategy to handle large scale, non-linear biochemical networks that include transcriptional and post-transcriptional regulations. We illustrate the construction of this kind of models using as example a regulatory network centered on E2F1, a transcription factor involved in cancer. The hybrid modeling approach proposed is a good compromise between quantitative/qualitative accuracy and scalability when considering large biochemical networks with a small highly interconnected core, and module of transcriptionally regulated genes that are not part of critical regulatory loops. This article is part of a Special Issue entitled: Computational Proteomics, Systems Biology & Clinical Implications. Guest Editor: Yudong Cai. Copyright © 2013 Elsevier B.V. All rights reserved.

Structuring evolution: biochemical networks and metabolic diversification in birds.

Science.gov (United States)

Morrison, Erin S; Badyaev, Alexander V

2016-08-25

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

Identification of alterations in the Jacobian of biochemical reaction networks from steady state covariance data at two conditions.

Science.gov (United States)

Kügler, Philipp; Yang, Wei

2014-06-01

Model building of biochemical reaction networks typically involves experiments in which changes in the behavior due to natural or experimental perturbations are observed. Computational models of reaction networks are also used in a systems biology approach to study how transitions from a healthy to a diseased state result from changes in genetic or environmental conditions. In this paper we consider the nonlinear inverse problem of inferring information about the Jacobian of a Langevin type network model from covariance data of steady state concentrations associated to two different experimental conditions. Under idealized assumptions on the Langevin fluctuation matrices we prove that relative alterations in the network Jacobian can be uniquely identified when comparing the two data sets. Based on this result and the premise that alteration is locally confined to separable parts due to network modularity we suggest a computational approach using hybrid stochastic-deterministic optimization for the detection of perturbations in the network Jacobian using the sparsity promoting effect of [Formula: see text]-penalization. Our approach is illustrated by means of published metabolomic and signaling reaction networks.

SABIO-RK: A data warehouse for biochemical reactions and their kinetics

Directory of Open Access Journals (Sweden)

Krebs Olga

2007-03-01

Full Text Available Systems biology is an emerging field that aims at obtaining a system-level understanding of biological processes. The modelling and simulation of networks of biochemical reactions have great and promising application potential but require reliable kinetic data. In order to support the systems biology community with such data we have developed SABIO-RK (System for the Analysis of Biochemical Pathways - Reaction Kinetics, a curated database with information about biochemical reactions and their kinetic properties, which allows researchers to obtain and compare kinetic data and to integrate them into models of biochemical networks. SABIO-RK is freely available for academic use at http://sabio.villa-bosch.de/SABIORK/.

Improving Marine Ecosystem Models with Biochemical Tracers

Science.gov (United States)

Pethybridge, Heidi R.; Choy, C. Anela; Polovina, Jeffrey J.; Fulton, Elizabeth A.

2018-01-01

Empirical data on food web dynamics and predator-prey interactions underpin ecosystem models, which are increasingly used to support strategic management of marine resources. These data have traditionally derived from stomach content analysis, but new and complementary forms of ecological data are increasingly available from biochemical tracer techniques. Extensive opportunities exist to improve the empirical robustness of ecosystem models through the incorporation of biochemical tracer data and derived indices, an area that is rapidly expanding because of advances in analytical developments and sophisticated statistical techniques. Here, we explore the trophic information required by ecosystem model frameworks (species, individual, and size based) and match them to the most commonly used biochemical tracers (bulk tissue and compound-specific stable isotopes, fatty acids, and trace elements). Key quantitative parameters derived from biochemical tracers include estimates of diet composition, niche width, and trophic position. Biochemical tracers also provide powerful insight into the spatial and temporal variability of food web structure and the characterization of dominant basal and microbial food web groups. A major challenge in incorporating biochemical tracer data into ecosystem models is scale and data type mismatches, which can be overcome with greater knowledge exchange and numerical approaches that transform, integrate, and visualize data.

Coarse-graining stochastic biochemical networks: adiabaticity and fast simulations

Energy Technology Data Exchange (ETDEWEB)

Nemenman, Ilya [Los Alamos National Laboratory; Sinitsyn, Nikolai [Los Alamos National Laboratory; Hengartner, Nick [Los Alamos National Laboratory

2008-01-01

We propose a universal approach for analysis and fast simulations of stiff stochastic biochemical kinetics networks, which rests on elimination of fast chemical species without a loss of information about mesoscoplc, non-Poissonian fluctuations of the slow ones. Our approach, which is similar to the Born-Oppenhelmer approximation in quantum mechanics, follows from the stochastic path Integral representation of the cumulant generating function of reaction events. In applications with a small number of chemIcal reactions, It produces analytical expressions for cumulants of chemical fluxes between the slow variables. This allows for a low-dimensional, Interpretable representation and can be used for coarse-grained numerical simulation schemes with a small computational complexity and yet high accuracy. As an example, we derive the coarse-grained description for a chain of biochemical reactions, and show that the coarse-grained and the microscopic simulations are in an agreement, but the coarse-gralned simulations are three orders of magnitude faster.

Connecting Biochemical Photosynthesis Models with Crop Models to Support Crop Improvement.

Science.gov (United States)

Wu, Alex; Song, Youhong; van Oosterom, Erik J; Hammer, Graeme L

2016-01-01

The next advance in field crop productivity will likely need to come from improving crop use efficiency of resources (e.g., light, water, and nitrogen), aspects of which are closely linked with overall crop photosynthetic efficiency. Progress in genetic manipulation of photosynthesis is confounded by uncertainties of consequences at crop level because of difficulties connecting across scales. Crop growth and development simulation models that integrate across biological levels of organization and use a gene-to-phenotype modeling approach may present a way forward. There has been a long history of development of crop models capable of simulating dynamics of crop physiological attributes. Many crop models incorporate canopy photosynthesis (source) as a key driver for crop growth, while others derive crop growth from the balance between source- and sink-limitations. Modeling leaf photosynthesis has progressed from empirical modeling via light response curves to a more mechanistic basis, having clearer links to the underlying biochemical processes of photosynthesis. Cross-scale modeling that connects models at the biochemical and crop levels and utilizes developments in upscaling leaf-level models to canopy models has the potential to bridge the gap between photosynthetic manipulation at the biochemical level and its consequences on crop productivity. Here we review approaches to this emerging cross-scale modeling framework and reinforce the need for connections across levels of modeling. Further, we propose strategies for connecting biochemical models of photosynthesis into the cross-scale modeling framework to support crop improvement through photosynthetic manipulation.

Connecting Biochemical Photosynthesis Models with Crop Models to Support Crop Improvement

Science.gov (United States)

Wu, Alex; Song, Youhong; van Oosterom, Erik J.; Hammer, Graeme L.

2016-01-01

The next advance in field crop productivity will likely need to come from improving crop use efficiency of resources (e.g., light, water, and nitrogen), aspects of which are closely linked with overall crop photosynthetic efficiency. Progress in genetic manipulation of photosynthesis is confounded by uncertainties of consequences at crop level because of difficulties connecting across scales. Crop growth and development simulation models that integrate across biological levels of organization and use a gene-to-phenotype modeling approach may present a way forward. There has been a long history of development of crop models capable of simulating dynamics of crop physiological attributes. Many crop models incorporate canopy photosynthesis (source) as a key driver for crop growth, while others derive crop growth from the balance between source- and sink-limitations. Modeling leaf photosynthesis has progressed from empirical modeling via light response curves to a more mechanistic basis, having clearer links to the underlying biochemical processes of photosynthesis. Cross-scale modeling that connects models at the biochemical and crop levels and utilizes developments in upscaling leaf-level models to canopy models has the potential to bridge the gap between photosynthetic manipulation at the biochemical level and its consequences on crop productivity. Here we review approaches to this emerging cross-scale modeling framework and reinforce the need for connections across levels of modeling. Further, we propose strategies for connecting biochemical models of photosynthesis into the cross-scale modeling framework to support crop improvement through photosynthetic manipulation. PMID:27790232

Multidimensional biochemical information processing of dynamical patterns.

Science.gov (United States)

Hasegawa, Yoshihiko

2018-02-01

Cells receive signaling molecules by receptors and relay information via sensory networks so that they can respond properly depending on the type of signal. Recent studies have shown that cells can extract multidimensional information from dynamical concentration patterns of signaling molecules. We herein study how biochemical systems can process multidimensional information embedded in dynamical patterns. We model the decoding networks by linear response functions, and optimize the functions with the calculus of variations to maximize the mutual information between patterns and output. We find that, when the noise intensity is lower, decoders with different linear response functions, i.e., distinct decoders, can extract much information. However, when the noise intensity is higher, distinct decoders do not provide the maximum amount of information. This indicates that, when transmitting information by dynamical patterns, embedding information in multiple patterns is not optimal when the noise intensity is very large. Furthermore, we explore the biochemical implementations of these decoders using control theory and demonstrate that these decoders can be implemented biochemically through the modification of cascade-type networks, which are prevalent in actual signaling pathways.

Propagation of kinetic uncertainties through a canonical topology of the TLR4 signaling network in different regions of biochemical reaction space

Directory of Open Access Journals (Sweden)

St Laurent Georges

2010-03-01

Full Text Available Abstract Background Signal transduction networks represent the information processing systems that dictate which dynamical regimes of biochemical activity can be accessible to a cell under certain circumstances. One of the major concerns in molecular systems biology is centered on the elucidation of the robustness properties and information processing capabilities of signal transduction networks. Achieving this goal requires the establishment of causal relations between the design principle of biochemical reaction systems and their emergent dynamical behaviors. Methods In this study, efforts were focused in the construction of a relatively well informed, deterministic, non-linear dynamic model, accounting for reaction mechanisms grounded on standard mass action and Hill saturation kinetics, of the canonical reaction topology underlying Toll-like receptor 4 (TLR4-mediated signaling events. This signaling mechanism has been shown to be deployed in macrophages during a relatively short time window in response to lypopolysaccharyde (LPS stimulation, which leads to a rapidly mounted innate immune response. An extensive computational exploration of the biochemical reaction space inhabited by this signal transduction network was performed via local and global perturbation strategies. Importantly, a broad spectrum of biologically plausible dynamical regimes accessible to the network in widely scattered regions of parameter space was reconstructed computationally. Additionally, experimentally reported transcriptional readouts of target pro-inflammatory genes, which are actively modulated by the network in response to LPS stimulation, were also simulated. This was done with the main goal of carrying out an unbiased statistical assessment of the intrinsic robustness properties of this canonical reaction topology. Results Our simulation results provide convincing numerical evidence supporting the idea that a canonical reaction mechanism of the TLR4

A MULTILAYER BIOCHEMICAL DRY DEPOSITION MODEL 1. MODEL FORMULATION

Science.gov (United States)

A multilayer biochemical dry deposition model has been developed based on the NOAA Multilayer Model (MLM) to study gaseous exchanges between the soil, plants, and the atmosphere. Most of the parameterizations and submodels have been updated or replaced. The numerical integration ...

A MULTILAYER BIOCHEMICAL DRY DEPOSITION MODEL 2. MODEL EVALUATION

Science.gov (United States)

The multilayer biochemical dry deposition model (MLBC) described in the accompanying paper was tested against half-hourly eddy correlation data from six field sites under a wide range of climate conditions with various plant types. Modeled CO2, O3, SO2<...

Simulation and Statistical Inference of Stochastic Reaction Networks with Applications to Epidemic Models

KAUST Repository

Moraes, Alvaro

2015-01-01

Networks (SRNs), that are intended to describe the time evolution of interacting particle systems where one particle interacts with the others through a finite set of reaction channels. SRNs have been mainly developed to model biochemical reactions

Simulation studies in biochemical signaling and enzyme reactions

Science.gov (United States)

Nelatury, Sudarshan R.; Vagula, Mary C.

2014-06-01

Biochemical pathways characterize various biochemical reaction schemes that involve a set of species and the manner in which they are connected. Determination of schematics that represent these pathways is an important task in understanding metabolism and signal transduction. Examples of these Pathways are: DNA and protein synthesis, and production of several macro-molecules essential for cell survival. A sustained feedback mechanism arises in gene expression and production of mRNA that lead to protein synthesis if the protein so synthesized serves as a transcription factor and becomes a repressor of the gene expression. The cellular regulations are carried out through biochemical networks consisting of reactions and regulatory proteins. Systems biology is a relatively new area that attempts to describe the biochemical pathways analytically and develop reliable mathematical models for the pathways. A complete understanding of chemical reaction kinetics is prohibitively hard thanks to the nonlinear and highly complex mechanisms that regulate protein formation, but attempting to numerically solve some of the governing differential equations seems to offer significant insight about their biochemical picture. To validate these models, one can perform simple experiments in the lab. This paper introduces fundamental ideas in biochemical signaling and attempts to take first steps into the understanding of biochemical oscillations. Initially, the two-pool model of calcium is used to describe the dynamics behind the oscillations. Later we present some elementary results showing biochemical oscillations arising from solving differential equations of Elowitz and Leibler using MATLAB software.

An Integrated Qualitative and Quantitative Biochemical Model Learning Framework Using Evolutionary Strategy and Simulated Annealing.

Science.gov (United States)

Wu, Zujian; Pang, Wei; Coghill, George M

2015-01-01

Both qualitative and quantitative model learning frameworks for biochemical systems have been studied in computational systems biology. In this research, after introducing two forms of pre-defined component patterns to represent biochemical models, we propose an integrative qualitative and quantitative modelling framework for inferring biochemical systems. In the proposed framework, interactions between reactants in the candidate models for a target biochemical system are evolved and eventually identified by the application of a qualitative model learning approach with an evolution strategy. Kinetic rates of the models generated from qualitative model learning are then further optimised by employing a quantitative approach with simulated annealing. Experimental results indicate that our proposed integrative framework is feasible to learn the relationships between biochemical reactants qualitatively and to make the model replicate the behaviours of the target system by optimising the kinetic rates quantitatively. Moreover, potential reactants of a target biochemical system can be discovered by hypothesising complex reactants in the synthetic models. Based on the biochemical models learned from the proposed framework, biologists can further perform experimental study in wet laboratory. In this way, natural biochemical systems can be better understood.

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

Biochemical correlates in an animal model of depression

International Nuclear Information System (INIS)

Johnson, J.O.

1986-01-01

A valid animal model of depression was used to explore specific adrenergic receptor differences between rats exhibiting aberrant behavior and control groups. Preliminary experiments revealed a distinct upregulation of hippocampal beta-receptors (as compared to other brain regions) in those animals acquiring a response deficit as a result of exposure to inescapable footshock. Concurrent studies using standard receptor binding techniques showed no large changes in the density of alpha-adrenergic, serotonergic, or dopaminergic receptor densities. This led to the hypothesis that the hippocampal beta-receptor in responses deficient animals could be correlated with the behavioral changes seen after exposure to the aversive stimulus. Normalization of the behavior through the administration of antidepressants could be expected to reverse the biochemical changes if these are related to the mechanism of action of antidepressant drugs. This study makes three important points: (1) there is a relevant biochemical change in the hippocampus of response deficient rats which occurs in parallel to a well-defined behavior, (2) the biochemical and behavioral changes are normalized by antidepressant treatments exhibiting both serotonergic and adrenergic mechanisms of action, and (3) the mode of action of antidepressants in this model is probably a combination of serotonergic and adrenergic influences modulating the hippocampal beta-receptor. These results are discussed in relation to anatomical and biochemical aspects of antidepressant action

Identifying optimal models to represent biochemical systems.

Directory of Open Access Journals (Sweden)

Mochamad Apri

Full Text Available Biochemical systems involving a high number of components with intricate interactions often lead to complex models containing a large number of parameters. Although a large model could describe in detail the mechanisms that underlie the system, its very large size may hinder us in understanding the key elements of the system. Also in terms of parameter identification, large models are often problematic. Therefore, a reduced model may be preferred to represent the system. Yet, in order to efficaciously replace the large model, the reduced model should have the same ability as the large model to produce reliable predictions for a broad set of testable experimental conditions. We present a novel method to extract an "optimal" reduced model from a large model to represent biochemical systems by combining a reduction method and a model discrimination method. The former assures that the reduced model contains only those components that are important to produce the dynamics observed in given experiments, whereas the latter ensures that the reduced model gives a good prediction for any feasible experimental conditions that are relevant to answer questions at hand. These two techniques are applied iteratively. The method reveals the biological core of a model mathematically, indicating the processes that are likely to be responsible for certain behavior. We demonstrate the algorithm on two realistic model examples. We show that in both cases the core is substantially smaller than the full model.

Soft Measurement Modeling Based on Chaos Theory for Biochemical Oxygen Demand (BOD

Directory of Open Access Journals (Sweden)

Junfei Qiao

2016-12-01

Full Text Available The precision of soft measurement for biochemical oxygen demand (BOD is always restricted due to various factors in the wastewater treatment plant (WWTP. To solve this problem, a new soft measurement modeling method based on chaos theory is proposed and is applied to BOD measurement in this paper. Phase space reconstruction (PSR based on Takens embedding theorem is used to extract more information from the limited datasets of the chaotic system. The WWTP is first testified as a chaotic system by the correlation dimension (D, the largest Lyapunov exponents (λ1, the Kolmogorov entropy (K of the BOD and other water quality parameters time series. Multivariate chaotic time series modeling method with principal component analysis (PCA and artificial neural network (ANN is then adopted to estimate the value of the effluent BOD. Simulation results show that the proposed approach has higher accuracy and better prediction ability than the corresponding modeling approaches not based on chaos theory.

Distinct configurations of protein complexes and biochemical pathways revealed by epistatic interaction network motifs

LENUS (Irish Health Repository)

Casey, Fergal

2011-08-22

Abstract Background Gene and protein interactions are commonly represented as networks, with the genes or proteins comprising the nodes and the relationship between them as edges. Motifs, or small local configurations of edges and nodes that arise repeatedly, can be used to simplify the interpretation of networks. Results We examined triplet motifs in a network of quantitative epistatic genetic relationships, and found a non-random distribution of particular motif classes. Individual motif classes were found to be associated with different functional properties, suggestive of an underlying biological significance. These associations were apparent not only for motif classes, but for individual positions within the motifs. As expected, NNN (all negative) motifs were strongly associated with previously reported genetic (i.e. synthetic lethal) interactions, while PPP (all positive) motifs were associated with protein complexes. The two other motif classes (NNP: a positive interaction spanned by two negative interactions, and NPP: a negative spanned by two positives) showed very distinct functional associations, with physical interactions dominating for the former but alternative enrichments, typical of biochemical pathways, dominating for the latter. Conclusion We present a model showing how NNP motifs can be used to recognize supportive relationships between protein complexes, while NPP motifs often identify opposing or regulatory behaviour between a gene and an associated pathway. The ability to use motifs to point toward underlying biological organizational themes is likely to be increasingly important as more extensive epistasis mapping projects in higher organisms begin.

Modeling Self-Healing of Concrete Using Hybrid Genetic Algorithm-Artificial Neural Network.

Science.gov (United States)

Ramadan Suleiman, Ahmed; Nehdi, Moncef L

2017-02-07

This paper presents an approach to predicting the intrinsic self-healing in concrete using a hybrid genetic algorithm-artificial neural network (GA-ANN). A genetic algorithm was implemented in the network as a stochastic optimizing tool for the initial optimal weights and biases. This approach can assist the network in achieving a global optimum and avoid the possibility of the network getting trapped at local optima. The proposed model was trained and validated using an especially built database using various experimental studies retrieved from the open literature. The model inputs include the cement content, water-to-cement ratio (w/c), type and dosage of supplementary cementitious materials, bio-healing materials, and both expansive and crystalline additives. Self-healing indicated by means of crack width is the model output. The results showed that the proposed GA-ANN model is capable of capturing the complex effects of various self-healing agents (e.g., biochemical material, silica-based additive, expansive and crystalline components) on the self-healing performance in cement-based materials.

Simplifying biochemical models with intermediate species

DEFF Research Database (Denmark)

Feliu, Elisenda; Wiuf, Carsten

2013-01-01

techniques, we study systematically the effects of intermediate, or transient, species in biochemical systems and provide a simple, yet rigorous mathematical classification of all models obtained from a core model by including intermediates. Main examples include enzymatic and post-translational modification...... systems, where intermediates often are considered insignificant and neglected in a model, or they are not included because we are unaware of their existence. All possible models obtained from the core model are classified into a finite number of classes. Each class is defined by a mathematically simple...... canonical model that characterizes crucial dynamical properties, such as mono- and multistationarity and stability of steady states, of all models in the class. We show that if the core model does not have conservation laws, then the introduction of intermediates does not change the steady...

Computing molecular fluctuations in biochemical reaction systems based on a mechanistic, statistical theory of irreversible processes.

Science.gov (United States)

Kulasiri, Don

2011-01-01

We discuss the quantification of molecular fluctuations in the biochemical reaction systems within the context of intracellular processes associated with gene expression. We take the molecular reactions pertaining to circadian rhythms to develop models of molecular fluctuations in this chapter. There are a significant number of studies on stochastic fluctuations in intracellular genetic regulatory networks based on single cell-level experiments. In order to understand the fluctuations associated with the gene expression in circadian rhythm networks, it is important to model the interactions of transcriptional factors with the E-boxes in the promoter regions of some of the genes. The pertinent aspects of a near-equilibrium theory that would integrate the thermodynamical and particle dynamic characteristics of intracellular molecular fluctuations would be discussed, and the theory is extended by using the theory of stochastic differential equations. We then model the fluctuations associated with the promoter regions using general mathematical settings. We implemented ubiquitous Gillespie's algorithms, which are used to simulate stochasticity in biochemical networks, for each of the motifs. Both the theory and the Gillespie's algorithms gave the same results in terms of the time evolution of means and variances of molecular numbers. As biochemical reactions occur far away from equilibrium-hence the use of the Gillespie algorithm-these results suggest that the near-equilibrium theory should be a good approximation for some of the biochemical reactions. © 2011 Elsevier Inc. All rights reserved.

Strategy-Driven Exploration for Rule-Based Models of Biochemical Systems with Porgy

OpenAIRE

Andrei , Oana; Fernández , Maribel; Kirchner , Hélène; Pinaud , Bruno

2016-01-01

This paper presents Porgy – an interactive visual environment for rule-based modelling of biochemical systems. We model molecules and molecule interactions as port graphs and port graph rewrite rules, respectively. We use rewriting strategies to control which rules to apply, and where and when to apply them. Our main contributions to rule-based modelling of biochemical systems lie in the strategy language and the associated visual and interactive features offered by Porgy. These features faci...

Modelling biochemical reaction systems by stochastic differential equations with reflection.

Science.gov (United States)

Niu, Yuanling; Burrage, Kevin; Chen, Luonan

2016-05-07

In this paper, we gave a new framework for modelling and simulating biochemical reaction systems by stochastic differential equations with reflection not in a heuristic way but in a mathematical way. The model is computationally efficient compared with the discrete-state Markov chain approach, and it ensures that both analytic and numerical solutions remain in a biologically plausible region. Specifically, our model mathematically ensures that species numbers lie in the domain D, which is a physical constraint for biochemical reactions, in contrast to the previous models. The domain D is actually obtained according to the structure of the corresponding chemical Langevin equations, i.e., the boundary is inherent in the biochemical reaction system. A variant of projection method was employed to solve the reflected stochastic differential equation model, and it includes three simple steps, i.e., Euler-Maruyama method was applied to the equations first, and then check whether or not the point lies within the domain D, and if not perform an orthogonal projection. It is found that the projection onto the closure D¯ is the solution to a convex quadratic programming problem. Thus, existing methods for the convex quadratic programming problem can be employed for the orthogonal projection map. Numerical tests on several important problems in biological systems confirmed the efficiency and accuracy of this approach. Copyright © 2016 Elsevier Ltd. All rights reserved.

Estimating Biochemical Parameters of Tea (camellia Sinensis (L.)) Using Hyperspectral Techniques

Science.gov (United States)

Bian, M.; Skidmore, A. K.; Schlerf, M.; Liu, Y.; Wang, T.

2012-07-01

Tea (Camellia Sinensis (L.)) is an important economic crop and the market price of tea depends largely on its quality. This research aims to explore the potential of hyperspectral remote sensing on predicting the concentration of biochemical components, namely total tea polyphenols, as indicators of tea quality at canopy scale. Experiments were carried out for tea plants growing in the field and greenhouse. Partial least squares regression (PLSR), which has proven to be the one of the most successful empirical approach, was performed to establish the relationship between reflectance and biochemical concentration across six tea varieties in the field. Moreover, a novel integrated approach involving successive projections algorithms as band selection method and neural networks was developed and applied to detect the concentration of total tea polyphenols for one tea variety, in order to explore and model complex nonlinearity relationships between independent (wavebands) and dependent (biochemicals) variables. The good prediction accuracies (r2 > 0.8 and relative RMSEP < 10 %) achieved for tea plants using both linear (partial lease squares regress) and nonlinear (artificial neural networks) modelling approaches in this study demonstrates the feasibility of using airborne and spaceborne sensors to cover wide areas of tea plantation for in situ monitoring of tea quality cheaply and rapidly.

HRSSA – Efficient hybrid stochastic simulation for spatially homogeneous biochemical reaction networks

International Nuclear Information System (INIS)

Marchetti, Luca; Priami, Corrado; Thanh, Vo Hong

2016-01-01

This paper introduces HRSSA (Hybrid Rejection-based Stochastic Simulation Algorithm), a new efficient hybrid stochastic simulation algorithm for spatially homogeneous biochemical reaction networks. HRSSA is built on top of RSSA, an exact stochastic simulation algorithm which relies on propensity bounds to select next reaction firings and to reduce the average number of reaction propensity updates needed during the simulation. HRSSA exploits the computational advantage of propensity bounds to manage time-varying transition propensities and to apply dynamic partitioning of reactions, which constitute the two most significant bottlenecks of hybrid simulation. A comprehensive set of simulation benchmarks is provided for evaluating performance and accuracy of HRSSA against other state of the art algorithms.

HRSSA – Efficient hybrid stochastic simulation for spatially homogeneous biochemical reaction networks

Energy Technology Data Exchange (ETDEWEB)

Marchetti, Luca, E-mail: marchetti@cosbi.eu [The Microsoft Research – University of Trento Centre for Computational and Systems Biology (COSBI), Piazza Manifattura, 1, 38068 Rovereto (Italy); Priami, Corrado, E-mail: priami@cosbi.eu [The Microsoft Research – University of Trento Centre for Computational and Systems Biology (COSBI), Piazza Manifattura, 1, 38068 Rovereto (Italy); University of Trento, Department of Mathematics (Italy); Thanh, Vo Hong, E-mail: vo@cosbi.eu [The Microsoft Research – University of Trento Centre for Computational and Systems Biology (COSBI), Piazza Manifattura, 1, 38068 Rovereto (Italy)

2016-07-15

This paper introduces HRSSA (Hybrid Rejection-based Stochastic Simulation Algorithm), a new efficient hybrid stochastic simulation algorithm for spatially homogeneous biochemical reaction networks. HRSSA is built on top of RSSA, an exact stochastic simulation algorithm which relies on propensity bounds to select next reaction firings and to reduce the average number of reaction propensity updates needed during the simulation. HRSSA exploits the computational advantage of propensity bounds to manage time-varying transition propensities and to apply dynamic partitioning of reactions, which constitute the two most significant bottlenecks of hybrid simulation. A comprehensive set of simulation benchmarks is provided for evaluating performance and accuracy of HRSSA against other state of the art algorithms.

Logic-based models in systems biology: a predictive and parameter-free network analysis method.

Science.gov (United States)

Wynn, Michelle L; Consul, Nikita; Merajver, Sofia D; Schnell, Santiago

2012-11-01

Highly complex molecular networks, which play fundamental roles in almost all cellular processes, are known to be dysregulated in a number of diseases, most notably in cancer. As a consequence, there is a critical need to develop practical methodologies for constructing and analysing molecular networks at a systems level. Mathematical models built with continuous differential equations are an ideal methodology because they can provide a detailed picture of a network's dynamics. To be predictive, however, differential equation models require that numerous parameters be known a priori and this information is almost never available. An alternative dynamical approach is the use of discrete logic-based models that can provide a good approximation of the qualitative behaviour of a biochemical system without the burden of a large parameter space. Despite their advantages, there remains significant resistance to the use of logic-based models in biology. Here, we address some common concerns and provide a brief tutorial on the use of logic-based models, which we motivate with biological examples.

A coupled mechano-biochemical model for bone adaptation

Czech Academy of Sciences Publication Activity Database

Klika, Václav; Pérez, M. A.; García-Aznar, J. M.; Maršík, F.; Doblaré, M.

2014-01-01

Roč. 69, 6-7 (2014), s. 1383-1429 ISSN 0303-6812 Institutional support: RVO:61388998 Keywords : mechano-biochemical model * bone remodelling * BMU Subject RIV: BJ - Thermodynamics Impact factor: 1.846, year: 2014 http://link.springer.com/article/10.1007%2Fs00285-013-0736-9

Meta-stochastic simulation of biochemical models for systems and synthetic biology.

Science.gov (United States)

Sanassy, Daven; Widera, Paweł; Krasnogor, Natalio

2015-01-16

Stochastic simulation algorithms (SSAs) are used to trace realistic trajectories of biochemical systems at low species concentrations. As the complexity of modeled biosystems increases, it is important to select the best performing SSA. Numerous improvements to SSAs have been introduced but they each only tend to apply to a certain class of models. This makes it difficult for a systems or synthetic biologist to decide which algorithm to employ when confronted with a new model that requires simulation. In this paper, we demonstrate that it is possible to determine which algorithm is best suited to simulate a particular model and that this can be predicted a priori to algorithm execution. We present a Web based tool ssapredict that allows scientists to upload a biochemical model and obtain a prediction of the best performing SSA. Furthermore, ssapredict gives the user the option to download our high performance simulator ngss preconfigured to perform the simulation of the queried biochemical model with the predicted fastest algorithm as the simulation engine. The ssapredict Web application is available at http://ssapredict.ico2s.org. It is free software and its source code is distributed under the terms of the GNU Affero General Public License.

Modeling delay in genetic networks: from delay birth-death processes to delay stochastic differential equations.

Science.gov (United States)

Gupta, Chinmaya; López, José Manuel; Azencott, Robert; Bennett, Matthew R; Josić, Krešimir; Ott, William

2014-05-28

Delay is an important and ubiquitous aspect of many biochemical processes. For example, delay plays a central role in the dynamics of genetic regulatory networks as it stems from the sequential assembly of first mRNA and then protein. Genetic regulatory networks are therefore frequently modeled as stochastic birth-death processes with delay. Here, we examine the relationship between delay birth-death processes and their appropriate approximating delay chemical Langevin equations. We prove a quantitative bound on the error between the pathwise realizations of these two processes. Our results hold for both fixed delay and distributed delay. Simulations demonstrate that the delay chemical Langevin approximation is accurate even at moderate system sizes. It captures dynamical features such as the oscillatory behavior in negative feedback circuits, cross-correlations between nodes in a network, and spatial and temporal information in two commonly studied motifs of metastability in biochemical systems. Overall, these results provide a foundation for using delay stochastic differential equations to approximate the dynamics of birth-death processes with delay.

Modeling delay in genetic networks: From delay birth-death processes to delay stochastic differential equations

Energy Technology Data Exchange (ETDEWEB)

Gupta, Chinmaya; López, José Manuel; Azencott, Robert; Ott, William [Department of Mathematics, University of Houston, Houston, Texas 77004 (United States); Bennett, Matthew R. [Department of Biochemistry and Cell Biology, Rice University, Houston, Texas 77204, USA and Institute of Biosciences and Bioengineering, Rice University, Houston, Texas 77005 (United States); Josić, Krešimir [Department of Mathematics, University of Houston, Houston, Texas 77004 (United States); Department of Biology and Biochemistry, University of Houston, Houston, Texas 77204 (United States)

2014-05-28

Delay is an important and ubiquitous aspect of many biochemical processes. For example, delay plays a central role in the dynamics of genetic regulatory networks as it stems from the sequential assembly of first mRNA and then protein. Genetic regulatory networks are therefore frequently modeled as stochastic birth-death processes with delay. Here, we examine the relationship between delay birth-death processes and their appropriate approximating delay chemical Langevin equations. We prove a quantitative bound on the error between the pathwise realizations of these two processes. Our results hold for both fixed delay and distributed delay. Simulations demonstrate that the delay chemical Langevin approximation is accurate even at moderate system sizes. It captures dynamical features such as the oscillatory behavior in negative feedback circuits, cross-correlations between nodes in a network, and spatial and temporal information in two commonly studied motifs of metastability in biochemical systems. Overall, these results provide a foundation for using delay stochastic differential equations to approximate the dynamics of birth-death processes with delay.

Modeling delay in genetic networks: From delay birth-death processes to delay stochastic differential equations

International Nuclear Information System (INIS)

Gupta, Chinmaya; López, José Manuel; Azencott, Robert; Ott, William; Bennett, Matthew R.; Josić, Krešimir

2014-01-01

Delay is an important and ubiquitous aspect of many biochemical processes. For example, delay plays a central role in the dynamics of genetic regulatory networks as it stems from the sequential assembly of first mRNA and then protein. Genetic regulatory networks are therefore frequently modeled as stochastic birth-death processes with delay. Here, we examine the relationship between delay birth-death processes and their appropriate approximating delay chemical Langevin equations. We prove a quantitative bound on the error between the pathwise realizations of these two processes. Our results hold for both fixed delay and distributed delay. Simulations demonstrate that the delay chemical Langevin approximation is accurate even at moderate system sizes. It captures dynamical features such as the oscillatory behavior in negative feedback circuits, cross-correlations between nodes in a network, and spatial and temporal information in two commonly studied motifs of metastability in biochemical systems. Overall, these results provide a foundation for using delay stochastic differential equations to approximate the dynamics of birth-death processes with delay

Modeling the citation network by network cosmology.

Science.gov (United States)

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

2015-01-01

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

River water quality model no. 1 (RWQM1): II. Biochemical process equations

DEFF Research Database (Denmark)

Reichert, P.; Borchardt, D.; Henze, Mogens

2001-01-01

In this paper, biochemical process equations are presented as a basis for water quality modelling in rivers under aerobic and anoxic conditions. These equations are not new, but they summarise parts of the development over the past 75 years. The primary goals of the presentation are to stimulate...... transformation processes. This paper is part of a series of three papers. In the first paper, the general modelling approach is described; in the present paper, the biochemical process equations of a complex model are presented; and in the third paper, recommendations are given for the selection of a reasonable...

Prediction of bakery products nutritive value based on mathematical modeling of biochemical reactions

Directory of Open Access Journals (Sweden)

E. I. Ponomareva

2013-01-01

Full Text Available Researches are devoted to identifying changes in the chemical composition of whole-grain wheat bread during baking and to forecasting of food value of bakery products by mathematical modeling of biochemical transformations. The received model represents the invariant composition, considering speed of biochemical reactions at a batch of bakery products, and allowing conduct virtual experiments to develop new types of bread for various categories of the population, including athletes. The offered way of modeling of biochemical transformations at a stage of heat treatment allows to predict food value of bakery products, without spending funds for raw materials and large volume of experiment that will provide possibility of economy of material resources at a stage of development of new types of bakery products and possibility of production efficiency increase.

Modelling computer networks

International Nuclear Information System (INIS)

Max, G

2011-01-01

Traffic models in computer networks can be described as a complicated system. These systems show non-linear features and to simulate behaviours of these systems are also difficult. Before implementing network equipments users wants to know capability of their computer network. They do not want the servers to be overloaded during temporary traffic peaks when more requests arrive than the server is designed for. As a starting point for our study a non-linear system model of network traffic is established to exam behaviour of the network planned. The paper presents setting up a non-linear simulation model that helps us to observe dataflow problems of the networks. This simple model captures the relationship between the competing traffic and the input and output dataflow. In this paper, we also focus on measuring the bottleneck of the network, which was defined as the difference between the link capacity and the competing traffic volume on the link that limits end-to-end throughput. We validate the model using measurements on a working network. The results show that the initial model estimates well main behaviours and critical parameters of the network. Based on this study, we propose to develop a new algorithm, which experimentally determines and predict the available parameters of the network modelled.

Elastic Network Model of a Nuclear Transport Complex

Science.gov (United States)

Ryan, Patrick; Liu, Wing K.; Lee, Dockjin; Seo, Sangjae; Kim, Young-Jin; Kim, Moon K.

2010-05-01

The structure of Kap95p was obtained from the Protein Data Bank (www.pdb.org) and analyzed RanGTP plays an important role in both nuclear protein import and export cycles. In the nucleus, RanGTP releases macromolecular cargoes from importins and conversely facilitates cargo binding to exportins. Although the crystal structure of the nuclear import complex formed by importin Kap95p and RanGTP was recently identified, its molecular mechanism still remains unclear. To understand the relationship between structure and function of a nuclear transport complex, a structure-based mechanical model of Kap95p:RanGTP complex is introduced. In this model, a protein structure is simply modeled as an elastic network in which a set of coarse-grained point masses are connected by linear springs representing biochemical interactions at atomic level. Harmonic normal mode analysis (NMA) and anharmonic elastic network interpolation (ENI) are performed to predict the modes of vibrations and a feasible pathway between locked and unlocked conformations of Kap95p, respectively. Simulation results imply that the binding of RanGTP to Kap95p induces the release of the cargo in the nucleus as well as prevents any new cargo from attaching to the Kap95p:RanGTP complex.

Model based design of biochemical micro-reactors

Directory of Open Access Journals (Sweden)

Tobias eElbinger

2016-02-01

Full Text Available Mathematical modelling of biochemical pathways is an important resource in Synthetic Biology, as the predictive power of simulating synthetic pathways represents an important step in the design of synthetic metabolons. In this paper, we are concerned with the mathematical modeling, simulation and optimization of metabolic processes in biochemical micro-reactors able to carry out enzymatic reactions and to exchange metabolites with their surrounding medium. The results of the reported modeling approach are incorporated in the design of the first micro-reactor prototypes that are under construction. These microreactors consist of compartments separated by membranes carrying specific transporters for the input of substrates and export of products. Inside the compartments multi-enzyme complexes assembled on nano-beads by peptide adapters are used to carry out metabolic reactions.The spatially resolved mathematical model describing the ongoing processes consists of a system of diffusion equations together with boundary and initial conditions. The boundary conditions model the exchange of metabolites with the neighboring compartments and the reactions at the surface of the nano-beads carrying the multi-enzyme complexes. Efficient and accurate approaches for numerical simulation of the mathematical model and for optimal design of the micro-reactor are developed. As a proof-of-concept scenario, a synthetic pathway for the conversion of sucrose to glucose-6-phosphate (G6P was chosen. In this context, the mathematical model is employed to compute the spatio-temporal distributions of the metabolite concentrations, as well as application relevant quantities like the outflow rate of G6P. These computations are performed for different scenarios, where the number of beads as well as their loading capacity are varied. The computed metabolite distributions show spatial patterns which differ for different experimental arrangements. Furthermore, the total output

Complexity of generic biochemical circuits: topology versus strength of interactions

Science.gov (United States)

Tikhonov, Mikhail; Bialek, William

2016-12-01

The historical focus on network topology as a determinant of biological function is still largely maintained today, illustrated by the rise of structure-only approaches to network analysis. However, biochemical circuits and genetic regulatory networks are defined both by their topology and by a multitude of continuously adjustable parameters, such as the strength of interactions between nodes, also recognized as important. Here we present a class of simple perceptron-based Boolean models within which comparing the relative importance of topology versus interaction strengths becomes a quantitatively well-posed problem. We quantify the intuition that for generic networks, optimization of interaction strengths is a crucial ingredient of achieving high complexity, defined here as the number of fixed points the network can accommodate. We propose a new methodology for characterizing the relative role of parameter optimization for topologies of a given class.

Microalgal Metabolic Network Model Refinement through High-Throughput Functional Metabolic Profiling

International Nuclear Information System (INIS)

Chaiboonchoe, Amphun; Dohai, Bushra Saeed; Cai, Hong; Nelson, David R.; Jijakli, Kenan; Salehi-Ashtiani, Kourosh

2014-01-01

Metabolic modeling provides the means to define metabolic processes at a systems level; however, genome-scale metabolic models often remain incomplete in their description of metabolic networks and may include reactions that are experimentally unverified. This shortcoming is exacerbated in reconstructed models of newly isolated algal species, as there may be little to no biochemical evidence available for the metabolism of such isolates. The phenotype microarray (PM) technology (Biolog, Hayward, CA, USA) provides an efficient, high-throughput method to functionally define cellular metabolic activities in response to a large array of entry metabolites. The platform can experimentally verify many of the unverified reactions in a network model as well as identify missing or new reactions in the reconstructed metabolic model. The PM technology has been used for metabolic phenotyping of non-photosynthetic bacteria and fungi, but it has not been reported for the phenotyping of microalgae. Here, we introduce the use of PM assays in a systematic way to the study of microalgae, applying it specifically to the green microalgal model species Chlamydomonas reinhardtii. The results obtained in this study validate a number of existing annotated metabolic reactions and identify a number of novel and unexpected metabolites. The obtained information was used to expand and refine the existing COBRA-based C. reinhardtii metabolic network model iRC1080. Over 254 reactions were added to the network, and the effects of these additions on flux distribution within the network are described. The novel reactions include the support of metabolism by a number of d-amino acids, l-dipeptides, and l-tripeptides as nitrogen sources, as well as support of cellular respiration by cysteamine-S-phosphate as a phosphorus source. The protocol developed here can be used as a foundation to functionally profile other microalgae such as known microalgae mutants and novel isolates.

Microalgal Metabolic Network Model Refinement through High-Throughput Functional Metabolic Profiling

Energy Technology Data Exchange (ETDEWEB)

Chaiboonchoe, Amphun; Dohai, Bushra Saeed; Cai, Hong; Nelson, David R. [Division of Science and Math, New York University Abu Dhabi, Abu Dhabi (United Arab Emirates); Center for Genomics and Systems Biology (CGSB), New York University Abu Dhabi Institute, Abu Dhabi (United Arab Emirates); Jijakli, Kenan [Division of Science and Math, New York University Abu Dhabi, Abu Dhabi (United Arab Emirates); Center for Genomics and Systems Biology (CGSB), New York University Abu Dhabi Institute, Abu Dhabi (United Arab Emirates); Engineering Division, Biofinery, Manhattan, KS (United States); Salehi-Ashtiani, Kourosh, E-mail: ksa3@nyu.edu [Division of Science and Math, New York University Abu Dhabi, Abu Dhabi (United Arab Emirates); Center for Genomics and Systems Biology (CGSB), New York University Abu Dhabi Institute, Abu Dhabi (United Arab Emirates)

2014-12-10

Metabolic modeling provides the means to define metabolic processes at a systems level; however, genome-scale metabolic models often remain incomplete in their description of metabolic networks and may include reactions that are experimentally unverified. This shortcoming is exacerbated in reconstructed models of newly isolated algal species, as there may be little to no biochemical evidence available for the metabolism of such isolates. The phenotype microarray (PM) technology (Biolog, Hayward, CA, USA) provides an efficient, high-throughput method to functionally define cellular metabolic activities in response to a large array of entry metabolites. The platform can experimentally verify many of the unverified reactions in a network model as well as identify missing or new reactions in the reconstructed metabolic model. The PM technology has been used for metabolic phenotyping of non-photosynthetic bacteria and fungi, but it has not been reported for the phenotyping of microalgae. Here, we introduce the use of PM assays in a systematic way to the study of microalgae, applying it specifically to the green microalgal model species Chlamydomonas reinhardtii. The results obtained in this study validate a number of existing annotated metabolic reactions and identify a number of novel and unexpected metabolites. The obtained information was used to expand and refine the existing COBRA-based C. reinhardtii metabolic network model iRC1080. Over 254 reactions were added to the network, and the effects of these additions on flux distribution within the network are described. The novel reactions include the support of metabolism by a number of d-amino acids, l-dipeptides, and l-tripeptides as nitrogen sources, as well as support of cellular respiration by cysteamine-S-phosphate as a phosphorus source. The protocol developed here can be used as a foundation to functionally profile other microalgae such as known microalgae mutants and novel isolates.

Brain Network Modelling

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

Collaborative networks: Reference modeling

NARCIS (Netherlands)

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

Improved methods for the mathematically controlled comparison of biochemical systems

Directory of Open Access Journals (Sweden)

Schwacke John H

2004-06-01

Full Text Available Abstract The method of mathematically controlled comparison provides a structured approach for the comparison of alternative biochemical pathways with respect to selected functional effectiveness measures. Under this approach, alternative implementations of a biochemical pathway are modeled mathematically, forced to be equivalent through the application of selected constraints, and compared with respect to selected functional effectiveness measures. While the method has been applied successfully in a variety of studies, we offer recommendations for improvements to the method that (1 relax requirements for definition of constraints sufficient to remove all degrees of freedom in forming the equivalent alternative, (2 facilitate generalization of the results thus avoiding the need to condition those findings on the selected constraints, and (3 provide additional insights into the effect of selected constraints on the functional effectiveness measures. We present improvements to the method and related statistical models, apply the method to a previously conducted comparison of network regulation in the immune system, and compare our results to those previously reported.

Network Thermodynamic Curation of Human and Yeast Genome-Scale Metabolic Models

Science.gov (United States)

Martínez, Verónica S.; Quek, Lake-Ee; Nielsen, Lars K.

2014-01-01

Genome-scale models are used for an ever-widening range of applications. Although there has been much focus on specifying the stoichiometric matrix, the predictive power of genome-scale models equally depends on reaction directions. Two-thirds of reactions in the two eukaryotic reconstructions Homo sapiens Recon 1 and Yeast 5 are specified as irreversible. However, these specifications are mainly based on biochemical textbooks or on their similarity to other organisms and are rarely underpinned by detailed thermodynamic analysis. In this study, a to our knowledge new workflow combining network-embedded thermodynamic and flux variability analysis was used to evaluate existing irreversibility constraints in Recon 1 and Yeast 5 and to identify new ones. A total of 27 and 16 new irreversible reactions were identified in Recon 1 and Yeast 5, respectively, whereas only four reactions were found with directions incorrectly specified against thermodynamics (three in Yeast 5 and one in Recon 1). The workflow further identified for both models several isolated internal loops that require further curation. The framework also highlighted the need for substrate channeling (in human) and ATP hydrolysis (in yeast) for the essential reaction catalyzed by phosphoribosylaminoimidazole carboxylase in purine metabolism. Finally, the framework highlighted differences in proline metabolism between yeast (cytosolic anabolism and mitochondrial catabolism) and humans (exclusively mitochondrial metabolism). We conclude that network-embedded thermodynamics facilitates the specification and validation of irreversibility constraints in compartmentalized metabolic models, at the same time providing further insight into network properties. PMID:25028891

Logic-based models in systems biology: a predictive and parameter-free network analysis method†

Science.gov (United States)

Wynn, Michelle L.; Consul, Nikita; Merajver, Sofia D.

2012-01-01

Highly complex molecular networks, which play fundamental roles in almost all cellular processes, are known to be dysregulated in a number of diseases, most notably in cancer. As a consequence, there is a critical need to develop practical methodologies for constructing and analysing molecular networks at a systems level. Mathematical models built with continuous differential equations are an ideal methodology because they can provide a detailed picture of a network’s dynamics. To be predictive, however, differential equation models require that numerous parameters be known a priori and this information is almost never available. An alternative dynamical approach is the use of discrete logic-based models that can provide a good approximation of the qualitative behaviour of a biochemical system without the burden of a large parameter space. Despite their advantages, there remains significant resistance to the use of logic-based models in biology. Here, we address some common concerns and provide a brief tutorial on the use of logic-based models, which we motivate with biological examples. PMID:23072820

A neighbourhood evolving network model

International Nuclear Information System (INIS)

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

2006-01-01

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

Development of Computer Aided Modelling Templates for Model Re-use in Chemical and Biochemical Process and Product Design: Importand export of models

DEFF Research Database (Denmark)

Fedorova, Marina; Tolksdorf, Gregor; Fillinger, Sandra

2015-01-01

been established, in order to provide a wider range of modelling capabilities. Through this link, developed models can be exported/imported to/from other modelling-simulation software environments to allow model reusability in chemical and biochemical product and process design. The use of this link...

Specification, construction, and exact reduction of state transition system models of biochemical processes.

Science.gov (United States)

Bugenhagen, Scott M; Beard, Daniel A

2012-10-21

Biochemical reaction systems may be viewed as discrete event processes characterized by a number of states and state transitions. These systems may be modeled as state transition systems with transitions representing individual reaction events. Since they often involve a large number of interactions, it can be difficult to construct such a model for a system, and since the resulting state-level model can involve a huge number of states, model analysis can be difficult or impossible. Here, we describe methods for the high-level specification of a system using hypergraphs, for the automated generation of a state-level model from a high-level model, and for the exact reduction of a state-level model using information from the high-level model. Exact reduction is achieved through the automated application to the high-level model of the symmetry reduction technique and reduction by decomposition by independent subsystems, allowing potentially significant reductions without the need to generate a full model. The application of the method to biochemical reaction systems is illustrated by models describing a hypothetical ion-channel at several levels of complexity. The method allows for the reduction of the otherwise intractable example models to a manageable size.

Telecommunications network modelling, planning and design

CERN Document Server

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.

Patterns of Stochastic Behavior in Dynamically Unstable High-Dimensional Biochemical Networks

Directory of Open Access Journals (Sweden)

Simon Rosenfeld

2009-01-01

Full Text Available The question of dynamical stability and stochastic behavior of large biochemical networks is discussed. It is argued that stringent conditions of asymptotic stability have very little chance to materialize in a multidimensional system described by the differential equations of chemical kinetics. The reason is that the criteria of asymptotic stability (Routh- Hurwitz, Lyapunov criteria, Feinberg’s Deficiency Zero theorem would impose the limitations of very high algebraic order on the kinetic rates and stoichiometric coefficients, and there are no natural laws that would guarantee their unconditional validity. Highly nonlinear, dynamically unstable systems, however, are not necessarily doomed to collapse, as a simple Jacobian analysis would suggest. It is possible that their dynamics may assume the form of pseudo-random fluctuations quite similar to a shot noise, and, therefore, their behavior may be described in terms of Langevin and Fokker-Plank equations. We have shown by simulation that the resulting pseudo-stochastic processes obey the heavy-tailed Generalized Pareto Distribution with temporal sequence of pulses forming the set of constituent-specific Poisson processes. Being applied to intracellular dynamics, these properties are naturally associated with burstiness, a well documented phenomenon in the biology of gene expression.

Metabolic network modeling of microbial interactions in natural and engineered environmental systems

Directory of Open Access Journals (Sweden)

Octavio ePerez-Garcia

2016-05-01

Full Text Available We review approaches to characterize metabolic interactions within microbial communities using Stoichiometric Metabolic Network (SMN models for applications in environmental and industrial biotechnology. SMN models are computational tools used to evaluate the metabolic engineering potential of various organisms. They have successfully been applied to design and optimize the microbial production of antibiotics, alcohols and amino acids by single strains. To date however, such models have been rarely applied to analyze and control the metabolism of more complex microbial communities. This is largely attributed to the diversity of microbial community functions, metabolisms and interactions. Here, we firstly review different types of microbial interaction and describe their relevance for natural and engineered environmental processes. Next, we provide a general description of the essential methods of the SMN modeling workflow including the steps of network reconstruction, simulation through Flux Balance Analysis (FBA, experimental data gathering, and model calibration. Then we broadly describe and compare four approaches to model microbial interactions using metabolic networks, i.e. i lumped networks, ii compartment per guild networks, iii bi-level optimization simulations and iv dynamic-SMN methods. These approaches can be used to integrate and analyze diverse microbial physiology, ecology and molecular community data. All of them (except the lumped approach are suitable for incorporating species abundance data but so far they have been used only to model simple communities of two to eight different species. Interactions based on substrate exchange and competition can be directly modeled using the above approaches. However, interactions based on metabolic feedbacks, such as product inhibition and synthropy require extensions to current models, incorporating gene regulation and compounding accumulation mechanisms. SMN models of microbial

Network thermodynamic curation of human and yeast genome-scale metabolic models.

Science.gov (United States)

Martínez, Verónica S; Quek, Lake-Ee; Nielsen, Lars K

2014-07-15

Genome-scale models are used for an ever-widening range of applications. Although there has been much focus on specifying the stoichiometric matrix, the predictive power of genome-scale models equally depends on reaction directions. Two-thirds of reactions in the two eukaryotic reconstructions Homo sapiens Recon 1 and Yeast 5 are specified as irreversible. However, these specifications are mainly based on biochemical textbooks or on their similarity to other organisms and are rarely underpinned by detailed thermodynamic analysis. In this study, a to our knowledge new workflow combining network-embedded thermodynamic and flux variability analysis was used to evaluate existing irreversibility constraints in Recon 1 and Yeast 5 and to identify new ones. A total of 27 and 16 new irreversible reactions were identified in Recon 1 and Yeast 5, respectively, whereas only four reactions were found with directions incorrectly specified against thermodynamics (three in Yeast 5 and one in Recon 1). The workflow further identified for both models several isolated internal loops that require further curation. The framework also highlighted the need for substrate channeling (in human) and ATP hydrolysis (in yeast) for the essential reaction catalyzed by phosphoribosylaminoimidazole carboxylase in purine metabolism. Finally, the framework highlighted differences in proline metabolism between yeast (cytosolic anabolism and mitochondrial catabolism) and humans (exclusively mitochondrial metabolism). We conclude that network-embedded thermodynamics facilitates the specification and validation of irreversibility constraints in compartmentalized metabolic models, at the same time providing further insight into network properties. Copyright © 2014 Biophysical Society. Published by Elsevier Inc. All rights reserved.

Coevolutionary modeling in network formation

KAUST Repository

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.

Coevolutionary modeling in network formation

KAUST Repository

Al-Shyoukh, Ibrahim; Chasparis, Georgios; Shamma, Jeff S.

2014-01-01

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.

Chemical networks with inflows and outflows: a positive linear differential inclusions approach.

Science.gov (United States)

Angeli, David; De Leenheer, Patrick; Sontag, Eduardo D

2009-01-01

Certain mass-action kinetics models of biochemical reaction networks, although described by nonlinear differential equations, may be partially viewed as state-dependent linear time-varying systems, which in turn may be modeled by convex compact valued positive linear differential inclusions. A result is provided on asymptotic stability of such inclusions, and applied to a ubiquitous biochemical reaction network with inflows and outflows, known as the futile cycle. We also provide a characterization of exponential stability of general homogeneous switched systems which is not only of interest in itself, but also plays a role in the analysis of the futile cycle. 2009 American Institute of Chemical Engineers

Modeling online social signed networks

Science.gov (United States)

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

2018-04-01

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

Estimation of parameter sensitivities for stochastic reaction networks

KAUST Repository

Gupta, Ankit

2016-01-01

Quantification of the effects of parameter uncertainty is an important and challenging problem in Systems Biology. We consider this problem in the context of stochastic models of biochemical reaction networks where the dynamics is described as a

Statistical Models for Social Networks

NARCIS (Netherlands)

Snijders, Tom A. B.; Cook, KS; Massey, DS

2011-01-01

Statistical models for social networks as dependent variables must represent the typical network dependencies between tie variables such as reciprocity, homophily, transitivity, etc. This review first treats models for single (cross-sectionally observed) networks and then for network dynamics. For

A case study of evolutionary computation of biochemical adaptation

International Nuclear Information System (INIS)

François, Paul; Siggia, Eric D

2008-01-01

Simulations of evolution have a long history, but their relation to biology is questioned because of the perceived contingency of evolution. Here we provide an example of a biological process, adaptation, where simulations are argued to approach closer to biology. Adaptation is a common feature of sensory systems, and a plausible component of other biochemical networks because it rescales upstream signals to facilitate downstream processing. We create random gene networks numerically, by linking genes with interactions that model transcription, phosphorylation and protein–protein association. We define a fitness function for adaptation in terms of two functional metrics, and show that any reasonable combination of them will yield the same adaptive networks after repeated rounds of mutation and selection. Convergence to these networks is driven by positive selection and thus fast. There is always a path in parameter space of continuously improving fitness that leads to perfect adaptation, implying that the actual mutation rates we use in the simulation do not bias the results. Our results imply a kinetic view of evolution, i.e., it favors gene networks that can be learned quickly from the random examples supplied by mutation. This formulation allows for deductive predictions of the networks realized in nature

Biochemical transport modeling, estimation, and detection in realistic environments

Science.gov (United States)

Ortner, Mathias; Nehorai, Arye

2006-05-01

Early detection and estimation of the spread of a biochemical contaminant are major issues for homeland security applications. We present an integrated approach combining the measurements given by an array of biochemical sensors with a physical model of the dispersion and statistical analysis to solve these problems and provide system performance measures. We approximate the dispersion model of the contaminant in a realistic environment through numerical simulations of reflected stochastic diffusions describing the microscopic transport phenomena due to wind and chemical diffusion using the Feynman-Kac formula. We consider arbitrary complex geometries and account for wind turbulence. Localizing the dispersive sources is useful for decontamination purposes and estimation of the cloud evolution. To solve the associated inverse problem, we propose a Bayesian framework based on a random field that is particularly powerful for localizing multiple sources with small amounts of measurements. We also develop a sequential detector using the numerical transport model we propose. Sequential detection allows on-line analysis and detecting wether a change has occurred. We first focus on the formulation of a suitable sequential detector that overcomes the presence of unknown parameters (e.g. release time, intensity and location). We compute a bound on the expected delay before false detection in order to decide the threshold of the test. For a fixed false-alarm rate, we obtain the detection probability of a substance release as a function of its location and initial concentration. Numerical examples are presented for two real-world scenarios: an urban area and an indoor ventilation duct.

Agent-based modeling and network dynamics

CERN Document Server

Namatame, Akira

2016-01-01

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

Efficient Characterization of Parametric Uncertainty of Complex (Biochemical Networks.

Directory of Open Access Journals (Sweden)

Claudia Schillings

2015-08-01

Full Text Available Parametric uncertainty is a particularly challenging and relevant aspect of systems analysis in domains such as systems biology where, both for inference and for assessing prediction uncertainties, it is essential to characterize the system behavior globally in the parameter space. However, current methods based on local approximations or on Monte-Carlo sampling cope only insufficiently with high-dimensional parameter spaces associated with complex network models. Here, we propose an alternative deterministic methodology that relies on sparse polynomial approximations. We propose a deterministic computational interpolation scheme which identifies most significant expansion coefficients adaptively. We present its performance in kinetic model equations from computational systems biology with several hundred parameters and state variables, leading to numerical approximations of the parametric solution on the entire parameter space. The scheme is based on adaptive Smolyak interpolation of the parametric solution at judiciously and adaptively chosen points in parameter space. As Monte-Carlo sampling, it is "non-intrusive" and well-suited for massively parallel implementation, but affords higher convergence rates. This opens up new avenues for large-scale dynamic network analysis by enabling scaling for many applications, including parameter estimation, uncertainty quantification, and systems design.

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...... the SID model’s behavior and impact on the network performance, as well as the severity of the infection spreading. The simulations are carried out in OPNET Modeler. The model provides an important input to epidemic connection recovery mechanisms, and can due to its flexibility and versatility be used...... to evaluate multiple epidemic scenarios in various network types....

Modeling the relationships between quality and biochemical composition of fatty liver in mule ducks.

Science.gov (United States)

Theron, L; Cullere, M; Bouillier-Oudot, M; Manse, H; Dalle Zotte, A; Molette, C; Fernandez, X; Vitezica, Z G

2012-09-01

The fatty liver of mule ducks (i.e., French "foie gras") is the most valuable product in duck production systems. Its quality is measured by the technological yield, which is the opposite of the fat loss during cooking. The purpose of this study was to determine whether biochemical measures of fatty liver could be used to accurately predict the technological yield (TY). Ninety-one male mule ducks were bred, overfed, and slaughtered under commercial conditions. Fatty liver weight (FLW) and biochemical variables, such as DM, lipid (LIP), and protein content (PROT), were collected. To evaluate evidence for nonlinear fat loss during cooking, we compared regression models describing linear and nonlinear relations between biochemical measures and TY. We detected significantly greater (P = 0.02) linear relation between DM and TY. Our results indicate that LIP and PROT follow a different pattern (linear) than DM and showed that LIP and PROT are nonexclusive contributing factors to TY. Other components, such as carbohydrates, other than those measured in this study, could contribute to DM. Stepwise regression for TY was performed. The traditional model with FLW was tested. The results showed that the weight of the liver is of limited value in the determination of fat loss during cooking (R(2) = 0.14). The most accurate TY prediction equation included DM (in linear and quadratic terms), FLW, and PROT (R(2) = 0.43). Biochemical measures in the fatty liver were more accurate predictors of TY than FLW. The model is useful in commercial conditions because DM, PROT, and FLW are noninvasive measures.

Current approaches to gene regulatory network modelling

Directory of Open Access Journals (Sweden)

Brazma Alvis

2007-09-01

Full Text Available Abstract Many different approaches have been developed to model and simulate gene regulatory networks. We proposed the following categories for gene regulatory network models: network parts lists, network topology models, network control logic models, and dynamic models. Here we will describe some examples for each of these categories. We will study the topology of gene regulatory networks in yeast in more detail, comparing a direct network derived from transcription factor binding data and an indirect network derived from genome-wide expression data in mutants. Regarding the network dynamics we briefly describe discrete and continuous approaches to network modelling, then describe a hybrid model called Finite State Linear Model and demonstrate that some simple network dynamics can be simulated in this model.

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.

Training signaling pathway maps to biochemical data with constrained fuzzy logic: quantitative analysis of liver cell responses to inflammatory stimuli.

Directory of Open Access Journals (Sweden)

Melody K Morris

2011-03-01

Full Text Available Predictive understanding of cell signaling network operation based on general prior knowledge but consistent with empirical data in a specific environmental context is a current challenge in computational biology. Recent work has demonstrated that Boolean logic can be used to create context-specific network models by training proteomic pathway maps to dedicated biochemical data; however, the Boolean formalism is restricted to characterizing protein species as either fully active or inactive. To advance beyond this limitation, we propose a novel form of fuzzy logic sufficiently flexible to model quantitative data but also sufficiently simple to efficiently construct models by training pathway maps on dedicated experimental measurements. Our new approach, termed constrained fuzzy logic (cFL, converts a prior knowledge network (obtained from literature or interactome databases into a computable model that describes graded values of protein activation across multiple pathways. We train a cFL-converted network to experimental data describing hepatocytic protein activation by inflammatory cytokines and demonstrate the application of the resultant trained models for three important purposes: (a generating experimentally testable biological hypotheses concerning pathway crosstalk, (b establishing capability for quantitative prediction of protein activity, and (c prediction and understanding of the cytokine release phenotypic response. Our methodology systematically and quantitatively trains a protein pathway map summarizing curated literature to context-specific biochemical data. This process generates a computable model yielding successful prediction of new test data and offering biological insight into complex datasets that are difficult to fully analyze by intuition alone.

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

Science.gov (United States)

2015-03-16

sensitivity value was the maximum uncertainty in that value estimated by the Sobol method. 2.4. Global Sensitivity Analysis of the Reduced Order Coagulation...sensitivity analysis, using the variance-based method of Sobol , to estimate which parameters controlled the performance of the reduced order model [69]. We...Environment. Comput. Sci. Eng. 2007, 9, 90–95. 69. Sobol , I. Global sensitivity indices for nonlinear mathematical models and their Monte Carlo estimates

Biological transportation networks: Modeling and simulation

KAUST Repository

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.

Localized Modeling of Biochemical and Flow Interactions during Cancer Cell Adhesion.

Directory of Open Access Journals (Sweden)

Julie Behr

Full Text Available This work focuses on one component of a larger research effort to develop a simulation tool to model populations of flowing cells. Specifically, in this study a local model of the biochemical interactions between circulating melanoma tumor cells (TC and substrate adherent polymorphonuclear neutrophils (PMN is developed. This model provides realistic three-dimensional distributions of bond formation and attendant attraction and repulsion forces that are consistent with the time dependent Computational Fluid Dynamics (CFD framework of the full system model which accounts local pressure, shear and repulsion forces. The resulting full dynamics model enables exploration of TC adhesion to adherent PMNs, which is a known participating mechanism in melanoma cell metastasis. The model defines the adhesion molecules present on the TC and PMN cell surfaces, and calculates their interactions as the melanoma cell flows past the PMN. Biochemical rates of reactions between individual molecules are determined based on their local properties. The melanoma cell in the model expresses ICAM-1 molecules on its surface, and the PMN expresses the β-2 integrins LFA-1 and Mac-1. In this work the PMN is fixed to the substrate and is assumed fully rigid and of a prescribed shear-rate dependent shape obtained from micro-PIV experiments. The melanoma cell is transported with full six-degrees-of-freedom dynamics. Adhesion models, which represent the ability of molecules to bond and adhere the cells to each other, and repulsion models, which represent the various physical mechanisms of cellular repulsion, are incorporated with the CFD solver. All models are general enough to allow for future extensions, including arbitrary adhesion molecule types, and the ability to redefine the values of parameters to represent various cell types. The model presented in this study will be part of a clinical tool for development of personalized medical treatment programs.

Localized Modeling of Biochemical and Flow Interactions during Cancer Cell Adhesion.

Science.gov (United States)

Behr, Julie; Gaskin, Byron; Fu, Changliang; Dong, Cheng; Kunz, Robert

2015-01-01

This work focuses on one component of a larger research effort to develop a simulation tool to model populations of flowing cells. Specifically, in this study a local model of the biochemical interactions between circulating melanoma tumor cells (TC) and substrate adherent polymorphonuclear neutrophils (PMN) is developed. This model provides realistic three-dimensional distributions of bond formation and attendant attraction and repulsion forces that are consistent with the time dependent Computational Fluid Dynamics (CFD) framework of the full system model which accounts local pressure, shear and repulsion forces. The resulting full dynamics model enables exploration of TC adhesion to adherent PMNs, which is a known participating mechanism in melanoma cell metastasis. The model defines the adhesion molecules present on the TC and PMN cell surfaces, and calculates their interactions as the melanoma cell flows past the PMN. Biochemical rates of reactions between individual molecules are determined based on their local properties. The melanoma cell in the model expresses ICAM-1 molecules on its surface, and the PMN expresses the β-2 integrins LFA-1 and Mac-1. In this work the PMN is fixed to the substrate and is assumed fully rigid and of a prescribed shear-rate dependent shape obtained from micro-PIV experiments. The melanoma cell is transported with full six-degrees-of-freedom dynamics. Adhesion models, which represent the ability of molecules to bond and adhere the cells to each other, and repulsion models, which represent the various physical mechanisms of cellular repulsion, are incorporated with the CFD solver. All models are general enough to allow for future extensions, including arbitrary adhesion molecule types, and the ability to redefine the values of parameters to represent various cell types. The model presented in this study will be part of a clinical tool for development of personalized medical treatment programs.

Generalized Network Psychometrics : Combining Network and Latent Variable Models

NARCIS (Netherlands)

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

2017-01-01

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

Bistable responses in bacterial genetic networks: Designs and dynamical consequences

Science.gov (United States)

Tiwari, Abhinav; Ray, J. Christian J.; Narula, Jatin; Igoshin, Oleg A.

2011-01-01

A key property of living cells is their ability to react to stimuli with specific biochemical responses. These responses can be understood through the dynamics of underlying biochemical and genetic networks. Evolutionary design principles have been well studied in networks that display graded responses, with a continuous relationship between input signal and system output. Alternatively, biochemical networks can exhibit bistable responses so that over a range of signals the network possesses two stable steady states. In this review, we discuss several conceptual examples illustrating network designs that can result in a bistable response of the biochemical network. Next, we examine manifestations of these designs in bacterial master-regulatory genetic circuits. In particular, we discuss mechanisms and dynamic consequences of bistability in three circuits: two-component systems, sigma-factor networks, and a multistep phosphorelay. Analyzing these examples allows us to expand our knowledge of evolutionary design principles for networks with bistable responses. PMID:21385588

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

Science.gov (United States)

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

2013-11-01

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

Eight challenges for network epidemic models

Directory of Open Access Journals (Sweden)

Lorenzo Pellis

2015-03-01

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

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

Energy Technology Data Exchange (ETDEWEB)

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

2009-08-30

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

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

International Nuclear Information System (INIS)

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

2009-01-01

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

Brand Marketing Model on Social Networks

Directory of Open Access Journals (Sweden)

Jolita Jezukevičiūtė

2014-04-01

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

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...... to the suggestion of suitable network models. An existing model for flow control is presented and an inherent weakness is revealed and remedied. Examples are given and numerically analysed through deterministic network modelling. Results are presented to highlight the properties of the suggested models...

Modeling Network Interdiction Tasks

Science.gov (United States)

2015-09-17

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

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

CERN Document Server

Santi, Paolo

2012-01-01

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

Complex Networks in Psychological Models

Science.gov (United States)

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

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

Dust Fertilization of the Western Atlantic Biota: a Biochemical Model

Science.gov (United States)

Holmes, C. W.

2017-12-01

Every year an estimated 50 million tons of African dust reaches the Western Atlantic. This dust is composed of quartz sand, clay, and a mixture of quartz and clay particles agglutinated with micronutrient enriched ferruginous cement. However, whether it is friend or foe to biochemical systems is a matter of conjecture. Corals are ideal recorders of changing conditions as the layers can be dated so that the record of chemical changes is easily assessed. There is extensive shallow-and deep water coral development bordering the Florida Straits. The changes in trace element chemistry within these corals show a positive relationship with the African dust record. Recently, it has been demonstrated that many of the metals contained within the dust are necessary micronutrients in the fertilization of plankton. Using the results of these studies, a biochemical model has been constructed. This model suggests a path from inorganic dust through microbial transformation to micronutrient enzymes (i.e. Cd-enriched carbonic anahydrase) and carbonate precipitation on the Bahamian Banks. It is estimated that more than ten million metric tons of this fine, metal-rich sediment is formed each year. However, for much of this sediment, its deposition is temporary, as it is transported into the Florida Straits yearly by tropical cyclones. This metal-enriched fine carbonate becomes nutrients for phytoplankton, providing food for the corals, both shallow and deep.

A Simple Approach to Study Designs in Complex Biochemical ...

Indian Academy of Sciences (India)

Somdatta Sinha

Protein sequences. • Biochemical & Genetic information. REVERSE ENGINEERING. LARGE NETWORKS. FORWARD ENGINEERING. All designs that are not physically forbidden are realizable, but not all realizable designs are functionally effective. (in relation to context and constraints of the system and environment).

Molecular codes in biological and chemical reaction networks.

Directory of Open Access Journals (Sweden)

Dennis Görlich

Full Text Available Shannon's theory of communication has been very successfully applied for the analysis of biological information. However, the theory neglects semantic and pragmatic aspects and thus cannot directly be applied to distinguish between (bio- chemical systems able to process "meaningful" information from those that do not. Here, we present a formal method to assess a system's semantic capacity by analyzing a reaction network's capability to implement molecular codes. We analyzed models of chemical systems (martian atmosphere chemistry and various combustion chemistries, biochemical systems (gene expression, gene translation, and phosphorylation signaling cascades, an artificial chemistry, and random reaction networks. Our study suggests that different chemical systems possess different semantic capacities. No semantic capacity was found in the model of the martian atmosphere chemistry, the studied combustion chemistries, and highly connected random networks, i.e. with these chemistries molecular codes cannot be implemented. High semantic capacity was found in the studied biochemical systems and in random reaction networks where the number of second order reactions is twice the number of species. We conclude that our approach can be applied to evaluate the information processing capabilities of a chemical system and may thus be a useful tool to understand the origin and evolution of meaningful information, e.g. in the context of the origin of life.

Artificial neural network modelling

CERN Document Server

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

Gossip spread in social network Models

Science.gov (United States)

Johansson, Tobias

2017-04-01

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

Efficient Characterization of Parametric Uncertainty of Complex (Bio)chemical Networks.

Science.gov (United States)

Schillings, Claudia; Sunnåker, Mikael; Stelling, Jörg; Schwab, Christoph

2015-08-01

Parametric uncertainty is a particularly challenging and relevant aspect of systems analysis in domains such as systems biology where, both for inference and for assessing prediction uncertainties, it is essential to characterize the system behavior globally in the parameter space. However, current methods based on local approximations or on Monte-Carlo sampling cope only insufficiently with high-dimensional parameter spaces associated with complex network models. Here, we propose an alternative deterministic methodology that relies on sparse polynomial approximations. We propose a deterministic computational interpolation scheme which identifies most significant expansion coefficients adaptively. We present its performance in kinetic model equations from computational systems biology with several hundred parameters and state variables, leading to numerical approximations of the parametric solution on the entire parameter space. The scheme is based on adaptive Smolyak interpolation of the parametric solution at judiciously and adaptively chosen points in parameter space. As Monte-Carlo sampling, it is "non-intrusive" and well-suited for massively parallel implementation, but affords higher convergence rates. This opens up new avenues for large-scale dynamic network analysis by enabling scaling for many applications, including parameter estimation, uncertainty quantification, and systems design.

MODELING AND ANALYSIS OF ALGAL BLOOMS IN ARAS DAM BY ARTIFICIAL NEURAL NETWORK

Directory of Open Access Journals (Sweden)

JAHANGIRI-RAD MAHSA

2015-03-01

Full Text Available Man made practices have contributed to large-scale algal blooms that have caused serious ecological, aesthetic, water purification and water distribution problems. Aras Dam, which provides Arasful city with drinking water, has chronic algal blooms since 1990. This study addresses the use of artificial neural network (ANN model to anticipate the chlorophyll-a concentration in water of dam reservoir. Operation tests carried out by collecting water samples from 5 stations and examined for physical quality parameters namely: water temperature, total suspended solids (TSS, biochemical oxygen demands (BOD, ortophosphate, total phosphorous and nitrate concentrations using standard methods. Chlorophyll-a was also checked separately in order to investigate the accuracy of the predicted results by ANN. The results showed that a network was highly accurate in predicting the Chl-a concentration. A good agreement between actual data and the ANN outputs for training was observed, indicating the validation of testing data sets. The initial results of the research indicate that the dam is enriched with nutrients (phosphorus and nitrogen. The Chl-a concentration that were predicted by the model were beyond the standard levels; indicating the possibility of eutrophication especially during fall season.

Brand Marketing Model on Social Networks

OpenAIRE

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

2014-01-01

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

A model of coauthorship networks

Science.gov (United States)

Zhou, Guochang; Li, Jianping; Xie, Zonglin

2017-10-01

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

Application of approximate pattern matching in two dimensional spaces to grid layout for biochemical network maps.

Science.gov (United States)

Inoue, Kentaro; Shimozono, Shinichi; Yoshida, Hideaki; Kurata, Hiroyuki

2012-01-01

For visualizing large-scale biochemical network maps, it is important to calculate the coordinates of molecular nodes quickly and to enhance the understanding or traceability of them. The grid layout is effective in drawing compact, orderly, balanced network maps with node label spaces, but existing grid layout algorithms often require a high computational cost because they have to consider complicated positional constraints through the entire optimization process. We propose a hybrid grid layout algorithm that consists of a non-grid, fast layout (preprocessor) algorithm and an approximate pattern matching algorithm that distributes the resultant preprocessed nodes on square grid points. To demonstrate the feasibility of the hybrid layout algorithm, it is characterized in terms of the calculation time, numbers of edge-edge and node-edge crossings, relative edge lengths, and F-measures. The proposed algorithm achieves outstanding performances compared with other existing grid layouts. Use of an approximate pattern matching algorithm quickly redistributes the laid-out nodes by fast, non-grid algorithms on the square grid points, while preserving the topological relationships among the nodes. The proposed algorithm is a novel use of the pattern matching, thereby providing a breakthrough for grid layout. This application program can be freely downloaded from http://www.cadlive.jp/hybridlayout/hybridlayout.html.

Application of approximate pattern matching in two dimensional spaces to grid layout for biochemical network maps.

Directory of Open Access Journals (Sweden)

Kentaro Inoue

Full Text Available BACKGROUND: For visualizing large-scale biochemical network maps, it is important to calculate the coordinates of molecular nodes quickly and to enhance the understanding or traceability of them. The grid layout is effective in drawing compact, orderly, balanced network maps with node label spaces, but existing grid layout algorithms often require a high computational cost because they have to consider complicated positional constraints through the entire optimization process. RESULTS: We propose a hybrid grid layout algorithm that consists of a non-grid, fast layout (preprocessor algorithm and an approximate pattern matching algorithm that distributes the resultant preprocessed nodes on square grid points. To demonstrate the feasibility of the hybrid layout algorithm, it is characterized in terms of the calculation time, numbers of edge-edge and node-edge crossings, relative edge lengths, and F-measures. The proposed algorithm achieves outstanding performances compared with other existing grid layouts. CONCLUSIONS: Use of an approximate pattern matching algorithm quickly redistributes the laid-out nodes by fast, non-grid algorithms on the square grid points, while preserving the topological relationships among the nodes. The proposed algorithm is a novel use of the pattern matching, thereby providing a breakthrough for grid layout. This application program can be freely downloaded from http://www.cadlive.jp/hybridlayout/hybridlayout.html.

Brand marketing model on social networks

OpenAIRE

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

2014-01-01

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

Target-Centric Network Modeling

DEFF Research Database (Denmark)

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

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

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

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

Science.gov (United States)

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

2018-04-01

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

Signatures of arithmetic simplicity in metabolic network architecture.

Directory of Open Access Journals (Sweden)

William J Riehl

2010-04-01

Full Text Available Metabolic networks perform some of the most fundamental functions in living cells, including energy transduction and building block biosynthesis. While these are the best characterized networks in living systems, understanding their evolutionary history and complex wiring constitutes one of the most fascinating open questions in biology, intimately related to the enigma of life's origin itself. Is the evolution of metabolism subject to general principles, beyond the unpredictable accumulation of multiple historical accidents? Here we search for such principles by applying to an artificial chemical universe some of the methodologies developed for the study of genome scale models of cellular metabolism. In particular, we use metabolic flux constraint-based models to exhaustively search for artificial chemistry pathways that can optimally perform an array of elementary metabolic functions. Despite the simplicity of the model employed, we find that the ensuing pathways display a surprisingly rich set of properties, including the existence of autocatalytic cycles and hierarchical modules, the appearance of universally preferable metabolites and reactions, and a logarithmic trend of pathway length as a function of input/output molecule size. Some of these properties can be derived analytically, borrowing methods previously used in cryptography. In addition, by mapping biochemical networks onto a simplified carbon atom reaction backbone, we find that properties similar to those predicted for the artificial chemistry hold also for real metabolic networks. These findings suggest that optimality principles and arithmetic simplicity might lie beneath some aspects of biochemical complexity.

Exploring biological network structure with clustered random networks

Directory of Open Access Journals (Sweden)

Bansal Shweta

2009-12-01

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

Quantifying the dynamics of coupled networks of switches and oscillators.

Directory of Open Access Journals (Sweden)

Matthew R Francis

Full Text Available Complex network dynamics have been analyzed with models of systems of coupled switches or systems of coupled oscillators. However, many complex systems are composed of components with diverse dynamics whose interactions drive the system's evolution. We, therefore, introduce a new modeling framework that describes the dynamics of networks composed of both oscillators and switches. Both oscillator synchronization and switch stability are preserved in these heterogeneous, coupled networks. Furthermore, this model recapitulates the qualitative dynamics for the yeast cell cycle consistent with the hypothesized dynamics resulting from decomposition of the regulatory network into dynamic motifs. Introducing feedback into the cell-cycle network induces qualitative dynamics analogous to limitless replicative potential that is a hallmark of cancer. As a result, the proposed model of switch and oscillator coupling provides the ability to incorporate mechanisms that underlie the synchronized stimulus response ubiquitous in biochemical systems.

Modeling Renewable Penertration Using a Network Economic Model

Science.gov (United States)

Lamont, A.

2001-03-01

This paper evaluates the accuracy of a network economic modeling approach in designing energy systems having renewable and conventional generators. The network approach models the system as a network of processes such as demands, generators, markets, and resources. The model reaches a solution by exchanging prices and quantity information between the nodes of the system. This formulation is very flexible and takes very little time to build and modify models. This paper reports an experiment designing a system with photovoltaic and base and peak fossil generators. The level of PV penetration as a function of its price and the capacities of the fossil generators were determined using the network approach and using an exact, analytic approach. It is found that the two methods agree very closely in terms of the optimal capacities and are nearly identical in terms of annual system costs.

An evolving network model with community structure

International Nuclear Information System (INIS)

Li Chunguang; Maini, Philip K

2005-01-01

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

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

Research on the model of home networking

Science.gov (United States)

Yun, Xiang; Feng, Xiancheng

2007-11-01

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

Network models in economics and finance

CERN Document Server

Pardalos, Panos; Rassias, Themistocles

2014-01-01

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

Systematic integration of experimental data and models in systems biology.

Science.gov (United States)

Li, Peter; Dada, Joseph O; Jameson, Daniel; Spasic, Irena; Swainston, Neil; Carroll, Kathleen; Dunn, Warwick; Khan, Farid; Malys, Naglis; Messiha, Hanan L; Simeonidis, Evangelos; Weichart, Dieter; Winder, Catherine; Wishart, Jill; Broomhead, David S; Goble, Carole A; Gaskell, Simon J; Kell, Douglas B; Westerhoff, Hans V; Mendes, Pedro; Paton, Norman W

2010-11-29

The behaviour of biological systems can be deduced from their mathematical models. However, multiple sources of data in diverse forms are required in the construction of a model in order to define its components and their biochemical reactions, and corresponding parameters. Automating the assembly and use of systems biology models is dependent upon data integration processes involving the interoperation of data and analytical resources. Taverna workflows have been developed for the automated assembly of quantitative parameterised metabolic networks in the Systems Biology Markup Language (SBML). A SBML model is built in a systematic fashion by the workflows which starts with the construction of a qualitative network using data from a MIRIAM-compliant genome-scale model of yeast metabolism. This is followed by parameterisation of the SBML model with experimental data from two repositories, the SABIO-RK enzyme kinetics database and a database of quantitative experimental results. The models are then calibrated and simulated in workflows that call out to COPASIWS, the web service interface to the COPASI software application for analysing biochemical networks. These systems biology workflows were evaluated for their ability to construct a parameterised model of yeast glycolysis. Distributed information about metabolic reactions that have been described to MIRIAM standards enables the automated assembly of quantitative systems biology models of metabolic networks based on user-defined criteria. Such data integration processes can be implemented as Taverna workflows to provide a rapid overview of the components and their relationships within a biochemical system.

Complex networks under dynamic repair model

Science.gov (United States)

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

2018-01-01

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

Adaptive-network models of collective dynamics

Science.gov (United States)

Zschaler, G.

2012-09-01

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

Linear approximation model network and its formation via ...

Indian Academy of Sciences (India)

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

Modelling the structure of complex networks

DEFF Research Database (Denmark)

Herlau, Tue

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

Spatial Epidemic Modelling in Social Networks

Science.gov (United States)

Simoes, Joana Margarida

2005-06-01

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

Assessing seasonality of biochemical CO2 exchange model parameters from micrometeorological flux observations at boreal coniferous forest

Directory of Open Access Journals (Sweden)

T. Vesala

2008-12-01

Full Text Available The seasonality of the NEE of the northern boreal coniferous forests was investigated by means of inversion modelling using eddy covariance data. Eddy covariance data was used to optimize the biochemical model parameters. Our study sites consisted of three Scots pine (l. Pinus sylvestris forests and one Norway spruce (l. Picea abies forest that were located in Finland and Sweden. We obtained temperature and seasonal dependence for the biochemical model parameters: the maximum rate of carboxylation (Vc(max and the maximum rate of electron transport (Jmax. Both of the parameters were optimized without assumptions about their mutual magnitude. The values obtained for the biochemical model parameters were similar at all the sites during summer time. To describe seasonality, different temperature fits were made for the spring, summer and autumn periods. During summer, average Jmax across the sites was 54.0 μmol m−2 s−1 (variance 31.2 μmol m−2 s−1 and Vc(max was 12.0 μmol m−2 s−1 (variance 6.6 μmol m−2 s−1 at 17°C. The sensitivity of the model to LAI and atmospheric soil water stress was also studied. The impact of seasonality on annual GPP was 17% when only summertime parameterization was used throughout the year compared to seasonally changing parameterizations.

Modeling of fluctuating reaction networks

International Nuclear Information System (INIS)

Lipshtat, A.; Biham, O.

2004-01-01

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

Deterministic ripple-spreading model for complex networks.

Science.gov (United States)

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

2011-04-01

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

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.

Neural network modeling of emotion

Science.gov (United States)

Levine, Daniel S.

2007-03-01

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

Development of class model based on blood biochemical parameters as a diagnostic tool of PSE meat.

Science.gov (United States)

Qu, Daofeng; Zhou, Xu; Yang, Feng; Tian, Shiyi; Zhang, Xiaojun; Ma, Lin; Han, Jianzhong

2017-06-01

A fast, sensitive and effective method based on the blood biochemical parameters for the detection of PSE meat was developed in this study. A total of 200 pigs were slaughtered in the same slaughterhouse. Meat quality was evaluated by measuring pH, electrical conductivity and color at 45min, 2h and 24h after slaughtering in M. longissimus thoracis et lumborum (LD). Blood biochemical parameters were determined in blood samples collected during carcass bleeding. Principal component analysis (PCA) biplot showed that high levels of exsanguination Creatine Kinase, Lactate Dehydrogenase, Aspertate aminotransferase, blood glucose and lactate were associated with the PSE meat, and the five biochemical parameters were found to be good indicators of PSE meat Discriminant function analysis (DFA) was able to clearly identify PSE meat using the five biochemical parameters as input data, and the class model is an effective diagnostic tool in pigs which can be used to detect the PSE meat and reduce economic loss for the company. Copyright © 2017 Elsevier Ltd. All rights reserved.

An acoustical model based monitoring network

NARCIS (Netherlands)

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

2010-01-01

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

How to model wireless mesh networks topology

International Nuclear Information System (INIS)

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

2013-01-01

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

GKIN: a tool for drawing genetic networks

Directory of Open Access Journals (Sweden)

Jonathan Arnold

2012-03-01

Full Text Available We present GKIN, a simulator and a comprehensive graphical interface where one can draw the model specification of reactions between hypothesized molecular participants in a gene regulatory and biochemical reaction network (or genetic network for short. The solver is written in C++ in a nearly platform independentmanner to simulate large ensembles of models, which can run on PCs, Macintoshes, and UNIX machines, and its graphical user interface is written in Java which can run as a standalone or WebStart application. The drawing capability for rendering a network significantly enhances the ease of use of other reaction network simulators, such as KINSOLVER (Aleman-Meza et al., 2009 and enforces a correct semantic specification of the network. In a usability study with novice users, drawing the network with GKIN was preferred and faster in comparison with entry with a dialog-box guided interface in COPASI (Hoops, et al., 2006 with no difference in error rates between GKIN and COPASI in specifying the network. GKIN is freely available at http://faculty.cs.wit.edu/~ldeligia/PROJECTS/GKIN/.

Evolving phenotypic networks in silico.

Science.gov (United States)

François, Paul

2014-11-01

Evolved gene networks are constrained by natural selection. Their structures and functions are consequently far from being random, as exemplified by the multiple instances of parallel/convergent evolution. One can thus ask if features of actual gene networks can be recovered from evolutionary first principles. I review a method for in silico evolution of small models of gene networks aiming at performing predefined biological functions. I summarize the current implementation of the algorithm, insisting on the construction of a proper "fitness" function. I illustrate the approach on three examples: biochemical adaptation, ligand discrimination and vertebrate segmentation (somitogenesis). While the structure of the evolved networks is variable, dynamics of our evolved networks are usually constrained and present many similar features to actual gene networks, including properties that were not explicitly selected for. In silico evolution can thus be used to predict biological behaviours without a detailed knowledge of the mapping between genotype and phenotype. Copyright © 2014 The Author. Published by Elsevier Ltd.. All rights reserved.

Biochemical Control With Radiotherapy Improves Overall Survival in Intermediate and High-Risk Prostate Cancer Patients Who Have an Estimated 10-Year Overall Survival of >90%

International Nuclear Information System (INIS)

Herbert, Christopher; Liu, Mitchell; Tyldesley, Scott; Morris, W. James; Joffres, Michel; Khaira, Mandip; Kwan, Winkle; Moiseenko, Vitali; Pickles, Thomas

2012-01-01

Purpose: To identify subgroups of patients with carcinoma of the prostate treated with radical radiotherapy that have improved overall survival when disease is biochemically controlled. Methods and Materials: A cohort of 1,060 prostate cancer patients treated with radical radiotherapy was divided into nine subgroups based on National Comprehensive Cancer Network risk category and estimated 10-year overall survival (eOS 10y) derived from the age adjusted Charlson Comorbidity Index. Patients with and without biochemical control were compared with respect to overall survival. Actuarial estimates of overall survival were calculated using the Kaplan-Meier method. Univariate and multivariate Cox proportional hazards models were used for analysis of overall survival. Results: Median follow-up was 125 months (range, 51–176 months). Only the subgroups with high or intermediate risk disease and an eOS 10y of >90% had a statistically significantly improved overall survival when prostate cancer was biochemically controlled. In all other groups, biochemical control made no significant difference to overall survival. In the subgroup with high-risk disease and eOS 10y >90%, actuarial overall survival was 86.3% (95% confidence interval [CI] 78.5%–94.1%) and 62.1% (95% CI 52.9%–71.3%) for patients with biochemical control and biochemical relapse respectively (p = 0.002). In the intermediate risk group with eOS >90%, actuarial overall survival was 95.3% (95% CI 89.0%–100%) and 79.8% (95% CI 68.0%–91.6%) for biochemically controlled and biochemically relapsed patients (p = 0.033). On multivariate analysis, National Comprehensive Cancer Network risk group (p = 0.005), biochemical control (p = 0.033) and eOS 10y (p 90%.

Modeling the interdependent network based on two-mode networks

Science.gov (United States)

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

2017-10-01

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

A Systems Model of Parkinson's Disease Using Biochemical Systems Theory.

Science.gov (United States)

Sasidharakurup, Hemalatha; Melethadathil, Nidheesh; Nair, Bipin; Diwakar, Shyam

2017-08-01

Parkinson's disease (PD), a neurodegenerative disorder, affects millions of people and has gained attention because of its clinical roles affecting behaviors related to motor and nonmotor symptoms. Although studies on PD from various aspects are becoming popular, few rely on predictive systems modeling approaches. Using Biochemical Systems Theory (BST), this article attempts to model and characterize dopaminergic cell death and understand pathophysiology of progression of PD. PD pathways were modeled using stochastic differential equations incorporating law of mass action, and initial concentrations for the modeled proteins were obtained from literature. Simulations suggest that dopamine levels were reduced significantly due to an increase in dopaminergic quinones and 3,4-dihydroxyphenylacetaldehyde (DOPAL) relating to imbalances compared to control during PD progression. Associating to clinically observed PD-related cell death, simulations show abnormal parkin and reactive oxygen species levels with an increase in neurofibrillary tangles. While relating molecular mechanistic roles, the BST modeling helps predicting dopaminergic cell death processes involved in the progression of PD and provides a predictive understanding of neuronal dysfunction for translational neuroscience.

Entropy Characterization of Random Network Models

Directory of Open Access Journals (Sweden)

Pedro J. Zufiria

2017-06-01

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

The model of social crypto-network

Directory of Open Access Journals (Sweden)

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

2015-06-01

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

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.

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

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

Directory of Open Access Journals (Sweden)

D. Y. Kong

2014-01-01

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

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.

Developing Personal Network Business Models

DEFF Research Database (Denmark)

Saugstrup, Dan; Henten, Anders

2006-01-01

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

A novel Direct Small World network model

Directory of Open Access Journals (Sweden)

LIN Tao

2016-10-01

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

Non-consensus Opinion Models on Complex Networks

Science.gov (United States)

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

2013-04-01

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

Rapid Discrimination Among Putative Mechanistic Models of Biochemical Systems.

Science.gov (United States)

Lomnitz, Jason G; Savageau, Michael A

2016-08-31

An overarching goal in molecular biology is to gain an understanding of the mechanistic basis underlying biochemical systems. Success is critical if we are to predict effectively the outcome of drug treatments and the development of abnormal phenotypes. However, data from most experimental studies is typically noisy and sparse. This allows multiple potential mechanisms to account for experimental observations, and often devising experiments to test each is not feasible. Here, we introduce a novel strategy that discriminates among putative models based on their repertoire of qualitatively distinct phenotypes, without relying on knowledge of specific values for rate constants and binding constants. As an illustration, we apply this strategy to two synthetic gene circuits exhibiting anomalous behaviors. Our results show that the conventional models, based on their well-characterized components, cannot account for the experimental observations. We examine a total of 40 alternative hypotheses and show that only 5 have the potential to reproduce the experimental data, and one can do so with biologically relevant parameter values.

Temporal motifs in time-dependent networks

International Nuclear Information System (INIS)

Kovanen, Lauri; Karsai, Márton; Kaski, Kimmo; Kertész, János; Saramäki, Jari

2011-01-01

Temporal networks are commonly used to represent systems where connections between elements are active only for restricted periods of time, such as telecommunication, neural signal processing, biochemical reaction and human social interaction networks. We introduce the framework of temporal motifs to study the mesoscale topological–temporal structure of temporal networks in which the events of nodes do not overlap in time. Temporal motifs are classes of similar event sequences, where the similarity refers not only to topology but also to the temporal order of the events. We provide a mapping from event sequences to coloured directed graphs that enables an efficient algorithm for identifying temporal motifs. We discuss some aspects of temporal motifs, including causality and null models, and present basic statistics of temporal motifs in a large mobile call network

Computing chemical organizations in biological networks.

Science.gov (United States)

Centler, Florian; Kaleta, Christoph; di Fenizio, Pietro Speroni; Dittrich, Peter

2008-07-15

Novel techniques are required to analyze computational models of intracellular processes as they increase steadily in size and complexity. The theory of chemical organizations has recently been introduced as such a technique that links the topology of biochemical reaction network models to their dynamical repertoire. The network is decomposed into algebraically closed and self-maintaining subnetworks called organizations. They form a hierarchy representing all feasible system states including all steady states. We present three algorithms to compute the hierarchy of organizations for network models provided in SBML format. Two of them compute the complete organization hierarchy, while the third one uses heuristics to obtain a subset of all organizations for large models. While the constructive approach computes the hierarchy starting from the smallest organization in a bottom-up fashion, the flux-based approach employs self-maintaining flux distributions to determine organizations. A runtime comparison on 16 different network models of natural systems showed that none of the two exhaustive algorithms is superior in all cases. Studying a 'genome-scale' network model with 762 species and 1193 reactions, we demonstrate how the organization hierarchy helps to uncover the model structure and allows to evaluate the model's quality, for example by detecting components and subsystems of the model whose maintenance is not explained by the model. All data and a Java implementation that plugs into the Systems Biology Workbench is available from http://www.minet.uni-jena.de/csb/prj/ot/tools.

INTEGRATING GENETIC AND STRUCTURAL DATA ON HUMAN PROTEIN KINOME IN NETWORK-BASED MODELING OF KINASE SENSITIVITIES AND RESISTANCE TO TARGETED AND PERSONALIZED ANTICANCER DRUGS.

Science.gov (United States)

Verkhivker, Gennady M

2016-01-01

The human protein kinome presents one of the largest protein families that orchestrate functional processes in complex cellular networks, and when perturbed, can cause various cancers. The abundance and diversity of genetic, structural, and biochemical data underlies the complexity of mechanisms by which targeted and personalized drugs can combat mutational profiles in protein kinases. Coupled with the evolution of system biology approaches, genomic and proteomic technologies are rapidly identifying and charactering novel resistance mechanisms with the goal to inform rationale design of personalized kinase drugs. Integration of experimental and computational approaches can help to bring these data into a unified conceptual framework and develop robust models for predicting the clinical drug resistance. In the current study, we employ a battery of synergistic computational approaches that integrate genetic, evolutionary, biochemical, and structural data to characterize the effect of cancer mutations in protein kinases. We provide a detailed structural classification and analysis of genetic signatures associated with oncogenic mutations. By integrating genetic and structural data, we employ network modeling to dissect mechanisms of kinase drug sensitivities to oncogenic EGFR mutations. Using biophysical simulations and analysis of protein structure networks, we show that conformational-specific drug binding of Lapatinib may elicit resistant mutations in the EGFR kinase that are linked with the ligand-mediated changes in the residue interaction networks and global network properties of key residues that are responsible for structural stability of specific functional states. A strong network dependency on high centrality residues in the conformation-specific Lapatinib-EGFR complex may explain vulnerability of drug binding to a broad spectrum of mutations and the emergence of drug resistance. Our study offers a systems-based perspective on drug design by unravelling

Statistical physics approaches to subnetwork dynamics in biochemical systems

Science.gov (United States)

Bravi, B.; Sollich, P.

2017-08-01

We apply a Gaussian variational approximation to model reduction in large biochemical networks of unary and binary reactions. We focus on a small subset of variables (subnetwork) of interest, e.g. because they are accessible experimentally, embedded in a larger network (bulk). The key goal is to write dynamical equations reduced to the subnetwork but still retaining the effects of the bulk. As a result, the subnetwork-reduced dynamics contains a memory term and an extrinsic noise term with non-trivial temporal correlations. We first derive expressions for this memory and noise in the linearized (Gaussian) dynamics and then use a perturbative power expansion to obtain first order nonlinear corrections. For the case of vanishing intrinsic noise, our description is explicitly shown to be equivalent to projection methods up to quadratic terms, but it is applicable also in the presence of stochastic fluctuations in the original dynamics. An example from the epidermal growth factor receptor signalling pathway is provided to probe the increased prediction accuracy and computational efficiency of our method.

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

Science.gov (United States)

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

2018-02-01

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

Network structure exploration via Bayesian nonparametric models

International Nuclear Information System (INIS)

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

2015-01-01

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

Yeast 5 – an expanded reconstruction of the Saccharomyces cerevisiae metabolic network

Directory of Open Access Journals (Sweden)

Heavner Benjamin D

2012-06-01

Full Text Available Abstract Background Efforts to improve the computational reconstruction of the Saccharomyces cerevisiae biochemical reaction network and to refine the stoichiometrically constrained metabolic models that can be derived from such a reconstruction have continued since the first stoichiometrically constrained yeast genome scale metabolic model was published in 2003. Continuing this ongoing process, we have constructed an update to the Yeast Consensus Reconstruction, Yeast 5. The Yeast Consensus Reconstruction is a product of efforts to forge a community-based reconstruction emphasizing standards compliance and biochemical accuracy via evidence-based selection of reactions. It draws upon models published by a variety of independent research groups as well as information obtained from biochemical databases and primary literature. Results Yeast 5 refines the biochemical reactions included in the reconstruction, particularly reactions involved in sphingolipid metabolism; updates gene-reaction annotations; and emphasizes the distinction between reconstruction and stoichiometrically constrained model. Although it was not a primary goal, this update also improves the accuracy of model prediction of viability and auxotrophy phenotypes and increases the number of epistatic interactions. This update maintains an emphasis on standards compliance, unambiguous metabolite naming, and computer-readable annotations available through a structured document format. Additionally, we have developed MATLAB scripts to evaluate the model’s predictive accuracy and to demonstrate basic model applications such as simulating aerobic and anaerobic growth. These scripts, which provide an independent tool for evaluating the performance of various stoichiometrically constrained yeast metabolic models using flux balance analysis, are included as Additional files 1, 2 and 3. Additional file 1 Function testYeastModel.m.m. Click here for file Additional file 2 Function model

Activating and inhibiting connections in biological network dynamics

Directory of Open Access Journals (Sweden)

Knight Rob

2008-12-01

Full Text Available Abstract Background Many studies of biochemical networks have analyzed network topology. Such work has suggested that specific types of network wiring may increase network robustness and therefore confer a selective advantage. However, knowledge of network topology does not allow one to predict network dynamical behavior – for example, whether deleting a protein from a signaling network would maintain the network's dynamical behavior, or induce oscillations or chaos. Results Here we report that the balance between activating and inhibiting connections is important in determining whether network dynamics reach steady state or oscillate. We use a simple dynamical model of a network of interacting genes or proteins. Using the model, we study random networks, networks selected for robust dynamics, and examples of biological network topologies. The fraction of activating connections influences whether the network dynamics reach steady state or oscillate. Conclusion The activating fraction may predispose a network to oscillate or reach steady state, and neutral evolution or selection of this parameter may affect the behavior of biological networks. This principle may unify the dynamics of a wide range of cellular networks. Reviewers Reviewed by Sergei Maslov, Eugene Koonin, and Yu (Brandon Xia (nominated by Mark Gerstein. For the full reviews, please go to the Reviewers' comments section.

Homophyly/Kinship Model: Naturally Evolving Networks

Science.gov (United States)

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

2015-10-01

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

Modeling, robust and distributed model predictive control for freeway networks

NARCIS (Netherlands)

Liu, S.

2016-01-01

In Model Predictive Control (MPC) for traffic networks, traffic models are crucial since they are used as prediction models for determining the optimal control actions. In order to reduce the computational complexity of MPC for traffic networks, macroscopic traffic models are often used instead of

Cyber threat model for tactical radio networks

Science.gov (United States)

Kurdziel, Michael T.

2014-05-01

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

Tool wear modeling using abductive networks

Science.gov (United States)

Masory, Oren

1992-09-01

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

Using chemistry and microfluidics to understand the spatial dynamics of complex biological networks.

Science.gov (United States)

Kastrup, Christian J; Runyon, Matthew K; Lucchetta, Elena M; Price, Jessica M; Ismagilov, Rustem F

2008-04-01

Understanding the spatial dynamics of biochemical networks is both fundamentally important for understanding life at the systems level and also has practical implications for medicine, engineering, biology, and chemistry. Studies at the level of individual reactions provide essential information about the function, interactions, and localization of individual molecular species and reactions in a network. However, analyzing the spatial dynamics of complex biochemical networks at this level is difficult. Biochemical networks are nonequilibrium systems containing dozens to hundreds of reactions with nonlinear and time-dependent interactions, and these interactions are influenced by diffusion, flow, and the relative values of state-dependent kinetic parameters. To achieve an overall understanding of the spatial dynamics of a network and the global mechanisms that drive its function, networks must be analyzed as a whole, where all of the components and influential parameters of a network are simultaneously considered. Here, we describe chemical concepts and microfluidic tools developed for network-level investigations of the spatial dynamics of these networks. Modular approaches can be used to simplify these networks by separating them into modules, and simple experimental or computational models can be created by replacing each module with a single reaction. Microfluidics can be used to implement these models as well as to analyze and perturb the complex network itself with spatial control on the micrometer scale. We also describe the application of these network-level approaches to elucidate the mechanisms governing the spatial dynamics of two networkshemostasis (blood clotting) and early patterning of the Drosophila embryo. To investigate the dynamics of the complex network of hemostasis, we simplified the network by using a modular mechanism and created a chemical model based on this mechanism by using microfluidics. Then, we used the mechanism and the model to

Biological transportation networks: Modeling and simulation

KAUST Repository

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

2015-01-01

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

Synergistic effects in threshold models on networks

Science.gov (United States)

Juul, Jonas S.; Porter, Mason A.

2018-01-01

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

Modeling geomagnetic induced currents in Australian power networks

Science.gov (United States)

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

2017-07-01

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

Modeling Distillation Column Using ARX Model Structure and Artificial Neural Networks

Directory of Open Access Journals (Sweden)

Reza Pirmoradi

2012-04-01

Full Text Available Distillation is a complex and highly nonlinear industrial process. In general it is not always possible to obtain accurate first principles models for high-purity distillation columns. On the other hand the development of first principles models is usually time consuming and expensive. To overcome these problems, empirical models such as neural networks can be used. One major drawback of empirical models is that the prediction is valid only inside the data domain that is sufficiently covered by measurement data. Modeling distillation columns by means of neural networks is reported in literature by using recursive networks. The recursive networks are proper for modeling purpose, but such models have the problems of high complexity and high computational cost. The objective of this paper is to propose a simple and reliable model for distillation column. The proposed model uses feed forward neural networks which results in a simple model with less parameters and faster training time. Simulation results demonstrate that predictions of the proposed model in all regions are close to outputs of the dynamic model and the error in negligible. This implies that the model is reliable in all regions.

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

NARCIS (Netherlands)

Frank, Laurence Emmanuelle

2006-01-01

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

Nonparametric Bayesian Modeling of Complex Networks

DEFF Research Database (Denmark)

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

2013-01-01

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

Modelling and designing electric energy networks

International Nuclear Information System (INIS)

Retiere, N.

2003-11-01

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

The interplay of intrinsic and extrinsic bounded noises in biomolecular networks.

Directory of Open Access Journals (Sweden)

Giulio Caravagna

Full Text Available After being considered as a nuisance to be filtered out, it became recently clear that biochemical noise plays a complex role, often fully functional, for a biomolecular network. The influence of intrinsic and extrinsic noises on biomolecular networks has intensively been investigated in last ten years, though contributions on the co-presence of both are sparse. Extrinsic noise is usually modeled as an unbounded white or colored gaussian stochastic process, even though realistic stochastic perturbations are clearly bounded. In this paper we consider Gillespie-like stochastic models of nonlinear networks, i.e. the intrinsic noise, where the model jump rates are affected by colored bounded extrinsic noises synthesized by a suitable biochemical state-dependent Langevin system. These systems are described by a master equation, and a simulation algorithm to analyze them is derived. This new modeling paradigm should enlarge the class of systems amenable at modeling. We investigated the influence of both amplitude and autocorrelation time of a extrinsic Sine-Wiener noise on: (i the Michaelis-Menten approximation of noisy enzymatic reactions, which we show to be applicable also in co-presence of both intrinsic and extrinsic noise, (ii a model of enzymatic futile cycle and (iii a genetic toggle switch. In (ii and (iii we show that the presence of a bounded extrinsic noise induces qualitative modifications in the probability densities of the involved chemicals, where new modes emerge, thus suggesting the possible functional role of bounded noises.

The interplay of intrinsic and extrinsic bounded noises in biomolecular networks.

Science.gov (United States)

Caravagna, Giulio; Mauri, Giancarlo; d'Onofrio, Alberto

2013-01-01

After being considered as a nuisance to be filtered out, it became recently clear that biochemical noise plays a complex role, often fully functional, for a biomolecular network. The influence of intrinsic and extrinsic noises on biomolecular networks has intensively been investigated in last ten years, though contributions on the co-presence of both are sparse. Extrinsic noise is usually modeled as an unbounded white or colored gaussian stochastic process, even though realistic stochastic perturbations are clearly bounded. In this paper we consider Gillespie-like stochastic models of nonlinear networks, i.e. the intrinsic noise, where the model jump rates are affected by colored bounded extrinsic noises synthesized by a suitable biochemical state-dependent Langevin system. These systems are described by a master equation, and a simulation algorithm to analyze them is derived. This new modeling paradigm should enlarge the class of systems amenable at modeling. We investigated the influence of both amplitude and autocorrelation time of a extrinsic Sine-Wiener noise on: (i) the Michaelis-Menten approximation of noisy enzymatic reactions, which we show to be applicable also in co-presence of both intrinsic and extrinsic noise, (ii) a model of enzymatic futile cycle and (iii) a genetic toggle switch. In (ii) and (iii) we show that the presence of a bounded extrinsic noise induces qualitative modifications in the probability densities of the involved chemicals, where new modes emerge, thus suggesting the possible functional role of bounded noises.

Advances in citric acid fermentation by Aspergillus niger: biochemical aspects, membrane transport and modeling.

Science.gov (United States)

Papagianni, Maria

2007-01-01

Citric acid is regarded as a metabolite of energy metabolism, of which the concentration will rise to appreciable amounts only under conditions of substantive metabolic imbalances. Citric acid fermentation conditions were established during the 1930s and 1940s, when the effects of various medium components were evaluated. The biochemical mechanism by which Aspergillus niger accumulates citric acid has continued to attract interest even though its commercial production by fermentation has been established for decades. Although extensive basic biochemical research has been carried out with A. niger, the understanding of the events relevant for citric acid accumulation is not completely understood. This review is focused on citric acid fermentation by A. niger. Emphasis is given to aspects of fermentation biochemistry, membrane transport in A. niger and modeling of the production process.

Modelling traffic congestion using queuing networks

Indian Academy of Sciences (India)

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

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

Science.gov (United States)

Raza, Khalid; Alam, Mansaf

2016-10-01

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

Systems biology and the origins of life? part II. Are biochemical networks possible ancestors of living systems? networks of catalysed chemical reactions: non-equilibrium, self-organization and evolution.

Science.gov (United States)

Ricard, Jacques

2010-01-01

The present article discusses the possibility that catalysed chemical networks can evolve. Even simple enzyme-catalysed chemical reactions can display this property. The example studied is that of a two-substrate proteinoid, or enzyme, reaction displaying random binding of its substrates A and B. The fundamental property of such a system is to display either emergence or integration depending on the respective values of the probabilities that the enzyme has bound one of its substrate regardless it has bound the other substrate, or, specifically, after it has bound the other substrate. There is emergence of information if p(A)>p(AB) and p(B)>p(BA). Conversely, if p(A)equilibrium. Moreover, in such systems, emergence results in an increase of the energy level of the ternary EAB complex that becomes closer to the transition state of the reaction, thus leading to the enhancement of catalysis. Hence a drift from quasi-equilibrium is, to a large extent, responsible for the production of information and enhancement of catalysis. Non-equilibrium of these simple systems must be an important aspect that leads to both self-organization and evolutionary processes. These conclusions can be extended to networks of catalysed chemical reactions. Such networks are, in fact, networks of networks, viz. meta-networks. In this formal representation, nodes are chemical reactions catalysed by poorly specific proteinoids, and links can be identified to the transport of metabolites from proteinoid to proteinoid. The concepts of integration and emergence can be applied to such situations and can be used to define the identity of these networks and therefore their evolution. Defined as open non-equilibrium structures, such biochemical networks possess two remarkable properties: (1) the probability of occurrence of their nodes is dependant upon the input and output of matter in, and from, the system and (2) the probability of occurrence of the nodes is strictly linked to their degree of

Modeling, Optimization & Control of Hydraulic Networks

DEFF Research Database (Denmark)

Tahavori, Maryamsadat

2014-01-01

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

A random spatial network model based on elementary postulates

Science.gov (United States)

Karlinger, Michael R.; Troutman, Brent M.

1989-01-01

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

Biochemical component identification by plasmonic improved whispering gallery mode optical resonance based sensor

Science.gov (United States)

Saetchnikov, Vladimir A.; Tcherniavskaia, Elina A.; Saetchnikov, Anton V.; Schweiger, Gustav; Ostendorf, Andreas

2014-05-01

Experimental data on detection and identification of variety of biochemical agents, such as proteins, microelements, antibiotic of different generation etc. in both single and multi component solutions under varied in wide range concentration analyzed on the light scattering parameters of whispering gallery mode optical resonance based sensor are represented. Multiplexing on parameters and components has been realized using developed fluidic sensor cell with fixed in adhesive layer dielectric microspheres and data processing. Biochemical component identification has been performed by developed network analysis techniques. Developed approach is demonstrated to be applicable both for single agent and for multi component biochemical analysis. Novel technique based on optical resonance on microring structures, plasmon resonance and identification tools has been developed. To improve a sensitivity of microring structures microspheres fixed by adhesive had been treated previously by gold nanoparticle solution. Another technique used thin film gold layers deposited on the substrate below adhesive. Both biomolecule and nanoparticle injections caused considerable changes of optical resonance spectra. Plasmonic gold layers under optimized thickness also improve parameters of optical resonance spectra. Biochemical component identification has been also performed by developed network analysis techniques both for single and for multi component solution. So advantages of plasmon enhancing optical microcavity resonance with multiparameter identification tools is used for development of a new platform for ultra sensitive label-free biomedical sensor.

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.

Implementing network constraints in the EMPS model

Energy Technology Data Exchange (ETDEWEB)

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

2010-02-15

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

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

Directory of Open Access Journals (Sweden)

Lan Liu

2017-01-01

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

Creating, generating and comparing random network models with NetworkRandomizer.

Science.gov (United States)

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

2016-01-01

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

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

Directory of Open Access Journals (Sweden)

Liang Jinghang

2012-08-01

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

Network interconnections: an architectural reference model

NARCIS (Netherlands)

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

1985-01-01

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

A general evolving model for growing bipartite networks

International Nuclear Information System (INIS)

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

2012-01-01

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

Climatic Controls on Leaf Nitrogen Content and Implications for Biochemical Modeling.

Science.gov (United States)

Tcherednichenko, I. A.; White, M.; Bastidas, L.

2007-12-01

Leaf nitrogen (N) content, expressed as percent total nitrogen per unit of leaf dry mass, is a widely used parameter in biochemical modeling, due mainly to its role as a potentially limiting factor for photosynthesis. The amount of nitrogen, however, does not occur in a fixed amount in every leaf, but rather varies continuously with the leaf life cycle, in constant response to soil-root-stem-leaf-climate interactions and demand for growth. Moreover, while broad data on leaf N has become available it is normally measured under ambient conditions with consequent difficulty for distinguishing between genetic and time specific environmental effects. In the present work we: 1) Investigate the theoretical variation of leaf mass, specific heat capacity and leaf thickness of full sun-expanded leaves as a regulatory mechanism to ensure thermal survival along with long-term climatic radiation/temperature gradient; and discuss nitrogen and carbon controls on leaf thickness. 2) Based on possible states of partition between nitrogenous and non-nitrogenous components of a leaf we further derive probability density functions (PDFs) of nitrogen and carbon content and assess the effect of water and nutrient uptake on the PDFs. 3) Translate the results to spatially explicit representation over the conterminous USA at 1 km spatial resolution by providing maximum potential values of leaf N of fully expanded leaf optimally suited for long term climatic averages values and soils conditions. Implications for potential presence of inherently slow/fast growing species are discussed along with suitability of results for use by biochemical models.

Model of community emergence in weighted social networks

Science.gov (United States)

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

2009-04-01

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

Mean field interaction in biochemical reaction networks

KAUST Repository

Tembine, Hamidou; Tempone, Raul; Vilanova, Pedro

2011-01-01

In this paper we establish a relationship between chemical dynamics and mean field game dynamics. We show that chemical reaction networks can be studied using noisy mean field limits. We provide deterministic, noisy and switching mean field limits

Markovian dynamics on complex reaction networks

Energy Technology Data Exchange (ETDEWEB)

Goutsias, J., E-mail: goutsias@jhu.edu; Jenkinson, G., E-mail: jenkinson@jhu.edu

2013-08-10

Complex networks, comprised of individual elements that interact with each other through reaction channels, are ubiquitous across many scientific and engineering disciplines. Examples include biochemical, pharmacokinetic, epidemiological, ecological, social, neural, and multi-agent networks. A common approach to modeling such networks is by a master equation that governs the dynamic evolution of the joint probability mass function of the underlying population process and naturally leads to Markovian dynamics for such process. Due however to the nonlinear nature of most reactions and the large size of the underlying state-spaces, computation and analysis of the resulting stochastic population dynamics is a difficult task. This review article provides a coherent and comprehensive coverage of recently developed approaches and methods to tackle this problem. After reviewing a general framework for modeling Markovian reaction networks and giving specific examples, the authors present numerical and computational techniques capable of evaluating or approximating the solution of the master equation, discuss a recently developed approach for studying the stationary behavior of Markovian reaction networks using a potential energy landscape perspective, and provide an introduction to the emerging theory of thermodynamic analysis of such networks. Three representative problems of opinion formation, transcription regulation, and neural network dynamics are used as illustrative examples.

Markovian dynamics on complex reaction networks

International Nuclear Information System (INIS)

Goutsias, J.; Jenkinson, G.

2013-01-01

Complex networks, comprised of individual elements that interact with each other through reaction channels, are ubiquitous across many scientific and engineering disciplines. Examples include biochemical, pharmacokinetic, epidemiological, ecological, social, neural, and multi-agent networks. A common approach to modeling such networks is by a master equation that governs the dynamic evolution of the joint probability mass function of the underlying population process and naturally leads to Markovian dynamics for such process. Due however to the nonlinear nature of most reactions and the large size of the underlying state-spaces, computation and analysis of the resulting stochastic population dynamics is a difficult task. This review article provides a coherent and comprehensive coverage of recently developed approaches and methods to tackle this problem. After reviewing a general framework for modeling Markovian reaction networks and giving specific examples, the authors present numerical and computational techniques capable of evaluating or approximating the solution of the master equation, discuss a recently developed approach for studying the stationary behavior of Markovian reaction networks using a potential energy landscape perspective, and provide an introduction to the emerging theory of thermodynamic analysis of such networks. Three representative problems of opinion formation, transcription regulation, and neural network dynamics are used as illustrative examples

A quantum-implementable neural network model

Science.gov (United States)

Chen, Jialin; Wang, Lingli; Charbon, Edoardo

2017-10-01

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

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

Mathematical Modelling Plant Signalling Networks

KAUST Repository

Muraro, D.

2013-01-01

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

Polynomial algebra of discrete models in systems biology.

Science.gov (United States)

Veliz-Cuba, Alan; Jarrah, Abdul Salam; Laubenbacher, Reinhard

2010-07-01

An increasing number of discrete mathematical models are being published in Systems Biology, ranging from Boolean network models to logical models and Petri nets. They are used to model a variety of biochemical networks, such as metabolic networks, gene regulatory networks and signal transduction networks. There is increasing evidence that such models can capture key dynamic features of biological networks and can be used successfully for hypothesis generation. This article provides a unified framework that can aid the mathematical analysis of Boolean network models, logical models and Petri nets. They can be represented as polynomial dynamical systems, which allows the use of a variety of mathematical tools from computer algebra for their analysis. Algorithms are presented for the translation into polynomial dynamical systems. Examples are given of how polynomial algebra can be used for the model analysis. alanavc@vt.edu Supplementary data are available at Bioinformatics online.

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.

Constitutive modelling of composite biopolymer networks.

Science.gov (United States)

Fallqvist, B; Kroon, M

2016-04-21

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

Soya bean Gα proteins with distinct biochemical properties exhibit differential ability to complement Saccharomyces cerevisiae gpa1 mutant.

Science.gov (United States)

Roy Choudhury, Swarup; Wang, Yuqi; Pandey, Sona

2014-07-01

Signalling pathways mediated by heterotrimeric G-proteins are common to all eukaryotes. Plants have a limited number of each of the G-protein subunits, with the most elaborate G-protein network discovered so far in soya bean (Glycine max, also known as soybean) which has four Gα, four Gβ and ten Gγ proteins. Biochemical characterization of Gα proteins from plants suggests significant variation in their properties compared with the well-characterized non-plant proteins. Furthermore, the four soya bean Gα (GmGα) proteins exhibit distinct biochemical activities among themselves, but the extent to which such biochemical differences contribute to their in vivo function is also not known. We used the yeast gpa1 mutant which displays constitutive signalling and growth arrest in the pheromone-response pathway as an in vivo model to evaluate the effect of distinct biochemical activities of GmGα proteins. We showed that specific GmGα proteins can be activated during pheromone-dependent receptor-mediated signalling in yeast and they display different strengths towards complementation of yeast gpa1 phenotypes. We also identified amino acids that are responsible for differential complementation abilities of specific Gα proteins. These data establish that specific plant Gα proteins are functional in the receptor-mediated pheromone-response pathway in yeast and that the subtle biochemical differences in their activity are physiologically relevant.

Bayesian latent feature modeling for modeling bipartite networks with overlapping groups

DEFF Research Database (Denmark)

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

2016-01-01

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

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

Mathematical model for spreading dynamics of social network worms

International Nuclear Information System (INIS)

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

2012-01-01

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

A comprehensive multi-local-world model for complex networks

International Nuclear Information System (INIS)

Fan Zhengping; Chen Guanrong; Zhang Yunong

2009-01-01

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

Agent based modeling of energy networks

International Nuclear Information System (INIS)

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

2014-01-01

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

Mathematical Modeling Approaches in Plant Metabolomics.

Science.gov (United States)

Fürtauer, Lisa; Weiszmann, Jakob; Weckwerth, Wolfram; Nägele, Thomas

2018-01-01

The experimental analysis of a plant metabolome typically results in a comprehensive and multidimensional data set. To interpret metabolomics data in the context of biochemical regulation and environmental fluctuation, various approaches of mathematical modeling have been developed and have proven useful. In this chapter, a general introduction to mathematical modeling is presented and discussed in context of plant metabolism. A particular focus is laid on the suitability of mathematical approaches to functionally integrate plant metabolomics data in a metabolic network and combine it with other biochemical or physiological parameters.

Thermal conductivity model for nanofiber networks

Science.gov (United States)

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

2018-02-01

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

Thermal conductivity model for nanofiber networks

Energy Technology Data Exchange (ETDEWEB)

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

2018-02-28

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

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

Modeling Epidemics Spreading on Social Contact Networks.

Science.gov (United States)

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

2015-09-01

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

Port Hamiltonian modeling of Power Networks

NARCIS (Netherlands)

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

2012-01-01

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

Graphical Model Theory for Wireless Sensor Networks

International Nuclear Information System (INIS)

Davis, William B.

2002-01-01

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

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.

Stochastic actor-oriented models for network change

NARCIS (Netherlands)

Snijders, T.A.B.

1996-01-01

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

Haematological and biochemical effects of polyphenolics in animal models.

Science.gov (United States)

Gnanamani, Arumugam; Sudha, Munusamy; Deepa, G; Sudha, M; Deivanai, K; Sadulla, S

2008-07-01

Polyphenols of natural and synthetic origin are exploited in tanning sector to convert putrescible skin/hide to non-putrescible leather. However, only 30-40% of the inputs have been taken up for processing, the remaining is released as unspent. The existing conventional wastewater treatment systems are inefficient in removing or degrading these unspent polyphenols and thus detrimental to ecosystem. The present study demonstrates the evaluation of impact of both synthetic and natural polyphenols on biochemical and haematological properties of blood and serum in animal models. The results reveal that concentrations of polyphenols play a major role. At higher concentrations, irrespective of their nature, there was a marked change in the lipid profile (81% reduction), followed by insignificant change in glucose levels, RBC and WBC counts and other haematological parameters. At lower concentrations, no significant changes in the above said properties were observed.

Mean field interaction in biochemical reaction networks

KAUST Repository

Tembine, Hamidou

2011-09-01

In this paper we establish a relationship between chemical dynamics and mean field game dynamics. We show that chemical reaction networks can be studied using noisy mean field limits. We provide deterministic, noisy and switching mean field limits and illustrate them with numerical examples. © 2011 IEEE.

Hybrid neural network bushing model for vehicle dynamics simulation

International Nuclear Information System (INIS)

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

2008-01-01

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

Mathematical model of highways network optimization

Science.gov (United States)

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

2017-12-01

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

Neural network modeling of associative memory: Beyond the Hopfield model

Science.gov (United States)

Dasgupta, Chandan

1992-07-01

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

Sparsity in Model Gene Regulatory Networks

International Nuclear Information System (INIS)

Zagorski, M.

2011-01-01

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

A computational approach to extinction events in chemical reaction networks with discrete state spaces.

Science.gov (United States)

Johnston, Matthew D

2017-12-01

Recent work of Johnston et al. has produced sufficient conditions on the structure of a chemical reaction network which guarantee that the corresponding discrete state space system exhibits an extinction event. The conditions consist of a series of systems of equalities and inequalities on the edges of a modified reaction network called a domination-expanded reaction network. In this paper, we present a computational implementation of these conditions written in Python and apply the program on examples drawn from the biochemical literature. We also run the program on 458 models from the European Bioinformatics Institute's BioModels Database and report our results. Copyright © 2017 Elsevier Inc. All rights reserved.

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

Science.gov (United States)

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

2005-01-01

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

Optimal transportation networks models and theory

CERN Document Server

Bernot, Marc; Morel, Jean-Michel

2009-01-01

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

Northern emporia and maritime networks. Modelling past communication using archaeological network analysis

DEFF Research Database (Denmark)

Sindbæk, Søren Michael

2015-01-01

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...... this is not a problem of network analysis, but network synthesis: theclassic problem of cracking codes or reconstructing black-box circuits. It is proposedthat archaeological approaches to network synthesis must involve a contextualreading of network data: observations arising from individual contexts, morphologies...

Road network safety evaluation using Bayesian hierarchical joint model.

Science.gov (United States)

Wang, Jie; Huang, Helai

2016-05-01

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

Modeling online social networks based on preferential linking

International Nuclear Information System (INIS)

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

2012-01-01

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

Stabilization of model-based networked control systems

Energy Technology Data Exchange (ETDEWEB)

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

2016-06-08

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

Discrete dynamic modeling of cellular signaling networks.

Science.gov (United States)

Albert, Réka; Wang, Rui-Sheng

2009-01-01

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

Neural network tagging in a toy model

International Nuclear Information System (INIS)

Milek, Marko; Patel, Popat

1999-01-01

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

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

Energy Technology Data Exchange (ETDEWEB)

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

2011-11-11

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

Improved Maximum Parsimony Models for Phylogenetic Networks.

Science.gov (United States)

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

2018-05-01

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

Canalization and control in automata networks: body segmentation in Drosophila melanogaster.

Directory of Open Access Journals (Sweden)

Manuel Marques-Pita

Full Text Available We present schema redescription as a methodology to characterize canalization in automata networks used to model biochemical regulation and signalling. In our formulation, canalization becomes synonymous with redundancy present in the logic of automata. This results in straightforward measures to quantify canalization in an automaton (micro-level, which is in turn integrated into a highly scalable framework to characterize the collective dynamics of large-scale automata networks (macro-level. This way, our approach provides a method to link micro- to macro-level dynamics--a crux of complexity. Several new results ensue from this methodology: uncovering of dynamical modularity (modules in the dynamics rather than in the structure of networks, identification of minimal conditions and critical nodes to control the convergence to attractors, simulation of dynamical behaviour from incomplete information about initial conditions, and measures of macro-level canalization and robustness to perturbations. We exemplify our methodology with a well-known model of the intra- and inter cellular genetic regulation of body segmentation in Drosophila melanogaster. We use this model to show that our analysis does not contradict any previous findings. But we also obtain new knowledge about its behaviour: a better understanding of the size of its wild-type attractor basin (larger than previously thought, the identification of novel minimal conditions and critical nodes that control wild-type behaviour, and the resilience of these to stochastic interventions. Our methodology is applicable to any complex network that can be modelled using automata, but we focus on biochemical regulation and signalling, towards a better understanding of the (decentralized control that orchestrates cellular activity--with the ultimate goal of explaining how do cells and tissues 'compute'.

Canalization and control in automata networks: body segmentation in Drosophila melanogaster.

Science.gov (United States)

Marques-Pita, Manuel; Rocha, Luis M

2013-01-01

We present schema redescription as a methodology to characterize canalization in automata networks used to model biochemical regulation and signalling. In our formulation, canalization becomes synonymous with redundancy present in the logic of automata. This results in straightforward measures to quantify canalization in an automaton (micro-level), which is in turn integrated into a highly scalable framework to characterize the collective dynamics of large-scale automata networks (macro-level). This way, our approach provides a method to link micro- to macro-level dynamics--a crux of complexity. Several new results ensue from this methodology: uncovering of dynamical modularity (modules in the dynamics rather than in the structure of networks), identification of minimal conditions and critical nodes to control the convergence to attractors, simulation of dynamical behaviour from incomplete information about initial conditions, and measures of macro-level canalization and robustness to perturbations. We exemplify our methodology with a well-known model of the intra- and inter cellular genetic regulation of body segmentation in Drosophila melanogaster. We use this model to show that our analysis does not contradict any previous findings. But we also obtain new knowledge about its behaviour: a better understanding of the size of its wild-type attractor basin (larger than previously thought), the identification of novel minimal conditions and critical nodes that control wild-type behaviour, and the resilience of these to stochastic interventions. Our methodology is applicable to any complex network that can be modelled using automata, but we focus on biochemical regulation and signalling, towards a better understanding of the (decentralized) control that orchestrates cellular activity--with the ultimate goal of explaining how do cells and tissues 'compute'.

Equity venture capital platform model based on complex network

Science.gov (United States)

Guo, Dongwei; Zhang, Lanshu; Liu, Miao

2018-05-01

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

Resolving structural variability in network models and the brain.

Directory of Open Access Journals (Sweden)

Florian Klimm

2014-03-01

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

Estimation of parameter sensitivities for stochastic reaction networks

KAUST Repository

Gupta, Ankit

2016-01-07

Quantification of the effects of parameter uncertainty is an important and challenging problem in Systems Biology. We consider this problem in the context of stochastic models of biochemical reaction networks where the dynamics is described as a continuous-time Markov chain whose states represent the molecular counts of various species. For such models, effects of parameter uncertainty are often quantified by estimating the infinitesimal sensitivities of some observables with respect to model parameters. The aim of this talk is to present a holistic approach towards this problem of estimating parameter sensitivities for stochastic reaction networks. Our approach is based on a generic formula which allows us to construct efficient estimators for parameter sensitivity using simulations of the underlying model. We will discuss how novel simulation techniques, such as tau-leaping approximations, multi-level methods etc. can be easily integrated with our approach and how one can deal with stiff reaction networks where reactions span multiple time-scales. We will demonstrate the efficiency and applicability of our approach using many examples from the biological literature.

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.

Innovative research of AD HOC network mobility model

Science.gov (United States)

Chen, Xin

2017-08-01

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

Building functional networks of spiking model neurons.

Science.gov (United States)

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

2016-03-01

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

LeishCyc: a biochemical pathways database for Leishmania major

Directory of Open Access Journals (Sweden)

Doyle Maria A

2009-06-01

Full Text Available Abstract Background Leishmania spp. are sandfly transmitted protozoan parasites that cause a spectrum of diseases in more than 12 million people worldwide. Much research is now focusing on how these parasites adapt to the distinct nutrient environments they encounter in the digestive tract of the sandfly vector and the phagolysosome compartment of mammalian macrophages. While data mining and annotation of the genomes of three Leishmania species has provided an initial inventory of predicted metabolic components and associated pathways, resources for integrating this information into metabolic networks and incorporating data from transcript, protein, and metabolite profiling studies is currently lacking. The development of a reliable, expertly curated, and widely available model of Leishmania metabolic networks is required to facilitate systems analysis, as well as discovery and prioritization of new drug targets for this important human pathogen. Description The LeishCyc database was initially built from the genome sequence of Leishmania major (v5.2, based on the annotation published by the Wellcome Trust Sanger Institute. LeishCyc was manually curated to remove errors, correct automated predictions, and add information from the literature. The ongoing curation is based on public sources, literature searches, and our own experimental and bioinformatics studies. In a number of instances we have improved on the original genome annotation, and, in some ambiguous cases, collected relevant information from the literature in order to help clarify gene or protein annotation in the future. All genes in LeishCyc are linked to the corresponding entry in GeneDB (Wellcome Trust Sanger Institute. Conclusion The LeishCyc database describes Leishmania major genes, gene products, metabolites, their relationships and biochemical organization into metabolic pathways. LeishCyc provides a systematic approach to organizing the evolving information about Leishmania

SPLAI: Computational Finite Element Model for Sensor Networks

Directory of Open Access Journals (Sweden)

Ruzana Ishak

2006-01-01

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

Campus network security model study

Science.gov (United States)

Zhang, Yong-ku; Song, Li-ren

2011-12-01

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

Autonomous bio-chemical decontaminator (ABCD) against weapons of mass destruction

Science.gov (United States)

Hyacinthe, Berg P.

2006-05-01

The proliferation of weapons of mass destruction (WMD) and the use of such elements pose an eminent asymmetric threat with disastrous consequences to the national security of any nation. In particular, the use of biochemical warfare agents against civilians and unprotected troops in international conflicts or by terrorists against civilians is considered as a very peculiar threat. Accordingly, taking a quarantine-before-inhalation approach to biochemical warfare, the author introduces the notion of autonomous biochemical decontamination against WMD. In the unfortunate event of a biochemical attack, the apparatus proposed herein is intended to automatically detect, identify, and more importantly neutralize a biochemical threat. Along with warnings concerning a cyber-WMD nexus, various sections cover discussions on human senses and computer sensors, corroborating evidence related to detection and neutralization of chemical toxins, and cyber-assisted olfaction in stand alone, peer-to-peer, and network settings. In essence, the apparatus can be used in aviation and mass transit security to initiate mass decontamination by dispersing a decontaminant aerosol or to protect the public water supply against a potential bioterrorist attack. Future effort may involve a system-on-chip (SoC) embodiment of this apparatus that allows a safer environment for the emerging phenomenon of cyber-assisted olfaction and morph cell phones into ubiquitous sensors/decontaminators. Although this paper covers mechanisms and protocols to avail a neutralizing substance, further research will need to explore the substance's various pharmacological profiles and potential side effects.

Modeling fluid transport in 2d paper networks

Science.gov (United States)

Tirapu Azpiroz, Jaione; Fereira Silva, Ademir; Esteves Ferreira, Matheus; Lopez Candela, William Fernando; Bryant, Peter William; Ohta, Ricardo Luis; Engel, Michael; Steiner, Mathias Bernhard

2018-02-01

Paper-based microfluidic devices offer great potential as a low-cost platform to perform chemical and biochemical tests. Commercially available formats such as dipsticks and lateral-flow test devices are widely popular as they are easy to handle and produce fast and unambiguous results. While these simple devices lack precise control over the flow to enable integration of complex functionality for multi-step processes or the ability to multiplex several tests, intense research in this area is rapidly expanding the possibilities. Modeling and simulation is increasingly more instrumental in gaining insight into the underlying physics driving the processes inside the channels, however simulation of flow in paper-based microfluidic devices has barely been explored to aid in the optimum design and prototyping of these devices for precise control of the flow. In this paper, we implement a multiphase fluid flow model through porous media for the simulation of paper imbibition of an incompressible, Newtonian fluid such as when water, urine or serum is employed. The formulation incorporates mass and momentum conservation equations under Stokes flow conditions and results in two coupled Darcy's law equations for the pressures and saturations of the wetting and non-wetting phases, further simplified to the Richard's equation for the saturation of the wetting fluid, which is then solved using a Finite Element solver. The model tracks the wetting fluid front as it displaces the non-wetting fluid by computing the time-dependent saturation of the wetting fluid. We apply this to the study of liquid transport in two-dimensional paper networks and validate against experimental data concerning the wetting dynamics of paper layouts of varying geometries.

Functional model of biological neural networks.

Science.gov (United States)

Lo, James Ting-Ho

2010-12-01

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

Stability of a neural network model with small-world connections

International Nuclear Information System (INIS)

Li Chunguang; Chen Guanrong

2003-01-01

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

Combinatorial explosion in model gene networks

Science.gov (United States)

Edwards, R.; Glass, L.

2000-09-01

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

Continuum Modeling of Biological Network Formation

KAUST Repository

Albi, Giacomo

2017-04-10

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

Modelling pollutant deposition to vegetation: scaling down from the canopy to the biochemical level

International Nuclear Information System (INIS)

Taylor, G.E. Jr.; Constable, J.V.H.

1994-01-01

In the atmosphere, pollutants exist in either the gas, particle or liquid (rain and cloud water) phase. The most important gas-phase pollutants from a biological or ecological perspective are oxides of nitrogen (nitrogen dioxide, nitric acid vapor), oxides of sulfur (sulfur dioxide), ammonia, tropospheric ozone and mercury vapor. For liquid or particle phase pollutants, the suite of pollutants is varied and includes hydrogen ion, multiple heavy metals, and select anions. For many of these pollutants, plant canopies are a major sink within continental landscapes, and deposition is highly dependent on the (i) physical form or phase of the pollutant, (ii) meteorological conditions above and within the plant canopy, and (iii) physiological or biochemical properties of the leaf, both on the leaf surface and within the leaf interior. In large measure, the physical and chemical processes controlling deposition at the meteorological and whole-canopy levels are well characterized and have been mathematically modelled. In contrast, the processes operating on the leaf surface and within the leaf interior are not well understood and are largely specific for individual pollutants. The availability of process-level models to estimate deposition is discussed briefly at the canopy and leaf level; however, the majority of effort is devoted to modelling deposition at the leaf surface and leaf interior using the two-layer stagnant film model. This model places a premium on information of a physiological and biochemical nature, and highlights the need to distinguish clearly between the measurements of atmospheric chemistry and the physiologically effective exposure since the two may be very dissimilar. A case study of deposition in the Los Angeles Basin is used to demonstrate the modelling approach, to present the concept of exposure dynamics in the atmosphere versus that in the leaf interior, and to document the principle that most forest canopies are exposed to multiple chemical

Modelling the impact of social network on energy savings

International Nuclear Information System (INIS)

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

2016-01-01

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

Settings in Social Networks : a Measurement Model

NARCIS (Netherlands)

Schweinberger, Michael; Snijders, Tom A.B.

2003-01-01

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

An endogenous model of the credit network

Science.gov (United States)

He, Jianmin; Sui, Xin; Li, Shouwei

2016-01-01

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

A last updating evolution model for online social networks

Science.gov (United States)

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

2013-05-01

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

Mathematical modelling of complex contagion on clustered networks

Science.gov (United States)

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

2015-09-01

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

Mathematical modelling of complex contagion on clustered networks

Directory of Open Access Journals (Sweden)

David J. P. O'Sullivan

2015-09-01

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

Phenomenological network models: Lessons for epilepsy surgery.

Science.gov (United States)

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

2017-10-01

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

Dynamic thermo-hydraulic model of district cooling networks

International Nuclear Information System (INIS)

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

2016-01-01

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

Dynamic Pathloss Model for Future Mobile Communication Networks

DEFF Research Database (Denmark)

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

2016-01-01

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

Modeling the reemergence of information diffusion in social network

Science.gov (United States)

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

2018-01-01

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

Joint Modelling of Structural and Functional Brain Networks

DEFF Research Database (Denmark)

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

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

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.

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

An evolving model of online bipartite networks

Science.gov (United States)

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

2013-12-01

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

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.

Systems and methods for modeling and analyzing networks

Science.gov (United States)

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

2013-10-29

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

Mathematical model of flagella gene expression dynamics in Salmonella enterica serovar typhimurium

OpenAIRE

Jain, Kirti; Pradhan, Amit; Mokashi, Chaitanya; Saini, Supreet

2015-01-01

Flagellar assembly in Salmonella is controlled by an intricate genetic and biochemical network. This network comprises of a number of inter-connected feedback loops, which control the assembly process dynamically. Critical among these are the FliA–FlgM feedback, FliZ-mediated positive feedback, and FliT-mediated negative feedback. In this work, we develop a mathematical model to track the dynamics of flagellar gene expression in Salmonella. Analysis of our model demonstrates that the network ...

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

African Journals Online (AJOL)

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

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

Directory of Open Access Journals (Sweden)

Haibo Zhang

2016-08-01

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

Thermodynamically consistent Bayesian analysis of closed biochemical reaction systems

Directory of Open Access Journals (Sweden)

Goutsias John

2010-11-01

Full Text Available Abstract Background Estimating the rate constants of a biochemical reaction system with known stoichiometry from noisy time series measurements of molecular concentrations is an important step for building predictive models of cellular function. Inference techniques currently available in the literature may produce rate constant values that defy necessary constraints imposed by the fundamental laws of thermodynamics. As a result, these techniques may lead to biochemical reaction systems whose concentration dynamics could not possibly occur in nature. Therefore, development of a thermodynamically consistent approach for estimating the rate constants of a biochemical reaction system is highly desirable. Results We introduce a Bayesian analysis approach for computing thermodynamically consistent estimates of the rate constants of a closed biochemical reaction system with known stoichiometry given experimental data. Our method employs an appropriately designed prior probability density function that effectively integrates fundamental biophysical and thermodynamic knowledge into the inference problem. Moreover, it takes into account experimental strategies for collecting informative observations of molecular concentrations through perturbations. The proposed method employs a maximization-expectation-maximization algorithm that provides thermodynamically feasible estimates of the rate constant values and computes appropriate measures of estimation accuracy. We demonstrate various aspects of the proposed method on synthetic data obtained by simulating a subset of a well-known model of the EGF/ERK signaling pathway, and examine its robustness under conditions that violate key assumptions. Software, coded in MATLAB®, which implements all Bayesian analysis techniques discussed in this paper, is available free of charge at http://www.cis.jhu.edu/~goutsias/CSS%20lab/software.html. Conclusions Our approach provides an attractive statistical methodology for

Research on network information security model and system construction

OpenAIRE

Wang Haijun

2016-01-01

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

Modeling Temporal Evolution and Multiscale Structure in Networks

DEFF Research Database (Denmark)

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

2013-01-01

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

The Kuramoto model in complex networks

Science.gov (United States)

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

2016-01-01

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

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

Directory of Open Access Journals (Sweden)

Mohammad Taghi Ameli

2012-01-01

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

Mathematical Modelling Plant Signalling Networks

KAUST Repository

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

2013-01-01

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

Evaluation of EOR Processes Using Network Models

DEFF Research Database (Denmark)

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

1998-01-01

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

Modeling Insurgent Network Structure and Dynamics

Science.gov (United States)

Gabbay, Michael; Thirkill-Mackelprang, Ashley

2010-03-01

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

MATLAB-Based Teaching Modules in Biochemical Engineering

Science.gov (United States)

Lee, Kilho; Comolli, Noelle K.; Kelly, William J.; Huang, Zuyi

2015-01-01

Mathematical models play an important role in biochemical engineering. For example, the models developed in the field of systems biology have been used to identify drug targets to treat pathogens such as Pseudomonas aeruginosa in biofilms. In addition, competitive binding models for chromatography processes have been developed to predict expanded…

The fractional diffusion limit of a kinetic model with biochemical pathway

Science.gov (United States)

Perthame, Benoît; Sun, Weiran; Tang, Min

2018-06-01

Kinetic-transport equations that take into account the intracellular pathways are now considered as the correct description of bacterial chemotaxis by run and tumble. Recent mathematical studies have shown their interest and their relations to more standard models. Macroscopic equations of Keller-Segel type have been derived using parabolic scaling. Due to the randomness of receptor methylation or intracellular chemical reactions, noise occurs in the signaling pathways and affects the tumbling rate. Then comes the question to understand the role of an internal noise on the behavior of the full population. In this paper we consider a kinetic model for chemotaxis which includes biochemical pathway with noises. We show that under proper scaling and conditions on the tumbling frequency as well as the form of noise, fractional diffusion can arise in the macroscopic limits of the kinetic equation. This gives a new mathematical theory about how long jumps can be due to the internal noise of the bacteria.

Discriminating model for diagnosis of basal cell carcinoma and melanoma in vitro based on the Raman spectra of selected biochemicals

Science.gov (United States)

Silveira, Landulfo; Silveira, Fabrício Luiz; Bodanese, Benito; Zângaro, Renato Amaro; Pacheco, Marcos Tadeu T.

2012-07-01

Raman spectroscopy has been employed to identify differences in the biochemical constitution of malignant [basal cell carcinoma (BCC) and melanoma (MEL)] cells compared to normal skin tissues, with the goal of skin cancer diagnosis. We collected Raman spectra from compounds such as proteins, lipids, and nucleic acids, which are expected to be represented in human skin spectra, and developed a linear least-squares fitting model to estimate the contributions of these compounds to the tissue spectra. We used a set of 145 spectra from biopsy fragments of normal (30 spectra), BCC (96 spectra), and MEL (19 spectra) skin tissues, collected using a near-infrared Raman spectrometer (830 nm, 50 to 200 mW, and 20 s exposure time) coupled to a Raman probe. We applied the best-fitting model to the spectra of biochemicals and tissues, hypothesizing that the relative spectral contribution of each compound to the tissue Raman spectrum changes according to the disease. We verified that actin, collagen, elastin, and triolein were the most important biochemicals representing the spectral features of skin tissues. A classification model applied to the relative contribution of collagen III, elastin, and melanin using Euclidean distance as a discriminator could differentiate normal from BCC and MEL.

Accurate atom-mapping computation for biochemical reactions.

Science.gov (United States)

Latendresse, Mario; Malerich, Jeremiah P; Travers, Mike; Karp, Peter D

2012-11-26

The complete atom mapping of a chemical reaction is a bijection of the reactant atoms to the product atoms that specifies the terminus of each reactant atom. Atom mapping of biochemical reactions is useful for many applications of systems biology, in particular for metabolic engineering where synthesizing new biochemical pathways has to take into account for the number of carbon atoms from a source compound that are conserved in the synthesis of a target compound. Rapid, accurate computation of the atom mapping(s) of a biochemical reaction remains elusive despite significant work on this topic. In particular, past researchers did not validate the accuracy of mapping algorithms. We introduce a new method for computing atom mappings called the minimum weighted edit-distance (MWED) metric. The metric is based on bond propensity to react and computes biochemically valid atom mappings for a large percentage of biochemical reactions. MWED models can be formulated efficiently as Mixed-Integer Linear Programs (MILPs). We have demonstrated this approach on 7501 reactions of the MetaCyc database for which 87% of the models could be solved in less than 10 s. For 2.1% of the reactions, we found multiple optimal atom mappings. We show that the error rate is 0.9% (22 reactions) by comparing these atom mappings to 2446 atom mappings of the manually curated Kyoto Encyclopedia of Genes and Genomes (KEGG) RPAIR database. To our knowledge, our computational atom-mapping approach is the most accurate and among the fastest published to date. The atom-mapping data will be available in the MetaCyc database later in 2012; the atom-mapping software will be available within the Pathway Tools software later in 2012.

Spatial-temporal modeling of malware propagation in networks.

Science.gov (United States)

Chen, Zesheng; Ji, Chuanyi

2005-09-01

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

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.

An evolving network model with modular growth

International Nuclear Information System (INIS)

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

2012-01-01

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

Dynamics in steady state in vitro acto-myosin networks

International Nuclear Information System (INIS)

Sonn-Segev, Adar; Roichman, Yael; Bernheim-Groswasser, Anne

2017-01-01

It is well known that many biochemical processes in the cell such as gene regulation, growth signals and activation of ion channels, rely on mechanical stimuli. However, the mechanism by which mechanical signals propagate through cells is not as well understood. In this review we focus on stress propagation in a minimal model for cell elasticity, actomyosin networks, which are comprised of a sub-family of cytoskeleton proteins. After giving an overview of th actomyosin network components, structure and evolution we review stress propagation in these materials as measured through the correlated motion of tracer beads. We also discuss the possibility to extract structural features of these networks from the same experiments. We show that stress transmission through these networks has two pathways, a quickly dissipative one through the bulk, and a long ranged weakly dissipative one through the pre-stressed actin network. (topical review)

Numerical simulations of a reduced model for blood coagulation

Science.gov (United States)

Pavlova, Jevgenija; Fasano, Antonio; Sequeira, Adélia

2016-04-01

In this work, the three-dimensional numerical resolution of a complex mathematical model for the blood coagulation process is presented. The model was illustrated in Fasano et al. (Clin Hemorheol Microcirc 51:1-14, 2012), Pavlova et al. (Theor Biol 380:367-379, 2015). It incorporates the action of the biochemical and cellular components of blood as well as the effects of the flow. The model is characterized by a reduction in the biochemical network and considers the impact of the blood slip at the vessel wall. Numerical results showing the capacity of the model to predict different perturbations in the hemostatic system are discussed.

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

Directory of Open Access Journals (Sweden)

Wang Hao

2016-01-01

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

UAV Trajectory Modeling Using Neural Networks

Science.gov (United States)

Xue, Min

2017-01-01

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

Modeling Evolution on Nearly Neutral Network Fitness Landscapes

Science.gov (United States)

Yakushkina, Tatiana; Saakian, David B.

2017-08-01

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

Model for the growth of the world airline network

Science.gov (United States)

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

2016-06-01

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

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.

Modeling the propagation of mobile malware on complex networks

Science.gov (United States)

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

2016-08-01

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

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.

Network Design Models for Container Shipping

DEFF Research Database (Denmark)

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

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

Dynamic Evolution Model Based on Social Network Services

Science.gov (United States)

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

2013-11-01

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

A growing social network model in geographical space

Science.gov (United States)

Antonioni, Alberto; Tomassini, Marco

2017-09-01

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

Large-scale networks in engineering and life sciences

CERN Document Server

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

2014-01-01

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

The role of networks and artificial intelligence in nanotechnology design and analysis.

Science.gov (United States)

Hudson, D L; Cohen, M E

2004-05-01

Techniques with their origins in artificial intelligence have had a great impact on many areas of biomedicine. Expert-based systems have been used to develop computer-assisted decision aids. Neural networks have been used extensively in disease classification and more recently in many bioinformatics applications including genomics and drug design. Network theory in general has proved useful in modeling all aspects of biomedicine from healthcare organizational structure to biochemical pathways. These methods show promise in applications involving nanotechnology both in the design phase and in interpretation of system functioning.

Integration of genome-scale metabolic networks into whole-body PBPK models shows phenotype-specific cases of drug-induced metabolic perturbation.

Science.gov (United States)

Cordes, Henrik; Thiel, Christoph; Baier, Vanessa; Blank, Lars M; Kuepfer, Lars

2018-01-01

Drug-induced perturbations of the endogenous metabolic network are a potential root cause of cellular toxicity. A mechanistic understanding of such unwanted side effects during drug therapy is therefore vital for patient safety. The comprehensive assessment of such drug-induced injuries requires the simultaneous consideration of both drug exposure at the whole-body and resulting biochemical responses at the cellular level. We here present a computational multi-scale workflow that combines whole-body physiologically based pharmacokinetic (PBPK) models and organ-specific genome-scale metabolic network (GSMN) models through shared reactions of the xenobiotic metabolism. The applicability of the proposed workflow is illustrated for isoniazid, a first-line antibacterial agent against Mycobacterium tuberculosis , which is known to cause idiosyncratic drug-induced liver injuries (DILI). We combined GSMN models of a human liver with N-acetyl transferase 2 (NAT2)-phenotype-specific PBPK models of isoniazid. The combined PBPK-GSMN models quantitatively describe isoniazid pharmacokinetics, as well as intracellular responses, and changes in the exometabolome in a human liver following isoniazid administration. Notably, intracellular and extracellular responses identified with the PBPK-GSMN models are in line with experimental and clinical findings. Moreover, the drug-induced metabolic perturbations are distributed and attenuated in the metabolic network in a phenotype-dependent manner. Our simulation results show that a simultaneous consideration of both drug pharmacokinetics at the whole-body and metabolism at the cellular level is mandatory to explain drug-induced injuries at the patient level. The proposed workflow extends our mechanistic understanding of the biochemistry underlying adverse events and may be used to prevent drug-induced injuries in the future.

Hybrid simulation models of production networks

CERN Document Server

Kouikoglou, Vassilis S

2001-01-01

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

Network Modeling and Simulation A Practical Perspective

CERN Document Server

Guizani, Mohsen; Khan, Bilal

2010-01-01

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

Performance modeling, stochastic networks, and statistical multiplexing

CERN Document Server

Mazumdar, Ravi R

2013-01-01

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

Switching performance of OBS network model under prefetched real traffic

Science.gov (United States)

Huang, Zhenhua; Xu, Du; Lei, Wen

2005-11-01

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

Modeling and control of magnetorheological fluid dampers using neural networks

Science.gov (United States)

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

2005-02-01

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

Programming biological models in Python using PySB.

Science.gov (United States)

Lopez, Carlos F; Muhlich, Jeremy L; Bachman, John A; Sorger, Peter K

2013-01-01

Mathematical equations are fundamental to modeling biological networks, but as networks get large and revisions frequent, it becomes difficult to manage equations directly or to combine previously developed models. Multiple simultaneous efforts to create graphical standards, rule-based languages, and integrated software workbenches aim to simplify biological modeling but none fully meets the need for transparent, extensible, and reusable models. In this paper we describe PySB, an approach in which models are not only created using programs, they are programs. PySB draws on programmatic modeling concepts from little b and ProMot, the rule-based languages BioNetGen and Kappa and the growing library of Python numerical tools. Central to PySB is a library of macros encoding familiar biochemical actions such as binding, catalysis, and polymerization, making it possible to use a high-level, action-oriented vocabulary to construct detailed models. As Python programs, PySB models leverage tools and practices from the open-source software community, substantially advancing our ability to distribute and manage the work of testing biochemical hypotheses. We illustrate these ideas using new and previously published models of apoptosis.

Analysis and logical modeling of biological signaling transduction networks

Science.gov (United States)

Sun, Zhongyao

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

UAV Trajectory Modeling Using Neural Networks

Science.gov (United States)

Xue, Min

2017-01-01

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

Autocatalytic sets in a partitioned biochemical network.

Science.gov (United States)

Smith, Joshua I; Steel, Mike; Hordijk, Wim

2014-01-01

In previous work, RAF theory has been developed as a tool for making theoretical progress on the origin of life question, providing insight into the structure and occurrence of self-sustaining and collectively autocatalytic sets within catalytic polymer networks. We present here an extension in which there are two "independent" polymer sets, where catalysis occurs within and between the sets, but there are no reactions combining polymers from both sets. Such an extension reflects the interaction between nucleic acids and peptides observed in modern cells and proposed forms of early life. We present theoretical work and simulations which suggest that the occurrence of autocatalytic sets is robust to the partitioned structure of the network. We also show that autocatalytic sets remain likely even when the molecules in the system are not polymers, and a low level of inhibition is present. Finally, we present a kinetic extension which assigns a rate to each reaction in the system, and show that identifying autocatalytic sets within such a system is an NP-complete problem. Recent experimental work has challenged the necessity of an RNA world by suggesting that peptide-nucleic acid interactions occurred early in chemical evolution. The present work indicates that such a peptide-RNA world could support the spontaneous development of autocatalytic sets and is thus a feasible alternative worthy of investigation.

Modeling GMPLS and Optical MPLS Networks

DEFF Research Database (Denmark)

Christiansen, Henrik Lehrmann; Wessing, Henrik

2003-01-01

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

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

Science.gov (United States)

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

2014-06-26

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

Agent Based Modeling on Organizational Dynamics of Terrorist Network

OpenAIRE

Bo Li; Duoyong Sun; Renqi Zhu; Ze Li

2015-01-01

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

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.

Probabilistic sensitivity analysis of biochemical reaction systems.

Science.gov (United States)

Zhang, Hong-Xuan; Dempsey, William P; Goutsias, John

2009-09-07

Sensitivity analysis is an indispensable tool for studying the robustness and fragility properties of biochemical reaction systems as well as for designing optimal approaches for selective perturbation and intervention. Deterministic sensitivity analysis techniques, using derivatives of the system response, have been extensively used in the literature. However, these techniques suffer from several drawbacks, which must be carefully considered before using them in problems of systems biology. We develop here a probabilistic approach to sensitivity analysis of biochemical reaction systems. The proposed technique employs a biophysically derived model for parameter fluctuations and, by using a recently suggested variance-based approach to sensitivity analysis [Saltelli et al., Chem. Rev. (Washington, D.C.) 105, 2811 (2005)], it leads to a powerful sensitivity analysis methodology for biochemical reaction systems. The approach presented in this paper addresses many problems associated with derivative-based sensitivity analysis techniques. Most importantly, it produces thermodynamically consistent sensitivity analysis results, can easily accommodate appreciable parameter variations, and allows for systematic investigation of high-order interaction effects. By employing a computational model of the mitogen-activated protein kinase signaling cascade, we demonstrate that our approach is well suited for sensitivity analysis of biochemical reaction systems and can produce a wealth of information about the sensitivity properties of such systems. The price to be paid, however, is a substantial increase in computational complexity over derivative-based techniques, which must be effectively addressed in order to make the proposed approach to sensitivity analysis more practical.

Computing with competition in biochemical networks.

Science.gov (United States)

Genot, Anthony J; Fujii, Teruo; Rondelez, Yannick

2012-11-16

Cells rely on limited resources such as enzymes or transcription factors to process signals and make decisions. However, independent cellular pathways often compete for a common molecular resource. Competition is difficult to analyze because of its nonlinear global nature, and its role remains unclear. Here we show how decision pathways such as transcription networks may exploit competition to process information. Competition for one resource leads to the recognition of convex sets of patterns, whereas competition for several resources (overlapping or cascaded regulons) allows even more general pattern recognition. Competition also generates surprising couplings, such as correlating species that share no resource but a common competitor. The mechanism we propose relies on three primitives that are ubiquitous in cells: multiinput motifs, competition for a resource, and positive feedback loops.

Modeling biochemical transformation processes and information processing with Narrator.

Science.gov (United States)

Mandel, Johannes J; Fuss, Hendrik; Palfreyman, Niall M; Dubitzky, Werner

2007-03-27

Software tools that model and simulate the dynamics of biological processes and systems are becoming increasingly important. Some of these tools offer sophisticated graphical user interfaces (GUIs), which greatly enhance their acceptance by users. Such GUIs are based on symbolic or graphical notations used to describe, interact and communicate the developed models. Typically, these graphical notations are geared towards conventional biochemical pathway diagrams. They permit the user to represent the transport and transformation of chemical species and to define inhibitory and stimulatory dependencies. A critical weakness of existing tools is their lack of supporting an integrative representation of transport, transformation as well as biological information processing. Narrator is a software tool facilitating the development and simulation of biological systems as Co-dependence models. The Co-dependence Methodology complements the representation of species transport and transformation together with an explicit mechanism to express biological information processing. Thus, Co-dependence models explicitly capture, for instance, signal processing structures and the influence of exogenous factors or events affecting certain parts of a biological system or process. This combined set of features provides the system biologist with a powerful tool to describe and explore the dynamics of life phenomena. Narrator's GUI is based on an expressive graphical notation which forms an integral part of the Co-dependence Methodology. Behind the user-friendly GUI, Narrator hides a flexible feature which makes it relatively easy to map models defined via the graphical notation to mathematical formalisms and languages such as ordinary differential equations, the Systems Biology Markup Language or Gillespie's direct method. This powerful feature facilitates reuse, interoperability and conceptual model development. Narrator is a flexible and intuitive systems biology tool. It is

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

Constraints and entropy in a model of network evolution

Science.gov (United States)

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

2017-11-01

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

Simulation and Statistical Inference of Stochastic Reaction Networks with Applications to Epidemic Models

KAUST Repository

Moraes, Alvaro

2015-01-01

Epidemics have shaped, sometimes more than wars and natural disasters, demo- graphic aspects of human populations around the world, their health habits and their economies. Ebola and the Middle East Respiratory Syndrome (MERS) are clear and current examples of potential hazards at planetary scale. During the spread of an epidemic disease, there are phenomena, like the sudden extinction of the epidemic, that can not be captured by deterministic models. As a consequence, stochastic models have been proposed during the last decades. A typical forward problem in the stochastic setting could be the approximation of the expected number of infected individuals found in one month from now. On the other hand, a typical inverse problem could be, given a discretely observed set of epidemiological data, infer the transmission rate of the epidemic or its basic reproduction number. Markovian epidemic models are stochastic models belonging to a wide class of pure jump processes known as Stochastic Reaction Networks (SRNs), that are intended to describe the time evolution of interacting particle systems where one particle interacts with the others through a finite set of reaction channels. SRNs have been mainly developed to model biochemical reactions but they also have applications in neural networks, virus kinetics, and dynamics of social networks, among others. 4 This PhD thesis is focused on novel fast simulation algorithms and statistical inference methods for SRNs. Our novel Multi-level Monte Carlo (MLMC) hybrid simulation algorithms provide accurate estimates of expected values of a given observable of SRNs at a prescribed final time. They are designed to control the global approximation error up to a user-selected accuracy and up to a certain confidence level, and with near optimal computational work. We also present novel dual-weighted residual expansions for fast estimation of weak and strong errors arising from the MLMC methodology. Regarding the statistical inference

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

African Journals Online (AJOL)

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

A source-controlled data center network model.

Science.gov (United States)

Yu, Yang; Liang, Mangui; Wang, Zhe

2017-01-01

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

A source-controlled data center network model

Science.gov (United States)

Yu, Yang; Liang, Mangui; Wang, Zhe

2017-01-01

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

A Model for Telestrok Network Evaluation

DEFF Research Database (Denmark)

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

2011-01-01

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

Mixture models with entropy regularization for community detection in networks

Science.gov (United States)

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

2018-04-01

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

The International Trade Network: weighted network analysis and modelling

International Nuclear Information System (INIS)

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

2008-01-01

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

[Simulation of vegetation indices optimizing under retrieval of vegetation biochemical parameters based on PROSPECT + SAIL model].

Science.gov (United States)

Wu, Ling; Liu, Xiang-Nan; Zhou, Bo-Tian; Liu, Chuan-Hao; Li, Lu-Feng

2012-12-01

This study analyzed the sensitivities of three vegetation biochemical parameters [chlorophyll content (Cab), leaf water content (Cw), and leaf area index (LAI)] to the changes of canopy reflectance, with the effects of each parameter on the wavelength regions of canopy reflectance considered, and selected three vegetation indices as the optimization comparison targets of cost function. Then, the Cab, Cw, and LAI were estimated, based on the particle swarm optimization algorithm and PROSPECT + SAIL model. The results showed that retrieval efficiency with vegetation indices as the optimization comparison targets of cost function was better than that with all spectral reflectance. The correlation coefficients (R2) between the measured and estimated values of Cab, Cw, and LAI were 90.8%, 95.7%, and 99.7%, and the root mean square errors of Cab, Cw, and LAI were 4.73 microg x cm(-2), 0.001 g x cm(-2), and 0.08, respectively. It was suggested that to adopt vegetation indices as the optimization comparison targets of cost function could effectively improve the efficiency and precision of the retrieval of biochemical parameters based on PROSPECT + SAIL model.

Hybrid network defense model based on fuzzy evaluation.

Science.gov (United States)

Cho, Ying-Chiang; Pan, Jen-Yi

2014-01-01

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

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.

Modeling polyvinyl chloride Plasma Modification by Neural Networks

Science.gov (United States)

Wang, Changquan

2018-03-01

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

Degree distribution of a new model for evolving networks

Indian Academy of Sciences (India)

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

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

CERN Document Server

Baianu, I C

2004-01-01

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

Simulating the formation of keratin filament networks by a piecewise-deterministic Markov process.

Science.gov (United States)

Beil, Michael; Lück, Sebastian; Fleischer, Frank; Portet, Stéphanie; Arendt, Wolfgang; Schmidt, Volker

2009-02-21

Keratin intermediate filament networks are part of the cytoskeleton in epithelial cells. They were found to regulate viscoelastic properties and motility of cancer cells. Due to unique biochemical properties of keratin polymers, the knowledge of the mechanisms controlling keratin network formation is incomplete. A combination of deterministic and stochastic modeling techniques can be a valuable source of information since they can describe known mechanisms of network evolution while reflecting the uncertainty with respect to a variety of molecular events. We applied the concept of piecewise-deterministic Markov processes to the modeling of keratin network formation with high spatiotemporal resolution. The deterministic component describes the diffusion-driven evolution of a pool of soluble keratin filament precursors fueling various network formation processes. Instants of network formation events are determined by a stochastic point process on the time axis. A probability distribution controlled by model parameters exercises control over the frequency of different mechanisms of network formation to be triggered. Locations of the network formation events are assigned dependent on the spatial distribution of the soluble pool of filament precursors. Based on this modeling approach, simulation studies revealed that the architecture of keratin networks mostly depends on the balance between filament elongation and branching processes. The spatial distribution of network mesh size, which strongly influences the mechanical characteristics of filament networks, is modulated by lateral annealing processes. This mechanism which is a specific feature of intermediate filament networks appears to be a major and fast regulator of cell mechanics.