WorldWideScience

Sample records for randomly generated networks

  1. Generating random networks and graphs

    CERN Document Server

    Coolen, Ton; Roberts, Ekaterina

    2017-01-01

    This book supports researchers who need to generate random networks, or who are interested in the theoretical study of random graphs. The coverage includes exponential random graphs (where the targeted probability of each network appearing in the ensemble is specified), growth algorithms (i.e. preferential attachment and the stub-joining configuration model), special constructions (e.g. geometric graphs and Watts Strogatz models) and graphs on structured spaces (e.g. multiplex networks). The presentation aims to be a complete starting point, including details of both theory and implementation, as well as discussions of the main strengths and weaknesses of each approach. It includes extensive references for readers wishing to go further. The material is carefully structured to be accessible to researchers from all disciplines while also containing rigorous mathematical analysis (largely based on the techniques of statistical mechanics) to support those wishing to further develop or implement the theory of rand...

  2. An adaptive random search for short term generation scheduling with network constraints.

    Directory of Open Access Journals (Sweden)

    J A Marmolejo

    Full Text Available This paper presents an adaptive random search approach to address a short term generation scheduling with network constraints, which determines the startup and shutdown schedules of thermal units over a given planning horizon. In this model, we consider the transmission network through capacity limits and line losses. The mathematical model is stated in the form of a Mixed Integer Non Linear Problem with binary variables. The proposed heuristic is a population-based method that generates a set of new potential solutions via a random search strategy. The random search is based on the Markov Chain Monte Carlo method. The main key of the proposed method is that the noise level of the random search is adaptively controlled in order to exploring and exploiting the entire search space. In order to improve the solutions, we consider coupling a local search into random search process. Several test systems are presented to evaluate the performance of the proposed heuristic. We use a commercial optimizer to compare the quality of the solutions provided by the proposed method. The solution of the proposed algorithm showed a significant reduction in computational effort with respect to the full-scale outer approximation commercial solver. Numerical results show the potential and robustness of our approach.

  3. Engineering applications of fpgas chaotic systems, artificial neural networks, random number generators, and secure communication systems

    CERN Document Server

    Tlelo-Cuautle, Esteban; de la Fraga, Luis Gerardo

    2016-01-01

    This book offers readers a clear guide to implementing engineering applications with FPGAs, from the mathematical description to the hardware synthesis, including discussion of VHDL programming and co-simulation issues. Coverage includes FPGA realizations such as: chaos generators that are described from their mathematical models; artificial neural networks (ANNs) to predict chaotic time series, for which a discussion of different ANN topologies is included, with different learning techniques and activation functions; random number generators (RNGs) that are realized using different chaos generators, and discussions of their maximum Lyapunov exponent values and entropies. Finally, optimized chaotic oscillators are synchronized and realized to implement a secure communication system that processes black and white and grey-scale images. In each application, readers will find VHDL programming guidelines and computer arithmetic issues, along with co-simulation examples with Active-HDL and Simulink. Readers will b...

  4. A Chemical Reaction Network to Generate Random, Power-Law-Distributed Time Intervals.

    Science.gov (United States)

    Krauss, Patrick; Schulze, Holger; Metzner, Claus

    2017-10-06

    In Lévy walks (LWs), particles move with a fixed speed along straight line segments and turn in new directions after random time intervals that are distributed according to a power law. Such LWs are thought to be an advantageous foraging and search strategy for organisms. While complex nervous systems are certainly capable of producing such behavior, it is not clear at present how single-cell organisms can generate the long-term correlated control signals required for a LW. Here, we construct a biochemical reaction system that generates long-time correlated concentration fluctuations of a signaling substance, with a tunable fractional exponent of the autocorrelation function. The network is based on well-known modules, and its basic function is highly robust with respect to the parameter settings.

  5. PUFKEY: A High-Security and High-Throughput Hardware True Random Number Generator for Sensor Networks

    Directory of Open Access Journals (Sweden)

    Dongfang Li

    2015-10-01

    Full Text Available Random number generators (RNG play an important role in many sensor network systems and applications, such as those requiring secure and robust communications. In this paper, we develop a high-security and high-throughput hardware true random number generator, called PUFKEY, which consists of two kinds of physical unclonable function (PUF elements. Combined with a conditioning algorithm, true random seeds are extracted from the noise on the start-up pattern of SRAM memories. These true random seeds contain full entropy. Then, the true random seeds are used as the input for a non-deterministic hardware RNG to generate a stream of true random bits with a throughput as high as 803 Mbps. The experimental results show that the bitstream generated by the proposed PUFKEY can pass all standard national institute of standards and technology (NIST randomness tests and is resilient to a wide range of security attacks.

  6. PUFKEY: a high-security and high-throughput hardware true random number generator for sensor networks.

    Science.gov (United States)

    Li, Dongfang; Lu, Zhaojun; Zou, Xuecheng; Liu, Zhenglin

    2015-10-16

    Random number generators (RNG) play an important role in many sensor network systems and applications, such as those requiring secure and robust communications. In this paper, we develop a high-security and high-throughput hardware true random number generator, called PUFKEY, which consists of two kinds of physical unclonable function (PUF) elements. Combined with a conditioning algorithm, true random seeds are extracted from the noise on the start-up pattern of SRAM memories. These true random seeds contain full entropy. Then, the true random seeds are used as the input for a non-deterministic hardware RNG to generate a stream of true random bits with a throughput as high as 803 Mbps. The experimental results show that the bitstream generated by the proposed PUFKEY can pass all standard national institute of standards and technology (NIST) randomness tests and is resilient to a wide range of security attacks.

  7. Quantifying randomness in real networks

    Science.gov (United States)

    Orsini, Chiara; Dankulov, Marija M.; Colomer-de-Simón, Pol; Jamakovic, Almerima; Mahadevan, Priya; Vahdat, Amin; Bassler, Kevin E.; Toroczkai, Zoltán; Boguñá, Marián; Caldarelli, Guido; Fortunato, Santo; Krioukov, Dmitri

    2015-10-01

    Represented as graphs, real networks are intricate combinations of order and disorder. Fixing some of the structural properties of network models to their values observed in real networks, many other properties appear as statistical consequences of these fixed observables, plus randomness in other respects. Here we employ the dk-series, a complete set of basic characteristics of the network structure, to study the statistical dependencies between different network properties. We consider six real networks--the Internet, US airport network, human protein interactions, technosocial web of trust, English word network, and an fMRI map of the human brain--and find that many important local and global structural properties of these networks are closely reproduced by dk-random graphs whose degree distributions, degree correlations and clustering are as in the corresponding real network. We discuss important conceptual, methodological, and practical implications of this evaluation of network randomness, and release software to generate dk-random graphs.

  8. Synaptic signal streams generated by ex vivo neuronal networks contain non-random, complex patterns.

    Science.gov (United States)

    Lee, Sangmook; Zemianek, Jill M; Shultz, Abraham; Vo, Anh; Maron, Ben Y; Therrien, Mikaela; Courtright, Christina; Guaraldi, Mary; Yanco, Holly A; Shea, Thomas B

    2014-11-01

    Cultured embryonic neurons develop functional networks that transmit synaptic signals over multiple sequentially connected neurons as revealed by multi-electrode arrays (MEAs) embedded within the culture dish. Signal streams of ex vivo networks contain spikes and bursts of varying amplitude and duration. Despite the random interactions inherent in dissociated cultures, neurons are capable of establishing functional ex vivo networks that transmit signals among synaptically connected neurons, undergo developmental maturation, and respond to exogenous stimulation by alterations in signal patterns. These characteristics indicate that a considerable degree of organization is an inherent property of neurons. We demonstrate herein that (1) certain signal types occur more frequently than others, (2) the predominant signal types change during and following maturation, (3) signal predominance is dependent upon inhibitory activity, and (4) certain signals preferentially follow others in a non-reciprocal manner. These findings indicate that the elaboration of complex signal streams comprised of a non-random distribution of signal patterns is an emergent property of ex vivo neuronal networks. Copyright © 2014. Published by Elsevier Ltd.

  9. Quantum random number generators

    Science.gov (United States)

    Herrero-Collantes, Miguel; Garcia-Escartin, Juan Carlos

    2017-01-01

    Random numbers are a fundamental resource in science and engineering with important applications in simulation and cryptography. The inherent randomness at the core of quantum mechanics makes quantum systems a perfect source of entropy. Quantum random number generation is one of the most mature quantum technologies with many alternative generation methods. This review discusses the different technologies in quantum random number generation from the early devices based on radioactive decay to the multiple ways to use the quantum states of light to gather entropy from a quantum origin. Randomness extraction and amplification and the notable possibility of generating trusted random numbers even with untrusted hardware using device-independent generation protocols are also discussed.

  10. Next Generation Networks

    Directory of Open Access Journals (Sweden)

    Ladislav Schwartz

    2006-01-01

    Full Text Available Two network types had been existing in Slovakia by the end of the year 2004 – public switched telephone network – PSTN and packet switched data network – DCN. The other network, known as the next generation network – NGN, has been put into operation since the beginning of the year 2005. The role of the next generation network is to merge the both previous network types into one unified complex network with the full centralised control, based on routing and packet switching. The T-Com company (previous Slovak Telecom was the first who did it.

  11. Entropy Characterization of Random Network Models

    Directory of Open Access Journals (Sweden)

    Pedro J. Zufiria

    2017-06-01

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

  12. Generating Realistic Labelled, Weighted Random Graphs

    CERN Document Server

    Davis, Michael Charles; Liu, Weiru; Miller, Paul; Hunter, Ruth; Kee, Frank

    2015-01-01

    Generative algorithms for random graphs have yielded insights into the structure and evolution of real-world networks. Most networks exhibit a well-known set of properties, such as heavy-tailed degree distributions, clustering and community formation. Usually, random graph models consider only structural information, but many real-world networks also have labelled vertices and weighted edges. In this paper, we present a generative model for random graphs with discrete vertex labels and numeric edge weights. The weights are represented as a set of Beta Mixture Models (BMMs) with an arbitrary number of mixtures, which are learned from real-world networks. We propose a Bayesian Variational Inference (VI) approach, which yields an accurate estimation while keeping computation times tractable. We compare our approach to state-of-the-art random labelled graph generators and an earlier approach based on Gaussian Mixture Models (GMMs). Our results allow us to draw conclusions about the contribution of vertex labels a...

  13. Use of Hot Rolling for Generating Low Deviation Twins and a Disconnected Random Boundary Network in Inconel 600 Alloy

    Science.gov (United States)

    Sahu, Sandeep; Yadav, Prabhat Chand; Shekhar, Shashank

    2018-02-01

    In this investigation, Inconel 600 alloy was thermomechanically processed to different strains via hot rolling followed by a short-time annealing treatment to determine an appropriate thermomechanical process to achieve a high fraction of low-Σ CSL boundaries. Experimental results demonstrate that a certain level of deformation is necessary to obtain effective "grain boundary engineering"; i.e., the deformation must be sufficiently high to provide the required driving force for postdeformation static recrystallization, yet it should be low enough to retain a large fraction of original twin boundaries. Samples processed in such a fashion exhibited 77 pct length fraction of low-Σ CSL boundaries, a dominant fraction of which was from Σ3 ( 64 pct), the latter with very low deviation from its theoretical misorientation. The application of hot rolling also resulted in a very low fraction of Σ1 ( 1 pct) boundaries, as desired. The process also leads to so-called "triple junction engineering" with the generation of special triple junctions, which are very effective in disrupting the connectivity of the random grain boundary network.

  14. Use of Hot Rolling for Generating Low Deviation Twins and a Disconnected Random Boundary Network in Inconel 600 Alloy

    Science.gov (United States)

    Sahu, Sandeep; Yadav, Prabhat Chand; Shekhar, Shashank

    2017-12-01

    In this investigation, Inconel 600 alloy was thermomechanically processed to different strains via hot rolling followed by a short-time annealing treatment to determine an appropriate thermomechanical process to achieve a high fraction of low-Σ CSL boundaries. Experimental results demonstrate that a certain level of deformation is necessary to obtain effective "grain boundary engineering"; i.e., the deformation must be sufficiently high to provide the required driving force for postdeformation static recrystallization, yet it should be low enough to retain a large fraction of original twin boundaries. Samples processed in such a fashion exhibited 77 pct length fraction of low-Σ CSL boundaries, a dominant fraction of which was from Σ3 ( 64 pct), the latter with very low deviation from its theoretical misorientation. The application of hot rolling also resulted in a very low fraction of Σ1 ( 1 pct) boundaries, as desired. The process also leads to so-called "triple junction engineering" with the generation of special triple junctions, which are very effective in disrupting the connectivity of the random grain boundary network.

  15. Letter to the editor: Generation of self organized critical connectivity network map (SOCCNM of randomly situated water bodies during flooding process

    Directory of Open Access Journals (Sweden)

    B. S. Daya Sagar

    2001-01-01

    Full Text Available This letter presents a brief framework based on nonlinear morphological transformations to generate a self organized critical connectivity network map (SOCCNM in 2-dimensional space. This simple and elegant framework is implemented on a section that contains a few simulated water bodies to generate SOCCNM. This is based on a postulate that the randomly situated surface water bodies of various sizes and shapes self organize during flooding process.

  16. Gossip in Random Networks

    Science.gov (United States)

    Malarz, K.; Szvetelszky, Z.; Szekf, B.; Kulakowski, K.

    2006-11-01

    We consider the average probability X of being informed on a gossip in a given social network. The network is modeled within the random graph theory of Erd{õ}s and Rényi. In this theory, a network is characterized by two parameters: the size N and the link probability p. Our experimental data suggest three levels of social inclusion of friendship. The critical value pc, for which half of agents are informed, scales with the system size as N-gamma with gamma approx 0.68. Computer simulations show that the probability X varies with p as a sigmoidal curve. Influence of the correlations between neighbors is also evaluated: with increasing clustering coefficient C, X decreases.

  17. RMBNToolbox: random models for biochemical networks

    Directory of Open Access Journals (Sweden)

    Niemi Jari

    2007-05-01

    Full Text Available Abstract Background There is an increasing interest to model biochemical and cell biological networks, as well as to the computational analysis of these models. The development of analysis methodologies and related software is rapid in the field. However, the number of available models is still relatively small and the model sizes remain limited. The lack of kinetic information is usually the limiting factor for the construction of detailed simulation models. Results We present a computational toolbox for generating random biochemical network models which mimic real biochemical networks. The toolbox is called Random Models for Biochemical Networks. The toolbox works in the Matlab environment, and it makes it possible to generate various network structures, stoichiometries, kinetic laws for reactions, and parameters therein. The generation can be based on statistical rules and distributions, and more detailed information of real biochemical networks can be used in situations where it is known. The toolbox can be easily extended. The resulting network models can be exported in the format of Systems Biology Markup Language. Conclusion While more information is accumulating on biochemical networks, random networks can be used as an intermediate step towards their better understanding. Random networks make it possible to study the effects of various network characteristics to the overall behavior of the network. Moreover, the construction of artificial network models provides the ground truth data needed in the validation of various computational methods in the fields of parameter estimation and data analysis.

  18. Thermodynamics of random number generation

    Science.gov (United States)

    Aghamohammadi, Cina; Crutchfield, James P.

    2017-06-01

    We analyze the thermodynamic costs of the three main approaches to generating random numbers via the recently introduced Information Processing Second Law. Given access to a specified source of randomness, a random number generator (RNG) produces samples from a desired target probability distribution. This differs from pseudorandom number generators (PRNGs) that use wholly deterministic algorithms and from true random number generators (TRNGs) in which the randomness source is a physical system. For each class, we analyze the thermodynamics of generators based on algorithms implemented as finite-state machines, as these allow for direct bounds on the required physical resources. This establishes bounds on heat dissipation and work consumption during the operation of three main classes of RNG algorithms—including those of von Neumann, Knuth, and Yao and Roche and Hoshi—and for PRNG methods. We introduce a general TRNG and determine its thermodynamic costs exactly for arbitrary target distributions. The results highlight the significant differences between the three main approaches to random number generation: One is work producing, one is work consuming, and the other is potentially dissipation neutral. Notably, TRNGs can both generate random numbers and convert thermal energy to stored work. These thermodynamic costs on information creation complement Landauer's limit on the irreducible costs of information destruction.

  19. Exploring biological network structure with clustered random networks

    Directory of Open Access Journals (Sweden)

    Bansal Shweta

    2009-12-01

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

  20. Exploring biological network structure with clustered random networks.

    Science.gov (United States)

    Bansal, Shweta; Khandelwal, Shashank; Meyers, Lauren Ancel

    2009-12-09

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

  1. Random Process Generation.

    Science.gov (United States)

    1980-06-01

    Address: Professor Bruce W. Schmeiser School of Industrial Engineering Purdue University West Lafayette, IN 47907 UjDISTIUMUTIO" TTMJ Approved for...algorithms developed under this contract are about twice as fast as the best alternatives available today. Peter Lewis at the Naval Postgraduate School ...generating bivariate gazua vectors. These algorithms are the only methods available which are valid for an gaia marginal distributions and j 6 -. . 4

  2. Generating Realistic Labelled, Weighted Random Graphs

    Directory of Open Access Journals (Sweden)

    Michael Charles Davis

    2015-12-01

    Full Text Available Generative algorithms for random graphs have yielded insights into the structure and evolution of real-world networks. Most networks exhibit a well-known set of properties, such as heavy-tailed degree distributions, clustering and community formation. Usually, random graph models consider only structural information, but many real-world networks also have labelled vertices and weighted edges. In this paper, we present a generative model for random graphs with discrete vertex labels and numeric edge weights. The weights are represented as a set of Beta Mixture Models (BMMs with an arbitrary number of mixtures, which are learned from real-world networks. We propose a Bayesian Variational Inference (VI approach, which yields an accurate estimation while keeping computation times tractable. We compare our approach to state-of-the-art random labelled graph generators and an earlier approach based on Gaussian Mixture Models (GMMs. Our results allow us to draw conclusions about the contribution of vertex labels and edge weights to graph structure.

  3. Growing random networks with fitness

    OpenAIRE

    Ergun, G.; Rodgers, GJ

    2001-01-01

    Three models of growing random networks with fitness dependent growth rates are analysed using the rate equations for the distribution of their connectivities. In the first model (A), a network is built by connecting incoming nodes to nodes of connectivity $k$ and random additive fitness $\\eta$, with rate $(k-1)+ \\eta $. For $\\eta >0$ we find the connectivity distribution is power law with exponent $\\gamma=+2$. In the second model (B), the network is built by connecting nodes to nodes of conn...

  4. Asymmetric evolving random networks

    Science.gov (United States)

    Coulomb, S.; Bauer, M.

    2003-10-01

    We generalize the Poissonian evolving random graph model of M. Bauer and D. Bernard (2003), to deal with arbitrary degree distributions. The motivation comes from biological networks, which are well-known to exhibit non Poissonian degree distributions. A node is added at each time step and is connected to the rest of the graph by oriented edges emerging from older nodes. This leads to a statistical asymmetry between incoming and outgoing edges. The law for the number of new edges at each time step is fixed but arbitrary. Thermodynamical behavior is expected when this law has a large time limit. Although (by construction) the incoming degree distributions depend on this law, this is not the case for most qualitative features concerning the size distribution of connected components, as long as the law has a finite variance. As the variance grows above 1/4, the average being < 1/2, a giant component emerges, which connects a finite fraction of the vertices. Below this threshold, the distribution of component sizes decreases algebraically with a continuously varying exponent. The transition is of infinite order, in sharp contrast with the case of static graphs. The local-in-time profiles for the components of finite size allow to give a refined description of the system.

  5. Generative adversarial networks for brain lesion detection

    Science.gov (United States)

    Alex, Varghese; Safwan, K. P. Mohammed; Chennamsetty, Sai Saketh; Krishnamurthi, Ganapathy

    2017-02-01

    Manual segmentation of brain lesions from Magnetic Resonance Images (MRI) is cumbersome and introduces errors due to inter-rater variability. This paper introduces a semi-supervised technique for detection of brain lesion from MRI using Generative Adversarial Networks (GANs). GANs comprises of a Generator network and a Discriminator network which are trained simultaneously with the objective of one bettering the other. The networks were trained using non lesion patches (n=13,000) from 4 different MR sequences. The network was trained on BraTS dataset and patches were extracted from regions excluding tumor region. The Generator network generates data by modeling the underlying probability distribution of the training data, (PData). The Discriminator learns the posterior probability P (Label Data) by classifying training data and generated data as "Real" or "Fake" respectively. The Generator upon learning the joint distribution, produces images/patches such that the performance of the Discriminator on them are random, i.e. P (Label Data = GeneratedData) = 0.5. During testing, the Discriminator assigns posterior probability values close to 0.5 for patches from non lesion regions, while patches centered on lesion arise from a different distribution (PLesion) and hence are assigned lower posterior probability value by the Discriminator. On the test set (n=14), the proposed technique achieves whole tumor dice score of 0.69, sensitivity of 91% and specificity of 59%. Additionally the generator network was capable of generating non lesion patches from various MR sequences.

  6. Thermodynamics of random reaction networks.

    Directory of Open Access Journals (Sweden)

    Jakob Fischer

    Full Text Available Reaction networks are useful for analyzing reaction systems occurring in chemistry, systems biology, or Earth system science. Despite the importance of thermodynamic disequilibrium for many of those systems, the general thermodynamic properties of reaction networks are poorly understood. To circumvent the problem of sparse thermodynamic data, we generate artificial reaction networks and investigate their non-equilibrium steady state for various boundary fluxes. We generate linear and nonlinear networks using four different complex network models (Erdős-Rényi, Barabási-Albert, Watts-Strogatz, Pan-Sinha and compare their topological properties with real reaction networks. For similar boundary conditions the steady state flow through the linear networks is about one order of magnitude higher than the flow through comparable nonlinear networks. In all networks, the flow decreases with the distance between the inflow and outflow boundary species, with Watts-Strogatz networks showing a significantly smaller slope compared to the three other network types. The distribution of entropy production of the individual reactions inside the network follows a power law in the intermediate region with an exponent of circa -1.5 for linear and -1.66 for nonlinear networks. An elevated entropy production rate is found in reactions associated with weakly connected species. This effect is stronger in nonlinear networks than in the linear ones. Increasing the flow through the nonlinear networks also increases the number of cycles and leads to a narrower distribution of chemical potentials. We conclude that the relation between distribution of dissipation, network topology and strength of disequilibrium is nontrivial and can be studied systematically by artificial reaction networks.

  7. Thermodynamics of Random Reaction Networks

    Science.gov (United States)

    Fischer, Jakob; Kleidon, Axel; Dittrich, Peter

    2015-01-01

    Reaction networks are useful for analyzing reaction systems occurring in chemistry, systems biology, or Earth system science. Despite the importance of thermodynamic disequilibrium for many of those systems, the general thermodynamic properties of reaction networks are poorly understood. To circumvent the problem of sparse thermodynamic data, we generate artificial reaction networks and investigate their non-equilibrium steady state for various boundary fluxes. We generate linear and nonlinear networks using four different complex network models (Erdős-Rényi, Barabási-Albert, Watts-Strogatz, Pan-Sinha) and compare their topological properties with real reaction networks. For similar boundary conditions the steady state flow through the linear networks is about one order of magnitude higher than the flow through comparable nonlinear networks. In all networks, the flow decreases with the distance between the inflow and outflow boundary species, with Watts-Strogatz networks showing a significantly smaller slope compared to the three other network types. The distribution of entropy production of the individual reactions inside the network follows a power law in the intermediate region with an exponent of circa −1.5 for linear and −1.66 for nonlinear networks. An elevated entropy production rate is found in reactions associated with weakly connected species. This effect is stronger in nonlinear networks than in the linear ones. Increasing the flow through the nonlinear networks also increases the number of cycles and leads to a narrower distribution of chemical potentials. We conclude that the relation between distribution of dissipation, network topology and strength of disequilibrium is nontrivial and can be studied systematically by artificial reaction networks. PMID:25723751

  8. Next Generation Social Networks

    DEFF Research Database (Denmark)

    Sørensen, Lene Tolstrup; Skouby, Knud Erik

    2008-01-01

    When it comes to discussing the future of electronic communication, social networking is the buzzword. The Internet has become a platform where new social networks emerge and the Internet it itself support the more traditional computer supported communication. The way users build and verifies...

  9. Evolution of random catalytic networks

    Energy Technology Data Exchange (ETDEWEB)

    Fraser, S.M. [Santa Fe Inst., NM (United States); Reidys, C.M. [Santa Fe Inst., NM (United States)]|[Los Alamos National Lab., NM (United States)

    1997-06-01

    In this paper the authors investigate the evolution of populations of sequences on a random catalytic network. Sequences are mapped into structures, between which are catalytic interactions that determine their instantaneous fitness. The catalytic network is constructed as a random directed graph. They prove that at certain parameter values, the probability of some relevant subgraphs of this graph, for example cycles without outgoing edges, is maximized. Populations evolving under point mutations realize a comparatively small induced subgraph of the complete catalytic network. They present results which show that populations reliably discover and persist on directed cycles in the catalytic graph, though these may be lost because of stochastic effects, and study the effect of population size on this behavior.

  10. Recurrence of random walks with long-range steps generated by fractional Laplacian matrices on regular networks and simple cubic lattices

    Science.gov (United States)

    Michelitsch, T. M.; Collet, B. A.; Riascos, A. P.; Nowakowski, A. F.; Nicolleau, F. C. G. A.

    2017-12-01

    We analyze a Markovian random walk strategy on undirected regular networks involving power matrix functions of the type L\\frac{α{2}} where L indicates a ‘simple’ Laplacian matrix. We refer to such walks as ‘fractional random walks’ with admissible interval 0 α (recurrent for d≤slantα ) of the lattice. As a consequence, for 0global mean first passage times (Kemeny constant) for the fractional random walk. For an infinite 1D lattice (infinite ring) we obtain for the transient regime 0world properties with the emergence of Lévy flights on large (infinite) lattices.

  11. Random graph models for dynamic networks

    Science.gov (United States)

    Zhang, Xiao; Moore, Cristopher; Newman, Mark E. J.

    2017-10-01

    Recent theoretical work on the modeling of network structure has focused primarily on networks that are static and unchanging, but many real-world networks change their structure over time. There exist natural generalizations to the dynamic case of many static network models, including the classic random graph, the configuration model, and the stochastic block model, where one assumes that the appearance and disappearance of edges are governed by continuous-time Markov processes with rate parameters that can depend on properties of the nodes. Here we give an introduction to this class of models, showing for instance how one can compute their equilibrium properties. We also demonstrate their use in data analysis and statistical inference, giving efficient algorithms for fitting them to observed network data using the method of maximum likelihood. This allows us, for example, to estimate the time constants of network evolution or infer community structure from temporal network data using cues embedded both in the probabilities over time that node pairs are connected by edges and in the characteristic dynamics of edge appearance and disappearance. We illustrate these methods with a selection of applications, both to computer-generated test networks and real-world examples.

  12. Flexible Next Generation Communication Networks

    Directory of Open Access Journals (Sweden)

    Konstantinos Demestichas

    2013-12-01

    Full Text Available The increasing bandwidth demand of the end-users makes the need for efficient resource management more compelling in next generation communication networks. Nowadays, the mobile communications scenery is characterized by the continuous growth of new services, the provision of which poses the need for higher data rates to guarantee satisfactory quality of experience for the end-users. The advent of evolved mobile communication networks (such as LTE - Long Term Evolution promises to encounter this demand by offering increased capacity, high data rates, seamless mobility and low latency. Nonetheless, during this evolutionary process, the backhaul part of mobile networks has received less attention. This paper discusses on ways for further evolution of mobile networks by rendering backhaul connectivity more flexible, robust and self-aware.

  13. The guitar chord-generating algorithm based on complex network

    Science.gov (United States)

    Ren, Tao; Wang, Yi-fan; Du, Dan; Liu, Miao-miao; Siddiqi, Awais

    2016-02-01

    This paper aims to generate chords for popular songs automatically based on complex network. Firstly, according to the characteristics of guitar tablature, six chord networks of popular songs by six pop singers are constructed and the properties of all networks are concluded. By analyzing the diverse chord networks, the accompaniment regulations and features are shown, with which the chords can be generated automatically. Secondly, in terms of the characteristics of popular songs, a two-tiered network containing a verse network and a chorus network is constructed. With this network, the verse and chorus can be composed respectively with the random walk algorithm. Thirdly, the musical motif is considered for generating chords, with which the bad chord progressions can be revised. This method can make the accompaniments sound more melodious. Finally, a popular song is chosen for generating chords and the new generated accompaniment sounds better than those done by the composers.

  14. Embedded generation and network management issues

    Energy Technology Data Exchange (ETDEWEB)

    NONE

    2000-07-01

    This report focuses on the characteristics of power generators that are important to accommodation in a distribution system. Part 1 examines the differences between transmission and distribution systems, and issues such as randomness, diversity, predictability, and controllability associated with accommodation in a distribution system. Part 2 concentrates on technical and operational issues relating to embedded generation, and the possible impact of the New Electricity Trading Arrangements. Commercial issues, contractual relationships for network charging and provision of services, and possible ways forward are examined in the last three parts of the report.

  15. Self-correcting random number generator

    Energy Technology Data Exchange (ETDEWEB)

    Humble, Travis S.; Pooser, Raphael C.

    2016-09-06

    A system and method for generating random numbers. The system may include a random number generator (RNG), such as a quantum random number generator (QRNG) configured to self-correct or adapt in order to substantially achieve randomness from the output of the RNG. By adapting, the RNG may generate a random number that may be considered random regardless of whether the random number itself is tested as such. As an example, the RNG may include components to monitor one or more characteristics of the RNG during operation, and may use the monitored characteristics as a basis for adapting, or self-correcting, to provide a random number according to one or more performance criteria.

  16. Organization of growing random networks

    Energy Technology Data Exchange (ETDEWEB)

    Krapivsky, P. L.; Redner, S.

    2001-06-01

    The organizational development of growing random networks is investigated. These growing networks are built by adding nodes successively, and linking each to an earlier node of degree k with an attachment probability A{sub k}. When A{sub k} grows more slowly than linearly with k, the number of nodes with k links, N{sub k}(t), decays faster than a power law in k, while for A{sub k} growing faster than linearly in k, a single node emerges which connects to nearly all other nodes. When A{sub k} is asymptotically linear, N{sub k}(t){similar_to}tk{sup {minus}{nu}}, with {nu} dependent on details of the attachment probability, but in the range 2{lt}{nu}{lt}{infinity}. The combined age and degree distribution of nodes shows that old nodes typically have a large degree. There is also a significant correlation in the degrees of neighboring nodes, so that nodes of similar degree are more likely to be connected. The size distributions of the in and out components of the network with respect to a given node{emdash}namely, its {open_quotes}descendants{close_quotes} and {open_quotes}ancestors{close_quotes}{emdash}are also determined. The in component exhibits a robust s{sup {minus}2} power-law tail, where s is the component size. The out component has a typical size of order lnt, and it provides basic insights into the genealogy of the network.

  17. Analysis of android random number generator

    OpenAIRE

    Sarıtaş, Serkan

    2013-01-01

    Ankara : The Department of Computer Engineering and the Graduate School of Engineering and Science of Bilkent University, 2013. Thesis (Master's) -- Bilkent University, 2013. Includes bibliographical references leaves 61-65. Randomness is a crucial resource for cryptography, and random number generators are critical building blocks of almost all cryptographic systems. Therefore, random number generation is one of the key parts of secure communication. Random number generatio...

  18. Random Network Coding over Composite Fields

    DEFF Research Database (Denmark)

    Geil, Olav; Lucani Rötter, Daniel Enrique

    2017-01-01

    Random network coding is a method that achieves multicast capacity asymptotically for general networks [1, 7]. In this approach, vertices in the network randomly and linearly combine incoming information in a distributed manner before forwarding it through their outgoing edges. To ensure success...

  19. Source-Independent Quantum Random Number Generation

    Science.gov (United States)

    Cao, Zhu; Zhou, Hongyi; Yuan, Xiao; Ma, Xiongfeng

    2016-01-01

    Quantum random number generators can provide genuine randomness by appealing to the fundamental principles of quantum mechanics. In general, a physical generator contains two parts—a randomness source and its readout. The source is essential to the quality of the resulting random numbers; hence, it needs to be carefully calibrated and modeled to achieve information-theoretical provable randomness. However, in practice, the source is a complicated physical system, such as a light source or an atomic ensemble, and any deviations in the real-life implementation from the theoretical model may affect the randomness of the output. To close this gap, we propose a source-independent scheme for quantum random number generation in which output randomness can be certified, even when the source is uncharacterized and untrusted. In our randomness analysis, we make no assumptions about the dimension of the source. For instance, multiphoton emissions are allowed in optical implementations. Our analysis takes into account the finite-key effect with the composable security definition. In the limit of large data size, the length of the input random seed is exponentially small compared to that of the output random bit. In addition, by modifying a quantum key distribution system, we experimentally demonstrate our scheme and achieve a randomness generation rate of over 5 ×103 bit /s .

  20. Handbook of Large-Scale Random Networks

    CERN Document Server

    Bollobas, Bela; Miklos, Dezso

    2008-01-01

    Covers various aspects of large-scale networks, including mathematical foundations and rigorous results of random graph theory, modeling and computational aspects of large-scale networks, as well as areas in physics, biology, neuroscience, sociology and technical areas

  1. Importance of randomness in biological networks: A random matrix ...

    Indian Academy of Sciences (India)

    2015-01-29

    Jan 29, 2015 ... We show that in spite of huge differences these interaction networks, representing real-world systems, posses from random matrix models, the spectral properties of the underlying matrices of these networks follow random matrix theory bringing them into the same universality class. We further demonstrate ...

  2. Epidemic Spreading in Random Rectangular Networks

    CERN Document Server

    Estrada, Ernesto; Moreno, Yamir

    2015-01-01

    Recently, Estrada and Sheerin (Phys. Rev. E 91, 042805 (2015)) developed the random rectangular graph (RRG) model to account for the spatial distribution of nodes in a network allowing the variation of the shape of the unit square commonly used in random geometric graphs (RGGs). Here, we consider an epidemics dynamics taking place on the nodes and edges of an RRG and we derive analytically a lower bound for the epidemic threshold for a Susceptible-Infected-Susceptible (SIS) or Susceptible-Infected-Recovered (SIR) model on these networks. Using extensive numerical simulations of the SIS dynamics we show that the lower bound found is very tight. We conclude that the elongation of the area in which the nodes are distributed makes the network more resilient to the propagation of an epidemics due to the fact that the epidemic threshold increases with the elongation of the rectangle. On the other hand, using the "classical" RGG for modeling epidemics on non-squared cities generates a larger error due to the effects...

  3. Statistical properties of random clique networks

    Science.gov (United States)

    Ding, Yi-Min; Meng, Jun; Fan, Jing-Fang; Ye, Fang-Fu; Chen, Xiao-Song

    2017-10-01

    In this paper, a random clique network model to mimic the large clustering coefficient and the modular structure that exist in many real complex networks, such as social networks, artificial networks, and protein interaction networks, is introduced by combining the random selection rule of the Erdös and Rényi (ER) model and the concept of cliques. We find that random clique networks having a small average degree differ from the ER network in that they have a large clustering coefficient and a power law clustering spectrum, while networks having a high average degree have similar properties as the ER model. In addition, we find that the relation between the clustering coefficient and the average degree shows a non-monotonic behavior and that the degree distributions can be fit by multiple Poisson curves; we explain the origin of such novel behaviors and degree distributions.

  4. Selectivity and sparseness in randomly connected balanced networks.

    Directory of Open Access Journals (Sweden)

    Cengiz Pehlevan

    Full Text Available Neurons in sensory cortex show stimulus selectivity and sparse population response, even in cases where no strong functionally specific structure in connectivity can be detected. This raises the question whether selectivity and sparseness can be generated and maintained in randomly connected networks. We consider a recurrent network of excitatory and inhibitory spiking neurons with random connectivity, driven by random projections from an input layer of stimulus selective neurons. In this architecture, the stimulus-to-stimulus and neuron-to-neuron modulation of total synaptic input is weak compared to the mean input. Surprisingly, we show that in the balanced state the network can still support high stimulus selectivity and sparse population response. In the balanced state, strong synapses amplify the variation in synaptic input and recurrent inhibition cancels the mean. Functional specificity in connectivity emerges due to the inhomogeneity caused by the generative statistical rule used to build the network. We further elucidate the mechanism behind and evaluate the effects of model parameters on population sparseness and stimulus selectivity. Network response to mixtures of stimuli is investigated. It is shown that a balanced state with unselective inhibition can be achieved with densely connected input to inhibitory population. Balanced networks exhibit the "paradoxical" effect: an increase in excitatory drive to inhibition leads to decreased inhibitory population firing rate. We compare and contrast selectivity and sparseness generated by the balanced network to randomly connected unbalanced networks. Finally, we discuss our results in light of experiments.

  5. Topological properties of random wireless networks

    Indian Academy of Sciences (India)

    Wireless networks in which the node locations are random are best modelled as random geometric graphs (RGGs). In addition to their extensive application in the modelling of wireless networks, RGGs find many new applications and are being studied in their own right. In this paper we first provide a brief introduction to the ...

  6. Random Number Generators in Secure Disk Drives

    Directory of Open Access Journals (Sweden)

    Hars Laszlo

    2009-01-01

    Full Text Available Abstract Cryptographic random number generators seeded by physical entropy sources are employed in many embedded security systems, including self-encrypting disk drives, being manufactured by the millions every year. Random numbers are used for generating encryption keys and for facilitating secure communication, and they are also provided to users for their applications. We discuss common randomness requirements, techniques for estimating the entropy of physical sources, investigate specific nonrandom physical properties, estimate the autocorrelation, then mix reduce the data until all common randomness tests pass. This method is applied to a randomness source in disk drives: the always changing coefficients of an adaptive filter for the read channel equalization. These coefficients, affected by many kinds of physical noise, are used in the reseeding process of a cryptographic pseudorandom number generator in a family of self encrypting disk drives currently in the market.

  7. Phase transitions for information diffusion in random clustered networks

    Science.gov (United States)

    Lim, Sungsu; Shin, Joongbo; Kwak, Namju; Jung, Kyomin

    2016-09-01

    We study the conditions for the phase transitions of information diffusion in complex networks. Using the random clustered network model, a generalisation of the Chung-Lu random network model incorporating clustering, we examine the effect of clustering under the Susceptible-Infected-Recovered (SIR) epidemic diffusion model with heterogeneous contact rates. For this purpose, we exploit the branching process to analyse information diffusion in random unclustered networks with arbitrary contact rates, and provide novel iterative algorithms for estimating the conditions and sizes of global cascades, respectively. Showing that a random clustered network can be mapped into a factor graph, which is a locally tree-like structure, we successfully extend our analysis to random clustered networks with heterogeneous contact rates. We then identify the conditions for phase transitions of information diffusion using our method. Interestingly, for various contact rates, we prove that random clustered networks with higher clustering coefficients have strictly lower phase transition points for any given degree sequence. Finally, we confirm our analytical results with numerical simulations of both synthetically-generated and real-world networks.

  8. Random walk centrality for temporal networks

    Science.gov (United States)

    Rocha, Luis E. C.; Masuda, Naoki

    2014-06-01

    Nodes can be ranked according to their relative importance within a network. Ranking algorithms based on random walks are particularly useful because they connect topological and diffusive properties of the network. Previous methods based on random walks, for example the PageRank, have focused on static structures. However, several realistic networks are indeed dynamic, meaning that their structure changes in time. In this paper, we propose a centrality measure for temporal networks based on random walks under periodic boundary conditions that we call TempoRank. It is known that, in static networks, the stationary density of the random walk is proportional to the degree or the strength of a node. In contrast, we find that, in temporal networks, the stationary density is proportional to the in-strength of the so-called effective network, a weighted and directed network explicitly constructed from the original sequence of transition matrices. The stationary density also depends on the sojourn probability q, which regulates the tendency of the walker to stay in the node, and on the temporal resolution of the data. We apply our method to human interaction networks and show that although it is important for a node to be connected to another node with many random walkers (one of the principles of the PageRank) at the right moment, this effect is negligible in practice when the time order of link activation is included.

  9. A Hybrid Random Number Generator(HRNG

    Directory of Open Access Journals (Sweden)

    Osvaldo Skliar

    2011-07-01

    Full Text Available The purpose of this paper is to present a novel Hybrid Random Number Generator (HRNG. Here “hybrid” refers to the fact that to construct this generator it is necessary to use 1physical components – texts – and a physical process, and 2 a mathematical procedure. This HRNG makes it possible to generate genuine random numbers which may be used both for computer simulation of probabilistic systems and in the field of cryptography. The results of a comparative study of the binary strings generated by this HRNG and of those generated by two highly used implementations of a congruential algorithm designed to generate pseudorandom numbers are given here. One of the latter is the implementation incorporated into the Java 2 platform (version 1.6, and the other is the implementation incorporated into the runtime library of Microsoft’s Visual C++ 2008 compiler.

  10. Cross over of recurrence networks to random graphs and random ...

    Indian Academy of Sciences (India)

    2017-01-27

    Jan 27, 2017 ... analysis based on net theoretic measures has developed into a major field, .... with the value of the scaling index γ falling between 2 and 3. To compute the network measures, we first construct an ensemble of synthetic networks, both random and ... higher k values are present to maintain the same γ. In both.

  11. Modelling complex networks by random hierarchical graphs

    Directory of Open Access Journals (Sweden)

    M.Wróbel

    2008-06-01

    Full Text Available Numerous complex networks contain special patterns, called network motifs. These are specific subgraphs, which occur oftener than in randomized networks of Erdős-Rényi type. We choose one of them, the triangle, and build a family of random hierarchical graphs, being Sierpiński gasket-based graphs with random "decorations". We calculate the important characteristics of these graphs - average degree, average shortest path length, small-world graph family characteristics. They depend on probability of decorations. We analyze the Ising model on our graphs and describe its critical properties using a renormalization-group technique.

  12. Pseudo-random number generator based on asymptotic deterministic randomness

    Energy Technology Data Exchange (ETDEWEB)

    Wang Kai [Department of Radio Engineering, Southeast University, Nanjing (China)], E-mail: kaiwang@seu.edu.cn; Pei Wenjiang; Xia Haishan [Department of Radio Engineering, Southeast University, Nanjing (China); Cheung Yiuming [Department of Computer Science, Hong Kong Baptist University, Hong Kong (China)

    2008-06-09

    A novel approach to generate the pseudorandom-bit sequence from the asymptotic deterministic randomness system is proposed in this Letter. We study the characteristic of multi-value correspondence of the asymptotic deterministic randomness constructed by the piecewise linear map and the noninvertible nonlinearity transform, and then give the discretized systems in the finite digitized state space. The statistic characteristics of the asymptotic deterministic randomness are investigated numerically, such as stationary probability density function and random-like behavior. Furthermore, we analyze the dynamics of the symbolic sequence. Both theoretical and experimental results show that the symbolic sequence of the asymptotic deterministic randomness possesses very good cryptographic properties, which improve the security of chaos based PRBGs and increase the resistance against entropy attacks and symbolic dynamics attacks.

  13. Exploring complex networks through random walks.

    Science.gov (United States)

    Costa, Luciano da Fontoura; Travieso, Gonzalo

    2007-01-01

    Most real complex networks--such as protein interactions, social contacts, and the Internet--are only partially known and available to us. While the process of exploring such networks in many cases resembles a random walk, it becomes a key issue to investigate and characterize how effectively the nodes and edges of such networks can be covered by different strategies. At the same time, it is critically important to infer how well can topological measurements such as the average node degree and average clustering coefficient be estimated during such network explorations. The present article addresses these problems by considering random, Barabási-Albert (BA), and geographical network models with varying connectivity explored by three types of random walks: traditional, preferential to untracked edges, and preferential to unvisited nodes. A series of relevant results are obtained, including the fact that networks of the three studied models with the same size and average node degree allow similar node and edge coverage efficiency, the identification of linear scaling with the size of the network of the random walk step at which a given percentage of the nodes/edges is covered, and the critical result that the estimation of the averaged node degree and clustering coefficient by random walks on BA networks often leads to heavily biased results. Many are the theoretical and practical implications of such results.

  14. Exploring community structure in biological networks with random graphs.

    Science.gov (United States)

    Sah, Pratha; Singh, Lisa O; Clauset, Aaron; Bansal, Shweta

    2014-06-25

    Community structure is ubiquitous in biological networks. There has been an increased interest in unraveling the community structure of biological systems as it may provide important insights into a system's functional components and the impact of local structures on dynamics at a global scale. Choosing an appropriate community detection algorithm to identify the community structure in an empirical network can be difficult, however, as the many algorithms available are based on a variety of cost functions and are difficult to validate. Even when community structure is identified in an empirical system, disentangling the effect of community structure from other network properties such as clustering coefficient and assortativity can be a challenge. Here, we develop a generative model to produce undirected, simple, connected graphs with a specified degrees and pattern of communities, while maintaining a graph structure that is as random as possible. Additionally, we demonstrate two important applications of our model: (a) to generate networks that can be used to benchmark existing and new algorithms for detecting communities in biological networks; and (b) to generate null models to serve as random controls when investigating the impact of complex network features beyond the byproduct of degree and modularity in empirical biological networks. Our model allows for the systematic study of the presence of community structure and its impact on network function and dynamics. This process is a crucial step in unraveling the functional consequences of the structural properties of biological systems and uncovering the mechanisms that drive these systems.

  15. On the dynamics of random neuronal networks

    OpenAIRE

    Robert, Philippe; Touboul, Jonathan D.

    2014-01-01

    We study the mean-field limit and stationary distributions of a pulse-coupled network modeling the dynamics of a large neuronal assemblies. Our model takes into account explicitly the intrinsic randomness of firing times, contrasting with the classical integrate-and-fire model. The ergodicity properties of the Markov process associated to finite networks are investigated. We derive the limit in distribution of the sample path of the state of a neuron of the network when its size gets large. T...

  16. Bipartite quantum states and random complex networks

    Science.gov (United States)

    Garnerone, Silvano; Giorda, Paolo; Zanardi, Paolo

    2012-01-01

    We introduce a mapping between graphs and pure quantum bipartite states and show that the associated entanglement entropy conveys non-trivial information about the structure of the graph. Our primary goal is to investigate the family of random graphs known as complex networks. In the case of classical random graphs, we derive an analytic expression for the averaged entanglement entropy \\bar S while for general complex networks we rely on numerics. For a large number of nodes n we find a scaling \\bar {S} \\sim c log n +g_{ {e}} where both the prefactor c and the sub-leading O(1) term ge are characteristic of the different classes of complex networks. In particular, ge encodes topological features of the graphs and is named network topological entropy. Our results suggest that quantum entanglement may provide a powerful tool for the analysis of large complex networks with non-trivial topological properties.

  17. Dynamic regimes of random fuzzy logic networks

    Energy Technology Data Exchange (ETDEWEB)

    Wittmann, Dominik M; Theis, Fabian J, E-mail: dominik.wittmann@helmholtz-muenchen.de [Computational Modeling in Biology, Institute for Bioinformatics and Systems Biology, Helmholtz Zentrum Muenchen-German Research Center for Environmental Health, Ingolstaedter Landstrasse 1, 85764 Munich-Neuherberg (Germany); Centre for Mathematical Sciences, Technische Universitaet Muenchen, Boltzmannstrasse 3, 85748 Garching (Germany)

    2011-01-15

    Random multistate networks, generalizations of the Boolean Kauffman networks, are generic models for complex systems of interacting agents. Depending on their mean connectivity, these networks exhibit ordered as well as chaotic behavior with a critical boundary separating both regimes. Typically, the nodes of these networks are assigned single discrete states. Here, we describe nodes by fuzzy numbers, i.e. vectors of degree-of-membership (DOM) functions specifying the degree to which the nodes are in each of their discrete states. This allows our models to deal with imprecision and uncertainties. Compatible update rules are constructed by expressing the update rules of the multistate network in terms of Boolean operators and generalizing them to fuzzy logic (FL) operators. The standard choice for these generalizations is the Goedel FL, where AND and OR are replaced by the minimum and maximum of two DOMs, respectively. In mean-field approximations we are able to analytically describe the percolation and asymptotic distribution of DOMs in random Goedel FL networks. This allows us to characterize the different dynamic regimes of random multistate networks in terms of FL. In a low-dimensional example, we provide explicit computations and validate our mean-field results by showing that they agree well with network simulations.

  18. Solution-Processed Carbon Nanotube True Random Number Generator.

    Science.gov (United States)

    Gaviria Rojas, William A; McMorrow, Julian J; Geier, Michael L; Tang, Qianying; Kim, Chris H; Marks, Tobin J; Hersam, Mark C

    2017-08-09

    With the growing adoption of interconnected electronic devices in consumer and industrial applications, there is an increasing demand for robust security protocols when transmitting and receiving sensitive data. Toward this end, hardware true random number generators (TRNGs), commonly used to create encryption keys, offer significant advantages over software pseudorandom number generators. However, the vast network of devices and sensors envisioned for the "Internet of Things" will require small, low-cost, and mechanically flexible TRNGs with low computational complexity. These rigorous constraints position solution-processed semiconducting single-walled carbon nanotubes (SWCNTs) as leading candidates for next-generation security devices. Here, we demonstrate the first TRNG using static random access memory (SRAM) cells based on solution-processed SWCNTs that digitize thermal noise to generate random bits. This bit generation strategy can be readily implemented in hardware with minimal transistor and computational overhead, resulting in an output stream that passes standardized statistical tests for randomness. By using solution-processed semiconducting SWCNTs in a low-power, complementary architecture to achieve TRNG, we demonstrate a promising approach for improving the security of printable and flexible electronics.

  19. Generating Attributed Networks with Communities

    National Research Council Canada - National Science Library

    Largeron, Christine; Mougel, Pierre-Nicolas; Rabbany, Reihaneh; Zaïane, Osmar R

    2015-01-01

    .... When nodes are described with a set of attributes we have an attributed network. Nodes and their relationships tend to naturally form into communities or clusters, and discovering these communities is paramount to many applications...

  20. CO-GENERATION AND OPERATING NETWORK CELLS

    DEFF Research Database (Denmark)

    Nielsen, John Eli

    2008-01-01

    In Denmark several thousands of generators are connected to the distribution system (10 kV and 0.4 kV). The production from these generators many times exceeds the load. The generators can be divided into two types, Wind turbines and CHP generators. These generators have one thing in common, the ...... concept in along these lines is the “Network Cell”....

  1. Random walk centrality in interconnected multilayer networks

    CERN Document Server

    Solé-Ribalta, Albert; Gómez, Sergio; Arenas, Alex

    2015-01-01

    Real-world complex systems exhibit multiple levels of relationships. In many cases they require to be modeled as interconnected multilayer networks, characterizing interactions of several types simultaneously. It is of crucial importance in many fields, from economics to biology and from urban planning to social sciences, to identify the most (or the less) influential nodes in a network using centrality measures. However, defining the centrality of actors in interconnected complex networks is not trivial. In this paper, we rely on the tensorial formalism recently proposed to characterize and investigate this kind of complex topologies, and extend two well known random walk centrality measures, the random walk betweenness and closeness centrality, to interconnected multilayer networks. For each of the measures we provide analytical expressions that completely agree with numerically results.

  2. Fast Generation of Discrete Random Variables

    Directory of Open Access Journals (Sweden)

    George Marsaglia

    2004-07-01

    Full Text Available We describe two methods and provide C programs for generating discrete random variables with functions that are simple and fast, averaging ten times as fast as published methods and more than five times as fast as the fastest of those. We provide general procedures for implementing the two methods, as well as specific procedures for three of the most important discrete distributions: Poisson, binomial and hypergeometric.

  3. Physical Principle for Generation of Randomness

    Science.gov (United States)

    Zak, Michail

    2009-01-01

    A physical principle (more precisely, a principle that incorporates mathematical models used in physics) has been conceived as the basis of a method of generating randomness in Monte Carlo simulations. The principle eliminates the need for conventional random-number generators. The Monte Carlo simulation method is among the most powerful computational methods for solving high-dimensional problems in physics, chemistry, economics, and information processing. The Monte Carlo simulation method is especially effective for solving problems in which computational complexity increases exponentially with dimensionality. The main advantage of the Monte Carlo simulation method over other methods is that the demand on computational resources becomes independent of dimensionality. As augmented by the present principle, the Monte Carlo simulation method becomes an even more powerful computational method that is especially useful for solving problems associated with dynamics of fluids, planning, scheduling, and combinatorial optimization. The present principle is based on coupling of dynamical equations with the corresponding Liouville equation. The randomness is generated by non-Lipschitz instability of dynamics triggered and controlled by feedback from the Liouville equation. (In non-Lipschitz dynamics, the derivatives of solutions of the dynamical equations are not required to be bounded.)

  4. Next Generation Reliable Transport Networks

    DEFF Research Database (Denmark)

    Zhang, Jiang

    of criticality and security, there are certain physical or logical segregation requirements between the avionic systems. Such segregations can be implemented on the proposed avionic networks with different hierarchies. In order to fulfill the segregation requirements, a tailored heuristic approach for solving...... the wavelength and fiber assignment problem is proposed and implemented for avionic optical transport networks. Simulation results give out resource consumptions and prove the efficiency of the proposed mechanisms. Finally, a Home Environment Service Knowledge Management system is proposed. Through ontology...... technologies, a knowledge base is constructed to represent the whole information of a home environment. By applying the reasoner tool, the proposed system manages to keep the consistency in a home environment and helps all software configure and update procedures across multiple vendors....

  5. Optical Subsystems for Next Generation Access Networks

    DEFF Research Database (Denmark)

    Lazaro, J.A; Polo, V.; Schrenk, B.

    2011-01-01

    Recent optical technologies are providing higher flexibility to next generation access networks: on the one hand, providing progressive FTTx and specifically FTTH deployment, progressively shortening the copper access network; on the other hand, also opening fixed-mobile convergence solutions in ...

  6. Achieving universal access to next generation networks

    DEFF Research Database (Denmark)

    Falch, Morten; Henten, Anders

    The paper examines investment dimensions of next generation networks in a universal service perspective in a European context. The question is how new network infrastructures for getting access to communication, information and entertainment services in the present and future information society...

  7. Optimizing the next generation optical access networks

    DEFF Research Database (Denmark)

    Amaya Fernández, Ferney Orlando; Soto, Ana Cardenas; Tafur Monroy, Idelfonso

    2009-01-01

    Several issues in the design and optimization of the next generation optical access network (NG-OAN) are presented. The noise, the distortion and the fiber optic nonlinearities are considered to optimize the video distribution link in a passive optical network (PON). A discussion of the effect of...

  8. Employing online quantum random number generators for generating truly random quantum states in Mathematica

    Science.gov (United States)

    Miszczak, Jarosław Adam

    2013-01-01

    The presented package for the Mathematica computing system allows the harnessing of quantum random number generators (QRNG) for investigating the statistical properties of quantum states. The described package implements a number of functions for generating random states. The new version of the package adds the ability to use the on-line quantum random number generator service and implements new functions for retrieving lists of random numbers. Thanks to the introduced improvements, the new version provides faster access to high-quality sources of random numbers and can be used in simulations requiring large amount of random data. New version program summaryProgram title: TRQS Catalogue identifier: AEKA_v2_0 Program summary URL:http://cpc.cs.qub.ac.uk/summaries/AEKA_v2_0.html Program obtainable from: CPC Program Library, Queen's University, Belfast, N. Ireland Licensing provisions: Standard CPC licence, http://cpc.cs.qub.ac.uk/licence/licence.html No. of lines in distributed program, including test data, etc.: 18 134 No. of bytes in distributed program, including test data, etc.: 2 520 49 Distribution format: tar.gz Programming language: Mathematica, C. Computer: Any supporting Mathematica in version 7 or higher. Operating system: Any platform supporting Mathematica; tested with GNU/Linux (32 and 64 bit). RAM: Case-dependent Supplementary material: Fig. 1 mentioned below can be downloaded. Classification: 4.15. External routines: Quantis software library (http://www.idquantique.com/support/quantis-trng.html) Catalogue identifier of previous version: AEKA_v1_0 Journal reference of previous version: Comput. Phys. Comm. 183(2012)118 Does the new version supersede the previous version?: Yes Nature of problem: Generation of random density matrices and utilization of high-quality random numbers for the purpose of computer simulation. Solution method: Use of a physical quantum random number generator and an on-line service providing access to the source of true random

  9. Generating confidence intervals on biological networks

    Directory of Open Access Journals (Sweden)

    Stumpf Michael PH

    2007-11-01

    Full Text Available Abstract Background In the analysis of networks we frequently require the statistical significance of some network statistic, such as measures of similarity for the properties of interacting nodes. The structure of the network may introduce dependencies among the nodes and it will in general be necessary to account for these dependencies in the statistical analysis. To this end we require some form of Null model of the network: generally rewired replicates of the network are generated which preserve only the degree (number of interactions of each node. We show that this can fail to capture important features of network structure, and may result in unrealistic significance levels, when potentially confounding additional information is available. Methods We present a new network resampling Null model which takes into account the degree sequence as well as available biological annotations. Using gene ontology information as an illustration we show how this information can be accounted for in the resampling approach, and the impact such information has on the assessment of statistical significance of correlations and motif-abundances in the Saccharomyces cerevisiae protein interaction network. An algorithm, GOcardShuffle, is introduced to allow for the efficient construction of an improved Null model for network data. Results We use the protein interaction network of S. cerevisiae; correlations between the evolutionary rates and expression levels of interacting proteins and their statistical significance were assessed for Null models which condition on different aspects of the available data. The novel GOcardShuffle approach results in a Null model for annotated network data which appears better to describe the properties of real biological networks. Conclusion An improved statistical approach for the statistical analysis of biological network data, which conditions on the available biological information, leads to qualitatively different results

  10. Accessibility and delay in random temporal networks

    Science.gov (United States)

    Tajbakhsh, Shahriar Etemadi; Coon, Justin P.; Simmons, David E.

    2017-09-01

    In a wide range of complex networks, the links between the nodes are temporal and may sporadically appear and disappear. This temporality is fundamental to analyzing the formation of paths within such networks. Moreover, the presence of the links between the nodes is a random process induced by nature in many real-world networks. In this paper, we study random temporal networks at a microscopic level and formulate the probability of accessibility from a node i to a node j after a certain number of discrete time units T . While solving the original problem is computationally intractable, we provide an upper and two lower bounds on this probability for a very general case with arbitrary time-varying probabilities of the links' existence. Moreover, for a special case where the links have identical probabilities across the network at each time slot, we obtain the exact probability of accessibility between any two nodes. Finally, we discuss scenarios where the information regarding the presence and absence of links is initially available in the form of time duration (of presence or absence intervals) continuous probability distributions rather than discrete probabilities over time slots. We provide a method for transforming such distributions to discrete probabilities, which enables us to apply the given bounds in this paper to a broader range of problem settings.

  11. Radiology: "killer app" for next generation networks?

    Science.gov (United States)

    McNeill, Kevin M

    2004-03-01

    The core principles of digital radiology were well developed by the end of the 1980 s. During the following decade tremendous improvements in computer technology enabled realization of those principles at an affordable cost. In this decade work can focus on highly distributed radiology in the context of the integrated health care enterprise. Over the same period computer networking has evolved from a relatively obscure field used by a small number of researchers across low-speed serial links to a pervasive technology that affects nearly all facets of society. Development directions in network technology will ultimately provide end-to-end data paths with speeds that match or exceed the speeds of data paths within the local network and even within workstations. This article describes key developments in Next Generation Networks, potential obstacles, and scenarios in which digital radiology can become a "killer app" that helps to drive deployment of new network infrastructure.

  12. Random Numbers Generated from Audio and Video Sources

    Directory of Open Access Journals (Sweden)

    I-Te Chen

    2013-01-01

    Full Text Available Random numbers are very useful in simulation, chaos theory, game theory, information theory, pattern recognition, probability theory, quantum mechanics, statistics, and statistical mechanics. The random numbers are especially helpful in cryptography. In this work, the proposed random number generators come from white noise of audio and video (A/V sources which are extracted from high-resolution IPCAM, WEBCAM, and MPEG-1 video files. The proposed generator applied on video sources from IPCAM and WEBCAM with microphone would be the true random number generator and the pseudorandom number generator when applied on video sources from MPEG-1 video file. In addition, when applying NIST SP 800-22 Rev.1a 15 statistics tests on the random numbers generated from the proposed generator, around 98% random numbers can pass 15 statistical tests. Furthermore, the audio and video sources can be found easily; hence, the proposed generator is a qualified, convenient, and efficient random number generator.

  13. Robust network topologies for generating switch-like cellular responses.

    Directory of Open Access Journals (Sweden)

    Najaf A Shah

    2011-06-01

    Full Text Available Signaling networks that convert graded stimuli into binary, all-or-none cellular responses are critical in processes ranging from cell-cycle control to lineage commitment. To exhaustively enumerate topologies that exhibit this switch-like behavior, we simulated all possible two- and three-component networks on random parameter sets, and assessed the resulting response profiles for both steepness (ultrasensitivity and extent of memory (bistability. Simulations were used to study purely enzymatic networks, purely transcriptional networks, and hybrid enzymatic/transcriptional networks, and the topologies in each class were rank ordered by parametric robustness (i.e., the percentage of applied parameter sets exhibiting ultrasensitivity or bistability. Results reveal that the distribution of network robustness is highly skewed, with the most robust topologies clustering into a small number of motifs. Hybrid networks are the most robust in generating ultrasensitivity (up to 28% and bistability (up to 18%; strikingly, a purely transcriptional framework is the most fragile in generating either ultrasensitive (up to 3% or bistable (up to 1% responses. The disparity in robustness among the network classes is due in part to zero-order ultrasensitivity, an enzyme-specific phenomenon, which repeatedly emerges as a particularly robust mechanism for generating nonlinearity and can act as a building block for switch-like responses. We also highlight experimentally studied examples of topologies enabling switching behavior, in both native and synthetic systems, that rank highly in our simulations. This unbiased approach for identifying topologies capable of a given response may be useful in discovering new natural motifs and in designing robust synthetic gene networks.

  14. NASA's Next Generation Space Geodesy Network

    Science.gov (United States)

    Desai, S. D.; Gross, R. S.; Hilliard, L.; Lemoine, F. G.; Long, J. L.; Ma, C.; McGarry, J. F.; Merkowitz, S. M.; Murphy, D.; Noll, C. E.; hide

    2012-01-01

    NASA's Space Geodesy Project (SGP) is developing a prototype core site for a next generation Space Geodetic Network (SGN). Each of the sites in this planned network co-locate current state-of-the-art stations from all four space geodetic observing systems, GNSS, SLR, VLBI, and DORIS, with the goal of achieving modern requirements for the International Terrestrial Reference Frame (ITRF). In particular, the driving ITRF requirements for this network are 1.0 mm in accuracy and 0.1 mm/yr in stability, a factor of 10-20 beyond current capabilities. Development of the prototype core site, located at NASA's Geophysical and Astronomical Observatory at the Goddard Space Flight Center, started in 2011 and will be completed by the end of 2013. In January 2012, two operational GNSS stations, GODS and GOON, were established at the prototype site within 100 m of each other. Both stations are being proposed for inclusion into the IGS network. In addition, work is underway for the inclusion of next generation SLR and VLBI stations along with a modern DORIS station. An automated survey system is being developed to measure inter-technique vectorties, and network design studies are being performed to define the appropriate number and distribution of these next generation space geodetic core sites that are required to achieve the driving ITRF requirements. We present the status of this prototype next generation space geodetic core site, results from the analysis of data from the established geodetic stations, and results from the ongoing network design studies.

  15. BGen: A UML Behavior Network Generator Tool

    Science.gov (United States)

    Huntsberger, Terry; Reder, Leonard J.; Balian, Harry

    2010-01-01

    BGen software was designed for autogeneration of code based on a graphical representation of a behavior network used for controlling automatic vehicles. A common format used for describing a behavior network, such as that used in the JPL-developed behavior-based control system, CARACaS ["Control Architecture for Robotic Agent Command and Sensing" (NPO-43635), NASA Tech Briefs, Vol. 32, No. 10 (October 2008), page 40] includes a graph with sensory inputs flowing through the behaviors in order to generate the signals for the actuators that drive and steer the vehicle. A computer program to translate Unified Modeling Language (UML) Freeform Implementation Diagrams into a legacy C implementation of Behavior Network has been developed in order to simplify the development of C-code for behavior-based control systems. UML is a popular standard developed by the Object Management Group (OMG) to model software architectures graphically. The C implementation of a Behavior Network is functioning as a decision tree.

  16. Generation of a Social Network Graph by Using Apache Spark

    Directory of Open Access Journals (Sweden)

    Y. A. Belov

    2016-01-01

    Full Text Available We plan to create a method of clustering a social network graph. For testing the method there is a need to generate a graph similar in structure to existing social networks. The article presents an algorithm for the graph distributed generation. We took into account basic properties such as power-law distribution of the users communities number, dense intersections of the social networks and others. This algorithm also considers the problems that are present in similar works of other authors, for example, the multiple edges problem in the generation process. A special feature of the created algorithm is the implementation depending on the communities number parameter rather than on the connected users number as it is done in other works. It is connected with a peculiarity of progressing the existing social network structure. There are properties of its graph in the paper. We described a table containing the variables needed for the algorithm. A step-by-step generation algorithm was compiled. Appropriate mathematical parameters were calculated for it. A generation is performed in a distributed way by Apache Spark framework. It was described in detail how the tasks division with the help of this framework runs. The Erdos-Renyi model for random graphs is used in the algorithm. It is the most suitable and easy one to implement. The main advantages of the created method are the small amount of resources in comparison with other similar generators and execution speed. Speed is achieved through distributed work and the fact that in any time network users have their own unique numbers and are ordered by these numbers, so there is no need to sort them out. The designed algorithm will promote not only the efficient clustering method creation. It can be useful in other development areas connected, for example, with the social networks search engines.

  17. Features of Random Metal Nanowire Networks with

    KAUST Repository

    Maloth, Thirupathi

    2017-05-01

    Among the alternatives to conventional Indium Tin Oxide (ITO) used in making transparent conducting electrodes, the random metal nanowire (NW) networks are considered to be superior offering performance at par with ITO. The performance is measured in terms of sheet resistance and optical transmittance. However, as the electrical properties of such random networks are achieved thanks to a percolation network, a minimum size of the electrodes is needed so it actually exceeds the representative volume element (RVE) of the material and the macroscopic electrical properties are achieved. There is not much information about the compatibility of this minimum RVE size with the resolution actually needed in electronic devices. Furthermore, the efficiency of NWs in terms of electrical conduction is overlooked. In this work, we address the above industrially relevant questions - 1) The minimum size of electrodes that can be made based on the dimensions of NWs and the material coverage. For this, we propose a morphology based classification in defining the RVE size and we also compare the same with that is based on macroscopic electrical properties stabilization. 2) The amount of NWs that do not participate in electrical conduction, hence of no practical use. The results presented in this thesis are a design guide to experimentalists to design transparent electrodes with more optimal usage of the material.

  18. Holographic coherent states from random tensor networks

    Science.gov (United States)

    Qi, Xiao-Liang; Yang, Zhao; You, Yi-Zhuang

    2017-08-01

    Random tensor networks provide useful models that incorporate various important features of holographic duality. A tensor network is usually defined for a fixed graph geometry specified by the connection of tensors. In this paper, we generalize the random tensor network approach to allow quantum superposition of different spatial geometries. We setup a framework in which all possible bulk spatial geometries, characterized by weighted adjacient matrices of all possible graphs, are mapped to the boundary Hilbert space and form an overcomplete basis of the boundary. We name such an overcomplete basis as holographic coherent states. A generic boundary state can be expanded in this basis, which describes the state as a superposition of different spatial geometries in the bulk. We discuss how to define distinct classical geometries and small fluctuations around them. We show that small fluctuations around classical geometries define "code subspaces" which are mapped to the boundary Hilbert space isometrically with quantum error correction properties. In addition, we also show that the overlap between different geometries is suppressed exponentially as a function of the geometrical difference between the two geometries. The geometrical difference is measured in an area law fashion, which is a manifestation of the holographic nature of the states considered.

  19. Micro-generation network connection (renewables)

    Energy Technology Data Exchange (ETDEWEB)

    Thornycroft, J.; Russell, T.; Curran, J.

    2003-07-01

    The drive to reduce emissions of carbon dioxide will result in an increase in the number of small generation units seeking connection to the electric power distribution network. The objectives of this study were to consider connection issues relating to micro-generation from renewables and their integration into the UK distribution network. The document is divided into two sections. The first section describes the present system which includes input from micro-generation, the technical impacts and the financial considerations. The second part discusses technical, financial and governance options for the future. A summary of preferred options and recommendations is given. The study was carried out by the Halcrow Group Ltd under contract to the DTI.

  20. Unbiased All-Optical Random-Number Generator

    OpenAIRE

    Tobias Steinle; Greiner, Johannes N.; Jörg Wrachtrup; Harald Giessen; Ilja Gerhardt

    2017-01-01

    The generation of random bits is of enormous importance in modern information science. Cryptographic security is based on random numbers which require a physical process for their generation. This is commonly performed by hardware random number generators. These exhibit often a number of problems, namely experimental bias, memory in the system, and other technical subtleties, which reduce the reliability in the entropy estimation. Further, the generated outcome has to be post-processed to "ir...

  1. Marginalization in Random Nonlinear Neural Networks

    Science.gov (United States)

    Vasudeva Raju, Rajkumar; Pitkow, Xaq

    2015-03-01

    Computations involved in tasks like causal reasoning in the brain require a type of probabilistic inference known as marginalization. Marginalization corresponds to averaging over irrelevant variables to obtain the probability of the variables of interest. This is a fundamental operation that arises whenever input stimuli depend on several variables, but only some are task-relevant. Animals often exhibit behavior consistent with marginalizing over some variables, but the neural substrate of this computation is unknown. It has been previously shown (Beck et al. 2011) that marginalization can be performed optimally by a deterministic nonlinear network that implements a quadratic interaction of neural activity with divisive normalization. We show that a simpler network can perform essentially the same computation. These Random Nonlinear Networks (RNN) are feedforward networks with one hidden layer, sigmoidal activation functions, and normally-distributed weights connecting the input and hidden layers. We train the output weights connecting the hidden units to an output population, such that the output model accurately represents a desired marginal probability distribution without significant information loss compared to optimal marginalization. Simulations for the case of linear coordinate transformations show that the RNN model has good marginalization performance, except for highly uncertain inputs that have low amplitude population responses. Behavioral experiments, based on these results, could then be used to identify if this model does indeed explain how the brain performs marginalization.

  2. Cooperation for next generation wireless networks

    OpenAIRE

    Antonopoulos, Angelos; Di Renzo, Marco; Lalos, Aristeidis; Alonso Zárate, Luis Gonzaga; Verikoukis, Christos

    2015-01-01

    Fundamentals of 5G Mobile Networks provides an overview of the key features of the 5th Generation (5G) mobile networks, discussing the motivation for 5G and the main challenges in developing this new technology. This book provides an insight into the key areas of research that will define this new system technology paving the path towards future research and development. The book is multi-disciplinary in nature, and aims to cover a whole host of intertwined subjects that will predominantly in...

  3. Realistic computer network simulation for network intrusion detection dataset generation

    Science.gov (United States)

    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.

  4. Random linear network coding for streams with unequally sized packets

    DEFF Research Database (Denmark)

    Taghouti, Maroua; Roetter, Daniel Enrique Lucani; Pedersen, Morten Videbæk

    2016-01-01

    State of the art Random Linear Network Coding (RLNC) schemes assume that data streams generate packets with equal sizes. This is an assumption that results in the highest efficiency gains for RLNC. A typical solution for managing unequal packet sizes is to zero-pad the smallest packets. However...... of packets, which are strategies that require additional signalling. Performance is evaluated using CAIDA TCP packets and 4k video traces. Our results show that our mechanisms reduce significantly the padding overhead even for small field sizes. Finally, our strategies provide a natural trade-off between...

  5. Biology Question Generation from a Semantic Network

    Science.gov (United States)

    Zhang, Lishan

    Science instructors need questions for use in exams, homework assignments, class discussions, reviews, and other instructional activities. Textbooks never have enough questions, so instructors must find them from other sources or generate their own questions. In order to supply instructors with biology questions, a semantic network approach was developed for generating open response biology questions. The generated questions were compared to professional authorized questions. To boost students' learning experience, adaptive selection was built on the generated questions. Bayesian Knowledge Tracing was used as embedded assessment of the student's current competence so that a suitable question could be selected based on the student's previous performance. A between-subjects experiment with 42 participants was performed, where half of the participants studied with adaptive selected questions and the rest studied with mal-adaptive order of questions. Both groups significantly improved their test scores, and the participants in adaptive group registered larger learning gains than participants in the control group. To explore the possibility of generating rich instructional feedback for machine-generated questions, a question-paragraph mapping task was identified. Given a set of questions and a list of paragraphs for a textbook, the goal of the task was to map the related paragraphs to each question. An algorithm was developed whose performance was comparable to human annotators. A multiple-choice question with high quality distractors (incorrect answers) can be pedagogically valuable as well as being much easier to grade than open-response questions. Thus, an algorithm was developed to generate good distractors for multiple-choice questions. The machine-generated multiple-choice questions were compared to human-generated questions in terms of three measures: question difficulty, question discrimination and distractor usefulness. By recruiting 200 participants from

  6. Ternary jitter-based true random number generator

    Science.gov (United States)

    Latypov, Rustam; Stolov, Evgeni

    2017-01-01

    In this paper a novel family of generators producing true uniform random numbers in ternary logic is presented. The generator consists of a number of identical ternary logic combinational units connected into a ring. All the units are provided to have a random delay time, and this time is supposed to be distributed in accordance with an exponential distribution. All delays are supposed to be independent events. The theory of the generator is based on Erlang equations. The generator can be used for test production in various systems. Features of multidimensional random vectors, produced by the generator, are discussed.

  7. Application of Random Matrix Theory to Complex Networks

    Science.gov (United States)

    Rai, Aparna; Jalan, Sarika

    The present article provides an overview of recent developments in spectral analysis of complex networks under random matrix theory framework. Adjacency matrix of unweighted networks, reviewed here, differ drastically from a random matrix, as former have only binary entries. Remarkably, short range correlations in corresponding eigenvalues of such matrices exhibit Gaussian orthogonal statistics of RMT and thus bring them into the universality class. Spectral rigidity of spectra provides measure of randomness in underlying networks. We will consider several examples of model networks vastly studied in last two decades. To the end we would provide potential of RMT framework and obtained results to understand and predict behavior of complex systems with underlying network structure.

  8. Automatic Generation of Network Protocol Gateways

    DEFF Research Database (Denmark)

    Bromberg, Yérom-David; Réveillère, Laurent; Lawall, Julia

    2009-01-01

    The emergence of networked devices in the home has made it possible to develop applications that control a variety of household functions. However, current devices communicate via a multitude of incompatible protocols, and thus gateways are needed to translate between them.  Gateway construction......, however, requires an intimate knowledge of the relevant protocols and a substantial understanding of low-level network programming, which can be a challenge for many application programmers. This paper presents a generative approach to gateway construction, z2z, based on a domain-specific language...... for describing protocol behaviors, message structures, and the gateway logic.  Z2z includes a compiler that checks essential correctness properties and produces efficient code. We have used z2z to develop a number of gateways, including SIP to RTSP, SLP to UPnP, and SMTP to SMTP via HTTP, involving a range...

  9. Effects of traffic generation patterns on the robustness of complex networks

    Science.gov (United States)

    Wu, Jiajing; Zeng, Junwen; Chen, Zhenhao; Tse, Chi K.; Chen, Bokui

    2018-02-01

    Cascading failures in communication networks with heterogeneous node functions are studied in this paper. In such networks, the traffic dynamics are highly dependent on the traffic generation patterns which are in turn determined by the locations of the hosts. The data-packet traffic model is applied to Barabási-Albert scale-free networks to study the cascading failures in such networks and to explore the effects of traffic generation patterns on network robustness. It is found that placing the hosts at high-degree nodes in a network can make the network more robust against both intentional attacks and random failures. It is also shown that the traffic generation pattern plays an important role in network design.

  10. Random number datasets generated from statistical analysis of randomly sampled GSM recharge cards.

    Science.gov (United States)

    Okagbue, Hilary I; Opanuga, Abiodun A; Oguntunde, Pelumi E; Ugwoke, Paulinus O

    2017-02-01

    In this article, a random number of datasets was generated from random samples of used GSM (Global Systems for Mobile Communications) recharge cards. Statistical analyses were performed to refine the raw data to random number datasets arranged in table. A detailed description of the method and relevant tests of randomness were also discussed.

  11. Quantum Random Number Generation on a Mobile Phone

    Directory of Open Access Journals (Sweden)

    Bruno Sanguinetti

    2014-09-01

    Full Text Available Quantum random number generators (QRNGs can significantly improve the security of cryptographic protocols by ensuring that generated keys cannot be predicted. However, the cost, size, and power requirements of current Quantum random number generators have prevented them from becoming widespread. In the meantime, the quality of the cameras integrated in mobile telephones has improved significantly so that now they are sensitive to light at the few-photon level. We demonstrate how these can be used to generate random numbers of a quantum origin.

  12. Macrostructure from Microstructure: Generating Whole Systems from Ego Networks

    Science.gov (United States)

    Smith, Jeffrey A.

    2014-01-01

    This paper presents a new simulation method to make global network inference from sampled data. The proposed simulation method takes sampled ego network data and uses Exponential Random Graph Models (ERGM) to reconstruct the features of the true, unknown network. After describing the method, the paper presents two validity checks of the approach: the first uses the 20 largest Add Health networks while the second uses the Sociology Coauthorship network in the 1990's. For each test, I take random ego network samples from the known networks and use my method to make global network inference. I find that my method successfully reproduces the properties of the networks, such as distance and main component size. The results also suggest that simpler, baseline models provide considerably worse estimates for most network properties. I end the paper by discussing the bounds/limitations of ego network sampling. I also discuss possible extensions to the proposed approach. PMID:25339783

  13. SPRNG Scalable Parallel Random Number Generator LIbrary

    Energy Technology Data Exchange (ETDEWEB)

    2010-03-16

    This revision corrects some errors in SPRNG 1. Users of newer SPRNG versions can obtain the corrected files and build their version with it. This version also improves the scalability of some of the application-based tests in the SPRNG test suite. It also includes an interface to a parallel Mersenne Twister, so that if users install the Mersenne Twister, then they can test this generator with the SPRNG test suite and also use some SPRNG features with that generator.

  14. Cross over of recurrence networks to random graphs and random ...

    Indian Academy of Sciences (India)

    Recurrence networks are complex networks constructed from the time series of chaotic dynamical systems where the connection between two nodes is limited by the recurrence threshold. This condition makes the topology of every recurrence network unique with the degree distribution determined by the probability ...

  15. Humans cannot consciously generate random numbers sequences: Polemic study.

    Science.gov (United States)

    Figurska, Małgorzata; Stańczyk, Maciej; Kulesza, Kamil

    2008-01-01

    It is widely believed, that randomness exists in Nature. In fact such an assumption underlies many scientific theories and is embedded in the foundations of quantum mechanics. Assuming that this hypothesis is valid one can use natural phenomena, like radioactive decay, to generate random numbers. Today, computers are capable of generating the so-called pseudorandom numbers. Such series of numbers are only seemingly random (bias in the randomness quality can be observed). Question whether people can produce random numbers, has been investigated by many scientists in the recent years. The paper "Humans can consciously generate random numbers sequences..." published recently in Medical Hypotheses made claims that were in many ways contrary to state of art; it also stated far-reaching hypotheses. So, we decided to repeat the experiments reported, with special care being taken of proper laboratory procedures. Here, we present the results and discuss possible implications in computer and other sciences.

  16. Holographic duality from random tensor networks

    Energy Technology Data Exchange (ETDEWEB)

    Hayden, Patrick; Nezami, Sepehr; Qi, Xiao-Liang; Thomas, Nathaniel; Walter, Michael; Yang, Zhao [Stanford Institute for Theoretical Physics, Department of Physics, Stanford University,382 Via Pueblo, Stanford, CA 94305 (United States)

    2016-11-02

    Tensor networks provide a natural framework for exploring holographic duality because they obey entanglement area laws. They have been used to construct explicit toy models realizing many of the interesting structural features of the AdS/CFT correspondence, including the non-uniqueness of bulk operator reconstruction in the boundary theory. In this article, we explore the holographic properties of networks of random tensors. We find that our models naturally incorporate many features that are analogous to those of the AdS/CFT correspondence. When the bond dimension of the tensors is large, we show that the entanglement entropy of all boundary regions, whether connected or not, obey the Ryu-Takayanagi entropy formula, a fact closely related to known properties of the multipartite entanglement of assistance. We also discuss the behavior of Rényi entropies in our models and contrast it with AdS/CFT. Moreover, we find that each boundary region faithfully encodes the physics of the entire bulk entanglement wedge, i.e., the bulk region enclosed by the boundary region and the minimal surface. Our method is to interpret the average over random tensors as the partition function of a classical ferromagnetic Ising model, so that the minimal surfaces of Ryu-Takayanagi appear as domain walls. Upon including the analog of a bulk field, we find that our model reproduces the expected corrections to the Ryu-Takayanagi formula: the bulk minimal surface is displaced and the entropy is augmented by the entanglement of the bulk field. Increasing the entanglement of the bulk field ultimately changes the minimal surface behavior topologically, in a way similar to the effect of creating a black hole. Extrapolating bulk correlation functions to the boundary permits the calculation of the scaling dimensions of boundary operators, which exhibit a large gap between a small number of low-dimension operators and the rest. While we are primarily motivated by the AdS/CFT duality, the main

  17. Scaling solutions for connectivity and conductivity of continuous random networks.

    Science.gov (United States)

    Galindo-Torres, S A; Molebatsi, T; Kong, X-Z; Scheuermann, A; Bringemeier, D; Li, L

    2015-10-01

    Connectivity and conductivity of two-dimensional fracture networks (FNs), as an important type of continuous random networks, are examined systematically through Monte Carlo simulations under a variety of conditions, including different power law distributions of the fracture lengths and domain sizes. The simulation results are analyzed using analogies of the percolation theory for discrete random networks. With a characteristic length scale and conductivity scale introduced, we show that the connectivity and conductivity of FNs can be well described by universal scaling solutions. These solutions shed light on previous observations of scale-dependent FN behavior and provide a powerful method for quantifying effective bulk properties of continuous random networks.

  18. Analysis of Additive Random Number Generators.

    Science.gov (United States)

    1977-03-01

    CLASSIFICATION OF THIS PAGE (When Data Entered; I .,.,•• n .„^iMl~^.-». H .,il~l.*...,...-•..,.,.., • 1 ——’"- •"•’ ANALYSIS OF ADDITIVE RANDOM...among my teachers two of the best: my parents, Bil and Marleen Reiser. - , i — - •- - J I " ii. .1 I l. Kl U...the period, we know that r(pa*z) * pr(pa) and k - • - ----• •--- - -— — ...., . H ..J 1-..11.111 ’ Introduction that r(pa *’) divides

  19. Experimental measurement-device-independent quantum random-number generation

    Science.gov (United States)

    Nie, You-Qi; Guan, Jian-Yu; Zhou, Hongyi; Zhang, Qiang; Ma, Xiongfeng; Zhang, Jun; Pan, Jian-Wei

    2016-12-01

    The randomness from a quantum random-number generator (QRNG) relies on the accurate characterization of its devices. However, device imperfections and inaccurate characterizations can result in wrong entropy estimation and bias in practice, which highly affects the genuine randomness generation and may even induce the disappearance of quantum randomness in an extreme case. Here we experimentally demonstrate a measurement-device-independent (MDI) QRNG based on time-bin encoding to achieve certified quantum randomness even when the measurement devices are uncharacterized and untrusted. The MDI-QRNG is randomly switched between the regular randomness generation mode and a test mode, in which four quantum states are randomly prepared to perform measurement tomography in real time. With a clock rate of 25 MHz, the MDI-QRNG generates a final random bit rate of 5.7 kbps. Such implementation with an all-fiber setup provides an approach to construct a fully integrated MDI-QRNG with trusted but error-prone devices in practice.

  20. Unbiased All-Optical Random-Number Generator

    Science.gov (United States)

    Steinle, Tobias; Greiner, Johannes N.; Wrachtrup, Jörg; Giessen, Harald; Gerhardt, Ilja

    2017-10-01

    The generation of random bits is of enormous importance in modern information science. Cryptographic security is based on random numbers which require a physical process for their generation. This is commonly performed by hardware random-number generators. These often exhibit a number of problems, namely experimental bias, memory in the system, and other technical subtleties, which reduce the reliability in the entropy estimation. Further, the generated outcome has to be postprocessed to "iron out" such spurious effects. Here, we present a purely optical randomness generator, based on the bistable output of an optical parametric oscillator. Detector noise plays no role and postprocessing is reduced to a minimum. Upon entering the bistable regime, initially the resulting output phase depends on vacuum fluctuations. Later, the phase is rigidly locked and can be well determined versus a pulse train, which is derived from the pump laser. This delivers an ambiguity-free output, which is reliably detected and associated with a binary outcome. The resulting random bit stream resembles a perfect coin toss and passes all relevant randomness measures. The random nature of the generated binary outcome is furthermore confirmed by an analysis of resulting conditional entropies.

  1. Unbiased All-Optical Random-Number Generator

    Directory of Open Access Journals (Sweden)

    Tobias Steinle

    2017-11-01

    Full Text Available The generation of random bits is of enormous importance in modern information science. Cryptographic security is based on random numbers which require a physical process for their generation. This is commonly performed by hardware random-number generators. These often exhibit a number of problems, namely experimental bias, memory in the system, and other technical subtleties, which reduce the reliability in the entropy estimation. Further, the generated outcome has to be postprocessed to “iron out” such spurious effects. Here, we present a purely optical randomness generator, based on the bistable output of an optical parametric oscillator. Detector noise plays no role and postprocessing is reduced to a minimum. Upon entering the bistable regime, initially the resulting output phase depends on vacuum fluctuations. Later, the phase is rigidly locked and can be well determined versus a pulse train, which is derived from the pump laser. This delivers an ambiguity-free output, which is reliably detected and associated with a binary outcome. The resulting random bit stream resembles a perfect coin toss and passes all relevant randomness measures. The random nature of the generated binary outcome is furthermore confirmed by an analysis of resulting conditional entropies.

  2. Randomizing bipartite networks: the case of the World Trade Web

    CERN Document Server

    Saracco, Fabio; Gabrielli, Andrea; Squartini, Tiziano

    2015-01-01

    Within the last fifteen years, network theory has been successfully applied both to natural sciences and to socioeconomic disciplines. In particular, bipartite networks have been recognized to provide a particularly insightful representation of many systems, ranging from mutualistic networks in ecology to trade networks in economy, whence the need of a pattern detection-oriented analysis in order to identify statistically-significant structural properties. Such an analysis rests upon the definition of suitable null models, i.e. upon the choice of the portion of network structure to be preserved while randomizing everything else. However, quite surprisingly, little work has been done so far to define null models for real bipartite networks. The aim of the present work is to fill this gap, extending a recently-proposed method to randomize monopartite networks to bipartite networks. While the proposed formalism is perfectly general, we apply our method to the binary, undirected, bipartite representation of the W...

  3. Streaming Algorithms for Optimal Generation of Random Bits

    OpenAIRE

    Zhou, Hongchao; Bruck, Jehoshua

    2012-01-01

    Generating random bits from a source of biased coins (the biased is unknown) is a classical question that was originally studied by von Neumann. There are a number of known algorithms that have asymptotically optimal information efficiency, namely, the expected number of generated random bits per input bit is asymptotically close to the entropy of the source. However, only the original von Neumann algorithm has a 'streaming property' - it operates on a single input bit at a time and it genera...

  4. Random Number Generation for Petascale Quantum Monte Carlo

    Energy Technology Data Exchange (ETDEWEB)

    Ashok Srinivasan

    2010-03-16

    The quality of random number generators can affect the results of Monte Carlo computations, especially when a large number of random numbers are consumed. Furthermore, correlations present between different random number streams in a parallel computation can further affect the results. The SPRNG software, which the author had developed earlier, has pseudo-random number generators (PRNGs) capable of producing large numbers of streams with large periods. However, they had been empirically tested on only thousand streams earlier. In the work summarized here, we tested the SPRNG generators with over a hundred thousand streams, involving over 10^14 random numbers per test, on some tests. We also tested the popular Mersenne Twister. We believe that these are the largest tests of PRNGs, both in terms of the numbers of streams tested and the number of random numbers tested. We observed defects in some of these generators, including the Mersenne Twister, while a few generators appeared to perform well. We also corrected an error in the implementation of one of the SPRNG generators.

  5. Application of random matrix theory to biological networks

    Energy Technology Data Exchange (ETDEWEB)

    Luo Feng [Department of Computer Science, Clemson University, 100 McAdams Hall, Clemson, SC 29634 (United States); Department of Pathology, U.T. Southwestern Medical Center, 5323 Harry Hines Blvd. Dallas, TX 75390-9072 (United States); Zhong Jianxin [Department of Physics, Xiangtan University, Hunan 411105 (China) and Oak Ridge National Laboratory, Oak Ridge, TN 37831 (United States)]. E-mail: zhongjn@ornl.gov; Yang Yunfeng [Oak Ridge National Laboratory, Oak Ridge, TN 37831 (United States); Scheuermann, Richard H. [Department of Pathology, U.T. Southwestern Medical Center, 5323 Harry Hines Blvd. Dallas, TX 75390-9072 (United States); Zhou Jizhong [Department of Botany and Microbiology, University of Oklahoma, Norman, OK 73019 (United States) and Oak Ridge National Laboratory, Oak Ridge, TN 37831 (United States)]. E-mail: zhouj@ornl.gov

    2006-09-25

    We show that spectral fluctuation of interaction matrices of a yeast protein-protein interaction network and a yeast metabolic network follows the description of the Gaussian orthogonal ensemble (GOE) of random matrix theory (RMT). Furthermore, we demonstrate that while the global biological networks evaluated belong to GOE, removal of interactions between constituents transitions the networks to systems of isolated modules described by the Poisson distribution. Our results indicate that although biological networks are very different from other complex systems at the molecular level, they display the same statistical properties at network scale. The transition point provides a new objective approach for the identification of functional modules.

  6. Random matrix analysis for gene interaction networks in cancer cells

    CERN Document Server

    Kikkawa, Ayumi

    2016-01-01

    Motivation: The investigation of topological modifications of the gene interaction networks in cancer cells is essential for understanding the desease. We study gene interaction networks in various human cancer cells with the random matrix theory. This study is based on the Cancer Network Galaxy (TCNG) database which is the repository of huge gene interactions inferred by Bayesian network algorithms from 256 microarray experimental data downloaded from NCBI GEO. The original GEO data are provided by the high-throughput microarray expression experiments on various human cancer cells. We apply the random matrix theory to the computationally inferred gene interaction networks in TCNG in order to detect the universality in the topology of the gene interaction networks in cancer cells. Results: We found the universal behavior in almost one half of the 256 gene interaction networks in TCNG. The distribution of nearest neighbor level spacing of the gene interaction matrix becomes the Wigner distribution when the net...

  7. System and method for generating a relationship network

    Science.gov (United States)

    Franks, Kasian [Kensington, CA; Myers, Cornelia A [St. Louis, MO; Podowski, Raf M [Pleasant Hill, CA

    2011-07-26

    A computer-implemented system and process for generating a relationship network is disclosed. The system provides a set of data items to be related and generates variable length data vectors to represent the relationships between the terms within each data item. The system can be used to generate a relationship network for documents, images, or any other type of file. This relationship network can then be queried to discover the relationships between terms within the set of data items.

  8. The Reliability of Randomly Generated Math Curriculum-Based Measurements

    Science.gov (United States)

    Strait, Gerald G.; Smith, Bradley H.; Pender, Carolyn; Malone, Patrick S.; Roberts, Jarod; Hall, John D.

    2015-01-01

    "Curriculum-Based Measurement" (CBM) is a direct method of academic assessment used to screen and evaluate students' skills and monitor their responses to academic instruction and intervention. Interventioncentral.org offers a math worksheet generator at no cost that creates randomly generated "math curriculum-based measures"…

  9. Performance of wireless sensor networks under random node failures

    Energy Technology Data Exchange (ETDEWEB)

    Bradonjic, Milan [Los Alamos National Laboratory; Hagberg, Aric [Los Alamos National Laboratory; Feng, Pan [Los Alamos National Laboratory

    2011-01-28

    Networks are essential to the function of a modern society and the consequence of damages to a network can be large. Assessing network performance of a damaged network is an important step in network recovery and network design. Connectivity, distance between nodes, and alternative routes are some of the key indicators to network performance. In this paper, random geometric graph (RGG) is used with two types of node failure, uniform failure and localized failure. Since the network performance are multi-facet and assessment can be time constrained, we introduce four measures, which can be computed in polynomial time, to estimate performance of damaged RGG. Simulation experiments are conducted to investigate the deterioration of networks through a period of time. With the empirical results, the performance measures are analyzed and compared to provide understanding of different failure scenarios in a RGG.

  10. Softening in random networks of non-identical beams

    Science.gov (United States)

    Ban, Ehsan; Barocas, Victor H.; Shephard, Mark S.; Picu, R. Catalin

    2016-02-01

    Random fiber networks are assemblies of elastic elements connected in random configurations. They are used as models for a broad range of fibrous materials including biopolymer gels and synthetic nonwovens. Although the mechanics of networks made from the same type of fibers has been studied extensively, the behavior of composite systems of fibers with different properties has received less attention. In this work we numerically and theoretically study random networks of beams and springs of different mechanical properties. We observe that the overall network stiffness decreases on average as the variability of fiber stiffness increases, at constant mean fiber stiffness. Numerical results and analytical arguments show that for small variabilities in fiber stiffness the amount of network softening scales linearly with the variance of the fiber stiffness distribution. This result holds for any beam structure and is expected to apply to a broad range of materials including cellular solids.

  11. Softening in Random Networks of Non-Identical Beams.

    Science.gov (United States)

    Ban, Ehsan; Barocas, Victor H; Shephard, Mark S; Picu, Catalin R

    2016-02-01

    Random fiber networks are assemblies of elastic elements connected in random configurations. They are used as models for a broad range of fibrous materials including biopolymer gels and synthetic nonwovens. Although the mechanics of networks made from the same type of fibers has been studied extensively, the behavior of composite systems of fibers with different properties has received less attention. In this work we numerically and theoretically study random networks of beams and springs of different mechanical properties. We observe that the overall network stiffness decreases on average as the variability of fiber stiffness increases, at constant mean fiber stiffness. Numerical results and analytical arguments show that for small variabilities in fiber stiffness the amount of network softening scales linearly with the variance of the fiber stiffness distribution. This result holds for any beam structure and is expected to apply to a broad range of materials including cellular solids.

  12. Optimal power flow for distribution networks with distributed generation

    Directory of Open Access Journals (Sweden)

    Radosavljević Jordan

    2015-01-01

    Full Text Available This paper presents a genetic algorithm (GA based approach for the solution of the optimal power flow (OPF in distribution networks with distributed generation (DG units, including fuel cells, micro turbines, diesel generators, photovoltaic systems and wind turbines. The OPF is formulated as a nonlinear multi-objective optimization problem with equality and inequality constraints. Due to the stochastic nature of energy produced from renewable sources, i.e. wind turbines and photovoltaic systems, as well as load uncertainties, a probabilisticalgorithm is introduced in the OPF analysis. The Weibull and normal distributions are employed to model the input random variables, namely the wind speed, solar irradiance and load power. The 2m+1 point estimate method and the Gram Charlier expansion theory are used to obtain the statistical moments and the probability density functions (PDFs of the OPF results. The proposed approach is examined and tested on a modified IEEE 34 node test feeder with integrated five different DG units. The obtained results prove the efficiency of the proposed approach to solve both deterministic and probabilistic OPF problems for different forms of the multi-objective function. As such, it can serve as a useful decision-making supporting tool for distribution network operators. [Projekat Ministarstva nauke Republike Srbije, br. TR33046

  13. Localization transition of biased random walks on random networks.

    Science.gov (United States)

    Sood, Vishal; Grassberger, Peter

    2007-08-31

    We study random walks on large random graphs that are biased towards a randomly chosen but fixed target node. We show that a critical bias strength bc exists such that most walks find the target within a finite time when b > bc. For b infinity before hitting the target. The phase transition at b=bc is a critical point in the sense that quantities such as the return probability P(t) show power laws, but finite-size behavior is complex and does not obey the usual finite-size scaling ansatz. By extending rigorous results for biased walks on Galton-Watson trees, we give the exact analytical value for bc and verify it by large scale simulations.

  14. Generation of Random Numbers and Parallel Random Number Streams for Monte Carlo Simulations

    Directory of Open Access Journals (Sweden)

    L. Yu. Barash

    2012-01-01

    Full Text Available Modern methods and libraries for high quality pseudorandom number generation and for generation of parallel random number streams for Monte Carlo simulations are considered. The probability equidistribution property and the parameters when the property holds at dimensions up to logarithm of mesh size are considered for Multiple Recursive Generators.

  15. Emergence of Scaling in Random Networks

    Science.gov (United States)

    Barabási, Albert-László; Albert, Réka

    1999-10-01

    Systems as diverse as genetic networks or the World Wide Web are best described as networks with complex topology. A common property of many large networks is that the vertex connectivities follow a scale-free power-law distribution. This feature was found to be a consequence of two generic mechanisms: (i) networks expand continuously by the addition of new vertices, and (ii) new vertices attach preferentially to sites that are already well connected. A model based on these two ingredients reproduces the observed stationary scale-free distributions, which indicates that the development of large networks is governed by robust self-organizing phenomena that go beyond the particulars of the individual systems.

  16. Sequential defense against random and intentional attacks in complex networks

    Science.gov (United States)

    Chen, Pin-Yu; Cheng, Shin-Ming

    2015-02-01

    Network robustness against attacks is one of the most fundamental researches in network science as it is closely associated with the reliability and functionality of various networking paradigms. However, despite the study on intrinsic topological vulnerabilities to node removals, little is known on the network robustness when network defense mechanisms are implemented, especially for networked engineering systems equipped with detection capabilities. In this paper, a sequential defense mechanism is first proposed in complex networks for attack inference and vulnerability assessment, where the data fusion center sequentially infers the presence of an attack based on the binary attack status reported from the nodes in the network. The network robustness is evaluated in terms of the ability to identify the attack prior to network disruption under two major attack schemes, i.e., random and intentional attacks. We provide a parametric plug-in model for performance evaluation on the proposed mechanism and validate its effectiveness and reliability via canonical complex network models and real-world large-scale network topology. The results show that the sequential defense mechanism greatly improves the network robustness and mitigates the possibility of network disruption by acquiring limited attack status information from a small subset of nodes in the network.

  17. Brain potentials index executive functions during random number generation.

    Science.gov (United States)

    Joppich, Gregor; Däuper, Jan; Dengler, Reinhard; Johannes, Sönke; Rodriguez-Fornells, Antoni; Münte, Thomas F

    2004-06-01

    The generation of random sequences is considered to tax different executive functions. To explore the involvement of these functions further, brain potentials were recorded in 16 healthy young adults while either engaging in random number generation (RNG) by pressing the number keys on a computer keyboard in a random sequence or in ordered number generation (ONG) necessitating key presses in the canonical order. Key presses were paced by an external auditory stimulus to yield either fast (1 press/800 ms) or slow (1 press/1300 ms) sequences in separate runs. Attentional demands of random and ordered tasks were assessed by the introduction of a secondary task (key-press to a target tone). The P3 amplitude to the target tone of this secondary task was reduced during RNG, reflecting the greater consumption of attentional resources during RNG. Moreover, RNG led to a left frontal negativity peaking 140 ms after the onset of the pacing stimulus, whenever the subjects produced a true random response. This negativity could be attributed to the left dorsolateral prefrontal cortex and was absent when numbers were repeated. This negativity was interpreted as an index for the inhibition of habitual responses. Finally, in response locked ERPs a negative component was apparent peaking about 50 ms after the key-press that was more prominent during RNG. Source localization suggested a medial frontal source. This effect was tentatively interpreted as a reflection of the greater monitoring demands during random sequence generation.

  18. Cascading failures in spatially-embedded random networks.

    Science.gov (United States)

    Asztalos, Andrea; Sreenivasan, Sameet; Szymanski, Boleslaw K; Korniss, Gyorgy

    2014-01-01

    Cascading failures constitute an important vulnerability of interconnected systems. Here we focus on the study of such failures on networks in which the connectivity of nodes is constrained by geographical distance. Specifically, we use random geometric graphs as representative examples of such spatial networks, and study the properties of cascading failures on them in the presence of distributed flow. The key finding of this study is that the process of cascading failures is non-self-averaging on spatial networks, and thus, aggregate inferences made from analyzing an ensemble of such networks lead to incorrect conclusions when applied to a single network, no matter how large the network is. We demonstrate that this lack of self-averaging disappears with the introduction of a small fraction of long-range links into the network. We simulate the well studied preemptive node removal strategy for cascade mitigation and show that it is largely ineffective in the case of spatial networks. We introduce an altruistic strategy designed to limit the loss of network nodes in the event of a cascade triggering failure and show that it performs better than the preemptive strategy. Finally, we consider a real-world spatial network viz. a European power transmission network and validate that our findings from the study of random geometric graphs are also borne out by simulations of cascading failures on the empirical network.

  19. Decoding Algorithms for Random Linear Network Codes

    DEFF Research Database (Denmark)

    Heide, Janus; Pedersen, Morten Videbæk; Fitzek, Frank

    2011-01-01

    We consider the problem of efficient decoding of a random linear code over a finite field. In particular we are interested in the case where the code is random, relatively sparse, and use the binary finite field as an example. The goal is to decode the data using fewer operations to potentially a...

  20. Efficient Raman generation in a waveguide: A route to ultrafast quantum random number generation

    Energy Technology Data Exchange (ETDEWEB)

    England, D. G.; Bustard, P. J.; Moffatt, D. J.; Nunn, J.; Lausten, R.; Sussman, B. J., E-mail: ben.sussman@nrc.ca [National Research Council of Canada, 100 Sussex Drive, Ottawa, Ontario K1A 0R6 (Canada)

    2014-02-03

    The inherent uncertainty in quantum mechanics offers a source of true randomness which can be used to produce unbreakable cryptographic keys. We discuss the development of a high-speed random number generator based on the quantum phase fluctuations in spontaneously initiated stimulated Raman scattering (SISRS). We utilize the tight confinement and long interaction length available in a Potassium Titanyl Phosphate waveguide to generate highly efficient SISRS using nanojoule pulse energies, reducing the high pump power requirements of the previous approaches. We measure the random phase of the Stokes output using a simple interferometric setup to yield quantum random numbers at 145 Mbps.

  1. Robustness of Dengue Complex Network under Targeted versus Random Attack

    Directory of Open Access Journals (Sweden)

    Hafiz Abid Mahmood Malik

    2017-01-01

    Full Text Available Dengue virus infection is one of those epidemic diseases that require much consideration in order to save the humankind from its unsafe impacts. According to the World Health Organization (WHO, 3.6 billion individuals are at risk because of the dengue virus sickness. Researchers are striving to comprehend the dengue threat. This study is a little commitment to those endeavors. To observe the robustness of the dengue network, we uprooted the links between nodes randomly and targeted by utilizing different centrality measures. The outcomes demonstrated that 5% targeted attack is equivalent to the result of 65% random assault, which showed the topology of this complex network validated a scale-free network instead of random network. Four centrality measures (Degree, Closeness, Betweenness, and Eigenvector have been ascertained to look for focal hubs. It has been observed through the results in this study that robustness of a node and links depends on topology of the network. The dengue epidemic network presented robust behaviour under random attack, and this network turned out to be more vulnerable when the hubs of higher degree have higher probability to fail. Moreover, representation of this network has been projected, and hub removal impact has been shown on the real map of Gombak (Malaysia.

  2. Chaos-based Pseudo-random Number Generation

    KAUST Repository

    Barakat, Mohamed L.

    2014-04-10

    Various methods and systems related to chaos-based pseudo-random number generation are presented. In one example, among others, a system includes a pseudo-random number generator (PRNG) to generate a series of digital outputs and a nonlinear post processing circuit to perform an exclusive OR (XOR) operation on a first portion of a current digital output of the PRNG and a permutated version of a corresponding first portion of a previous post processed output to generate a corresponding first portion of a current post processed output. In another example, a method includes receiving at least a first portion of a current output from a PRNG and performing an XOR operation on the first portion of the current PRNG output with a permutated version of a corresponding first portion of a previous post processed output to generate a corresponding first portion of a current post processed output.

  3. Maximal information transfer and behavior diversity in Random Threshold Networks.

    Science.gov (United States)

    Andrecut, M; Foster, D; Carteret, H; Kauffman, S A

    2009-07-01

    Random Threshold Networks (RTNs) are an idealized model of diluted, non-symmetric spin glasses, neural networks or gene regulatory networks. RTNs also serve as an interesting general example of any coordinated causal system. Here we study the conditions for maximal information transfer and behavior diversity in RTNs. These conditions are likely to play a major role in physical and biological systems, perhaps serving as important selective traits in biological systems. We show that the pairwise mutual information is maximized in dynamically critical networks. Also, we show that the correlated behavior diversity is maximized for slightly chaotic networks, close to the critical region. Importantly, critical networks maximize coordinated, diverse dynamical behavior across the network and across time: the information transmission between source and receiver nodes and the diversity of dynamical behaviors, when measured with a time delay between the source and receiver, are maximized for critical networks.

  4. Random generation of RNA secondary structures according to native distributions

    Directory of Open Access Journals (Sweden)

    Nebel Markus E

    2011-10-01

    Full Text Available Abstract Background Random biological sequences are a topic of great interest in genome analysis since, according to a powerful paradigm, they represent the background noise from which the actual biological information must differentiate. Accordingly, the generation of random sequences has been investigated for a long time. Similarly, random object of a more complicated structure like RNA molecules or proteins are of interest. Results In this article, we present a new general framework for deriving algorithms for the non-uniform random generation of combinatorial objects according to the encoding and probability distribution implied by a stochastic context-free grammar. Briefly, the framework extends on the well-known recursive method for (uniform random generation and uses the popular framework of admissible specifications of combinatorial classes, introducing weighted combinatorial classes to allow for the non-uniform generation by means of unranking. This framework is used to derive an algorithm for the generation of RNA secondary structures of a given fixed size. We address the random generation of these structures according to a realistic distribution obtained from real-life data by using a very detailed context-free grammar (that models the class of RNA secondary structures by distinguishing between all known motifs in RNA structure. Compared to well-known sampling approaches used in several structure prediction tools (such as SFold ours has two major advantages: Firstly, after a preprocessing step in time O(n2 for the computation of all weighted class sizes needed, with our approach a set of m random secondary structures of a given structure size n can be computed in worst-case time complexity Om⋅n⋅ log(n while other algorithms typically have a runtime in O(m⋅n2. Secondly, our approach works with integer arithmetic only which is faster and saves us from all the discomforting details of using floating point arithmetic with

  5. Transition to Chaos in Random Neuronal Networks

    National Research Council Canada - National Science Library

    Jonathan Kadmon; Haim Sompolinsky

    2015-01-01

    .... Indeed, simplified rate-based neuronal networks with synaptic connections drawn from Gaussian distribution and sigmoidal nonlinearity are known to exhibit chaotic dynamics when the synaptic gain (i.e...

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

    Science.gov (United States)

    Wang, Ya-Qi; Yang, Xiao-Yuan

    2013-01-01

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

  7. A Quickly Tested Pascal Random Number Generator for Microcomputers.

    Science.gov (United States)

    1985-05-01

    in any way at equal intervals spaced h units apart, the serial correlation of the series can be obtained for various lags and tested against...pass handily. The unit range between zero and unity was divided into 100 equally spaced frequencies, and the generated random numbers were...NSDTEST; (*MEAN AND SDEV TESTS*) FREQKOLTEST; (*CHISQ FREQ DISTR AND KOLMOGOROFF -SMIRNOV TESTS*) PAIRTEST; (*TEST DISTR OF RANDOM PAIRS*) TRIOTEST; (*TEST

  8. Building next-generation converged networks theory and practice

    CERN Document Server

    Pathan, Al-Sakib Khan

    2013-01-01

    Supplying a comprehensive introduction to next-generation networks, Building Next-Generation Converged Networks: Theory and Practice strikes a balance between how and why things work and how to make them work. It compiles recent advancements along with basic issues from the wide range of fields related to next generation networks. Containing the contributions of 56 industry experts and researchers from 16 different countries, the book presents relevant theoretical frameworks and the latest research. It investigates new technologies such as IPv6 over Low Power Wireless Personal Area Network (6L

  9. Next generation network performance management: a business perspective

    CSIR Research Space (South Africa)

    Harding, C

    2010-08-01

    Full Text Available This paper addresses a Next Generation Network (NGN) performance management model in a business context. The CSIR is currently in the process of the concept design for the new Next Generation Communications Network (NGCN) for a large South African...

  10. Transient stability analysis of a distribution network with distributed generators

    NARCIS (Netherlands)

    Xyngi, I.; Ishchenko, A.; Popov, M.; Van der Sluis, L.

    2009-01-01

    This letter describes the transient stability analysis of a 10-kV distribution network with wind generators, microturbines, and CHP plants. The network being modeled in Matlab/Simulink takes into account detailed dynamic models of the generators. Fault simulations at various locations are

  11. Analysis of entropy extraction efficiencies in random number generation systems

    Science.gov (United States)

    Wang, Chao; Wang, Shuang; Chen, Wei; Yin, Zhen-Qiang; Han, Zheng-Fu

    2016-05-01

    Random numbers (RNs) have applications in many areas: lottery games, gambling, computer simulation, and, most importantly, cryptography [N. Gisin et al., Rev. Mod. Phys. 74 (2002) 145]. In cryptography theory, the theoretical security of the system calls for high quality RNs. Therefore, developing methods for producing unpredictable RNs with adequate speed is an attractive topic. Early on, despite the lack of theoretical support, pseudo RNs generated by algorithmic methods performed well and satisfied reasonable statistical requirements. However, as implemented, those pseudorandom sequences were completely determined by mathematical formulas and initial seeds, which cannot introduce extra entropy or information. In these cases, “random” bits are generated that are not at all random. Physical random number generators (RNGs), which, in contrast to algorithmic methods, are based on unpredictable physical random phenomena, have attracted considerable research interest. However, the way that we extract random bits from those physical entropy sources has a large influence on the efficiency and performance of the system. In this manuscript, we will review and discuss several randomness extraction schemes that are based on radiation or photon arrival times. We analyze the robustness, post-processing requirements and, in particular, the extraction efficiency of those methods to aid in the construction of efficient, compact and robust physical RNG systems.

  12. Theoretical solutions for degree distribution of decreasing random birth-and-death networks

    Science.gov (United States)

    Long, Yin; Zhang, Xiao-Jun; Wang, Kui

    2017-05-01

    In this paper, theoretical solutions for degree distribution of decreasing random birth-and-death networks (0 probability generating function approach are employed. Then, based on the form of Poisson summation, we further confirm the tail characteristic of degree distribution is Poisson tail. Finally, simulations are carried out to verify these results by comparing the theoretical solutions with computer simulations.

  13. Quantum random flip-flop and its applications in random frequency synthesis and true random number generation

    Energy Technology Data Exchange (ETDEWEB)

    Stipčević, Mario, E-mail: mario.stipcevic@irb.hr [Photonics and Quantum Optics Research Unit, Center of Excellence for Advanced Materials and Sensing Devices, Ruđer Bošković Institute, Bijenička 54, 10000 Zagreb (Croatia)

    2016-03-15

    In this work, a new type of elementary logic circuit, named random flip-flop (RFF), is proposed, experimentally realized, and studied. Unlike conventional Boolean logic circuits whose action is deterministic and highly reproducible, the action of a RFF is intentionally made maximally unpredictable and, in the proposed realization, derived from a fundamentally random process of emission and detection of light quanta. We demonstrate novel applications of RFF in randomness preserving frequency division, random frequency synthesis, and random number generation. Possible usages of these applications in the information and communication technology, cryptographic hardware, and testing equipment are discussed.

  14. Selecting Optimal Parameters of Random Linear Network Coding for Wireless Sensor Networks

    DEFF Research Database (Denmark)

    Heide, Janus; Zhang, Qi; Fitzek, Frank

    2013-01-01

    This work studies how to select optimal code parameters of Random Linear Network Coding (RLNC) in Wireless Sensor Networks (WSNs). With Rateless Deluge [1] the authors proposed to apply Network Coding (NC) for Over-the-Air Programming (OAP) in WSNs, and demonstrated that with NC a significant...

  15. Traffic Management for Next Generation Transport Networks

    DEFF Research Database (Denmark)

    Yu, Hao

    their network capacities. However, in order to provide more advanced video services than simply porting the traditional television services to the network, the service provider needs to do more than just augment the network capacity. Advanced traffic management capability is one of the relevant abilities...... slacken the steps of some network operators towards providing IPTV services. In this dissertation, the topology-based hierarchical scheduling scheme is proposed to tackle the problem addressed. The scheme simplifies the deployment process by placing an intelligent switch with centralized traffic...... management functions at the edge of the network, scheduling traffic on behalf of the other nodes. The topology-based hierarchical scheduling scheme is able to provide outstanding flow isolation due to its centralized scheduling ability, which is essential for providing IPTV services. In order to reduce...

  16. Centralized Networks to Generate Human Body Motions.

    Science.gov (United States)

    Vakulenko, Sergei; Radulescu, Ovidiu; Morozov, Ivan; Weber, Andres

    2017-12-14

    We consider continuous-time recurrent neural networks as dynamical models for the simulation of human body motions. These networks consist of a few centers and many satellites connected to them. The centers evolve in time as periodical oscillators with different frequencies. The center states define the satellite neurons' states by a radial basis function (RBF) network. To simulate different motions, we adjust the parameters of the RBF networks. Our network includes a switching module that allows for turning from one motion to another. Simulations show that this model allows us to simulate complicated motions consisting of many different dynamical primitives. We also use the model for learning human body motion from markers' trajectories. We find that center frequencies can be learned from a small number of markers and can be transferred to other markers, such that our technique seems to be capable of correcting for missing information resulting from sparse control marker settings.

  17. Innovation and networking among entrepreneurs across generations of Asian tigers

    DEFF Research Database (Denmark)

    Brambini-Pedersen, Jan Vang; Jensen, Kent W; Schøtt, Thomas

    2017-01-01

    Much attention has been paid to analysing the determinants of the economic development in the different generations of Asian tiger economies. This stream of research has provided valuable insights on the particular generational challenges, the tigers face in implementing successful catching up...... entrepreneurship monitor (GEM) data, this paper aims at reducing this research gap by conducting an analysis of the generational differences between the tiger economies entrepreneurs in respect to their innovative performance, their inclination to network and the importance of the quality of the network...... for their innovative performance. The paper finds a significant difference in the quality of the networks and its impact on innovation across the tiger generations....

  18. Efficient sampling of complex network with modified random walk strategies

    Science.gov (United States)

    Xie, Yunya; Chang, Shuhua; Zhang, Zhipeng; Zhang, Mi; Yang, Lei

    2018-02-01

    We present two novel random walk strategies, choosing seed node (CSN) random walk and no-retracing (NR) random walk. Different from the classical random walk sampling, the CSN and NR strategies focus on the influences of the seed node choice and path overlap, respectively. Three random walk samplings are applied in the Erdös-Rényi (ER), Barabási-Albert (BA), Watts-Strogatz (WS), and the weighted USAir networks, respectively. Then, the major properties of sampled subnets, such as sampling efficiency, degree distributions, average degree and average clustering coefficient, are studied. The similar conclusions can be reached with these three random walk strategies. Firstly, the networks with small scales and simple structures are conducive to the sampling. Secondly, the average degree and the average clustering coefficient of the sampled subnet tend to the corresponding values of original networks with limited steps. And thirdly, all the degree distributions of the subnets are slightly biased to the high degree side. However, the NR strategy performs better for the average clustering coefficient of the subnet. In the real weighted USAir networks, some obvious characters like the larger clustering coefficient and the fluctuation of degree distribution are reproduced well by these random walk strategies.

  19. Random fracture networks: percolation, geometry and flow

    Science.gov (United States)

    Adler, P. M.; Thovert, J. F.; Mourzenko, V. V.

    2015-12-01

    This paper reviews some of the basic properties of fracture networks. Most of the data can only be derived numerically, and to be useful they need to be rationalized, i.e., a large set of numbers should be replaced by a simple formula which is easy to apply for estimating orders of magnitude. Three major tools are found useful in this rationalization effort. First, analytical results can usually be derived for infinite fractures, a limit which corresponds to large densities. Second, the excluded volume and the dimensionless density prove crucial to gather data obtained at intermediate densities. Finally, shape factors can be used to further reduce the influence of fracture shapes. Percolation of fracture networks is of primary importance since this characteristic controls transport properties such as permeability. Recent numerical studies for various types of fracture networks (isotropic, anisotropic, heterogeneous in space, polydisperse, mixture of shapes) are summarized; the percolation threshold rho is made dimensionless by means of the excluded volume. A general correlation for rho is proposed as a function of the gyration radius. The statistical characteristics of the blocks which are cut in the solid matrix by the network are presented, since they control transfers between the porous matrix and the fractures. Results on quantities such as the volume, surface and number of faces are given and semi empirical relations are proposed. The possible intersection of a percolating network and of a cubic cavity is also summarized. This might be of importance for the underground storage of wastes. An approximate reasoning based on the excluded volume of the percolating cluster and of the cubic cavity is proposed. Finally, consequences on the permeability of fracture networks are briefly addressed. An empirical formula which verifies some theoretical properties is proposed.

  20. Random walks on activity-driven networks with attractiveness

    Science.gov (United States)

    Alessandretti, Laura; Sun, Kaiyuan; Baronchelli, Andrea; Perra, Nicola

    2017-05-01

    Virtually all real-world networks are dynamical entities. In social networks, the propensity of nodes to engage in social interactions (activity) and their chances to be selected by active nodes (attractiveness) are heterogeneously distributed. Here, we present a time-varying network model where each node and the dynamical formation of ties are characterized by these two features. We study how these properties affect random-walk processes unfolding on the network when the time scales describing the process and the network evolution are comparable. We derive analytical solutions for the stationary state and the mean first-passage time of the process, and we study cases informed by empirical observations of social networks. Our work shows that previously disregarded properties of real social systems, such as heterogeneous distributions of activity and attractiveness as well as the correlations between them, substantially affect the dynamical process unfolding on the network.

  1. Random field Ising model and community structure in complex networks

    Science.gov (United States)

    Son, S.-W.; Jeong, H.; Noh, J. D.

    2006-04-01

    We propose a method to determine the community structure of a complex network. In this method the ground state problem of a ferromagnetic random field Ising model is considered on the network with the magnetic field Bs = +∞, Bt = -∞, and Bi≠s,t=0 for a node pair s and t. The ground state problem is equivalent to the so-called maximum flow problem, which can be solved exactly numerically with the help of a combinatorial optimization algorithm. The community structure is then identified from the ground state Ising spin domains for all pairs of s and t. Our method provides a criterion for the existence of the community structure, and is applicable equally well to unweighted and weighted networks. We demonstrate the performance of the method by applying it to the Barabási-Albert network, Zachary karate club network, the scientific collaboration network, and the stock price correlation network. (Ising, Potts, etc.)

  2. Topological properties of random wireless networks

    Indian Academy of Sciences (India)

    indicating that a physical infrastructure needs to be put in place before nodes can communicate. Ad hoc and sensor ... edges, the communication paths of the wireless network can be represented by a graph. The representation of the ..... Pr (Gn ∈ P) → 1. Another definition of a threshold is from Friedgut & Kalal (1996). For a.

  3. Generation of Source Data for Experiments with Network Attack Detection Software

    Science.gov (United States)

    Kotenko, Igor; Chechulin, Andrey; Branitskiy, Alexander

    2017-03-01

    The paper suggests a new approach for traffic generation and the architecture of the software tool for evaluation of attack detection and response mechanisms. To assess the proposed approach the automatic network attack detection and response mechanism Threshold Random Walk (TRW) was chosen and implemented. The results of evaluation of this mechanism by the proposed software tool are presented.

  4. Phoebus: Network Middleware for Next-Generation Network Computing

    Energy Technology Data Exchange (ETDEWEB)

    Martin Swany

    2012-06-16

    The Phoebus project investigated algorithms, protocols, and middleware infrastructure to improve end-to-end performance in high speed, dynamic networks. The Phoebus system essentially serves as an adaptation point for networks with disparate capabilities or provisioning. This adaptation can take a variety of forms including acting as a provisioning agent across multiple signaling domains, providing transport protocol adaptation points, and mapping between distributed resource reservation paradigms and the optical network control plane. We have successfully developed the system and demonstrated benefits. The Phoebus system was deployed in Internet2 and in ESnet, as well as in GEANT2, RNP in Brazil and over international links to Korea and Japan. Phoebus is a system that implements a new protocol and associated forwarding infrastructure for improving throughput in high-speed dynamic networks. It was developed to serve the needs of large DOE applications on high-performance networks. The idea underlying the Phoebus model is to embed Phoebus Gateways (PGs) in the network as on-ramps to dynamic circuit networks. The gateways act as protocol translators that allow legacy applications to use dedicated paths with high performance.

  5. The Evolution of Random Number Generation in MUVES

    Science.gov (United States)

    2017-01-01

    3 2. Collins JC . Testing, selection, and implementation of random number genera- tors. Aberdeen Proving Ground (MD): Army Research Laboratory (US...261–269. 13, 16 5. L‘Ecuyer P. Tables of linear congruential generators of different sizes and good lattice structure. Mathematics of Computation

  6. Random Scenario Generation for a Multiple Target Tracking Environment Evaluation

    DEFF Research Database (Denmark)

    Hussain, Dil Muhammad Akbar

    2006-01-01

    The paper presents a simulation study on the generation of a random scenario for the performance of track splitting algorithm on a digital signal processor.  Much of the previous work [1] was done on specific (deterministic) scenarios. One of the reasons for considering the specific scenarios, wh...

  7. Simulations Using Random-Generated DNA and RNA Sequences

    Science.gov (United States)

    Bryce, C. F. A.

    1977-01-01

    Using a very simple computer program written in BASIC, a very large number of random-generated DNA or RNA sequences are obtained. Students use these sequences to predict complementary sequences and translational products, evaluate base compositions, determine frequencies of particular triplet codons, and suggest possible secondary structures.…

  8. REGAL: a library to randomly and exhaustively generate automata

    OpenAIRE

    Bassino, Frédérique; David, Julien; Nicaud, Cyril

    2007-01-01

    International audience; This paper presents a library devoted to the random and exhaustive generation of finite deterministic automata. This package provides a toolkit to experimentally study properties of automata, average complexities of algorithms dealing with automata or to compare different implementations of the same algorithm.

  9. Generation of genetically modified rodents using random ENU mutagenesis

    NARCIS (Netherlands)

    van Boxtel, R.; Cuppen, E.

    2011-01-01

    The generation of genetically modified animals using N-ethyl-N-nitrosourea (ENU) mutagenesis is a fast and highly effective method. The technique is based on treating male animals with the supermutagen ENU, which randomly introduces mutations in the spermatogonial stem cells. By breeding these

  10. Electrical generation of stationary light in random scattering media

    Science.gov (United States)

    Redmond, S. M.; Armstrong, G. L.; Chan, H.-Y.; Mattson, E.; Mock, A.; Li, B.; Potts, J. R.; Cui, M.; Rand, S. C.; Oliveira, S. L.; Marchal, J.; Hinklin, T.; Laine, R. M.

    2004-01-01

    In recent years there has been great interest in controlling the speed of propagation of electromagnetic waves. In gases and crystals, coherent techniques have been applied to alter the speed of light without changing the physical or chemical structure of the medium. Also, light transmitted by highly disordered solids has exhibited signatures of Anderson localization, indicating the existence of a regime of ``stopped'' light that is mediated by random elastic scattering. However, to date, light has not been generated in a random medium as a pointlike excitation that is fixed in space from the outset. Here we report experimental evidence for the electrical generation and confinement of light within nanosized volumes of a random dielectric scattering medium in which a population inversion has been established, and discuss the properties of these novel light sources.

  11. Source-Device-Independent Ultrafast Quantum Random Number Generation

    Science.gov (United States)

    Marangon, Davide G.; Vallone, Giuseppe; Villoresi, Paolo

    2017-02-01

    Secure random numbers are a fundamental element of many applications in science, statistics, cryptography and more in general in security protocols. We present a method that enables the generation of high-speed unpredictable random numbers from the quadratures of an electromagnetic field without any assumption on the input state. The method allows us to eliminate the numbers that can be predicted due to the presence of classical and quantum side information. In particular, we introduce a procedure to estimate a bound on the conditional min-entropy based on the entropic uncertainty principle for position and momentum observables of infinite dimensional quantum systems. By the above method, we experimentally demonstrated the generation of secure true random bits at a rate greater than 1.7 Gbit /s .

  12. Efficient biased random bit generation for parallel processing

    Energy Technology Data Exchange (ETDEWEB)

    Slone, Dale M. [Univ. of California, Davis, CA (United States)

    1994-09-28

    A lattice gas automaton was implemented on a massively parallel machine (the BBN TC2000) and a vector supercomputer (the CRAY C90). The automaton models Burgers equation ρt + ρρx = vρxx in 1 dimension. The lattice gas evolves by advecting and colliding pseudo-particles on a 1-dimensional, periodic grid. The specific rules for colliding particles are stochastic in nature and require the generation of many billions of random numbers to create the random bits necessary for the lattice gas. The goal of the thesis was to speed up the process of generating the random bits and thereby lessen the computational bottleneck of the automaton.

  13. Random number generation based on digital differential chaos

    KAUST Repository

    Zidan, Mohammed A.

    2012-07-29

    In this paper, we present a fully digital differential chaos based random number generator. The output of the digital circuit is proved to be chaotic by calculating the output time series maximum Lyapunov exponent. We introduce a new post processing technique to improve the distribution and statistical properties of the generated data. The post-processed output passes the NIST Sp. 800-22 statistical tests. The system is written in Verilog VHDL and realized on Xilinx Virtex® FPGA. The generator can fit into a very small area and have a maximum throughput of 2.1 Gb/s.

  14. Dynamic Output Feedback Control for Nonlinear Networked Control Systems with Random Packet Dropout and Random Delay

    Directory of Open Access Journals (Sweden)

    Shuiqing Yu

    2013-01-01

    Full Text Available This paper investigates the dynamic output feedback control for nonlinear networked control systems with both random packet dropout and random delay. Random packet dropout and random delay are modeled as two independent random variables. An observer-based dynamic output feedback controller is designed based upon the Lyapunov theory. The quantitative relationship of the dropout rate, transition probability matrix, and nonlinear level is derived by solving a set of linear matrix inequalities. Finally, an example is presented to illustrate the effectiveness of the proposed method.

  15. DNA based random key generation and management for OTP encryption.

    Science.gov (United States)

    Zhang, Yunpeng; Liu, Xin; Sun, Manhui

    2017-09-01

    One-time pad (OTP) is a principle of key generation applied to the stream ciphering method which offers total privacy. The OTP encryption scheme has proved to be unbreakable in theory, but difficult to realize in practical applications. Because OTP encryption specially requires the absolute randomness of the key, its development has suffered from dense constraints. DNA cryptography is a new and promising technology in the field of information security. DNA chromosomes storing capabilities can be used as one-time pad structures with pseudo-random number generation and indexing in order to encrypt the plaintext messages. In this paper, we present a feasible solution to the OTP symmetric key generation and transmission problem with DNA at the molecular level. Through recombinant DNA technology, by using only sender-receiver known restriction enzymes to combine the secure key represented by DNA sequence and the T vector, we generate the DNA bio-hiding secure key and then place the recombinant plasmid in implanted bacteria for secure key transmission. The designed bio experiments and simulation results show that the security of the transmission of the key is further improved and the environmental requirements of key transmission are reduced. Analysis has demonstrated that the proposed DNA-based random key generation and management solutions are marked by high security and usability. Published by Elsevier B.V.

  16. Network motif identification and structure detection with exponential random graph models

    Directory of Open Access Journals (Sweden)

    Munni Begum

    2014-12-01

    Full Text Available Local regulatory motifs are identified in the transcription regulatory network of the most studied model organism Escherichia coli (E. coli through graphical models. Network motifs are small structures in a network that appear more frequently than expected by chance alone. We apply social network methodologies such as p* models, also known as Exponential Random Graph Models (ERGMs, to identify statistically significant network motifs. In particular, we generate directed graphical models that can be applied to study interaction networks in a broad range of databases. The Markov Chain Monte Carlo (MCMC computational algorithms are implemented to obtain the estimates of model parameters to the corresponding network statistics. A variety of ERGMs are fitted to identify statistically significant network motifs in transcription regulatory networks of E. coli. A total of nine ERGMs are fitted to study the transcription factor - transcription factor interactions and eleven ERGMs are fitted for the transcription factor-operon interactions. For both of these interaction networks, arc (a directed edge in a directed network and k-istar (or incoming star structures, for values of k between 2 and 10, are found to be statistically significant local structures or network motifs. The goodness of fit statistics are provided to determine the quality of these models.

  17. Reconstruction of a random phase dynamics network from observations

    Science.gov (United States)

    Pikovsky, A.

    2018-01-01

    We consider networks of coupled phase oscillators of different complexity: Kuramoto-Daido-type networks, generalized Winfree networks, and hypernetworks with triple interactions. For these setups an inverse problem of reconstruction of the network connections and of the coupling function from the observations of the phase dynamics is addressed. We show how a reconstruction based on the minimization of the squared error can be implemented in all these cases. Examples include random networks with full disorder both in the connections and in the coupling functions, as well as networks where the coupling functions are taken from experimental data of electrochemical oscillators. The method can be directly applied to asynchronous dynamics of units, while in the case of synchrony, additional phase resettings are necessary for reconstruction.

  18. Next Generation Network Routing and Control Plane

    DEFF Research Database (Denmark)

    Fu, Rong

    proved, the dominating Border Gateway Protocol (BGP) cannot address all the issues that in inter-domain QoS routing. Thus a new protocol or network architecture has to be developed to be able to carry the inter-domain traffic with the QoS and TE consideration. Moreover, the current network control also......-domain. It is a routing component that flexibly supports path computation with different requirements, constraints and areas. It is also can be seen as part of NGN transport control plane, which integrates with the other functions. In the aspect of resource control, an NGN release Resource and Admission Control Functions...... of Service classes. Under the NGN context, there are plenty of proposals intending to accommodate the issues listed above. Path Computation Elements (PCE) proposed by IETF designs suitable network architecture that aiming at compute the QoS based paths for traffic transportation through intra- and inter...

  19. Eigentime identities for random walks on a family of treelike networks and polymer networks

    Science.gov (United States)

    Dai, Meifeng; Wang, Xiaoqian; Sun, Yanqiu; Sun, Yu; Su, Weiyi

    2017-10-01

    In this paper, we investigate the eigentime identities quantifying as the sum of reciprocals of all nonzero normalized Laplacian eigenvalues on a family of treelike networks and the polymer networks. Firstly, for a family of treelike networks, it is shown that all their eigenvalues can be obtained by computing the roots of several small-degree polynomials defined recursively. We obtain the scalings of the eigentime identity on a family of treelike with network size Nn is Nn lnNn. Then, for the polymer networks, we apply the spectral decimation approach to determine analytically all the eigenvalues and their corresponding multiplicities. Using the relationship between the generation and the next generation of eigenvalues we obtain the scalings of the eigentime identity on the polymer networks with network size Nn is Nn lnNn. By comparing the eigentime identities on these two kinds of networks, their scalings with network size Nn are all Nn lnNn.

  20. Migration of optical core network to next generation networks - Carrier Grade Ethernet Optical Transport Network

    Science.gov (United States)

    Glamočanin, D.

    2017-05-01

    In order to maintain the continuity of the telecom operators’ network construction, while monitoring development needs, increasing customers’ demands and application of technological improvements, it is necessary to migrate optical transport core network to the next generation networks - Carrier Grade Ethernet Optical Transport Network (OTN CE). The primary objective of OTN CE is to realize an environment that is based solely on the switching in the optical domain, i.e. the realization of transparent optical networks and optical switching to the second layer of ISO / OSI model. The realization of such a network provides opportunities for further development of existing, but also technologically more demanding, new services. It is also a prerequisite to provide higher scalability, reliability, security and quality of QoS service, as well as prerequisites for the establishment of SLA (Service Level Agreement) for existing services, especially traffic in real time. This study aims to clarify the proposed model, which has the potential to be eventually adjusted in accordance with new scientific knowledge in this field as well as market requirements.

  1. Long term outcomes of new generation drug eluting stents versus coronary artery bypass grafting for multivessel and/or left main coronary artery disease. A Bayesian network meta-analysis of randomized controlled trials.

    Science.gov (United States)

    Mina, George S; Watti, Hussam; Soliman, Demiana; Shewale, Anand; Atkins, Jessica; Reddy, Pratap; Dominic, Paari

    2018-01-05

    Most data guiding revascularization of multivessel disease (MVD) and/or left main disease (LMD) favor coronary artery bypass grafting (CABG) over percutaneous coronary intervention (PCI). However, those data are based on trials comparing CABG to bare metal stents (BMS) or old generation drug eluting stents (OG-DES). Hence, it is essential to outcomes of CABG to those of new generation drug eluting stents (NG-DES). We searched PUBMED and Cochrane database for trials evaluating revascularization of MVD and/or LMD with CABG and/or PCI. A Bayesian network meta-analysis was performed to calculate odds ratios (OR) and 95% credible intervals (CrI). Primary outcome was major adverse cardiovascular events (MACE) at 3-5 years. Secondary outcomes were mortality, cerebrovascular accidents (CVA), myocardial infarction (MI) and repeat revascularization. We included 10 trials with a total of 9287 patients. CABG was associated with lower MACE when compared to BMS or OG-DES. However, MACE was not significantly different between CABG and NG-DES (OR 0.79, CrI 0.45-1.40). Moreover, there were no significant differences between CABG and NG-DES in mortality (OR 0.78, CrI 0.45-1.37), CVA (OR 0.93 CrI 0.35-2.2) or MI (OR 0.6, CrI 0.17-2.0). On the other hand, CABG was associated with lower repeat revascularization (OR 0.55, CrI 0.36-0.84). Our study suggests that NG-DES is an acceptable alternative to CABG in patients with MVD and/or LMD. However, repeat revascularization remains to be lower with CABG than with PCI. Copyright © 2018. Published by Elsevier Inc.

  2. Convergence of wireless, wireline, and photonics next generation networks

    CERN Document Server

    Iniewski, Krzysztof

    2010-01-01

    Filled with illustrations and practical examples from industry, this book provides a brief but comprehensive introduction to the next-generation wireless networks that will soon replace more traditional wired technologies. Written by a mixture of top industrial experts and key academic professors, it is the only book available that covers both wireless networks (such as wireless local area and personal area networks) and optical networks (such as long-haul and metropolitan networks) in one volume. It gives engineers and engineering students the necessary knowledge to meet challenges of next-ge

  3. Mobile location services over the next generation IP core network

    DEFF Research Database (Denmark)

    Thongthammachart, Saowanee; Olesen, Henning

    2003-01-01

    network is changing from circuit-switched to packet-switched technology and evolving to an IP core network based on IPv6. The IP core network will allow all IP devices to be connected seamlessly. Due to the movement detection mechanism of Mobile IPv6, mobile terminals will periodically update....... The concept of mobile location services over the next generation IP networks is described. We also discuss the effectiveness of the short-range wireless network regarding a mobile user's position inside buildings and hotspot areas....

  4. GASPRNG: GPU accelerated scalable parallel random number generator library

    Science.gov (United States)

    Gao, Shuang; Peterson, Gregory D.

    2013-04-01

    Graphics processors represent a promising technology for accelerating computational science applications. Many computational science applications require fast and scalable random number generation with good statistical properties, so they use the Scalable Parallel Random Number Generators library (SPRNG). We present the GPU Accelerated SPRNG library (GASPRNG) to accelerate SPRNG in GPU-based high performance computing systems. GASPRNG includes code for a host CPU and CUDA code for execution on NVIDIA graphics processing units (GPUs) along with a programming interface to support various usage models for pseudorandom numbers and computational science applications executing on the CPU, GPU, or both. This paper describes the implementation approach used to produce high performance and also describes how to use the programming interface. The programming interface allows a user to be able to use GASPRNG the same way as SPRNG on traditional serial or parallel computers as well as to develop tightly coupled programs executing primarily on the GPU. We also describe how to install GASPRNG and use it. To help illustrate linking with GASPRNG, various demonstration codes are included for the different usage models. GASPRNG on a single GPU shows up to 280x speedup over SPRNG on a single CPU core and is able to scale for larger systems in the same manner as SPRNG. Because GASPRNG generates identical streams of pseudorandom numbers as SPRNG, users can be confident about the quality of GASPRNG for scalable computational science applications. Catalogue identifier: AEOI_v1_0 Program summary URL:http://cpc.cs.qub.ac.uk/summaries/AEOI_v1_0.html Program obtainable from: CPC Program Library, Queen’s University, Belfast, N. Ireland Licensing provisions: UTK license. No. of lines in distributed program, including test data, etc.: 167900 No. of bytes in distributed program, including test data, etc.: 1422058 Distribution format: tar.gz Programming language: C and CUDA. Computer: Any PC or

  5. Generation of correlated finite alphabet waveforms using gaussian random variables

    KAUST Repository

    Jardak, Seifallah

    2014-09-01

    Correlated waveforms have a number of applications in different fields, such as radar and communication. It is very easy to generate correlated waveforms using infinite alphabets, but for some of the applications, it is very challenging to use them in practice. Moreover, to generate infinite alphabet constant envelope correlated waveforms, the available research uses iterative algorithms, which are computationally very expensive. In this work, we propose simple novel methods to generate correlated waveforms using finite alphabet constant and non-constant-envelope symbols. To generate finite alphabet waveforms, the proposed method map the Gaussian random variables onto the phase-shift-keying, pulse-amplitude, and quadrature-amplitude modulation schemes. For such mapping, the probability-density-function of Gaussian random variables is divided into M regions, where M is the number of alphabets in the corresponding modulation scheme. By exploiting the mapping function, the relationship between the cross-correlation of Gaussian and finite alphabet symbols is derived. To generate equiprobable symbols, the area of each region is kept same. If the requirement is to have each symbol with its own unique probability, the proposed scheme allows us that as well. Although, the proposed scheme is general, the main focus of this paper is to generate finite alphabet waveforms for multiple-input multiple-output radar, where correlated waveforms are used to achieve desired beampatterns. © 2014 IEEE.

  6. Synchronization of random bit generators based on coupled chaotic lasers and application to cryptography.

    Science.gov (United States)

    Kanter, Ido; Butkovski, Maria; Peleg, Yitzhak; Zigzag, Meital; Aviad, Yaara; Reidler, Igor; Rosenbluh, Michael; Kinzel, Wolfgang

    2010-08-16

    Random bit generators (RBGs) constitute an important tool in cryptography, stochastic simulations and secure communications. The later in particular has some difficult requirements: high generation rate of unpredictable bit strings and secure key-exchange protocols over public channels. Deterministic algorithms generate pseudo-random number sequences at high rates, however, their unpredictability is limited by the very nature of their deterministic origin. Recently, physical RBGs based on chaotic semiconductor lasers were shown to exceed Gbit/s rates. Whether secure synchronization of two high rate physical RBGs is possible remains an open question. Here we propose a method, whereby two fast RBGs based on mutually coupled chaotic lasers, are synchronized. Using information theoretic analysis we demonstrate security against a powerful computational eavesdropper, capable of noiseless amplification, where all parameters are publicly known. The method is also extended to secure synchronization of a small network of three RBGs.

  7. The Operational Risk Assessment for Distribution Network with Distributed Generations

    Science.gov (United States)

    Hua, Xie; Yaqi, Wu; Yifan, Wang; Qian, Sun; Jianwei, Ma

    2017-05-01

    Distribution network is an important part of the power system and is connected to the consumers directly. Many distributed generations that have discontinuous output power are connected in the distribution networks, which may cause adverse impact to the distribution network. Therefore, to ensure the security and reliability of distribution network with numerous distributed generations, the risk analysis is necessary for this kind of distribution networks. After study of stochastic load flow algorithm, this paper applies it in the static security risk assessment. The wind and photovoltaic output probabilistic model are built. The voltage over-limit is chosen to calculate the risk indicators. As a case study, the IEEE 33 system is simulated for analyzing impact of distributed generations on system risk in the proposed method.

  8. Efficient Video Streaming Scheme for Next Generations of Mobile Networks

    Directory of Open Access Journals (Sweden)

    Majdi Ashibani

    2005-04-01

    Full Text Available Video streaming over next generations of mobile networks has undergone enormous development recently due to the continuing growth in wireless communication, especially since the emergence of 3G wireless networks. The new generations of wireless networks pose many challenges, including supporting quality of service over wireless communication links. This is due to the time-varying characteristics of wireless channel. Therefore, a more flexible and efficient bandwidth allocation scheme is needed. This paper is a part of ongoing work to come up with a more robust scheme that is capable of rapidly adapting to changes in network conditions. The proposed scheme focuses on the wireless part of the network, providing high quality video service and better utilization of network resources.

  9. Listening to the noise: random fluctuations reveal gene network parameters

    Energy Technology Data Exchange (ETDEWEB)

    Munsky, Brian [Los Alamos National Laboratory; Khammash, Mustafa [UCSB

    2009-01-01

    The cellular environment is abuzz with noise. The origin of this noise is attributed to the inherent random motion of reacting molecules that take part in gene expression and post expression interactions. In this noisy environment, clonal populations of cells exhibit cell-to-cell variability that frequently manifests as significant phenotypic differences within the cellular population. The stochastic fluctuations in cellular constituents induced by noise can be measured and their statistics quantified. We show that these random fluctuations carry within them valuable information about the underlying genetic network. Far from being a nuisance, the ever-present cellular noise acts as a rich source of excitation that, when processed through a gene network, carries its distinctive fingerprint that encodes a wealth of information about that network. We demonstrate that in some cases the analysis of these random fluctuations enables the full identification of network parameters, including those that may otherwise be difficult to measure. This establishes a potentially powerful approach for the identification of gene networks and offers a new window into the workings of these networks.

  10. Loss optimization in distribution networks with distributed generation

    DEFF Research Database (Denmark)

    Pokhrel, Basanta Raj; Nainar, Karthikeyan; Bak-Jensen, Birgitte

    2017-01-01

    This paper presents a novel power loss minimization approach in distribution grids considering network reconfiguration, distributed generation and storage installation. Identification of optimum configuration in such scenario is one of the main challenges faced by distribution system operators in...

  11. Resource and power management in next generation networks

    OpenAIRE

    Limani Fazliu, Zana

    2017-01-01

    The limits of today's cellular communication systems are constantly being tested by the exponential increase in mobile data traffic, a trend which is poised to continue well into the next decade. Densification of cellular networks, by overlaying smaller cells, i.e., micro, pico and femtocells, over the traditional macrocell, is seen as an inevitable step in enabling future networks to support the expected increases in data rate demand. Next generation networks will most certainly be more hete...

  12. Custom Topology Generation for Network-on-Chip

    DEFF Research Database (Denmark)

    Stuart, Matthias Bo; Sparsø, Jens

    2007-01-01

    This paper compares simulated annealing and tabu search for generating custom topologies for applications with periodic behaviour executing on a network-on-chip. The approach differs from previous work by starting from a fixed mapping of IP-cores to routers and performing design space exploration....... An analytical model is used to determine communication latencies in the network-on-chip....

  13. Innovation and networking among entrepreneurs across generations of Asian tigers

    DEFF Research Database (Denmark)

    Brambini-Pedersen, Jan Vang; Wickstrøm Jensen, Kent; Schøtt, Thomas

    2017-01-01

    entrepreneurship monitor (GEM) data, this paper aims at reducing this research gap by conducting an analysis of the generational differences between the tiger economies entrepreneurs in respect to their innovative performance, their inclination to network and the importance of the quality of the network...

  14. Distributed network generation based on preferential attachment in ABS

    NARCIS (Netherlands)

    K. Azadbakht (Keyvan); N. Bezirgiannis (Nikolaos); F.S. de Boer (Frank)

    2017-01-01

    textabstractGeneration of social networks using Preferential Attachment (PA) mechanism is proposed in the Barabasi-Albert model. In this mechanism, new nodes are introduced to the network sequentially and they attach to the existing nodes preferentially where the preference can be based on the

  15. Nonparametric resampling of random walks for spectral network clustering

    Science.gov (United States)

    Fallani, Fabrizio De Vico; Nicosia, Vincenzo; Latora, Vito; Chavez, Mario

    2014-01-01

    Parametric resampling schemes have been recently introduced in complex network analysis with the aim of assessing the statistical significance of graph clustering and the robustness of community partitions. We propose here a method to replicate structural features of complex networks based on the non-parametric resampling of the transition matrix associated with an unbiased random walk on the graph. We test this bootstrapping technique on synthetic and real-world modular networks and we show that the ensemble of replicates obtained through resampling can be used to improve the performance of standard spectral algorithms for community detection.

  16. Nonparametric resampling of random walks for spectral network clustering.

    Science.gov (United States)

    De Vico Fallani, Fabrizio; Nicosia, Vincenzo; Latora, Vito; Chavez, Mario

    2014-01-01

    Parametric resampling schemes have been recently introduced in complex network analysis with the aim of assessing the statistical significance of graph clustering and the robustness of community partitions. We propose here a method to replicate structural features of complex networks based on the non-parametric resampling of the transition matrix associated with an unbiased random walk on the graph. We test this bootstrapping technique on synthetic and real-world modular networks and we show that the ensemble of replicates obtained through resampling can be used to improve the performance of standard spectral algorithms for community detection.

  17. Exponential random graph models for networks with community structure.

    Science.gov (United States)

    Fronczak, Piotr; Fronczak, Agata; Bujok, Maksymilian

    2013-09-01

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

  18. Maps of random walks on complex networks reveal community structure.

    Science.gov (United States)

    Rosvall, Martin; Bergstrom, Carl T

    2008-01-29

    To comprehend the multipartite organization of large-scale biological and social systems, we introduce an information theoretic approach that reveals community structure in weighted and directed networks. We use the probability flow of random walks on a network as a proxy for information flows in the real system and decompose the network into modules by compressing a description of the probability flow. The result is a map that both simplifies and highlights the regularities in the structure and their relationships. We illustrate the method by making a map of scientific communication as captured in the citation patterns of >6,000 journals. We discover a multicentric organization with fields that vary dramatically in size and degree of integration into the network of science. Along the backbone of the network-including physics, chemistry, molecular biology, and medicine-information flows bidirectionally, but the map reveals a directional pattern of citation from the applied fields to the basic sciences.

  19. New Design of Crypto-Based Pseudo random number generator (CBPRNG) using BLOW FISH cipher

    OpenAIRE

    T.Chalama Reddy; Dr.R.Seshadri

    2013-01-01

    Random Number Generators (RNGs) are an important building block for algorithms and protocols in cryptography. Random number generation is used in a wide variety of cryptographic operations, such as key generation and challenge/response protocols. A random number generator outputs a sequence of 0s and 1s such that at any position, the next bit cannot be expected on the previous bits. However, true random number produces non- deterministic output since if the same random generator is run twice,...

  20. Random sampling of elementary flux modes in large-scale metabolic networks.

    Science.gov (United States)

    Machado, Daniel; Soons, Zita; Patil, Kiran Raosaheb; Ferreira, Eugénio C; Rocha, Isabel

    2012-09-15

    The description of a metabolic network in terms of elementary (flux) modes (EMs) provides an important framework for metabolic pathway analysis. However, their application to large networks has been hampered by the combinatorial explosion in the number of modes. In this work, we develop a method for generating random samples of EMs without computing the whole set. Our algorithm is an adaptation of the canonical basis approach, where we add an additional filtering step which, at each iteration, selects a random subset of the new combinations of modes. In order to obtain an unbiased sample, all candidates are assigned the same probability of getting selected. This approach avoids the exponential growth of the number of modes during computation, thus generating a random sample of the complete set of EMs within reasonable time. We generated samples of different sizes for a metabolic network of Escherichia coli, and observed that they preserve several properties of the full EM set. It is also shown that EM sampling can be used for rational strain design. A well distributed sample, that is representative of the complete set of EMs, should be suitable to most EM-based methods for analysis and optimization of metabolic networks. Source code for a cross-platform implementation in Python is freely available at http://code.google.com/p/emsampler. dmachado@deb.uminho.pt Supplementary data are available at Bioinformatics online.

  1. Modeling of regional warehouse network generation

    Directory of Open Access Journals (Sweden)

    Popov Pavel Vladimirovich

    2016-08-01

    Full Text Available One of the factors that has a significant impact on the socio-economic development of the Russian Federation’s regions is the logistics infrastructure. It provides integrated transportation and distribution service of material flows. One of the main elements of logistics infrastructure is a storage infrastructure, which includes distribution center, distribution-and-sortout and sortout warehouses. It is the most expedient to place distribution center in the vicinity of the regional center. One of the tasks of the distribution network creation within the regions of the Russian Federation is to determine the location, capacity and number of stores. When determining regional network location of general purpose warehouses methodological approaches to solving the problems of location of production and non-production can be used which depend on various economic factors. The mathematical models for solving relevant problems are the deployment models. However, the existing models focus on the dimensionless power storage. The purpose of the given work is to develop a model to determine the optimal location of general-purpose warehouses on the Russian Federation area. At the first stage of the work, the authors assess the main economic indicators influencing the choice of the location of general purpose warehouses. An algorithm for solving the first stage, based on ABC, discriminant and cluster analysis were proposed by the authors in earlier papers. At the second stage the specific locations of general purpose warehouses and their power is chosen to provide the cost minimization for the construction and subsequent maintenance of warehouses and transportation heterogeneous products. In order to solve this problem the authors developed a mathematical model that takes into account the possibility of delivery in heterogeneous goods from suppliers and manufacturers in the distribution and storage sorting with specified set of capacities. The model allows

  2. On Distributed Computation in Noisy Random Planar Networks

    OpenAIRE

    Kanoria, Y.; Manjunath, D.

    2007-01-01

    We consider distributed computation of functions of distributed data in random planar networks with noisy wireless links. We present a new algorithm for computation of the maximum value which is order optimal in the number of transmissions and computation time.We also adapt the histogram computation algorithm of Ying et al to make the histogram computation time optimal.

  3. Random Access with Physical-layer Network Coding

    NARCIS (Netherlands)

    Goseling, J.; Gastpar, M.C.; Weber, J.H.

    2013-01-01

    Leveraging recent progress in compute-and-forward we propose an approach to random access that is based on physical-layer network coding: When packets collide, it is possible to recover a linear combination of the packets at the receiver. Over many rounds of transmission, the receiver can thus

  4. Navigation by anomalous random walks on complex networks.

    Science.gov (United States)

    Weng, Tongfeng; Zhang, Jie; Khajehnejad, Moein; Small, Michael; Zheng, Rui; Hui, Pan

    2016-11-23

    Anomalous random walks having long-range jumps are a critical branch of dynamical processes on networks, which can model a number of search and transport processes. However, traditional measurements based on mean first passage time are not useful as they fail to characterize the cost associated with each jump. Here we introduce a new concept of mean first traverse distance (MFTD) to characterize anomalous random walks that represents the expected traverse distance taken by walkers searching from source node to target node, and we provide a procedure for calculating the MFTD between two nodes. We use Lévy walks on networks as an example, and demonstrate that the proposed approach can unravel the interplay between diffusion dynamics of Lévy walks and the underlying network structure. Moreover, applying our framework to the famous PageRank search, we show how to inform the optimality of the PageRank search. The framework for analyzing anomalous random walks on complex networks offers a useful new paradigm to understand the dynamics of anomalous diffusion processes, and provides a unified scheme to characterize search and transport processes on networks.

  5. Generating English Discourse from Semantic Networks.

    Science.gov (United States)

    Simmons, R. F.; Slocum, Jonathan

    The system described in this report is designed for use as a computational tool that allows a linguist to develop and study methods for generating surface strings from an underlying semantic structure. Initial findings with regard to form-determiners (such as voice, form, tense, and mood), some rules for embedding sentences, and some attention to…

  6. Computer simulation of randomly cross-linked polymer networks

    CERN Document Server

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

  7. Random Deep Belief Networks for Recognizing Emotions from Speech Signals.

    Science.gov (United States)

    Wen, Guihua; Li, Huihui; Huang, Jubing; Li, Danyang; Xun, Eryang

    2017-01-01

    Now the human emotions can be recognized from speech signals using machine learning methods; however, they are challenged by the lower recognition accuracies in real applications due to lack of the rich representation ability. Deep belief networks (DBN) can automatically discover the multiple levels of representations in speech signals. To make full of its advantages, this paper presents an ensemble of random deep belief networks (RDBN) method for speech emotion recognition. It firstly extracts the low level features of the input speech signal and then applies them to construct lots of random subspaces. Each random subspace is then provided for DBN to yield the higher level features as the input of the classifier to output an emotion label. All outputted emotion labels are then fused through the majority voting to decide the final emotion label for the input speech signal. The conducted experimental results on benchmark speech emotion databases show that RDBN has better accuracy than the compared methods for speech emotion recognition.

  8. PRIMITIVE MATRICES AND GENERATORS OF PSEUDO RANDOM SEQUENCES OF GALOIS

    Directory of Open Access Journals (Sweden)

    A. Beletsky

    2014-04-01

    Full Text Available In theory and practice of information cryptographic protection one of the key problems is the forming a binary pseudo-random sequences (PRS with a maximum length with acceptable statistical characteristics. PRS generators are usually implemented by linear shift register (LSR of maximum period with linear feedback [1]. In this paper we extend the concept of LSR, assuming that each of its rank (memory cell can be in one of the following condition. Let’s call such registers “generalized linear shift register.” The research goal is to develop algorithms for constructing Galois and Fibonacci generalized matrix of n-order over the field , which uniquely determined both the structure of corresponding generalized of n-order LSR maximal period, and formed on their basis Galois PRS generators of maximum length. Thus the article presents the questions of formation the primitive generalized Fibonacci and Galois arbitrary order matrix over the prime field . The synthesis of matrices is based on the use of irreducible polynomials of degree and primitive elements of the extended field generated by polynomial. The constructing methods of Galois and Fibonacci conjugated primitive matrices are suggested. The using possibilities of such matrices in solving the problem of constructing generalized generators of Galois pseudo-random sequences are discussed.

  9. At least some errors are randomly generated (Freud was wrong)

    Science.gov (United States)

    Sellen, A. J.; Senders, J. W.

    1986-01-01

    An experiment was carried out to expose something about human error generating mechanisms. In the context of the experiment, an error was made when a subject pressed the wrong key on a computer keyboard or pressed no key at all in the time allotted. These might be considered, respectively, errors of substitution and errors of omission. Each of seven subjects saw a sequence of three digital numbers, made an easily learned binary judgement about each, and was to press the appropriate one of two keys. Each session consisted of 1,000 presentations of randomly permuted, fixed numbers broken into 10 blocks of 100. One of two keys should have been pressed within one second of the onset of each stimulus. These data were subjected to statistical analyses in order to probe the nature of the error generating mechanisms. Goodness of fit tests for a Poisson distribution for the number of errors per 50 trial interval and for an exponential distribution of the length of the intervals between errors were carried out. There is evidence for an endogenous mechanism that may best be described as a random error generator. Furthermore, an item analysis of the number of errors produced per stimulus suggests the existence of a second mechanism operating on task driven factors producing exogenous errors. Some errors, at least, are the result of constant probability generating mechanisms with error rate idiosyncratically determined for each subject.

  10. Dynamics of comb-of-comb-network polymers in random layered flows.

    Science.gov (United States)

    Katyal, Divya; Kant, Rama

    2016-12-01

    We analyze the dynamics of comb-of-comb-network polymers in the presence of external random flows. The dynamics of such structures is evaluated through relevant physical quantities, viz., average square displacement (ASD) and the velocity autocorrelation function (VACF). We focus on comparing the dynamics of the comb-of-comb network with the linear polymer. The present work displays an anomalous diffusive behavior of this flexible network in the random layered flows. The effect of the polymer topology on the dynamics is analyzed by varying the number of generations and branch lengths in these networks. In addition, we investigate the influence of external flow on the dynamics by varying flow parameters, like the flow exponent α and flow strength W_{α}. Our analysis highlights two anomalous power-law regimes, viz., subdiffusive (intermediate-time polymer stretching and flow-induced diffusion) and superdiffusive (long-time flow-induced diffusion). The anomalous long-time dynamics is governed by the temporal exponent ν of ASD, viz., ν=2-α/2. Compared to a linear polymer, the comb-of-comb network shows a shorter crossover time (from the subdiffusive to superdiffusive regime) but a reduced magnitude of ASD. Our theory displays an anomalous VACF in the random layered flows that scales as t^{-α/2}. We show that the network with greater total mass moves faster.

  11. Finite plateau in spectral gap of polychromatic constrained random networks

    Science.gov (United States)

    Avetisov, V.; Gorsky, A.; Nechaev, S.; Valba, O.

    2017-12-01

    We consider critical behavior in the ensemble of polychromatic Erdős-Rényi networks and regular random graphs, where network vertices are painted in different colors. The links can be randomly removed and added to the network subject to the condition of the vertex degree conservation. In these constrained graphs we run the Metropolis procedure, which favors the connected unicolor triads of nodes. Changing the chemical potential, μ , of such triads, for some wide region of μ , we find the formation of a finite plateau in the number of intercolor links, which exactly matches the finite plateau in the network algebraic connectivity (the value of the first nonvanishing eigenvalue of the Laplacian matrix, λ2). We claim that at the plateau the spontaneously broken Z2 symmetry is restored by the mechanism of modes collectivization in clusters of different colors. The phenomena of a finite plateau formation holds also for polychromatic networks with M ≥2 colors. The behavior of polychromatic networks is analyzed via the spectral properties of their adjacency and Laplacian matrices.

  12. WDCC Metadata Generation with GeoNetwork

    Science.gov (United States)

    Ramthun, Hans; Lautenschlager, Michael; Winter, Hans-Hermann

    2010-05-01

    Earth system science data like modeling output data are described by metadata. At the WDCC (World Data Center of Climate) the data and metadata are stored inside the CERA (Climate and Environmental Retrieval and Archive) relational database. To fill in the describing metadata several types of XML documents are used to upload data into the database. GeoNetwork is an Ajax based web framework, which offers a wide range of XML data handling for search and update and is especially designed to meet the ISO19115/19139 standard. This framework was extended by the schema's which allow create and update CERA upload XML records. An upload function is also included as well as a connection to the local LDAP (Lightweight Directory Access Protocol) for authentication. Keywords: metadata, WDCC, CERA, Ajax

  13. Generating Correlated QPSK Waveforms By Exploiting Real Gaussian Random Variables

    KAUST Repository

    Jardak, Seifallah

    2012-11-01

    The design of waveforms with specified auto- and cross-correlation properties has a number of applications in multiple-input multiple-output (MIMO) radar, one of them is the desired transmit beampattern design. In this work, an algorithm is proposed to generate quadrature phase shift- keying (QPSK) waveforms with required cross-correlation properties using real Gaussian random-variables (RV’s). This work can be considered as the extension of what was presented in [1] to generate BPSK waveforms. This work will be extended for the generation of correlated higher-order phase shift-keying (PSK) and quadrature amplitude modulation (QAM) schemes that can better approximate the desired beampattern.

  14. Transmission Network Expansion Planning Considering Desired Generation Security

    Directory of Open Access Journals (Sweden)

    Samaneh GOLESTANI

    2014-02-01

    Full Text Available Transmission Network Expansion Planning (TNEP is an important part of power system planning in both conventional and new structured power market. Its goal is to minimize the network construction and operational cost while satisfying the demand increase, considering technical and economic conditions. Planning algorithm in this paper consisted of two stages. The former specifies highly uncertain lines and probability of congestion, considering desired generation security level (e.g. N-2 generation security level. The latter determines the optimal expansion capacity of existing lines. Splitting required capacity for reinforcement of weak lines due to desired generation security level simplifies the TNEP problem. In addition, it monitors the impact of generation uncertainty on transmission lines. Simulation results of the proposed idea are presented for IEEE-RTS-24bus network.

  15. Wave speed in excitable random networks with spatially constrained connections.

    Directory of Open Access Journals (Sweden)

    Nikita Vladimirov

    Full Text Available Very fast oscillations (VFO in neocortex are widely observed before epileptic seizures, and there is growing evidence that they are caused by networks of pyramidal neurons connected by gap junctions between their axons. We are motivated by the spatio-temporal waves of activity recorded using electrocorticography (ECoG, and study the speed of activity propagation through a network of neurons axonally coupled by gap junctions. We simulate wave propagation by excitable cellular automata (CA on random (Erdös-Rényi networks of special type, with spatially constrained connections. From the cellular automaton model, we derive a mean field theory to predict wave propagation. The governing equation resolved by the Fisher-Kolmogorov PDE fails to describe wave speed. A new (hyperbolic PDE is suggested, which provides adequate wave speed v( that saturates with network degree , in agreement with intuitive expectations and CA simulations. We further show that the maximum length of connection is a much better predictor of the wave speed than the mean length. When tested in networks with various degree distributions, wave speeds are found to strongly depend on the ratio of network moments / rather than on mean degree , which is explained by general network theory. The wave speeds are strikingly similar in a diverse set of networks, including regular, Poisson, exponential and power law distributions, supporting our theory for various network topologies. Our results suggest practical predictions for networks of electrically coupled neurons, and our mean field method can be readily applied for a wide class of similar problems, such as spread of epidemics through spatial networks.

  16. Patch layout generation by detecting feature networks

    KAUST Repository

    Cao, Yuanhao

    2015-02-01

    The patch layout of 3D surfaces reveals the high-level geometric and topological structures. In this paper, we study the patch layout computation by detecting and enclosing feature loops on surfaces. We present a hybrid framework which combines several key ingredients, including feature detection, feature filtering, feature curve extension, patch subdivision and boundary smoothing. Our framework is able to compute patch layouts through concave features as previous approaches, but also able to generate nice layouts through smoothing regions. We demonstrate the effectiveness of our framework by comparing with the state-of-the-art methods.

  17. Application of Artificial Neural Networks for Predicting Generated Wind Power

    OpenAIRE

    Vijendra Singh

    2016-01-01

    This paper addresses design and development of an artificial neural network based system for prediction of wind energy produced by wind turbines. Now in the last decade, renewable energy emerged as an additional alternative source for electrical power generation. We need to assess wind power generation capacity by wind turbines because of its non-exhaustible nature. The power generation by electric wind turbines depends on the speed of wind, flow direction, fluctuations, density of air, gener...

  18. Cellular Automata-Based Parallel Random Number Generators Using FPGAs

    Directory of Open Access Journals (Sweden)

    David H. K. Hoe

    2012-01-01

    Full Text Available Cellular computing represents a new paradigm for implementing high-speed massively parallel machines. Cellular automata (CA, which consist of an array of locally connected processing elements, are a basic form of a cellular-based architecture. The use of field programmable gate arrays (FPGAs for implementing CA accelerators has shown promising results. This paper investigates the design of CA-based pseudo-random number generators (PRNGs using an FPGA platform. To improve the quality of the random numbers that are generated, the basic CA structure is enhanced in two ways. First, the addition of a superrule to each CA cell is considered. The resulting self-programmable CA (SPCA uses the superrule to determine when to make a dynamic rule change in each CA cell. The superrule takes its inputs from neighboring cells and can be considered itself a second CA working in parallel with the main CA. When implemented on an FPGA, the use of lookup tables in each logic cell removes any restrictions on how the super-rules should be defined. Second, a hybrid configuration is formed by combining a CA with a linear feedback shift register (LFSR. This is advantageous for FPGA designs due to the compactness of the LFSR implementations. A standard software package for statistically evaluating the quality of random number sequences known as Diehard is used to validate the results. Both the SPCA and the hybrid CA/LFSR were found to pass all the Diehard tests.

  19. Automatic generation of investigator bibliographies for institutional research networking systems.

    Science.gov (United States)

    Johnson, Stephen B; Bales, Michael E; Dine, Daniel; Bakken, Suzanne; Albert, Paul J; Weng, Chunhua

    2014-10-01

    Publications are a key data source for investigator profiles and research networking systems. We developed ReCiter, an algorithm that automatically extracts bibliographies from PubMed using institutional information about the target investigators. ReCiter executes a broad query against PubMed, groups the results into clusters that appear to constitute distinct author identities and selects the cluster that best matches the target investigator. Using information about investigators from one of our institutions, we compared ReCiter results to queries based on author name and institution and to citations extracted manually from the Scopus database. Five judges created a gold standard using citations of a random sample of 200 investigators. About half of the 10,471 potential investigators had no matching citations in PubMed, and about 45% had fewer than 70 citations. Interrater agreement (Fleiss' kappa) for the gold standard was 0.81. Scopus achieved the best recall (sensitivity) of 0.81, while name-based queries had 0.78 and ReCiter had 0.69. ReCiter attained the best precision (positive predictive value) of 0.93 while Scopus had 0.85 and name-based queries had 0.31. ReCiter accesses the most current citation data, uses limited computational resources and minimizes manual entry by investigators. Generation of bibliographies using named-based queries will not yield high accuracy. Proprietary databases can perform well but requite manual effort. Automated generation with higher recall is possible but requires additional knowledge about investigators. Copyright © 2014 Elsevier Inc. All rights reserved.

  20. Navigation by anomalous random walks on complex networks

    CERN Document Server

    Weng, Tongfeng; Khajehnejad, Moein; Small, Michael; Zheng, Rui; Hui, Pan

    2016-01-01

    Anomalous random walks having long-range jumps are a critical branch of dynamical processes on networks, which can model a number of search and transport processes. However, traditional measurements based on mean first passage time are not useful as they fail to characterize the cost associated with each jump. Here we introduce a new concept of mean first traverse distance (MFTD) to characterize anomalous random walks that represents the expected traverse distance taken by walkers searching from source node to target node, and we provide a procedure for calculating the MFTD between two nodes. We use Levy walks on networks as an example, and demonstrate that the proposed approach can unravel the interplay between diffusion dynamics of Levy walks and the underlying network structure. Interestingly, applying our framework to the famous PageRank search, we can explain why its damping factor empirically chosen to be around 0.85. The framework for analyzing anomalous random walks on complex networks offers a new us...

  1. Visual Tracking With Convolutional Random Vector Functional Link Network.

    Science.gov (United States)

    Zhang, Le; Suganthan, Ponnuthurai Nagaratnam

    2017-10-01

    Deep neural network-based methods have recently achieved excellent performance in visual tracking task. As very few training samples are available in visual tracking task, those approaches rely heavily on extremely large auxiliary dataset such as ImageNet to pretrain the model. In order to address the discrepancy between the source domain (the auxiliary data) and the target domain (the object being tracked), they need to be finetuned during the tracking process. However, those methods suffer from sensitivity to the hyper-parameters such as learning rate, maximum number of epochs, size of mini-batch, and so on. Thus, it is worthy to investigate whether pretraining and fine tuning through conventional back-prop is essential for visual tracking. In this paper, we shed light on this line of research by proposing convolutional random vector functional link (CRVFL) neural network, which can be regarded as a marriage of the convolutional neural network and random vector functional link network, to simplify the visual tracking system. The parameters in the convolutional layer are randomly initialized and kept fixed. Only the parameters in the fully connected layer need to be learned. We further propose an elegant approach to update the tracker. In the widely used visual tracking benchmark, without any auxiliary data, a single CRVFL model achieves 79.0% with a threshold of 20 pixels for the precision plot. Moreover, an ensemble of CRVFL yields comparatively the best result of 86.3%.

  2. Optimum allocation of the maximum possible distributed generation penetration in a distribution network

    Energy Technology Data Exchange (ETDEWEB)

    Koutroumpezis, G.N.; Safigianni, A.S. [Electrical and Computer Engineering Department, Democritus University of Thrace, University Campus (Kimmeria), GR 67100 Xanthi (Greece)

    2010-12-15

    In this paper a method is proposed to determine the optimum allocation of the maximum distributed generation penetration in medium voltage power distribution networks. The method is based on an already-known but suitably modified and optimized method. Technical constraints, such as thermal rating, transformer capacity, voltage profile and short-circuit level are considered. A real network with already installed distributed generation resources is examined as a case study. The type, locations and ratings of these resources are predetermined. The satisfaction of the aforementioned technical constraints is examined initially in the framework of the existing network situation. The problems observed are solved by applying the required modifications in the network structure. Next, the proposed method is used to determine the optimum allocation of the maximum distributed generation penetration either in the predetermined network buses or in other random buses, in order to overcome the technical problems, without changing the network structure. Finally, the results are suitably estimated and extended in order to allow for more general conclusions concerning real power distribution networks. (author)

  3. Thermalnet: a Deep Convolutional Network for Synthetic Thermal Image Generation

    Science.gov (United States)

    Kniaz, V. V.; Gorbatsevich, V. S.; Mizginov, V. A.

    2017-05-01

    Deep convolutional neural networks have dramatically changed the landscape of the modern computer vision. Nowadays methods based on deep neural networks show the best performance among image recognition and object detection algorithms. While polishing of network architectures received a lot of scholar attention, from the practical point of view the preparation of a large image dataset for a successful training of a neural network became one of major challenges. This challenge is particularly profound for image recognition in wavelengths lying outside the visible spectrum. For example no infrared or radar image datasets large enough for successful training of a deep neural network are available to date in public domain. Recent advances of deep neural networks prove that they are also capable to do arbitrary image transformations such as super-resolution image generation, grayscale image colorisation and imitation of style of a given artist. Thus a natural question arise: how could be deep neural networks used for augmentation of existing large image datasets? This paper is focused on the development of the Thermalnet deep convolutional neural network for augmentation of existing large visible image datasets with synthetic thermal images. The Thermalnet network architecture is inspired by colorisation deep neural networks.

  4. Deep Convolutional Generative Adversarial Network for Procedural 3D Landscape Generation Based on DEM

    DEFF Research Database (Denmark)

    Wulff-Jensen, Andreas; Rant, Niclas Nerup; Møller, Tobias Nordvig

    2017-01-01

    This paper proposes a novel framework for improving procedural generation of 3D landscapes using machine learning. We utilized a Deep Convolutional Generative Adversarial Network (DC-GAN) to generate heightmaps. The network was trained on a dataset consisting of Digital Elevation Maps (DEM......) of the alps. During map generation, the batch size and learning rate were optimized for the most efficient and satisfying map production. The diversity of the final output was tested against Perlin noise using Mean Square Error [1] and Structure Similarity Index [2]. Perlin noise is especially interesting...

  5. A Markov model for the temporal dynamics of balanced random networks of finite size

    Science.gov (United States)

    Lagzi, Fereshteh; Rotter, Stefan

    2014-01-01

    The balanced state of recurrent networks of excitatory and inhibitory spiking neurons is characterized by fluctuations of population activity about an attractive fixed point. Numerical simulations show that these dynamics are essentially nonlinear, and the intrinsic noise (self-generated fluctuations) in networks of finite size is state-dependent. Therefore, stochastic differential equations with additive noise of fixed amplitude cannot provide an adequate description of the stochastic dynamics. The noise model should, rather, result from a self-consistent description of the network dynamics. Here, we consider a two-state Markovian neuron model, where spikes correspond to transitions from the active state to the refractory state. Excitatory and inhibitory input to this neuron affects the transition rates between the two states. The corresponding nonlinear dependencies can be identified directly from numerical simulations of networks of leaky integrate-and-fire neurons, discretized at a time resolution in the sub-millisecond range. Deterministic mean-field equations, and a noise component that depends on the dynamic state of the network, are obtained from this model. The resulting stochastic model reflects the behavior observed in numerical simulations quite well, irrespective of the size of the network. In particular, a strong temporal correlation between the two populations, a hallmark of the balanced state in random recurrent networks, are well represented by our model. Numerical simulations of such networks show that a log-normal distribution of short-term spike counts is a property of balanced random networks with fixed in-degree that has not been considered before, and our model shares this statistical property. Furthermore, the reconstruction of the flow from simulated time series suggests that the mean-field dynamics of finite-size networks are essentially of Wilson-Cowan type. We expect that this novel nonlinear stochastic model of the interaction between

  6. Random Sequence for Optimal Low-Power Laser Generated Ultrasound

    Science.gov (United States)

    Vangi, D.; Virga, A.; Gulino, M. S.

    2017-08-01

    Low-power laser generated ultrasounds are lately gaining importance in the research world, thanks to the possibility of investigating a mechanical component structural integrity through a non-contact and Non-Destructive Testing (NDT) procedure. The ultrasounds are, however, very low in amplitude, making it necessary to use pre-processing and post-processing operations on the signals to detect them. The cross-correlation technique is used in this work, meaning that a random signal must be used as laser input. For this purpose, a highly random and simple-to-create code called T sequence, capable of enhancing the ultrasound detectability, is introduced (not previously available at the state of the art). Several important parameters which characterize the T sequence can influence the process: the number of pulses Npulses , the pulse duration δ and the distance between pulses dpulses . A Finite Element FE model of a 3 mm steel disk has been initially developed to analytically study the longitudinal ultrasound generation mechanism and the obtainable outputs. Later, experimental tests have shown that the T sequence is highly flexible for ultrasound detection purposes, making it optimal to use high Npulses and δ but low dpulses . In the end, apart from describing all phenomena that arise in the low-power laser generation process, the results of this study are also important for setting up an effective NDT procedure using this technology.

  7. Random phase-free computer-generated hologram

    CERN Document Server

    Shimobaba, Tomoyoshi

    2015-01-01

    Addition of random phase to the object light is required in computer-generated holograms (CGHs) to widely diffuse the object light and to avoid its concentration on the CGH; however, this addition causes considerable speckle noise in the reconstructed image. For improving the speckle noise problem, techniques such as iterative phase retrieval algorithms and multi-random phase method are used; however, they are time consuming and are of limited effectiveness. Herein, we present a simple and computationally inexpensive method that drastically improves the image quality and reduces the speckle noise by multiplying the object light with the virtual convergence light. Feasibility of the proposed method is shown using simulations and optical reconstructions; moreover, we apply it to lens-less zoom-able holographic projection. The proposed method is useful for the speckle problems in holographic applications.

  8. Soliton generation from randomly modulated return-to-zero pulses

    Science.gov (United States)

    Derevyanko, Stanislav A.; Prilepsky, Jaroslaw E.

    2008-11-01

    We consider return-to-zero (RZ) pulses with random phase modulation propagating in a nonlinear channel (modelled by the integrable nonlinear Schrödinger equation, NLSE). We suggest two different models for the phase fluctuations of the optical field: (i) Gaussian short-correlated fluctuations and (ii) generalized telegraph process. Using the rectangular-shaped pulse form we demonstrate that the presence of phase fluctuations of both types strongly influences the number of solitons generated in the channel. It is also shown that increasing the correlation time for the random phase fluctuations affects the coherent content of a pulse in a non-trivial way. The result obtained has potential consequences for all-optical processing and design of optical decision elements.

  9. Generation of correlated finite alphabet waveforms using gaussian random variables

    KAUST Repository

    Ahmed, Sajid

    2016-01-13

    Various examples of methods and systems are provided for generation of correlated finite alphabet waveforms using Gaussian random variables in, e.g., radar and communication applications. In one example, a method includes mapping an input signal comprising Gaussian random variables (RVs) onto finite-alphabet non-constant-envelope (FANCE) symbols using a predetermined mapping function, and transmitting FANCE waveforms through a uniform linear array of antenna elements to obtain a corresponding beampattern. The FANCE waveforms can be based upon the mapping of the Gaussian RVs onto the FANCE symbols. In another example, a system includes a memory unit that can store a plurality of digital bit streams corresponding to FANCE symbols and a front end unit that can transmit FANCE waveforms through a uniform linear array of antenna elements to obtain a corresponding beampattern. The system can include a processing unit that can encode the input signal and/or determine the mapping function.

  10. Learning Orthographic Structure With Sequential Generative Neural Networks.

    Science.gov (United States)

    Testolin, Alberto; Stoianov, Ivilin; Sperduti, Alessandro; Zorzi, Marco

    2016-04-01

    Learning the structure of event sequences is a ubiquitous problem in cognition and particularly in language. One possible solution is to learn a probabilistic generative model of sequences that allows making predictions about upcoming events. Though appealing from a neurobiological standpoint, this approach is typically not pursued in connectionist modeling. Here, we investigated a sequential version of the restricted Boltzmann machine (RBM), a stochastic recurrent neural network that extracts high-order structure from sensory data through unsupervised generative learning and can encode contextual information in the form of internal, distributed representations. We assessed whether this type of network can extract the orthographic structure of English monosyllables by learning a generative model of the letter sequences forming a word training corpus. We show that the network learned an accurate probabilistic model of English graphotactics, which can be used to make predictions about the letter following a given context as well as to autonomously generate high-quality pseudowords. The model was compared to an extended version of simple recurrent networks, augmented with a stochastic process that allows autonomous generation of sequences, and to non-connectionist probabilistic models (n-grams and hidden Markov models). We conclude that sequential RBMs and stochastic simple recurrent networks are promising candidates for modeling cognition in the temporal domain. Copyright © 2015 Cognitive Science Society, Inc.

  11. Delineating social network data anonymization via random edge perturbation

    KAUST Repository

    Xue, Mingqiang

    2012-01-01

    Social network data analysis raises concerns about the privacy of related entities or individuals. To address this issue, organizations can publish data after simply replacing the identities of individuals with pseudonyms, leaving the overall structure of the social network unchanged. However, it has been shown that attacks based on structural identification (e.g., a walk-based attack) enable an adversary to re-identify selected individuals in an anonymized network. In this paper we explore the capacity of techniques based on random edge perturbation to thwart such attacks. We theoretically establish that any kind of structural identification attack can effectively be prevented using random edge perturbation and show that, surprisingly, important properties of the whole network, as well as of subgraphs thereof, can be accurately calculated and hence data analysis tasks performed on the perturbed data, given that the legitimate data recipient knows the perturbation probability as well. Yet we also examine ways to enhance the walk-based attack, proposing a variant we call probabilistic attack. Nevertheless, we demonstrate that such probabilistic attacks can also be prevented under sufficient perturbation. Eventually, we conduct a thorough theoretical study of the probability of success of any}structural attack as a function of the perturbation probability. Our analysis provides a powerful tool for delineating the identification risk of perturbed social network data; our extensive experiments with synthetic and real datasets confirm our expectations. © 2012 ACM.

  12. Probing the Extent of Randomness in Protein Interaction Networks

    Science.gov (United States)

    2008-07-11

    scale-free networks are born equal: the role of the seed graph in PPI network evolution. PLoS Comput Biol 3: e118. doi:10.1371/journal.pcbi.0030118. 57...from seeds [56]. In the degree-conserving degree-weighted (DCDW) model, each node is considered once, in a random order, and a set number of edges are...gene duplication in fungi . Nature 449: 54–61. 63. Fraser HB, Hirsh AE, Steinmetz LM, Scharfe C, Feldman MW (2002) Evolutionary rate in the protein

  13. A Random Dot Product Model for Weighted Networks

    CERN Document Server

    DeFord, Daryl R

    2016-01-01

    This paper presents a generalization of the random dot product model for networks whose edge weights are drawn from a parametrized probability distribution. We focus on the case of integer weight edges and show that many previously studied models can be recovered as special cases of this generalization. Our model also determines a dimension--reducing embedding process that gives geometric interpretations of community structure and centrality. The dimension of the embedding has consequences for the derived community structure and we exhibit a stress function for determining appropriate dimensions. We use this approach to analyze a coauthorship network and voting data from the U.S. Senate.

  14. Comparison of a quantum random number generator with pseudorandom number generators for their use in molecular Monte Carlo simulations.

    Science.gov (United States)

    Ghersi, Dario; Parakh, Abhishek; Mezei, Mihaly

    2017-12-05

    Four pseudorandom number generators were compared with a physical, quantum-based random number generator using the NIST suite of statistical tests, which only the quantum-based random number generator could successfully pass. We then measured the effect of the five random number generators on various calculated properties in different Markov-chain Monte Carlo simulations. Two types of systems were tested: conformational sampling of a small molecule in aqueous solution and liquid methanol under constant temperature and pressure. The results show that poor quality pseudorandom number generators produce results that deviate significantly from those obtained with the quantum-based random number generator, particularly in the case of the small molecule in aqueous solution setup. In contrast, the widely used Mersenne Twister pseudorandom generator and a 64-bit Linear Congruential Generator with a scrambler produce results that are statistically indistinguishable from those obtained with the quantum-based random number generator. © 2017 Wiley Periodicals, Inc. © 2017 Wiley Periodicals, Inc.

  15. Quantum Statistical Testing of a Quantum Random Number Generator

    Energy Technology Data Exchange (ETDEWEB)

    Humble, Travis S [ORNL

    2014-01-01

    The unobservable elements in a quantum technology, e.g., the quantum state, complicate system verification against promised behavior. Using model-based system engineering, we present methods for verifying the opera- tion of a prototypical quantum random number generator. We begin with the algorithmic design of the QRNG followed by the synthesis of its physical design requirements. We next discuss how quantum statistical testing can be used to verify device behavior as well as detect device bias. We conclude by highlighting how system design and verification methods must influence effort to certify future quantum technologies.

  16. An Intelligent Handover Management System for Future Generation Wireless Networks

    OpenAIRE

    Kassar Meriem; Kervella Brigitte; Pujolle Guy

    2008-01-01

    Abstract Future generation wireless networks should provide to mobile users the best connectivity to services anywhere at anytime. The most challenging problem is the seamless intersystem/vertical mobility across heterogeneous wireless networks. In order to answer it, a vertical handover management system is needed. In our paper, we propose an intelligent solution answering user requirements and ensuring service continuity. We focus on a vertical handover decision strategy based on the contex...

  17. Flexible Transmission Network Planning Considering the Impacts of Distributed Generation

    OpenAIRE

    Junhua Zhao; John Foster

    2010-01-01

    The restructuring of global power industries has introduced a number of challenges, such as conflicting planning objectives and increasing uncertainties,to transmission network planners. During the recent past, a number of distributed generation technologies also reached a stage allowing large scale implementation, which will profoundly influence the power industry, as well as the practice of transmission network expansion. In the new market environment, new approaches are needed to meet the ...

  18. Pseudo-random dynamic address configuration (PRDAC) algorithm for mobile ad hoc networks

    Science.gov (United States)

    Wu, Shaochuan; Tan, Xuezhi

    2007-11-01

    By analyzing all kinds of address configuration algorithms, this paper provides a new pseudo-random dynamic address configuration (PRDAC) algorithm for mobile ad hoc networks. Based on PRDAC, the first node that initials this network randomly chooses a nonlinear shift register that can generates an m-sequence. When another node joins this network, the initial node will act as an IP address configuration sever to compute an IP address according to this nonlinear shift register, and then allocates this address and tell the generator polynomial of this shift register to this new node. By this means, when other node joins this network, any node that has obtained an IP address can act as a server to allocate address to this new node. PRDAC can also efficiently avoid IP conflicts and deal with network partition and merge as same as prophet address (PA) allocation and dynamic configuration and distribution protocol (DCDP). Furthermore, PRDAC has less algorithm complexity, less computational complexity and more sufficient assumption than PA. In addition, PRDAC radically avoids address conflicts and maximizes the utilization rate of IP addresses. Analysis and simulation results show that PRDAC has rapid convergence, low overhead and immune from topological structures.

  19. Certainty Power Flow Calculation for Distribution Network with Distributed Generation

    Directory of Open Access Journals (Sweden)

    FU Min

    2017-06-01

    Full Text Available System nodes need to be renumbered manually when upgrading and reforming distribution network makes network topology change. Because optimization method is inapplicable to the network change,an improved forward and backward sweep algorithm is proposed which is unrelated to node label. In this paper,node type of sorts of distributed generation ( DG in power flow calculation are induced and part of new node type of DG under improved control strategy are provided. The basis of DG as active constant node in certainty power flow calculation is analyzed. Based on improved back - forward sweep algorithm,general programs of power flow calculation in power distribution network of DG are programmed by MATLAB and the impact of DG on flow calculation to distribution network is analyzed quantitatively by plenty of simulation calculation of IEEE33 test system.

  20. Neural network approaches to dynamic collision-free trajectory generation.

    Science.gov (United States)

    Yang, S X; Meng, M

    2001-01-01

    In this paper, dynamic collision-free trajectory generation in a nonstationary environment is studied using biologically inspired neural network approaches. The proposed neural network is topologically organized, where the dynamics of each neuron is characterized by a shunting equation or an additive equation. The state space of the neural network can be either the Cartesian workspace or the joint space of multi-joint robot manipulators. There are only local lateral connections among neurons. The real-time optimal trajectory is generated through the dynamic activity landscape of the neural network without explicitly searching over the free space nor the collision paths, without explicitly optimizing any global cost functions, without any prior knowledge of the dynamic environment, and without any learning procedures. Therefore the model algorithm is computationally efficient. The stability of the neural network system is guaranteed by the existence of a Lyapunov function candidate. In addition, this model is not very sensitive to the model parameters. Several model variations are presented and the differences are discussed. As examples, the proposed models are applied to generate collision-free trajectories for a mobile robot to solve a maze-type of problem, to avoid concave U-shaped obstacles, to track a moving target and at the same to avoid varying obstacles, and to generate a trajectory for a two-link planar robot with two targets. The effectiveness and efficiency of the proposed approaches are demonstrated through simulation and comparison studies.

  1. Design and implementation of a random neural network routing engine.

    Science.gov (United States)

    Kocak, T; Seeber, J; Terzioglu, H

    2003-01-01

    Random neural network (RNN) is an analytically tractable spiked neural network model that has been implemented in software for a wide range of applications for over a decade. This paper presents the hardware implementation of the RNN model. Recently, cognitive packet networks (CPN) is proposed as an alternative packet network architecture where there is no routing table, instead the RNN based reinforcement learning is used to route packets. Particularly, we describe implementation details for the RNN based routing engine of a CPN network processor chip: the smart packet processor (SPP). The SPP is a dual port device that stores, modifies, and interprets the defining characteristics of multiple RNN models. In addition to hardware design improvements over the software implementation such as the dual access memory, output calculation step, and reduced output calculation module, this paper introduces a major modification to the reinforcement learning algorithm used in the original CPN specification such that the number of weight terms are reduced from 2n/sup 2/ to 2n. This not only yields significant memory savings, but it also simplifies the calculations for the steady state probabilities (neuron outputs in RNN). Simulations have been conducted to confirm the proper functionality for the isolated SPP design as well as for the multiple SPP's in a networked environment.

  2. Randomly evolving idiotypic networks: modular mean field theory.

    Science.gov (United States)

    Schmidtchen, Holger; Behn, Ulrich

    2012-07-01

    We develop a modular mean field theory for a minimalistic model of the idiotypic network. The model comprises the random influx of new idiotypes and a deterministic selection. It describes the evolution of the idiotypic network towards complex modular architectures, the building principles of which are known. The nodes of the network can be classified into groups of nodes, the modules, which share statistical properties. Each node experiences only the mean influence of the groups to which it is linked. Given the size of the groups and linking between them the statistical properties such as mean occupation, mean lifetime, and mean number of occupied neighbors are calculated for a variety of patterns and compared with simulations. For a pattern which consists of pairs of occupied nodes correlations are taken into account.

  3. Peer-Assisted Content Distribution with Random Linear Network Coding

    DEFF Research Database (Denmark)

    Hundebøll, Martin; Ledet-Pedersen, Jeppe; Sluyterman, Georg

    2014-01-01

    Peer-to-peer networks constitute a widely used, cost-effective and scalable technology to distribute bandwidth-intensive content. The technology forms a great platform to build distributed cloud storage without the need of a central provider. However, the majority of todays peer-to-peer systems...... require complex algorithms to schedule what parts of obtained content to forward to other peers. Random Linear Network Coding can greatly simplify these algorithm by removing the need for coordination between the distributing nodes. In this paper we propose and evaluate the structure of the BRONCO peer-to-peer....... Furthermore, we evaluate the performance of different parameters and suggest a suitable trade-off between CPU utilization and network overhead. Within the limitations of the used test environment, we have shown that networkc coding is usable in peer-assisted content distribution and we suggest further...

  4. Coevolution of quantum and classical strategies on evolving random networks.

    Directory of Open Access Journals (Sweden)

    Qiang Li

    Full Text Available We study the coevolution of quantum and classical strategies on weighted and directed random networks in the realm of the prisoner's dilemma game. During the evolution, agents can break and rewire their links with the aim of maximizing payoffs, and they can also adjust the weights to indicate preferences, either positive or negative, towards their neighbors. The network structure itself is thus also subject to evolution. Importantly, the directionality of links does not affect the accumulation of payoffs nor the strategy transfers, but serves only to designate the owner of each particular link and with it the right to adjust the link as needed. We show that quantum strategies outperform classical strategies, and that the critical temptation to defect at which cooperative behavior can be maintained rises, if the network structure is updated frequently. Punishing neighbors by reducing the weights of their links also plays an important role in maintaining cooperation under adverse conditions. We find that the self-organization of the initially random network structure, driven by the evolutionary competition between quantum and classical strategies, leads to the spontaneous emergence of small average path length and a large clustering coefficient.

  5. Fully Digital Chaotic Oscillators Applied to Pseudo Random Number Generation

    KAUST Repository

    Mansingka, Abhinav S.

    2012-05-01

    adapted for pseudo random number generation by truncating statistically defective bits. Finally, a novel post-processing technique using the Fibonacci series is proposed and implemented with a non-autonomous driven hyperchaotic system to provide pseudo random number generators with high nonlinear complexity and controllable period length that enables full utilization of all branches of the chaotic output as statistically secure pseudo random output.

  6. Numerical simulation of fibrous biomaterials with randomly distributed fiber network structure.

    Science.gov (United States)

    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.

  7. Application of Generative Adversarial Networks (GANs) to jet images

    CERN Multimedia

    CERN. Geneva

    2017-01-01

    https://arxiv.org/abs/1701.05927 We provide a bridge between generative modeling in the Machine Learning community and simulated physical processes in High Energy Particle Physics by applying a novel Generative Adversarial Network (GAN) architecture to the production of jet images -- 2D representations of energy depositions from particles interacting with a calorimeter. We propose a simple architecture, the Location-Aware Generative Adversarial Network, that learns to produce realistic radiation patterns from simulated high energy particle collisions. The pixel intensities of GAN-generated images faithfully span over many orders of magnitude and exhibit the desired low-dimensional physical properties (i.e., jet mass, n-subjettiness, etc.). We shed light on limitations, and provide a novel empirical validation of image quality and validity of GAN-produced simulations of the natural world. This work provides a base for further explorations of GANs for use in faster simulation in High Energy Particle Physics.

  8. Embedded generation connection incentives for distribution network operators

    Energy Technology Data Exchange (ETDEWEB)

    Williams, P.; Andrews, S.

    2002-07-01

    This is the final report with respect to work commissioned by the Department of Trade and Industry (DTI) as part of the New and Renewable Energy Programme into incentives for distribution network operators (DNOs) for the connection of embedded generation. This report, which incorporates the contents of the interim report submitted in February 2002, considers the implications of changes in the structure and regulation in the UK electricity industry on the successful technical and commercial integrated of embedded generation into distribution networks. The report examines: the obligations of public electricity suppliers (PESs); current DNO practices regarding the connection of embedded generation; the changes introduced by the Utilities Act 2000, including the impact of new obligations placed on DNOs on the connection of embedded generation and the requirements of the new Electricity Distribution Standard Licence conditions; and problems and prospects for DNO incentives.

  9. Passive random walkers and riverlike networks on growing surfaces.

    Science.gov (United States)

    Chin, Chen-Shan

    2002-08-01

    Passive random walker dynamics is introduced on a growing surface. The walker is designed to drift upward or downward and then follow specific topological features, such as hill tops or valley bottoms, of the fluctuating surface. The passive random walker can thus be used to directly explore scaling properties of otherwise somewhat hidden topological features. For example, the walker allows us to directly measure the dynamical exponent of the underlying growth dynamics. We use the Kardar-Parisi-Zhang (KPZ) -type surface growth as an example. The world lines of a set of merging passive walkers show nontrivial coalescence behaviors and display the riverlike network structures of surface ridges in space-time. In other dynamics, such as Edwards-Wilkinson growth, this does not happen. The passive random walkers in KPZ-type surface growth are closely related to the shock waves in the noiseless Burgers equation. We also briefly discuss their relations to the passive scalar dynamics in turbulence.

  10. High-Quality Random Number Generation Software for High-Performance Computing Project

    Data.gov (United States)

    National Aeronautics and Space Administration — Random number (RN) generation is the key software component that permits random sampling. Software for parallel RN generation (RNG) should be based on RNGs that are...

  11. Complex network structure of musical compositions: Algorithmic generation of appealing music

    Science.gov (United States)

    Liu, Xiao Fan; Tse, Chi K.; Small, Michael

    2010-01-01

    In this paper we construct networks for music and attempt to compose music artificially. Networks are constructed with nodes and edges corresponding to musical notes and their co-occurring connections. We analyze classical music from Bach, Mozart, Chopin, as well as other types of music such as Chinese pop music. We observe remarkably similar properties in all networks constructed from the selected compositions. We conjecture that preserving the universal network properties is a necessary step in artificial composition of music. Power-law exponents of node degree, node strength and/or edge weight distributions, mean degrees, clustering coefficients, mean geodesic distances, etc. are reported. With the network constructed, music can be composed artificially using a controlled random walk algorithm, which begins with a randomly chosen note and selects the subsequent notes according to a simple set of rules that compares the weights of the edges, weights of the nodes, and/or the degrees of nodes. By generating a large number of compositions, we find that this algorithm generates music which has the necessary qualities to be subjectively judged as appealing.

  12. Network Dynamics: Modeling And Generation Of Very Large Heterogeneous Social Networks

    Science.gov (United States)

    2015-11-23

    OF RESPONSIBLE PERSON Sidney Redner 19b.  TELEPHONE NUMBER (Include area code) 617-353-2618 Standard Form 298 (Rev. 8/98) Prescribed by ANSI Std...2 We generated heterogeneous social networks from homogeneous interaction rules. Het- erogeneity emerges dynamically as the network grows, rather than

  13. Generating private recommendations in a social trust network

    NARCIS (Netherlands)

    Erkin, Z.; Veugen, P.J.M.; Lagendijk, R.L.

    2011-01-01

    Recommender systems have become increasingly important in e-commerce as they can guide customers with finding personalized services and products. A variant of recommender systems that generates recommendations from a set of trusted people is recently getting more attention in social networks.

  14. Outcome of surgical implant generation network nail initiative in ...

    African Journals Online (AJOL)

    Background: Closed interlocked intra-medullary nailing (IM), the standard method of treating of long bone shaft fracture, has been a dream to most resource poor hospitals like Kenyan regional hospitals. Surgical implant generation network (SIGN) initiative employs use of external jigs and slot finders instead of expensive ...

  15. Effectiveness of frequency relays on networks with multiple distributed generation

    Directory of Open Access Journals (Sweden)

    A.A.M. Hassan

    2015-05-01

    Full Text Available Distributed generation (DG has gained a vital role in distribution utilities. So, it is important to correctly detect islanding of DG units. Frequency relays are one of the most commonly used loss of mains detection method. However, distribution utilities may be faced by concern related to false operation of these frequency relays. The commercially available frequency relays reported considering standard tight setting. This paper investigates some factors related to relays internal algorithm that contribute to their different operating responses. The factors that will be investigated are frequency measuring techniques, measuring windows, time delays and under voltage interlock function. With the increasing penetration of DG into the network, it is becoming common to have multiple DG units connected at the same network location. Two generators connected at the same location and employing frequency relays with the same setting but different characteristics were simulated. When subjected to the same network disturbances the possible interference between the two relays is analyzed.

  16. Converged Wireless Networking and Optimization for Next Generation Services

    Directory of Open Access Journals (Sweden)

    J. Rodriguez

    2010-01-01

    Full Text Available The Next Generation Network (NGN vision is tending towards the convergence of internet and mobile services providing the impetus for new market opportunities in combining the appealing services of internet with the roaming capability of mobile networks. However, this convergence does not go far enough, and with the emergence of new coexistence scenarios, there is a clear need to evolve the current architecture to provide cost-effective end-to-end communication. The LOOP project, a EUREKA-CELTIC driven initiative, is one piece in the jigsaw by helping European industry to sustain a leading role in telecommunications and manufacturing of high-value products and machinery by delivering pioneering converged wireless networking solutions that can be successfully demonstrated. This paper provides an overview of the LOOP project and the key achievements that have been tunneled into first prototypes for showcasing next generation services for operators and process manufacturers.

  17. Generating three-qubit quantum circuits with neural networks

    Science.gov (United States)

    Swaddle, Michael; Noakes, Lyle; Smallbone, Harry; Salter, Liam; Wang, Jingbo

    2017-10-01

    A new method for compiling quantum algorithms is proposed and tested for a three qubit system. The proposed method is to decompose a unitary matrix U, into a product of simpler Uj via a neural network. These Uj can then be decomposed into product of known quantum gates. Key to the effectiveness of this approach is the restriction of the set of training data generated to paths which approximate minimal normal subRiemannian geodesics, as this removes unnecessary redundancy and ensures the products are unique. The two neural networks are shown to work effectively, each individually returning low loss values on validation data after relatively short training periods. The two networks are able to return coefficients that are sufficiently close to the true coefficient values to validate this method as an approach for generating quantum circuits. There is scope for more work in scaling this approach for larger quantum systems.

  18. Robustness and information propagation in attractors of Random Boolean Networks.

    Science.gov (United States)

    Lloyd-Price, Jason; Gupta, Abhishekh; Ribeiro, Andre S

    2012-01-01

    Attractors represent the long-term behaviors of Random Boolean Networks. We study how the amount of information propagated between the nodes when on an attractor, as quantified by the average pairwise mutual information (I(A)), relates to the robustness of the attractor to perturbations (R(A)). We find that the dynamical regime of the network affects the relationship between I(A) and R(A). In the ordered and chaotic regimes, I(A) is anti-correlated with R(A), implying that attractors that are highly robust to perturbations have necessarily limited information propagation. Between order and chaos (for so-called "critical" networks) these quantities are uncorrelated. Finite size effects cause this behavior to be visible for a range of networks, from having a sensitivity of 1 to the point where I(A) is maximized. In this region, the two quantities are weakly correlated and attractors can be almost arbitrarily robust to perturbations without restricting the propagation of information in the network.

  19. Mechanical Behavior of Homogeneous and Composite Random Fiber Networks

    Science.gov (United States)

    Shahsavari, Ali

    Random fiber networks are present in many biological and non-biological materials such as paper, cytoskeleton, and tissue scaffolds. Mechanical behavior of networks is controlled by the mechanical properties of the constituent fibers and the architecture of the network. To characterize these two main factors, different parameters such as fiber density, fiber length, average segment length, nature of the cross-links at the fiber intersections, ratio of bending to axial behavior of fibers have been considered. Random fiber networks are usually modeled by representing each fiber as a Timoshenko or an Euler-Bernoulli beam and each cross-link as either a welded or rotating joint. In this dissertation, the effect of these modeling options on the dependence of the overall linear network modulus on microstructural parameters is studied. It is concluded that Timoshenko beams can be used for the whole range of density and fiber stiffness parameters, while the Euler-Bernoulli model can be used only at relatively low densities. In the low density-low bending stiffness range, elastic strain energy is stored in the bending mode of the deformation, while in the other extreme range of parameters, the energy is stored predominantly in the axial and shear deformation modes. It is shown that both rotating and welded joint models give the same rules for scaling of the network modulus with different micromechanical parameters. The elastic modulus of sparsely cross-linked random fiber networks, i.e. networks in which the degree of cross-linking varies, is studied. The relationship between the micromechanical parameters - fiber density, fiber axial and bending stiffness, and degree of cross-linking - and the overall elastic modulus is presented in terms of a master curve. It is shown that the master plot with various degrees of cross-linking can be collapsed to a curve which is also valid for fully cross-linked networks. Random fiber networks in which fibers are bonded to each other are

  20. Tri-generation in urban networks; Trigeneration en reseau urbain

    Energy Technology Data Exchange (ETDEWEB)

    Malahieude, J.M. [Trigen Energy Corp., New-York (United States)

    1996-12-31

    The concepts of tri-generation (simultaneous production of heat, electric power and refrigerating energy) and thermal energy distribution networks, are presented. The different components of the tri-generation system from Trigen Energy Corp. are ammonia as a refrigerant for the production of cooled water, screw compressors, gas turbines and an induction motor-generator in order to optimize the combined gas turbine and compressor utilization. The energy efficiency and pollution reduction of the system are evaluated; the system has been enhanced through re-powering and post combustion

  1. Generative Learning Objects Instantiated with Random Numbers Based Expressions

    Directory of Open Access Journals (Sweden)

    Ciprian Bogdan Chirila

    2015-12-01

    Full Text Available The development of interactive e-learning content requires special skills like programming techniques, web integration, graphic design etc. Generally, online educators do not possess such skills and their e-learning products tend to be static like presentation slides and textbooks. In this paper we propose a new interactive model of generative learning objects as a compromise betweenstatic, dull materials and dynamic, complex software e-learning materials developed by specialized teams. We find that random numbers based automatic initialization learning objects increases content diversity, interactivity thus enabling learners’ engagement. The resulted learning object model is at a limited level of complexity related to special e-learning software, intuitive and capable of increasing learners’ interactivity, engagement and motivation through dynamic content. The approach was applied successfully on several computer programing disciplines.

  2. Quantum cryptography using coherent states: Randomized encryption and key generation

    Science.gov (United States)

    Corndorf, Eric

    With the advent of the global optical-telecommunications infrastructure, an increasing number of individuals, companies, and agencies communicate information with one another over public networks or physically-insecure private networks. While the majority of the traffic flowing through these networks requires little or no assurance of secrecy, the same cannot be said for certain communications between banks, between government agencies, within the military, and between corporations. In these arenas, the need to specify some level of secrecy in communications is a high priority. While the current approaches to securing sensitive information (namely the public-key-cryptography infrastructure and deterministic private-key ciphers like AES and 3DES) seem to be cryptographically strong based on empirical evidence, there exist no mathematical proofs of secrecy for any widely deployed cryptosystem. As an example, the ubiquitous public-key cryptosystems infer all of their secrecy from the assumption that factoring of the product of two large primes is necessarily time consuming---something which has not, and perhaps cannot, be proven. Since the 1980s, the possibility of using quantum-mechanical features of light as a physical mechanism for satisfying particular cryptographic objectives has been explored. This research has been fueled by the hopes that cryptosystems based on quantum systems may provide provable levels of secrecy which are at least as valid as quantum mechanics itself. Unfortunately, the most widely considered quantum-cryptographic protocols (BB84 and the Ekert protocol) have serious implementation problems. Specifically, they require quantum-mechanical states which are not readily available, and they rely on unproven relations between intrusion-level detection and the information available to an attacker. As a result, the secrecy level provided by these experimental implementations is entirely unspecified. In an effort to provably satisfy the cryptographic

  3. Functional brain networks: random, "small world" or deterministic?

    Science.gov (United States)

    Blinowska, Katarzyna J; Kaminski, Maciej

    2013-01-01

    Lately the problem of connectivity in brain networks is being approached frequently by graph theoretical analysis. In several publications based on bivariate estimators of relations between EEG channels authors reported random or "small world" structure of networks. The results of these works often have no relation to other evidence based on imaging, inverse solutions methods, physiological and anatomical data. Herein we try to find reasons for this discrepancy. We point out that EEG signals are very much interdependent, thus bivariate measures applied to them may produce many spurious connections. In fact, they may outnumber the true connections. Giving all connections equal weights, as it is usual in the framework of graph theoretical analysis, further enhances these spurious links. In effect, close to random and disorganized patterns of connections emerge. On the other hand, multivariate connectivity estimators, which are free of the artificial links, show specific, well determined patterns, which are in a very good agreement with other evidence. The modular structure of brain networks may be identified by multivariate estimators based on Granger causality and formalism of assortative mixing. In this way, the strength of coupling may be evaluated quantitatively. During working memory task, by means of multivariate Directed Transfer Function, it was demonstrated that the modules characterized by strong internal bonds exchange the information by weaker connections.

  4. Functional brain networks: random, "small world" or deterministic?

    Directory of Open Access Journals (Sweden)

    Katarzyna J Blinowska

    Full Text Available Lately the problem of connectivity in brain networks is being approached frequently by graph theoretical analysis. In several publications based on bivariate estimators of relations between EEG channels authors reported random or "small world" structure of networks. The results of these works often have no relation to other evidence based on imaging, inverse solutions methods, physiological and anatomical data. Herein we try to find reasons for this discrepancy. We point out that EEG signals are very much interdependent, thus bivariate measures applied to them may produce many spurious connections. In fact, they may outnumber the true connections. Giving all connections equal weights, as it is usual in the framework of graph theoretical analysis, further enhances these spurious links. In effect, close to random and disorganized patterns of connections emerge. On the other hand, multivariate connectivity estimators, which are free of the artificial links, show specific, well determined patterns, which are in a very good agreement with other evidence. The modular structure of brain networks may be identified by multivariate estimators based on Granger causality and formalism of assortative mixing. In this way, the strength of coupling may be evaluated quantitatively. During working memory task, by means of multivariate Directed Transfer Function, it was demonstrated that the modules characterized by strong internal bonds exchange the information by weaker connections.

  5. Predicting genetic interactions with random walks on biological networks

    Directory of Open Access Journals (Sweden)

    Singh Ambuj K

    2009-01-01

    Full Text Available Abstract Background Several studies have demonstrated that synthetic lethal genetic interactions between gene mutations provide an indication of functional redundancy between molecular complexes and pathways. These observations help explain the finding that organisms are able to tolerate single gene deletions for a large majority of genes. For example, system-wide gene knockout/knockdown studies in S. cerevisiae and C. elegans revealed non-viable phenotypes for a mere 18% and 10% of the genome, respectively. It has been postulated that the low percentage of essential genes reflects the extensive amount of genetic buffering that occurs within genomes. Consistent with this hypothesis, systematic double-knockout screens in S. cerevisiae and C. elegans show that, on average, 0.5% of tested gene pairs are synthetic sick or synthetic lethal. While knowledge of synthetic lethal interactions provides valuable insight into molecular functionality, testing all combinations of gene pairs represents a daunting task for molecular biologists, as the combinatorial nature of these relationships imposes a large experimental burden. Still, the task of mapping pairwise interactions between genes is essential to discovering functional relationships between molecular complexes and pathways, as they form the basis of genetic robustness. Towards the goal of alleviating the experimental workload, computational techniques that accurately predict genetic interactions can potentially aid in targeting the most likely candidate interactions. Building on previous studies that analyzed properties of network topology to predict genetic interactions, we apply random walks on biological networks to accurately predict pairwise genetic interactions. Furthermore, we incorporate all published non-interactions into our algorithm for measuring the topological relatedness between two genes. We apply our method to S. cerevisiae and C. elegans datasets and, using a decision tree

  6. First Passage Time for Random Walks in Heterogeneous Networks

    Science.gov (United States)

    Hwang, S.; Lee, D.-S.; Kahng, B.

    2012-08-01

    The first passage time (FPT) for random walks is a key indicator of how fast information diffuses in a given system. Despite the role of FPT as a fundamental feature in transport phenomena, its behavior, particularly in heterogeneous networks, is not yet fully understood. Here, we study, both analytically and numerically, the scaling behavior of the FPT distribution to a given target node, averaged over all starting nodes. We find that random walks arrive quickly at a local hub, and therefore, the FPT distribution shows a crossover with respect to time from fast decay behavior (induced from the attractive effect to the hub) to slow decay behavior (caused by the exploring of the entire system). Moreover, the mean FPT is independent of the degree of the target node in the case of compact exploration. These theoretical results justify the necessity of using a random jump protocol (empirically used in search engines) and provide guidelines for designing an effective network to make information quickly accessible.

  7. Random Deep Belief Networks for Recognizing Emotions from Speech Signals

    Directory of Open Access Journals (Sweden)

    Guihua Wen

    2017-01-01

    Full Text Available Now the human emotions can be recognized from speech signals using machine learning methods; however, they are challenged by the lower recognition accuracies in real applications due to lack of the rich representation ability. Deep belief networks (DBN can automatically discover the multiple levels of representations in speech signals. To make full of its advantages, this paper presents an ensemble of random deep belief networks (RDBN method for speech emotion recognition. It firstly extracts the low level features of the input speech signal and then applies them to construct lots of random subspaces. Each random subspace is then provided for DBN to yield the higher level features as the input of the classifier to output an emotion label. All outputted emotion labels are then fused through the majority voting to decide the final emotion label for the input speech signal. The conducted experimental results on benchmark speech emotion databases show that RDBN has better accuracy than the compared methods for speech emotion recognition.

  8. Overcoming barriers to scheduling embedded generation to support distribution networks

    Energy Technology Data Exchange (ETDEWEB)

    Wright, A.J.; Formby, J.R.

    2000-07-01

    Current scheduling of embedded generation for distribution in the UK is limited and patchy. Some DNOs actively schedule while others do none. The literature on the subject is mainly about accommodating volatile wind output, and optimising island systems, for both cost of supply and network stability. The forthcoming NETA will lower prices, expose unpredictable generation to imbalance markets and could introduce punitive constraint payments on DNOs, but at the same time create a dynamic market for both power and ancillary services from embedded generators. Most renewable generators either run as base load (e.g. waste ) or according to the vagaries of the weather (e.g. wind, hydro), so offer little scope for scheduling other than 'off'. CHP plant is normally heat- led for industrial processes or building needs, but supplementary firing or thermal storage often allow considerable scope for scheduling. Micro-CHP with thermal storage could provide short-term scheduling, but tends to be running anyway during the evening peak. Standby generation appears to be ideal for scheduling, but in practice operators may be unwilling to run parallel with the network, and noise and pollution problems may preclude frequent operation. Statistical analysis can be applied to calculate the reliability of several generators compared to one; with a large number of generators such as micro-CHP reliability of a proportion of load is close to unity. The type of communication for generation used will depend on requirements for bandwidth, cost, reliability and whether it is bundled with other services. With high levels of deeply embedded, small-scale generation using induction machines, voltage control and black start capability will become important concerns on 11 kV and LV networks. This will require increased generation monitoring and remote control of switchgear. Examples of cost benefits from scheduling are given, including deferred reinforcement, increased exports on non

  9. Evolution of vocabulary on scale-free and random networks

    Science.gov (United States)

    Kalampokis, Alkiviadis; Kosmidis, Kosmas; Argyrakis, Panos

    2007-06-01

    We examine the evolution of the vocabulary of a group of individuals (linguistic agents) on a scale-free network, using Monte Carlo simulations and assumptions from evolutionary game theory. It is known that when the agents are arranged in a two-dimensional lattice structure and interact by diffusion and encounter, then their final vocabulary size is the maximum possible. Knowing all available words is essential in order to increase the probability to “survive” by effective reproduction. On scale-free networks we find a different result. It is not necessary to learn the entire vocabulary available. Survival chances are increased by using the vocabulary of the “hubs” (nodes with high degree). The existence of the “hubs” in a scale-free network is the source of an additional important fitness generating mechanism.

  10. Address Translation Problems in IMS Based Next Generation Networks

    Directory of Open Access Journals (Sweden)

    Balazs Godor

    2006-01-01

    Full Text Available The development of packed based multimedia networks reached a turning point when the ITU-T and the ETSIhave incorporated the IMS to the NGN. With the fast development of mobile communication more and more services andcontent are available. In contrast with fix network telephony both the services and the devices are personalized in the “mobileworld”. Services, known from the Internet - like e-mail, chat, browsing, presence, etc. – are already available via mobiledevices as well. The IMS originally wanted to exploit both the benefits of mobile networks and the fancy services of theInternet. But today it is already more than that. IMS is the core of the next generation telecommunication networks and abasis for fix-mobile convergent services. The fact however that IMS was originally a “mobile” standard, where IPv6 was notoddity generated some problems for the fix networks, where IPv4 is used. In this article I give an overview of these problemsand mention some solutions as well.

  11. Exploring MEDLINE space with random indexing and pathfinder networks.

    Science.gov (United States)

    Cohen, Trevor

    2008-11-06

    The integration of disparate research domains is a prerequisite for the success of the translational science initiative. MEDLINE abstracts contain content from a broad range of disciplines, presenting an opportunity for the development of methods able to integrate the knowledge they contain. Latent Semantic Analysis (LSA) and related methods learn human-like associations between terms from unannotated text. However, their computational and memory demands limits their ability to address a corpus of this size. Furthermore, visualization methods previously used in conjunction with LSA have limited ability to define the local structure of the associative networks LSA learns. This paper explores these issues by (1) processing the entire MEDLINE corpus using Random Indexing, a variant of LSA, and (2) exploring learned associations using Pathfinder Networks. Meaningful associations are inferred from MEDLINE, including a drug-disease association undetected by PUBMED search.

  12. Comparison of Synchronization in Small World and Random Networks

    Science.gov (United States)

    Bernard, Tess; Miller, Bruce

    2008-10-01

    There are many models that simulate neuron firing in the brain. These range from the basic integrate-and-fire method to the complex Hodgkin-Huxley model. Eugene Izhikevich (2003) employed the principles of nonlinear dynamics, specifically bifurcation theory, to develop a model that is both simple and powerful, which can be described as an integrate-and-reset model. By changing only a few parameters, this model can simulate all the known types of cortical neuron firing patterns. Using it, we studied the properties of two different types of neural networks. In the first, originally used by Izhikevich, the synaptic connection strengths between the neurons are determined randomly, and each neuron is connected to all of the other neurons in the network. The second is a small world network modeled after the one employed by Alex Roxin, et al. (2004), but expanded to include inhibition. This geometry is an idealized representation of the nervous system. In our investigation we compared the onset of synchronization in each network, as well as its stability in the presence of external currents. We also considered the relevance of these results to real world phenomena such as seizures.

  13. Characterizing the Path Coverage of Random Wireless Sensor Networks

    Directory of Open Access Journals (Sweden)

    Moslem Noori

    2010-01-01

    Full Text Available Wireless sensor networks are widely used in security monitoring applications to sense and report specific activities in a field. In path coverage, for example, the network is in charge of monitoring a path and discovering any intruder trying to cross it. In this paper, we investigate the path coverage properties of a randomly deployed wireless sensor network when the number of sensors and also the length of the path are finite. As a consequence, Boolean model, which has been widely used previously, is not applicable. Using results from geometric probability, we determine the probability of full path coverage, distribution of the number of uncovered gaps over the path, and the probability of having no uncovered gaps larger than a specific size. We also find the cumulative distribution function (cdf of the covered part of the path. Based on our results on the probability of full path coverage, we derive a tight upper bound for the number of nodes guaranteeing the full path coverage with a desired reliability. Through computer simulations, it is verified that for networks with nonasymptotic size, our analysis is accurate where the Boolean model can be inaccurate.

  14. Network Randomization and Dynamic Defense for Critical Infrastructure Systems

    Energy Technology Data Exchange (ETDEWEB)

    Chavez, Adrian R. [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States); Martin, Mitchell Tyler [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States); Hamlet, Jason [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States); Stout, William M.S. [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States); Lee, Erik [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States)

    2015-04-01

    Critical Infrastructure control systems continue to foster predictable communication paths, static configurations, and unpatched systems that allow easy access to our nation's most critical assets. This makes them attractive targets for cyber intrusion. We seek to address these attack vectors by automatically randomizing network settings, randomizing applications on the end devices themselves, and dynamically defending these systems against active attacks. Applying these protective measures will convert control systems into moving targets that proactively defend themselves against attack. Sandia National Laboratories has led this effort by gathering operational and technical requirements from Tennessee Valley Authority (TVA) and performing research and development to create a proof-of-concept solution. Our proof-of-concept has been tested in a laboratory environment with over 300 nodes. The vision of this project is to enhance control system security by converting existing control systems into moving targets and building these security measures into future systems while meeting the unique constraints that control systems face.

  15. Long-Range Navigation on Complex Networks using L\\'evy Random Walks

    OpenAIRE

    Riascos, A. P.; Mateos, José L.

    2012-01-01

    We introduce a strategy of navigation in undirected networks, including regular, random, and complex networks, that is inspired by L\\'evy random walks, generalizing previous navigation rules. We obtained exact expressions for the stationary probability distribution, the occupation probability, the mean first passage time, and the average time to reach a node on the network. We found that the long-range navigation using the L\\'evy random walk strategy, compared with the normal random walk stra...

  16. Deep recurrent conditional random field network for protein secondary prediction

    DEFF Research Database (Denmark)

    Johansen, Alexander Rosenberg; Sønderby, Søren Kaae; Sønderby, Casper Kaae

    2017-01-01

    Deep learning has become the state-of-the-art method for predicting protein secondary structure from only its amino acid residues and sequence profile. Building upon these results, we propose to combine a bi-directional recurrent neural network (biRNN) with a conditional random field (CRF), which...... of the labels for all time-steps. We condition the CRF on the output of biRNN, which learns a distributed representation based on the entire sequence. The biRNN-CRF is therefore close to ideally suited for the secondary structure task because a high degree of cross-talk between neighboring elements can...

  17. Measuring symmetry, asymmetry and randomness in neural network connectivity.

    Directory of Open Access Journals (Sweden)

    Umberto Esposito

    Full Text Available Cognitive functions are stored in the connectome, the wiring diagram of the brain, which exhibits non-random features, so-called motifs. In this work, we focus on bidirectional, symmetric motifs, i.e. two neurons that project to each other via connections of equal strength, and unidirectional, non-symmetric motifs, i.e. within a pair of neurons only one neuron projects to the other. We hypothesise that such motifs have been shaped via activity dependent synaptic plasticity processes. As a consequence, learning moves the distribution of the synaptic connections away from randomness. Our aim is to provide a global, macroscopic, single parameter characterisation of the statistical occurrence of bidirectional and unidirectional motifs. To this end we define a symmetry measure that does not require any a priori thresholding of the weights or knowledge of their maximal value. We calculate its mean and variance for random uniform or Gaussian distributions, which allows us to introduce a confidence measure of how significantly symmetric or asymmetric a specific configuration is, i.e. how likely it is that the configuration is the result of chance. We demonstrate the discriminatory power of our symmetry measure by inspecting the eigenvalues of different types of connectivity matrices. We show that a Gaussian weight distribution biases the connectivity motifs to more symmetric configurations than a uniform distribution and that introducing a random synaptic pruning, mimicking developmental regulation in synaptogenesis, biases the connectivity motifs to more asymmetric configurations, regardless of the distribution. We expect that our work will benefit the computational modelling community, by providing a systematic way to characterise symmetry and asymmetry in network structures. Further, our symmetry measure will be of use to electrophysiologists that investigate symmetry of network connectivity.

  18. Increasing the capacity of distributed generation in electricity networks by intelligent generator control

    OpenAIRE

    Aristides E. Kiprakis

    2005-01-01

    The rise of environmental awareness as well as the unstable global fossil fuel market has brought about government initiatives to increase electricity generation from renewable energy sources. These resources tend to be geographically and electrically remote from load centres. Consequently many Distributed Generators (DGs) are expected to be connected to the existing Distribution Networks (DNs), which have high impedance and low X/R ratios. Intermittence and unpredictability of the vario...

  19. Light scattering optimization of chitin random network in ultrawhite beetle scales

    Science.gov (United States)

    Utel, Francesco; Cortese, Lorenzo; Pattelli, Lorenzo; Burresi, Matteo; Vignolini, Silvia; Wiersma, Diederik

    2017-09-01

    Among the natural white colored photonics structures, a bio-system has become of great interest in the field of disordered optical media: the scale of the white beetle Chyphochilus. Despite its low thickness, on average 7 μm, and low refractive index, this beetle exhibits extreme high brightness and unique whiteness. These properties arise from the interaction of light with a complex network of chitin nano filaments embedded in the interior of the scales. As it's been recently claimed, this could be a consequence of the peculiar morphology of the filaments network that, by means of high filling fraction (0.61) and structural anisotropy, optimizes the multiple scattering of light. We therefore performed a numerical analysis on the structural properties of the chitin network in order to understand their role in the enhancement of the scale scattering intensity. Modeling the filaments as interconnected rod shaped scattering centers, we numerically generated the spatial coordinates of the network components. Controlling the quantities that are claimed to play a fundamental role in the brightness and whiteness properties of the investigated system (filling fraction and average rods orientation, i.e. the anisotropy of the ensemble of scattering centers), we obtained a set of customized random networks. FDTD simulations of light transport have been performed on these systems, observing high reflectance for all the visible frequencies and proving the implemented algorithm to numerically generate the structures is suitable to investigate the dependence of reflectance by anisotropy.

  20. Advances Made in the Next Generation of Satellite Networks

    Science.gov (United States)

    Bhasin, Kul B.

    1999-01-01

    Because of the unique networking characteristics of communications satellites, global satellite networks are moving to the forefront in enhancing national and global information infrastructures. Simultaneously, broadband data services, which are emerging as the major market driver for future satellite and terrestrial networks, are being widely acknowledged as the foundation for an efficient global information infrastructure. In the past 2 years, various task forces and working groups around the globe have identified pivotal topics and key issues to address if we are to realize such networks in a timely fashion. In response, industry, government, and academia undertook efforts to address these topics and issues. A workshop was organized to provide a forum to assess the current state-of-the-art, identify key issues, and highlight the emerging trends in the next-generation architectures, data protocol development, communication interoperability, and applications. The Satellite Networks: Architectures, Applications, and Technologies Workshop was hosted by the Space Communication Program at the NASA Lewis Research Center in Cleveland, Ohio. Nearly 300 executives and technical experts from academia, industry, and government, representing the United States and eight other countries, attended the event (June 2 to 4, 1998). The program included seven panels and invited sessions and nine breakout sessions in which 42 speakers presented on technical topics. The proceedings covers a wide range of topics: access technology and protocols, architectures and network simulations, asynchronous transfer mode (ATM) over satellite networks, Internet over satellite networks, interoperability experiments and applications, multicasting, NASA interoperability experiment programs, NASA mission applications, and Transmission Control Protocol/Internet Protocol (TCP/IP) over satellite: issues, relevance, and experience.

  1. Triadic closure as a basic generating mechanism of communities in complex networks.

    Science.gov (United States)

    Bianconi, Ginestra; Darst, Richard K; Iacovacci, Jacopo; Fortunato, Santo

    2014-10-01

    Most of the complex social, technological, and biological networks have a significant community structure. Therefore the community structure of complex networks has to be considered as a universal property, together with the much explored small-world and scale-free properties of these networks. Despite the large interest in characterizing the community structures of real networks, not enough attention has been devoted to the detection of universal mechanisms able to spontaneously generate networks with communities. Triadic closure is a natural mechanism to make new connections, especially in social networks. Here we show that models of network growth based on simple triadic closure naturally lead to the emergence of community structure, together with fat-tailed distributions of node degree and high clustering coefficients. Communities emerge from the initial stochastic heterogeneity in the concentration of links, followed by a cycle of growth and fragmentation. Communities are the more pronounced, the sparser the graph, and disappear for high values of link density and randomness in the attachment procedure. By introducing a fitness-based link attractivity for the nodes, we find a phase transition where communities disappear for high heterogeneity of the fitness distribution, but a different mesoscopic organization of the nodes emerges, with groups of nodes being shared between just a few superhubs, which attract most of the links of the system.

  2. Gender roles in social network sites from generation Y

    Directory of Open Access Journals (Sweden)

    F. Javier Rondan-Cataluña

    2017-12-01

    Full Text Available One of the fundamental and most commonly used communication tools by the generation Y or Millennials are online social networks. The first objective of this study is to model the effects that exercise social participation, community integration and trust in community satisfaction, as an antecedent of routinization. Besides, we propose as a second objective checking if gender roles proposed to underlie the different behaviors that develop social network users. An empirical study was carried out on a sample of 1,448 undergraduate students that are SNS users from Generation Y. First, we applied a structural equation modeling approach to test the proposed model. Second, we followed a methodology using a scale of masculinity and femininity to categorize the sample obtaining three groups: feminine, masculine, and androgynous.

  3. Synthetic aperture radar ship discrimination, generation and latent variable extraction using information maximizing generative adversarial networks

    CSIR Research Space (South Africa)

    Schwegmann, Colin P

    2017-07-01

    Full Text Available Maximizing Generative Adversarial Network extend this idea by extracting untangled latent variables as part of the discrimination process which help to classify the data in terms of categories/classes and properties such as ship rotation. Despite the limited...

  4. Upscaling of spectral induced polarization response using random tube networks

    Science.gov (United States)

    Maineult, Alexis; Revil, André; Camerlynck, Christian; Florsch, Nicolas; Titov, Konstantin

    2017-05-01

    In order to upscale the induced polarization (IP) response of porous media, from the pore scale to the sample scale, we implement a procedure to compute the macroscopic complex resistivity response of random tube networks. A network is made of a 2-D square-meshed grid of connected tubes, which obey to a given tube radius distribution. In a simplified approach, the electrical impedance of each tube follows a local Pelton resistivity model, with identical resistivity, chargeability and Cole-Cole exponent values for all the tubes-only the time constant varies, as it depends on the radius of each tube and on a diffusion coefficient also identical for all the tubes. By solving the conservation law for the electrical charge, the macroscopic IP response of the network is obtained. We fit successfully the macroscopic complex resistivity also by a Pelton resistivity model. Simulations on uncorrelated and correlated networks, for which the tube radius distribution is so that the decimal logarithm of the radius is normally distributed, evidence that the local and macroscopic model parameters are the same, except the Cole-Cole exponent: its macroscopic value diminishes with increasing heterogeneity (i.e. with increasing standard deviation of the radius distribution), compared to its local value. The methodology is also applied to six siliciclastic rock samples, for which the pore radius distributions from mercury porosimetry are available. These samples exhibit the same behaviour as synthetic media, that is, the macroscopic Cole-Cole exponent is always lower than the local one. As a conclusion, the pore network method seems to be a promising tool for studying the upscaling of the IP response of porous media.

  5. Towards Third-Generation Living Lab Networks in Cities

    Directory of Open Access Journals (Sweden)

    Seppo Leminen

    2017-11-01

    Full Text Available Many cities engage in diverse experimentation, innovation, and development activities with a broad variety of environments and stakeholders to the benefit of citizens, companies, municipalities, and other organizations. Hence, this article discusses such engagement in terms of next-generation living lab networks in the city context. In so doing, the study contributes to the discussion on living labs by introducing a framework of collaborative innovation networks in cities and suggesting a typology of third-generation living labs. Our framework is characterized by diverse platforms and participation approaches, resulting in four distinctive modes of collaborative innovation networks where the city is: i a provider, ii a neighbourhood participator, iii a catalyst, or iv a rapid experimenter. The typology is based on an analysis of 118 interviews with participants in six Finnish cities and reveals various ways to organize innovation activities in the city context. In particular, cities can benefit from innovation networks by simultaneously exploiting multiple platforms such as living labs for innovation. We conclude by discussing implications to theory and practice, and suggesting directions for future research.

  6. MHD generator with improved network coupling electrodes to a load

    Science.gov (United States)

    Rosa, Richard J.

    1977-01-01

    An MHD generator has a plurality of segmented electrodes extending longitudinally of a duct, whereby progressively increasing high DC voltages are derived from a set of cathode electrodes and progressively increasing low DC voltages are derived from a set of anode electrodes. First and second load terminals are respectively connected to the cathode and anode electrodes by separate coupling networks, each of which includes a number of SCR's and a number of diode rectifiers.

  7. Neural Network-Based Abstract Generation for Opinions and Arguments

    OpenAIRE

    Wang, Lu; Ling, Wang

    2016-01-01

    We study the problem of generating abstractive summaries for opinionated text. We propose an attention-based neural network model that is able to absorb information from multiple text units to construct informative, concise, and fluent summaries. An importance-based sampling method is designed to allow the encoder to integrate information from an important subset of input. Automatic evaluation indicates that our system outperforms state-of-the-art abstractive and extractive summarization syst...

  8. Multi-bit quantum random number generation by measuring positions of arrival photons.

    Science.gov (United States)

    Yan, Qiurong; Zhao, Baosheng; Liao, Qinghong; Zhou, Nanrun

    2014-10-01

    We report upon the realization of a novel multi-bit optical quantum random number generator by continuously measuring the arrival positions of photon emitted from a LED using MCP-based WSA photon counting imaging detector. A spatial encoding method is proposed to extract multi-bits random number from the position coordinates of each detected photon. The randomness of bits sequence relies on the intrinsic randomness of the quantum physical processes of photonic emission and subsequent photoelectric conversion. A prototype has been built and the random bit generation rate could reach 8 Mbit/s, with random bit generation efficiency of 16 bits per detected photon. FPGA implementation of Huffman coding is proposed to reduce the bias of raw extracted random bits. The random numbers passed all tests for physical random number generator.

  9. The Random Walk Model Based on Bipartite Network

    Directory of Open Access Journals (Sweden)

    Zhang Man-Dun

    2016-01-01

    Full Text Available With the continuing development of the electronic commerce and growth of network information, there is a growing possibility for citizens to be confused by the information. Though the traditional technology of information retrieval have the ability to relieve the overload of information in some extent, it can not offer a targeted personality service based on user’s interests and activities. In this context, the recommendation algorithm arose. In this paper, on the basis of conventional recommendation, we studied the scheme of random walk based on bipartite network and the application of it. We put forward a similarity measurement based on implicit feedback. In this method, a uneven character vector is imported(the weight of item in the system. We put forward a improved random walk pattern which make use of partial or incomplete neighbor information to create recommendation information. In the end, there is an experiment in the real data set, the recommendation accuracy and practicality are improved. We promise the reality of the result of the experiment

  10. Analysis of complex contagions in random multiplex networks

    CERN Document Server

    Yagan, Osman

    2012-01-01

    We study the diffusion of influence in random multiplex networks where links can be of $r$ different types, and for a given content (e.g., rumor, product, political view), each link type is associated with a content dependent parameter $c_i$ in $[0,\\infty]$ that measures the relative bias type-$i$ links have in spreading this content. In this setting, we propose a linear threshold model of contagion where nodes switch state if their "perceived" proportion of active neighbors exceeds a threshold \\tau. Namely, a node connected to $m_i$ active neighbors and $k_i-m_i$ inactive neighbors via type-$i$ links will turn active if $\\sum{c_i m_i}/\\sum{c_i k_i}$ exceeds its threshold \\tau. Under this model, we obtain the condition, probability and expected size of global spreading events. Our results extend the existing work on complex contagions in several directions by i) providing solutions for coupled random networks whose vertices are neither identical nor disjoint, (ii) highlighting the effect of content on the dyn...

  11. Random walks with long-range steps generated by functions of Laplacian matrices

    OpenAIRE

    Riascos, A. P.; Michelitsch, T. M.; Collet, B. A.; Nowakowski, A. F.; Nicolleau, F. C. G. A

    2017-01-01

    In this paper, we explore different Markovian random walk strategies on networks with transition probabilities between nodes defined in terms of functions of the Laplacian matrix. We generalize random walk strategies with local information in the Laplacian matrix, that describes the connections of a network, to a dynamics determined by functions of this matrix. The resulting processes is non-local allowing transitions of the random walker from one node to nodes beyond its nearest neighbors. I...

  12. Estimating Route Choice Models from Stochastically Generated Choice Sets on Large-Scale Networks Correcting for Unequal Sampling Probability

    DEFF Research Database (Denmark)

    Vacca, Alessandro; Prato, Carlo Giacomo; Meloni, Italo

    2015-01-01

    is the dependency of the parameter estimates from the choice set generation technique. Bias introduced in model estimation has been corrected only for the random walk algorithm, which has problematic applicability to large-scale networks. This study proposes a correction term for the sampling probability of routes...

  13. Generation and Analysis of Constrained Random Sampling Patterns

    DEFF Research Database (Denmark)

    Pierzchlewski, Jacek; Arildsen, Thomas

    2016-01-01

    Random sampling is a technique for signal acquisition which is gaining popularity in practical signal processing systems. Nowadays, event-driven analog-to-digital converters make random sampling feasible in practical applications. A process of random sampling is defined by a sampling pattern, whi...

  14. Identification of yeast transcriptional regulation networks using multivariate random forests.

    Directory of Open Access Journals (Sweden)

    Yuanyuan Xiao

    2009-06-01

    Full Text Available The recent availability of whole-genome scale data sets that investigate complementary and diverse aspects of transcriptional regulation has spawned an increased need for new and effective computational approaches to analyze and integrate these large scale assays. Here, we propose a novel algorithm, based on random forest methodology, to relate gene expression (as derived from expression microarrays to sequence features residing in gene promoters (as derived from DNA motif data and transcription factor binding to gene promoters (as derived from tiling microarrays. We extend the random forest approach to model a multivariate response as represented, for example, by time-course gene expression measures. An analysis of the multivariate random forest output reveals complex regulatory networks, which consist of cohesive, condition-dependent regulatory cliques. Each regulatory clique features homogeneous gene expression profiles and common motifs or synergistic motif groups. We apply our method to several yeast physiological processes: cell cycle, sporulation, and various stress conditions. Our technique displays excellent performance with regard to identifying known regulatory motifs, including high order interactions. In addition, we present evidence of the existence of an alternative MCB-binding pathway, which we confirm using data from two independent cell cycle studies and two other physioloigical processes. Finally, we have uncovered elaborate transcription regulation refinement mechanisms involving PAC and mRRPE motifs that govern essential rRNA processing. These include intriguing instances of differing motif dosages and differing combinatorial motif control that promote regulatory specificity in rRNA metabolism under differing physiological processes.

  15. Code generation: a strategy for neural network simulators.

    Science.gov (United States)

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

  16. Generate networks with power-law and exponential-law distributed degrees: with applications in link prediction of tumor pathways

    Directory of Open Access Journals (Sweden)

    WenJun Zhang

    2016-03-01

    Full Text Available In present study I proposed a method for generating biological networks based on power-law (p(x=x^(-a and exponential-law (p(x=e^(-ax distribution functions. Given the parameter of power-law or exponential-law distribution function, a, the algorithm generates an expected frequency distribution according to the given parameter, thereafter creates an adjacency matrix in which (practical frequency distribution of node degrees matches the expected frequency distribution. The results showed that power-law distribution function performs much better than exponential-law distribution function in generating networks. Using the revised algorithm, tumor related networks (pathways are simulated and predicted. The results prove that the algorithm is overall effective in predicting network links (14.6%-21.2%of correctly predicted links against 0.1%-3.4% of that for random assignments. Matlab codes of the algorithms are given also.

  17. Pinning Synchronization of Linear Complex Coupling Synchronous Generators Network of Hydroelectric Generating Set

    Directory of Open Access Journals (Sweden)

    Xuefei Wu

    2014-01-01

    Full Text Available A novel linear complex system for hydroturbine-generator sets in multimachine power systems is suggested in this paper and synchronization of the power-grid networks is studied. The advanced graph theory and stability theory are combined to solve the problem. Here we derive a sufficient condition under which the synchronous state of power-grid networks is stable in disturbance attenuation. Finally, numerical simulations are provided to illustrate the effectiveness of the results by the IEEE 39 bus system.

  18. Enhancing the Performance of Random Access Networks with Random Packet CDMA and Joint Detection

    Directory of Open Access Journals (Sweden)

    Behrouz Farhang-Boroujeny

    2008-09-01

    Full Text Available Random packet CDMA (RP-CDMA is a recently proposed random transmission scheme which has been designed from the beginning as a cross-layer method to overcome the restrictive nature of the Aloha protocol. Herein, we more precisely model its performance and investigate throughput and network stability. In contrast to previous works, we adopt the spread Aloha model for header transmission, and the performance of different joint detection methods for the payload data is investigated. Furthermore, we introduce performance measures for multiple access systems based on the diagonal elements of a modified multipacket reception matrix, and show that our measures describe the upper limit of the vector of stable arrival rates for a finite number of users. Finally, we simulate queue sizes and throughput characteristics of RP-CDMA with various receiver structures and compare them to spread Aloha.

  19. Enhancing the Performance of Random Access Networks with Random Packet CDMA and Joint Detection

    Science.gov (United States)

    Kempter, Roland; Amini, Peiman; Farhang-Boroujeny, Behrouz

    2008-12-01

    Random packet CDMA (RP-CDMA) is a recently proposed random transmission scheme which has been designed from the beginning as a cross-layer method to overcome the restrictive nature of the Aloha protocol. Herein, we more precisely model its performance and investigate throughput and network stability. In contrast to previous works, we adopt the spread Aloha model for header transmission, and the performance of different joint detection methods for the payload data is investigated. Furthermore, we introduce performance measures for multiple access systems based on the diagonal elements of a modified multipacket reception matrix, and show that our measures describe the upper limit of the vector of stable arrival rates for a finite number of users. Finally, we simulate queue sizes and throughput characteristics of RP-CDMA with various receiver structures and compare them to spread Aloha.

  20. Small Distributed Renewable Energy Generation for Low Voltage Distribution Networks

    Directory of Open Access Journals (Sweden)

    Chindris M.

    2016-08-01

    Full Text Available Driven by the existing energy policies, the use of renewable energy has increased considerably all over the world in order to respond to the increasing energy consumption and to reduce the environmental impact of the electricity generation. Although most policy makers and companies are focusing on large applications, the use of cheap small generation units, based on local renewable resources, has become increasingly attractive for the general public, small farms and remote communities. The paper presents several results of a research project aiming to identify the power quality issues and the impact of RES based distributed generation (DG or other non-linear loads on low voltage (LV distribution networks in Romania; the final goal is to develop a Universal Power Quality Conditioner (UPQC able to diminish the existing disturbances. Basically, the work analyses the existing DG technologies and identifies possible solutions for their integration in Romania; taking into account the existent state of the art, the attention was paid on small systems, using wind and solar energy, and on possibility to integrate them into suburban and rural LV distribution networks. The presence of DG units at distribution voltage level means the transition from traditional passive to active distribution networks. In general, the relatively low penetration levels of DG does not produce problems; however, the nowadays massive increase of local power generation have led to new integration challenges in order to ensure the reliability and quality of the power supply. Power quality issues are identified and their assessment is the key element in the design of measures aiming to diminish all existing disturbances.

  1. Understanding the Generation of Network Bursts by Adaptive Oscillatory Neurons

    Directory of Open Access Journals (Sweden)

    Tanguy Fardet

    2018-02-01

    Full Text Available Experimental and numerical studies have revealed that isolated populations of oscillatory neurons can spontaneously synchronize and generate periodic bursts involving the whole network. Such a behavior has notably been observed for cultured neurons in rodent's cortex or hippocampus. We show here that a sufficient condition for this network bursting is the presence of an excitatory population of oscillatory neurons which displays spike-driven adaptation. We provide an analytic model to analyze network bursts generated by coupled adaptive exponential integrate-and-fire neurons. We show that, for strong synaptic coupling, intrinsically tonic spiking neurons evolve to reach a synchronized intermittent bursting state. The presence of inhibitory neurons or plastic synapses can then modulate this dynamics in many ways but is not necessary for its appearance. Thanks to a simple self-consistent equation, our model gives an intuitive and semi-quantitative tool to understand the bursting behavior. Furthermore, it suggests that after-hyperpolarization currents are sufficient to explain bursting termination. Through a thorough mapping between the theoretical parameters and ion-channel properties, we discuss the biological mechanisms that could be involved and the relevance of the explored parameter-space. Such an insight enables us to propose experimentally-testable predictions regarding how blocking fast, medium or slow after-hyperpolarization channels would affect the firing rate and burst duration, as well as the interburst interval.

  2. Social network indices in the Generations and Gender Survey: An appraisal

    NARCIS (Netherlands)

    P.A. Dykstra (Pearl); C. Bühler (Christopher); T. Fokkema (Tineke); G. Petrič (Gregor); R. Platinovšek (Rok); T. Kogovšek (Tina); V. Hlebec (Valentina)

    2016-01-01

    markdownabstractBACKGROUND In this contribution we critically appraise the social network indices in the Generations and Gender Survey (GGS). OBJECTIVE After discussing the rationale for including social network indices in the GGS, we provide descriptive information on social network

  3. Generating route choice sets with operation information on metro networks

    Directory of Open Access Journals (Sweden)

    Wei Zhu

    2016-06-01

    Full Text Available In recent years, the metro system has advanced into an efficient transport system and become the mainstay of urban passenger transport in many mega-cities. Passenger flow is the foundation of making and coordinating operation plans for the metro system, and therefore, a variety of studies were conducted on transit assignment models. Nevertheless route choice sets of passengers also play a paramount role in flow estimation and demand prediction. This paper first discusses the main route constraints of which the train schedule is the most important, that distinguish rail networks from road networks. Then, a two-step approach to generate route choice set in a metro network is proposed. Particularly, the improved approach introduces a route filtering with train operational information based on the conventional method. An initial numerical test shows that the proposed approach gives more reasonable route choice sets for scheduled metro networks, and, consequently, obtains more accurate results from passenger flow assignment. Recommendations for possible opportunities to apply this approach to metro operations are also provided, including its integration into a metro passenger flow assignment and simulation system in practice to help metro authorities provide more precise guidance information for passengers to travel.

  4. Handover Based IMS Registration Scheme for Next Generation Mobile Networks

    Directory of Open Access Journals (Sweden)

    Shireen Tahira

    2017-01-01

    Full Text Available Next generation mobile networks aim to provide faster speed and more capacity along with energy efficiency to support video streaming and massive data sharing in social and communication networks. In these networks, user equipment has to register with IP Multimedia Subsystem (IMS which promises quality of service to the mobile users that frequently move across different access networks. After each handover caused due to mobility, IMS provides IPSec Security Association establishment and authentication phases. The main issue is that unnecessary reregistration after every handover results in latency and communication overhead. To tackle these issues, this paper presents a lightweight Fast IMS Mobility (FIM registration scheme that avoids unnecessary conventional registration phases such as security associations, authentication, and authorization. FIM maintains a flag to avoid deregistration and sends a subsequent message to provide necessary parameters to IMS servers after mobility. It also handles the change of IP address for user equipment and transferring the security associations from old to new servers. We have validated the performance of FIM by developing a testbed consisting of IMS servers and user equipment. The experimental results demonstrate the performance supremacy of FIM. It reduces media disruption time, number of messages, and packet loss up to 67%, 100%, and 61%, respectively, as compared to preliminaries.

  5. Realization of a Quantum Random Generator Certified with the Kochen-Specker Theorem.

    Science.gov (United States)

    Kulikov, Anatoly; Jerger, Markus; Potočnik, Anton; Wallraff, Andreas; Fedorov, Arkady

    2017-12-15

    Random numbers are required for a variety of applications from secure communications to Monte Carlo simulation. Yet randomness is an asymptotic property, and no output string generated by a physical device can be strictly proven to be random. We report an experimental realization of a quantum random number generator (QRNG) with randomness certified by quantum contextuality and the Kochen-Specker theorem. The certification is not performed in a device-independent way but through a rigorous theoretical proof of each outcome being value indefinite even in the presence of experimental imperfections. The analysis of the generated data confirms the incomputable nature of our QRNG.

  6. Realization of a Quantum Random Generator Certified with the Kochen-Specker Theorem

    Science.gov (United States)

    Kulikov, Anatoly; Jerger, Markus; Potočnik, Anton; Wallraff, Andreas; Fedorov, Arkady

    2017-12-01

    Random numbers are required for a variety of applications from secure communications to Monte Carlo simulation. Yet randomness is an asymptotic property, and no output string generated by a physical device can be strictly proven to be random. We report an experimental realization of a quantum random number generator (QRNG) with randomness certified by quantum contextuality and the Kochen-Specker theorem. The certification is not performed in a device-independent way but through a rigorous theoretical proof of each outcome being value indefinite even in the presence of experimental imperfections. The analysis of the generated data confirms the incomputable nature of our QRNG.

  7. Morphological Transformation and Force Generation of Active Cytoskeletal Networks.

    Directory of Open Access Journals (Sweden)

    Tamara Carla Bidone

    2017-01-01

    Full Text Available Cells assemble numerous types of actomyosin bundles that generate contractile forces for biological processes, such as cytokinesis and cell migration. One example of contractile bundles is a transverse arc that forms via actomyosin-driven condensation of actin filaments in the lamellipodia of migrating cells and exerts significant forces on the surrounding environments. Structural reorganization of a network into a bundle facilitated by actomyosin contractility is a physiologically relevant and biophysically interesting process. Nevertheless, it remains elusive how actin filaments are reoriented, buckled, and bundled as well as undergo tension buildup during the structural reorganization. In this study, using an agent-based computational model, we demonstrated how the interplay between the density of myosin motors and cross-linking proteins and the rigidity, initial orientation, and turnover of actin filaments regulates the morphological transformation of a cross-linked actomyosin network into a bundle and the buildup of tension occurring during the transformation.

  8. Artificial earthquake record generation using cascade neural network

    Directory of Open Access Journals (Sweden)

    Bani-Hani Khaldoon A.

    2017-01-01

    Full Text Available This paper presents the results of using artificial neural networks (ANN in an inverse mapping problem for earthquake accelerograms generation. This study comprises of two parts: 1-D site response analysis; performed for Dubai Emirate at UAE, where eight earthquakes records are selected and spectral matching are performed to match Dubai response spectrum using SeismoMatch software. Site classification of Dubai soil is being considered for two classes C and D based on shear wave velocity of soil profiles. Amplifications factors are estimated to quantify Dubai soil effect. Dubai’s design response spectra are developed for site classes C & D according to International Buildings Code (IBC -2012. In the second part, ANN is employed to solve inverse mapping problem to generate time history earthquake record. Thirty earthquakes records and their design response spectrum with 5% damping are used to train two cascade forward backward neural networks (ANN1, ANN2. ANN1 is trained to map the design response spectrum to time history and ANN2 is trained to map time history records to the design response spectrum. Generalized time history earthquake records are generated using ANN1 for Dubai’s site classes C and D, and ANN2 is used to evaluate the performance of ANN1.

  9. Prediction of municipal solid waste generation using nonlinear autoregressive network.

    Science.gov (United States)

    Younes, Mohammad K; Nopiah, Z M; Basri, N E Ahmad; Basri, H; Abushammala, Mohammed F M; Maulud, K N A

    2015-12-01

    Most of the developing countries have solid waste management problems. Solid waste strategic planning requires accurate prediction of the quality and quantity of the generated waste. In developing countries, such as Malaysia, the solid waste generation rate is increasing rapidly, due to population growth and new consumption trends that characterize society. This paper proposes an artificial neural network (ANN) approach using feedforward nonlinear autoregressive network with exogenous inputs (NARX) to predict annual solid waste generation in relation to demographic and economic variables like population number, gross domestic product, electricity demand per capita and employment and unemployment numbers. In addition, variable selection procedures are also developed to select a significant explanatory variable. The model evaluation was performed using coefficient of determination (R(2)) and mean square error (MSE). The optimum model that produced the lowest testing MSE (2.46) and the highest R(2) (0.97) had three inputs (gross domestic product, population and employment), eight neurons and one lag in the hidden layer, and used Fletcher-Powell's conjugate gradient as the training algorithm.

  10. Design of Randomly Deployed Heterogeneous Wireless Sensor Networks by Algorithms Based on Swarm Intelligence

    OpenAIRE

    Joon-Woo Lee; Won Kim

    2015-01-01

    This paper reports the design of a randomly deployed heterogeneous wireless sensor network (HWSN) with two types of nodes: a powerful node and an ordinary node. Powerful nodes, such as Cluster Heads (CHs), communicate directly to the data sink of the network, and ordinary nodes sense the desired information and transmit the processed data to powerful nodes. The heterogeneity of HWSNs improves the networks lifetime and coverage. This paper focuses on the design of a random network among HWSNs....

  11. A Mobility and Traffic Generation Framework for Modeling and Simulating Ad Hoc Communication Networks

    Directory of Open Access Journals (Sweden)

    Chris Barrett

    2004-01-01

    Full Text Available We present a generic mobility and traffic generation framework that can be incorporated into a tool for modeling and simulating large scale ad~hoc networks. Three components of this framework, namely a mobility data generator (MDG, a graph structure generator (GSG and an occlusion modification tool (OMT allow a variety of mobility models to be incorporated into the tool. The MDG module generates positions of transceivers at specified time instants. The GSG module constructs the graph corresponding to the ad hoc network from the mobility data provided by MDG. The OMT module modifies the connectivity of the graph produced by GSG to allow for occlusion effects. With two other modules, namely an activity data generator (ADG which generates packet transmission activities for transceivers and a packet activity simulator (PAS which simulates the movement and interaction of packets among the transceivers, the framework allows the modeling and simulation of ad hoc communication networks. The design of the framework allows a user to incorporate various realistic parameters crucial in the simulation. We illustrate the utility of our framework through a comparative study of three mobility models. Two of these are synthetic models (random waypoint and exponentially correlated mobility proposed in the literature. The third model is based on an urban population mobility modeling tool (TRANSIMS developed at the Los Alamos National Laboratory. This tool is capable of providing comprehensive information about the demographics, mobility and interactions of members of a large urban population. A comparison of these models is carried out by computing a variety of parameters associated with the graph structures generated by the models. There has recently been interest in the structural properties of graphs that arise in real world systems. We examine two aspects of this for the graphs created by the mobility models: change associated with power control (range of

  12. Analysis and Optimization of Sparse Random Linear Network Coding for Reliable Multicast Services

    DEFF Research Database (Denmark)

    Tassi, Andrea; Chatzigeorgiou, Ioannis; Roetter, Daniel Enrique Lucani

    2016-01-01

    techniques, and without any assumption on the implementation of the RLNC decoder in use, we provide an efficient way to characterize the performance of users targeted by ultra-reliable layered multicast services. The proposed modeling allows to efficiently derive the average number of coded packet...... transmissions needed to recover one or more service layers. We design a convex resource allocation framework that allows to minimize the complexity of the RLNC decoder by jointly optimizing the transmission parameters and the sparsity of the code. The designed optimization framework also ensures service......Point-to-multipoint communications are expected to play a pivotal role in next-generation networks. This paper refers to a cellular system transmitting layered multicast services to a multicast group of users. Reliability of communications is ensured via different random linear network coding (RLNC...

  13. Acquiring Efficient Locomotion in a Simulated Quadruped through Evolving Random and Predefined Neural Networks

    DEFF Research Database (Denmark)

    Veenstra, Frank; Struck, Alexander; Krauledat, Matthias

    2015-01-01

    The acquisition and optimization of dynamically stable locomotion is important to engender fast and energy efficient locomotion in animals. Conventional optimization strategies tend to have difficulties in acquiring dynamically stable gaits in legged robots. In this paper, an evolving neural...... network (ENN) was implemented with the aim to optimize the locomotive behavior of a four-legged simulated robot. In the initial generation, individuals had neural networks (NNs) that were either predefined or randomly initialized. Additional investigations show that the efficiency of applying additional...... sensors to the simulated quadruped improved the performance of the ENN slightly. Promising results were seen in the evolutionary runs where the initial predefined NNs of the population contributed to slight movements of the limbs. This paper shows how a predefined ENNs linked to bio-inspired sensors can...

  14. Wireless next generation networks a virtue-based trust model

    CERN Document Server

    Harvey, Melissa

    2014-01-01

    This SpringerBrief proposes a trust model motivated by virtue epistemology, addressing the need for a more efficient and flexible trust model for wireless next generation networks. This theory of trust simplifies the computation and communication overhead of strictly cognitive-computational models of trust. Both the advantages and the challenges of virtue-based trust models are discussed. This brief offers new research and a general theory of rationality that enables users to interpret trust and reason as complementary mechanisms that guide our rational conduct at two different epistemic level

  15. Talking Drums: Generating drum grooves with neural networks

    Science.gov (United States)

    Hutchings, P.

    2017-05-01

    Presented is a method of generating a full drum kit part for a provided kick-drum sequence. A sequence to sequence neural network model used in natural language translation was adopted to encode multiple musical styles and an online survey was developed to test different techniques for sampling the output of the softmax function. The strongest results were found using a sampling technique that drew from the three most probable outputs at each subdivision of the drum pattern but the consistency of output was found to be heavily dependent on style.

  16. Reactive power management of power networks with wind generation

    CERN Document Server

    Amaris, Hortensia; Ortega, Carlos Alvarez

    2012-01-01

    As the energy sector shifts and changes to focus on renewable technologies, the optimization of wind power becomes a key practical issue. Reactive Power Management of Power Networks with Wind Generation brings into focus the development and application of advanced optimization techniques to the study, characterization, and assessment of voltage stability in power systems. Recent advances on reactive power management are reviewed with particular emphasis on the analysis and control of wind energy conversion systems and FACTS devices. Following an introduction, distinct chapters cover the 5 key

  17. Multivariate synthetic streamflow generation using a hybrid model based on artificial neural networks

    Directory of Open Access Journals (Sweden)

    J. C. Ochoa-Rivera

    2002-01-01

    Full Text Available A model for multivariate streamflow generation is presented, based on a multilayer feedforward neural network. The structure of the model results from two components, the neural network (NN deterministic component and a random component which is assumed to be normally distributed. It is from this second component that the model achieves the ability to incorporate effectively the uncertainty associated with hydrological processes, making it valuable as a practical tool for synthetic generation of streamflow series. The NN topology and the corresponding analytical explicit formulation of the model are described in detail. The model is calibrated with a series of monthly inflows to two reservoir sites located in the Tagus River basin (Spain, while validation is performed through estimation of a set of statistics that is relevant for water resources systems planning and management. Among others, drought and storage statistics are computed and compared for both the synthetic and historical series. The performance of the NN-based model was compared to that of a standard autoregressive AR(2 model. Results show that NN represents a promising modelling alternative for simulation purposes, with interesting potential in the context of water resources systems management and optimisation. Keywords: neural networks, perceptron multilayer, error backpropagation, hydrological scenario generation, multivariate time-series..

  18. LOMA: A fast method to generate efficient tagged-random primers despite amplification bias of random PCR on pathogens

    Directory of Open Access Journals (Sweden)

    Lee Wah

    2008-09-01

    Full Text Available Abstract Background Pathogen detection using DNA microarrays has the potential to become a fast and comprehensive diagnostics tool. However, since pathogen detection chips currently utilize random primers rather than specific primers for the RT-PCR step, bias inherent in random PCR amplification becomes a serious problem that causes large inaccuracies in hybridization signals. Results In this paper, we study how the efficiency of random PCR amplification affects hybridization signals. We describe a model that predicts the amplification efficiency of a given random primer on a target viral genome. The prediction allows us to filter false-negative probes of the genome that lie in regions of poor random PCR amplification and improves the accuracy of pathogen detection. Subsequently, we propose LOMA, an algorithm to generate random primers that have good amplification efficiency. Wet-lab validation showed that the generated random primers improve the amplification efficiency significantly. Conclusion The blind use of a random primer with attached universal tag (random-tagged primer in a PCR reaction on a pathogen sample may not lead to a successful amplification. Thus, the design of random-tagged primers is an important consideration when performing PCR.

  19. Implementing Value Added Applications in Next Generation Networks

    Directory of Open Access Journals (Sweden)

    Yuan-Kuang Tu

    2010-08-01

    Full Text Available One of the major issues in the future Internet is the integration of telecom networks with the Internet. In many countries, large Internet Service Providers (ISPs are also telecom operators that have been focusing on providing Internet services through their telecom networks with telecom-grade mechanisms. In this article, we show that IP Multimedia Subsystem (IMS is a telecom-grade mechanism that addresses this important issue. In Next Generation Network (NGN, IMS supports IP-based multimedia services that can be accessed from various wireless and wired access technologies through fixed-mobile convergence. We show how to integrate Internet Protocol Television (IPTV with NGN/IMS to offer enhanced IPTV services for subscribers with set-top boxes or mobile phones. We specifically describe the implementations of three services: weather forecasts, short messages on TV screens and TV shopping/food ordering for mobile users. Although these services can be directly implemented in the Internet, our commercial operation experiences indicate that the NGN/IMS implementation has advantages in terms of telecom-grade security, Quality of Service (QoS, and flexible service creation.

  20. An Intelligent Handover Management System for Future Generation Wireless Networks

    Directory of Open Access Journals (Sweden)

    Kassar Meriem

    2008-01-01

    Full Text Available Abstract Future generation wireless networks should provide to mobile users the best connectivity to services anywhere at anytime. The most challenging problem is the seamless intersystem/vertical mobility across heterogeneous wireless networks. In order to answer it, a vertical handover management system is needed. In our paper, we propose an intelligent solution answering user requirements and ensuring service continuity. We focus on a vertical handover decision strategy based on the context-awareness concept. The given strategy chooses the appropriate time and the most suitable access network among those available to perform a handover. It uses advanced decision algorithms (for more efficiency and intelligence and it is governed by handover policies as decision rules (for more flexibility and optimization. To maintain a seamless service continuity, handover execution is based on mobile IP functionalities. We study our decision system in a case of a 3G/UMTS-WLAN scenario and we discuss all the handover decision issues in our solution.

  1. Damage Spreading in Spatial and Small-world Random Boolean Networks

    Energy Technology Data Exchange (ETDEWEB)

    Lu, Qiming [Fermilab; Teuscher, Christof [Portland State U.

    2014-02-18

    The study of the response of complex dynamical social, biological, or technological networks to external perturbations has numerous applications. Random Boolean Networks (RBNs) are commonly used a simple generic model for certain dynamics of complex systems. Traditionally, RBNs are interconnected randomly and without considering any spatial extension and arrangement of the links and nodes. However, most real-world networks are spatially extended and arranged with regular, power-law, small-world, or other non-random connections. Here we explore the RBN network topology between extreme local connections, random small-world, and pure random networks, and study the damage spreading with small perturbations. We find that spatially local connections change the scaling of the relevant component at very low connectivities ($\\bar{K} \\ll 1$) and that the critical connectivity of stability $K_s$ changes compared to random networks. At higher $\\bar{K}$, this scaling remains unchanged. We also show that the relevant component of spatially local networks scales with a power-law as the system size N increases, but with a different exponent for local and small-world networks. The scaling behaviors are obtained by finite-size scaling. We further investigate the wiring cost of the networks. From an engineering perspective, our new findings provide the key design trade-offs between damage spreading (robustness), the network's wiring cost, and the network's communication characteristics.

  2. Generative Recurrent Networks for De Novo Drug Design.

    Science.gov (United States)

    Gupta, Anvita; Müller, Alex T; Huisman, Berend J H; Fuchs, Jens A; Schneider, Petra; Schneider, Gisbert

    2018-01-01

    Generative artificial intelligence models present a fresh approach to chemogenomics and de novo drug design, as they provide researchers with the ability to narrow down their search of the chemical space and focus on regions of interest. We present a method for molecular de novo design that utilizes generative recurrent neural networks (RNN) containing long short-term memory (LSTM) cells. This computational model captured the syntax of molecular representation in terms of SMILES strings with close to perfect accuracy. The learned pattern probabilities can be used for de novo SMILES generation. This molecular design concept eliminates the need for virtual compound library enumeration. By employing transfer learning, we fine-tuned the RNN's predictions for specific molecular targets. This approach enables virtual compound design without requiring secondary or external activity prediction, which could introduce error or unwanted bias. The results obtained advocate this generative RNN-LSTM system for high-impact use cases, such as low-data drug discovery, fragment based molecular design, and hit-to-lead optimization for diverse drug targets. © 2017 The Authors. Published by Wiley-VCH Verlag GmbH & Co. KGaA.

  3. Stability and anomalous entropic elasticity of sub isostatic random-bond networks

    OpenAIRE

    Wigbers, Manon C.; MacKintosh, Fred C.; Dennison, Matthew

    2014-01-01

    We study the elasticity of thermalized spring networks under an applied bulk strain. The networks considered are sub-isostatic random-bond networks that, in the athermal limit, are known to have vanishing bulk and linear shear moduli at zero bulk strain. Above a bulk strain threshold, however, these networks become rigid, although surprisingly the shear modulus remains zero until a second, higher, strain threshold. We find that thermal fluctuations stabilize all networks below the rigidity tr...

  4. Throughput vs. Delay in Lossy Wireless Mesh Networks with Random Linear Network Coding

    DEFF Research Database (Denmark)

    Hundebøll, Martin; Pahlevani, Peyman; Roetter, Daniel Enrique Lucani

    2014-01-01

    This work proposes a new protocol applying on– the–fly random linear network coding in wireless mesh net- works. The protocol provides increased reliability, low delay, and high throughput to the upper layers, while being oblivious to their specific requirements. This seemingly conflicting goals ...... and evaluated in a real test bed with Raspberry Pi devices. We show that order of magnitude gains in throughput over plain TCP are possible with moderate losses and up to two fold improvement in per packet delay in our results....

  5. Algorithm for generation pseudo-random series with arbitrarily assigned distribution law

    Directory of Open Access Journals (Sweden)

    В.С. Єременко

    2005-04-01

    Full Text Available  Method for generation pseudo-random series with arbitrarily assigned distribution law has been proposed. The praxis of using proposed method for generation pseudo-random series with anti-modal and approximate to Gaussian distribution law has been investigated.

  6. Generating Variable and Random Schedules of Reinforcement Using Microsoft Excel Macros

    Science.gov (United States)

    Bancroft, Stacie L; Bourret, Jason C

    2008-01-01

    Variable reinforcement schedules are used to arrange the availability of reinforcement following varying response ratios or intervals of time. Random reinforcement schedules are subtypes of variable reinforcement schedules that can be used to arrange the availability of reinforcement at a constant probability across number of responses or time. Generating schedule values for variable and random reinforcement schedules can be difficult. The present article describes the steps necessary to write macros in Microsoft Excel that will generate variable-ratio, variable-interval, variable-time, random-ratio, random-interval, and random-time reinforcement schedule values. PMID:18595286

  7. High-speed quantum-random number generation by continuous measurement of arrival time of photons.

    Science.gov (United States)

    Yan, Qiurong; Zhao, Baosheng; Hua, Zhang; Liao, Qinghong; Yang, Hao

    2015-07-01

    We demonstrate a novel high speed and multi-bit optical quantum random number generator by continuously measuring arrival time of photons with a common starting point. To obtain the unbiased and post-processing free random bits, the measured photon arrival time is converted into the sum of integral multiple of a fixed period and a phase time. Theoretical and experimental results show that the phase time is an independent and uniform random variable. A random bit extraction method by encoding the phase time is proposed. An experimental setup has been built and the unbiased random bit generation rate could reach 128 Mb/s, with random bit generation efficiency of 8 bits per detected photon. The random numbers passed all tests in the statistical test suite.

  8. Complementary feeding: a Global Network cluster randomized controlled trial

    Directory of Open Access Journals (Sweden)

    Pasha Omrana

    2011-01-01

    Full Text Available Abstract Background Inadequate and inappropriate complementary feeding are major factors contributing to excess morbidity and mortality in young children in low resource settings. Animal source foods in particular are cited as essential to achieve micronutrient requirements. The efficacy of the recommendation for regular meat consumption, however, has not been systematically evaluated. Methods/Design A cluster randomized efficacy trial was designed to test the hypothesis that 12 months of daily intake of beef added as a complementary food would result in greater linear growth velocity than a micronutrient fortified equi-caloric rice-soy cereal supplement. The study is being conducted in 4 sites of the Global Network for Women's and Children's Health Research located in Guatemala, Pakistan, Democratic Republic of the Congo (DRC and Zambia in communities with toddler stunting rates of at least 20%. Five clusters per country were randomized to each of the food arms, with 30 infants in each cluster. The daily meat or cereal supplement was delivered to the home by community coordinators, starting when the infants were 6 months of age and continuing through 18 months. All participating mothers received nutrition education messages to enhance complementary feeding practices delivered by study coordinators and through posters at the local health center. Outcome measures, obtained at 6, 9, 12, and 18 months by a separate assessment team, included anthropometry; dietary variety and diversity scores; biomarkers of iron, zinc and Vitamin B12 status (18 months; neurocognitive development (12 and 18 months; and incidence of infectious morbidity throughout the trial. The trial was supervised by a trial steering committee, and an independent data monitoring committee provided oversight for the safety and conduct of the trial. Discussion Findings from this trial will test the efficacy of daily intake of meat commencing at age 6 months and, if beneficial, will

  9. The investigation of social networks based on multi-component random graphs

    Science.gov (United States)

    Zadorozhnyi, V. N.; Yudin, E. B.

    2018-01-01

    The methods of non-homogeneous random graphs calibration are developed for social networks simulation. The graphs are calibrated by the degree distributions of the vertices and the edges. The mathematical foundation of the methods is formed by the theory of random graphs with the nonlinear preferential attachment rule and the theory of Erdôs-Rényi random graphs. In fact, well-calibrated network graph models and computer experiments with these models would help developers (owners) of the networks to predict their development correctly and to choose effective strategies for controlling network projects.

  10. What's in a name generator? Choosing the right name generators for social network surveys in healthcare quality and safety research.

    Science.gov (United States)

    Burt, Ronald S; Meltzer, David O; Seid, Michael; Borgert, Amy; Chung, Jeanette W; Colletti, Richard B; Dellal, George; Kahn, Stacy A; Kaplan, Heather C; Peterson, Laura E; Margolis, Peter

    2012-12-01

    Interest in the use of social network analysis (SNA) in healthcare research has increased, but there has been little methodological research on how to choose the name generators that are often used to collect primary data on the social connection between individuals for SNA. We sought to determine a minimum set of name generators sufficient to distinguish the social networks of a target population of physicians active in quality improvement (QI). We conducted a pilot survey including 8 name generators in a convenience sample of 25 physicians active in QI to characterize their social networks. We used multidimensional scaling to determine what subset of these name generators was needed to distinguish these social networks. We found that some physicians maintain a social network organized around a specific colleague who performed multiple roles while others maintained highly differentiated networks. We found that a set of 5 of the 8 name generators we used was needed to distinguish the networks of these physicians. Beyond methodology for selecting name generators, our findings suggest that QI networks may require 5 or more generators to elicit valid sets of relevant actors and relations in this target population.

  11. Stability and dynamical properties of material flow systems on random networks

    Science.gov (United States)

    Anand, K.; Galla, T.

    2009-04-01

    The theory of complex networks and of disordered systems is used to study the stability and dynamical properties of a simple model of material flow networks defined on random graphs. In particular we address instabilities that are characteristic of flow networks in economic, ecological and biological systems. Based on results from random matrix theory, we work out the phase diagram of such systems defined on extensively connected random graphs, and study in detail how the choice of control policies and the network structure affects stability. We also present results for more complex topologies of the underlying graph, focussing on finitely connected Erdös-Réyni graphs, Small-World Networks and Barabási-Albert scale-free networks. Results indicate that variability of input-output matrix elements, and random structures of the underlying graph tend to make the system less stable, while fast price dynamics or strong responsiveness to stock accumulation promote stability.

  12. Long-range navigation on complex networks using Lévy random walks

    Science.gov (United States)

    Riascos, A. P.; Mateos, José L.

    2012-11-01

    We introduce a strategy of navigation in undirected networks, including regular, random, and complex networks, that is inspired by Lévy random walks, generalizing previous navigation rules. We obtained exact expressions for the stationary probability distribution, the occupation probability, the mean first passage time, and the average time to reach a node on the network. We found that the long-range navigation using the Lévy random walk strategy, compared with the normal random walk strategy, is more efficient at reducing the time to cover the network. The dynamical effect of using the Lévy walk strategy is to transform a large-world network into a small world. Our exact results provide a general framework that connects two important fields: Lévy navigation strategies and dynamics on complex networks.

  13. Amplified CWDM-based Next Generation Broadband Access Networks

    Science.gov (United States)

    Peiris, Sasanthi Chamarika

    The explosive growth of both fixed and mobile data-centric traffic along with the inevitable trend towards all-IP/Ethernet transport protocols and packet switched networks will ultimately lead to an all-packet-based converged fixed-mobile optical transport network from the core all the way out to the access network. To address the increasing capacity and speed requirements in the access networks, Wavelength-Division Multiplexed (WDM) and/or Coarse WDM (CWDM)-based Passive Optical Networks (PONs) are expected to emerge as the next-generation optical access infrastructures. However, due to several techno-economic hurdles, CWDM-PONs are still considered an expensive solution and have not yet made any significant inroads into the current access area. One of the key technology hurdles is the scalability of the CWDM-based PONs. Passive component optical insertion losses limit the reach of the network or the number of served optical network units (ONUs). In the recent years, optical amplified CWDM approaches have emerged and new designs of optical amplifiers have been proposed and demonstrated. The critical design parameter for these amplifiers is the very wide optical amplification bandwidth (e.g., 340 nm combined for both directions). The objective of this PhD dissertation work is first to engineer ring and tree-ring based PON architectures that can achieve longer unamplified PON reach and/or provide service to a greater number of ONUs and customers. Secondly is to develop new novel optical amplifier schemes to further address the scalability limitation of the CWDM-based PONs. Specifically, this work proposes and develops novel ultra wide-band hybrid Raman-Optical parametric amplifier (HROPA) schemes that operate over nearly the entire specified CWDM band to provide 340 nm bidirectional optical gain bandwidth over the amplified PON's downstream and upstream CWDM wavelength bands (about 170 nm in each direction). The performance of the proposed HROPA schemes is assessed

  14. Generative models of rich clubs in Hebbian neuronal networks and large-scale human brain networks.

    Science.gov (United States)

    Vértes, Petra E; Alexander-Bloch, Aaron; Bullmore, Edward T

    2014-10-05

    Rich clubs arise when nodes that are 'rich' in connections also form an elite, densely connected 'club'. In brain networks, rich clubs incur high physical connection costs but also appear to be especially valuable to brain function. However, little is known about the selection pressures that drive their formation. Here, we take two complementary approaches to this question: firstly we show, using generative modelling, that the emergence of rich clubs in large-scale human brain networks can be driven by an economic trade-off between connection costs and a second, competing topological term. Secondly we show, using simulated neural networks, that Hebbian learning rules also drive the emergence of rich clubs at the microscopic level, and that the prominence of these features increases with learning time. These results suggest that Hebbian learning may provide a neuronal mechanism for the selection of complex features such as rich clubs. The neural networks that we investigate are explicitly Hebbian, and we argue that the topological term in our model of large-scale brain connectivity may represent an analogous connection rule. This putative link between learning and rich clubs is also consistent with predictions that integrative aspects of brain network organization are especially important for adaptive behaviour. © 2014 The Author(s) Published by the Royal Society. All rights reserved.

  15. Latest generation interconnect technologies in APEnet+ networking infrastructure

    Science.gov (United States)

    Ammendola, Roberto; Biagioni, Andrea; Cretaro, Paolo; Frezza, Ottorino; Lo Cicero, Francesca; Lonardo, Alessandro; Martinelli, Michele; Stanislao Paolucci, Pier; Pastorelli, Elena; Rossetti, Davide; Simula, Francesco; Vicini, Piero

    2017-10-01

    In this paper we present the status of the 3rd generation design of the APEnet board (V5) built upon the 28nm Altera Stratix V FPGA; it features a PCIe Gen3 x8 interface and enhanced embedded transceivers with a maximum capability of 12.5Gbps each. The network architecture is designed in accordance to the Remote DMA paradigm. The APEnet+ V5 prototype is built upon the Stratix V DevKit with the addition of a proprietary, third party IP core implementing multi-DMA engines. Support for zero-copy communication is assured by the possibility of DMA-accessing either host and GPU memory, offloading the CPU from the chore of data copying. The current implementation plateaus to a bandwidth for memory read of 4.8GB/s. Here we describe the hardware optimization to the memory write process which relies on the use of two independent DMA engines and an improved TLB.

  16. Efficient Pruning Method for Ensemble Self-Generating Neural Networks

    Directory of Open Access Journals (Sweden)

    Hirotaka Inoue

    2003-12-01

    Full Text Available Recently, multiple classifier systems (MCS have been used for practical applications to improve classification accuracy. Self-generating neural networks (SGNN are one of the suitable base-classifiers for MCS because of their simple setting and fast learning. However, the computation cost of the MCS increases in proportion to the number of SGNN. In this paper, we propose an efficient pruning method for the structure of the SGNN in the MCS. We compare the pruned MCS with two sampling methods. Experiments have been conducted to compare the pruned MCS with an unpruned MCS, the MCS based on C4.5, and k-nearest neighbor method. The results show that the pruned MCS can improve its classification accuracy as well as reducing the computation cost.

  17. Flexible sampling large-scale social networks by self-adjustable random walk

    Science.gov (United States)

    Xu, Xiao-Ke; Zhu, Jonathan J. H.

    2016-12-01

    Online social networks (OSNs) have become an increasingly attractive gold mine for academic and commercial researchers. However, research on OSNs faces a number of difficult challenges. One bottleneck lies in the massive quantity and often unavailability of OSN population data. Sampling perhaps becomes the only feasible solution to the problems. How to draw samples that can represent the underlying OSNs has remained a formidable task because of a number of conceptual and methodological reasons. Especially, most of the empirically-driven studies on network sampling are confined to simulated data or sub-graph data, which are fundamentally different from real and complete-graph OSNs. In the current study, we propose a flexible sampling method, called Self-Adjustable Random Walk (SARW), and test it against with the population data of a real large-scale OSN. We evaluate the strengths of the sampling method in comparison with four prevailing methods, including uniform, breadth-first search (BFS), random walk (RW), and revised RW (i.e., MHRW) sampling. We try to mix both induced-edge and external-edge information of sampled nodes together in the same sampling process. Our results show that the SARW sampling method has been able to generate unbiased samples of OSNs with maximal precision and minimal cost. The study is helpful for the practice of OSN research by providing a highly needed sampling tools, for the methodological development of large-scale network sampling by comparative evaluations of existing sampling methods, and for the theoretical understanding of human networks by highlighting discrepancies and contradictions between existing knowledge/assumptions of large-scale real OSN data.

  18. Evaluating network-level predictors of behavior change among injection networks enrolled in the HPTN 037 randomized controlled trial.

    Science.gov (United States)

    Smith, Laramie R; Strathdee, Steffanie A; Metzger, David; Latkin, Carl

    2017-06-01

    Little is known about ways network-level factors that may influence the adoption of combination prevention behaviors among injection networks, or how network-oriented interventions might moderate this behavior change process. A total of 232 unique injection risk networks in Philadelphia, PA, were randomized to a peer educator network-oriented intervention or standard of care control arm. Network-level aggregates reflecting the injection networks' baseline substance use dynamics, social interactions, and the networks exposure to gender- and structural-related vulnerabilities were calculated and used to predict changes in the proportion of network members adopting safer injection practices at 6-month follow-up. At follow-up, safer injection practices were observed among 46.31% of a network's members on average. In contrast, 25.7% of networks observed no change. Controlling for the effects of the intervention, significant network-level factors influencing network-level behavior change reflected larger sized injection networks (b=2.20, p=0.013) with a greater proportion of members who shared needles (b=0.29, pnetwork's safer injection practices were also observed for networks with fewer new network members (b=-0.31, p=0.008), and for networks whose members were proportionally less likely to have experienced incarceration (b=-0.20, p=0.012) or more likely to have been exposed to drug treatment (b=0.17, p=0.034) in the 6-months prior to baseline. A significant interaction suggested the intervention uniquely facilitated change in safer injection practices among female-only networks (b=-0.32, p=0.046). Network-level factors offer insights into ways injection networks might be leveraged to promote combination prevention efforts. Copyright © 2017 Elsevier B.V. All rights reserved.

  19. Generation and monitoring of a discrete stable random process

    CERN Document Server

    Hopcraft, K I; Matthews, J O

    2002-01-01

    A discrete stochastic process with stationary power law distribution is obtained from a death-multiple immigration population model. Emigrations from the population form a random series of events which are monitored by a counting process with finite-dynamic range and response time. It is shown that the power law behaviour of the population is manifested in the intermittent behaviour of the series of events. (letter to the editor)

  20. Integration of a network aware traffic generation device into a computer network emulation platform

    CSIR Research Space (South Africa)

    Von Solms, S

    2014-07-01

    Full Text Available Flexible, open source network emulation tools can provide network researchers with significant benefits regarding network behaviour and performance. The evaluation of these networks can benefit greatly from the integration of realistic, network...

  1. Scaling of peak flows with constant flow velocity in random self-similar networks

    Directory of Open Access Journals (Sweden)

    R. Mantilla

    2011-07-01

    Full Text Available A methodology is presented to understand the role of the statistical self-similar topology of real river networks on scaling, or power law, in peak flows for rainfall-runoff events. We created Monte Carlo generated sets of ensembles of 1000 random self-similar networks (RSNs with geometrically distributed interior and exterior generators having parameters pi and pe, respectively. The parameter values were chosen to replicate the observed topology of real river networks. We calculated flow hydrographs in each of these networks by numerically solving the link-based mass and momentum conservation equation under the assumption of constant flow velocity. From these simulated RSNs and hydrographs, the scaling exponents β and φ characterizing power laws with respect to drainage area, and corresponding to the width functions and flow hydrographs respectively, were estimated. We found that, in general, φ > β, which supports a similar finding first reported for simulations in the river network of the Walnut Gulch basin, Arizona. Theoretical estimation of β and φ in RSNs is a complex open problem. Therefore, using results for a simpler problem associated with the expected width function and expected hydrograph for an ensemble of RSNs, we give heuristic arguments for theoretical derivations of the scaling exponents β(E and φ(E that depend on the Horton ratios for stream lengths and areas. These ratios in turn have a known dependence on the parameters of the geometric distributions of RSN generators. Good agreement was found between the analytically conjectured values of β(E and φ(E and the values estimated by the simulated ensembles of RSNs and hydrographs. The independence of the scaling exponents φ(E and φ with respect to the value of flow velocity and runoff intensity implies an interesting connection between unit

  2. Analisis SIM Card Cloning Terhadap Algoritma Random Number Generator

    OpenAIRE

    Anwar, Nuril; Riadi, Imam; Luthfi, Ahmad

    2016-01-01

    . Crime in telecommunication sector has increased prevalently, especially with the use of mobile phone which is detrimental both for customers and the providers. In the GSM security system, several weaknesses are found concerning data security outside the network. SIM card clone is part of the security problem in which the data can be transferred to SIM card cloning media. SIM card cloning research can be presented in the form of SRES analysis algorithms A3 and A8 RAND to get Ki Auc for furth...

  3. RADB: Random Access with Differentiated Barring for Latency-Constrained Applications in NB-IoT Network

    OpenAIRE

    Miao, Yiming; Tian, Yuanwen; Cheng, Jingjing; Hossain, M. Shamim; Ghoneim, Ahmed

    2018-01-01

    With the development of LPWA (Low Power Wide Area) technology, the emerging NB-IoT (Narrowband Internet of Things) technology is becoming popular with wide area and low-data-rate services. In order to achieve objectives such as huge amount of connection and wide area coverage within NB-IoT, the problem of network congestion generated by random access of numerous devices should be solved. In this paper, we first introduce the background of NB-IoT and investigate the research on random access o...

  4. Optimizing Low Speed VoIP Network for Rural Next Generation Network (R-NGN

    Directory of Open Access Journals (Sweden)

    Yoanes Bandung

    2007-11-01

    Full Text Available In this research, we propose an optimization method based-on E-Model for designing an efficient low speed VoIP network for Rural Next Generation Network (R-NGN. We are choosing 128 kbps and 256 kbps bandwidth as the typical community link to be used in the designing of R-NGN infrastructure. The method is based on selection of some VoIP network parameters such as voice coder, communication protocol, packet loss level, network utilization and resource allocation. We draw analytic approach for achieving rating value (R of E-model that represent level of quality of service. In this approach, we focus on delay and packet loss calculation to find the rating value. We state the rating value = 70 as minimum level of quality of service for each call, equivalent to 3.6 of Mean Opinion Score (MOS. In our experiments, either G.723.1 5.3 kbps or G.729 is chosen for maximizing the number of VoIP calls, it depends on link utilization and level of packet loss.

  5. Intelligent Joint Admission Control for Next Generation Wireless Networks

    OpenAIRE

    Abdulqader M. Mohsen; Al-Akwaa, Fadhl M.; Mohammed M. Alkhawlani

    2012-01-01

    The Heterogeneous Wireless Network (HWN) integrates different wireless networks into one common network. The integrated networks often overlap coverage in the same wireless service areas, leading to the availability of a great variety of innovative services based on user demands in a cost-efficient manner. Joint Admission Control (JAC) handles all new or handoff service requests in the HWN. It checks whether the incoming service request to the selected Radio Access Network (RAN) by the initia...

  6. Recommendations and illustrations for the evaluation of photonic random number generators

    Science.gov (United States)

    Hart, Joseph D.; Terashima, Yuta; Uchida, Atsushi; Baumgartner, Gerald B.; Murphy, Thomas E.; Roy, Rajarshi

    2017-09-01

    The never-ending quest to improve the security of digital information combined with recent improvements in hardware technology has caused the field of random number generation to undergo a fundamental shift from relying solely on pseudo-random algorithms to employing optical entropy sources. Despite these significant advances on the hardware side, commonly used statistical measures and evaluation practices remain ill-suited to understand or quantify the optical entropy that underlies physical random number generation. We review the state of the art in the evaluation of optical random number generation and recommend a new paradigm: quantifying entropy generation and understanding the physical limits of the optical sources of randomness. In order to do this, we advocate for the separation of the physical entropy source from deterministic post-processing in the evaluation of random number generators and for the explicit consideration of the impact of the measurement and digitization process on the rate of entropy production. We present the Cohen-Procaccia estimate of the entropy rate h (𝜖 ,τ ) as one way to do this. In order to provide an illustration of our recommendations, we apply the Cohen-Procaccia estimate as well as the entropy estimates from the new NIST draft standards for physical random number generators to evaluate and compare three common optical entropy sources: single photon time-of-arrival detection, chaotic lasers, and amplified spontaneous emission.

  7. Network Location-Aware Service Recommendation with Random Walk in Cyber-Physical Systems.

    Science.gov (United States)

    Yin, Yuyu; Yu, Fangzheng; Xu, Yueshen; Yu, Lifeng; Mu, Jinglong

    2017-09-08

    Cyber-physical systems (CPS) have received much attention from both academia and industry. An increasing number of functions in CPS are provided in the way of services, which gives rise to an urgent task, that is, how to recommend the suitable services in a huge number of available services in CPS. In traditional service recommendation, collaborative filtering (CF) has been studied in academia, and used in industry. However, there exist several defects that limit the application of CF-based methods in CPS. One is that under the case of high data sparsity, CF-based methods are likely to generate inaccurate prediction results. In this paper, we discover that mining the potential similarity relations among users or services in CPS is really helpful to improve the prediction accuracy. Besides, most of traditional CF-based methods are only capable of using the service invocation records, but ignore the context information, such as network location, which is a typical context in CPS. In this paper, we propose a novel service recommendation method for CPS, which utilizes network location as context information and contains three prediction models using random walking. We conduct sufficient experiments on two real-world datasets, and the results demonstrate the effectiveness of our proposed methods and verify that the network location is indeed useful in QoS prediction.

  8. On random field Completely Automated Public Turing Test to Tell Computers and Humans Apart generation.

    Science.gov (United States)

    Kouritzin, Michael A; Newton, Fraser; Wu, Biao

    2013-04-01

    Herein, we propose generating CAPTCHAs through random field simulation and give a novel, effective and efficient algorithm to do so. Indeed, we demonstrate that sufficient information about word tests for easy human recognition is contained in the site marginal probabilities and the site-to-nearby-site covariances and that these quantities can be embedded directly into certain conditional probabilities, designed for effective simulation. The CAPTCHAs are then partial random realizations of the random CAPTCHA word. We start with an initial random field (e.g., randomly scattered letter pieces) and use Gibbs resampling to re-simulate portions of the field repeatedly using these conditional probabilities until the word becomes human-readable. The residual randomness from the initial random field together with the random implementation of the CAPTCHA word provide significant resistance to attack. This results in a CAPTCHA, which is unrecognizable to modern optical character recognition but is recognized about 95% of the time in a human readability study.

  9. New generation cellular networks requirements investigation and their deployment in Ukraine possibilities

    OpenAIRE

    Одарченко, Р. С.; Національний авіаційний університет; Абакумова, А. О.; Національний авіаційний університет; Дика, Н. В.; Національний авіаційний університет

    2016-01-01

    This paper analyzes the main requirements for next generation mobile networks, in particular, wasconsidered a fundamentally new concept of building cellular networks - 5G, principles of their design.Conducted a detailed analysis of this generation of cellular networks. Also in this paper the analysisof development of cellular networks and the prospects for the introduction of new technologies inUkraine. There are forward-looking assumptions about stages of standardization and deployment ofcel...

  10. End-to-End Architecture Modularisation and Slicing for Next Generation Networks

    OpenAIRE

    An, Xueli; Trivisonno, Riccardo; Einsiedler, Hans; von Hugo, Dirk; Haensge, Kay; Huang, Xiaofeng; Shen, Qing; Corujo, Daniel; Mahmood, Kashif; Trossen, Dirk; Liebsch, Marco; Leitao, Filipe; Phan, Cao-Thanh; Klamm, Frederic

    2016-01-01

    The journey towards the deployment of next generation networks has recently accelerated, driven by the joint effort of research and standards organisations. Despite this fact, the overall picture is still unclear as prioritization and understanding on several key concepts are not yet agreed by major vendors and network providers. Network Slicing is one of the central topics of the debate, and it is expected to become the key feature of next generation networks, providing the flexibility requi...

  11. Lightweight PUF-based Key and Random Number Generation

    OpenAIRE

    Van Herrewege, Anthony

    2015-01-01

    As embedded electronics continue to be integrated into our daily lives at such a pace that there are nowadays more cellphones than people on the planet, security is becoming ever more crucial. Unfortunately, this is all too often realized as an afterthought and thus the security implementations in many embedded devices offer little to no practical protection. Security does not require only cryptographic algorithms; two other critical modules in a secure system are a key generation module and ...

  12. A Comparison of Three Random Number Generators for Aircraft Dynamic Modeling Applications

    Science.gov (United States)

    Grauer, Jared A.

    2017-01-01

    Three random number generators, which produce Gaussian white noise sequences, were compared to assess their suitability in aircraft dynamic modeling applications. The first generator considered was the MATLAB (registered) implementation of the Mersenne-Twister algorithm. The second generator was a website called Random.org, which processes atmospheric noise measured using radios to create the random numbers. The third generator was based on synthesis of the Fourier series, where the random number sequences are constructed from prescribed amplitude and phase spectra. A total of 200 sequences, each having 601 random numbers, for each generator were collected and analyzed in terms of the mean, variance, normality, autocorrelation, and power spectral density. These sequences were then applied to two problems in aircraft dynamic modeling, namely estimating stability and control derivatives from simulated onboard sensor data, and simulating flight in atmospheric turbulence. In general, each random number generator had good performance and is well-suited for aircraft dynamic modeling applications. Specific strengths and weaknesses of each generator are discussed. For Monte Carlo simulation, the Fourier synthesis method is recommended because it most accurately and consistently approximated Gaussian white noise and can be implemented with reasonable computational effort.

  13. Doing Better by Getting Worse: Posthypnotic Amnesia Improves Random Number Generation

    Science.gov (United States)

    Terhune, Devin Blair; Brugger, Peter

    2011-01-01

    Although forgetting is often regarded as a deficit that we need to control to optimize cognitive functioning, it can have beneficial effects in a number of contexts. We examined whether disrupting memory for previous numerical responses would attenuate repetition avoidance (the tendency to avoid repeating the same number) during random number generation and thereby improve the randomness of responses. Low suggestible and low dissociative and high dissociative highly suggestible individuals completed a random number generation task in a control condition, following a posthypnotic amnesia suggestion to forget previous numerical responses, and in a second control condition following the cancellation of the suggestion. High dissociative highly suggestible participants displayed a selective increase in repetitions during posthypnotic amnesia, with equivalent repetition frequency to a random system, whereas the other two groups exhibited repetition avoidance across conditions. Our results demonstrate that temporarily disrupting memory for previous numerical responses improves random number generation. PMID:22195022

  14. Doing better by getting worse: posthypnotic amnesia improves random number generation.

    Directory of Open Access Journals (Sweden)

    Devin Blair Terhune

    Full Text Available Although forgetting is often regarded as a deficit that we need to control to optimize cognitive functioning, it can have beneficial effects in a number of contexts. We examined whether disrupting memory for previous numerical responses would attenuate repetition avoidance (the tendency to avoid repeating the same number during random number generation and thereby improve the randomness of responses. Low suggestible and low dissociative and high dissociative highly suggestible individuals completed a random number generation task in a control condition, following a posthypnotic amnesia suggestion to forget previous numerical responses, and in a second control condition following the cancellation of the suggestion. High dissociative highly suggestible participants displayed a selective increase in repetitions during posthypnotic amnesia, with equivalent repetition frequency to a random system, whereas the other two groups exhibited repetition avoidance across conditions. Our results demonstrate that temporarily disrupting memory for previous numerical responses improves random number generation.

  15. TopoGen: A Network Topology Generation Architecture with application to automating simulations of Software Defined Networks

    CERN Document Server

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

  16. TopoGen: A Network Topology Generation Architecture with application to automating simulations of Software Defined Networks

    CERN Document Server

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

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

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

  19. Column Generation for Transmission Switching of Electricity Networks with Unit Commitment

    OpenAIRE

    Villumsen, Jonas Christoffer; Philpott, Andy B.

    2011-01-01

    This paper presents the problem of finding the minimum cost dispatch and commitment of power generation units in a transmission network with active switching.We use the term active switching to denote the use of switches to optimize network topology in an operational context. We propose a Dantzig-Wolfe reformulation and a novel column generation framework to solve the problem efficiently. Preliminary results are presented for the IEEE-118 bus network with 19 generator units. Active switching ...

  20. High-speed true random number generation based on paired memristors for security electronics

    Science.gov (United States)

    Zhang, Teng; Yin, Minghui; Xu, Changmin; Lu, Xiayan; Sun, Xinhao; Yang, Yuchao; Huang, Ru

    2017-11-01

    True random number generator (TRNG) is a critical component in hardware security that is increasingly important in the era of mobile computing and internet of things. Here we demonstrate a TRNG using intrinsic variation of memristors as a natural source of entropy that is otherwise undesirable in most applications. The random bits were produced by cyclically switching a pair of tantalum oxide based memristors and comparing their resistance values in the off state, taking advantage of the more pronounced resistance variation compared with that in the on state. Using an alternating read scheme in the designed TRNG circuit, the unbiasedness of the random numbers was significantly improved, and the bitstream passed standard randomness tests. The Pt/TaO x /Ta memristors fabricated in this work have fast programming/erasing speeds of ∼30 ns, suggesting a high random number throughput. The approach proposed here thus holds great promise for physically-implemented random number generation.

  1. Note: A 10 Gbps real-time post-processing free physical random number generator chip

    Science.gov (United States)

    Qian, Yi; Liang, Futian; Wang, Xinzhe; Li, Feng; Chen, Lian; Jin, Ge

    2017-09-01

    A random number generator with high data rate, small size, and low power consumption is essential for a certain quantum key distribution (QKD) system. We designed a 10 Gbps random number generator ASIC, TRNG2016, for the QKD system. With a 6 mm × 6 mm QFN48 package, TRNG2016 has 10 independent physical random number generation channels, and each channel can work at a fixed frequency up to 1 Gbps. The random number generated by TRNG2016 can pass the NIST statistical tests without any post-processing. With 3.3 V IO power supply and 1.2 V core power supply, the typical power consumption of TRNG2016 is 773 mW with 10 channels on and running at 1 Gbps data rate.

  2. Note: Fully integrated 3.2 Gbps quantum random number generator with real-time extraction

    Energy Technology Data Exchange (ETDEWEB)

    Zhang, Xiao-Guang; Nie, You-Qi; Liang, Hao; Zhang, Jun, E-mail: zhangjun@ustc.edu.cn; Pan, Jian-Wei [Hefei National Laboratory for Physical Sciences at the Microscale and Department of Modern Physics, University of Science and Technology of China, Hefei, Anhui 230026 (China); CAS Center for Excellence and Synergetic Innovation Center in Quantum Information and Quantum Physics, University of Science and Technology of China, Hefei, Anhui 230026 (China); Zhou, Hongyi; Ma, Xiongfeng [Center for Quantum Information, Institute for Interdisciplinary Information Sciences, Tsinghua University, Beijing 100084 (China)

    2016-07-15

    We present a real-time and fully integrated quantum random number generator (QRNG) by measuring laser phase fluctuations. The QRNG scheme based on laser phase fluctuations is featured for its capability of generating ultra-high-speed random numbers. However, the speed bottleneck of a practical QRNG lies on the limited speed of randomness extraction. To close the gap between the fast randomness generation and the slow post-processing, we propose a pipeline extraction algorithm based on Toeplitz matrix hashing and implement it in a high-speed field-programmable gate array. Further, all the QRNG components are integrated into a module, including a compact and actively stabilized interferometer, high-speed data acquisition, and real-time data post-processing and transmission. The final generation rate of the QRNG module with real-time extraction can reach 3.2 Gbps.

  3. GESTODIFFERENT: a Cytoscape plugin for the generation and the identification of gene regulatory networks describing a stochastic cell differentiation process.

    Science.gov (United States)

    Antoniotti, Marco; Bader, Gary D; Caravagna, Giulio; Crippa, Silvia; Graudenzi, Alex; Mauri, Giancarlo

    2013-02-15

    The characterization of the complex phenomenon of cell differentiation is a key goal of both systems and computational biology. GeStoDifferent is a Cytoscape plugin aimed at the generation and the identification of gene regulatory networks (GRNs) describing an arbitrary stochastic cell differentiation process. The (dynamical) model adopted to describe general GRNs is that of noisy random Boolean networks (NRBNs), with a specific focus on their emergent dynamical behavior. GeStoDifferent explores the space of GRNs by filtering the NRBN instances inconsistent with a stochastic lineage differentiation tree representing the cell lineages that can be obtained by following the fate of a stem cell descendant. Matched networks can then be analyzed by Cytoscape network analysis algorithms or, for instance, used to define (multiscale) models of cellular dynamics. Freely available at http://bimib.disco.unimib.it/index.php/Retronet#GESTODifferent or at the Cytoscape App Store http://apps.cytoscape.org/.

  4. Investigation of a generator system for generating electrical power, to supply directly to the public network, using a windmill

    Science.gov (United States)

    Tromp, C.

    1979-01-01

    A windpowered generator system is described which uses a windmill to convert mechanical energy to electrical energy for a three phase (network) voltage of constant amplitude and frequency. The generator system controls the windmill by the number of revolutions so that the power drawn from the wind for a given wind velocity is maximum. A generator revolution which is proportional to wind velocity is achieved. The stator of the generator is linked directly to the network and a feed converter at the rotor takes care of constant voltage and frequency at the stator.

  5. A NEURAL OSCILLATOR-NETWORK MODEL OF TEMPORAL PATTERN GENERATION

    NARCIS (Netherlands)

    Schomaker, Lambert

    Most contemporary neural network models deal with essentially static, perceptual problems of classification and transformation. Models such as multi-layer feedforward perceptrons generally do not incorporate time as an essential dimension, whereas biological neural networks are inherently temporal

  6. Challenges in Second-Generation Wireless Mesh Networks

    Directory of Open Access Journals (Sweden)

    Pescapé Antonio

    2008-01-01

    Full Text Available Wireless mesh networks have the potential to provide ubiquitous high-speed Internet access at low costs. The good news is that initial deployments of WiFi meshes show the feasibility of providing ubiquitous Internet connectivity. However, their performance is far below the necessary and achievable limit. Moreover, users' subscription in the existing meshes is dismal even though the technical challenges to get connectivity are low. This paper provides an overview of the current status of mesh networks' deployment, and highlights the technical, economical, and social challenges that need to be addressed in the next years. As a proof-of-principle study, we discuss the above-mentioned challenges with reference to three real networks: (i MagNets, an operator-driven planned two-tier mesh network; (ii Berlin Freifunk network as a pure community-driven single-tier network; (iii Weimar Freifunk network, also a community-driven but two-tier network.

  7. Financial Time Series Prediction Using Elman Recurrent Random Neural Networks

    Science.gov (United States)

    Wang, Jie; Wang, Jun; Fang, Wen; Niu, Hongli

    2016-01-01

    In recent years, financial market dynamics forecasting has been a focus of economic research. To predict the price indices of stock markets, we developed an architecture which combined Elman recurrent neural networks with stochastic time effective function. By analyzing the proposed model with the linear regression, complexity invariant distance (CID), and multiscale CID (MCID) analysis methods and taking the model compared with different models such as the backpropagation neural network (BPNN), the stochastic time effective neural network (STNN), and the Elman recurrent neural network (ERNN), the empirical results show that the proposed neural network displays the best performance among these neural networks in financial time series forecasting. Further, the empirical research is performed in testing the predictive effects of SSE, TWSE, KOSPI, and Nikkei225 with the established model, and the corresponding statistical comparisons of the above market indices are also exhibited. The experimental results show that this approach gives good performance in predicting the values from the stock market indices. PMID:27293423

  8. Mission-Aware Medium Access Control in Random Access Networks

    OpenAIRE

    Park, Jaeok; Van Der Schaar, Mihaela

    2009-01-01

    We study mission-critical networking in wireless communication networks, where network users are subject to critical events such as emergencies and crises. If a critical event occurs to a user, the user needs to send necessary information for help as early as possible. However, most existing medium access control (MAC) protocols are not adequate to meet the urgent need for information transmission by users in a critical situation. In this paer, we propose a novel class of MAC protocols that u...

  9. Optimized Energy Procurement for Cellular Networks with Uncertain Renewable Energy Generation

    KAUST Repository

    Rached, Nadhir B.

    2017-02-07

    Renewable energy (RE) is an emerging solution for reducing carbon dioxide (CO2) emissions from cellular networks. One of the challenges of using RE sources is to handle its inherent uncertainty. In this paper, a RE powered cellular network is investigated. For a one-day operation cycle, the cellular network aims to reduce energy procurement costs from the smart grid by optimizing the amounts of energy procured from their locally deployed RE sources as well as from the smart grid. In addition to that, it aims to determine the extra amount of energy to be sold to the electrical grid at each time period. Chance constrained optimization is first proposed to deal with the randomness in the RE generation. Then, to make the optimization problem tractable, two well- know convex approximation methods, namely; Chernoff and Chebyshev based-approaches, are analyzed in details. Numerical results investigate the optimized energy procurement for various daily scenarios and compare between the performances of the employed convex approximation approaches.

  10. Heterogeneous next-generation wireless network interference model-and its applications

    KAUST Repository

    Mahmood, Nurul Huda

    2014-04-01

    Next-generation wireless systems facilitating better utilisation of the scarce radio spectrum have emerged as a response to inefficient and rigid spectrum assignment policies. These are comprised of intelligent radio nodes that opportunistically operate in the radio spectrum of existing primary systems, yet unwanted interference at the primary receivers is unavoidable. In order to design efficient next-generation systems and to minimise the adverse effect of their interference, it is necessary to realise how the resulting interference impacts the performance of the primary systems. In this work, a generalised framework for the interference analysis of such a next-generation system is presented where the nextgeneration transmitters may transmit randomly with different transmit powers. The analysis is built around a model developed for the statistical representation of the interference at the primary receivers, which is then used to evaluate various performance measures of the primary system. Applications of the derived interference model in designing the next-generation network system parameters are also demonstrated. Such approach provides a unified and generalised framework, the use of which allows a wide range of performance metrics can be evaluated. Findings of the analytical performance analyses are confirmed through extensive computer-based Monte-Carlo simulations. © 2012 John Wiley & Sons, Ltd.

  11. Ab initio Algorithmic Causal Deconvolution of Intertwined Programs and Networks by Generative Mechanism

    KAUST Repository

    Zenil, Hector

    2018-02-18

    To extract and learn representations leading to generative mechanisms from data, especially without making arbitrary decisions and biased assumptions, is a central challenge in most areas of scientific research particularly in connection to current major limitations of influential topics and methods of machine and deep learning as they have often lost sight of the model component. Complex data is usually produced by interacting sources with different mechanisms. Here we introduce a parameter-free model-based approach, based upon the seminal concept of Algorithmic Probability, that decomposes an observation and signal into its most likely algorithmic generative mechanisms. Our methods use a causal calculus to infer model representations. We demonstrate the method ability to distinguish interacting mechanisms and deconvolve them, regardless of whether the objects produce strings, space-time evolution diagrams, images or networks. We numerically test and evaluate our method and find that it can disentangle observations from discrete dynamic systems, random and complex networks. We think that these causal inference techniques can contribute as key pieces of information for estimations of probability distributions complementing other more statistical-oriented techniques that otherwise lack model inference capabilities.

  12. Electrospun dye-doped fiber networks: lasing emission from randomly distributed cavities

    DEFF Research Database (Denmark)

    Krammer, Sarah; Vannahme, Christoph; Smith, Cameron

    2015-01-01

    Dye-doped polymer fiber networks fabricated with electrospinning exhibit comb-like laser emission. We identify randomly distributed ring resonators being responsible for lasing emission by making use of spatially resolved spectroscopy. Numerical simulations confirm this result quantitatively....

  13. An automatic method to generate domain-specific investigator networks using PubMed abstracts

    Directory of Open Access Journals (Sweden)

    Gwinn Marta

    2007-06-01

    Full Text Available Abstract Background Collaboration among investigators has become critical to scientific research. This includes ad hoc collaboration established through personal contacts as well as formal consortia established by funding agencies. Continued growth in online resources for scientific research and communication has promoted the development of highly networked research communities. Extending these networks globally requires identifying additional investigators in a given domain, profiling their research interests, and collecting current contact information. We present a novel strategy for building investigator networks dynamically and producing detailed investigator profiles using data available in PubMed abstracts. Results We developed a novel strategy to obtain detailed investigator information by automatically parsing the affiliation string in PubMed records. We illustrated the results by using a published literature database in human genome epidemiology (HuGE Pub Lit as a test case. Our parsing strategy extracted country information from 92.1% of the affiliation strings in a random sample of PubMed records and in 97.0% of HuGE records, with accuracies of 94.0% and 91.0%, respectively. Institution information was parsed from 91.3% of the general PubMed records (accuracy 86.8% and from 94.2% of HuGE PubMed records (accuracy 87.0. We demonstrated the application of our approach to dynamic creation of investigator networks by creating a prototype information system containing a large database of PubMed abstracts relevant to human genome epidemiology (HuGE Pub Lit, indexed using PubMed medical subject headings converted to Unified Medical Language System concepts. Our method was able to identify 70–90% of the investigators/collaborators in three different human genetics fields; it also successfully identified 9 of 10 genetics investigators within the PREBIC network, an existing preterm birth research network. Conclusion We successfully created a

  14. Optogenetic stimulation effectively enhances intrinsically generated network synchrony

    Directory of Open Access Journals (Sweden)

    Ahmed eEl Hady

    2013-10-01

    Full Text Available Synchronized bursting is found in many brain areas and has also been implicated in the pathophysiology of neuropsychiatric disorders such as epilepsy, Parkinson’s disease and schizophrenia. Despite extensive studies of network burst synchronization, it is insufficiently understood how this type of network wide synchronization can be strengthened, reduced or even abolished. We combined electrical recording using multi-electrode array with optical stimulation of cultured channelrhodopsin-2 transducted hippocampal neurons to study and manipulate network burst synchronization. We found low frequency photo-stimulation protocols that are sufficient to induce potentiation of network bursting, modifying bursting dynamics and increasing interneuronal synchronization. Surprisingly, slowly fading-in light stimulation, which substantially delayed and reduced light driven spiking, was at least as effective in reorganizing network dynamics as much stronger pulsed light stimulation. Our study shows that mild stimulation protocols that do not enforce particular activity patterns onto the network can be highly effective inducers of network-level plasticity.

  15. Quantum random number generator based on quantum nature of vacuum fluctuations

    Science.gov (United States)

    Ivanova, A. E.; Chivilikhin, S. A.; Gleim, A. V.

    2017-11-01

    Quantum random number generator (QRNG) allows obtaining true random bit sequences. In QRNG based on quantum nature of vacuum, optical beam splitter with two inputs and two outputs is normally used. We compare mathematical descriptions of spatial beam splitter and fiber Y-splitter in the quantum model for QRNG, based on homodyne detection. These descriptions were identical, that allows to use fiber Y-splitters in practical QRNG schemes, simplifying the setup. Also we receive relations between the input radiation and the resulting differential current in homodyne detector. We experimentally demonstrate possibility of true random bits generation by using QRNG based on homodyne detection with Y-splitter.

  16. Modal generation of the design parameters of an elastic spacecraft by the random search method

    Science.gov (United States)

    Titov, B. A.

    A method for the modal generation of the dynamic properties of an elastic spacecraft is proposed which is based on algorithms of random search in the space of design parameters. A practical implementation of this approach is illustrated by an example. It is shown that the modal parameter generation procedure based on the random search solves the problem of parameter selection. However, as in any other method, the accuracy of the computation of matrix elements is largely determined by the initial set of permissible values and the number of random samples in determining the subgradient of the objective function.

  17. Completely random measures for modelling block-structured sparse networks

    DEFF Research Database (Denmark)

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

    2016-01-01

    Many statistical methods for network data parameterize the edge-probability by attributing latent traits to the vertices such as block structure and assume exchangeability in the sense of the Aldous-Hoover representation theorem. Empirical studies of networks indicate that many real-world networks...... [2014] proposed the use of a different notion of exchangeability due to Kallenberg [2006] and obtained a network model which admits power-law behaviour while retaining desirable statistical properties, however this model does not capture latent vertex traits such as block-structure. In this work we re......-introduce the use of block-structure for network models obeying allenberg’s notion of exchangeability and thereby obtain a model which admits the inference of block-structure and edge inhomogeneity. We derive a simple expression for the likelihood and an efficient sampling method. The obtained model...

  18. Effective trapping of random walkers in complex networks.

    Science.gov (United States)

    Hwang, S; Lee, D-S; Kahng, B

    2012-04-01

    Exploring the World Wide Web has become one of the key issues in information science, specifically in view of its application to the PageRank-like algorithms used in search engines. The random walk approach has been employed to study such a problem. The probability of return to the origin (RTO) of random walks is inversely related to how information can be accessed during random surfing. We find analytically that the RTO probability for a given starting node shows a crossover from a slow to a fast decay behavior with time and the crossover time increases with the degree of the starting node. We remark that the RTO probability becomes almost constant in the early-time regime as the degree exponent approaches two. This result indicates that a random surfer can be effectively trapped at the hub and supports the necessity of the random jump strategy empirically used in the Google's search engine.

  19. On the design of henon and logistic map-based random number generator

    Science.gov (United States)

    Magfirawaty; Suryadi, M. T.; Ramli, Kalamullah

    2017-10-01

    The key sequence is one of the main elements in the cryptosystem. True Random Number Generators (TRNG) method is one of the approaches to generating the key sequence. The randomness source of the TRNG divided into three main groups, i.e. electrical noise based, jitter based and chaos based. The chaos based utilizes a non-linear dynamic system (continuous time or discrete time) as an entropy source. In this study, a new design of TRNG based on discrete time chaotic system is proposed, which is then simulated in LabVIEW. The principle of the design consists of combining 2D and 1D chaotic systems. A mathematical model is implemented for numerical simulations. We used comparator process as a harvester method to obtain the series of random bits. Without any post processing, the proposed design generated random bit sequence with high entropy value and passed all NIST 800.22 statistical tests.

  20. 640-Gbit/s fast physical random number generation using a broadband chaotic semiconductor laser

    Science.gov (United States)

    Zhang, Limeng; Pan, Biwei; Chen, Guangcan; Guo, Lu; Lu, Dan; Zhao, Lingjuan; Wang, Wei

    2017-04-01

    An ultra-fast physical random number generator is demonstrated utilizing a photonic integrated device based broadband chaotic source with a simple post data processing method. The compact chaotic source is implemented by using a monolithic integrated dual-mode amplified feedback laser (AFL) with self-injection, where a robust chaotic signal with RF frequency coverage of above 50 GHz and flatness of ±3.6 dB is generated. By using 4-least significant bits (LSBs) retaining from the 8-bit digitization of the chaotic waveform, random sequences with a bit-rate up to 640 Gbit/s (160 GS/s × 4 bits) are realized. The generated random bits have passed each of the fifteen NIST statistics tests (NIST SP800-22), indicating its randomness for practical applications.

  1. Pseudo-Random Number Generators for Vector Processors and Multicore Processors

    DEFF Research Database (Denmark)

    Fog, Agner

    2015-01-01

    Large scale Monte Carlo applications need a good pseudo-random number generator capable of utilizing both the vector processing capabilities and multiprocessing capabilities of modern computers in order to get the maximum performance. The requirements for such a generator are discussed. New ways ...

  2. Delay line length selection in generating fast random numbers with a chaotic laser.

    Science.gov (United States)

    Zhang, Jianzhong; Wang, Yuncai; Xue, Lugang; Hou, Jiayin; Zhang, Beibei; Wang, Anbang; Zhang, Mingjiang

    2012-04-10

    The chaotic light signals generated by an external cavity semiconductor laser have been experimentally demonstrated to extract fast random numbers. However, the photon round-trip time in the external cavity can cause the occurrence of the periodicity in random sequences. To overcome it, the exclusive-or operation on corresponding random bits in samples of the chaotic signal and its time-delay signal from a chaotic laser is required. In this scheme, the proper selection of delay length is a key issue. By doing a large number of experiments and theoretically analyzing the interplay between the Runs test and the threshold value of the autocorrelation function, we find when the corresponding delay time of autocorrelation trace with the correlation coefficient of less than 0.007 is considered as the delay time between the chaotic signal and its time-delay signal, streams of random numbers can be generated with verified randomness.

  3. Throughput Analysis of Fading Sensor Networks with Regular and Random Topologies

    Directory of Open Access Journals (Sweden)

    Liu Xiaowen

    2005-01-01

    Full Text Available We present closed-form expressions of the average link throughput for sensor networks with a slotted ALOHA MAC protocol in Rayleigh fading channels. We compare networks with three regular topologies in terms of throughput, transmit efficiency, and transport capacity. In particular, for square lattice networks, we present a sensitivity analysis of the maximum throughput and the optimum transmit probability with respect to the signal-to-interference ratio threshold. For random networks with nodes distributed according to a two-dimensional Poisson point process, the average throughput is analytically characterized and numerically evaluated. It turns out that although regular networks have an only slightly higher average link throughput than random networks for the same link distance, regular topologies have a significant benefit when the end-to-end throughput in multihop connections is considered.

  4. The Hidden Flow Structure and Metric Space of Network Embedding Algorithms Based on Random Walks.

    Science.gov (United States)

    Gu, Weiwei; Gong, Li; Lou, Xiaodan; Zhang, Jiang

    2017-10-13

    Network embedding which encodes all vertices in a network as a set of numerical vectors in accordance with it's local and global structures, has drawn widespread attention. Network embedding not only learns significant features of a network, such as the clustering and linking prediction but also learns the latent vector representation of the nodes which provides theoretical support for a variety of applications, such as visualization, link prediction, node classification, and recommendation. As the latest progress of the research, several algorithms based on random walks have been devised. Although those algorithms have drawn much attention for their high scores in learning efficiency and accuracy, there is still a lack of theoretical explanation, and the transparency of those algorithms has been doubted. Here, we propose an approach based on the open-flow network model to reveal the underlying flow structure and its hidden metric space of different random walk strategies on networks. We show that the essence of embedding based on random walks is the latent metric structure defined on the open-flow network. This not only deepens our understanding of random- walk-based embedding algorithms but also helps in finding new potential applications in network embedding.

  5. Neural network based adaptive control of nonlinear plants using random search optimization algorithms

    Science.gov (United States)

    Boussalis, Dhemetrios; Wang, Shyh J.

    1992-01-01

    This paper presents a method for utilizing artificial neural networks for direct adaptive control of dynamic systems with poorly known dynamics. The neural network weights (controller gains) are adapted in real time using state measurements and a random search optimization algorithm. The results are demonstrated via simulation using two highly nonlinear systems.

  6. Will electrical cyber-physical interdependent networks undergo first-order transition under random attacks?

    Science.gov (United States)

    Ji, Xingpei; Wang, Bo; Liu, Dichen; Dong, Zhaoyang; Chen, Guo; Zhu, Zhenshan; Zhu, Xuedong; Wang, Xunting

    2016-10-01

    Whether the realistic electrical cyber-physical interdependent networks will undergo first-order transition under random failures still remains a question. To reflect the reality of Chinese electrical cyber-physical system, the "partial one-to-one correspondence" interdependent networks model is proposed and the connectivity vulnerabilities of three realistic electrical cyber-physical interdependent networks are analyzed. The simulation results show that due to the service demands of power system the topologies of power grid and its cyber network are highly inter-similar which can effectively avoid the first-order transition. By comparing the vulnerability curves between electrical cyber-physical interdependent networks and its single-layer network, we find that complex network theory is still useful in the vulnerability analysis of electrical cyber-physical interdependent networks.

  7. $k$-core percolation on complex networks: Comparing random, localized and targeted attacks

    CERN Document Server

    Yuan, Xin; Stanley, H Eugene; Havlin, Shlomo

    2016-01-01

    The type of malicious attack inflicting on networks greatly influences their stability under ordinary percolation in which a node fails when it becomes disconnected from the giant component. Here we study its generalization, $k$-core percolation, in which a node fails when it loses connection to a threshold $k$ number of neighbors. We study and compare analytically and by numerical simulations of $k$-core percolation the stability of networks under random attacks (RA), localized attacks (LA) and targeted attacks (TA), respectively. By mapping a network under LA or TA into an equivalent network under RA, we find that in both single and interdependent networks, TA exerts the greatest damage to the core structure of a network. We also find that for Erd\\H{o}s-R\\'{e}nyi (ER) networks, LA and RA exert equal damage to the core structure whereas for scale-free (SF) networks, LA exerts much more damage than RA does to the core structure.

  8. Security management of next generation telecommunications networks and services

    CERN Document Server

    Jacobs, Stuart

    2014-01-01

    This book will cover network management security issues and currently available security mechanisms by discussing how network architectures have evolved into the contemporary NGNs which support converged services (voice, video, TV, interactive information exchange, and classic data communications). It will also analyze existing security standards and their applicability to securing network management. This book will review 21st century security concepts of authentication, authorization, confidentiality, integrity, nonrepudiation, vulnerabilities, threats, risks, and effective approaches to enc

  9. Social network indices in the Generations and Gender Survey: An appraisal

    NARCIS (Netherlands)

    P.A. Dykstra (Pearl); Bühler, C. (Christoph); T. Fokkema (Tineke); Petric, G. (Gregor); Platinovšek, R. (Rok); Kogovšek, T. (Tina); Hlebec, V. (Valentina)

    2016-01-01

    textabstractBACKGROUND In this contribution we critically appraise the social network indices in the Generations and Gender Survey (GGS). OBJECTIVE After discussing the rationale for including social network indices in the GGS, we provide descriptive information on social network characteristics and

  10. Cisco Networking Academy: Next-Generation Assessments and Their Implications for K-12 Education

    Science.gov (United States)

    Liu, Meredith

    2014-01-01

    To illuminate the possibilities for next-generation assessments in K-12 schools, this case study profiles the Cisco Networking Academy, which creates comprehensive online training curriculum to teach networking skills. Since 1997, the Cisco Networking Academy has served more than five million high school and college students and now delivers…

  11. Social network indices in the Generations and Gender Survey: An appraisal

    NARCIS (Netherlands)

    Dykstra, P.A.; Bühler, C.; Fokkema, T.; Petric, G.; Platinovsek, R.; Kogovsek, T.; Hlebec, V.

    2016-01-01

    Background: In this contribution we critically appraise the social network indices in the Generations and Gender Survey (GGS). Objective: After discussing the rationale for including social network indices in the GGS, we provide descriptive information on social network characteristics and an

  12. MATIN: a random network coding based framework for high quality peer-to-peer live video streaming.

    Science.gov (United States)

    Barekatain, Behrang; Khezrimotlagh, Dariush; Aizaini Maarof, Mohd; Ghaeini, Hamid Reza; Salleh, Shaharuddin; Quintana, Alfonso Ariza; Akbari, Behzad; Cabrera, Alicia Triviño

    2013-01-01

    In recent years, Random Network Coding (RNC) has emerged as a promising solution for efficient Peer-to-Peer (P2P) video multicasting over the Internet. This probably refers to this fact that RNC noticeably increases the error resiliency and throughput of the network. However, high transmission overhead arising from sending large coefficients vector as header has been the most important challenge of the RNC. Moreover, due to employing the Gauss-Jordan elimination method, considerable computational complexity can be imposed on peers in decoding the encoded blocks and checking linear dependency among the coefficients vectors. In order to address these challenges, this study introduces MATIN which is a random network coding based framework for efficient P2P video streaming. The MATIN includes a novel coefficients matrix generation method so that there is no linear dependency in the generated coefficients matrix. Using the proposed framework, each peer encapsulates one instead of n coefficients entries into the generated encoded packet which results in very low transmission overhead. It is also possible to obtain the inverted coefficients matrix using a bit number of simple arithmetic operations. In this regard, peers sustain very low computational complexities. As a result, the MATIN permits random network coding to be more efficient in P2P video streaming systems. The results obtained from simulation using OMNET++ show that it substantially outperforms the RNC which uses the Gauss-Jordan elimination method by providing better video quality on peers in terms of the four important performance metrics including video distortion, dependency distortion, End-to-End delay and Initial Startup delay.

  13. MATIN: a random network coding based framework for high quality peer-to-peer live video streaming.

    Directory of Open Access Journals (Sweden)

    Behrang Barekatain

    Full Text Available In recent years, Random Network Coding (RNC has emerged as a promising solution for efficient Peer-to-Peer (P2P video multicasting over the Internet. This probably refers to this fact that RNC noticeably increases the error resiliency and throughput of the network. However, high transmission overhead arising from sending large coefficients vector as header has been the most important challenge of the RNC. Moreover, due to employing the Gauss-Jordan elimination method, considerable computational complexity can be imposed on peers in decoding the encoded blocks and checking linear dependency among the coefficients vectors. In order to address these challenges, this study introduces MATIN which is a random network coding based framework for efficient P2P video streaming. The MATIN includes a novel coefficients matrix generation method so that there is no linear dependency in the generated coefficients matrix. Using the proposed framework, each peer encapsulates one instead of n coefficients entries into the generated encoded packet which results in very low transmission overhead. It is also possible to obtain the inverted coefficients matrix using a bit number of simple arithmetic operations. In this regard, peers sustain very low computational complexities. As a result, the MATIN permits random network coding to be more efficient in P2P video streaming systems. The results obtained from simulation using OMNET++ show that it substantially outperforms the RNC which uses the Gauss-Jordan elimination method by providing better video quality on peers in terms of the four important performance metrics including video distortion, dependency distortion, End-to-End delay and Initial Startup delay.

  14. Next Generation Flexible and Cognitive Heterogeneous Optical Networks

    DEFF Research Database (Denmark)

    Tomkos, Ioannis; Angelou, Marianna; Barroso, Ramón J. Durán

    2012-01-01

    Optical networking is the cornerstone of the Future Internet as it provides the physical infrastructure of the core backbone networks. Recent developments have enabled much better quality of service/experience for the end users, enabled through the much higher capacities that can be supported...... the capabilities of the Future Internet. In this book chapter, we highlight the latest activities of the optical networking community and in particular what has been the focus of EU funded research. The concepts of flexible and cognitive optical networks are introduced and their key expected benefits...

  15. Multitarget search on complex networks: A logarithmic growth of global mean random cover time

    Science.gov (United States)

    Weng, Tongfeng; Zhang, Jie; Small, Michael; Yang, Ji; Bijarbooneh, Farshid Hassani; Hui, Pan

    2017-09-01

    We investigate multitarget search on complex networks and derive an exact expression for the mean random cover time that quantifies the expected time a walker needs to visit multiple targets. Based on this, we recover and extend some interesting results of multitarget search on networks. Specifically, we observe the logarithmic increase of the global mean random cover time with the target number for a broad range of random search processes, including generic random walks, biased random walks, and maximal entropy random walks. We show that the logarithmic growth pattern is a universal feature of multi-target search on networks by using the annealed network approach and the Sherman-Morrison formula. Moreover, we find that for biased random walks, the global mean random cover time can be minimized, and that the corresponding optimal parameter also minimizes the global mean first passage time, pointing towards its robustness. Our findings further confirm that the logarithmic growth pattern is a universal law governing multitarget search in confined media.

  16. The effect of increasing levels of embedded generation on the distribution network. Final report

    Energy Technology Data Exchange (ETDEWEB)

    Collinson, A.; Earp, G.K.; Howson, D.; Owen, R.D.; Wright, A.J.

    1999-10-01

    This report was commissioned as part of the EA Technology Strategic Technology Programme under guidance of the Module 5 (Embedded Generation) Steering Group. This report aims to provide information related to the distribution and supply of electricity in the context of increasing levels of embedded generation. There is a brief description of the operating environment within which electricity companies in the UK must operate. Technical issues related to the connection of generation to the existing distribution infrastructure are highlighted and the design philosophy adopted by network designers in accommodating applications for the connection of embedded generation to the network is discussed. The effects embedded generation has on the network and the issues raised are presented as many of them present barriers to the connection of embedded generators. The final chapters cover the forecast of required connection to 2010 and solutions to restrictions preventing the connection of more embedded generation to the network. (author)

  17. Concurrent Generation of Pseudo Random Numbers with LFSR of Fibonacci and Galois Type

    OpenAIRE

    Emina I. Milovanović; Stojčev, Mile K.; Igor Ž. Milovanović; Tatjana R. Nikolić; Zoran Stamenković

    2016-01-01

    We have considered implementation of parallel test pattern generator based on a linear feedback shift register (LFSR) with multiple outputs used as a building block in built-in-self-test (BIST) design within SoC. The proposed design can drive several circuits under test (CUT) simultaneously. The mathematical procedure for concurrent pseudo random number (PRN) generation is described. We have implemented LFSRs that generate two and three PRNs in FPGA and ASIC technology. The design was tested ...

  18. Financial Time Series Prediction Using Elman Recurrent Random Neural Networks

    Directory of Open Access Journals (Sweden)

    Jie Wang

    2016-01-01

    (ERNN, the empirical results show that the proposed neural network displays the best performance among these neural networks in financial time series forecasting. Further, the empirical research is performed in testing the predictive effects of SSE, TWSE, KOSPI, and Nikkei225 with the established model, and the corresponding statistical comparisons of the above market indices are also exhibited. The experimental results show that this approach gives good performance in predicting the values from the stock market indices.

  19. Random laser action with coherent feedback via second-harmonic generation

    CERN Document Server

    Qiao, Yanqi; Cai, Zengyan; Chen, Xianfeng

    2016-01-01

    The random laser action with coherent feedback by second-harmonic generation (SHG) was experimentally demonstrated in this paper. Compared with the conventional random laser action based on photoluminescence effect, which needs strong photoresponse in the active medium and has a fixed response waveband due to the inherent energy level structure of the material, this random SHG laser action indicates a possible confinement of the nonlinear signal with ring cavities and widens the response waveband due to the flexible frequency conversion in nonlinear process. The combination of coherent random laser and nonlinear optics will provide us another possible way to break phase-matching limitations, with fiber or feedback-based wavefront shaping method to transmit the emission signal directionally. This work suggests potential applications in band-tunable random laser, phase-matching-free nonlinear optics and even brings in new consideration about random nonlinear optics (RNO).

  20. Heave motion prediction of a large barge in random seas by using artificial neural network

    Science.gov (United States)

    Lee, Hsiu Eik; Liew, Mohd Shahir; Zawawi, Noor Amila Wan Abdullah; Toloue, Iraj

    2017-11-01

    This paper describes the development of a multi-layer feed forward artificial neural network (ANN) to predict rigid heave body motions of a large catenary moored barge subjected to multi-directional irregular waves. The barge is idealized as a rigid plate of finite draft with planar dimensions 160m (length) and 100m (width) which is held on station using a six point chain catenary mooring in 50m water depth. Hydroelastic effects are neglected from the physical model as the chief intent of this study is focused on large plate rigid body hydrodynamics modelling using ANN. Even with this assumption, the computational requirements for time domain coupled hydrodynamic simulations of a moored floating body is considerably costly, particularly if a large number of simulations are required such as in the case of response based design (RBD) methods. As an alternative to time consuming numerical hydrodynamics, a regression-type ANN model has been developed for efficient prediction of the barge's heave responses to random waves from various directions. It was determined that a network comprising of 3 input features, 2 hidden layers with 5 neurons each and 1 output was sufficient to produce acceptable predictions within 0.02 mean squared error. By benchmarking results from the ANN with those generated by a fully coupled dynamic model in OrcaFlex, it is demonstrated that the ANN is capable of predicting the barge's heave responses with acceptable accuracy.

  1. Randomization and resilience of brain functional networks as systems-level endophenotypes of schizophrenia.

    Science.gov (United States)

    Lo, Chun-Yi Zac; Su, Tsung-Wei; Huang, Chu-Chung; Hung, Chia-Chun; Chen, Wei-Ling; Lan, Tsuo-Hung; Lin, Ching-Po; Bullmore, Edward T

    2015-07-21

    Schizophrenia is increasingly conceived as a disorder of brain network organization or dysconnectivity syndrome. Functional MRI (fMRI) networks in schizophrenia have been characterized by abnormally random topology. We tested the hypothesis that network randomization is an endophenotype of schizophrenia and therefore evident also in nonpsychotic relatives of patients. Head movement-corrected, resting-state fMRI data were acquired from 25 patients with schizophrenia, 25 first-degree relatives of patients, and 29 healthy volunteers. Graphs were used to model functional connectivity as a set of edges between regional nodes. We estimated the topological efficiency, clustering, degree distribution, resilience, and connection distance (in millimeters) of each functional network. The schizophrenic group demonstrated significant randomization of global network metrics (reduced clustering, greater efficiency), a shift in the degree distribution to a more homogeneous form (fewer hubs), a shift in the distance distribution (proportionally more long-distance edges), and greater resilience to targeted attack on network hubs. The networks of the relatives also demonstrated abnormal randomization and resilience compared with healthy volunteers, but they were typically less topologically abnormal than the patients' networks and did not have abnormal connection distances. We conclude that schizophrenia is associated with replicable and convergent evidence for functional network randomization, and a similar topological profile was evident also in nonpsychotic relatives, suggesting that this is a systems-level endophenotype or marker of familial risk. We speculate that the greater resilience of brain networks may confer some fitness advantages on nonpsychotic relatives that could explain persistence of this endophenotype in the population.

  2. Towards User-centric Video Transmission in Next Generation Mobile Networks

    OpenAIRE

    El Essaili, Ali

    2014-01-01

    The focus of this thesis is to design, implement and evaluate novel user-centric approaches for the distribution of the limited wireless network resources across multiple users in a mobile cell. The first part of this thesis is concerned with the uplink distribution of user-generated video content over fourth generation mobile networks. The second part explores the benefit of QoE-based traffic and resource management in the mobile network in the context of adaptive HTTP downlink video deliver...

  3. A new neural network model for solving random interval linear programming problems.

    Science.gov (United States)

    Arjmandzadeh, Ziba; Safi, Mohammadreza; Nazemi, Alireza

    2017-05-01

    This paper presents a neural network model for solving random interval linear programming problems. The original problem involving random interval variable coefficients is first transformed into an equivalent convex second order cone programming problem. A neural network model is then constructed for solving the obtained convex second order cone problem. Employing Lyapunov function approach, it is also shown that the proposed neural network model is stable in the sense of Lyapunov and it is globally convergent to an exact satisfactory solution of the original problem. Several illustrative examples are solved in support of this technique. Copyright © 2017 Elsevier Ltd. All rights reserved.

  4. Advanced satellite concepts for future generation VSAT networks

    Science.gov (United States)

    Naderi, F. Michael; Wu, William W.

    1988-01-01

    Advanced communication networks that use very-small-aperture terminals (VSATs) are considered. The techniques and technologies suitable for powerful satellites and system architectures for future VSAT networks are discussed. These include high effective isotropic radiated power, multiple-beam satellite antennas, and various access techniques. Examples of systems planned by the government and private industry are described.

  5. Network as a service for next generation internet

    CERN Document Server

    Duan, Qiang

    2017-01-01

    This book presents the state of the art of the Network-as-a-Service (NaaS) paradigm, including its concepts, architecture, key technologies, applications, and development directions for future network service provisioning. It provides a comprehensive reference that reflects the most current technical developments related to NaaS.

  6. Random Number Generation and Executive Functions in Parkinson's Disease: An Event-Related Brain Potential Study.

    Science.gov (United States)

    Münte, Thomas F; Joppich, Gregor; Däuper, Jan; Schrader, Christoph; Dengler, Reinhard; Heldmann, Marcus

    2015-01-01

    The generation of random sequences is considered to tax executive functions and has been reported to be impaired in Parkinson's disease (PD) previously. To assess the neurophysiological markers of random number generation in PD. Event-related potentials (ERP) were recorded in 12 PD patients and 12 age-matched normal controls (NC) while either engaging in random number generation (RNG) by pressing the number keys on a computer keyboard in a random sequence or in ordered number generation (ONG) necessitating key presses in the canonical order. Key presses were paced by an external auditory stimulus at a rate of 1 tone every 1800 ms. As a secondary task subjects had to monitor the tone-sequence for a particular target tone to which the number "0" key had to be pressed. This target tone occurred randomly and infrequently, thus creating a secondary oddball task. Behaviorally, PD patients showed an increased tendency to count in steps of one as well as a tendency towards repetition avoidance. Electrophysiologically, the amplitude of the P3 component of the ERP to the target tone of the secondary task was reduced during RNG in PD but not in NC. The behavioral findings indicate less random behavior in PD while the ERP findings suggest that this impairment comes about, because attentional resources are depleted in PD.

  7. Fractal generator for efficient production of random planar patterns and symbols in digital mapping

    Science.gov (United States)

    Chen, Qiyu; Liu, Gang; Ma, Xiaogang; Li, Xinchuan; He, Zhenwen

    2017-08-01

    In digital cartography, the automatic generation of random planar patterns and symbols is still an ongoing challenge. Those patterns and symbols of randomness have randomly variated configurations and boundaries, and their generating algorithms are constrained by the shape features, cartographic standards and many other conditions. The fractal geometry offers favorable solutions to simulate random boundaries and patterns. In the work presented in this paper, we used both fractal theory and random Iterated Function Systems (IFS) to develop a method for the automatic generation of random planar patterns and symbols. The marshland and the trough cross-bedding patterns were used as two case studies for the implementation of the method. We first analyzed the morphological characteristics of those two planar patterns. Then we designed algorithms and implementation schemes addressing the features of each pattern. Finally, we ran the algorithms to generate the patterns and symbols, and compared them with the requirements of a few digital cartographic standards. The method presented in this paper has already been deployed in a digital mapping system for practical uses. The flexibility of the method also allows it to be reused and/or adapted in various software platforms for digital mapping.

  8. Esophagus segmentation in CT via 3D fully convolutional neural network and random walk.

    Science.gov (United States)

    Fechter, Tobias; Adebahr, Sonja; Baltas, Dimos; Ben Ayed, Ismail; Desrosiers, Christian; Dolz, Jose

    2017-12-01

    Precise delineation of organs at risk is a crucial task in radiotherapy treatment planning for delivering high doses to the tumor while sparing healthy tissues. In recent years, automated segmentation methods have shown an increasingly high performance for the delineation of various anatomical structures. However, this task remains challenging for organs like the esophagus, which have a versatile shape and poor contrast to neighboring tissues. For human experts, segmenting the esophagus from CT images is a time-consuming and error-prone process. To tackle these issues, we propose a random walker approach driven by a 3D fully convolutional neural network (CNN) to automatically segment the esophagus from CT images. First, a soft probability map is generated by the CNN. Then, an active contour model (ACM) is fitted to the CNN soft probability map to get a first estimation of the esophagus location. The outputs of the CNN and ACM are then used in conjunction with a probability model based on CT Hounsfield (HU) values to drive the random walker. Training and evaluation were done on 50 CTs from two different datasets, with clinically used peer-reviewed esophagus contours. Results were assessed regarding spatial overlap and shape similarity. The esophagus contours generated by the proposed algorithm showed a mean Dice coefficient of 0.76 ± 0.11, an average symmetric square distance of 1.36 ± 0.90 mm, and an average Hausdorff distance of 11.68 ± 6.80, compared to the reference contours. These results translate to a very good agreement with reference contours and an increase in accuracy compared to existing methods. Furthermore, when considering the results reported in the literature for the publicly available Synapse dataset, our method outperformed all existing approaches, which suggests that the proposed method represents the current state-of-the-art for automatic esophagus segmentation. We show that a CNN can yield accurate estimations of esophagus location, and that

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

    Science.gov (United States)

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

    2017-12-28

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

  10. Channel modeling for fifth generation cellular networks and wireless sensor networks

    Science.gov (United States)

    Torabi, Amir

    In view of exponential growth in data traffic demand, the wireless communications industry has aimed to increase the capacity of existing networks by 1000 times over the next 20 years. A combination of extreme cell densification, more bandwidth, and higher spectral efficiency is needed to support the data traffic requirements for fifth generation (5G) cellular communications. In this research, the potential improvements achieved by using three major 5G enabling technologies (i.e., small cells, millimeter-wave spectrum, and massive MIMO) in rural and urban environments are investigated. This work develops SPM and KA-based ray models to investigate the impact of geometrical parameters on terrain-based multiuser MIMO channel characteristic. Moreover, a new directional 3D channel model is developed for urban millimeter-wave (mmW) small cells. Path-loss, spatial correlation, coverage distance, and coherence length are studied in urban areas. Exploiting physical optics (PO) and geometric optics (GO) solutions, closed form expressions are derived for spatial correlation. Achievable spatial diversity is evaluated using horizontal and vertical linear arrays as well as planar 2D arrays. In another study, a versatile near-ground field prediction model is proposed to facilitate accurate wireless sensor network (WSN) simulations. Monte Carlo simulations are used to investigate the effects of antenna height, frequency of operation, polarization, and terrain dielectric and roughness properties on WSNs performance.

  11. Random Walker Coverage Analysis for Information Dissemination in Wireless Sensor Networks

    Directory of Open Access Journals (Sweden)

    Konstantinos Skiadopoulos

    2017-06-01

    Full Text Available The increasing technological progress in electronics provides network nodes with new and enhanced capabilities that allow the revisit of the traditional information dissemination (and collection problem. The probabilistic nature of information dissemination using random walkers is exploited here to deal with challenges imposed by unconventional modern environments. In such systems, node operation is not deterministic (e.g., does not depend only on network nodes’ battery, but it rather depends on the particulars of the ambient environment (e.g., in the case of energy harvesting: sunshine, wind. The mechanism of information dissemination using one random walker is studied and analyzed in this paper under a different and novel perspective. In particular, it takes into account the stochastic nature of random walks, enabling further understanding of network coverage. A novel and original analysis is presented, which reveals the evolution network coverage by a random walker with respect to time. The derived analytical results reveal certain additional interesting aspects regarding network coverage, thus shedding more light on the random walker mechanism. Further analytical results, regarding the walker’s spatial movement and its associated neighborhood, are also confirmed through experimentation. Finally, simulation results considering random geometric graph topologies, which are suitable for modeling mobile environments, support and confirm the analytical findings.

  12. A Deep Generative Adversarial Architecture for Network-Wide Spatial-Temporal Traffic State Estimation

    OpenAIRE

    Liang, Yunyi; Cui, Zhiyong; Tian, Yu; Chen, Huimiao; Wang, Yinhai

    2018-01-01

    This study proposes a deep generative adversarial architecture (GAA) for network-wide spatial-temporal traffic state estimation. The GAA is able to combine traffic flow theory with neural networks and thus improve the accuracy of traffic state estimation. It consists of two Long Short-Term Memory Neural Networks (LSTM NNs) which capture correlation in time and space among traffic flow and traffic density. One of the LSTM NNs, called a discriminative network, aims to maximize the probability o...

  13. Early stage hot spot analysis through standard cell base random pattern generation

    Science.gov (United States)

    Jeon, Joong-Won; Song, Jaewan; Kim, Jeong-Lim; Park, Seongyul; Yang, Seung-Hune; Lee, Sooryong; Kang, Hokyu; Madkour, Kareem; ElManhawy, Wael; Lee, SeungJo; Kwan, Joe

    2017-04-01

    Due to limited availability of DRC clean patterns during the process and RET recipe development, OPC recipes are not tested with high pattern coverage. Various kinds of pattern can help OPC engineer to detect sensitive patterns to lithographic effects. Random pattern generation is needed to secure robust OPC recipe. However, simple random patterns without considering real product layout style can't cover patterning hotspot in production levels. It is not effective to use them for OPC optimization thus it is important to generate random patterns similar to real product patterns. This paper presents a strategy for generating random patterns based on design architecture information and preventing hotspot in early process development stage through a tool called Layout Schema Generator (LSG). Using LSG, we generate standard cell based on random patterns reflecting real design cell structure - fin pitch, gate pitch and cell height. The output standard cells from LSG are applied to an analysis methodology to assess their hotspot severity by assigning a score according to their optical image parameters - NILS, MEEF, %PV band and thus potential hotspots can be defined by determining their ranking. This flow is demonstrated on Samsung 7nm technology optimizing OPC recipe and early enough in the process avoiding using problematic patterns.

  14. A two-stage flow-based intrusion detection model for next-generation networks.

    Science.gov (United States)

    Umer, Muhammad Fahad; Sher, Muhammad; Bi, Yaxin

    2018-01-01

    The next-generation network provides state-of-the-art access-independent services over converged mobile and fixed networks. Security in the converged network environment is a major challenge. Traditional packet and protocol-based intrusion detection techniques cannot be used in next-generation networks due to slow throughput, low accuracy and their inability to inspect encrypted payload. An alternative solution for protection of next-generation networks is to use network flow records for detection of malicious activity in the network traffic. The network flow records are independent of access networks and user applications. In this paper, we propose a two-stage flow-based intrusion detection system for next-generation networks. The first stage uses an enhanced unsupervised one-class support vector machine which separates malicious flows from normal network traffic. The second stage uses a self-organizing map which automatically groups malicious flows into different alert clusters. We validated the proposed approach on two flow-based datasets and obtained promising results.

  15. Random Walks on Directed Networks: Inference and Respondent-driven Sampling

    CERN Document Server

    Malmros, Jens; Britton, Tom

    2013-01-01

    Respondent driven sampling (RDS) is a method often used to estimate population properties (e.g. sexual risk behavior) in hard-to-reach populations. It combines an effective modified snowball sampling methodology with an estimation procedure that yields unbiased population estimates under the assumption that the sampling process behaves like a random walk on the social network of the population. Current RDS estimation methodology assumes that the social network is undirected, i.e. that all edges are reciprocal. However, empirical social networks in general also have non-reciprocated edges. To account for this fact, we develop a new estimation method for RDS in the presence of directed edges on the basis of random walks on directed networks. We distinguish directed and undirected edges and consider the possibility that the random walk returns to its current position in two steps through an undirected edge. We derive estimators of the selection probabilities of individuals as a function of the number of outgoing...

  16. USING THE RANDOM OF QUANTIZATION IN THE SIMULATION OF NETWORKED CONTROL SYSTEMS

    Directory of Open Access Journals (Sweden)

    V. K. Bitiukov

    2014-01-01

    Full Text Available Network control systems using a network channel for communication between the elements. This approach has several advantages: lower installation costs, ease of configuration, ease of diagnostics and maintenance. The use of networks in control systems poses new problems. The network characteristics make the analysis, modeling, and control of networked control systems more complex and challenging. In the simulation must consider the following factors: packet loss, packet random time over the network, the need for location records in a channel simultaneously multiple data packets with sequential transmission. Attempts to account at the same time all of these factors lead to a significant increase in the dimension of the mathematical model and, as a con-sequence, a significant computational challenges. Such models tend to have a wide application in research. However, for engineering calculations required mathematical models of small dimension, but at the same time having sufficient accuracy. Considered the networks channels with random delays and packet loss. Random delay modeled by appropriate distribution the Erlang. The probability of packet loss depends on the arrival rate of data packets in the transmission channel, and the parameters of the distribution Erlang. We propose a model of the channel in the form of a serial connection of discrete elements. Discrete elements produce independents quantization of the input signal. To change the probability of packet loss is proposed to use a random quantization input signal. Obtained a formula to determine the probability of packet loss during transmission.

  17. A revision of the subtract-with-borrow random number generators

    Science.gov (United States)

    Sibidanov, Alexei

    2017-12-01

    The most popular and widely used subtract-with-borrow generator, also known as RANLUX, is reimplemented as a linear congruential generator using large integer arithmetic with the modulus size of 576 bits. Modern computers, as well as the specific structure of the modulus inferred from RANLUX, allow for the development of a fast modular multiplication - the core of the procedure. This was previously believed to be slow and have too high cost in terms of computing resources. Our tests show a significant gain in generation speed which is comparable with other fast, high quality random number generators. An additional feature is the fast skipping of generator states leading to a seeding scheme which guarantees the uniqueness of random number sequences. Licensing provisions: GPLv3 Programming language: C++, C, Assembler

  18. Analysis of Greedy Decision Making for Geographic Routing for Networks of Randomly Moving Objects

    Directory of Open Access Journals (Sweden)

    Amber Israr

    2016-04-01

    Full Text Available Autonomous and self-organizing wireless ad-hoc communication networks for moving objects consist of nodes, which use no centralized network infrastructure. Examples of moving object networks are networks of flying objects, networks of vehicles, networks of moving people or robots. Moving object networks have to face many critical challenges in terms of routing because of dynamic topological changes and asymmetric networks links. A suitable and effective routing mechanism helps to extend the deployment of moving nodes. In this paper an attempt has been made to analyze the performance of the Greedy Decision method (position aware distance based algorithm for geographic routing for network nodes moving according to the random waypoint mobility model. The widely used GPSR (Greedy Packet Stateless Routing protocol utilizes geographic distance and position based data of nodes to transmit packets towards destination nodes. In this paper different scenarios have been tested to develop a concrete set of recommendations for optimum deployment of distance based Greedy Decision of Geographic Routing in randomly moving objects network

  19. Network Capacity Assessment of CHP-based Distributed Generation on Urban Energy Distribution Networks

    Science.gov (United States)

    Zhang, Xianjun

    The combined heat and power (CHP)-based distributed generation (DG) or dis-tributed energy resources (DERs) are mature options available in the present energy market, considered to be an effective solution to promote energy efficiency. In the urban environment, the electricity, water and natural gas distribution networks are becoming increasingly interconnected with the growing penetration of the CHP-based DG. Subsequently, this emerging interdependence leads to new topics meriting serious consideration: how much of the CHP-based DG can be accommodated and where to locate these DERs, and given preexisting constraints, how to quantify the mutual impacts on operation performances between these urban energy distribution networks and the CHP-based DG. The early research work was conducted to investigate the feasibility and design methods for one residential microgrid system based on existing electricity, water and gas infrastructures of a residential community, mainly focusing on the economic planning. However, this proposed design method cannot determine the optimal DG sizing and siting for a larger test bed with the given information of energy infrastructures. In this context, a more systematic as well as generalized approach should be developed to solve these problems. In the later study, the model architecture that integrates urban electricity, water and gas distribution networks, and the CHP-based DG system was developed. The proposed approach addressed the challenge of identifying the optimal sizing and siting of the CHP-based DG on these urban energy networks and the mutual impacts on operation performances were also quantified. For this study, the overall objective is to maximize the electrical output and recovered thermal output of the CHP-based DG units. The electricity, gas, and water system models were developed individually and coupled by the developed CHP-based DG system model. The resultant integrated system model is used to constrain the DG's electrical

  20. Compact quantum random number generator based on superluminescent light-emitting diodes

    Science.gov (United States)

    Wei, Shihai; Yang, Jie; Fan, Fan; Huang, Wei; Li, Dashuang; Xu, Bingjie

    2017-12-01

    By measuring the amplified spontaneous emission (ASE) noise of the superluminescent light emitting diodes, we propose and realize a quantum random number generator (QRNG) featured with practicability. In the QRNG, after the detection and amplification of the ASE noise, the data acquisition and randomness extraction which is integrated in a field programmable gate array (FPGA) are both implemented in real-time, and the final random bit sequences are delivered to a host computer with a real-time generation rate of 1.2 Gbps. Further, to achieve compactness, all the components of the QRNG are integrated on three independent printed circuit boards with a compact design, and the QRNG is packed in a small enclosure sized 140 mm × 120 mm × 25 mm. The final random bit sequences can pass all the NIST-STS and DIEHARD tests.

  1. Quantum random number generation enhanced by weak-coherent states interference.

    Science.gov (United States)

    Ferreira da Silva, T; Xavier, G B; Amaral, G C; Temporão, G P; von der Weid, J P

    2016-08-22

    We propose and demonstrate a technique for quantum random number generation based on the random population of the output spatial modes of a beam splitter when both inputs are simultaneously fed with indistinguishable weak coherent states. We simulate and experimentally validate the probability of generation of random bits as a function of the average photon number per input, and compare it to the traditional approach of a single weak coherent state transmitted through a beam-splitter, showing an improvement of up to 32%. The ensuing interference phenomenon reduces the probability of coincident counts between the detectors associated with bits 0 and 1, thus increasing the probability of occurrence of a valid output. A long bit string is assessed by a standard randomness test suite with good confidence. Our proposal can be easily implemented and opens attractive performance gains without a significant trade-off.

  2. Fixed-points in random Boolean networks: The impact of parallelism in the Barabási-Albert scale-free topology case.

    Science.gov (United States)

    Moisset de Espanés, P; Osses, A; Rapaport, I

    2016-12-01

    Fixed points are fundamental states in any dynamical system. In the case of gene regulatory networks (GRNs) they correspond to stable genes profiles associated to the various cell types. We use Kauffman's approach to model GRNs with random Boolean networks (RBNs). In this paper we explore how the topology affects the distribution of the number of fixed points in randomly generated networks. We also study the size of the basins of attraction of these fixed points if we assume the α-asynchronous dynamics (where every node is updated independently with probability 0≤α≤1). It is well-known that asynchrony avoids the cyclic attractors into which parallel dynamics tends to fall. We observe the remarkable property that, in all our simulations, if for a given RBN with Barabási-Albert topology and α-asynchronous dynamics an initial configuration reaches a fixed point, then every configuration also reaches a fixed point. By contrast, in the parallel regime, the percentage of initial configurations reaching a fixed point (for the same networks) is dramatically smaller. We contrast the results of the simulations on Barabási-Albert networks with the classical Erdös-Rényi model of random networks. Everything indicates that Barabási-Albert networks are extremely robust. Finally, we study the mean and maximum time/work needed to reach a fixed point when starting from randomly chosen initial configurations. Copyright © 2016 Elsevier Ireland Ltd. All rights reserved.

  3. Deep Generative Adversarial Neural Networks for Realistic Prostate Lesion MRI Synthesis

    OpenAIRE

    Kitchen, Andy; Seah, Jarrel

    2017-01-01

    Generative Adversarial Neural Networks (GANs) are applied to the synthetic generation of prostate lesion MRI images. GANs have been applied to a variety of natural images, is shown show that the same techniques can be used in the medical domain to create realistic looking synthetic lesion images. 16mm x 16mm patches are extracted from 330 MRI scans from the SPIE ProstateX Challenge 2016 and used to train a Deep Convolutional Generative Adversarial Neural Network (DCGAN) utilizing cutting edge...

  4. Fiber-wireless convergence in next-generation communication networks systems, architectures, and management

    CERN Document Server

    Chang, Gee-Kung; Ellinas, Georgios

    2017-01-01

    This book investigates new enabling technologies for Fi-Wi convergence. The editors discuss Fi-Wi technologies at the three major network levels involved in the path towards convergence: system level, network architecture level, and network management level. The main topics will be: a. At system level: Radio over Fiber (digitalized vs. analogic, standardization, E-band and beyond) and 5G wireless technologies; b. Network architecture level: NGPON, WDM-PON, BBU Hotelling, Cloud Radio Access Networks (C-RANs), HetNets. c. Network management level: SDN for convergence, Next-generation Point-of-Presence, Wi-Fi LTE Handover, Cooperative MultiPoint. • Addresses the Fi-Wi convergence issues at three different levels, namely at the system level, network architecture level, and network management level • Provides approaches in communication systems, network architecture, and management that are expected to steer the evolution towards fiber-wireless convergence • Contributions from leading experts in the field of...

  5. A Bidirectional Generalized Synchronization Theorem-Based Chaotic Pseudo-random Number Generator

    Directory of Open Access Journals (Sweden)

    Han Shuangshuang

    2013-07-01

    Full Text Available Based on a bidirectional generalized synchronization theorem for discrete chaos system, this paper introduces a new 5-dimensional bidirectional generalized chaos synchronization system (BGCSDS, whose prototype is a novel chaotic system introduced in [12]. Numerical simulation showed that two pair variables of the BGCSDS achieve generalized chaos synchronization via a transform H.A chaos-based pseudo-random number generator (CPNG was designed by the new BGCSDS. Using the FIPS-140-2 tests issued by the National Institute of Standard and Technology (NIST verified the randomness of the 1000 binary number sequences generated via the CPNG and the RC4 algorithm respectively. The results showed that all the tested sequences passed the FIPS-140-2 tests. The confidence interval analysis showed the statistical properties of the randomness of the sequences generated via the CPNG and the RC4 algorithm do not have significant differences.

  6. Efficient randomization of biological networks while preserving functional characterization of individual nodes.

    Science.gov (United States)

    Iorio, Francesco; Bernardo-Faura, Marti; Gobbi, Andrea; Cokelaer, Thomas; Jurman, Giuseppe; Saez-Rodriguez, Julio

    2016-12-20

    Networks are popular and powerful tools to describe and model biological processes. Many computational methods have been developed to infer biological networks from literature, high-throughput experiments, and combinations of both. Additionally, a wide range of tools has been developed to map experimental data onto reference biological networks, in order to extract meaningful modules. Many of these methods assess results' significance against null distributions of randomized networks. However, these standard unconstrained randomizations do not preserve the functional characterization of the nodes in the reference networks (i.e. their degrees and connection signs), hence including potential biases in the assessment. Building on our previous work about rewiring bipartite networks, we propose a method for rewiring any type of unweighted networks. In particular we formally demonstrate that the problem of rewiring a signed and directed network preserving its functional connectivity (F-rewiring) reduces to the problem of rewiring two induced bipartite networks. Additionally, we reformulate the lower bound to the iterations' number of the switching-algorithm to make it suitable for the F-rewiring of networks of any size. Finally, we present BiRewire3, an open-source Bioconductor package enabling the F-rewiring of any type of unweighted network. We illustrate its application to a case study about the identification of modules from gene expression data mapped on protein interaction networks, and a second one focused on building logic models from more complex signed-directed reference signaling networks and phosphoproteomic data. BiRewire3 it is freely available at https://www.bioconductor.org/packages/BiRewire/ , and it should have a broad application as it allows an efficient and analytically derived statistical assessment of results from any network biology tool.

  7. Generating Variable and Random Schedules of Reinforcement Using Microsoft Excel Macros

    OpenAIRE

    Bancroft, Stacie L; Bourret, Jason C

    2008-01-01

    Variable reinforcement schedules are used to arrange the availability of reinforcement following varying response ratios or intervals of time. Random reinforcement schedules are subtypes of variable reinforcement schedules that can be used to arrange the availability of reinforcement at a constant probability across number of responses or time. Generating schedule values for variable and random reinforcement schedules can be difficult. The present article describes the steps necessary to writ...

  8. Theory of fast nondeterministic physical random-bit generation with chaotic lasers.

    Science.gov (United States)

    Harayama, Takahisa; Sunada, Satoshi; Yoshimura, Kazuyuki; Muramatsu, Jun; Arai, Ken-ichi; Uchida, Atsushi; Davis, Peter

    2012-04-01

    We theoretically show that completely stochastic fast physical random bit generation at a rate of more than one gigabit per second can be realized by using lasers with optical delayed feedback which creates high-dimensional chaos of laser light outputs. The theory is based on the mixing property of chaos, which transduces microscopic quantum noise of spontaneous emission in lasers into random transitions between discrete macroscopic states.

  9. Evaluation of geocast routing trees on random and actual networks

    NARCIS (Netherlands)

    Meijerink, Berend Jan; Baratchi, Mitra; Heijenk, Geert; Koucheryavy, Yevgeni; Mamatas, Lefteris; Matta, Ibrahim; Ometov, Aleksandr; Papadimitriou, Panagiotis

    2017-01-01

    Efficient geocast routing schemes are needed to transmit messages to mobile networked devices in geographically scoped areas. To design an efficient geocast routing algorithm a comprehensive evaluation of different routing tree approaches is needed. In this paper, we present an analytical study

  10. Network Edge Intelligence for the Emerging Next-Generation Internet

    Directory of Open Access Journals (Sweden)

    Salekul Islam

    2010-11-01

    Full Text Available The success of the Content Delivery Networks (CDN in the recent years has demonstrated the increased benefits of the deployment of some form of “intelligence” within the network. Cloud computing, on the other hand, has shown the benefits of economies of scale and the use of a generic infrastructure to support a variety of services. Following that trend, we propose to move away from the smart terminal-dumb network dichotomy to a model where some degree of intelligence is put back into the network, specifically at the edge, with the support of Cloud technology. In this paper, we propose the deployment of an Edge Cloud, which integrates a variety of user-side and server-side services. On the user side, surrogate, an application running on top of the Cloud, supports a virtual client. The surrogate hides the underlying network infrastructure from the user, thus allowing for simpler, more easily managed terminals. Network side services supporting delivery of and exploiting content are also deployed on this infrastructure, giving the Internet Service Providers (ISP many opportunities to become directly involved in content and service delivery.

  11. Active Coordinated Operation of Distribution Network System for Many Connections of Distributed Generators

    Science.gov (United States)

    Hayashi, Yasuhiro; Kawasaki, Shoji; Matsuki, Junya; Wakao, Shinji; Baba, Junpei; Hojo, Masahide; Yokoyama, Akihiko; Kobayashi, Naoki; Hirai, Takao; Oishi, Kohei

    Recently, total number of distributed generators (DGS) such as photovoltaic generation system and wind turbine generation system connected to an actual distribution network increases drastically. The distribution network connected with many distributed generators must be operated keeping reliability of power supply, power quality and loss minimization. In order to accomplish active distribution network operation to take advantage of many connections of DGS, a new coordinated operation of distribution system with many connections of DGS is necessary. In this paper, the authors propose a coordinated operation of distribution network system connected with many DGS by using newly proposed sectionalizing switches control, sending voltage control and computation of available DG connection capability. In order to check validity of the proposed coordinated operation of distribution system, numerical simulations using the proposed coordinated distribution system operation are carried out in a practical distribution network model.

  12. Graphene based widely-tunable and singly-polarized pulse generation with random fiber lasers

    Science.gov (United States)

    Yao, B. C.; Rao, Y. J.; Wang, Z. N.; Wu, Y.; Zhou, J. H.; Wu, H.; Fan, M. Q.; Cao, X. L.; Zhang, W. L.; Chen, Y. F.; Li, Y. R.; Churkin, D.; Turitsyn, S.; Wong, C. W.

    2015-12-01

    Pulse generation often requires a stabilized cavity and its corresponding mode structure for initial phase-locking. Contrastingly, modeless cavity-free random lasers provide new possibilities for high quantum efficiency lasing that could potentially be widely tunable spectrally and temporally. Pulse generation in random lasers, however, has remained elusive since the discovery of modeless gain lasing. Here we report coherent pulse generation with modeless random lasers based on the unique polarization selectivity and broadband saturable absorption of monolayer graphene. Simultaneous temporal compression of cavity-free pulses are observed with such a polarization modulation, along with a broadly-tunable pulsewidth across two orders of magnitude down to 900 ps, a broadly-tunable repetition rate across three orders of magnitude up to 3 MHz, and a singly-polarized pulse train at 41 dB extinction ratio, about an order of magnitude larger than conventional pulsed fiber lasers. Moreover, our graphene-based pulse formation also demonstrates robust pulse-to-pulse stability and wide-wavelength operation due to the cavity-less feature. Such a graphene-based architecture not only provides a tunable pulsed random laser for fiber-optic sensing, speckle-free imaging, and laser-material processing, but also a new way for the non-random CW fiber lasers to generate widely tunable and singly-polarized pulses.

  13. Novel mechanism of network protection against the new generation of cyber attacks

    Science.gov (United States)

    Milovanov, Alexander; Bukshpun, Leonid; Pradhan, Ranjit

    2012-06-01

    A new intelligent mechanism is presented to protect networks against the new generation of cyber attacks. This mechanism integrates TCP/UDP/IP protocol stack protection and attacker/intruder deception to eliminate existing TCP/UDP/IP protocol stack vulnerabilities. It allows to detect currently undetectable, highly distributed, low-frequency attacks such as distributed denial-of-service (DDoS) attacks, coordinated attacks, botnet, and stealth network reconnaissance. The mechanism also allows insulating attacker/intruder from the network and redirecting the attack to a simulated network acting as a decoy. As a result, network security personnel gain sufficient time to defend the network and collect the attack information. The presented approach can be incorporated into wireless or wired networks that require protection against known and the new generation of cyber attacks.

  14. Random fields generation on the GPU with the spectral turning bands method

    Science.gov (United States)

    Hunger, L.; Cosenza, B.; Kimeswenger, S.; Fahringer, T.

    2014-08-01

    Random field (RF) generation algorithms are of paramount importance for many scientific domains, such as astrophysics, geostatistics, computer graphics and many others. Some examples are the generation of initial conditions for cosmological simulations or hydrodynamical turbulence driving. In the latter a new random field is needed every time-step. Current approaches commonly make use of 3D FFT (Fast Fourier Transform) and require the whole generated field to be stored in memory. Moreover, they are limited to regular rectilinear meshes and need an extra processing step to support non-regular meshes. In this paper, we introduce TBARF (Turning BAnd Random Fields), a RF generation algorithm based on the turning band method that is optimized for massively parallel hardware such as GPUs. Our algorithm replaces the 3D FFT with a lower order, one-dimensional FFT followed by a projection step, and is further optimized with loop unrolling and blocking. We show that TBARF can easily generate RF on non-regular (non uniform) meshes and can afford mesh sizes bigger than the available GPU memory by using a streaming, out-of-core approach. TBARF is 2 to 5 times faster than the traditional methods when generating RFs with more than 16M cells. It can also generate RF on non-regular meshes, and has been successfully applied to two real case scenarios: planetary nebulae and cosmological simulations.

  15. Radio-location of mobile stations in third generation networks

    Directory of Open Access Journals (Sweden)

    Milan Manojle Šunjevarić

    2013-06-01

    Full Text Available Mobile station localization in mobile networks started with simple methods (e.g. Cell-ID method which required only slight modifications of network infrastructures. Principally, it was about network localization by which a localization service became available to all types of mobile phones. Due to low precision, the initiated development of more sophisticated methods has not been finished yet. Among the advanced location-based methods are those based on the measurement of location parameters in the time domain. In this paper the general consideration of radio location methods in 3G (UMTS radio networks is presented. The use of time based measurement methods was analysed in detail. Due to the limited article length, the use of other locating methods in 3G networks (based on power measurements, on radio direction measurement, and on cells identification – Cell ID and global positioning system - GPS are not described. Introduction Mobile station localization within modern cellular networks increases the level of user security and opens wide opportunities for commercial operators who provide this service. The major obstacle for the implementation of this service, which also prevents its practical usage, is the modification of the existing network infrastructure. In general, depending on the infrastructure used, positioning methods can be divided into two groups: integrated and independent. Integrated methods are primarily created for communication networks. A possibility to locate users represents just an additional service within a radio network. Independent methods are totally detached from the communication network in which the user whose location is being determined is. Radio location methods Determining the location of a mobile radio station is performed by determining the intersection of two or more lines of position. These lines represent the position of the set of points at which the mobile station may be located. These lines can be: (a

  16. Random bit generation using an optically injected semiconductor laser in chaos with oversampling.

    Science.gov (United States)

    Li, Xiao-Zhou; Chan, Sze-Chun

    2012-06-01

    Random bit generation is experimentally demonstrated using a semiconductor laser driven into chaos by optical injection. The laser is not subject to any feedback so that the chaotic waveform possesses very little autocorrelation. Random bit generation is achieved at a sampling rate of 10 GHz even when only a fractional bandwidth of 1.5 GHz within a much broader chaotic bandwidth is digitized. By retaining only 3 least significant bits per sample, an output bit rate of 30 Gbps is attained. The approach requires no complicated postprocessing and has no stringent requirement on the electronics bandwidth.

  17. Fortran code for generating random probability vectors, unitaries, and quantum states

    Directory of Open Access Journals (Sweden)

    Jonas eMaziero

    2016-03-01

    Full Text Available The usefulness of generating random configurations is recognized in many areas of knowledge. Fortran was born for scientific computing and has been one of the main programming languages in this area since then. And several ongoing projects targeting towards its betterment indicate that it will keep this status in the decades to come. In this article, we describe Fortran codes produced, or organized, for the generation of the following random objects: numbers, probability vectors, unitary matrices, and quantum state vectors and density matrices. Some matrix functions are also included and may be of independent interest.

  18. Application of Poisson random effect models for highway network screening.

    Science.gov (United States)

    Jiang, Ximiao; Abdel-Aty, Mohamed; Alamili, Samer

    2014-02-01

    In recent years, Bayesian random effect models that account for the temporal and spatial correlations of crash data became popular in traffic safety research. This study employs random effect Poisson Log-Normal models for crash risk hotspot identification. Both the temporal and spatial correlations of crash data were considered. Potential for Safety Improvement (PSI) were adopted as a measure of the crash risk. Using the fatal and injury crashes that occurred on urban 4-lane divided arterials from 2006 to 2009 in the Central Florida area, the random effect approaches were compared to the traditional Empirical Bayesian (EB) method and the conventional Bayesian Poisson Log-Normal model. A series of method examination tests were conducted to evaluate the performance of different approaches. These tests include the previously developed site consistence test, method consistence test, total rank difference test, and the modified total score test, as well as the newly proposed total safety performance measure difference test. Results show that the Bayesian Poisson model accounting for both temporal and spatial random effects (PTSRE) outperforms the model that with only temporal random effect, and both are superior to the conventional Poisson Log-Normal model (PLN) and the EB model in the fitting of crash data. Additionally, the method evaluation tests indicate that the PTSRE model is significantly superior to the PLN model and the EB model in consistently identifying hotspots during successive time periods. The results suggest that the PTSRE model is a superior alternative for road site crash risk hotspot identification. Copyright © 2013 Elsevier Ltd. All rights reserved.

  19. Multilevel compression of random walks on networks reveals hierarchical organization in large integrated systems.

    Directory of Open Access Journals (Sweden)

    Martin Rosvall

    Full Text Available To comprehend the hierarchical organization of large integrated systems, we introduce the hierarchical map equation, which reveals multilevel structures in networks. In this information-theoretic approach, we exploit the duality between compression and pattern detection; by compressing a description of a random walker as a proxy for real flow on a network, we find regularities in the network that induce this system-wide flow. Finding the shortest multilevel description of the random walker therefore gives us the best hierarchical clustering of the network--the optimal number of levels and modular partition at each level--with respect to the dynamics on the network. With a novel search algorithm, we extract and illustrate the rich multilevel organization of several large social and biological networks. For example, from the global air traffic network we uncover countries and continents, and from the pattern of scientific communication we reveal more than 100 scientific fields organized in four major disciplines: life sciences, physical sciences, ecology and earth sciences, and social sciences. In general, we find shallow hierarchical structures in globally interconnected systems, such as neural networks, and rich multilevel organizations in systems with highly separated regions, such as road networks.

  20. Do natural proteins differ from random sequences polypeptides? Natural vs. random proteins classification using an evolutionary neural network.

    Directory of Open Access Journals (Sweden)

    Davide De Lucrezia

    Full Text Available Are extant proteins the exquisite result of natural selection or are they random sequences slightly edited by evolution? This question has puzzled biochemists for long time and several groups have addressed this issue comparing natural protein sequences to completely random ones coming to contradicting conclusions. Previous works in literature focused on the analysis of primary structure in an attempt to identify possible signature of evolutionary editing. Conversely, in this work we compare a set of 762 natural proteins with an average length of 70 amino acids and an equal number of completely random ones of comparable length on the basis of their structural features. We use an ad hoc Evolutionary Neural Network Algorithm (ENNA in order to assess whether and to what extent natural proteins are edited from random polypeptides employing 11 different structure-related variables (i.e. net charge, volume, surface area, coil, alpha helix, beta sheet, percentage of coil, percentage of alpha helix, percentage of beta sheet, percentage of secondary structure and surface hydrophobicity. The ENNA algorithm is capable to correctly distinguish natural proteins from random ones with an accuracy of 94.36%. Furthermore, we study the structural features of 32 random polypeptides misclassified as natural ones to unveil any structural similarity to natural proteins. Results show that random proteins misclassified by the ENNA algorithm exhibit a significant fold similarity to portions or subdomains of extant proteins at atomic resolution. Altogether, our results suggest that natural proteins are significantly edited from random polypeptides and evolutionary editing can be readily detected analyzing structural features. Furthermore, we also show that the ENNA, employing simple structural descriptors, can predict whether a protein chain is natural or random.

  1. Didactic Networks: A Proposal for e-learning Content Generation

    Directory of Open Access Journals (Sweden)

    F. Javier Del Alamo

    2010-12-01

    Full Text Available The Didactic Networks proposed in this paper are based on previous publications in the field of the RSR (Rhetorical-Semantic Relations. The RSR is a set of primitive relations used for building a specific kind of semantic networks for artificial intelligence applications on the web: the RSN (Rhetorical-Semantic Networks. We bring into focus the RSR application in the field of elearning, by defining Didactic Networks as a new set of semantic patterns oriented to the development of elearning applications. The different lines we offer in our research fall mainly into three levels: (1 The most basic one is in the field of computational linguistics and related to Logical Operations on RSR (RSR Inverses and plurals, RSR combinations, etc, once they have been created. The application of Walter Bosma's results regarding rhetorical distance application and treatment as semantic weighted networks is one of the important issues here. (2 In parallel, we have been working on the creation of a knowledge representation and storage model and data architecture capable of supporting the definition of knowledge networks based on RSR. (3 The third strategic line is in the meso-level, the formulation of a molecular structure of knowledge based on the most frequently used patterns. The main contribution at this level is the set of Fundamental Cognitive Networks (FCN as an application of Novak's mental maps proposal. This paper is part of this third intermediate level, and the Fundamental Didactic Networks (FDN are the result of the application of rhetorical theory procedures to the instructional theory. We have formulated a general set of RSR capable of building discourse, making it possible to express any concept, procedure or principle in terms of knowledge nodes and RSRs. The Instructional knowledge can then be elaborated in the same way. This network structure expressing the instructional knowledge in terms of RSR makes the objective of developing web

  2. Learning random networks for compression of still and moving images

    Science.gov (United States)

    Gelenbe, Erol; Sungur, Mert; Cramer, Christopher

    1994-01-01

    Image compression for both still and moving images is an extremely important area of investigation, with numerous applications to videoconferencing, interactive education, home entertainment, and potential applications to earth observations, medical imaging, digital libraries, and many other areas. We describe work on a neural network methodology to compress/decompress still and moving images. We use the 'point-process' type neural network model which is closer to biophysical reality than standard models, and yet is mathematically much more tractable. We currently achieve compression ratios of the order of 120:1 for moving grey-level images, based on a combination of motion detection and compression. The observed signal-to-noise ratio varies from values above 25 to more than 35. The method is computationally fast so that compression and decompression can be carried out in real-time. It uses the adaptive capabilities of a set of neural networks so as to select varying compression ratios in real-time as a function of quality achieved. It also uses a motion detector which will avoid retransmitting portions of the image which have varied little from the previous frame. Further improvements can be achieved by using on-line learning during compression, and by appropriate compensation of nonlinearities in the compression/decompression scheme. We expect to go well beyond the 250:1 compression level for color images with good quality levels.

  3. Variability of Fiber Elastic Moduli in Composite Random Fiber Networks Makes the Network Softer

    Science.gov (United States)

    Ban, Ehsan; Picu, Catalin

    2015-03-01

    Athermal fiber networks are assemblies of beams or trusses. They have been used to model mechanics of fibrous materials such as biopolymer gels and synthetic nonwovens. Elasticity of these networks has been studied in terms of various microstructural parameters such as the stiffness of their constituent fibers. In this work we investigate the elasticity of composite fiber networks made from fibers with moduli sampled from a distribution function. We use finite elements simulations to study networks made by 3D Voronoi and Delaunay tessellations. The resulting data collapse to power laws showing that variability in fiber stiffness makes fiber networks softer. We also support the findings by analytical arguments. Finally, we apply these results to a network with curved fibers to explain the dependence of the network's modulus on the variation of its structural parameters.

  4. Fully-distributed randomized cooperation in wireless sensor networks

    KAUST Repository

    Bader, Ahmed

    2015-01-07

    When marrying randomized distributed space-time coding (RDSTC) to geographical routing, new performance horizons can be created. In order to reach those horizons however, routing protocols must evolve to operate in a fully distributed fashion. In this letter, we expose a technique to construct a fully distributed geographical routing scheme in conjunction with RDSTC. We then demonstrate the performance gains of this novel scheme by comparing it to one of the prominent classical schemes.

  5. Virtual networks pluralistic approach for the next generation of Internet

    CERN Document Server

    Duarte, Otto Carlos M B

    2013-01-01

    The first chapter of this title concerns virtualization techniques that allow sharing computational resources basically, slicing a real computational environment into virtual computational environments that are isolated from one another.The Xen and OpenFlow virtualization platforms are then presented in Chapter 2 and a performance analysis of both is provided. This chapter also defines the primitives that the network virtualization infrastructure must provide for allowing the piloting plane to manage virtual network elements.Following this, interfaces for system management of the two platform

  6. Effect of inhibitory firing pattern on coherence resonance in random neural networks

    Science.gov (United States)

    Yu, Haitao; Zhang, Lianghao; Guo, Xinmeng; Wang, Jiang; Cao, Yibin; Liu, Jing

    2018-01-01

    The effect of inhibitory firing patterns on coherence resonance (CR) in random neuronal network is systematically studied. Spiking and bursting are two main types of firing pattern considered in this work. Numerical results show that, irrespective of the inhibitory firing patterns, the regularity of network is maximized by an optimal intensity of external noise, indicating the occurrence of coherence resonance. Moreover, the firing pattern of inhibitory neuron indeed has a significant influence on coherence resonance, but the efficacy is determined by network property. In the network with strong coupling strength but weak inhibition, bursting neurons largely increase the amplitude of resonance, while they can decrease the noise intensity that induced coherence resonance within the neural system of strong inhibition. Different temporal windows of inhibition induced by different inhibitory neurons may account for the above observations. The network structure also plays a constructive role in the coherence resonance. There exists an optimal network topology to maximize the regularity of the neural systems.

  7. Role Analysis in Networks using Mixtures of Exponential Random Graph Models.

    Science.gov (United States)

    Salter-Townshend, Michael; Murphy, Thomas Brendan

    2015-06-01

    A novel and flexible framework for investigating the roles of actors within a network is introduced. Particular interest is in roles as defined by local network connectivity patterns, identified using the ego-networks extracted from the network. A mixture of Exponential-family Random Graph Models is developed for these ego-networks in order to cluster the nodes into roles. We refer to this model as the ego-ERGM. An Expectation-Maximization algorithm is developed to infer the unobserved cluster assignments and to estimate the mixture model parameters using a maximum pseudo-likelihood approximation. The flexibility and utility of the method are demonstrated on examples of simulated and real networks.

  8. Next-generation science information network for leading-edge applications

    Energy Technology Data Exchange (ETDEWEB)

    Urushidani, S. [National Institute of Informatics, 2-1-2 Hitotsubashi Chiyoda-ku, Tokyo 101-8430 (Japan)], E-mail: urushi@nii.ac.jp; Matsukata, J. [National Institute of Informatics, 2-1-2 Hitotsubashi Chiyoda-ku, Tokyo 101-8430 (Japan)

    2008-04-15

    High-speed networks are definitely essential tools for leading-edge applications in many research areas, including nuclear fusion research. This paper describes a number of advanced features in the Japanese next-generation science information network, called SINET3, and gives researchers clues on the uses of advanced high-speed network for their applications. The network services have four categories, multiple layer transfer, enriched virtual private network, enhanced quality-of-service, and bandwidth on demand services, and comprise a versatile service platform. The paper also describes the network architecture and advanced networking capabilities that enable economical service accommodation and flexible network resource assignment as well as effective use of Japan's first 40-Gbps lines.

  9. Media access control and resource allocation for next generation passive optical networks

    CERN Document Server

    Ansari, Nirwan

    2013-01-01

    This book focuses on various Passive optical networks (PONs)  types, including currently deployed Ethernet PON (EPON) and Gigabit PON (GPON) as well as next generation WDM PON and OFDM PON. Also this book examines the integrated optical and wireless access networks. Concentrating on two issues in these networks: media access control (MAC) and resource allocation. These two problems can greatly affect performances of PONs such as network resource utilization and QoS of end users. Finally this book will discuss various solutions to address the MAC and resource allocation issues in various PON networks.

  10. Shortest loops are pacemakers in random networks of electrically coupled axons

    Directory of Open Access Journals (Sweden)

    Nikita eVladimirov

    2012-04-01

    Full Text Available High-frequency oscillations (HFOs are an important part of brain activity in health and disease. However, their origins remain obscure and controversial. One possible mechanism depends on the presence of sparsely distributed gap junctions that electrically couple the axons of principal cells. A plexus of electrically coupled axons is modeled as a random network with bidirectional connections between its nodes. Under certain conditions the network can demonstrate one of two types of oscillatory activity. Type I oscillations (100-200 Hz are predicted to be caused by spontaneously spiking axons in a network with strong (high-conductance gap junctions. Type II oscillations (200-300 Hz require no spontaneous spiking and relatively weak (low-conductance gap junctions, across which spike propagation failures occur. The type II oscillations are reentrant and self-sustained. Here we examine what determines the frequency of type II oscillations. Using simulations we show that the distribution of loop lengths is the key factor for determining frequency in type II network oscillations. We first analyze spike failure between two electrically coupled cells using a model of anatomically reconstructed CA1 pyramidal neuron. Then network oscillations are studied by a cellular automaton model with random network connectivity, in which we control loop statistics. We show that oscillation periods can be predicted from the network's loop statistics. The shortest loop, around which a spike can travel, is the most likely pacemaker candidate.The principle of one loop as a pacemaker is remarkable, because random networks contain a large number of loops juxtaposed and superimposed, and their number rapidly grows with network size. This principle allows us to predict the frequency of oscillations from network connectivity and visa versa. We finally propose that type I oscillations may correspond to ripples, while type II oscillations correspond to so-called fast ripples.

  11. Perspectives on next-generation technology for environmental sensor networks

    Science.gov (United States)

    Barbara J. Benson; Barbara J. Bond; Michael P. Hamilton; Russell K. Monson; Richard. Han

    2009-01-01

    Sensor networks promise to transform and expand environmental science. However, many technological difficulties must be overcome to achieve this potential. Partnerships of ecologists with computer scientists and engineers are critical in meeting these challenges. Technological issues include promoting innovation in new sensor design, incorporating power optimization...

  12. Generating Predictive Movie Recommendations from Trust in Social Networks

    National Research Council Canada - National Science Library

    Golbeck, Jennifer

    2006-01-01

    .... Using the FilmTrust system as a foundation, they show that these recommendations are more accurate than other techniques when the user's opinions about a film are divergent from the average. They discuss this technique both as an application of social network analysis and how it suggests other analyses that can be performed to help improve collaborative filtering algorithms of all types.

  13. Reconfiguration of sustainable thermoelectric generation using wireless sensor network

    DEFF Research Database (Denmark)

    Chen, Min

    2014-01-01

    wireless sensor networks (WSNs), where remotely deployed temperature and voltage sensors as well as latching relays can be organized as a whole to intelligently identify and execute the optimal interconnection of TEM strings. A reconfigurable TEM array with a WSN controller and a maximum power point...

  14. Detection of mobile user location on next generation wireless networks

    DEFF Research Database (Denmark)

    Schou, Saowanee; Olesen, Henning

    2005-01-01

    of a Mobile IPv6 device can be determined by mapping the geographical location information with the two care-of-addresses and the physical address of the access point where the user is connected. Such a mechanism makes location services for mobile entities available on a global IP network. The end-users can...

  15. The Impact of Distributed Generation on Distribution Networks ...

    African Journals Online (AJOL)

    Their advantages are the ability to reduce or postpone the need for investment in the transmission and distribution infrastructure when optimally located; the ability to reduce technical losses within the transmission and distribution networks as well as general improvement in power quality and system reliability. This paper ...

  16. Formation of Robust Multi-Agent Networks through Self-Organizing Random Regular Graphs

    KAUST Repository

    Yasin Yazicioǧlu, A.

    2015-11-25

    Multi-Agent networks are often modeled as interaction graphs, where the nodes represent the agents and the edges denote some direct interactions. The robustness of a multi-Agent network to perturbations such as failures, noise, or malicious attacks largely depends on the corresponding graph. In many applications, networks are desired to have well-connected interaction graphs with relatively small number of links. One family of such graphs is the random regular graphs. In this paper, we present a decentralized scheme for transforming any connected interaction graph with a possibly non-integer average degree of k into a connected random m-regular graph for some m ϵ [k+k ] 2. Accordingly, the agents improve the robustness of the network while maintaining a similar number of links as the initial configuration by locally adding or removing some edges. © 2015 IEEE.

  17. An On-Demand Optical Quantum Random Number Generator with In-Future Action and Ultra-Fast Response.

    Science.gov (United States)

    Stipčević, Mario; Ursin, Rupert

    2015-06-09

    Random numbers are essential for our modern information based society e.g. in cryptography. Unlike frequently used pseudo-random generators, physical random number generators do not depend on complex algorithms but rather on a physical process to provide true randomness. Quantum random number generators (QRNG) do rely on a process, which can be described by a probabilistic theory only, even in principle. Here we present a conceptually simple implementation, which offers a 100% efficiency of producing a random bit upon a request and simultaneously exhibits an ultra low latency. A careful technical and statistical analysis demonstrates its robustness against imperfections of the actual implemented technology and enables to quickly estimate randomness of very long sequences. Generated random numbers pass standard statistical tests without any post-processing. The setup described, as well as the theory presented here, demonstrate the maturity and overall understanding of the technology.

  18. Generation of sound by Alfven waves with random phases in the solar atmosphere

    Energy Technology Data Exchange (ETDEWEB)

    Petrukhin, N.S.; Fainshtein, S.M.

    1976-11-01

    The problem of the excitation of sound by Alfven waves meeting in the solar plasma is discussed. Kinetic equations for the interacting waves are derived and analyzed on the assumption that the Alfven waves have random phases. Estimates are given which show the possibility of the generation of LF-pulsations in the solar atmosphere.

  19. Examining Psychokinesis: The Interaction of Human Intention with Random Number Generators--A Meta-Analysis

    Science.gov (United States)

    Bosch, Holger; Steinkamp, Fiona; Boller, Emil

    2006-01-01

    Seance-room and other large-scale psychokinetic phenomena have fascinated humankind for decades. Experimental research has reduced these phenomena to attempts to influence (a) the fall of dice and, later, (b) the output of random number generators (RNGs). The meta-analysis combined 380 studies that assessed whether RNG output correlated with human…

  20. A time series approach to random number generation: Using recurrence quantification analysis to capture executive behavior

    NARCIS (Netherlands)

    Oomens, W.; Maes, J.H.R.; Hasselman, F.W.; Egger, J.I.M.

    2015-01-01

    The concept of executive functions plays a prominent role in contemporary experimental and clinical studies on cognition. One paradigm used in this framework is the random number generation (RNG) task, the execution of which demands aspects of executive functioning, specifically inhibition and

  1. Decentralized formation of random regular graphs for robust multi-agent networks

    KAUST Repository

    Yazicioglu, A. Yasin

    2014-12-15

    Multi-agent networks are often modeled via interaction graphs, where the nodes represent the agents and the edges denote direct interactions between the corresponding agents. Interaction graphs have significant impact on the robustness of networked systems. One family of robust graphs is the random regular graphs. In this paper, we present a locally applicable reconfiguration scheme to build random regular graphs through self-organization. For any connected initial graph, the proposed scheme maintains connectivity and the average degree while minimizing the degree differences and randomizing the links. As such, if the average degree of the initial graph is an integer, then connected regular graphs are realized uniformly at random as time goes to infinity.

  2. Risk Assessment of Distribution Network Based on Random set Theory and Sensitivity Analysis

    Science.gov (United States)

    Zhang, Sh; Bai, C. X.; Liang, J.; Jiao, L.; Hou, Z.; Liu, B. Zh

    2017-05-01

    Considering the complexity and uncertainty of operating information in distribution network, this paper introduces the use of random set for risk assessment. The proposed method is based on the operating conditions defined in the random set framework to obtain the upper and lower cumulative probability functions of risk indices. Moreover, the sensitivity of risk indices can effectually reflect information about system reliability and operating conditions, and by use of these information the bottlenecks that suppress system reliability can be found. The analysis about a typical radial distribution network shows that the proposed method is reasonable and effective.

  3. Trend-driven information cascades on random networks.

    Science.gov (United States)

    Kobayashi, Teruyoshi

    2015-12-01

    Threshold models of global cascades have been extensively used to model real-world collective behavior, such as the contagious spread of fads and the adoption of new technologies. A common property of those cascade models is that a vanishingly small seed fraction can spread to a finite fraction of an infinitely large network through local infections. In social and economic networks, however, individuals' behavior is often influenced not only by what their direct neighbors are doing, but also by what the majority of people are doing as a trend. A trend affects individuals' behavior while individuals' behavior creates a trend. To analyze such a complex interplay between local- and global-scale phenomena, I generalize the standard threshold model by introducing a type of node called global nodes (or trend followers), whose activation probability depends on a global-scale trend, specifically the percentage of activated nodes in the population. The model shows that global nodes play a role as accelerating cascades once a trend emerges while reducing the probability of a trend emerging. Global nodes thus either facilitate or inhibit cascades, suggesting that a moderate share of trend followers may maximize the average size of cascades.

  4. Mean First Passage Time of Preferential Random Walks on Complex Networks with Applications

    Directory of Open Access Journals (Sweden)

    Zhongtuan Zheng

    2017-01-01

    Full Text Available This paper investigates, both theoretically and numerically, preferential random walks (PRW on weighted complex networks. By using two different analytical methods, two exact expressions are derived for the mean first passage time (MFPT between two nodes. On one hand, the MFPT is got explicitly in terms of the eigenvalues and eigenvectors of a matrix associated with the transition matrix of PRW. On the other hand, the center-product-degree (CPD is introduced as one measure of node strength and it plays a main role in determining the scaling of the MFPT for the PRW. Comparative studies are also performed on PRW and simple random walks (SRW. Numerical simulations of random walks on paradigmatic network models confirm analytical predictions and deepen discussions in different aspects. The work may provide a comprehensive approach for exploring random walks on complex networks, especially biased random walks, which may also help to better understand and tackle some practical problems such as search and routing on networks.

  5. 3-D components of a biological neural network visualized in computer generated imagery. II - Macular neural network organization

    Science.gov (United States)

    Ross, Muriel D.; Meyer, Glenn; Lam, Tony; Cutler, Lynn; Vaziri, Parshaw

    1990-01-01

    Computer-assisted reconstructions of small parts of the macular neural network show how the nerve terminals and receptive fields are organized in 3-dimensional space. This biological neural network is anatomically organized for parallel distributed processing of information. Processing appears to be more complex than in computer-based neural network, because spatiotemporal factors figure into synaptic weighting. Serial reconstruction data show anatomical arrangements which suggest that (1) assemblies of cells analyze and distribute information with inbuilt redundancy, to improve reliability; (2) feedforward/feedback loops provide the capacity for presynaptic modulation of output during processing; (3) constrained randomness in connectivities contributes to adaptability; and (4) local variations in network complexity permit differing analyses of incoming signals to take place simultaneously. The last inference suggests that there may be segregation of information flow to central stations subserving particular functions.

  6. Cascading failures in interdependent modular networks with partial random coupling preference

    Science.gov (United States)

    Tian, Meng; Wang, Xianpei; Dong, Zhengcheng; Zhu, Guowei; Long, Jiachuang; Dai, Dangdang; Zhang, Qilin

    2017-10-01

    Cascading failures have been widely analyzed in interdependent networks with different coupling preferences from microscopic and macroscopic perspectives in recent years. Plenty of real-world interdependent infrastructures, representing as interdependent networks, exhibit community structure, one of the most important mesoscopic structures, and partial coupling preferences, which can affect cascading failures in interdependent networks. In this paper, we propose the partial random coupling in communities, investigating cascading failures in interdependent modular scale-free networks under inner attacks and hub attacks. We mainly analyze the effects of the discoupling probability and the intermodular connection probability on cascading failures in interdependent networks. We find that increasing either the dicoupling probability or the intermodular connection probability can enhance the network robustness under both hub attacks and inner attacks. We also note that the community structure can prevent cascading failures spreading globally in entire interdependent networks. Finally, we obtain the result that if we want to efficiently improve the robustness of interdependent networks and reduce the protection cost, the intermodular connection probability should be protected preferentially, implying that improving the robustness of a single network is the fundamental method to enhance the robustness of the entire interdependent networks.

  7. Effect of Fiber Crimp on the Elasticity of Random Fiber Networks With and Without Embedding Matrices.

    Science.gov (United States)

    Ban, Ehsan; Barocas, Victor H; Shephard, Mark S; Picu, Catalin R

    2016-04-01

    Fiber networks are assemblies of one-dimensional elements representative of materials with fibrous microstructures such as collagen networks and synthetic nonwovens. The mechanics of random fiber networks has been the focus of numerous studies. However, fiber crimp has been explicitly represented only in few cases. In the present work, the mechanics of cross-linked networks with crimped athermal fibers, with and without an embedding elastic matrix, is studied. The dependence of the effective network stiffness on the fraction of nonstraight fibers and the relative crimp amplitude (or tortuosity) is studied using finite element simulations of networks with sinusoidally curved fibers. A semi-analytic model is developed to predict the dependence of network modulus on the crimp amplitude and the bounds of the stiffness reduction associated with the presence of crimp. The transition from the linear to the nonlinear elastic response of the network is rendered more gradual by the presence of crimp, and the effect of crimp on the network tangent stiffness decreases as strain increases. If the network is embedded in an elastic matrix, the effect of crimp becomes negligible even for very small, biologically relevant matrix stiffness values. However, the distribution of the maximum principal stress in the matrix becomes broader in the presence of crimp relative to the similar system with straight fibers, which indicates an increased probability of matrix failure.

  8. Massive-Scale Gene Co-Expression Network Construction and Robustness Testing Using Random Matrix Theory

    Science.gov (United States)

    Isaacson, Sven; Luo, Feng; Feltus, Frank A.; Smith, Melissa C.

    2013-01-01

    The study of gene relationships and their effect on biological function and phenotype is a focal point in systems biology. Gene co-expression networks built using microarray expression profiles are one technique for discovering and interpreting gene relationships. A knowledge-independent thresholding technique, such as Random Matrix Theory (RMT), is useful for identifying meaningful relationships. Highly connected genes in the thresholded network are then grouped into modules that provide insight into their collective functionality. While it has been shown that co-expression networks are biologically relevant, it has not been determined to what extent any given network is functionally robust given perturbations in the input sample set. For such a test, hundreds of networks are needed and hence a tool to rapidly construct these networks. To examine functional robustness of networks with varying input, we enhanced an existing RMT implementation for improved scalability and tested functional robustness of human (Homo sapiens), rice (Oryza sativa) and budding yeast (Saccharomyces cerevisiae). We demonstrate dramatic decrease in network construction time and computational requirements and show that despite some variation in global properties between networks, functional similarity remains high. Moreover, the biological function captured by co-expression networks thresholded by RMT is highly robust. PMID:23409071

  9. Next generation network based carrier ethernet test bed for IPTV traffic

    DEFF Research Database (Denmark)

    Fu, Rong; Berger, Michael Stübert; Zheng, Yu

    2009-01-01

    This paper presents a Carrier Ethernet (CE) test bed based on the Next Generation Network (NGN) framework. After the concept of CE carried out by Metro Ethernet Forum (MEF), the carrier-grade Ethernet are obtaining more and more interests and being investigated as the low cost and high performance...... services of transport network to carry the IPTV traffic. This test bed is approaching to support the research on providing a high performance carrier-grade Ethernet transport network for IPTV traffic....

  10. Enabling Energy-Efficient and Backhaul-aware Next Generation Heterogeneous Networks

    OpenAIRE

    Prasad, Athul

    2015-01-01

    Heterogeneous networks have been firmly established as the direction in which next-generation cellular networks are evolving. We consider the dense deployment of small cells to provide enhanced capacity, while the macro cells provide wide area coverage. With the development of dual connectivity technology, deploying small cells on dedicated carriers has become an attractive option, with enhanced flexibility for splitting traffic within the network. The power consumption and latency requiremen...

  11. Small Distributed Renewable Energy Generation for Low Voltage Distribution Networks

    OpenAIRE

    Chindris M.; Cziker A.; Miron Anca

    2016-01-01

    Driven by the existing energy policies, the use of renewable energy has increased considerably all over the world in order to respond to the increasing energy consumption and to reduce the environmental impact of the electricity generation. Although most policy makers and companies are focusing on large applications, the use of cheap small generation units, based on local renewable resources, has become increasingly attractive for the general public, small farms and remote communities. The pa...

  12. Random matrix theory for analyzing the brain functional network in attention deficit hyperactivity disorder

    Science.gov (United States)

    Wang, Rong; Wang, Li; Yang, Yong; Li, Jiajia; Wu, Ying; Lin, Pan

    2016-11-01

    Attention deficit hyperactivity disorder (ADHD) is the most common childhood neuropsychiatric disorder and affects approximately 6 -7 % of children worldwide. Here, we investigate the statistical properties of undirected and directed brain functional networks in ADHD patients based on random matrix theory (RMT), in which the undirected functional connectivity is constructed based on correlation coefficient and the directed functional connectivity is measured based on cross-correlation coefficient and mutual information. We first analyze the functional connectivity and the eigenvalues of the brain functional network. We find that ADHD patients have increased undirected functional connectivity, reflecting a higher degree of linear dependence between regions, and increased directed functional connectivity, indicating stronger causality and more transmission of information among brain regions. More importantly, we explore the randomness of the undirected and directed functional networks using RMT. We find that for ADHD patients, the undirected functional network is more orderly than that for normal subjects, which indicates an abnormal increase in undirected functional connectivity. In addition, we find that the directed functional networks are more random, which reveals greater disorder in causality and more chaotic information flow among brain regions in ADHD patients. Our results not only further confirm the efficacy of RMT in characterizing the intrinsic properties of brain functional networks but also provide insights into the possibilities RMT offers for improving clinical diagnoses and treatment evaluations for ADHD patients.

  13. Spectral turning bands for efficient Gaussian random fields generation on GPUs and accelerators

    Science.gov (United States)

    Hunger, L.; Cosenza, B.; Kimeswenger, S.; Fahringer, T.

    2015-11-01

    A random field (RF) is a set of correlated random variables associated with different spatial locations. RF generation algorithms are of crucial importance for many scientific areas, such as astrophysics, geostatistics, computer graphics, and many others. Current approaches commonly make use of 3D fast Fourier transform (FFT), which does not scale well for RF bigger than the available memory; they are also limited to regular rectilinear meshes. We introduce random field generation with the turning band method (RAFT), an RF generation algorithm based on the turning band method that is optimized for massively parallel hardware such as GPUs and accelerators. Our algorithm replaces the 3D FFT with a lower-order, one-dimensional FFT followed by a projection step and is further optimized with loop unrolling and blocking. RAFT can easily generate RF on non-regular (non-uniform) meshes and efficiently produce fields with mesh sizes bigger than the available device memory by using a streaming, out-of-core approach. Our algorithm generates RF with the correct statistical behavior and is tested on a variety of modern hardware, such as NVIDIA Tesla, AMD FirePro and Intel Phi. RAFT is faster than the traditional methods on regular meshes and has been successfully applied to two real case scenarios: planetary nebulae and cosmological simulations.

  14. Performance of university students on random number generation at different rates to evaluate executive functions

    Directory of Open Access Journals (Sweden)

    Hamdan Amer C.

    2004-01-01

    Full Text Available OBJECTIVE: To evaluate the performance of adult young subjects in a Random Number Generation (RNG task by controlling the response speed (RS. METHOD: Sixty-nine university students of both sexes took part in the experiment (25.05 ± 6.71 year-old. Participants were alloted into 3 groups which differed in RS rates to generate numbers: 1, 2 and 4 seconds to generate each number. A digital metronomer was used to control RS. Participants were asked to generate 100 numbers. The responses were mensured through Evans's RNG Index. RESULTS: There were statistically significant differences among the groups [F (3, 68 = 7.120; p < .05]. Differences were localized between 1 and 2 seconds (p = 0.004 and between 1 and 4 seconds (p = 0.006. No differences were observed between 2 and 4 seconds (p = 0.985. CONCLUSION: The present results suggest that the response speed in production of random numbers influences the performance of the Random Numbers Generation task.

  15. Fluid power network for centralized electricity generation in offshore wind farms

    NARCIS (Netherlands)

    Jarquin-Laguna, A.

    2014-01-01

    An innovative and completely different wind-energy conversion system is studied where a centralized electricity generation within a wind farm is proposed by means of a hydraulic network. This paper presents the dynamic interaction of two turbines when they are coupled to the same hydraulic network.

  16. Optimization of vertical handover decision processes for fourth generation heterogeneous wireless networks

    OpenAIRE

    Yan, Xiaohuan

    2017-01-01

    This thesis presents a vertical handover decision (VHD) scheme for optimizing the efficiency of vertical handover processes in the Fourth Generation (4G) heterogeneous wireless networks. The scheme consists of three closely integrated modules: Handover necessity estimation, handover target selection, and handover triggering condition estimation. Handover necessity estimation module determines whether a handover is necessary to an available network. Handover target selecti...

  17. Privacy and Generation Y: Applying Library Values to Social Networking Sites

    Science.gov (United States)

    Fernandez, Peter

    2010-01-01

    Librarians face many challenges when dealing with issues of privacy within the mediated space of social networking sites. Conceptually, social networking sites differ from libraries on privacy as a value. Research about Generation Y students, the primary clientele of undergraduate libraries, can inform librarians' relationship to this important…

  18. An Expanded Study of Net Generation Perceptions on Privacy and Security on Social Networking Sites (SNS)

    Science.gov (United States)

    Lawler, James P.; Molluzzo, John C.; Doshi, Vijal

    2012-01-01

    Social networking on the Internet continues to be a frequent avenue of communication, especially among Net Generation consumers, giving benefits both personal and professional. The benefits may be eventually hindered by issues in information gathering and sharing on social networking sites. This study evaluates the perceptions of students taking a…

  19. Sustainable Value Generation through Collaborative Symbiotic Networks Planning

    OpenAIRE

    Araujo, Juliano; Pintão, Raphael; Rosa, Cyntia,

    2011-01-01

    Part 19: Sustainability Issues; International audience; Industrial Symbiosis is an important component of Industrial Ecology which studies the collaboration and coexistence of companies to achieve mutual benefits. Its concepts have traditionally focused on eco-efficiency and its direct benefits such as costs reduction, resources optimization and environmental impacts reduction. The paper introduces the use of externalities and collaborative networks as tools to amplify the spectrum of opportu...

  20. Power Optimization Techniques for Next Generation Wireless Networks

    OpenAIRE

    Ratheesh R; Vetrivelan P

    2016-01-01

    The massive data traffic and the need for high speed wireless communication is increasing day by day corresponds to an exponential increase in the consumption of power by Information and Communication Technology (ICT) sector. Reducing consumption of power in wireless network is a challenging topic and has attracted the attention of researches around the globe. Many techniques like multiple-input multiple-output (MIMO), cognitive radio, cooperative heterogeneous communications and new netwo...

  1. Augmenting a TV Broadcast with Synchronised User Generated Video and Relevant Social Network Content

    OpenAIRE

    Stokking, H.M.; Veenhuizen, A.T.; Kaptein, A.M.; Niamut, O.A.

    2014-01-01

    As TNO, we have developed an Augmented Live Broadcast use case, using components from the FP7 STEER project. In this use case, a television broadcast of a live event is augmented with user generated content. This user generated content consists of videos made by users at the event, and also of relevant social network content. The current implementation uses timestamps inserted in the media streams to synchronise related media streams. Social networks are searched using EPG information as a st...

  2. Impacts of distributed generation on low-voltage distribution network protection

    OpenAIRE

    Ogden, Richard; Yang, Jin

    2015-01-01

    This paper reports work of a MEng student final year project, which looks in detail at the impacts that distributed generation can have on existing low-voltage distribution network protection systems. After a review of up-to-date protection issues, this paper will investigate several key issues that face distributed generation connections when it comes to network protection systems. These issues include, the blinding of protection systems, failure to automatically reclose, unintentional islan...

  3. Generating log-normally distributed random numbers by using the Ziggurat algorithm

    Energy Technology Data Exchange (ETDEWEB)

    Choi, Jong Soo [KINS, Daejeon (Korea, Republic of)

    2016-05-15

    Uncertainty analyses are usually based on the Monte Carlo method. Using an efficient random number generator(RNG) is a key element in success of Monte Carlo simulations. Log-normal distributed variates are very typical in NPP PSAs. This paper proposes an approach to generate log normally distributed variates based on the Ziggurat algorithm and evaluates the efficiency of the proposed Ziggurat RNG. The proposed RNG can be helpful to improve the uncertainty analysis of NPP PSAs. This paper focuses on evaluating the efficiency of the Ziggurat algorithm from a NPP PSA point of view. From this study, we can draw the following conclusions. - The Ziggurat algorithm is one of perfect random number generators to product normal distributed variates. - The Ziggurat algorithm is computationally much faster than the most commonly used method, Marsaglia polar method.

  4. Non-linear blend coding in the moth antennal lobe emerges from random glomerular networks

    Directory of Open Access Journals (Sweden)

    Alberto eCapurro

    2012-04-01

    Full Text Available Neural responses to odor blends often interact at different stages of the olfactory pathway. The first olfactory processing center in insects, the antennal lobe (AL, exhibits a complex network connectivity. We attempt to determine if non-linear blend interactions can arise purely as a function of the AL network connectivity itself, without necessitating additional factors such as competitive ligand binding at the periphery or intrinsic cellular properties. To assess this, we compared blend interactions among responses from single neurons recorded intracellularly in the AL of the moth M. sexta with those generated using a population-based computational model constructed from the morphologically-based connectivity pattern of projection neurons (PNs and local interneurons (LNs with randomized connection probabilities, from which we excluded detailed intrinsic neuronal properties. The model accurately predicted most of the proportions of blend interaction types observed in the physiological data. Our simulations also indicate that input from LNs is important in establishing both the type of blend interaction and the nature of the neuronal response (excitation or inhibition exhibited by AL neurons. For LNs, the only input that significantly impacted the blend interaction type was received from other LNs, while for PNs the input from olfactory sensory neurons (OSNs and other PNs contributed agonistically with the LN input to shape the AL output. Our results demonstrate that non-linear blend interactions can be a natural consequence of AL connectivity, and highlight the importance of lateral inhibition as a key feature of blend coding to be addressed in future experimental and computational studies.

  5. Supporting Dynamic Adaptive Streaming over HTTP in Wireless Meshed Networks using Random Linear Network Coding

    DEFF Research Database (Denmark)

    Hundebøll, Martin; Pedersen, Morten Videbæk; Roetter, Daniel Enrique Lucani

    2014-01-01

    This work studies the potential and impact of the FRANC network coding protocol for delivering high quality Dynamic Adaptive Streaming over HTTP (DASH) in wireless networks. Although DASH aims to tailor the video quality rate based on the available throughput to the destination, it relies...

  6. Dynamics of a semiconductor laser with polarization-rotated feedback and its utilization for random bit generation.

    Science.gov (United States)

    Oliver, Neus; Soriano, Miguel C; Sukow, David W; Fischer, Ingo

    2011-12-01

    Chaotic semiconductor lasers have been proven attractive for fast random bit generation. To follow this strategy, simple robust systems and a systematic approach determining the required dynamical properties and most suitable conditions for this application are needed. We show that dynamics of a single mode laser with polarization-rotated feedback are optimal for random bit generation when characterized simultaneously by a broad power spectrum and low autocorrelation. We observe that successful random bit generation also is sensitive to digitization and postprocessing procedures. Applying the identified criteria, we achieve fast random bit generation rates (up to 4 Gbit/s) with minimal postprocessing. © 2011 Optical Society of America

  7. Optimizing the Structure of Distribution Smart Grids with Renewable Generation against Abnormal Conditions: A Complex Networks Approach with Evolutionary Algorithms

    Directory of Open Access Journals (Sweden)

    Lucas Cuadra

    2017-07-01

    Full Text Available In this work, we describe an approach that allows for optimizing the structure of a smart grid (SG with renewable energy (RE generation against abnormal conditions (imbalances between generation and consumption, overloads or failures arising from the inherent SG complexity by combining the complex network (CN and evolutionary algorithm (EA concepts. We propose a novel objective function (to be minimized that combines cost elements, related to the number of electric cables, and several metrics that quantify properties that are beneficial for SGs (energy exchange at the local scale and high robustness and resilience. The optimized SG structure is obtained by applying an EA in which the chromosome that encodes each potential network (or individual is the upper triangular matrix of its adjacency matrix. This allows for fully tailoring the crossover and mutation operators. We also propose a domain-specific initial population that includes both small-world and random networks, helping the EA converge quickly. The experimental work points out that the proposed method works well and generates the optimum, synthetic, small-world structure that leads to beneficial properties such as improving both the local energy exchange and the robustness. The optimum structure fulfills a balance between moderate cost and robustness against abnormal conditions. Our approach should be considered as an analysis, planning and decision-making tool to gain insight into smart grid structures so that the low level detailed design is carried out by using electrical engineering techniques.

  8. Non-Orthogonal Random Access in MIMO Cognitive Radio Networks: Beamforming, Power Allocation, and Opportunistic Transmission.

    Directory of Open Access Journals (Sweden)

    Huifa Lin

    Full Text Available We study secondary random access in multi-input multi-output cognitive radio networks, where a slotted ALOHA-type protocol and successive interference cancellation are used. We first introduce three types of transmit beamforming performed by secondary users, where multiple antennas are used to suppress the interference at the primary base station and/or to increase the received signal power at the secondary base station. Then, we show a simple decentralized power allocation along with the equivalent single-antenna conversion. To exploit the multiuser diversity gain, an opportunistic transmission protocol is proposed, where the secondary users generating less interference are opportunistically selected, resulting in a further reduction of the interference temperature. The proposed methods are validated via computer simulations. Numerical results show that increasing the number of transmit antennas can greatly reduce the interference temperature, while increasing the number of receive antennas leads to a reduction of the total transmit power. Optimal parameter values of the opportunistic transmission protocol are examined according to three types of beamforming and different antenna configurations, in terms of maximizing the cognitive transmission capacity. All the beamforming, decentralized power allocation, and opportunistic transmission protocol are performed by the secondary users in a decentralized manner, thus resulting in an easy implementation in practice.

  9. Non-Orthogonal Random Access in MIMO Cognitive Radio Networks: Beamforming, Power Allocation, and Opportunistic Transmission.

    Science.gov (United States)

    Lin, Huifa; Shin, Won-Yong

    2017-01-01

    We study secondary random access in multi-input multi-output cognitive radio networks, where a slotted ALOHA-type protocol and successive interference cancellation are used. We first introduce three types of transmit beamforming performed by secondary users, where multiple antennas are used to suppress the interference at the primary base station and/or to increase the received signal power at the secondary base station. Then, we show a simple decentralized power allocation along with the equivalent single-antenna conversion. To exploit the multiuser diversity gain, an opportunistic transmission protocol is proposed, where the secondary users generating less interference are opportunistically selected, resulting in a further reduction of the interference temperature. The proposed methods are validated via computer simulations. Numerical results show that increasing the number of transmit antennas can greatly reduce the interference temperature, while increasing the number of receive antennas leads to a reduction of the total transmit power. Optimal parameter values of the opportunistic transmission protocol are examined according to three types of beamforming and different antenna configurations, in terms of maximizing the cognitive transmission capacity. All the beamforming, decentralized power allocation, and opportunistic transmission protocol are performed by the secondary users in a decentralized manner, thus resulting in an easy implementation in practice.

  10. Constructing gene co-expression networks and predicting functions of unknown genes by random matrix theory

    Science.gov (United States)

    Luo, Feng; Yang, Yunfeng; Zhong, Jianxin; Gao, Haichun; Khan, Latifur; Thompson, Dorothea K; Zhou, Jizhong

    2007-01-01

    Background Large-scale sequencing of entire genomes has ushered in a new age in biology. One of the next grand challenges is to dissect the cellular networks consisting of many individual functional modules. Defining co-expression networks without ambiguity based on genome-wide microarray data is difficult and current methods are not robust and consistent with different data sets. This is particularly problematic for little understood organisms since not much existing biological knowledge can be exploited for determining the threshold to differentiate true correlation from random noise. Random matrix theory (RMT), which has been widely and successfully used in physics, is a powerful approach to distinguish system-specific, non-random properties embedded in complex systems from random noise. Here, we have hypothesized that the universal predictions of RMT are also applicable to biological systems and the correlation threshold can be determined by characterizing the correlation matrix of microarray profiles using random matrix theory. Results Application of random matrix theory to microarray data of S. oneidensis, E. coli, yeast, A. thaliana, Drosophila, mouse and human indicates that there is a sharp transition of nearest neighbour spacing distribution (NNSD) of correlation matrix after gradually removing certain elements insider the matrix. Testing on an in silico modular model has demonstrated that this transition can be used to determine the correlation threshold for revealing modular co-expression networks. The co-expression network derived from yeast cell cycling microarray data is supported by gene annotation. The topological properties of the resulting co-expression network agree well with the general properties of biological networks. Computational evaluations have showed that RMT approach is sensitive and robust. Furthermore, evaluation on sampled expression data of an in silico modular gene system has showed that under-sampled expressions do not affect the

  11. Constructing gene co-expression networks and predicting functions of unknown genes by random matrix theory.

    Science.gov (United States)

    Luo, Feng; Yang, Yunfeng; Zhong, Jianxin; Gao, Haichun; Khan, Latifur; Thompson, Dorothea K; Zhou, Jizhong

    2007-08-14

    Large-scale sequencing of entire genomes has ushered in a new age in biology. One of the next grand challenges is to dissect the cellular networks consisting of many individual functional modules. Defining co-expression networks without ambiguity based on genome-wide microarray data is difficult and current methods are not robust and consistent with different data sets. This is particularly problematic for little understood organisms since not much existing biological knowledge can be exploited for determining the threshold to differentiate true correlation from random noise. Random matrix theory (RMT), which has been widely and successfully used in physics, is a powerful approach to distinguish system-specific, non-random properties embedded in complex systems from random noise. Here, we have hypothesized that the universal predictions of RMT are also applicable to biological systems and the correlation threshold can be determined by characterizing the correlation matrix of microarray profiles using random matrix theory. Application of random matrix theory to microarray data of S. oneidensis, E. coli, yeast, A. thaliana, Drosophila, mouse and human indicates that there is a sharp transition of nearest neighbour spacing distribution (NNSD) of correlation matrix after gradually removing certain elements insider the matrix. Testing on an in silico modular model has demonstrated that this transition can be used to determine the correlation threshold for revealing modular co-expression networks. The co-expression network derived from yeast cell cycling microarray data is supported by gene annotation. The topological properties of the resulting co-expression network agree well with the general properties of biological networks. Computational evaluations have showed that RMT approach is sensitive and robust. Furthermore, evaluation on sampled expression data of an in silico modular gene system has showed that under-sampled expressions do not affect the recovery of gene

  12. Dual oscillator model of the respiratory neuronal network generating quantal slowing of respiratory rhythm.

    Science.gov (United States)

    Lal, Amit; Oku, Yoshitaka; Hülsmann, Swen; Okada, Yasumasa; Miwakeichi, Fumikazu; Kawai, Shigeharu; Tamura, Yoshiyasu; Ishiguro, Makio

    2011-04-01

    We developed a dual oscillator model to facilitate the understanding of dynamic interactions between the parafacial respiratory group (pFRG) and the preBötzinger complex (preBötC) neurons in the respiratory rhythm generation. Both neuronal groups were modeled as groups of 81 interconnected pacemaker neurons; the bursting cell model described by Butera and others [model 1 in Butera et al. (J Neurophysiol 81:382-397, 1999a)] were used to model the pacemaker neurons. We assumed (1) both pFRG and preBötC networks are rhythm generators, (2) preBötC receives excitatory inputs from pFRG, and pFRG receives inhibitory inputs from preBötC, and (3) persistent Na(+) current conductance and synaptic current conductances are randomly distributed within each population. Our model could reproduce 1:1 coupling of bursting rhythms between pFRG and preBötC with the characteristic biphasic firing pattern of pFRG neurons, i.e., firings during pre-inspiratory and post-inspiratory phases. Compatible with experimental results, the model predicted the changes in firing pattern of pFRG neurons from biphasic expiratory to monophasic inspiratory, synchronous with preBötC neurons. Quantal slowing, a phenomena of prolonged respiratory period that jumps non-deterministically to integer multiples of the control period, was observed when the excitability of preBötC network decreased while strengths of synaptic connections between the two groups remained unchanged, suggesting that, in contrast to the earlier suggestions (Mellen et al., Neuron 37:821-826, 2003; Wittmeier et al., Proc Natl Acad Sci USA 105(46):18000-18005, 2008), quantal slowing could occur without suppressed or stochastic excitatory synaptic transmission. With a reduced excitability of preBötC network, the breakdown of synchronous bursting of preBötC neurons was predicted by simulation. We suggest that quantal slowing could result from a breakdown of synchronized bursting within the preBötC.

  13. Efficient Graph-Based Resource Allocation Scheme Using Maximal Independent Set for Randomly- Deployed Small Star Networks.

    Science.gov (United States)

    Zhou, Jian; Wang, Lusheng; Wang, Weidong; Zhou, Qingfeng

    2017-11-06

    In future scenarios of heterogeneous and dense networks, randomly-deployed small star networks (SSNs) become a key paradigm, whose system performance is restricted to inter-SSN interference and requires an efficient resource allocation scheme for interference coordination. Traditional resource allocation schemes do not specifically focus on this paradigm and are usually too time consuming in dense networks. In this article, a very efficient graph-based scheme is proposed, which applies the maximal independent set (MIS) concept in graph theory to help divide SSNs into almost interference-free groups. We first construct an interference graph for the system based on a derived distance threshold indicating for any pair of SSNs whether there is intolerable inter-SSN interference or not. Then, SSNs are divided into MISs, and the same resource can be repetitively used by all the SSNs in each MIS. Empirical parameters and equations are set in the scheme to guarantee high performance. Finally, extensive scenarios both dense and nondense are randomly generated and simulated to demonstrate the performance of our scheme, indicating that it outperforms the classical max K-cut-based scheme in terms of system capacity, utility and especially time cost. Its achieved system capacity, utility and fairness can be close to the near-optimal strategy obtained by a time-consuming simulated annealing search.

  14. Control of large wind turbine generators connected to utility networks

    Science.gov (United States)

    Hinrichsen, E. N.

    1983-01-01

    This is an investigation of the control requirements for variable pitch wind turbine generators connected to electric power systems. The requirements include operation in very small as well as very large power systems. Control systems are developed for wind turbines with synchronous, induction, and doubly fed generators. Simulation results are presented. It is shown how wind turbines and power system controls can be integrated. A clear distinction is made between fast control of turbine torque, which is a peculiarity of wind turbines, and slow control of electric power, which is a traditional power system requirement.

  15. Modeling and Mangement of InterCell Interference in Future Generation Wireless Networks

    KAUST Repository

    Tabassum, Hina

    2012-12-01

    There has been a rapid growth in the data rate carried by cellular services, and this increase along with the emergence of new multimedia applications have motivated the 3rd Generation Partnership (3GPP) Project to launch Long-Term Evolution (LTE) [1]. LTE is the latest standard in the mobile network technology and is designed to meet the ubiquitous demands of next-generation mobile networks. LTE assures significant spectral and energy efficiency gains in both the uplink and down- link with low latency. Multiple access schemes such as Orthogonal Frequency Division Aultiple Access (OFDMA) and Single Carrier Frequency Division Multiple Access (SC-FDMA) which is a modified version of OFDMA have been recently adopted in 3GPP LTE downlink and uplink, respectively [1]. A typical feature of OFDMA is the decomposition of available bandwidth into multiple narrow orthogonal subcarriers. The orthogonality among subcarriers causes minimal intra-cell interference, however, the inter-cell interference (ICI) incurred on a given subcarrier is relatively impulsive and poses a fundamental challenge for the network designers. Moreover, as the number of interferers on a given subcarrier can be relatively limited it may not be accurate to model ICI as a Gaussian random variable by invoking the central limit theorem. The nature of ICI relies on a variety of indeterministic parameters which include frequency reuse factor, channel conditions, scheduling decisions, transmit power, and location of the interferers. This thesis presents a combination of algorithmic and theoretical studies for efficient modeling and management of ICI via radio resource management. In the preliminary phase, we focus on developing and analyzing the performance of several centralized and distributed interference mitigation and rate maximization algorithms. These algorithms relies on optimizing the spectrum allocation and user’s transmission powers to maximize the system capacity. Even though, the developed

  16. Microscopic Evaluation of Electrical and Thermal Conduction in Random Metal Wire Networks.

    Science.gov (United States)

    Gupta, Ritu; Kumar, Ankush; Sadasivam, Sridhar; Walia, Sunil; Kulkarni, Giridhar U; Fisher, Timothy S; Marconnet, Amy

    2017-04-19

    Ideally, transparent heaters exhibit uniform temperature, fast response time, high achievable temperatures, low operating voltage, stability across a range of temperatures, and high optical transmittance. For metal network heaters, unlike for uniform thin-film heaters, all of these parameters are directly or indirectly related to the network geometry. In the past, at equilibrium, the temperature distributions within metal networks have primarily been studied using either a physical temperature probe or direct infrared (IR) thermography, but there are limits to the spatial resolution of these cameras and probes, and thus, only average regional temperatures have typically been measured. However, knowledge of local temperatures within the network with a very high spatial resolution is required for ensuring a safe and stable operation. Here, we examine the thermal properties of random metal network thin-film heaters fabricated from crack templates using high-resolution IR microscopy. Importantly, the heaters achieve predominantly uniform temperatures throughout the substrate despite the random crack network structure (e.g., unequal sized polygons created by metal wires), but the temperatures of the wires in the network are observed to be significantly higher than the substrate because of the significant thermal contact resistance at the interface between the metal and the substrate. Last, the electrical breakdown mechanisms within the network are examined through transient IR imaging. In addition to experimental measurements of temperatures, an analytical model of the thermal properties of the network is developed in terms of geometrical parameters and material properties, providing insights into key design rules for such transparent heaters. Beyond this work, the methods and the understanding developed here extend to other network-based heaters and conducting films, including those that are not transparent.

  17. How to Generate Personal Networks: Issues and Tools for a Sociological Perspective

    OpenAIRE

    Bidart, Claire; Charbonneau, Johanne

    2012-01-01

    Document de travail, à paraître dans la revue "Field Methods" en Août 2011; Each name generator produces its own type of personal network and has its own assumptions and boundaries. Following a quick review of these tools and their distinctive characteristics, we propose a new name generator to study the link between sociability and socialization. The sociological point of view leads to building large networks rooted in the social contexts of everyday life rather than networks focused on spec...

  18. Development of Novel Random Network Theory-Based Approaches to Identify Network Interactions among Nitrifying Bacteria

    Energy Technology Data Exchange (ETDEWEB)

    Shi, Cindy

    2015-07-17

    The interactions among different microbial populations in a community could play more important roles in determining ecosystem functioning than species numbers and their abundances, but very little is known about such network interactions at a community level. The goal of this project is to develop novel framework approaches and associated software tools to characterize the network interactions in microbial communities based on high throughput, large scale high-throughput metagenomics data and apply these approaches to understand the impacts of environmental changes (e.g., climate change, contamination) on network interactions among different nitrifying populations and associated microbial communities.

  19. Centralized electricity generation in offshore wind farms using hydraulic networks

    NARCIS (Netherlands)

    Jarquin Laguna, A.

    2017-01-01

    The work presented in this thesis explores a new way of generation, collection and transmission of wind energy inside a wind farm, in which the electrical conversion does not occur during any intermediate conversion step before the energy has reached the offshore central platform. A centralized

  20. Learning Orthographic Structure with Sequential Generative Neural Networks

    Science.gov (United States)

    Testolin, Alberto; Stoianov, Ivilin; Sperduti, Alessandro; Zorzi, Marco

    2016-01-01

    Learning the structure of event sequences is a ubiquitous problem in cognition and particularly in language. One possible solution is to learn a probabilistic generative model of sequences that allows making predictions about upcoming events. Though appealing from a neurobiological standpoint, this approach is typically not pursued in…

  1. Admission control for differentiated services in future generation CDMA networks

    NARCIS (Netherlands)

    Tan, H.-P.; Núñez-Queija, R.; Gabor, A.F.; Boxma, O.J.

    2009-01-01

    Future Generation CDMA wireless systems, e.g., 3G, can simultaneously accommodate flow transmissions of users with widely heterogeneous applications. As radio resources are limited, we propose an admission control rule that protects users with stringent transmission bit-rate requirements ("streaming

  2. Scaling laws for file dissemination in P2P networks with random contacts

    NARCIS (Netherlands)

    Núñez-Queija, R.; Prabhu, B.

    2008-01-01

    In this paper we obtain the scaling law for the mean broadcast time of a file in a P2P network with an initial population of N nodes. In the model, at Poisson rate lambda a node initiates a contact with another node chosen uniformly at random. This contact is said to be successful if the contacted

  3. Relay-aided multi-cell broadcasting with random network coding

    DEFF Research Database (Denmark)

    Lu, Lu; Sun, Fan; Xiao, Ming

    2010-01-01

    We investigate a relay-aided multi-cell broadcasting system using random network codes, where the focus is on devising efficient scheduling algorithms between relay and base stations. Two scheduling algorithms are proposed based on different feedback strategies; namely, a one-step scheduling...

  4. High Performance Ambipolar Field-Effect Transistor of Random Network Carbon Nanotubes

    NARCIS (Netherlands)

    Bisri, Satria Zulkarnaen; Gao, Jia; Derenskyi, Vladimir; Gomulya, Widianta; Iezhokin, Igor; Gordiichuk, Pavlo; Herrmann, Andreas; Loi, Maria Antonietta

    2012-01-01

    Ambipolar field-effect transistors of random network carbon nanotubes are fabricated from an enriched dispersion utilizing a conjugated polymer as the selective purifying medium. The devices exhibit high mobility values for both holes and electrons (3 cm(2)/V.s) with a high on/off ratio (10(6)). The

  5. Active random noise control using adaptive learning rate neural networks with an immune feedback law

    Science.gov (United States)

    Sasaki, Minoru; Kuribayashi, Takumi; Ito, Satoshi

    2005-12-01

    In this paper an active random noise control using adaptive learning rate neural networks with an immune feedback law is presented. The adaptive learning rate strategy increases the learning rate by a small constant if the current partial derivative of the objective function with respect to the weight and the exponential average of the previous derivatives have the same sign, otherwise the learning rate is decreased by a proportion of its value. The use of an adaptive learning rate attempts to keep the learning step size as large as possible without leading to oscillation. In the proposed method, because of the immune feedback law change a learning rate of the neural networks individually and adaptively, it is expected that a cost function minimize rapidly and training time is decreased. Numerical simulations and experiments of active random noise control with the transfer function of the error path will be performed, to validate the convergence properties of the adaptive learning rate Neural Networks with the immune feedback law. Control results show that adaptive learning rate Neural Networks control structure can outperform linear controllers and conventional neural network controller for the active random noise control.

  6. Correlation of Eigenvector Centrality to Other Centrality Measures : Random, Small-World and Real-World Networks

    OpenAIRE

    Xiaojia He; Natarajan Meghanathan

    2016-01-01

    In this paper, we thoroughly investigate correlations of eigenvector centrality to five centrality measures, including degree centrality, betweenness centrality, clustering coefficient centrality, closeness centrality, and farness centrality, of various types of network (random network, small world network, and real-world network). For each network, we compute those six centrality measures, from which the correlation coefficient is determined. Our analysis suggests that the degree centrali...

  7. Real Time Synchronization of Live Broadcast Streams with User Generated Content and Social Network Streams

    NARCIS (Netherlands)

    Stokking, H.M.; Kaptein, A.M.; Veenhuizen, A.T.; Spitters4, M.M.; Niamut, O.A.

    2013-01-01

    This paper describes the work in the FP7 STEER project on augmenting a live broadcast with live user generated content. This user generated content consists of both video content, captured with mobile devices, and social network content, such as Facebook or Twitter messages. To enable multi-source

  8. Observer-based H(infinity) control for networked nonlinear systems with random packet losses.

    Science.gov (United States)

    Li, Jian Guo; Yuan, Jing Qi; Lu, Jun Guo

    2010-01-01

    This paper investigates the observer-based H(infinity) control problem of networked nonlinear systems with global Lipschitz nonlinearities and random communication packet losses. The random packet loss is modelled as a Bernoulli distributed white sequence with a known conditional probability distribution. In the presence of random packet losses, sufficient conditions for the existence of an observer-based feedback controller are derived, such that the closed-loop networked nonlinear system is exponentially stable in the mean-square sense, and a prescribed H(infinity) disturbance-rejection-attenuation performance is also achieved. Then a linear matrix inequality (LMI) approach for designing such an observer-based H(infinity) controller is presented. Finally, a simulation example is used to demonstrate the effectiveness of the proposed method. 2009. Published by Elsevier Ltd.

  9. Generative adversarial networks recover features in astrophysical images of galaxies beyond the deconvolution limit

    Science.gov (United States)

    Schawinski, Kevin; Zhang, Ce; Zhang, Hantian; Fowler, Lucas; Santhanam, Gokula Krishnan

    2017-05-01

    Observations of astrophysical objects such as galaxies are limited by various sources of random and systematic noise from the sky background, the optical system of the telescope and the detector used to record the data. Conventional deconvolution techniques are limited in their ability to recover features in imaging data by the Shannon-Nyquist sampling theorem. Here, we train a generative adversarial network (GAN) on a sample of 4550 images of nearby galaxies at 0.01 < z < 0.02 from the Sloan Digital Sky Survey and conduct 10× cross-validation to evaluate the results. We present a method using a GAN trained on galaxy images that can recover features from artificially degraded images with worse seeing and higher noise than the original with a performance that far exceeds simple deconvolution. The ability to better recover detailed features such as galaxy morphology from low signal to noise and low angular resolution imaging data significantly increases our ability to study existing data sets of astrophysical objects as well as future observations with observatories such as the Large Synoptic Sky Telescope (LSST) and the Hubble and James Webb space telescopes.

  10. Effect of placement of droop based generators in distribution network on small signal stability margin and network loss

    DEFF Research Database (Denmark)

    Dheer, D.K.; Doolla, S.; Bandyopadhyay, S.

    2017-01-01

    For a utility-connected system, issues related to small signal stability with Distributed Generators (DGs) are insignificant due to the presence of a very strong grid. Optimally placed sources in utility connected microgrid system may not be optimal/stable in islanded condition. Among others issues......, small signal stability margin is on the fore. The present research studied the effect of location of droop-controlled DGs on small signal stability margin and network loss on a modified IEEE 13 bus system, an IEEE 33-bus distribution system and a practical 22-bus radial distribution network. A complete...... dynamic model of an islanded microgrid was developed. From stability analysis, the study reports that both location of DGs and choice of droop coefficient have a significant effect on small signal stability, transient response of the system and network losses. The trade-off associated with the network...

  11. Steep optical filtering for next generation optical access networks

    Science.gov (United States)

    Korček, Dušan; Müllerová, Jarmila

    2012-01-01

    Future development of optical access technologies expects increasing traffic and bandwidth. The first candidates to improve Gigabit-capable passive optical networks (GPON) are 10-Gigabit-PON (XG-PON) and wavelength-division multiplexing PON (WDM PON). Another possibility for increasing penetration of current PON branch is to extend number of channels provided on one optical fiber for one PON technology. Coexistence of GPON, XG-PON and WDM-PON in the same infrastructure is a most discussed issue concerning passive optical networks nowadays. Therefore, extensive studies are necessary to design proper and low-cost candidates. International Telecommunication Union (ITU) allocates specific wavelength bands for the present status quo and the future development of access technologies. However, within coexistence, it is necessary to protect signals from various PON technologies from interference. A potential barrier to deploying XG-GPONs and WDM PONs with current GPONs is the usage of broadband light sources and sophisticated optical methods of slicing the light source emission into specific wavelength channels. Protective measures comprise the exact allocation of upstream and downstream signal bands for each technology; the so-called guard bands within the wavelength allocation scheme to protect signals; and optionally the usage of wavelength blocking filters. In this contribution, bandpass thin-film filters are numerically presented for hybrid time division/wavelength division multiplexing TDM/WDM (TWDM) and for simple operation. They have been designed to be tunable and as steep as possible to reject the wavelength bands outside those allocated to TWDM-PON. The TWDM-PON filters are proposed to guarantee steep transmission curves in the vicinity of cut-on/cut-off wavelengths of the specific allocated wavelength bands and facilitate migration from legacy GPON and XG-PON to TWDM-PON. Their deployment protects the allocated wavelength bands from the undesirable interference.

  12. An Architecturally Constrained Model of Random Number Generation and its Application to Modelling the Effect of Generation Rate

    Directory of Open Access Journals (Sweden)

    Nicholas J. Sexton

    2014-07-01

    Full Text Available Random number generation (RNG is a complex cognitive task for human subjects, requiring deliberative control to avoid production of habitual, stereotyped sequences. Under various manipulations (e.g., speeded responding, transcranial magnetic stimulation, or neurological damage the performance of human subjects deteriorates, as reflected in a number of qualitatively distinct, dissociable biases. For example, the intrusion of stereotyped behaviour (e.g., counting increases at faster rates of generation. Theoretical accounts of the task postulate that it requires the integrated operation of multiple, computationally heterogeneous cognitive control ('executive' processes. We present a computational model of RNG, within the framework of a novel, neuropsychologically-inspired cognitive architecture, ESPro. Manipulating the rate of sequence generation in the model reproduced a number of key effects observed in empirical studies, including increasing sequence stereotypy at faster rates. Within the model, this was due to time limitations on the interaction of supervisory control processes, namely, task setting, proposal of responses, monitoring, and response inhibition. The model thus supports the fractionation of executive function into multiple, computationally heterogeneous processes.

  13. Method of derivation and differentiation of mouse embryonic stem cells generating synchronous neuronal networks.

    Science.gov (United States)

    Gazina, Elena V; Morrisroe, Emma; Mendis, Gunarathna D C; Michalska, Anna E; Chen, Joseph; Nefzger, Christian M; Rollo, Benjamin N; Reid, Christopher A; Pera, Martin F; Petrou, Steven

    2018-01-01

    Stem cells-derived neuronal cultures hold great promise for in vitro disease modelling and drug screening. However, currently stem cells-derived neuronal cultures do not recapitulate the functional properties of primary neurons, such as network properties. Cultured primary murine neurons develop networks which are synchronised over large fractions of the culture, whereas neurons derived from mouse embryonic stem cells (ESCs) display only partly synchronised network activity and human pluripotent stem cells-derived neurons have mostly asynchronous network properties. Therefore, strategies to improve correspondence of derived neuronal cultures with primary neurons need to be developed to validate the use of stem cell-derived neuronal cultures as in vitro models. By combining serum-free derivation of ESCs from mouse blastocysts with neuronal differentiation of ESCs in morphogen-free adherent culture we generated neuronal networks with properties recapitulating those of mature primary cortical cultures. After 35days of differentiation ESC-derived neurons developed network activity very similar to that of mature primary cortical neurons. Importantly, ESC plating density was critical for network development. Compared to the previously published methods this protocol generated more synchronous neuronal networks, with high similarity to the networks formed in mature primary cortical culture. We have demonstrated that ESC-derived neuronal networks recapitulating key properties of mature primary cortical networks can be generated by optimising both stem cell derivation and differentiation. This validates the approach of using ESC-derived neuronal cultures for disease modelling and in vitro drug screening. Copyright © 2017 Elsevier B.V. All rights reserved.

  14. Generating Billion-Edge Scale-Free Networks in Seconds: Performance Study of a Novel GPU-based Preferential Attachment Model

    Energy Technology Data Exchange (ETDEWEB)

    Perumalla, Kalyan S. [Oak Ridge National Lab. (ORNL), Oak Ridge, TN (United States); Alam, Maksudul [Oak Ridge National Lab. (ORNL), Oak Ridge, TN (United States)

    2017-10-01

    A novel parallel algorithm is presented for generating random scale-free networks using the preferential-attachment model. The algorithm, named cuPPA, is custom-designed for single instruction multiple data (SIMD) style of parallel processing supported by modern processors such as graphical processing units (GPUs). To the best of our knowledge, our algorithm is the first to exploit GPUs, and also the fastest implementation available today, to generate scale free networks using the preferential attachment model. A detailed performance study is presented to understand the scalability and runtime characteristics of the cuPPA algorithm. In one of the best cases, when executed on an NVidia GeForce 1080 GPU, cuPPA generates a scale free network of a billion edges in less than 2 seconds.

  15. Cooperation of deterministic dynamics and random noise in production of complex syntactical avian song sequences: a neural network model

    Directory of Open Access Journals (Sweden)

    Yuichi eYamashita

    2011-04-01

    Full Text Available How the brain learns and generates temporal sequences is a fundamental issue in neuroscience. The production of birdsongs, a process which involves complex learned sequences, provides researchers with an excellent biological model for this topic. The Bengalese finch in particular learns a highly complex song with syntactical structure. The nucleus HVC (HVC, a premotor nucleus within the avian song system, plays a key role in generating the temporal structures of their songs. From lesion studies, the nucleus interfacialis (NIf projecting to the HVC is considered one of the essential regions that contribute to the complexity of their songs. However, the types of interaction between the HVC and the NIf that can produce complex syntactical songs remain unclear. In order to investigate the function of interactions between the HVC and NIf, we have proposed a neural network model based on previous biological evidence. The HVC is modeled by a recurrent neural network (RNN that learns to generate temporal patterns of songs. The NIf is modeled as a mechanism that provides auditory feedback to the HVC and generates random noise that feeds into the HVC. The model showed that complex syntactical songs can be replicated by simple interactions between deterministic dynamics of the RNN and random noise. In the current study, the plausibility of the model is tested by the comparison between the changes in the songs of actual birds induced by pharmacological inhibition of the NIf and the changes in the songs produced by the model resulting from modification of parameters representing NIf functions. The efficacy of the model demonstrates that the changes of songs induced by pharmacological inhibition of the NIf can be interpreted as a trade-off between the effects of noise and the effects of feedback on the dynamics of the RNN of the HVC. These facts suggest that the current model provides a convincing hypothesis for the functional role of NIf-HVC interaction.

  16. Engineering Online and In-person Social Networks for Physical Activity: A Randomized Trial

    Science.gov (United States)

    Rovniak, Liza S.; Kong, Lan; Hovell, Melbourne F.; Ding, Ding; Sallis, James F.; Ray, Chester A.; Kraschnewski, Jennifer L.; Matthews, Stephen A.; Kiser, Elizabeth; Chinchilli, Vernon M.; George, Daniel R.; Sciamanna, Christopher N.

    2016-01-01

    Background Social networks can influence physical activity, but little is known about how best to engineer online and in-person social networks to increase activity. Purpose To conduct a randomized trial based on the Social Networks for Activity Promotion model to assess the incremental contributions of different procedures for building social networks on objectively-measured outcomes. Methods Physically inactive adults (n = 308, age, 50.3 (SD = 8.3) years, 38.3% male, 83.4% overweight/obese) were randomized to 1 of 3 groups. The Promotion group evaluated the effects of weekly emailed tips emphasizing social network interactions for walking (e.g., encouragement, informational support); the Activity group evaluated the incremental effect of adding an evidence-based online fitness walking intervention to the weekly tips; and the Social Networks group evaluated the additional incremental effect of providing access to an online networking site for walking, and prompting walking/activity across diverse settings. The primary outcome was mean change in accelerometer-measured moderate-to-vigorous physical activity (MVPA), assessed at 3 and 9 months from baseline. Results Participants increased their MVPA by 21.0 mins/week, 95% CI [5.9, 36.1], p = .005, at 3 months, and this change was sustained at 9 months, with no between-group differences. Conclusions Although the structure of procedures for targeting social networks varied across intervention groups, the functional effect of these procedures on physical activity was similar. Future research should evaluate if more powerful reinforcers improve the effects of social network interventions. Trial Registration Number NCT01142804 PMID:27405724

  17. Engineering Online and In-Person Social Networks for Physical Activity: A Randomized Trial.

    Science.gov (United States)

    Rovniak, Liza S; Kong, Lan; Hovell, Melbourne F; Ding, Ding; Sallis, James F; Ray, Chester A; Kraschnewski, Jennifer L; Matthews, Stephen A; Kiser, Elizabeth; Chinchilli, Vernon M; George, Daniel R; Sciamanna, Christopher N

    2016-12-01

    Social networks can influence physical activity, but little is known about how best to engineer online and in-person social networks to increase activity. The purpose of this study was to conduct a randomized trial based on the Social Networks for Activity Promotion model to assess the incremental contributions of different procedures for building social networks on objectively measured outcomes. Physically inactive adults (n = 308, age, 50.3 (SD = 8.3) years, 38.3 % male, 83.4 % overweight/obese) were randomized to one of three groups. The Promotion group evaluated the effects of weekly emailed tips emphasizing social network interactions for walking (e.g., encouragement, informational support); the Activity group evaluated the incremental effect of adding an evidence-based online fitness walking intervention to the weekly tips; and the Social Networks group evaluated the additional incremental effect of providing access to an online networking site for walking as well as prompting walking/activity across diverse settings. The primary outcome was mean change in accelerometer-measured moderate-to-vigorous physical activity (MVPA), assessed at 3 and 9 months from baseline. Participants increased their MVPA by 21.0 min/week, 95 % CI [5.9, 36.1], p = .005, at 3 months, and this change was sustained at 9 months, with no between-group differences. Although the structure of procedures for targeting social networks varied across intervention groups, the functional effect of these procedures on physical activity was similar. Future research should evaluate if more powerful reinforcers improve the effects of social network interventions. The trial was registered with the ClinicalTrials.gov (NCT01142804).

  18. Complexity and properties of a multidimensional Cat-Hadamard map for pseudo random number generation

    Science.gov (United States)

    Kim Hue, Ta Thi; Hoang, Thang Manh

    2017-07-01

    This paper presents a novel method to extend the Cat map from 2-dimension to higher dimension using the fast pseudo Hadamard Transform, and the resulted maps are called Cat-Hadamard maps. The complexity and properties of Cat-Hadamard maps are investigated under the point of view for cryptographic applications. In addition, we propose a method for constructing a pseudo random number generator using a novel design concept of the high dimensional Cat map. The simulation results show that the proposed generator fulfilled all the statistic tests of the NIST SP 800-90 A.

  19. Application of clustering analysis in the prediction of photovoltaic power generation based on neural network

    Science.gov (United States)

    Cheng, K.; Guo, L. M.; Wang, Y. K.; Zafar, M. T.

    2017-11-01

    In order to select effective samples in the large number of data of PV power generation years and improve the accuracy of PV power generation forecasting model, this paper studies the application of clustering analysis in this field and establishes forecasting model based on neural network. Based on three different types of weather on sunny, cloudy and rainy days, this research screens samples of historical data by the clustering analysis method. After screening, it establishes BP neural network prediction models using screened data as training data. Then, compare the six types of photovoltaic power generation prediction models before and after the data screening. Results show that the prediction model combining with clustering analysis and BP neural networks is an effective method to improve the precision of photovoltaic power generation.

  20. Column Generation for Transmission Switching of Electricity Networks with Unit Commitment

    DEFF Research Database (Denmark)

    Villumsen, Jonas Christoffer; Philpott, Andy B.

    2011-01-01

    This paper presents the problem of finding the minimum cost dispatch and commitment of power generation units in a transmission network with active switching.We use the term active switching to denote the use of switches to optimize network topology in an operational context. We propose a Dantzig......-Wolfe reformulation and a novel column generation framework to solve the problem efficiently. Preliminary results are presented for the IEEE-118 bus network with 19 generator units. Active switching is shown to reduce total cost by up to 15 % for a particular 24-hour period. Furthermore, the need for generator...... startups is reduced by 1. Instances with limited switching, some of which are intractable for commercial solvers, are shown to solve to optimality in reasonable time....