Modified network simulation model with token method of bus access
Directory of Open Access Journals (Sweden)
L.V. Stribulevich
2013-08-01
Full Text Available Purpose. To study the characteristics of the local network with the marker method of access to the bus its modified simulation model was developed. Methodology. Defining characteristics of the network is carried out on the developed simulation model, which is based on the state diagram-layer network station with the mechanism of processing priorities, both in steady state and in the performance of control procedures: the initiation of a logical ring, the entrance and exit of the station network with a logical ring. Findings. A simulation model, on the basis of which can be obtained the dependencies of the application the maximum waiting time in the queue for different classes of access, and the reaction time usable bandwidth on the data rate, the number of network stations, the generation rate applications, the number of frames transmitted per token holding time, frame length was developed. Originality. The technique of network simulation reflecting its work in the steady condition and during the control procedures, the mechanism of priority ranking and handling was proposed. Practical value. Defining network characteristics in the real-time systems on railway transport based on the developed simulation model.
Simulating Social Networks of Online Communities: Simulation as a Method for Sociability Design
Ang, Chee Siang; Zaphiris, Panayiotis
We propose the use of social simulations to study and support the design of online communities. In this paper, we developed an Agent-Based Model (ABM) to simulate and study the formation of social networks in a Massively Multiplayer Online Role Playing Game (MMORPG) guild community. We first analyzed the activities and the social network (who-interacts-with-whom) of an existing guild community to identify its interaction patterns and characteristics. Then, based on the empirical results, we derived and formalized the interaction rules, which were implemented in our simulation. Using the simulation, we reproduced the observed social network of the guild community as a means of validation. The simulation was then used to examine how various parameters of the community (e.g. the level of activity, the number of neighbors of each agent, etc) could potentially influence the characteristic of the social networks.
Simulation of Foam Divot Weight on External Tank Utilizing Least Squares and Neural Network Methods
Chamis, Christos C.; Coroneos, Rula M.
2007-01-01
Simulation of divot weight in the insulating foam, associated with the external tank of the U.S. space shuttle, has been evaluated using least squares and neural network concepts. The simulation required models based on fundamental considerations that can be used to predict under what conditions voids form, the size of the voids, and subsequent divot ejection mechanisms. The quadratic neural networks were found to be satisfactory for the simulation of foam divot weight in various tests associated with the external tank. Both linear least squares method and the nonlinear neural network predicted identical results.
A vascular image registration method based on network structure and circuit simulation.
Chen, Li; Lian, Yuxi; Guo, Yi; Wang, Yuanyuan; Hatsukami, Thomas S; Pimentel, Kristi; Balu, Niranjan; Yuan, Chun
2017-05-02
Image registration is an important research topic in the field of image processing. Applying image registration to vascular image allows multiple images to be strengthened and fused, which has practical value in disease detection, clinical assisted therapy, etc. However, it is hard to register vascular structures with high noise and large difference in an efficient and effective method. Different from common image registration methods based on area or features, which were sensitive to distortion and uncertainty in vascular structure, we proposed a novel registration method based on network structure and circuit simulation. Vessel images were transformed to graph networks and segmented to branches to reduce the calculation complexity. Weighted graph networks were then converted to circuits, in which node voltages of the circuit reflecting the vessel structures were used for node registration. The experiments in the two-dimensional and three-dimensional simulation and clinical image sets showed the success of our proposed method in registration. The proposed vascular image registration method based on network structure and circuit simulation is stable, fault tolerant and efficient, which is a useful complement to the current mainstream image registration methods.
Strychalski, Wanda; Adalsteinsson, David; Elston, Timothy C
2010-01-01
Cells use signaling networks consisting of multiple interacting proteins to respond to changes in their environment. In many situations, such as chemotaxis, spatial and temporal information must be transmitted through the network. Recent computational studies have emphasized the importance of cellular geometry in signal transduction, but have been limited in their ability to accurately represent complex cell morphologies. We present a finite volume method that addresses this problem. Our method uses Cartesian cut cells and is second order in space and time. We use our method to simulate several models of signaling systems in realistic cell morphologies obtained from live cell images and examine the effects of geometry on signal transduction.
Operator Splitting Method for Simulation of Dynamic Flows in Natural Gas Pipeline Networks
Dyachenko, Sergey A; Chertkov, Michael
2016-01-01
We develop an operator splitting method to simulate flows of isothermal compressible natural gas over transmission pipelines. The method solves a system of nonlinear hyperbolic partial differential equations (PDEs) of hydrodynamic type for mass flow and pressure on a metric graph, where turbulent losses of momentum are modeled by phenomenological Darcy-Weisbach friction. Mass flow balance is maintained through the boundary conditions at the network nodes, where natural gas is injected or withdrawn from the system. Gas flow through the network is controlled by compressors boosting pressure at the inlet of the adjoint pipe. Our operator splitting numerical scheme is unconditionally stable and it is second order accurate in space and time. The scheme is explicit, and it is formulated to work with general networks with loops. We test the scheme over range of regimes and network configurations, also comparing its performance with performance of two other state of the art implicit schemes.
Operator splitting method for simulation of dynamic flows in natural gas pipeline networks
Dyachenko, Sergey A.; Zlotnik, Anatoly; Korotkevich, Alexander O.; Chertkov, Michael
2017-12-01
We develop an operator splitting method to simulate flows of isothermal compressible natural gas over transmission pipelines. The method solves a system of nonlinear hyperbolic partial differential equations (PDEs) of hydrodynamic type for mass flow and pressure on a metric graph, where turbulent losses of momentum are modeled by phenomenological Darcy-Weisbach friction. Mass flow balance is maintained through the boundary conditions at the network nodes, where natural gas is injected or withdrawn from the system. Gas flow through the network is controlled by compressors boosting pressure at the inlet of the adjoint pipe. Our operator splitting numerical scheme is unconditionally stable and it is second order accurate in space and time. The scheme is explicit, and it is formulated to work with general networks with loops. We test the scheme over range of regimes and network configurations, also comparing its performance with performance of two other state of the art implicit schemes.
Unified pipe network method for simulation of water flow in fractured porous rock
Ren, Feng; Ma, Guowei; Wang, Yang; Li, Tuo; Zhu, Hehua
2017-04-01
Rock masses are often conceptualized as dual-permeability media containing fractures or fracture networks with high permeability and porous matrix that is less permeable. In order to overcome the difficulties in simulating fluid flow in a highly discontinuous dual-permeability medium, an effective unified pipe network method is developed, which discretizes the dual-permeability rock mass into a virtual pipe network system. It includes fracture pipe networks and matrix pipe networks. They are constructed separately based on equivalent flow models in a representative area or volume by taking the advantage of the orthogonality of the mesh partition. Numerical examples of fluid flow in 2-D and 3-D domain including porous media and fractured porous media are presented to demonstrate the accuracy, robustness, and effectiveness of the proposed unified pipe network method. Results show that the developed method has good performance even with highly distorted mesh. Water recharge into the fractured rock mass with complex fracture network is studied. It has been found in this case that the effect of aperture change on the water recharge rate is more significant in the early stage compared to the fracture density change.
Simulation of two-phase flow in horizontal fracture networks with numerical manifold method
Ma, G. W.; Wang, H. D.; Fan, L. F.; Wang, B.
2017-10-01
The paper presents simulation of two-phase flow in discrete fracture networks with numerical manifold method (NMM). Each phase of fluids is considered to be confined within the assumed discrete interfaces in the present method. The homogeneous model is modified to approach the mixed fluids. A new mathematical cover formation for fracture intersection is proposed to satisfy the mass conservation. NMM simulations of two-phase flow in a single fracture, intersection, and fracture network are illustrated graphically and validated by the analytical method or the finite element method. Results show that the motion status of discrete interface significantly depends on the ratio of mobility of two fluids rather than the value of the mobility. The variation of fluid velocity in each fracture segment and the driven fluid content are also influenced by the ratio of mobility. The advantages of NMM in the simulation of two-phase flow in a fracture network are demonstrated in the present study, which can be further developed for practical engineering applications.
Bernal, Javier; Torres-Jimenez, Jose
2015-01-01
SAGRAD (Simulated Annealing GRADient), a Fortran 77 program for computing neural networks for classification using batch learning, is discussed. Neural network training in SAGRAD is based on a combination of simulated annealing and Møller's scaled conjugate gradient algorithm, the latter a variation of the traditional conjugate gradient method, better suited for the nonquadratic nature of neural networks. Different aspects of the implementation of the training process in SAGRAD are discussed, such as the efficient computation of gradients and multiplication of vectors by Hessian matrices that are required by Møller's algorithm; the (re)initialization of weights with simulated annealing required to (re)start Møller's algorithm the first time and each time thereafter that it shows insufficient progress in reaching a possibly local minimum; and the use of simulated annealing when Møller's algorithm, after possibly making considerable progress, becomes stuck at a local minimum or flat area of weight space. Outlines of the scaled conjugate gradient algorithm, the simulated annealing procedure and the training process used in SAGRAD are presented together with results from running SAGRAD on two examples of training data.
An Efficient Neural Network Based Modeling Method for Automotive EMC Simulation
Frank, Florian; Weigel, Robert
2011-09-01
This paper presents a newly developed methodology for VHDL-AMS model integration into SPICE-based EMC simulations. To this end the VHDL-AMS model, which is available in a compiled version only, is characterized under typical loading conditions, and afterwards a neural network based technique is applied to convert characteristic voltage and current data into an equivalent circuit in SPICE syntax. After the explanation of the whole method and the presentation of a newly developed switched state space dynamic neural network model, the entire analysis process is demonstrated using a typical application from automotive industry.
Simulation tests of the optimization method of Hopfield and Tank using neural networks
Paielli, Russell A.
1988-01-01
The method proposed by Hopfield and Tank for using the Hopfield neural network with continuous valued neurons to solve the traveling salesman problem is tested by simulation. Several researchers have apparently been unable to successfully repeat the numerical simulation documented by Hopfield and Tank. However, as suggested to the author by Adams, it appears that the reason for those difficulties is that a key parameter value is reported erroneously (by four orders of magnitude) in the original paper. When a reasonable value is used for that parameter, the network performs generally as claimed. Additionally, a new method of using feedback to control the input bias currents to the amplifiers is proposed and successfully tested. This eliminates the need to set the input currents by trial and error.
2014-01-01
Background Motif mining has always been a hot research topic in bioinformatics. Most of current research on biological networks focuses on exact motif mining. However, due to the inevitable experimental error and noisy data, biological network data represented as the probability model could better reflect the authenticity and biological significance, therefore, it is more biological meaningful to discover probability motif in uncertain biological networks. One of the key steps in probability motif mining is frequent pattern discovery which is usually based on the possible world model having a relatively high computational complexity. Methods In this paper, we present a novel method for detecting frequent probability patterns based on circuit simulation in the uncertain biological networks. First, the partition based efficient search is applied to the non-tree like subgraph mining where the probability of occurrence in random networks is small. Then, an algorithm of probability isomorphic based on circuit simulation is proposed. The probability isomorphic combines the analysis of circuit topology structure with related physical properties of voltage in order to evaluate the probability isomorphism between probability subgraphs. The circuit simulation based probability isomorphic can avoid using traditional possible world model. Finally, based on the algorithm of probability subgraph isomorphism, two-step hierarchical clustering method is used to cluster subgraphs, and discover frequent probability patterns from the clusters. Results The experiment results on data sets of the Protein-Protein Interaction (PPI) networks and the transcriptional regulatory networks of E. coli and S. cerevisiae show that the proposed method can efficiently discover the frequent probability subgraphs. The discovered subgraphs in our study contain all probability motifs reported in the experiments published in other related papers. Conclusions The algorithm of probability graph isomorphism
IMPROVEMENT OF RECOGNITION QUALITY IN DEEP LEARNING NETWORKS BY SIMULATED ANNEALING METHOD
Directory of Open Access Journals (Sweden)
A. S. Potapov
2014-09-01
Full Text Available The subject of this research is deep learning methods, in which automatic construction of feature transforms is taken place in tasks of pattern recognition. Multilayer autoencoders have been taken as the considered type of deep learning networks. Autoencoders perform nonlinear feature transform with logistic regression as an upper classification layer. In order to verify the hypothesis of possibility to improve recognition rate by global optimization of parameters for deep learning networks, which are traditionally trained layer-by-layer by gradient descent, a new method has been designed and implemented. The method applies simulated annealing for tuning connection weights of autoencoders while regression layer is simultaneously trained by stochastic gradient descent. Experiments held by means of standard MNIST handwritten digit database have shown the decrease of recognition error rate from 1.1 to 1.5 times in case of the modified method comparing to the traditional method, which is based on local optimization. Thus, overfitting effect doesn’t appear and the possibility to improve learning rate is confirmed in deep learning networks by global optimization methods (in terms of increasing recognition probability. Research results can be applied for improving the probability of pattern recognition in the fields, which require automatic construction of nonlinear feature transforms, in particular, in the image recognition. Keywords: pattern recognition, deep learning, autoencoder, logistic regression, simulated annealing.
He, Jieyue; Wang, Chunyan; Qiu, Kunpu; Zhong, Wei
2014-01-01
Motif mining has always been a hot research topic in bioinformatics. Most of current research on biological networks focuses on exact motif mining. However, due to the inevitable experimental error and noisy data, biological network data represented as the probability model could better reflect the authenticity and biological significance, therefore, it is more biological meaningful to discover probability motif in uncertain biological networks. One of the key steps in probability motif mining is frequent pattern discovery which is usually based on the possible world model having a relatively high computational complexity. In this paper, we present a novel method for detecting frequent probability patterns based on circuit simulation in the uncertain biological networks. First, the partition based efficient search is applied to the non-tree like subgraph mining where the probability of occurrence in random networks is small. Then, an algorithm of probability isomorphic based on circuit simulation is proposed. The probability isomorphic combines the analysis of circuit topology structure with related physical properties of voltage in order to evaluate the probability isomorphism between probability subgraphs. The circuit simulation based probability isomorphic can avoid using traditional possible world model. Finally, based on the algorithm of probability subgraph isomorphism, two-step hierarchical clustering method is used to cluster subgraphs, and discover frequent probability patterns from the clusters. The experiment results on data sets of the Protein-Protein Interaction (PPI) networks and the transcriptional regulatory networks of E. coli and S. cerevisiae show that the proposed method can efficiently discover the frequent probability subgraphs. The discovered subgraphs in our study contain all probability motifs reported in the experiments published in other related papers. The algorithm of probability graph isomorphism evaluation based on circuit simulation
Wang, Ting; Plecháč, Petr
2017-12-01
Stochastic reaction networks that exhibit bistable behavior are common in systems biology, materials science, and catalysis. Sampling of stationary distributions is crucial for understanding and characterizing the long-time dynamics of bistable stochastic dynamical systems. However, simulations are often hindered by the insufficient sampling of rare transitions between the two metastable regions. In this paper, we apply the parallel replica method for a continuous time Markov chain in order to improve sampling of the stationary distribution in bistable stochastic reaction networks. The proposed method uses parallel computing to accelerate the sampling of rare transitions. Furthermore, it can be combined with the path-space information bounds for parametric sensitivity analysis. With the proposed methodology, we study three bistable biological networks: the Schlögl model, the genetic switch network, and the enzymatic futile cycle network. We demonstrate the algorithmic speedup achieved in these numerical benchmarks. More significant acceleration is expected when multi-core or graphics processing unit computer architectures and programming tools such as CUDA are employed.
Timetable-based simulation method for choice set generation in large-scale public transport networks
DEFF Research Database (Denmark)
Rasmussen, Thomas Kjær; Anderson, Marie Karen; Nielsen, Otto Anker
2016-01-01
The composition and size of the choice sets are a key for the correct estimation of and prediction by route choice models. While existing literature has posed a great deal of attention towards the generation of path choice sets for private transport problems, the same does not apply to public...... transport problems. This study proposes a timetable-based simulation method for generating path choice sets in a multimodal public transport network. Moreover, this study illustrates the feasibility of its implementation by applying the method to reproduce 5131 real-life trips in the Greater Copenhagen Area...
Packet Tracer network simulator
Jesin, A
2014-01-01
A practical, fast-paced guide that gives you all the information you need to successfully create networks and simulate them using Packet Tracer.Packet Tracer Network Simulator is aimed at students, instructors, and network administrators who wish to use this simulator to learn how to perform networking instead of investing in expensive, specialized hardware. This book assumes that you have a good amount of Cisco networking knowledge, and it will focus more on Packet Tracer rather than networking.
A Multilevel Adaptive Reaction-splitting Simulation Method for Stochastic Reaction Networks
Moraes, Alvaro
2016-07-07
In this work, we present a novel multilevel Monte Carlo method for kinetic simulation of stochastic reaction networks characterized by having simultaneously fast and slow reaction channels. To produce efficient simulations, our method adaptively classifies the reactions channels into fast and slow channels. To this end, we first introduce a state-dependent quantity named level of activity of a reaction channel. Then, we propose a low-cost heuristic that allows us to adaptively split the set of reaction channels into two subsets characterized by either a high or a low level of activity. Based on a time-splitting technique, the increments associated with high-activity channels are simulated using the tau-leap method, while those associated with low-activity channels are simulated using an exact method. This path simulation technique is amenable for coupled path generation and a corresponding multilevel Monte Carlo algorithm. To estimate expected values of observables of the system at a prescribed final time, our method bounds the global computational error to be below a prescribed tolerance, TOL, within a given confidence level. This goal is achieved with a computational complexity of order O(TOL-2), the same as with a pathwise-exact method, but with a smaller constant. We also present a novel low-cost control variate technique based on the stochastic time change representation by Kurtz, showing its performance on a numerical example. We present two numerical examples extracted from the literature that show how the reaction-splitting method obtains substantial gains with respect to the standard stochastic simulation algorithm and the multilevel Monte Carlo approach by Anderson and Higham. © 2016 Society for Industrial and Applied Mathematics.
A hybrid mortar virtual element method for discrete fracture network simulations
Benedetto, Matías Fernando; Berrone, Stefano; Borio, Andrea; Pieraccini, Sandra; Scialò, Stefano
2016-02-01
The most challenging issue in performing underground flow simulations in Discrete Fracture Networks (DFN) is to effectively tackle the geometrical difficulties of the problem. In this work we put forward a new application of the Virtual Element Method combined with the Mortar method for domain decomposition: we exploit the flexibility of the VEM in handling polygonal meshes in order to easily construct meshes conforming to the traces on each fracture, and we resort to the mortar approach in order to ;weakly; impose continuity of the solution on intersecting fractures. The resulting method replaces the need for matching grids between fractures, so that the meshing process can be performed independently for each fracture. Numerical results show optimal convergence and robustness in handling very complex geometries.
A real-time control method-based simulation for high-speed trains on large-scale rail network
Liu, Yutong; Cao, Chengxuan; Zhou, Yaling; Feng, Ziyan
In this paper, an improved real-time control model based on the discrete-time method is constructed to control and simulate the movement of high-speed trains on large-scale rail network. The constraints of acceleration and deceleration are introduced in this model, and a more reasonable definition of the minimal headway is also presented. Considering the complicated rail traffic environment in practice, we propose a set of sound operational strategies to excellently control traffic flow on rail network under various conditions. Several simulation experiments with different parameter combinations are conducted to verify the effectiveness of the control simulation method. The experimental results are similar to realistic environment and some characteristics of rail traffic flow are also investigated, especially the impact of stochastic disturbances and the minimal headway on the rail traffic flow on large-scale rail network, which can better assist dispatchers in analysis and decision-making. Meanwhile, experimental results also demonstrate that the proposed control simulation method can be in real-time control of traffic flow for high-speed trains not only on the simple rail line, but also on the complicated large-scale network such as China’s high-speed rail network and serve as a tool of simulating the traffic flow on large-scale rail network to study the characteristics of rail traffic flow.
Risk assessment of water quality using Monte Carlo simulation and artificial neural network method.
Jiang, Yunchao; Nan, Zhongren; Yang, Sucai
2013-06-15
There is always uncertainty in any water quality risk assessment. A Monte Carlo simulation (MCS) is regarded as a flexible, efficient method for characterizing such uncertainties. However, the required computational effort for MCS-based risk assessment is great, particularly when the number of random variables is large and the complicated water quality models have to be calculated by a computationally expensive numerical method, such as the finite element method (FEM). To address this issue, this paper presents an improved method that incorporates an artificial neural network (ANN) into the MCS to enhance the computational efficiency of conventional risk assessment. The conventional risk assessment uses the FEM to create multiple water quality models, which can be time consuming or cumbersome. In this paper, an ANN model was used as a substitute for the iterative FEM runs, and thus, the number of water quality models that must be calculated can be dramatically reduced. A case study on the chemical oxygen demand (COD) pollution risks in the Lanzhou section of the Yellow River in China was taken as a reference. Compared with the conventional risk assessment method, the ANN-MCS-based method can save much computational effort without a loss of accuracy. The results show that the proposed method in this paper is more applicable to assess water quality risks. Because the characteristics of this ANN-MCS-based technique are quite general, it is hoped that the technique can also be applied to other MCS-based uncertainty analysis in the environmental field. Copyright © 2013 Elsevier Ltd. All rights reserved.
Method of construction of rational corporate network using the simulation model
Directory of Open Access Journals (Sweden)
V.N. Pakhomovа
2013-06-01
Full Text Available Purpose. Search for new options of the transition from Ethernet technology. Methodology. Physical structuring of the Fast Ethernet network based on hubs and logical structuring of Fast Ethernet network using commutators. Organization of VLAN based on ports grouping and in accordance with the standard IEEE 802 .1Q. Findings. The options for improving of the Ethernet network are proposed. According to the Fast Ethernet and VLAN technologies on the simulation models in packages NetCraker and Cisco Packet Traker respectively. Origiality. The technique of designing of local area network using the VLAN technology is proposed. Practical value.Each of the options of "Dniprozaliznychproekt" network improving has its advantages. Transition from the Ethernet to Fast Ethernet technology is simple and economical, it requires only one commutator, when the VLAN organization requires at least two. VLAN technology, however, has the following advantages: reducing the load on the network, isolation of the broadcast traffic, change of the logical network structure without changing its physical structure, improving the network security. The transition from Ethernet to the VLAN technology allows you to separate the physical topology from the logical one, and the format of the ÌEEE 802.1Q standard frames allows you to simplify the process of virtual networks implementation to enterprises.
Barkaoui, Abdelwahed; Tlili, Brahim; Vercher-Martínez, Ana; Hambli, Ridha
2016-10-01
Bone is a living material with a complex hierarchical structure which entails exceptional mechanical properties, including high fracture toughness, specific stiffness and strength. Bone tissue is essentially composed by two phases distributed in approximately 30-70%: an organic phase (mainly type I collagen and cells) and an inorganic phase (hydroxyapatite-HA-and water). The nanostructure of bone can be represented throughout three scale levels where different repetitive structural units or building blocks are found: at the first level, collagen molecules are arranged in a pentameric structure where mineral crystals grow in specific sites. This primary bone structure constitutes the mineralized collagen microfibril. A structural organization of inter-digitating microfibrils forms the mineralized collagen fibril which represents the second scale level. The third scale level corresponds to the mineralized collagen fibre which is composed by the binding of fibrils. The hierarchical nature of the bone tissue is largely responsible of their significant mechanical properties; consequently, this is a current outstanding research topic. Scarce works in literature correlates the elastic properties in the three scale levels at the bone nanoscale. The main goal of this work is to estimate the elastic properties of the bone tissue in a multiscale approach including a sensitivity analysis of the elastic behaviour at each length scale. This proposal is achieved by means of a novel hybrid multiscale modelling that involves neural network (NN) computations and finite elements method (FEM) analysis. The elastic properties are estimated using a neural network simulation that previously has been trained with the database results of the finite element models. In the results of this work, parametric analysis and averaged elastic constants for each length scale are provided. Likewise, the influence of the elastic constants of the tissue constituents is also depicted. Results highlight
Airport Network Flow Simulator
1978-10-01
The Airport Network Flow Simulator is a FORTRAN IV simulation of the flow of air traffic in the nation's 600 commercial airports. It calculates for any group of selected airports: (a) the landing and take-off (Type A) delays; and (b) the gate departu...
DEFF Research Database (Denmark)
Willis, Stephen; Hole, Dave; Collingham, Yvonne
2009-01-01
. In this article, we provide a method to simulate the occurrence of species of conservation concern in protected areas, which could be used as a first-step approach to assess the potential impacts of climate change upon such species in protected areas. We use species-climate response surface models to relate...... technique provides good simulations of current species' occurrence in protected areas. We then use basic habitat data for IBAs along with habitat preference data for the species to reduce over-prediction and further improve predictive ability. This approach can be used with future climate change scenarios...... Area (IBA) network is a series of sites designed to conserve avian diversity in the face of current threats from factors such as habitat loss and fragmentation. However, in common with other networks, the IBA network is based on the assumption that the climate will remain unchanged in the future...
Henker, Stephan; Partzsch, Johannes; Schüffny, René
2012-04-01
With the various simulators for spiking neural networks developed in recent years, a variety of numerical solution methods for the underlying differential equations are available. In this article, we introduce an approach to systematically assess the accuracy of these methods. In contrast to previous investigations, our approach focuses on a completely deterministic comparison and uses an analytically solved model as a reference. This enables the identification of typical sources of numerical inaccuracies in state-of-the-art simulation methods. In particular, with our approach we can separate the error of the numerical integration from the timing error of spike detection and propagation, the latter being prominent in simulations with fixed timestep. To verify the correctness of the testing procedure, we relate the numerical deviations to theoretical predictions for the employed numerical methods. Finally, we give an example of the influence of simulation artefacts on network behaviour and spike-timing-dependent plasticity (STDP), underlining the importance of spike-time accuracy for the simulation of STDP.
Spiking neural network simulation: numerical integration with the Parker-Sochacki method.
Stewart, Robert D; Bair, Wyeth
2009-08-01
Mathematical neuronal models are normally expressed using differential equations. The Parker-Sochacki method is a new technique for the numerical integration of differential equations applicable to many neuronal models. Using this method, the solution order can be adapted according to the local conditions at each time step, enabling adaptive error control without changing the integration timestep. The method has been limited to polynomial equations, but we present division and power operations that expand its scope. We apply the Parker-Sochacki method to the Izhikevich 'simple' model and a Hodgkin-Huxley type neuron, comparing the results with those obtained using the Runge-Kutta and Bulirsch-Stoer methods. Benchmark simulations demonstrate an improved speed/accuracy trade-off for the method relative to these established techniques.
Simulated Associating Polymer Networks
Billen, Joris
Telechelic associating polymer networks consist of polymer chains terminated by endgroups that have a different chemical composition than the polymer backbone. When dissolved in a solution, the endgroups cluster together to form aggregates. At low temperature, a strongly connected reversible network is formed and the system behaves like a gel. Telechelic networks are of interest since they are representative for biopolymer networks (e.g. F-actin) and are widely used in medical applications (e.g. hydrogels for tissue engineering, wound dressings) and consumer products (e.g. contact lenses, paint thickeners). In this thesis such systems are studied by means of a molecular dynamics/Monte Carlo simulation. At first, the system in rest is studied by means of graph theory. The changes in network topology upon cooling to the gel state, are characterized. Hereto an extensive study of the eigenvalue spectrum of the gel network is performed. As a result, an in-depth investigation of the eigenvalue spectra for spatial ER, scale-free, and small-world networks is carried out. Next, the gel under the application of a constant shear is studied, with a focus on shear banding and the changes in topology under shear. Finally, the relation between the gel transition and percolation is discussed.
Directory of Open Access Journals (Sweden)
Brenton J Prettejohn
2011-03-01
Full Text Available Many simulations of networks in computational neuroscience assume completely homogenous random networks of the Erd"{o}s-R'{e}nyi type, or regular networks, despite it being recognized for some time that anatomical brain networks are more complex in their connectivity and can, for example, exhibit the `scale-free' and `small-world' properties. We review the most well known algorithms for constructing networks with given non-homogeneous statistical properties and provide simple pseudo-code for reproducing such networks in software simulations. We also review some useful mathematical results and approximations associated with the statistics that describe these network models, including degree distribution, average path length and clustering coefficient. We demonstrate how such results can be used as partial verification and validation of implementations. Finally, we discuss a sometimes overlooked modeling choice that can be crucially important for the properties of simulated networks: that of network directedness. The most well known network algorithms produce undirected networks, and we emphasize this point by highlighting how simple adaptations can instead produce directed networks.
Welsh, Chris
2013-01-01
GNS3 Network Simulation Guide is an easy-to-follow yet comprehensive guide which is written in a tutorial format helping you grasp all the things you need for accomplishing your certification or simulation goal. If you are a networking professional who wants to learn how to simulate networks using GNS3, this book is ideal for you. The introductory examples within the book only require minimal networking knowledge, but as the book progresses onto more advanced topics, users will require knowledge of TCP/IP and routing.
Simulation Methods for Design of Networked Power Electronics and Information Systems
2014-07-01
and demonstrated the approach on digital signal processor ( DSP ) and field programmable gate array (FPGA) systems, and 5) it explored methods to...approach on digital signal processor ( DSP ) and field programmable gate array (FPGA) systems, and 5) it explored methods to account for the effect on...University, based on intensive use of Digital Signal Processors ( DSPs ) for computational purposes, and on Field Programmable Gate Arrays (FPGAs) for
C Library for Simulated Evolution of Biological Networks
Chandran, Deepak; Sauro, Herbert M.
2010-01-01
Simulated evolution of biological networks can be used to generate functional networks as well as investigate hypotheses regarding natural evolution. A handful of studies have shown how simulated evolution can be used for studying the functional space spanned by biochemical networks, studying natural evolution, or designing new synthetic networks. If there was a method for easily performing such studies, it can allow the community to further experiment with simulated evolution and explore all...
Parameter estimation in channel network flow simulation
Directory of Open Access Journals (Sweden)
Han Longxi
2008-03-01
Full Text Available Simulations of water flow in channel networks require estimated values of roughness for all the individual channel segments that make up a network. When the number of individual channel segments is large, the parameter calibration workload is substantial and a high level of uncertainty in estimated roughness cannot be avoided. In this study, all the individual channel segments are graded according to the factors determining the value of roughness. It is assumed that channel segments with the same grade have the same value of roughness. Based on observed hydrological data, an optimal model for roughness estimation is built. The procedure of solving the optimal problem using the optimal model is described. In a test of its efficacy, this estimation method was applied successfully in the simulation of tidal water flow in a large complicated channel network in the lower reach of the Yangtze River in China.
Simulation of Stimuli-Responsive Polymer Networks
Directory of Open Access Journals (Sweden)
Thomas Gruhn
2013-11-01
Full Text Available The structure and material properties of polymer networks can depend sensitively on changes in the environment. There is a great deal of progress in the development of stimuli-responsive hydrogels for applications like sensors, self-repairing materials or actuators. Biocompatible, smart hydrogels can be used for applications, such as controlled drug delivery and release, or for artificial muscles. Numerical studies have been performed on different length scales and levels of details. Macroscopic theories that describe the network systems with the help of continuous fields are suited to study effects like the stimuli-induced deformation of hydrogels on large scales. In this article, we discuss various macroscopic approaches and describe, in more detail, our phase field model, which allows the calculation of the hydrogel dynamics with the help of a free energy that considers physical and chemical impacts. On a mesoscopic level, polymer systems can be modeled with the help of the self-consistent field theory, which includes the interactions, connectivity, and the entropy of the polymer chains, and does not depend on constitutive equations. We present our recent extension of the method that allows the study of the formation of nano domains in reversibly crosslinked block copolymer networks. Molecular simulations of polymer networks allow the investigation of the behavior of specific systems on a microscopic scale. As an example for microscopic modeling of stimuli sensitive polymer networks, we present our Monte Carlo simulations of a filament network system with crosslinkers.
Introduction to Network Simulator NS2
Issariyakul, Teerawat
2008-01-01
A beginners' guide for network simulator NS2, an open-source discrete event simulator designed mainly for networking research. It presents two fundamental NS2 concepts: how objects are assembled to create a network and how a packet flows from one object to another
Trace Replay and Network Simulation Tool
Energy Technology Data Exchange (ETDEWEB)
2017-09-22
TraceR Is a trace replay tool built upon the ROSS-based CODES simulation framework. TraceR can be used for predicting network performance and understanding network behavior by simulating messaging In High Performance Computing applications on interconnection networks.
Hybrid Method Simulation of Slender Marine Structures
DEFF Research Database (Denmark)
Christiansen, Niels Hørbye
This present thesis consists of an extended summary and five appended papers concerning various aspects of the implementation of a hybrid method which combines classical simulation methods and artificial neural networks. The thesis covers three main topics. Common for all these topics...... is that they deal with time domain simulation of slender marine structures such as mooring lines and flexible risers used in deep sea offshore installations. The first part of the thesis describes how neural networks can be designed and trained to cover a large number of different sea states. Neural networks can...... to simulate dynamic response of specific critical hot spots on a flexible riser. In the design of mooring lines only top tension forces are considered. These forces can easily be determined by a single neural network. Riser design, depending on the applied configuration, requires detailed analysis of several...
A Method for Upper Bounding on Network Access Speed
DEFF Research Database (Denmark)
Knudsen, Thomas Phillip; Patel, A.; Pedersen, Jens Myrup
2004-01-01
This paper presents a method for calculating an upper bound on network access speed growth and gives guidelines for further research experiments and simulations. The method is aimed at providing a basis for simulation of long term network development and resource management.......This paper presents a method for calculating an upper bound on network access speed growth and gives guidelines for further research experiments and simulations. The method is aimed at providing a basis for simulation of long term network development and resource management....
SDL-based network performance simulation
Yang, Yang; Lu, Yang; Lin, Xiaokang
2005-11-01
Specification and description language (SDL) is an object-oriented formal language defined as a standard by ITU-T. Though SDL is mainly used in describing communication protocols, it is an efficient way to simulate the network performance with SDL tools according to our experience. This paper presents our methodology of SDL-based network performance simulation in such aspects as the simulation platform, the simulation modes and the integrated simulation environment. Note that Telelogic Tau 4.3 SDL suite is used here as the simulation environment though our methodology isn't limited to the software. Finally the SDL-based open shortest path first (OSPF) performance simulation in the wireless private network is illustrated as an example of our methodology, which indicates that SDL is indeed an efficient language in the area of the network performance simulation.
Introduction to Network Simulator NS2
Issariyakul, Teerawat
2012-01-01
"Introduction to Network Simulator NS2" is a primer providing materials for NS2 beginners, whether students, professors, or researchers for understanding the architecture of Network Simulator 2 (NS2) and for incorporating simulation modules into NS2. The authors discuss the simulation architecture and the key components of NS2 including simulation-related objects, network objects, packet-related objects, and helper objects. The NS2 modules included within are nodes, links, SimpleLink objects, packets, agents, and applications. Further, the book covers three helper modules: timers, ra
Chin, Alex
Singlet fission (SF) is an ultrafast process in which a singlet exciton spontaneously converts into a pair of entangled triplet excitons on neighbouring organic molecules. As a mechanism of multiple exciton generation, it has been suggested as a way to increase the efficiency of organic photovoltaic devices, and its underlying photophysics across a wide range of molecules and materials has attracted significant theoretical attention. Recently, a number of studies using ultrafast nonlinear optics have underscored the importance of intramolecular vibrational dynamics in efficient SF systems, prompting a need for methods capable of simulating open quantum dynamics in the presence of highly structured and strongly coupled environments. Here, a combination of ab initio electronic structure techniques and a new tensor-network methodology for simulating open vibronic dynamics is presented and applied to a recently synthesised dimer of pentacene (DP-Mes). We show that ultrafast (300 fs) SF in this system is driven entirely by symmetry breaking vibrations, and our many-body approach enables the real-time identification and tracking of the ''functional' vibrational dynamics and the role of the ''bath''-like parts of the environment. Deeper analysis of the emerging wave functions points to interesting links between the time at which parts of the environment become relevant to the SF process and the optimal topology of the tensor networks, highlighting the additional insight provided by moving the problem into the natural language of correlated quantum states and how this could lead to simulations of much larger multichromophore systems Supported by The Winton Programme for the Physics of Sustainability.
Developed hydraulic simulation model for water pipeline networks
Directory of Open Access Journals (Sweden)
A. Ayad
2013-03-01
Full Text Available A numerical method that uses linear graph theory is presented for both steady state, and extended period simulation in a pipe network including its hydraulic components (pumps, valves, junctions, etc.. The developed model is based on the Extended Linear Graph Theory (ELGT technique. This technique is modified to include new network components such as flow control valves and tanks. The technique also expanded for extended period simulation (EPS. A newly modified method for the calculation of updated flows improving the convergence rate is being introduced. Both benchmarks, ad Actual networks are analyzed to check the reliability of the proposed method. The results reveal the finer performance of the proposed method.
Parallel discrete-event simulation of FCFS stochastic queueing networks
Nicol, David M.
1988-01-01
Physical systems are inherently parallel. Intuition suggests that simulations of these systems may be amenable to parallel execution. The parallel execution of a discrete-event simulation requires careful synchronization of processes in order to ensure the execution's correctness; this synchronization can degrade performance. Largely negative results were recently reported in a study which used a well-known synchronization method on queueing network simulations. Discussed here is a synchronization method (appointments), which has proven itself to be effective on simulations of FCFS queueing networks. The key concept behind appointments is the provision of lookahead. Lookahead is a prediction on a processor's future behavior, based on an analysis of the processor's simulation state. It is shown how lookahead can be computed for FCFS queueing network simulations, give performance data that demonstrates the method's effectiveness under moderate to heavy loads, and discuss performance tradeoffs between the quality of lookahead, and the cost of computing lookahead.
Biological transportation networks: Modeling and simulation
Albi, Giacomo
2015-09-15
We present a model for biological network formation originally introduced by Cai and Hu [Adaptation and optimization of biological transport networks, Phys. Rev. Lett. 111 (2013) 138701]. The modeling of fluid transportation (e.g., leaf venation and angiogenesis) and ion transportation networks (e.g., neural networks) is explained in detail and basic analytical features like the gradient flow structure of the fluid transportation network model and the impact of the model parameters on the geometry and topology of network formation are analyzed. We also present a numerical finite-element based discretization scheme and discuss sample cases of network formation simulations.
Hierarchical Network Design Using Simulated Annealing
DEFF Research Database (Denmark)
Thomadsen, Tommy; Clausen, Jens
2002-01-01
networks are described and a mathematical model is proposed for a two level version of the hierarchical network problem. The problem is to determine which edges should connect nodes, and how demand is routed in the network. The problem is solved heuristically using simulated annealing which as a sub...
Sampling of temporal networks: Methods and biases
Rocha, Luis E. C.; Masuda, Naoki; Holme, Petter
2017-11-01
Temporal networks have been increasingly used to model a diversity of systems that evolve in time; for example, human contact structures over which dynamic processes such as epidemics take place. A fundamental aspect of real-life networks is that they are sampled within temporal and spatial frames. Furthermore, one might wish to subsample networks to reduce their size for better visualization or to perform computationally intensive simulations. The sampling method may affect the network structure and thus caution is necessary to generalize results based on samples. In this paper, we study four sampling strategies applied to a variety of real-life temporal networks. We quantify the biases generated by each sampling strategy on a number of relevant statistics such as link activity, temporal paths and epidemic spread. We find that some biases are common in a variety of networks and statistics, but one strategy, uniform sampling of nodes, shows improved performance in most scenarios. Given the particularities of temporal network data and the variety of network structures, we recommend that the choice of sampling methods be problem oriented to minimize the potential biases for the specific research questions on hand. Our results help researchers to better design network data collection protocols and to understand the limitations of sampled temporal network data.
Neural networks analysis on SSME vibration simulation data
Lo, Ching F.; Wu, Kewei
1993-01-01
The neural networks method is applied to investigate the feasibility in detecting anomalies in turbopump vibration of SSME to supplement the statistical method utilized in the prototype system. The investigation of neural networks analysis is conducted using SSME vibration data from a NASA developed numerical simulator. The limited application of neural networks to the HPFTP has also shown the effectiveness in diagnosing the anomalies of turbopump vibrations.
Vectorized algorithms for spiking neural network simulation.
Brette, Romain; Goodman, Dan F M
2011-06-01
High-level languages (Matlab, Python) are popular in neuroscience because they are flexible and accelerate development. However, for simulating spiking neural networks, the cost of interpretation is a bottleneck. We describe a set of algorithms to simulate large spiking neural networks efficiently with high-level languages using vector-based operations. These algorithms constitute the core of Brian, a spiking neural network simulator written in the Python language. Vectorized simulation makes it possible to combine the flexibility of high-level languages with the computational efficiency usually associated with compiled languages.
A user oriented active network simulator
Rao, K. S.; Swamy, M. N. S.
1980-07-01
A digital computer simulator for the frequency response and tolerance analysis of an electrical network comprising RLCM elements, ideal operational amplifiers and controlled sources is presented in this tutorial paper. The simulator is based on 'tableau approach'. Reordering of the sparse tableau matrix is done using Markowitz Criterion and the diagonal pivots are chosen for simplicity. The simulator also employs dynamic allocation for maximum utilization of memory and faster turn around time. Three networks are simulated and their results are presented in this paper. A network in which the operational amplifiers are assumed to have single pole behaviour is also analyzed.
Program Aids Simulation Of Neural Networks
Baffes, Paul T.
1990-01-01
Computer program NETS - Tool for Development and Evaluation of Neural Networks - provides simulation of neural-network algorithms plus software environment for development of such algorithms. Enables user to customize patterns of connections between layers of network, and provides features for saving weight values of network, providing for more precise control over learning process. Consists of translating problem into format using input/output pairs, designing network configuration for problem, and finally training network with input/output pairs until acceptable error reached. Written in C.
A GIS Tool for simulating Nitrogen transport along schematic Network
Tavakoly, A. A.; Maidment, D. R.; Yang, Z.; Whiteaker, T.; David, C. H.; Johnson, S.
2012-12-01
An automated method called the Arc Hydro Schematic Processor has been developed for water process computation on schematic networks formed from the NHDPlus and similar GIS river networks. The sechemtaic network represents the hydrologic feature on the ground and is a network of links and nodes. SchemaNodes show hydrologic features, such as catchments or stream junctions. SchemaLinks prescripe the connections between nodes. The schematic processor uses the schematic network to pass informatin through a watershed and move water or pollutants dwonstream. In addition, the schematic processor has a capability to use additional programming applied to the passed and/or received values and manipulating data trough network. This paper describes how the schemtic processor can be used to simulate nitrogen transport and transformation on river networks. For this purpose the nitrogen loads is estimated on the NHDPlus river network using the Schematic Processor coupled with the river routing model for the Texas Gulf Coast Hydrologic Region.
Methods and applications for detecting structure in complex networks
Leicht, Elizabeth A.
The use of networks to represent systems of interacting components is now common in many fields including the biological, physical, and social sciences. Network models are widely applicable due to their relatively simple framework of vertices and edges. Network structure, patterns of connection between vertices, impacts both the functioning of networks and processes occurring on networks. However, many aspects of network structure are still poorly understood. This dissertation presents a set of network analysis methods and applications to real-world as well as simulated networks. The methods are divided into two main types: linear algebra formulations and probabilistic mixture model techniques. Network models lend themselves to compact mathematical representation as matrices, making linear algebra techniques useful probes of network structure. We present methods for the detection of two distinct, but related, network structural forms. First, we derive a measure of vertex similarity based upon network structure. The method builds on existing ideas concerning calculation of vertex similarity, but generalizes and extends the scope to large networks. Second, we address the detection of communities or modules in a specific class of networks, directed networks. We propose a method for detecting community structure in directed networks, which is an extension of a community detection method previously only known for undirected networks. Moving away from linear algebra formulations, we propose two methods for network structure detection based on probabilistic techniques. In the first method, we use the machinery of the expectation-maximization (EM) algorithm to probe patterns of connection among vertices in static networks. The technique allows for the detection of a broad range of types of structure in networks. The second method focuses on time evolving networks. We propose an application of the EM algorithm to evolving networks that can reveal significant structural
Slow update stochastic simulation algorithms for modeling complex biochemical networks.
Ghosh, Debraj; De, Rajat K
2017-10-30
The stochastic simulation algorithm (SSA) based modeling is a well recognized approach to predict the stochastic behavior of biological networks. The stochastic simulation of large complex biochemical networks is a challenge as it takes a large amount of time for simulation due to high update cost. In order to reduce the propensity update cost, we proposed two algorithms: slow update exact stochastic simulation algorithm (SUESSA) and slow update exact sorting stochastic simulation algorithm (SUESSSA). We applied cache-based linear search (CBLS) in these two algorithms for improving the search operation for finding reactions to be executed. Data structure used for incorporating CBLS is very simple and the cost of maintaining this during propensity update operation is very low. Hence, time taken during propensity updates, for simulating strongly coupled networks, is very fast; which leads to reduction of total simulation time. SUESSA and SUESSSA are not only restricted to elementary reactions, they support higher order reactions too. We used linear chain model and colloidal aggregation model to perform a comparative analysis of the performances of our methods with the existing algorithms. We also compared the performances of our methods with the existing ones, for large biochemical networks including B cell receptor and FcϵRI signaling networks. Copyright © 2017 Elsevier B.V. All rights reserved.
Buffer Management Simulation in ATM Networks
Yaprak, E.; Xiao, Y.; Chronopoulos, A.; Chow, E.; Anneberg, L.
1998-01-01
This paper presents a simulation of a new dynamic buffer allocation management scheme in ATM networks. To achieve this objective, an algorithm that detects congestion and updates the dynamic buffer allocation scheme was developed for the OPNET simulation package via the creation of a new ATM module.
Interrogation Methods and Terror Networks
Baccara, Mariagiovanna; Bar-Isaac, Heski
We examine how the structure of terror networks varies with legal limits on interrogation and the ability of authorities to extract information from detainees. We assume that terrorist networks are designed to respond optimally to a tradeoff caused by information exchange: Diffusing information widely leads to greater internal efficiency, but it leaves the organization more vulnerable to law enforcement. The extent of this vulnerability depends on the law enforcement authority’s resources, strategy and interrogation methods. Recognizing that the structure of a terrorist network responds to the policies of law enforcement authorities allows us to begin to explore the most effective policies from the authorities’ point of view.
Multiple network interface core apparatus and method
Underwood, Keith D [Albuquerque, NM; Hemmert, Karl Scott [Albuquerque, NM
2011-04-26
A network interface controller and network interface control method comprising providing a single integrated circuit as a network interface controller and employing a plurality of network interface cores on the single integrated circuit.
Network simulations of optical illusions
Shinbrot, Troy; Lazo, Miguel Vivar; Siu, Theo
We examine a dynamical network model of visual processing that reproduces several aspects of a well-known optical illusion, including subtle dependencies on curvature and scale. The model uses a genetic algorithm to construct the percept of an image, and we show that this percept evolves dynamically so as to produce the illusions reported. We find that the perceived illusions are hardwired into the model architecture and we propose that this approach may serve as an archetype to distinguish behaviors that are due to nature (i.e. a fixed network architecture) from those subject to nurture (that can be plastically altered through learning).
Network Simulation of Technical Architecture
National Research Council Canada - National Science Library
Cave, William
1998-01-01
..., and development of the Army Battle Command System (ABCS). PSI delivered a hierarchical iconic modeling facility that can be used to structure and restructure both models and scenarios, interactively, while simulations are running...
EVALUATING AUSTRALIAN FOOTBALL LEAGUE PLAYER CONTRIBUTIONS USING INTERACTIVE NETWORK SIMULATION
Directory of Open Access Journals (Sweden)
Jonathan Sargent
2013-03-01
Full Text Available This paper focuses on the contribution of Australian Football League (AFL players to their team's on-field network by simulating player interactions within a chosen team list and estimating the net effect on final score margin. A Visual Basic computer program was written, firstly, to isolate the effective interactions between players from a particular team in all 2011 season matches and, secondly, to generate a symmetric interaction matrix for each match. Negative binomial distributions were fitted to each player pairing in the Geelong Football Club for the 2011 season, enabling an interactive match simulation model given the 22 chosen players. Dynamic player ratings were calculated from the simulated network using eigenvector centrality, a method that recognises and rewards interactions with more prominent players in the team network. The centrality ratings were recorded after every network simulation and then applied in final score margin predictions so that each player's match contribution-and, hence, an optimal team-could be estimated. The paper ultimately demonstrates that the presence of highly rated players, such as Geelong's Jimmy Bartel, provides the most utility within a simulated team network. It is anticipated that these findings will facilitate optimal AFL team selection and player substitutions, which are key areas of interest to coaches. Network simulations are also attractive for use within betting markets, specifically to provide information on the likelihood of a chosen AFL team list "covering the line".
Implementation of quantum key distribution network simulation module in the network simulator NS-3
Mehic, Miralem; Maurhart, Oliver; Rass, Stefan; Voznak, Miroslav
2017-10-01
As the research in quantum key distribution (QKD) technology grows larger and becomes more complex, the need for highly accurate and scalable simulation technologies becomes important to assess the practical feasibility and foresee difficulties in the practical implementation of theoretical achievements. Due to the specificity of the QKD link which requires optical and Internet connection between the network nodes, to deploy a complete testbed containing multiple network hosts and links to validate and verify a certain network algorithm or protocol would be very costly. Network simulators in these circumstances save vast amounts of money and time in accomplishing such a task. The simulation environment offers the creation of complex network topologies, a high degree of control and repeatable experiments, which in turn allows researchers to conduct experiments and confirm their results. In this paper, we described the design of the QKD network simulation module which was developed in the network simulator of version 3 (NS-3). The module supports simulation of the QKD network in an overlay mode or in a single TCP/IP mode. Therefore, it can be used to simulate other network technologies regardless of QKD.
Importance of simulation tools for the planning of optical network
Martins, Indayara B.; Martins, Yara; Rudge, Felipe; Moschimı, Edson
2015-10-01
The main proposal of this work is to show the importance of using simulation tools to project optical networks. The simulation method supports the investigation of several system and network parameters, such as bit error rate, blocking probability as well as physical layer issues, such as attenuation, dispersion, and nonlinearities, as these are all important to evaluate and validate the operability of optical networks. The work was divided into two parts: firstly, physical layer preplanning was proposed for the distribution of amplifiers and compensating for the attenuation and dispersion effects in span transmission; in this part, we also analyzed the quality of the transmitted signal. In the second part, an analysis of the transport layer was completed, proposing wavelength distribution planning, according to the total utilization of each link. The main network parameters used to evaluate the transport and physical layer design were delay (latency), blocking probability, and bit error rate (BER). This work was carried out with commercially available simulation tools.
Evaluating Australian football league player contributions using interactive network simulation.
Sargent, Jonathan; Bedford, Anthony
2013-01-01
This paper focuses on the contribution of Australian Football League (AFL) players to their team's on-field network by simulating player interactions within a chosen team list and estimating the net effect on final score margin. A Visual Basic computer program was written, firstly, to isolate the effective interactions between players from a particular team in all 2011 season matches and, secondly, to generate a symmetric interaction matrix for each match. Negative binomial distributions were fitted to each player pairing in the Geelong Football Club for the 2011 season, enabling an interactive match simulation model given the 22 chosen players. Dynamic player ratings were calculated from the simulated network using eigenvector centrality, a method that recognises and rewards interactions with more prominent players in the team network. The centrality ratings were recorded after every network simulation and then applied in final score margin predictions so that each player's match contribution-and, hence, an optimal team-could be estimated. The paper ultimately demonstrates that the presence of highly rated players, such as Geelong's Jimmy Bartel, provides the most utility within a simulated team network. It is anticipated that these findings will facilitate optimal AFL team selection and player substitutions, which are key areas of interest to coaches. Network simulations are also attractive for use within betting markets, specifically to provide information on the likelihood of a chosen AFL team list "covering the line ". Key pointsA simulated interaction matrix for Australian Rules football players is proposedThe simulations were carried out by fitting unique negative binomial distributions to each player pairing in a sideEigenvector centrality was calculated for each player in a simulated matrix, then for the teamThe team centrality measure adequately predicted the team's winning marginA player's net effect on margin could hence be estimated by replacing him in
The Airport Network Flow Simulator.
1976-05-01
The impact of investment at an individual airport is felt through-out the National Airport System by reduction of delays at other airports in the the system. A GPSS model was constructed to simulate the propagation of delays through a nine-airport sy...
Dynamic simulation of regulatory networks using SQUAD
Directory of Open Access Journals (Sweden)
Xenarios Ioannis
2007-11-01
Full Text Available Abstract Background The ambition of most molecular biologists is the understanding of the intricate network of molecular interactions that control biological systems. As scientists uncover the components and the connectivity of these networks, it becomes possible to study their dynamical behavior as a whole and discover what is the specific role of each of their components. Since the behavior of a network is by no means intuitive, it becomes necessary to use computational models to understand its behavior and to be able to make predictions about it. Unfortunately, most current computational models describe small networks due to the scarcity of kinetic data available. To overcome this problem, we previously published a methodology to convert a signaling network into a dynamical system, even in the total absence of kinetic information. In this paper we present a software implementation of such methodology. Results We developed SQUAD, a software for the dynamic simulation of signaling networks using the standardized qualitative dynamical systems approach. SQUAD converts the network into a discrete dynamical system, and it uses a binary decision diagram algorithm to identify all the steady states of the system. Then, the software creates a continuous dynamical system and localizes its steady states which are located near the steady states of the discrete system. The software permits to make simulations on the continuous system, allowing for the modification of several parameters. Importantly, SQUAD includes a framework for perturbing networks in a manner similar to what is performed in experimental laboratory protocols, for example by activating receptors or knocking out molecular components. Using this software we have been able to successfully reproduce the behavior of the regulatory network implicated in T-helper cell differentiation. Conclusion The simulation of regulatory networks aims at predicting the behavior of a whole system when subject
Liu, Gang; Neelamegham, Sriram
2008-04-15
We present In silico Biochemical Reaction Network Analysis (IBRENA), a software package which facilitates multiple functions including cellular reaction network simulation and sensitivity analysis (both forward and adjoint methods), coupled with principal component analysis, singular-value decomposition and model reduction. The software features a graphical user interface that aids simulation and plotting of in silico results. While the primary focus is to aid formulation, testing and reduction of theoretical biochemical reaction networks, the program can also be used for analysis of high-throughput genomic and proteomic data. The software package, manual and examples are available at http://www.eng.buffalo.edu/~neel/ibrena
Simulating activation propagation in social networks using the graph theory
Directory of Open Access Journals (Sweden)
František Dařena
2010-01-01
Full Text Available The social-network formation and analysis is nowadays one of objects that are in a focus of intensive research. The objective of the paper is to suggest the perspective of representing social networks as graphs, with the application of the graph theory to problems connected with studying the network-like structures and to study spreading activation algorithm for reasons of analyzing these structures. The paper presents the process of modeling multidimensional networks by means of directed graphs with several characteristics. The paper also demonstrates using Spreading Activation algorithm as a good method for analyzing multidimensional network with the main focus on recommender systems. The experiments showed that the choice of parameters of the algorithm is crucial, that some kind of constraint should be included and that the algorithm is able to provide a stable environment for simulations with networks.
Efficient simulation of a tandem Jackson network
Kroese, Dirk; Nicola, V.F.
2002-01-01
The two-node tandem Jackson network serves as a convenient reference model for the analysis and testing of different methodologies and techniques in rare event simulation. In this paper we consider a new approach to efficiently estimate the probability that the content of the second buffer exceeds
Realistic computer network simulation for network intrusion detection dataset generation
Payer, Garrett
2015-05-01
The KDD-99 Cup dataset is dead. While it can continue to be used as a toy example, the age of this dataset makes it all but useless for intrusion detection research and data mining. Many of the attacks used within the dataset are obsolete and do not reflect the features important for intrusion detection in today's networks. Creating a new dataset encompassing a large cross section of the attacks found on the Internet today could be useful, but would eventually fall to the same problem as the KDD-99 Cup; its usefulness would diminish after a period of time. To continue research into intrusion detection, the generation of new datasets needs to be as dynamic and as quick as the attacker. Simply examining existing network traffic and using domain experts such as intrusion analysts to label traffic is inefficient, expensive, and not scalable. The only viable methodology is simulation using technologies including virtualization, attack-toolsets such as Metasploit and Armitage, and sophisticated emulation of threat and user behavior. Simulating actual user behavior and network intrusion events dynamically not only allows researchers to vary scenarios quickly, but enables online testing of intrusion detection mechanisms by interacting with data as it is generated. As new threat behaviors are identified, they can be added to the simulation to make quicker determinations as to the effectiveness of existing and ongoing network intrusion technology, methodology and models.
SELANSI: a toolbox for Simulation of Stochastic Gene Regulatory Networks.
Pájaro, Manuel; Otero-Muras, Irene; Vázquez, Carlos; Alonso, Antonio A
2017-10-11
Gene regulation is inherently stochastic. In many applications concerning Systems and Synthetic Biology such as the reverse engineering and the de novo design of genetic circuits, stochastic effects (yet potentially crucial) are often neglected due to the high computational cost of stochastic simulations. With advances in these fields there is an increasing need of tools providing accurate approximations of the stochastic dynamics of gene regulatory networks (GRNs) with reduced computational effort. This work presents SELANSI (SEmi-LAgrangian SImulation of GRNs), a software toolbox for the simulation of stochastic multidimensional gene regulatory networks. SELANSI exploits intrinsic structural properties of gene regulatory networks to accurately approximate the corresponding chemical master equation (CME) with a partial integral differential equation (PIDE) that is solved by a semi-lagrangian method with high efficiency. Networks under consideration might involve multiple genes with self and cross regulations, in which genes can be regulated by different transcription factors. Moreover, the validity of the method is not restricted to a particular type of kinetics. The tool offers total flexibility regarding network topology, kinetics and parameterization, as well as simulation options. SELANSI runs under the MATLAB environment, and is available under GPLv3 license at https://sites.google.com/view/selansi. antonio@iim.csic.es.
Simulating Autonomous Telecommunication Networks for Space Exploration
Segui, John S.; Jennings, Esther H.
2008-01-01
Currently, most interplanetary telecommunication systems require human intervention for command and control. However, considering the range from near Earth to deep space missions, combined with the increase in the number of nodes and advancements in processing capabilities, the benefits from communication autonomy will be immense. Likewise, greater mission science autonomy brings the need for unscheduled, unpredictable communication and network routing. While the terrestrial Internet protocols are highly developed their suitability for space exploration has been questioned. JPL has developed the Multi-mission Advanced Communications Hybrid Environment for Test and Evaluation (MACHETE) tool to help characterize network designs and protocols. The results will allow future mission planners to better understand the trade offs of communication protocols. This paper discusses various issues with interplanetary network and simulation results of interplanetary networking protocols.
Prototyping and Simulation of Robot Group Intelligence using Kohonen Networks.
Wang, Zhijun; Mirdamadi, Reza; Wang, Qing
2016-01-01
Intelligent agents such as robots can form ad hoc networks and replace human being in many dangerous scenarios such as a complicated disaster relief site. This project prototypes and builds a computer simulator to simulate robot kinetics, unsupervised learning using Kohonen networks, as well as group intelligence when an ad hoc network is formed. Each robot is modeled using an object with a simple set of attributes and methods that define its internal states and possible actions it may take under certain circumstances. As the result, simple, reliable, and affordable robots can be deployed to form the network. The simulator simulates a group of robots as an unsupervised learning unit and tests the learning results under scenarios with different complexities. The simulation results show that a group of robots could demonstrate highly collaborative behavior on a complex terrain. This study could potentially provide a software simulation platform for testing individual and group capability of robots before the design process and manufacturing of robots. Therefore, results of the project have the potential to reduce the cost and improve the efficiency of robot design and building.
Methods for Analyzing Pipe Networks
DEFF Research Database (Denmark)
Nielsen, Hans Bruun
1989-01-01
The governing equations for a general network are first set up and then reformulated in terms of matrices. This is developed to show that the choice of model for the flow equations is essential for the behavior of the iterative method used to solve the problem. It is shown that it is better to fo...... demonstrated that this method offers good starting values for a Newton-Raphson iteration.......The governing equations for a general network are first set up and then reformulated in terms of matrices. This is developed to show that the choice of model for the flow equations is essential for the behavior of the iterative method used to solve the problem. It is shown that it is better...... to formulate the flow equations in terms of pipe discharges than in terms of energy heads. The behavior of some iterative methods is compared in the initial phase with large errors. It is explained why the linear theory method oscillates when the iteration gets close to the solution, and it is further...
Adaptive Importance Sampling Simulation of Queueing Networks
de Boer, Pieter-Tjerk; Nicola, V.F.; Rubinstein, N.; Rubinstein, Reuven Y.
2000-01-01
In this paper, a method is presented for the efficient estimation of rare-event (overflow) probabilities in Jackson queueing networks using importance sampling. The method differs in two ways from methods discussed in most earlier literature: the change of measure is state-dependent, i.e., it is a
Software for Brain Network Simulations: A Comparative Study
Tikidji-Hamburyan, Ruben A.; Narayana, Vikram; Bozkus, Zeki; El-Ghazawi, Tarek A.
2017-01-01
Numerical simulations of brain networks are a critical part of our efforts in understanding brain functions under pathological and normal conditions. For several decades, the community has developed many software packages and simulators to accelerate research in computational neuroscience. In this article, we select the three most popular simulators, as determined by the number of models in the ModelDB database, such as NEURON, GENESIS, and BRIAN, and perform an independent evaluation of these simulators. In addition, we study NEST, one of the lead simulators of the Human Brain Project. First, we study them based on one of the most important characteristics, the range of supported models. Our investigation reveals that brain network simulators may be biased toward supporting a specific set of models. However, all simulators tend to expand the supported range of models by providing a universal environment for the computational study of individual neurons and brain networks. Next, our investigations on the characteristics of computational architecture and efficiency indicate that all simulators compile the most computationally intensive procedures into binary code, with the aim of maximizing their computational performance. However, not all simulators provide the simplest method for module development and/or guarantee efficient binary code. Third, a study of their amenability for high-performance computing reveals that NEST can almost transparently map an existing model on a cluster or multicore computer, while NEURON requires code modification if the model developed for a single computer has to be mapped on a computational cluster. Interestingly, parallelization is the weakest characteristic of BRIAN, which provides no support for cluster computations and limited support for multicore computers. Fourth, we identify the level of user support and frequency of usage for all simulators. Finally, we carry out an evaluation using two case studies: a large network with
A Systematic, Automated Network Planning Method
DEFF Research Database (Denmark)
Holm, Jens Åge; Pedersen, Jens Myrup
2006-01-01
This paper describes a case study conducted to evaluate the viability of a systematic, automated network planning method. The motivation for developing the network planning method was that many data networks are planned in an adhoc manner with no assurance of quality of the solution with respect...... to consistency and long-term characteristics. The developed method gives significant improvements on these parameters. The case study was conducted as a comparison between an existing network where the traffic was known and a proposed network designed by the developed method. It turned out that the proposed...... network performed better than the existing network with regard to the performance measurements used which reflected how well the traffic was routed in the networks and the cost of establishing the networks. Challenges that need to be solved before the developed method can be used to design network...
Multiscale Quantum Mechanics/Molecular Mechanics Simulations with Neural Networks.
Shen, Lin; Wu, Jingheng; Yang, Weitao
2016-10-11
Molecular dynamics simulation with multiscale quantum mechanics/molecular mechanics (QM/MM) methods is a very powerful tool for understanding the mechanism of chemical and biological processes in solution or enzymes. However, its computational cost can be too high for many biochemical systems because of the large number of ab initio QM calculations. Semiempirical QM/MM simulations have much higher efficiency. Its accuracy can be improved with a correction to reach the ab initio QM/MM level. The computational cost on the ab initio calculation for the correction determines the efficiency. In this paper we developed a neural network method for QM/MM calculation as an extension of the neural-network representation reported by Behler and Parrinello. With this approach, the potential energy of any configuration along the reaction path for a given QM/MM system can be predicted at the ab initio QM/MM level based on the semiempirical QM/MM simulations. We further applied this method to three reactions in water to calculate the free energy changes. The free-energy profile obtained from the semiempirical QM/MM simulation is corrected to the ab initio QM/MM level with the potential energies predicted with the constructed neural network. The results are in excellent accordance with the reference data that are obtained from the ab initio QM/MM molecular dynamics simulation or corrected with direct ab initio QM/MM potential energies. Compared with the correction using direct ab initio QM/MM potential energies, our method shows a speed-up of 1 or 2 orders of magnitude. It demonstrates that the neural network method combined with the semiempirical QM/MM calculation can be an efficient and reliable strategy for chemical reaction simulations.
Stochastic Simulation of Biomolecular Networks in Dynamic Environments.
Voliotis, Margaritis; Thomas, Philipp; Grima, Ramon; Bowsher, Clive G
2016-06-01
Simulation of biomolecular networks is now indispensable for studying biological systems, from small reaction networks to large ensembles of cells. Here we present a novel approach for stochastic simulation of networks embedded in the dynamic environment of the cell and its surroundings. We thus sample trajectories of the stochastic process described by the chemical master equation with time-varying propensities. A comparative analysis shows that existing approaches can either fail dramatically, or else can impose impractical computational burdens due to numerical integration of reaction propensities, especially when cell ensembles are studied. Here we introduce the Extrande method which, given a simulated time course of dynamic network inputs, provides a conditionally exact and several orders-of-magnitude faster simulation solution. The new approach makes it feasible to demonstrate-using decision-making by a large population of quorum sensing bacteria-that robustness to fluctuations from upstream signaling places strong constraints on the design of networks determining cell fate. Our approach has the potential to significantly advance both understanding of molecular systems biology and design of synthetic circuits.
Stochastic Simulation of Biomolecular Networks in Dynamic Environments.
Directory of Open Access Journals (Sweden)
Margaritis Voliotis
2016-06-01
Full Text Available Simulation of biomolecular networks is now indispensable for studying biological systems, from small reaction networks to large ensembles of cells. Here we present a novel approach for stochastic simulation of networks embedded in the dynamic environment of the cell and its surroundings. We thus sample trajectories of the stochastic process described by the chemical master equation with time-varying propensities. A comparative analysis shows that existing approaches can either fail dramatically, or else can impose impractical computational burdens due to numerical integration of reaction propensities, especially when cell ensembles are studied. Here we introduce the Extrande method which, given a simulated time course of dynamic network inputs, provides a conditionally exact and several orders-of-magnitude faster simulation solution. The new approach makes it feasible to demonstrate-using decision-making by a large population of quorum sensing bacteria-that robustness to fluctuations from upstream signaling places strong constraints on the design of networks determining cell fate. Our approach has the potential to significantly advance both understanding of molecular systems biology and design of synthetic circuits.
Simulated, Emulated, and Physical Investigative Analysis (SEPIA) of networked systems.
Energy Technology Data Exchange (ETDEWEB)
Burton, David P.; Van Leeuwen, Brian P.; McDonald, Michael James; Onunkwo, Uzoma A.; Tarman, Thomas David; Urias, Vincent E.
2009-09-01
This report describes recent progress made in developing and utilizing hybrid Simulated, Emulated, and Physical Investigative Analysis (SEPIA) environments. Many organizations require advanced tools to analyze their information system's security, reliability, and resilience against cyber attack. Today's security analysis utilize real systems such as computers, network routers and other network equipment, computer emulations (e.g., virtual machines) and simulation models separately to analyze interplay between threats and safeguards. In contrast, this work developed new methods to combine these three approaches to provide integrated hybrid SEPIA environments. Our SEPIA environments enable an analyst to rapidly configure hybrid environments to pass network traffic and perform, from the outside, like real networks. This provides higher fidelity representations of key network nodes while still leveraging the scalability and cost advantages of simulation tools. The result is to rapidly produce large yet relatively low-cost multi-fidelity SEPIA networks of computers and routers that let analysts quickly investigate threats and test protection approaches.
Modeling and Simulation Network Data Standards
2011-09-30
12.1 Open Shortest Path First ( OSPF ) Protocol commonly used to find the shortest path between two nodes. User defined. 12.2 Border Gateway Protocol...Element Definition 12.7 Request for Comments – 1256 (RFC-1256) Router discovery protocol. 13.0 OSPF Sub-elements define OSPF parameters 13.1...resolution network analysis simulation tool OSPF open shortest path first OV operational view PEO-I Program Executive Office - Information
Resilience Simulation for Water, Power & Road Networks
Clark, S. S.; Seager, T. P.; Chester, M.; Eisenberg, D. A.; Sweet, D.; Linkov, I.
2014-12-01
The increasing frequency, scale, and damages associated with recent catastrophic events has called for a shift in focus from evading losses through risk analysis to improving threat preparation, planning, absorption, recovery, and adaptation through resilience. However, neither underlying theory nor analytic tools have kept pace with resilience rhetoric. As a consequence, current approaches to engineering resilience analysis often conflate resilience and robustness or collapse into a deeper commitment to the risk analytic paradigm proven problematic in the first place. This research seeks a generalizable understanding of resilience that is applicable in multiple disciplinary contexts. We adopt a unique investigative perspective by coupling social and technical analysis with human subjects research to discover the adaptive actions, ideas and decisions that contribute to resilience in three socio-technical infrastructure systems: electric power, water, and roadways. Our research integrates physical models representing network objects with examination of the knowledge systems and social interactions revealed by human subjects making decisions in a simulated crisis environment. To ensure a diversity of contexts, we model electric power, water, roadway and knowledge networks for Phoenix AZ and Indianapolis IN. We synthesize this in a new computer-based Resilient Infrastructure Simulation Environment (RISE) to allow individuals, groups (including students) and experts to test different network design configurations and crisis response approaches. By observing simulated failures and best performances, we expect a generalizable understanding of resilience may emerge that yields a measureable understanding of the sensing, anticipating, adapting, and learning processes that are essential to resilient organizations.
Simulation of developing human neuronal cell networks.
Lenk, Kerstin; Priwitzer, Barbara; Ylä-Outinen, Laura; Tietz, Lukas H B; Narkilahti, Susanna; Hyttinen, Jari A K
2016-08-30
Microelectrode array (MEA) is a widely used technique to study for example the functional properties of neuronal networks derived from human embryonic stem cells (hESC-NN). With hESC-NN, we can investigate the earliest developmental stages of neuronal network formation in the human brain. In this paper, we propose an in silico model of maturating hESC-NNs based on a phenomenological model called INEX. We focus on simulations of the development of bursts in hESC-NNs, which are the main feature of neuronal activation patterns. The model was developed with data from developing hESC-NN recordings on MEAs which showed increase in the neuronal activity during the investigated six measurement time points in the experimental and simulated data. Our simulations suggest that the maturation process of hESC-NN, resulting in the formation of bursts, can be explained by the development of synapses. Moreover, spike and burst rate both decreased at the last measurement time point suggesting a pruning of synapses as the weak ones are removed. To conclude, our model reflects the assumption that the interaction between excitatory and inhibitory neurons during the maturation of a neuronal network and the spontaneous emergence of bursts are due to increased connectivity caused by the forming of new synapses.
National Research Council Canada - National Science Library
Karsayev, O
2004-01-01
.... Integrity, confidentiality and availability of the network resources must be assured. To detect and suppress different types of computer unauthorized intrusions, modern network security systems (NSS...
Artificial neural network based approach to EEG signal simulation.
Tomasevic, Nikola M; Neskovic, Aleksandar M; Neskovic, Natasa J
2012-06-01
In this paper a new approach to the electroencephalogram (EEG) signal simulation based on the artificial neural networks (ANN) is proposed. The aim was to simulate the spontaneous human EEG background activity based solely on the experimentally acquired EEG data. Therefore, an EEG measurement campaign was conducted on a healthy awake adult in order to obtain an adequate ANN training data set. As demonstration of the performance of the ANN based approach, comparisons were made against autoregressive moving average (ARMA) filtering based method. Comprehensive quantitative and qualitative statistical analysis showed clearly that the EEG process obtained by the proposed method was in satisfactory agreement with the one obtained by measurements.
Sensor Network Data Fusion Methods
Directory of Open Access Journals (Sweden)
Martynas Vervečka
2011-03-01
Full Text Available Sensor network data fusion is widely used in warfare, in areas such as automatic target recognition, battlefield surveillance, automatic vehicle control, multiple target surveillance, etc. Non-military use example are: medical equipment status monitoring, intelligent home. The paper describes sensor networks topologies, sensor network advantages against the isolated sensors, most common network topologies, their advantages and disadvantages.Article in Lithuanian
Spiking network simulation code for petascale computers
Kunkel, Susanne; Schmidt, Maximilian; Eppler, Jochen M.; Plesser, Hans E.; Masumoto, Gen; Igarashi, Jun; Ishii, Shin; Fukai, Tomoki; Morrison, Abigail; Diesmann, Markus; Helias, Moritz
2014-01-01
Brain-scale networks exhibit a breathtaking heterogeneity in the dynamical properties and parameters of their constituents. At cellular resolution, the entities of theory are neurons and synapses and over the past decade researchers have learned to manage the heterogeneity of neurons and synapses with efficient data structures. Already early parallel simulation codes stored synapses in a distributed fashion such that a synapse solely consumes memory on the compute node harboring the target neuron. As petaflop computers with some 100,000 nodes become increasingly available for neuroscience, new challenges arise for neuronal network simulation software: Each neuron contacts on the order of 10,000 other neurons and thus has targets only on a fraction of all compute nodes; furthermore, for any given source neuron, at most a single synapse is typically created on any compute node. From the viewpoint of an individual compute node, the heterogeneity in the synaptic target lists thus collapses along two dimensions: the dimension of the types of synapses and the dimension of the number of synapses of a given type. Here we present a data structure taking advantage of this double collapse using metaprogramming techniques. After introducing the relevant scaling scenario for brain-scale simulations, we quantitatively discuss the performance on two supercomputers. We show that the novel architecture scales to the largest petascale supercomputers available today. PMID:25346682
Spiking network simulation code for petascale computers.
Kunkel, Susanne; Schmidt, Maximilian; Eppler, Jochen M; Plesser, Hans E; Masumoto, Gen; Igarashi, Jun; Ishii, Shin; Fukai, Tomoki; Morrison, Abigail; Diesmann, Markus; Helias, Moritz
2014-01-01
Brain-scale networks exhibit a breathtaking heterogeneity in the dynamical properties and parameters of their constituents. At cellular resolution, the entities of theory are neurons and synapses and over the past decade researchers have learned to manage the heterogeneity of neurons and synapses with efficient data structures. Already early parallel simulation codes stored synapses in a distributed fashion such that a synapse solely consumes memory on the compute node harboring the target neuron. As petaflop computers with some 100,000 nodes become increasingly available for neuroscience, new challenges arise for neuronal network simulation software: Each neuron contacts on the order of 10,000 other neurons and thus has targets only on a fraction of all compute nodes; furthermore, for any given source neuron, at most a single synapse is typically created on any compute node. From the viewpoint of an individual compute node, the heterogeneity in the synaptic target lists thus collapses along two dimensions: the dimension of the types of synapses and the dimension of the number of synapses of a given type. Here we present a data structure taking advantage of this double collapse using metaprogramming techniques. After introducing the relevant scaling scenario for brain-scale simulations, we quantitatively discuss the performance on two supercomputers. We show that the novel architecture scales to the largest petascale supercomputers available today.
Neural network stochastic simulation applied for quantifying uncertainties
Directory of Open Access Journals (Sweden)
N Foudil-Bey
2016-09-01
Full Text Available Generally the geostatistical simulation methods are used to generate several realizations of physical properties in the sub-surface, these methods are based on the variogram analysis and limited to measures correlation between variables at two locations only. In this paper, we propose a simulation of properties based on supervised Neural network training at the existing drilling data set. The major advantage is that this method does not require a preliminary geostatistical study and takes into account several points. As a result, the geological information and the diverse geophysical data can be combined easily. To do this, we used a neural network with multi-layer perceptron architecture like feed-forward, then we used the back-propagation algorithm with conjugate gradient technique to minimize the error of the network output. The learning process can create links between different variables, this relationship can be used for interpolation of the properties on the one hand, or to generate several possible distribution of physical properties on the other hand, changing at each time and a random value of the input neurons, which was kept constant until the period of learning. This method was tested on real data to simulate multiple realizations of the density and the magnetic susceptibility in three-dimensions at the mining camp of Val d'Or, Québec (Canada.
Motorway Network Simulation Using Bluetooth Data
Directory of Open Access Journals (Sweden)
Karakikes Ioannis
2016-09-01
Full Text Available This paper describes a systematic calibration process of a Vissim model, based on data derived from BT detectors. It also provides instructions how to calibrate and validate a highway network model based upon a case study and establishes an example for practitioners that are interested in designing highway networks with micro simulation tools. Within this case study, a 94,5 % proper calibration to all segments was achieved First, an overview of the systematic calibration approach that will be followed is presented. A description of the given datasets follows. Finally, model’s systematic calibration and validation based on BT data from segments under free flow conditions is thoroughly explained. The delivered calibrated Vissim model acts as a test bed, which in combination with other analysis tools can be used for potential future exploitation regarding transportation related purposes.
Learning in innovation networks: Some simulation experiments
Gilbert, Nigel; Ahrweiler, Petra; Pyka, Andreas
2007-05-01
According to the organizational learning literature, the greatest competitive advantage a firm has is its ability to learn. In this paper, a framework for modeling learning competence in firms is presented to improve the understanding of managing innovation. Firms with different knowledge stocks attempt to improve their economic performance by engaging in radical or incremental innovation activities and through partnerships and networking with other firms. In trying to vary and/or to stabilize their knowledge stocks by organizational learning, they attempt to adapt to environmental requirements while the market strongly selects on the results. The simulation experiments show the impact of different learning activities, underlining the importance of innovation and learning.
Mobile-ip Aeronautical Network Simulation Study
Ivancic, William D.; Tran, Diepchi T.
2001-01-01
NASA is interested in applying mobile Internet protocol (mobile-ip) technologies to its space and aeronautics programs. In particular, mobile-ip will play a major role in the Advanced Aeronautic Transportation Technology (AATT), the Weather Information Communication (WINCOMM), and the Small Aircraft Transportation System (SATS) aeronautics programs. This report presents the results of a simulation study of mobile-ip for an aeronautical network. The study was performed to determine the performance of the transmission control protocol (TCP) in a mobile-ip environment and to gain an understanding of how long delays, handoffs, and noisy channels affect mobile-ip performance.
[Simulation of lung motions using an artificial neural network].
Laurent, R; Henriet, J; Salomon, M; Sauget, M; Nguyen, F; Gschwind, R; Makovicka, L
2011-04-01
A way to improve the accuracy of lung radiotherapy for a patient is to get a better understanding of its lung motion. Indeed, thanks to this knowledge it becomes possible to follow the displacements of the clinical target volume (CTV) induced by the lung breathing. This paper presents a feasibility study of an original method to simulate the positions of points in patient's lung at all breathing phases. This method, based on an artificial neural network, allowed learning the lung motion on real cases and then to simulate it for new patients for which only the beginning and the end breathing data are known. The neural network learning set is made up of more than 600 points. These points, shared out on three patients and gathered on a specific lung area, were plotted by a MD. The first results are promising: an average accuracy of 1mm is obtained for a spatial resolution of 1 × 1 × 2.5mm(3). We have demonstrated that it is possible to simulate lung motion with accuracy using an artificial neural network. As future work we plan to improve the accuracy of our method with the addition of new patient data and a coverage of the whole lungs. Copyright © 2010 Société française de radiothérapie oncologique (SFRO). Published by Elsevier SAS. All rights reserved.
DEFF Research Database (Denmark)
Andersen, Lars Nonboe; Au, Whitlow; Larsen, Jan
1999-01-01
This paper describes a method integrating neural networks into a system for recognizing underwater objects. The system is based on a combination of simulated dolphin sonar signals, simulated auditory filters and artificial neural networks. The system is tested on a cylinder wall thickness...
Directory of Open Access Journals (Sweden)
Wei Yu
2016-01-01
Full Text Available Due to the different functions of the system used in the vehicle chassis control, the hierarchical control strategy also leads to many kinds of the network topology structure. According to the hierarchical control principle, this research puts forward the integrated control strategy of the chassis based on supervision mechanism. The purpose is to consider how the integrated control architecture affects the control performance of the system after the intervention of CAN network. Based on the principle of hierarchical control and fuzzy control, a fuzzy controller is designed, which is used to monitor and coordinate the ESP, AFS, and ARS. And the IVC system is constructed with the upper supervisory controller and three subcontrol systems on the Simulink platform. The network topology structure of IVC is proposed, and the IVC communication matrix based on CAN network communication is designed. With the common sensors and the subcontrollers as the CAN network independent nodes, the network induced delay and packet loss rate on the system control performance are studied by simulation. The results show that the simulation method can be used for designing the communication network of the vehicle.
Correlated EEG Signals Simulation Based on Artificial Neural Networks.
Tomasevic, Nikola M; Neskovic, Aleksandar M; Neskovic, Natasa J
2017-08-01
In recent years, simulation of the human electroencephalogram (EEG) data found its important role in medical domain and neuropsychology. In this paper, a novel approach to simulation of two cross-correlated EEG signals is proposed. The proposed method is based on the principles of artificial neural networks (ANN). Contrary to the existing EEG data simulators, the ANN-based approach was leveraged solely on the experimentally acquired EEG data. More precisely, measured EEG data were utilized to optimize the simulator which consisted of two ANN models (each model responsible for generation of one EEG sequence). In order to acquire the EEG recordings, the measurement campaign was carried out on a healthy awake adult having no cognitive, physical or mental load. For the evaluation of the proposed approach, comprehensive quantitative and qualitative statistical analysis was performed considering probability distribution, correlation properties and spectral characteristics of generated EEG processes. The obtained results clearly indicated the satisfactory agreement with the measurement data.
Control and estimation methods over communication networks
Mahmoud, Magdi S
2014-01-01
This book provides a rigorous framework in which to study problems in the analysis, stability and design of networked control systems. Four dominant sources of difficulty are considered: packet dropouts, communication bandwidth constraints, parametric uncertainty, and time delays. Past methods and results are reviewed from a contemporary perspective, present trends are examined, and future possibilities proposed. Emphasis is placed on robust and reliable design methods. New control strategies for improving the efficiency of sensor data processing and reducing associated time delay are presented. The coverage provided features: · an overall assessment of recent and current fault-tolerant control algorithms; · treatment of several issues arising at the junction of control and communications; · key concepts followed by their proofs and efficient computational methods for their implementation; and · simulation examples (including TrueTime simulations) to...
Network Flow Simulation of Fluid Transients in Rocket Propulsion Systems
Bandyopadhyay, Alak; Hamill, Brian; Ramachandran, Narayanan; Majumdar, Alok
2011-01-01
Fluid transients, also known as water hammer, can have a significant impact on the design and operation of both spacecraft and launch vehicle propulsion systems. These transients often occur at system activation and shutdown. The pressure rise due to sudden opening and closing of valves of propulsion feed lines can cause serious damage during activation and shutdown of propulsion systems. During activation (valve opening) and shutdown (valve closing), pressure surges must be predicted accurately to ensure structural integrity of the propulsion system fluid network. In the current work, a network flow simulation software (Generalized Fluid System Simulation Program) based on Finite Volume Method has been used to predict the pressure surges in the feed line due to both valve closing and valve opening using two separate geometrical configurations. The valve opening pressure surge results are compared with experimental data available in the literature and the numerical results compared very well within reasonable accuracy (simulation results are compared with the results of Method of Characteristics. Most rocket engines experience a longitudinal acceleration, known as "pogo" during the later stage of engine burn. In the shutdown example problem, an accumulator has been used in the feed system to demonstrate the "pogo" mitigation effects in the feed system of propellant. The simulation results using GFSSP compared very well with the results of Method of Characteristics.
Systems and methods for modeling and analyzing networks
Hill, Colin C; Church, Bruce W; McDonagh, Paul D; Khalil, Iya G; Neyarapally, Thomas A; Pitluk, Zachary W
2013-10-29
The systems and methods described herein utilize a probabilistic modeling framework for reverse engineering an ensemble of causal models, from data and then forward simulating the ensemble of models to analyze and predict the behavior of the network. In certain embodiments, the systems and methods described herein include data-driven techniques for developing causal models for biological networks. Causal network models include computational representations of the causal relationships between independent variables such as a compound of interest and dependent variables such as measured DNA alterations, changes in mRNA, protein, and metabolites to phenotypic readouts of efficacy and toxicity.
The design of a network emulation and simulation laboratory
CSIR Research Space (South Africa)
Von Solms, S
2015-07-01
Full Text Available The development of the Network Emulation and Simulation Laboratory is motivated by the drive to contribute to the enhancement of the security and resilience of South Africa's critical information infrastructure. The goal of the Network Emulation...
A simulated annealing approach for redesigning a warehouse network problem
Khairuddin, Rozieana; Marlizawati Zainuddin, Zaitul; Jiun, Gan Jia
2017-09-01
Now a day, several companies consider downsizing their distribution networks in ways that involve consolidation or phase-out of some of their current warehousing facilities due to the increasing competition, mounting cost pressure and taking advantage on the economies of scale. Consequently, the changes on economic situation after a certain period of time require an adjustment on the network model in order to get the optimal cost under the current economic conditions. This paper aimed to develop a mixed-integer linear programming model for a two-echelon warehouse network redesign problem with capacitated plant and uncapacitated warehouses. The main contribution of this study is considering capacity constraint for existing warehouses. A Simulated Annealing algorithm is proposed to tackle with the proposed model. The numerical solution showed the model and method of solution proposed was practical.
The design and implementation of a network simulation platform
CSIR Research Space (South Africa)
Von Solms, S
2013-11-01
Full Text Available of the NS. A discussion on the various aspects of the NS is discussed subsequently. A. Topology It can be seen from Figure 1 that the developed NS comprises of multiple network sections, namely Internal User Networks/Local Area Networks (LANs) connected...]. This will provide a realistic platform which is isolated, more controlled and more predictable than implementation across live networks [4]. In this paper we discuss the development of such a network simulation environment, called a network simulator (NS...
Characterization of Background Traffic in Hybrid Network Simulation
National Research Council Canada - National Science Library
Lauwens, Ben; Scheers, Bart; Van de Capelle, Antoine
2006-01-01
.... Two approaches are common: discrete event simulation and fluid approximation. A discrete event simulation generates a huge amount of events for a full-blown battlefield communication network resulting in a very long runtime...
Directory of Open Access Journals (Sweden)
Elston Timothy C
2004-03-01
Full Text Available Abstract Background Intrinsic fluctuations due to the stochastic nature of biochemical reactions can have large effects on the response of biochemical networks. This is particularly true for pathways that involve transcriptional regulation, where generally there are two copies of each gene and the number of messenger RNA (mRNA molecules can be small. Therefore, there is a need for computational tools for developing and investigating stochastic models of biochemical networks. Results We have developed the software package Biochemical Network Stochastic Simulator (BioNetS for efficientlyand accurately simulating stochastic models of biochemical networks. BioNetS has a graphical user interface that allows models to be entered in a straightforward manner, and allows the user to specify the type of random variable (discrete or continuous for each chemical species in the network. The discrete variables are simulated using an efficient implementation of the Gillespie algorithm. For the continuous random variables, BioNetS constructs and numerically solvesthe appropriate chemical Langevin equations. The software package has been developed to scale efficiently with network size, thereby allowing large systems to be studied. BioNetS runs as a BioSpice agent and can be downloaded from http://www.biospice.org. BioNetS also can be run as a stand alone package. All the required files are accessible from http://x.amath.unc.edu/BioNetS. Conclusions We have developed BioNetS to be a reliable tool for studying the stochastic dynamics of large biochemical networks. Important features of BioNetS are its ability to handle hybrid models that consist of both continuous and discrete random variables and its ability to model cell growth and division. We have verified the accuracy and efficiency of the numerical methods by considering several test systems.
Creating real network with expected degree distribution: A statistical simulation
WenJun Zhang; GuangHua Liu
2012-01-01
The degree distribution of known networks is one of the focuses in network analysis. However, its inverse problem, i.e., to create network from known degree distribution has not yet been reported. In present study, a statistical simulation algorithm was developed to create real network with expected degree distribution. It is aniteration procedure in which a real network, with the least deviation of actual degree distribution to expected degree distribution, was created. Random assignment was...
Efficiently passing messages in distributed spiking neural network simulation.
Thibeault, Corey M; Minkovich, Kirill; O'Brien, Michael J; Harris, Frederick C; Srinivasa, Narayan
2013-01-01
Efficiently passing spiking messages in a neural model is an important aspect of high-performance simulation. As the scale of networks has increased so has the size of the computing systems required to simulate them. In addition, the information exchange of these resources has become more of an impediment to performance. In this paper we explore spike message passing using different mechanisms provided by the Message Passing Interface (MPI). A specific implementation, MVAPICH, designed for high-performance clusters with Infiniband hardware is employed. The focus is on providing information about these mechanisms for users of commodity high-performance spiking simulators. In addition, a novel hybrid method for spike exchange was implemented and benchmarked.
Ekofisk chalk: core measurements, stochastic reconstruction, network modeling and simulation
Energy Technology Data Exchange (ETDEWEB)
Talukdar, Saifullah
2002-07-01
porosity in chalk in the form of foraminifer shells. A hybrid reconstruction technique that initializes the simulated annealing reconstruction with input generated using the Gaussian random field method has also been introduced. The technique was found to accelerate significantly the rate of convergence of the simulated annealing method. This finding is important because the main advantage of the simulated annealing method, namely its ability to impose a variety of reconstruction constraints, is usually compromised by its very slow rate of convergence. Absolute permeability, formation factor and mercury-air capillary pressure are computed from simple network models. The input parameters for the network models were extracted from a reconstructed chalk sample. The computed permeability, formation factor and mercury-air capillary pressure correspond well with the experimental data. The predictive power of a network model for chalk is further extended through incorporating important pore-level displacement phenomena and realistic description of pore space geometry and topology. Limited results show that the model may be used to compute absolute and relative permeabilities, capillary pressure, formation factor, resistivity index and saturation exponent. The above findings suggest that the network modeling technique may be used for prediction of petrophysical and reservoir engineering properties of chalk. Further works are necessary and an outline is given with considerable details. Two 2D, one 3D and a dual-porosity fractured reservoir models have been developed and an imbibition process involving water displacing oil is simulated at various injection rates and with different oil-to-water viscosity ratios using four widely used conventional up scaling techniques. The up scaling techniques are the Kyte and Berry, Pore Volume Weighted, Weighted Relative Permeability, and Stone. The results suggest that up scaling of fractured reservoirs may be possible using the conventional
Information diversity in structure and dynamics of simulated neuronal networks.
Mäki-Marttunen, Tuomo; Aćimović, Jugoslava; Nykter, Matti; Kesseli, Juha; Ruohonen, Keijo; Yli-Harja, Olli; Linne, Marja-Leena
2011-01-01
Neuronal networks exhibit a wide diversity of structures, which contributes to the diversity of the dynamics therein. The presented work applies an information theoretic framework to simultaneously analyze structure and dynamics in neuronal networks. Information diversity within the structure and dynamics of a neuronal network is studied using the normalized compression distance. To describe the structure, a scheme for generating distance-dependent networks with identical in-degree distribution but variable strength of dependence on distance is presented. The resulting network structure classes possess differing path length and clustering coefficient distributions. In parallel, comparable realistic neuronal networks are generated with NETMORPH simulator and similar analysis is done on them. To describe the dynamics, network spike trains are simulated using different network structures and their bursting behaviors are analyzed. For the simulation of the network activity the Izhikevich model of spiking neurons is used together with the Tsodyks model of dynamical synapses. We show that the structure of the simulated neuronal networks affects the spontaneous bursting activity when measured with bursting frequency and a set of intraburst measures: the more locally connected networks produce more and longer bursts than the more random networks. The information diversity of the structure of a network is greatest in the most locally connected networks, smallest in random networks, and somewhere in between in the networks between order and disorder. As for the dynamics, the most locally connected networks and some of the in-between networks produce the most complex intraburst spike trains. The same result also holds for sparser of the two considered network densities in the case of full spike trains.
Information Diversity in Structure and Dynamics of Simulated Neuronal Networks
Directory of Open Access Journals (Sweden)
Tuomo eMäki-Marttunen
2011-06-01
Full Text Available Neuronal networks exhibit a wide diversity of structures, which contributes to the diversity of the dynamics therein. The presented work applies an information theoretic framework to simultaneously analyze structure and dynamics in neuronal networks. Information diversity within the structure and dynamics of a neuronal network is studied using the normalized compression distance (NCD. To describe the structure, a scheme for generating distance-dependent networks with identical in-degree distribution but variable strength of dependence on distance is presented. The resulting network structure classes possess diﬀering path length and clustering coeﬃcient distributions. In parallel, comparable realistic neuronal networks are generated with NETMORPH simulator and similar analysis is done on them. To describe the dynamics, network spike trains are simulated using diﬀerent network structures and their bursting behaviours are analyzed. For the simulation of the network activity the Izhikevich model of spiking neurons is used together with the Tsodyks model of dynamical synapses.We show that the structure of the simulated neuronal networks aﬀects the spontaneous bursting activity when measured with bursting frequency and a set of intraburst measures: the more locally connected networks produce more and longer bursts than the more random networks. The information diversity of the structure of a network is greatest in the most locally connected networks, smallest in random networks, and somewhere in between in the networks between order and disorder. As for the dynamics, the most locally connected networks and some of the in-between networks produce the most complex intraburst spike trains. The same result also holds for sparser of the two considered network densities in the case of full spike trains.
Rare event simulation using Monte Carlo methods
Rubino, Gerardo
2009-01-01
In a probabilistic model, a rare event is an event with a very small probability of occurrence. The forecasting of rare events is a formidable task but is important in many areas. For instance a catastrophic failure in a transport system or in a nuclear power plant, the failure of an information processing system in a bank, or in the communication network of a group of banks, leading to financial losses. Being able to evaluate the probability of rare events is therefore a critical issue. Monte Carlo Methods, the simulation of corresponding models, are used to analyze rare events. This book sets out to present the mathematical tools available for the efficient simulation of rare events. Importance sampling and splitting are presented along with an exposition of how to apply these tools to a variety of fields ranging from performance and dependability evaluation of complex systems, typically in computer science or in telecommunications, to chemical reaction analysis in biology or particle transport in physics. ...
Simulation Neurotechnologies for Advancing Brain Research: Parallelizing Large Networks in NEURON.
Lytton, William W; Seidenstein, Alexandra H; Dura-Bernal, Salvador; McDougal, Robert A; Schürmann, Felix; Hines, Michael L
2016-10-01
Large multiscale neuronal network simulations are of increasing value as more big data are gathered about brain wiring and organization under the auspices of a current major research initiative, such as Brain Research through Advancing Innovative Neurotechnologies. The development of these models requires new simulation technologies. We describe here the current use of the NEURON simulator with message passing interface (MPI) for simulation in the domain of moderately large networks on commonly available high-performance computers (HPCs). We discuss the basic layout of such simulations, including the methods of simulation setup, the run-time spike-passing paradigm, and postsimulation data storage and data management approaches. Using the Neuroscience Gateway, a portal for computational neuroscience that provides access to large HPCs, we benchmark simulations of neuronal networks of different sizes (500-100,000 cells), and using different numbers of nodes (1-256). We compare three types of networks, composed of either Izhikevich integrate-and-fire neurons (I&F), single-compartment Hodgkin-Huxley (HH) cells, or a hybrid network with half of each. Results show simulation run time increased approximately linearly with network size and decreased almost linearly with the number of nodes. Networks with I&F neurons were faster than HH networks, although differences were small since all tested cells were point neurons with a single compartment.
Simulation Of Networking Protocols On Software Emulated Network Stack
Directory of Open Access Journals (Sweden)
Hrushikesh Nimkar
2015-08-01
Full Text Available With the increasing number and complexity of network based applications the need to easy configuration development and integration of network applications has taken a high precedence. Trivial activities such as configuration can be carried out efficiently if network services are software based rather than hardware based. Project aims at enabling the network engineers to easily include network functionalities into hisher configuration and define hisher own network stack without using the kernel network stack. Having thought of this we have implemented two functionalities UPNP and MDNS. The multicast Domain Name System MDNS resolves host names to IP addresses within small ad-hoc networks and without having need of special DNS server and its configuration. MDNS application provides every host with functionality to register itself to the router make a multicast DNS request and its resolution. To make adding network devices and networked programs to a network as easy as it is to plug in a piece of hardware into a PC we make use of UPnP. The devices and programs find out about the network setup and other networked devices and programs through discovery and advertisements of services and configure themselves accordingly. UPNP application provides every host with functionality of discovering services of other hosts and serving requests on demand. To implement these applications we have used snabbswitch framework which an open source virtualized ethernet networking stack.
Constructing an Intelligent Patent Network Analysis Method
Chao-Chan Wu; Ching-Bang Yao
2012-01-01
Patent network analysis, an advanced method of patent analysis, is a useful tool for technology management. This method visually displays all the relationships among the patents and enables the analysts to intuitively comprehend the overview of a set of patents in the field of the technology being studied. Although patent network analysis possesses relative advantages different from traditional methods of patent analysis, it is subject to several crucial limitations. To overcome the drawbacks...
An artifical neural network for detection of simulated dental caries
Energy Technology Data Exchange (ETDEWEB)
Kositbowornchai, S. [Khon Kaen Univ. (Thailand). Dept. of Oral Diagnosis; Siriteptawee, S.; Plermkamon, S.; Bureerat, S. [Khon Kaen Univ. (Thailand). Dept. of Mechanical Engineering; Chetchotsak, D. [Khon Kaen Univ. (Thailand). Dept. of Industrial Engineering
2006-08-15
Objects: A neural network was developed to diagnose artificial dental caries using images from a charged-coupled device (CCD)camera and intra-oral digital radiography. The diagnostic performance of this neural network was evaluated against a gold standard. Materials and methods: The neural network design was the Learning Vector Quantization (LVQ) used to classify a tooth surface as sound or as having dental caries. The depth of the dental caries was indicated on a graphic user interface (GUI) screen developed by Matlab programming. Forty-nine images of both sound and simulated dental caries, derived from a CCD camera and by digital radiography, were used to 'train' an artificial neural network. After the 'training' process, a separate test-set comprising 322 unseen images was evaluated. Tooth sections and microscopic examinations were used to confirm the actual dental caries status.The performance of neural network was evaluated using diagnostic test. Results: The sensitivity (95%CI)/specificity (95%CI) of dental caries detection by the CCD camera and digital radiography were 0.77(0.68-0.85)/0.85(0.75-0.92) and 0.81(0.72-0.88)/0.93(0.84-0.97), respectively. The accuracy of caries depth-detection by the CCD camera and digital radiography was 58 and 40%, respectively. Conclusions: The model neural network used in this study could be a prototype for caries detection but should be improved for classifying caries depth. Our study suggests an artificial neural network can be trained to make the correct interpretations of dental caries. (orig.)
Simulation and Evaluation of Ethernet Passive Optical Network
Directory of Open Access Journals (Sweden)
Salah A. Jaro Alabady
2013-05-01
Full Text Available This paper studies simulation and evaluation of Ethernet Passive Optical Network (EPON system, IEEE802.3ah based OPTISM 3.6 simulation program. The simulation program is used in this paper to build a typical ethernet passive optical network, and to evaluate the network performance when using the (1580, 1625 nm wavelength instead of (1310, 1490 nm that used in Optical Line Terminal (OLT and Optical Network Units (ONU's in system architecture of Ethernet passive optical network at different bit rate and different fiber optic length. The results showed enhancement in network performance by increase the number of nodes (subscribers connected to the network, increase the transmission distance, reduces the received power and reduces the Bit Error Rate (BER.
Approximation methods for efficient learning of Bayesian networks
Riggelsen, C
2008-01-01
This publication offers and investigates efficient Monte Carlo simulation methods in order to realize a Bayesian approach to approximate learning of Bayesian networks from both complete and incomplete data. For large amounts of incomplete data when Monte Carlo methods are inefficient, approximations are implemented, such that learning remains feasible, albeit non-Bayesian. The topics discussed are: basic concepts about probabilities, graph theory and conditional independence; Bayesian network learning from data; Monte Carlo simulation techniques; and, the concept of incomplete data. In order to provide a coherent treatment of matters, thereby helping the reader to gain a thorough understanding of the whole concept of learning Bayesian networks from (in)complete data, this publication combines in a clarifying way all the issues presented in the papers with previously unpublished work.
Simulation of heart rate variability model in a network
Cascaval, Radu C.; D'Apice, Ciro; D'Arienzo, Maria Pia
2017-07-01
We consider a 1-D model for the simulation of the blood flow in the cardiovascular system. As inflow condition we consider a model for the aortic valve. The opening and closing of the valve is dynamically determined by the pressure difference between the left ventricular and aortic pressures. At the outflow we impose a peripheral resistance model. To approximate the solution we use a numerical scheme based on the discontinuous Galerkin method. We also considering a variation in heart rate and terminal reflection coefficient due to monitoring of the pressure in the network.
Constructing an Intelligent Patent Network Analysis Method
Directory of Open Access Journals (Sweden)
Chao-Chan Wu
2012-11-01
Full Text Available Patent network analysis, an advanced method of patent analysis, is a useful tool for technology management. This method visually displays all the relationships among the patents and enables the analysts to intuitively comprehend the overview of a set of patents in the field of the technology being studied. Although patent network analysis possesses relative advantages different from traditional methods of patent analysis, it is subject to several crucial limitations. To overcome the drawbacks of the current method, this study proposes a novel patent analysis method, called the intelligent patent network analysis method, to make a visual network with great precision. Based on artificial intelligence techniques, the proposed method provides an automated procedure for searching patent documents, extracting patent keywords, and determining the weight of each patent keyword in order to generate a sophisticated visualization of the patent network. This study proposes a detailed procedure for generating an intelligent patent network that is helpful for improving the efficiency and quality of patent analysis. Furthermore, patents in the field of Carbon Nanotube Backlight Unit (CNT-BLU were analyzed to verify the utility of the proposed method.
Complex networks principles, methods and applications
Latora, Vito; Russo, Giovanni
2017-01-01
Networks constitute the backbone of complex systems, from the human brain to computer communications, transport infrastructures to online social systems and metabolic reactions to financial markets. Characterising their structure improves our understanding of the physical, biological, economic and social phenomena that shape our world. Rigorous and thorough, this textbook presents a detailed overview of the new theory and methods of network science. Covering algorithms for graph exploration, node ranking and network generation, among the others, the book allows students to experiment with network models and real-world data sets, providing them with a deep understanding of the basics of network theory and its practical applications. Systems of growing complexity are examined in detail, challenging students to increase their level of skill. An engaging presentation of the important principles of network science makes this the perfect reference for researchers and undergraduate and graduate students in physics, ...
Binary Classification Method of Social Network Users
Directory of Open Access Journals (Sweden)
I. A. Poryadin
2017-01-01
Full Text Available The subject of research is a binary classification method of social network users based on the data analysis they have placed. Relevance of the task to gain information about a person by examining the content of his/her pages in social networks is exemplified. The most common approach to its solution is a visual browsing. The order of the regional authority in our country illustrates that its using in school education is needed. The article shows restrictions on the visual browsing of pupil’s pages in social networks as a tool for the teacher and the school psychologist and justifies that a process of social network users’ data analysis should be automated. Explores publications, which describe such data acquisition, processing, and analysis methods and considers their advantages and disadvantages. The article also gives arguments to support a proposal to study the classification method of social network users. One such method is credit scoring, which is used in banks and credit institutions to assess the solvency of clients. Based on the high efficiency of the method there is a proposal for significant expansion of its using in other areas of society. The possibility to use logistic regression as the mathematical apparatus of the proposed method of binary classification has been justified. Such an approach enables taking into account the different types of data extracted from social networks. Among them: the personal user data, information about hobbies, friends, graphic and text information, behaviour characteristics. The article describes a number of existing methods of data transformation that can be applied to solve the problem. An experiment of binary gender-based classification of social network users is described. A logistic model obtained for this example includes multiple logical variables obtained by transforming the user surnames. This experiment confirms the feasibility of the proposed method. Further work is to define a system
Advanced fault diagnosis methods in molecular networks.
Habibi, Iman; Emamian, Effat S; Abdi, Ali
2014-01-01
Analysis of the failure of cell signaling networks is an important topic in systems biology and has applications in target discovery and drug development. In this paper, some advanced methods for fault diagnosis in signaling networks are developed and then applied to a caspase network and an SHP2 network. The goal is to understand how, and to what extent, the dysfunction of molecules in a network contributes to the failure of the entire network. Network dysfunction (failure) is defined as failure to produce the expected outputs in response to the input signals. Vulnerability level of a molecule is defined as the probability of the network failure, when the molecule is dysfunctional. In this study, a method to calculate the vulnerability level of single molecules for different combinations of input signals is developed. Furthermore, a more complex yet biologically meaningful method for calculating the multi-fault vulnerability levels is suggested, in which two or more molecules are simultaneously dysfunctional. Finally, a method is developed for fault diagnosis of networks based on a ternary logic model, which considers three activity levels for a molecule instead of the previously published binary logic model, and provides equations for the vulnerabilities of molecules in a ternary framework. Multi-fault analysis shows that the pairs of molecules with high vulnerability typically include a highly vulnerable molecule identified by the single fault analysis. The ternary fault analysis for the caspase network shows that predictions obtained using the more complex ternary model are about the same as the predictions of the simpler binary approach. This study suggests that by increasing the number of activity levels the complexity of the model grows; however, the predictive power of the ternary model does not appear to be increased proportionally.
Xing, Linlin; Guo, Maozu; Liu, Xiaoyan; Wang, Chunyu; Wang, Lei; Zhang, Yin
2017-11-17
The reconstruction of gene regulatory network (GRN) from gene expression data can discover regulatory relationships among genes and gain deep insights into the complicated regulation mechanism of life. However, it is still a great challenge in systems biology and bioinformatics. During the past years, numerous computational approaches have been developed for this goal, and Bayesian network (BN) methods draw most of attention among these methods because of its inherent probability characteristics. However, Bayesian network methods are time consuming and cannot handle large-scale networks due to their high computational complexity, while the mutual information-based methods are highly effective but directionless and have a high false-positive rate. To solve these problems, we propose a Candidate Auto Selection algorithm (CAS) based on mutual information and breakpoint detection to restrict the search space in order to accelerate the learning process of Bayesian network. First, the proposed CAS algorithm automatically selects the neighbor candidates of each node before searching the best structure of GRN. Then based on CAS algorithm, we propose a globally optimal greedy search method (CAS + G), which focuses on finding the highest rated network structure, and a local learning method (CAS + L), which focuses on faster learning the structure with little loss of quality. Results show that the proposed CAS algorithm can effectively reduce the search space of Bayesian networks through identifying the neighbor candidates of each node. In our experiments, the CAS + G method outperforms the state-of-the-art method on simulation data for inferring GRNs, and the CAS + L method is significantly faster than the state-of-the-art method with little loss of accuracy. Hence, the CAS based methods effectively decrease the computational complexity of Bayesian network and are more suitable for GRN inference.
Directory of Open Access Journals (Sweden)
Qiang Zhu
2015-01-01
Full Text Available The reliable mapping of virtual networks is one of the hot issues in network virtualization researches. Unlike the traditional protection mechanisms based on redundancy and recovery mechanisms, we take the solution of the survivable virtual topology routing problem for reference to ensure that the rest of the mapped virtual networks keeps connected under a single node failure condition in the substrate network, which guarantees the completeness of the virtual network and continuity of services. In order to reduce the cost of the substrate network, a hybrid reliable heuristic mapping method based on survivable virtual networks (Hybrid-RHM-SVN is proposed. In Hybrid-RHM-SVN, we formulate the reliable mapping problem as an integer linear program. Firstly, we calculate the primary-cut set of the virtual network subgraph where the failed node has been removed. Then, we use the ant colony optimization algorithm to achieve the approximate optimal mapping. The links in primary-cut set should select a substrate path that does not pass through the substrate node corresponding to the virtual node that has been removed first. The simulation results show that the acceptance rate of virtual networks, the average revenue of mapping, and the recovery rate of virtual networks are increased compared with the existing reliable mapping algorithms, respectively.
The role of simulation in the design of a neural network chip
Desai, Utpal; Roppel, Thaddeus A.; Padgett, Mary L.
1993-01-01
An iterative, simulation-based design procedure for a neural network chip is introduced. For this design procedure, the goal is to produce a chip layout for a neural network in which the weights are determined by transistor gate width-to-length ratios. In a given iteration, the current layout is simulated using the circuit simulator SPICE, and layout adjustments are made based on conventional gradient-decent methods. After the iteration converges, the chip is fabricated. Monte Carlo analysis is used to predict the effect of statistical fabrication process variations on the overall performance of the neural network chip.
Modeling radio link performance in UMTS W-CDMA network simulations
DEFF Research Database (Denmark)
Klingenbrunn, Thomas; Mogensen, Preben Elgaard
2000-01-01
This article presents a method to model the W-CDMA radio receiver performance, which is usable in network simulation tools for third generation mobile cellular systems. The method represents a technique to combine link level simulations with network level simulations. The method is derived from [1......], which defines a stochastic mapping function from a Signal-to-Interference Ratio into a Bit-Error-Rate for a TDMA system. However, in order to work in a W-CDMA based system, the fact that the Multiple-Access Interference in downlink consists of both Gaussian inter-cell interference and orthogonal intra...
Chang, Qiang; Lu, Yang; Quan, Donghui
2017-12-01
Although the Gillespie algorithm is accurate in simulating gas–grain reaction networks, so far its computational cost is so expensive that it cannot be used to simulate chemical reaction networks that include molecular hydrogen accretion or the chemical evolution of protoplanetary disks. We present an accelerated Gillespie algorithm that is based on a quasi-steady-state assumption with the further approximation that the population distribution of transient species depends only on the accretion and desorption processes. The new algorithm is tested against a few reaction networks that are simulated by the regular Gillespie algorithm. We found that the less likely it is that transient species are formed and destroyed on grain surfaces, the more accurate the new method is. We also apply the new method to simulate reaction networks that include molecular hydrogen accretion. The results show that surface chemical reactions involving molecular hydrogen are not important for the production of surface species under standard physical conditions of dense molecular clouds.
Methods for Monte Carlo simulations of biomacromolecules.
Vitalis, Andreas; Pappu, Rohit V
2009-01-01
The state-of-the-art for Monte Carlo (MC) simulations of biomacromolecules is reviewed. Available methodologies for sampling conformational equilibria and associations of biomacromolecules in the canonical ensemble, given a continuum description of the solvent environment, are reviewed. Detailed sections are provided dealing with the choice of degrees of freedom, the efficiencies of MC algorithms and algorithmic peculiarities, as well as the optimization of simple movesets. The issue of introducing correlations into elementary MC moves, and the applicability of such methods to simulations of biomacromolecules is discussed. A brief discussion of multicanonical methods and an overview of recent simulation work highlighting the potential of MC methods are also provided. It is argued that MC simulations, while underutilized biomacromolecular simulation community, hold promise for simulations of complex systems and phenomena that span multiple length scales, especially when used in conjunction with implicit solvation models or other coarse graining strategies.
Graphical user interface for wireless sensor networks simulator
Paczesny, Tomasz; Paczesny, Daniel; Weremczuk, Jerzy
2008-01-01
Wireless Sensor Networks (WSN) are currently very popular area of development. It can be suited in many applications form military through environment monitoring, healthcare, home automation and others. Those networks, when working in dynamic, ad-hoc model, need effective protocols which must differ from common computer networks algorithms. Research on those protocols would be difficult without simulation tool, because real applications often use many nodes and tests on such a big networks take much effort and costs. The paper presents Graphical User Interface (GUI) for simulator which is dedicated for WSN studies, especially in routing and data link protocols evaluation.
A Flexible System for Simulating Aeronautical Telecommunication Network
Maly, Kurt; Overstreet, C. M.; Andey, R.
1998-01-01
At Old Dominion University, we have built Aeronautical Telecommunication Network (ATN) Simulator with NASA being the fund provider. It provides a means to evaluate the impact of modified router scheduling algorithms on the network efficiency, to perform capacity studies on various network topologies and to monitor and study various aspects of ATN through graphical user interface (GUI). In this paper we describe briefly about the proposed ATN model and our abstraction of this model. Later we describe our simulator architecture highlighting some of the design specifications, scheduling algorithms and user interface. At the end, we have provided the results of performance studies on this simulator.
Artificial neural network intelligent method for prediction
Trifonov, Roumen; Yoshinov, Radoslav; Pavlova, Galya; Tsochev, Georgi
2017-09-01
Accounting and financial classification and prediction problems are high challenge and researchers use different methods to solve them. Methods and instruments for short time prediction of financial operations using artificial neural network are considered. The methods, used for prediction of financial data as well as the developed forecasting system with neural network are described in the paper. The architecture of a neural network used four different technical indicators, which are based on the raw data and the current day of the week is presented. The network developed is used for forecasting movement of stock prices one day ahead and consists of an input layer, one hidden layer and an output layer. The training method is algorithm with back propagation of the error. The main advantage of the developed system is self-determination of the optimal topology of neural network, due to which it becomes flexible and more precise The proposed system with neural network is universal and can be applied to various financial instruments using only basic technical indicators as input data.
A neural network simulation package in CLIPS
Bhatnagar, Himanshu; Krolak, Patrick D.; Mcgee, Brenda J.; Coleman, John
1990-01-01
The intrinsic similarity between the firing of a rule and the firing of a neuron has been captured in this research to provide a neural network development system within an existing production system (CLIPS). A very important by-product of this research has been the emergence of an integrated technique of using rule based systems in conjunction with the neural networks to solve complex problems. The systems provides a tool kit for an integrated use of the two techniques and is also extendible to accommodate other AI techniques like the semantic networks, connectionist networks, and even the petri nets. This integrated technique can be very useful in solving complex AI problems.
Double and multiple knockout simulations for genome-scale metabolic network reconstructions.
Goldstein, Yaron Ab; Bockmayr, Alexander
2015-01-01
Constraint-based modeling of genome-scale metabolic network reconstructions has become a widely used approach in computational biology. Flux coupling analysis is a constraint-based method that analyses the impact of single reaction knockouts on other reactions in the network. We present an extension of flux coupling analysis for double and multiple gene or reaction knockouts, and develop corresponding algorithms for an in silico simulation. To evaluate our method, we perform a full single and double knockout analysis on a selection of genome-scale metabolic network reconstructions and compare the results. A prototype implementation of double knockout simulation is available at http://hoverboard.io/L4FC.
Detector Simulation: Data Treatment and Analysis Methods
Apostolakis, J
2011-01-01
Detector Simulation in 'Data Treatment and Analysis Methods', part of 'Landolt-Börnstein - Group I Elementary Particles, Nuclei and Atoms: Numerical Data and Functional Relationships in Science and Technology, Volume 21B1: Detectors for Particles and Radiation. Part 1: Principles and Methods'. This document is part of Part 1 'Principles and Methods' of Subvolume B 'Detectors for Particles and Radiation' of Volume 21 'Elementary Particles' of Landolt-Börnstein - Group I 'Elementary Particles, Nuclei and Atoms'. It contains the Section '4.1 Detector Simulation' of Chapter '4 Data Treatment and Analysis Methods' with the content: 4.1 Detector Simulation 4.1.1 Overview of simulation 4.1.1.1 Uses of detector simulation 4.1.2 Stages and types of simulation 4.1.2.1 Tools for event generation and detector simulation 4.1.2.2 Level of simulation and computation time 4.1.2.3 Radiation effects and background studies 4.1.3 Components of detector simulation 4.1.3.1 Geometry modeling 4.1.3.2 External fields 4.1.3.3 Intro...
Combination methods for identifying influential nodes in networks
Gao, Chao; Zhong, Lu; Li, Xianghua; Zhang, Zili; Shi, Ning
2015-11-01
Identifying influential nodes is of theoretical significance in many domains. Although lots of methods have been proposed to solve this problem, their evaluations are under single-source attack in scale-free networks. Meanwhile, some researches have speculated that the combinations of some methods may achieve more optimal results. In order to evaluate this speculation and design a universal strategy suitable for different types of networks under the consideration of multi-source attacks, this paper proposes an attribute fusion method with two independent strategies to reveal the correlation of existing ranking methods and indicators. One is based on feature union (FU) and the other is based on feature ranking (FR). Two different propagation models in the fields of recommendation system and network immunization are used to simulate the efficiency of our proposed method. Experimental results show that our method can enlarge information spreading and restrain virus propagation in the application of recommendation system and network immunization in different types of networks under the condition of multi-source attacks.
NETWORK ECONOMY INNOVATIVE POTENTIAL EVALUATION METHOD
Directory of Open Access Journals (Sweden)
E. V. Loguinova
2011-01-01
Full Text Available Existing methodological approaches to assessment of the innovation potential having been analyzed, a network system innovative potential identification and characterization method is proposed that makes it possible to assess the potential’s qualitative and quantitative components and to determine their consistency with national innovative system formation and development objectives. Four stages are recommended and determined to assess the network economy innovative potential. Main structural elements of the network economy innovative potential are the resource, institutional, infrastructural and resulting factor totalities.
Isogeometric methods for numerical simulation
Bordas, Stéphane
2015-01-01
The book presents the state of the art in isogeometric modeling and shows how the method has advantaged. First an introduction to geometric modeling with NURBS and T-splines is given followed by the implementation into computer software. The implementation in both the FEM and BEM is discussed.
Homotopy methods for counting reaction network equilibria
Craciun, Gheorghe; Helton, J. William; Williams, Ruth J
2007-01-01
Dynamical system models of complex biochemical reaction networks are usually high-dimensional, nonlinear, and contain many unknown parameters. In some cases the reaction network structure dictates that positive equilibria must be unique for all values of the parameters in the model. In other cases multiple equilibria exist if and only if special relationships between these parameters are satisfied. We describe methods based on homotopy invariance of degree which allow us to determine the numb...
Toward Designing a Quantum Key Distribution Network Simulation Model
Directory of Open Access Journals (Sweden)
Miralem Mehic
2016-01-01
Full Text Available As research in quantum key distribution network technologies grows larger and more complex, the need for highly accurate and scalable simulation technologies becomes important to assess the practical feasibility and foresee difficulties in the practical implementation of theoretical achievements. In this paper, we described the design of simplified simulation environment of the quantum key distribution network with multiple links and nodes. In such simulation environment, we analyzed several routing protocols in terms of the number of sent routing packets, goodput and Packet Delivery Ratio of data traffic flow using NS-3 simulator.
Interfacing Network Simulations and Empirical Data
2009-05-01
appropriate. The quadratic assignment procedure ( QAP ) (Krackhardt, 1987) could be used to compare the correlation between networks; however, the...Social roles and the evolution of networks in extreme and isolated environments. Mathematical Sociology, 27: 89-121. Krackhardt, D. (1987). QAP
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.
Wang, Wei; Huang, Li; Liang, Xuedong
2018-01-06
This paper investigates the reliability of complex emergency logistics networks, as reliability is crucial to reducing environmental and public health losses in post-accident emergency rescues. Such networks' statistical characteristics are analyzed first. After the connected reliability and evaluation indices for complex emergency logistics networks are effectively defined, simulation analyses of network reliability are conducted under two different attack modes using a particular emergency logistics network as an example. The simulation analyses obtain the varying trends in emergency supply times and the ratio of effective nodes and validates the effects of network characteristics and different types of attacks on network reliability. The results demonstrate that this emergency logistics network is both a small-world and a scale-free network. When facing random attacks, the emergency logistics network steadily changes, whereas it is very fragile when facing selective attacks. Therefore, special attention should be paid to the protection of supply nodes and nodes with high connectivity. The simulation method provides a new tool for studying emergency logistics networks and a reference for similar studies.
An introduction to network modeling and simulation for the practicing engineer
Burbank, Jack; Ward, Jon
2011-01-01
This book provides the practicing engineer with a concise listing of commercial and open-source modeling and simulation tools currently available including examples of implementing those tools for solving specific Modeling and Simulation examples. Instead of focusing on the underlying theory of Modeling and Simulation and fundamental building blocks for custom simulations, this book compares platforms used in practice, and gives rules enabling the practicing engineer to utilize available Modeling and Simulation tools. This book will contain insights regarding common pitfalls in network Modeling and Simulation and practical methods for working engineers.
WDM Systems and Networks Modeling, Simulation, Design and Engineering
Ellinas, Georgios; Roudas, Ioannis
2012-01-01
WDM Systems and Networks: Modeling, Simulation, Design and Engineering provides readers with the basic skills, concepts, and design techniques used to begin design and engineering of optical communication systems and networks at various layers. The latest semi-analytical system simulation techniques are applied to optical WDM systems and networks, and a review of the various current areas of optical communications is presented. Simulation is mixed with experimental verification and engineering to present the industry as well as state-of-the-art research. This contributed volume is divided into three parts, accommodating different readers interested in various types of networks and applications. The first part of the book presents modeling approaches and simulation tools mainly for the physical layer including transmission effects, devices, subsystems, and systems), whereas the second part features more engineering/design issues for various types of optical systems including ULH, access, and in-building system...
Liu, Jinkun
2013-01-01
Radial Basis Function (RBF) Neural Network Control for Mechanical Systems is motivated by the need for systematic design approaches to stable adaptive control system design using neural network approximation-based techniques. The main objectives of the book are to introduce the concrete design methods and MATLAB simulation of stable adaptive RBF neural control strategies. In this book, a broad range of implementable neural network control design methods for mechanical systems are presented, such as robot manipulators, inverted pendulums, single link flexible joint robots, motors, etc. Advanced neural network controller design methods and their stability analysis are explored. The book provides readers with the fundamentals of neural network control system design. This book is intended for the researchers in the fields of neural adaptive control, mechanical systems, Matlab simulation, engineering design, robotics and automation. Jinkun Liu is a professor at Beijing University of Aeronautics and Astronauti...
An algebra-based method for inferring gene regulatory networks.
Vera-Licona, Paola; Jarrah, Abdul; Garcia-Puente, Luis David; McGee, John; Laubenbacher, Reinhard
2014-03-26
The inference of gene regulatory networks (GRNs) from experimental observations is at the heart of systems biology. This includes the inference of both the network topology and its dynamics. While there are many algorithms available to infer the network topology from experimental data, less emphasis has been placed on methods that infer network dynamics. Furthermore, since the network inference problem is typically underdetermined, it is essential to have the option of incorporating into the inference process, prior knowledge about the network, along with an effective description of the search space of dynamic models. Finally, it is also important to have an understanding of how a given inference method is affected by experimental and other noise in the data used. This paper contains a novel inference algorithm using the algebraic framework of Boolean polynomial dynamical systems (BPDS), meeting all these requirements. The algorithm takes as input time series data, including those from network perturbations, such as knock-out mutant strains and RNAi experiments. It allows for the incorporation of prior biological knowledge while being robust to significant levels of noise in the data used for inference. It uses an evolutionary algorithm for local optimization with an encoding of the mathematical models as BPDS. The BPDS framework allows an effective representation of the search space for algebraic dynamic models that improves computational performance. The algorithm is validated with both simulated and experimental microarray expression profile data. Robustness to noise is tested using a published mathematical model of the segment polarity gene network in Drosophila melanogaster. Benchmarking of the algorithm is done by comparison with a spectrum of state-of-the-art network inference methods on data from the synthetic IRMA network to demonstrate that our method has good precision and recall for the network reconstruction task, while also predicting several of the
A Latent Variable Clustering Method for Wireless Sensor Networks
DEFF Research Database (Denmark)
Vasilev, Vladislav; Iliev, Georgi; Poulkov, Vladimir
2016-01-01
In this paper we derive a clustering method based on the Hidden Conditional Random Field (HCRF) model in order to maximizes the performance of a wireless sensor. Our novel approach to clustering in this paper is in the application of an index invariant graph that we defined in a previous work...... obtain by running simulations of a time dynamic sensor network. The performance of the proposed method outperforms the existing clustering methods, such as the Girvan-Newmans algorithm, the Kargers algorithm and the Spectral Clustering method, in terms of packet acceptance probability and delay....
Large-Eddy Simulation and Multigrid Methods
Energy Technology Data Exchange (ETDEWEB)
Falgout,R D; Naegle,S; Wittum,G
2001-06-18
A method to simulate turbulent flows with Large-Eddy Simulation on unstructured grids is presented. Two kinds of dynamic models are used to model the unresolved scales of motion and are compared with each other on different grids. Thereby the behavior of the models is shown and additionally the feature of adaptive grid refinement is investigated. Furthermore the parallelization aspect is addressed.
Simulated evolution of signal transduction networks.
Directory of Open Access Journals (Sweden)
Mohammad Mobashir
Full Text Available Signal transduction is the process of routing information inside cells when receiving stimuli from their environment that modulate the behavior and function. In such biological processes, the receptors, after receiving the corresponding signals, activate a number of biomolecules which eventually transduce the signal to the nucleus. The main objective of our work is to develop a theoretical approach which will help to better understand the behavior of signal transduction networks due to changes in kinetic parameters and network topology. By using an evolutionary algorithm, we designed a mathematical model which performs basic signaling tasks similar to the signaling process of living cells. We use a simple dynamical model of signaling networks of interacting proteins and their complexes. We study the evolution of signaling networks described by mass-action kinetics. The fitness of the networks is determined by the number of signals detected out of a series of signals with varying strength. The mutations include changes in the reaction rate and network topology. We found that stronger interactions and addition of new nodes lead to improved evolved responses. The strength of the signal does not play any role in determining the response type. This model will help to understand the dynamic behavior of the proteins involved in signaling pathways. It will also help to understand the robustness of the kinetics of the output response upon changes in the rate of reactions and the topology of the network.
Wireless Power Transfer Protocols in Sensor Networks: Experiments and Simulations
Directory of Open Access Journals (Sweden)
Sotiris Nikoletseas
2017-04-01
Full Text Available Rapid technological advances in the domain of Wireless Power Transfer pave the way for novel methods for power management in systems of wireless devices, and recent research works have already started considering algorithmic solutions for tackling emerging problems. In this paper, we investigate the problem of efficient and balanced Wireless Power Transfer in Wireless Sensor Networks. We employ wireless chargers that replenish the energy of network nodes. We propose two protocols that configure the activity of the chargers. One protocol performs wireless charging focused on the charging efficiency, while the other aims at proper balance of the chargers’ residual energy. We conduct detailed experiments using real devices and we validate the experimental results via larger scale simulations. We observe that, in both the experimental evaluation and the evaluation through detailed simulations, both protocols achieve their main goals. The Charging Oriented protocol achieves good charging efficiency throughout the experiment, while the Energy Balancing protocol achieves a uniform distribution of energy within the chargers.
PyNN: A Common Interface for Neuronal Network Simulators
Davison, Andrew P.; Brüderle, Daniel; Eppler, Jochen; Kremkow, Jens; Muller, Eilif; Pecevski, Dejan; Perrinet, Laurent; Yger, Pierre
2008-01-01
Computational neuroscience has produced a diversity of software for simulations of networks of spiking neurons, with both negative and positive consequences. On the one hand, each simulator uses its own programming or configuration language, leading to considerable difficulty in porting models from one simulator to another. This impedes communication between investigators and makes it harder to reproduce and build on the work of others. On the other hand, simulation results can be cross-checked between different simulators, giving greater confidence in their correctness, and each simulator has different optimizations, so the most appropriate simulator can be chosen for a given modelling task. A common programming interface to multiple simulators would reduce or eliminate the problems of simulator diversity while retaining the benefits. PyNN is such an interface, making it possible to write a simulation script once, using the Python programming language, and run it without modification on any supported simulator (currently NEURON, NEST, PCSIM, Brian and the Heidelberg VLSI neuromorphic hardware). PyNN increases the productivity of neuronal network modelling by providing high-level abstraction, by promoting code sharing and reuse, and by providing a foundation for simulator-agnostic analysis, visualization and data-management tools. PyNN increases the reliability of modelling studies by making it much easier to check results on multiple simulators. PyNN is open-source software and is available from http://neuralensemble.org/PyNN. PMID:19194529
PyNN: a common interface for neuronal network simulators
Directory of Open Access Journals (Sweden)
Andrew P Davison
2009-01-01
Full Text Available Computational neuroscience has produced a diversity of software for simulations of networks of spiking neurons, with both negative and positive consequences. On the one hand, each simulator uses its own programming or configuration language, leading to considerable difficulty in porting models from one simulator to another. This impedes communication between investigators and makes it harder to reproduce and build on the work of others. On the other hand, simulation results can be cross-checked between different simulators, giving greater confidence in their correctness, and each simulator has different optimizations, so the most appropriate simulator can be chosen for a given modelling task. A common programming interface to multiple simulators would reduce or eliminate the problems of simulator diversity while retaining the benefits. PyNN is such an interface, making it possible to write a simulation script once, using the Python programming language, and run it without modification on any supported simulator (currently NEURON, NEST, PCSIM, Brian and the Heidelberg VLSI neuromorphic hardware. PyNN increases the productivity of neuronal network modelling by providing high-level abstraction, by promoting code sharing and reuse, and by providing a foundation for simulator-agnostic analysis, visualization, and data-management tools. PyNN increases the reliability of modelling studies by making it much easier to check results on multiple simulators. PyNN is open-source software and is available from http://neuralensemble.org/PyNN.
FNCS: A Framework for Power System and Communication Networks Co-Simulation
Energy Technology Data Exchange (ETDEWEB)
Ciraci, Selim; Daily, Jeffrey A.; Fuller, Jason C.; Fisher, Andrew R.; Marinovici, Laurentiu D.; Agarwal, Khushbu
2014-04-13
This paper describes the Fenix framework that uses a federated approach for integrating power grid and communication network simulators. Compared existing approaches, Fenix al- lows co-simulation of both transmission and distribution level power grid simulators with the communication network sim- ulator. To reduce the performance overhead of time synchro- nization, Fenix utilizes optimistic synchronization strategies that make speculative decisions about when the simulators are going to exchange messages. GridLAB-D (a distribution simulator), PowerFlow (a transmission simulator), and ns-3 (a telecommunication simulator) are integrated with the frame- work and are used to illustrate the enhanced performance pro- vided by speculative multi-threading on a smart grid applica- tion. Our speculative multi-threading approach achieved on average 20% improvement over the existing synchronization methods
Energy Technology Data Exchange (ETDEWEB)
Ding, Yi; Wang, Peng; Goel, Lalit [Nanyang Technological University, School of Electrical and Electronics Engineering, Block S1, Nanyang Avenue, Singapore 639798 (Singapore); Billinton, Roy; Karki, Rajesh [Department of Electrical Engineering, University of Saskatchewan, Saskatoon (Canada)
2007-10-15
This paper presents a technique to evaluate reliability of a restructured power system with a bilateral market. The proposed technique is based on the combination of the reliability network equivalent and pseudo-sequential simulation approaches. The reliability network equivalent techniques have been implemented in the Monte Carlo simulation procedure to reduce the computational burden of the analysis. Pseudo-sequential simulation has been used to increase the computational efficiency of the non-sequential simulation method and to model the chronological aspects of market trading and system operation. Multi-state Markov models for generation and transmission systems are proposed and implemented in the simulation. A new load shedding scheme is proposed during generation inadequacy and network congestion to minimize the load curtailment. The IEEE reliability test system (RTS) is used to illustrate the technique. (author)
Temporal Gillespie Algorithm: Fast Simulation of Contagion Processes on Time-Varying Networks
Vestergaard, Christian L.; Génois, Mathieu
2015-01-01
Stochastic simulations are one of the cornerstones of the analysis of dynamical processes on complex networks, and are often the only accessible way to explore their behavior. The development of fast algorithms is paramount to allow large-scale simulations. The Gillespie algorithm can be used for fast simulation of stochastic processes, and variants of it have been applied to simulate dynamical processes on static networks. However, its adaptation to temporal networks remains non-trivial. We here present a temporal Gillespie algorithm that solves this problem. Our method is applicable to general Poisson (constant-rate) processes on temporal networks, stochastically exact, and up to multiple orders of magnitude faster than traditional simulation schemes based on rejection sampling. We also show how it can be extended to simulate non-Markovian processes. The algorithm is easily applicable in practice, and as an illustration we detail how to simulate both Poissonian and non-Markovian models of epidemic spreading. Namely, we provide pseudocode and its implementation in C++ for simulating the paradigmatic Susceptible-Infected-Susceptible and Susceptible-Infected-Recovered models and a Susceptible-Infected-Recovered model with non-constant recovery rates. For empirical networks, the temporal Gillespie algorithm is here typically from 10 to 100 times faster than rejection sampling. PMID:26517860
Directory of Open Access Journals (Sweden)
Ufa Ruslan A.
2015-01-01
Full Text Available The motivation of the presented research is based on the needs for development of new methods and tools for adequate simulation of intelligent electric power systems with active-adaptive electric networks (IES including Flexible Alternating Current Transmission System (FACTS devices. The key requirements for the simulation were formed. The presented analysis of simulation results of IES confirms the need to use a hybrid modelling approach.
Validating module network learning algorithms using simulated data.
Michoel, Tom; Maere, Steven; Bonnet, Eric; Joshi, Anagha; Saeys, Yvan; Van den Bulcke, Tim; Van Leemput, Koenraad; van Remortel, Piet; Kuiper, Martin; Marchal, Kathleen; Van de Peer, Yves
2007-05-03
In recent years, several authors have used probabilistic graphical models to learn expression modules and their regulatory programs from gene expression data. Despite the demonstrated success of such algorithms in uncovering biologically relevant regulatory relations, further developments in the area are hampered by a lack of tools to compare the performance of alternative module network learning strategies. Here, we demonstrate the use of the synthetic data generator SynTReN for the purpose of testing and comparing module network learning algorithms. We introduce a software package for learning module networks, called LeMoNe, which incorporates a novel strategy for learning regulatory programs. Novelties include the use of a bottom-up Bayesian hierarchical clustering to construct the regulatory programs, and the use of a conditional entropy measure to assign regulators to the regulation program nodes. Using SynTReN data, we test the performance of LeMoNe in a completely controlled situation and assess the effect of the methodological changes we made with respect to an existing software package, namely Genomica. Additionally, we assess the effect of various parameters, such as the size of the data set and the amount of noise, on the inference performance. Overall, application of Genomica and LeMoNe to simulated data sets gave comparable results. However, LeMoNe offers some advantages, one of them being that the learning process is considerably faster for larger data sets. Additionally, we show that the location of the regulators in the LeMoNe regulation programs and their conditional entropy may be used to prioritize regulators for functional validation, and that the combination of the bottom-up clustering strategy with the conditional entropy-based assignment of regulators improves the handling of missing or hidden regulators. We show that data simulators such as SynTReN are very well suited for the purpose of developing, testing and improving module network
Fast and accurate simulations of transmission-line metamaterials using transmission-matrix method
Ma, Hui Feng; Cui, Tie Jun; Chin, Jessie Yao; Cheng, Qiang
2009-01-01
Recently, two-dimensional (2D) periodically L and C loaded transmission-line (TL) networks have been applied to represent metamaterials. The commercial Agilent's Advanced Design System (ADS) is a commonly-used tool to simulate the TL metamaterials. However, it takes a lot of time to set up the TL network and perform numerical simulations using ADS, making the metamaterial analysis inefficient, especially for large-scale TL networks. In this paper, we propose transmission-matrix method (TMM) t...
Double and multiple knockout simulations for genome-scale metabolic network reconstructions
Goldstein, Yaron AB; Bockmayr, Alexander
2015-01-01
Background Constraint-based modeling of genome-scale metabolic network reconstructions has become a widely used approach in computational biology. Flux coupling analysis is a constraint-based method that analyses the impact of single reaction knockouts on other reactions in the network. Results We present an extension of flux coupling analysis for double and multiple gene or reaction knockouts, and develop corresponding algorithms for an in silico simulation. To evaluate our method, we perfor...
Meeting the memory challenges of brain-scale network simulation
Directory of Open Access Journals (Sweden)
Susanne eKunkel
2012-01-01
Full Text Available The development of high-performance simulation software is crucial for studying the brain connectome. Using connectome data to generate neurocomputational models requires software capable of coping with models on a variety of scales: from the microscale, investigating plasticity and dynamics of circuits in local networks, to the macroscale, investigating the interactions between distinct brain regions. Prior to any serious dynamical investigation, the first task of network simulations is to check the consistency of data integrated in the connectome and constrain ranges for yet unknown parameters. Thanks to distributed computing techniques, it is possible today to routinely simulate local cortical networks of around 10^5 neurons with up to 10^9 synapses on clusters and multi-processor shared-memory machines. However, brain-scale networks are one or two orders of magnitude larger than such local networks, in terms of numbers of neurons and synapses as well as in terms of computational load. Such networks have been studied in individual studies, but the underlying simulation technologies have neither been described in sufficient detail to be reproducible nor made publicly available. Here, we discover that as the network model sizes approach the regime of meso- and macroscale simulations, memory consumption on individual compute nodes becomes a critical bottleneck. This is especially relevant on modern supercomputers such as the Bluegene/P architecture where the available working memory per CPU core is rather limited. We develop a simple linear model to analyze the memory consumption of the constituent components of a neuronal simulator as a function of network size and the number of cores used. This approach has multiple benefits. The model enables identification of key contributing components to memory saturation and prediction of the effects of potential improvements to code before any implementation takes place.
Exploration Knowledge Sharing Networks Using Social Network Analysis Methods
Directory of Open Access Journals (Sweden)
Győző Attila Szilágyi
2017-10-01
Full Text Available Knowledge sharing within organization is one of the key factor for success. The organization, where knowledge sharing takes place faster and more efficiently, is able to adapt to changes in the market environment more successfully, and as a result, it may obtain a competitive advantage. Knowledge sharing in an organization is carried out through formal and informal human communication contacts during work. This forms a multi-level complex network whose quantitative and topological characteristics largely determine how quickly and to what extent the knowledge travels within organization. The study presents how different networks of knowledge sharing in the organization can be explored by means of network analysis methods through a case study, and which role play the properties of these networks in fast and sufficient spread of knowledge in organizations. The study also demonstrates the practical applications of our research results. Namely, on the basis of knowledge sharing educational strategies can be developed in an organization, and further, competitiveness of an organization may increase due to those strategies’ application.
Computational Aspects of Sensor Network Protocols (Distributed Sensor Network Simulator
Directory of Open Access Journals (Sweden)
Vasanth Iyer
2009-08-01
Full Text Available In this work, we model the sensor networks as an unsupervised learning and clustering process. We classify nodes according to its static distribution to form known class densities (CCPD. These densities are chosen from specific cross-layer features which maximizes lifetime of power-aware routing algorithms. To circumvent computational complexities of a power-ware communication STACK we introduce path-loss models at the nodes only for high density deployments. We study the cluster heads and formulate the data handling capacity for an expected deployment and use localized probability models to fuse the data with its side information before transmission. So each cluster head has a unique Pmax but not all cluster heads have the same measured value. In a lossless mode if there are no faults in the sensor network then we can show that the highest probability given by Pmax is ambiguous if its frequency is ≤ n/2 otherwise it can be determined by a local function. We further show that the event detection at the cluster heads can be modelled with a pattern 2m and m, the number of bits can be a correlated pattern of 2 bits and for a tight lower bound we use 3-bit Huffman codes which have entropy < 1. These local algorithms are further studied to optimize on power, fault detection and to maximize on the distributed routing algorithm used at the higher layers. From these bounds in large network, it is observed that the power dissipation is network size invariant. The performance of the routing algorithms solely based on success of finding healthy nodes in a large distribution. It is also observed that if the network size is kept constant and the density of the nodes is kept closer then the local pathloss model effects the performance of the routing algorithms. We also obtain the maximum intensity of transmitting nodes for a given category of routing algorithms for an outage constraint, i.e., the lifetime of sensor network.
Power Aware Simulation Framework for Wireless Sensor Networks and Nodes
Directory of Open Access Journals (Sweden)
Daniel Weber
2008-07-01
Full Text Available The constrained resources of sensor nodes limit analytical techniques and cost-time factors limit test beds to study wireless sensor networks (WSNs. Consequently, simulation becomes an essential tool to evaluate such systems.We present the power aware wireless sensors (PAWiS simulation framework that supports design and simulation of wireless sensor networks and nodes. The framework emphasizes power consumption capturing and hence the identification of inefficiencies in various hardware and software modules of the systems. These modules include all layers of the communication system, the targeted class of application itself, the power supply and energy management, the central processing unit (CPU, and the sensor-actuator interface. The modular design makes it possible to simulate heterogeneous systems. PAWiS is an OMNeT++ based discrete event simulator written in C++. It captures the node internals (modules as well as the node surroundings (network, environment and provides specific features critical to WSNs like capturing power consumption at various levels of granularity, support for mobility, and environmental dynamics as well as the simulation of timing effects. A module library with standardized interfaces and a power analysis tool have been developed to support the design and analysis of simulation models. The performance of the PAWiS simulator is comparable with other simulation environments.
Simulating public private networks as evolving systems
Deljoo, A.; Janssen, M.F.W.H.A.; Klievink, A.J.
2013-01-01
Public-private service networks (PPSN) consist of social and technology components. Development of PPSN is ill-understood as these are dependent on a complex mix of interactions among stakeholders and their technologies and is influenced by contemporary developments. The aim of this paper is to
Queueing networks : Rare events and fast simulations
Miretskiy, D.I.
2009-01-01
This monograph focuses on rare events. Even though they are extremely unlikely, they can still occur and then could have significant consequences. We mainly consider rare events in queueing networks. More precisely, we are interested in the probability of collecting some large number of jobs in the
Numerical simulation of fibrous biomaterials with randomly distributed fiber network structure.
Jin, Tao; Stanciulescu, Ilinca
2016-08-01
This paper presents a computational framework to simulate the mechanical behavior of fibrous biomaterials with randomly distributed fiber networks. A random walk algorithm is implemented to generate the synthetic fiber network in 2D used in simulations. The embedded fiber approach is then adopted to model the fibers as embedded truss elements in the ground matrix, which is essentially equivalent to the affine fiber kinematics. The fiber-matrix interaction is partially considered in the sense that the two material components deform together, but no relative movement is considered. A variational approach is carried out to derive the element residual and stiffness matrices for finite element method (FEM), in which material and geometric nonlinearities are both included. Using a data structure proposed to record the network geometric information, the fiber network is directly incorporated into the FEM simulation without significantly increasing the computational cost. A mesh sensitivity analysis is conducted to show the influence of mesh size on various simulation results. The proposed method can be easily combined with Monte Carlo (MC) simulations to include the influence of the stochastic nature of the network and capture the material behavior in an average sense. The computational framework proposed in this work goes midway between homogenizing the fiber network into the surrounding matrix and accounting for the fully coupled fiber-matrix interaction at the segment length scale, and can be used to study the connection between the microscopic structure and the macro-mechanical behavior of fibrous biomaterials with a reasonable computational cost.
Climate and change: simulating flooding impacts on urban transport network
Pregnolato, Maria; Ford, Alistair; Dawson, Richard
2015-04-01
National-scale climate projections indicate that in the future there will be hotter and drier summers, warmer and wetter winters, together with rising sea levels. The frequency of extreme weather events is expected to increase, causing severe damage to the built environment and disruption of infrastructures (Dawson, 2007), whilst population growth and changed demographics are placing new demands on urban infrastructure. It is therefore essential to ensure infrastructure networks are robust to these changes. This research addresses these challenges by focussing on the development of probabilistic tools for managing risk by modelling urban transport networks within the context of extreme weather events. This paper presents a methodology to investigate the impacts of extreme weather events on urban environment, in particular infrastructure networks, through a combination of climate simulations and spatial representations. By overlaying spatial data on hazard thresholds from a flood model and a flood safety function, mitigated by potential adaptation strategies, different levels of disruption to commuting journeys on road networks are evaluated. The method follows the Catastrophe Modelling approach and it consists of a spatial model, combining deterministic loss models and probabilistic risk assessment techniques. It can be applied to present conditions as well as future uncertain scenarios, allowing the examination of the impacts alongside socio-economic and climate changes. The hazard is determined by simulating free surface water flooding, with the software CityCAT (Glenis et al., 2013). The outputs are overlapped to the spatial locations of a simple network model in GIS, which uses journey-to-work (JTW) observations, supplemented with speed and capacity information. To calculate the disruptive effect of flooding on transport networks, a function relating water depth to safe driving car speed has been developed by combining data from experimental reports (Morris et
2-d Simulations of Test Methods
DEFF Research Database (Denmark)
Thrane, Lars Nyholm
2004-01-01
using both a Newton and Bingham model for characterisation of the rheological properties of the concrete. From the results, it is expected that both the slump flow and L-box can be simulated quite accurately when the model is extended to 3-d and the concrete is characterised according to the Bingham......One of the main obstacles for the further development of self-compacting concrete is to relate the fresh concrete properties to the form filling ability. Therefore, simulation of the form filling ability will provide a powerful tool in obtaining this goal. In this paper, a continuum mechanical...... approach is presented by showing initial results from 2-d simulations of the empirical test methods slump flow and L-box. This method assumes a homogeneous material, which is expected to correspond to particle suspensions e.g. concrete, when it remains stable. The simulations have been carried out when...
Tao, Ye; Tsukada, Manabu; LI, Xin; Kakiuchi, Masatoshi; Esaki, Hiroshi
2016-01-01
International audience; Vehicular Ad-hoc Network (VANET) is a type of Mobile Ad-hoc Network (MANET) which is specialized for vehicle communication. GeoNetworking is a new standardized network layer protocol for VANET which employs geolocation based routing. However, conducting large scale experiments in GeoNetworking softwares is extremely difficult, since it requires many extra factors such as vehicles, stuff, place, terrain, etc. In this paper, we propose a method to reproduce realistic res...
Quantitative evaluation of simulated functional brain networks in graph theoretical analysis.
Lee, Won Hee; Bullmore, Ed; Frangou, Sophia
2017-02-01
There is increasing interest in the potential of whole-brain computational models to provide mechanistic insights into resting-state brain networks. It is therefore important to determine the degree to which computational models reproduce the topological features of empirical functional brain networks. We used empirical connectivity data derived from diffusion spectrum and resting-state functional magnetic resonance imaging data from healthy individuals. Empirical and simulated functional networks, constrained by structural connectivity, were defined based on 66 brain anatomical regions (nodes). Simulated functional data were generated using the Kuramoto model in which each anatomical region acts as a phase oscillator. Network topology was studied using graph theory in the empirical and simulated data. The difference (relative error) between graph theory measures derived from empirical and simulated data was then estimated. We found that simulated data can be used with confidence to model graph measures of global network organization at different dynamic states and highlight the sensitive dependence of the solutions obtained in simulated data on the specified connection densities. This study provides a method for the quantitative evaluation and external validation of graph theory metrics derived from simulated data that can be used to inform future study designs. Copyright © 2016 The Authors. Published by Elsevier Inc. All rights reserved.
Quantitative Method for Network Security Situation Based on Attack Prediction
Directory of Open Access Journals (Sweden)
Hao Hu
2017-01-01
Full Text Available Multistep attack prediction and security situation awareness are two big challenges for network administrators because future is generally unknown. In recent years, many investigations have been made. However, they are not sufficient. To improve the comprehensiveness of prediction, in this paper, we quantitatively convert attack threat into security situation. Actually, two algorithms are proposed, namely, attack prediction algorithm using dynamic Bayesian attack graph and security situation quantification algorithm based on attack prediction. The first algorithm aims to provide more abundant information of future attack behaviors by simulating incremental network penetration. Through timely evaluating the attack capacity of intruder and defense strategies of defender, the likely attack goal, path, and probability and time-cost are predicted dynamically along with the ongoing security events. Furthermore, in combination with the common vulnerability scoring system (CVSS metric and network assets information, the second algorithm quantifies the concealed attack threat into the surfaced security risk from two levels: host and network. Examples show that our method is feasible and flexible for the attack-defense adversarial network environment, which benefits the administrator to infer the security situation in advance and prerepair the critical compromised hosts to maintain normal network communication.
Utilization of Selected Data Mining Methods for Communication Network Analysis
Directory of Open Access Journals (Sweden)
V. Ondryhal
2011-06-01
Full Text Available The aim of the project was to analyze the behavior of military communication networks based on work with real data collected continuously since 2005. With regard to the nature and amount of the data, data mining methods were selected for the purpose of analyses and experiments. The quality of real data is often insufficient for an immediate analysis. The article presents the data cleaning operations which have been carried out with the aim to improve the input data sample to obtain reliable models. Gradually, by means of properly chosen SW, network models were developed to verify generally valid patterns of network behavior as a bulk service. Furthermore, unlike the commercially available communication networks simulators, the models designed allowed us to capture nonstandard models of network behavior under an increased load, verify the correct sizing of the network to the increased load, and thus test its reliability. Finally, based on previous experience, the models enabled us to predict emergency situations with a reasonable accuracy.
Bayesian network reconstruction using systems genetics data: comparison of MCMC methods.
Tasaki, Shinya; Sauerwine, Ben; Hoff, Bruce; Toyoshiba, Hiroyoshi; Gaiteri, Chris; Chaibub Neto, Elias
2015-04-01
Reconstructing biological networks using high-throughput technologies has the potential to produce condition-specific interactomes. But are these reconstructed networks a reliable source of biological interactions? Do some network inference methods offer dramatically improved performance on certain types of networks? To facilitate the use of network inference methods in systems biology, we report a large-scale simulation study comparing the ability of Markov chain Monte Carlo (MCMC) samplers to reverse engineer Bayesian networks. The MCMC samplers we investigated included foundational and state-of-the-art Metropolis-Hastings and Gibbs sampling approaches, as well as novel samplers we have designed. To enable a comprehensive comparison, we simulated gene expression and genetics data from known network structures under a range of biologically plausible scenarios. We examine the overall quality of network inference via different methods, as well as how their performance is affected by network characteristics. Our simulations reveal that network size, edge density, and strength of gene-to-gene signaling are major parameters that differentiate the performance of various samplers. Specifically, more recent samplers including our novel methods outperform traditional samplers for highly interconnected large networks with strong gene-to-gene signaling. Our newly developed samplers show comparable or superior performance to the top existing methods. Moreover, this performance gain is strongest in networks with biologically oriented topology, which indicates that our novel samplers are suitable for inferring biological networks. The performance of MCMC samplers in this simulation framework can guide the choice of methods for network reconstruction using systems genetics data. Copyright © 2015 by the Genetics Society of America.
SiGNet: A signaling network data simulator to enable signaling network inference.
Directory of Open Access Journals (Sweden)
Elizabeth A Coker
Full Text Available Network models are widely used to describe complex signaling systems. Cellular wiring varies in different cellular contexts and numerous inference techniques have been developed to infer the structure of a network from experimental data of the network's behavior. To objectively identify which inference strategy is best suited to a specific network, a gold standard network and dataset are required. However, suitable datasets for benchmarking are difficult to find. Numerous tools exist that can simulate data for transcriptional networks, but these are of limited use for the study of signaling networks. Here, we describe SiGNet (Signal Generator for Networks: a Cytoscape app that simulates experimental data for a signaling network of known structure. SiGNet has been developed and tested against published experimental data, incorporating information on network architecture, and the directionality and strength of interactions to create biological data in silico. SiGNet is the first tool to simulate biological signaling data, enabling an accurate and systematic assessment of inference strategies. SiGNet can also be used to produce preliminary models of key biological pathways following perturbation.
Integrated Circuit For Simulation Of Neural Network
Thakoor, Anilkumar P.; Moopenn, Alexander W.; Khanna, Satish K.
1988-01-01
Ballast resistors deposited on top of circuit structure. Cascadable, programmable binary connection matrix fabricated in VLSI form as basic building block for assembly of like units into content-addressable electronic memory matrices operating somewhat like networks of neurons. Connections formed during storage of data, and data recalled from memory by prompting matrix with approximate or partly erroneous signals. Redundancy in pattern of connections causes matrix to respond with correct stored data.
Multiple Linear Regression Model Based on Neural Network and Its Application in the MBR Simulation
Directory of Open Access Journals (Sweden)
Chunqing Li
2012-01-01
Full Text Available The computer simulation of the membrane bioreactor MBR has become the research focus of the MBR simulation. In order to compensate for the defects, for example, long test period, high cost, invisible equipment seal, and so forth, on the basis of conducting in-depth study of the mathematical model of the MBR, combining with neural network theory, this paper proposed a three-dimensional simulation system for MBR wastewater treatment, with fast speed, high efficiency, and good visualization. The system is researched and developed with the hybrid programming of VC++ programming language and OpenGL, with a multifactor linear regression model of affecting MBR membrane fluxes based on neural network, applying modeling method of integer instead of float and quad tree recursion. The experiments show that the three-dimensional simulation system, using the above models and methods, has the inspiration and reference for the future research and application of the MBR simulation technology.
Rainfall Simulation: methods, research questions and challenges
Ries, J. B.; Iserloh, T.
2012-04-01
In erosion research, rainfall simulations are used for the improvement of process knowledge as well as in the field for the assessment of overland flow generation, infiltration, and erosion rates. In all these fields of research, rainfall experiments have become an indispensable part of the research methods. In this context, small portable rainfall simulators with small test-plot sizes of one square-meter or even less, and devices of low weight and water consumption are in demand. Accordingly, devices with manageable technical effort like nozzle-type simulators seem to prevail against larger simulators. The reasons are obvious: lower costs and less time consumption needed for mounting enable a higher repetition rate. Regarding the high number of research questions, of different fields of application, and not least also due to the great technical creativity of our research staff, a large number of different experimental setups is available. Each of the devices produces a different rainfall, leading to different kinetic energy amounts influencing the soil surface and accordingly, producing different erosion results. Hence, important questions contain the definition, the comparability, the measurement and the simulation of natural rainfall and the problem of comparability in general. Another important discussion topic will be the finding of an agreement on an appropriate calibration method for the simulated rainfalls, in order to enable a comparison of the results of different rainfall simulator set-ups. In most of the publications, only the following "nice" sentence can be read: "Our rainfall simulator generates a rainfall spectrum that is similar to natural rainfall!". The most substantial and critical properties of a simulated rainfall are the drop-size distribution, the fall velocities of the drops, and the spatial distribution of the rainfall on the plot-area. In a comparison of the most important methods, the Laser Distrometer turned out to be the most up
Matrix method for acoustic levitation simulation.
Andrade, Marco A B; Perez, Nicolas; Buiochi, Flavio; Adamowski, Julio C
2011-08-01
A matrix method is presented for simulating acoustic levitators. A typical acoustic levitator consists of an ultrasonic transducer and a reflector. The matrix method is used to determine the potential for acoustic radiation force that acts on a small sphere in the standing wave field produced by the levitator. The method is based on the Rayleigh integral and it takes into account the multiple reflections that occur between the transducer and the reflector. The potential for acoustic radiation force obtained by the matrix method is validated by comparing the matrix method results with those obtained by the finite element method when using an axisymmetric model of a single-axis acoustic levitator. After validation, the method is applied in the simulation of a noncontact manipulation system consisting of two 37.9-kHz Langevin-type transducers and a plane reflector. The manipulation system allows control of the horizontal position of a small levitated sphere from -6 mm to 6 mm, which is done by changing the phase difference between the two transducers. The horizontal position of the sphere predicted by the matrix method agrees with the horizontal positions measured experimentally with a charge-coupled device camera. The main advantage of the matrix method is that it allows simulation of non-symmetric acoustic levitators without requiring much computational effort.
Wang, Tai-Chi; Phoa, Frederick Kin Hing
2016-03-01
Community/cluster is one of the most important features in social networks. Many cluster detection methods were proposed to identify such an important pattern, but few were able to identify the statistical significance of the clusters by considering the likelihood of network structure and its attributes. Based on the definition of clustering, we propose a scanning method, originated from analyzing spatial data, for identifying clusters in social networks. Since the properties of network data are more complicated than those of spatial data, we verify our method's feasibility via simulation studies. The results show that the detection powers are affected by cluster sizes and connection probabilities. According to our simulation results, the detection accuracy of structure clusters and both structure and attribute clusters detected by our proposed method is better than that of other methods in most of our simulation cases. In addition, we apply our proposed method to some empirical data to identify statistically significant clusters.
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.
System Identification, Prediction, Simulation and Control with Neural Networks
DEFF Research Database (Denmark)
Sørensen, O.
1997-01-01
a Gauss-Newton search direction is applied. 3) Amongst numerous model types, often met in control applications, only the Non-linear ARMAX (NARMAX) model, representing input/output description, is examined. A simulated example confirms that a neural network has the potential to perform excellent System...... Identification, Prediction, Simulation and Control of a dynamic, non-linear and noisy process. Further, the difficulties to control a practical non-linear laboratory process in a satisfactory way by using a traditional controller are overcomed by using a trained neural network to perform non-linear System......The intention of this paper is to make a systematic examination of the possibilities of applying neural networks in those technical areas, which are familiar to a control engineer. In other words, the potential of neural networks in control applications is given higher priority than a detailed...
S-curve networks and a new method for estimating degree distributions of complex networks
Guo, Jin-Li
2010-01-01
In the study of complex networks almost all theoretical models are infinite growth, but the size of actual networks is finite. According to statistics from the China Internet IPv4 addresses, we propose a forecasting model by using S curve (Logistic curve). The growing trend of IPv4 addresses in China is forecasted. There are some reference value for optimizing the distribution of IPv4 address resource and the development of IPv6. Based on the laws of IPv4 growth, that is, the bulk growth and the finitely growing limit, we propose a finite network model with the bulk growth. The model is called S-curve network. Analysis demonstrates that the analytic method based on uniform distributions (i.e., Barab\\'asi-Albert method) is not suitable for the network. We develop a new method to predict the growth dynamics of the individual nodes, and use this to calculate analytically the connectivity distribution and the scaling exponents. The analytical result agrees with the simulation well, obeying an approximately power-...
Gritsun, T.; Stegenga, J.; le Feber, Jakob; Rutten, Wim
2009-01-01
In this paper we address the issue of spontaneous bursting activity in cortical neuronal cultures and explain what might cause this collective behavior using computer simulations of two different neural network models. While the common approach to acivate a passive network is done by introducing
A SIMULATION ON TEACHING VOLHARD METHOD
Directory of Open Access Journals (Sweden)
Celal BAYRAK
2009-07-01
Full Text Available Laboratories are important components of chemistry education. Virtual simulations allow students to repeat the experiments as many times as they want and give students the opportunity to learn in their own ways. In this study, a computer assisted teaching material has been developed for tertiary level. This material has been planned to use in Analytical Chemistry Course content in the subject of quantitative methods. This teaching material has been developed by using Flash program and consisted of animations and simulations related to the quantitative determination of chloride by Volhard Method. Even though the quantitative determination of chloride by Volhard Method could be conducted in the laboratory setting, this experiment has been prepared by using simulations to give students the opportunity to repeat the experiment steps when they want, to control the each step, observing the changes on the equivalence point better. Volhard method is one of the methods to be considered as important in chemistry courses and laboratories. It is an important practical experience for students in the laboratory. In this study, the presented simulation has been prepared by considering these harmful effects and insufficient laboratory conditions.
High Fidelity Simulations of Large-Scale Wireless Networks
Energy Technology Data Exchange (ETDEWEB)
Onunkwo, Uzoma [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States); Benz, Zachary [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States)
2015-11-01
The worldwide proliferation of wireless connected devices continues to accelerate. There are 10s of billions of wireless links across the planet with an additional explosion of new wireless usage anticipated as the Internet of Things develops. Wireless technologies do not only provide convenience for mobile applications, but are also extremely cost-effective to deploy. Thus, this trend towards wireless connectivity will only continue and Sandia must develop the necessary simulation technology to proactively analyze the associated emerging vulnerabilities. Wireless networks are marked by mobility and proximity-based connectivity. The de facto standard for exploratory studies of wireless networks is discrete event simulations (DES). However, the simulation of large-scale wireless networks is extremely difficult due to prohibitively large turnaround time. A path forward is to expedite simulations with parallel discrete event simulation (PDES) techniques. The mobility and distance-based connectivity associated with wireless simulations, however, typically doom PDES and fail to scale (e.g., OPNET and ns-3 simulators). We propose a PDES-based tool aimed at reducing the communication overhead between processors. The proposed solution will use light-weight processes to dynamically distribute computation workload while mitigating communication overhead associated with synchronizations. This work is vital to the analytics and validation capabilities of simulation and emulation at Sandia. We have years of experience in Sandia’s simulation and emulation projects (e.g., MINIMEGA and FIREWHEEL). Sandia’s current highly-regarded capabilities in large-scale emulations have focused on wired networks, where two assumptions prevent scalable wireless studies: (a) the connections between objects are mostly static and (b) the nodes have fixed locations.
Computer methods in electric network analysis
Energy Technology Data Exchange (ETDEWEB)
Saver, P.; Hajj, I.; Pai, M.; Trick, T.
1983-06-01
The computational algorithms utilized in power system analysis have more than just a minor overlap with those used in electronic circuit computer aided design. This paper describes the computer methods that are common to both areas and highlights the differences in application through brief examples. Recognizing this commonality has stimulated the exchange of useful techniques in both areas and has the potential of fostering new approaches to electric network analysis through the interchange of ideas.
Simulation teaching method in Engineering Optics
Lu, Qieni; Wang, Yi; Li, Hongbin
2017-08-01
We here introduce a pedagogical method of theoretical simulation as one major means of the teaching process of "Engineering Optics" in course quality improvement action plan (Qc) in our school. Students, in groups of three to five, complete simulations of interference, diffraction, electromagnetism and polarization of light; each student is evaluated and scored in light of his performance in the interviews between the teacher and the student, and each student can opt to be interviewed many times until he is satisfied with his score and learning. After three years of Qc practice, the remarkable teaching and learning effect is obatined. Such theoretical simulation experiment is a very valuable teaching method worthwhile for physical optics which is highly theoretical and abstruse. This teaching methodology works well in training students as to how to ask questions and how to solve problems, which can also stimulate their interest in research learning and their initiative to develop their self-confidence and sense of innovation.
Spectral Analysis Methods of Social Networks
Directory of Open Access Journals (Sweden)
P. G. Klyucharev
2017-01-01
Full Text Available Online social networks (such as Facebook, Twitter, VKontakte, etc. being an important channel for disseminating information are often used to arrange an impact on the social consciousness for various purposes - from advertising products or services to the full-scale information war thereby making them to be a very relevant object of research. The paper reviewed the analysis methods of social networks (primarily, online, based on the spectral theory of graphs. Such methods use the spectrum of the social graph, i.e. a set of eigenvalues of its adjacency matrix, and also the eigenvectors of the adjacency matrix.Described measures of centrality (in particular, centrality based on the eigenvector and PageRank, which reflect a degree of impact one or another user of the social network has. A very popular PageRank measure uses, as a measure of centrality, the graph vertices, the final probabilities of the Markov chain, whose matrix of transition probabilities is calculated on the basis of the adjacency matrix of the social graph. The vector of final probabilities is an eigenvector of the matrix of transition probabilities.Presented a method of dividing the graph vertices into two groups. It is based on maximizing the network modularity by computing the eigenvector of the modularity matrix.Considered a method for detecting bots based on the non-randomness measure of a graph to be computed using the spectral coordinates of vertices - sets of eigenvector components of the adjacency matrix of a social graph.In general, there are a number of algorithms to analyse social networks based on the spectral theory of graphs. These algorithms show very good results, but their disadvantage is the relatively high (albeit polynomial computational complexity for large graphs.At the same time it is obvious that the practical application capacity of the spectral graph theory methods is still underestimated, and it may be used as a basis to develop new methods.The work
Synthesis of recurrent neural networks for dynamical system simulation.
Trischler, Adam P; D'Eleuterio, Gabriele M T
2016-08-01
We review several of the most widely used techniques for training recurrent neural networks to approximate dynamical systems, then describe a novel algorithm for this task. The algorithm is based on an earlier theoretical result that guarantees the quality of the network approximation. We show that a feedforward neural network can be trained on the vector-field representation of a given dynamical system using backpropagation, then recast it as a recurrent network that replicates the original system's dynamics. After detailing this algorithm and its relation to earlier approaches, we present numerical examples that demonstrate its capabilities. One of the distinguishing features of our approach is that both the original dynamical systems and the recurrent networks that simulate them operate in continuous time. Copyright © 2016 Elsevier Ltd. All rights reserved.
Social Network Mixing Patterns In Mergers & Acquisitions - A Simulation Experiment
Directory of Open Access Journals (Sweden)
Robert Fabac
2011-01-01
Full Text Available In the contemporary world of global business and continuously growing competition, organizations tend to use mergers and acquisitions to enforce their position on the market. The future organization’s design is a critical success factor in such undertakings. The field of social network analysis can enhance our uderstanding of these processes as it lets us reason about the development of networks, regardless of their origin. The analysis of mixing patterns is particularly useful as it provides an insight into how nodes in a network connect with each other. We hypothesize that organizational networks with compatible mixing patterns will be integrated more successfully. After conducting a simulation experiment, we suggest an integration model based on the analysis of network assortativity. The model can be a guideline for organizational integration, such as occurs in mergers and acquisitions.
Method for Constructing Standardized Simulated Root Canals.
Schulz-Bongert, Udo; Weine, Franklin S.
1990-01-01
The construction of visual and manipulative aids, clear resin blocks with root-canal-like spaces, for simulation of root canals is explained. Time, materials, and techniques are discussed. The method allows for comparison of canals, creation of any configuration of canals, and easy presentation during instruction. (MSE)
Metropolis Methods for Quantum Monte Carlo Simulations
Ceperley, D.M.
2003-01-01
Since its first description fifty years ago, the Metropolis Monte Carlo method has been used in a variety of different ways for the simulation of continuum quantum many-body systems. This paper will consider some of the generalizations of the Metropolis algorithm employed in quantum Monte Carlo: Variational Monte Carlo, dynamical methods for projector monte carlo ({\\it i.e.} diffusion Monte Carlo with rejection), multilevel sampling in path integral Monte Carlo, the sampling of permutations, ...
Aggregated Representation of Distribution Networks for Large-Scale Transmission Network Simulations
DEFF Research Database (Denmark)
Göksu, Ömer; Altin, Müfit; Sørensen, Poul Ejnar
2014-01-01
As a common practice of large-scale transmission network analysis the distribution networks have been represented as aggregated loads. However, with increasing share of distributed generation, especially wind and solar power, in the distribution networks, it became necessary to include the distri......As a common practice of large-scale transmission network analysis the distribution networks have been represented as aggregated loads. However, with increasing share of distributed generation, especially wind and solar power, in the distribution networks, it became necessary to include...... the distributed generation within those analysis. In this paper a practical methodology to obtain aggregated behaviour of the distributed generation is proposed. The methodology, which is based on the use of the IEC standard wind turbine models, is applied on a benchmark distribution network via simulations....
Artificial Neural Network Metamodels of Stochastic Computer Simulations
1994-08-10
23 Haddock, J. and O’Keefe, R., "Using Artificial Intelligence to Facilitate Manufacturing Systems Simulation," Computers & Industrial Engineering , Vol...Feedforward Neural Networks," Computers & Industrial Engineering , Vol. 21, No. 1- 4, (1991), pp. 247-251. 87 Proceedings of the 1992 Summer Computer...Using Simulation Experiments," Computers & Industrial Engineering , Vol. 22, No. 2 (1992), pp. 195-209. 119 Kuei, C. and Madu, C., "Polynomial
An Efficient Simulation Method for Rare Events
Rached, Nadhir B.
2015-01-07
Estimating the probability that a sum of random variables (RVs) exceeds a given threshold is a well-known challenging problem. Closed-form expressions for the sum distribution do not generally exist, which has led to an increasing interest in simulation approaches. A crude Monte Carlo (MC) simulation is the standard technique for the estimation of this type of probability. However, this approach is computationally expensive, especially when dealing with rare events. Variance reduction techniques are alternative approaches that can improve the computational efficiency of naive MC simulations. We propose an Importance Sampling (IS) simulation technique based on the well-known hazard rate twisting approach, that presents the advantage of being asymptotically optimal for any arbitrary RVs. The wide scope of applicability of the proposed method is mainly due to our particular way of selecting the twisting parameter. It is worth observing that this interesting feature is rarely satisfied by variance reduction algorithms whose performances were only proven under some restrictive assumptions. It comes along with a good efficiency, illustrated by some selected simulation results comparing the performance of our method with that of an algorithm based on a conditional MC technique.
Modeling a secular trend by Monte Carlo simulation of height biased migration in a spatial network.
Groth, Detlef
2017-04-01
Background: In a recent Monte Carlo simulation, the clustering of body height of Swiss military conscripts within a spatial network with characteristic features of the natural Swiss geography was investigated. In this study I examined the effect of migration of tall individuals into network hubs on the dynamics of body height within the whole spatial network. The aim of this study was to simulate height trends. Material and methods: Three networks were used for modeling, a regular rectangular fishing net like network, a real world example based on the geographic map of Switzerland, and a random network. All networks contained between 144 and 148 districts and between 265-307 road connections. Around 100,000 agents were initially released with average height of 170 cm, and height standard deviation of 6.5 cm. The simulation was started with the a priori assumption that height variation within a district is limited and also depends on height of neighboring districts (community effect on height). In addition to a neighborhood influence factor, which simulates a community effect, body height dependent migration of conscripts between adjacent districts in each Monte Carlo simulation was used to re-calculate next generation body heights. In order to determine the direction of migration for taller individuals, various centrality measures for the evaluation of district importance within the spatial network were applied. Taller individuals were favored to migrate more into network hubs, backward migration using the same number of individuals was random, not biased towards body height. Network hubs were defined by the importance of a district within the spatial network. The importance of a district was evaluated by various centrality measures. In the null model there were no road connections, height information could not be delivered between the districts. Results: Due to the favored migration of tall individuals into network hubs, average body height of the hubs, and later
Tumor Diagnosis Using Backpropagation Neural Network Method
Ma, Lixing; Looney, Carl; Sukuta, Sydney; Bruch, Reinhard; Afanasyeva, Natalia
1998-05-01
For characterization of skin cancer, an artificial neural network (ANN) method has been developed to diagnose normal tissue, benign tumor and melanoma. The pattern recognition is based on a three-layer neural network fuzzy learning system. In this study, the input neuron data set is the Fourier Transform infrared (FT-IR)spectrum obtained by a new Fiberoptic Evanescent Wave Fourier Transform Infrared (FEW-FTIR) spectroscopy method in the range of 1480 to 1850 cm-1. Ten input features are extracted from the absorbency values in this region. A single hidden layer of neural nodes with sigmoids activation functions clusters the feature space into small subclasses and the output nodes are separated in different nonconvex classes to permit nonlinear discrimination of disease states. The output is classified as three classes: normal tissue, benign tumor and melanoma. The results obtained from the neural network pattern recognition are shown to be consistent with traditional medical diagnosis. Input features have also been extracted from the absorbency spectra using chemical factor analysis. These abstract features or factors are also used in the classification.
Transmission network expansion planning with simulation optimization
Energy Technology Data Exchange (ETDEWEB)
Bent, Russell W [Los Alamos National Laboratory; Berscheid, Alan [Los Alamos National Laboratory; Toole, G. Loren [Los Alamos National Laboratory
2010-01-01
Within the electric power literatW''e the transmi ssion expansion planning problem (TNEP) refers to the problem of how to upgrade an electric power network to meet future demands. As this problem is a complex, non-linear, and non-convex optimization problem, researchers have traditionally focused on approximate models. Often, their approaches are tightly coupled to the approximation choice. Until recently, these approximations have produced results that are straight-forward to adapt to the more complex (real) problem. However, the power grid is evolving towards a state where the adaptations are no longer easy (i.e. large amounts of limited control, renewable generation) that necessitates new optimization techniques. In this paper, we propose a generalization of the powerful Limited Discrepancy Search (LDS) that encapsulates the complexity in a black box that may be queJied for information about the quality of a proposed expansion. This allows the development of a new optimization algOlitlun that is independent of the underlying power model.
Improving a Computer Networks Course Using the Partov Simulation Engine
Momeni, B.; Kharrazi, M.
2012-01-01
Computer networks courses are hard to teach as there are many details in the protocols and techniques involved that are difficult to grasp. Employing programming assignments as part of the course helps students to obtain a better understanding and gain further insight into the theoretical lectures. In this paper, the Partov simulation engine and…
A Neural Network Model for Dynamics Simulation | Bholoa ...
African Journals Online (AJOL)
University of Mauritius Research Journal. Journal Home · ABOUT · Advanced Search · Current Issue · Archives · Journal Home > Vol 15, No 1 (2009) >. Log in or Register to get access to full text downloads. Username, Password, Remember me, or Register. A Neural Network Model for Dynamics Simulation. Ajeevsing ...
Fracture Network Modeling and GoldSim Simulation Support
杉田 健一郎; Dershowiz, W.
2003-01-01
During Heisei-14, Golder Associates provided support for JNC Tokai through data analysis and simulation of the MIU Underground Rock Laboratory, participation in Task 6 of the Aspo Task Force on Modelling of Groundwater Flow and Transport, and analysis of repository safety assessment technologies including cell networks for evaluation of the disturbed rock zone (DRZ) and total systems performance assessment (TSPA).
Quantitative methods for ecological network analysis.
Ulanowicz, Robert E
2004-12-01
The analysis of networks of ecological trophic transfers is a useful complement to simulation modeling in the quest for understanding whole-ecosystem dynamics. Trophic networks can be studied in quantitative and systematic fashion at several levels. Indirect relationships between any two individual taxa in an ecosystem, which often differ in either nature or magnitude from their direct influences, can be assayed using techniques from linear algebra. The same mathematics can also be employed to ascertain where along the trophic continuum any individual taxon is operating, or to map the web of connections into a virtual linear chain that summarizes trophodynamic performance by the system. Backtracking algorithms with pruning have been written which identify pathways for the recycle of materials and energy within the system. The pattern of such cycling often reveals modes of control or types of functions exhibited by various groups of taxa. The performance of the system as a whole at processing material and energy can be quantified using information theory. In particular, the complexity of process interactions can be parsed into separate terms that distinguish organized, efficient performance from the capacity for further development and recovery from disturbance. Finally, the sensitivities of the information-theoretic system indices appear to identify the dynamical bottlenecks in ecosystem functioning.
Distributed Sensor Network Software Development Testing through Simulation
Energy Technology Data Exchange (ETDEWEB)
Brennan, Sean M. [Univ. of New Mexico, Albuquerque, NM (United States)
2003-12-01
The distributed sensor network (DSN) presents a novel and highly complex computing platform with dif culties and opportunities that are just beginning to be explored. The potential of sensor networks extends from monitoring for threat reduction, to conducting instant and remote inventories, to ecological surveys. Developing and testing for robust and scalable applications is currently practiced almost exclusively in hardware. The Distributed Sensors Simulator (DSS) is an infrastructure that allows the user to debug and test software for DSNs independent of hardware constraints. The exibility of DSS allows developers and researchers to investigate topological, phenomenological, networking, robustness and scaling issues, to explore arbitrary algorithms for distributed sensors, and to defeat those algorithms through simulated failure. The user speci es the topology, the environment, the application, and any number of arbitrary failures; DSS provides the virtual environmental embedding.
Hybrid Multilevel Monte Carlo Simulation of Stochastic Reaction Networks
Moraes, Alvaro
2015-01-07
Stochastic reaction networks (SRNs) is a class of continuous-time Markov chains intended to describe, from the kinetic point of view, the time-evolution of chemical systems in which molecules of different chemical species undergo a finite set of reaction channels. This talk is based on articles [4, 5, 6], where we are interested in the following problem: given a SRN, X, defined though its set of reaction channels, and its initial state, x0, estimate E (g(X(T))); that is, the expected value of a scalar observable, g, of the process, X, at a fixed time, T. This problem lead us to define a series of Monte Carlo estimators, M, such that, with high probability can produce values close to the quantity of interest, E (g(X(T))). More specifically, given a user-selected tolerance, TOL, and a small confidence level, η, find an estimator, M, based on approximate sampled paths of X, such that, P (|E (g(X(T))) − M| ≤ TOL) ≥ 1 − η; even more, we want to achieve this objective with near optimal computational work. We first introduce a hybrid path-simulation scheme based on the well-known stochastic simulation algorithm (SSA)[3] and the tau-leap method [2]. Then, we introduce a Multilevel Monte Carlo strategy that allows us to achieve a computational complexity of order O(T OL−2), this is the same computational complexity as in an exact method but with a smaller constant. We provide numerical examples to show our results.
Cellular neural network modelling of soft tissue dynamics for surgical simulation.
Zhang, Jinao; Zhong, Yongmin; Smith, Julian; Gu, Chengfan
2017-07-20
Currently, the mechanical dynamics of soft tissue deformation is achieved by numerical time integrations such as the explicit or implicit integration; however, the explicit integration is stable only under a small time step, whereas the implicit integration is computationally expensive in spite of the accommodation of a large time step. This paper presents a cellular neural network method for stable simulation of soft tissue deformation dynamics. The non-rigid motion equation is formulated as a cellular neural network with local connectivity of cells, and thus the dynamics of soft tissue deformation is transformed into the neural dynamics of the cellular neural network. Results show that the proposed method can achieve good accuracy at a small time step. It still remains stable at a large time step, while maintaining the computational efficiency of the explicit integration. The proposed method can achieve stable soft tissue deformation with efficiency of explicit integration for surgical simulation.
Methods and procedures for the verification and validation of artificial neural networks
Taylor, Brian J
2006-01-01
Neural networks are members of a class of software that have the potential to enable intelligent computational systems capable of simulating characteristics of biological thinking and learning. This volume introduces some of the methods and techniques used for the verification and validation of neural networks and adaptive systems.
Some issues related to simulation of the tracking and communications computer network
Lacovara, Robert C.
1989-01-01
The Communications Performance and Integration branch of the Tracking and Communications Division has an ongoing involvement in the simulation of its flight hardware for Space Station Freedom. Specifically, the communication process between central processor(s) and orbital replaceable units (ORU's) is simulated with varying degrees of fidelity. The results of investigations into three aspects of this simulation effort are given. The most general area involves the use of computer assisted software engineering (CASE) tools for this particular simulation. The second area of interest is simulation methods for systems of mixed hardware and software. The final area investigated is the application of simulation methods to one of the proposed computer network protocols for space station, specifically IEEE 802.4.
Multinomial tau-leaping method for stochastic kinetic simulations
Pettigrew, Michel F.; Resat, Haluk
2007-02-01
We introduce the multinomial tau-leaping (MτL) method for general reaction networks with multichannel reactant dependencies. The MτL method is an extension of the binomial tau-leaping method where efficiency is improved in several ways. First, τ-leaping steps are determined simply and efficiently using a priori information and Poisson distribution-based estimates of expectation values for reaction numbers over a tentative τ-leaping step. Second, networks are partitioned into closed groups of reactions and corresponding reactants in which no group reactant set is found in any other group. Third, product formation is factored into upper-bound estimation of the number of times a particular reaction occurs. Together, these features allow larger time steps where the numbers of reactions occurring simultaneously in a multichannel manner are estimated accurately using a multinomial distribution. Furthermore, we develop a simple procedure that places a specific upper bound on the total reaction number to ensure non-negativity of species populations over a single multiple-reaction step. Using two disparate test case problems involving cellular processes—epidermal growth factor receptor signaling and a lactose operon model—we show that the τ-leaping based methods such as the MτL algorithm can significantly reduce the number of simulation steps thus increasing the numerical efficiency over the exact stochastic simulation algorithm by orders of magnitude.
Simulation of Attacks for Security in Wireless Sensor Network.
Diaz, Alvaro; Sanchez, Pablo
2016-11-18
The increasing complexity and low-power constraints of current Wireless Sensor Networks (WSN) require efficient methodologies for network simulation and embedded software performance analysis of nodes. In addition, security is also a very important feature that has to be addressed in most WSNs, since they may work with sensitive data and operate in hostile unattended environments. In this paper, a methodology for security analysis of Wireless Sensor Networks is presented. The methodology allows designing attack-aware embedded software/firmware or attack countermeasures to provide security in WSNs. The proposed methodology includes attacker modeling and attack simulation with performance analysis (node's software execution time and power consumption estimation). After an analysis of different WSN attack types, an attacker model is proposed. This model defines three different types of attackers that can emulate most WSN attacks. In addition, this paper presents a virtual platform that is able to model the node hardware, embedded software and basic wireless channel features. This virtual simulation analyzes the embedded software behavior and node power consumption while it takes into account the network deployment and topology. Additionally, this simulator integrates the previously mentioned attacker model. Thus, the impact of attacks on power consumption and software behavior/execution-time can be analyzed. This provides developers with essential information about the effects that one or multiple attacks could have on the network, helping them to develop more secure WSN systems. This WSN attack simulator is an essential element of the attack-aware embedded software development methodology that is also introduced in this work.
Directory of Open Access Journals (Sweden)
Andrey Shorov
2014-01-01
Full Text Available The paper outlines a bioinspired approach named “network nervous system" and methods of simulation of infrastructure attacks and protection mechanisms based on this approach. The protection mechanisms based on this approach consist of distributed prosedures of information collection and processing, which coordinate the activities of the main devices of a computer network, identify attacks, and determine nessesary countermeasures. Attacks and protection mechanisms are specified as structural models using a set-theoretic approach. An environment for simulation of protection mechanisms based on the biological metaphor is considered; the experiments demonstrating the effectiveness of the protection mechanisms are described.
A case for spiking neural network simulation based on configurable multiple-FPGA systems.
Yang, Shufan; Wu, Qiang; Li, Renfa
2011-09-01
Recent neuropsychological research has begun to reveal that neurons encode information in the timing of spikes. Spiking neural network simulations are a flexible and powerful method for investigating the behaviour of neuronal systems. Simulation of the spiking neural networks in software is unable to rapidly generate output spikes in large-scale of neural network. An alternative approach, hardware implementation of such system, provides the possibility to generate independent spikes precisely and simultaneously output spike waves in real time, under the premise that spiking neural network can take full advantage of hardware inherent parallelism. We introduce a configurable FPGA-oriented hardware platform for spiking neural network simulation in this work. We aim to use this platform to combine the speed of dedicated hardware with the programmability of software so that it might allow neuroscientists to put together sophisticated computation experiments of their own model. A feed-forward hierarchy network is developed as a case study to describe the operation of biological neural systems (such as orientation selectivity of visual cortex) and computational models of such systems. This model demonstrates how a feed-forward neural network constructs the circuitry required for orientation selectivity and provides platform for reaching a deeper understanding of the primate visual system. In the future, larger scale models based on this framework can be used to replicate the actual architecture in visual cortex, leading to more detailed predictions and insights into visual perception phenomenon.
Simulation of Two High Pressure Distribution Network Operation in one-Network Connection
Directory of Open Access Journals (Sweden)
Perju Sorin
2014-09-01
Full Text Available The programs developed by the water supply system operators in view of metering the branches and reducing the potable water losses from the distribution network pipes lead to the performance reassessment of these networks. As a result the energetic consumption of the pumping stations should meet the accepted limits. An essential role in the evaluation of the operation parameters of the network performance is played by hydraulic modeling, by means of which the network performance simulation can be done in different scenarios. The present article describes the concept of two high-pressure network coupling. These networks are supplied by two repumping stations, in which the water flows were drastically reduced due to the present situation
Brian: a simulator for spiking neural networks in Python
Directory of Open Access Journals (Sweden)
Dan F M Goodman
2008-11-01
Full Text Available Brian is a new simulator for spiking neural networks, written in Python (http://brian.di.ens.fr. It is an intuitive and highly flexible tool for rapidly developing new models, especially networks of single-compartment neurons. In addition to using standard types of neuron models, users can define models by writing arbitrary differential equations in ordinary mathematical notation. Python scientific libraries can also be used for defining models and analysing data. Vectorisation techniques allow efficient simulations despite the overheads of an interpreted language. Brian will be especially valuable for working on non-standard neuron models not easily covered by existing software, and as an alternative to using Matlab or C for simulations. With its easy and intuitive syntax, Brian is also very well suited for teaching computational neuroscience.
Neural networks simulation of a discrete model of continious effects of irrelevant stimuli
Molenaar, P.C.M.
1990-01-01
Presents a general simulation method based on minimal neural network representations of nonmathematical, structural models of information processes. The time-dependent behavior of each component in a given structural model is represented by a simple, noncommittal equation that does not affect the
DEFF Research Database (Denmark)
Riaz, M. Tahir; Gutierrez Lopez, Jose Manuel; Pedersen, Jens Myrup
2011-01-01
of the networks. There have been many use of evolutionary algorithms to solve the problems which are in combinatory complexity nature, and extremely hard to solve by exact approaches. Both Genetic and Simulated annealing algorithms are similar in using controlled stochastic method to search the solution...
A Robust Method for Inferring Network Structures.
Yang, Yang; Luo, Tingjin; Li, Zhoujun; Zhang, Xiaoming; Yu, Philip S
2017-07-12
Inferring the network structure from limited observable data is significant in molecular biology, communication and many other areas. It is challenging, primarily because the observable data are sparse, finite and noisy. The development of machine learning and network structure study provides a great chance to solve the problem. In this paper, we propose an iterative smoothing algorithm with structure sparsity (ISSS) method. The elastic penalty in the model is introduced for the sparse solution, identifying group features and avoiding over-fitting, and the total variation (TV) penalty in the model can effectively utilize the structure information to identify the neighborhood of the vertices. Due to the non-smoothness of the elastic and structural TV penalties, an efficient algorithm with the Nesterov's smoothing optimization technique is proposed to solve the non-smooth problem. The experimental results on both synthetic and real-world networks show that the proposed model is robust against insufficient data and high noise. In addition, we investigate many factors that play important roles in identifying the performance of ISSS.
A multi-scale network method for two-phase flow in porous media
Energy Technology Data Exchange (ETDEWEB)
Khayrat, Karim, E-mail: khayratk@ifd.mavt.ethz.ch; Jenny, Patrick
2017-08-01
Pore-network models of porous media are useful in the study of pore-scale flow in porous media. In order to extract macroscopic properties from flow simulations in pore-networks, it is crucial the networks are large enough to be considered representative elementary volumes. However, existing two-phase network flow solvers are limited to relatively small domains. For this purpose, a multi-scale pore-network (MSPN) method, which takes into account flow-rate effects and can simulate larger domains compared to existing methods, was developed. In our solution algorithm, a large pore network is partitioned into several smaller sub-networks. The algorithm to advance the fluid interfaces within each subnetwork consists of three steps. First, a global pressure problem on the network is solved approximately using the multiscale finite volume (MSFV) method. Next, the fluxes across the subnetworks are computed. Lastly, using fluxes as boundary conditions, a dynamic two-phase flow solver is used to advance the solution in time. Simulation results of drainage scenarios at different capillary numbers and unfavourable viscosity ratios are presented and used to validate the MSPN method against solutions obtained by an existing dynamic network flow solver.
Simulation and the Monte Carlo method
Rubinstein, Reuven Y
2016-01-01
Simulation and the Monte Carlo Method, Third Edition reflects the latest developments in the field and presents a fully updated and comprehensive account of the major topics that have emerged in Monte Carlo simulation since the publication of the classic First Edition over more than a quarter of a century ago. While maintaining its accessible and intuitive approach, this revised edition features a wealth of up-to-date information that facilitates a deeper understanding of problem solving across a wide array of subject areas, such as engineering, statistics, computer science, mathematics, and the physical and life sciences. The book begins with a modernized introduction that addresses the basic concepts of probability, Markov processes, and convex optimization. Subsequent chapters discuss the dramatic changes that have occurred in the field of the Monte Carlo method, with coverage of many modern topics including: Markov Chain Monte Carlo, variance reduction techniques such as the transform likelihood ratio...
Socialising Health Burden Through Different Network Topologies: A Simulation Study.
Peacock, Adrian; Cheung, Anthony; Kim, Peter; Poon, Simon K
2017-01-01
An aging population and the expectation of premium quality health services combined with the increasing economic burden of the healthcare system requires a paradigm shift toward patient oriented healthcare. The guardian angel theory described by Szolovits [1] explores the notion of enlisting patients as primary providers of information and motivation to patients with similar clinical history through social connections. In this study, an agent based model was developed to simulate to explore how individuals are affected through their levels of intrinsic positivity. Ring, point-to-point (paired buddy), and random networks were modelled, with individuals able to send messages to each other given their levels of variables positivity and motivation. Of the 3 modelled networks it is apparent that the ring network provides the most equal, collective improvement in positivity and motivation for all users. Further study into other network topologies should be undertaken in the future.
Molecular Simulations of Actomyosin Network Self-Assembly and Remodeling
Komianos, James; Popov, Konstantin; Papoian, Garegin; Papoian Lab Team
Actomyosin networks are an integral part of the cytoskeleton of eukaryotic cells and play an essential role in determining cellular shape and movement. Actomyosin network growth and remodeling in vivo is based on a large number of chemical and mechanical processes, which are mutually coupled and spatially and temporally resolved. To investigate the fundamental principles behind the self-organization of these networks, we have developed a detailed mechanochemical, stochastic model of actin filament growth dynamics, at a single-molecule resolution, where the nonlinear mechanical rigidity of filaments and their corresponding deformations under internally and externally generated forces are taken into account. Our work sheds light on the interplay between the chemical and mechanical processes governing the cytoskeletal dynamics, and also highlights the importance of diffusional and active transport phenomena. Our simulations reveal how different actomyosin micro-architectures emerge in response to varying the network composition. Support from NSF Grant CHE-1363081.
Twitter's tweet method modelling and simulation
Sarlis, Apostolos S.; Sakas, Damianos P.; Vlachos, D. S.
2015-02-01
This paper seeks to purpose the concept of Twitter marketing methods. The tools that Twitter provides are modelled and simulated using iThink in the context of a Twitter media-marketing agency. The paper has leveraged the system's dynamic paradigm to conduct Facebook marketing tools and methods modelling, using iThink™ system to implement them. It uses the design science research methodology for the proof of concept of the models and modelling processes. The following models have been developed for a twitter marketing agent/company and tested in real circumstances and with real numbers. These models were finalized through a number of revisions and iterators of the design, develop, simulate, test and evaluate. It also addresses these methods that suit most organized promotion through targeting, to the Twitter social media service. The validity and usefulness of these Twitter marketing methods models for the day-to-day decision making are authenticated by the management of the company organization. It implements system dynamics concepts of Twitter marketing methods modelling and produce models of various Twitter marketing situations. The Tweet method that Twitter provides can be adjusted, depending on the situation, in order to maximize the profit of the company/agent.
Multigrid methods with applications to reservoir simulation
Energy Technology Data Exchange (ETDEWEB)
Xiao, Shengyou [Univ. of Texas, Austin, TX (United States)
1994-05-01
Multigrid methods are studied for solving elliptic partial differential equations. Focus is on parallel multigrid methods and their use for reservoir simulation. Multicolor Fourier analysis is used to analyze the behavior of standard multigrid methods for problems in one and two dimensions. Relation between multicolor and standard Fourier analysis is established. Multiple coarse grid methods for solving model problems in 1 and 2 dimensions are considered; at each coarse grid level we use more than one coarse grid to improve convergence. For a given Dirichlet problem, a related extended problem is first constructed; a purification procedure can be used to obtain Moore-Penrose solutions of the singular systems encountered. For solving anisotropic equations, semicoarsening and line smoothing techniques are used with multiple coarse grid methods to improve convergence. Two-level convergence factors are estimated using multicolor. In the case where each operator has the same stencil on each grid point on one level, exact multilevel convergence factors can be obtained. For solving partial differential equations with discontinuous coefficients, interpolation and restriction operators should include information about the equation coefficients. Matrix-dependent interpolation and restriction operators based on the Schur complement can be used in nonsymmetric cases. A semicoarsening multigrid solver with these operators is used in UTCOMP, a 3-D, multiphase, multicomponent, compositional reservoir simulator. The numerical experiments are carried out on different computing systems. Results indicate that the multigrid methods are promising.
A SIMULATION ON TEACHING VOLHARD METHOD
BAYRAK, CELAL; Nilgün SECKEN; Funda OZCAN OZTURK; Evrim URAL ALSAN
2009-01-01
Laboratories are important components of chemistry education. Virtual simulations allow students to repeat the experiments as many times as they want and give students the opportunity to learn in their own ways. In this study, a computer assisted teaching material has been developed for tertiary level. This material has been planned to use in Analytical Chemistry Course content in the subject of quantitative methods. This teaching material has been developed by using Flash program and consist...
SIMULATION OF WIRELESS SENSOR NETWORK WITH HYBRID TOPOLOGY
Directory of Open Access Journals (Sweden)
J. Jaslin Deva Gifty
2016-03-01
Full Text Available The design of low rate Wireless Personal Area Network (WPAN by IEEE 802.15.4 standard has been developed to support lower data rates and low power consuming application. Zigbee Wireless Sensor Network (WSN works on the network and application layer in IEEE 802.15.4. Zigbee network can be configured in star, tree or mesh topology. The performance varies from topology to topology. The performance parameters such as network lifetime, energy consumption, throughput, delay in data delivery and sensor field coverage area varies depending on the network topology. In this paper, designing of hybrid topology by using two possible combinations such as star-tree and star-mesh is simulated to verify the communication reliability. This approach is to combine all the benefits of two network model. The parameters such as jitter, delay and throughput are measured for these scenarios. Further, MAC parameters impact such as beacon order (BO and super frame order (SO for low power consumption and high channel utilization, has been analysed for star, tree and mesh topology in beacon disable mode and beacon enable mode by varying CBR traffic loads.
Hybrid neural network bushing model for vehicle dynamics simulation
Energy Technology Data Exchange (ETDEWEB)
Sohn, Jeong Hyun [Pukyong National University, Busan (Korea, Republic of); Lee, Seung Kyu [Hyosung Corporation, Changwon (Korea, Republic of); Yoo, Wan Suk [Pusan National University, Busan (Korea, Republic of)
2008-12-15
Although the linear model was widely used for the bushing model in vehicle suspension systems, it could not express the nonlinear characteristics of bushing in terms of the amplitude and the frequency. An artificial neural network model was suggested to consider the hysteretic responses of bushings. This model, however, often diverges due to the uncertainties of the neural network under the unexpected excitation inputs. In this paper, a hybrid neural network bushing model combining linear and neural network is suggested. A linear model was employed to represent linear stiffness and damping effects, and the artificial neural network algorithm was adopted to take into account the hysteretic responses. A rubber test was performed to capture bushing characteristics, where sine excitation with different frequencies and amplitudes is applied. Random test results were used to update the weighting factors of the neural network model. It is proven that the proposed model has more robust characteristics than a simple neural network model under step excitation input. A full car simulation was carried out to verify the proposed bushing models. It was shown that the hybrid model results are almost identical to the linear model under several maneuvers
Electromagnetic simulation using the FDTD method
Sullivan, Dennis M
2013-01-01
A straightforward, easy-to-read introduction to the finite-difference time-domain (FDTD) method Finite-difference time-domain (FDTD) is one of the primary computational electrodynamics modeling techniques available. Since it is a time-domain method, FDTD solutions can cover a wide frequency range with a single simulation run and treat nonlinear material properties in a natural way. Written in a tutorial fashion, starting with the simplest programs and guiding the reader up from one-dimensional to the more complex, three-dimensional programs, this book provides a simple, yet comp
Spectral Methods in Numerical Plasma Simulation
DEFF Research Database (Denmark)
Coutsias, E.A.; Hansen, F.R.; Huld, T.
1989-01-01
An introduction is given to the use of spectral methods in numerical plasma simulation. As examples of the use of spectral methods, solutions to the two-dimensional Euler equations in both a simple, doubly periodic region, and on an annulus will be shown. In the first case, the solution is expanded...... in a two-dimensional Fourier series, while a Chebyshev-Fourier expansion is employed in the second case. A new, efficient algorithm for the solution of Poisson's equation on an annulus is introduced. Problems connected to aliasing and to short wavelength noise generated by gradient steepening are discussed....
Modeling and simulation of the USAVRE network and radiology operations
Martinez, Ralph; Bradford, Daniel Q.; Hatch, Jay; Sochan, John; Chimiak, William J.
1998-07-01
The U.S. Army Medical Command, lead by the Brooke Army Medical Center, has embarked on a visionary project. The U.S. Army Virtual Radiology Environment (USAVRE) is a CONUS-based network that connects all the Army's major medical centers and Regional Medical Commands (RMC). The purpose of the USAVRE is to improve the quality, access, and cost of radiology services in the Army via the use of state-of-the-art medical imaging, computer, and networking technologies. The USAVRE contains multimedia viewing workstations; database archive systems are based on a distributed computing environment using Common Object Request Broker Architecture (CORBA) middleware protocols. The underlying telecommunications network is an ATM-based backbone network that connects the RMC regional networks and PACS networks at medical centers and RMC clinics. This project is a collaborative effort between Army, university, and industry centers with expertise in teleradiology and Global PACS applications. This paper describes a model and simulation of the USAVRE for performance evaluation purposes. As a first step the results of a Technology Assessment and Requirements Analysis (TARA) -- an analysis of the workload in Army radiology departments, their equipment and their staffing. Using the TARA data and other workload information, we have developed a very detailed analysis of the workload and workflow patterns of our Medical Treatment Facilities. We are embarking on modeling and simulation strategies, which will form the foundation for the VRE network. The workload analysis is performed for each radiology modality in a RMC site. The workload consists of the number of examinations per modality, type of images per exam, number of images per exam, and size of images. The frequency for store and forward cases, second readings, and interactive consultation cases are also determined. These parameters are translated into the model described below. The model for the USAVRE is hierarchical in nature
Noniterative convex optimization methods for network component analysis.
Jacklin, Neil; Ding, Zhi; Chen, Wei; Chang, Chunqi
2012-01-01
This work studies the reconstruction of gene regulatory networks by the means of network component analysis (NCA). We will expound a family of convex optimization-based methods for estimating the transcription factor control strengths and the transcription factor activities (TFAs). The approach taken in this work is to decompose the problem into a network connectivity strength estimation phase and a transcription factor activity estimation phase. In the control strength estimation phase, we formulate a new subspace-based method incorporating a choice of multiple error metrics. For the source estimation phase we propose a total least squares (TLS) formulation that generalizes many existing methods. Both estimation procedures are noniterative and yield the optimal estimates according to various proposed error metrics. We test the performance of the proposed algorithms on simulated data and experimental gene expression data for the yeast Saccharomyces cerevisiae and demonstrate that the proposed algorithms have superior effectiveness in comparison with both Bayesian Decomposition (BD) and our previous FastNCA approach, while the computational complexity is still orders of magnitude less than BD.
Directory of Open Access Journals (Sweden)
Yang Sun
2018-01-01
Full Text Available Using Pareto optimization in Multi-Objective Reinforcement Learning (MORL leads to better learning results for network defense games. This is particularly useful for network security agents, who must often balance several goals when choosing what action to take in defense of a network. If the defender knows his preferred reward distribution, the advantages of Pareto optimization can be retained by using a scalarization algorithm prior to the implementation of the MORL. In this paper, we simulate a network defense scenario by creating a multi-objective zero-sum game and using Pareto optimization and MORL to determine optimal solutions and compare those solutions to different scalarization approaches. We build a Pareto Defense Strategy Selection Simulator (PDSSS system for assisting network administrators on decision-making, specifically, on defense strategy selection, and the experiment results show that the Satisficing Trade-Off Method (STOM scalarization approach performs better than linear scalarization or GUESS method. The results of this paper can aid network security agents attempting to find an optimal defense policy for network security games.
A comparative analysis on computational methods for fitting an ERGM to biological network data
Directory of Open Access Journals (Sweden)
Sudipta Saha
2015-03-01
Full Text Available Exponential random graph models (ERGM based on graph theory are useful in studying global biological network structure using its local properties. However, computational methods for fitting such models are sensitive to the type, structure and the number of the local features of a network under study. In this paper, we compared computational methods for fitting an ERGM with local features of different types and structures. Two commonly used methods, such as the Markov Chain Monte Carlo Maximum Likelihood Estimation and the Maximum Pseudo Likelihood Estimation are considered for estimating the coefficients of network attributes. We compared the estimates of observed network to our random simulated network using both methods under ERGM. The motivation was to ascertain the extent to which an observed network would deviate from a randomly simulated network if the physical numbers of attributes were approximately same. Cut-off points of some common attributes of interest for different order of nodes were determined through simulations. We implemented our method to a known regulatory network database of Escherichia coli (E. coli.
Heuristic urban transportation network design method, a multilayer coevolution approach
Ding, Rui; Ujang, Norsidah; Hamid, Hussain bin; Manan, Mohd Shahrudin Abd; Li, Rong; Wu, Jianjun
2017-08-01
The design of urban transportation networks plays a key role in the urban planning process, and the coevolution of urban networks has recently garnered significant attention in literature. However, most of these recent articles are based on networks that are essentially planar. In this research, we propose a heuristic multilayer urban network coevolution model with lower layer network and upper layer network that are associated with growth and stimulate one another. We first use the relative neighbourhood graph and the Gabriel graph to simulate the structure of rail and road networks, respectively. With simulation we find that when a specific number of nodes are added, the total travel cost ratio between an expanded network and the initial lower layer network has the lowest value. The cooperation strength Λ and the changeable parameter average operation speed ratio Θ show that transit users' route choices change dramatically through the coevolution process and that their decisions, in turn, affect the multilayer network structure. We also note that the simulated relation between the Gini coefficient of the betweenness centrality, Θ and Λ have an optimal point for network design. This research could inspire the analysis of urban network topology features and the assessment of urban growth trends.
Simulation and evaluation of urban rail transit network based on multi-agent approach
Directory of Open Access Journals (Sweden)
Xiangming Yao
2013-03-01
Full Text Available Purpose: Urban rail transit is a complex and dynamic system, which is difficult to be described in a global mathematical model for its scale and interaction. In order to analyze the spatial and temporal characteristics of passenger flow distribution and evaluate the effectiveness of transportation strategies, a new and comprehensive method depicted such dynamic system should be given. This study therefore aims at using simulation approach to solve this problem for subway network. Design/methodology/approach: In this thesis a simulation model based on multi-agent approach has been proposed, which is a well suited method to design complex systems. The model includes the specificities of passengers’ travelling behaviors and takes into account of interactions between travelers and trains. Findings: Research limitations/implications: We developed an urban rail transit simulation tool for verification of the validity and accuracy of this model, using real passenger flow data of Beijing subway network to take a case study, results show that our simulation tool can be used to analyze the characteristic of passenger flow distribution and evaluate operation strategies well. Practical implications: The main implications of this work are to provide decision support for traffic management, making train operation plan and dispatching measures in emergency. Originality/value: A new and comprehensive method to analyze and evaluate subway network is presented, accuracy and computational efficiency of the model has been confirmed and meet with the actual needs for large-scale network.
Complex Network Simulation of Forest Network Spatial Pattern in Pearl River Delta
Zeng, Y.
2017-09-01
Forest network-construction uses for the method and model with the scale-free features of complex network theory based on random graph theory and dynamic network nodes which show a power-law distribution phenomenon. The model is suitable for ecological disturbance by larger ecological landscape Pearl River Delta consistent recovery. Remote sensing and GIS spatial data are available through the latest forest patches. A standard scale-free network node distribution model calculates the area of forest network's power-law distribution parameter value size; The recent existing forest polygons which are defined as nodes can compute the network nodes decaying index value of the network's degree distribution. The parameters of forest network are picked up then make a spatial transition to GIS real world models. Hence the connection is automatically generated by minimizing the ecological corridor by the least cost rule between the near nodes. Based on scale-free network node distribution requirements, select the number compared with less, a huge point of aggregation as a future forest planning network's main node, and put them with the existing node sequence comparison. By this theory, the forest ecological projects in the past avoid being fragmented, scattered disorderly phenomena. The previous regular forest networks can be reduced the required forest planting costs by this method. For ecological restoration of tropical and subtropical in south China areas, it will provide an effective method for the forest entering city project guidance and demonstration with other ecological networks (water, climate network, etc.) for networking a standard and base datum.
Agent-Based Simulation Analysis for Network Formation
神原, 李佳; 林田, 智弘; 西﨑, 一郎; 片桐, 英樹
2009-01-01
In the mathematical models for network formation by Bala and Goyal(2000), it is shown that a star network is the strict Nash equilibrium. However, the result of the experiments in a laboratory using human subjects by Berninghaus et al.(2007) basing on the model of Bala and Goyal indicates that players reach a strict Nash equilibrium and deviate it. In this paper, an agent-based simulation model in which artificial adaptive agents have mechanisms of decision making and learning based on nueral...
A simulation model for aligning smart home networks and deploying smart objects
DEFF Research Database (Denmark)
Lynggaard, Per
Smart homes use sensor based networks to capture activities and offer learned services to the user. These smart home networks are challenging because they mainly use wireless communication at frequencies that are shared with other services and equipments. One of the major challenges...... is the interferences produced by WiFi access points in smart home networks which are expensive to overcome in terms of battery energy. Currently, different method exists to handle this. However, they use complex mechanisms such as sharing frequencies, sharing time slots, and spatial reuse of frequencies. This paper...... introduces a unique concept which saves battery energy and lowers the interference level by simulating the network alignment and assign the necessary amount of transmit power to each individual network node and finally, deploy the smart objects. The needed transmit powers are calculated by the presented...
Simulating marine propellers with vortex particle method
Wang, Youjiang; Abdel-Maksoud, Moustafa; Song, Baowei
2017-01-01
The vortex particle method is applied to compute the open water characteristics of marine propellers. It is based on the large-eddy simulation technique, and the Smagorinsky-Lilly sub-grid scale model is implemented for the eddy viscosity. The vortex particle method is combined with the boundary element method, in the sense that the body is modelled with boundary elements and the slipstream is modelled with vortex particles. Rotational periodic boundaries are adopted, which leads to a cylindrical sector domain for the slipstream. The particle redistribution scheme and the fast multipole method are modified to consider the rotational periodic boundaries. Open water characteristics of three propellers with different skew angles are calculated with the proposed method. The results are compared with the ones obtained with boundary element method and experiments. It is found that the proposed method predicts the open water characteristics more accurately than the boundary element method, especially for high loading condition and high skew propeller. The influence of the Smagorinsky constant is also studied, which shows the results have a low sensitivity to it.
Comparative analysis of quantitative efficiency evaluation methods for transportation networks.
He, Yuxin; Qin, Jin; Hong, Jian
2017-01-01
An effective evaluation of transportation network efficiency could offer guidance for the optimal control of urban traffic. Based on the introduction and related mathematical analysis of three quantitative evaluation methods for transportation network efficiency, this paper compares the information measured by them, including network structure, traffic demand, travel choice behavior and other factors which affect network efficiency. Accordingly, the applicability of various evaluation methods is discussed. Through analyzing different transportation network examples it is obtained that Q-H method could reflect the influence of network structure, traffic demand and user route choice behavior on transportation network efficiency well. In addition, the transportation network efficiency measured by this method and Braess's Paradox can be explained with each other, which indicates a better evaluation of the real operation condition of transportation network. Through the analysis of the network efficiency calculated by Q-H method, it can also be drawn that a specific appropriate demand is existed to a given transportation network. Meanwhile, under the fixed demand, both the critical network structure that guarantees the stability and the basic operation of the network and a specific network structure contributing to the largest value of the transportation network efficiency can be identified.
Code generation: a strategy for neural network simulators.
Goodman, Dan F M
2010-10-01
We demonstrate a technique for the design of neural network simulation software, runtime code generation. This technique can be used to give the user complete flexibility in specifying the mathematical model for their simulation in a high level way, along with the speed of code written in a low level language such as C+ +. It can also be used to write code only once but target different hardware platforms, including inexpensive high performance graphics processing units (GPUs). Code generation can be naturally combined with computer algebra systems to provide further simplification and optimisation of the generated code. The technique is quite general and could be applied to any simulation package. We demonstrate it with the 'Brian' simulator ( http://www.briansimulator.org ).
Heerebout, B.T.; Phaf, R.H.; Taatgen, N.A.; van Rijn, H.
2009-01-01
Evolutionary simulations of foraging agents, controlled by artificial neural networks, unexpectedly yielded oscillating node activations in the networks. The agents had to navigate a virtual environment to collect food while avoiding predation. Between generations their neural networks were
An enhanced simulated annealing routing algorithm for semi-diagonal torus network
Adzhar, Noraziah; Salleh, Shaharuddin
2017-09-01
Multiprocessor is another great technology that helps in advancing human civilization due to high demands for solving complex problems. A multiprocessing system can have a lot of replicated processor-memory pairs (henceforth regard as net) or also called as processing nodes. Each of these nodes is connected to each other through interconnection networks and passes message using a standard message passing mechanism. In this paper, we present a routing algorithm based on enhanced simulated annealing technique to provide the connection between nodes in a semi-diagonal torus (SD-Torus) network. This network is both symmetric and regular; thus, make it very beneficial in the implementation process. The main objective is to maximize the number of established connection between nodes in this SD-Torus network. In order to achieve this objective, each node must be connected in its shortest way as possible. We start our algorithm by designing shortest path algorithm based on Dijkstra’s method. While this algorithm guarantees to find the shortest path for each single net, if it exists, each routed net will form obstacle for later paths. This increases the complexity to route later nets and makes routing longer than optimal, or sometimes impossible to complete. The solution is further refined by re-routing all nets in different orders using simulated annealing method. Through simulation program, our proposed algorithm succeeded in performing complete routing up to 81 nodes with 40 nets in 9×9 SD-Torus network size.
Computer simulation of randomly cross-linked polymer networks
Williams, T P
2002-01-01
In this work, Monte Carlo and Stochastic Dynamics computer simulations of mesoscale model randomly cross-linked networks were undertaken. Task parallel implementations of the lattice Monte Carlo Bond Fluctuation model and Kremer-Grest Stochastic Dynamics bead-spring continuum model were designed and used for this purpose. Lattice and continuum precursor melt systems were prepared and then cross-linked to varying degrees. The resultant networks were used to study structural changes during deformation and relaxation dynamics. The effects of a random network topology featuring a polydisperse distribution of strand lengths and an abundance of pendant chain ends, were qualitatively compared to recent published work. A preliminary investigation into the effects of temperature on the structural and dynamical properties was also undertaken. Structural changes during isotropic swelling and uniaxial deformation, revealed a pronounced non-affine deformation dependant on the degree of cross-linking. Fractal heterogeneiti...
NCC Simulation Model: Simulating the operations of the network control center, phase 2
Benjamin, Norman M.; Paul, Arthur S.; Gill, Tepper L.
1992-12-01
The simulation of the network control center (NCC) is in the second phase of development. This phase seeks to further develop the work performed in phase one. Phase one concentrated on the computer systems and interconnecting network. The focus of phase two will be the implementation of the network message dialogues and the resources controlled by the NCC. These resources are requested, initiated, monitored and analyzed via network messages. In the NCC network messages are presented in the form of packets that are routed across the network. These packets are generated, encoded, decoded and processed by the network host processors that generate and service the message traffic on the network that connects these hosts. As a result, the message traffic is used to characterize the work done by the NCC and the connected network. Phase one of the model development represented the NCC as a network of bi-directional single server queues and message generating sources. The generators represented the external segment processors. The served based queues represented the host processors. The NCC model consists of the internal and external processors which generate message traffic on the network that links these hosts. To fully realize the objective of phase two it is necessary to identify and model the processes in each internal processor. These processes live in the operating system of the internal host computers and handle tasks such as high speed message exchanging, ISN and NFE interface, event monitoring, network monitoring, and message logging. Inter process communication is achieved through the operating system facilities. The overall performance of the host is determined by its ability to service messages generated by both internal and external processors.
The double queue method: a numerical method for integrate-and-fire neuron networks.
Lee, G; Farhat, N H
2001-01-01
Numerical methods for initial-value problems based on finite-differencing of differential equations (FDM) are not well suited for the simulation of an integrate-and-fire neuron network (IFNN) due to the discontinuities implied by the firing condition of the neurons. The Double Queue Method (DQM) is an event-queue based numerical method designed for the simulation of an IFNN that can deal with such discontinuities properly. In the DQM, the states of individual neurons at the next predicted discontinuous points are determined by an analytic solution, meaning an optimal performance in both accuracy and speed. A comparison study with the FDM demonstrates the superiority of the DQM, and provides some examples where the FDM gives inaccurate results that can possibly lead to a false conclusion about the dynamics of an IFNN.
Method and tool for network vulnerability analysis
Swiler, Laura Painton [Albuquerque, NM; Phillips, Cynthia A [Albuquerque, NM
2006-03-14
A computer system analysis tool and method that will allow for qualitative and quantitative assessment of security attributes and vulnerabilities in systems including computer networks. The invention is based on generation of attack graphs wherein each node represents a possible attack state and each edge represents a change in state caused by a single action taken by an attacker or unwitting assistant. Edges are weighted using metrics such as attacker effort, likelihood of attack success, or time to succeed. Generation of an attack graph is accomplished by matching information about attack requirements (specified in "attack templates") to information about computer system configuration (contained in a configuration file that can be updated to reflect system changes occurring during the course of an attack) and assumed attacker capabilities (reflected in "attacker profiles"). High risk attack paths, which correspond to those considered suited to application of attack countermeasures given limited resources for applying countermeasures, are identified by finding "epsilon optimal paths."
Analyzing, Modeling, and Simulation for Human Dynamics in Social Network
Directory of Open Access Journals (Sweden)
Yunpeng Xiao
2012-01-01
Full Text Available This paper studies the human behavior in the top-one social network system in China (Sina Microblog system. By analyzing real-life data at a large scale, we find that the message releasing interval (intermessage time obeys power law distribution both at individual level and at group level. Statistical analysis also reveals that human behavior in social network is mainly driven by four basic elements: social pressure, social identity, social participation, and social relation between individuals. Empirical results present the four elements' impact on the human behavior and the relation between these elements. To further understand the mechanism of such dynamic phenomena, a hybrid human dynamic model which combines “interest” of individual and “interaction” among people is introduced, incorporating the four elements simultaneously. To provide a solid evaluation, we simulate both two-agent and multiagent interactions with real-life social network topology. We achieve the consistent results between empirical studies and the simulations. The model can provide a good understanding of human dynamics in social network.
Modelling Altitude Information in Two-Dimensional Traffic Networks for Electric Mobility Simulation
Diogo Santos; José Pinto; Rossetti, Rosaldo J. F.; Eugénio Oliveira
2016-01-01
Elevation data is important for electric vehicle simulation. However, traffic simulators are often two-dimensional and do not offer the capability of modelling urban networks taking elevation into account. Specifically, SUMO - Simulation of Urban Mobility, a popular microscopic traffic simulator, relies on networks previously modelled with elevation data as to provide this information during simulations. This work tackles the problem of adding elevation data to urban network models - particul...
ezBioNet: A modeling and simulation system for analyzing biological reaction networks
Yu, Seok Jong; Tung, Thai Quang; Park, Junho; Lim, Jongtae; Yoo, Jaesoo
2012-10-01
To achieve robustness against living environments, a living organism is composed of complicated regulatory mechanisms ranging from gene regulations to signal transduction. If such life phenomena are to be understand, an integrated analysis tool that should have modeling and simulation functions for biological reactions, as well as new experimental methods for measuring biological phenomena, is fundamentally required. We have designed and implemented modeling and simulation software (ezBioNet) for analyzing biological reaction networks. The software can simultaneously perform an integrated modeling of various responses occurring in cells, ranging from gene expressions to signaling processes. To support massive analysis of biological networks, we have constructed a server-side simulation system (VCellSim) that can perform ordinary differential equations (ODE) analysis, sensitivity analysis, and parameter estimates. ezBioNet integrates the BioModel database by connecting the european bioinformatics institute (EBI) servers through Web services APIs and supports the handling of systems biology markup language (SBML) files. In addition, we employed eclipse RCP (rich client platform) which is a powerful modularity framework allowing various functional expansions. ezBioNet is intended to be an easy-to-use modeling tool, as well as a simulation system, to understand the control mechanism by monitoring the change of each component in a biological network. A researcher may perform the kinetic modeling and execute the simulation. The simulation result can be managed and visualized on ezBioNet, which is freely available at http://ezbionet.cbnu.ac.kr.
MBVCNN: Joint convolutional neural networks method for image recognition
Tong, Tong; Mu, Xiaodong; Zhang, Li; Yi, Zhaoxiang; Hu, Pei
2017-05-01
Aiming at the problem of objects in image recognition rectangle, but objects which are input into convolutional neural networks square, the object recognition model was put forward which was based on BING method to realize object estimate, used vectorization of convolutional neural networks to realize input square image in convolutional networks, therefore, built joint convolution neural networks, which achieve multiple size image input. Verified by experiments, the accuracy of multi-object image recognition was improved by 6.70% compared with single vectorization of convolutional neural networks. Therefore, image recognition method of joint convolutional neural networks can enhance the accuracy in image recognition, especially for target in rectangular shape.
An improved method for network congestion control
Qiao, Xiaolin
2013-03-01
The rapid progress of the wireless network technology has great convenience on the people's life and work. However, because of its openness, the mobility of the terminal and the changing topology, the wireless network is more susceptible to security attacks. Authentication and key agreement is the base of the network security. The authentication and key agreement mechanism can prevent the unauthorized user from accessing the network, resist malicious network to deceive the lawful user, encrypt the session data by using the exchange key and provide the identification of the data origination. Based on characteristics of the wireless network, this paper proposed a key agreement protocol for wireless network. The authentication of protocol is based on Elliptic Curve Cryptosystems and Diffie-Hellman.
Using analytic network process for evaluating mobile text entry methods.
Ocampo, Lanndon A; Seva, Rosemary R
2016-01-01
This paper highlights a preference evaluation methodology for text entry methods in a touch keyboard smartphone using analytic network process (ANP). Evaluation of text entry methods in literature mainly considers speed and accuracy. This study presents an alternative means for selecting text entry method that considers user preference. A case study was carried out with a group of experts who were asked to develop a selection decision model of five text entry methods. The decision problem is flexible enough to reflect interdependencies of decision elements that are necessary in describing real-life conditions. Results showed that QWERTY method is more preferred than other text entry methods while arrangement of keys is the most preferred criterion in characterizing a sound method. Sensitivity analysis using simulation of normally distributed random numbers under fairly large perturbation reported the foregoing results reliable enough to reflect robust judgment. The main contribution of this paper is the introduction of a multi-criteria decision approach in the preference evaluation of text entry methods. Copyright © 2015 Elsevier Ltd and The Ergonomics Society. All rights reserved.
Directory of Open Access Journals (Sweden)
Omar Payán-Serrano
2017-05-01
Full Text Available The aim of this paper is to investigate the prediction of maximum story drift of Multi-Degree of Freedom (MDOF structures subjected to dynamics wind load using Artificial Neural Networks (ANNs through the combination of several structural and turbulent wind parameters. The maximum story drift of 1600 MDOF structures under 16 simulated wind conditions are computed with the purpose of generating the data set for the networks training with the Levenberg–Marquardt method. The Shinozuka and Newmark methods are used to simulate the turbulent wind and dynamic response, respectively. In order to optimize the computational time required for the dynamic analyses, an array format based on the Shinozuka method is presented to perform the parallel computing. Finally, it is observed that the already trained ANNs allow for predicting adequately the maximum story drift with a correlation close to 99%.
A Biologically Inspired Energy-Efficient Duty Cycle Design Method for Wireless Sensor Networks
Directory of Open Access Journals (Sweden)
Jie Zhou
2017-01-01
Full Text Available The recent success of emerging wireless sensor networks technology has encouraged researchers to develop new energy-efficient duty cycle design algorithm in this field. The energy-efficient duty cycle design problem is a typical NP-hard combinatorial optimization problem. In this paper, we investigate an improved elite immune evolutionary algorithm (IEIEA strategy to optimize energy-efficient duty cycle design scheme and monitored area jointly to enhance the network lifetimes. Simulation results show that the network lifetime of the proposed IEIEA method increased compared to the other two methods, which means that the proposed method improves the full coverage constraints.
COMPLEX NETWORK SIMULATION OF FOREST NETWORK SPATIAL PATTERN IN PEARL RIVER DELTA
Directory of Open Access Journals (Sweden)
Y. Zeng
2017-09-01
Full Text Available Forest network-construction uses for the method and model with the scale-free features of complex network theory based on random graph theory and dynamic network nodes which show a power-law distribution phenomenon. The model is suitable for ecological disturbance by larger ecological landscape Pearl River Delta consistent recovery. Remote sensing and GIS spatial data are available through the latest forest patches. A standard scale-free network node distribution model calculates the area of forest network’s power-law distribution parameter value size; The recent existing forest polygons which are defined as nodes can compute the network nodes decaying index value of the network’s degree distribution. The parameters of forest network are picked up then make a spatial transition to GIS real world models. Hence the connection is automatically generated by minimizing the ecological corridor by the least cost rule between the near nodes. Based on scale-free network node distribution requirements, select the number compared with less, a huge point of aggregation as a future forest planning network’s main node, and put them with the existing node sequence comparison. By this theory, the forest ecological projects in the past avoid being fragmented, scattered disorderly phenomena. The previous regular forest networks can be reduced the required forest planting costs by this method. For ecological restoration of tropical and subtropical in south China areas, it will provide an effective method for the forest entering city project guidance and demonstration with other ecological networks (water, climate network, etc. for networking a standard and base datum.
Neural Networks in R Using the Stuttgart Neural Network Simulator: RSNNS
Directory of Open Access Journals (Sweden)
Christopher Bergmeir
2012-01-01
Full Text Available Neural networks are important standard machine learning procedures for classification and regression. We describe the R package RSNNS that provides a convenient interface to the popular Stuttgart Neural Network Simulator SNNS. The main features are (a encapsulation of the relevant SNNS parts in a C++ class, for sequential and parallel usage of different networks, (b accessibility of all of the SNNSalgorithmic functionality from R using a low-level interface, and (c a high-level interface for convenient, R-style usage of many standard neural network procedures. The package also includes functions for visualization and analysis of the models and the training procedures, as well as functions for data input/output from/to the original SNNSfile formats.
Combining building thermal simulation methods and LCA methods
DEFF Research Database (Denmark)
Pedersen, Frank; Hansen, Klaus; Wittchen, Kim Bjarne
2008-01-01
of buildings (as expressed in EU Directive 2002/91/EC), may in the future be supplemented by requirements to the environmental impact of buildings. This can be seen by the fact that EU recently has given EN mandate to prepare standards for environmental assessment of buildings (CEN/TC 350).......Thsi paper describes recent efforts made by the Danish Building Research Institute regarding the integration of a life cycle assessment (LCA) method into a whole building hygro-thermal simulation tool. The motivation for the work is that the increased requirements to the energy performance...
IP2P K-means: an efficient method for data clustering on sensor networks
Directory of Open Access Journals (Sweden)
Peyman Mirhadi
2013-03-01
Full Text Available Many wireless sensor network applications require data gathering as the most important parts of their operations. There are increasing demands for innovative methods to improve energy efficiency and to prolong the network lifetime. Clustering is considered as an efficient topology control methods in wireless sensor networks, which can increase network scalability and lifetime. This paper presents a method, IP2P K-means – Improved P2P K-means, which uses efficient leveling in clustering approach, reduces false labeling and restricts the necessary communication among various sensors, which obviously saves more energy. The proposed method is examined in Network Simulator Ver.2 (NS2 and the preliminary results show that the algorithm works effectively and relatively more precisely.
Leon, Barbara D.; Heller, Paul R.
1987-05-01
A surveillance network is a group of multiplatform sensors cooperating to improve network performance. Network control is distributed as a measure to decrease vulnerability to enemy threat. The network may contain diverse sensor types such as radar, ESM (Electronic Support Measures), IRST (Infrared search and track) and E-0 (Electro-Optical). Each platform may contain a single sensor or suite of sensors. In a surveillance network it is desirable to control sensors to make the overall system more effective. This problem has come to be known as sensor management and control (SM&C). Two major facets of network performance are surveillance and survivability. In a netted environment, surveillance can be enhanced if information from all sensors is combined and sensor operating conditions are controlled to provide a synergistic effect. In contrast, when survivability is the main concern for the network, the best operating status for all sensors would be passive or off. Of course, improving survivability tends to degrade surveillance. Hence, the objective of SM&C is to optimize surveillance and survivability of the network. Too voluminous data of various formats and the quick response time are two characteristics of this problem which make it an ideal application for Artificial Intelligence. A solution to the SM&C problem, presented as a computer simulation, will be presented in this paper. The simulation is a hybrid production written in LISP and FORTRAN. It combines the latest conventional computer programming methods with Artificial Intelligence techniques to produce a flexible state-of-the-art tool to evaluate network performance. The event-driven simulation contains environment models coupled with an expert system. These environment models include sensor (track-while-scan and agile beam) and target models, local tracking, and system tracking. These models are used to generate the environment for the sensor management and control expert system. The expert system
Lattice Boltzmann simulation of fluid flow in fracture networks with rough, self-affine surfaces.
Madadi, Mahyar; Sahimi, Muhammad
2003-02-01
Using the lattice Boltzmann method, we study fluid flow in a two-dimensional (2D) model of fracture network of rock. Each fracture in a square network is represented by a 2D channel with rough, self-affine internal surfaces. Various parameters of the model, such as the connectivity and the apertures of the fractures, the roughness profile of their surface, as well as the Reynolds number for flow of the fluid, are systematically varied in order to assess their effect on the effective permeability of the fracture network. The distribution of the fractures' apertures is approximated well by a log-normal distribution, which is consistent with experimental data. Due to the roughness of the fractures' surfaces, and the finite size of the networks that can be used in the simulations, the fracture network is anisotropic. The anisotropy increases as the connectivity of the network decreases and approaches the percolation threshold. The effective permeability K of the network follows the power law K approximately (beta), where is the average aperture of the fractures in the network and the exponent beta may depend on the roughness exponent. A crossover from linear to nonlinear flow regime is obtained at a Reynolds number Re approximately O(1), but the precise numerical value of the crossover Re depends on the roughness of the fractures' surfaces.
Simulation-Based Dynamic Passenger Flow Assignment Modelling for a Schedule-Based Transit Network
Directory of Open Access Journals (Sweden)
Xiangming Yao
2017-01-01
Full Text Available The online operation management and the offline policy evaluation in complex transit networks require an effective dynamic traffic assignment (DTA method that can capture the temporal-spatial nature of traffic flows. The objective of this work is to propose a simulation-based dynamic passenger assignment framework and models for such applications in the context of schedule-based rail transit systems. In the simulation framework, travellers are regarded as individual agents who are able to obtain complete information on the current traffic conditions. A combined route selection model integrated with pretrip route selection and entrip route switch is established for achieving the dynamic network flow equilibrium status. The train agent is operated strictly with the timetable and its capacity limitation is considered. A continuous time-driven simulator based on the proposed framework and models is developed, whose performance is illustrated through a large-scale network of Beijing subway. The results indicate that more than 0.8 million individual passengers and thousands of trains can be simulated simultaneously at a speed ten times faster than real time. This study provides an efficient approach to analyze the dynamic demand-supply relationship for large schedule-based transit networks.
Sensor Network Information Analytical Methods: Analysis of Similarities and Differences
Directory of Open Access Journals (Sweden)
Chen Jian
2014-04-01
Full Text Available In the Sensor Network information engineering literature, few references focus on the definition and design of Sensor Network information analytical methods. Among those that do are Munson, et al. and the ISO standards on functional size analysis. To avoid inconsistent vocabulary and potentially incorrect interpretation of data, Sensor Network information analytical methods must be better designed, including definitions, analysis principles, analysis rules, and base units. This paper analyzes the similarities and differences across three different views of analytical methods, and uses a process proposed for the design of Sensor Network information analytical methods to analyze two examples of such methods selected from the literature.
Simulation of unsteady flow and solute transport in a tidal river network
Zhan, X.
2003-01-01
A mathematical model and numerical method for water flow and solute transport in a tidal river network is presented. The tidal river network is defined as a system of open channels of rivers with junctions and cross sections. As an example, the Pearl River in China is represented by a network of 104 channels, 62 nodes, and a total of 330 cross sections with 11 boundary section for one of the applications. The simulations are performed with a supercomputer for seven scenarios of water flow and/or solute transport in the Pearl River, China, with different hydrological and weather conditions. Comparisons with available data are shown. The intention of this study is to summarize previous works and to provide a useful tool for water environmental management in a tidal river network, particularly for the Pearl River, China.
Computer Simulations of Bottlebrush Melts and Soft Networks
Cao, Zhen; Carrillo, Jan-Michael; Sheiko, Sergei; Dobrynin, Andrey
We have studied dense bottlebrush systems in a melt and network state using a combination of the molecular dynamics simulations and analytical calculations. Our simulations show that the bottlebrush macromolecules in a melt behave as ideal chains with the effective Kuhn length bK. The bottlebrush induced bending rigidity is due to redistribution of the side chains upon backbone bending. Kuhn length of the bottlebrushes increases with increasing the side-chain degree of polymerization nsc as bK ~nsc0 . 46 . This model of bottlebrush macromolecules is extended to describe mechanical properties of bottlebrush networks in linear and nonlinear deformation regimes. In the linear deformation regime, the network shear modulus scales with the degree of polymerization of the side chains as G0 ~nsc + 1 - 1 as long as the ratio of the Kuhn length to the size of the fully extended bottlebrush backbone between crosslinks, Rmax, is smaller than unity, bK /Rmax crosslinks. Nsf DMR-1409710 DMR-1436201.
Quantum versus simulated annealing in wireless interference network optimization.
Wang, Chi; Chen, Huo; Jonckheere, Edmond
2016-05-16
Quantum annealing (QA) serves as a specialized optimizer that is able to solve many NP-hard problems and that is believed to have a theoretical advantage over simulated annealing (SA) via quantum tunneling. With the introduction of the D-Wave programmable quantum annealer, a considerable amount of effort has been devoted to detect and quantify quantum speedup. While the debate over speedup remains inconclusive as of now, instead of attempting to show general quantum advantage, here, we focus on a novel real-world application of D-Wave in wireless networking-more specifically, the scheduling of the activation of the air-links for maximum throughput subject to interference avoidance near network nodes. In addition, D-Wave implementation is made error insensitive by a novel Hamiltonian extra penalty weight adjustment that enlarges the gap and substantially reduces the occurrence of interference violations resulting from inevitable spin bias and coupling errors. The major result of this paper is that quantum annealing benefits more than simulated annealing from this gap expansion process, both in terms of ST99 speedup and network queue occupancy. It is the hope that this could become a real-word application niche where potential benefits of quantum annealing could be objectively assessed.
Modeling and Simulation of DC Power Electronics Systems Using Harmonic State Space (HSS) Method
DEFF Research Database (Denmark)
Kwon, Jun Bum; Wang, Xiongfei; Bak, Claus Leth
2015-01-01
based on the state-space averaging and generalized averaging, these also have limitations to show the same results as with the non-linear time domain simulations. This paper presents a modeling and simulation method for a large dc power electronic system by using Harmonic State Space (HSS) modeling....... Through this method, the required computation time and CPU memory for large dc power electronics systems can be reduced. Besides, the achieved results show the same results as with the non-linear time domain simulation, but with the faster simulation time which is beneficial in a large network....
DEFF Research Database (Denmark)
Kwon, Jun Bum; Wang, Xiongfei; Blaabjerg, Frede
2017-01-01
. Through this method, the required computation time and CPU memory can be reduced, where this faster simulation can be an advantage of a large network simulation. Besides, the achieved results show the same results as the non-linear time-domain simulation. Furthermore, the HSS modeling can describe how...... with different switching frequency or harmonics from ac-dc converters makes that harmonics and frequency coupling are both problems of ac system and challenges of dc system. This paper presents a modeling and simulation method for a large dc power electronic system by using Harmonic State Space (HSS) modeling...
Leader neurons in leaky integrate and fire neural network simulations.
Zbinden, Cyrille
2011-10-01
In this paper, we highlight the topological properties of leader neurons whose existence is an experimental fact. Several experimental studies show the existence of leader neurons in population bursts of activity in 2D living neural networks (Eytan and Marom, J Neurosci 26(33):8465-8476, 2006; Eckmann et al., New J Phys 10(015011), 2008). A leader neuron is defined as a neuron which fires at the beginning of a burst (respectively network spike) more often than we expect by chance considering its mean firing rate. This means that leader neurons have some burst triggering power beyond a chance-level statistical effect. In this study, we characterize these leader neuron properties. This naturally leads us to simulate neural 2D networks. To build our simulations, we choose the leaky integrate and fire (lIF) neuron model (Gerstner and Kistler 2002; Cessac, J Math Biol 56(3):311-345, 2008), which allows fast simulations (Izhikevich, IEEE Trans Neural Netw 15(5):1063-1070, 2004; Gerstner and Naud, Science 326:379-380, 2009). The dynamics of our lIF model has got stable leader neurons in the burst population that we simulate. These leader neurons are excitatory neurons and have a low membrane potential firing threshold. Except for these two first properties, the conditions required for a neuron to be a leader neuron are difficult to identify and seem to depend on several parameters involved in the simulations themselves. However, a detailed linear analysis shows a trend of the properties required for a neuron to be a leader neuron. Our main finding is: A leader neuron sends signals to many excitatory neurons as well as to few inhibitory neurons and a leader neuron receives only signals from few other excitatory neurons. Our linear analysis exhibits five essential properties of leader neurons each with different relative importance. This means that considering a given neural network with a fixed mean number of connections per neuron, our analysis gives us a way of
Analysis of sensor network observations during some simulated landslide experiments
Scaioni, M.; Lu, P.; Feng, T.; Chen, W.; Wu, H.; Qiao, G.; Liu, C.; Tong, X.; Li, R.
2012-12-01
A multi-sensor network was tested during some experiments on a landslide simulation platform established at Tongji University (Shanghai, P.R. China). Here landslides were triggered by means of artificial rainfall (see Figure 1). The sensor network currently incorporates contact sensors and two imaging systems. This represent a novel solution, because the spatial sensor network incorporate either contact sensors and remote sensors (video-cameras). In future, these sensors will be installed on two real ground slopes in Sichuan province (South-West China), where Wenchuan earthquake occurred in 2008. This earthquake caused the immediate activation of several landslide, while other area became unstable and still are a menace for people and properties. The platform incorporates the reconstructed scale slope, sensor network, communication system, database and visualization system. Some landslide simulation experiments allowed ascertaining which sensors could be more suitable to be deployed in Wenchuan area. The poster will focus on the analysis of results coming from down scale simulations. Here the different steps of the landslide evolution can be followed on the basis of sensor observations. This include underground sensors to detect the water table level and the pressure in the ground, a set of accelerometers and two inclinometers. In the first part of the analysis the full data series are investigated to look for correlations and common patterns, as well as to link them to the physical processes. In the second, 4 subsets of sensors located in neighbor positions are analyzed. The analysis of low- and high-speed image sequences allowed to track a dense field of displacement on the slope surface. These outcomes have been compared to the ones obtained from accelerometers for cross-validation. Images were also used for the photogrammetric reconstruction of the slope topography during the experiment. Consequently, volume computation and mass movements could be evaluated on
Dynamic analysis of biochemical network using complex network method
Directory of Open Access Journals (Sweden)
Wang Shuqiang
2015-01-01
Full Text Available In this study, the stochastic biochemical reaction model is proposed based on the law of mass action and complex network theory. The dynamics of biochemical reaction system is presented as a set of non-linear differential equations and analyzed at the molecular-scale. Given the initial state and the evolution rules of the biochemical reaction system, the system can achieve homeostasis. Compared with random graph, the biochemical reaction network has larger information capacity and is more efficient in information transmission. This is consistent with theory of evolution.
Fractional Diffusion Emulates a Human Mobility Network during a Simulated Disease Outbreak
Directory of Open Access Journals (Sweden)
Kyle B. Gustafson
2017-04-01
Full Text Available Mobility networks facilitate the growth of populations, the success of invasive species, and the spread of communicable diseases among social animals, including humans. Disease control and elimination efforts, especially during an outbreak, can be optimized by numerical modeling of disease dynamics on transport networks. This is especially true when incidence data from an emerging epidemic is sparse and unreliable. However, mobility networks can be complex, challenging to characterize, and expensive to simulate with agent-based models. We therefore studied a parsimonious model for spatiotemporal disease dynamics based on a fractional diffusion equation. We implemented new stochastic simulations of a prototypical influenza-like infection spreading through the United States' highly-connected air travel network. We found that the national-averaged infected fraction during an outbreak is accurately reproduced by a space-fractional diffusion equation consistent with the connectivity of airports. Fractional diffusion therefore seems to be a better model of network outbreak dynamics than a diffusive model. Our fractional reaction-diffusion method and the result could be extended to other mobility networks in a variety of applications for population dynamics.
Modern Community Detection Methods in Social Networks
Directory of Open Access Journals (Sweden)
V. O. Chesnokov
2017-01-01
Full Text Available Social network structure is not homogeneous. Groups of vertices which have a lot of links between them are called communities. A survey of algorithms discovering such groups is presented in the article.A popular approach to community detection is to use an graph clustering algorithm. Methods based on inner metric optimization are common. 5 groups of algorithms are listed: based on optimization, joining vertices into clusters by some closeness measure, special subgraphs discovery, partitioning graph by deleting edges, and based on a dynamic process or generative model.Overlapping community detection algorithms are usually just modified graph clustering algorithms. Other approaches do exist, e.g. ones based on edges clustering or constructing communities around randomly chosen vertices. Methods based on nonnegative matrix factorization are also used, but they have high computational complexity. Algorithms based on label propagation lack this disadvantage. Methods based on affiliation model are perspective. This model claims that communities define the structure of a graph.Algorithms which use node attributes are considered: ones based on latent Dirichlet allocation, initially used for text clustering, and CODICIL, where edges of node content relevance are added to the original edge set. 6 classes are listed for algorithms for graphs with node attributes: changing egdes’ weights, changing vertex distance function, building augmented graph with nodes and attributes, based on stochastic models, partitioning attribute space and others.Overlapping community detection algorithms which effectively use node attributes are just started to appear. Methods based on partitioning attribute space, latent Dirichlet allocation, stochastic models and nonnegative matrix factorization are considered. The most effective algorithm on real datasets is CESNA. It is based on affiliation model. However, it gives results which are far from ground truth
Artificial neural network simulator for SOFC performance prediction
Arriagada, Jaime; Olausson, Pernilla; Selimovic, Azra
This paper describes the development of a novel modelling tool for evaluation of solid oxide fuel cell (SOFC) performance. An artificial neural network (ANN) is trained with a reduced amount of data generated by a validated cell model, and it is then capable of learning the generic functional relationship between inputs and outputs of the system. Once the network is trained, the ANN-driven simulator can predict different operational parameters of the SOFC (i.e. gas flows, operational voltages, current density, etc.) avoiding the detailed description of the fuel cell processes. The highly parallel connectivity within the ANN further reduces the computational time. In a real case, the necessary data for training the ANN simulator would be extracted from experiments. This simulator could be suitable for different applications in the fuel cell field, such as, the construction of performance maps and operating point optimisation and analysis. All this is performed with minimum time demand and good accuracy. This intelligent model together with the operational conditions may provide useful insight into SOFC operating characteristics and improved means of selecting operating conditions, reducing costs and the need for extensive experiments.
COEL: A Cloud-based Reaction Network Simulator
Directory of Open Access Journals (Sweden)
Peter eBanda
2016-04-01
Full Text Available Chemical Reaction Networks (CRNs are a formalism to describe the macroscopic behavior of chemical systems. We introduce COEL, a web- and cloud-based CRN simulation framework that does not require a local installation, runs simulations on a large computational grid, provides reliable database storage, and offers a visually pleasing and intuitive user interface. We present an overview of the underlying software, the technologies, and the main architectural approaches employed. Some of COEL's key features include ODE-based simulations of CRNs and multicompartment reaction networks with rich interaction options, a built-in plotting engine, automatic DNA-strand displacement transformation and visualization, SBML/Octave/Matlab export, and a built-in genetic-algorithm-based optimization toolbox for rate constants.COEL is an open-source project hosted on GitHub (http://dx.doi.org/10.5281/zenodo.46544, which allows interested research groups to deploy it on their own sever. Regular users can simply use the web instance at no cost at http://coel-sim.org. The framework is ideally suited for a collaborative use in both research and education.
A Network Scheduling Model for Distributed Control Simulation
Culley, Dennis; Thomas, George; Aretskin-Hariton, Eliot
2016-01-01
Distributed engine control is a hardware technology that radically alters the architecture for aircraft engine control systems. Of its own accord, it does not change the function of control, rather it seeks to address the implementation issues for weight-constrained vehicles that can limit overall system performance and increase life-cycle cost. However, an inherent feature of this technology, digital communication networks, alters the flow of information between critical elements of the closed-loop control. Whereas control information has been available continuously in conventional centralized control architectures through virtue of analog signaling, moving forward, it will be transmitted digitally in serial fashion over the network(s) in distributed control architectures. An underlying effect is that all of the control information arrives asynchronously and may not be available every loop interval of the controller, therefore it must be scheduled. This paper proposes a methodology for modeling the nominal data flow over these networks and examines the resulting impact for an aero turbine engine system simulation.
Improved security monitoring method for network bordary
Gao, Liting; Wang, Lixia; Wang, Zhenyan; Qi, Aihua
2013-03-01
This paper proposes a network bordary security monitoring system based on PKI. The design uses multiple safe technologies, analysis deeply the association between network data flow and system log, it can detect the intrusion activities and position invasion source accurately in time. The experiment result shows that it can reduce the rate of false alarm or missing alarm of the security incident effectively.
An effective method for network module extraction from microarray data
Directory of Open Access Journals (Sweden)
Mahanta Priyakshi
2012-08-01
Full Text Available Abstract Background The development of high-throughput Microarray technologies has provided various opportunities to systematically characterize diverse types of computational biological networks. Co-expression network have become popular in the analysis of microarray data, such as for detecting functional gene modules. Results This paper presents a method to build a co-expression network (CEN and to detect network modules from the built network. We use an effective gene expression similarity measure called NMRS (Normalized mean residue similarity to construct the CEN. We have tested our method on five publicly available benchmark microarray datasets. The network modules extracted by our algorithm have been biologically validated in terms of Q value and p value. Conclusions Our results show that the technique is capable of detecting biologically significant network modules from the co-expression network. Biologist can use this technique to find groups of genes with similar functionality based on their expression information.
Directory of Open Access Journals (Sweden)
Kaushikbhai C. Parmar
2017-04-01
Full Text Available Simulation gives different results when using different methods for the same simulation. Autodesk Moldflow Simulation software provide two different facilities for creating mold for the simulation of injection molding process. Mold can be created inside the Moldflow or it can be imported as CAD file. The aim of this paper is to study the difference in the simulation results like mold temperature part temperature deflection in different direction time for the simulation and coolant temperature for this two different methods.
DC Collection Network Simulation for Offshore Wind Farms
DEFF Research Database (Denmark)
Vogel, Stephan; Rasmussen, Tonny Wederberg; El-Khatib, Walid Ziad
2015-01-01
The possibility to connect offshore wind turbines with a collection network based on Direct Current (DC), instead of Alternating Current (AC), gained attention in the scientific and industrial environment. There are many promising properties of DC components that could be beneficial such as......: smaller dimensions, less weight, fewer conductors, no reactive power considerations, and less overall losses due to the absence of proximity and skin effects. This work describes a study about the simulation of a Medium Voltage DC (MVDC) grid in an offshore wind farm. Suitable converter concepts...
Railway optimal network simulation for the development of regional transport-logistics system
Directory of Open Access Journals (Sweden)
Mikhail Borisovich Petrov
2013-12-01
Full Text Available The dependence of logistics on mineral fuel is a stable tendency of regions development, though when making strategic plans of logistics in the regions, it is necessary to provide the alternative possibilities of power-supply sources change together with population density, transport infrastructure peculiarities, and demographic changes forecast. On the example of timber processing complex of the Sverdlovsk region, the authors suggest the algorithm of decision of the optimal logistics infrastructure allocation. The problem of regional railway network organization at the stage of slow transition from the prolonged stagnation to the new development is carried out. The transport networks’ configurations of countries on the Pacific Rim, which successfully developed nowadays, are analyzed. The authors offer some results of regional transport network simulation on the basis of artificial intelligence method. These methods let to solve the task with incomplete data. The ways of the transport network improvement in the Sverdlovsk region are offered.
Stochastic simulation and Monte-Carlo methods; Simulation stochastique et methodes de Monte-Carlo
Energy Technology Data Exchange (ETDEWEB)
Graham, C. [Centre National de la Recherche Scientifique (CNRS), 91 - Gif-sur-Yvette (France); Ecole Polytechnique, 91 - Palaiseau (France); Talay, D. [Institut National de Recherche en Informatique et en Automatique (INRIA), 78 - Le Chesnay (France); Ecole Polytechnique, 91 - Palaiseau (France)
2011-07-01
This book presents some numerical probabilistic methods of simulation with their convergence speed. It combines mathematical precision and numerical developments, each proposed method belonging to a precise theoretical context developed in a rigorous and self-sufficient manner. After some recalls about the big numbers law and the basics of probabilistic simulation, the authors introduce the martingales and their main properties. Then, they develop a chapter on non-asymptotic estimations of Monte-Carlo method errors. This chapter gives a recall of the central limit theorem and precises its convergence speed. It introduces the Log-Sobolev and concentration inequalities, about which the study has greatly developed during the last years. This chapter ends with some variance reduction techniques. In order to demonstrate in a rigorous way the simulation results of stochastic processes, the authors introduce the basic notions of probabilities and of stochastic calculus, in particular the essential basics of Ito calculus, adapted to each numerical method proposed. They successively study the construction and important properties of the Poisson process, of the jump and deterministic Markov processes (linked to transport equations), and of the solutions of stochastic differential equations. Numerical methods are then developed and the convergence speed results of algorithms are rigorously demonstrated. In passing, the authors describe the probabilistic interpretation basics of the parabolic partial derivative equations. Non-trivial applications to real applied problems are also developed. (J.S.)
A novel community detection method in bipartite networks
Zhou, Cangqi; Feng, Liang; Zhao, Qianchuan
2018-02-01
Community structure is a common and important feature in many complex networks, including bipartite networks, which are used as a standard model for many empirical networks comprised of two types of nodes. In this paper, we propose a two-stage method for detecting community structure in bipartite networks. Firstly, we extend the widely-used Louvain algorithm to bipartite networks. The effectiveness and efficiency of the Louvain algorithm have been proved by many applications. However, there lacks a Louvain-like algorithm specially modified for bipartite networks. Based on bipartite modularity, a measure that extends unipartite modularity and that quantifies the strength of partitions in bipartite networks, we fill the gap by developing the Bi-Louvain algorithm that iteratively groups the nodes in each part by turns. This algorithm in bipartite networks often produces a balanced network structure with equal numbers of two types of nodes. Secondly, for the balanced network yielded by the first algorithm, we use an agglomerative clustering method to further cluster the network. We demonstrate that the calculation of the gain of modularity of each aggregation, and the operation of joining two communities can be compactly calculated by matrix operations for all pairs of communities simultaneously. At last, a complete hierarchical community structure is unfolded. We apply our method to two benchmark data sets and a large-scale data set from an e-commerce company, showing that it effectively identifies community structure in bipartite networks.
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.
Experimental method to predict avalanches based on neural networks
Directory of Open Access Journals (Sweden)
V. V. Zhdanov
2016-01-01
Full Text Available The article presents results of experimental use of currently available statistical methods to classify the avalanche‑dangerous precipitations and snowfalls in the Kishi Almaty river basin. The avalanche service of Kazakhstan uses graphical methods for prediction of avalanches developed by I.V. Kondrashov and E.I. Kolesnikov. The main objective of this work was to develop a modern model that could be used directly at the avalanche stations. Classification of winter precipitations into dangerous snowfalls and non‑dangerous ones was performed by two following ways: the linear discriminant function (canonical analysis and artificial neural networks. Observational data on weather and avalanches in the gorge Kishi Almaty in the gorge Kishi Almaty were used as a training sample. Coefficients for the canonical variables were calculated by the software «Statistica» (Russian version 6.0, and then the necessary formula had been constructed. The accuracy of the above classification was 96%. Simulator by the authors L.N. Yasnitsky and F.М. Cherepanov was used to learn the neural networks. The trained neural network demonstrated 98% accuracy of the classification. Prepared statistical models are recommended to be tested at the snow‑avalanche stations. Results of the tests will be used for estimation of the model quality and its readiness for the operational work. In future, we plan to apply these models for classification of the avalanche danger by the five‑point international scale.
Directory of Open Access Journals (Sweden)
Biao Xiong
2017-01-01
Full Text Available The effectiveness of military supply chain networks is an important reference for logistics decision-making, and it is crucial to evaluate it scientifically and accurately. This paper highlights the problem from the perspective of dynamic and discrete networks. A topological structure model with the characteristics of dynamic and discreteness is used to describe the structure of military supply chain networks (MSCNs. In order to provide a platform for evaluating the effectiveness, simulation algorithms based on topological structure models for MSCNs are presented. Considering military and economic factors, evaluation metrics including supply capability and supply efficiency are proposed. By applying the model and algorithms to a POL supply network in a theater, we obtain the values of supply capability and efficiency metrics in a dynamic environment. We also identify an optimal solution from multiple feasible solutions to help decision-makers to make scientific and rational decisions by using exploratory analysis method. The results show that new evaluation metrics can capture important effectiveness requirements for military supply networks positively. We also find the proposed method in this paper can solve the problem of evaluating the effectiveness of dynamic and discrete network effectiveness evaluation in a feasible and effective manner.
Course Control of Underactuated Ship Based on Nonlinear Robust Neural Network Backstepping Method.
Yuan, Junjia; Meng, Hao; Zhu, Qidan; Zhou, Jiajia
2016-01-01
The problem of course control for underactuated surface ship is addressed in this paper. Firstly, neural networks are adopted to determine the parameters of the unknown part of ideal virtual backstepping control, even the weight values of neural network are updated by adaptive technique. Then uniform stability for the convergence of course tracking errors has been proven through Lyapunov stability theory. Finally, simulation experiments are carried out to illustrate the effectiveness of proposed control method.
SIPSON--simulation of interaction between pipe flow and surface overland flow in networks.
Djordjević, S; Prodanović, D; Maksimović, C; Ivetić, M; Savić, D
2005-01-01
The new simulation model, named SIPSON, based on the Preissmann finite difference method and the conjugate gradient method, is presented in the paper. This model simulates conditions when the hydraulic capacity of a sewer system is exceeded, pipe flow is pressurized, the water flows out from the piped system to the streets, and the inlets cannot capture all the runoff. In the mathematical model, buried structures and pipelines, together with surface channels, make a horizontally and vertically looped network involving a complex interaction of flows. In this paper, special internal boundary conditions related to equivalent inlets are discussed. Procedures are described for the simulation of manhole cover loss, basement flooding, the representation of street geometry, and the distribution of runoff hydrographs between surface and underground networks. All these procedures are built into the simulation model. Relevant issues are illustrated on a set of examples, focusing on specific parameters and comparison with field measurements of flooding of the Motilal ki Chal catchment (Indore, India). Satisfactory agreement of observed and simulated hydrographs and maximum surface flooding levels is obtained. It is concluded that the presented approach is an improvement compared to the standard "virtual reservoir" approach commonly applied in most of the models.
Efficient Optimization Methods for Communication Network Planning and Assessment
Kiese, Moritz
2010-01-01
In this work, we develop efficient mathematical planning methods to design communication networks. First, we examine future technologies for optical backbone networks. As new, more intelligent nodes cause higher dynamics in the transport networks, fast planning methods are required. To this end, we develop a heuristic planning algorithm. The evaluation of the cost-efficiency of new, adapative transmission techniques comprises the second topic of this section. In the second part of this work, ...
Quantum versus simulated annealing in wireless interference network optimization
Wang, Chi; Chen, Huo; Jonckheere, Edmond
2016-05-01
Quantum annealing (QA) serves as a specialized optimizer that is able to solve many NP-hard problems and that is believed to have a theoretical advantage over simulated annealing (SA) via quantum tunneling. With the introduction of the D-Wave programmable quantum annealer, a considerable amount of effort has been devoted to detect and quantify quantum speedup. While the debate over speedup remains inconclusive as of now, instead of attempting to show general quantum advantage, here, we focus on a novel real-world application of D-Wave in wireless networking—more specifically, the scheduling of the activation of the air-links for maximum throughput subject to interference avoidance near network nodes. In addition, D-Wave implementation is made error insensitive by a novel Hamiltonian extra penalty weight adjustment that enlarges the gap and substantially reduces the occurrence of interference violations resulting from inevitable spin bias and coupling errors. The major result of this paper is that quantum annealing benefits more than simulated annealing from this gap expansion process, both in terms of ST99 speedup and network queue occupancy. It is the hope that this could become a real-word application niche where potential benefits of quantum annealing could be objectively assessed.
IMPROVING MANUFACTURING PROCESSES USING SIMULATION METHODS
Directory of Open Access Journals (Sweden)
Sławomir KŁOS
2016-12-01
Full Text Available The paper presents the results of simulation research on buffer space allocated in a flow line and operation times influence on the throughput of a manufacturing system. The production line in the study consists of four stages and is based on a real machining manufacturing system of a small production enterprise. Using Tecnomatix Plant Simulation software, a simulation model of the system was created and set of experiments was planned. Simulation experiments were prepared for different capacities of intermediate buffers located between manufacturing resources and operation times as input parameters, and the throughput per hour and average life span of products as the output.
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
Network condition simulator for benchmarking sewer deterioration models.
Scheidegger, A; Hug, T; Rieckermann, J; Maurer, M
2011-10-15
An accurate description of aging and deterioration of urban drainage systems is necessary for optimal investment and rehabilitation planning. Due to a general lack of suitable datasets, network condition models are rarely validated, and if so with varying levels of success. We therefore propose a novel network condition simulator (NetCoS) that produces a synthetic population of sewer sections with a given condition-class distribution. NetCoS can be used to benchmark deterioration models and guide utilities in the selection of appropriate models and data management strategies. The underlying probabilistic model considers three main processes: a) deterioration, b) replacement policy, and c) expansions of the sewer network. The deterioration model features a semi-Markov chain that uses transition probabilities based on user-defined survival functions. The replacement policy is approximated with a condition-class dependent probability of replacing a sewer pipe. The model then simulates the course of the sewer sections from the installation of the first line to the present, adding new pipes based on the defined replacement and expansion program. We demonstrate the usefulness of NetCoS in two examples where we quantify the influence of incomplete data and inspection frequency on the parameter estimation of a cohort survival model and a Markov deterioration model. Our results show that typical available sewer inventory data with discarded historical data overestimate the average life expectancy by up to 200 years. Although NetCoS cannot prove the validity of a particular deterioration model, it is useful to reveal its possible limitations and shortcomings and quantifies the effects of missing or uncertain data. Future developments should include additional processes, for example to investigate the long-term effect of pipe rehabilitation measures, such as inliners. Copyright © 2011 Elsevier Ltd. All rights reserved.
A Method for Automated Planning of FTTH Access Network Infrastructures
DEFF Research Database (Denmark)
Riaz, Muhammad Tahir; Pedersen, Jens Myrup; Madsen, Ole Brun
2005-01-01
In this paper a method for automated planning of Fiber to the Home (FTTH) access networks is proposed. We introduced a systematic approach for planning access network infrastructure. The GIS data and a set of algorithms were employed to make the planning process more automatic. The method explains...
Zhou, Wanmeng; Wang, Hua; Tang, Guojin; Guo, Shuai
2016-09-01
The time-consuming experimental method for handling qualities assessment cannot meet the increasing fast design requirements for the manned space flight. As a tool for the aircraft handling qualities research, the model-predictive-control structured inverse simulation (MPC-IS) has potential applications in the aerospace field to guide the astronauts' operations and evaluate the handling qualities more effectively. Therefore, this paper establishes MPC-IS for the manual-controlled rendezvous and docking (RVD) and proposes a novel artificial neural network inverse simulation system (ANN-IS) to further decrease the computational cost. The novel system was obtained by replacing the inverse model of MPC-IS with the artificial neural network. The optimal neural network was trained by the genetic Levenberg-Marquardt algorithm, and finally determined by the Levenberg-Marquardt algorithm. In order to validate MPC-IS and ANN-IS, the manual-controlled RVD experiments on the simulator were carried out. The comparisons between simulation results and experimental data demonstrated the validity of two systems and the high computational efficiency of ANN-IS.
DETECTING NETWORK ATTACKS IN COMPUTER NETWORKS BY USING DATA MINING METHODS
Platonov, V. V.; Semenov, P. O.
2016-01-01
The article describes an approach to the development of an intrusion detection system for computer networks. It is shown that the usage of several data mining methods and tools can improve the efficiency of protection computer networks against network at-tacks due to the combination of the benefits of signature detection and anomalies detection and the opportunity of adaptation the sys-tem for hardware and software structure of the computer network.
Directory of Open Access Journals (Sweden)
Song Fujian
2012-09-01
Full Text Available Abstract Background Indirect treatment comparison (ITC and mixed treatment comparisons (MTC have been increasingly used in network meta-analyses. This simulation study comprehensively investigated statistical properties and performances of commonly used ITC and MTC methods, including simple ITC (the Bucher method, frequentist and Bayesian MTC methods. Methods A simple network of three sets of two-arm trials with a closed loop was simulated. Different simulation scenarios were based on different number of trials, assumed treatment effects, extent of heterogeneity, bias and inconsistency. The performance of the ITC and MTC methods was measured by the type I error, statistical power, observed bias and mean squared error (MSE. Results When there are no biases in primary studies, all ITC and MTC methods investigated are on average unbiased. Depending on the extent and direction of biases in different sets of studies, ITC and MTC methods may be more or less biased than direct treatment comparisons (DTC. Of the methods investigated, the simple ITC method has the largest mean squared error (MSE. The DTC is superior to the ITC in terms of statistical power and MSE. Under the simulated circumstances in which there are no systematic biases and inconsistencies, the performances of MTC methods are generally better than the performance of the corresponding DTC methods. For inconsistency detection in network meta-analysis, the methods evaluated are on average unbiased. The statistical power of commonly used methods for detecting inconsistency is very low. Conclusions The available methods for indirect and mixed treatment comparisons have different advantages and limitations, depending on whether data analysed satisfies underlying assumptions. To choose the most valid statistical methods for research synthesis, an appropriate assessment of primary studies included in evidence network is required.
Christensen, Claire Petra
's own publications have contributed network inference, simulation, modeling, and analysis methods to the much larger body of work in systems biology, and indeed, in network science. The aim of this thesis is therefore twofold: to present this original work in the historical context of network science, but also to provide sufficient review and reference regarding complex systems (with an emphasis on complex networks in systems biology) and tools and techniques for their inference, simulation, analysis, and modeling, such that the reader will be comfortable in seeking out further information on the subject. The review-like Chapters 1, 2, and 4 are intended to convey the co-evolution of network science and the slow but noticeable breakdown of boundaries between disciplines in academia as research and comparison of diverse systems has brought to light the shared properties of these systems. It is the author's hope that theses chapters impart some sense of the remarkable and rapid progress in complex systems research that has led to this unprecedented academic synergy. Chapters 3 and 5 detail the author's original work in the context of complex systems research. Chapter 3 presents the methods and results of a two-stage modeling process that generates candidate gene-regulatory networks of the bacterium B.subtilis from experimentally obtained, yet mathematically underdetermined microchip array data. These networks are then analyzed from a graph theoretical perspective, and their biological viability is critiqued by comparing the networks' graph theoretical properties to those of other biological systems. The results of topological perturbation analyses revealing commonalities in behavior at multiple levels of complexity are also presented, and are shown to be an invaluable means by which to ascertain the level of complexity to which the network inference process is robust to noise. Chapter 5 outlines a learning algorithm for the development of a realistic, evolving social
Anomaly-based Network Intrusion Detection Methods
Directory of Open Access Journals (Sweden)
Pavel Nevlud
2013-01-01
Full Text Available The article deals with detection of network anomalies. Network anomalies include everything that is quite different from the normal operation. For detection of anomalies were used machine learning systems. Machine learning can be considered as a support or a limited type of artificial intelligence. A machine learning system usually starts with some knowledge and a corresponding knowledge organization so that it can interpret, analyse, and test the knowledge acquired. There are several machine learning techniques available. We tested Decision tree learning and Bayesian networks. The open source data-mining framework WEKA was the tool we used for testing the classify, cluster, association algorithms and for visualization of our results. The WEKA is a collection of machine learning algorithms for data mining tasks.
Directory of Open Access Journals (Sweden)
GHAREHPETIAN, G. B.
2009-06-01
Full Text Available The analysis of the risk of partial and total blackouts has a crucial role to determine safe limits in power system design, operation and upgrade. Due to huge cost of blackouts, it is very important to improve risk assessment methods. In this paper, Monte Carlo simulation (MCS was used to analyze the risk and Gaussian Mixture Method (GMM has been used to estimate the probability density function (PDF of the load curtailment, in order to improve the power system risk assessment method. In this improved method, PDF and a suggested index have been used to analyze the risk of loss of load. The effect of considering the number of generation units of power plants in the risk analysis has been studied too. The improved risk assessment method has been applied to IEEE 118 bus and the network of Khorasan Regional Electric Company (KREC and the PDF of the load curtailment has been determined for both systems. The effect of various network loadings, transmission unavailability, transmission capacity and generation unavailability conditions on blackout risk has been investigated too.
Representing Dynamic Social Networks in Discrete Event Social Simulation
2010-12-01
notwithstanding any other provision of law, no person shall be subject to a penalty for failing to comply with a collection of information if it does not...and applying social network change detection methods (SNCD) to model output. 15. SUBJECT TERMS 16. SECURITY CLASSIFICATION OF: 17. LIMITATION OF...society. The action choice component of the conceptual model is based on the theory of planned behavior ( TPB ) (I. Ajzen 1991). The TPB states that an
Simulation of secondary fault shear displacements - method and application
Fälth, Billy; Hökmark, Harald; Lund, Björn; Mai, P. Martin; Munier, Raymond
2014-05-01
We present an earthquake simulation method to calculate dynamically and statically induced shear displacements on faults near a large earthquake. Our results are aimed at improved safety assessment of underground waste storage facilities, e.g. a nuclear waste repository. For our simulations, we use the distinct element code 3DEC. We benchmark 3DEC by running an earthquake simulation and then compare the displacement waveforms at a number of surface receivers with the corresponding results obtained from the COMPSYN code package. The benchmark test shows a good agreement in terms of both phase and amplitude. In our application to a potential earthquake near a storage facility, we use a model with a pre-defined earthquake fault plane (primary fault) surrounded by numerous smaller discontinuities (target fractures) representing faults in which shear movements may be induced by the earthquake. The primary fault and the target fractures are embedded in an elastic medium. Initial stresses are applied and the fault rupture mechanism is simulated through a programmed reduction of the primary fault shear strength, which is initiated at a pre-defined hypocenter. The rupture is propagated at a typical rupture propagation speed and arrested when it reaches the fault plane boundaries. The primary fault residual strength properties are uniform over the fault plane. The method allows for calculation of target fracture shear movements induced by static stress redistribution as well as by dynamic effects. We apply the earthquake simulation method in a model of the Forsmark nuclear waste repository site in Sweden with rock mass properties, in situ stresses and fault geometries according to the description of the site established by the Swedish Nuclear Fuel and Waste Management Co (SKB). The target fracture orientations are based on the Discrete Fracture Network model developed for the site. With parameter values set to provide reasonable upper bound estimates of target fracture
Methods and evaluations for simulation debriefing in nursing education.
Waznonis, Annette R
2014-08-01
Debriefing is the most important aspect of simulated learning, but actual debriefing practices are not evidence based or widely known. Expert opinions on effective simulation debriefing have been widely published and likely guide debriefing in nursing education. However, various terms are used to discuss simulation debriefing, making it difficult to distinguish debriefing methods. Also, the means for evaluating simulation debriefing are lacking. The purpose of this review is to identify and examine methods and evaluations for simulation debriefing in the educational setting. Twenty-two methods and seven evaluations for simulation debriefing were found. Four areas of differences among methods-suggested uses, design features, supplemental resources, and means for evaluation-were demonstrated. This review offers nurse educators and researchers a comprehensive, practical examination of the methods and evaluations for simulation debriefing in the educational setting, clarifies terminology, and describes how the debriefing methods, phases, approaches, elements, and evaluations are interrelated. Copyright 2014, SLACK Incorporated.
Mean field methods for cortical network dynamics
DEFF Research Database (Denmark)
Hertz, J.; Lerchner, Alexander; Ahmadi, M.
2004-01-01
We review the use of mean field theory for describing the dynamics of dense, randomly connected cortical circuits. For a simple network of excitatory and inhibitory leaky integrate- and-fire neurons, we can show how the firing irregularity, as measured by the Fano factor, increases...... with the strength of the synapses in the network and with the value to which the membrane potential is reset after a spike. Generalizing the model to include conductance-based synapses gives insight into the connection between the firing statistics and the high- conductance state observed experimentally in visual...
Narasimha Rao, Gudikandhula; Jagadeeswara Rao, Peddada; Duvvuru, Rajesh
2016-09-01
Wild fires have significant impact on atmosphere and lives. The demand of predicting exact fire area in forest may help fire management team by using drone as a robot. These are flexible, inexpensive and elevated-motion remote sensing systems that use drones as platforms are important for substantial data gaps and supplementing the capabilities of manned aircraft and satellite remote sensing systems. In addition, powerful computational tools are essential for predicting certain burned area in the duration of a forest fire. The reason of this study is to built up a smart system based on semantic neural networking for the forecast of burned areas. The usage of virtual reality simulator is used to support the instruction process of fire fighters and all users for saving of surrounded wild lives by using a naive method Semantic Neural Network System (SNNS). Semantics are valuable initially to have a enhanced representation of the burned area prediction and better alteration of simulation situation to the users. In meticulous, consequences obtained with geometric semantic neural networking is extensively superior to other methods. This learning suggests that deeper investigation of neural networking in the field of forest fires prediction could be productive.
DEFF Research Database (Denmark)
Brochado, Ana Rita; Andrejev, Sergej; Maranas, Costas D.
2012-01-01
linear combination of selected fluxes is widely used for formulating metabolic objective functions, we show that the resulting optimization problem is sensitive towards stoichiometry representation of the metabolic network. This undesirable sensitivity leads to different simulation results when using...... numerically different but biochemically equivalent stoichiometry representations and thereby makes biological interpretation intrinsically subjective and ambiguous. We hereby propose a new method, Minimization of Metabolites Balance (MiMBl), which decouples the artifacts of stoichiometry representation from...... the formulation of the desired objective functions, by casting objective functions using metabolite turnovers rather than fluxes. By simulating perturbed metabolic networks, we demonstrate that the use of stoichiometry representation independent algorithms is fundamental for unambiguously linking modeling results...
Song, Fujian; Clark, Allan; Bachmann, Max O; Maas, Jim
2012-09-12
Indirect treatment comparison (ITC) and mixed treatment comparisons (MTC) have been increasingly used in network meta-analyses. This simulation study comprehensively investigated statistical properties and performances of commonly used ITC and MTC methods, including simple ITC (the Bucher method), frequentist and Bayesian MTC methods. A simple network of three sets of two-arm trials with a closed loop was simulated. Different simulation scenarios were based on different number of trials, assumed treatment effects, extent of heterogeneity, bias and inconsistency. The performance of the ITC and MTC methods was measured by the type I error, statistical power, observed bias and mean squared error (MSE). When there are no biases in primary studies, all ITC and MTC methods investigated are on average unbiased. Depending on the extent and direction of biases in different sets of studies, ITC and MTC methods may be more or less biased than direct treatment comparisons (DTC). Of the methods investigated, the simple ITC method has the largest mean squared error (MSE). The DTC is superior to the ITC in terms of statistical power and MSE. Under the simulated circumstances in which there are no systematic biases and inconsistencies, the performances of MTC methods are generally better than the performance of the corresponding DTC methods. For inconsistency detection in network meta-analysis, the methods evaluated are on average unbiased. The statistical power of commonly used methods for detecting inconsistency is very low. The available methods for indirect and mixed treatment comparisons have different advantages and limitations, depending on whether data analysed satisfies underlying assumptions. To choose the most valid statistical methods for research synthesis, an appropriate assessment of primary studies included in evidence network is required.
Neural network simulation of the industrial producer price index dynamical series
Soshnikov, L. E.
2013-01-01
This paper is devoted the simulation and forecast of dynamical series of the economical indicators. Multilayer perceptron and Radial basis function neural networks have been used. The neural networks model results are compared with the econometrical modeling.
Virtual Crowds Methods, Simulation, and Control
Pelechano, Nuria; Allbeck, Jan
2008-01-01
There are many applications of computer animation and simulation where it is necessary to model virtual crowds of autonomous agents. Some of these applications include site planning, education, entertainment, training, and human factors analysis for building evacuation. Other applications include simulations of scenarios where masses of people gather, flow, and disperse, such as transportation centers, sporting events, and concerts. Most crowd simulations include only basic locomotive behaviors possibly coupled with a few stochastic actions. Our goal in this survey is to establish a baseline o
An image segmentation method based on network clustering model
Jiao, Yang; Wu, Jianshe; Jiao, Licheng
2018-01-01
Network clustering phenomena are ubiquitous in nature and human society. In this paper, a method involving a network clustering model is proposed for mass segmentation in mammograms. First, the watershed transform is used to divide an image into regions, and features of the image are computed. Then a graph is constructed from the obtained regions and features. The network clustering model is applied to realize clustering of nodes in the graph. Compared with two classic methods, the algorithm based on the network clustering model performs more effectively in experiments.
Mixed Methods Analysis of Enterprise Social Networks
DEFF Research Database (Denmark)
Behrendt, Sebastian; Richter, Alexander; Trier, Matthias
2014-01-01
The increasing use of enterprise social networks (ESN) generates vast amounts of data, giving researchers and managerial decision makers unprecedented opportunities for analysis. However, more transparency about the available data dimensions and how these can be combined is needed to yield accurate...
Laurito, Andres; The ATLAS collaboration
2017-01-01
Simulation is an important tool to validate the performance impact of control decisions in Software Defined Networks (SDN). Yet, the manual modeling of complex topologies that may change often during a design process can be a tedious error-prone task. We present TopoGen, a general purpose architecture and tool for systematic translation and generation of network topologies. TopoGen can be used to generate network simulation models automatically by querying information available at diverse sources, notably SDN controllers. The DEVS modeling and simulation framework facilitates a systematic translation of structured knowledge about a network topology into a formal modular and hierarchical coupling of preexisting or new models of network entities (physical or logical). TopoGen can be flexibly extended with new parsers and generators to grow its scope of applicability. This permits to design arbitrary workflows of topology transformations. We tested TopoGen in a network engineering project for the ATLAS detector ...
Laurito, Andres; The ATLAS collaboration
2018-01-01
Simulation is an important tool to validate the performance impact of control decisions in Software Defined Networks (SDN). Yet, the manual modeling of complex topologies that may change often during a design process can be a tedious error-prone task. We present TopoGen, a general purpose architecture and tool for systematic translation and generation of network topologies. TopoGen can be used to generate network simulation models automatically by querying information available at diverse sources, notably SDN controllers. The DEVS modeling and simulation framework facilitates a systematic translation of structured knowledge about a network topology into a formal modular and hierarchical coupling of preexisting or new models of network entities (physical or logical). TopoGen can be flexibly extended with new parsers and generators to grow its scope of applicability. This permits to design arbitrary workflows of topology transformations. We tested TopoGen in a network engineering project for the ATLAS detector ...
Yang, Jin; Hlavacek, William S
2011-10-01
Rule-based models, which are typically formulated to represent cell signaling systems, can now be simulated via various network-free simulation methods. In a network-free method, reaction rates are calculated for rules that characterize molecular interactions, and these rule rates, which each correspond to the cumulative rate of all reactions implied by a rule, are used to perform a stochastic simulation of reaction kinetics. Network-free methods, which can be viewed as generalizations of Gillespie's method, are so named because these methods do not require that a list of individual reactions implied by a set of rules be explicitly generated, which is a requirement of other methods for simulating rule-based models. This requirement is impractical for rule sets that imply large reaction networks (i.e. long lists of individual reactions), as reaction network generation is expensive. Here, we compare the network-free simulation methods implemented in RuleMonkey and NFsim, general-purpose software tools for simulating rule-based models encoded in the BioNetGen language. The method implemented in NFsim uses rejection sampling to correct overestimates of rule rates, which introduces null events (i.e. time steps that do not change the state of the system being simulated). The method implemented in RuleMonkey uses iterative updates to track rule rates exactly, which avoids null events. To ensure a fair comparison of the two methods, we developed implementations of the rejection and rejection-free methods specific to a particular class of kinetic models for multivalent ligand-receptor interactions. These implementations were written with the intention of making them as much alike as possible, minimizing the contribution of irrelevant coding differences to efficiency differences. Simulation results show that performance of the rejection method is equal to or better than that of the rejection-free method over wide parameter ranges. However, when parameter values are such that
Dynamic baseline detection method for power data network service
Chen, Wei
2017-08-01
This paper proposes a dynamic baseline Traffic detection Method which is based on the historical traffic data for the Power data network. The method uses Cisco's NetFlow acquisition tool to collect the original historical traffic data from network element at fixed intervals. This method uses three dimensions information including the communication port, time, traffic (number of bytes or number of packets) t. By filtering, removing the deviation value, calculating the dynamic baseline value, comparing the actual value with the baseline value, the method can detect whether the current network traffic is abnormal.
Numerical methods in simulation of resistance welding
DEFF Research Database (Denmark)
Nielsen, Chris Valentin; Martins, Paulo A.F.; Zhang, Wenqi
2015-01-01
Finite element simulation of resistance welding requires coupling betweenmechanical, thermal and electrical models. This paper presents the numerical models and theircouplings that are utilized in the computer program SORPAS. A mechanical model based onthe irreducible flow formulation is utilized...... a resistance welding point of view, the most essential coupling between the above mentioned models is the heat generation by electrical current due to Joule heating. The interaction between multiple objects is anothercritical feature of the numerical simulation of resistance welding because it influences...
Simulation methods for bumper system development
Isaksson, Erik
2006-01-01
n development of bumper systems for the automotive industry, iterative Finite Element (FE) simulations are normally used to find a bumper design that meets the requirements of crash performance. The crash performance of a bumper system is normally verified by results from standardized low speed crash tests based on common crash situations. Consequently, these crash load cases are also used in the FE simulations during the development process. However, lack of data for the car under developmen...
A new method for constructing networks from binary data
van Borkulo, Claudia D.; Borsboom, Denny; Epskamp, Sacha; Blanken, Tessa F.; Boschloo, Lynn; Schoevers, Robert A.; Waldorp, Lourens J.
2014-08-01
Network analysis is entering fields where network structures are unknown, such as psychology and the educational sciences. A crucial step in the application of network models lies in the assessment of network structure. Current methods either have serious drawbacks or are only suitable for Gaussian data. In the present paper, we present a method for assessing network structures from binary data. Although models for binary data are infamous for their computational intractability, we present a computationally efficient model for estimating network structures. The approach, which is based on Ising models as used in physics, combines logistic regression with model selection based on a Goodness-of-Fit measure to identify relevant relationships between variables that define connections in a network. A validation study shows that this method succeeds in revealing the most relevant features of a network for realistic sample sizes. We apply our proposed method to estimate the network of depression and anxiety symptoms from symptom scores of 1108 subjects. Possible extensions of the model are discussed.
Jokar, Ali; Godarzi, Ali Abbasi; Saber, Mohammad; Shafii, Mohammad Behshad
2016-11-01
In this paper, a novel approach has been presented to simulate and optimize the pulsating heat pipes (PHPs). The used pulsating heat pipe setup was designed and constructed for this study. Due to the lack of a general mathematical model for exact analysis of the PHPs, a method has been applied for simulation and optimization using the natural algorithms. In this way, the simulator consists of a kind of multilayer perceptron neural network, which is trained by experimental results obtained from our PHP setup. The results show that the complex behavior of PHPs can be successfully described by the non-linear structure of this simulator. The input variables of the neural network are input heat flux to evaporator (q″), filling ratio (FR) and inclined angle (IA) and its output is thermal resistance of PHP. Finally, based upon the simulation results and considering the heat pipe's operating constraints, the optimum operating point of the system is obtained by using genetic algorithm (GA). The experimental results show that the optimum FR (38.25 %), input heat flux to evaporator (39.93 W) and IA (55°) that obtained from GA are acceptable.
The research on user behavior evaluation method for network state
Zhang, Chengyuan; Xu, Haishui
2017-08-01
Based on the correlation between user behavior and network running state, this paper proposes a method of user behavior evaluation based on network state. Based on the analysis and evaluation methods in other fields of study, we introduce the theory and tools of data mining. Based on the network status information provided by the trusted network view, the user behavior data and the network state data are analysed. Finally, we construct the user behavior evaluation index and weight, and on this basis, we can accurately quantify the influence degree of the specific behavior of different users on the change of network running state, so as to provide the basis for user behavior control decision.
Evolutionary method for finding communities in bipartite networks
Zhan, Weihua; Zhang, Zhongzhi; Guan, Jihong; Zhou, Shuigeng
2011-06-01
An important step in unveiling the relation between network structure and dynamics defined on networks is to detect communities, and numerous methods have been developed separately to identify community structure in different classes of networks, such as unipartite networks, bipartite networks, and directed networks. Here, we show that the finding of communities in such networks can be unified in a general framework—detection of community structure in bipartite networks. Moreover, we propose an evolutionary method for efficiently identifying communities in bipartite networks. To this end, we show that both unipartite and directed networks can be represented as bipartite networks, and their modularity is completely consistent with that for bipartite networks, the detection of modular structure on which can be reformulated as modularity maximization. To optimize the bipartite modularity, we develop a modified adaptive genetic algorithm (MAGA), which is shown to be especially efficient for community structure detection. The high efficiency of the MAGA is based on the following three improvements we make. First, we introduce a different measure for the informativeness of a locus instead of the standard deviation, which can exactly determine which loci mutate. This measure is the bias between the distribution of a locus over the current population and the uniform distribution of the locus, i.e., the Kullback-Leibler divergence between them. Second, we develop a reassignment technique for differentiating the informative state a locus has attained from the random state in the initial phase. Third, we present a modified mutation rule which by incorporating related operations can guarantee the convergence of the MAGA to the global optimum and can speed up the convergence process. Experimental results show that the MAGA outperforms existing methods in terms of modularity for both bipartite and unipartite networks.
USE OF NEURAL NETWORK SIMULATION TO MONITOR PATIENTS UNDERGOING RADICAL PROSTATECTOMY
National Research Council Canada - National Science Library
I. V. Lukyanov; N. A. Demchenko
2014-01-01
.... Based on neural network simulation, the Department of Urology, Russian Medical Academy of Postgraduate Education, has developed an accounting prognostic system to monitor the postoperative course...
A simulation study of TaMAC protocol using network simulator 2.
Ullah, Sana; Kwak, Kyung Sup
2012-10-01
A Wireless Body Area Network (WBAN) is expected to play a significant role in future healthcare system. It interconnects low-cost and intelligent sensor nodes in, on, or around a human body to serve a variety of medical applications. It can be used to diagnose and treat patients with chronic diseases such as hypertensions, diabetes, and cardiovascular diseases. The lightweight sensor nodes integrated in WBAN require low-power operation, which can be achieved using different optimization techniques. We introduce a Traffic-adaptive MAC protocol (TaMAC) for WBAN that supports dual wakeup mechanisms for normal, emergency, and on-demand traffic. In this letter, the TaMAC protocol is simulated using a well-known Network Simulator 2 (NS-2). The problem of multiple emergency nodes is solved using both wakeup radio and CSMA/CA protocol. The power consumption, delay, and throughput performance are closely compared with beacon-enabled IEEE 802.15.4 MAC protocol using extensive simulations.
Simulating dynamic plastic continuous neural networks by finite elements.
Joghataie, Abdolreza; Torghabehi, Omid Oliyan
2014-08-01
We introduce dynamic plastic continuous neural network (DPCNN), which is comprised of neurons distributed in a nonlinear plastic medium where wire-like connections of neural networks are replaced with the continuous medium. We use finite element method to model the dynamic phenomenon of information processing within the DPCNNs. During the training, instead of weights, the properties of the continuous material at its different locations and some properties of neurons are modified. Input and output can be vectors and/or continuous functions over lines and/or areas. Delay and feedback from neurons to themselves and from outputs occur in the DPCNNs. We model a simple form of the DPCNN where the medium is a rectangular plate of bilinear material, and the neurons continuously fire a signal, which is a function of the horizontal displacement.
Reduction Method for Active Distribution Networks
DEFF Research Database (Denmark)
Raboni, Pietro; Chen, Zhe
2013-01-01
On-line security assessment is traditionally performed by Transmission System Operators at the transmission level, ignoring the effective response of distributed generators and small loads. On the other hand the required computation time and amount of real time data for including Distribution Net...... by comparing the results obtained in PSCAD® with the detailed network model and with the reduced one. Moreover the control schemes of a wind turbine and a photovoltaic plant included in the detailed network model are described.......On-line security assessment is traditionally performed by Transmission System Operators at the transmission level, ignoring the effective response of distributed generators and small loads. On the other hand the required computation time and amount of real time data for including Distribution...
Classification Method in Integrated Information Network Using Vector Image Comparison
Directory of Open Access Journals (Sweden)
Zhou Yuan
2014-05-01
Full Text Available Wireless Integrated Information Network (WMN consists of integrated information that can get data from its surrounding, such as image, voice. To transmit information, large resource is required which decreases the service time of the network. In this paper we present a Classification Approach based on Vector Image Comparison (VIC for WMN that improve the service time of the network. The available methods for sub-region selection and conversion are also proposed.
Spectral Methods for Immunization of Large Networks
Directory of Open Access Journals (Sweden)
Muhammad Ahmad
2017-11-01
Full Text Available Given a network of nodes, minimizing the spread of a contagion using a limited budget is a well-studied problem with applications in network security, viral marketing, social networks, and public health. In real graphs, virus may infect a node which in turn infects its neighbour nodes and this may trigger an epidemic in the whole graph. The goal thus is to select the best k nodes (budget constraint that are immunized (vaccinated, screened, filtered so as the remaining graph is less prone to the epidemic. It is known that the problem is, in all practical models, computationally intractable even for moderate sized graphs. In this paper we employ ideas from spectral graph theory to define relevance and importance of nodes. Using novel graph theoretic techniques, we then design an efficient approximation algorithm to immunize the graph. Theoretical guarantees on the running time of our algorithm show that it is more efficient than any other known solution in the literature. We test the performance of our algorithm on several real world graphs. Experiments show that our algorithm scales well for large graphs and outperforms state of the art algorithms both in quality (containment of epidemic and efficiency (runtime and space complexity.
Semigroup methods for evolution equations on networks
Mugnolo, Delio
2014-01-01
This concise text is based on a series of lectures held only a few years ago and originally intended as an introduction to known results on linear hyperbolic and parabolic equations. Yet the topic of differential equations on graphs, ramified spaces, and more general network-like objects has recently gained significant momentum and, well beyond the confines of mathematics, there is a lively interdisciplinary discourse on all aspects of so-called complex networks. Such network-like structures can be found in virtually all branches of science, engineering and the humanities, and future research thus calls for solid theoretical foundations. This book is specifically devoted to the study of evolution equations – i.e., of time-dependent differential equations such as the heat equation, the wave equation, or the Schrödinger equation (quantum graphs) – bearing in mind that the majority of the literature in the last ten years on the subject of differential equations of graphs has been devoted to ellip...
Model and simulation of Krause model in dynamic open network
Zhu, Meixia; Xie, Guangqiang
2017-08-01
The construction of the concept of evolution is an effective way to reveal the formation of group consensus. This study is based on the modeling paradigm of the HK model (Hegsekmann-Krause). This paper analyzes the evolution of multi - agent opinion in dynamic open networks with member mobility. The results of the simulation show that when the number of agents is constant, the interval distribution of the initial distribution will affect the number of the final view, The greater the distribution of opinions, the more the number of views formed eventually; The trust threshold has a decisive effect on the number of views, and there is a negative correlation between the trust threshold and the number of opinions clusters. The higher the connectivity of the initial activity group, the more easily the subjective opinion in the evolution of opinion to achieve rapid convergence. The more open the network is more conducive to the unity of view, increase and reduce the number of agents will not affect the consistency of the group effect, but not conducive to stability.
Rolls, David A.; Wang, Peng; McBryde, Emma; Pattison, Philippa; Robins, Garry
2015-01-01
We compare two broad types of empirically grounded random network models in terms of their abilities to capture both network features and simulated Susceptible-Infected-Recovered (SIR) epidemic dynamics. The types of network models are exponential random graph models (ERGMs) and extensions of the configuration model. We use three kinds of empirical contact networks, chosen to provide both variety and realistic patterns of human contact: a highly clustered network, a bipartite network and a snowball sampled network of a “hidden population”. In the case of the snowball sampled network we present a novel method for fitting an edge-triangle model. In our results, ERGMs consistently capture clustering as well or better than configuration-type models, but the latter models better capture the node degree distribution. Despite the additional computational requirements to fit ERGMs to empirical networks, the use of ERGMs provides only a slight improvement in the ability of the models to recreate epidemic features of the empirical network in simulated SIR epidemics. Generally, SIR epidemic results from using configuration-type models fall between those from a random network model (i.e., an Erdős-Rényi model) and an ERGM. The addition of subgraphs of size four to edge-triangle type models does improve agreement with the empirical network for smaller densities in clustered networks. Additional subgraphs do not make a noticeable difference in our example, although we would expect the ability to model cliques to be helpful for contact networks exhibiting household structure. PMID:26555701
A Network Traffic Generator Model for Fast Network-on-Chip Simulation
DEFF Research Database (Denmark)
Mahadevan, Shankar; Angiolini, Frederico; Storgaard, Michael
2005-01-01
and effective Network-on-Chip (NoC) development and debugging environment. By capturing the type and the timestamp of communication events at the boundary of an IP core in a reference environment, the TG can subsequently emulate the core's communication behavior in different environments. Access patterns......For Systems-on-Chip (SoCs) development, a predominant part of the design time is the simulation time. Performance evaluation and design space exploration of such systems in bit- and cycle-true fashion is becoming prohibitive. We propose a traffic generation (TG) model that provides a fast...
Network Traffic Generator Model for Fast Network-on-Chip Simulation
DEFF Research Database (Denmark)
Mahadevan, Shankar; Ang, Frederico; Olsen, Rasmus G.
2008-01-01
and effective Network-on-Chip (NoC) development and debugging environment. By capturing the type and the timestamp of communication events at the boundary of an IP core in a reference environment, the TG can subsequently emulate the core's communication behavior in different environments. Access patterns......For Systems-on-Chip (SoCs) development, a predominant part of the design time is the simulation time. Performance evaluation and design space exploration of such systems in bit- and cycle-true fashion is becoming prohibitive. We propose a traffic generation (TG) model that provides a fast...
Brochado, Ana Rita; Andrejev, Sergej; Maranas, Costas D.; Patil, Kiran R.
2012-01-01
Genome-scale metabolic networks provide a comprehensive structural framework for modeling genotype-phenotype relationships through flux simulations. The solution space for the metabolic flux state of the cell is typically very large and optimization-based approaches are often necessary for predicting the active metabolic state under specific environmental conditions. The objective function to be used in such optimization algorithms is directly linked with the biological hypothesis underlying the model and therefore it is one of the most relevant parameters for successful modeling. Although linear combination of selected fluxes is widely used for formulating metabolic objective functions, we show that the resulting optimization problem is sensitive towards stoichiometry representation of the metabolic network. This undesirable sensitivity leads to different simulation results when using numerically different but biochemically equivalent stoichiometry representations and thereby makes biological interpretation intrinsically subjective and ambiguous. We hereby propose a new method, Minimization of Metabolites Balance (MiMBl), which decouples the artifacts of stoichiometry representation from the formulation of the desired objective functions, by casting objective functions using metabolite turnovers rather than fluxes. By simulating perturbed metabolic networks, we demonstrate that the use of stoichiometry representation independent algorithms is fundamental for unambiguously linking modeling results with biological interpretation. For example, MiMBl allowed us to expand the scope of metabolic modeling in elucidating the mechanistic basis of several genetic interactions in Saccharomyces cerevisiae. PMID:23133362
Simulation technologies in networking and communications selecting the best tool for the test
Pathan, Al-Sakib Khan; Khan, Shafiullah
2014-01-01
Simulation is a widely used mechanism for validating the theoretical models of networking and communication systems. Although the claims made based on simulations are considered to be reliable, how reliable they really are is best determined with real-world implementation trials.Simulation Technologies in Networking and Communications: Selecting the Best Tool for the Test addresses the spectrum of issues regarding the different mechanisms related to simulation technologies in networking and communications fields. Focusing on the practice of simulation testing instead of the theory, it presents
Using elements of game engine architecture to simulate sensor networks for eldercare.
Godsey, Chad; Skubic, Marjorie
2009-01-01
When dealing with a real time sensor network, building test data with a known ground truth is a tedious and cumbersome task. In order to quickly build test data for such a network, a simulation solution is a viable option. Simulation environments have a close relationship with computer game environments, and therefore there is much to be learned from game engine design. In this paper, we present our vision for a simulated in-home sensor network and describe ongoing work on using elements of game engines for building the simulator. Validation results are included to show agreement on motion sensor simulation with the physical environment.
Diagrammatic perturbation methods in networks and sports ranking combinatorics
Park, Juyong
2010-04-01
Analytic and computational tools developed in statistical physics are being increasingly applied to the study of complex networks. Here we present recent developments in the diagrammatic perturbation methods for the exponential random graph models, and apply them to the combinatoric problem of determining the ranking of nodes in directed networks that represent pairwise competitions.
Simulation of complex fracture networks influenced by natural fractures in shale gas reservoir
Directory of Open Access Journals (Sweden)
Zhao Jinzhou
2014-10-01
Full Text Available When hydraulic fractures intersect with natural fractures, the geometry and complexity of a fracture network are determined by the initiation and propagation pattern which is affected by a number of factors. Based on the fracture mechanics, the criterion for initiation and propagation of a fracture was introduced to analyze the tendency of a propagating angle and factors affecting propagating pressure. On this basis, a mathematic model with a complex fracture network was established to investigate how the fracture network form changes with different parameters, including rock mechanics, in-situ stress distribution, fracture properties, and frac treatment parameters. The solving process of this model was accelerated by classifying the calculation nodes on the extending direction of the fracture by equal pressure gradients, and solving the geometrical parameters prior to the iteration fitting flow distribution. With the initiation and propagation criterion as the bases for the propagation of branch fractures, this method decreased the iteration times through eliminating the fitting of the fracture length in conventional 3D fracture simulation. The simulation results indicated that the formation with abundant natural fractures and smaller in-situ stress difference is sufficient conditions for fracture network development. If the pressure in the hydraulic fractures can be kept at a high level by temporary sealing or diversion, the branch fractures will propagate further with minor curvature radius, thus enlarging the reservoir stimulation area. The simulated shape of fracture network can be well matched with the field microseismic mapping in data point range and distribution density, validating the accuracy of this model.
Directory of Open Access Journals (Sweden)
Mark S. Handcock
2007-12-01
Full Text Available statnet is a suite of software packages for statistical network analysis. The packages implement recent advances in network modeling based on exponential-family random graph models (ERGM. The components of the package provide a comprehensive framework for ERGM-based network modeling, including tools for model estimation, model evaluation, model-based network simulation, and network visualization. This broad functionality is powered by a central Markov chain Monte Carlo (MCMC algorithm. The coding is optimized for speed and robustness.
A method for ensemble wildland fire simulation
Mark A. Finney; Isaac C. Grenfell; Charles W. McHugh; Robert C. Seli; Diane Trethewey; Richard D. Stratton; Stuart Brittain
2011-01-01
An ensemble simulation system that accounts for uncertainty in long-range weather conditions and two-dimensional wildland fire spread is described. Fuel moisture is expressed based on the energy release component, a US fire danger rating index, and its variation throughout the fire season is modeled using time series analysis of historical weather data. This analysis...
Connectivity-consistent mapping method for 2-D discrete fracture networks
Roubinet, Delphine; de Dreuzy, Jean-Raynald; Davy, Philippe
2010-07-01
We present a new flow computation method in 2-D discrete fracture networks (DFN) intermediary between the classical DFN flow simulation method and the projection onto continuous grids. The method divides the simulation complexity by solving for flows successively at a local mesh scale and at the global domain scale. At the local mesh scale, flows are determined by classical DFN flow simulations and approximated by an equivalent hydraulic matrix (EHM) relating heads and flow rates discretized on the mesh borders. Assembling the equivalent hydraulic matrices provides for a domain-scale discretization of the flow equation. The equivalent hydraulic matrices transfer the connectivity and flow structure complexities from the local mesh scale to the domain scale. Compared to existing geometrical mapping or equivalent tensor methods, the EHM method broadens the simulation range of flow to all types of 2-D fracture networks both below and above the representative elementary volume (REV). Additional computation linked to the derivation of the local mesh-scale equivalent hydraulic matrices increases the accuracy and reliability of the method. Compared to DFN methods, the EHM method first provides a simpler domain-scale alternative permeability model. Second, it enhances the simulation capacities to larger fracture networks where flow discretization on the DFN structure yields system sizes too large to be solved using the most advanced multigrid and multifrontal methods. We show that the EHM method continuously moves from the DFN method to the tensor representation as a function of the local mesh-scale discretization. The balance between accuracy and model simplification can be optimally controlled by adjusting the domain-scale and local mesh-scale discretizations.
Designing laboratory wind simulations using artificial neural networks
Križan, Josip; Gašparac, Goran; Kozmar, Hrvoje; Antonić, Oleg; Grisogono, Branko
2015-05-01
While experiments in boundary layer wind tunnels remain to be a major research tool in wind engineering and environmental aerodynamics, designing the modeling hardware required for a proper atmospheric boundary layer (ABL) simulation can be costly and time consuming. Hence, possibilities are sought to speed-up this process and make it more time-efficient. In this study, two artificial neural networks (ANNs) are developed to determine an optimal design of the Counihan hardware, i.e., castellated barrier wall, vortex generators, and surface roughness, in order to simulate the ABL flow developing above urban, suburban, and rural terrains, as previous ANN models were created for one terrain type only. A standard procedure is used in developing those two ANNs in order to further enhance best-practice possibilities rather than to improve existing ANN designing methodology. In total, experimental results obtained using 23 different hardware setups are used when creating ANNs. In those tests, basic barrier height, barrier castellation height, spacing density, and height of surface roughness elements are the parameters that were varied to create satisfactory ABL simulations. The first ANN was used for the estimation of mean wind velocity, turbulent Reynolds stress, turbulence intensity, and length scales, while the second one was used for the estimation of the power spectral density of velocity fluctuations. This extensive set of studied flow and turbulence parameters is unmatched in comparison to the previous relevant studies, as it includes here turbulence intensity and power spectral density of velocity fluctuations in all three directions, as well as the Reynolds stress profiles and turbulence length scales. Modeling results agree well with experiments for all terrain types, particularly in the lower ABL within the height range of the most engineering structures, while exhibiting sensitivity to abrupt changes and data scattering in profiles of wind-tunnel results. The
The Virtual Brain: a simulator of primate brain network dynamics.
Sanz Leon, Paula; Knock, Stuart A; Woodman, M Marmaduke; Domide, Lia; Mersmann, Jochen; McIntosh, Anthony R; Jirsa, Viktor
2013-01-01
We present The Virtual Brain (TVB), a neuroinformatics platform for full brain network simulations using biologically realistic connectivity. This simulation environment enables the model-based inference of neurophysiological mechanisms across different brain scales that underlie the generation of macroscopic neuroimaging signals including functional MRI (fMRI), EEG and MEG. Researchers from different backgrounds can benefit from an integrative software platform including a supporting framework for data management (generation, organization, storage, integration and sharing) and a simulation core written in Python. TVB allows the reproduction and evaluation of personalized configurations of the brain by using individual subject data. This personalization facilitates an exploration of the consequences of pathological changes in the system, permitting to investigate potential ways to counteract such unfavorable processes. The architecture of TVB supports interaction with MATLAB packages, for example, the well known Brain Connectivity Toolbox. TVB can be used in a client-server configuration, such that it can be remotely accessed through the Internet thanks to its web-based HTML5, JS, and WebGL graphical user interface. TVB is also accessible as a standalone cross-platform Python library and application, and users can interact with the scientific core through the scripting interface IDLE, enabling easy modeling, development and debugging of the scientific kernel. This second interface makes TVB extensible by combining it with other libraries and modules developed by the Python scientific community. In this article, we describe the theoretical background and foundations that led to the development of TVB, the architecture and features of its major software components as well as potential neuroscience applications.
Li, Ming; Huang, Xiaobo; Kang, Zhan
2015-08-01
Hydrogen is clean, sustainable, and renewable, thus is viewed as promising energy carrier. However, its industrial utilization is greatly hampered by the lack of effective hydrogen storage and release method. Carbon nanotubes (CNTs) were viewed as one of the potential hydrogen containers, but it has been proved that pure CNTs cannot attain the desired target capacity of hydrogen storage. In this paper, we present a numerical study on the material-driven and structure-driven hydrogen adsorption of 3D silicon networks and propose a deformation-driven hydrogen desorption approach based on molecular simulations. Two types of 3D nanostructures, silicon nanotube-network (Si-NN) and silicon film-network (Si-FN), are first investigated in terms of hydrogen adsorption and desorption capacity with grand canonical Monte Carlo simulations. It is revealed that the hydrogen storage capacity is determined by the lithium doping ratio and geometrical parameters, and the maximum hydrogen uptake can be achieved by a 3D nanostructure with optimal configuration and doping ratio obtained through design optimization technique. For hydrogen desorption, a mechanical-deformation-driven-hydrogen-release approach is proposed. Compared with temperature/pressure change-induced hydrogen desorption method, the proposed approach is so effective that nearly complete hydrogen desorption can be achieved by Si-FN nanostructures under sufficient compression but without structural failure observed. The approach is also reversible since the mechanical deformation in Si-FN nanostructures can be elastically recovered, which suggests a good reusability. This study may shed light on the mechanism of hydrogen adsorption and desorption and thus provide useful guidance toward engineering design of microstructural hydrogen (or other gas) adsorption materials.
Decision support systems and methods for complex networks
Huang, Zhenyu [Richland, WA; Wong, Pak Chung [Richland, WA; Ma, Jian [Richland, WA; Mackey, Patrick S [Richland, WA; Chen, Yousu [Richland, WA; Schneider, Kevin P [Seattle, WA
2012-02-28
Methods and systems for automated decision support in analyzing operation data from a complex network. Embodiments of the present invention utilize these algorithms and techniques not only to characterize the past and present condition of a complex network, but also to predict future conditions to help operators anticipate deteriorating and/or problem situations. In particular, embodiments of the present invention characterize network conditions from operation data using a state estimator. Contingency scenarios can then be generated based on those network conditions. For at least a portion of all of the contingency scenarios, risk indices are determined that describe the potential impact of each of those scenarios. Contingency scenarios with risk indices are presented visually as graphical representations in the context of a visual representation of the complex network. Analysis of the historical risk indices based on the graphical representations can then provide trends that allow for prediction of future network conditions.
Network Forensics Method Based on Evidence Graph and Vulnerability Reasoning
Directory of Open Access Journals (Sweden)
Jingsha He
2016-11-01
Full Text Available As the Internet becomes larger in scale, more complex in structure and more diversified in traffic, the number of crimes that utilize computer technologies is also increasing at a phenomenal rate. To react to the increasing number of computer crimes, the field of computer and network forensics has emerged. The general purpose of network forensics is to find malicious users or activities by gathering and dissecting firm evidences about computer crimes, e.g., hacking. However, due to the large volume of Internet traffic, not all the traffic captured and analyzed is valuable for investigation or confirmation. After analyzing some existing network forensics methods to identify common shortcomings, we propose in this paper a new network forensics method that uses a combination of network vulnerability and network evidence graph. In our proposed method, we use vulnerability evidence and reasoning algorithm to reconstruct attack scenarios and then backtrack the network packets to find the original evidences. Our proposed method can reconstruct attack scenarios effectively and then identify multi-staged attacks through evidential reasoning. Results of experiments show that the evidence graph constructed using our method is more complete and credible while possessing the reasoning capability.
Semantic Security Methods for Software-Defined Networks
Directory of Open Access Journals (Sweden)
Ekaterina Ju. Antoshina
2017-01-01
Full Text Available Software-defined networking is a promising technology for constructing communication networks where the network management is the software that configures network devices. This contrasts with the traditional point of view where the network behaviour is updated by manual configuration uploading to devices under control. The software controller allows dynamic routing configuration inside the net depending on the quality of service. However, there must be a proof that ensures that every network flow is secure, for example, we can define security policy as follows: confidential nodes can not send data to the public segment of the network. The paper shows how this problem can be solved by using a semantic security model. We propose a method that allows us to construct semantics that captures necessary security properties the network must follow. This involves the specification that states allowed and forbidden network flows. The specification is then modeled as a decision tree that may be reduced. We use the decision tree for semantic construction that captures security requirements. The semantic can be implemented as a module of the controller software so the correctness of the control plane of the network can be ensured on-the-fly.
Wang, Lei; Fan, Youping; Zhang, Dai; Ge, Mengxin; Zou, Xianbin; Li, Jingjiao
2017-09-01
This paper proposes a method to simulate a back-to-back modular multilevel converter (MMC) HVDC transmission system. In this paper we utilize an equivalent networks to simulate the dynamic power system. Moreover, to account for the performance of converter station, core components of model of the converter station gives a basic model of simulation. The proposed method is applied to an equivalent real power system.
Simulating biofilm deformation and detachment with the immersed boundary method
Sudarsan, Rangarajan; Stockie, John M; Eberl, Hermann J
2015-01-01
We apply the immersed boundary (or IB) method to simulate deformation and detachment of a periodic array of wall-bounded biofilm colonies in response to a linear shear flow. The biofilm material is represented as a network of Hookean springs that are placed along the edges of a triangulation of the biofilm region. The interfacial shear stress, lift and drag forces acting on the biofilm colony are computed by using fluid stress jump method developed by Williams, Fauci and Gaver [Disc. Contin. Dyn. Sys. B 11(2):519-540, 2009], with a modified version of their exclusion filter. Our detachment criterion is based on the novel concept of an averaged equivalent continuum stress tensor defined at each IB point in the biofilm which is then used to determine a corresponding von Mises yield stress; wherever this yield stress exceeds a given critical threshold the connections to that node are severed, thereby signalling the onset of a detachment event. In order to capture the deformation and detachment behaviour of a bio...
Chao, Zenas C.; Bakkum, Douglas J.; Potter, Steve M.
2007-09-01
Electrically interfaced cortical networks cultured in vitro can be used as a model for studying the network mechanisms of learning and memory. Lasting changes in functional connectivity have been difficult to detect with extracellular multi-electrode arrays using standard firing rate statistics. We used both simulated and living networks to compare the ability of various statistics to quantify functional plasticity at the network level. Using a simulated integrate-and-fire neural network, we compared five established statistical methods to one of our own design, called center of activity trajectory (CAT). CAT, which depicts dynamics of the location-weighted average of spatiotemporal patterns of action potentials across the physical space of the neuronal circuitry, was the most sensitive statistic for detecting tetanus-induced plasticity in both simulated and living networks. By reducing the dimensionality of multi-unit data while still including spatial information, CAT allows efficient real-time computation of spatiotemporal activity patterns. Thus, CAT will be useful for studies in vivo or in vitro in which the locations of recording sites on multi-electrode probes are important.
A model reduction method for biochemical reaction networks
National Research Council Canada - National Science Library
Rao, Shodhan; van der Schaft, Arjan; van Eunen, Karen; Bakker, Barbara; Jayawardhana, Bayu
2014-01-01
Background: In this paper we propose a model reduction method for biochemical reaction networks governed by a variety of reversible and irreversible enzyme kinetic rate laws, including reversible Michaelis-Menten and Hill kinetics...
Interactive methods for exploring particle simulation data
Energy Technology Data Exchange (ETDEWEB)
Co, Christopher S.; Friedman, Alex; Grote, David P.; Vay, Jean-Luc; Bethel, E. Wes; Joy, Kenneth I.
2004-05-01
In this work, we visualize high-dimensional particle simulation data using a suite of scatter plot-based visualizations coupled with interactive selection tools. We use traditional 2D and 3D projection scatter plots as well as a novel oriented disk rendering style to convey various information about the data. Interactive selection tools allow physicists to manually classify ''interesting'' sets of particles that are highlighted across multiple, linked views of the data. The power of our application is the ability to correspond new visual representations of the simulation data with traditional, well understood visualizations. This approach supports the interactive exploration of the high-dimensional space while promoting discovery of new particle behavior.
Hospital Registration Process Reengineering Using Simulation Method
Directory of Open Access Journals (Sweden)
Qiang Su
2010-01-01
Full Text Available With increasing competition, many healthcare organizations have undergone tremendous reform in the last decade aiming to increase efficiency, decrease waste, and reshape the way that care is delivered. This study focuses on the operational efficiency improvement of hospital’s registration process. The operational efficiency related factors including the service process, queue strategy, and queue parameters were explored systematically and illustrated with a case study. Guided by the principle of business process reengineering (BPR, a simulation approach was employed for process redesign and performance optimization. As a result, the queue strategy is changed from multiple queues and multiple servers to single queue and multiple servers with a prepare queue. Furthermore, through a series of simulation experiments, the length of the prepare queue and the corresponding registration process efficiency was quantitatively evaluated and optimized.
Approximate Subgradient Methods for Lagrangian Relaxations on Networks
Mijangos, Eugenio
Nonlinear network flow problems with linear/nonlinear side con- straints can be solved by means of Lagrangian relaxations. The dual problem is the maximization of a dual function whose value is estimated by minimizing approximately a Lagrangian function on the set defined by the network constraints. We study alternative stepsizes in the approximate subgradient methods to solve the dual problem. Some basic convergence results are put forward. Moreover, we compare the quality of the computed solutions and the efficiency of these methods.
A Selection Method for Pipe Network Boosting Plans
Qiu, Weiwei; Li, Mengyao; Weng, Haoyang
2017-12-01
Based on the fuzzy mathematics theory, a multi-objective fuzzy comprehensive evaluation method used for selection of pipe network boosting plans was proposed by computing relative membership matrix and weight vector for indexes. The example results show that the multi-objective fuzzy comprehensive evaluation method combining the indexes and the fuzzy relationship between them is suited to realities and can provide reference for decision of pipe network boosting plan.
Directory of Open Access Journals (Sweden)
О.С. Якушенко
2010-01-01
Full Text Available The article is devoted to the problem of gas turbine engine (GTE technical state class automatic recognition with operation parameters by neuron networks. The one of main problems for creation the neuron networks is determination of their optimal structures size (amount of layers in network and count of neurons in each layer.The method of neuron network size optimization intended for classification of GTE technical state is considered in the article. Optimization is cared out with taking into account of overlearning effect possibility when a learning network loses property of generalization and begins strictly describing educational data set. To determinate a moment when overlearning effect is appeared in learning neuron network the method of three data sets is used. The method is based on the comparison of recognition quality parameters changes which were calculated during recognition of educational and control data sets. As the moment when network overlearning effect is appeared the moment when control data set recognition quality begins deteriorating but educational data set recognition quality continues still improving is used. To determinate this moment learning process periodically is terminated and simulation of network with education and control data sets is fulfilled. The optimization of two-, three- and four-layer networks is conducted and some results of optimization are shown. Also the extended educational set is created and shown. The set describes 16 GTE technical state classes and each class is represented with 200 points (200 possible technical state class realizations instead of 20 points using in the former articles. It was done to increase representativeness of data set.In the article the algorithm of optimization is considered and some results which were obtained with it are shown. The results of experiments were analyzed to determinate most optimal neuron network structure. This structure provides most high-quality GTE
The Method of Leader’s Overthrow in Networks
Belik, Ivan; Jörnsten, Kurt
2016-01-01
Methods for leader’s detection and overthrow in networks are useful tools for decision-making in many real-life cases, such as criminal networks with hidden patterns or money laundering networks. In the given research, we represent the algorithms that detect and overthrow the most influential node to the weaker positions following the greedy method in terms of structural modifications. We employed the concept of Shapley value from the area of cooperative games to measure a node’s leadership a...
Yu, Bin; Xu, Jia-Meng; Li, Shan; Chen, Cheng; Chen, Rui-Xin; Wang, Lei; Zhang, Yan; Wang, Ming-Hui
2017-10-06
Gene regulatory networks (GRNs) research reveals complex life phenomena from the perspective of gene interaction, which is an important research field in systems biology. Traditional Bayesian networks have a high computational complexity, and the network structure scoring model has a single feature. Information-based approaches cannot identify the direction of regulation. In order to make up for the shortcomings of the above methods, this paper presents a novel hybrid learning method (DBNCS) based on dynamic Bayesian network (DBN) to construct the multiple time-delayed GRNs for the first time, combining the comprehensive score (CS) with the DBN model. DBNCS algorithm first uses CMI2NI (conditional mutual inclusive information-based network inference) algorithm for network structure profiles learning, namely the construction of search space. Then the redundant regulations are removed by using the recursive optimization algorithm (RO), thereby reduce the false positive rate. Secondly, the network structure profiles are decomposed into a set of cliques without loss, which can significantly reduce the computational complexity. Finally, DBN model is used to identify the direction of gene regulation within the cliques and search for the optimal network structure. The performance of DBNCS algorithm is evaluated by the benchmark GRN datasets from DREAM challenge as well as the SOS DNA repair network in Escherichia coli, and compared with other state-of-the-art methods. The experimental results show the rationality of the algorithm design and the outstanding performance of the GRNs.
Study on Negative Resistance Mechanism and Elimination Method of Network Simplification
Zhu, Lin; Fu, Dong; Sheng, Qiliang; Wang, Bei; Hu, Xinge
2017-05-01
The key of the further development of power system dynamic equivalence study is that correct understanding of negative resistance mechanism in network simplification and how to get rid of negative resistance. This paper analyzes the network simplification of power system, and it thoroughly studies the mechanism of equivalent branches with negative resistance. This paper also leads the definition of the constant impedance load and studies the property and the size of constant impedance load to further explain the mechanism of negative resistance production. This paper proposes a network transformation method which is based on power flow calculation results. This method transforms series branches which include negative resistance into PI-type branches. Finally the validity of this method is verified in sample cases from the China Southern Power Grid and IEEE 39 bus system. This method also solves the problem that some simulation software can’t model the branches with negative resistance.
A Grooming Nodes Optimal Allocation Method for Multicast in WDM Networks
Directory of Open Access Journals (Sweden)
Chengying Wei
2016-01-01
Full Text Available The grooming node has the capability of grooming multicast traffic with the small granularity into established light at high cost of complexity and node architecture. In the paper, a grooming nodes optimal allocation (GNOA method is proposed to optimize the allocation of the grooming nodes constraint by the blocking probability for multicast traffic in sparse WDM networks. In the proposed GNOA method, the location of each grooming node is determined by the SCLD strategy. The improved smallest cost largest degree (SCLD strategy is designed to select the nongrooming nodes in the proposed GNOA method. The simulation results show that the proposed GNOA method can reduce the required number of grooming nodes and decrease the cost of constructing a network to guarantee a certain request blocking probability when the wavelengths per fiber and transmitter/receiver ports per node are sufficient for the optical multicast in WDM networks.
Behler, Jörg
2017-10-09
Modern simulation techniques have reached a level of maturity which allows a wide range of problems in chemistry and materials science to be addressed. Unfortunately, the application of first principles methods with predictive power is still limited to rather small systems, and despite the rapid evolution of computer hardware no fundamental change in this situation can be expected. Consequently, the development of more efficient but equally reliable atomistic potentials to reach an atomic level understanding of complex systems has received considerable attention in recent years. A promising new development has been the introduction of machine learning (ML) methods to describe the atomic interactions. Once trained with electronic structure data, ML potentials can accelerate computer simulations by several orders of magnitude, while preserving quantum mechanical accuracy. This Review considers the methodology of an important class of ML potentials that employs artificial neural networks. © 2017 Wiley-VCH Verlag GmbH & Co. KGaA, Weinheim.
Implicit methods for qualitative modeling of gene regulatory networks.
Garg, Abhishek; Mohanram, Kartik; De Micheli, Giovanni; Xenarios, Ioannis
2012-01-01
Advancements in high-throughput technologies to measure increasingly complex biological phenomena at the genomic level are rapidly changing the face of biological research from the single-gene single-protein experimental approach to studying the behavior of a gene in the context of the entire genome (and proteome). This shift in research methodologies has resulted in a new field of network biology that deals with modeling cellular behavior in terms of network structures such as signaling pathways and gene regulatory networks. In these networks, different biological entities such as genes, proteins, and metabolites interact with each other, giving rise to a dynamical system. Even though there exists a mature field of dynamical systems theory to model such network structures, some technical challenges are unique to biology such as the inability to measure precise kinetic information on gene-gene or gene-protein interactions and the need to model increasingly large networks comprising thousands of nodes. These challenges have renewed interest in developing new computational techniques for modeling complex biological systems. This chapter presents a modeling framework based on Boolean algebra and finite-state machines that are reminiscent of the approach used for digital circuit synthesis and simulation in the field of very-large-scale integration (VLSI). The proposed formalism enables a common mathematical framework to develop computational techniques for modeling different aspects of the regulatory networks such as steady-state behavior, stochasticity, and gene perturbation experiments.
TreePM Method for Two-Dimensional Cosmological Simulations
Indian Academy of Sciences (India)
TreePM Method for Two-Dimensional Cosmological Simulations. Suryadeep Ray ... Keywords. Gravitation; methods: numerical; cosmology: large scale structure of the universe. ... The 2d TreePM code is an accurate and efficient technique to carry out large two-dimensional N-body simulations in cosmology. This hybrid ...
Simulation of tunneling construction methods of the Cisumdawu toll road
Abduh, Muhamad; Sukardi, Sapto Nugroho; Ola, Muhammad Rusdian La; Ariesty, Anita; Wirahadikusumah, Reini D.
2017-11-01
Simulation can be used as a tool for planning and analysis of a construction method. Using simulation technique, a contractor could design optimally resources associated with a construction method and compare to other methods based on several criteria, such as productivity, waste, and cost. This paper discusses the use of simulation using Norwegian Method of Tunneling (NMT) for a 472-meter tunneling work in the Cisumdawu Toll Road project. Primary and secondary data were collected to provide useful information for simulation as well as problems that may be faced by the contractor. The method was modelled using the CYCLONE and then simulated using the WebCYCLONE. The simulation could show the duration of the project from the duration model of each work tasks which based on literature review, machine productivity, and several assumptions. The results of simulation could also show the total cost of the project that was modeled based on journal construction & building unit cost and online websites of local and international suppliers. The analysis of the advantages and disadvantages of the method was conducted based on its, wastes, and cost. The simulation concluded the total cost of this operation is about Rp. 900,437,004,599 and the total duration of the tunneling operation is 653 days. The results of the simulation will be used for a recommendation to the contractor before the implementation of the already selected tunneling operation.
Math-Based Simulation Tools and Methods
National Research Council Canada - National Science Library
Arepally, Sudhakar
2007-01-01
...: HMMWV 30-mph Rollover Test, Soldier Gear Effects, Occupant Performance in Blast Effects, Anthropomorphic Test Device, Human Models, Rigid Body Modeling, Finite Element Methods, Injury Criteria...
Unified Approach to Modeling and Simulation of Space Communication Networks and Systems
Barritt, Brian; Bhasin, Kul; Eddy, Wesley; Matthews, Seth
2010-01-01
Network simulator software tools are often used to model the behaviors and interactions of applications, protocols, packets, and data links in terrestrial communication networks. Other software tools that model the physics, orbital dynamics, and RF characteristics of space systems have matured to allow for rapid, detailed analysis of space communication links. However, the absence of a unified toolset that integrates the two modeling approaches has encumbered the systems engineers tasked with the design, architecture, and analysis of complex space communication networks and systems. This paper presents the unified approach and describes the motivation, challenges, and our solution - the customization of the network simulator to integrate with astronautical analysis software tools for high-fidelity end-to-end simulation. Keywords space; communication; systems; networking; simulation; modeling; QualNet; STK; integration; space networks
Protocol independent transmission method in software defined optical network
Liu, Yuze; Li, Hui; Hou, Yanfang; Qiu, Yajun; Ji, Yuefeng
2016-10-01
With the development of big data and cloud computing technology, the traditional software-defined network is facing new challenges (e.i., ubiquitous accessibility, higher bandwidth, more flexible management and greater security). Using a proprietary protocol or encoding format is a way to improve information security. However, the flow, which carried by proprietary protocol or code, cannot go through the traditional IP network. In addition, ultra- high-definition video transmission service once again become a hot spot. Traditionally, in the IP network, the Serial Digital Interface (SDI) signal must be compressed. This approach offers additional advantages but also bring some disadvantages such as signal degradation and high latency. To some extent, HD-SDI can also be regard as a proprietary protocol, which need transparent transmission such as optical channel. However, traditional optical networks cannot support flexible traffics . In response to aforementioned challenges for future network, one immediate solution would be to use NFV technology to abstract the network infrastructure and provide an all-optical switching topology graph for the SDN control plane. This paper proposes a new service-based software defined optical network architecture, including an infrastructure layer, a virtualization layer, a service abstract layer and an application layer. We then dwell on the corresponding service providing method in order to implement the protocol-independent transport. Finally, we experimentally evaluate that proposed service providing method can be applied to transmit the HD-SDI signal in the software-defined optical network.
Zhang, Jingjing; Skryabin, Maxim; Song, Xiongwei
2016-01-01
This study attempts to make inferences about the mechanisms that drive network change over time. It adopts simulation investigation for empirical network analysis to examine the patterns and evolution of relationships formed in the context of a massive open online course (MOOC) discussion forum. Four network effects--"homophily,"…
Linking Simulation with Formal Verification and Modeling of Wireless Sensor Network in TLA+
Martyna, Jerzy
In this paper, we present the results of the simulation of a wireless sensor network based on the flooding technique and SPIN protocols. The wireless sensor network was specified and verified by means of the TLA+ specification language [1]. For a model of wireless sensor network built this way simulation was carried with the help of specially constructed software tools. The obtained results allow us to predict the behaviour of the wireless sensor network in various topologies and spatial densities. Visualization of the output data enable precise examination of some phenomenas in wireless sensor networks, such as a hidden terminal, etc.
Electromagnetic field computation by network methods
Felsen, Leopold B; Russer, Peter
2009-01-01
This monograph proposes a systematic and rigorous treatment of electromagnetic field representations in complex structures. The book presents new strong models by combining important computational methods. This is the last book of the late Leopold Felsen.
Adaptation Methods in Mobile Communication Networks
National Research Council Canada - National Science Library
Vladimir Wieser
2003-01-01
Adaptation methods are the main tool for transmission rate maximization through the mobile channel and today the great attention is directed to them not only in theoretical domain but in standardization process, too...
Adaptation Methods in Mobile Communication Networks
National Research Council Canada - National Science Library
Vladimir Wieser
2003-01-01
Adaptation methods are the main tool for transmission rate maximization through the mobile channel and today the great attention is directed to them not only in theoretical domain but in standardization process, too...
Modelling Altitude Information in Two-Dimensional Traffic Networks for Electric Mobility Simulation
Directory of Open Access Journals (Sweden)
Diogo Santos
2016-06-01
Full Text Available Elevation data is important for electric vehicle simulation. However, traffic simulators are often two-dimensional and do not offer the capability of modelling urban networks taking elevation into account. Specifically, SUMO - Simulation of Urban Mobility, a popular microscopic traffic simulator, relies on networks previously modelled with elevation data as to provide this information during simulations. This work tackles the problem of adding elevation data to urban network models - particularly for the case of the Porto urban network, in Portugal. With this goal in mind, a comparison between different altitude information retrieval approaches is made and a simple tool to annotate network models with altitude data is proposed. The work starts by describing the methodological approach followed during research and development, then describing and analysing its main findings. This description includes an in-depth explanation of the proposed tool. Lastly, this work reviews some related work to the subject.
Iype, E; Esteves, A C C; de With, G
2016-06-14
Polyurethane (PU) cross-linked networks are frequently used in biomedical and marine applications, e.g., as hydrophilic polymer coatings with antifouling or low-friction properties and have been reported to exhibit characteristic phase separation between soft and hard segments. Understanding this phase-separation behavior is critical to design novel hydrophilic polymer coatings. However, most of the studies on the structure and morphology of cross-linked coatings are experimental, which only assess the phase separation via indirect methods. Herein we present a mesoscopic simulation study of the network characteristics of model hydrophilic polymer networks, consisting of PU with and without methyl-polyethylene glycol (mPEG) dangling chains. The systems are analyzed using a number of tools, such as the radial distribution function, the cross-link point density distribution and the Voronoi volume distribution (of the cross-linking points). The combined results show that the cross-linked networks without dangling chains are rather homogeneous but contain a small amount of clustering of cross-linker molecules. A clear phase separation is observed when introducing the dangling chains. In spite of that, the amount of cross-linker molecules connected to dangling chains only, i.e., not connected to the main network, is relatively small, leading to about 3 wt% extractables. Thus, these cross-linked polymers consist of a phase-separated, yet highly connected network. This study provides valuable guidelines towards new self-healing hydrophilic coatings based on the molecular design of cross-linked networks in direct contact with water or aqueous fluids, e.g., as anti-fouling self-repairing coatings for marine applications.
Graph methods for the investigation of metabolic networks in parasitology.
Cottret, Ludovic; Jourdan, Fabien
2010-08-01
Recently, a way was opened with the development of many mathematical methods to model and analyze genome-scale metabolic networks. Among them, methods based on graph models enable to us quickly perform large-scale analyses on large metabolic networks. However, it could be difficult for parasitologists to select the graph model and methods adapted to their biological questions. In this review, after briefly addressing the problem of the metabolic network reconstruction, we propose an overview of the graph-based approaches used in whole metabolic network analyses. Applications highlight the usefulness of this kind of approach in the field of parasitology, especially by suggesting metabolic targets for new drugs. Their development still represents a major challenge to fight against the numerous diseases caused by parasites.
Optimized Mooring Line Simulation Using a Hybrid Method Time Domain Scheme
DEFF Research Database (Denmark)
Christiansen, Niels Hørbye; Voie, Per Erlend Torbergsen; Høgsberg, Jan
2014-01-01
Dynamic analyses of slender marine structures are computationally expensive. Recently it has been shown how a hybrid method which combines FEM models and artificial neural networks (ANN) can be used to reduce the computation time spend on the time domain simulations associated with fatigue analysis...... of mooring lines by two orders of magnitude. The present study shows how an ANN trained to perform nonlinear dynamic response simulation can be optimized using a method known as optimal brain damage (OBD) and thereby be used to rank the importance of all analysis input. Both the training and the optimization...... of the ANN are based on one short time domain simulation sequence generated by a FEM model of the structure. This means that it is possible to evaluate the importance of input parameters based on this single simulation only. The method is tested on a numerical model of mooring lines on a floating offshore...
DEFF Research Database (Denmark)
Rottach, Dana R.; Curro, John G.; Budzien, Joanne
2007-01-01
The effects of sequential cross-linking and scission of polymer networks formed in two states of strain are investigated using molecular dynamics simulations. Two-stage networks are studied in which a network formed in the unstrained state (stage 1) undergoes additional cross-linking in a uniaxia......The effects of sequential cross-linking and scission of polymer networks formed in two states of strain are investigated using molecular dynamics simulations. Two-stage networks are studied in which a network formed in the unstrained state (stage 1) undergoes additional cross......, a fraction (quantified by the stress transfer function ) of the second-stage cross-links contribute to the effective first-stage cross-link density. The stress transfer functions extracted from the MD simulations of the reacting networks are found to be in very...
Comparing three methods for participatory simulation of hospital work systems
DEFF Research Database (Denmark)
Broberg, Ole; Andersen, Simone Nyholm
Summative Statement: This study compared three participatory simulation methods using different simulation objects: Low resolution table-top setup using Lego figures, full scale mock-ups, and blueprints using Lego figures. It was concluded the three objects by differences in fidelity and affordance...... and why this influence took place. Research Objective / Question: How does the simulation object influence which elements of a work system are being evaluated in participatory simulation events? Methodology: Observation notes and video recordings of three types of simulation events using different objects...... simulation objects may to a certain degree influence what part of a work system is being addressed in participatory simulation events. For human factors practitioners in hospital design projects it is important to pay attention to this when planning and facilitating simulation events to evaluate different...
Development of a simulation method for the subsea production system
Directory of Open Access Journals (Sweden)
Jong Hun Woo
2014-07-01
Full Text Available The failure of a subsea production plant could induce fatal hazards and enormous loss to human lives, environments, and properties. Thus, for securing integrated design safety, core source technologies include subsea system integration that has high safety and reliability and a technique for the subsea flow assurance of subsea production plant and subsea pipeline network fluids. The evaluation of subsea flow assurance needs to be performed considering the performance of a subsea production plant, reservoir production characteristics, and the flow characteristics of multiphase fluids. A subsea production plant is installed in the deep sea, and thus is exposed to a high-pressure/low-temperature environment. Accordingly, hydrates could be formed inside a subsea production plant or within a subsea pipeline network. These hydrates could induce serious damages by blocking the flow of subsea fluids. In this study, a simulation technology, which can visualize the system configuration of subsea production processes and can simulate stable flow of fluids, was introduced. Most existing subsea simulations have performed the analysis of dynamic behaviors for the installation of subsea facilities or the flow analysis of multiphase flow within pipes. The above studies occupy extensive research areas of the subsea field. In this study, with the goal of simulating the configuration of an entire deep sea production system compared to existing studies, a DES-based simulation technology, which can logically simulate oil production processes in the deep sea, was analyzed, and an implementation example of a simplified case was introduced.
Massobrio, Carlo; Bernasconi, Marco; Salmon, Philip S
2015-01-01
This book is a unique reference work in the area of atomic-scale simulation of glasses. For the first time, a highly selected panel of about 20 researchers provides, in a single book, their views, methodologies and applications on the use of molecular dynamics as a tool to describe glassy materials. The book covers a wide range of systems covering ""traditional"" network glasses, such as chalcogenides and oxides, as well as glasses for applications in the area of phase change materials. The novelty of this work is the interplay between molecular dynamics methods (both at the classical and firs
Besaw, L. E.; Rizzo, D. M.; Boitnoitt, G. N.
2006-12-01
Accurate, yet cost effective, sites characterization and analysis of uncertainty are the first steps in remediation efforts at sites with subsurface contamination. From the time of source identification to the monitoring and assessment of a remediation design, the management objectives change, resulting in increased costs and the need for additional data acquisition. Parameter estimation is a key component in reliable site characterization, contaminant flow and transport predictions, plume delineation and many other data management goals. We implement a data-driven parameter estimation technique using a counterpropagation Artificial Neural Network (ANN) that is able to incorporate multiple types of data. This method is applied to estimates of geophysical properties measured on a slab of Berea sandstone and delineation of the leachate plume migrating from a landfill in upstate N.Y. The estimates generated by the ANN have been found to be statistically similar to estimates generated using conventional geostatistical kriging methods. The associated parameter uncertainty in site characterization, due to sparsely distributed samples (spatial or temporal) and incomplete site knowledge, is of major concern in resource mining and environmental engineering. We also illustrate the ability of the ANN method to perform conditional simulation using the spatial structure of parameters identified with semi-variogram analysis. This method allows for the generation of simulations that respect the observed measurement data, as well as the data's underlying spatial structure. The method of conditional simulation is used in a 3-dimensional application to estimate the uncertainty of soil lithology.
Global Consistency Management Methods Based on Escrow Approaches in Mobile ad Hoc Networks
Directory of Open Access Journals (Sweden)
Takahiro Hara
2010-01-01
Full Text Available In a mobile ad hoc network, consistency management of data operations on replicas is a crucial issue for system performance. In our previous work, we classified several primitive consistency levels according to the requirements from applications and provided protocols to realize them. In this paper, we assume special types of applications in which the instances of each data item can be partitioned and propose two consistency management protocols which are combinations of an escrow method and our previously proposed protocols. We also report simulation results to investigate the characteristics of these protocols in a mobile ad hoc network. From the simulation results, we confirm that the protocols proposed in this paper drastically improve data availability and reduce the traffic for data operations while maintaining the global consistency in the entire network.
Using simulation methods for orthopaedic implant design.
Rickey, L
2009-09-01
New virtual test methods are being used to better understand the functional performance of implants within the musculoskeletal system. Developing validated virtual models and tests reduces prototyping costs and compresses product development cycles.
Zapp, Kai; Orús, Román
2017-06-01
The simulation of lattice gauge theories with tensor network (TN) methods is becoming increasingly fruitful. The vision is that such methods will, eventually, be used to simulate theories in (3 +1 ) dimensions in regimes difficult for other methods. So far, however, TN methods have mostly simulated lattice gauge theories in (1 +1 ) dimensions. The aim of this paper is to explore the simulation of quantum electrodynamics (QED) on infinite lattices with TNs, i.e., fermionic matter fields coupled to a U (1 ) gauge field, directly in the thermodynamic limit. With this idea in mind we first consider a gauge-invariant infinite density matrix renormalization group simulation of the Schwinger model—i.e., QED in (1 +1 ) d . After giving a precise description of the numerical method, we benchmark our simulations by computing the subtracted chiral condensate in the continuum, in good agreement with other approaches. Our simulations of the Schwinger model allow us to build intuition about how a simulation should proceed in (2 +1 ) dimensions. Based on this, we propose a variational ansatz using infinite projected entangled pair states (PEPS) to describe the ground state of (2 +1 ) d QED. The ansatz includes U (1 ) gauge symmetry at the level of the tensors, as well as fermionic (matter) and bosonic (gauge) degrees of freedom both at the physical and virtual levels. We argue that all the necessary ingredients for the simulation of (2 +1 ) d QED are, a priori, already in place, paving the way for future upcoming results.
Large-scale lattice-Boltzmann simulations over lambda networks
Saksena, R.; Coveney, P. V.; Pinning, R.; Booth, S.
Amphiphilic molecules are of immense industrial importance, mainly due to their tendency to align at interfaces in a solution of immiscible species, e.g., oil and water, thereby reducing surface tension. Depending on the concentration of amphiphiles in the solution, they may assemble into a variety of morphologies, such as lamellae, micelles, sponge and cubic bicontinuous structures exhibiting non-trivial rheological properties. The main objective of this work is to study the rheological properties of very large, defect-containing gyroidal systems (of up to 10243 lattice sites) using the lattice-Boltzmann method. Memory requirements for the simulation of such large lattices exceed that available to us on most supercomputers and so we use MPICH-G2/MPIg to investigate geographically distributed domain decomposition simulations across HPCx in the UK and TeraGrid in the US. Use of MPICH-G2/MPIg requires the port-forwarder to work with the grid middleware on HPCx. Data from the simulations is streamed to a high performance visualisation resource at UCL (London) for rendering and visualisation. Lighting the Blue Touchpaper for UK e-Science - Closing Conference of ESLEA Project March 26-28 2007 The George Hotel, Edinburgh, UK
Directory of Open Access Journals (Sweden)
Régis Corinne
2011-07-01
Full Text Available Abstract Background The spread of infectious diseases crucially depends on the pattern of contacts between individuals. Knowledge of these patterns is thus essential to inform models and computational efforts. However, there are few empirical studies available that provide estimates of the number and duration of contacts between social groups. Moreover, their space and time resolutions are limited, so that data are not explicit at the person-to-person level, and the dynamic nature of the contacts is disregarded. In this study, we aimed to assess the role of data-driven dynamic contact patterns between individuals, and in particular of their temporal aspects, in shaping the spread of a simulated epidemic in the population. Methods We considered high-resolution data about face-to-face interactions between the attendees at a conference, obtained from the deployment of an infrastructure based on radiofrequency identification (RFID devices that assessed mutual face-to-face proximity. The spread of epidemics along these interactions was simulated using an SEIR (Susceptible, Exposed, Infectious, Recovered model, using both the dynamic network of contacts defined by the collected data, and two aggregated versions of such networks, to assess the role of the data temporal aspects. Results We show that, on the timescales considered, an aggregated network taking into account the daily duration of contacts is a good approximation to the full resolution network, whereas a homogeneous representation that retains only the topology of the contact network fails to reproduce the size of the epidemic. Conclusions These results have important implications for understanding the level of detail needed to correctly inform computational models for the study and management of real epidemics. Please see related article BMC Medicine, 2011, 9:88
Decoherence and Entanglement Simulation in a Model of Quantum Neural Network Based on Quantum Dots
Directory of Open Access Journals (Sweden)
Altaisky Mikhail V.
2016-01-01
Full Text Available We present the results of the simulation of a quantum neural network based on quantum dots using numerical method of path integral calculation. In the proposed implementation of the quantum neural network using an array of single-electron quantum dots with dipole-dipole interaction, the coherence is shown to survive up to 0.1 nanosecond in time and up to the liquid nitrogen temperature of 77K.We study the quantum correlations between the quantum dots by means of calculation of the entanglement of formation in a pair of quantum dots on the GaAs based substrate with dot size of 100 ÷ 101 nanometer and interdot distance of 101 ÷ 102 nanometers order.
An algebraic topological method for multimodal brain networks comparison
Directory of Open Access Journals (Sweden)
Tiago eSimas
2015-07-01
Full Text Available Understanding brain connectivity is one of the most important issues in neuroscience. Nonetheless, connectivity data can reflect either functional relationships of brain activities or anatomical connections between brain areas. Although both representations should be related, this relationship is not straightforward. We have devised a powerful method that allows different operations between networks that share the same set of nodes, by embedding them in a common metric space, enforcing transitivity to the graph topology. Here, we apply this method to construct an aggregated network from a set of functional graphs, each one from a different subject. Once this aggregated functional network is constructed, we use again our method to compare it with the structural connectivity to identify particular brain regions that differ in both modalities (anatomical and functional. Remarkably, these brain regions include functional areas that form part of the classical resting state networks. We conclude that our method -based on the comparison of the aggregated functional network- reveals some emerging features that could not be observed when the comparison is performed with the classical averaged functional network.
Queueing Models and Stability of Message Flows in Distributed Simulators of Open Queueing Networks
Gupta, Manish; Kumar, Anurag; Shorey, Rajeev
1996-01-01
In this paper we study message flow processes in distributed simulators of open queueing networks. We develop and study queueing models for distributed simulators with maximum lookahead sequencing. We characterize the external arrival process, and the message feedback process in the simulator of a simple queueing network with feedback. We show that a certain natural modelling construct for the arrival process is exactly correct, whereas an obvious model for the feedback process is wrong; we t...
Potential of commercial microwave link network derived rainfall for river runoff simulations
Smiatek, Gerhard; Keis, Felix; Chwala, Christian; Fersch, Benjamin; Kunstmann, Harald
2017-03-01
Commercial microwave link networks allow for the quantification of path integrated precipitation because the attenuation by hydrometeors correlates with rainfall between transmitter and receiver stations. The networks, operated and maintained by cellphone companies, thereby provide completely new and country wide precipitation measurements. As the density of traditional precipitation station networks worldwide is significantly decreasing, microwave link derived precipitation estimates receive increasing attention not only by hydrologists but also by meteorological and hydrological services. We investigate the potential of microwave derived precipitation estimates for streamflow prediction and water balance analyses, exemplarily shown for an orographically complex region in the German Alps (River Ammer). We investigate the additional value of link derived rainfall estimations combined with station observations compared to station and weather radar derived values. Our river runoff simulation system employs a distributed hydrological model at 100 × 100 m grid resolution. We analyze the potential of microwave link derived precipitation estimates for two episodes of 30 days with typically moderate river flow and an episode of extreme flooding. The simulation results indicate the potential of this novel precipitation monitoring method: a significant improvement in hydrograph reproduction has been achieved in the extreme flooding period that was characterized by a large number of local strong precipitation events. The present rainfall monitoring gauges alone were not able to correctly capture these events.
Multi-Sensor Network for Landslides Simulation and Hazard Monitoring - Design and Deployment
Wu, H.; Qiao, G.; Lu, P.; Feng, T.; Tian, Y.; Fan, H.; Liu, S.; Liu, C.; Tong, X.; Wang, W.; Shen, Y.; Guan, Z.; Li, R.
2011-08-01
This paper describes a newly developed multi-sensor network system for landslide and hazard monitoring. Landslide hazard is one of the most destructive natural disasters, which has severely affected human safety, properties and infrastructures. We report the results of designing and deploying the multi-sensor network, based on the simulated landslide model, to monitor typical landslide areas and with a goal to predict landslide hazard and mitigate damages. The integration and deployment of the prototype sensor network were carried out in an experiment area at Tongji University in Shanghai. In order to simulate a real landslide, a contractible landslide body is constructed in the experiment area by 7m*1.5m. Then, some different kind of sensors, such as camera, GPS, crackmeter, accelerometer, laser scanning system, inclinometer, etc., are installed near or in the landslide body. After the sensors are powered, continuous sampling data will be generated. With the help of communication method, such as GPRS, and certain transport devices, such as iMesh and 3G router, all the sensor data will be transported to the server and stored in Oracle. These are the current results of an ongoing project of the center. Further research results will be updated and presented in the near future.
MULTI-SENSOR NETWORK FOR LANDSLIDES SIMULATION AND HAZARD MONITORING - DESIGN AND DEPLOYMENT
Directory of Open Access Journals (Sweden)
H. Wu
2012-08-01
Full Text Available This paper describes a newly developed multi-sensor network system for landslide and hazard monitoring. Landslide hazard is one of the most destructive natural disasters, which has severely affected human safety, properties and infrastructures. We report the results of designing and deploying the multi-sensor network, based on the simulated landslide model, to monitor typical landslide areas and with a goal to predict landslide hazard and mitigate damages. The integration and deployment of the prototype sensor network were carried out in an experiment area at Tongji University in Shanghai. In order to simulate a real landslide, a contractible landslide body is constructed in the experiment area by 7m*1.5m. Then, some different kind of sensors, such as camera, GPS, crackmeter, accelerometer, laser scanning system, inclinometer, etc., are installed near or in the landslide body. After the sensors are powered, continuous sampling data will be generated. With the help of communication method, such as GPRS, and certain transport devices, such as iMesh and 3G router, all the sensor data will be transported to the server and stored in Oracle. These are the current results of an ongoing project of the center. Further research results will be updated and presented in the near future.
Method and Apparatus for Predicting Unsteady Pressure and Flow Rate Distribution in a Fluid Network
Majumdar, Alok K. (Inventor)
2009-01-01
A method and apparatus for analyzing steady state and transient flow in a complex fluid network, modeling phase changes, compressibility, mixture thermodynamics, external body forces such as gravity and centrifugal force and conjugate heat transfer. In some embodiments, a graphical user interface provides for the interactive development of a fluid network simulation having nodes and branches. In some embodiments, mass, energy, and specific conservation equations are solved at the nodes, and momentum conservation equations are solved in the branches. In some embodiments, contained herein are data objects for computing thermodynamic and thermophysical properties for fluids. In some embodiments, the systems of equations describing the fluid network are solved by a hybrid numerical method that is a combination of the Newton-Raphson and successive substitution methods.
Buttles, John W
2013-04-23
Wireless communication devices include a software-defined radio coupled to processing circuitry. The system controller is configured to execute computer programming code. Storage media is coupled to the system controller and includes computer programming code configured to cause the system controller to configure and reconfigure the software-defined radio to operate on each of a plurality of communication networks according to a selected sequence. Methods for communicating with a wireless device and methods of wireless network-hopping are also disclosed.
Cartesian Grid Method for Compressible Flow Simulation
Energy Technology Data Exchange (ETDEWEB)
Farooq, Muhammed Asif
2012-07-01
The Cartesian grid method is an alternative to the existing methods to solve a physical problem governed by partial differential equations (PDEs) computationally. Researchers are interested in this method due to its simplicity of grid generation, less computational effort and ease of implementation into a computer code. One of the other options to solve a physical PDE problem is by the body-fitted grid method. In the body-fitted grid method, the boundary points are grid points. This is not the case with the Cartesian grid method where the body wall is embedded as a boundary into a Cartesian grid resulting in irregular cells near the embedded boundary. These irregular cells near the embedded boundary are known as cut-cells. Instead of using special treatments of the cut-cells or enforcing the presence of the embedded boundary by adding source terms at the Cartesian grid points near the boundary, the kinematic and other boundary conditions can be introduced in the Cartesian grid method via ghost points. Those grid points which lie inside the embedded boundary and are also a part of computation are called ghost points. Inactive grid points inside the embedded boundary are referred to as solid points. In the present Cartesian grid method, based on a ghost point treatment, local symmetry conditions are imposed at the embedded wall boundary. The ghost point treatments available in the literature are difficult to implement due to complex procedures. We are introducing a new approach to approximate the kinematics of the embedded boundary by a very simple ghost point treatment called the simplified ghost point treatment. In this approach, we consider the grid lines in the x- and y- directions as approximations of the lines normal to the embedded boundary depending on whether the angle between the normal and the x- or y-directions is closer. For 1D hyperbolic nonlinear systems of conservation laws, we use the moving normal shock wave as a test case for the 1D compressible
Algorithmic and analytical methods in network biology
Koyutürk, Mehmet
2010-01-01
During genomic revolution, algorithmic and analytical methods for organizing, integrating, analyzing, and querying biological sequence data proved invaluable. Today, increasing availability of high-throughput data pertaining functional states of biomolecules, as well as their interactions, enables genome-scale studies of the cell from a systems perspective. The past decade witnessed significant efforts on the development of computational infrastructure for large-scale modeling and analysis of...
An Efficient Synchronization Method for Wireless Networks
2013-06-01
group-wise synchronization which is more e cient than rsync, is possible. This paper describes Dandelion , an algorithm that builds on the ideas of the...which is more efficient than rsync, is possible. This paper describes Dandelion , an algorithm that builds on the ideas of the rsync algorithm to...methods analyzed in this paper are compared using this metric. To meet this goal, this paper defines an epidemic-like algorithm called Dandelion that is
Methods of graph network reconstruction in personalized medicine.
Danilov, A; Ivanov, Yu; Pryamonosov, R; Vassilevski, Yu
2016-08-01
The paper addresses methods for generation of individualized computational domains on the basis of medical imaging dataset. The computational domains will be used in one-dimensional (1D) and three-dimensional (3D)-1D coupled hemodynamic models. A 1D hemodynamic model employs a 1D network of a patient-specific vascular network with large number of vessels. The 1D network is the graph with nodes in the 3D space which bears additional geometric data such as length and radius of vessels. A 3D hemodynamic model requires a detailed 3D reconstruction of local parts of the vascular network. We propose algorithms which extend the automated segmentation of vascular and tubular structures, generation of centerlines, 1D network reconstruction, correction, and local adaptation. We consider two modes of centerline representation: (i) skeletal segments or sets of connected voxels and (ii) curved paths with corresponding radii. Individualized reconstruction of 1D networks depends on the mode of centerline representation. Efficiency of the proposed algorithms is demonstrated on several examples of 1D network reconstruction. The networks can be used in modeling of blood flows as well as other physiological processes in tubular structures. Copyright © 2015 John Wiley & Sons, Ltd. Copyright © 2015 John Wiley & Sons, Ltd.
The dynamical modeling and simulation analysis of the recommendation on the user-movie network
Zhang, Shujuan; Jin, Zhen; Zhang, Juan
2016-12-01
At present, most research about the recommender system is based on graph theory and algebraic methods, but these methods cannot predict the evolution of the system with time under the recommendation method, and cannot dynamically analyze the long-term utility of the recommendation method. However, these two aspects can be studied by the dynamical method, which essentially investigates the intrinsic evolution mechanism of things, and is widely used to study a variety of actual problems. So, in this paper, network dynamics is used to study the recommendation on the user-movie network, which consists of users and movies, and the movies are watched either by the personal search or through the recommendation. Firstly, dynamical models are established to characterize the personal search and the system recommendation mechanism: the personal search model, the random recommendation model, the preference recommendation model, the degree recommendation model and the hybrid recommendation model. The rationality of the models established is verified by comparing the stochastic simulation with the numerical simulation. Moreover, the validity of the recommendation methods is evaluated by studying the movie degree, which is defined as the number of the movie that has been watched. Finally, we combine the personal search and the recommendation to establish a more general model. The change of the average degree of all the movies is given with the strength of the recommendation. Results show that for each recommendation method, the change of the movie degree is different, and is related to the initial degree of movies, the adjacency matrix A representing the relation between users and movies, the time t. Additionally, we find that in a long time, the degree recommendation is not as good as that in a short time, which fully demonstrates the advantage of the dynamical method. For the whole user-movie system, the preference recommendation is the best.
Thakral, Preston P; Benoit, Roland G; Schacter, Daniel L
2017-05-01
Neuroimaging data indicate that episodic memory (i.e., remembering specific past experiences) and episodic simulation (i.e., imagining specific future experiences) are associated with enhanced activity in a common set of neural regions, often referred to as the core network. This network comprises the hippocampus, parahippocampal cortex, lateral and medial parietal cortex, lateral temporal cortex, and medial prefrontal cortex. Evidence for a core network has been taken as support for the idea that episodic memory and episodic simulation are supported by common processes. Much remains to be learned about how specific core network regions contribute to specific aspects of episodic simulation. Prior neuroimaging studies of episodic memory indicate that certain regions within the core network are differentially sensitive to the amount of information recollected (e.g., the left lateral parietal cortex). In addition, certain core network regions dissociate as a function of their timecourse of engagement during episodic memory (e.g., transient activity in the posterior hippocampus and sustained activity in the left lateral parietal cortex). In the current study, we assessed whether similar dissociations could be observed during episodic simulation. We found that the left lateral parietal cortex modulates as a function of the amount of simulated details. Of particular interest, while the hippocampus was insensitive to the amount of simulated details, we observed a temporal dissociation within the hippocampus: transient activity occurred in relatively posterior portions of the hippocampus and sustained activity occurred in anterior portions. Because the posterior hippocampal and lateral parietal findings parallel those observed during episodic memory, the present results add to the evidence that episodic memory and episodic simulation are supported by common processes. Critically, the present study also provides evidence that regions within the core network support
A parallel program for numerical simulation of discrete fracture network and groundwater flow
Huang, Ting-Wei; Liou, Tai-Sheng; Kalatehjari, Roohollah
2017-04-01
The ability of modeling fluid flow in Discrete Fracture Network (DFN) is critical to various applications such as exploration of reserves in geothermal and petroleum reservoirs, geological sequestration of carbon dioxide and final disposal of spent nuclear fuels. Although several commerical or acdametic DFN flow simulators are already available (e.g., FracMan and DFNWORKS), challenges in terms of computational efficiency and three-dimensional visualization still remain, which therefore motivates this study for developing a new DFN and flow simulator. A new DFN and flow simulator, DFNbox, was written in C++ under a cross-platform software development framework provided by Qt. DFNBox integrates the following capabilities into a user-friendly drop-down menu interface: DFN simulation and clipping, 3D mesh generation, fracture data analysis, connectivity analysis, flow path analysis and steady-state grounwater flow simulation. All three-dimensional visualization graphics were developed using the free OpenGL API. Similar to other DFN simulators, fractures are conceptualized as random point process in space, with stochastic characteristics represented by orientation, size, transmissivity and aperture. Fracture meshing was implemented by Delaunay triangulation for visualization but not flow simulation purposes. Boundary element method was used for flow simulations such that only unknown head or flux along exterior and interection bounaries are needed for solving the flow field in the DFN. Parallel compuation concept was taken into account in developing DFNbox for calculations that such concept is possible. For example, the time-consuming seqential code for fracture clipping calculations has been completely replaced by a highly efficient parallel one. This can greatly enhance compuational efficiency especially on multi-thread platforms. Furthermore, DFNbox have been successfully tested in Windows and Linux systems with equally-well performance.
Nageswaran, Jayram Moorkanikara; Dutt, Nikil; Krichmar, Jeffrey L; Nicolau, Alex; Veidenbaum, Alexander V
2009-01-01
Neural network simulators that take into account the spiking behavior of neurons are useful for studying brain mechanisms and for various neural engineering applications. Spiking Neural Network (SNN) simulators have been traditionally simulated on large-scale clusters, super-computers, or on dedicated hardware architectures. Alternatively, Compute Unified Device Architecture (CUDA) Graphics Processing Units (GPUs) can provide a low-cost, programmable, and high-performance computing platform for simulation of SNNs. In this paper we demonstrate an efficient, biologically realistic, large-scale SNN simulator that runs on a single GPU. The SNN model includes Izhikevich spiking neurons, detailed models of synaptic plasticity and variable axonal delay. We allow user-defined configuration of the GPU-SNN model by means of a high-level programming interface written in C++ but similar to the PyNN programming interface specification. PyNN is a common programming interface developed by the neuronal simulation community to allow a single script to run on various simulators. The GPU implementation (on NVIDIA GTX-280 with 1 GB of memory) is up to 26 times faster than a CPU version for the simulation of 100K neurons with 50 Million synaptic connections, firing at an average rate of 7 Hz. For simulation of 10 Million synaptic connections and 100K neurons, the GPU SNN model is only 1.5 times slower than real-time. Further, we present a collection of new techniques related to parallelism extraction, mapping of irregular communication, and network representation for effective simulation of SNNs on GPUs. The fidelity of the simulation results was validated on CPU simulations using firing rate, synaptic weight distribution, and inter-spike interval analysis. Our simulator is publicly available to the modeling community so that researchers will have easy access to large-scale SNN simulations.
Shen, Lin; Yang, Weitao
2018-02-13
Direct molecular dynamics (MD) simulation with ab initio quantum mechanical and molecular mechanical (QM/MM) methods is very powerful for studying the mechanism of chemical reactions in complex environment but very time consuming. The computational cost on QM/MM calculations during MD simulations can be reduced significantly using semiempirical QM/MM methods with lower accuracy. To achieve higher accuracy at the ab initio QM/MM level, a correction on the existing semiempirical QM/MM model is an attractive way. Recently, we reported a neural network (NN) method as QM/MM-NN to predict the potential energy difference between semiempirical and ab initio QM/MM approaches. The high-level results can be obtained using neural network based on semiempirical QM/MM MD simulations, but the lack of direct MD samplings at the ab initio QM/MM level is still a deficiency that limits the applications of QM/MM-NN. In the present paper, we developed a dynamic scheme of QM/MM-NN for direct MD simulations on the NN-predicted potential energy surface to approximate ab initio QM/MM MD. Since some configurations excluded from the database for NN training were encountered during simulations, which may cause some difficulties on MD samplings, an adaptive procedure inspired by the selection scheme reported by Behler was employed with some adaptions to update NN and carry out MD iteratively. We further applied the adaptive QM/MM-NN MD method to the free energy calculation and transition path optimization on chemical reactions in water. The results at the ab initio QM/MM level can be well reproduced using this method after 2-4 iteration cycles. The saving in computational cost is about 2 orders of magnitude. It demonstrates that the QM/MM-NN with direct MD simulations has great potentials not only for the calculation of thermodynamic properties but also for the characterization of reaction dynamics, which provides a useful tool to study chemical or biochemical systems in solution or enzymes.
IDEF method-based simulation model design and development framework
Directory of Open Access Journals (Sweden)
Ki-Young Jeong
2009-09-01
Full Text Available The purpose of this study is to provide an IDEF method-based integrated framework for a business process simulation model to reduce the model development time by increasing the communication and knowledge reusability during a simulation project. In this framework, simulation requirements are collected by a function modeling method (IDEF0 and a process modeling method (IDEF3. Based on these requirements, a common data model is constructed using the IDEF1X method. From this reusable data model, multiple simulation models are automatically generated using a database-driven simulation model development approach. The framework is claimed to help both requirement collection and experimentation phases during a simulation project by improving system knowledge, model reusability, and maintainability through the systematic use of three descriptive IDEF methods and the features of the relational database technologies. A complex semiconductor fabrication case study was used as a testbed to evaluate and illustrate the concepts and the framework. Two different simulation software products were used to develop and control the semiconductor model from the same knowledge base. The case study empirically showed that this framework could help improve the simulation project processes by using IDEF-based descriptive models and the relational database technology. Authors also concluded that this framework could be easily applied to other analytical model generation by separating the logic from the data.
Modeling and Simulation of Handover Scheme in Integrated EPON-WiMAX Networks
DEFF Research Database (Denmark)
Yan, Ying; Dittmann, Lars
2011-01-01
In this paper, we tackle the seamless handover problem in integrated optical wireless networks. Our model applies for the convergence network of EPON and WiMAX and a mobilityaware signaling protocol is proposed. The proposed handover scheme, Integrated Mobility Management Scheme (IMMS), is assisted...... by enhancing the traditional MPCP signaling protocol, which cooperatively collects mobility information from the front-end wireless network and makes centralized bandwidth allocation decisions in the backhaul optical network. The integrated network architecture and the joint handover scheme are simulated using...... OPNET modeler. Results show validation of the protocol, i.e., integrated handover scheme gains better network performances....
Stochastic simulation of HIV population dynamics through complex network modelling
Sloot, P. M. A.; Ivanov, S. V.; Boukhanovsky, A. V.; van de Vijver, D. A. M. C.; Boucher, C. A. B.
We propose a new way to model HIV infection spreading through the use of dynamic complex networks. The heterogeneous population of HIV exposure groups is described through a unique network degree probability distribution. The time evolution of the network nodes is modelled by a Markov process and
Stochastic simulation of HIV population dynamics through complex network modelling
Sloot, P.M.A.; Ivanov, S.V.; Boukhanovsky, A.V.; van de Vijver, D.A.M.C.; Boucher, C.A.B.
2008-01-01
We propose a new way to model HIV infection spreading through the use of dynamic complex networks. The heterogeneous population of HIV exposure groups is described through a unique network degree probability distribution. The time evolution of the network nodes is modelled by a Markov process and
Constraint methods that accelerate free-energy simulations of biomolecules.
Perez, Alberto; MacCallum, Justin L; Coutsias, Evangelos A; Dill, Ken A
2015-12-28
Atomistic molecular dynamics simulations of biomolecules are critical for generating narratives about biological mechanisms. The power of atomistic simulations is that these are physics-based methods that satisfy Boltzmann's law, so they can be used to compute populations, dynamics, and mechanisms. But physical simulations are computationally intensive and do not scale well to the sizes of many important biomolecules. One way to speed up physical simulations is by coarse-graining the potential function. Another way is to harness structural knowledge, often by imposing spring-like restraints. But harnessing external knowledge in physical simulations is problematic because knowledge, data, or hunches have errors, noise, and combinatoric uncertainties. Here, we review recent principled methods for imposing restraints to speed up physics-based molecular simulations that promise to scale to larger biomolecules and motions.
An Entropy-Based Network Anomaly Detection Method
Directory of Open Access Journals (Sweden)
Przemysław Bereziński
2015-04-01
Full Text Available Data mining is an interdisciplinary subfield of computer science involving methods at the intersection of artificial intelligence, machine learning and statistics. One of the data mining tasks is anomaly detection which is the analysis of large quantities of data to identify items, events or observations which do not conform to an expected pattern. Anomaly detection is applicable in a variety of domains, e.g., fraud detection, fault detection, system health monitoring but this article focuses on application of anomaly detection in the field of network intrusion detection.The main goal of the article is to prove that an entropy-based approach is suitable to detect modern botnet-like malware based on anomalous patterns in network. This aim is achieved by realization of the following points: (i preparation of a concept of original entropy-based network anomaly detection method, (ii implementation of the method, (iii preparation of original dataset, (iv evaluation of the method.
Decomposition method for analysis of closed queuing networks
Directory of Open Access Journals (Sweden)
Yu. G. Nesterov
2014-01-01
Full Text Available This article deals with the method to estimate the average residence time in nodes of closed queuing networks with priorities and a wide range of conservative disciplines to be served. The method is based on a decomposition of entire closed queuing network into a set of simple basic queuing systems such as M|GI|m|N for each node. The unknown average residence times in the network nodes are interrelated through a system of nonlinear equations. The fact that there is a solution of this system has been proved. An iterative procedure based on Newton-Kantorovich method is proposed for finding the solution of such system. This procedure provides fast convergence to solution. Today possibilities of proposed method are limited by known analytical solutions for simple basic queuing systems of M|GI|m|N type.
Uncertainty assessment in geodetic network adjustment by combining GUM and Monte-Carlo-simulations
Niemeier, Wolfgang; Tengen, Dieter
2017-06-01
In this article first ideas are presented to extend the classical concept of geodetic network adjustment by introducing a new method for uncertainty assessment as two-step analysis. In the first step the raw data and possible influencing factors are analyzed using uncertainty modeling according to GUM (Guidelines to the Expression of Uncertainty in Measurements). This approach is well established in metrology, but rarely adapted within Geodesy. The second step consists of Monte-Carlo-Simulations (MC-simulations) for the complete processing chain from raw input data and pre-processing to adjustment computations and quality assessment. To perform these simulations, possible realizations of raw data and the influencing factors are generated, using probability distributions for all variables and the established concept of pseudo-random number generators. Final result is a point cloud which represents the uncertainty of the estimated coordinates; a confidence region can be assigned to these point clouds, as well. This concept may replace the common concept of variance propagation and the quality assessment of adjustment parameters by using their covariance matrix. It allows a new way for uncertainty assessment in accordance with the GUM concept for uncertainty modelling and propagation. As practical example the local tie network in "Metsähovi Fundamental Station", Finland is used, where classical geodetic observations are combined with GNSS data.
Validation of Mobility Simulations via Measurement Drive Tests in an Operational Network
DEFF Research Database (Denmark)
Gimenez, Lucas Chavarria; Barbera, Simone; Polignano, Michele
2015-01-01
Simulations play a key role in validating new concepts in cellular networks, since most of the features proposed and introduced into the standards are typically first studied by means of simulations. In order to increase the trustworthiness of the simulation results, proper models and settings must...... to reality. The presented study is based on drive tests measurements and explicit simulations of an operator network in the city of Aalborg (Denmark) – modelling a real 3D environment and using a commonly accepted dynamic system level simulation methodology. In short, the presented results show...
Directory of Open Access Journals (Sweden)
Ondrej Vondrous
2017-01-01
Full Text Available In this article, we would like to deal with challenges and analysis approaches in the area of narrow band communication networks. Especially those networks which use TCP/IP protocol family. We also present a new universal data generator for OMNeT++ simulation environment. We created this generator to satisfy the evaluation, stress testing and benchmarking demands of more and more complex industrial and the Internet of Things networks. We also present the methods for evaluation and comparison of results obtained from simulated and real TCP/IP based networks in this article.
A model reduction method for biochemical reaction networks.
Rao, Shodhan; van der Schaft, Arjan; van Eunen, Karen; Bakker, Barbara M; Jayawardhana, Bayu
2014-05-03
In this paper we propose a model reduction method for biochemical reaction networks governed by a variety of reversible and irreversible enzyme kinetic rate laws, including reversible Michaelis-Menten and Hill kinetics. The method proceeds by a stepwise reduction in the number of complexes, defined as the left and right-hand sides of the reactions in the network. It is based on the Kron reduction of the weighted Laplacian matrix, which describes the graph structure of the complexes and reactions in the network. It does not rely on prior knowledge of the dynamic behaviour of the network and hence can be automated, as we demonstrate. The reduced network has fewer complexes, reactions, variables and parameters as compared to the original network, and yet the behaviour of a preselected set of significant metabolites in the reduced network resembles that of the original network. Moreover the reduced network largely retains the structure and kinetics of the original model. We apply our method to a yeast glycolysis model and a rat liver fatty acid beta-oxidation model. When the number of state variables in the yeast model is reduced from 12 to 7, the difference between metabolite concentrations in the reduced and the full model, averaged over time and species, is only 8%. Likewise, when the number of state variables in the rat-liver beta-oxidation model is reduced from 42 to 29, the difference between the reduced model and the full model is 7.5%. The method has improved our understanding of the dynamics of the two networks. We found that, contrary to the general disposition, the first few metabolites which were deleted from the network during our stepwise reduction approach, are not those with the shortest convergence times. It shows that our reduction approach performs differently from other approaches that are based on time-scale separation. The method can be used to facilitate fitting of the parameters or to embed a detailed model of interest in a more coarse
Multi-pass Monte Carlo simulation method in nuclear transmutations.
Mateescu, Liviu; Kadambi, N Prasad; Ravindra, Nuggehalli M
2016-12-01
Monte Carlo methods, in their direct brute simulation incarnation, bring realistic results if the involved probabilities, be they geometrical or otherwise, remain constant for the duration of the simulation. However, there are physical setups where the evolution of the simulation represents a modification of the simulated system itself. Chief among such evolving simulated systems are the activation/transmutation setups. That is, the simulation starts with a given set of probabilities, which are determined by the geometry of the system, the components and by the microscopic interaction cross-sections. However, the relative weight of the components of the system changes along with the steps of the simulation. A natural measure would be adjusting probabilities after every step of the simulation. On the other hand, the physical system has typically a number of components of the order of Avogadro's number, usually 1025 or 1026 members. A simulation step changes the characteristics for just a few of these members; a probability will therefore shift by a quantity of 1/1025. Such a change cannot be accounted for within a simulation, because then the simulation should have then a number of at least 1028 steps in order to have some significance. This is not feasible, of course. For our computing devices, a simulation of one million steps is comfortable, but a further order of magnitude becomes too big a stretch for the computing resources. We propose here a method of dealing with the changing probabilities, leading to the increasing of the precision. This method is intended as a fast approximating approach, and also as a simple introduction (for the benefit of students) in the very branched subject of Monte Carlo simulations vis-à-vis nuclear reactors. Copyright © 2016 Elsevier Ltd. All rights reserved.
A model reduction method for biochemical reaction networks
Rao, Shodhan; van der Schaft, Arjan; van Eunen, Karen; Bakker, Barbara; Jayawardhana, Bayu
2014-01-01
Background: In this paper we propose a model reduction method for biochemical reaction networks governed by a variety of reversible and irreversible enzyme kinetic rate laws, including reversible Michaelis-Menten and Hill kinetics. The method proceeds by a stepwise reduction in the number of
New method of fast simulation for a hadron calorimeter response
Kulchitskii, Yu A; Tokar, S; Zenis, T
2003-01-01
In this work we present the new method of a fast Monte-Carlo simulation of a hadron calorimeter response. It is based on the three-dimensional parameterization of the hadronic shower obtained from the ATLAS TILECAL test beam data and GEANT simulations. A new approach of including the longitudinal fluctuations of hadronic shower is described. The obtained results of the fast simulation are in good agreement with the TILECAL experimental data. (15 refs).
Advanced molecular dynamics simulation methods for kinase drug discovery.
Aci-Sèche, Samia; Ziada, Sonia; Braka, Abdennour; Arora, Rohit; Bonnet, Pascal
2016-04-01
Interest in the application of molecular dynamics (MD) simulations has increased in the field of protein kinase (PK) drug discovery. PKs belong to an important drug target class because they are directly involved in a number of diseases, including cancer. MD methods simulate dynamic biological and chemical events at an atomic level. This information can be combined with other in silico and experimental methods to efficiently target selected receptors. In this review, we present common and advanced methods of MD simulations and we focus on the recent applications of MD-based methodologies that provided significant insights into the elucidation of biological mechanisms involving PKs and into the discovery of novel kinase inhibitors.
A semi-automatic method for extracting thin line structures in images as rooted tree network
Energy Technology Data Exchange (ETDEWEB)
Brazzini, Jacopo [Los Alamos National Laboratory; Dillard, Scott [Los Alamos National Laboratory; Soille, Pierre [EC - JRC
2010-01-01
This paper addresses the problem of semi-automatic extraction of line networks in digital images - e.g., road or hydrographic networks in satellite images, blood vessels in medical images, robust. For that purpose, we improve a generic method derived from morphological and hydrological concepts and consisting in minimum cost path estimation and flow simulation. While this approach fully exploits the local contrast and shape of the network, as well as its arborescent nature, we further incorporate local directional information about the structures in the image. Namely, an appropriate anisotropic metric is designed by using both the characteristic features of the target network and the eigen-decomposition of the gradient structure tensor of the image. Following, the geodesic propagation from a given seed with this metric is combined with hydrological operators for overland flow simulation to extract the line network. The algorithm is demonstrated for the extraction of blood vessels in a retina image and of a river network in a satellite image.
How Crime Spreads Through Imitation in Social Networks: A Simulation Model
Punzo, Valentina
In this chapter an agent-based model for investigating how crime spreads through social networks is presented. Some theoretical issues related to the sociological explanation of crime are tested through simulation. The agent-based simulation allows us to investigate the relative impact of some mechanisms of social influence on crime, within a set of controlled simulated experiments.
Experimental Evaluation of Simulation Abstractions for Wireless Sensor Network MAC Protocols
Halkes, G.P.; Langendoen, K.G.
2010-01-01
The evaluation ofMAC protocols forWireless Sensor Networks (WSNs) is often performed through simulation. These simulations necessarily abstract away from reality inmany ways. However, the impact of these abstractions on the results of the simulations has received only limited attention. Moreover,
Network 'small-world-ness': a quantitative method for determining canonical network equivalence.
Directory of Open Access Journals (Sweden)
Mark D Humphries
Full Text Available BACKGROUND: Many technological, biological, social, and information networks fall into the broad class of 'small-world' networks: they have tightly interconnected clusters of nodes, and a shortest mean path length that is similar to a matched random graph (same number of nodes and edges. This semi-quantitative definition leads to a categorical distinction ('small/not-small' rather than a quantitative, continuous grading of networks, and can lead to uncertainty about a network's small-world status. Moreover, systems described by small-world networks are often studied using an equivalent canonical network model--the Watts-Strogatz (WS model. However, the process of establishing an equivalent WS model is imprecise and there is a pressing need to discover ways in which this equivalence may be quantified. METHODOLOGY/PRINCIPAL FINDINGS: We defined a precise measure of 'small-world-ness' S based on the trade off between high local clustering and short path length. A network is now deemed a 'small-world' if S>1--an assertion which may be tested statistically. We then examined the behavior of S on a large data-set of real-world systems. We found that all these systems were linked by a linear relationship between their S values and the network size n. Moreover, we show a method for assigning a unique Watts-Strogatz (WS model to any real-world network, and show analytically that the WS models associated with our sample of networks also show linearity between S and n. Linearity between S and n is not, however, inevitable, and neither is S maximal for an arbitrary network of given size. Linearity may, however, be explained by a common limiting growth process. CONCLUSIONS/SIGNIFICANCE: We have shown how the notion of a small-world network may be quantified. Several key properties of the metric are described and the use of WS canonical models is placed on a more secure footing.
Hybrid methods for simulating hydrodynamics and heat transfer in multiscale (1D-3D) models
Filimonov, S. A.; Mikhienkova, E. I.; Dekterev, A. A.; Boykov, D. V.
2017-09-01
The work is devoted to application of different-scale models in the simulation of hydrodynamics and heat transfer of large and/or complex systems, which can be considered as a combination of extended and “compact” elements. The model consisting of simultaneously existing three-dimensional and network (one-dimensional) elements is called multiscale. The paper examines the relevance of building such models and considers three main options for their implementation: the spatial and the network parts of the model are calculated separately; spatial and network parts are calculated simultaneously (hydraulically unified model); network elements “penetrate” the spatial part and are connected through the integral characteristics at the tube/channel walls (hydraulically disconnected model). Each proposed method is analyzed in terms of advantages and disadvantages. The paper presents a number of practical examples demonstrating the application of multiscale models.
Hybrid Network Simulation for the ATLAS Trigger and Data Acquisition (TDAQ) System
Bonaventura, Matias Alejandro; The ATLAS collaboration; Castro, Rodrigo Daniel; Foguelman, Daniel Jacob
2015-01-01
The poster shows the ongoing research in the ATLAS TDAQ group in collaboration with the University of Buenos Aires in the area of hybrid data network simulations. he Data Network and Processing Cluster filters data in real-time, achieving a rejection factor in the order of 40000x and has real-time latency constrains. The dataflow between the processing units (TPUs) and Readout System (ROS) presents a “TCP Incast”-type network pathology which TCP cannot handle it efficiently. A credits system is in place which limits rate of queries and reduces latency. This large computer network, and the complex dataflow has been modelled and simulated using a PowerDEVS, a DEVS-based simulator. The simulation has been validated and used to produce what-if scenarios in the real network. Network Simulation with Hybrid Flows: Speedups and accuracy, combined • For intensive network traffic, Discrete Event simulation models (packet-level granularity) soon becomes prohibitive: Too high computing demands. • Fluid Flow simul...
Simulation of one-dimensional blood flow in networks of human vessels using a novel TVD scheme.
Huang, P G; Muller, L O
2015-05-01
An extension of a total variation diminishing (TVD) scheme to solve one-dimensional (1D) blood flow for human circulation is proposed. This method is simple as it involves only a few modifications to existing shock-capturing TVD schemes. We have applied the method to a wide range of test cases including a complete simulation of the human vascular network. Excellent solutions have been demonstrated for problems involving varying and discontinuous mechanical properties of blood vessels. For 1D network simulations, the method has been shown to agree well with the reported computational results. Finally, the method has been demonstrated to compare favorably with in vivo experiments set up to study the impact of circle of Willis anomalies on flow patterns in the cerebral arterial system. Copyright © 2015 John Wiley & Sons, Ltd.
A Software-Defined Radio Simulation Method using Observer Patterns
Moseley, N.A.; Slump, Cornelis H.
2005-01-01
A problem with object-oriented simulation models is that internal model states are hidden and cannot be monitored easily. Object-oriented models are essentially black-box models. This article describes a method to expose the internal states of an object-oriented simulation model. Exposure of the
Multi-tree Coding Method (MCM) for drainage networks supporting high-efficient search
Wang, Hao; Fu, Xudong; Wang, Guangqian
2013-03-01
River coding method for drainage networks plays an very important role in the physical simulation of river basins. In this study we developed a new river coding method named Multi-tree Coding Method (MCM), which has the following features: (1) it is established on a topological pattern reflecting the dendriform structure of drainage networks; (2) the multi-tree code can be effectively managed by the database to perform convenient topological search toward drainage networks using Structured Query Language (SQL); (3) the multi-tree code does not exhibit digital overflow problems in the computer, thus any resolution and scale drainage networks can easily be coded; and (4) it supports high-efficient search process. A river reach can be directly positioned in a drainage network under MCM, without the complex search process from all river reaches. This feature has great potential to improve the computational performance of basin models. We demonstrate here the efficiency and practicality of MCM by testing it in the Yalu Tsangpo river basin, Tibet. A drainage network with 140,745 digital reaches was extracted from the digital elevation model (DEM), and the multi-tree codes of all river reaches were obtained.
Integration of Continuous-Time Dynamics in a Spiking Neural Network Simulator.
Hahne, Jan; Dahmen, David; Schuecker, Jannis; Frommer, Andreas; Bolten, Matthias; Helias, Moritz; Diesmann, Markus
2017-01-01
Contemporary modeling approaches to the dynamics of neural networks include two important classes of models: biologically grounded spiking neuron models and functionally inspired rate-based units. We present a unified simulation framework that supports the combination of the two for multi-scale modeling, enables the quantitative validation of mean-field approaches by spiking network simulations, and provides an increase in reliability by usage of the same simulation code and the same network model specifications for both model classes. While most spiking simulations rely on the communication of discrete events, rate models require time-continuous interactions between neurons. Exploiting the conceptual similarity to the inclusion of gap junctions in spiking network simulations, we arrive at a reference implementation of instantaneous and delayed interactions between rate-based models in a spiking network simulator. The separation of rate dynamics from the general connection and communication infrastructure ensures flexibility of the framework. In addition to the standard implementation we present an iterative approach based on waveform-relaxation techniques to reduce communication and increase performance for large-scale simulations of rate-based models with instantaneous interactions. Finally we demonstrate the broad applicability of the framework by considering various examples from the literature, ranging from random networks to neural-field models. The study provides the prerequisite for interactions between rate-based and spiking models in a joint simulation.
Probing the Effects of Stochasticity in Biochemical Reaction Networks using Multiscale Simulation
Harris, Leonard A; Majusiak, Emily R; Clancy, Paulette
2007-01-01
Using our recent contribution, the "partitioned leaping algorithm" [L. A. Harris and P. Clancy, J. Chem. Phys. 125, 144107 (2006)], we investigate the effects of stochasticity in two model biochemical reaction networks. By considering situations both where "leaping" proves beneficial and where it does not, we gain valuable insight that can aid in and advance the use of leaping methods in computational biology. In particular, we identify reaction subnetworks with small populations and large rate constants as a major bottleneck for leaping. We also demonstrate the use of "model reduction" in conjunction with leaping to circumvent this problem and expose a current need in this area: a model-reduction hierarchy analogous to that on which the leaping methods are based [D. T. Gillespie, J. Chem. Phys. 113, 297 (2000); 115, 1716 (2001)]. In situations where leaping is seen to perform well, we emphasize the significant advantages to using these methods over more traditional simulation approaches. We show how leaping ...
Hong, Changki; Hwang, Jeewon; Cho, Kwang-Hyun; Shin, Insik
2015-01-01
Boolean networks have been widely used to model biological processes lacking detailed kinetic information. Despite their simplicity, Boolean network dynamics can still capture some important features of biological systems such as stable cell phenotypes represented by steady states. For small models, steady states can be determined through exhaustive enumeration of all state transitions. As the number of nodes increases, however, the state space grows exponentially thus making it difficult to find steady states. Over the last several decades, many studies have addressed how to handle such a state space explosion. Recently, increasing attention has been paid to a satisfiability solving algorithm due to its potential scalability to handle large networks. Meanwhile, there still lies a problem in the case of large models with high maximum node connectivity where the satisfiability solving algorithm is known to be computationally intractable. To address the problem, this paper presents a new partitioning-based method that breaks down a given network into smaller subnetworks. Steady states of each subnetworks are identified by independently applying the satisfiability solving algorithm. Then, they are combined to construct the steady states of the overall network. To efficiently apply the satisfiability solving algorithm to each subnetwork, it is crucial to find the best partition of the network. In this paper, we propose a method that divides each subnetwork to be smallest in size and lowest in maximum node connectivity. This minimizes the total cost of finding all steady states in entire subnetworks. The proposed algorithm is compared with others for steady states identification through a number of simulations on both published small models and randomly generated large models with differing maximum node connectivities. The simulation results show that our method can scale up to several hundreds of nodes even for Boolean networks with high maximum node connectivity. The
Decomposition method for zonal resource allocation problems in telecommunication networks
Konnov, I. V.; Kashuba, A. Yu
2016-11-01
We consider problems of optimal resource allocation in telecommunication networks. We first give an optimization formulation for the case where the network manager aims to distribute some homogeneous resource (bandwidth) among users of one region with quadratic charge and fee functions and present simple and efficient solution methods. Next, we consider a more general problem for a provider of a wireless communication network divided into zones (clusters) with common capacity constraints. We obtain a convex quadratic optimization problem involving capacity and balance constraints. By using the dual Lagrangian method with respect to the capacity constraint, we suggest to reduce the initial problem to a single-dimensional optimization problem, but calculation of the cost function value leads to independent solution of zonal problems, which coincide with the above single region problem. Some results of computational experiments confirm the applicability of the new methods.
Exploring function prediction in protein interaction networks via clustering methods.
Trivodaliev, Kire; Bogojeska, Aleksandra; Kocarev, Ljupco
2014-01-01
Complex networks have recently become the focus of research in many fields. Their structure reveals crucial information for the nodes, how they connect and share information. In our work we analyze protein interaction networks as complex networks for their functional modular structure and later use that information in the functional annotation of proteins within the network. We propose several graph representations for the protein interaction network, each having different level of complexity and inclusion of the annotation information within the graph. We aim to explore what the benefits and the drawbacks of these proposed graphs are, when they are used in the function prediction process via clustering methods. For making this cluster based prediction, we adopt well established approaches for cluster detection in complex networks using most recent representative algorithms that have been proven as efficient in the task at hand. The experiments are performed using a purified and reliable Saccharomyces cerevisiae protein interaction network, which is then used to generate the different graph representations. Each of the graph representations is later analysed in combination with each of the clustering algorithms, which have been possibly modified and implemented to fit the specific graph. We evaluate results in regards of biological validity and function prediction performance. Our results indicate that the novel ways of presenting the complex graph improve the prediction process, although the computational complexity should be taken into account when deciding on a particular approach.
Exploring function prediction in protein interaction networks via clustering methods.
Directory of Open Access Journals (Sweden)
Kire Trivodaliev
Full Text Available Complex networks have recently become the focus of research in many fields. Their structure reveals crucial information for the nodes, how they connect and share information. In our work we analyze protein interaction networks as complex networks for their functional modular structure and later use that information in the functional annotation of proteins within the network. We propose several graph representations for the protein interaction network, each having different level of complexity and inclusion of the annotation information within the graph. We aim to explore what the benefits and the drawbacks of these proposed graphs are, when they are used in the function prediction process via clustering methods. For making this cluster based prediction, we adopt well established approaches for cluster detection in complex networks using most recent representative algorithms that have been proven as efficient in the task at hand. The experiments are performed using a purified and reliable Saccharomyces cerevisiae protein interaction network, which is then used to generate the different graph representations. Each of the graph representations is later analysed in combination with each of the clustering algorithms, which have been possibly modified and implemented to fit the specific graph. We evaluate results in regards of biological validity and function prediction performance. Our results indicate that the novel ways of presenting the complex graph improve the prediction process, although the computational complexity should be taken into account when deciding on a particular approach.
Safranski, David L; Crabtree, Jacob C; Huq, Yameen R; Gall, Ken
2011-09-29
Poly(β-amino ester) networks are being explored for biomedical applications, but they may lack the mechanical properties necessary for long term implantation. The objective of this study is to evaluate the effect of adding methyl methacrylate on networks' mechanical properties under simulated physiological conditions. The networks were synthesized in two parts: (1) a biodegradable crosslinker was formed from a diacrylate and amine, (2) and then varying concentrations of methyl methacrylate were added prior to photopolymerizing the network. Degradation rate, mechanical properties, and glass transition temperature were studied as a function of methyl methacrylate composition. The crosslinking density played a limited role on mechanical properties for these networks, but increasing methyl methacrylate concentration improved the toughness by several orders of magnitude. Under simulated physiological conditions, networks showed increasing toughness or sustained toughness as degradation occurred. This work establishes a method of creating degradable networks with tailorable toughness while undergoing partial degradation.
A particle-based method for granular flow simulation
Chang, Yuanzhang
2012-03-16
We present a new particle-based method for granular flow simulation. In the method, a new elastic stress term, which is derived from a modified form of the Hooke\\'s law, is included in the momentum governing equation to handle the friction of granular materials. Viscosity force is also added to simulate the dynamic friction for the purpose of smoothing the velocity field and further maintaining the simulation stability. Benefiting from the Lagrangian nature of the SPH method, large flow deformation can be well handled easily and naturally. In addition, a signed distance field is also employed to enforce the solid boundary condition. The experimental results show that the proposed method is effective and efficient for handling the flow of granular materials, and different kinds of granular behaviors can be well simulated by adjusting just one parameter. © 2012 Science China Press and Springer-Verlag Berlin Heidelberg.
Forest canopy BRDF simulation using Monte Carlo method
Huang, J.; Wu, B.; Zeng, Y.; Tian, Y.
2006-01-01
Monte Carlo method is a random statistic method, which has been widely used to simulate the Bidirectional Reflectance Distribution Function (BRDF) of vegetation canopy in the field of visible remote sensing. The random process between photons and forest canopy was designed using Monte Carlo method.
CoSimulating Communication Networks and Electrical System for Performance Evaluation in Smart Grid
Directory of Open Access Journals (Sweden)
Hwantae Kim
2018-01-01
Full Text Available In smart grid research domain, simulation study is the first choice, since the analytic complexity is too high and constructing a testbed is very expensive. However, since communication infrastructure and the power grid are tightly coupled with each other in the smart grid, a well-defined combination of simulation tools for the systems is required for the simulation study. Therefore, in this paper, we propose a cosimulation work called OOCoSim, which consists of OPNET (network simulation tool and OpenDSS (power system simulation tool. By employing the simulation tool, an organic and dynamic cosimulation can be realized since both simulators operate on the same computing platform and provide external interfaces through which the simulation can be managed dynamically. In this paper, we provide OOCoSim design principles including a synchronization scheme and detailed descriptions of its implementation. To present the effectiveness of OOCoSim, we define a smart grid application model and conduct a simulation study to see the impact of the defined application and the underlying network system on the distribution system. The simulation results show that the proposed OOCoSim can successfully simulate the integrated scenario of the power and network systems and produce the accurate effects of the networked control in the smart grid.
Karahalios, Amalia Emily; Salanti, Georgia; Turner, Simon L; Herbison, G Peter; White, Ian R; Veroniki, Areti Angeliki; Nikolakopoulou, Adriani; Mckenzie, Joanne E
2017-06-24
Network meta-analysis, a method to synthesise evidence from multiple treatments, has increased in popularity in the past decade. Two broad approaches are available to synthesise data across networks, namely, arm- and contrast-synthesis models, with a range of models that can be fitted within each. There has been recent debate about the validity of the arm-synthesis models, but to date, there has been limited empirical evaluation comparing results using the methods applied to a large number of networks. We aim to address this gap through the re-analysis of a large cohort of published networks of interventions using a range of network meta-analysis methods. We will include a subset of networks from a database of network meta-analyses of randomised trials that have been identified and curated from the published literature. The subset of networks will include those where the primary outcome is binary, the number of events and participants are reported for each direct comparison, and there is no evidence of inconsistency in the network. We will re-analyse the networks using three contrast-synthesis methods and two arm-synthesis methods. We will compare the estimated treatment effects, their standard errors, treatment hierarchy based on the surface under the cumulative ranking (SUCRA) curve, the SUCRA value, and the between-trial heterogeneity variance across the network meta-analysis methods. We will investigate whether differences in the results are affected by network characteristics and baseline risk. The results of this study will inform whether, in practice, the choice of network meta-analysis method matters, and if it does, in what situations differences in the results between methods might arise. The results from this research might also inform future simulation studies.
Two Dimensional Lattice Boltzmann Method for Cavity Flow Simulation
Panjit MUSIK; Krisanadej JAROENSUTASINEE
2004-01-01
This paper presents a simulation of incompressible viscous flow within a two-dimensional square cavity. The objective is to develop a method originated from Lattice Gas (cellular) Automata (LGA), which utilises discrete lattice as well as discrete time and can be parallelised easily. Lattice Boltzmann Method (LBM), known as discrete Lattice kinetics which provide an alternative for solving the Navier–Stokes equations and are generally used for fluid simulation, is chosen for the study. A spec...
A Type of Low-Latency Data Gathering Method with Multi-Sink for Sensor Networks
Directory of Open Access Journals (Sweden)
Chao Sha
2016-06-01
Full Text Available To balance energy consumption and reduce latency on data transmission in Wireless Sensor Networks (WSNs, a type of low-latency data gathering method with multi-Sink (LDGM for short is proposed in this paper. The network is divided into several virtual regions consisting of three or less data gathering units and the leader of each region is selected according to its residual energy as well as distance to all of the other nodes. Only the leaders in each region need to communicate with the mobile Sinks which have effectively reduced energy consumption and the end-to-end delay. Moreover, with the help of the sleep scheduling and the sensing radius adjustment strategies, redundancy in network coverage could also be effectively reduced. Simulation results show that LDGM is energy efficient in comparison with MST as well as MWST and its time efficiency on data collection is higher than one Sink based data gathering methods.
Yucel, Abdulkadir C.
2015-05-05
An efficient method for statistically characterizing multiconductor transmission line (MTL) networks subject to a large number of manufacturing uncertainties is presented. The proposed method achieves its efficiency by leveraging a high-dimensional model representation (HDMR) technique that approximates observables (quantities of interest in MTL networks, such as voltages/currents on mission-critical circuits) in terms of iteratively constructed component functions of only the most significant random variables (parameters that characterize the uncertainties in MTL networks, such as conductor locations and widths, and lumped element values). The efficiency of the proposed scheme is further increased using a multielement probabilistic collocation (ME-PC) method to compute the component functions of the HDMR. The ME-PC method makes use of generalized polynomial chaos (gPC) expansions to approximate the component functions, where the expansion coefficients are expressed in terms of integrals of the observable over the random domain. These integrals are numerically evaluated and the observable values at the quadrature/collocation points are computed using a fast deterministic simulator. The proposed method is capable of producing accurate statistical information pertinent to an observable that is rapidly varying across a high-dimensional random domain at a computational cost that is significantly lower than that of gPC or Monte Carlo methods. The applicability, efficiency, and accuracy of the method are demonstrated via statistical characterization of frequency-domain voltages in parallel wire, interconnect, and antenna corporate feed networks.
Zhang, Shuhua
2014-09-01
A discontinuous Galerkin method is considered to simulate materials flow in a supply chain network problem which is governed by a system of conservation laws. By means of a novel interpolation and superclose analysis technique, the optimal and superconvergence error estimates are established under two physically meaningful assumptions on the connectivity matrix. Numerical examples are presented to validate the theoretical results. © 2014 Elsevier Ltd. All rights reserved.
A graph clustering method for community detection in complex networks
Zhou, HongFang; Li, Jin; Li, JunHuai; Zhang, FaCun; Cui, YingAn
2017-03-01
Information mining from complex networks by identifying communities is an important problem in a number of research fields, including the social sciences, biology, physics and medicine. First, two concepts are introduced, Attracting Degree and Recommending Degree. Second, a graph clustering method, referred to as AR-Cluster, is presented for detecting community structures in complex networks. Third, a novel collaborative similarity measure is adopted to calculate node similarities. In the AR-Cluster method, vertices are grouped together based on calculated similarity under a K-Medoids framework. Extensive experimental results on two real datasets show the effectiveness of AR-Cluster.
Gene Expression Network Reconstruction by LEP Method Using Microarray Data
Directory of Open Access Journals (Sweden)
Na You
2012-01-01
Full Text Available Gene expression network reconstruction using microarray data is widely studied aiming to investigate the behavior of a gene cluster simultaneously. Under the Gaussian assumption, the conditional dependence between genes in the network is fully described by the partial correlation coefficient matrix. Due to the high dimensionality and sparsity, we utilize the LEP method to estimate it in this paper. Compared to the existing methods, the LEP reaches the highest PPV with the sensitivity controlled at the satisfactory level. A set of gene expression data from the HapMap project is analyzed for illustration.
Borštnik, Urban; Miller, Benjamin T; Brooks, Bernard R; Janežič, Dušanka
2011-11-15
Parallelization is an effective way to reduce the computational time needed for molecular dynamics simulations. We describe a new parallelization method, the distributed-diagonal force decomposition method, with which we extend and improve the existing force decomposition methods. Our new method requires less data communication during molecular dynamics simulations than replicated data and current force decomposition methods, increasing the parallel efficiency. It also dynamically load-balances the processors' computational load throughout the simulation. The method is readily implemented in existing molecular dynamics codes and it has been incorporated into the CHARMM program, allowing its immediate use in conjunction with the many molecular dynamics simulation techniques that are already present in the program. We also present the design of the Force Decomposition Machine, a cluster of personal computers and networks that is tailored to running molecular dynamics simulations using the distributed diagonal force decomposition method. The design is expandable and provides various degrees of fault resilience. This approach is easily adaptable to computers with Graphics Processing Units because it is independent of the processor type being used. Copyright © 2011 Wiley Periodicals, Inc.
Motion simulation of hydraulic driven safety rod using FSI method
Energy Technology Data Exchange (ETDEWEB)
Jung, Jaeho; Kim, Sanghaun; Yoo, Yeonsik; Cho, Yeonggarp; Kim, Jong In [Korea Atomic Energy Research Institute, Daejeon (Korea, Republic of)
2013-05-15
Hydraulic driven safety rod which is one of them is being developed by Division for Reactor Mechanical Engineering, KAERI. In this paper the motion of this rod is simulated by fluid structure interaction (FSI) method before manufacturing for design verification and pump sizing. A newly designed hydraulic driven safety rod which is one of reactivity control mechanism is simulated using FSI method for design verification and pump sizing. The simulation is done in CFD domain with UDF. The pressure drop is changed slightly by flow rates. It means that the pressure drop is mainly determined by weight of moving part. The simulated velocity of piston is linearly proportional to flow rates so the pump can be sized easily according to the rising and drop time requirement of the safety rod using the simulation results.
An introduction to computer simulation methods applications to physical systems
Gould, Harvey; Christian, Wolfgang
2007-01-01
Now in its third edition, this book teaches physical concepts using computer simulations. The text incorporates object-oriented programming techniques and encourages readers to develop good programming habits in the context of doing physics. Designed for readers at all levels , An Introduction to Computer Simulation Methods uses Java, currently the most popular programming language. Introduction, Tools for Doing Simulations, Simulating Particle Motion, Oscillatory Systems, Few-Body Problems: The Motion of the Planets, The Chaotic Motion of Dynamical Systems, Random Processes, The Dynamics of Many Particle Systems, Normal Modes and Waves, Electrodynamics, Numerical and Monte Carlo Methods, Percolation, Fractals and Kinetic Growth Models, Complex Systems, Monte Carlo Simulations of Thermal Systems, Quantum Systems, Visualization and Rigid Body Dynamics, Seeing in Special and General Relativity, Epilogue: The Unity of Physics For all readers interested in developing programming habits in the context of doing phy...
A simulation based engineering method to support HAZOP studies
DEFF Research Database (Denmark)
Enemark-Rasmussen, Rasmus; Cameron, David; Angelo, Per Bagge
2012-01-01
HAZOP is the most commonly used process hazard analysis tool in industry, a systematic yet tedious and time consuming method. The aim of this study is to explore the feasibility of process dynamic simulations to facilitate the HAZOP studies. We propose a simulation-based methodology to complement...... the conventional HAZOP procedure. The method systematically generates failure scenarios by considering process equipment deviations with pre-defined failure modes. The effect of failure scenarios is then evaluated using dynamic simulations -in this study the K-Spice® software used. The consequences of each failure...... model as case study....
Directory of Open Access Journals (Sweden)
Chander Prabha
2016-09-01
Full Text Available The data loss and disconnection of nodes are frequent in the opportunistic networks. The social information plays an important role in reducing the data loss because it depends on the connectivity of nodes. The appropriate selection of next hop based on social information is critical for improving the performance of routing in opportunistic networks. The frequent disconnection problem is overcome by optimising the social information with Ant Colony Optimization method which depends on the topology of opportunistic network. The proposed protocol is examined thoroughly via analysis and simulation in order to assess their performance in comparison with other social based routing protocols in opportunistic network under various parameters settings.
Outlier Detection Method Use for the Network Flow Anomaly Detection
Directory of Open Access Journals (Sweden)
Rimas Ciplinskas
2016-06-01
Full Text Available New and existing methods of cyber-attack detection are constantly being developed and improved because there is a great number of attacks and the demand to protect from them. In prac-tice, current methods of attack detection operates like antivirus programs, i. e. known attacks signatures are created and attacks are detected by using them. These methods have a drawback – they cannot detect new attacks. As a solution, anomaly detection methods are used. They allow to detect deviations from normal network behaviour that may show a new type of attack. This article introduces a new method that allows to detect network flow anomalies by using local outlier factor algorithm. Accom-plished research allowed to identify groups of features which showed the best results of anomaly flow detection according the highest values of precision, recall and F-measure.
Baker-Doyle, Kira J.
2015-01-01
Social network research on teachers and schools has risen exponentially in recent years as an innovative method to reveal the role of social networks in education. However, scholars are still exploring ways to incorporate traditional quantitative methods of Social Network Analysis (SNA) with qualitative approaches to social network research. This…
Reverse Engineering Cellular Networks with Information Theoretic Methods
Directory of Open Access Journals (Sweden)
Julio R. Banga
2013-05-01
Full Text Available Building mathematical models of cellular networks lies at the core of systems biology. It involves, among other tasks, the reconstruction of the structure of interactions between molecular components, which is known as network inference or reverse engineering. Information theory can help in the goal of extracting as much information as possible from the available data. A large number of methods founded on these concepts have been proposed in the literature, not only in biology journals, but in a wide range of areas. Their critical comparison is difficult due to the different focuses and the adoption of different terminologies. Here we attempt to review some of the existing information theoretic methodologies for network inference, and clarify their differences. While some of these methods have achieved notable success, many challenges remain, among which we can mention dealing with incomplete measurements, noisy data, counterintuitive behaviour emerging from nonlinear relations or feedback loops, and computational burden of dealing with large data sets.
A tool for simulating parallel branch-and-bound methods
Directory of Open Access Journals (Sweden)
Golubeva Yana
2016-01-01
Full Text Available The Branch-and-Bound method is known as one of the most powerful but very resource consuming global optimization methods. Parallel and distributed computing can efficiently cope with this issue. The major difficulty in parallel B&B method is the need for dynamic load redistribution. Therefore design and study of load balancing algorithms is a separate and very important research topic. This paper presents a tool for simulating parallel Branchand-Bound method. The simulator allows one to run load balancing algorithms with various numbers of processors, sizes of the search tree, the characteristics of the supercomputer’s interconnect thereby fostering deep study of load distribution strategies. The process of resolution of the optimization problem by B&B method is replaced by a stochastic branching process. Data exchanges are modeled using the concept of logical time. The user friendly graphical interface to the simulator provides efficient visualization and convenient performance analysis.
Simulated Annealing Technique for Routing in a Rectangular Mesh Network
Directory of Open Access Journals (Sweden)
Noraziah Adzhar
2014-01-01
Full Text Available In the process of automatic design for printed circuit boards (PCBs, the phase following cell placement is routing. On the other hand, routing process is a notoriously difficult problem, and even the simplest routing problem which consists of a set of two-pin nets is known to be NP-complete. In this research, our routing region is first tessellated into a uniform Nx×Ny array of square cells. The ultimate goal for a routing problem is to achieve complete automatic routing with minimal need for any manual intervention. Therefore, shortest path for all connections needs to be established. While classical Dijkstra’s algorithm guarantees to find shortest path for a single net, each routed net will form obstacles for later paths. This will add complexities to route later nets and make its routing longer than the optimal path or sometimes impossible to complete. Today’s sequential routing often applies heuristic method to further refine the solution. Through this process, all nets will be rerouted in different order to improve the quality of routing. Because of this, we are motivated to apply simulated annealing, one of the metaheuristic methods to our routing model to produce better candidates of sequence.
Credibility and validation of simulation models for tactical IP networks
Boltjes, B.; Thiele, F.; Diaz, I.F.
2007-01-01
The task of TNO is to provide predictions of the scalability and performance of the new all-IP tactical networks of the Royal Netherlands Army (RNLA) that are likely to be fielded. The inherent properties of fielded tactical networks, such as low bandwidth and Quality of Service (QoS) policies
Evaluation and Simulation of Common Video Conference Traffics in Communication Networks
Directory of Open Access Journals (Sweden)
Farhad faghani
2014-01-01
Full Text Available Multimedia traffics are the basic traffics in data communication networks. Especially Video conferences are the most desirable traffics in huge networks(wired, wireless, …. Traffic modeling can help us to evaluate the real networks. So, in order to have good services in data communication networks which provide multimedia services, QoS will be very important .In this research we tried to have an exact traffic model design and simulation to overcome QoS challenges. Also, we predict bandwidth by Kalman filter in Ethernet networks.
Permanent Set of Cross-Linking Networks: Comparison of Theory with Molecular Dynamics Simulations
DEFF Research Database (Denmark)
Rottach, Dana R.; Curro, John G.; Budzien, Joanne
2006-01-01
The permanent set of cross-linking networks is studied by molecular dynamics. The uniaxial stress for a bead-spring polymer network is investigated as a function of strain and cross-link density history, where cross-links are introduced in unstrained and strained networks. The permanent set...... is found from the strain of the network after it returns to the state-of-ease where the stress is zero. The permanent set simulations are compared with theory using the independent network hypothesis, together with the various theoretical rubber elasticity theories: affine, phantom, constrained junction...
Impact of Loss Synchronization on Reliable High Speed Networks: A Model Based Simulation
Directory of Open Access Journals (Sweden)
Suman Kumar
2014-01-01
Full Text Available Contemporary nature of network evolution demands for simulation models which are flexible, scalable, and easily implementable. In this paper, we propose a fluid based model for performance analysis of reliable high speed networks. In particular, this paper aims to study the dynamic relationship between congestion control algorithms and queue management schemes, in order to develop a better understanding of the causal linkages between the two. We propose a loss synchronization module which is user configurable. We validate our model through simulations under controlled settings. Also, we present a performance analysis to provide insights into two important issues concerning 10 Gbps high speed networks: (i impact of bottleneck buffer size on the performance of 10 Gbps high speed network and (ii impact of level of loss synchronization on link utilization-fairness tradeoffs. The practical impact of the proposed work is to provide design guidelines along with a powerful simulation tool to protocol designers and network developers.
Simulation of mixed switched-capacitor/digital networks with signal-driven switches
Suyama, Ken; Tsividis, Yannis P.; Fang, San-Chin
1990-12-01
The simulation of mixed switched-capacitor/digital (SC/D) networks containing capacitors, independent and linear-dependent voltage sources, switches controlled either by periodic or nonperiodic Boolean signals, latched comparators, and logic gates is considered. A unified linear switched-capacitor network (SCN) and mixed SC/D network simulator, SWITCAP2, and its applications to several widely used and novel nonlinear SCNs are discussed. The switches may be controlled by periodic waveforms and by nonperiodic waveforms from the outputs of comparators and logic gates. The signal-dependent modification of network topology through the comparators, logic gates, and signal-driven switches makes the modeling of various nonlinear switched-capacitor circuits possible. Simulation results for a pulse-code modulation (PCM) voice encoder, a sigma-delta modulator, a neural network, and a phase-locked loop (PLL) are presented to demonstrate the flexibility of the approach.
Enterprise Networks for Competences Exchange: A Simulation Model
Remondino, Marco; Pironti, Marco; Pisano, Paola
A business process is a set of logically related tasks performed to achieve a defined business and related to improving organizational processes. Process innovation can happen at various levels: incrementally, redesign of existing processes, new processes. The knowledge behind process innovation can be shared, acquired, changed and increased by the enterprises inside a network. An enterprise can decide to exploit innovative processes it owns, thus potentially gaining competitive advantage, but risking, in turn, that other players could reach the same technological levels. Or it could decide to share it, in exchange for other competencies or money. These activities could be the basis for a network formation and/or impact the topology of an existing network. In this work an agent based model is introduced (E3), aiming to explore how a process innovation can facilitate network formation, affect its topology, induce new players to enter the market and spread onto the network by being shared or developed by new players.
National Research Council Canada - National Science Library
Cheung, Kit; Schultz, Simon R; Luk, Wayne
2015-01-01
NeuroFlow is a scalable spiking neural network simulation platform for off-the-shelf high performance computing systems using customizable hardware processors such as Field-Programmable Gate Arrays (FPGAs...
Directory of Open Access Journals (Sweden)
Guy Pujolle
2010-01-01
Full Text Available We present a simulation platform for access selection algorithms in heterogeneous wireless networks, called “ABCDecision”. The simulator implements the different parts of an Always Best Connected (ABC system, including Access Technology Selector (ATS, Radio Access Networks (RANs, and users. After describing the architecture of the simulator, we show an overview of the existing decision algorithms for access selection. Then we propose a new selection algorithm in heterogeneous networks and we run a set of simulations to evaluate the performance of the proposed algorithm in comparison with the existing ones. The performance results, in terms of the occupancy rate, show that our algorithm achieves a load balancing distribution between networks by taking into consideration the capacities of the available cells.
Assessing Partnership Alternatives in an IT Network Employing Analytical Methods
Directory of Open Access Journals (Sweden)
Vahid Reza Salamat
2016-01-01
Full Text Available One of the main critical success factors for the companies is their ability to build and maintain an effective collaborative network. This is more critical in the IT industry where the development of sustainable competitive advantage requires an integration of various resources, platforms, and capabilities provided by various actors. Employing such a collaborative network will dramatically change the operations management and promote flexibility and agility. Despite its importance, there is a lack of an analytical tool on collaborative network building process. In this paper, we propose an optimization model employing AHP and multiobjective programming for collaborative network building process based on two interorganizational relationships’ theories, namely, (i transaction cost theory and (ii resource-based view, which are representative of short-term and long-term considerations. The five different methods were employed to solve the formulation and their performances were compared. The model is implemented in an IT company who was in process of developing a large-scale enterprise resource planning (ERP system. The results show that the collaborative network formed through this selection process was more efficient in terms of cost, time, and development speed. The framework offers novel theoretical underpinning and analytical solutions and can be used as an effective tool in selecting network alternatives.
Comparing Intravenous Insertion Instructional Methods with Haptic Simulators
Directory of Open Access Journals (Sweden)
Lenora A. McWilliams
2017-01-01
Full Text Available Objective. The objective of this review was to compare traditional intravenous (IV insertion instructional methods with the use of haptic IV simulators. Design. An integrative research design was used to analyze the current literature. Data Sources. A search was conducted using key words intravenous (IV insertion or cannulation or venipuncture and simulation from 2000 to 2015 in the English language. The databases included Academic Search Complete, CINAHL Complete, Education Resource Information Center, and Medline. Review Methods. Whittemore and Knafl’s (2005 strategies were used to critique the articles for themes and similarities. Results. Comparisons of outcomes between traditional IV instructional methods and the use of haptic IV simulators continue to show various results. Positive results indicate that the use of the haptic IV simulator decreases both band constriction and total procedure time. While students are satisfied with practicing on the haptic simulators, they still desire faculty involvement. Conclusion. Combining the haptic IV simulator with practical experience on the IV arm may be the best practice for learning IV insertion. Research employing active learning strategies while using a haptic IV simulator during the learning process may reduce cost and faculty time.
Zhou, Wen; Koptyug, Nikita; Ye, Shutao; Jia, Yifan; Lu, Xiaolong
2016-01-01
As computer science and complex network theory develop, non-cooperative games and their formation and application on complex networks have been important research topics. In the inter-firm innovation network, it is a typical game behavior for firms to invest in their alliance partners. Accounting for the possibility that firms can be resource constrained, this paper analyzes a coordination game using the Nash bargaining solution as allocation rules between firms in an inter-firm innovation network. We build an extended inter-firm n-player game based on nonidealized conditions, describe four investment strategies and simulate the strategies on an inter-firm innovation network in order to compare their performance. By analyzing the results of our experiments, we find that our proposed greedy strategy is the best-performing in most situations. We hope this study provides a theoretical insight into how firms make investment decisions.
Directory of Open Access Journals (Sweden)
Wen Zhou
Full Text Available As computer science and complex network theory develop, non-cooperative games and their formation and application on complex networks have been important research topics. In the inter-firm innovation network, it is a typical game behavior for firms to invest in their alliance partners. Accounting for the possibility that firms can be resource constrained, this paper analyzes a coordination game using the Nash bargaining solution as allocation rules between firms in an inter-firm innovation network. We build an extended inter-firm n-player game based on nonidealized conditions, describe four investment strategies and simulate the strategies on an inter-firm innovation network in order to compare their performance. By analyzing the results of our experiments, we find that our proposed greedy strategy is the best-performing in most situations. We hope this study provides a theoretical insight into how firms make investment decisions.
Energy Technology Data Exchange (ETDEWEB)
Aid, R.
1998-01-07
This work comes from an industrial problem of validating numerical solutions of ordinary differential equations modeling power systems. This problem is solved using asymptotic estimators of the global error. Four techniques are studied: Richardson estimator (RS), Zadunaisky's techniques (ZD), integration of the variational equation (EV), and Solving for the correction (SC). We give some precisions on the relative order of SC w.r.t. the order of the numerical method. A new variant of ZD is proposed that uses the Modified Equation. In the case of variable step-size, it is shown that under suitable restriction, on the hypothesis of the step-size selection, ZD and SC are still valid. Moreover, some Runge-Kutta methods are shown to need less hypothesis on the step-sizes to exhibit a valid order of convergence for ZD and SC. Numerical tests conclude this analysis. Industrial cases are given. Finally, an algorithm to avoid the a priori specification of the integration path for complex time differential equations is proposed. (author)
An efficient neural network based method for medical image segmentation.
Torbati, Nima; Ayatollahi, Ahmad; Kermani, Ali
2014-01-01
The aim of this research is to propose a new neural network based method for medical image segmentation. Firstly, a modified self-organizing map (SOM) network, named moving average SOM (MA-SOM), is utilized to segment medical images. After the initial segmentation stage, a merging process is designed to connect the objects of a joint cluster together. A two-dimensional (2D) discrete wavelet transform (DWT) is used to build the input feature space of the network. The experimental results show that MA-SOM is robust to noise and it determines the input image pattern properly. The segmentation results of breast ultrasound images (BUS) demonstrate that there is a significant correlation between the tumor region selected by a physician and the tumor region segmented by our proposed method. In addition, the proposed method segments X-ray computerized tomography (CT) and magnetic resonance (MR) head images much better than the incremental supervised neural network (ISNN) and SOM-based methods. © 2013 Published by Elsevier Ltd.
A hierarchical network modeling method for railway tunnels safety assessment
Zhou, Jin; Xu, Weixiang; Guo, Xin; Liu, Xumin
2017-02-01
Using network theory to model risk-related knowledge on accidents is regarded as potential very helpful in risk management. A large amount of defects detection data for railway tunnels is collected in autumn every year in China. It is extremely important to discover the regularities knowledge in database. In this paper, based on network theories and by using data mining techniques, a new method is proposed for mining risk-related regularities to support risk management in railway tunnel projects. A hierarchical network (HN) model which takes into account the tunnel structures, tunnel defects, potential failures and accidents is established. An improved Apriori algorithm is designed to rapidly and effectively mine correlations between tunnel structures and tunnel defects. Then an algorithm is presented in order to mine the risk-related regularities table (RRT) from the frequent patterns. At last, a safety assessment method is proposed by consideration of actual defects and possible risks of defects gained from the RRT. This method cannot only generate the quantitative risk results but also reveal the key defects and critical risks of defects. This paper is further development on accident causation network modeling methods which can provide guidance for specific maintenance measure.
pSSAlib: The partial-propensity stochastic chemical network simulator.
Directory of Open Access Journals (Sweden)
Oleksandr Ostrenko
2017-12-01
Full Text Available Chemical reaction networks are ubiquitous in biology, and their dynamics is fundamentally stochastic. Here, we present the software library pSSAlib, which provides a complete and concise implementation of the most efficient partial-propensity methods for simulating exact stochastic chemical kinetics. pSSAlib can import models encoded in Systems Biology Markup Language, supports time delays in chemical reactions, and stochastic spatiotemporal reaction-diffusion systems. It also provides tools for statistical analysis of simulation results and supports multiple output formats. It has previously been used for studies of biochemical reaction pathways and to benchmark other stochastic simulation methods. Here, we describe pSSAlib in detail and apply it to a new model of the endocytic pathway in eukaryotic cells, leading to the discovery of a stochastic counterpart of the cut-out switch motif underlying early-to-late endosome conversion. pSSAlib is provided as a stand-alone command-line tool and as a developer API. We also provide a plug-in for the SBMLToolbox. The open-source code and pre-packaged installers are freely available from http://mosaic.mpi-cbg.de.
pSSAlib: The partial-propensity stochastic chemical network simulator.
Ostrenko, Oleksandr; Incardona, Pietro; Ramaswamy, Rajesh; Brusch, Lutz; Sbalzarini, Ivo F
2017-12-01
Chemical reaction networks are ubiquitous in biology, and their dynamics is fundamentally stochastic. Here, we present the software library pSSAlib, which provides a complete and concise implementation of the most efficient partial-propensity methods for simulating exact stochastic chemical kinetics. pSSAlib can import models encoded in Systems Biology Markup Language, supports time delays in chemical reactions, and stochastic spatiotemporal reaction-diffusion systems. It also provides tools for statistical analysis of simulation results and supports multiple output formats. It has previously been used for studies of biochemical reaction pathways and to benchmark other stochastic simulation methods. Here, we describe pSSAlib in detail and apply it to a new model of the endocytic pathway in eukaryotic cells, leading to the discovery of a stochastic counterpart of the cut-out switch motif underlying early-to-late endosome conversion. pSSAlib is provided as a stand-alone command-line tool and as a developer API. We also provide a plug-in for the SBMLToolbox. The open-source code and pre-packaged installers are freely available from http://mosaic.mpi-cbg.de.
pSSAlib: The partial-propensity stochastic chemical network simulator
Ostrenko, Oleksandr; Incardona, Pietro; Ramaswamy, Rajesh
2017-01-01
Chemical reaction networks are ubiquitous in biology, and their dynamics is fundamentally stochastic. Here, we present the software library pSSAlib, which provides a complete and concise implementation of the most efficient partial-propensity methods for simulating exact stochastic chemical kinetics. pSSAlib can import models encoded in Systems Biology Markup Language, supports time delays in chemical reactions, and stochastic spatiotemporal reaction-diffusion systems. It also provides tools for statistical analysis of simulation results and supports multiple output formats. It has previously been used for studies of biochemical reaction pathways and to benchmark other stochastic simulation methods. Here, we describe pSSAlib in detail and apply it to a new model of the endocytic pathway in eukaryotic cells, leading to the discovery of a stochastic counterpart of the cut-out switch motif underlying early-to-late endosome conversion. pSSAlib is provided as a stand-alone command-line tool and as a developer API. We also provide a plug-in for the SBMLToolbox. The open-source code and pre-packaged installers are freely available from http://mosaic.mpi-cbg.de. PMID:29206229
A Network Reconfiguration Method Considering Data Uncertainties in Smart Distribution Networks
Directory of Open Access Journals (Sweden)
Ke-yan Liu
2017-05-01
Full Text Available This work presents a method for distribution network reconfiguration with the simultaneous consideration of distributed generation (DG allocation. The uncertainties of load fluctuation before the network reconfiguration are also considered. Three optimal objectives, including minimal line loss cost, minimum Expected Energy Not Supplied, and minimum switch operation cost, are investigated. The multi-objective optimization problem is further transformed into a single-objective optimization problem by utilizing weighting factors. The proposed network reconfiguration method includes two periods. The first period is to create a feasible topology network by using binary particle swarm optimization (BPSO. Then the DG allocation problem is solved by utilizing sensitivity analysis and a Harmony Search algorithm (HSA. In the meanwhile, interval analysis is applied to deal with the uncertainties of load and devices parameters. Test cases are studied using the standard IEEE 33-bus and PG&E 69-bus systems. Different scenarios and comparisons are analyzed in the experiments. The results show the applicability of the proposed method. The performance analysis of the proposed method is also investigated. The computational results indicate that the proposed network reconfiguration algorithm is feasible.
A numerical simulation method and analysis of a complete thermoacoustic-Stirling engine.
Ling, Hong; Luo, Ercang; Dai, Wei
2006-12-22
Thermoacoustic prime movers can generate pressure oscillation without any moving parts on self-excited thermoacoustic effect. The details of the numerical simulation methodology for thermoacoustic engines are presented in the paper. First, a four-port network method is used to build the transcendental equation of complex frequency as a criterion to judge if temperature distribution of the whole thermoacoustic system is correct for the case with given heating power. Then, the numerical simulation of a thermoacoustic-Stirling heat engine is carried out. It is proved that the numerical simulation code can run robustly and output what one is interested in. Finally, the calculated results are compared with the experiments of the thermoacoustic-Stirling heat engine (TASHE). It shows that the numerical simulation can agrees with the experimental results with acceptable accuracy.
Comparison of Neural Network Error Measures for Simulation of Slender Marine Structures
DEFF Research Database (Denmark)
Christiansen, Niels H.; Voie, Per Erlend Torbergsen; Winther, Ole
2014-01-01
platform is designed and tested. The purpose of setting up the network is to reduce calculation time in a fatigue life analysis. Therefore, the networks trained on different error functions are compared with respect to accuracy of rain flow counts of stress cycles over a number of time series simulations......Training of an artificial neural network (ANN) adjusts the internal weights of the network in order to minimize a predefined error measure. This error measure is given by an error function. Several different error functions are suggested in the literature. However, the far most common measure...... for regression is the mean square error. This paper looks into the possibility of improving the performance of neural networks by selecting or defining error functions that are tailor-made for a specific objective. A neural network trained to simulate tension forces in an anchor chain on a floating offshore...
Application of Neural Network and Simulation Modeling to Evaluate Russian Banks’ Performance
Sharma, Satish; Shebalkov, Mikhail
2013-01-01
This paper presents an application of neural network and simulation modeling to analyze and predict the performance of 883 Russian Banks over the period 2000-2010. Correlation analysis was performed to obtain key financial indicators which reflect the leverage, liquidity, profitability and size of Banks. Neural network was trained over the entire dataset, and then simulation modeling was performed generating values which are distributed with Largest Extreme Value and Loglogistic distributions...
Comparison of EBSD patterns simulated by two multislice methods.
Liu, Q B; Cai, C Y; Zhou, G W; Wang, Y G
2016-10-01
The extraction of crystallography information from electron backscatter diffraction (EBSD) patterns can be facilitated by diffraction simulations based on the dynamical electron diffraction theory. In this work, the EBSD patterns are successfully simulated by two multislice methods, that is, the real space (RS) method and the revised real space (RRS) method. The calculation results by the two multislice methods are compared and analyzed in detail with respect to different accelerating voltages, Debye-Waller factors and aperture radii. It is found that the RRS method provides a larger view field of the EBSD patterns than that by the RS method under the same calculation conditions. Moreover, the Kikuchi bands of the EBSD patterns obtained by the RRS method have a better match with the experimental patterns than those by the RS method. Especially, the lattice parameters obtained by the RRS method are more accurate than those by the RS method. These results demonstrate that the RRS method is more accurate for simulating the EBSD patterns than the RS method within the accepted computation time. © 2016 The Authors Journal of Microscopy © 2016 Royal Microscopical Society.
Dynamic Subsidy Method for Congestion Management in Distribution Networks
Huang, Shaojun; Wu, Qiuwei
2016-01-01
Dynamic subsidy (DS) is a locational price paid by the distribution system operator (DSO) to its customers in order to shift energy consumption to designated hours and nodes. It is promising for demand side management and congestion management. This paper proposes a new DS method for congestion management in distribution networks, including the market mechanism, the mathematical formulation through a two-level optimization, and the method solving the optimization by tightening the constraints...
Less Developed Countries Energy System Network Simulator, LDC-ESNS: a brief description
Energy Technology Data Exchange (ETDEWEB)
Reisman, A; Malone, R
1978-04-01
Prepared for the Brookhaven National Laboratory Developing Countries Energy Program, this report describes the Less Developed Countries Energy System Network Simulator (LDC-ESNS), a tool which provides a quantitative representation of the energy system of an LDC. The network structure of the energy supply and demand system, the model inputs and outputs, and the possible uses of the model for analysis are described.
Multilevel panel method for wind turbine rotor flow simulations
van Garrel, Arne
2016-01-01
Simulation methods of wind turbine aerodynamics currently in use mainly fall into two categories: the first is the group of traditional low-fidelity engineering models and the second is the group of computationally expensive CFD methods based on the Navier-Stokes equations. For an engineering
The afforestation problem: a heuristic method based on simulated annealing
DEFF Research Database (Denmark)
Vidal, Rene Victor Valqui
1992-01-01
This paper presents the afforestation problem, that is the location and design of new forest compartments to be planted in a given area. This optimization problem is solved by a two-step heuristic method based on simulated annealing. Tests and experiences with this method are also presented....
Nonequilibrium relaxation method – An alternative simulation strategy
Indian Academy of Sciences (India)
Abstract. One well-established simulation strategy to study the thermal phases and transitions of a given microscopic model system is the so-called equilibrium method, in which one first realizes the equilibrium ensemble of a finite system and then extrapolates the results to infinite system. This equilibrium method traces ...
A simple method for potential flow simulation of cascades
Indian Academy of Sciences (India)
Department of Mechanical Engineering, Indian Institute of Science,. Bangalore 560 012 e-mail: raghu@mecheng.iisc.ernet.in. MS received 21 April 2009; revised 1 February 2010; accepted 23 August 2010. Abstract. A simple method using a combination of conformal mapping and vortex panel method to simulate potential ...
Hahne, Jan; Helias, Moritz; Kunkel, Susanne; Igarashi, Jun; Bolten, Matthias; Frommer, Andreas; Diesmann, Markus
2015-01-01
Contemporary simulators for networks of point and few-compartment model neurons come with a plethora of ready-to-use neuron and synapse models and support complex network topologies. Recent technological advancements have broadened the spectrum of application further to the efficient simulation of brain-scale networks on supercomputers. In distributed network simulations the amount of spike data that accrues per millisecond and process is typically low, such that a common optimization strategy is to communicate spikes at relatively long intervals, where the upper limit is given by the shortest synaptic transmission delay in the network. This approach is well-suited for simulations that employ only chemical synapses but it has so far impeded the incorporation of gap-junction models, which require instantaneous neuronal interactions. Here, we present a numerical algorithm based on a waveform-relaxation technique which allows for network simulations with gap junctions in a way that is compatible with the delayed communication strategy. Using a reference implementation in the NEST simulator, we demonstrate that the algorithm and the required data structures can be smoothly integrated with existing code such that they complement the infrastructure for spiking connections. To show that the unified framework for gap-junction and spiking interactions achieves high performance and delivers high accuracy in the presence of gap junctions, we present benchmarks for workstations, clusters, and supercomputers. Finally, we discuss limitations of the novel technology. PMID:26441628
A Network Centrality Method for the Rating Problem
2015-01-01
We propose a new method for aggregating the information of multiple users rating multiple items. Our approach is based on the network relations induced between items by the rating activity of the users. Our method correlates better than the simple average with respect to the original rankings of the users, and besides, it is computationally more efficient than other methods proposed in the literature. Moreover, our method is able to discount the information that would be obtained adding to the system additional users with a systematically biased rating activity. PMID:25830502
Steel Fibre Reinforced Concrete Simulation with the SPH Method
Hušek, Martin; Kala, Jiří; Král, Petr; Hokeš, Filip
2017-10-01
Steel fibre reinforced concrete (SFRC) is very popular in many branches of civil engineering. Thanks to its increased ductility, it is able to resist various types of loading. When designing a structure, the mechanical behaviour of SFRC can be described by currently available material models (with equivalent material for example) and therefore no problems arise with numerical simulations. But in many scenarios, e.g. high speed loading, it would be a mistake to use such an equivalent material. Physical modelling of the steel fibres used in concrete is usually problematic, though. It is necessary to consider the fact that mesh-based methods are very unsuitable for high-speed simulations with regard to the issues that occur due to the effect of excessive mesh deformation. So-called meshfree methods are much more suitable for this purpose. The Smoothed Particle Hydrodynamics (SPH) method is currently the best choice, thanks to its advantages. However, a numerical defect known as tensile instability may appear when the SPH method is used. It causes the development of numerical (false) cracks, making simulations of ductile types of failure significantly more difficult to perform. The contribution therefore deals with the description of a procedure for avoiding this defect and successfully simulating the behaviour of SFRC with the SPH method. The essence of the problem lies in the choice of coordinates and the description of the integration domain derived from them – spatial (Eulerian kernel) or material coordinates (Lagrangian kernel). The contribution describes the behaviour of both formulations. Conclusions are drawn from the fundamental tasks, and the contribution additionally demonstrates the functionality of SFRC simulations. The random generation of steel fibres and their inclusion in simulations are also discussed. The functionality of the method is supported by the results of pressure test simulations which compare various levels of fibre reinforcement of SFRC
A nondissipative simulation method for the drift kinetic equation
Energy Technology Data Exchange (ETDEWEB)
Watanabe, Tomo-Hiko; Sugama, Hideo; Sato, Tetsuya
2001-07-01
With the aim to study the ion temperature gradient (ITG) driven turbulence, a nondissipative kinetic simulation scheme is developed and comprehensively benchmarked. The new simulation method preserving the time-reversibility of basic kinetic equations can successfully reproduce the analytical solutions of asymmetric three-mode ITG equations which are extended to provide a more general reference for benchmarking than the previous work [T.-H. Watanabe, H. Sugama, and T. Sato: Phys. Plasmas 7 (2000) 984]. It is also applied to a dissipative three-mode system, and shows a good agreement with the analytical solution. The nondissipative simulation result of the ITG turbulence accurately satisfies the entropy balance equation. Usefulness of the nondissipative method for the drift kinetic simulations is confirmed in comparisons with other dissipative schemes. (author)
DEFF Research Database (Denmark)
Silva, Filipe Faria Da; Bak, Claus Leth; Balle Holst, Per
2012-01-01
. The simulation of electromagnetic transients in cable-based networks requires larger computational effort than in an equivalent overhead-line (OHL)-based network. Therefore, the method is demonstrated for the former, with the cases of OHL-based networks and hybrid cable-OHL networks addressed in a future paper......The simulation of an electromagnetic transient is only as good as the model's data and the level of detail put into the modeling. One parameter with influence in the results is the size of the modeling of the area around the switched-on line. If the area is too small, the results are inaccurate....... If the area is too large, the simulation requires a long period of time and numerical problems are more likely to exist. This paper proposes a method that can be used to estimate the depth of the modeling area using the grid layout, which can be obtained directly from a PSS/E file, or equivalent...
Wang, Jie-sheng; Li, Shu-xia; Gao, Jie
2014-01-01
For meeting the real-time fault diagnosis and the optimization monitoring requirements of the polymerization kettle in the polyvinyl chloride resin (PVC) production process, a fault diagnosis strategy based on the self-organizing map (SOM) neural network is proposed. Firstly, a mapping between the polymerization process data and the fault pattern is established by analyzing the production technology of polymerization kettle equipment. The particle swarm optimization (PSO) algorithm with a new dynamical adjustment method of inertial weights is adopted to optimize the structural parameters of SOM neural network. The fault pattern classification of the polymerization kettle equipment is to realize the nonlinear mapping from symptom set to fault set according to the given symptom set. Finally, the simulation experiments of fault diagnosis are conducted by combining with the industrial on-site historical data of the polymerization kettle and the simulation results show that the proposed PSO-SOM fault diagnosis strategy is effective.
Directory of Open Access Journals (Sweden)
Jie-sheng Wang
2014-01-01
Full Text Available For meeting the real-time fault diagnosis and the optimization monitoring requirements of the polymerization kettle in the polyvinyl chloride resin (PVC production process, a fault diagnosis strategy based on the self-organizing map (SOM neural network is proposed. Firstly, a mapping between the polymerization process data and the fault pattern is established by analyzing the production technology of polymerization kettle equipment. The particle swarm optimization (PSO algorithm with a new dynamical adjustment method of inertial weights is adopted to optimize the structural parameters of SOM neural network. The fault pattern classification of the polymerization kettle equipment is to realize the nonlinear mapping from symptom set to fault set according to the given symptom set. Finally, the simulation experiments of fault diagnosis are conducted by combining with the industrial on-site historical data of the polymerization kettle and the simulation results show that the proposed PSO-SOM fault diagnosis strategy is effective.
Physics-based statistical model and simulation method of RF propagation in urban environments
Pao, Hsueh-Yuan; Dvorak, Steven L.
2010-09-14
A physics-based statistical model and simulation/modeling method and system of electromagnetic wave propagation (wireless communication) in urban environments. In particular, the model is a computationally efficient close-formed parametric model of RF propagation in an urban environment which is extracted from a physics-based statistical wireless channel simulation method and system. The simulation divides the complex urban environment into a network of interconnected urban canyon waveguides which can be analyzed individually; calculates spectral coefficients of modal fields in the waveguides excited by the propagation using a database of statistical impedance boundary conditions which incorporates the complexity of building walls in the propagation model; determines statistical parameters of the calculated modal fields; and determines a parametric propagation model based on the statistical parameters of the calculated modal fields from which predictions of communications capability may be made.
[Pollen information of airborne Japanese cedar pollen using a simulation method].
Takahashi, Y; Kawashima, S; Aikawa, S
1996-04-01
We have developed a simulation method of airborne Cryptomeria japonica pollen distribution on a map displayed visually on a TV screen. Each patient can be available the information where the place he or she lives. The pollen season in 1995, we served the information about airborne pollen distribution on a map and C. japonica flowering areas on a map to a local resident through TV broadcasting. To verify the simulation method, comparison was made between the result from actual pollen counting and from simulation. It was clarified that both results were comparatively agreed on daily basis. Problem about compatibility among personal computers were solved to rewrite the program of displaying the image using Visual Basic for MS-Windows and create image files. The files can be read continuously by animation software. We think the information can be offered to local resident, local clinicians and patients waiting at the clinics by use of computer networks.
Human metabolic network: reconstruction, simulation, and applications in systems biology.
Wu, Ming; Chan, Christina
2012-03-02
Metabolism is crucial to cell growth and proliferation. Deficiency or alterations in metabolic functions are known to be involved in many human diseases. Therefore, understanding the human metabolic system is important for the study and treatment of complex diseases. Current reconstructions of the global human metabolic network provide a computational platform to integrate genome-scale information on metabolism. The platform enables a systematic study of the regulation and is applicable to a wide variety of cases, wherein one could rely on in silico perturbations to predict novel targets, interpret systemic effects, and identify alterations in the metabolic states to better understand the genotype-phenotype relationships. In this review, we describe the reconstruction of the human metabolic network, introduce the constraint based modeling approach to analyze metabolic networks, and discuss systems biology applications to study human physiology and pathology. We highlight the challenges and opportunities in network reconstruction and systems modeling of the human metabolic system.
Adaptive implicit method for thermal compositional reservoir simulation
Energy Technology Data Exchange (ETDEWEB)
Agarwal, A.; Tchelepi, H.A. [Society of Petroleum Engineers, Richardson, TX (United States)]|[Stanford Univ., Palo Alto (United States)
2008-10-15
As the global demand for oil increases, thermal enhanced oil recovery techniques are becoming increasingly important. Numerical reservoir simulation of thermal methods such as steam assisted gravity drainage (SAGD) is complex and requires a solution of nonlinear mass and energy conservation equations on a fine reservoir grid. The most currently used technique for solving these equations is the fully IMplicit (FIM) method which is unconditionally stable, allowing for large timesteps in simulation. However, it is computationally expensive. On the other hand, the method known as IMplicit pressure explicit saturations, temperature and compositions (IMPEST) is computationally inexpensive, but it is only conditionally stable and restricts the timestep size. To improve the balance between the timestep size and computational cost, the thermal adaptive IMplicit (TAIM) method uses stability criteria and a switching algorithm, where some simulation variables such as pressure, saturations, temperature, compositions are treated implicitly while others are treated with explicit schemes. This presentation described ongoing research on TAIM with particular reference to thermal displacement processes such as the stability criteria that dictate the maximum allowed timestep size for simulation based on the von Neumann linear stability analysis method; the switching algorithm that adapts labeling of reservoir variables as implicit or explicit as a function of space and time; and, complex physical behaviors such as heat and fluid convection, thermal conduction and compressibility. Key numerical results obtained by enhancing Stanford's General Purpose Research Simulator (GPRS) were also presented along with a list of research challenges. 14 refs., 2 tabs., 11 figs., 1 appendix.
Yu, Zhang; Xiaohui, Song; Jianfang, Li; Fei, Gao
2017-05-01
Cable overheating will lead to the cable insulation level reducing, speed up the cable insulation aging, even easy to cause short circuit faults. Cable overheating risk identification and warning is nessesary for distribution network operators. Cable overheating risk warning method based on impedance parameter estimation is proposed in the paper to improve the safty and reliability operation of distribution network. Firstly, cable impedance estimation model is established by using least square method based on the data from distribiton SCADA system to improve the impedance parameter estimation accuracy. Secondly, calculate the threshold value of cable impedance based on the historical data and the forecast value of cable impedance based on the forecasting data in future from distribiton SCADA system. Thirdly, establish risks warning rules library of cable overheating, calculate the cable impedance forecast value and analysis the change rate of impedance, and then warn the overheating risk of cable line based on the overheating risk warning rules library according to the variation relationship between impedance and line temperature rise. Overheating risk warning method is simulated in the paper. The simulation results shows that the method can identify the imedance and forecast the temperature rise of cable line in distribution network accurately. The result of overheating risk warning can provide decision basis for operation maintenance and repair.
Geostatistic in Reservoir Characterization: from estimation to simulation methods
Mata Lima, H.
2005-01-01
In this article objective have been made to reviews different geostatistical methods available to estimate and simulate petrophysical properties (porosity and permeability) of the reservoir. Different geostatistical techniques that allow the combination of hard and soft data are taken into account and one refers the main reason to use the geostatistical simulation rather than estimation. Uncertainty in reservoir characterization due to variogram assumption, which is a strict mathematical equa...
Dataset for Testing Contamination Source Identification Methods for Water Distribution Networks
This dataset includes the results of a simulation study using the source inversion techniques available in the Water Security Toolkit. The data was created to test the different techniques for accuracy, specificity, false positive rate, and false negative rate. The tests examined different parameters including measurement error, modeling error, injection characteristics, time horizon, network size, and sensor placement. The water distribution system network models that were used in the study are also included in the dataset. This dataset is associated with the following publication:Seth, A., K. Klise, J. Siirola, T. Haxton , and C. Laird. Testing Contamination Source Identification Methods for Water Distribution Networks. Journal of Environmental Division, Proceedings of American Society of Civil Engineers. American Society of Civil Engineers (ASCE), Reston, VA, USA, ., (2016).
A novel word spotting method based on recurrent neural networks.
Frinken, Volkmar; Fischer, Andreas; Manmatha, R; Bunke, Horst
2012-02-01
Keyword spotting refers to the process of retrieving all instances of a given keyword from a document. In the present paper, a novel keyword spotting method for handwritten documents is described. It is derived from a neural network-based system for unconstrained handwriting recognition. As such it performs template-free spotting, i.e., it is not necessary for a keyword to appear in the training set. The keyword spotting is done using a modification of the CTC Token Passing algorithm in conjunction with a recurrent neural network. We demonstrate that the proposed systems outperform not only a classical dynamic time warping-based approach but also a modern keyword spotting system, based on hidden Markov models. Furthermore, we analyze the performance of the underlying neural networks when using them in a recognition task followed by keyword spotting on the produced transcription. We point out the advantages of keyword spotting when compared to classic text line recognition.
How Network Properties Affect One's Ability to Obtain Benefits: A Network Simulation
Trefalt, Špela
2014-01-01
Networks and the social capital that they carry enable people to get things done, to prosper in their careers, and to feel supported. To develop an effective network, one needs to know more than how to make connections with strangers at a reception; understanding the consequences of network properties on one's ability to obtain benefits is…
Directory of Open Access Journals (Sweden)
Xiaoming Zha
2016-11-01
Full Text Available Power hardware-in-the-loop (PHIL systems are advanced, real-time platforms for combined software and hardware testing. Two paramount issues in PHIL simulations are the closed-loop stability and simulation accuracy. This paper presents a virtual impedance (VI method for PHIL simulations that improves the simulation’s stability and accuracy. Through the establishment of an impedance model for a PHIL simulation circuit, which is composed of a voltage-source converter and a simple network, the stability and accuracy of the PHIL system are analyzed. Then, the proposed VI method is implemented in a digital real-time simulator and used to correct the combined impedance in the impedance model, achieving higher stability and accuracy of the results. The validity of the VI method is verified through the PHIL simulation of two typical PHIL examples.
Liu, Huanlin; Xu, Yifan; Chen, Yong; Zhang, Mingjia
2016-09-01
With the development of one point to multiple point applications, network resources become scarcer and wavelength channels become more crowded in optical networks. To improve the bandwidth utilization, the multicast routing algorithm based on network coding can greatly increase the resource utilization, but it is most difficult to maximize the network throughput owing to ignoring the differences between the multicast receiving nodes. For making full use of the destination nodes' receives ability to maximize optical multicast's network throughput, a new optical multicast routing algorithm based on teaching-learning-based optimization (MR-iTLBO) is proposed in the paper. In order to increase the diversity of learning, a self-driven learning method is adopted in MR-iTLBO algorithm, and the mutation operator of genetic algorithm is introduced to prevent the algorithm into a local optimum. For increasing learner's learning efficiency, an adaptive learning factor is designed to adjust the learning process. Moreover, the reconfiguration scheme based on probability vector is devised to expand its global search capability in MR-iTLBO algorithm. The simulation results show that performance in terms of network throughput and convergence rate has been improved significantly with respect to the TLBO and the variant TLBO.
Diagnostic method for induction motor using simplified motor simulator
Doumae, Yukihiro; Konishi, Masami; Imai, Jun; Asada, Hideki; Kitamura, Akira
2001-01-01
In this paper, an identification method of motor parameters for the diagnosis of rotor bar defects in the squirrel cage induction motor is proposed. It is difficult to distinguish the degree of deterioration by a conventional diagnostic method such as Fourier analysis. To overcome the difficulty, a motor simulator is used to identify the degree of deterioration of rotors in the squirrel cage induction motor. Using this method, the deterioration of rotor bars in the motor can be estimated quan...
Validation of Solution Methods for Building Energy Simulation
Crowley, Michael
2006-01-01
The most commonly applied mathematical solution techniques for building energy simulation are response function methods and finite difference methods. The accepted validation methodology in this domain has as its main elements empirical validation, analytical verification and inter-model comparison. Of these, only analytical verification tests the solution method exclusively; but the test examples used are too confined to be representative of the building energy problem. A discriminating and ...
Simulating Hair with the Loosely-Connected Particles Method
Soták, Šimon
2010-01-01
This thesis presents an implementation of the Loosely Connected Particles (LCP) method of hair animation proposed by Bando et al. We updated the method with several modern approaches. Firstly, we implemented two variations of parallel processing for the simulation which di er in work distribution among threads. The results indicate that work is distributed evenly, and thus dynamic distribution is not needed. Secondly, we applied the Deep Opacity Maps method of hair shadowing on the LCP and in...