Topology-selective jamming of fully-connected, code-division random-access networks
NASA Technical Reports Server (NTRS)
Polydoros, Andreas; Cheng, Unjeng
1990-01-01
The purpose is to introduce certain models of topology selective stochastic jamming and examine its impact on a class of fully-connected, spread-spectrum, slotted ALOHA-type random access networks. The theory covers dedicated as well as half-duplex units. The dominant role of the spatial duty factor is established, and connections with the dual concept of time selective jamming are discussed. The optimal choices of coding rate and link access parameters (from the users' side) and the jamming spatial fraction are numerically established for DS and FH spreading.
Kartsakli, Elli; Antonopoulos, Angelos; Alonso, Luis; Verikoukis, Christos
2014-01-01
Relay sensor networks are often employed in end-to-end healthcare applications to facilitate the information flow between patient worn sensors and the medical data center. Medium access control (MAC) protocols, based on random linear network coding (RLNC), are a novel and suitable approach to efficiently handle data dissemination. However, several challenges arise, such as additional delays introduced by the intermediate relay nodes and decoding failures, due to channel errors. In this paper, we tackle these issues by adopting a cloud architecture where the set of relays is connected to a coordinating entity, called cloud manager. We propose a cloud-assisted RLNC-based MAC protocol (CLNC-MAC) and develop a mathematical model for the calculation of the key performance metrics, namely the system throughput, the mean completion time for data delivery and the energy efficiency. We show the importance of central coordination in fully exploiting the gain of RLNC under error-prone channels. PMID:24618727
MATIN: a random network coding based framework for high quality peer-to-peer live video streaming.
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. PMID:23940530
MATIN: A Random Network Coding Based Framework for High Quality Peer-to-Peer Live Video Streaming
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. PMID:23940530
Minimal Increase Network Coding for Dynamic Networks
Wu, Yanxia
2016-01-01
Because of the mobility, computing power and changeable topology of dynamic networks, it is difficult for random linear network coding (RLNC) in static networks to satisfy the requirements of dynamic networks. To alleviate this problem, a minimal increase network coding (MINC) algorithm is proposed. By identifying the nonzero elements of an encoding vector, it selects blocks to be encoded on the basis of relationship between the nonzero elements that the controls changes in the degrees of the blocks; then, the encoding time is shortened in a dynamic network. The results of simulations show that, compared with existing encoding algorithms, the MINC algorithm provides reduced computational complexity of encoding and an increased probability of delivery. PMID:26867211
Minimal Increase Network Coding for Dynamic Networks.
Zhang, Guoyin; Fan, Xu; Wu, Yanxia
2016-01-01
Because of the mobility, computing power and changeable topology of dynamic networks, it is difficult for random linear network coding (RLNC) in static networks to satisfy the requirements of dynamic networks. To alleviate this problem, a minimal increase network coding (MINC) algorithm is proposed. By identifying the nonzero elements of an encoding vector, it selects blocks to be encoded on the basis of relationship between the nonzero elements that the controls changes in the degrees of the blocks; then, the encoding time is shortened in a dynamic network. The results of simulations show that, compared with existing encoding algorithms, the MINC algorithm provides reduced computational complexity of encoding and an increased probability of delivery. PMID:26867211
NASA Astrophysics Data System (ADS)
Donnelly, Isaac
Random walks on lattices are a well used model for diffusion on continuum. They have been to model subdiffusive systems, systems with forcing and reactions as well as a combination of the three. We extend the traditional random walk framework to the network to obtain novel results. As an example due to the small graph diameter, the early time behaviour of subdiffusive dynamics dominates the observed system which has implications for models of the brain or airline networks. I would like to thank the Australian American Fulbright Association.
Quantifying randomness in real networks
NASA Astrophysics Data System (ADS)
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.
Quantifying randomness in real networks.
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-01-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. PMID:26482121
Quantifying randomness in real networks
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-01-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. PMID:26482121
Strongly Secure Linear Network Coding
NASA Astrophysics Data System (ADS)
Harada, Kunihiko; Yamamoto, Hirosuke
In a network with capacity h for multicast, information Xh=(X1, X2, …, Xh) can be transmitted from a source node to sink nodes without error by a linear network code. Furthermore, secret information Sr=(S1, S2, …, Sr) can be transmitted securely against wiretappers by k-secure network coding for k≤h-r. In this case, no information of the secret leaks out even if an adversary wiretaps k edges, i. e. channels. However, if an adversary wiretaps k+1 edges, some Si may leak out explicitly. In this paper, we propose strongly k-secure network coding based on strongly secure ramp secret sharing schemes. In this coding, no information leaks out for every (Si1, Si2, …,Sir-j) even if an adversary wiretaps k+j channels. We also give an algorithm to construct a strongly k-secure network code directly and a transform to convert a nonsecure network code to a strongly k-secure network code. Furthermore, some sufficient conditions of alphabet size to realize the strongly k-secure network coding are derived for the case of k
NASA Astrophysics Data System (ADS)
Padrino, Juan C.; Zhang, Duan Z.
2015-11-01
The ensemble phase averaging technique is applied to model mass transport in a porous medium. The porous material is idealized as an ensemble of random networks, where each network consists of a set of junction points representing the pores and tortuous channels connecting them. Inside a channel, fluid transport is assumed to be governed by the one-dimensional diffusion equation. Mass balance leads to an integro-differential equation for the pores mass density. Instead of attempting to solve this equation, and equivalent set of partial differential equations is derived whose solution is sought numerically. As a test problem, we consider the one-dimensional diffusion of a substance from one end to the other in a bounded domain. For a statistically homogeneous and isotropic material, results show that for relatively large times the pore mass density evolution from the new theory is significantly delayed in comparison with the solution from the classical diffusion equation. In the short-time case, when the solution evolves with time as if the domain were semi-infinite, numerical results indicate that the pore mass density becomes a function of the similarity variable xt- 1 / 4 rather than xt- 1 / 2 characteristic of classical diffusion. This result was verified analytically. Possible applications of this framework include flow in gas shales. Work supported by LDRD project of LANL.
Random coding strategies for minimum entropy
NASA Technical Reports Server (NTRS)
Posner, E. C.
1975-01-01
This paper proves that there exists a fixed random coding strategy for block coding a memoryless information source to achieve the absolute epsilon entropy of the source. That is, the strategy can be chosen independent of the block length. The principal new tool is an easy result on the semicontinuity of the relative entropy functional of one probability distribution with respect to another. The theorem generalizes a result from rate-distortion theory to the 'zero-infinity' case.
Random errors in egocentric networks.
Almquist, Zack W
2012-10-01
The systematic errors that are induced by a combination of human memory limitations and common survey design and implementation have long been studied in the context of egocentric networks. Despite this, little if any work exists in the area of random error analysis on these same networks; this paper offers a perspective on the effects of random errors on egonet analysis, as well as the effects of using egonet measures as independent predictors in linear models. We explore the effects of false-positive and false-negative error in egocentric networks on both standard network measures and on linear models through simulation analysis on a ground truth egocentric network sample based on facebook-friendships. Results show that 5-20% error rates, which are consistent with error rates known to occur in ego network data, can cause serious misestimation of network properties and regression parameters. PMID:23878412
Random errors in egocentric networks
Almquist, Zack W.
2013-01-01
The systematic errors that are induced by a combination of human memory limitations and common survey design and implementation have long been studied in the context of egocentric networks. Despite this, little if any work exists in the area of random error analysis on these same networks; this paper offers a perspective on the effects of random errors on egonet analysis, as well as the effects of using egonet measures as independent predictors in linear models. We explore the effects of false-positive and false-negative error in egocentric networks on both standard network measures and on linear models through simulation analysis on a ground truth egocentric network sample based on facebook-friendships. Results show that 5–20% error rates, which are consistent with error rates known to occur in ego network data, can cause serious misestimation of network properties and regression parameters. PMID:23878412
Secure Communication with Network Coding
NASA Astrophysics Data System (ADS)
Cao, Zhanghua; Tang, Yuansheng; Luo, Jinquan
In this paper, we consider the problem of secure communication over wiretap multicast networks. Noticing that network coding renders the intermediate nodes to mix information from different data flows, we propose a secure communication scheme based on cryptographic means and network coding. Specifically, we employ a confidential cryptosystem to encrypt the source message packets, then treat the secret key as a message packet and mix the key with the obtained cryptograms. Furthermore, we can prove that, under suitable conditions, the wiretapper is unable to gain the secret key. Meanwhile, the confidential cryptosystem prohibits the wiretapper from extracting meaningful information from the obtained cryptograms. Our scheme doesn't need a private channel to transmit the secret key and enables the utilization of network capacity to reach 1 n n.
Entanglement-assisted random access codes
Pawlowski, Marcin; Zukowski, Marek
2010-04-15
An (n,m,p) random access code (RAC) makes it possible to encode n bits in an m-bit message in such a way that a receiver of the message can guess any of the original n bits with probability p greater than (1/2). In quantum RACs (QRACs), one transmits n qubits. The full set of primitive entanglement-assisted random access codes (EARACs) is introduced, in which parties are allowed to share a two-qubit singlet. It is shown that via a concatenation of these, one can build for any n an (n,1,p) EARAC. QRACs for n>3 exist only if parties also share classical randomness. We show that EARACs outperform the best of known QRACs not only in the success probabilities but also in the amount of communication needed in the preparatory stage of the protocol. Upper bounds on the performance of EARACs are given and shown to limit also QRACs.
Universality in random quantum networks
NASA Astrophysics Data System (ADS)
Novotný, Jaroslav; Alber, Gernot; Jex, Igor
2015-12-01
Networks constitute efficient tools for assessing universal features of complex systems. In physical contexts, classical as well as quantum networks are used to describe a wide range of phenomena, such as phase transitions, intricate aspects of many-body quantum systems, or even characteristic features of a future quantum internet. Random quantum networks and their associated directed graphs are employed for capturing statistically dominant features of complex quantum systems. Here, we develop an efficient iterative method capable of evaluating the probability of a graph being strongly connected. It is proven that random directed graphs with constant edge-establishing probability are typically strongly connected, i.e., any ordered pair of vertices is connected by a directed path. This typical topological property of directed random graphs is exploited to demonstrate universal features of the asymptotic evolution of large random qubit networks. These results are independent of our knowledge of the details of the network topology. These findings suggest that other highly complex networks, such as a future quantum internet, may also exhibit similar universal properties.
Percolation on correlated random networks
NASA Astrophysics Data System (ADS)
Agliari, E.; Cioli, C.; Guadagnini, E.
2011-09-01
We consider a class of random, weighted networks, obtained through a redefinition of patterns in an Hopfield-like model, and, by performing percolation processes, we get information about topology and resilience properties of the networks themselves. Given the weighted nature of the graphs, different kinds of bond percolation can be studied: stochastic (deleting links randomly) and deterministic (deleting links based on rank weights), each mimicking a different physical process. The evolution of the network is accordingly different, as evidenced by the behavior of the largest component size and of the distribution of cluster sizes. In particular, we can derive that weak ties are crucial in order to maintain the graph connected and that, when they are the most prone to failure, the giant component typically shrinks without abruptly breaking apart; these results have been recently evidenced in several kinds of social networks.
Secure Computation from Random Error Correcting Codes
NASA Astrophysics Data System (ADS)
Chen, Hao; Cramer, Ronald; Goldwasser, Shafi; de Haan, Robbert; Vaikuntanathan, Vinod
Secure computation consists of protocols for secure arithmetic: secret values are added and multiplied securely by networked processors. The striking feature of secure computation is that security is maintained even in the presence of an adversary who corrupts a quorum of the processors and who exercises full, malicious control over them. One of the fundamental primitives at the heart of secure computation is secret-sharing. Typically, the required secret-sharing techniques build on Shamir's scheme, which can be viewed as a cryptographic twist on the Reed-Solomon error correcting code. In this work we further the connections between secure computation and error correcting codes. We demonstrate that threshold secure computation in the secure channels model can be based on arbitrary codes. For a network of size n, we then show a reduction in communication for secure computation amounting to a multiplicative logarithmic factor (in n) compared to classical methods for small, e.g., constant size fields, while tolerating t < ({1 over 2} - {ɛ}) {n} players to be corrupted, where ɛ> 0 can be arbitrarily small. For large networks this implies considerable savings in communication. Our results hold in the broadcast/negligible error model of Rabin and Ben-Or, and complement results from CRYPTO 2006 for the zero-error model of Ben-Or, Goldwasser and Wigderson (BGW). Our general theory can be extended so as to encompass those results from CRYPTO 2006 as well. We also present a new method for constructing high information rate ramp schemes based on arbitrary codes, and in particular we give a new construction based on algebraic geometry codes.
BCH codes for large IC random-access memory systems
NASA Technical Reports Server (NTRS)
Lin, S.; Costello, D. J., Jr.
1983-01-01
In this report some shortened BCH codes for possible applications to large IC random-access memory systems are presented. These codes are given by their parity-check matrices. Encoding and decoding of these codes are discussed.
Joint Channel-Network Coding (JCNC) for Distributed Storage in Wireless Network
NASA Astrophysics Data System (ADS)
Wang, Ning; Lin, Jiaru
We propose to construct a joint channel-network coding (knosswn as Random Linear Coding) scheme based on improved turbo codes for the distributed storage in wireless communication network with k data nodes, s storage nodes (kNetwork Coding (JCNC) system benefits from network coding, compared with that of system without network coding based only on store and forward (S-F) approach. Another helpful parameter: node degree (L) indicates how many storage nodes one data packet should fall onto. L characterizes the en/decoding complexity of the system. Moreover, this proposed framework can be extended to ad-hoc and sensor network easily.
Applications of Coding in Network Communications
ERIC Educational Resources Information Center
Chang, Christopher SungWook
2012-01-01
This thesis uses the tool of network coding to investigate fast peer-to-peer file distribution, anonymous communication, robust network construction under uncertainty, and prioritized transmission. In a peer-to-peer file distribution system, we use a linear optimization approach to show that the network coding framework significantly simplifies…
Coherent diffractive imaging using randomly coded masks
Seaberg, Matthew H.; D'Aspremont, Alexandre; Turner, Joshua J.
2015-12-07
We experimentally demonstrate an extension to coherent diffractive imaging that encodes additional information through the use of a series of randomly coded masks, removing the need for typical object-domain constraints while guaranteeing a unique solution to the phase retrieval problem. Phase retrieval is performed using a numerical convex relaxation routine known as “PhaseCut,” an iterative algorithm known for its stability and for its ability to find the global solution, which can be found efficiently and which is robust to noise. The experiment is performed using a laser diode at 532.2 nm, enabling rapid prototyping for future X-ray synchrotron and even free electron laser experiments.
Hierarchy in directed random networks
NASA Astrophysics Data System (ADS)
Mones, Enys
2013-02-01
In recent years, the theory and application of complex networks have been quickly developing in a markable way due to the increasing amount of data from real systems and the fruitful application of powerful methods used in statistical physics. Many important characteristics of social or biological systems can be described by the study of their underlying structure of interactions. Hierarchy is one of these features that can be formulated in the language of networks. In this paper we present some (qualitative) analytic results on the hierarchical properties of random network models with zero correlations and also investigate, mainly numerically, the effects of different types of correlations. The behavior of the hierarchy is different in the absence and the presence of giant components. We show that the hierarchical structure can be drastically different if there are one-point correlations in the network. We also show numerical results suggesting that the hierarchy does not change monotonically with the correlations and there is an optimal level of nonzero correlations maximizing the level of hierarchy.
Organization of growing random networks
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.
Clique percolation in random networks.
Derényi, Imre; Palla, Gergely; Vicsek, Tamás
2005-04-29
The notion of k-clique percolation in random graphs is introduced, where k is the size of the complete subgraphs whose large scale organizations are analytically and numerically investigated. For the Erdos-Rényi graph of N vertices we obtain that the percolation transition of k-cliques takes place when the probability of two vertices being connected by an edge reaches the threshold p(c) (k) = [(k - 1)N](-1/(k - 1)). At the transition point the scaling of the giant component with N is highly nontrivial and depends on k. We discuss why clique percolation is a novel and efficient approach to the identification of overlapping communities in large real networks. PMID:15904198
Clique Percolation in Random Networks
NASA Astrophysics Data System (ADS)
Derényi, Imre; Palla, Gergely; Vicsek, Tamás
2005-04-01
The notion of k-clique percolation in random graphs is introduced, where k is the size of the complete subgraphs whose large scale organizations are analytically and numerically investigated. For the Erdős-Rényi graph of N vertices we obtain that the percolation transition of k-cliques takes place when the probability of two vertices being connected by an edge reaches the threshold pc(k)=[(k-1)N]-1/(k-1). At the transition point the scaling of the giant component with N is highly nontrivial and depends on k. We discuss why clique percolation is a novel and efficient approach to the identification of overlapping communities in large real networks.
Efficient generation of large random networks
NASA Astrophysics Data System (ADS)
Batagelj, Vladimir; Brandes, Ulrik
2005-03-01
Random networks are frequently generated, for example, to investigate the effects of model parameters on network properties or to test the performance of algorithms. Recent interest in the statistics of large-scale networks sparked a growing demand for network generators that can generate large numbers of large networks quickly. We here present simple and efficient algorithms to randomly generate networks according to the most commonly used models. Their running time and space requirement is linear in the size of the network generated, and they are easily implemented.
On Delay and Security in Network Coding
ERIC Educational Resources Information Center
Dikaliotis, Theodoros K.
2013-01-01
In this thesis, delay and security issues in network coding are considered. First, we study the delay incurred in the transmission of a fixed number of packets through acyclic networks comprised of erasure links. The two transmission schemes studied are routing with hop-by-hop retransmissions, where every node in the network simply stores and…
Network Coding for Function Computation
ERIC Educational Resources Information Center
Appuswamy, Rathinakumar
2011-01-01
In this dissertation, the following "network computing problem" is considered. Source nodes in a directed acyclic network generate independent messages and a single receiver node computes a target function f of the messages. The objective is to maximize the average number of times f can be computed per network usage, i.e., the "computing…
Systematic network coding for two-hop lossy transmissions
NASA Astrophysics Data System (ADS)
Li, Ye; Blostein, Steven; Chan, Wai-Yip
2015-12-01
In this paper, we consider network transmissions over a single or multiple parallel two-hop lossy paths. These scenarios occur in applications such as sensor networks or WiFi offloading. Random linear network coding (RLNC), where previously received packets are re-encoded at intermediate nodes and forwarded, is known to be a capacity-achieving approach for these networks. However, a major drawback of RLNC is its high encoding and decoding complexity. In this work, a systematic network coding method is proposed. We show through both analysis and simulation that the proposed method achieves higher end-to-end rate as well as lower computational cost than RLNC for finite field sizes and finite-sized packet transmissions.
The weight distribution and randomness of linear codes
NASA Technical Reports Server (NTRS)
Cheung, K.-M.
1989-01-01
Finding the weight distributions of block codes is a problem of theoretical and practical interest. Yet the weight distributions of most block codes are still unknown except for a few classes of block codes. Here, by using the inclusion and exclusion principle, an explicit formula is derived which enumerates the complete weight distribution of an (n,k,d) linear code using a partially known weight distribution. This expression is analogous to the Pless power-moment identities - a system of equations relating the weight distribution of a linear code to the weight distribution of its dual code. Also, an approximate formula for the weight distribution of most linear (n,k,d) codes is derived. It is shown that for a given linear (n,k,d) code over GF(q), the ratio of the number of codewords of weight u to the number of words of weight u approaches the constant Q = q(-)(n-k) as u becomes large. A relationship between the randomness of a linear block code and the minimum distance of its dual code is given, and it is shown that most linear block codes with rigid algebraic and combinatorial structure also display certain random properties which make them similar to random codes with no structure at all.
Networked Dynamic Systems: Identification, Controllability, and Randomness
NASA Astrophysics Data System (ADS)
Nabi-Abdolyousefi, Marzieh
The presented dissertation aims to develop a graph-centric framework for the analysis and synthesis of networked dynamic systems (NDS) consisting of multiple dynamic units that interact via an interconnection topology. We examined three categories of network problems, namely, identification, controllability, and randomness. In network identification, as a subclass of inverse problems, we made an explicit relation between the input-output behavior of an NDS and the underlying interacting network. In network controllability, we provided structural and algebraic insights into features of the network that enable external signal(s) to control the state of the nodes in the network for certain classes of interconnections, namely, path, circulant, and Cartesian networks. We also examined the relation between network controllability and the symmetry structure of the graph. Motivated by the analysis results for the controllability and observability of deterministic networks, a natural question is whether randomness in the network layer or in the layer of inputs and outputs generically leads to favorable system theoretic properties. In this direction, we examined system theoretic properties of random networks including controllability, observability, and performance of optimal feedback controllers and estimators. We explored some of the ramifications of such an analysis framework in opinion dynamics over social networks and sensor networks in estimating the real-time position of a Seaglider from experimental data.
Self-Control in Sparsely Coded Networks
NASA Astrophysics Data System (ADS)
Dominguez, D. R. C.; Bollé, D.
1998-03-01
A complete self-control mechanism is proposed in the dynamics of neural networks through the introduction of a time-dependent threshold, determined in function of both the noise and the pattern activity in the network. Especially for sparsely coded models this mechanism is shown to considerably improve the storage capacity, the basins of attraction, and the mutual information content.
Coding for spread-spectrum communications networks
NASA Astrophysics Data System (ADS)
Kim, Bal G.
1987-03-01
The multiple-access capability of a frequency-hopp packet radio network is investigated from a coding point of view. The achievable region of code rate and channel traffic and the normalized throughput are considered as performance measures. We model the communication system from the modulator input to the demodulator output as an I-user interference channel, and evaluate the asymptotic performance of various coding schemes for channels with perfect side information, no side information, and imperfect side information. The coding schemes being considered are Reed-Solomon codes, concatenated codes, and parallel decoding schemes. We derive the optimal code rate and the optimal channel traffic at which the normalized throughput is maximized, and from these optimum values the asymptotic maximum normalized throughput is derived. The results are then compared with channel capacities.
Spike Code Flow in Cultured Neuronal Networks.
Tamura, Shinichi; Nishitani, Yoshi; Hosokawa, Chie; Miyoshi, Tomomitsu; Sawai, Hajime; Kamimura, Takuya; Yagi, Yasushi; Mizuno-Matsumoto, Yuko; Chen, Yen-Wei
2016-01-01
We observed spike trains produced by one-shot electrical stimulation with 8 × 8 multielectrodes in cultured neuronal networks. Each electrode accepted spikes from several neurons. We extracted the short codes from spike trains and obtained a code spectrum with a nominal time accuracy of 1%. We then constructed code flow maps as movies of the electrode array to observe the code flow of "1101" and "1011," which are typical pseudorandom sequence such as that we often encountered in a literature and our experiments. They seemed to flow from one electrode to the neighboring one and maintained their shape to some extent. To quantify the flow, we calculated the "maximum cross-correlations" among neighboring electrodes, to find the direction of maximum flow of the codes with lengths less than 8. Normalized maximum cross-correlations were almost constant irrespective of code. Furthermore, if the spike trains were shuffled in interval orders or in electrodes, they became significantly small. Thus, the analysis suggested that local codes of approximately constant shape propagated and conveyed information across the network. Hence, the codes can serve as visible and trackable marks of propagating spike waves as well as evaluating information flow in the neuronal network. PMID:27217825
Spike Code Flow in Cultured Neuronal Networks
Tamura, Shinichi; Nishitani, Yoshi; Miyoshi, Tomomitsu; Sawai, Hajime; Kamimura, Takuya; Yagi, Yasushi; Mizuno-Matsumoto, Yuko; Chen, Yen-Wei
2016-01-01
We observed spike trains produced by one-shot electrical stimulation with 8 × 8 multielectrodes in cultured neuronal networks. Each electrode accepted spikes from several neurons. We extracted the short codes from spike trains and obtained a code spectrum with a nominal time accuracy of 1%. We then constructed code flow maps as movies of the electrode array to observe the code flow of “1101” and “1011,” which are typical pseudorandom sequence such as that we often encountered in a literature and our experiments. They seemed to flow from one electrode to the neighboring one and maintained their shape to some extent. To quantify the flow, we calculated the “maximum cross-correlations” among neighboring electrodes, to find the direction of maximum flow of the codes with lengths less than 8. Normalized maximum cross-correlations were almost constant irrespective of code. Furthermore, if the spike trains were shuffled in interval orders or in electrodes, they became significantly small. Thus, the analysis suggested that local codes of approximately constant shape propagated and conveyed information across the network. Hence, the codes can serve as visible and trackable marks of propagating spike waves as well as evaluating information flow in the neuronal network. PMID:27217825
MINET (momentum integral network) code documentation
Van Tuyle, G J; Nepsee, T C; Guppy, J G
1989-12-01
The MINET computer code, developed for the transient analysis of fluid flow and heat transfer, is documented in this four-part reference. In Part 1, the MINET models, which are based on a momentum integral network method, are described. The various aspects of utilizing the MINET code are discussed in Part 2, The User's Manual. The third part is a code description, detailing the basic code structure and the various subroutines and functions that make up MINET. In Part 4, example input decks, as well as recent validation studies and applications of MINET are summarized. 32 refs., 36 figs., 47 tabs.
Autoregressive cascades on random networks
NASA Astrophysics Data System (ADS)
Iyer, Srikanth K.; Vaze, Rahul; Narasimha, Dheeraj
2016-04-01
A network cascade model that captures many real-life correlated node failures in large networks via load redistribution is studied. The considered model is well suited for networks where physical quantities are transmitted, e.g., studying large scale outages in electrical power grids, gridlocks in road networks, and connectivity breakdown in communication networks, etc. For this model, a phase transition is established, i.e., existence of critical thresholds above or below which a small number of node failures lead to a global cascade of network failures or not. Theoretical bounds are obtained for the phase transition on the critical capacity parameter that determines the threshold above and below which cascade appears or disappears, respectively, that are shown to closely follow numerical simulation results.
Multicast Reduction Network Source Code
Lee, G.
2006-12-19
MRNet is a software tree-based overlay network developed at the University of Wisconsin, Madison that provides a scalable communication mechanism for parallel tools. MRNet, uses a tree topology of networked processes between a user tool and distributed tool daemons. This tree topology allows scalable multicast communication from the tool to the daemons. The internal nodes of the tree can be used to distribute computation and alalysis on data sent from the tool daemons to the tool. This release covers minor implementation to port this software to the BlueGene/L architecuture and for use with a new implementation of the Dynamic Probe Class Library.
Navigability of interconnected networks under random failures
De Domenico, Manlio; Solé-Ribalta, Albert; Gómez, Sergio; Arenas, Alex
2014-01-01
Assessing the navigability of interconnected networks (transporting information, people, or goods) under eventual random failures is of utmost importance to design and protect critical infrastructures. Random walks are a good proxy to determine this navigability, specifically the coverage time of random walks, which is a measure of the dynamical functionality of the network. Here, we introduce the theoretical tools required to describe random walks in interconnected networks accounting for structure and dynamics inherent to real systems. We develop an analytical approach for the covering time of random walks in interconnected networks and compare it with extensive Monte Carlo simulations. Generally speaking, interconnected networks are more resilient to random failures than their individual layers per se, and we are able to quantify this effect. As an application––which we illustrate by considering the public transport of London––we show how the efficiency in exploring the multiplex critically depends on layers’ topology, interconnection strengths, and walk strategy. Our findings are corroborated by data-driven simulations, where the empirical distribution of check-ins and checks-out is considered and passengers travel along fastest paths in a network affected by real disruptions. These findings are fundamental for further development of searching and navigability strategies in real interconnected systems. PMID:24912174
Multicast Reduction Network Source Code
2006-12-19
MRNet is a software tree-based overlay network developed at the University of Wisconsin, Madison that provides a scalable communication mechanism for parallel tools. MRNet, uses a tree topology of networked processes between a user tool and distributed tool daemons. This tree topology allows scalable multicast communication from the tool to the daemons. The internal nodes of the tree can be used to distribute computation and alalysis on data sent from the tool daemons to themore » tool. This release covers minor implementation to port this software to the BlueGene/L architecuture and for use with a new implementation of the Dynamic Probe Class Library.« less
Random walks on generalized Koch networks
NASA Astrophysics Data System (ADS)
Sun, Weigang
2013-10-01
For deterministically growing networks, it is a theoretical challenge to determine the topological properties and dynamical processes. In this paper, we study random walks on generalized Koch networks with features that include an initial state that is a globally connected network to r nodes. In each step, every existing node produces m complete graphs. We then obtain the analytical expressions for first passage time (FPT), average return time (ART), i.e. the average of FPTs for random walks from node i to return to the starting point i for the first time, and average sending time (AST), defined as the average of FPTs from a hub node to all other nodes, excluding the hub itself with regard to network parameters m and r. For this family of Koch networks, the ART of the new emerging nodes is identical and increases with the parameters m or r. In addition, the AST of our networks grows with network size N as N ln N and also increases with parameter m. The results obtained in this paper are the generalizations of random walks for the original Koch network.
Dynamic regimes of random fuzzy logic networks
NASA Astrophysics Data System (ADS)
Wittmann, Dominik M.; Theis, Fabian J.
2011-01-01
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 Gödel 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 Gödel 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.
Random matrix approach to shareholding networks
NASA Astrophysics Data System (ADS)
Souma, Wataru; Fujiwara, Yoshi; Aoyama, Hideaki
2004-12-01
A shareholding network is represented by a symmetrical adjacency matrix. The random matrix theoretical approach to this matrix shows that the spectrum follows a power law distribution, ρ(λ)∼|λ|, in the tail part. It is also shown that the degree distribution of this network follows a power law distribution, p(k)∼k, in the large degree range. The scaling law δ=2γ-1 is found in this network. The reason why this relation holds is attributed to the local tree-like structure of the shareholding network.
Random walk centrality in interconnected multilayer networks
NASA Astrophysics Data System (ADS)
Solé-Ribalta, Albert; De Domenico, Manlio; Gómez, Sergio; Arenas, Alex
2016-06-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) influent 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.
Sampled-Data Consensus Over Random Networks
NASA Astrophysics Data System (ADS)
Wu, Junfeng; Meng, Ziyang; Yang, Tao; Shi, Guodong; Johansson, Karl Henrik
2016-09-01
This paper considers the consensus problem for a network of nodes with random interactions and sampled-data control actions. We first show that consensus in expectation, in mean square, and almost surely are equivalent for a general random network model when the inter-sampling interval and network size satisfy a simple relation. The three types of consensus are shown to be simultaneously achieved over an independent or a Markovian random network defined on an underlying graph with a directed spanning tree. For both independent and Markovian random network models, necessary and sufficient conditions for mean-square consensus are derived in terms of the spectral radius of the corresponding state transition matrix. These conditions are then interpreted as the existence of critical value on the inter-sampling interval, below which global mean-square consensus is achieved and above which the system diverges in mean-square sense for some initial states. Finally, we establish an upper bound on the inter-sampling interval below which almost sure consensus is reached, and a lower bound on the inter-sampling interval above which almost sure divergence is reached. Some numerical simulations are given to validate the theoretical results and some discussions on the critical value of the inter-sampling intervals for the mean-square consensus are provided.
A Network Coding Based Routing Protocol for Underwater Sensor Networks
Wu, Huayang; Chen, Min; Guan, Xin
2012-01-01
Due to the particularities of the underwater environment, some negative factors will seriously interfere with data transmission rates, reliability of data communication, communication range, and network throughput and energy consumption of underwater sensor networks (UWSNs). Thus, full consideration of node energy savings, while maintaining a quick, correct and effective data transmission, extending the network life cycle are essential when routing protocols for underwater sensor networks are studied. In this paper, we have proposed a novel routing algorithm for UWSNs. To increase energy consumption efficiency and extend network lifetime, we propose a time-slot based routing algorithm (TSR).We designed a probability balanced mechanism and applied it to TSR. The theory of network coding is introduced to TSBR to meet the requirement of further reducing node energy consumption and extending network lifetime. Hence, time-slot based balanced network coding (TSBNC) comes into being. We evaluated the proposed time-slot based balancing routing algorithm and compared it with other classical underwater routing protocols. The simulation results show that the proposed protocol can reduce the probability of node conflicts, shorten the process of routing construction, balance energy consumption of each node and effectively prolong the network lifetime. PMID:22666045
Network coding for quantum cooperative multicast
NASA Astrophysics Data System (ADS)
Xu, Gang; Chen, Xiu-Bo; Li, Jing; Wang, Cong; Yang, Yi-Xian; Li, Zongpeng
2015-11-01
Cooperative communication is starting to attract substantial research attention in quantum information theory. However, given a specific network, it is still unknown whether quantum cooperative communication can be successfully performed. In this paper, we investigate network coding for quantum cooperative multicast (QCM) over the classic butterfly network. A very reasonable definition of QCM is first introduced. It not only perfectly focuses on the basic idea of quantum cooperative communication, but also wonderfully reflects the characteristic of classical multicast over a specific network structure. Next, we design QCM protocol for two-level systems and generalize the protocol into d-dimensional Hilbert space. It is shown that our protocols have significant advantages in terms of resource cost and compatibility with classical multicast. Besides, the success probability, which only depends on the coefficients of the initial quantum states, is carefully analyzed. In particular if the source nodes choose the quantum equatorial states, success probability can reach 1.
Analysis of quantum network coding for realistic repeater networks
NASA Astrophysics Data System (ADS)
Satoh, Takahiko; Ishizaki, Kaori; Nagayama, Shota; Van Meter, Rodney
2016-03-01
Quantum repeater networks have attracted attention for the implementation of long-distance and large-scale sharing of quantum states. Recently, researchers extended classical network coding, which is a technique for throughput enhancement, into quantum information. The utility of quantum network coding (QNC) has been shown under ideal conditions, but it has not been studied previously under conditions of noise and shortage of quantum resources. We analyzed QNC on a butterfly network, which can create end-to-end Bell pairs at twice the rate of the standard quantum network repeater approach. The joint fidelity of creating two Bell pairs has a small penalty for QNC relative to entanglement swapping. It will thus be useful when we care more about throughput than fidelity. We found that the output fidelity drops below 0.5 when the initial Bell pairs have fidelity F <0.90 , even with perfect local gates. Local gate errors have a larger impact on quantum network coding than on entanglement swapping.
Weighted networks as randomly reinforced urn processes
NASA Astrophysics Data System (ADS)
Caldarelli, Guido; Chessa, Alessandro; Crimaldi, Irene; Pammolli, Fabio
2013-02-01
We analyze weighted networks as randomly reinforced urn processes, in which the edge-total weights are determined by a reinforcement mechanism. We develop a statistical test and a procedure based on it to study the evolution of networks over time, detecting the “dominance” of some edges with respect to the others and then assessing if a given instance of the network is taken at its steady state or not. Distance from the steady state can be considered as a measure of the relevance of the observed properties of the network. Our results are quite general, in the sense that they are not based on a particular probability distribution or functional form of the random weights. Moreover, the proposed tool can be applied also to dense networks, which have received little attention by the network community so far, since they are often problematic. We apply our procedure in the context of the International Trade Network, determining a core of “dominant edges.”
Sparse coding for layered neural networks
NASA Astrophysics Data System (ADS)
Katayama, Katsuki; Sakata, Yasuo; Horiguchi, Tsuyoshi
2002-07-01
We investigate storage capacity of two types of fully connected layered neural networks with sparse coding when binary patterns are embedded into the networks by a Hebbian learning rule. One of them is a layered network, in which a transfer function of even layers is different from that of odd layers. The other is a layered network with intra-layer connections, in which the transfer function of inter-layer is different from that of intra-layer, and inter-layered neurons and intra-layered neurons are updated alternately. We derive recursion relations for order parameters by means of the signal-to-noise ratio method, and then apply the self-control threshold method proposed by Dominguez and Bollé to both layered networks with monotonic transfer functions. We find that a critical value αC of storage capacity is about 0.11|a ln a| -1 ( a≪1) for both layered networks, where a is a neuronal activity. It turns out that the basin of attraction is larger for both layered networks when the self-control threshold method is applied.
Enhanced view random access ability for multiview video coding
NASA Astrophysics Data System (ADS)
Elmesloul Nasri, Seif Allah; Khelil, Khaled; Doghmane, Noureddine
2016-03-01
Apart from the efficient compression, reducing the complexity of the view random access is one of the most important requirements that should be considered in multiview video coding. In order to obtain an efficient compression, both temporal and inter-view correlations are exploited in the multiview video coding schemes, introducing higher complexity in the temporal and view random access. We propose an inter-view prediction structure that aims to lower the cost of randomly accessing any picture at any position and instant, with respect to the multiview reference model JMVM and other recent relevant works. The proposed scheme is mainly based on the use of two base views (I-views) in the structure with selected positions instead of a single reference view as in the standard structures. This will, therefore, provide a direct inter-view prediction for all the remaining views and will ensure a low-delay view random access ability while maintaining a very competitive bit-rate performance with a similar video quality measured in peak signal-to-noise ratio. In addition to a new evaluation method of the random access ability, the obtained results show a significant improvement in the view random accessibility with respect to other reported works.
A random interacting network model for complex networks
NASA Astrophysics Data System (ADS)
Goswami, Bedartha; Shekatkar, Snehal M.; Rheinwalt, Aljoscha; Ambika, G.; Kurths, Jürgen
2015-12-01
We propose a RAndom Interacting Network (RAIN) model to study the interactions between a pair of complex networks. The model involves two major steps: (i) the selection of a pair of nodes, one from each network, based on intra-network node-based characteristics, and (ii) the placement of a link between selected nodes based on the similarity of their relative importance in their respective networks. Node selection is based on a selection fitness function and node linkage is based on a linkage probability defined on the linkage scores of nodes. The model allows us to relate within-network characteristics to between-network structure. We apply the model to the interaction between the USA and Schengen airline transportation networks (ATNs). Our results indicate that two mechanisms: degree-based preferential node selection and degree-assortative link placement are necessary to replicate the observed inter-network degree distributions as well as the observed inter-network assortativity. The RAIN model offers the possibility to test multiple hypotheses regarding the mechanisms underlying network interactions. It can also incorporate complex interaction topologies. Furthermore, the framework of the RAIN model is general and can be potentially adapted to various real-world complex systems.
A random interacting network model for complex networks
Goswami, Bedartha; Shekatkar, Snehal M.; Rheinwalt, Aljoscha; Ambika, G.; Kurths, Jürgen
2015-01-01
We propose a RAndom Interacting Network (RAIN) model to study the interactions between a pair of complex networks. The model involves two major steps: (i) the selection of a pair of nodes, one from each network, based on intra-network node-based characteristics, and (ii) the placement of a link between selected nodes based on the similarity of their relative importance in their respective networks. Node selection is based on a selection fitness function and node linkage is based on a linkage probability defined on the linkage scores of nodes. The model allows us to relate within-network characteristics to between-network structure. We apply the model to the interaction between the USA and Schengen airline transportation networks (ATNs). Our results indicate that two mechanisms: degree-based preferential node selection and degree-assortative link placement are necessary to replicate the observed inter-network degree distributions as well as the observed inter-network assortativity. The RAIN model offers the possibility to test multiple hypotheses regarding the mechanisms underlying network interactions. It can also incorporate complex interaction topologies. Furthermore, the framework of the RAIN model is general and can be potentially adapted to various real-world complex systems. PMID:26657032
A random interacting network model for complex networks.
Goswami, Bedartha; Shekatkar, Snehal M; Rheinwalt, Aljoscha; Ambika, G; Kurths, Jürgen
2015-01-01
We propose a RAndom Interacting Network (RAIN) model to study the interactions between a pair of complex networks. The model involves two major steps: (i) the selection of a pair of nodes, one from each network, based on intra-network node-based characteristics, and (ii) the placement of a link between selected nodes based on the similarity of their relative importance in their respective networks. Node selection is based on a selection fitness function and node linkage is based on a linkage probability defined on the linkage scores of nodes. The model allows us to relate within-network characteristics to between-network structure. We apply the model to the interaction between the USA and Schengen airline transportation networks (ATNs). Our results indicate that two mechanisms: degree-based preferential node selection and degree-assortative link placement are necessary to replicate the observed inter-network degree distributions as well as the observed inter-network assortativity. The RAIN model offers the possibility to test multiple hypotheses regarding the mechanisms underlying network interactions. It can also incorporate complex interaction topologies. Furthermore, the framework of the RAIN model is general and can be potentially adapted to various real-world complex systems. PMID:26657032
Randomness and preserved patterns in cancer network
NASA Astrophysics Data System (ADS)
Rai, Aparna; Menon, A. Vipin; Jalan, Sarika
2014-09-01
Breast cancer has been reported to account for the maximum cases among all female cancers till date. In order to gain a deeper insight into the complexities of the disease, we analyze the breast cancer network and its normal counterpart at the proteomic level. While the short range correlations in the eigenvalues exhibiting universality provide an evidence towards the importance of random connections in the underlying networks, the long range correlations along with the localization properties reveal insightful structural patterns involving functionally important proteins. The analysis provides a benchmark for designing drugs which can target a subgraph instead of individual proteins.
Spatial versus sequential correlations for random access coding
NASA Astrophysics Data System (ADS)
Tavakoli, Armin; Marques, Breno; Pawłowski, Marcin; Bourennane, Mohamed
2016-03-01
Random access codes are important for a wide range of applications in quantum information. However, their implementation with quantum theory can be made in two very different ways: (i) by distributing data with strong spatial correlations violating a Bell inequality or (ii) using quantum communication channels to create stronger-than-classical sequential correlations between state preparation and measurement outcome. Here we study this duality of the quantum realization. We present a family of Bell inequalities tailored to the task at hand and study their quantum violations. Remarkably, we show that the use of spatial and sequential quantum correlations imposes different limitations on the performance of quantum random access codes: Sequential correlations can outperform spatial correlations. We discuss the physics behind the observed discrepancy between spatial and sequential quantum correlations.
Resolving social dilemmas on evolving random networks
NASA Astrophysics Data System (ADS)
Szolnoki, Attila; Perc, Matjaž
2009-05-01
We show that strategy-independent adaptations of random interaction networks can induce powerful mechanisms, ranging from the Red Queen to group selection, which promote cooperation in evolutionary social dilemmas. These two mechanisms emerge spontaneously as dynamical processes due to deletions and additions of links, which are performed whenever players adopt new strategies and after a certain number of game iterations, respectively. The potency of cooperation promotion, as well as the mechanism responsible for it, can thereby be tuned via a single parameter determining the frequency of link additions. We thus demonstrate that coevolving random networks may evoke an appropriate mechanism for each social dilemma, such that cooperation prevails even in highly unfavorable conditions.
Quantum games on evolving random networks
NASA Astrophysics Data System (ADS)
Pawela, Łukasz
2016-09-01
We study the advantages of quantum strategies in evolutionary social dilemmas on evolving random networks. We focus our study on the two-player games: prisoner's dilemma, snowdrift and stag-hunt games. The obtained result show the benefits of quantum strategies for the prisoner's dilemma game. For the other two games, we obtain regions of parameters where the quantum strategies dominate, as well as regions where the classical strategies coexist.
Weight distributions for turbo codes using random and nonrandom permutations
NASA Technical Reports Server (NTRS)
Dolinar, S.; Divsalar, D.
1995-01-01
This article takes a preliminary look at the weight distributions achievable for turbo codes using random, nonrandom, and semirandom permutations. Due to the recursiveness of the encoders, it is important to distinguish between self-terminating and non-self-terminating input sequences. The non-self-terminating sequences have little effect on decoder performance, because they accumulate high encoded weight until they are artificially terminated at the end of the block. From probabilistic arguments based on selecting the permutations randomly, it is concluded that the self-terminating weight-2 data sequences are the most important consideration in the design of constituent codes; higher-weight self-terminating sequences have successively decreasing importance. Also, increasing the number of codes and, correspondingly, the number of permutations makes it more and more likely that the bad input sequences will be broken up by one or more of the permuters. It is possible to design nonrandom permutations that ensure that the minimum distance due to weight-2 input sequences grows roughly as the square root of (2N), where N is the block length. However, these nonrandom permutations amplify the bad effects of higher-weight inputs, and as a result they are inferior in performance to randomly selected permutations. But there are 'semirandom' permutations that perform nearly as well as the designed nonrandom permutations with respect to weight-2 input sequences and are not as susceptible to being foiled by higher-weight inputs.
NASA Astrophysics Data System (ADS)
Huang, Jen-Fa; Meng, Sheng-Hui; Lin, Ying-Chen
2014-11-01
The optical code-division multiple-access (OCDMA) technique is considered a good candidate for providing optical layer security. An enhanced OCDMA network security mechanism with a pseudonoise (PN) random digital signals type of maximal-length sequence (M-sequence) code switching to protect against eavesdropping is presented. Signature codes unique to individual OCDMA-network users are reconfigured according to the register state of the controlling electrical shift registers. Examples of signature reconfiguration following state switching of the controlling shift register for both the network user and the eavesdropper are numerically illustrated. Dynamically changing the PN state of the shift register to reconfigure the user signature sequence is shown; this hinders eavesdroppers' efforts to decode correct data sequences. The proposed scheme increases the probability of eavesdroppers committing errors in decoding and thereby substantially enhances the degree of an OCDMA network's confidentiality.
Dynamic Random Networks in Dynamic Populations
NASA Astrophysics Data System (ADS)
Britton, Tom; Lindholm, Mathias
2010-05-01
We consider a random network evolving in continuous time in which new nodes are born and old may die, and where undirected edges between nodes are created randomly and may also disappear. The node population is Markovian and so is the creation and deletion of edges, given the node population. Each node is equipped with a random social index and the intensity at which a node creates new edges is proportional to the social index, and the neighbour is either chosen uniformly or proportional to its social index in a modification of the model. We derive properties of the network as time and the node population tends to infinity. In particular, the degree-distribution is shown to be a mixed Poisson distribution which may exhibit a heavy tail (e.g. power-law) if the social index distribution has a heavy tail. The limiting results are verified by means of simulations, and the model is fitted to a network of sexual contacts.
Secure quantum network coding for controlled repeater networks
NASA Astrophysics Data System (ADS)
Shang, Tao; Li, Jiao; Liu, Jian-wei
2016-04-01
To realize efficient quantum communication based on quantum repeater, we propose a secure quantum network coding scheme for controlled repeater networks, which adds a controller as a trusted party and is able to control the process of EPR-pair distribution. As the key operations of quantum repeater, local operations and quantum communication are designed to adopt quantum one-time pad to enhance the function of identity authentication instead of local operations and classical communication. Scheme analysis shows that the proposed scheme can defend against active attacks for quantum communication and realize long-distance quantum communication with minimal resource consumption.
Secure quantum network coding for controlled repeater networks
NASA Astrophysics Data System (ADS)
Shang, Tao; Li, Jiao; Liu, Jian-wei
2016-07-01
To realize efficient quantum communication based on quantum repeater, we propose a secure quantum network coding scheme for controlled repeater networks, which adds a controller as a trusted party and is able to control the process of EPR-pair distribution. As the key operations of quantum repeater, local operations and quantum communication are designed to adopt quantum one-time pad to enhance the function of identity authentication instead of local operations and classical communication. Scheme analysis shows that the proposed scheme can defend against active attacks for quantum communication and realize long-distance quantum communication with minimal resource consumption.
Driven synchronization in random networks of oscillators.
Hindes, Jason; Myers, Christopher R
2015-07-01
Synchronization is a universal phenomenon found in many non-equilibrium systems. Much recent interest in this area has overlapped with the study of complex networks, where a major focus is determining how a system's connectivity patterns affect the types of behavior that it can produce. Thus far, modeling efforts have focused on the tendency of networks of oscillators to mutually synchronize themselves, with less emphasis on the effects of external driving. In this work, we discuss the interplay between mutual and driven synchronization in networks of phase oscillators of the Kuramoto type, and explore how the structure and emergence of such states depend on the underlying network topology for simple random networks with a given degree distribution. We find a variety of interesting dynamical behaviors, including bifurcations and bistability patterns that are qualitatively different for heterogeneous and homogeneous networks, and which are separated by a Takens-Bogdanov-Cusp singularity in the parameter region where the coupling strength between oscillators is weak. Our analysis is connected to the underlying dynamics of oscillator clusters for important states and transitions. PMID:26232970
Random networks created by biological evolution
NASA Astrophysics Data System (ADS)
Slanina, František; Kotrla, Miroslav
2000-11-01
We investigate a model of an evolving random network, introduced by us previously [Phys. Rev. Lett. 83, 5587 (1999)]. The model is a generalization of the Bak-Sneppen model of biological evolution, with the modification that the underlying network can evolve by adding and removing sites. The behavior and the averaged properties of the network depend on the parameter p, the probability to establish a link to the newly introduced site. For p=1 the system is self-organized critical, with two distinct power-law regimes with forward-avalanche exponents τ=1.98+/-0.04 and τ'=1.65+/-0.05. The average size of the network diverges as a powerlaw when p-->1. We study various geometrical properties of the network: the probability distribution of sizes and connectivities, size and number of disconnected clusters, and the dependence of the mean distance between two sites on the cluster size. The connection with models of growing networks with a preferential attachment is discussed.
Anomalous Anticipatory Responses in Networked Random Data
Nelson, Roger D.; Bancel, Peter A.
2006-10-16
We examine an 8-year archive of synchronized, parallel time series of random data from a world spanning network of physical random event generators (REGs). The archive is a publicly accessible matrix of normally distributed 200-bit sums recorded at 1 Hz which extends from August 1998 to the present. The primary question is whether these data show non-random structure associated with major events such as natural or man-made disasters, terrible accidents, or grand celebrations. Secondarily, we examine the time course of apparently correlated responses. Statistical analyses of the data reveal consistent evidence that events which strongly affect people engender small but significant effects. These include suggestions of anticipatory responses in some cases, leading to a series of specialized analyses to assess possible non-random structure preceding precisely timed events. A focused examination of data collected around the time of earthquakes with Richter magnitude 6 and greater reveals non-random structure with a number of intriguing, potentially important features. Anomalous effects in the REG data are seen only when the corresponding earthquakes occur in populated areas. No structure is found if they occur in the oceans. We infer that an important contributor to the effect is the relevance of the earthquake to humans. Epoch averaging reveals evidence for changes in the data some hours prior to the main temblor, suggestive of reverse causation.
Community structure of non-coding RNA interaction network.
Nacher, Jose C
2013-01-01
Rapid technological advances have shown that the ratio of non-protein coding genes rises to 98.5% in humans, suggesting that current knowledge on genetic information processing might be largely incomplete. It implies that protein-coding sequences only represent a small fraction of cellular transcriptional information. Here, we examine the community structure of the network defined by functional interactions between non-coding RNAs (ncRNAs) and proteins related bio-macromolecules (PRMs) using a two-fold approach: modularity in bipartite network and k-clique community detection. First, the high modularity scores as well as the distribution of community sizes showing a scaling-law revealed manifestly non-random features. Second, the k-clique sub-graphs and overlaps show that the identified communities of the ncRNA molecules of H. sapiens can potentially be associated with certain functions. These findings highlight the complex modular structure of ncRNA interactions and its possible regulatory roles in the cell. PMID:23545211
Random walks in directed modular networks
NASA Astrophysics Data System (ADS)
Comin, Cesar H.; Viana, Mateus P.; Antiqueira, Lucas; Costa, Luciano da F.
2014-12-01
Because diffusion typically involves symmetric interactions, scant attention has been focused on studying asymmetric cases. However, important networked systems underlain by diffusion (e.g. cortical networks and WWW) are inherently directed. In the case of undirected diffusion, it can be shown that the steady-state probability of the random walk dynamics is fully correlated with the degree, which no longer holds for directed networks. We investigate the relationship between such probability and the inward node degree, which we call efficiency, in modular networks. Our findings show that the efficiency of a given community depends mostly on the balance between its ingoing and outgoing connections. In addition, we derive analytical expressions to show that the internal degree of the nodes does not play a crucial role in their efficiency, when considering the Erdős-Rényi and Barabási-Albert models. The results are illustrated with respect to the macaque cortical network, providing subsidies for improving transportation and communication systems.
Estimating the minimum control count of random network models
Ruths, Derek; Ruths, Justin
2016-01-01
The study of controllability of complex networks has introduced the minimum number of controls required for full controllability as a new network measure of interest. This network measure, like many others, is non-trivial to compute. As a result, establishing the significance of minimum control counts (MCCs) in real networks using random network null models is expensive. Here we derive analytic estimates for the expected MCCs of networks drawn from three commonly-used random network models. Our estimates show good agreement with exact control counts. Furthermore, the analytic expressions we derive offer insights into the structures within each random network model that induce the need for controls. PMID:26817434
Preferential attachment in randomly grown networks
NASA Astrophysics Data System (ADS)
Weaver, Iain S.
2015-12-01
We reintroduce the model of Callaway et al. (2001) as a special case of a more general model for random network growth. Vertices are added to the graph at a rate of 1, while edges are introduced at rate δ. Rather than edges being introduced at random, we allow for a degree of preferential attachment with a linear attachment kernel, parametrised by m. The original model is recovered in the limit of no preferential attachment, m → ∞. As expected, even weak preferential attachment introduces a power-law tail to the degree distribution. Additionally, this generalisation retains a great deal of the tractability of the original along with a surprising range of behaviour, although key mathematical features are modified for finite m. In particular, the critical edge density, δc which marks the onset of a giant network component is reduced with increasing tendency for preferential attachment. The positive degree-degree correlation introduced by the unbiased growth process is offset by the skewed degree distribution, reducing the network assortativity.
Quantum Random Access Codes Using Single d -Level Systems
NASA Astrophysics Data System (ADS)
Tavakoli, Armin; Hameedi, Alley; Marques, Breno; Bourennane, Mohamed
2015-05-01
Random access codes (RACs) are used by a party to, with limited communication, access an arbitrary subset of information held by another party. Quantum resources are known to enable RACs that break classical limitations. Here, we study quantum and classical RACs with high-level communication. We derive average performances of classical RACs and present families of high-level quantum RACs. Our results show that high-level quantum systems can significantly increase the advantage of quantum RACs over their classical counterparts. We demonstrate our findings in an experimental realization of a quantum RAC with four-level communication.
Marginalization in Random Nonlinear Neural Networks
NASA Astrophysics Data System (ADS)
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.
Optimal bounds for parity-oblivious random access codes
NASA Astrophysics Data System (ADS)
Chailloux, André; Kerenidis, Iordanis; Kundu, Srijita; Sikora, Jamie
2016-04-01
Random access coding is an information task that has been extensively studied and found many applications in quantum information. In this scenario, Alice receives an n-bit string x, and wishes to encode x into a quantum state {ρ }x, such that Bob, when receiving the state {ρ }x, can choose any bit i\\in [n] and recover the input bit x i with high probability. Here we study two variants: parity-oblivious random access codes (RACs), where we impose the cryptographic property that Bob cannot infer any information about the parity of any subset of bits of the input apart from the single bits x i ; and even-parity-oblivious RACs, where Bob cannot infer any information about the parity of any even-size subset of bits of the input. In this paper, we provide the optimal bounds for parity-oblivious quantum RACs and show that they are asymptotically better than the optimal classical ones. Our results provide a large non-contextuality inequality violation and resolve the main open problem in a work of Spekkens et al (2009 Phys. Rev. Lett. 102 010401). Second, we provide the optimal bounds for even-parity-oblivious RACs by proving their equivalence to a non-local game and by providing tight bounds for the success probability of the non-local game via semidefinite programming. In the case of even-parity-oblivious RACs, the cryptographic property holds also in the device independent model.
Spiking network simulation code for petascale computers.
Kunkel, Susanne; Schmidt, Maximilian; Eppler, Jochen M; Plesser, Hans E; Masumoto, Gen; Igarashi, Jun; Ishii, Shin; Fukai, Tomoki; Morrison, Abigail; Diesmann, Markus; Helias, Moritz
2014-01-01
Brain-scale networks exhibit a breathtaking heterogeneity in the dynamical properties and parameters of their constituents. At cellular resolution, the entities of theory are neurons and synapses and over the past decade researchers have learned to manage the heterogeneity of neurons and synapses with efficient data structures. Already early parallel simulation codes stored synapses in a distributed fashion such that a synapse solely consumes memory on the compute node harboring the target neuron. As petaflop computers with some 100,000 nodes become increasingly available for neuroscience, new challenges arise for neuronal network simulation software: Each neuron contacts on the order of 10,000 other neurons and thus has targets only on a fraction of all compute nodes; furthermore, for any given source neuron, at most a single synapse is typically created on any compute node. From the viewpoint of an individual compute node, the heterogeneity in the synaptic target lists thus collapses along two dimensions: the dimension of the types of synapses and the dimension of the number of synapses of a given type. Here we present a data structure taking advantage of this double collapse using metaprogramming techniques. After introducing the relevant scaling scenario for brain-scale simulations, we quantitatively discuss the performance on two supercomputers. We show that the novel architecture scales to the largest petascale supercomputers available today. PMID:25346682
Spiking network simulation code for petascale computers
Kunkel, Susanne; Schmidt, Maximilian; Eppler, Jochen M.; Plesser, Hans E.; Masumoto, Gen; Igarashi, Jun; Ishii, Shin; Fukai, Tomoki; Morrison, Abigail; Diesmann, Markus; Helias, Moritz
2014-01-01
Brain-scale networks exhibit a breathtaking heterogeneity in the dynamical properties and parameters of their constituents. At cellular resolution, the entities of theory are neurons and synapses and over the past decade researchers have learned to manage the heterogeneity of neurons and synapses with efficient data structures. Already early parallel simulation codes stored synapses in a distributed fashion such that a synapse solely consumes memory on the compute node harboring the target neuron. As petaflop computers with some 100,000 nodes become increasingly available for neuroscience, new challenges arise for neuronal network simulation software: Each neuron contacts on the order of 10,000 other neurons and thus has targets only on a fraction of all compute nodes; furthermore, for any given source neuron, at most a single synapse is typically created on any compute node. From the viewpoint of an individual compute node, the heterogeneity in the synaptic target lists thus collapses along two dimensions: the dimension of the types of synapses and the dimension of the number of synapses of a given type. Here we present a data structure taking advantage of this double collapse using metaprogramming techniques. After introducing the relevant scaling scenario for brain-scale simulations, we quantitatively discuss the performance on two supercomputers. We show that the novel architecture scales to the largest petascale supercomputers available today. PMID:25346682
Random walk with priorities in communicationlike networks
NASA Astrophysics Data System (ADS)
Bastas, Nikolaos; Maragakis, Michalis; Argyrakis, Panos; ben-Avraham, Daniel; Havlin, Shlomo; Carmi, Shai
2013-08-01
We study a model for a random walk of two classes of particles (A and B). Where both species are present in the same site, the motion of A's takes precedence over that of B's. The model was originally proposed and analyzed in Maragakis [Phys. Rev. EPLEEE81539-375510.1103/PhysRevE.77.020103 77, 020103(R) (2008)]; here we provide additional results. We solve analytically the diffusion coefficients of the two species in lattices for a number of protocols. In networks, we find that the probability of a B particle to be free decreases exponentially with the node degree. In scale-free networks, this leads to localization of the B's at the hubs and arrest of their motion. To remedy this, we investigate several strategies to avoid trapping of the B's, including moving an A instead of the hindered B, allowing a trapped B to hop with a small probability, biased walk toward non-hub nodes, and limiting the capacity of nodes. We obtain analytic results for lattices and networks, and we discuss the advantages and shortcomings of the possible strategies.
Fast frequency hopping codes applied to SAC optical CDMA network
NASA Astrophysics Data System (ADS)
Tseng, Shin-Pin
2015-06-01
This study designed a fast frequency hopping (FFH) code family suitable for application in spectral-amplitude-coding (SAC) optical code-division multiple-access (CDMA) networks. The FFH code family can effectively suppress the effects of multiuser interference and had its origin in the frequency hopping code family. Additional codes were developed as secure codewords for enhancing the security of the network. In considering the system cost and flexibility, simple optical encoders/decoders using fiber Bragg gratings (FBGs) and a set of optical securers using two arrayed-waveguide grating (AWG) demultiplexers (DeMUXs) were also constructed. Based on a Gaussian approximation, expressions for evaluating the bit error rate (BER) and spectral efficiency (SE) of SAC optical CDMA networks are presented. The results indicated that the proposed SAC optical CDMA network exhibited favorable performance.
Opinion dynamics on an adaptive random network
NASA Astrophysics Data System (ADS)
Benczik, I. J.; Benczik, S. Z.; Schmittmann, B.; Zia, R. K. P.
2009-04-01
We revisit the classical model for voter dynamics in a two-party system with two basic modifications. In contrast to the original voter model studied in regular lattices, we implement the opinion formation process in a random network of agents in which interactions are no longer restricted by geographical distance. In addition, we incorporate the rapidly changing nature of the interpersonal relations in the model. At each time step, agents can update their relationships. This update is determined by their own opinion, and by their preference to make connections with individuals sharing the same opinion, or rather with opponents. In this way, the network is built in an adaptive manner, in the sense that its structure is correlated and evolves with the dynamics of the agents. The simplicity of the model allows us to examine several issues analytically. We establish criteria to determine whether consensus or polarization will be the outcome of the dynamics and on what time scales these states will be reached. In finite systems consensus is typical, while in infinite systems a disordered metastable state can emerge and persist for infinitely long time before consensus is reached.
Mean first return time for random walks on weighted networks
NASA Astrophysics Data System (ADS)
Jing, Xing-Li; Ling, Xiang; Long, Jiancheng; Shi, Qing; Hu, Mao-Bin
2015-11-01
Random walks on complex networks are of great importance to understand various types of phenomena in real world. In this paper, two types of biased random walks on nonassortative weighted networks are studied: edge-weight-based random walks and node-strength-based random walks, both of which are extended from the normal random walk model. Exact expressions for stationary distribution and mean first return time (MFRT) are derived and examined by simulation. The results will be helpful for understanding the influences of weights on the behavior of random walks.
Random networks with tunable degree distribution and clustering
NASA Astrophysics Data System (ADS)
Volz, Erik
2004-11-01
We present an algorithm for generating random networks with arbitrary degree distribution and clustering (frequency of triadic closure). We use this algorithm to generate networks with exponential, power law, and Poisson degree distributions with variable levels of clustering. Such networks may be used as models of social networks and as a testable null hypothesis about network structure. Finally, we explore the effects of clustering on the point of the phase transition where a giant component forms in a random network, and on the size of the giant component. Some analysis of these effects is presented.
Transition to Chaos in Random Neuronal Networks
NASA Astrophysics Data System (ADS)
Kadmon, Jonathan; Sompolinsky, Haim
2015-10-01
Firing patterns in the central nervous system often exhibit strong temporal irregularity and considerable heterogeneity in time-averaged response properties. Previous studies suggested that these properties are the outcome of the intrinsic chaotic dynamics of the neural circuits. 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., connection variance) is sufficiently large. In the limit of an infinitely large network, there is a sharp transition from a fixed point to chaos, as the synaptic gain reaches a critical value. Near the onset, chaotic fluctuations are slow, analogous to the ubiquitous, slow irregular fluctuations observed in the firing rates of many cortical circuits. However, the existence of a transition from a fixed point to chaos in neuronal circuit models with more realistic architectures and firing dynamics has not been established. In this work, we investigate rate-based dynamics of neuronal circuits composed of several subpopulations with randomly diluted connections. Nonzero connections are either positive for excitatory neurons or negative for inhibitory ones, while single neuron output is strictly positive with output rates rising as a power law above threshold, in line with known constraints in many biological systems. Using dynamic mean field theory, we find the phase diagram depicting the regimes of stable fixed-point, unstable-dynamic, and chaotic-rate fluctuations. We focus on the latter and characterize the properties of systems near this transition. We show that dilute excitatory-inhibitory architectures exhibit the same onset to chaos as the single population with Gaussian connectivity. In these architectures, the large mean excitatory and inhibitory inputs dynamically balance each other, amplifying the effect of the residual fluctuations. Importantly, the existence of a transition to chaos
Object-oriented image coding scheme based on DWT and Markov random field
NASA Astrophysics Data System (ADS)
Zheng, Lei; Wu, Hsien-Hsun S.; Liu, Jyh-Charn S.; Chan, Andrew K.
1998-12-01
In this paper, we introduce an object-oriented image coding algorithm to differentiate regions of interest (ROI) in visual communications. Our scheme is motivated by the fact that in visual communications, image contents (objects) are not equally important. For a given network bandwidth budget, one should give the highest transmission priority to the most interesting object, and serve the remaining ones at lower priorities. We propose a DWT based Multiresolution Markov Random Field technique to segment image objects according to their textures. We show that this technique can effectively distinguish visual objects and assign them different priorities. This scheme can be integrated with our ROI compression coder, the Generalized Self-Similarity Tress codex, for networking applications.
Code 672 observational science branch computer networks
NASA Technical Reports Server (NTRS)
Hancock, D. W.; Shirk, H. G.
1988-01-01
In general, networking increases productivity due to the speed of transmission, easy access to remote computers, ability to share files, and increased availability of peripherals. Two different networks within the Observational Science Branch are described in detail.
Optimal Grouping and Matching for Network-Coded Cooperative Communications
Sharma, S; Shi, Y; Hou, Y T; Kompella, S; Midkiff, S F
2011-11-01
Network-coded cooperative communications (NC-CC) is a new advance in wireless networking that exploits network coding (NC) to improve the performance of cooperative communications (CC). However, there remains very limited understanding of this new hybrid technology, particularly at the link layer and above. This paper fills in this gap by studying a network optimization problem that requires joint optimization of session grouping, relay node grouping, and matching of session/relay groups. After showing that this problem is NP-hard, we present a polynomial time heuristic algorithm to this problem. Using simulation results, we show that our algorithm is highly competitive and can produce near-optimal results.
Code division controlled-MAC in wireless sensor network by adaptive binary signature design
NASA Astrophysics Data System (ADS)
Wei, Lili; Batalama, Stella N.; Pados, Dimitris A.; Suter, Bruce
2007-04-01
We consider the problem of signature waveform design for code division medium-access-control (MAC) of wireless sensor networks (WSN). In contract to conventional randomly chosen orthogonal codes, an adaptive signature design strategy is developed under the maximum pre-detection SINR (signal to interference plus noise ratio) criterion. The proposed algorithm utilizes slowest descent cords of the optimization surface to move toward the optimum solution and exhibits, upon eigenvector decomposition, linear computational complexity with respect to signature length. Numerical and simulation studies demonstrate the performance of the proposed method and offer comparisons with conventional signature code sets.
Optimal Near-Hitless Network Failure Recovery Using Diversity Coding
ERIC Educational Resources Information Center
Avci, Serhat Nazim
2013-01-01
Link failures in wide area networks are common and cause significant data losses. Mesh-based protection schemes offer high capacity efficiency but they are slow, require complex signaling, and instable. Diversity coding is a proactive coding-based recovery technique which offers near-hitless (sub-ms) restoration with a competitive spare capacity…
Random matrix analysis of localization properties of gene coexpression network
NASA Astrophysics Data System (ADS)
Jalan, Sarika; Solymosi, Norbert; Vattay, Gábor; Li, Baowen
2010-04-01
We analyze gene coexpression network under the random matrix theory framework. The nearest-neighbor spacing distribution of the adjacency matrix of this network follows Gaussian orthogonal statistics of random matrix theory (RMT). Spectral rigidity test follows random matrix prediction for a certain range and deviates afterwards. Eigenvector analysis of the network using inverse participation ratio suggests that the statistics of bulk of the eigenvalues of network is consistent with those of the real symmetric random matrix, whereas few eigenvalues are localized. Based on these IPR calculations, we can divide eigenvalues in three sets: (a) The nondegenerate part that follows RMT. (b) The nondegenerate part, at both ends and at intermediate eigenvalues, which deviates from RMT and expected to contain information about important nodes in the network. (c) The degenerate part with zero eigenvalue, which fluctuates around RMT-predicted value. We identify nodes corresponding to the dominant modes of the corresponding eigenvectors and analyze their structural properties.
NASA Astrophysics Data System (ADS)
Nadarajah, Nishaanthan; Nirmalathas, Ampalavanapillai
2008-03-01
A solution for implementing multiple secure virtual private networks over a passive optical network using electronic code division multiple access is proposed and experimentally demonstrated. The multiple virtual private networking capability is experimentally demonstrated with 40 Mb/s data multiplexed with a 640 Mb/s electronic code that is unique to each of the virtual private networks in the passive optical network, and the transmission of the electronically coded data is carried out using Fabry-Perot laser diodes. A theoretical scalability analysis for electronic code division multiple access based virtual private networks over a passive optical network is also carried out to identify the performance limits of the scheme. Several sources of noise such as optical beat interference and multiple access interference that are present in the receiver are considered with different operating system parameters such as transmitted optical power, spectral width of the broadband optical source, and processing gain to study the scalability of the network.
A random spatial network model based on elementary postulates
Karlinger, M.R.; Troutman, B.M.
1989-01-01
In contrast to the random topology model, this model ascribes a unique spatial specification to generated drainage networks, a distinguishing property of some network growth models. The simplicity of the postulates creates an opportunity for potential analytic investigations of the probabilistic structure of the drainage networks, while the spatial specification enables analyses of spatially dependent network properties. In the random topology model all drainage networks, conditioned on magnitude (number of first-order streams), are equally likely, whereas in this model all spanning trees of a grid, conditioned on area and drainage density, are equally likely. As a result, link lengths in the generated networks are not independent, as usually assumed in the random topology model. -from Authors
Distributed Estimation, Coding, and Scheduling in Wireless Visual Sensor Networks
ERIC Educational Resources Information Center
Yu, Chao
2013-01-01
In this thesis, we consider estimation, coding, and sensor scheduling for energy efficient operation of wireless visual sensor networks (VSN), which consist of battery-powered wireless sensors with sensing (imaging), computation, and communication capabilities. The competing requirements for applications of these wireless sensor networks (WSN)…
Executable Code Recognition in Network Flows Using Instruction Transition Probabilities
NASA Astrophysics Data System (ADS)
Kim, Ikkyun; Kang, Koohong; Choi, Yangseo; Kim, Daewon; Oh, Jintae; Jang, Jongsoo; Han, Kijun
The ability to recognize quickly inside network flows to be executable is prerequisite for malware detection. For this purpose, we introduce an instruction transition probability matrix (ITPX) which is comprised of the IA-32 instruction sets and reveals the characteristics of executable code's instruction transition patterns. And then, we propose a simple algorithm to detect executable code inside network flows using a reference ITPX which is learned from the known Windows Portable Executable files. We have tested the algorithm with more than thousands of executable and non-executable codes. The results show that it is very promising enough to use in real world.
An Optimization Multi-path Inter-Session Network Coding in Wireless Sensor Networks
NASA Astrophysics Data System (ADS)
Xia, Zhuo-Qun; Liu, Chao; Zhu, Xue-Han; Liu, Pin-Chao; Xie, Li-Tong
Wireless sensor networks (wsns) typically provide several paths from a source to a destination, and by using such paths efficiently. This has the potential not only to increase multiplicatively the achieved end-to-end rate, but also to provide robustness against performance fluctuations of any single link in the system. Network coding is a new technique which improves the network performance. This paper we analyze how to using network coding according to the characteristic of multi-path routing in the wsns. As a result, an optimization multi-path inter-session network coding is designed to improve the wsns performance.
Joint clustering of protein interaction networks through Markov random walk
2014-01-01
Biological networks obtained by high-throughput profiling or human curation are typically noisy. For functional module identification, single network clustering algorithms may not yield accurate and robust results. In order to borrow information across multiple sources to alleviate such problems due to data quality, we propose a new joint network clustering algorithm ASModel in this paper. We construct an integrated network to combine network topological information based on protein-protein interaction (PPI) datasets and homological information introduced by constituent similarity between proteins across networks. A novel random walk strategy on the integrated network is developed for joint network clustering and an optimization problem is formulated by searching for low conductance sets defined on the derived transition matrix of the random walk, which fuses both topology and homology information. The optimization problem of joint clustering is solved by a derived spectral clustering algorithm. Network clustering using several state-of-the-art algorithms has been implemented to both PPI networks within the same species (two yeast PPI networks and two human PPI networks) and those from different species (a yeast PPI network and a human PPI network). Experimental results demonstrate that ASModel outperforms the existing single network clustering algorithms as well as another recent joint clustering algorithm in terms of complex prediction and Gene Ontology (GO) enrichment analysis. PMID:24565376
Joint clustering of protein interaction networks through Markov random walk.
Wang, Yijie; Qian, Xiaoning
2014-01-01
Biological networks obtained by high-throughput profiling or human curation are typically noisy. For functional module identification, single network clustering algorithms may not yield accurate and robust results. In order to borrow information across multiple sources to alleviate such problems due to data quality, we propose a new joint network clustering algorithm ASModel in this paper. We construct an integrated network to combine network topological information based on protein-protein interaction (PPI) datasets and homological information introduced by constituent similarity between proteins across networks. A novel random walk strategy on the integrated network is developed for joint network clustering and an optimization problem is formulated by searching for low conductance sets defined on the derived transition matrix of the random walk, which fuses both topology and homology information. The optimization problem of joint clustering is solved by a derived spectral clustering algorithm. Network clustering using several state-of-the-art algorithms has been implemented to both PPI networks within the same species (two yeast PPI networks and two human PPI networks) and those from different species (a yeast PPI network and a human PPI network). Experimental results demonstrate that ASModel outperforms the existing single network clustering algorithms as well as another recent joint clustering algorithm in terms of complex prediction and Gene Ontology (GO) enrichment analysis. PMID:24565376
Ground-state coding in partially connected neural networks
NASA Technical Reports Server (NTRS)
Baram, Yoram
1989-01-01
Patterns over (-1,0,1) define, by their outer products, partially connected neural networks, consisting of internally strongly connected, externally weakly connected subnetworks. The connectivity patterns may have highly organized structures, such as lattices and fractal trees or nests. Subpatterns over (-1,1) define the subcodes stored in the subnetwork, that agree in their common bits. It is first shown that the code words are locally stable stares of the network, provided that each of the subcodes consists of mutually orthogonal words or of, at most, two words. Then it is shown that if each of the subcodes consists of two orthogonal words, the code words are the unique ground states (absolute minima) of the Hamiltonian associated with the network. The regions of attraction associated with the code words are shown to grow with the number of subnetworks sharing each of the neurons. Depending on the particular network architecture, the code sizes of partially connected networks can be vastly greater than those of fully connected ones and their error correction capabilities can be significantly greater than those of the disconnected subnetworks. The codes associated with lattice-structured and hierarchical networks are discussed in some detail.
Evaluation of attractors and basins of asynchronous random Boolean networks
NASA Astrophysics Data System (ADS)
Yang, Meng; Chu, Tianguang
2012-05-01
We present an algebraic approach for determining the attractors and their basins of random Boolean networks under an asynchronous stochastic update based on the recently developed matrix semitensor product theory, which allows for converting the logical dynamics of a Boolean network into a standard iterative dynamics. In this setting, all attractors and basins are specified by the network transition matrices. We then devise procedures that can find all attractors and their basins exactly. We also discuss the issue of overlapping basins in asynchronous random Boolean networks, and we propose methods to compute the weight of each attractor and the basin entropy of the systems.
Error-correcting codes on scale-free networks
NASA Astrophysics Data System (ADS)
Kim, Jung-Hoon; Ko, Young-Jo
2004-06-01
We investigate the potential of scale-free networks as error-correcting codes. We find that irregular low-density parity-check codes with the highest performance known to date have degree distributions well fitted by a power-law function p (k) ˜ k-γ with γ close to 2, which suggests that codes built on scale-free networks with appropriate power exponents can be good error-correcting codes, with a performance possibly approaching the Shannon limit. We demonstrate for an erasure channel that codes with a power-law degree distribution of the form p (k) = C (k+α)-γ , with k⩾2 and suitable selection of the parameters α and γ , indeed have very good error-correction capabilities.
Duality of rate coding and temporal coding in multilayered feedforward networks.
Masuda, Naoki; Aihara, Kazuyuki
2003-01-01
A functional role for precise spike timing has been proposed as an alternative hypothesis to rate coding. We show in this article that both the synchronous firing code and the population rate code can be used dually in a common framework of a single neural network model. Furthermore, these two coding mechanisms are bridged continuously by several modulatable model parameters, including shared connectivity, feedback strength, membrane leak rate, and neuron heterogeneity. The rates of change of these parameters are closely related to the response time and the timescale of learning. PMID:12590821
Softening in random networks of non-identical beams
NASA Astrophysics Data System (ADS)
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.
Muller's ratchet in random graphs and scale-free networks
NASA Astrophysics Data System (ADS)
Campos, Paulo R. A.; Combadão, Jaime; Dionisio, Francisco; Gordo, Isabel
2006-10-01
Muller’s ratchet is an evolutionary process that has been implicated in the extinction of asexual species, the evolution of mitochondria, the degeneration of the Y chromosome, the evolution of sex and recombination and the evolution of microbes. Here we study the speed of Muller’s ratchet in a population subdivided into many small subpopulations connected by migration, and distributed on a network. We compare the speed of the ratchet in two distinct types of topologies: scale free networks and random graphs. The difference between the topologies is noticeable when the average connectivity of the network and the migration rate is large. In this situation we observe that the ratchet clicks faster in scale free networks than in random graphs. So contrary to intuition, scale free networks are more prone to loss of genetic information than random graphs. On the other hand, we show that scale free networks are more robust to the random extinction than random graphs. Since these complex networks have been shown to describe well real-life systems, our results open a framework for studying the evolution of microbes and disease epidemics.
Performance of wireless sensor networks under random node failures
Bradonjic, Milan; Hagberg, Aric; Feng, Pan
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.
Coded Cooperation for Multiway Relaying in Wireless Sensor Networks.
Si, Zhongwei; Ma, Junyang; Thobaben, Ragnar
2015-01-01
Wireless sensor networks have been considered as an enabling technology for constructing smart cities. One important feature of wireless sensor networks is that the sensor nodes collaborate in some manner for communications. In this manuscript, we focus on the model of multiway relaying with full data exchange where each user wants to transmit and receive data to and from all other users in the network. We derive the capacity region for this specific model and propose a coding strategy through coset encoding. To obtain good performance with practical codes, we choose spatially-coupled LDPC (SC-LDPC) codes for the coded cooperation. In particular, for the message broadcasting from the relay, we construct multi-edge-type (MET) SC-LDPC codes by repeatedly applying coset encoding. Due to the capacity-achieving property of the SC-LDPC codes, we prove that the capacity region can theoretically be achieved by the proposed MET SC-LDPC codes. Numerical results with finite node degrees are provided, which show that the achievable rates approach the boundary of the capacity region in both binary erasure channels and additive white Gaussian channels. PMID:26131675
Coded Cooperation for Multiway Relaying in Wireless Sensor Networks †
Si, Zhongwei; Ma, Junyang; Thobaben, Ragnar
2015-01-01
Wireless sensor networks have been considered as an enabling technology for constructing smart cities. One important feature of wireless sensor networks is that the sensor nodes collaborate in some manner for communications. In this manuscript, we focus on the model of multiway relaying with full data exchange where each user wants to transmit and receive data to and from all other users in the network. We derive the capacity region for this specific model and propose a coding strategy through coset encoding. To obtain good performance with practical codes, we choose spatially-coupled LDPC (SC-LDPC) codes for the coded cooperation. In particular, for the message broadcasting from the relay, we construct multi-edge-type (MET) SC-LDPC codes by repeatedly applying coset encoding. Due to the capacity-achieving property of the SC-LDPC codes, we prove that the capacity region can theoretically be achieved by the proposed MET SC-LDPC codes. Numerical results with finite node degrees are provided, which show that the achievable rates approach the boundary of the capacity region in both binary erasure channels and additive white Gaussian channels. PMID:26131675
Simulation of Code Spectrum and Code Flow of Cultured Neuronal Networks.
Tamura, Shinichi; Nishitani, Yoshi; Hosokawa, Chie; Miyoshi, Tomomitsu; Sawai, Hajime
2016-01-01
It has been shown that, in cultured neuronal networks on a multielectrode, pseudorandom-like sequences (codes) are detected, and they flow with some spatial decay constant. Each cultured neuronal network is characterized by a specific spectrum curve. That is, we may consider the spectrum curve as a "signature" of its associated neuronal network that is dependent on the characteristics of neurons and network configuration, including the weight distribution. In the present study, we used an integrate-and-fire model of neurons with intrinsic and instantaneous fluctuations of characteristics for performing a simulation of a code spectrum from multielectrodes on a 2D mesh neural network. We showed that it is possible to estimate the characteristics of neurons such as the distribution of number of neurons around each electrode and their refractory periods. Although this process is a reverse problem and theoretically the solutions are not sufficiently guaranteed, the parameters seem to be consistent with those of neurons. That is, the proposed neural network model may adequately reflect the behavior of a cultured neuronal network. Furthermore, such prospect is discussed that code analysis will provide a base of communication within a neural network that will also create a base of natural intelligence. PMID:27239189
Simulation of Code Spectrum and Code Flow of Cultured Neuronal Networks
Tamura, Shinichi; Nishitani, Yoshi; Hosokawa, Chie; Miyoshi, Tomomitsu; Sawai, Hajime
2016-01-01
It has been shown that, in cultured neuronal networks on a multielectrode, pseudorandom-like sequences (codes) are detected, and they flow with some spatial decay constant. Each cultured neuronal network is characterized by a specific spectrum curve. That is, we may consider the spectrum curve as a “signature” of its associated neuronal network that is dependent on the characteristics of neurons and network configuration, including the weight distribution. In the present study, we used an integrate-and-fire model of neurons with intrinsic and instantaneous fluctuations of characteristics for performing a simulation of a code spectrum from multielectrodes on a 2D mesh neural network. We showed that it is possible to estimate the characteristics of neurons such as the distribution of number of neurons around each electrode and their refractory periods. Although this process is a reverse problem and theoretically the solutions are not sufficiently guaranteed, the parameters seem to be consistent with those of neurons. That is, the proposed neural network model may adequately reflect the behavior of a cultured neuronal network. Furthermore, such prospect is discussed that code analysis will provide a base of communication within a neural network that will also create a base of natural intelligence. PMID:27239189
Incorporation of Condensation Heat Transfer in a Flow Network Code
NASA Technical Reports Server (NTRS)
Anthony, Miranda; Majumdar, Alok; McConnaughey, Paul K. (Technical Monitor)
2001-01-01
In this paper we have investigated the condensation of water vapor in a short tube. A numerical model of condensation heat transfer was incorporated in a flow network code. The flow network code that we have used in this paper is Generalized Fluid System Simulation Program (GFSSP). GFSSP is a finite volume based flow network code. Four different condensation models were presented in the paper. Soliman's correlation has been found to be the most stable in low flow rates which is of particular interest in this application. Another highlight of this investigation is conjugate or coupled heat transfer between solid or fluid. This work was done in support of NASA's International Space Station program.
Spectral Amplitude Coding (SAC)-OCDMA Network with 8DPSK
NASA Astrophysics Data System (ADS)
Aldhaibani, A. O.; Aljunid, S. A.; Fadhil, Hilal A.; Anuar, M. S.
2013-09-01
Optical code division multiple access (OCDMA) technique is required to meet the increased demand for high speed, large capacity communications in optical networks. In this paper, the transmission performance of a spectral amplitude coding (SAC)-OCDMA network is investigated when a conventional single-mode fiber (SMF) is used as the transmission link using 8DPSK modulation. The DW has a fixed weight of two. Simulation results reveal that the transmission distance is limited mainly by the fiber dispersion when high coding chip rate is used. For a two-user SAC-OCDMA network operating with 2 Gbit/s data rate and two wavelengths for each user, the maximum allowable transmission distance is about 15 km.
NASA Astrophysics Data System (ADS)
Ejaz, Saqib; Yang, Feng-Fan
2015-03-01
The parallel encoding and decoding structure of turbo codes makes them natural candidate for coded-cooperative scenarios. In this paper, we focus on one of the key components of turbo codes i.e., interleaver, and analyze its effect on the performance of coded-cooperative communication. The impact of an interleaver on the overall performance of cooperative systems depends on the type of an interleaver and its location in the cooperative encoding scheme. We consider code matched interleaver (CMI) as an optimum choice and present its role in a coded-cooperation scenario. The search and convergence of CMI for long interleaver sizes is an issue; therefore, a modification in the search conditions is included without any compromise on the performance of CMI. We also present analytical method to determine maximum S-constraint length for a CMI design. Further, we analyze the performance of two different encoding schemes of turbo codes, i.e., distributed turbo code (DTC) and distributed multiple turbo code (DMTC) after inclusion of CMI. Monte Carlo simulations show that CMI increases the diversity gain relative to other conventional interleavers such as uniform random interleaver. The channel is assumed to be Rayleigh fading among all communication nodes.
Sequential defense against random and intentional attacks in complex networks.
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. PMID:25768550
Sequential defense against random and intentional attacks in complex networks
NASA Astrophysics Data System (ADS)
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.
Random links enhance the sensitivity of networks to heterogeneity
NASA Astrophysics Data System (ADS)
Deep Rungta, Pranay; Sinha, Sudeshna
2015-12-01
In this work we investigate the dynamics of networks of bistable elements with varying degrees of randomness in connections, considering both static random links and time-varying random links. We explore how the presence of a few dissimilar elements affects the collective features of this system, and find that a network with random links is hyper-sensitive to heterogeneity. Namely, counter-intuitively, even a small number of distinct elements manages to drastically influence the collective dynamics of the network, with the mean-field swinging to the steady state of the minority elements. We find that the transition in the collective field gets sharper as the fraction of random links increases, for both static and time-varying links. We also demonstrate that networks where the links are switched more frequently, synchronize faster. Lastly, we show that as global bias tends to a critical value, even a single different element manages to drag the entire system to the natural stable state of the minority element. So it is evident that when coupling connections are random, a network with even a very small number of links per node, has the ability to become ultra-sensitive to heterogeneity.
The influence of the property of random coded patterns on fluctuation-correlation ghost imaging
NASA Astrophysics Data System (ADS)
Wang, Chenglong; Gong, Wenlin; Shao, Xuehui; Han, Shensheng
2016-06-01
According to the reconstruction feature of fluctuation-correlation ghost imaging (GI), we define a normalized characteristic matrix and the influence of the property of random coded patterns on GI is investigated based on the theory of matrix analysis. Both simulative and experimental results demonstrate that for different random coded patterns, the quality of fluctuation-correlation GI can be predicted by some parameters extracted from the normalized characteristic matrix, which suggests its potential application in the optimization of random coded patterns for GI system.
Critical scaling in the rheology of damped random spring networks
NASA Astrophysics Data System (ADS)
Tighe, Brian
2011-11-01
Physical, biological, and engineered materials ranging from foams and emulsions to bioppolymer and bar-joint networks can be modelled as random networks of springs. We study the oscillatory rheology of random networks immersed in a viscous background fluid, and show how their response is intimately tied to the presence or absence of floppy modes in the zero frequency limit. The rheology displays dynamic critical scaling with three different regimes: viscous fluid, elastic solid, and shear thinning power law fluid. We give scaling arguments to explain all of the critical exponents and confirm our predictions with numerics. Supported by the Dutch Organization for Scientific Research (NWO).
A scaling law for random walks on networks
Perkins, Theodore J.; Foxall, Eric; Glass, Leon; Edwards, Roderick
2014-01-01
The dynamics of many natural and artificial systems are well described as random walks on a network: the stochastic behaviour of molecules, traffic patterns on the internet, fluctuations in stock prices and so on. The vast literature on random walks provides many tools for computing properties such as steady-state probabilities or expected hitting times. Previously, however, there has been no general theory describing the distribution of possible paths followed by a random walk. Here, we show that for any random walk on a finite network, there are precisely three mutually exclusive possibilities for the form of the path distribution: finite, stretched exponential and power law. The form of the distribution depends only on the structure of the network, while the stepping probabilities control the parameters of the distribution. We use our theory to explain path distributions in domains such as sports, music, nonlinear dynamics and stochastic chemical kinetics. PMID:25311870
A scaling law for random walks on networks
NASA Astrophysics Data System (ADS)
Perkins, Theodore J.; Foxall, Eric; Glass, Leon; Edwards, Roderick
2014-10-01
The dynamics of many natural and artificial systems are well described as random walks on a network: the stochastic behaviour of molecules, traffic patterns on the internet, fluctuations in stock prices and so on. The vast literature on random walks provides many tools for computing properties such as steady-state probabilities or expected hitting times. Previously, however, there has been no general theory describing the distribution of possible paths followed by a random walk. Here, we show that for any random walk on a finite network, there are precisely three mutually exclusive possibilities for the form of the path distribution: finite, stretched exponential and power law. The form of the distribution depends only on the structure of the network, while the stepping probabilities control the parameters of the distribution. We use our theory to explain path distributions in domains such as sports, music, nonlinear dynamics and stochastic chemical kinetics.
A scaling law for random walks on networks.
Perkins, Theodore J; Foxall, Eric; Glass, Leon; Edwards, Roderick
2014-01-01
The dynamics of many natural and artificial systems are well described as random walks on a network: the stochastic behaviour of molecules, traffic patterns on the internet, fluctuations in stock prices and so on. The vast literature on random walks provides many tools for computing properties such as steady-state probabilities or expected hitting times. Previously, however, there has been no general theory describing the distribution of possible paths followed by a random walk. Here, we show that for any random walk on a finite network, there are precisely three mutually exclusive possibilities for the form of the path distribution: finite, stretched exponential and power law. The form of the distribution depends only on the structure of the network, while the stepping probabilities control the parameters of the distribution. We use our theory to explain path distributions in domains such as sports, music, nonlinear dynamics and stochastic chemical kinetics. PMID:25311870
Epidemic transmission on random mobile network with diverse infection periods
NASA Astrophysics Data System (ADS)
Li, Kezan; Yu, Hong; Zeng, Zhaorong; Ding, Yong; Ma, Zhongjun
2015-05-01
The heterogeneity of individual susceptibility and infectivity and time-varying topological structure are two realistic factors when we study epidemics on complex networks. Current research results have shown that the heterogeneity of individual susceptibility and infectivity can increase the epidemic threshold in a random mobile dynamical network with the same infection period. In this paper, we will focus on random mobile dynamical networks with diverse infection periods due to people's different constitutions and external circumstances. Theoretical results indicate that the epidemic threshold of the random mobile network with diverse infection periods is larger than the counterpart with the same infection period. Moreover, the heterogeneity of individual susceptibility and infectivity can play a significant impact on disease transmission. In particular, the homogeneity of individuals will avail to the spreading of epidemics. Numerical examples verify further our theoretical results very well.
Distributed Inference in Tree Networks Using Coding Theory
NASA Astrophysics Data System (ADS)
Kailkhura, Bhavya; Vempaty, Aditya; Varshney, Pramod K.
2015-07-01
In this paper, we consider the problem of distributed inference in tree based networks. In the framework considered in this paper, distributed nodes make a 1-bit local decision regarding a phenomenon before sending it to the fusion center (FC) via intermediate nodes. We propose the use of coding theory based techniques to solve this distributed inference problem in such structures. Data is progressively compressed as it moves towards the FC. The FC makes the global inference after receiving data from intermediate nodes. Data fusion at nodes as well as at the FC is implemented via error correcting codes. In this context, we analyze the performance for a given code matrix and also design the optimal code matrices at every level of the tree. We address the problems of distributed classification and distributed estimation separately and develop schemes to perform these tasks in tree networks. The proposed schemes are of practical significance due to their simple structure. We study the asymptotic inference performance of our schemes for two different classes of tree networks: fixed height tree networks, and fixed degree tree networks. We show that the proposed schemes are asymptotically optimal under certain conditions.
Energy coding in neural network with inhibitory neurons.
Wang, Ziyin; Wang, Rubin; Fang, Ruiyan
2015-04-01
This paper aimed at assessing and comparing the effects of the inhibitory neurons in the neural network on the neural energy distribution, and the network activities in the absence of the inhibitory neurons to understand the nature of neural energy distribution and neural energy coding. Stimulus, synchronous oscillation has significant difference between neural networks with and without inhibitory neurons, and this difference can be quantitatively evaluated by the characteristic energy distribution. In addition, the synchronous oscillation difference of the neural activity can be quantitatively described by change of the energy distribution if the network parameters are gradually adjusted. Compared with traditional method of correlation coefficient analysis, the quantitative indicators based on nervous energy distribution characteristics are more effective in reflecting the dynamic features of the neural network activities. Meanwhile, this neural coding method from a global perspective of neural activity effectively avoids the current defects of neural encoding and decoding theory and enormous difficulties encountered. Our studies have shown that neural energy coding is a new coding theory with high efficiency and great potential. PMID:25806094
Intergroup networks as random threshold graphs
NASA Astrophysics Data System (ADS)
Saha, Sudipta; Ganguly, Niloy; Mukherjee, Animesh; Krueger, Tyll
2014-04-01
Similar-minded people tend to form social groups. Due to pluralistic homophily as well as a sort of heterophily, people also participate in a wide variety of groups. Thus, these groups generally overlap with each other; an overlap between two groups can be characterized by the number of common members. These common members can play a crucial role in the transmission of information between the groups. As a step towards understanding the information dissemination, we perceive the system as a pruned intergroup network and show that it maps to a very basic graph theoretic concept known as a threshold graph. We analyze several structural properties of this network such as degree distribution, largest component size, edge density, and local clustering coefficient. We compare the theoretical predictions with the results obtained from several online social networks (LiveJournal, Flickr, YouTube) and find a good match.
Random fracture networks: percolation, geometry and flow
NASA Astrophysics Data System (ADS)
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.
Network robustness and fragility: percolation on random graphs.
Callaway, D S; Newman, M E; Strogatz, S H; Watts, D J
2000-12-18
Recent work on the Internet, social networks, and the power grid has addressed the resilience of these networks to either random or targeted deletion of network nodes or links. Such deletions include, for example, the failure of Internet routers or power transmission lines. Percolation models on random graphs provide a simple representation of this process but have typically been limited to graphs with Poisson degree distribution at their vertices. Such graphs are quite unlike real-world networks, which often possess power-law or other highly skewed degree distributions. In this paper we study percolation on graphs with completely general degree distribution, giving exact solutions for a variety of cases, including site percolation, bond percolation, and models in which occupation probabilities depend on vertex degree. We discuss the application of our theory to the understanding of network resilience. PMID:11136023
Randomizing bipartite networks: the case of the World Trade Web
Saracco, Fabio; Di Clemente, Riccardo; 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 World Trade Web, comparing the observed values of a number of structural quantities of interest with the expected ones, calculated via our randomization procedure. Interestingly, the behavior of the World Trade Web in this new representation is strongly different from the monopartite analogue, showing highly non-trivial patterns of self-organization. PMID:26029820
Code System to Generate Latin Hypercube and Random Samples.
IMAN, RONALD L.
1999-02-25
Version: 00 LHS was written for the generation of multi variate samples either completely at random or by a constrained randomization termed Latin hypercube sampling (LHS). The generation of these samples is based on user-specified parameters which dictate the characteristics of the generated samples, such as type of sample (LHS or random), sample size, number of samples desired, correlation structure on input variables, and type of distribution specified on each variable. The following distributions are built into the program: normal, lognormal, uniform, loguniform, triangular, and beta. In addition, the samples from the uniform and loguniform distributions may be modified by changing the frequency of the sampling within subintervals, and a subroutine which can be modified by the user to generate samples from other distributions (including empirical data) is provided.
Code System to Generate Latin Hypercube and Random Samples.
1999-02-25
Version: 00 LHS was written for the generation of multi variate samples either completely at random or by a constrained randomization termed Latin hypercube sampling (LHS). The generation of these samples is based on user-specified parameters which dictate the characteristics of the generated samples, such as type of sample (LHS or random), sample size, number of samples desired, correlation structure on input variables, and type of distribution specified on each variable. The following distributions aremore » built into the program: normal, lognormal, uniform, loguniform, triangular, and beta. In addition, the samples from the uniform and loguniform distributions may be modified by changing the frequency of the sampling within subintervals, and a subroutine which can be modified by the user to generate samples from other distributions (including empirical data) is provided.« less
Brainwashing random asymmetric “neural” networks
NASA Astrophysics Data System (ADS)
McGuire, P. C.; Littlewort, G. C.; Rafelski, J.
1991-11-01
An algorithm for synaptic modification (plasticity) is described by which a recurrently connected network of neuron-like units can organize itself to produce a sequence of activation states that does not repeat itself for a very long time. During the self-organization stage, the connections between the units undergo non-Hebbian modifications, which tend to decorrelate the activity of the units, thereby lengthening the period of the cyclic modes inherent in the network. It is shown that the peridiodicity of the activity rises exponentially with the amount of exposure to this plasticity algorithm. Threshold is also a critical parameter in determining cycle lengths, as is the rate of decay of the fields that accumulate at silent units.
Ambipolar transistors based on random networks of WS2 nanotubes
NASA Astrophysics Data System (ADS)
Sugahara, Mitsunari; Kawai, Hideki; Yomogida, Yohei; Maniwa, Yutaka; Okada, Susumu; Yanagi, Kazuhiro
2016-07-01
WS2 nanotubes are rolled multiwalled nanotubes made of a layered material, tungsten disulfide. Their fibril structures enable the fabrication of random network films; however, these films are nonconducting, and thus have not been used for electronic applications. Here, we demonstrate that carrier injection into WS2 networks using an electrolyte gating approach could cause these networks to act as semiconducting channels. We clarify the Raman characteristics of WS2 nanotubes under electrolyte gating and confirm the feasibility of the injection of electrons and holes. We reveal ambipolar behaviors of the WS2 nanotube networks in field-effect transistor setups with electrolyte gating.
Physical-layer network coding in coherent optical OFDM systems.
Guan, Xun; Chan, Chun-Kit
2015-04-20
We present the first experimental demonstration and characterization of the application of optical physical-layer network coding in coherent optical OFDM systems. It combines two optical OFDM frames to share the same link so as to enhance system throughput, while individual OFDM frames can be recovered with digital signal processing at the destined node. PMID:25969046
Selective randomized load balancing and mesh networks with changing demands
NASA Astrophysics Data System (ADS)
Shepherd, F. B.; Winzer, P. J.
2006-05-01
We consider the problem of building cost-effective networks that are robust to dynamic changes in demand patterns. We compare several architectures using demand-oblivious routing strategies. Traditional approaches include single-hop architectures based on a (static or dynamic) circuit-switched core infrastructure and multihop (packet-switched) architectures based on point-to-point circuits in the core. To address demand uncertainty, we seek minimum cost networks that can carry the class of hose demand matrices. Apart from shortest-path routing, Valiant's randomized load balancing (RLB), and virtual private network (VPN) tree routing, we propose a third, highly attractive approach: selective randomized load balancing (SRLB). This is a blend of dual-hop hub routing and randomized load balancing that combines the advantages of both architectures in terms of network cost, delay, and delay jitter. In particular, we give empirical analyses for the cost (in terms of transport and switching equipment) for the discussed architectures, based on three representative carrier networks. Of these three networks, SRLB maintains the resilience properties of RLB while achieving significant cost reduction over all other architectures, including RLB and multihop Internet protocol/multiprotocol label switching (IP/MPLS) networks using VPN-tree routing.
Network coding on heterogeneous multi-core processors for wireless sensor networks.
Kim, Deokho; Park, Karam; Ro, Won W
2011-01-01
While network coding is well known for its efficiency and usefulness in wireless sensor networks, the excessive costs associated with decoding computation and complexity still hinder its adoption into practical use. On the other hand, high-performance microprocessors with heterogeneous multi-cores would be used as processing nodes of the wireless sensor networks in the near future. To this end, this paper introduces an efficient network coding algorithm developed for the heterogenous multi-core processors. The proposed idea is fully tested on one of the currently available heterogeneous multi-core processors referred to as the Cell Broadband Engine. PMID:22164053
Network Coding on Heterogeneous Multi-Core Processors for Wireless Sensor Networks
Kim, Deokho; Park, Karam; Ro, Won W.
2011-01-01
While network coding is well known for its efficiency and usefulness in wireless sensor networks, the excessive costs associated with decoding computation and complexity still hinder its adoption into practical use. On the other hand, high-performance microprocessors with heterogeneous multi-cores would be used as processing nodes of the wireless sensor networks in the near future. To this end, this paper introduces an efficient network coding algorithm developed for the heterogenous multi-core processors. The proposed idea is fully tested on one of the currently available heterogeneous multi-core processors referred to as the Cell Broadband Engine. PMID:22164053
Bieleck, T.; Song, L.M.; Yau, S.S.T.; Kwong, M.K.
1995-07-01
The concepts of random wavelet transforms and discrete random wavelet transforms are introduced. It is shown that these transforms can lead to simultaneous compression and de-noising of signals that have been corrupted with fractional noises. Potential applications of algebraic geometric coding theory to encode the ensuing data are also discussed.
Tunable Allosteric Behavior in Random Spring Networks
NASA Astrophysics Data System (ADS)
Rocks, Jason W.; Pashine, Nidhi; Bischofberger, Irmgard; Goodrich, Carl P.; Nagel, Sidney R.; Liu, Andrea J.
Many proteins and other macromolecules exhibit allosteric behavior in which the binding of a ligand to one site affects the activity at a second distant site. Inspired by this biological process, we present an algorithm to tune disordered spring networks to exhibit allostery-like behavior. When the positions of a pair of nodes at one site in a network are perturbed, we can precisely tune the response of nodes located at another distant site in the system by removing only a small fraction of the bonds. This algorithm can be used to create a wide variety of different response types: response nodes can be located far away from each other, a large number of response sites can be simultaneously controlled, and even multiple independent responses can be tuned into the system. In addition, this algorithm can be generalized to account for bond bending, geometric nonlinearities and nonlinear bond potentials. However, even linear calculations match surprisingly well with macroscopic experimental realizations made by laser cutting or 3D printing.
Number of cliques in random scale-free network ensembles
NASA Astrophysics Data System (ADS)
Bianconi, Ginestra; Marsili, Matteo
2006-12-01
In this paper we calculate the average number of cliques in random scale-free networks in the limit of large network size N≫1. We consider first the hidden variable ensemble and subsequently the Molloy Reed ensemble. In both cases we find that cliques, i.e. fully connected subgraphs, appear also when the average degree is finite. This is in contrast to what happens in Erdös and Renyi graphs in which diverging average degree is required to observe cliques of size c>3. Moreover we show that in random scale-free networks the clique number, i.e. the size of the largest clique present in the network, diverges with the system size.
Enhanced networked server management with random remote backups
NASA Astrophysics Data System (ADS)
Kim, Song-Kyoo
2003-08-01
In this paper, the model is focused on available server management in network environments. The (remote) backup servers are hooked up by VPN (Virtual Private Network) and replace broken main severs immediately. A virtual private network (VPN) is a way to use a public network infrastructure and hooks up long-distance servers within a single network infrastructure. The servers can be represent as "machines" and then the system deals with main unreliable and random auxiliary spare (remote backup) machines. When the system performs a mandatory routine maintenance, auxiliary machines are being used for backups during idle periods. Unlike other existing models, the availability of auxiliary machines is changed for each activation in this enhanced model. Analytically tractable results are obtained by using several mathematical techniques and the results are demonstrated in the framework of optimized networked server allocation problems.
Exponential-family random graph models for valued networks
Krivitsky, Pavel N.
2013-01-01
Exponential-family random graph models (ERGMs) provide a principled and flexible way to model and simulate features common in social networks, such as propensities for homophily, mutuality, and friend-of-a-friend triad closure, through choice of model terms (sufficient statistics). However, those ERGMs modeling the more complex features have, to date, been limited to binary data: presence or absence of ties. Thus, analysis of valued networks, such as those where counts, measurements, or ranks are observed, has necessitated dichotomizing them, losing information and introducing biases. In this work, we generalize ERGMs to valued networks. Focusing on modeling counts, we formulate an ERGM for networks whose ties are counts and discuss issues that arise when moving beyond the binary case. We introduce model terms that generalize and model common social network features for such data and apply these methods to a network dataset whose values are counts of interactions. PMID:24678374
Hao, Kun; Jin, Zhigang; Shen, Haifeng; Wang, Ying
2015-01-01
Efficient routing protocols for data packet delivery are crucial to underwater sensor networks (UWSNs). However, communication in UWSNs is a challenging task because of the characteristics of the acoustic channel. Network coding is a promising technique for efficient data packet delivery thanks to the broadcast nature of acoustic channels and the relatively high computation capabilities of the sensor nodes. In this work, we present GPNC, a novel geographic routing protocol for UWSNs that incorporates partial network coding to encode data packets and uses sensor nodes' location information to greedily forward data packets to sink nodes. GPNC can effectively reduce network delays and retransmissions of redundant packets causing additional network energy consumption. Simulation results show that GPNC can significantly improve network throughput and packet delivery ratio, while reducing energy consumption and network latency when compared with other routing protocols. PMID:26029955
Hao, Kun; Jin, Zhigang; Shen, Haifeng; Wang, Ying
2015-01-01
Efficient routing protocols for data packet delivery are crucial to underwater sensor networks (UWSNs). However, communication in UWSNs is a challenging task because of the characteristics of the acoustic channel. Network coding is a promising technique for efficient data packet delivery thanks to the broadcast nature of acoustic channels and the relatively high computation capabilities of the sensor nodes. In this work, we present GPNC, a novel geographic routing protocol for UWSNs that incorporates partial network coding to encode data packets and uses sensor nodes’ location information to greedily forward data packets to sink nodes. GPNC can effectively reduce network delays and retransmissions of redundant packets causing additional network energy consumption. Simulation results show that GPNC can significantly improve network throughput and packet delivery ratio, while reducing energy consumption and network latency when compared with other routing protocols. PMID:26029955
Random Resistor Network Model of Minimal Conductivity in Graphene
NASA Astrophysics Data System (ADS)
Cheianov, Vadim V.; Fal'Ko, Vladimir I.; Altshuler, Boris L.; Aleiner, Igor L.
2007-10-01
Transport in undoped graphene is related to percolating current patterns in the networks of n- and p-type regions reflecting the strong bipolar charge density fluctuations. Finite transparency of the p-n junctions is vital in establishing the macroscopic conductivity. We propose a random resistor network model to analyze scaling dependencies of the conductance on the doping and disorder, the quantum magnetoresistance and the corresponding dephasing rate.
Structure of a randomly grown 2-d network.
Ajazi, Fioralba; Napolitano, George M; Turova, Tatyana; Zaurbek, Izbassar
2015-10-01
We introduce a growing random network on a plane as a model of a growing neuronal network. The properties of the structure of the induced graph are derived. We compare our results with available data. In particular, it is shown that depending on the parameters of the model the system undergoes in time different phases of the structure. We conclude with a possible explanation of some empirical data on the connections between neurons. PMID:26375356
Forward error correcting codes in fiber-optic synchronous code-division multiple access networks
NASA Astrophysics Data System (ADS)
Srivastava, Anand; Kar, Subrat; Jain, V. K.
2002-02-01
In optical code-division multiple access (OCDMA) networks, the performance is limited by optical multiple access interference (OMAI), amplified spontaneous emission (ASE) noise and receiver noise. To reduce OMAI and noise effects, use of forward error correcting (FEC) (18880, 18865) and (2370, 2358) Hamming codes are explored for STM-1 (155 Mbps) bit stream. The encoding is carried out at the multiplex-section layer. The check bits are embedded in the unused bytes of multiplex section overhead (MSOH). The expression for probability of error is derived taking into consideration OMAI, various sources of noise and effect of group velocity dispersion (GVD). It is observed that for a BER of 10 -9, use of FEC gives a coding gain of 1.4-2.1 dB depending upon the type of coding scheme used. It is also seen that there is a sensitivity improvement of about 3 dB if the source is suitably pre-chirped.
Listening to the noise: random fluctuations reveal gene network parameters
Munsky, Brian; Khammash, Mustafa
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.
Spread of information and infection on finite random networks
NASA Astrophysics Data System (ADS)
Isham, Valerie; Kaczmarska, Joanna; Nekovee, Maziar
2011-04-01
The modeling of epidemic-like processes on random networks has received considerable attention in recent years. While these processes are inherently stochastic, most previous work has been focused on deterministic models that ignore important fluctuations that may persist even in the infinite network size limit. In a previous paper, for a class of epidemic and rumor processes, we derived approximate models for the full probability distribution of the final size of the epidemic, as opposed to only mean values. In this paper we examine via direct simulations the adequacy of the approximate model to describe stochastic epidemics and rumors on several random network topologies: homogeneous networks, Erdös-Rényi (ER) random graphs, Barabasi-Albert scale-free networks, and random geometric graphs. We find that the approximate model is reasonably accurate in predicting the probability of spread. However, the position of the threshold and the conditional mean of the final size for processes near the threshold are not well described by the approximate model even in the case of homogeneous networks. We attribute this failure to the presence of other structural properties beyond degree-degree correlations, and in particular clustering, which are present in any finite network but are not incorporated in the approximate model. In order to test this “hypothesis” we perform additional simulations on a set of ER random graphs where degree-degree correlations and clustering are separately and independently introduced using recently proposed algorithms from the literature. Our results show that even strong degree-degree correlations have only weak effects on the position of the threshold and the conditional mean of the final size. On the other hand, the introduction of clustering greatly affects both the position of the threshold and the conditional mean. Similar analysis for the Barabasi-Albert scale-free network confirms the significance of clustering on the dynamics of
Optical code division multiplexed fiber Bragg grating sensing networks
NASA Astrophysics Data System (ADS)
Triana, Cristian; Varón, Margarita; Pastor, Daniel
2015-09-01
We present the application of Optical Code Division Multiplexing (OCDM) techniques in order to enhance the spectral operation and detection capability of fiber Bragg grating (FBG) sensors networks even under overlapping conditions. In this paper, Optical Orthogonal Codes (OOC) are used to design FBG sensors composed of more than one reflection band. Simulation of the interaction between the encoded Gaussian-shaped sensors is presented. Signal decoding is performed in the electrical domain without requiring additional optical components by means of the autocorrelation product between the reflected spectrum and each sensor-codeword. Results illustrate the accuracy and distinction capability of the method.
Random neural network recognition of shaped objects in strong clutter
NASA Astrophysics Data System (ADS)
Bakircioglu, Hakan; Gelenbe, Erol
1998-04-01
Detecting objects in images containing strong clutter is an important issue in a variety of applications such as medical imaging and automatic target recognition. Artificial neural networks are used as non-parametric pattern recognizers to cope with different problems due to their inherent ability to learn from training data. In this paper we propose a neural approach based on the Random Neural Network model (Gelenbe 1989, 1990, 1991, 1993), to detect shaped targets with the help of multiple neural networks whose outputs are combined for making decisions.
QOS-aware error recovery in wireless body sensor networks using adaptive network coding.
Razzaque, Mohammad Abdur; Javadi, Saeideh S; Coulibaly, Yahaya; Hira, Muta Tah
2015-01-01
Wireless body sensor networks (WBSNs) for healthcare and medical applications are real-time and life-critical infrastructures, which require a strict guarantee of quality of service (QoS), in terms of latency, error rate and reliability. Considering the criticality of healthcare and medical applications, WBSNs need to fulfill users/applications and the corresponding network's QoS requirements. For instance, for a real-time application to support on-time data delivery, a WBSN needs to guarantee a constrained delay at the network level. A network coding-based error recovery mechanism is an emerging mechanism that can be used in these systems to support QoS at very low energy, memory and hardware cost. However, in dynamic network environments and user requirements, the original non-adaptive version of network coding fails to support some of the network and user QoS requirements. This work explores the QoS requirements of WBSNs in both perspectives of QoS. Based on these requirements, this paper proposes an adaptive network coding-based, QoS-aware error recovery mechanism for WBSNs. It utilizes network-level and user-/application-level information to make it adaptive in both contexts. Thus, it provides improved QoS support adaptively in terms of reliability, energy efficiency and delay. Simulation results show the potential of the proposed mechanism in terms of adaptability, reliability, real-time data delivery and network lifetime compared to its counterparts. PMID:25551485
QoS-Aware Error Recovery in Wireless Body Sensor Networks Using Adaptive Network Coding
Razzaque, Mohammad Abdur; Javadi, Saeideh S.; Coulibaly, Yahaya; Hira, Muta Tah
2015-01-01
Wireless body sensor networks (WBSNs) for healthcare and medical applications are real-time and life-critical infrastructures, which require a strict guarantee of quality of service (QoS), in terms of latency, error rate and reliability. Considering the criticality of healthcare and medical applications, WBSNs need to fulfill users/applications and the corresponding network's QoS requirements. For instance, for a real-time application to support on-time data delivery, a WBSN needs to guarantee a constrained delay at the network level. A network coding-based error recovery mechanism is an emerging mechanism that can be used in these systems to support QoS at very low energy, memory and hardware cost. However, in dynamic network environments and user requirements, the original non-adaptive version of network coding fails to support some of the network and user QoS requirements. This work explores the QoS requirements of WBSNs in both perspectives of QoS. Based on these requirements, this paper proposes an adaptive network coding-based, QoS-aware error recovery mechanism for WBSNs. It utilizes network-level and user-/application-level information to make it adaptive in both contexts. Thus, it provides improved QoS support adaptively in terms of reliability, energy efficiency and delay. Simulation results show the potential of the proposed mechanism in terms of adaptability, reliability, real-time data delivery and network lifetime compared to its counterparts. PMID:25551485
Hierarchical scale-free network is fragile against random failure
NASA Astrophysics Data System (ADS)
Hasegawa, Takehisa; Nemoto, Koji
2013-12-01
We investigate site percolation in a hierarchical scale-free network known as the Dorogovtsev-Goltsev-Mendes network. We use the generating function method to show that the percolation threshold is 1, i.e., the system is not in the percolating phase when the occupation probability is less than 1. The present result is contrasted to bond percolation in the same network of which the percolation threshold is zero. We also show that the percolation threshold of intentional attacks is 1. Our results suggest that this hierarchical scale-free network is very fragile against both random failure and intentional attacks. Such a structural defect is common in many hierarchical network models.
Emergence of large cliques in random scale-free networks
NASA Astrophysics Data System (ADS)
Bianconi, Ginestra; Marsili, Matteo
2006-05-01
In a network cliques are fully connected subgraphs that reveal which are the tight communities present in it. Cliques of size c > 3 are present in random Erdös and Renyi graphs only in the limit of diverging average connectivity. Starting from the finding that real scale-free graphs have large cliques, we study the clique number in uncorrelated scale-free networks finding both upper and lower bounds. Interestingly, we find that in scale-free networks large cliques appear also when the average degree is finite, i.e. even for networks with power law degree distribution exponents γin(2,3). Moreover, as long as γ < 3, scale-free networks have a maximal clique which diverges with the system size.
Exponential random graph models for networks with community structure
NASA Astrophysics Data System (ADS)
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.
2D MIMO Network Coding with Inter-Route Interference Cancellation
NASA Astrophysics Data System (ADS)
Tran, Gia Khanh; Sakaguchi, Kei; Ono, Fumie; Araki, Kiyomichi
Infrastructure wireless mesh network has been attracting much attention due to the wide range of its application such as public wireless access, sensor network, etc. In recent years, researchers have shown that significant network throughput gain can be achieved by employing network coding in a wireless environment. For further improvement of network throughput in one dimensional (1D) topology, Ono et al. proposed to use multiple antenna technique combined with network coding. In this paper, being inspired by MIMO network coding in 1D topology, the authors establish a novel MIMO network coding algorithm for a 2D topology consisting of two crossing routes. In this algorithm, multiple network coded flows are spatially multiplexed. Owing to the efficient usage of radio resource of network coding and co-channel interference cancellation ability of MIMO, the proposed algorithm shows an 8-fold gain in network capacity compared to conventional methods in the best-case scenario.
Random Time Identity Based Firewall In Mobile Ad hoc Networks
NASA Astrophysics Data System (ADS)
Suman, Patel, R. B.; Singh, Parvinder
2010-11-01
A mobile ad hoc network (MANET) is a self-organizing network of mobile routers and associated hosts connected by wireless links. MANETs are highly flexible and adaptable but at the same time are highly prone to security risks due to the open medium, dynamically changing network topology, cooperative algorithms, and lack of centralized control. Firewall is an effective means of protecting a local network from network-based security threats and forms a key component in MANET security architecture. This paper presents a review of firewall implementation techniques in MANETs and their relative merits and demerits. A new approach is proposed to select MANET nodes at random for firewall implementation. This approach randomly select a new node as firewall after fixed time and based on critical value of certain parameters like power backup. This approach effectively balances power and resource utilization of entire MANET because responsibility of implementing firewall is equally shared among all the nodes. At the same time it ensures improved security for MANETs from outside attacks as intruder will not be able to find out the entry point in MANET due to the random selection of nodes for firewall implementation.
Energy efficient wireless sensor networks using asymmetric distributed source coding
NASA Astrophysics Data System (ADS)
Rao, Abhishek; Kulkarni, Murlidhar
2013-01-01
Wireless Sensor Networks (WSNs) are networks of sensor nodes deployed over a geographical area to perform a specific task. WSNs pose many design challenges. Energy conservation is one such design issue. In literature a wide range of solutions addressing this issue have been proposed. Generally WSNs are densely deployed. Thus the nodes with the close proximity are more likely to have the same data. Transmission of such non-aggregated data may lead to an inefficient energy management. Hence the data fusion has to be performed at the nodes so as to combine the edundant information into a single data unit. Distributed Source Coding is an efficient approach in achieving this task. In this paper an attempt has been made in modeling such a system. Various energy efficient codes were considered for the analysis. System performance in terms of energy efficiency has been made.
Opportunistic quantum network coding based on quantum teleportation
NASA Astrophysics Data System (ADS)
Shang, Tao; Du, Gang; Liu, Jian-wei
2016-04-01
It seems impossible to endow opportunistic characteristic to quantum network on the basis that quantum channel cannot be overheard without disturbance. In this paper, we propose an opportunistic quantum network coding scheme by taking full advantage of channel characteristic of quantum teleportation. Concretely, it utilizes quantum channel for secure transmission of quantum states and can detect eavesdroppers by means of quantum channel verification. What is more, it utilizes classical channel for both opportunistic listening to neighbor states and opportunistic coding by broadcasting measurement outcome. Analysis results show that our scheme can reduce the times of transmissions over classical channels for relay nodes and can effectively defend against classical passive attack and quantum active attack.
Critical dynamics of randomly assembled and diluted threshold networks
NASA Astrophysics Data System (ADS)
Kürten, Karl E.; Clark, John W.
2008-04-01
The dynamical behavior of a class of randomly assembled networks of binary threshold units subject to random deletion of connections is studied based on the annealed approximation suitable in the thermodynamic limit. The dynamical phase diagram is constructed for several forms of the probability density distribution of nonvanishing connection strengths. The family of power-law distribution functions ρ0(x)=(1-α)/(2|x|α) is found to play a special role in expanding the domain of stable, ordered dynamics at the expense of the disordered, “chaotic” phase. Relationships with other recent studies of the dynamics of complex networks allowing for variable in-degree of the units are explored. The relevance of the pruning of network connections to neural modeling and developmental neurobiology is discussed.
A chemical reaction network solver for the astrophysics code NIRVANA
NASA Astrophysics Data System (ADS)
Ziegler, U.
2016-02-01
Context. Chemistry often plays an important role in astrophysical gases. It regulates thermal properties by changing species abundances and via ionization processes. This way, time-dependent cooling mechanisms and other chemistry-related energy sources can have a profound influence on the dynamical evolution of an astrophysical system. Modeling those effects with the underlying chemical kinetics in realistic magneto-gasdynamical simulations provide the basis for a better link to observations. Aims: The present work describes the implementation of a chemical reaction network solver into the magneto-gasdynamical code NIRVANA. For this purpose a multispecies structure is installed, and a new module for evolving the rate equations of chemical kinetics is developed and coupled to the dynamical part of the code. A small chemical network for a hydrogen-helium plasma was constructed including associated thermal processes which is used in test problems. Methods: Evolving a chemical network within time-dependent simulations requires the additional solution of a set of coupled advection-reaction equations for species and gas temperature. Second-order Strang-splitting is used to separate the advection part from the reaction part. The ordinary differential equation (ODE) system representing the reaction part is solved with a fourth-order generalized Runge-Kutta method applicable for stiff systems inherent to astrochemistry. Results: A series of tests was performed in order to check the correctness of numerical and technical implementation. Tests include well-known stiff ODE problems from the mathematical literature in order to confirm accuracy properties of the solver used as well as problems combining gasdynamics and chemistry. Overall, very satisfactory results are achieved. Conclusions: The NIRVANA code is now ready to handle astrochemical processes in time-dependent simulations. An easy-to-use interface allows implementation of complex networks including thermal processes
Content-Based Multi-Channel Network Coding Algorithm in the Millimeter-Wave Sensor Network.
Lin, Kai; Wang, Di; Hu, Long
2016-01-01
With the development of wireless technology, the widespread use of 5G is already an irreversible trend, and millimeter-wave sensor networks are becoming more and more common. However, due to the high degree of complexity and bandwidth bottlenecks, the millimeter-wave sensor network still faces numerous problems. In this paper, we propose a novel content-based multi-channel network coding algorithm, which uses the functions of data fusion, multi-channel and network coding to improve the data transmission; the algorithm is referred to as content-based multi-channel network coding (CMNC). The CMNC algorithm provides a fusion-driven model based on the Dempster-Shafer (D-S) evidence theory to classify the sensor nodes into different classes according to the data content. By using the result of the classification, the CMNC algorithm also provides the channel assignment strategy and uses network coding to further improve the quality of data transmission in the millimeter-wave sensor network. Extensive simulations are carried out and compared to other methods. Our simulation results show that the proposed CMNC algorithm can effectively improve the quality of data transmission and has better performance than the compared methods. PMID:27376302
Content-Based Multi-Channel Network Coding Algorithm in the Millimeter-Wave Sensor Network
Lin, Kai; Wang, Di; Hu, Long
2016-01-01
With the development of wireless technology, the widespread use of 5G is already an irreversible trend, and millimeter-wave sensor networks are becoming more and more common. However, due to the high degree of complexity and bandwidth bottlenecks, the millimeter-wave sensor network still faces numerous problems. In this paper, we propose a novel content-based multi-channel network coding algorithm, which uses the functions of data fusion, multi-channel and network coding to improve the data transmission; the algorithm is referred to as content-based multi-channel network coding (CMNC). The CMNC algorithm provides a fusion-driven model based on the Dempster-Shafer (D-S) evidence theory to classify the sensor nodes into different classes according to the data content. By using the result of the classification, the CMNC algorithm also provides the channel assignment strategy and uses network coding to further improve the quality of data transmission in the millimeter-wave sensor network. Extensive simulations are carried out and compared to other methods. Our simulation results show that the proposed CMNC algorithm can effectively improve the quality of data transmission and has better performance than the compared methods. PMID:27376302
Random Evolution of Idiotypic Networks: Dynamics and Architecture
NASA Astrophysics Data System (ADS)
Brede, Markus; Behn, Ulrich
The paper deals with modelling a subsystem of the immune system, the so-called idiotypic network (INW). INWs, conceived by N.K. Jerne in 1974, are functional networks of interacting antibodies and B cells. In principle, Jernes' framework provides solutions to many issues in immunology, such as immunological memory, mechanisms for antigen recognition and self/non-self discrimination. Explaining the interconnection between the elementary components, local dynamics, network formation and architecture, and possible modes of global system function appears to be an ideal playground of statistical mechanics. We present a simple cellular automaton model, based on a graph representation of the system. From a simplified description of idiotypic interactions, rules for the random evolution of networks of occupied and empty sites on these graphs are derived. In certain biologically relevant parameter ranges the resultant dynamics leads to stationary states. A stationary state is found to correspond to a specific pattern of network organization. It turns out that even these very simple rules give rise to a multitude of different kinds of patterns. We characterize these networks by classifying `static' and `dynamic' network-patterns. A type of `dynamic' network is found to display many features of real INWs.
Censored Distributed Space-Time Coding for Wireless Sensor Networks
NASA Astrophysics Data System (ADS)
Yiu, S.; Schober, R.
2007-12-01
We consider the application of distributed space-time coding in wireless sensor networks (WSNs). In particular, sensors use a common noncoherent distributed space-time block code (DSTBC) to forward their local decisions to the fusion center (FC) which makes the final decision. We show that the performance of distributed space-time coding is negatively affected by erroneous sensor decisions caused by observation noise. To overcome this problem of error propagation, we introduce censored distributed space-time coding where only reliable decisions are forwarded to the FC. The optimum noncoherent maximum-likelihood and a low-complexity, suboptimum generalized likelihood ratio test (GLRT) FC decision rules are derived and the performance of the GLRT decision rule is analyzed. Based on this performance analysis we derive a gradient algorithm for optimization of the local decision/censoring threshold. Numerical and simulation results show the effectiveness of the proposed censoring scheme making distributed space-time coding a prime candidate for signaling in WSNs.
Searching method through biased random walks on complex networks.
Lee, Sungmin; Yook, Soon-Hyung; Kim, Yup
2009-07-01
Information search is closely related to the first-passage property of diffusing particle. The physical properties of diffusing particle is affected by the topological structure of the underlying network. Thus, the interplay between dynamical process and network topology is important to study information search on complex networks. Designing an efficient method has been one of main interests in information search. Both reducing the network traffic and decreasing the searching time have been two essential factors for designing efficient method. Here we propose an efficient method based on biased random walks. Numerical simulations show that the average searching time of the suggested model is more efficient than other well-known models. For a practical interest, we demonstrate how the suggested model can be applied to the peer-to-peer system. PMID:19658839
Profiling core-periphery network structure by random walkers
Rossa, Fabio Della; Dercole, Fabio; Piccardi, Carlo
2013-01-01
Disclosing the main features of the structure of a network is crucial to understand a number of static and dynamic properties, such as robustness to failures, spreading dynamics, or collective behaviours. Among the possible characterizations, the core-periphery paradigm models the network as the union of a dense core with a sparsely connected periphery, highlighting the role of each node on the basis of its topological position. Here we show that the core-periphery structure can effectively be profiled by elaborating the behaviour of a random walker. A curve—the core-periphery profile—and a numerical indicator are derived, providing a global topological portrait. Simultaneously, a coreness value is attributed to each node, qualifying its position and role. The application to social, technological, economical, and biological networks reveals the power of this technique in disclosing the overall network structure and the peculiar role of some specific nodes. PMID:23507984
Dynamic quality of service differentiation using fixed code weight in optical CDMA networks
NASA Astrophysics Data System (ADS)
Kakaee, Majid H.; Essa, Shawnim I.; Abd, Thanaa H.; Seyedzadeh, Saleh
2015-11-01
The emergence of network-driven applications, such as internet, video conferencing, and online gaming, brings in the need for a network the environments with capability of providing diverse Quality of Services (QoS). In this paper, a new code family of novel spreading sequences, called a Multi-Service (MS) code, has been constructed to support multiple services in Optical- Code Division Multiple Access (CDMA) system. The proposed method uses fixed weight for all services, however reducing the interfering codewords for the users requiring higher QoS. The performance of the proposed code is demonstrated using mathematical analysis. It shown that the total number of served users with satisfactory BER of 10-9 using NB=2 is 82, while they are only 36 and 10 when NB=3 and 4 respectively. The developed MS code is compared with variable-weight codes such as Variable Weight-Khazani Syed (VW-KS) and Multi-Weight-Random Diagonal (MW-RD). Different numbers of basic users (NB) are used to support triple-play services (audio, data and video) with different QoS requirements. Furthermore, reference to the BER of 10-12, 10-9, and 10-3 for video, data and audio, respectively, the system can support up to 45 total users. Hence, results show that the technique can clearly provide a relative QoS differentiation with lower value of basic users can support larger number of subscribers as well as better performance in terms of acceptable BER of 10-9 at fixed code weight.
Low-dimensional dynamics of structured random networks
NASA Astrophysics Data System (ADS)
Aljadeff, Johnatan; Renfrew, David; Vegué, Marina; Sharpee, Tatyana O.
2016-02-01
Using a generalized random recurrent neural network model, and by extending our recently developed mean-field approach [J. Aljadeff, M. Stern, and T. Sharpee, Phys. Rev. Lett. 114, 088101 (2015), 10.1103/PhysRevLett.114.088101], we study the relationship between the network connectivity structure and its low-dimensional dynamics. Each connection in the network is a random number with mean 0 and variance that depends on pre- and postsynaptic neurons through a sufficiently smooth function g of their identities. We find that these networks undergo a phase transition from a silent to a chaotic state at a critical point we derive as a function of g . Above the critical point, although unit activation levels are chaotic, their autocorrelation functions are restricted to a low-dimensional subspace. This provides a direct link between the network's structure and some of its functional characteristics. We discuss example applications of the general results to neuroscience where we derive the support of the spectrum of connectivity matrices with heterogeneous and possibly correlated degree distributions, and to ecology where we study the stability of the cascade model for food web structure.
State estimation for networked systems with randomly occurring quantisations
NASA Astrophysics Data System (ADS)
He, Xiao; Wang, Zidong; Ji, Y. D.; Zhou, D. H.
2013-07-01
In this article, the state estimation problem is investigated for a class of discrete-time networked systems with randomly occurring quantisations. Logarithmic quantisers with different quantisation laws are considered and a Bernoulli distributed stochastic sequence is utilised to determine which quantiser is used at a certain time instant. After converting the quantisation effects into sector-bounded parameter uncertainties, a sufficient condition ensuring the existence of desirable estimators is proposed by using Lyapunov function approach, and parameters of the desired estimator are further obtained. Simulation is carried out on a networked three-tank system in order to illustrate the applicability of the proposed state estimation technique.
Limited Imitation Contagion on Random Networks: Chaos, Universality, and Unpredictability
NASA Astrophysics Data System (ADS)
Dodds, Peter Sheridan; Harris, Kameron Decker; Danforth, Christopher M.
2013-04-01
We study a family of binary state, socially inspired contagion models which incorporate imitation limited by an aversion to complete conformity. We uncover rich behavior in our models whether operating with either probabilistic or deterministic individual response functions on both dynamic and fixed random networks. In particular, we find significant variation in the limiting behavior of a population’s infected fraction, ranging from steady state to chaotic. We show that period doubling arises as we increase the average node degree, and that the universality class of this well-known route to chaos depends on the interaction structure of random networks rather than the microscopic behavior of individual nodes. We find that increasing the fixedness of the system tends to stabilize the infected fraction, yet disjoint, multiple equilibria are possible depending solely on the choice of the initially infected node.
Random lasing in organo-lead halide perovskite microcrystal networks
Dhanker, R.; Brigeman, A. N.; Giebink, N. C.; Larsen, A. V.; Stewart, R. J.; Asbury, J. B.
2014-10-13
We report optically pumped random lasing in planar methylammonium lead iodide perovskite microcrystal networks that form spontaneously from spin coating. Low thresholds (<200 μJ/cm{sup 2}) and narrow linewidths (Δλ < 0.5 nm) reflect lasing from closed quasi-modes that result from ballistic waveguiding in linear network segments linked by scattering at the junctions. Spatio-spectral imaging indicates that these quasi-modes extend over lateral length scales >100 μm and spatially overlap with one another, resulting in chaotic pulse-to-pulse intensity fluctuations due to gain competition. These results demonstrate this class of hybrid organic-inorganic perovskite as a platform to study random lasing with well-defined, low-level disorder, and support the potential of these materials for use in semiconductor laser applications.
Intergranular degradation assessment via random grain boundary network analysis
Kumar, Mukul; Schwartz, Adam J.; King, Wayne E.
2002-01-01
A method is disclosed for determining the resistance of polycrystalline materials to intergranular degradation or failure (IGDF), by analyzing the random grain boundary network connectivity (RGBNC) microstructure. Analysis of the disruption of the RGBNC microstructure may be assess the effectiveness of materials processing in increasing IGDF resistance. Comparison of the RGBNC microstructures of materials exposed to extreme operating conditions to unexposed materials may be used to diagnose and predict possible onset of material failure due to
Gate modulation of anodically etched gallium arsenide nanowire random network
NASA Astrophysics Data System (ADS)
Aikawa, Shinya; Yamada, Kohei; Asoh, Hidetaka; Ono, Sachiko
2016-06-01
Gallium arsenide nanowires (GaAs NWs) formed by anodic etching show an electrically semi-insulating behavior because of charge carrier depletion caused by high interface state density. Here, we demonstrate the gate modulation of an anodically etched GaAs NW random network. By applying a reverse bias voltage after anodic etching of bulk GaAs, hydrogen ion exposure of the depleted NW region occurs, and then the interface state density is possibly decreased owing to the reduction in the amount of excess As generated at the interface between the amorphous Ga2O3 and GaAs layers. Consequently, the drain current of the thin-film transistor (TFT) with the GaAs NW random network was increased and was changed by the gate voltage. In contrast, the random network film remained in the insulator in the absence of reverse electrolysis treatment. The TFT performance is still insufficient but may be improved by optimizing the hydrogen ion exposure conditions.
SIR dynamics in random networks with heterogeneous connectivity.
Volz, Erik
2008-03-01
Random networks with specified degree distributions have been proposed as realistic models of population structure, yet the problem of dynamically modeling SIR-type epidemics in random networks remains complex. I resolve this dilemma by showing how the SIR dynamics can be modeled with a system of three nonlinear ODE's. The method makes use of the probability generating function (PGF) formalism for representing the degree distribution of a random network and makes use of network-centric quantities such as the number of edges in a well-defined category rather than node-centric quantities such as the number of infecteds or susceptibles. The PGF provides a simple means of translating between network and node-centric variables and determining the epidemic incidence at any time. The theory also provides a simple means of tracking the evolution of the degree distribution among susceptibles or infecteds. The equations are used to demonstrate the dramatic effects that the degree distribution plays on the final size of an epidemic as well as the speed with which it spreads through the population. Power law degree distributions are observed to generate an almost immediate expansion phase yet have a smaller final size compared to homogeneous degree distributions such as the Poisson. The equations are compared to stochastic simulations, which show good agreement with the theory. Finally, the dynamic equations provide an alternative way of determining the epidemic threshold where large-scale epidemics are expected to occur, and below which epidemic behavior is limited to finite-sized outbreaks. PMID:17668212
ERIC Educational Resources Information Center
Pirovich, L. Ya
The article shows the effect of the irregularity of using separate symbols on search noise on punch cards with superimposed symbol coding in information-search system (IPS). A binomial law of random value distribution of repetition of each symbol is established and analyzed. A method of determining the maximum value of symbol repetition is…
Wang, Xiaogang; Chen, Wen; Chen, Xudong
2015-03-01
In this paper, we develop a new optical information authentication system based on compressed double-random-phase-encoded images and quick-response (QR) codes, where the parameters of optical lightwave are used as keys for optical decryption and the QR code is a key for verification. An input image attached with QR code is first optically encoded in a simplified double random phase encoding (DRPE) scheme without using interferometric setup. From the single encoded intensity pattern recorded by a CCD camera, a compressed double-random-phase-encoded image, i.e., the sparse phase distribution used for optical decryption, is generated by using an iterative phase retrieval technique with QR code. We compare this technique to the other two methods proposed in literature, i.e., Fresnel domain information authentication based on the classical DRPE with holographic technique and information authentication based on DRPE and phase retrieval algorithm. Simulation results show that QR codes are effective on improving the security and data sparsity of optical information encryption and authentication system. PMID:25836845
A More Efficient COPE Architecture for Network Coding in Multihop Wireless Networks
NASA Astrophysics Data System (ADS)
Chi, Kaikai; Jiang, Xiaohong; Horiguchi, Susumu
Recently, a promising packet forwarding architecture COPE was proposed to essentially improve the throughput of multihop wireless networks, where each network node can intelligently encode multiple packets together and forward them in a single transmission. However, COPE is still in its infancy and has the following limitations: (1) COPE adopts the FIFO packet scheduling and thus does not provide different priorities for different types of packets. (2) COPE simply classifies all packets destined to the same nexthop into small-size or large-size virtual queues and examines only the head packet of each virtual queue to find coding solutions. Such a queueing structure will lose some potential coding opportunities, because among packets destined to the same nexthop at most two packets (the head packets of small-size and large-size queues) will be examined in the coding process, regardless of the number of flows. (3) The coding algorithm adopted in COPE is fast but cannot always find good solutions. In order to address the above limitations, in this paper we first present a new queueing structure for COPE, which can provide more potential coding opportunities, and then propose a new packet scheduling algorithm for this queueing structure to assign different priorities to different types of packets. Finally, we propose an efficient coding algorithm to find appropriate packets for coding. Simulation results demonstrate that this new COPE architecture can further greatly improve the node transmission efficiency.
A simple model of global cascades on random networks
Watts, Duncan J.
2002-01-01
The origin of large but rare cascades that are triggered by small initial shocks is a phenomenon that manifests itself as diversely as cultural fads, collective action, the diffusion of norms and innovations, and cascading failures in infrastructure and organizational networks. This paper presents a possible explanation of this phenomenon in terms of a sparse, random network of interacting agents whose decisions are determined by the actions of their neighbors according to a simple threshold rule. Two regimes are identified in which the network is susceptible to very large cascades—herein called global cascades—that occur very rarely. When cascade propagation is limited by the connectivity of the network, a power law distribution of cascade sizes is observed, analogous to the cluster size distribution in standard percolation theory and avalanches in self-organized criticality. But when the network is highly connected, cascade propagation is limited instead by the local stability of the nodes themselves, and the size distribution of cascades is bimodal, implying a more extreme kind of instability that is correspondingly harder to anticipate. In the first regime, where the distribution of network neighbors is highly skewed, it is found that the most connected nodes are far more likely than average nodes to trigger cascades, but not in the second regime. Finally, it is shown that heterogeneity plays an ambiguous role in determining a system's stability: increasingly heterogeneous thresholds make the system more vulnerable to global cascades; but an increasingly heterogeneous degree distribution makes it less vulnerable. PMID:16578874
Mean field theory for scale-free random networks
NASA Astrophysics Data System (ADS)
Barabási, Albert-László; Albert, Réka; Jeong, Hawoong
1999-10-01
Random networks with complex topology are common in Nature, describing systems as diverse as the world wide web or social and business networks. Recently, it has been demonstrated that most large networks for which topological information is available display scale-free features. Here we study the scaling properties of the recently introduced scale-free model, that can account for the observed power-law distribution of the connectivities. We develop a mean-field method to predict the growth dynamics of the individual vertices, and use this to calculate analytically the connectivity distribution and the scaling exponents. The mean-field method can be used to address the properties of two variants of the scale-free model, that do not display power-law scaling.
DYNAVAC: a transient-vacuum-network analysis code
Deis, G.A.
1980-07-08
This report discusses the structure and use of the program DYNAVAC, a new transient-vacuum-network analysis code implemented on the NMFECC CDC-7600 computer. DYNAVAC solves for the transient pressures in a network of up to twenty lumped volumes, interconnected in any configuration by specified conductances. Each volume can have an internal gas source, a pumping speed, and any initial pressure. The gas-source rates can vary with time in any piecewise-linear manner, and up to twenty different time variations can be included in a single problem. In addition, the pumping speed in each volume can vary with the total gas pumped in the volume, thus simulating the saturation of surface pumping. This report is intended to be both a general description and a user's manual for DYNAVAC.
Random access to mobile networks with advanced error correction
NASA Technical Reports Server (NTRS)
Dippold, Michael
1990-01-01
A random access scheme for unreliable data channels is investigated in conjunction with an adaptive Hybrid-II Automatic Repeat Request (ARQ) scheme using Rate Compatible Punctured Codes (RCPC) Forward Error Correction (FEC). A simple scheme with fixed frame length and equal slot sizes is chosen and reservation is implicit by the first packet transmitted randomly in a free slot, similar to Reservation Aloha. This allows the further transmission of redundancy if the last decoding attempt failed. Results show that a high channel utilization and superior throughput can be achieved with this scheme that shows a quite low implementation complexity. For the example of an interleaved Rayleigh channel and soft decision utilization and mean delay are calculated. A utilization of 40 percent may be achieved for a frame with the number of slots being equal to half the station number under high traffic load. The effects of feedback channel errors and some countermeasures are discussed.
Improved Iterative Decoding of Network-Channel Codes for Multiple-Access Relay Channel
Majumder, Saikat; Verma, Shrish
2015-01-01
Cooperative communication using relay nodes is one of the most effective means of exploiting space diversity for low cost nodes in wireless network. In cooperative communication, users, besides communicating their own information, also relay the information of other users. In this paper we investigate a scheme where cooperation is achieved using a common relay node which performs network coding to provide space diversity for two information nodes transmitting to a base station. We propose a scheme which uses Reed-Solomon error correcting code for encoding the information bit at the user nodes and convolutional code as network code, instead of XOR based network coding. Based on this encoder, we propose iterative soft decoding of joint network-channel code by treating it as a concatenated Reed-Solomon convolutional code. Simulation results show significant improvement in performance compared to existing scheme based on compound codes. PMID:27347526
Mechanical Behavior of Homogeneous and Composite Random Fiber Networks
NASA Astrophysics Data System (ADS)
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
Associative learning in random environments using neural networks.
Narendra, K S; Mukhopadhyay, S
1991-01-01
Associative learning is investigated using neural networks and concepts based on learning automata. The behavior of a single decision-maker containing a neural network is studied in a random environment using reinforcement learning. The objective is to determine the optimal action corresponding to a particular state. Since decisions have to be made throughout the context space based on a countable number of experiments, generalization is inevitable. Many different approaches can be followed to generate the desired discriminant function. Three different methods which use neural networks are discussed and compared. In the most general method, the output of the network determines the probability with which one of the actions is to be chosen. The weights of the network are updated on the basis of the actions and the response of the environment. The extension of similar concepts to decentralized decision-making in a context space is also introduced. Simulation results are included. Modifications in the implementations of the most general method to make it practically viable are also presented. All the methods suggested are feasible and the choice of a specific method depends on the accuracy desired as well as on the available computational power. PMID:18276348
First Passage Time for Random Walks in Heterogeneous Networks
NASA Astrophysics Data System (ADS)
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.
Collaborative Image Coding and Transmission over Wireless Sensor Networks
NASA Astrophysics Data System (ADS)
Wu, Min; Chen, Chang Wen
2006-12-01
The imaging sensors are able to provide intuitive visual information for quick recognition and decision. However, imaging sensors usually generate vast amount of data. Therefore, processing and coding of image data collected in a sensor network for the purpose of energy efficient transmission poses a significant technical challenge. In particular, multiple sensors may be collecting similar visual information simultaneously. We propose in this paper a novel collaborative image coding and transmission scheme to minimize the energy for data transmission. First, we apply a shape matching method to coarsely register images to find out maximal overlap to exploit the spatial correlation between images acquired from neighboring sensors. For a given image sequence, we transmit background image only once. A lightweight and efficient background subtraction method is employed to detect targets. Only the regions of target and their spatial locations are transmitted to the monitoring center. The whole image can then be reconstructed by fusing the background and the target images as well as their spatial locations. Experimental results show that the energy for image transmission can indeed be greatly reduced with collaborative image coding and transmission.
Distributed Coding/Decoding Complexity in Video Sensor Networks
Cordeiro, Paulo J.; Assunção, Pedro
2012-01-01
Video Sensor Networks (VSNs) are recent communication infrastructures used to capture and transmit dense visual information from an application context. In such large scale environments which include video coding, transmission and display/storage, there are several open problems to overcome in practical implementations. This paper addresses the most relevant challenges posed by VSNs, namely stringent bandwidth usage and processing time/power constraints. In particular, the paper proposes a novel VSN architecture where large sets of visual sensors with embedded processors are used for compression and transmission of coded streams to gateways, which in turn transrate the incoming streams and adapt them to the variable complexity requirements of both the sensor encoders and end-user decoder terminals. Such gateways provide real-time transcoding functionalities for bandwidth adaptation and coding/decoding complexity distribution by transferring the most complex video encoding/decoding tasks to the transcoding gateway at the expense of a limited increase in bit rate. Then, a method to reduce the decoding complexity, suitable for system-on-chip implementation, is proposed to operate at the transcoding gateway whenever decoders with constrained resources are targeted. The results show that the proposed method achieves good performance and its inclusion into the VSN infrastructure provides an additional level of complexity control functionality. PMID:22736972
Computational capabilities of random automata networks for reservoir computing
NASA Astrophysics Data System (ADS)
Snyder, David; Goudarzi, Alireza; Teuscher, Christof
2013-04-01
This paper underscores the conjecture that intrinsic computation is maximal in systems at the “edge of chaos”. We study the relationship between dynamics and computational capability in random Boolean networks (RBN) for reservoir computing (RC). RC is a computational paradigm in which a trained readout layer interprets the dynamics of an excitable component (called the reservoir) that is perturbed by external input. The reservoir is often implemented as a homogeneous recurrent neural network, but there has been little investigation into the properties of reservoirs that are discrete and heterogeneous. Random Boolean networks are generic and heterogeneous dynamical systems and here we use them as the reservoir. A RBN is typically a closed system; to use it as a reservoir we extend it with an input layer. As a consequence of perturbation, the RBN does not necessarily fall into an attractor. Computational capability in RC arises from a tradeoff between separability and fading memory of inputs. We find the balance of these properties predictive of classification power and optimal at critical connectivity. These results are relevant to the construction of devices which exploit the intrinsic dynamics of complex heterogeneous systems, such as biomolecular substrates.
Randomly evolving idiotypic networks: Structural properties and architecture
NASA Astrophysics Data System (ADS)
Schmidtchen, Holger; Thüne, Mario; Behn, Ulrich
2012-07-01
We consider a minimalistic dynamic model of the idiotypic network of B lymphocytes. A network node represents a population of B lymphocytes of the same specificity (idiotype), which is encoded by a bit string. The links of the network connect nodes with complementary and nearly complementary bit strings, allowing for a few mismatches. A node is occupied if a lymphocyte clone of the corresponding idiotype exists; otherwise it is empty. There is a continuous influx of new B lymphocytes of random idiotype from the bone marrow. B lymphocytes are stimulated by cross-linking their receptors with complementary structures. If there are too many complementary structures, steric hindrance prevents cross-linking. Stimulated cells proliferate and secrete antibodies of the same idiotype as their receptors; unstimulated lymphocytes die. Depending on few parameters, the autonomous system evolves randomly towards patterns of highly organized architecture, where the nodes can be classified into groups according to their statistical properties. We observe and describe analytically the building principles of these patterns, which make it possible to calculate number and size of the node groups and the number of links between them. The architecture of all patterns observed so far in simulations can be explained this way. A tool for real-time pattern identification is proposed.
Analysis of complex contagions in random multiplex networks
NASA Astrophysics Data System (ADS)
Yaǧan, Osman; Gligor, Virgil
2012-09-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, or political view), each link type is associated with a content-dependent parameter ci in [0,∞] 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 τ. Namely a node connected to mi active neighbors and ki-mi inactive neighbors via type i links will turn active if ∑cimi/∑ciki exceeds its threshold τ. 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 dynamics of complex contagions, and (iii) showing that content-dependent propagation over a multiplex network leads to a subtle relation between the giant vulnerable component of the graph and the global cascade condition that is not seen in the existing models in the literature.
Laplacian normalization and random walk on heterogeneous networks for disease-gene prioritization.
Zhao, Zhi-Qin; Han, Guo-Sheng; Yu, Zu-Guo; Li, Jinyan
2015-08-01
Random walk on heterogeneous networks is a recently emerging approach to effective disease gene prioritization. Laplacian normalization is a technique capable of normalizing the weight of edges in a network. We use this technique to normalize the gene matrix and the phenotype matrix before the construction of the heterogeneous network, and also use this idea to define the transition matrices of the heterogeneous network. Our method has remarkably better performance than the existing methods for recovering known gene-phenotype relationships. The Shannon information entropy of the distribution of the transition probabilities in our networks is found to be smaller than the networks constructed by the existing methods, implying that a higher number of top-ranked genes can be verified as disease genes. In fact, the most probable gene-phenotype relationships ranked within top 3 or top 5 in our gene lists can be confirmed by the OMIM database for many cases. Our algorithms have shown remarkably superior performance over the state-of-the-art algorithms for recovering gene-phenotype relationships. All Matlab codes can be available upon email request. PMID:25736609
Chirp- and random-based coded ultrasonic excitation for localized blood-brain barrier opening.
Kamimura, H A S; Wang, S; Wu, S-Y; Karakatsani, M E; Acosta, C; Carneiro, A A O; Konofagou, E E
2015-10-01
Chirp- and random-based coded excitation methods have been proposed to reduce standing wave formation and improve focusing of transcranial ultrasound. However, no clear evidence has been shown to support the benefits of these ultrasonic excitation sequences in vivo. This study evaluates the chirp and periodic selection of random frequency (PSRF) coded-excitation methods for opening the blood-brain barrier (BBB) in mice. Three groups of mice (n = 15) were injected with polydisperse microbubbles and sonicated in the caudate putamen using the chirp/PSRF coded (bandwidth: 1.5–1.9 MHz, peak negative pressure: 0.52 MPa, duration: 30 s) or standard ultrasound (frequency: 1.5 MHz, pressure: 0.52 MPa, burst duration: 20 ms, duration: 5 min) sequences. T1-weighted contrast-enhanced MRI scans were performed to quantitatively analyze focused ultrasound induced BBB opening. The mean opening volumes evaluated from the MRI were mm3, mm3and mm3 for the chirp, random and regular sonications, respectively. The mean cavitation levels were V.s, V.s and V.s for the chirp, random and regular sonications, respectively. The chirp and PSRF coded pulsing sequences improved the BBB opening localization by inducing lower cavitation levels and smaller opening volumes compared to results of the regular sonication technique. Larger bandwidths were associated with more focused targeting but were limited by the frequency response of the transducer, the skull attenuation and the microbubbles optimal frequency range. The coded methods could therefore facilitate highly localized drug delivery as well as benefit other transcranial ultrasound techniques that use higher pressure levels and higher precision to induce the necessary bioeffects in a brain region while avoiding damage to the surrounding healthy tissue. PMID:26394091
Regular graphs maximize the variability of random neural networks
NASA Astrophysics Data System (ADS)
Wainrib, Gilles; Galtier, Mathieu
2015-09-01
In this work we study the dynamics of systems composed of numerous interacting elements interconnected through a random weighted directed graph, such as models of random neural networks. We develop an original theoretical approach based on a combination of a classical mean-field theory originally developed in the context of dynamical spin-glass models, and the heterogeneous mean-field theory developed to study epidemic propagation on graphs. Our main result is that, surprisingly, increasing the variance of the in-degree distribution does not result in a more variable dynamical behavior, but on the contrary that the most variable behaviors are obtained in the regular graph setting. We further study how the dynamical complexity of the attractors is influenced by the statistical properties of the in-degree distribution.
Network Randomization and Dynamic Defense for Critical Infrastructure Systems
Chavez, Adrian R.; Martin, Mitchell Tyler; Hamlet, Jason; Stout, William M.S.; Lee, Erik
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.
Non-coding RNAs and complex distributed genetic networks
NASA Astrophysics Data System (ADS)
Zhdanov, Vladimir P.
2011-08-01
In eukaryotic cells, the mRNA-protein interplay can be dramatically influenced by non-coding RNAs (ncRNAs). Although this new paradigm is now widely accepted, an understanding of the effect of ncRNAs on complex genetic networks is lacking. To clarify what may happen in this case, we propose a mean-field kinetic model describing the influence of ncRNA on a complex genetic network with a distributed architecture including mutual protein-mediated regulation of many genes transcribed into mRNAs. ncRNA is considered to associate with mRNAs and inhibit their translation and/or facilitate degradation. Our results are indicative of the richness of the kinetics under consideration. The main complex features are found to be bistability and oscillations. One could expect to find kinetic chaos as well. The latter feature has however not been observed in our calculations. In addition, we illustrate the difference in the regulation of distributed networks by mRNA and ncRNA.
Universality classes of the generalized epidemic process on random networks
NASA Astrophysics Data System (ADS)
Chung, Kihong; Baek, Yongjoo; Ha, Meesoon; Jeong, Hawoong
2016-05-01
We present a self-contained discussion of the universality classes of the generalized epidemic process (GEP) on Poisson random networks, which is a simple model of social contagions with cooperative effects. These effects lead to rich phase transitional behaviors that include continuous and discontinuous transitions with tricriticality in between. With the help of a comprehensive finite-size scaling theory, we numerically confirm static and dynamic scaling behaviors of the GEP near continuous phase transitions and at tricriticality, which verifies the field-theoretical results of previous studies. We also propose a proper criterion for the discontinuous transition line, which is shown to coincide with the bond percolation threshold.
Bouchaud-Mézard model on a random network
NASA Astrophysics Data System (ADS)
Ichinomiya, Takashi
2012-09-01
We studied the Bouchaud-Mézard (BM) model, which was introduced to explain Pareto's law in a real economy, on a random network. Using “adiabatic and independent” assumptions, we analytically obtained the stationary probability distribution function of wealth. The results show that wealth condensation, indicated by the divergence of the variance of wealth, occurs at a larger J than that obtained by the mean-field theory, where J represents the strength of interaction between agents. We compared our results with numerical simulation results and found that they were in good agreement.
Exploring MEDLINE Space with Random Indexing and Pathfinder Networks
Cohen, Trevor
2008-01-01
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. PMID:18999236
SIRS Dynamics on Random Networks: Simulations and Analytical Models
NASA Astrophysics Data System (ADS)
Rozhnova, Ganna; Nunes, Ana
The standard pair approximation equations (PA) for the Susceptible-Infective-Recovered-Susceptible (SIRS) model of infection spread on a network of homogeneous degree k predict a thin phase of sustained oscillations for parameter values that correspond to diseases that confer long lasting immunity. Here we present a study of the dependence of this oscillatory phase on the parameter k and of its relevance to understand the behaviour of simulations on networks. For k = 4, we compare the phase diagram of the PA model with the results of simulations on regular random graphs (RRG) of the same degree. We show that for parameter values in the oscillatory phase, and even for large system sizes, the simulations either die out or exhibit damped oscillations, depending on the initial conditions. This failure of the standard PA model to capture the qualitative behaviour of the simulations on large RRGs is currently being investigated.
Power-law relations in random networks with communities.
Stegehuis, Clara; van der Hofstad, Remco; van Leeuwaarden, Johan S H
2016-07-01
Most random graph models are locally tree-like-do not contain short cycles-rendering them unfit for modeling networks with a community structure. We introduce the hierarchical configuration model (HCM), a generalization of the configuration model that includes community structures, while properties such as the size of the giant component, and the size of the giant percolating cluster under bond percolation can still be derived analytically. Viewing real-world networks as realizations of HCM, we observe two previously undiscovered power-law relations: between the number of edges inside a community and the community sizes, and between the number of edges going out of a community and the community sizes. We also relate the power-law exponent τ of the degree distribution with the power-law exponent of the community-size distribution γ. In the case of extremely dense communities (e.g., complete graphs), this relation takes the simple form τ=γ-1. PMID:27575143
Unbiased degree-preserving randomization of directed binary networks
NASA Astrophysics Data System (ADS)
Roberts, E. S.; Coolen, A. C. C.
2012-04-01
Randomizing networks using a naive “accept-all” edge-swap algorithm is generally biased. Building on recent results for nondirected graphs, we construct an ergodic detailed balance Markov chain with nontrivial acceptance probabilities for directed graphs, which converges to a strictly uniform measure and is based on edge swaps that conserve all in and out degrees. The acceptance probabilities can also be generalized to define Markov chains that target any alternative desired measure on the space of directed graphs in order to generate graphs with more sophisticated topological features. This is demonstrated by defining a process tailored to the production of directed graphs with specified degree-degree correlation functions. The theory is implemented numerically and tested on synthetic and biological network examples.
Power-law relations in random networks with communities
NASA Astrophysics Data System (ADS)
Stegehuis, Clara; van der Hofstad, Remco; van Leeuwaarden, Johan S. H.
2016-07-01
Most random graph models are locally tree-like—do not contain short cycles—rendering them unfit for modeling networks with a community structure. We introduce the hierarchical configuration model (HCM), a generalization of the configuration model that includes community structures, while properties such as the size of the giant component, and the size of the giant percolating cluster under bond percolation can still be derived analytically. Viewing real-world networks as realizations of HCM, we observe two previously undiscovered power-law relations: between the number of edges inside a community and the community sizes, and between the number of edges going out of a community and the community sizes. We also relate the power-law exponent τ of the degree distribution with the power-law exponent of the community-size distribution γ . In the case of extremely dense communities (e.g., complete graphs), this relation takes the simple form τ =γ -1 .
NASA Astrophysics Data System (ADS)
Tsai, Cheng-Mu; Liang, Tsair-Chun
2011-12-01
This paper proposes a wavelength/spatial (W/S) coding system with fixed in-phase code (FIPC) matrix in the optical code-division multiple-access (OCDMA) network. A scheme is presented to form the FIPC matrix which is applied to construct the W/S OCDMA network. The encoder/decoder in the W/S OCDMA network is fully able to eliminate the multiple-access-interference (MAI) at the balanced photo-detectors (PD), according to fixed in-phase cross correlation. The phase-induced intensity noise (PIIN) related to the power square is markedly suppressed in the receiver by spreading the received power into each PD while the net signal power is kept the same. Simulation results show that the W/S OCDMA network based on the FIPC matrices cannot only completely remove the MAI but effectively suppress the PIIN to upgrade the network performance.
NASA Astrophysics Data System (ADS)
Yu, Mingchao; Sadeghi, Parastoo; Aboutorab, Neda
2015-12-01
We consider broadcasting a block of packets to multiple wireless receivers under random packet erasures using instantly decodable network coding (IDNC). The sender first broadcasts each packet uncoded once, then generates coded packets according to receivers' feedback about their missing packets. We focus on strict IDNC (S-IDNC), where each coded packet includes at most one missing packet of every receiver. But, we will also study its relation with generalized IDNC (G-IDNC), where this condition is relaxed. We characterize two fundamental performance limits of S-IDNC: (1) the number of transmissions to complete the broadcast, which measures throughput and (2) average packet decoding delay, which measures how fast each packet is decoded at each receiver on average. We derive a closed-form expression for the expected minimum number of transmissions in terms of the number of packets and receivers and the erasure probability. We prove that it is NP-hard to minimize the average packet decoding delay of S-IDNC. We also prove that the graph models of S- and G-IDNC share the same chromatic number. Next, we design efficient S-IDNC transmission schemes and coding algorithms with full/intermittent receiver feedback. We present simulation results to corroborate the developed theory and compare our schemes with existing ones.
Randomizing world trade. I. A binary network analysis
NASA Astrophysics Data System (ADS)
Squartini, Tiziano; Fagiolo, Giorgio; Garlaschelli, Diego
2011-10-01
The international trade network (ITN) has received renewed multidisciplinary interest due to recent advances in network theory. However, it is still unclear whether a network approach conveys additional, nontrivial information with respect to traditional international-economics analyses that describe world trade only in terms of local (first-order) properties. In this and in a companion paper, we employ a recently proposed randomization method to assess in detail the role that local properties have in shaping higher-order patterns of the ITN in all its possible representations (binary or weighted, directed or undirected, aggregated or disaggregated by commodity) and across several years. Here we show that, remarkably, the properties of all binary projections of the network can be completely traced back to the degree sequence, which is therefore maximally informative. Our results imply that explaining the observed degree sequence of the ITN, which has not received particular attention in economic theory, should instead become one the main focuses of models of trade.
Randomizing world trade. I. A binary network analysis.
Squartini, Tiziano; Fagiolo, Giorgio; Garlaschelli, Diego
2011-10-01
The international trade network (ITN) has received renewed multidisciplinary interest due to recent advances in network theory. However, it is still unclear whether a network approach conveys additional, nontrivial information with respect to traditional international-economics analyses that describe world trade only in terms of local (first-order) properties. In this and in a companion paper, we employ a recently proposed randomization method to assess in detail the role that local properties have in shaping higher-order patterns of the ITN in all its possible representations (binary or weighted, directed or undirected, aggregated or disaggregated by commodity) and across several years. Here we show that, remarkably, the properties of all binary projections of the network can be completely traced back to the degree sequence, which is therefore maximally informative. Our results imply that explaining the observed degree sequence of the ITN, which has not received particular attention in economic theory, should instead become one the main focuses of models of trade. PMID:22181237
NASA Technical Reports Server (NTRS)
Rizzi, Stephen A.; Muravyov, Alexander A.
2002-01-01
Two new equivalent linearization implementations for geometrically nonlinear random vibrations are presented. Both implementations are based upon a novel approach for evaluating the nonlinear stiffness within commercial finite element codes and are suitable for use with any finite element code having geometrically nonlinear static analysis capabilities. The formulation includes a traditional force-error minimization approach and a relatively new version of a potential energy-error minimization approach, which has been generalized for multiple degree-of-freedom systems. Results for a simply supported plate under random acoustic excitation are presented and comparisons of the displacement root-mean-square values and power spectral densities are made with results from a nonlinear time domain numerical simulation.
Security authentication with a three-dimensional optical phase code using random forest classifier.
Markman, Adam; Carnicer, Artur; Javidi, Bahram
2016-06-01
An object with a unique three-dimensional (3D) optical phase mask attached is analyzed for security and authentication. These 3D optical phase masks are more difficult to duplicate or to have a mathematical formulation compared with 2D masks and thus have improved security capabilities. A quick response code was modulated using a random 3D optical phase mask generating a 3D optical phase code (OPC). Due to the scattering of light through the 3D OPC, a unique speckle pattern based on the materials and structure in the 3D optical phase mask is generated and recorded on a CCD device. Feature extraction is performed by calculating the mean, variance, skewness, kurtosis, and entropy for each recorded speckle pattern. The random forest classifier is used for authentication. Optical experiments demonstrate the feasibility of the authentication scheme. PMID:27409445
Random walk approach for dispersive transport in pipe networks
NASA Astrophysics Data System (ADS)
Sämann, Robert; Graf, Thomas; Neuweiler, Insa
2016-04-01
Keywords: particle transport, random walk, pipe, network, HYSTEM-EXTAN, OpenGeoSys After heavy pluvial events in urban areas the available drainage system may be undersized at peak flows (Fuchs, 2013). Consequently, rainwater in the pipe network is likely to spill out through manholes. The presence of hazardous contaminants in the pipe drainage system represents a potential risk to humans especially when the contaminated drainage water reaches the land surface. Real-time forecasting of contaminants in the drainage system needs a quick calculation. Numerical models to predict the fate of contaminants are usually based on finite volume methods. Those are not applicable here because of their volume averaging elements. Thus, a more efficient method is preferable, which is independent from spatial discretization. In the present study, a particle-based method is chosen to calculate transport paths and spatial distribution of contaminants within a pipe network. A random walk method for particles in turbulent flow in partially filled pipes has been developed. Different approaches for in-pipe-mixing and node-mixing with respect to the geometry in a drainage network are shown. A comparison of dispersive behavior and calculation time is given to find the fastest model. The HYSTEM-EXTRAN (itwh, 2002) model is used to provide hydrodynamic conditions in the pipe network according to surface runoff scenarios in order to real-time predict contaminant transport in an urban pipe network system. The newly developed particle-based model will later be coupled to the subsurface flow model OpenGeoSys (Kolditz et al., 2012). References: Fuchs, L. (2013). Gefährdungsanalyse zur Überflutungsvorsorge kommunaler Entwässerungssysteme. Sanierung und Anpassung von Entwässerungssystemen-Alternde Infrastruktur und Klimawandel, Österreichischer Wasser-und Abfallwirtschaftsverband, Wien, ISBN, 978-3. itwh (2002). Modellbeschreibung, Institut für technisch-wissenschaftliche Hydrologie Gmb
A hippocampal network for spatial coding during immobility and sleep.
Kay, Kenneth; Sosa, Marielena; Chung, Jason E; Karlsson, Mattias P; Larkin, Margaret C; Frank, Loren M
2016-03-10
How does an animal know where it is when it stops moving? Hippocampal place cells fire at discrete locations as subjects traverse space, thereby providing an explicit neural code for current location during locomotion. In contrast, during awake immobility, the hippocampus is thought to be dominated by neural firing representing past and possible future experience. The question of whether and how the hippocampus constructs a representation of current location in the absence of locomotion has been unresolved. Here we report that a distinct population of hippocampal neurons, located in the CA2 subregion, signals current location during immobility, and does so in association with a previously unidentified hippocampus-wide network pattern. In addition, signalling of location persists into brief periods of desynchronization prevalent in slow-wave sleep. The hippocampus thus generates a distinct representation of current location during immobility, pointing to mnemonic processing specific to experience occurring in the absence of locomotion. PMID:26934224
Incorporating Contact Network Structure in Cluster Randomized Trials
NASA Astrophysics Data System (ADS)
Staples, Patrick C.; Ogburn, Elizabeth L.; Onnela, Jukka-Pekka
2015-12-01
Whenever possible, the efficacy of a new treatment is investigated by randomly assigning some individuals to a treatment and others to control, and comparing the outcomes between the two groups. Often, when the treatment aims to slow an infectious disease, clusters of individuals are assigned to each treatment arm. The structure of interactions within and between clusters can reduce the power of the trial, i.e. the probability of correctly detecting a real treatment effect. We investigate the relationships among power, within-cluster structure, cross-contamination via between-cluster mixing, and infectivity by simulating an infectious process on a collection of clusters. We demonstrate that compared to simulation-based methods, current formula-based power calculations may be conservative for low levels of between-cluster mixing, but failing to account for moderate or high amounts can result in severely underpowered studies. Power also depends on within-cluster network structure for certain kinds of infectious spreading. Infections that spread opportunistically through highly connected individuals have unpredictable infectious breakouts, making it harder to distinguish between random variation and real treatment effects. Our approach can be used before conducting a trial to assess power using network information, and we demonstrate how empirical data can inform the extent of between-cluster mixing.
Incorporating Contact Network Structure in Cluster Randomized Trials.
Staples, Patrick C; Ogburn, Elizabeth L; Onnela, Jukka-Pekka
2015-01-01
Whenever possible, the efficacy of a new treatment is investigated by randomly assigning some individuals to a treatment and others to control, and comparing the outcomes between the two groups. Often, when the treatment aims to slow an infectious disease, clusters of individuals are assigned to each treatment arm. The structure of interactions within and between clusters can reduce the power of the trial, i.e. the probability of correctly detecting a real treatment effect. We investigate the relationships among power, within-cluster structure, cross-contamination via between-cluster mixing, and infectivity by simulating an infectious process on a collection of clusters. We demonstrate that compared to simulation-based methods, current formula-based power calculations may be conservative for low levels of between-cluster mixing, but failing to account for moderate or high amounts can result in severely underpowered studies. Power also depends on within-cluster network structure for certain kinds of infectious spreading. Infections that spread opportunistically through highly connected individuals have unpredictable infectious breakouts, making it harder to distinguish between random variation and real treatment effects. Our approach can be used before conducting a trial to assess power using network information, and we demonstrate how empirical data can inform the extent of between-cluster mixing. PMID:26631604
NASA Astrophysics Data System (ADS)
Wei, Pei; Gu, Rentao; Ji, Yuefeng
2014-06-01
As an innovative and promising technology, network coding has been introduced to passive optical networks (PON) in recent years to support inter optical network unit (ONU) communication, yet the signaling process and dynamic bandwidth allocation (DBA) in PON with network coding (NC-PON) still need further study. Thus, we propose a joint signaling and DBA scheme for efficiently supporting differentiated services of inter ONU communication in NC-PON. In the proposed joint scheme, the signaling process lays the foundation to fulfill network coding in PON, and it can not only avoid the potential threat to downstream security in previous schemes but also be suitable for the proposed hybrid dynamic bandwidth allocation (HDBA) scheme. In HDBA, a DBA cycle is divided into two sub-cycles for applying different coding, scheduling and bandwidth allocation strategies to differentiated classes of services. Besides, as network traffic load varies, the entire upstream transmission window for all REPORT messages slides accordingly, leaving the transmission time of one or two sub-cycles to overlap with the bandwidth allocation calculation time at the optical line terminal (the OLT), so that the upstream idle time can be efficiently eliminated. Performance evaluation results validate that compared with the existing two DBA algorithms deployed in NC-PON, HDBA demonstrates the best quality of service (QoS) support in terms of delay for all classes of services, especially guarantees the end-to-end delay bound of high class services. Specifically, HDBA can eliminate queuing delay and scheduling delay of high class services, reduce those of lower class services by at least 20%, and reduce the average end-to-end delay of all services over 50%. Moreover, HDBA also achieves the maximum delay fairness between coded and uncoded lower class services, and medium delay fairness for high class services.
Distributed Clone Detection in Static Wireless Sensor Networks: Random Walk with Network Division
Khan, Wazir Zada; Aalsalem, Mohammed Y.; Saad, N. M.
2015-01-01
Wireless Sensor Networks (WSNs) are vulnerable to clone attacks or node replication attacks as they are deployed in hostile and unattended environments where they are deprived of physical protection, lacking physical tamper-resistance of sensor nodes. As a result, an adversary can easily capture and compromise sensor nodes and after replicating them, he inserts arbitrary number of clones/replicas into the network. If these clones are not efficiently detected, an adversary can be further capable to mount a wide variety of internal attacks which can emasculate the various protocols and sensor applications. Several solutions have been proposed in the literature to address the crucial problem of clone detection, which are not satisfactory as they suffer from some serious drawbacks. In this paper we propose a novel distributed solution called Random Walk with Network Division (RWND) for the detection of node replication attack in static WSNs which is based on claimer-reporter-witness framework and combines a simple random walk with network division. RWND detects clone(s) by following a claimer-reporter-witness framework and a random walk is employed within each area for the selection of witness nodes. Splitting the network into levels and areas makes clone detection more efficient and the high security of witness nodes is ensured with moderate communication and memory overheads. Our simulation results show that RWND outperforms the existing witness node based strategies with moderate communication and memory overheads. PMID:25992913
Distributed clone detection in static wireless sensor networks: random walk with network division.
Khan, Wazir Zada; Aalsalem, Mohammed Y; Saad, N M
2015-01-01
Wireless Sensor Networks (WSNs) are vulnerable to clone attacks or node replication attacks as they are deployed in hostile and unattended environments where they are deprived of physical protection, lacking physical tamper-resistance of sensor nodes. As a result, an adversary can easily capture and compromise sensor nodes and after replicating them, he inserts arbitrary number of clones/replicas into the network. If these clones are not efficiently detected, an adversary can be further capable to mount a wide variety of internal attacks which can emasculate the various protocols and sensor applications. Several solutions have been proposed in the literature to address the crucial problem of clone detection, which are not satisfactory as they suffer from some serious drawbacks. In this paper we propose a novel distributed solution called Random Walk with Network Division (RWND) for the detection of node replication attack in static WSNs which is based on claimer-reporter-witness framework and combines a simple random walk with network division. RWND detects clone(s) by following a claimer-reporter-witness framework and a random walk is employed within each area for the selection of witness nodes. Splitting the network into levels and areas makes clone detection more efficient and the high security of witness nodes is ensured with moderate communication and memory overheads. Our simulation results show that RWND outperforms the existing witness node based strategies with moderate communication and memory overheads. PMID:25992913
Random Walks in Social Networks and their Applications: A Survey
NASA Astrophysics Data System (ADS)
Sarkar, Purnamrita; Moore, Andrew W.
A wide variety of interesting real world applications, e.g. friend suggestion in social networks, keyword search in databases, web-spam detection etc. can be framed as ranking entities in a graph. In order to obtain ranking we need a graph-theoretic measure of similarity. Ideally this should capture the information hidden in the graph structure. For example, two entities are similar, if there are lots of short paths between them. Random walks have proven to be a simple, yet powerful mathematical tool for extracting information from the ensemble of paths between entities in a graph. Since real world graphs are enormous and complex, ranking using random walks is still an active area of research. The research in this area spans from new applications to novel algorithms and mathematical analysis, bringing together ideas from different branches of statistics, mathematics and computer science. In this book chapter, we describe different random walk based proximity measures, their applications, and existing algorithms for computing them.
Effects of random rewiring on the degree correlation of scale-free networks
NASA Astrophysics Data System (ADS)
Qu, Jing; Wang, Sheng-Jun; Jusup, Marko; Wang, Zhen
2015-10-01
Random rewiring is used to generate null networks for the purpose of analyzing the topological properties of scale-free networks, yet the effects of random rewiring on the degree correlation are subject to contradicting interpretations in the literature. We comprehensively analyze the degree correlation of randomly rewired scale-free networks and show that random rewiring increases disassortativity by reducing the average degree of the nearest neighbors of high-degree nodes. The effect can be captured by the measures of the degree correlation that consider all links in the network, but not by analogous measures that consider only links between degree peers, hence the potential for contradicting interpretations. We furthermore find that random and directional rewiring affect the topology of a scale-free network differently, even if the degree correlation of the rewired networks is the same. Consequently, the network dynamics is changed, which is proven here by means of the biased random walk.
Effects of random rewiring on the degree correlation of scale-free networks
Qu, Jing; Wang, Sheng-Jun; Jusup, Marko; Wang, Zhen
2015-01-01
Random rewiring is used to generate null networks for the purpose of analyzing the topological properties of scale-free networks, yet the effects of random rewiring on the degree correlation are subject to contradicting interpretations in the literature. We comprehensively analyze the degree correlation of randomly rewired scale-free networks and show that random rewiring increases disassortativity by reducing the average degree of the nearest neighbors of high-degree nodes. The effect can be captured by the measures of the degree correlation that consider all links in the network, but not by analogous measures that consider only links between degree peers, hence the potential for contradicting interpretations. We furthermore find that random and directional rewiring affect the topology of a scale-free network differently, even if the degree correlation of the rewired networks is the same. Consequently, the network dynamics is changed, which is proven here by means of the biased random walk. PMID:26482005
A Network Coding Based Hybrid ARQ Protocol for Underwater Acoustic Sensor Networks.
Wang, Hao; Wang, Shilian; Zhang, Eryang; Zou, Jianbin
2016-01-01
Underwater Acoustic Sensor Networks (UASNs) have attracted increasing interest in recent years due to their extensive commercial and military applications. However, the harsh underwater channel causes many challenges for the design of reliable underwater data transport protocol. In this paper, we propose an energy efficient data transport protocol based on network coding and hybrid automatic repeat request (NCHARQ) to ensure reliability, efficiency and availability in UASNs. Moreover, an adaptive window length estimation algorithm is designed to optimize the throughput and energy consumption tradeoff. The algorithm can adaptively change the code rate and can be insensitive to the environment change. Extensive simulations and analysis show that NCHARQ significantly reduces energy consumption with short end-to-end delay. PMID:27618044
Quantitative analysis of accuracy of seismic wave-propagation codes in 3D random scattering media
NASA Astrophysics Data System (ADS)
Galis, Martin; Imperatori, Walter; Mai, P. Martin
2013-04-01
Several recent verification studies (e.g. Day et al., 2001; Bielak et al., 2010, Chaljub et al., 2010) have demonstrated the importance of assessing the accuracy of available numerical tools at low frequency in presence of large-scale features (basins, topography, etc.). The fast progress in high-performance computing, including efficient optimization of numerical codes on petascale supercomputers, has permitted the simulation of 3D seismic wave propagation at frequencies of engineering interest (up to 10Hz) in highly heterogeneous media (e.g. Hartzell et al, 2010; Imperatori and Mai, 2013). However, high frequency numerical simulations involving random scattering media, characterized by small-scale heterogeneities, are much more challenging for most numerical methods, and their verification may therefore be even more crucial than in the low-frequency case. Our goal is to quantitatively compare the accuracy and the behavior of three different numerical codes for seismic wave propagation in 3D random scattering media at high frequency. We deploy a point source with omega-squared spectrum, and focus on the near-source region, being of great interest in strong motion seismology. We use two codes based on finite-difference method (FD1 and FD2) and one code based on support-operator method (SO). Both FD1 and FD2 are 4-th order staggered-grid finite-difference codes (for FD1 see Olsen et al., 2009; for FD2 see Moczo et al., 2007). The FD1 and FD2 codes are characterized by slightly different medium representations, since FD1 uses point values of material parameters in each FD-cell, while FD2 uses the effective material parameters at each grid-point (Moczo et al., 2002). SO is 2-nd order support-operator method (Ely et al., 2008). We considered models with random velocity perturbations described by van Karman correlation function with different correlation lengths and different standard deviations. Our results show significant variability in both phase and amplitude as
Technology Infusion of CodeSonar into the Space Network Ground Segment
NASA Technical Reports Server (NTRS)
Benson, Markland J.
2009-01-01
This slide presentation reviews the applicability of CodeSonar to the Space Network software. CodeSonar is a commercial off the shelf system that analyzes programs written in C, C++ or Ada for defects in the code. Software engineers use CodeSonar results as an input to the existing source code inspection process. The study is focused on large scale software developed using formal processes. The systems studied are mission critical in nature but some use commodity computer systems.
Impact of dynamic rate coding aspects of mobile phone networks on forensic voice comparison.
Alzqhoul, Esam A S; Nair, Balamurali B T; Guillemin, Bernard J
2015-09-01
Previous studies have shown that landline and mobile phone networks are different in their ways of handling the speech signal, and therefore in their impact on it. But the same is also true of the different networks within the mobile phone arena. There are two major mobile phone technologies currently in use today, namely the global system for mobile communications (GSM) and code division multiple access (CDMA) and these are fundamentally different in their design. For example, the quality of the coded speech in the GSM network is a function of channel quality, whereas in the CDMA network it is determined by channel capacity (i.e., the number of users sharing a cell site). This paper examines the impact on the speech signal of a key feature of these networks, namely dynamic rate coding, and its subsequent impact on the task of likelihood-ratio-based forensic voice comparison (FVC). Surprisingly, both FVC accuracy and precision are found to be better for both GSM- and CDMA-coded speech than for uncoded. Intuitively one expects FVC accuracy to increase with increasing coded speech quality. This trend is shown to occur for the CDMA network, but, surprisingly, not for the GSM network. Further, in respect to comparisons between these two networks, FVC accuracy for CDMA-coded speech is shown to be slightly better than for GSM-coded speech, particularly when the coded-speech quality is high, but in terms of FVC precision the two networks are shown to be very similar. PMID:26385720
Influence of weight heterogeneity on random walks in scale-free networks
NASA Astrophysics Data System (ADS)
Li, Ling; Guan, Jihong; Qi, Zhaohui
2016-07-01
Many systems are best described by weighted networks, in which the weights of the edges are heterogeneous. In this paper, we focus on random walks in weighted network, investigating the impacts of weight heterogeneity on the behavior of random walks. We study random walks in a family of weighted scale-free tree-like networks with power-law weight distribution. We concentrate on three cases of random walk problems: with a trap located at a hub node, a leaf adjacent to a hub node, and a farthest leaf node from a hub. For all these cases, we calculate analytically the global mean first passage time (GMFPT) measuring the efficiency of random walk, as well as the leading scaling of GMFPT. We find a significant decrease in the dominating scaling of GMFPT compared with the corresponding binary networks in all three random walk problems, which implies that weight heterogeneity has a significant influence on random walks in scale-free networks.
Chirp- and random-based coded ultrasonic excitation for localized blood-brain barrier opening
NASA Astrophysics Data System (ADS)
Kamimura, H. A. S.; Wang, S.; Wu, S.-Y.; Karakatsani, M. E.; Acosta, C.; Carneiro, A. A. O.; Konofagou, E. E.
2015-10-01
Chirp- and random-based coded excitation methods have been proposed to reduce standing wave formation and improve focusing of transcranial ultrasound. However, no clear evidence has been shown to support the benefits of these ultrasonic excitation sequences in vivo. This study evaluates the chirp and periodic selection of random frequency (PSRF) coded-excitation methods for opening the blood-brain barrier (BBB) in mice. Three groups of mice (n = 15) were injected with polydisperse microbubbles and sonicated in the caudate putamen using the chirp/PSRF coded (bandwidth: 1.5-1.9 MHz, peak negative pressure: 0.52 MPa, duration: 30 s) or standard ultrasound (frequency: 1.5 MHz, pressure: 0.52 MPa, burst duration: 20 ms, duration: 5 min) sequences. T1-weighted contrast-enhanced MRI scans were performed to quantitatively analyze focused ultrasound induced BBB opening. The mean opening volumes evaluated from the MRI were 9.38+/- 5.71 mm3, 8.91+/- 3.91 mm3and 35.47+/- 5.10 mm3 for the chirp, random and regular sonications, respectively. The mean cavitation levels were 55.40+/- 28.43 V.s, 63.87+/- 29.97 V.s and 356.52+/- 257.15 V.s for the chirp, random and regular sonications, respectively. The chirp and PSRF coded pulsing sequences improved the BBB opening localization by inducing lower cavitation levels and smaller opening volumes compared to results of the regular sonication technique. Larger bandwidths were associated with more focused targeting but were limited by the frequency response of the transducer, the skull attenuation and the microbubbles optimal frequency range. The coded methods could therefore facilitate highly localized drug delivery as well as benefit other transcranial ultrasound techniques that use higher pressure levels and higher precision to induce the necessary bioeffects in a brain region while avoiding damage to the surrounding healthy tissue.
Information Filtering via Biased Random Walk on Coupled Social Network
Dong, Qiang; Fu, Yan
2014-01-01
The recommender systems have advanced a great deal in the past two decades. However, most researchers focus their attentions on mining the similarities among users or objects in recommender systems and overlook the social influence which plays an important role in users' purchase process. In this paper, we design a biased random walk algorithm on coupled social networks which gives recommendation results based on both social interests and users' preference. Numerical analyses on two real data sets, Epinions and Friendfeed, demonstrate the improvement of recommendation performance by taking social interests into account, and experimental results show that our algorithm can alleviate the user cold-start problem more effectively compared with the mass diffusion and user-based collaborative filtering methods. PMID:25147867
Distributed fault estimation with randomly occurring uncertainties over sensor networks
NASA Astrophysics Data System (ADS)
Dong, Hongli; Wang, Zidong; Bu, Xianye; Alsaadi, Fuad E.
2016-07-01
This paper is concerned with the distributed fault estimation problem for a class of uncertain stochastic systems over sensor networks. The norm-bounded uncertainty enters into the system in a random way governed by a set of Bernoulli distributed white sequence. The purpose of the addressed problem is to design distributed fault estimators, via available output measurements from not only the individual sensor, but also its neighbouring sensors, such that the fault estimation error converges to zero exponentially in the mean square while the disturbance rejection attenuation is constrained to a give level by means of the ? performance index. Intensive stochastic analysis is carried out to obtain sufficient conditions for ensuring the exponential stability as well as prescribed ? performance for the overall estimation error dynamics. Simulation results are provided to demonstrate the effectiveness of the proposed fault estimation technique in this paper.
Information filtering via biased random walk on coupled social network.
Nie, Da-Cheng; Zhang, Zi-Ke; Dong, Qiang; Sun, Chongjing; Fu, Yan
2014-01-01
The recommender systems have advanced a great deal in the past two decades. However, most researchers focus their attentions on mining the similarities among users or objects in recommender systems and overlook the social influence which plays an important role in users' purchase process. In this paper, we design a biased random walk algorithm on coupled social networks which gives recommendation results based on both social interests and users' preference. Numerical analyses on two real data sets, Epinions and Friendfeed, demonstrate the improvement of recommendation performance by taking social interests into account, and experimental results show that our algorithm can alleviate the user cold-start problem more effectively compared with the mass diffusion and user-based collaborative filtering methods. PMID:25147867
NASA Astrophysics Data System (ADS)
Li, Chuan-qi; Yang, Meng-jie; Luo, De-jun; Lu, Ye; Kong, Yi-pu; Zhang, Dong-chuang
2014-09-01
A new kind of variable-length codes with good correlation properties for the multirate asynchronous optical code division multiple access (OCDMA) multimedia networks is proposed, called non-repetition interval (NRI) codes. The NRI codes can be constructed by structuring the interval-sets with no repetition, and the code length depends on the number of users and the code weight. According to the structural characteristics of NRI codes, the formula of bit error rate (BER) is derived. Compared with other variable-length codes, the NRI codes have lower BER. A multirate OCDMA multimedia simulation system is designed and built, the longer codes are assigned to the users who need slow speed, while the shorter codes are assigned to the users who need high speed. It can be obtained by analyzing the eye diagram that the user with slower speed has lower BER, and the conclusion is the same as the actual demand in multimedia data transport.
Damage spreading in spatial and small-world random boolean networks
Lu, Qiming; Teuscher, Christof
2008-01-01
Random Boolean Networks (RBNs) are often used as generic models for certain dynamics of complex systems, ranging from social networks, neural networks, to gene or protein interaction networks. Traditionally, RBNs are interconnected randomly and without considering any spatial arrangement of the links and nodes. However, most real-world networks are spatially extended and arranged with regular, small-world, or other non-random connections. Here we explore the RBN network topology between extreme local connections, random small-world, and 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} << 1) and that the critical connectivity of stability K{sub 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 trade-offs between damage spreading (robustness), the network wiring cost, and the network's communication characteristics.
Properties of networks with partially structured and partially random connectivity
Ahmadian, Yashar; Fumarola, Francesco; Miller, Kenneth D.
2016-01-01
Networks studied in many disciplines, including neuroscience and mathematical biology, have connectivity that may be stochastic about some underlying mean connectivity represented by a nonnormal matrix. Furthermore the stochasticity may not be i.i.d. across elements of the connectivity matrix. More generally, the problem of understanding the behavior of stochastic matrices with nontrivial mean structure and correlations arises in many settings. We address this by characterizing large random N × N matrices of the form A = M + LJR, where M, L and R are arbitrary deterministic matrices and J is a random matrix of zero-mean independent and identically distributed elements. M can be nonnormal, and L and R allow correlations that have separable dependence on row and column indices. We first provide a general formula for the eigenvalue density of A. For A nonnormal, the eigenvalues do not suffice to specify the dynamics induced by A, so we also provide general formulae for the transient evolution of the magnitude of activity and frequency power spectrum in an N -dimensional linear dynamical system with a coupling matrix given by A. These quantities can also be thought of as characterizing the stability and the magnitude of the linear response of a nonlinear network to small perturbations about a fixed point. We derive these formulae and work them out analytically for some examples of M, L and R motivated by neurobiological models. We also argue that the persistence as N → ∞ of a finite number of randomly distributed outlying eigenvalues outside the support of the eigenvalue density of A, as previously observed, arises in regions of the complex plane Ω where there are nonzero singular values of L−1(z1 − M)R−1 (for z ∈ Ω) that vanish as N → ∞. When such singular values do not exist and L and R are equal to the identity, there is a correspondence in the normalized Frobenius norm (but not in the operator norm) between the support of the spectrum of A for
Properties of networks with partially structured and partially random connectivity
NASA Astrophysics Data System (ADS)
Ahmadian, Yashar; Fumarola, Francesco; Miller, Kenneth D.
2015-01-01
Networks studied in many disciplines, including neuroscience and mathematical biology, have connectivity that may be stochastic about some underlying mean connectivity represented by a non-normal matrix. Furthermore, the stochasticity may not be independent and identically distributed (iid) across elements of the connectivity matrix. More generally, the problem of understanding the behavior of stochastic matrices with nontrivial mean structure and correlations arises in many settings. We address this by characterizing large random N ×N matrices of the form A =M +L J R , where M ,L , and R are arbitrary deterministic matrices and J is a random matrix of zero-mean iid elements. M can be non-normal, and L and R allow correlations that have separable dependence on row and column indices. We first provide a general formula for the eigenvalue density of A . For A non-normal, the eigenvalues do not suffice to specify the dynamics induced by A , so we also provide general formulas for the transient evolution of the magnitude of activity and frequency power spectrum in an N -dimensional linear dynamical system with a coupling matrix given by A . These quantities can also be thought of as characterizing the stability and the magnitude of the linear response of a nonlinear network to small perturbations about a fixed point. We derive these formulas and work them out analytically for some examples of M ,L , and R motivated by neurobiological models. We also argue that the persistence as N →∞ of a finite number of randomly distributed outlying eigenvalues outside the support of the eigenvalue density of A , as previously observed, arises in regions of the complex plane Ω where there are nonzero singular values of L-1(z 1 -M ) R-1 (for z ∈Ω ) that vanish as N →∞ . When such singular values do not exist and L and R are equal to the identity, there is a correspondence in the normalized Frobenius norm (but not in the operator norm) between the support of the spectrum
Wan, Jan; Xiong, Naixue; Zhang, Wei; Zhang, Qinchao; Wan, Zheng
2012-01-01
The reliability of wireless sensor networks (WSNs) can be greatly affected by failures of sensor nodes due to energy exhaustion or the influence of brutal external environment conditions. Such failures seriously affect the data persistence and collection efficiency. Strategies based on network coding technology for WSNs such as LTCDS can improve the data persistence without mass redundancy. However, due to the bad intermediate performance of LTCDS, a serious ‘cliff effect’ may appear during the decoding period, and source data are hard to recover from sink nodes before sufficient encoded packets are collected. In this paper, the influence of coding degree distribution strategy on the ‘cliff effect’ is observed and the prioritized data storage and dissemination algorithm PLTD-ALPHA is presented to achieve better data persistence and recovering performance. With PLTD-ALPHA, the data in sensor network nodes present a trend that their degree distribution increases along with the degree level predefined, and the persistent data packets can be submitted to the sink node according to its degree in order. Finally, the performance of PLTD-ALPHA is evaluated and experiment results show that PLTD-ALPHA can greatly improve the data collection performance and decoding efficiency, while data persistence is not notably affected. PMID:23235451
Wetmore, Kelly M.; Price, Morgan N.; Waters, Robert J.; Lamson, Jacob S.; He, Jennifer; Hoover, Cindi A.; Blow, Matthew J.; Bristow, James; Butland, Gareth; Arkin, Adam P.; Deutschbauer, Adam
2015-05-12
Transposon mutagenesis with next-generation sequencing (TnSeq) is a powerful approach to annotate gene function in bacteria, but existing protocols for TnSeq require laborious preparation of every sample before sequencing. Thus, the existing protocols are not amenable to the throughput necessary to identify phenotypes and functions for the majority of genes in diverse bacteria. Here, we present a method, random bar code transposon-site sequencing (RB-TnSeq), which increases the throughput of mutant fitness profiling by incorporating random DNA bar codes into Tn5 and mariner transposons and by using bar code sequencing (BarSeq) to assay mutant fitness. RB-TnSeq can be used with any transposon, and TnSeq is performed once per organism instead of once per sample. Each BarSeq assay requires only a simple PCR, and 48 to 96 samples can be sequenced on one lane of an Illumina HiSeq system. We demonstrate the reproducibility and biological significance of RB-TnSeq with Escherichia coli, Phaeobacter inhibens, Pseudomonas stutzeri, Shewanella amazonensis, and Shewanella oneidensis. To demonstrate the increased throughput of RB-TnSeq, we performed 387 successful genome-wide mutant fitness assays representing 130 different bacterium-carbon source combinations and identified 5,196 genes with significant phenotypes across the five bacteria. In P. inhibens, we used our mutant fitness data to identify genes important for the utilization of diverse carbon substrates, including a putative D-mannose isomerase that is required for mannitol catabolism. RB-TnSeq will enable the cost-effective functional annotation of diverse bacteria using mutant fitness profiling. A large challenge in microbiology is the functional assessment of the millions of uncharacterized genes identified by genome sequencing. Transposon mutagenesis coupled to next-generation sequencing (TnSeq) is a powerful approach to assign phenotypes and functions to genes
Wetmore, Kelly M.; Price, Morgan N.; Waters, Robert J.; Lamson, Jacob S.; He, Jennifer; Hoover, Cindi A.; Blow, Matthew J.; Bristow, James; Butland, Gareth; Arkin, Adam P.; et al
2015-05-12
Transposon mutagenesis with next-generation sequencing (TnSeq) is a powerful approach to annotate gene function in bacteria, but existing protocols for TnSeq require laborious preparation of every sample before sequencing. Thus, the existing protocols are not amenable to the throughput necessary to identify phenotypes and functions for the majority of genes in diverse bacteria. Here, we present a method, random bar code transposon-site sequencing (RB-TnSeq), which increases the throughput of mutant fitness profiling by incorporating random DNA bar codes into Tn5 and mariner transposons and by using bar code sequencing (BarSeq) to assay mutant fitness. RB-TnSeq can be used with anymore » transposon, and TnSeq is performed once per organism instead of once per sample. Each BarSeq assay requires only a simple PCR, and 48 to 96 samples can be sequenced on one lane of an Illumina HiSeq system. We demonstrate the reproducibility and biological significance of RB-TnSeq with Escherichia coli, Phaeobacter inhibens, Pseudomonas stutzeri, Shewanella amazonensis, and Shewanella oneidensis. To demonstrate the increased throughput of RB-TnSeq, we performed 387 successful genome-wide mutant fitness assays representing 130 different bacterium-carbon source combinations and identified 5,196 genes with significant phenotypes across the five bacteria. In P. inhibens, we used our mutant fitness data to identify genes important for the utilization of diverse carbon substrates, including a putative D-mannose isomerase that is required for mannitol catabolism. RB-TnSeq will enable the cost-effective functional annotation of diverse bacteria using mutant fitness profiling. A large challenge in microbiology is the functional assessment of the millions of uncharacterized genes identified by genome sequencing. Transposon mutagenesis coupled to next-generation sequencing (TnSeq) is a powerful approach to assign phenotypes and functions to genes. However, the current strategies for TnSeq are
Degree distribution of random birth-and-death network with network size decline
NASA Astrophysics Data System (ADS)
Xiao-Jun, Zhang; Hui-Lan, Yang
2016-06-01
In this paper, we provide a general method to obtain the exact solutions of the degree distributions for random birth-and-death network (RBDN) with network size decline. First, by stochastic process rules, the steady state transformation equations and steady state degree distribution equations are given in the case of m ≥ 3 and 0 < p < 1/2, then the average degree of network with n nodes is introduced to calculate the degree distributions. Specifically, taking m = 3 for example, we explain the detailed solving process, in which computer simulation is used to verify our degree distribution solutions. In addition, the tail characteristics of the degree distribution are discussed. Our findings suggest that the degree distributions will exhibit Poisson tail property for the declining RBDN. Project supported by the National Natural Science Foundation of China (Grant No. 61273015) and the Chinese Scholarship Council.
A large scale code resolution service network in the Internet of Things.
Yu, Haining; Zhang, Hongli; Fang, Binxing; Yu, Xiangzhan
2012-01-01
In the Internet of Things a code resolution service provides a discovery mechanism for a requester to obtain the information resources associated with a particular product code immediately. In large scale application scenarios a code resolution service faces some serious issues involving heterogeneity, big data and data ownership. A code resolution service network is required to address these issues. Firstly, a list of requirements for the network architecture and code resolution services is proposed. Secondly, in order to eliminate code resolution conflicts and code resolution overloads, a code structure is presented to create a uniform namespace for code resolution records. Thirdly, we propose a loosely coupled distributed network consisting of heterogeneous, independent; collaborating code resolution services and a SkipNet based code resolution service named SkipNet-OCRS, which not only inherits DHT’s advantages, but also supports administrative control and autonomy. For the external behaviors of SkipNet-OCRS, a novel external behavior mode named QRRA mode is proposed to enhance security and reduce requester complexity. For the internal behaviors of SkipNet-OCRS, an improved query algorithm is proposed to increase query efficiency. It is analyzed that integrating SkipNet-OCRS into our resolution service network can meet our proposed requirements. Finally, simulation experiments verify the excellent performance of SkipNet-OCRS. PMID:23202207
A Large Scale Code Resolution Service Network in the Internet of Things
Yu, Haining; Zhang, Hongli; Fang, Binxing; Yu, Xiangzhan
2012-01-01
In the Internet of Things a code resolution service provides a discovery mechanism for a requester to obtain the information resources associated with a particular product code immediately. In large scale application scenarios a code resolution service faces some serious issues involving heterogeneity, big data and data ownership. A code resolution service network is required to address these issues. Firstly, a list of requirements for the network architecture and code resolution services is proposed. Secondly, in order to eliminate code resolution conflicts and code resolution overloads, a code structure is presented to create a uniform namespace for code resolution records. Thirdly, we propose a loosely coupled distributed network consisting of heterogeneous, independent; collaborating code resolution services and a SkipNet based code resolution service named SkipNet-OCRS, which not only inherits DHT's advantages, but also supports administrative control and autonomy. For the external behaviors of SkipNet-OCRS, a novel external behavior mode named QRRA mode is proposed to enhance security and reduce requester complexity. For the internal behaviors of SkipNet-OCRS, an improved query algorithm is proposed to increase query efficiency. It is analyzed that integrating SkipNet-OCRS into our resolution service network can meet our proposed requirements. Finally, simulation experiments verify the excellent performance of SkipNet-OCRS. PMID:23202207
Complementary feeding: a Global Network cluster randomized controlled trial
2011-01-01
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 provide a strong rationale
Damage Spreading in Spatial and Small-world Random Boolean Networks
Lu, Qiming; Teuscher, Christof
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.
Resonant spatiotemporal learning in large random recurrent networks.
Daucé, Emmanuel; Quoy, Mathias; Doyon, Bernard
2002-09-01
Taking a global analogy with the structure of perceptual biological systems, we present a system composed of two layers of real-valued sigmoidal neurons. The primary layer receives stimulating spatiotemporal signals, and the secondary layer is a fully connected random recurrent network. This secondary layer spontaneously displays complex chaotic dynamics. All connections have a constant time delay. We use for our experiments a Hebbian (covariance) learning rule. This rule slowly modifies the weights under the influence of a periodic stimulus. The effect of learning is twofold: (i) it simplifies the secondary-layer dynamics, which eventually stabilizes to a periodic orbit; and (ii) it connects the secondary layer to the primary layer, and realizes a feedback from the secondary to the primary layer. This feedback signal is added to the incoming signal, and matches it (i.e., the secondary layer performs a one-step prediction of the forthcoming stimulus). After learning, a resonant behavior can be observed: the system resonates with familiar stimuli, which activates a feedback signal. In particular, this resonance allows the recognition and retrieval of partial signals, and dynamic maintenance of the memory of past stimuli. This resonance is highly sensitive to the temporal relationships and to the periodicity of the presented stimuli. When we present stimuli which do not match in time or space, the feedback remains silent. The number of different stimuli for which resonant behavior can be learned is analyzed. As with Hopfield networks, the capacity is proportional to the size of the second, recurrent layer. Moreover, the high capacity displayed allows the implementation of our model on real-time systems interacting with their environment. Such an implementation is reported in the case of a simple behavior-based recognition task on a mobile robot. Finally, we present some functional analogies with biological systems in terms of autonomy and dynamic binding, and present
Regoui, Chaouki; Durand, Guillaume; Belliveau, Luc; Léger, Serge
2013-01-01
This paper presents a novel hybrid DNA encryption (HyDEn) approach that uses randomized assignments of unique error-correcting DNA Hamming code words for single characters in the extended ASCII set. HyDEn relies on custom-built quaternary codes and a private key used in the randomized assignment of code words and the cyclic permutations applied on the encoded message. Along with its ability to detect and correct errors, HyDEn equals or outperforms existing cryptographic methods and represents a promising in silico DNA steganographic approach. PMID:23984392
Tulpan, Dan; Regoui, Chaouki; Durand, Guillaume; Belliveau, Luc; Léger, Serge
2013-01-01
This paper presents a novel hybrid DNA encryption (HyDEn) approach that uses randomized assignments of unique error-correcting DNA Hamming code words for single characters in the extended ASCII set. HyDEn relies on custom-built quaternary codes and a private key used in the randomized assignment of code words and the cyclic permutations applied on the encoded message. Along with its ability to detect and correct errors, HyDEn equals or outperforms existing cryptographic methods and represents a promising in silico DNA steganographic approach. PMID:23984392
Wetmore, Kelly M.; Price, Morgan N.; Waters, Robert J.; Lamson, Jacob S.; He, Jennifer; Hoover, Cindi A.; Blow, Matthew J.; Bristow, James; Butland, Gareth
2015-01-01
ABSTRACT Transposon mutagenesis with next-generation sequencing (TnSeq) is a powerful approach to annotate gene function in bacteria, but existing protocols for TnSeq require laborious preparation of every sample before sequencing. Thus, the existing protocols are not amenable to the throughput necessary to identify phenotypes and functions for the majority of genes in diverse bacteria. Here, we present a method, random bar code transposon-site sequencing (RB-TnSeq), which increases the throughput of mutant fitness profiling by incorporating random DNA bar codes into Tn5 and mariner transposons and by using bar code sequencing (BarSeq) to assay mutant fitness. RB-TnSeq can be used with any transposon, and TnSeq is performed once per organism instead of once per sample. Each BarSeq assay requires only a simple PCR, and 48 to 96 samples can be sequenced on one lane of an Illumina HiSeq system. We demonstrate the reproducibility and biological significance of RB-TnSeq with Escherichia coli, Phaeobacter inhibens, Pseudomonas stutzeri, Shewanella amazonensis, and Shewanella oneidensis. To demonstrate the increased throughput of RB-TnSeq, we performed 387 successful genome-wide mutant fitness assays representing 130 different bacterium-carbon source combinations and identified 5,196 genes with significant phenotypes across the five bacteria. In P. inhibens, we used our mutant fitness data to identify genes important for the utilization of diverse carbon substrates, including a putative d-mannose isomerase that is required for mannitol catabolism. RB-TnSeq will enable the cost-effective functional annotation of diverse bacteria using mutant fitness profiling. PMID:25968644
Achievable Region in Slotted ALOHA Throughput for One-Relay Two-Hop Wireless Network Coding
NASA Astrophysics Data System (ADS)
Umehara, Daisuke; Denno, Satoshi; Morikura, Masahiro; Sugiyama, Takatoshi
This paper presents achievable regions in slotted ALOHA throughput both without and with network coding for one-relay two-hop wireless networks between two end node groups. In this paper, there are no restrictions on the total traffic and the number of end nodes per group. It follows that the relay node will be generally involved with asymmetric bidirectional traffic. This paper derives closed-form expressions of the throughput and packet delay per group both without and with network coding from a theoretical perspective regardless of whether the buffer on the relay node is saturated or not. Furthermore, we show that the maximum throughput per group with network coding can be achieved at the boundary of the relay buffer saturation and unsaturation which is expressed as the solution of a polynomial equation in two group node traffics. As a result, we clarify the enhancement of the achievable region in slotted ALOHA throughput by applying network coding.
Damage spreading in spatial and small-world random Boolean networks
NASA Astrophysics Data System (ADS)
Lu, Qiming; Teuscher, Christof
2014-02-01
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 as 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 nonrandom 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 Hamming distance at very low connectivities (K¯≪1) and that the critical connectivity of stability Ks changes compared to random networks. At higher K¯, this scaling remains unchanged. We also show that the Hamming distance 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 arguments for small-world networks are obtained with respect to the system sizes and strength of spatially local connections. 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.
Instantly decodable network coding for real-time scalable video broadcast over wireless networks
NASA Astrophysics Data System (ADS)
Karim, Mohammad S.; Sadeghi, Parastoo; Sorour, Sameh; Aboutorab, Neda
2016-01-01
In this paper, we study real-time scalable video broadcast over wireless networks using instantly decodable network coding (IDNC). Such real-time scalable videos have hard deadline and impose a decoding order on the video layers. We first derive the upper bound on the probability that the individual completion times of all receivers meet the deadline. Using this probability, we design two prioritized IDNC algorithms, namely the expanding window IDNC (EW-IDNC) algorithm and the non-overlapping window IDNC (NOW-IDNC) algorithm. These algorithms provide a high level of protection to the most important video layer, namely the base layer, before considering additional video layers, namely the enhancement layers, in coding decisions. Moreover, in these algorithms, we select an appropriate packet combination over a given number of video layers so that these video layers are decoded by the maximum number of receivers before the deadline. We formulate this packet selection problem as a two-stage maximal clique selection problem over an IDNC graph. Simulation results over a real scalable video sequence show that our proposed EW-IDNC and NOW-IDNC algorithms improve the received video quality compared to the existing IDNC algorithms.
Channel coding in the space station data system network
NASA Technical Reports Server (NTRS)
Healy, T.
1982-01-01
A detailed discussion of the use of channel coding for error correction, privacy/secrecy, channel separation, and synchronization is presented. Channel coding, in one form or another, is an established and common element in data systems. No analysis and design of a major new system would fail to consider ways in which channel coding could make the system more effective. The presence of channel coding on TDRS, Shuttle, the Advanced Communication Technology Satellite Program system, the JSC-proposed Space Operations Center, and the proposed 30/20 GHz Satellite Communication System strongly support the requirement for the utilization of coding for the communications channel. The designers of the space station data system have to consider the use of channel coding.
Multi-Level Construction of Polar Codes for Half-Duplex Wireless Coded-Cooperative Networks
NASA Astrophysics Data System (ADS)
Ejaz, Saqib; FengFan, Yang; Soliman, Tamer H. M.
2015-11-01
In this paper, Plotkin's construction is employed to buildup longer length polar codes with the help of shorter length polar codes. Firstly, we present the multi-level code construction steps for non-cooperative communication schemes. Secondly, we extend the proposed multi-level polar code construction to coded-cooperative scenarios due to the parallel split in the proposed encoding scheme. Since, relay plays a pivotal role in the overall bit error rate (BER) performance of the coded-cooperative schemes, therefore, an efficient criteria of information bit selection at the relay is also presented. Furthermore, we propose a novel joint successive cancellation decoding scheme, which is employed at the destination and provides significant coding gains. Various numerical simulations show that the proposed polar coded-cooperative scheme (PCCS) scheme not only outperforms non-cooperative polar coded scheme but also the existing cooperative schemes for polar codes under identical conditions over an additive white Gaussian noise (AWGN) and quasi-static Rayleigh fading channels.
Stability and dynamical properties of material flow systems on random networks
NASA Astrophysics Data System (ADS)
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.
Entanglement distribution over quantum code-division multiple-access networks
NASA Astrophysics Data System (ADS)
Zhu, Chang-long; Yang, Nan; Liu, Yu-xi; Nori, Franco; Zhang, Jing
2015-10-01
We present a method for quantum entanglement distribution over a so-called code-division multiple-access network, in which two pairs of users share the same quantum channel to transmit information. The main idea of this method is to use different broadband chaotic phase shifts, generated by electro-optic modulators and chaotic Colpitts circuits, to encode the information-bearing quantum signals coming from different users and then recover the masked quantum signals at the receiver side by imposing opposite chaotic phase shifts. The chaotic phase shifts given to different pairs of users are almost uncorrelated due to the randomness of chaos and thus the quantum signals from different pair of users can be distinguished even when they are sent via the same quantum channel. It is shown that two maximally entangled states can be generated between two pairs of users by our method mediated by bright coherent lights, which can be more easily implemented in experiments compared with single-photon lights. Our method is robust under the channel noises if only the decay rates of the information-bearing fields induced by the channel noises are not quite high. Our study opens up new perspectives for addressing and transmitting quantum information in future quantum networks.
Hybrid scheduling mechanisms for Next-generation Passive Optical Networks based on network coding
NASA Astrophysics Data System (ADS)
Zhao, Jijun; Bai, Wei; Liu, Xin; Feng, Nan; Maier, Martin
2014-10-01
Network coding (NC) integrated into Passive Optical Networks (PONs) is regarded as a promising solution to achieve higher throughput and energy efficiency. To efficiently support multimedia traffic under this new transmission mode, novel NC-based hybrid scheduling mechanisms for Next-generation PONs (NG-PONs) including energy management, time slot management, resource allocation, and Quality-of-Service (QoS) scheduling are proposed in this paper. First, we design an energy-saving scheme that is based on Bidirectional Centric Scheduling (BCS) to reduce the energy consumption of both the Optical Line Terminal (OLT) and Optical Network Units (ONUs). Next, we propose an intra-ONU scheduling and an inter-ONU scheduling scheme, which takes NC into account to support service differentiation and QoS assurance. The presented simulation results show that BCS achieves higher energy efficiency under low traffic loads, clearly outperforming the alternative NC-based Upstream Centric Scheduling (UCS) scheme. Furthermore, BCS is shown to provide better QoS assurance.
Statistical Inference for Valued-Edge Networks: The Generalized Exponential Random Graph Model
Desmarais, Bruce A.; Cranmer, Skyler J.
2012-01-01
Across the sciences, the statistical analysis of networks is central to the production of knowledge on relational phenomena. Because of their ability to model the structural generation of networks based on both endogenous and exogenous factors, exponential random graph models are a ubiquitous means of analysis. However, they are limited by an inability to model networks with valued edges. We address this problem by introducing a class of generalized exponential random graph models capable of modeling networks whose edges have continuous values (bounded or unbounded), thus greatly expanding the scope of networks applied researchers can subject to statistical analysis. PMID:22276151
NASA Astrophysics Data System (ADS)
Cui, Laizhong; Jiang, Yong; Wu, Jianping; Xia, Shutao
Most large-scale Peer-to-Peer (P2P) live streaming systems are constructed as a mesh structure, which can provide robustness in the dynamic P2P environment. The pull scheduling algorithm is widely used in this mesh structure, which degrades the performance of the entire system. Recently, network coding was introduced in mesh P2P streaming systems to improve the performance, which makes the push strategy feasible. One of the most famous scheduling algorithms based on network coding is R2, with a random push strategy. Although R2 has achieved some success, the push scheduling strategy still lacks a theoretical model and optimal solution. In this paper, we propose a novel optimal pull-push scheduling algorithm based on network coding, which consists of two stages: the initial pull stage and the push stage. The main contributions of this paper are: 1) we put forward a theoretical analysis model that considers the scarcity and timeliness of segments; 2) we formulate the push scheduling problem to be a global optimization problem and decompose it into local optimization problems on individual peers; 3) we introduce some rules to transform the local optimization problem into a classical min-cost optimization problem for solving it; 4) We combine the pull strategy with the push strategy and systematically realize our scheduling algorithm. Simulation results demonstrate that decode delay, decode ratio and redundant fraction of the P2P streaming system with our algorithm can be significantly improved, without losing throughput and increasing overhead.
CoCo trial: Color-coded blood pressure Control, a randomized controlled study
Chmiel, Corinne; Senn, Oliver; Rosemann, Thomas; Del Prete, Valerio; Steurer-Stey, Claudia
2014-01-01
Background Inadequate blood pressure (BP) control is a frequent challenge in general practice. The objective of this study was to determine whether a color-coded BP booklet using a traffic light scheme (red, >180 mmHg systolic BP and/or >110 mmHg diastolic BP; yellow, >140–180 mmHg systolic BP or >90–110 mmHg diastolic BP; green, ≤140 mmHg systolic BP and ≤90 mmHg diastolic BP) improves BP control and adherence with home BP measurement. Methods In this two-group, randomized controlled trial, general practitioners recruited adult patients with a BP >140 mmHg systolic and/or >90 mmHg diastolic. Patients in the control group received a standard BP booklet and the intervention group used a color-coded booklet for daily home BP measurement. The main outcomes were changes in BP, BP control (treatment goal <140/90 mmHg), and adherence with home BP measurement after 6 months. Results One hundred and twenty-one of 137 included patients qualified for analysis. After 6 months, a significant decrease in systolic and diastolic BP was achieved in both groups, with no significant difference between the groups (16.1/7.9 mmHg in the intervention group versus 13.1/8.6 mmHg in the control group, P=0.3/0.7). BP control (treatment target <140/90 mmHg) was achieved significantly more often in the intervention group (43% versus 25%; P=0.037; number needed to treat of 5). Adherence with home BP measurement overall was high, with a trend in favor of the intervention group (98.6% versus 96.2%; P=0.1) Conclusion Color-coded BP self-monitoring significantly improved BP control (number needed to treat of 5, meaning that every fifth patient utilizing color-coded self-monitoring achieved better BP control after 6 months), but no significant between-group difference was observed in BP change. A markedly higher percentage of patients achieved BP values in the normal range. This simple, inexpensive approach of color-coded BP self-monitoring is user-friendly and applicable in primary care
NASA Astrophysics Data System (ADS)
Han, Yamei; Liang, Siyuan; Wang, Liqian; Chen, Xue
2010-12-01
Optical receiver sensitivity for electronic code division multiple access over a passive optical network (ECDMA-PON) is analyzed theoretically. Compared with TDM system, ECDMA-PON offers better receiver sensitivity due to coding gain. Fundamental simulation results are provided to show its validity.
Code Talk: Student Discourse and Participation with Networked Handhelds
ERIC Educational Resources Information Center
White, Tobin
2006-01-01
This study explores the potential of networked handheld computers to support collaborative problem solving in small groups. Drawing on data from a middle school mathematics classroom equipped with a wireless handheld network, I argue that the sharing of mathematical objects through interactive devices broadens the "bandwidth" of classroom…
Predicting the Lifetime of Dynamic Networks Experiencing Persistent Random Attacks
Podobnik, Boris; Lipic, Tomislav; Horvatic, Davor; Majdandzic, Antonio; Bishop, Steven R.; Eugene Stanley, H.
2015-01-01
Estimating the critical points at which complex systems abruptly flip from one state to another is one of the remaining challenges in network science. Due to lack of knowledge about the underlying stochastic processes controlling critical transitions, it is widely considered difficult to determine the location of critical points for real-world networks, and it is even more difficult to predict the time at which these potentially catastrophic failures occur. We analyse a class of decaying dynamic networks experiencing persistent failures in which the magnitude of the overall failure is quantified by the probability that a potentially permanent internal failure will occur. When the fraction of active neighbours is reduced to a critical threshold, cascading failures can trigger a total network failure. For this class of network we find that the time to network failure, which is equivalent to network lifetime, is inversely dependent upon the magnitude of the failure and logarithmically dependent on the threshold. We analyse how permanent failures affect network robustness using network lifetime as a measure. These findings provide new methodological insight into system dynamics and, in particular, of the dynamic processes of networks. We illustrate the network model by selected examples from biology, and social science. PMID:26387609
Predicting the Lifetime of Dynamic Networks Experiencing Persistent Random Attacks
NASA Astrophysics Data System (ADS)
Podobnik, Boris; Lipic, Tomislav; Horvatic, Davor; Majdandzic, Antonio; Bishop, Steven R.; Eugene Stanley, H.
2015-09-01
Estimating the critical points at which complex systems abruptly flip from one state to another is one of the remaining challenges in network science. Due to lack of knowledge about the underlying stochastic processes controlling critical transitions, it is widely considered difficult to determine the location of critical points for real-world networks, and it is even more difficult to predict the time at which these potentially catastrophic failures occur. We analyse a class of decaying dynamic networks experiencing persistent failures in which the magnitude of the overall failure is quantified by the probability that a potentially permanent internal failure will occur. When the fraction of active neighbours is reduced to a critical threshold, cascading failures can trigger a total network failure. For this class of network we find that the time to network failure, which is equivalent to network lifetime, is inversely dependent upon the magnitude of the failure and logarithmically dependent on the threshold. We analyse how permanent failures affect network robustness using network lifetime as a measure. These findings provide new methodological insight into system dynamics and, in particular, of the dynamic processes of networks. We illustrate the network model by selected examples from biology, and social science.
Scalable image coding for interactive image communication over networks
NASA Astrophysics Data System (ADS)
Yoon, Sung H.; Lee, Ji H.; Alexander, Winser E.
2000-12-01
This paper presents a new, scalable coding technique that can be used in interactive image/video communications over the Internet. The proposed technique generates a fully embedded bit stream that provides scalability with high quality for the whole image and it can be used to implement region based coding as well. The embedded bit stream is comprised of a basic layer and many enhancement layers. The enhancement layers add refinement to the quality of the image that has been reconstructed using the basic layer. The proposed coding technique uses multiple quantizers with thresholds (QT) for layering and it creates a bit plane for each layer. The bit plane is then partitioned into sets of small areas to be coded independently. Run length and entropy coding are applied to each of the sets to provide scalability for the entire image resulting in high picture quality in the user-specific area of interest (ROI). We tested this technique by applying it to various test images and the results consistently show high level of performance.
Stiffness threshold of randomly distributed carbon nanotube networks
NASA Astrophysics Data System (ADS)
Chen, Yuli; Pan, Fei; Guo, Zaoyang; Liu, Bin; Zhang, Jianyu
2015-11-01
For carbon nanotube (CNT) networks, with increasing network density, there may be sudden changes in the properties, such as the sudden change in electrical conductivity at the electrical percolation threshold. In this paper, the change in stiffness of the CNT networks is studied and especially the existence of stiffness threshold is revealed. Two critical network densities are found to divide the stiffness behavior into three stages: zero stiffness, bending dominated and stretching dominated stages. The first critical network density is a criterion to judge whether or not the network is capable of carrying load, defined as the stiffness threshold. The second critical network density is a criterion to measure whether or not most of the CNTs in network are utilized effectively to carry load, defined as bending-stretching transitional threshold. Based on the geometric probability analysis, a theoretical methodology is set up to predict the two thresholds and explain their underlying mechanisms. The stiffness threshold is revealed to be determined by the statical determinacy of CNTs in the network, and can be estimated quantitatively by the stabilization fraction of network, a newly proposed parameter in this paper. The other threshold, bending-stretching transitional threshold, which signs the conversion of dominant deformation mode, is verified to be well evaluated by the proposed defect fraction of network. According to the theoretical analysis as well as the numerical simulation, the average intersection number on each CNT is revealed as the only dominant factor for the electrical percolation and the stiffness thresholds, it is approximately 3.7 for electrical percolation threshold, and 5.2 for the stiffness threshold of 2D networks. For 3D networks, they are 1.4 and 4.4. And it also affects the bending-stretching transitional threshold, together with the CNT aspect ratio. The average intersection number divided by the fourth root of CNT aspect ratio is found to be
Cooperative MIMO Communication at Wireless Sensor Network: An Error Correcting Code Approach
Islam, Mohammad Rakibul; Han, Young Shin
2011-01-01
Cooperative communication in wireless sensor network (WSN) explores the energy efficient wireless communication schemes between multiple sensors and data gathering node (DGN) by exploiting multiple input multiple output (MIMO) and multiple input single output (MISO) configurations. In this paper, an energy efficient cooperative MIMO (C-MIMO) technique is proposed where low density parity check (LDPC) code is used as an error correcting code. The rate of LDPC code is varied by varying the length of message and parity bits. Simulation results show that the cooperative communication scheme outperforms SISO scheme in the presence of LDPC code. LDPC codes with different code rates are compared using bit error rate (BER) analysis. BER is also analyzed under different Nakagami fading scenario. Energy efficiencies are compared for different targeted probability of bit error pb. It is observed that C-MIMO performs more efficiently when the targeted pb is smaller. Also the lower encoding rate for LDPC code offers better error characteristics. PMID:22163732
Reaction-Diffusion Processes on Random and Scale-Free Networks
NASA Astrophysics Data System (ADS)
Banerjee, Subhasis; Mallick, Shrestha Basu; Bose, Indrani
We study the discrete Gierer-Meinhardt model of reaction-diffusion on three different types of networks: regular, random and scale-free. The model dynamics lead to the formation of stationary Turing patterns in the steady state in certain parameter regions. Some general features of the patterns are studied through numerical simulation. The results for the random and scale-free networks show a marked difference from those in the case of the regular network. The difference may be ascribed to the small world character of the first two types of networks.
Enhancing network robustness against targeted and random attacks using a memetic algorithm
NASA Astrophysics Data System (ADS)
Tang, Xianglong; Liu, Jing; Zhou, Mingxing
2015-08-01
In the past decades, there has been much interest in the elasticity of infrastructures to targeted and random attacks. In the recent work by Schneider C. M. et al., Proc. Natl. Acad. Sci. U.S.A., 108 (2011) 3838, the authors proposed an effective measure (namely R, here we label it as R t to represent the measure for targeted attacks) to evaluate network robustness against targeted node attacks. Using a greedy algorithm, they found that the optimal structure is an onion-like one. However, real systems are often under threats of both targeted attacks and random failures. So, enhancing networks robustness against both targeted and random attacks is of great importance. In this paper, we first design a random-robustness index (Rr) . We find that the onion-like networks destroyed the original strong ability of BA networks in resisting random attacks. Moreover, the structure of an R r -optimized network is found to be different from that of an onion-like network. To design robust scale-free networks (RSF) which are resistant to both targeted and random attacks (TRA) without changing the degree distribution, a memetic algorithm (MA) is proposed, labeled as \\textit{MA-RSF}\\textit{TRA} . In the experiments, both synthetic scale-free networks and real-world networks are used to validate the performance of \\textit{MA-RSF}\\textit{TRA} . The results show that \\textit{MA-RSF} \\textit{TRA} has a great ability in searching for the most robust network structure that is resistant to both targeted and random attacks.
Ganmor, Elad; Segev, Ronen; Schneidman, Elad
2011-01-01
Information is carried in the brain by the joint activity patterns of large groups of neurons. Understanding the structure and function of population neural codes is challenging because of the exponential number of possible activity patterns and dependencies among neurons. We report here that for groups of ~100 retinal neurons responding to natural stimuli, pairwise-based models, which were highly accurate for small networks, are no longer sufficient. We show that because of the sparse nature of the neural code, the higher-order interactions can be easily learned using a novel model and that a very sparse low-order interaction network underlies the code of large populations of neurons. Additionally, we show that the interaction network is organized in a hierarchical and modular manner, which hints at scalability. Our results suggest that learnability may be a key feature of the neural code. PMID:21602497
NASA Astrophysics Data System (ADS)
Yen, Chih-Ta; Huang, Jen-Fa; Chang, Yao-Tang; Chen, Bo-Hau
2010-12-01
We present an experiment demonstrating the spectral-polarization coding optical code-division multiple-access system introduced with a nonideal state of polarization (SOP) matching conditions. In the proposed system, the encoding and double balanced-detection processes are implemented using a polarization-diversity scheme. Because of the quasiorthogonality of Hadamard codes combining with array waveguide grating routers and a polarization beam splitter, the proposed codec pair can encode-decode multiple code words of Hadamard code while retaining the ability for multiple-access interference cancellation. The experimental results demonstrate that when the system is maintained with an orthogonal SOP for each user, an effective reduction in the phase-induced intensity noise is obtained. The analytical SNR values are found to overstate the experimental results by around 2 dB when the received effective power is large. This is mainly limited by insertion losses of components and a nonflattened optical light source. Furthermore, the matching conditions can be improved by decreasing nonideal influences.
Financial Time Series Prediction Using Elman Recurrent Random Neural Networks
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
Financial Time Series Prediction Using Elman Recurrent Random Neural Networks.
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
NASA Astrophysics Data System (ADS)
Kondo, Yoshihisa; Yomo, Hiroyuki; Yamaguchi, Shinji; Davis, Peter; Miura, Ryu; Obana, Sadao; Sampei, Seiichi
This paper proposes multipoint-to-multipoint (MPtoMP) real-time broadcast transmission using network coding for ad-hoc networks like video game networks. We aim to achieve highly reliable MPtoMP broadcasting using IEEE 802.11 media access control (MAC) that does not include a retransmission mechanism. When each node detects packets from the other nodes in a sequence, the correctly detected packets are network-encoded, and the encoded packet is broadcasted in the next sequence as a piggy-back for its native packet. To prevent increase of overhead in each packet due to piggy-back packet transmission, network coding vector for each node is exchanged between all nodes in the negotiation phase. Each user keeps using the same coding vector generated in the negotiation phase, and only coding information that represents which user signal is included in the network coding process is transmitted along with the piggy-back packet. Our simulation results show that the proposed method can provide higher reliability than other schemes using multi point relay (MPR) or redundant transmissions such as forward error correction (FEC). We also implement the proposed method in a wireless testbed, and show that the proposed method achieves high reliability in a real-world environment with a practical degree of complexity when installed on current wireless devices.
All-optical code routing in interconnected optical CDMA and WDM ring networks.
Deng, Yanhua; Fok, Mable P; Prucnal, Paul R; Wang, Ting
2010-11-01
We propose an all-optical hybrid network composed of optical code division multiple access (CDMA) rings interconnecting through a reconfigurable wavelength division multiplexing (WDM) metro area ring. This network retains the advantages of both the optical CDMA and WDM techniques, including asynchronous access and differentiated quality of service, while removing the hard limit on the number of subscribers and increasing network flexibility. The all-optical network is enabled by using nonlinear optical loop mirrors in an add/drop router (ADR) that performs code conversion, dropping, and switching asynchronously. We experimentally demonstrate the functionalities of the ADR in the proposed scheme asynchronously and obtain error-free performance. The bit-error rate measurements show acceptable power penalties for different code routes. PMID:21042372
Packet error probabilities in direct sequence spread spectrum packet radio networks with BCH codes
NASA Astrophysics Data System (ADS)
Georgiopoulos, Michael
The author computes an upper bound on the packet error probability induced in direct-sequence spread-spectrum networks, when BCH codes are used for the encoding of the packets. The bound, which is introduced here, is valid independently of whether signals arrive with equal or unequal powers at the receiver site. Furthermore, it has a simple form and is easy to compute. In addition, it is valid for other classes of forward error correction codes (e.g., convolutional codes). However, numerical results are presented for BCH codes only.
Parameters affecting the resilience of scale-free networks to random failures.
Link, Hamilton E.; LaViolette, Randall A.; Lane, Terran; Saia, Jared
2005-09-01
It is commonly believed that scale-free networks are robust to massive numbers of random node deletions. For example, Cohen et al. in (1) study scale-free networks including some which approximate the measured degree distribution of the Internet. Their results suggest that if each node in this network failed independently with probability 0.99, most of the remaining nodes would still be connected in a giant component. In this paper, we show that a large and important subclass of scale-free networks are not robust to massive numbers of random node deletions. In particular, we study scale-free networks which have minimum node degree of 1 and a power-law degree distribution beginning with nodes of degree 1 (power-law networks). We show that, in a power-law network approximating the Internet's reported distribution, when the probability of deletion of each node is 0.5 only about 25% of the surviving nodes in the network remain connected in a giant component, and the giant component does not persist beyond a critical failure rate of 0.9. The new result is partially due to improved analytical accommodation of the large number of degree-0 nodes that result after node deletions. Our results apply to power-law networks with a wide range of power-law exponents, including Internet-like networks. We give both analytical and empirical evidence that such networks are not generally robust to massive random node deletions.
A neutron spectrum unfolding computer code based on artificial neural networks
NASA Astrophysics Data System (ADS)
Ortiz-Rodríguez, J. M.; Reyes Alfaro, A.; Reyes Haro, A.; Cervantes Viramontes, J. M.; Vega-Carrillo, H. R.
2014-02-01
The Bonner Spheres Spectrometer consists of a thermal neutron sensor placed at the center of a number of moderating polyethylene spheres of different diameters. From the measured readings, information can be derived about the spectrum of the neutron field where measurements were made. Disadvantages of the Bonner system are the weight associated with each sphere and the need to sequentially irradiate the spheres, requiring long exposure periods. Provided a well-established response matrix and adequate irradiation conditions, the most delicate part of neutron spectrometry, is the unfolding process. The derivation of the spectral information is not simple because the unknown is not given directly as a result of the measurements. The drawbacks associated with traditional unfolding procedures have motivated the need of complementary approaches. Novel methods based on Artificial Intelligence, mainly Artificial Neural Networks, have been widely investigated. In this work, a neutron spectrum unfolding code based on neural nets technology is presented. This code is called Neutron Spectrometry and Dosimetry with Artificial Neural networks unfolding code that was designed in a graphical interface. The core of the code is an embedded neural network architecture previously optimized using the robust design of artificial neural networks methodology. The main features of the code are: easy to use, friendly and intuitive to the user. This code was designed for a Bonner Sphere System based on a 6LiI(Eu) neutron detector and a response matrix expressed in 60 energy bins taken from an International Atomic Energy Agency compilation. The main feature of the code is that as entrance data, for unfolding the neutron spectrum, only seven rate counts measured with seven Bonner spheres are required; simultaneously the code calculates 15 dosimetric quantities as well as the total flux for radiation protection purposes. This code generates a full report with all information of the unfolding in
Wu, Zhilu; Jiang, Lihui; Ren, Guanghui; Zhao, Nan; Zhao, Yaqin
2015-01-01
Interference alignment (IA) has been put forward as a promising technique which can mitigate interference and effectively increase the throughput of wireless sensor networks (WSNs). However, the number of users is strictly restricted by the IA feasibility condition, and the interference leakage will become so strong that the quality of service will degrade significantly when there are more users than that IA can support. In this paper, a novel joint spatial-code clustered (JSCC)-IA scheme is proposed to solve this problem. In the proposed scheme, the users are clustered into several groups so that feasible IA can be achieved within each group. In addition, each group is assigned a pseudo noise (PN) code in order to suppress the inter-group interference via the code dimension. The analytical bit error rate (BER) expressions of the proposed JSCC-IA scheme are formulated for the systems with identical and different propagation delays, respectively. To further improve the performance of the JSCC-IA scheme in asymmetric networks, a random grouping selection (RGS) algorithm is developed to search for better grouping combinations. Numerical results demonstrate that the proposed JSCC-IA scheme is capable of accommodating many more users to communicate simultaneously in the same frequency band with better performance. PMID:25602270
ERIC Educational Resources Information Center
Brandon, Paul R.; Harrison, George M.; Lawton, Brian E.
2013-01-01
When evaluators plan site-randomized experiments, they must conduct the appropriate statistical power analyses. These analyses are most likely to be valid when they are based on data from the jurisdictions in which the studies are to be conducted. In this method note, we provide software code, in the form of a SAS macro, for producing statistical…
On the Energy Efficiency of LT Codes in Proactive Wireless Sensor Networks
NASA Astrophysics Data System (ADS)
Abouei, Jamshid; Brown, J. David; Plataniotis, Konstantinos N.; Pasupathy, Subbarayan
2011-03-01
This paper presents an in-depth analysis on the energy efficiency of Luby Transform (LT) codes with Frequency Shift Keying (FSK) modulation in a Wireless Sensor Network (WSN) over Rayleigh fading channels with pathloss. We describe a proactive system model according to a flexible duty-cycling mechanism utilized in practical sensor apparatus. The present analysis is based on realistic parameters including the effect of channel bandwidth used in the IEEE 802.15.4 standard, active mode duration and computation energy. A comprehensive analysis, supported by some simulation studies on the probability mass function of the LT code rate and coding gain, shows that among uncoded FSK and various classical channel coding schemes, the optimized LT coded FSK is the most energy-efficient scheme for distance d greater than the pre-determined threshold level d_T , where the optimization is performed over coding and modulation parameters. In addition, although the optimized uncoded FSK outperforms coded schemes for d < d_T , the energy gap between LT coded and uncoded FSK is negligible for d < d_T compared to the other coded schemes. These results come from the flexibility of the LT code to adjust its rate to suit instantaneous channel conditions, and suggest that LT codes are beneficial in practical low-power WSNs with dynamic position sensor nodes.
When Are Popescu-Rohrlich Boxes and Random Access Codes Equivalent?
NASA Astrophysics Data System (ADS)
Grudka, Andrzej; Horodecki, Karol; Horodecki, Michał; Kłobus, Waldemar; Pawłowski, Marcin
2014-09-01
We study a problem of interconvertibility of two supraquantum resources: one is the so-called Popescu-Rohrlich (PR) box, which violates Clauser-Horne-Shimony-Holt inequality up to the maximal algebraic bound, and the second is the so-called random access code (RAC). The latter is a functionality that enables Bob (receiver) to choose one of two bits of Alice. It is known that a PR box supplemented with one bit of communication can be used to simulate a RAC. We ask the converse question: to what extent can a RAC can simulate a PR box? To this end, we introduce a "racbox": a box such that when it is supplemented with one bit of communication it offers a RAC. As said, a PR box can simulate a racbox. The question we raise is whether any racbox can simulate a PR box. We show that a nonsignaling racbox, indeed, can simulate a PR box; hence, these two resources are equivalent. We also provide an example of a signaling racbox that cannot simulate a PR box. We give a resource inequality between racboxes and PR boxes and show that it is saturated.
When are Popescu-Rohrlich boxes and random access codes equivalent?
Grudka, Andrzej; Horodecki, Karol; Horodecki, Michał; Kłobus, Waldemar; Pawłowski, Marcin
2014-09-01
We study a problem of interconvertibility of two supraquantum resources: one is the so-called Popescu-Rohrlich (PR) box, which violates Clauser-Horne-Shimony-Holt inequality up to the maximal algebraic bound, and the second is the so-called random access code (RAC). The latter is a functionality that enables Bob (receiver) to choose one of two bits of Alice. It is known that a PR box supplemented with one bit of communication can be used to simulate a RAC. We ask the converse question: to what extent can a RAC can simulate a PR box? To this end, we introduce a "racbox": a box such that when it is supplemented with one bit of communication it offers a RAC. As said, a PR box can simulate a racbox. The question we raise is whether any racbox can simulate a PR box. We show that a nonsignaling racbox, indeed, can simulate a PR box; hence, these two resources are equivalent. We also provide an example of a signaling racbox that cannot simulate a PR box. We give a resource inequality between racboxes and PR boxes and show that it is saturated. PMID:25238338
Biometrics based key management of double random phase encoding scheme using error control codes
NASA Astrophysics Data System (ADS)
Saini, Nirmala; Sinha, Aloka
2013-08-01
In this paper, an optical security system has been proposed in which key of the double random phase encoding technique is linked to the biometrics of the user to make it user specific. The error in recognition due to the biometric variation is corrected by encoding the key using the BCH code. A user specific shuffling key is used to increase the separation between genuine and impostor Hamming distance distribution. This shuffling key is then further secured using the RSA public key encryption to enhance the security of the system. XOR operation is performed between the encoded key and the feature vector obtained from the biometrics. The RSA encoded shuffling key and the data obtained from the XOR operation are stored into a token. The main advantage of the present technique is that the key retrieval is possible only in the simultaneous presence of the token and the biometrics of the user which not only authenticates the presence of the original input but also secures the key of the system. Computational experiments showed the effectiveness of the proposed technique for key retrieval in the decryption process by using the live biometrics of the user.
Neural Network Approach to Locating Cryptography in Object Code
Jason L. Wright; Milos Manic
2009-09-01
Finding and identifying cryptography is a growing concern in the malware analysis community. In this paper, artificial neural networks are used to classify functional blocks from a disassembled program as being either cryptography related or not. The resulting system, referred to as NNLC (Neural Net for Locating Cryptography) is presented and results of applying this system to various libraries are described.
NASA Technical Reports Server (NTRS)
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.
Application of Poisson random effect models for highway network screening.
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. PMID:24269863
Random walks on non-homogenous weighted Koch networks
NASA Astrophysics Data System (ADS)
Dai, Meifeng; Li, Xingyi; Xi, Lifeng
2013-09-01
In this paper, we introduce new models of non-homogenous weighted Koch networks on real traffic systems depending on the three scaling factors r1,r2,r3∈(0,1). Inspired by the definition of the average weighted shortest path (AWSP), we define the average weighted receiving time (AWRT). Assuming that the walker, at each step, starting from its current node, moves uniformly to any of its neighbors, we show that in large network, the AWRT grows as power-law function of the network order with the exponent, represented by θ(r1,r2,r3)=log4(1+r1+r2+r3). Moreover, the AWSP, in the infinite network order limit, only depends on the sum of scaling factors r1,r2,r3.
Dombrowski, Kirk; Khan, Bilal; McLean, Katherine; Curtis, Ric; Wendel, Travis; Misshula, Evan; Friedman, Samuel
2013-12-01
Patterns of risk in injecting drug user (IDU) networks have been a key focus of network approaches to HIV transmission histories. New network modeling techniques allow for a reexamination of these patterns with greater statistical accuracy and the comparative weighting of model elements. This paper describes the results of a reexamination of network data from the SFHR and P90 data sets using Exponential Random Graph Modeling. The results show that "transitive closure" is an important feature of IDU network topologies, and provides relative importance measures for race/ethnicity, age, gender, and number of risk partners in predicting risk relationships. PMID:23819740
Physical-Layer Network Coding for VPN in TDM-PON
NASA Astrophysics Data System (ADS)
Wang, Qike; Tse, Kam-Hon; Chen, Lian-Kuan; Liew, Soung-Chang
2012-12-01
We experimentally demonstrate a novel optical physical-layer network coding (PNC) scheme over time-division multiplexing (TDM) passive optical network (PON). Full-duplex error-free communications between optical network units (ONUs) at 2.5 Gb/s are shown for all-optical virtual private network (VPN) applications. Compared to the conventional half-duplex communications set-up, our scheme can increase the capacity by 100% with power penalty smaller than 3 dB. Synchronization of two ONUs is not required for the proposed VPN scheme
OFDMA-based network-coded cooperation: design and implementation using software-defined radio nodes
NASA Astrophysics Data System (ADS)
Gökceli, Selahattin; Alakoca, Hakan; Başaran, Semiha Tedik; Kurt, Güneş Karabulut
2016-01-01
Benefits of network coding towards enhancing communication quality, both in terms of robustness or data transmission rates, make it a significant candidate as a future networking technology. Conventionally, network coding is mostly used in wired infrastructures, where transmission errors between nodes are negligible. Capturing the provided benefits of network coding via straightforward extension from wired networks to wireless networks is not trivial. In addition to the challenges introduced through the wireless channel impairments, we can also capture the spatial diversity gain provided by the broadcast nature of the wireless channels. In this work, we design and implement a network-coded cooperation (NCC) system that operates in real time through the use of software-defined radio (SDR) nodes for the first time in the literature. We specifically target wireless networks. Our system is based on orthogonal frequency division multiple access (OFDMA) that provides a practical means to enable high transmission rates through the use of narrowband subcarriers. The developed testbed is composed of three source nodes, a relay node and two destination nodes. The transmission of the proposed NCC-OFDMA system is completed in two phases; the broadcast and the relaying phases. Multiplexing of source nodes' signals is achieved through OFDMA technique. In the broadcast phase, an OFDMA signal is transmitted to relay and destination nodes. In the relaying phase, the relay node first detects the OFDMA signal, generates network-coded symbols, and then transmits these symbols to destination nodes. At the end of these two phases, the destination nodes determine the source nodes' signals by using network decoders. The destination nodes make use of both the uncoded and network-coded symbols, which are received in broadcast and relaying phases, respectively. Destination nodes then perform network decoding. Through real-time bit error rate and error vector magnitude measurements, we show
Intensity coding in two-dimensional excitable neural networks
NASA Astrophysics Data System (ADS)
Copelli, Mauro; Kinouchi, Osame
2005-04-01
In the light of recent experimental findings that gap junctions are essential for low level intensity detection in the sensory periphery, the Greenberg-Hastings cellular automaton is employed to model the response of a two-dimensional sensory network to external stimuli. We show that excitable elements (sensory neurons) that have a small dynamical range are shown to give rise to a collective large dynamical range. Therefore the network transfer (gain) function (which is Hill or Stevens law-like) is an emergent property generated from a pool of small dynamical range cells, providing a basis for a “neural psychophysics”. The growth of the dynamical range with the system size is approximately logarithmic, suggesting a functional role for electrical coupling. For a fixed number of neurons, the dynamical range displays a maximum as a function of the refractory period, which suggests experimental tests for the model. A biological application to ephaptic interactions in olfactory nerve fascicles is proposed.
Code Combining Based Cooperative LEACH Protocol for Wireless Sensor Networks
NASA Astrophysics Data System (ADS)
Asaduzzaman; Kong, Hyung-Yun
This letter proposes a simple modification of LEACH protocol to exploit its multi-hop scenario for user cooperation. Instead of a single cluster-head we propose M cluster-heads in each cluster to obtain the diversity of order M. All cluster-heads gather data from all sensor nodes within the cluster using the same technique as LEACH. Cluster-heads transmit gathered data cooperatively towards the destination or higher order cluster-head. We propose a code combining based cooperative protocol. We also develop the upper bounds on frame error rate (FER) for our proposal. Simulation and analysis show that our proposal can significantly prolong the system lifetime.
NASA Astrophysics Data System (ADS)
Liu, Ming; You, Jia
2012-10-01
This article addresses the study of observer-based controller design for network-based control systems in the presence of output quantisation and random communication delay simultaneously. In the communication channel, the output measurement are quantised before transmission, and two kinds of network-induced delays are taken into account simultaneously: (i) random delay from sensor to controller and (ii) random delay from controller to actuator. These two types of random delays are modelled as two independent Bernoulli distributed white sequences. The observer-based controller is synthesised to stabilise the networked closed-loop system in the sense of stochastic stability. Sufficient conditions for the existence of the controller are provided by stochastic Lyapunov method. An illustrative numerical example is employed to demonstrate the applicability and flexibility of the proposed design strategy.
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-01-01
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. PMID:26150519
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. PMID:26150519
Phenotype accessibility and noise in random threshold gene regulatory networks.
Pinho, Ricardo; Garcia, Victor; Feldman, Marcus W
2014-01-01
Evolution requires phenotypic variation in a population of organisms for selection to function. Gene regulatory processes involved in organismal development affect the phenotypic diversity of organisms. Since only a fraction of all possible phenotypes are predicted to be accessed by the end of development, organisms may evolve strategies to use environmental cues and noise-like fluctuations to produce additional phenotypic diversity, and hence to enhance the speed of adaptation. We used a generic model of organismal development --gene regulatory networks-- to investigate how different levels of noise on gene expression states (i.e. phenotypes) may affect access to new, unique phenotypes, thereby affecting phenotypic diversity. We studied additional strategies that organisms might adopt to attain larger phenotypic diversity: either by augmenting their genome or the number of gene expression states. This was done for different types of gene regulatory networks that allow for distinct levels of regulatory influence on gene expression or are more likely to give rise to stable phenotypes. We found that if gene expression is binary, increasing noise levels generally decreases phenotype accessibility for all network types studied. If more gene expression states are considered, noise can moderately enhance the speed of discovery if three or four gene expression states are allowed, and if there are enough distinct regulatory networks in the population. These results were independent of the network types analyzed, and were robust to different implementations of noise. Hence, for noise to increase the number of accessible phenotypes in gene regulatory networks, very specific conditions need to be satisfied. If the number of distinct regulatory networks involved in organismal development is large enough, and the acquisition of more genes or fine tuning of their expression states proves costly to the organism, noise can be useful in allowing access to more unique phenotypes
Phenotype Accessibility and Noise in Random Threshold Gene Regulatory Networks
Feldman, Marcus W.
2015-01-01
Evolution requires phenotypic variation in a population of organisms for selection to function. Gene regulatory processes involved in organismal development affect the phenotypic diversity of organisms. Since only a fraction of all possible phenotypes are predicted to be accessed by the end of development, organisms may evolve strategies to use environmental cues and noise-like fluctuations to produce additional phenotypic diversity, and hence to enhance the speed of adaptation. We used a generic model of organismal development --gene regulatory networks-- to investigate how different levels of noise on gene expression states (i.e. phenotypes) may affect access to new, unique phenotypes, thereby affecting phenotypic diversity. We studied additional strategies that organisms might adopt to attain larger phenotypic diversity: either by augmenting their genome or the number of gene expression states. This was done for different types of gene regulatory networks that allow for distinct levels of regulatory influence on gene expression or are more likely to give rise to stable phenotypes. We found that if gene expression is binary, increasing noise levels generally decreases phenotype accessibility for all network types studied. If more gene expression states are considered, noise can moderately enhance the speed of discovery if three or four gene expression states are allowed, and if there are enough distinct regulatory networks in the population. These results were independent of the network types analyzed, and were robust to different implementations of noise. Hence, for noise to increase the number of accessible phenotypes in gene regulatory networks, very specific conditions need to be satisfied. If the number of distinct regulatory networks involved in organismal development is large enough, and the acquisition of more genes or fine tuning of their expression states proves costly to the organism, noise can be useful in allowing access to more unique phenotypes
Information transmission using UEP turbo codes in wireless sensor networks
NASA Astrophysics Data System (ADS)
Zhou, Zude; Xu, Chao
2005-11-01
Wireless sensing is prevalent quickly in these years, and it has many advantages, such as fewer catastrophic failures, conservation of natural resources, improved emergency response, etc. Wireless sensors can be deployed in extremely hostile environment. Since the wireless sensors are energy constrained, many researches have been in progress to solve these problems. In this paper, we proposed a joint source-channel coding scheme to solve energy efficiency of wireless sensors. Firstly, we decomposition information in wavelet domain, then compress it by using multi-scale embedded zerotree wavelet algorithm, and generate a bit stream that can be decompressed in a scalable bit rate. Then, we transmit the bit stream after encoding them with unequal error protection turbo codes to achieve error robust transmission. We transmit multiple bit streams according to some energy strategy, and redundancies to base stations are reduced by only transmitting coarse scale information. Due to the scalability of multi-scale EZW, we can adopt diversified bit rate strategy to save energy of battery powered sensors.
k -core percolation on complex networks: Comparing random, localized, and targeted attacks
NASA Astrophysics Data System (ADS)
Yuan, Xin; Dai, Yang; Stanley, H. Eugene; Havlin, Shlomo
2016-06-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ős-Ré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.
Evolution of vocabulary on scale-free and random networks
NASA Astrophysics Data System (ADS)
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.
Vulnerability of networks: Fractional percolation on random graphs
NASA Astrophysics Data System (ADS)
Shang, Yilun
2014-01-01
We present a theoretical framework for understanding nonbinary, nonindependent percolation on networks with general degree distributions. The model incorporates a partially functional (PF) state of nodes so that both intensity and extensity of error are characterized. Two connected nodes in a PF state cannot sustain the load and therefore break their link. We give exact solutions for the percolation threshold, the fraction of giant cluster, and the mean size of small clusters. The robustness-fragility transition point for scale-free networks with a degree distribution pk∝k-α is identified to be α =3. The analysis reveals that scale-free networks are vulnerable to targeted attack at hubs: a more complete picture of their Achilles' heel turns out to be not only the hubs themselves but also the edges linking them together.
Energy-efficient population coding constrains network size of a neuronal array system
NASA Astrophysics Data System (ADS)
Yu, Lianchun; Zhang, Chi; Liu, Liwei; Yu, Yuguo
2016-01-01
We consider the open issue of how the energy efficiency of the neural information transmission process, in a general neuronal array, constrains the network size, and how well this network size ensures the reliable transmission of neural information in a noisy environment. By direct mathematical analysis, we have obtained general solutions proving that there exists an optimal number of neurons in the network, where the average coding energy cost (defined as energy consumption divided by mutual information) per neuron passes through a global minimum for both subthreshold and superthreshold signals. With increases in background noise intensity, the optimal neuronal number decreases for subthreshold signals and increases for suprathreshold signals. The existence of an optimal number of neurons in an array network reveals a general rule for population coding that states that the neuronal number should be large enough to ensure reliable information transmission that is robust to the noisy environment but small enough to minimize energy cost.
Energy-efficient population coding constrains network size of a neuronal array system.
Yu, Lianchun; Zhang, Chi; Liu, Liwei; Yu, Yuguo
2016-01-01
We consider the open issue of how the energy efficiency of the neural information transmission process, in a general neuronal array, constrains the network size, and how well this network size ensures the reliable transmission of neural information in a noisy environment. By direct mathematical analysis, we have obtained general solutions proving that there exists an optimal number of neurons in the network, where the average coding energy cost (defined as energy consumption divided by mutual information) per neuron passes through a global minimum for both subthreshold and superthreshold signals. With increases in background noise intensity, the optimal neuronal number decreases for subthreshold signals and increases for suprathreshold signals. The existence of an optimal number of neurons in an array network reveals a general rule for population coding that states that the neuronal number should be large enough to ensure reliable information transmission that is robust to the noisy environment but small enough to minimize energy cost. PMID:26781354
NetCoDer: A Retransmission Mechanism for WSNs Based on Cooperative Relays and Network Coding.
Valle, Odilson T; Montez, Carlos; Medeiros de Araujo, Gustavo; Vasques, Francisco; Moraes, Ricardo
2016-01-01
Some of the most difficult problems to deal with when using Wireless Sensor Networks (WSNs) are related to the unreliable nature of communication channels. In this context, the use of cooperative diversity techniques and the application of network coding concepts may be promising solutions to improve the communication reliability. In this paper, we propose the NetCoDer scheme to address this problem. Its design is based on merging cooperative diversity techniques and network coding concepts. We evaluate the effectiveness of the NetCoDer scheme through both an experimental setup with real WSN nodes and a simulation assessment, comparing NetCoDer performance against state-of-the-art TDMA-based (Time Division Multiple Access) retransmission techniques: BlockACK, Master/Slave and Redundant TDMA. The obtained results highlight that the proposed NetCoDer scheme clearly improves the network performance when compared with other retransmission techniques. PMID:27258280
NetCoDer: A Retransmission Mechanism for WSNs Based on Cooperative Relays and Network Coding
Valle, Odilson T.; Montez, Carlos; Medeiros de Araujo, Gustavo; Vasques, Francisco; Moraes, Ricardo
2016-01-01
Some of the most difficult problems to deal with when using Wireless Sensor Networks (WSNs) are related to the unreliable nature of communication channels. In this context, the use of cooperative diversity techniques and the application of network coding concepts may be promising solutions to improve the communication reliability. In this paper, we propose the NetCoDer scheme to address this problem. Its design is based on merging cooperative diversity techniques and network coding concepts. We evaluate the effectiveness of the NetCoDer scheme through both an experimental setup with real WSN nodes and a simulation assessment, comparing NetCoDer performance against state-of-the-art TDMA-based (Time Division Multiple Access) retransmission techniques: BlockACK, Master/Slave and Redundant TDMA. The obtained results highlight that the proposed NetCoDer scheme clearly improves the network performance when compared with other retransmission techniques. PMID:27258280
Energy-efficient population coding constrains network size of a neuronal array system
Yu, Lianchun; Zhang, Chi; Liu, Liwei; Yu, Yuguo
2016-01-01
We consider the open issue of how the energy efficiency of the neural information transmission process, in a general neuronal array, constrains the network size, and how well this network size ensures the reliable transmission of neural information in a noisy environment. By direct mathematical analysis, we have obtained general solutions proving that there exists an optimal number of neurons in the network, where the average coding energy cost (defined as energy consumption divided by mutual information) per neuron passes through a global minimum for both subthreshold and superthreshold signals. With increases in background noise intensity, the optimal neuronal number decreases for subthreshold signals and increases for suprathreshold signals. The existence of an optimal number of neurons in an array network reveals a general rule for population coding that states that the neuronal number should be large enough to ensure reliable information transmission that is robust to the noisy environment but small enough to minimize energy cost. PMID:26781354
Kim, Daehee; Kim, Dongwan; An, Sunshin
2016-01-01
Code dissemination in wireless sensor networks (WSNs) is a procedure for distributing a new code image over the air in order to update programs. Due to the fact that WSNs are mostly deployed in unattended and hostile environments, secure code dissemination ensuring authenticity and integrity is essential. Recent works on dynamic packet size control in WSNs allow enhancing the energy efficiency of code dissemination by dynamically changing the packet size on the basis of link quality. However, the authentication tokens attached by the base station become useless in the next hop where the packet size can vary according to the link quality of the next hop. In this paper, we propose three source authentication schemes for code dissemination supporting dynamic packet size. Compared to traditional source authentication schemes such as μTESLA and digital signatures, our schemes provide secure source authentication under the environment, where the packet size changes in each hop, with smaller energy consumption. PMID:27409616
Kim, Daehee; Kim, Dongwan; An, Sunshin
2016-01-01
Code dissemination in wireless sensor networks (WSNs) is a procedure for distributing a new code image over the air in order to update programs. Due to the fact that WSNs are mostly deployed in unattended and hostile environments, secure code dissemination ensuring authenticity and integrity is essential. Recent works on dynamic packet size control in WSNs allow enhancing the energy efficiency of code dissemination by dynamically changing the packet size on the basis of link quality. However, the authentication tokens attached by the base station become useless in the next hop where the packet size can vary according to the link quality of the next hop. In this paper, we propose three source authentication schemes for code dissemination supporting dynamic packet size. Compared to traditional source authentication schemes such as μTESLA and digital signatures, our schemes provide secure source authentication under the environment, where the packet size changes in each hop, with smaller energy consumption. PMID:27409616
Synchronized states and multistability in a random network of coupled discontinuous maps
Nag, Mayurakshi; Poria, Swarup
2015-08-15
The synchronization behavior of coupled chaotic discontinuous maps over a ring network with dynamic random connections is reported in this paper. It is observed that random rewiring stabilizes one of the two strongly unstable fixed points of the local map. Depending on initial conditions, the network synchronizes to different unstable fixed points, which signifies the existence of synchronized multistability in the complex network. Moreover, the length of discontinuity of the local map has an important role in generating windows of different synchronized fixed points. Synchronized fixed point and synchronized periodic orbits are found in the network depending on coupling strength and different parameter values of the local map. We have identified the existence of period subtracting bifurcation with respect to coupling strength in the network. The range of coupling strength for the occurrence of synchronized multistable spatiotemporal fixed points is determined. This range strongly depends upon the dynamic rewiring probability and also on the local map.
Synchronization in the random-field Kuramoto model on complex networks
NASA Astrophysics Data System (ADS)
Lopes, M. A.; Lopes, E. M.; Yoon, S.; Mendes, J. F. F.; Goltsev, A. V.
2016-07-01
We study the impact of random pinning fields on the emergence of synchrony in the Kuramoto model on complete graphs and uncorrelated random complex networks. We consider random fields with uniformly distributed directions and homogeneous and heterogeneous (Gaussian) field magnitude distribution. In our analysis, we apply the Ott-Antonsen method and the annealed-network approximation to find the critical behavior of the order parameter. In the case of homogeneous fields, we find a tricritical point above which a second-order phase transition gives place to a first-order phase transition when the network is either fully connected or scale-free with the degree exponent γ >5 . Interestingly, for scale-free networks with 2 <γ ≤5 , the phase transition is of second-order at any field magnitude, except for degree distributions with γ =3 when the transition is of infinite order at Kc=0 independent of the random fields. Contrary to the Ising model, even strong Gaussian random fields do not suppress the second-order phase transition in both complete graphs and scale-free networks, although the fields increase the critical coupling for γ >3 . Our simulations support these analytical results.
Synchronization in the random-field Kuramoto model on complex networks.
Lopes, M A; Lopes, E M; Yoon, S; Mendes, J F F; Goltsev, A V
2016-07-01
We study the impact of random pinning fields on the emergence of synchrony in the Kuramoto model on complete graphs and uncorrelated random complex networks. We consider random fields with uniformly distributed directions and homogeneous and heterogeneous (Gaussian) field magnitude distribution. In our analysis, we apply the Ott-Antonsen method and the annealed-network approximation to find the critical behavior of the order parameter. In the case of homogeneous fields, we find a tricritical point above which a second-order phase transition gives place to a first-order phase transition when the network is either fully connected or scale-free with the degree exponent γ>5. Interestingly, for scale-free networks with 2<γ≤5, the phase transition is of second-order at any field magnitude, except for degree distributions with γ=3 when the transition is of infinite order at K_{c}=0 independent of the random fields. Contrary to the Ising model, even strong Gaussian random fields do not suppress the second-order phase transition in both complete graphs and scale-free networks, although the fields increase the critical coupling for γ>3. Our simulations support these analytical results. PMID:27575149
Speech coding and compression using wavelets and lateral inhibitory networks
NASA Astrophysics Data System (ADS)
Ricart, Richard
1990-12-01
The purpose of this thesis is to introduce the concept of lateral inhibition as a generalized technique for compressing time/frequency representations of electromagnetic and acoustical signals, particularly speech. This requires at least a rudimentary treatment of the theory of frames- which generalizes most commonly known time/frequency distributions -the biology of hearing, and digital signal processing. As such, this material, along with the interrelationships of the disparate subjects, is presented in a tutorial style. This may leave the mathematician longing for more rigor, the neurophysiological psychologist longing for more substantive support of the hypotheses presented, and the engineer longing for a reprieve from the theoretical barrage. Despite the problems that arise when trying to appeal to too wide an audience, this thesis should be a cogent analysis of the compression of time/frequency distributions via lateral inhibitory networks.
Building Damage-Resilient Dominating Sets in Complex Networks against Random and Targeted Attacks
Molnár, F.; Derzsy, N.; Szymanski, B. K.; Korniss, G.
2015-01-01
We study the vulnerability of dominating sets against random and targeted node removals in complex networks. While small, cost-efficient dominating sets play a significant role in controllability and observability of these networks, a fixed and intact network structure is always implicitly assumed. We find that cost-efficiency of dominating sets optimized for small size alone comes at a price of being vulnerable to damage; domination in the remaining network can be severely disrupted, even if a small fraction of dominator nodes are lost. We develop two new methods for finding flexible dominating sets, allowing either adjustable overall resilience, or dominating set size, while maximizing the dominated fraction of the remaining network after the attack. We analyze the efficiency of each method on synthetic scale-free networks, as well as real complex networks. PMID:25662371
Alternative knowledge acquisition: Developing a pulse coded neural network
Dress, W.B.
1987-01-01
After a Rip-van-Winkle nap of more than 20 years, the ideas of biologically motivated computing are re-emerging. Instrumental to this awakening have been the highly publicized contributions of John Hopfield and major advances in the neurosciences. In 1982, Hopfield showed how a system of maximally coupled neutron-like elements described by a Hamiltonian formalism (a linear, conservative system) could behave in a manner startlingly suggestive of the way humans might go about solving problems and retrieving memories. Continuing advances in the neurosciences are providing a coherent basis in suggesting how nature's neurons might function. A particular model is described for an artificial neural system designed to interact with (learn from and manipulate) a simulated (or real) environment. The model is based on early work by Iben Browning. The Browning model, designed to investigate computer-based intelligence, contains a particular simplification based on observations of frequency coding of information in the brain and information flow from receptors to the brain and back to effectors. The ability to act on and react to the environment was seen as an important principle, leading to self-organization of the system.
Randomizing world trade. II. A weighted network analysis
NASA Astrophysics Data System (ADS)
Squartini, Tiziano; Fagiolo, Giorgio; Garlaschelli, Diego
2011-10-01
Based on the misleading expectation that weighted network properties always offer a more complete description than purely topological ones, current economic models of the International Trade Network (ITN) generally aim at explaining local weighted properties, not local binary ones. Here we complement our analysis of the binary projections of the ITN by considering its weighted representations. We show that, unlike the binary case, all possible weighted representations of the ITN (directed and undirected, aggregated and disaggregated) cannot be traced back to local country-specific properties, which are therefore of limited informativeness. Our two papers show that traditional macroeconomic approaches systematically fail to capture the key properties of the ITN. In the binary case, they do not focus on the degree sequence and hence cannot characterize or replicate higher-order properties. In the weighted case, they generally focus on the strength sequence, but the knowledge of the latter is not enough in order to understand or reproduce indirect effects.
Randomizing world trade. II. A weighted network analysis.
Squartini, Tiziano; Fagiolo, Giorgio; Garlaschelli, Diego
2011-10-01
Based on the misleading expectation that weighted network properties always offer a more complete description than purely topological ones, current economic models of the International Trade Network (ITN) generally aim at explaining local weighted properties, not local binary ones. Here we complement our analysis of the binary projections of the ITN by considering its weighted representations. We show that, unlike the binary case, all possible weighted representations of the ITN (directed and undirected, aggregated and disaggregated) cannot be traced back to local country-specific properties, which are therefore of limited informativeness. Our two papers show that traditional macroeconomic approaches systematically fail to capture the key properties of the ITN. In the binary case, they do not focus on the degree sequence and hence cannot characterize or replicate higher-order properties. In the weighted case, they generally focus on the strength sequence, but the knowledge of the latter is not enough in order to understand or reproduce indirect effects. PMID:22181238
NASA Astrophysics Data System (ADS)
Wei, Pei; Gu, Rentao; Ji, Yuefeng
2013-08-01
An efficient dynamic bandwidth allocation (DBA) algorithm for multiclass services called MSDBA is proposed for next-generation time division multiplexing (TDM) passive optical networks with network coding (NC-PON). In MSDBA, a DBA cycle is divided into two subcycles with different coding strategies for differentiated classes of services, and the transmission time of the first subcycle overlaps with the bandwidth allocation calculation time at the optical line terminal. Moreover, according to the quality-of-service (QoS) requirements of services, different scheduling and bandwidth allocation schemes are applied to coded or uncoded services in the corresponding subcycle. Numerical analyses and simulations for performance evaluation are performed in 10 Gbps ethernet passive optical networks (10G EPON), which is a standardized solution for next-generation EPON. Evaluation results show that compared with the existing two DBA algorithms deployed in TDM NC-PON, MSDBA not only demonstrates better performance in delay and QoS support for all classes of services but also achieves the maximum end-to-end delay fairness between coded and uncoded lower-class services and guarantees the end-to-end delay bound and fixed polling order of high-class services by sacrificing their end-to-end delay fairness for compromise.
Adjusting for Network Size and Composition Effects in Exponential-Family Random Graph Models.
Krivitsky, Pavel N; Handcock, Mark S; Morris, Martina
2011-07-01
Exponential-family random graph models (ERGMs) provide a principled way to model and simulate features common in human social networks, such as propensities for homophily and friend-of-a-friend triad closure. We show that, without adjustment, ERGMs preserve density as network size increases. Density invariance is often not appropriate for social networks. We suggest a simple modification based on an offset which instead preserves the mean degree and accommodates changes in network composition asymptotically. We demonstrate that this approach allows ERGMs to be applied to the important situation of egocentrically sampled data. We analyze data from the National Health and Social Life Survey (NHSLS). PMID:21691424
Learning random networks for compression of still and moving images
NASA Technical Reports Server (NTRS)
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.
Use of randomized sampling for analysis of metabolic networks.
Schellenberger, Jan; Palsson, Bernhard Ø
2009-02-27
Genome-scale metabolic network reconstructions in microorganisms have been formulated and studied for about 8 years. The constraint-based approach has shown great promise in analyzing the systemic properties of these network reconstructions. Notably, constraint-based models have been used successfully to predict the phenotypic effects of knock-outs and for metabolic engineering. The inherent uncertainty in both parameters and variables of large-scale models is significant and is well suited to study by Monte Carlo sampling of the solution space. These techniques have been applied extensively to the reaction rate (flux) space of networks, with more recent work focusing on dynamic/kinetic properties. Monte Carlo sampling as an analysis tool has many advantages, including the ability to work with missing data, the ability to apply post-processing techniques, and the ability to quantify uncertainty and to optimize experiments to reduce uncertainty. We present an overview of this emerging area of research in systems biology. PMID:18940807
NASA Astrophysics Data System (ADS)
Yeh, Bih-Chyun; Lin, Chieng-Hung
2012-12-01
In this paper, we propose a family of extended quadratic congruence codes for two-code keying (TCK) with the corresponding encoding/decoding architecture for passive optical networks (PONs) in spectral amplitude coding optical code division multiple access (OCDMA) systems. The proposed system can simultaneously eliminate multi-user interference (MUI) and further suppress phase-induced intensity noise (PIIN). We reduce the complexity of the encoding/decoding architecture of the optical line terminal reduced by exploiting arrayed waveguide gratings (AWGs) and the properties of the extended quadratic congruence codes (EQC codes). Moreover, we also design a deployment method to increase the number of simultaneous users. Our numerical results demonstrate that the proposed system outperforms the improved quadratic congruence codes (improved QC codes).
H.264/AVC intra-only coding (iAVC) techniques for video over wireless networks
NASA Astrophysics Data System (ADS)
Yang, Ming; Trifas, Monica; Xiong, Guolun; Rogers, Joshua
2009-02-01
The requirement to transmit video data over unreliable wireless networks (with the possibility of packet loss) is anticipated in the foreseeable future. Significant compression ratio and error resilience are both needed for complex applications including tele-operated robotics, vehicle-mounted cameras, sensor network, etc. Block-matching based inter-frame coding techniques, including MPEG-4 and H.264/AVC, do not perform well in these scenarios due to error propagation between frames. Many wireless applications often use intra-only coding technologies such as Motion-JPEG, which exhibit better recovery from network data loss at the price of higher data rates. In order to address these research issues, an intra-only coding scheme of H.264/AVC (iAVC) is proposed. In this approach, each frame is coded independently as an I-frame. Frame copy is applied to compensate for packet loss. This approach is a good balance between compression performance and error resilience. It achieves compression performance comparable to Motion- JPEG2000 (MJ2), with lower complexity. Error resilience similar to Motion-JPEG (MJ) will also be accomplished. Since the intra-frame prediction with iAVC is strictly confined within the range of a slice, memory usage is also extremely low. Low computational complexity and memory usage are very crucial to mobile stations and devices in wireless network.
Emergence of multilevel selection in the prisoner's dilemma game on coevolving random networks
NASA Astrophysics Data System (ADS)
Szolnoki, Attila; Perc, Matjaž
2009-09-01
We study the evolution of cooperation in the prisoner's dilemma game, whereby a coevolutionary rule is introduced that molds the random topology of the interaction network in two ways. First, existing links are deleted whenever a player adopts a new strategy or its degree exceeds a threshold value; second, new links are added randomly after a given number of game iterations. These coevolutionary processes correspond to the generic formation of new links and deletion of existing links that, especially in human societies, appear frequently as a consequence of ongoing socialization, change of lifestyle or death. Due to the counteraction of deletions and additions of links the initial heterogeneity of the interaction network is qualitatively preserved, and thus cannot be held responsible for the observed promotion of cooperation. Indeed, the coevolutionary rule evokes the spontaneous emergence of a powerful multilevel selection mechanism, which despite the sustained random topology of the evolving network, maintains cooperation across the whole span of defection temptation values.
Rosvall, Martin; Bergstrom, Carl T.
2011-01-01
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. PMID:21494658
A reaction-diffusion-based coding rate control mechanism for camera sensor networks.
Yamamoto, Hiroshi; Hyodo, Katsuya; Wakamiya, Naoki; Murata, Masayuki
2010-01-01
A wireless camera sensor network is useful for surveillance and monitoring for its visibility and easy deployment. However, it suffers from the limited capacity of wireless communication and a network is easily overflown with a considerable amount of video traffic. In this paper, we propose an autonomous video coding rate control mechanism where each camera sensor node can autonomously determine its coding rate in accordance with the location and velocity of target objects. For this purpose, we adopted a biological model, i.e., reaction-diffusion model, inspired by the similarity of biological spatial patterns and the spatial distribution of video coding rate. Through simulation and practical experiments, we verify the effectiveness of our proposal. PMID:22163620
A Reaction-Diffusion-Based Coding Rate Control Mechanism for Camera Sensor Networks
Yamamoto, Hiroshi; Hyodo, Katsuya; Wakamiya, Naoki; Murata, Masayuki
2010-01-01
A wireless camera sensor network is useful for surveillance and monitoring for its visibility and easy deployment. However, it suffers from the limited capacity of wireless communication and a network is easily overflown with a considerable amount of video traffic. In this paper, we propose an autonomous video coding rate control mechanism where each camera sensor node can autonomously determine its coding rate in accordance with the location and velocity of target objects. For this purpose, we adopted a biological model, i.e., reaction-diffusion model, inspired by the similarity of biological spatial patterns and the spatial distribution of video coding rate. Through simulation and practical experiments, we verify the effectiveness of our proposal. PMID:22163620
All-optical OFDM network coding scheme for all-optical virtual private communication in PON
NASA Astrophysics Data System (ADS)
Li, Lijun; Gu, Rentao; Ji, Yuefeng; Bai, Lin; Huang, Zhitong
2014-03-01
A novel optical orthogonal frequency division multiplexing (OFDM) network coding scheme is proposed over passive optical network (PON) system. The proposed scheme for all-optical virtual private network (VPN) does not only improve transmission efficiency, but also realize full-duplex communication mode in a single fiber. Compared with the traditional all-optical VPN architectures, the all-optical OFDM network coding scheme can support higher speed, more flexible bandwidth allocation, and higher spectrum efficiency. In order to reduce the difficulty of alignment for encoding operation between inter-communication traffic, the width of OFDM subcarrier pulse is stretched in our proposed scheme. The feasibility of all-optical OFDM network coding scheme for VPN is verified, and the relevant simulation results show that the full-duplex inter-communication traffic stream can be transmitted successfully. Furthermore, the tolerance of misalignment existing in inter-ONUs traffic is investigated and analyzed for all-optical encoding operation, and the difficulty of pulse alignment is proved to be lower.
Trend-driven information cascades on random networks
NASA Astrophysics Data System (ADS)
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.
NASA Astrophysics Data System (ADS)
Lim, Sunggook; Lee, Jaiyong
Relaying technology is the one of the solutions to expand the coverage and enhance the throughput of a cellular network with low cost, therefore numerous smart relay stations (RSs) which are able to schedule its own transmission frame and manage radio resources allocated by its serving base station (BS) will be deployed within the cellular network. while more RSs are deployed, the network topology is turning to the random topology. In the random topology, however, conventional frequency reuse schemes based on the uniformly distributed RSs are not adoptable because of the randomness for locations of RSs. Another problem is severe increase of interference during the transmission period for an access link because more transmitters including BSs and RSs are existed within a cell. We suggest the random-topology frequency reuse (RFR) scheme supporting the frequency reuse in the cellular multi-hop network with random topology to reduce intra-cell interference. The simulation results show RFR is reducing the overall intra-cell interference compared to the full allocation scheme whose reuse factor is one. The throughput and average signal to interference plus noise ratio (SINR) is still greater than the full allocation scheme although the spectral efficiency is lower than the compared scheme.
Optimally conductive networks in randomly dispersed CNT:graphene hybrids
NASA Astrophysics Data System (ADS)
Shim, Wonbo; Kwon, Youbin; Jeon, Seung-Yeol; Yu, Woong-Ryeol
2015-11-01
A predictive model is proposed that quantitatively describes the synergistic behavior of the electrical conductivities of CNTs and graphene in CNT:graphene hybrids. The number of CNT-to-CNT, graphene-to-graphene, and graphene-to-CNT contacts is calculated assuming a random distribution of CNTs and graphene particles in the hybrids and using an orientation density function. Calculations reveal that the total number of contacts reaches a maximum at a specific composition and depends on the particle sizes of the graphene and CNTs. The hybrids, prepared using inkjet printing, are distinguished by higher electrical conductivities than that of 100% CNT or graphene at certain composition ratios. These experimental results provide strong evidence that this approach involving constituent element contacts is suitable for investigating the properties of particulate hybrid materials.
Optimally conductive networks in randomly dispersed CNT:graphene hybrids
Shim, Wonbo; Kwon, Youbin; Jeon, Seung-Yeol; Yu, Woong-Ryeol
2015-01-01
A predictive model is proposed that quantitatively describes the synergistic behavior of the electrical conductivities of CNTs and graphene in CNT:graphene hybrids. The number of CNT-to-CNT, graphene-to-graphene, and graphene-to-CNT contacts is calculated assuming a random distribution of CNTs and graphene particles in the hybrids and using an orientation density function. Calculations reveal that the total number of contacts reaches a maximum at a specific composition and depends on the particle sizes of the graphene and CNTs. The hybrids, prepared using inkjet printing, are distinguished by higher electrical conductivities than that of 100% CNT or graphene at certain composition ratios. These experimental results provide strong evidence that this approach involving constituent element contacts is suitable for investigating the properties of particulate hybrid materials. PMID:26564249
Joint wavelet-based coding and packetization for video transport over packet-switched networks
NASA Astrophysics Data System (ADS)
Lee, Hung-ju
1996-02-01
In recent years, wavelet theory applied to image, and audio and video compression has been extensively studied. However, only gaining compression ratio without considering the underlying networking systems is unrealistic, especially for multimedia applications over networks. In this paper, we present an integrated approach, which attempts to preserve the advantages of wavelet-based image coding scheme and to provide robustness to a certain extent for lost packets over packet-switched networks. Two different packetization schemes, called the intrablock-oriented (IAB) and interblock-oriented (IRB) schemes, in conjunction with wavelet-based coding, are presented. Our approach is evaluated under two different packet loss models with various packet loss probabilities through simulations which are driven by real video sequences.
Role Analysis in Networks using Mixtures of Exponential Random Graph Models
Salter-Townshend, Michael; Murphy, Thomas Brendan
2014-01-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. PMID:26101465
Size effects and internal length scales in the elasticity of random fiber networks
NASA Astrophysics Data System (ADS)
Picu, Catalin; Berkache, Kamel; Shahsavari, Ali; Ganghoffer, Jean-Francois
Random fiber networks are the structural element of many biological and man-made materials, including connective tissue, various consumer products and packaging materials. In all cases of practical interest the scale at which the material is used and the scale of the fiber diameter or the mean segment length of the network are separated by several orders of magnitude. This precludes solving boundary value problems defined on the scale of the application while resolving every fiber in the system, and mandates the development of continuum equivalent models. To this end, we study the intrinsic geometric and mechanical length scales of the network and the size effect associated with them. We consider both Cauchy and micropolar continuum models and calibrate them based on the discrete network behavior. We develop a method to predict the characteristic length scales of the problem and the minimum size of a representative element of the network based on network structural parameters and on fiber properties.
Mean-field dynamics of a random neural network with noise
NASA Astrophysics Data System (ADS)
Klinshov, Vladimir; Franović, Igor
2015-12-01
We consider a network of randomly coupled rate-based neurons influenced by external and internal noise. We derive a second-order stochastic mean-field model for the network dynamics and use it to analyze the stability and bifurcations in the thermodynamic limit, as well as to study the fluctuations due to the finite-size effect. It is demonstrated that the two types of noise have substantially different impact on the network dynamics. While both sources of noise give rise to stochastic fluctuations in the case of the finite-size network, only the external noise affects the stationary activity levels of the network in the thermodynamic limit. We compare the theoretical predictions with the direct simulation results and show that they agree for large enough network sizes and for parameter domains sufficiently away from bifurcations.
Data Security in Ad Hoc Networks Using Randomization of Cryptographic Algorithms
NASA Astrophysics Data System (ADS)
Krishna, B. Ananda; Radha, S.; Keshava Reddy, K. Chenna
Ad hoc networks are a new wireless networking paradigm for mobile hosts. Unlike traditional mobile wireless networks, ad hoc networks do not rely on any fixed infrastructure. Instead, hosts rely on each other to keep the network connected. The military tactical and other security-sensitive operations are still the main applications of ad hoc networks, although there is a trend to adopt ad hoc networks for commercial uses due to their unique properties. One main challenge in design of these networks is how to feasibly detect and defend the major attacks against data, impersonation and unauthorized data modification. Also, in the same network some nodes may be malicious whose objective is to degrade the network performance. In this study, we propose a security model in which the packets are encrypted and decrypted using multiple algorithms where the selection scheme is random. The performance of the proposed model is analyzed and it is observed that there is no increase in control overhead but a slight delay is introduced due to the encryption process. We conclude that the proposed security model works well for heavily loaded networks with high mobility and can be extended for more cryptographic algorithms.
Coevolution of information processing and topology in hierarchical adaptive random Boolean networks
NASA Astrophysics Data System (ADS)
Górski, Piotr J.; Czaplicka, Agnieszka; Hołyst, Janusz A.
2016-02-01
Random Boolean Networks (RBNs) are frequently used for modeling complex systems driven by information processing, e.g. for gene regulatory networks (GRNs). Here we propose a hierarchical adaptive random Boolean Network (HARBN) as a system consisting of distinct adaptive RBNs (ARBNs) - subnetworks - connected by a set of permanent interlinks. We investigate mean node information, mean edge information as well as mean node degree. Information measures and internal subnetworks topology of HARBN coevolve and reach steady-states that are specific for a given network structure. The main natural feature of ARBNs, i.e. their adaptability, is preserved in HARBNs and they evolve towards critical configurations which is documented by power law distributions of network attractor lengths. The mean information processed by a single node or a single link increases with the number of interlinks added to the system. The mean length of network attractors and the mean steady-state connectivity possess minima for certain specific values of the quotient between the density of interlinks and the density of all links in networks. It means that the modular network displays extremal values of its observables when subnetworks are connected with a density a few times lower than a mean density of all links.
Stability of Dominating Sets in Complex Networks against Random and Targeted Attacks
NASA Astrophysics Data System (ADS)
Molnar, F.; Derzsy, N.; Szymanski, B. K.; Korniss, G.
2014-03-01
Minimum dominating sets (MDS) are involved in efficiently controlling and monitoring many social and technological networks. However, MDS influence over the entire network may be significantly reduced when some MDS nodes are disabled due to random breakdowns or targeted attacks against nodes in the network. We investigate the stability of domination in scale-free networks in such scenarios. We define stability as the fraction of nodes in the network that are still dominated after some nodes have been removed, either randomly, or by targeting the highest-degree nodes. We find that although the MDS is the most cost-efficient solution (requiring the least number of nodes) for reaching every node in an undamaged network, it is also very sensitive to damage. Further, we investigate alternative methods for finding dominating sets that are less efficient (more costly) than MDS but provide better stability. Finally we construct an algorithm based on greedy node selection that allows us to precisely control the balance between domination stability and cost, to achieve any desired stability at minimum cost, or the best possible stability at any given cost. Analysis of our method shows moderate improvement of domination cost efficiency against random breakdowns, but substantial improvements against targeted attacks. Supported by DARPA, DTRA, ARL NS-CTA, ARO, and ONR.
Development of a new code family based on SAC-OCDMA system with large cardinality for OCDMA network
NASA Astrophysics Data System (ADS)
Abd, Thanaa Hussein; Aljunid, S. A.; Fadhil, Hilal Adnan; Ahmad, R. A.; Saad, N. M.
2011-07-01
We have proposed a new Multi-Diagonal (MD) code for Spectral Amplitude - Coding Optical Code Division Multiple Access (SAC-OCDMA). Although this new MD code has many properties, one of the important properties of this code is that the cross correlation is always zero. Simplicity in code construction and flexibility in cross correlation control has made this code a compelling candidate for future OCDMA applications. The Multiple access interference (MAI) effects have been successfully and completely eliminated. Based on the theoretical analysis MD code is shown here to provide a much better performance compared to Modified Quadratic Congruence (MQC) code and Random Diagonal (RD) code. Proof-of-principle simulations of encoding with 5 and 10 users with 622 Mb/s data transmission at a BER of 10 -12 have been successfully demonstrated together with the DIRECT detection scheme.
A Bipartite Network-based Method for Prediction of Long Non-coding RNA–protein Interactions
Ge, Mengqu; Li, Ao; Wang, Minghui
2016-01-01
As one large class of non-coding RNAs (ncRNAs), long ncRNAs (lncRNAs) have gained considerable attention in recent years. Mutations and dysfunction of lncRNAs have been implicated in human disorders. Many lncRNAs exert their effects through interactions with the corresponding RNA-binding proteins. Several computational approaches have been developed, but only few are able to perform the prediction of these interactions from a network-based point of view. Here, we introduce a computational method named lncRNA–protein bipartite network inference (LPBNI). LPBNI aims to identify potential lncRNA–interacting proteins, by making full use of the known lncRNA–protein interactions. Leave-one-out cross validation (LOOCV) test shows that LPBNI significantly outperforms other network-based methods, including random walk (RWR) and protein-based collaborative filtering (ProCF). Furthermore, a case study was performed to demonstrate the performance of LPBNI using real data in predicting potential lncRNA–interacting proteins. PMID:26917505
Hsieh, Liang-Tien; Ranganath, Charan
2015-11-01
Episodic memory entails the ability to remember what happened when. Although the available evidence indicates that the hippocampus plays a role in structuring serial order information during retrieval of event sequences, information processed in the hippocampus must be conveyed to other cortical and subcortical areas in order to guide behavior. However, the extent to which other brain regions contribute to the temporal organization of episodic memory remains unclear. Here, we examined multivoxel activity pattern changes during retrieval of learned and random object sequences, focusing on a neocortical "core recollection network" that includes the medial prefrontal cortex, retrosplenial cortex, and angular gyrus, as well as on striatal areas including the caudate nucleus and putamen that have been implicated in processing of sequence information. The results demonstrate that regions of the core recollection network carry information about temporal positions within object sequences, irrespective of object information. This schematic coding of temporal information is in contrast to the putamen, which carried information specific to objects in learned sequences, and the caudate, which carried information about objects, irrespective of sequence context. Our results suggest a role for the cortical recollection network in the representation of temporal structure of events during episodic retrieval, and highlight the possible mechanisms by which the striatal areas may contribute to this process. More broadly, the results indicate that temporal sequence retrieval is a useful paradigm for dissecting the contributions of specific brain regions to episodic memory. PMID:26209802
Cooperative MIMO communication at wireless sensor network: an error correcting code approach.
Islam, Mohammad Rakibul; Han, Young Shin
2011-01-01
Cooperative communication in wireless sensor network (WSN) explores the energy efficient wireless communication schemes between multiple sensors and data gathering node (DGN) by exploiting multiple input multiple output (MIMO) and multiple input single output (MISO) configurations. In this paper, an energy efficient cooperative MIMO (C-MIMO) technique is proposed where low density parity check (LDPC) code is used as an error correcting code. The rate of LDPC code is varied by varying the length of message and parity bits. Simulation results show that the cooperative communication scheme outperforms SISO scheme in the presence of LDPC code. LDPC codes with different code rates are compared using bit error rate (BER) analysis. BER is also analyzed under different Nakagami fading scenario. Energy efficiencies are compared for different targeted probability of bit error p(b). It is observed that C-MIMO performs more efficiently when the targeted p(b) is smaller. Also the lower encoding rate for LDPC code offers better error characteristics. PMID:22163732
NASA Astrophysics Data System (ADS)
Skarpalezos, Loukas; Kittas, Aristotelis; Argyrakis, Panos; Cohen, Reuven; Havlin, Shlomo
2015-01-01
We study the problem of a particle or message that travels as a biased random walk towards a target node in a network in the presence of traps. The bias is represented as the probability p of the particle to travel along the shortest path to the target node. The efficiency of the transmission process is expressed through the fraction fg of particles that succeed to reach the target without being trapped. By relating fg with the number S of nodes visited before reaching the target, we first show that, for the unbiased random walk, fg is inversely proportional to both the concentration c of traps and the size N of the network. For the case of biased walks, a simple approximation of S provides an analytical solution that describes well the behavior of fg, especially for p >0.5 . Also, it is shown that for a given value of the bias p , when the concentration of traps is less than a threshold value equal to the inverse of the mean first passage time (MFPT) between two randomly chosen nodes of the network, the efficiency of transmission is unaffected by the presence of traps and almost all the particles arrive at the target. As a consequence, for a given concentration of traps, we can estimate the minimum bias that is needed to have unaffected transmission, especially in the case of random regular (RR), Erdős-Rényi (ER) and scale-free (SF) networks, where an exact expression (RR and ER) or an upper bound (SF) of the MFPT is known analytically. We also study analytically and numerically, the fraction fg of particles that reach the target on SF networks, where a single trap is placed on the highest degree node. For the unbiased random walk, we find that fg˜N-1 /(γ -1 ) , where γ is the power law exponent of the SF network.
Development of flow network analysis code for block type VHTR core by linear theory method
Lee, J. H.; Yoon, S. J.; Park, J. W.; Park, G. C.
2012-07-01
VHTR (Very High Temperature Reactor) is high-efficiency nuclear reactor which is capable of generating hydrogen with high temperature of coolant. PMR (Prismatic Modular Reactor) type reactor consists of hexagonal prismatic fuel blocks and reflector blocks. The flow paths in the prismatic VHTR core consist of coolant holes, bypass gaps and cross gaps. Complicated flow paths are formed in the core since the coolant holes and bypass gap are connected by the cross gap. Distributed coolant was mixed in the core through the cross gap so that the flow characteristics could not be modeled as a simple parallel pipe system. It requires lot of effort and takes very long time to analyze the core flow with CFD analysis. Hence, it is important to develop the code for VHTR core flow which can predict the core flow distribution fast and accurate. In this study, steady state flow network analysis code is developed using flow network algorithm. Developed flow network analysis code was named as FLASH code and it was validated with the experimental data and CFD simulation results. (authors)
A Markov model for the temporal dynamics of balanced random networks of finite size
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
Coded unicast downstream traffic in a wireless network: analysis and WiFi implementation
NASA Astrophysics Data System (ADS)
Cohen, Asaf; Biton, Erez; Kampeas, Joseph; Gurewitz, Omer
2013-12-01
In this article, we design, analyze and implement a network coding based scheme for the problem of transmitting multiple unicast streams from a single access point to multiple receivers. In particular, we consider the scenario in which an access point has access to infinite streams of data to be distributed to their intended receivers. After each time slot, the access point receives acknowledgments on previous transmissions. Based on the acknowledgements, it decides on the structure of a coded or uncoded packet to be broadcast to all receivers in the next slot. The goal of the access point is to maximize the cumulative throughput or discounted cumulative throughput in the system. We first rigorously model the relevant coding problem and the information available to the access point and the receivers. We then formulate the problem using a Markov decision process with an infinite horizon, analyze the value function under the uncoded and coded policies and, despite the exponential number of states, devise greedy and semi-greedy policies with a running time which is polynomial with high probability. We then analyze the two users case in more detail and show the optimality of the semi-greedy policy in that case. Finally, we describe a simple implementation of the suggested concepts within a WiFi open-source driver. The implementation performs the network coding such that the enhanced WiFi architecture is transparent above the MAC layer.
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
Code to generate random identifiers and select QA/QC samples
Mehnert, Edward
1992-01-01
SAMPLID is a PC-based, FORTRAN-77 code which generates unique numbers for identification of samples, selection of QA/QC samples, and generation of labels. These procedures are tedious, but using a computer code such as SAMPLID can increase efficiency and reduce or eliminate errors and bias. The algorithm, used in SAMPLID, for generation of pseudorandom numbers is free of statistical flaws present in commonly available algorithms.
Variability of Fiber Elastic Moduli in Composite Random Fiber Networks Makes the Network Softer
NASA Astrophysics Data System (ADS)
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.
NASA Astrophysics Data System (ADS)
Dodds, Peter Sheridan; Harris, Kameron Decker; Payne, Joshua L.
2011-05-01
For a broad range of single-seed contagion processes acting on generalized random networks, we derive a unifying analytic expression for the possibility of global spreading events in a straightforward, physically intuitive fashion. Our reasoning lays bare a direct mechanical understanding of an archetypal spreading phenomena that is not evident in circuitous extant mathematical approaches.
ERIC Educational Resources Information Center
Gruenenfelder, Thomas M.; Pisoni, David B.
2009-01-01
Purpose: The mental lexicon of words used for spoken word recognition has been modeled as a complex network or graph. Do the characteristics of that graph reflect processes involved in its growth (M. S. Vitevitch, 2008) or simply the phonetic overlap between similar-sounding words? Method: Three pseudolexicons were generated by randomly selecting…
Discrete-time systems with random switches: From systems stability to networks synchronization.
Guo, Yao; Lin, Wei; Ho, Daniel W C
2016-03-01
In this article, we develop some approaches, which enable us to more accurately and analytically identify the essential patterns that guarantee the almost sure stability of discrete-time systems with random switches. We allow for the case that the elements in the switching connection matrix even obey some unbounded and continuous-valued distributions. In addition to the almost sure stability, we further investigate the almost sure synchronization in complex dynamical networks consisting of randomly connected nodes. Numerical examples illustrate that a chaotic dynamics in the synchronization manifold is preserved when statistical parameters enter some almost sure synchronization region established by the developed approach. Moreover, some delicate configurations are considered on probability space for ensuring synchronization in networks whose nodes are described by nonlinear maps. Both theoretical and numerical results on synchronization are presented by setting only a few random connections in each switch duration. More interestingly, we analytically find it possible to achieve almost sure synchronization in the randomly switching complex networks even with very large population sizes, which cannot be easily realized in non-switching but deterministically connected networks. PMID:27036191
Discrete-time systems with random switches: From systems stability to networks synchronization
NASA Astrophysics Data System (ADS)
Guo, Yao; Lin, Wei; Ho, Daniel W. C.
2016-03-01
In this article, we develop some approaches, which enable us to more accurately and analytically identify the essential patterns that guarantee the almost sure stability of discrete-time systems with random switches. We allow for the case that the elements in the switching connection matrix even obey some unbounded and continuous-valued distributions. In addition to the almost sure stability, we further investigate the almost sure synchronization in complex dynamical networks consisting of randomly connected nodes. Numerical examples illustrate that a chaotic dynamics in the synchronization manifold is preserved when statistical parameters enter some almost sure synchronization region established by the developed approach. Moreover, some delicate configurations are considered on probability space for ensuring synchronization in networks whose nodes are described by nonlinear maps. Both theoretical and numerical results on synchronization are presented by setting only a few random connections in each switch duration. More interestingly, we analytically find it possible to achieve almost sure synchronization in the randomly switching complex networks even with very large population sizes, which cannot be easily realized in non-switching but deterministically connected networks.
Adaptive coded spreading OFDM signal for dynamic-λ optical access network
NASA Astrophysics Data System (ADS)
Liu, Bo; Zhang, Lijia; Xin, Xiangjun
2015-12-01
This paper proposes and experimentally demonstrates a novel adaptive coded spreading (ACS) orthogonal frequency division multiplexing (OFDM) signal for dynamic distributed optical ring-based access network. The wavelength can be assigned to different remote nodes (RNs) according to the traffic demand of optical network unit (ONU). The ACS can provide dynamic spreading gain to different signals according to the split ratio or transmission length, which offers flexible power budget for the network. A 10×13.12 Gb/s OFDM access with ACS is successfully demonstrated over two RNs and 120 km transmission in the experiment. The demonstrated method may be viewed as one promising for future optical metro access network.
Protection of HEVC Video Delivery in Vehicular Networks with RaptorQ Codes
Martínez-Rach, Miguel; López, Otoniel; Malumbres, Manuel Pérez
2014-01-01
With future vehicles equipped with processing capability, storage, and communications, vehicular networks will become a reality. A vast number of applications will arise that will make use of this connectivity. Some of them will be based on video streaming. In this paper we focus on HEVC video coding standard streaming in vehicular networks and how it deals with packet losses with the aid of RaptorQ, a Forward Error Correction scheme. As vehicular networks are packet loss prone networks, protection mechanisms are necessary if we want to guarantee a minimum level of quality of experience to the final user. We have run simulations to evaluate which configurations fit better in this type of scenarios. PMID:25136675
3D self-consistent percolative model for networks of randomly aligned carbon nanotubes
NASA Astrophysics Data System (ADS)
Colasanti, S.; Deep Bhatt, V.; Abdellah, A.; Lugli, P.
2015-10-01
A numerical percolative model for simulations of random networks of carbon nanotubes is presented. This algorithm takes into account the real 3D nature of these networks, allowing for a better understanding of their electrical properties. The nanotubes are modeled as non-rigid bendable cylinders with geometrical properties derived according to some statistical distributions inferred from the experiments. For the transport mechanisms we refer to the theory of one-dimensional ballistic channels which is based on the computation of the density of states. The behavior of the entire network is then simulated by coupling a SPICE program with an iterative algorithm that calculates self-consistently the electrostatic potential and the current flow in each node of the network. We performed several simulations on the resistivity of networks with different thicknesses and over different simulation domains. Our results confirm the percolative nature of the electrical transport, which are more pronounced in films close to their percolation threshold.
Plasmon-enhanced random lasing in bio-compatible networks of cellulose nanofibers
NASA Astrophysics Data System (ADS)
Zhang, R.; Knitter, S.; Liew, S. F.; Omenetto, F. G.; Reinhard, B. M.; Cao, H.; Dal Negro, L.
2016-01-01
We report on plasmon-enhanced random lasing in bio-compatible light emitting Hydroxypropyl Cellulose (HPC) nanofiber networks doped with gold nanoparticles. HPC nanofibers with a diameter of 260 ± 30 nm were synthesized by a one step, cost-effective and facile electrospinning technique from a solution-containing Rhodamine 6G and Au nanoparticles. Nanoparticles of controlled diameters from 10 nm to 80 nm were dispersed inside the nanofibers and optically characterized using photoluminescence, dark-field spectroscopy, and coherent backscattering measurements. Plasmon-enhanced random lasing was demonstrated with a lower threshold than that in dye-doped identical HPC networks without Au nanoparticles. These findings provide an effective approach for plasmon-enhanced random lasers based on a bio-compatible host matrix that is particularly attractive for biophotonic applications such as fluorescence sensing, optical tagging, and detection.
Random vs. Combinatorial Methods for Discrete Event Simulation of a Grid Computer Network
NASA Technical Reports Server (NTRS)
Kuhn, D. Richard; Kacker, Raghu; Lei, Yu
2010-01-01
This study compared random and t-way combinatorial inputs of a network simulator, to determine if these two approaches produce significantly different deadlock detection for varying network configurations. Modeling deadlock detection is important for analyzing configuration changes that could inadvertently degrade network operations, or to determine modifications that could be made by attackers to deliberately induce deadlock. Discrete event simulation of a network may be conducted using random generation, of inputs. In this study, we compare random with combinatorial generation of inputs. Combinatorial (or t-way) testing requires every combination of any t parameter values to be covered by at least one test. Combinatorial methods can be highly effective because empirical data suggest that nearly all failures involve the interaction of a small number of parameters (1 to 6). Thus, for example, if all deadlocks involve at most 5-way interactions between n parameters, then exhaustive testing of all n-way interactions adds no additional information that would not be obtained by testing all 5-way interactions. While the maximum degree of interaction between parameters involved in the deadlocks clearly cannot be known in advance, covering all t-way interactions may be more efficient than using random generation of inputs. In this study we tested this hypothesis for t = 2, 3, and 4 for deadlock detection in a network simulation. Achieving the same degree of coverage provided by 4-way tests would have required approximately 3.2 times as many random tests; thus combinatorial methods were more efficient for detecting deadlocks involving a higher degree of interactions. The paper reviews explanations for these results and implications for modeling and simulation.
Random two-dimensional string networks based on divergent coordination assembly
NASA Astrophysics Data System (ADS)
Marschall, Matthias; Reichert, Joachim; Weber-Bargioni, Alexander; Seufert, Knud; Auwärter, Willi; Klyatskaya, Svetlana; Zoppellaro, Giorgio; Ruben, Mario; Barth, Johannes V.
2010-02-01
The bulk properties of glasses and amorphous materials have been studied widely, but the determination of their structural details at the molecular level is hindered by the lack of long-range order. Recently, two-dimensional, supramolecular random networks were assembled on surfaces, and the identification of elementary structural motifs and defects has provided insights into the intriguing nature of disordered materials. So far, however, such networks have been obtained with homomolecular hydrogen-bonded systems of limited stability. Here we explore robust, disordered coordination networks that incorporate transition-metal centres. Cobalt atoms were co-deposited on metal surfaces with a ditopic linker that is nonlinear, prochiral (deconvoluted in three stereoisomers on two-dimensional confinement) and bears terminal carbonitrile groups. In situ scanning tunnelling microscopy revealed the formation of a set of coordination nodes of similar energy that drives a divergent assembly scenario. The expressed string formation and bifurcation motifs result in a random reticulation of the entire surface.
Multiscale Self-Assembly of Quantum-Dots into an Anisotropic Three-Dimensional Random Network
NASA Astrophysics Data System (ADS)
Ilday, Serim; Ilday, Fatih; Hübner, Rene; Prosa, Ty; Martin, Isabelle; Nogay, Gizem; Kabacelik, Ismail; Mics, Zoltan; Bonn, Mischa; Turchinovich, Dmitry; Üstünel, Hande; Toffoli, Daniele; Friedrich, David; Schmidt, Bernd; Heinig, Karl-Heinz; Turan, Rasit
Multiscale self-assembly is ubiquitous in nature but its deliberate use to synthesise multifunctional materials remains rare, partly due to the notoriously difficult problem of controlling topology from atomic to macroscopic scales to obtain properties by design. Here, we demonstrate an anisotropic random network of silicon quantum-dots that hierarchically self-assembles from the atomic to the microscopic scales: First, quantum-dots form, to subsequently interconnect without inflating their diameters to form a random network. This network then grows in a preferential direction to form undulated and branching nanowire-like structures. This specific topology allows simultaneous good electrical conduction and a tuneable bandgap. These scale-dependent features were previously thought to be mutually exclusive. Furthermore, we show that the topology is designed and self-assembled following an inherently modular, material-independent methodology, so that the approach is applicable to achieve programmable properties in other materials.
Nonequilibrium, Drift-Flux Code System for Two-Phase Flow Network Analysis
2000-08-01
Version: 00 SOLA-LOOP is designed for the solution of transient two-phase flow in networks composed of one-dimensional components. The fluid dynamics is described by a nonequilibrium, drift-flux formulation of the fluid conservation laws. Although developed for nuclear reactor safety analysis, SOLA-LOOP may be used as the basis for other types of special-purpose network codes. The program can accommodate almost any set of constitutive relations, property tables, or other special features required for different applications.
Simple Random Sampling-Based Probe Station Selection for Fault Detection in Wireless Sensor Networks
Huang, Rimao; Qiu, Xuesong; Rui, Lanlan
2011-01-01
Fault detection for wireless sensor networks (WSNs) has been studied intensively in recent years. Most existing works statically choose the manager nodes as probe stations and probe the network at a fixed frequency. This straightforward solution leads however to several deficiencies. Firstly, by only assigning the fault detection task to the manager node the whole network is out of balance, and this quickly overloads the already heavily burdened manager node, which in turn ultimately shortens the lifetime of the whole network. Secondly, probing with a fixed frequency often generates too much useless network traffic, which results in a waste of the limited network energy. Thirdly, the traditional algorithm for choosing a probing node is too complicated to be used in energy-critical wireless sensor networks. In this paper, we study the distribution characters of the fault nodes in wireless sensor networks, validate the Pareto principle that a small number of clusters contain most of the faults. We then present a Simple Random Sampling-based algorithm to dynamic choose sensor nodes as probe stations. A dynamic adjusting rule for probing frequency is also proposed to reduce the number of useless probing packets. The simulation experiments demonstrate that the algorithm and adjusting rule we present can effectively prolong the lifetime of a wireless sensor network without decreasing the fault detected rate. PMID:22163789
NASA Astrophysics Data System (ADS)
Park, Joon-Sang; Lee, Uichin; Oh, Soon Young; Gerla, Mario; Lun, Desmond Siumen; Ro, Won Woo; Park, Joonseok
Vehicular ad hoc networks (VANET) aims to enhance vehicle navigation safety by providing an early warning system: any chance of accidents is informed through the wireless communication between vehicles. For the warning system to work, it is crucial that safety messages be reliably delivered to the target vehicles in a timely manner and thus reliable and timely data dissemination service is the key building block of VANET. Data mulling technique combined with three strategies, network codeing, erasure coding and repetition coding, is proposed for the reliable and timely data dissemination service. Particularly, vehicles in the opposite direction on a highway are exploited as data mules, mobile nodes physically delivering data to destinations, to overcome intermittent network connectivity cause by sparse vehicle traffic. Using analytic models, we show that in such a highway data mulling scenario the network coding based strategy outperforms erasure coding and repetition based strategies.
Analysis of bHLH coding genes using gene co-expression network approach.
Srivastava, Swati; Sanchita; Singh, Garima; Singh, Noopur; Srivastava, Gaurava; Sharma, Ashok
2016-07-01
Network analysis provides a powerful framework for the interpretation of data. It uses novel reference network-based metrices for module evolution. These could be used to identify module of highly connected genes showing variation in co-expression network. In this study, a co-expression network-based approach was used for analyzing the genes from microarray data. Our approach consists of a simple but robust rank-based network construction. The publicly available gene expression data of Solanum tuberosum under cold and heat stresses were considered to create and analyze a gene co-expression network. The analysis provide highly co-expressed module of bHLH coding genes based on correlation values. Our approach was to analyze the variation of genes expression, according to the time period of stress through co-expression network approach. As the result, the seed genes were identified showing multiple connections with other genes in the same cluster. Seed genes were found to be vary in different time periods of stress. These analyzed seed genes may be utilized further as marker genes for developing the stress tolerant plant species. PMID:27178572
NASA Astrophysics Data System (ADS)
Jyoti, Vishav; Kaler, Rajinder Singh
2012-09-01
A novel virtual user system is modeled for enhancing the security of an optical code division multiple access (OCDMA) network. Although the OCDMA system implementing code shift keying (CSK) is secure against a conventional power detector, it is susceptible to differential eavesdropping. An analytical framework is developed for the CSK-OCDMA system to show eavesdropper's code interception performance for a single transmitting user in the presence of a virtual user. It is shown that the eavesdropper's probability of correct bit interception decreases from 7.1×10-1 to 1.85×10-5 with the inclusion of the virtual user. Furthermore, the results confirm that the proposed virtual user scheme increases the confidentiality of the CSK-OCDMA system and outperforms the conventional OCDMA scheme in terms of security.
Random and directed walk-based top-(k) queries in wireless sensor networks.
Fu, Jun-Song; Liu, Yun
2015-01-01
In wireless sensor networks, filter-based top- query approaches are the state-of-the-art solutions and have been extensively researched in the literature, however, they are very sensitive to the network parameters, including the size of the network, dynamics of the sensors' readings and declines in the overall range of all the readings. In this work, a random walk-based top- query approach called RWTQ and a directed walk-based top- query approach called DWTQ are proposed. At the beginning of a top- query, one or several tokens are sent to the specific node(s) in the network by the base station. Then, each token walks in the network independently to record and process the readings in a random or directed way. A strategy of choosing the "right" way in DWTQ is carefully designed for the token(s) to arrive at the high-value regions as soon as possible. When designing the walking strategy for DWTQ, the spatial correlations of the readings are also considered. Theoretical analysis and simulation results indicate that RWTQ and DWTQ both are very robust against these parameters discussed previously. In addition, DWTQ outperforms TAG, FILA and EXTOK in transmission cost, energy consumption and network lifetime. PMID:26016914
NASA Astrophysics Data System (ADS)
Timme, Marc; Geisel, Theo; Wolf, Fred
2006-03-01
We analyze the dynamics of networks of spiking neural oscillators. First, we present an exact linear stability theory of the synchronous state for networks of arbitrary connectivity. For general neuron rise functions, stability is determined by multiple operators, for which standard analysis is not suitable. We describe a general nonstandard solution to the multioperator problem. Subsequently, we derive a class of neuronal rise functions for which all stability operators become degenerate and standard eigenvalue analysis becomes a suitable tool. Interestingly, this class is found to consist of networks of leaky integrate-and-fire neurons. For random networks of inhibitory integrate-and-fire neurons, we then develop an analytical approach, based on the theory of random matrices, to precisely determine the eigenvalue distributions of the stability operators. This yields the asymptotic relaxation time for perturbations to the synchronous state which provides the characteristic time scale on which neurons can coordinate their activity in such networks. For networks with finite in-degree, i.e., finite number of presynaptic inputs per neuron, we find a speed limit to coordinating spiking activity. Even with arbitrarily strong interaction strengths neurons cannot synchronize faster than at a certain maximal speed determined by the typical in-degree.
Numerical simulation of fibrous biomaterials with randomly distributed fiber network structure.
Jin, Tao; Stanciulescu, Ilinca
2016-08-01
This paper presents a computational framework to simulate the mechanical behavior of fibrous biomaterials with randomly distributed fiber networks. A random walk algorithm is implemented to generate the synthetic fiber network in 2D used in simulations. The embedded fiber approach is then adopted to model the fibers as embedded truss elements in the ground matrix, which is essentially equivalent to the affine fiber kinematics. The fiber-matrix interaction is partially considered in the sense that the two material components deform together, but no relative movement is considered. A variational approach is carried out to derive the element residual and stiffness matrices for finite element method (FEM), in which material and geometric nonlinearities are both included. Using a data structure proposed to record the network geometric information, the fiber network is directly incorporated into the FEM simulation without significantly increasing the computational cost. A mesh sensitivity analysis is conducted to show the influence of mesh size on various simulation results. The proposed method can be easily combined with Monte Carlo (MC) simulations to include the influence of the stochastic nature of the network and capture the material behavior in an average sense. The computational framework proposed in this work goes midway between homogenizing the fiber network into the surrounding matrix and accounting for the fully coupled fiber-matrix interaction at the segment length scale, and can be used to study the connection between the microscopic structure and the macro-mechanical behavior of fibrous biomaterials with a reasonable computational cost. PMID:26342926
Random network peristalsis in Physarum polycephalum organizes fluid flows across an individual.
Alim, Karen; Amselem, Gabriel; Peaudecerf, François; Brenner, Michael P; Pringle, Anne
2013-08-13
Individuals can function as integrated organisms only when information and resources are shared across a body. Signals and substrates are commonly moved using fluids, often channeled through a network of tubes. Peristalsis is one mechanism for fluid transport and is caused by a wave of cross-sectional contractions along a tube. We extend the concept of peristalsis from the canonical case of one tube to a random network. Transport is maximized within the network when the wavelength of the peristaltic wave is of the order of the size of the network. The slime mold Physarum polycephalum grows as a random network of tubes, and our experiments confirm peristalsis is used by the slime mold to drive internal cytoplasmic flows. Comparisons of theoretically generated contraction patterns with the patterns exhibited by individuals of P. polycephalum demonstrate that individuals maximize internal flows by adapting patterns of contraction to size, thus optimizing transport throughout an organism. This control of fluid flow may be the key to coordinating growth and behavior, including the dynamic changes in network architecture seen over time in an individual. PMID:23898203
Random and Directed Walk-Based Top-k Queries in Wireless Sensor Networks
Fu, Jun-Song; Liu, Yun
2015-01-01
In wireless sensor networks, filter-based top-k query approaches are the state-of-the-art solutions and have been extensively researched in the literature, however, they are very sensitive to the network parameters, including the size of the network, dynamics of the sensors’ readings and declines in the overall range of all the readings. In this work, a random walk-based top-k query approach called RWTQ and a directed walk-based top-k query approach called DWTQ are proposed. At the beginning of a top-k query, one or several tokens are sent to the specific node(s) in the network by the base station. Then, each token walks in the network independently to record and process the readings in a random or directed way. A strategy of choosing the “right” way in DWTQ is carefully designed for the token(s) to arrive at the high-value regions as soon as possible. When designing the walking strategy for DWTQ, the spatial correlations of the readings are also considered. Theoretical analysis and simulation results indicate that RWTQ and DWTQ both are very robust against these parameters discussed previously. In addition, DWTQ outperforms TAG, FILA and EXTOK in transmission cost, energy consumption and network lifetime. PMID:26016914
NASA Astrophysics Data System (ADS)
Yuan, Xin; Shao, Shuai; Stanley, H. Eugene; Havlin, Shlomo
2015-09-01
The stability of networks is greatly influenced by their degree distributions and in particular by their breadth. Networks with broader degree distributions are usually more robust to random failures but less robust to localized attacks. To better understand the effect of the breadth of the degree distribution we study two models in which the breadth is controlled and compare their robustness against localized attacks (LA) and random attacks (RA). We study analytically and by numerical simulations the cases where the degrees in the networks follow a bi-Poisson distribution, P (k ) =α e-λ1λ/1kk ! +(1 -α ) e-λ2λ/2kk ! ,α ∈[0 ,1 ] , and a Gaussian distribution, P (k ) =A exp(-(k/-μ) 22 σ2 ), with a normalization constant A where k ≥0 . In the bi-Poisson distribution the breadth is controlled by the values of α , λ1, and λ2, while in the Gaussian distribution it is controlled by the standard deviation, σ . We find that only when α =0 or α =1 , i.e., degrees obeying a pure Poisson distribution, are LA and RA the same. In all other cases networks are more vulnerable under LA than under RA. For a Gaussian distribution with an average degree μ fixed, we find that when σ2 is smaller than μ the network is more vulnerable against random attack. When σ2 is larger than μ , however, the network becomes more vulnerable against localized attack. Similar qualitative results are also shown for interdependent networks.
Yin, Jun; Yang, Yuwang; Wang, Lei
2016-01-01
Joint design of compressed sensing (CS) and network coding (NC) has been demonstrated to provide a new data gathering paradigm for multi-hop wireless sensor networks (WSNs). By exploiting the correlation of the network sensed data, a variety of data gathering schemes based on NC and CS (Compressed Data Gathering-CDG) have been proposed. However, these schemes assume that the sparsity of the network sensed data is constant and the value of the sparsity is known before starting each data gathering epoch, thus they ignore the variation of the data observed by the WSNs which are deployed in practical circumstances. In this paper, we present a complete design of the feedback CDG scheme where the sink node adaptively queries those interested nodes to acquire an appropriate number of measurements. The adaptive measurement-formation procedure and its termination rules are proposed and analyzed in detail. Moreover, in order to minimize the number of overall transmissions in the formation procedure of each measurement, we have developed a NP-complete model (Maximum Leaf Nodes Minimum Steiner Nodes-MLMS) and realized a scalable greedy algorithm to solve the problem. Experimental results show that the proposed measurement-formation method outperforms previous schemes, and experiments on both datasets from ocean temperature and practical network deployment also prove the effectiveness of our proposed feedback CDG scheme. PMID:27043574
Yin, Jun; Yang, Yuwang; Wang, Lei
2016-01-01
Joint design of compressed sensing (CS) and network coding (NC) has been demonstrated to provide a new data gathering paradigm for multi-hop wireless sensor networks (WSNs). By exploiting the correlation of the network sensed data, a variety of data gathering schemes based on NC and CS (Compressed Data Gathering—CDG) have been proposed. However, these schemes assume that the sparsity of the network sensed data is constant and the value of the sparsity is known before starting each data gathering epoch, thus they ignore the variation of the data observed by the WSNs which are deployed in practical circumstances. In this paper, we present a complete design of the feedback CDG scheme where the sink node adaptively queries those interested nodes to acquire an appropriate number of measurements. The adaptive measurement-formation procedure and its termination rules are proposed and analyzed in detail. Moreover, in order to minimize the number of overall transmissions in the formation procedure of each measurement, we have developed a NP-complete model (Maximum Leaf Nodes Minimum Steiner Nodes—MLMS) and realized a scalable greedy algorithm to solve the problem. Experimental results show that the proposed measurement-formation method outperforms previous schemes, and experiments on both datasets from ocean temperature and practical network deployment also prove the effectiveness of our proposed feedback CDG scheme. PMID:27043574
PRODIAG: Combined expert system/neural network for process fault diagnosis. Volume 2, Code manual
Reifman, J.; Wei, T.Y.C.
1995-09-01
We recommend the reader first review Volume 1 of this document, Code Theory, before reading Volume 2. In this volume we make extensive use of terms and concepts described and defined in Volume 1 which are not redefined here to the same extent. To try to reduce the amount of redundant information, we have restricted this volume to the presentation of the expert system code and refer back to the theory described in Volume 1 when necessary. Verification and validation of the results are presented in Volume 3, Application, of this document. Volume 3 also presents the implementation of the component characteristics diagnostic approach through artificial neural networks discussed in Volume 1. We decided to present the component characteristics approach in Volume 3, as opposed to write a separate code manual for it, because the approach, although general, requires a case-by-case analysis. The purpose of this volume is to present the details of the expert system (ES) portion o the PRODIAG process diagnostic program. In addition, we present here the graphical diagnostics interface (GDI) and illustrate the combined use of the ES and GDI with a sample problem. For completeness, we provide the file names of all files, programs and major subroutines of these two systems, ES and GDI, and their corresponding location in the Reactor Analysis Division (RA) computer network and Reactor Engineering Division (RE) computer network as of 30 September 1995.
NASA Astrophysics Data System (ADS)
Caballero-Águila, R.; Hermoso-Carazo, A.; Linares-Pérez, J.
2016-07-01
Recursive distributed filtering and fixed-point smoothing algorithms are proposed from measurements through sensor networks perturbed by random parameter matrices and additive noises. The proposed observation model provides a unified framework to consider some network-induced random phenomena. Using an innovation approach, intermediate distributed optimal least-squares (LS) linear estimators are firstly obtained at each sensor node, processing the available output measurements, not only from the own sensor but also from its neighbouring sensors according to the network topology. After that, the proposed distributed estimators are designed at each node as the LS matrix-weighted linear combination of the intermediate estimators within its neighbourhood. The proposed algorithms use only covariance information and do not require the state-space model of the signal. To compare the accuracy of the estimators, recursive expressions for the estimation error covariance matrices are also derived. A simulation example shows the effectiveness of the proposed estimation algorithms and some of the network-induced uncertainties covered by the observation model with random parameter matrices considered in this paper.
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.
NASA Astrophysics Data System (ADS)
Kagami, Haruna; Akutsu, Tatsuya; Maegawa, Shingo; Hosokawa, Hiroshi; Nacher, Jose C.
2015-10-01
Deciphering the association between life molecules and human diseases is currently an important task in systems biology. Research over the past decade has unveiled that the human genome is almost entirely transcribed, producing a vast number of non-protein-coding RNAs (ncRNAs) with potential regulatory functions. More recent findings suggest that many diseases may not be exclusively linked to mutations in protein-coding genes. The combination of these arguments poses the question of whether ncRNAs that play a critical role in network control are also enriched with disease-associated ncRNAs. To address this question, we mapped the available annotated information of more than 350 human disorders to the largest collection of human ncRNA-protein interactions, which define a bipartite network of almost 93,000 interactions. Using a novel algorithmic-based controllability framework applied to the constructed bipartite network, we found that ncRNAs engaged in critical network control are also statistically linked to human disorders (P-value of P = 9.8 × 10-109). Taken together, these findings suggest that the addition of those genes that encode optimized subsets of ncRNAs engaged in critical control within the pool of candidate genes could aid disease gene prioritization studies.
Kagami, Haruna; Akutsu, Tatsuya; Maegawa, Shingo; Hosokawa, Hiroshi; Nacher, Jose C
2015-01-01
Deciphering the association between life molecules and human diseases is currently an important task in systems biology. Research over the past decade has unveiled that the human genome is almost entirely transcribed, producing a vast number of non-protein-coding RNAs (ncRNAs) with potential regulatory functions. More recent findings suggest that many diseases may not be exclusively linked to mutations in protein-coding genes. The combination of these arguments poses the question of whether ncRNAs that play a critical role in network control are also enriched with disease-associated ncRNAs. To address this question, we mapped the available annotated information of more than 350 human disorders to the largest collection of human ncRNA-protein interactions, which define a bipartite network of almost 93,000 interactions. Using a novel algorithmic-based controllability framework applied to the constructed bipartite network, we found that ncRNAs engaged in critical network control are also statistically linked to human disorders (P-value of P = 9.8 × 10(-109)). Taken together, these findings suggest that the addition of those genes that encode optimized subsets of ncRNAs engaged in critical control within the pool of candidate genes could aid disease gene prioritization studies. PMID:26459019
Non-coding RNAs and a layered architecture of genetic networks
NASA Astrophysics Data System (ADS)
Zhdanov, Vladimir
2010-12-01
In eukaryotic cells, protein-coding sequences constitute a relatively small part of the genome. The rest of the genome is transcribed to non-coding RNAs (ncRNAs). Such RNAs form the cornerstone of a regulatory network that operates in parallel with the protein network. Their biological functions are based primarily on the ability to pair with and deactivate target messenger RNAs (mRNAs). To clarify the likely role of ncRNAs in complex genetic networks, we present and comprehensively analyze a kinetic model of one of the key counterparts of the network architectures. Specifically, the genes transcribed to ncRNAs are considered to interplay with a hierarchical two-layer set of genes transcribed to mRNAs. The genes forming the bottom layer are regulated from the top and negatively self-regulated. If the former regulation is positive, the dependence of the RNA populations on the governing parameters is found to be often non-monotonous. Specifically, the model predicts bistability. If the regulation is negative, the dependence of the RNA populations on the governing parameters is monotonous. In particular, the population of the mRNAs, corresponding to the genes forming the bottom layer, is nearly constant.
Krivitsky, Pavel N.; Handcock, Mark S.; Raftery, Adrian E.; Hoff, Peter D.
2009-01-01
Social network data often involve transitivity, homophily on observed attributes, clustering, and heterogeneity of actor degrees. We propose a latent cluster random effects model to represent all of these features, and we describe a Bayesian estimation method for it. The model is applicable to both binary and non-binary network data. We illustrate the model using two real datasets. We also apply it to two simulated network datasets with the same, highly skewed, degree distribution, but very different network behavior: one unstructured and the other with transitivity and clustering. Models based on degree distributions, such as scale-free, preferential attachment and power-law models, cannot distinguish between these very different situations, but our model does. PMID:20191087
Method and system for pattern analysis using a coarse-coded neural network
NASA Technical Reports Server (NTRS)
Spirkovska, Liljana (Inventor); Reid, Max B. (Inventor)
1994-01-01
A method and system for performing pattern analysis with a neural network coarse-coding a pattern to be analyzed so as to form a plurality of sub-patterns collectively defined by data. Each of the sub-patterns comprises sets of pattern data. The neural network includes a plurality fields, each field being associated with one of the sub-patterns so as to receive the sub-pattern data therefrom. Training and testing by the neural network then proceeds in the usual way, with one modification: the transfer function thresholds the value obtained from summing the weighted products of each field over all sub-patterns associated with each pattern being analyzed by the system.
Data compression in wireless sensors network using MDCT and embedded harmonic coding.
Alsalaet, Jaafar K; Ali, Abduladhem A
2015-05-01
One of the major applications of wireless sensors networks (WSNs) is vibration measurement for the purpose of structural health monitoring and machinery fault diagnosis. WSNs have many advantages over the wired networks such as low cost and reduced setup time. However, the useful bandwidth is limited, as compared to wired networks, resulting in relatively low sampling. One solution to this problem is data compression which, in addition to enhancing sampling rate, saves valuable power of the wireless nodes. In this work, a data compression scheme, based on Modified Discrete Cosine Transform (MDCT) followed by Embedded Harmonic Components Coding (EHCC) is proposed to compress vibration signals. The EHCC is applied to exploit harmonic redundancy present is most vibration signals resulting in improved compression ratio. This scheme is made suitable for the tiny hardware of wireless nodes and it is proved to be fast and effective. The efficiency of the proposed scheme is investigated by conducting several experimental tests. PMID:25541332
Joint Random Access and Power Control Game in Ad Hoc Networks with Noncooperative Users
NASA Astrophysics Data System (ADS)
Long, Chengnian; Guan, Xinping
We consider a distributed joint random access and power control scheme for interference management in wireless ad hoc networks. To derive decentralized solutions that do not require any cooperation among the users, we formulate this problem as non-cooperative joint random access and power control game, in which each user minimizes its average transmission cost with a given rate constraint. Using supermodular game theory, the existence and uniqueness of Nash equilibrium are established. Furthermore, we present an asynchronous distributed algorithm to compute the solution of the game based on myopic best response updates, which converges to Nash equilibrium globally.
Jesse, Stephen; Kalinin, Sergei V; Kumar, Amit; Ovchinnikov, Oleg S; Guo, Senli; Griggio, Flavio; Trolier-Mckinstry, Susan E
2011-01-01
The spatial variability of the polarization dynamics in thin film ferroelectric capacitors was probed by recognition analysis of spatially-resolved spectroscopic data. Switching spectroscopy piezoresponse force microscopy was used to measure local hysteresis loops and map them on a 2D random-bond, random-field Ising model. A neural-network based recognition approach was utilized to analyze the hysteresis loops and their spatial variability. Strong variability is observed in the polarization dynamics around macroscopic cracks due to the modified local elastic and electric boundary conditions, with most pronounced effect on the length scale of ~100 nm away from the crack.
A direct sequence spread spectrum code acquisition circuit for wireless sensor networks
NASA Astrophysics Data System (ADS)
Ghaisari, Jafar; Ferdosi, Arash
2011-06-01
Narrow band (NB), spread spectrum (SS), and ultra wide band (UWB) are three physical layer bandwidth types used in wireless sensor networks (WSN). SS and UWB technologies have many advantages over NB, which make them preferable for WSN. Synchronisation of different nodes in a WSN is an important task that is necessary to improve cooperation and lifetime of nodes. Code acquisition is the main step of a node's time synchronisation. In this article, a pseudo noise code generator and a code acquisition circuit are proposed, designed and tested using direct sequence SS technique. To investigate the properties of the designed circuits, simulations are carried out via Xilinx Foundation Series software in the real mode. The results demonstrate excellent performance of the proposed algorithms and circuits in all realistic conditions. The code acquisition circuit proposed an adaptive testing window for single dwell serial search method. The code acquisition circuit is a clock phase free approach, thus the clock coherency step is cancelled. Moreover, clock phase difference between transmitter and receiver nodes does not mostly affect the acquisition and thus synchronisation time.
NASA Astrophysics Data System (ADS)
Kurceren, Ragip; Modestino, James W.
1998-12-01
The use of forward error-control (FEC) coding, possibly in conjunction with ARQ techniques, has emerged as a promising approach for video transport over ATM networks for cell-loss recovery and/or bit error correction, such as might be required for wireless links. Although FEC provides cell-loss recovery capabilities it also introduces transmission overhead which can possibly cause additional cell losses. A methodology is described to maximize the number of video sources multiplexed at a given quality of service (QoS), measured in terms of decoded cell loss probability, using interlaced FEC codes. The transport channel is modelled as a block interference channel (BIC) and the multiplexer as single server, deterministic service, finite buffer supporting N users. Based upon an information-theoretic characterization of the BIC and large deviation bounds on the buffer overflow probability, the described methodology provides theoretically achievable upper limits on the number of sources multiplexed. Performance of specific coding techniques using interlaced nonbinary Reed-Solomon (RS) codes and binary rate-compatible punctured convolutional (RCPC) codes is illustrated.
NASA Technical Reports Server (NTRS)
Stoenescu, Tudor M.; Woo, Simon S.
2009-01-01
In this work, we consider information dissemination and sharing in a distributed peer-to-peer (P2P highly dynamic communication network. In particular, we explore a network coding technique for transmission and a rank based peer selection method for network formation. The combined approach has been shown to improve information sharing and delivery to all users when considering the challenges imposed by the space network environments.
Random Visitor: Defense against Identity Attacks in P2P Networks
NASA Astrophysics Data System (ADS)
Gu, Jabeom; Nah, Jaehoon; Kwon, Hyeokchan; Jang, Jonsoo; Park, Sehyun
Various advantages of cooperative peer-to-peer networks are strongly counterbalanced by the open nature of a distributed, serverless network. In such networks, it is relatively easy for an attacker to launch various attacks such as misrouting, corrupting, or dropping messages as a result of a successful identifier forgery. The impact of an identifier forgery is particularly severe because the whole network can be compromised by attacks such as Sybil or Eclipse. In this paper, we present an identifier authentication mechanism called random visitor, which uses one or more randomly selected peers as delegates of identity proof. Our scheme uses identity-based cryptography and identity ownership proof mechanisms collectively to create multiple, cryptographically protected indirect bindings between two peers, instantly when needed, through the delegates. Because of these bindings, an attacker cannot achieve an identifier forgery related attack against interacting peers without breaking the bindings. Therefore, our mechanism limits the possibility of identifier forgery attacks efficiently by disabling an attacker's ability to break the binding. The design rationale and framework details are presented. A security analysis shows that our scheme is strong enough against identifier related attacks and that the strength increases if there are many peers (more than several thousand) in the network.
Identify the diversity of mesoscopic structures in networks: A mixed random walk approach
NASA Astrophysics Data System (ADS)
Ma, Yifang; Jiang, Xin; Li, Meng; Shen, Xin; Guo, Quantong; Lei, Yanjun; Zheng, Zhiming
2013-10-01
Community or cluster structure, which can provide insight into the natural partitions and inner connections of a network, is a key feature in studying the mesoscopic structure of complex systems. Although numerous methods for community detection have been proposed ever since, there is still a lack of understanding on how to quantify the diversity of pre-divided community structures, or rank the roles of communities in participating in specific dynamic processes. Inspired by the Law of Mass Action in chemical kinetics, we introduce here the community random walk energy (CRWE), which reflects a potential based on the diffusion phase of a mixed random walk process taking place on the network, to identify the configuration of community structures. The difference of CRWE allows us to distinguish the intrinsic topological diversity between individual communities, on condition that all the communities are pre-arranged in the network. We illustrate our method by performing numerical simulations on constructive community networks and a real social network with distinct community structures. As an application, we apply our method to characterize the diversity of human genome communities, which provides a possible use of our method in inferring the genetic similarity between human populations.
A Random Walk on WASP-12b with the Bayesian Atmospheric Radiative Transfer (BART) Code
NASA Astrophysics Data System (ADS)
Harrington, Joseph; Cubillos, Patricio; Blecic, Jasmina; Challener, Ryan; Rojo, Patricio; Lust, Nathaniel B.; Bowman, Oliver; Blumenthal, Sarah D.; Foster, Andrew S. D.; Foster, Austin James; Stemm, Madison; Bruce, Dylan
2016-01-01
We present the Bayesian Atmospheric Radiative Transfer (BART) code for atmospheric property retrievals from transit and eclipse spectra, and apply it to WASP-12b, a hot (~3000 K) exoplanet with a high eclipse signal-to-noise ratio. WASP-12b has been controversial. We (Madhusudhan et al. 2011, Nature) claimed it was the first planet with a high C/O abundance ratio. Line et al. (2014, ApJ) suggested a high CO2 abundance to explain the data. Stevenson et al. (2014, ApJ, atmospheric model by Madhusudhan) add additional data and reaffirm the original result, stating that C2H2 and HCN, not included in the Line et al. models, explain the data. We explore several modeling configurations and include Hubble, Spitzer, and ground-based eclipse data.BART consists of a differential-evolution Markov-Chain Monte Carlo sampler that drives a line-by-line radiative transfer code through the phase space of thermal- and abundance-profile parameters. BART is written in Python and C. Python modules generate atmospheric profiles from sets of MCMC parameters and integrate the resulting spectra over observational bandpasses, allowing high flexibility in modeling the planet without interacting with the fast, C portions that calculate the spectra. BART's shared memory and optimized opacity calculation allow it to run on a laptop, enabling classroom use. Runs can scale constant abundance profiles, profiles of thermochemical equilibrium abundances (TEA) calculated by the included TEA code, or arbitrary curves. Several thermal profile parameterizations are available. BART is an open-source, reproducible-research code. Users must release any code or data modifications if they publish results from it, and we encourage the community to use it and to participate in its development via http://github.com/ExOSPORTS/BART.This work was supported by NASA Planetary Atmospheres grant NNX12AI69G and NASA Astrophysics Data Analysis Program grant NNX13AF38G. J. Blecic holds a NASA Earth and Space Science
NASA Astrophysics Data System (ADS)
Lee, S. B.; Lee, J. S.; Chang, S. H.; Yoo, H. K.; Kang, B. S.; Kahng, B.; Lee, M.-J.; Kim, C. J.; Noh, T. W.
2011-01-01
We observed reversible-type changes between bipolar (BRS) and unipolar resistance switching (URS) in one Pt/SrTiOx/Pt capacitor. To explain both BRS and URS in a unified scheme, we introduce the "interface-modified random circuit breaker network model," in which the bulk medium is represented by a percolating network of circuit breakers. To consider interface effects in BRS, we introduce circuit breakers to investigate resistance states near the interface. This percolation model explains the reversible-type changes in terms of connectivity changes in the circuit breakers and provides insights into many experimental observations of BRS which are under debate by earlier theoretical models.
Inference of biological networks using Bi-directional Random Forest Granger causality.
Furqan, Mohammad Shaheryar; Siyal, Mohammad Yakoob
2016-01-01
The standard ordinary least squares based Granger causality is one of the widely used methods for detecting causal interactions between time series data. However, recent developments in technology limit the utilization of some existing implementations due to the availability of high dimensional data. In this paper, we are proposing a technique called Bi-directional Random Forest Granger causality. This technique uses the random forest regularization together with the idea of reusing the time series data by reversing the time stamp to extract more causal information. We have demonstrated the effectiveness of our proposed method by applying it to simulated data and then applied it to two real biological datasets, i.e., fMRI and HeLa cell. fMRI data was used to map brain network involved in deductive reasoning while HeLa cell dataset was used to map gene network involved in cancer. PMID:27186478
Randomized gradient-free method for multiagent optimization over time-varying networks.
Yuan, Deming; Ho, Daniel W C
2015-06-01
In this brief, we consider the multiagent optimization over a network where multiple agents try to minimize a sum of nonsmooth but Lipschitz continuous functions, subject to a convex state constraint set. The underlying network topology is modeled as time varying. We propose a randomized derivative-free method, where in each update, the random gradient-free oracles are utilized instead of the subgradients (SGs). In contrast to the existing work, we do not require that agents are able to compute the SGs of their objective functions. We establish the convergence of the method to an approximate solution of the multiagent optimization problem within the error level depending on the smoothing parameter and the Lipschitz constant of each agent's objective function. Finally, a numerical example is provided to demonstrate the effectiveness of the method. PMID:25099738
Han, I; Bond, S; Welty, R; Du, Y; Yoo, S; Reinhardt, C; Behymer, E; Sperry, V; Kobayashi, N
2004-02-12
This project is focused on the development of advanced components and system technologies for secure data transmission on high-speed fiber optic data systems. This work capitalizes on (1) a strong relationship with outstanding faculty at the University of California-Davis who are experts in high speed fiber-optic networks, (2) the realization that code division multiple access (CDMA) is emerging as a bandwidth enhancing technique for fiber optic networks, (3) the realization that CDMA of sufficient complexity forms the basis for almost unbreakable one-time key transmissions, (4) our concepts for superior components for implementing CDMA, (5) our expertise in semiconductor device processing and (6) our Center for Nano and Microtechnology, which is where the majority of the experimental work was done. Here we present a novel device concept, which will push the limits of current technology, and will simultaneously solve system implementation issues by investigating new state-of-the-art fiber technologies. This will enable the development of secure communication systems for the transmission and reception of messages on deployed commercial fiber optic networks, through the CDMA phase encoding of broad bandwidth pulses. CDMA technology has been developed as a multiplexing technology, much like wavelength division multiplexing (WDM) or time division multiplexing (TDM), to increase the potential number of users on a given communication link. A novel application of the techniques created for CDMA is to generate secure communication through physical layer encoding. Physical layer encoding devices are developed which utilize semiconductor waveguides with fast carrier response times to phase encode spectral components of a secure signal. Current commercial technology, most commonly a spatial light modulator, allows phase codes to be changed at rates of only 10's of Hertz ({approx}25ms response). The use of fast (picosecond to nanosecond) carrier dynamics of semiconductors, as
Associative memory of phase-coded spatiotemporal patterns in leaky Integrate and Fire networks.
Scarpetta, Silvia; Giacco, Ferdinando
2013-04-01
We study the collective dynamics of a Leaky Integrate and Fire network in which precise relative phase relationship of spikes among neurons are stored, as attractors of the dynamics, and selectively replayed at different time scales. Using an STDP-based learning process, we store in the connectivity several phase-coded spike patterns, and we find that, depending on the excitability of the network, different working regimes are possible, with transient or persistent replay activity induced by a brief signal. We introduce an order parameter to evaluate the similarity between stored and recalled phase-coded pattern, and measure the storage capacity. Modulation of spiking thresholds during replay changes the frequency of the collective oscillation or the number of spikes per cycle, keeping preserved the phases relationship. This allows a coding scheme in which phase, rate and frequency are dissociable. Robustness with respect to noise and heterogeneity of neurons parameters is studied, showing that, since dynamics is a retrieval process, neurons preserve stable precise phase relationship among units, keeping a unique frequency of oscillation, even in noisy conditions and with heterogeneity of internal parameters of the units. PMID:23053861
Differential Code Biases Temporal and Spatial Variation: A case study of permanent network in Egypt
NASA Astrophysics Data System (ADS)
Mousa, Ashraf; Abd, Mohamed; Rabah, Moustafa; Mowafi, Mahmoud; Awad, Ahmed
2016-07-01
Measurements of Global Positioning Satellite System (GPS) receivers are affected by systematic offsets related to group and phase delays of the signal generation and processing chain. One of the important factors affecting the ionosphere Total Electron Content (TEC) estimation accuracy is the hardware Differential Code Bias (DCBs) inherited in both GPS satellites and receivers. The resulting code and phase biases depend on the transmission frequency and the employed signal modulation. An efficient algorithm using the geometry conditions between satellite and tracking receivers is proposed to determine the receiver differential code bias (DCB) using Egyptian permanent reference stations. This method does not require a traditional single-layer ionosphere model and can be used for estimating DCBs of receivers in a regional network. This paper estimates receiver DCBs for nine receivers located within Egyptian network. The results showed that the estimated mean value of the receiver DCB varied from -28 ns (nanosecond) to 39 ns. It is clear from the results that DCB values for Egyptian sites do not vary much with latitude and longitude, except at ABSM and ASWN. DCB values increase gradually with increasing height.
Optimal system size for complex dynamics in random neural networks near criticality
Wainrib, Gilles; García del Molino, Luis Carlos
2013-12-15
In this article, we consider a model of dynamical agents coupled through a random connectivity matrix, as introduced by Sompolinsky et al. [Phys. Rev. Lett. 61(3), 259–262 (1988)] in the context of random neural networks. When system size is infinite, it is known that increasing the disorder parameter induces a phase transition leading to chaotic dynamics. We observe and investigate here a novel phenomenon in the sub-critical regime for finite size systems: the probability of observing complex dynamics is maximal for an intermediate system size when the disorder is close enough to criticality. We give a more general explanation of this type of system size resonance in the framework of extreme values theory for eigenvalues of random matrices.
Caballero-Águila, Raquel; Hermoso-Carazo, Aurora; Linares-Pérez, Josefa
2016-01-01
This paper is concerned with the distributed and centralized fusion filtering problems in sensor networked systems with random one-step delays in transmissions. The delays are described by Bernoulli variables correlated at consecutive sampling times, with different characteristics at each sensor. The measured outputs are subject to uncertainties modeled by random parameter matrices, thus providing a unified framework to describe a wide variety of network-induced phenomena; moreover, the additive noises are assumed to be one-step autocorrelated and cross-correlated. Under these conditions, without requiring the knowledge of the signal evolution model, but using only the first and second order moments of the processes involved in the observation model, recursive algorithms for the optimal linear distributed and centralized filters under the least-squares criterion are derived by an innovation approach. Firstly, local estimators based on the measurements received from each sensor are obtained and, after that, the distributed fusion filter is generated as the least-squares matrix-weighted linear combination of the local estimators. Also, a recursive algorithm for the optimal linear centralized filter is proposed. In order to compare the estimators performance, recursive formulas for the error covariance matrices are derived in all the algorithms. The effects of the delays in the filters accuracy are analyzed in a numerical example which also illustrates how some usual network-induced uncertainties can be dealt with using the current observation model described by random matrices. PMID:27338387
Caballero-Águila, Raquel; Hermoso-Carazo, Aurora; Linares-Pérez, Josefa
2016-01-01
This paper is concerned with the distributed and centralized fusion filtering problems in sensor networked systems with random one-step delays in transmissions. The delays are described by Bernoulli variables correlated at consecutive sampling times, with different characteristics at each sensor. The measured outputs are subject to uncertainties modeled by random parameter matrices, thus providing a unified framework to describe a wide variety of network-induced phenomena; moreover, the additive noises are assumed to be one-step autocorrelated and cross-correlated. Under these conditions, without requiring the knowledge of the signal evolution model, but using only the first and second order moments of the processes involved in the observation model, recursive algorithms for the optimal linear distributed and centralized filters under the least-squares criterion are derived by an innovation approach. Firstly, local estimators based on the measurements received from each sensor are obtained and, after that, the distributed fusion filter is generated as the least-squares matrix-weighted linear combination of the local estimators. Also, a recursive algorithm for the optimal linear centralized filter is proposed. In order to compare the estimators performance, recursive formulas for the error covariance matrices are derived in all the algorithms. The effects of the delays in the filters accuracy are analyzed in a numerical example which also illustrates how some usual network-induced uncertainties can be dealt with using the current observation model described by random matrices. PMID:27338387
Hybrid information privacy system: integration of chaotic neural network and RSA coding
NASA Astrophysics Data System (ADS)
Hsu, Ming-Kai; Willey, Jeff; Lee, Ting N.; Szu, Harold H.
2005-03-01
Electronic mails are adopted worldwide; most are easily hacked by hackers. In this paper, we purposed a free, fast and convenient hybrid privacy system to protect email communication. The privacy system is implemented by combining private security RSA algorithm with specific chaos neural network encryption process. The receiver can decrypt received email as long as it can reproduce the specified chaos neural network series, so called spatial-temporal keys. The chaotic typing and initial seed value of chaos neural network series, encrypted by the RSA algorithm, can reproduce spatial-temporal keys. The encrypted chaotic typing and initial seed value are hidden in watermark mixed nonlinearly with message media, wrapped with convolution error correction codes for wireless 3rd generation cellular phones. The message media can be an arbitrary image. The pattern noise has to be considered during transmission and it could affect/change the spatial-temporal keys. Since any change/modification on chaotic typing or initial seed value of chaos neural network series is not acceptable, the RSA codec system must be robust and fault-tolerant via wireless channel. The robust and fault-tolerant properties of chaos neural networks (CNN) were proved by a field theory of Associative Memory by Szu in 1997. The 1-D chaos generating nodes from the logistic map having arbitrarily negative slope a = p/q generating the N-shaped sigmoid was given first by Szu in 1992. In this paper, we simulated the robust and fault-tolerance properties of CNN under additive noise and pattern noise. We also implement a private version of RSA coding and chaos encryption process on messages.
JPEG image transmission over mobile network with an efficient channel coding and interleaving
NASA Astrophysics Data System (ADS)
El-Bendary, Mohsen A. M. Mohamed; Abou El-Azm, Atef E.; El-Fishawy, Nawal A.; Al-Hosarey, Farid Shawki M.; Eltokhy, Mostafa A. R.; Abd El-Samie, Fathi E.; Kazemian, H. B.
2012-11-01
This article studies improving of coloured JPEG image transmission over mobile wireless personal area network through the Bluetooth networks. This article uses many types of enhanced data rate and asynchronous connectionless packets. It presents a proposed chaotic interleaving technique for improving a transmission of coloured images over burst error environment through merging it with error control scheme. The computational complexity of the used different error control schemes is considered. A comparison study between different scenarios of the image transmission is held in to choose an effective technique. The simulation experiments are carried over the correlated fading channel using the widely accepted Jakes' model. Our experiments reveal that the proposed chaotic interleaving technique enhances quality of the received coloured image. Our simulation results show that the convolutional codes with longer constraint length are effective if its complexity is ignored. It reveals also that the standard error control scheme of old Bluetooth versions is ineffective in the case of coloured image transmission over mobile Bluetooth network. Finally, the proposed scenarios of the standard error control scheme with the chaotic interleaver perform better than the convolutional codes with reducing the complexity.
NASA Astrophysics Data System (ADS)
Corona, Enrique; Nutter, Brian; Mitra, Sunanda; Guo, Jiangling; Karp, Tanja
2008-03-01
Efficient retrieval of high quality Regions-Of-Interest (ROI) from high resolution medical images is essential for reliable interpretation and accurate diagnosis. Random access to high quality ROI from codestreams is becoming an essential feature in many still image compression applications, particularly in viewing diseased areas from large medical images. This feature is easier to implement in block based codecs because of the inherent spatial independency of the code blocks. This independency implies that the decoding order of the blocks is unimportant as long as the position for each is properly identified. In contrast, wavelet-tree based codecs naturally use some interdependency that exploits the decaying spectrum model of the wavelet coefficients. Thus one must keep track of the decoding order from level to level with such codecs. We have developed an innovative multi-rate image subband coding scheme using "Backward Coding of Wavelet Trees (BCWT)" which is fast, memory efficient, and resolution scalable. It offers far less complexity than many other existing codecs including both, wavelet-tree, and block based algorithms. The ROI feature in BCWT is implemented through a transcoder stage that generates a new BCWT codestream containing only the information associated with the user-defined ROI. This paper presents an efficient technique that locates a particular ROI within the BCWT coded domain, and decodes it back to the spatial domain. This technique allows better access and proper identification of pathologies in high resolution images since only a small fraction of the codestream is required to be transmitted and analyzed.
Surveying Multidisciplinary Aspects in Real-Time Distributed Coding for Wireless Sensor Networks
Braccini, Carlo; Davoli, Franco; Marchese, Mario; Mongelli, Maurizio
2015-01-01
Wireless Sensor Networks (WSNs), where a multiplicity of sensors observe a physical phenomenon and transmit their measurements to one or more sinks, pertain to the class of multi-terminal source and channel coding problems of Information Theory. In this category, “real-time” coding is often encountered for WSNs, referring to the problem of finding the minimum distortion (according to a given measure), under transmission power constraints, attainable by encoding and decoding functions, with stringent limits on delay and complexity. On the other hand, the Decision Theory approach seeks to determine the optimal coding/decoding strategies or some of their structural properties. Since encoder(s) and decoder(s) possess different information, though sharing a common goal, the setting here is that of Team Decision Theory. A more pragmatic vision rooted in Signal Processing consists of fixing the form of the coding strategies (e.g., to linear functions) and, consequently, finding the corresponding optimal decoding strategies and the achievable distortion, generally by applying parametric optimization techniques. All approaches have a long history of past investigations and recent results. The goal of the present paper is to provide the taxonomy of the various formulations, a survey of the vast related literature, examples from the authors' own research, and some highlights on the inter-play of the different theories. PMID:25633597
Regulatory networks of non-coding RNAs in brown/beige adipogenesis
Xu, Shaohai; Chen, Peng; Sun, Lei
2015-01-01
BAT (brown adipose tissue) is specialized to burn fatty acids for heat generation and energy expenditure to defend against cold and obesity. Accumulating studies have demonstrated that manipulation of BAT activity through various strategies can regulate metabolic homoeostasis and lead to a healthy phenotype. Two classes of ncRNA (non-coding RNA), miRNA and lncRNA (long non-coding RNA), play crucial roles in gene regulation during tissue development and remodelling. In the present review, we summarize recent findings on regulatory role of distinct ncRNAs in brown/beige adipocytes, and discuss how these ncRNA regulatory networks contribute to brown/beige fat development, differentiation and function. We suggest that targeting ncRNAs could be an attractive approach to enhance BAT activity for protecting the body against obesity and its pathological consequences. PMID:26283634
Deep Neural Networks with Random Gaussian Weights: A Universal Classification Strategy?
NASA Astrophysics Data System (ADS)
Giryes, Raja; Sapiro, Guillermo; Bronstein, Alex M.
2016-07-01
Three important properties of a classification machinery are: (i) the system preserves the core information of the input data; (ii) the training examples convey information about unseen data; and (iii) the system is able to treat differently points from different classes. In this work we show that these fundamental properties are satisfied by the architecture of deep neural networks. We formally prove that these networks with random Gaussian weights perform a distance-preserving embedding of the data, with a special treatment for in-class and out-of-class data. Similar points at the input of the network are likely to have a similar output. The theoretical analysis of deep networks here presented exploits tools used in the compressed sensing and dictionary learning literature, thereby making a formal connection between these important topics. The derived results allow drawing conclusions on the metric learning properties of the network and their relation to its structure, as well as providing bounds on the required size of the training set such that the training examples would represent faithfully the unseen data. The results are validated with state-of-the-art trained networks.
Self-Organized Inference of Spatial Structure in Randomly Deployed Sensor Networks
NASA Astrophysics Data System (ADS)
George, Neena A.; Minai, Ali A.; Doboli, Simona
Randomly deployed wireless sensor networks are becoming increasingly viable for many applications. Such networks can comprise anywhere from a few hundred to thousands of sensor nodes, and these sizes are likely to grow with advancing technology, making scalability a primary concern. Each node in these sensor networks is a small unit with limited resources and localized sensing and communication. Thus, all global tasks must be accomplished through self-organized distributed algorithms, which also leads to improved scalability, robustness and flexibility. In this paper, we examine the use of distributed algorithms to infer the spatial structure of an extended environment monitored by a self-organizing sensor network. Based on its sensing, the network segments the environment into regions with distinct characteristics, thereby inferring a cognitive map of the environment. This, in turn, can be used to answer global queries about the environment efficiently and accurately. The main challenge to the network arises from the necessarily irregular spatial sampling and the need for totally distributed computation. We consider distributed machine learning techniques for segmentation and study the variation of segmentation quality with reconstruction at different node densities and in environments of varying complexity.
Mason, Michael; Light, John; Campbell, Leah; Keyser-Marcus, Lori; Crewe, Stephanie; Way, Thomas; Saunders, Heather; King, Laura; Zaharakis, Nikola M; McHenry, Chantal
2015-11-01
Close peer networks can affect adolescents' health behaviors by altering their social environments, and thus their risk for and protection against substance use involvement. We tested a 20 minute intervention named Peer Network Counseling that integrates motivational interviewing and peer network strategies with 119 urban adolescents who reported occasional or problem substance use. Adolescents presenting at primary care clinic were randomized to intervention or control conditions and followed for 6 months. Mixed-effect latent growth models were used to evaluate intervention effects on trajectories of alcohol and marijuana use, offers to use substances, and moderation models to test for interactions between intervention condition and peer network characteristics. A significant intervention effect was found for boys for offers to use alcohol from friends (p<.05), along with a trend significant effect for alcohol use (p<.08). Intervention was more effective in reducing marijuana use, vs. control, for participants with more peer social support (p<.001) and with more peer encouragement for prosocial behavior (school, clubs, sports, religious activities); however, intervention did not affect these network characteristics. Results provide support to continue this line of research to test brief interventions that activate protective peer network characteristics among at-risk adolescents, while also raising some interesting gender-based intervention questions for future research. PMID:26234955
Microphase-separated structures within randomly end-linked copolymer networks
NASA Astrophysics Data System (ADS)
Zeng, Di; Hayward, Ryan
Self-assembly within randomly cross-linked or end-linked copolymer networks provides a robust method to generate co-continuous nanometer-scale structures. Here, we investigate self-assembly within copolymer networks prepared by end linking of several different pairs of telechelic polymers in a common solvent. For sufficiently high levels of immiscibility between the constituent polymers, removal of solvent leads to microphase separation into disordered nanoscale structures. Using a variety of characterization methods, including transmission electron microscopy, small-angle X-ray scattering, differential scanning calorimetry, and dynamic mechanical analysis, we find that these networks exhibit co-continuous morphologies over a wide range of volume fraction of the two components, with a characteristic length scale that can be tuned by adjusting the molecular weight of the starting polymers.
Cooperative multi-user detection and ranging based on pseudo-random codes
NASA Astrophysics Data System (ADS)
Morhart, C.; Biebl, E. M.
2009-05-01
We present an improved approach for a Round Trip Time of Flight distance measurement system. The system is intended for the usage in a cooperative localisation system for automotive applications. Therefore, it is designed to address a large number of communication partners per measurement cycle. By using coded signals in a time divison multiple access order, we can detect a large number of pedestrian sensors with just one car sensor. We achieve this by using very short transmit bursts in combination with a real time correlation algorithm. Futhermore, the correlation approach offers real time data, concerning the time of arrival, that can serve as a trigger impulse for other comunication systems. The distance accuracy of the correlation result was further increased by adding a fourier interpolation filter. The system performance was checked with a prototype at 2.4 GHz. We reached a distance measurement accuracy of 12 cm at a range up to 450 m.
NASA Astrophysics Data System (ADS)
Yen, Chih-Ta; Huang, Jen-Fa; Chih, Ping-En
2014-08-01
We propose and experimentally demonstrated the two bands optical code-division multiple-access (OCDMA) network over bipolar Walsh-coded liquid-crystal modulators (LCMs) and driven by green light and red light lasers. Achieving system performance depends on the construction of a decoder that implements a true bipolar correlation using only unipolar signals and intensity detection for each band. We took advantage of the phase delay characteristics of LCMs to construct a prototype optical coder/decoder (codec). Matched and unmatched Walsh signature codes were evaluated to detect correlations among multiuser data in the access network. By using LCMs, a red and green laser light source was spectrally encoded and the summed light dots were complementary decoded. Favorable contrast on auto- and cross-correlations indicates that binary information symbols can be properly recovered using a balanced photodetector.
Spatiotemporal coding in the cortex: information flow-based learning in spiking neural networks.
Deco, G; Schürmann, B
1999-05-15
We introduce a learning paradigm for networks of integrate-and-fire spiking neurons that is based on an information-theoretic criterion. This criterion can be viewed as a first principle that demonstrates the experimentally observed fact that cortical neurons display synchronous firing for some stimuli and not for others. The principle can be regarded as the postulation of a nonparametric reconstruction method as optimization criteria for learning the required functional connectivity that justifies and explains synchronous firing for binding of features as a mechanism for spatiotemporal coding. This can be expressed in an information-theoretic way by maximizing the discrimination ability between different sensory inputs in minimal time. PMID:10226189
Slotted Aloha multiple access and error control coding for land mobile satellite networks
NASA Astrophysics Data System (ADS)
Lutz, Erich
1992-10-01
This paper considers a satellite network with data messages being transmitted by land mobile users according to slotted Aloha multiple access. The mobile communication links suffering from multipath fading and signal shadowing are modelled as Gilbert-Elliott channels. FEC block coding is used to correct transmission errors. The maximum achievable information throughput and the mean packet delay are derived from a combined analysis of the multiple access and FEC/ARQ protocol. The results show that the additional overhead necessary for FEC is outweighed by the benefit in throughput and delay. Finally, the capture effect and its consequences are discussed.
Martin, R.A.; Wilson, T.L.
1984-12-01
This manual supports the computer code EVENT84, which can predict explosion-induced gas-dynamic transients in flow networks. The code can model transients in any arbitrarily designated network of building rooms and ventilation systems. A lumped-parameter formulation is used. EVENT84 was designed to provide a safety analysis tool for he nuclear, chemical, and mining industries. It is particularly suitable for calculating the detailed effects of explosions in the far field using a parametric representation of the explosive event. The code input and a sample problem that illustrates its capabilities are provided.
NASA Technical Reports Server (NTRS)
Schallhorn, Paul; Majumdar, Alok
2012-01-01
This paper describes a finite volume based numerical algorithm that allows multi-dimensional computation of fluid flow within a system level network flow analysis. There are several thermo-fluid engineering problems where higher fidelity solutions are needed that are not within the capacity of system level codes. The proposed algorithm will allow NASA's Generalized Fluid System Simulation Program (GFSSP) to perform multi-dimensional flow calculation within the framework of GFSSP s typical system level flow network consisting of fluid nodes and branches. The paper presents several classical two-dimensional fluid dynamics problems that have been solved by GFSSP's multi-dimensional flow solver. The numerical solutions are compared with the analytical and benchmark solution of Poiseulle, Couette and flow in a driven cavity.
Blatti, Charles; Sinha, Saurabh
2016-01-01
Motivation: Analysis of co-expressed gene sets typically involves testing for enrichment of different annotations or ‘properties’ such as biological processes, pathways, transcription factor binding sites, etc., one property at a time. This common approach ignores any known relationships among the properties or the genes themselves. It is believed that known biological relationships among genes and their many properties may be exploited to more accurately reveal commonalities of a gene set. Previous work has sought to achieve this by building biological networks that combine multiple types of gene–gene or gene–property relationships, and performing network analysis to identify other genes and properties most relevant to a given gene set. Most existing network-based approaches for recognizing genes or annotations relevant to a given gene set collapse information about different properties to simplify (homogenize) the networks. Results: We present a network-based method for ranking genes or properties related to a given gene set. Such related genes or properties are identified from among the nodes of a large, heterogeneous network of biological information. Our method involves a random walk with restarts, performed on an initial network with multiple node and edge types that preserve more of the original, specific property information than current methods that operate on homogeneous networks. In this first stage of our algorithm, we find the properties that are the most relevant to the given gene set and extract a subnetwork of the original network, comprising only these relevant properties. We then re-rank genes by their similarity to the given gene set, based on a second random walk with restarts, performed on the above subnetwork. We demonstrate the effectiveness of this algorithm for ranking genes related to Drosophila embryonic development and aggressive responses in the brains of social animals. Availability and Implementation: DRaWR was implemented as
A large-scale study of the random variability of a coding sequence: a study on the CFTR gene.
Modiano, Guido; Bombieri, Cristina; Ciminelli, Bianca Maria; Belpinati, Francesca; Giorgi, Silvia; Georges, Marie des; Scotet, Virginie; Pompei, Fiorenza; Ciccacci, Cinzia; Guittard, Caroline; Audrézet, Marie Pierre; Begnini, Angela; Toepfer, Michael; Macek, Milan; Ferec, Claude; Claustres, Mireille; Pignatti, Pier Franco
2005-02-01
Coding single nucleotide substitutions (cSNSs) have been studied on hundreds of genes using small samples (n(g) approximately 100-150 genes). In the present investigation, a large random European population sample (average n(g) approximately 1500) was studied for a single gene, the CFTR (Cystic Fibrosis Transmembrane conductance Regulator). The nonsynonymous (NS) substitutions exhibited, in accordance with previous reports, a mean probability of being polymorphic (q > 0.005), much lower than that of the synonymous (S) substitutions, but they showed a similar rate of subpolymorphic (q < 0.005) variability. This indicates that, in autosomal genes that may have harmful recessive alleles (nonduplicated genes with important functions), genetic drift overwhelms selection in the subpolymorphic range of variability, making disadvantageous alleles behave as neutral. These results imply that the majority of the subpolymorphic nonsynonymous alleles of these genes are selectively negative or even pathogenic. PMID:15536480
Kroeger, P.G.; Kennett, R.J.; Colman, J.; Ginsberg, T. )
1991-10-01
This report documents the THATCH code, which can be used to model general thermal and flow networks of solids and coolant channels in two-dimensional r-z geometries. The main application of THATCH is to model reactor thermo-hydraulic transients in High-Temperature Gas-Cooled Reactors (HTGRs). The available modules simulate pressurized or depressurized core heatup transients, heat transfer to general exterior sinks or to specific passive Reactor Cavity Cooling Systems, which can be air or water-cooled. Graphite oxidation during air or water ingress can be modelled, including the effects of added combustion products to the gas flow and the additional chemical energy release. A point kinetics model is available for analyzing reactivity excursions; for instance due to water ingress, and also for hypothetical no-scram scenarios. For most HTGR transients, which generally range over hours, a user-selected nodalization of the core in r-z geometry is used. However, a separate model of heat transfer in the symmetry element of each fuel element is also available for very rapid transients. This model can be applied coupled to the traditional coarser r-z nodalization. This report described the mathematical models used in the code and the method of solution. It describes the code and its various sub-elements. Details of the input data and file usage, with file formats, is given for the code, as well as for several preprocessing and postprocessing options. The THATCH model of the currently applicable 350 MW{sub th} reactor is described. Input data for four sample cases are given with output available in fiche form. Installation requirements and code limitations, as well as the most common error indications are listed. 31 refs., 23 figs., 32 tabs.
NASA Astrophysics Data System (ADS)
Zhang, Chongfu; Qiu, Kun; Xu, Bo; Ling, Yun
2008-05-01
This paper proposes an all-optical label processing scheme that uses the multiple optical orthogonal codes sequences (MOOCS)-based optical label for optical packet switching (OPS) (MOOCS-OPS) networks. In this scheme, each MOOCS is a permutation or combination of the multiple optical orthogonal codes (MOOC) selected from the multiple-groups optical orthogonal codes (MGOOC). Following a comparison of different optical label processing (OLP) schemes, the principles of MOOCS-OPS network are given and analyzed. Firstly, theoretical analyses are used to prove that MOOCS is able to greatly enlarge the number of available optical labels when compared to the previous single optical orthogonal code (SOOC) for OPS (SOOC-OPS) network. Then, the key units of the MOOCS-based optical label packets, including optical packet generation, optical label erasing, optical label extraction and optical label rewriting etc., are given and studied. These results are used to verify that the proposed MOOCS-OPS scheme is feasible.
NASA Astrophysics Data System (ADS)
Satoh, Kazuhiro
1989-08-01
Numerical studies are made out the behavior of a random neural network in which each neuron is coupled to a certain number of randomly chosen neurons. Such a random-net serves as a simple model for an elemental sub-network of the cortex. Neurons are regarded as binary decision elements, and they synchronously update their values in discrete time steps according to a deterministic equation (the McCulloch-Pitts model). It is found that each random-net containing one hundred neurons has only a few kinds of characteristic modes of excitation. Periods of these modes are usually less than ten steps when the number of connections per neuron is two to five. For the random-net containing one thousand neurons, an excited mode is practically aperiodic. When the refractory period is introduced, however, a nearly periodic oscillation takes place in the activity of the network.
NASA Astrophysics Data System (ADS)
Mense, Mario; Schindelhauer, Christian
We introduce the Read-Write-Coding-System (RWC) - a very flexible class of linear block codes that generate efficient and flexible erasure codes for storage networks. In particular, given a message x of k symbols and a codeword y of n symbols, an RW code defines additional parameters k ≤ r,w ≤ n that offer enhanced possibilities to adjust the fault-tolerance capability of the code. More precisely, an RWC provides linear left(n,k,dright)-codes that have (a) minimum distance d = n - r + 1 for any two codewords, and (b) for each codeword there exists a codeword for each other message with distance of at most w. Furthermore, depending on the values r,w and the code alphabet, different block codes such as parity codes (e.g. RAID 4/5) or Reed-Solomon (RS) codes (if r = k and thus, w = n) can be generated. In storage networks in which I/O accesses are very costly and redundancy is crucial, this flexibility has considerable advantages as r and w can optimally be adapted to read or write intensive applications; only w symbols must be updated if the message x changes completely, what is different from other codes which always need to rewrite y completely as x changes. In this paper, we first state a tight lower bound and basic conditions for all RW codes. Furthermore, we introduce special RW codes in which all mentioned parameters are adjustable even online, that is, those RW codes are adaptive to changing demands. At last, we point out some useful properties regarding safety and security of the stored data.
NASA Astrophysics Data System (ADS)
Ortiz-Rodríguez, J. M.; Reyes Alfaro, A.; Reyes Haro, A.; Solís Sánches, L. O.; Miranda, R. Castañeda; Cervantes Viramontes, J. M.; Vega-Carrillo, H. R.
2013-07-01
In this work a neutron spectrum unfolding code, based on artificial intelligence technology is presented. The code called "Neutron Spectrometry and Dosimetry with Artificial Neural Networks and two Bonner spheres", (NSDann2BS), was designed in a graphical user interface under the LabVIEW programming environment. The main features of this code are to use an embedded artificial neural network architecture optimized with the "Robust design of artificial neural networks methodology" and to use two Bonner spheres as the only piece of information. In order to build the code here presented, once the net topology was optimized and properly trained, knowledge stored at synaptic weights was extracted and using a graphical framework build on the LabVIEW programming environment, the NSDann2BS code was designed. This code is friendly, intuitive and easy to use for the end user. The code is freely available upon request to authors. To demonstrate the use of the neural net embedded in the NSDann2BS code, the rate counts of 252Cf, 241AmBe and 239PuBe neutron sources measured with a Bonner spheres system.
Ortiz-Rodriguez, J. M.; Reyes Alfaro, A.; Reyes Haro, A.; Solis Sanches, L. O.; Miranda, R. Castaneda; Cervantes Viramontes, J. M.; Vega-Carrillo, H. R.
2013-07-03
In this work a neutron spectrum unfolding code, based on artificial intelligence technology is presented. The code called ''Neutron Spectrometry and Dosimetry with Artificial Neural Networks and two Bonner spheres'', (NSDann2BS), was designed in a graphical user interface under the LabVIEW programming environment. The main features of this code are to use an embedded artificial neural network architecture optimized with the ''Robust design of artificial neural networks methodology'' and to use two Bonner spheres as the only piece of information. In order to build the code here presented, once the net topology was optimized and properly trained, knowledge stored at synaptic weights was extracted and using a graphical framework build on the LabVIEW programming environment, the NSDann2BS code was designed. This code is friendly, intuitive and easy to use for the end user. The code is freely available upon request to authors. To demonstrate the use of the neural net embedded in the NSDann2BS code, the rate counts of {sup 252}Cf, {sup 241}AmBe and {sup 239}PuBe neutron sources measured with a Bonner spheres system.
NASA Astrophysics Data System (ADS)
Vibert, Jean-Francois; Kosmidis, Efstratios K.
2003-05-01
The mechanisms involved in respiratory rhythm and in its persistence along lifetime have not been completely elucidated yet. The debate if they rely on pacemaker units or on the emerging properties of neural networks is still on. We propose a simple model taking advantage of the synaptic noise and allowing to bridge network and pacemaker theories. The pBC (reticular preBotzinger Complex) and PC (pneumotaxic center) are two randomly and sparsely connected excitatory networks. pBC excites PC that in turn, strongly inhibits pBC. As a part of the reticular formation, the pBC, receives many uncorrelated inputs (noise). The model reproduces most of the experimental observations. Once started, the pBC, whose activity is started by synaptic noise, increase of activity is an emerging property of the excitatory network. This activates the PC that in turn inhibits the pBC and starts the expiration. If, for any reason, noise becomes too low, the network becomes silent, and pacemakers become the only active units able to restart a new inspiration. Safety measures of this kind are very much expected in the operation of a system as vital as respiration. Simulations using an enhanced biologically plausible model of neurons fully support the proposed model.
Effects of community structure on the dynamics of random threshold networks
NASA Astrophysics Data System (ADS)
Wang, Rui-Sheng; Albert, Réka
2013-01-01
Random threshold networks (RTNs) have been widely used as models of neural or genetic regulatory networks. Network topology plays a central role in the dynamics of these networks. Recently it has been shown that many social and biological networks are scale-free and also exhibit community structure, in which autonomous modules are wired together to perform relatively independent functions. In this study we use both synchronous and asynchronous models of RTNs to systematically investigate how community structure affects the dynamics of RTNs with scale-free topology. Extensive simulation experiments show that RTNs with high modularity have more attractors than those RTNs with low modularity, and RTNs with smaller communities tend to have more attractors. Damage resulting from perturbation of initial conditions spreads less effectively in RTNs with higher modularity and RTNs with smaller communities. In addition, RTNs with high modularity can coordinate their internal dynamics better than RTNs with low modularity under the synchronous update scheme, and it is the other way around under the asynchronous update. This study shows that community structure has a strong effect on the dynamics of RTNs.
Kim, Youngbok; Jeon, Sie-Wook; Kwon, Won-Bae; Park, Chang-Soo
2012-01-01
We propose and demonstrate a fiber Bragg grating (FBG) sensor network employing the code division multiple access (CDMA) technique to identify information from individual sensors. To detect information without considering time delays between sensors, a sliding correlation method is applied, in which two different signals with the same pseudo-random binary sequence (PRBS) pattern, but slightly different frequencies, are applied to the source and detector sides. Moreover, for time domain detection, a wavelength-to-time conversion technique using a wavelength dispersive medium is introduced. The experimental results show that the proposed sensor network has a wide strain dynamic range of 2,400 με and a low crosstalk of 950:1. PMID:22778619
Kim, Youngbok; Jeon, Sie-Wook; Kwon, Won-Bae; Park, Chang-Soo
2012-01-01
We propose and demonstrate a fiber Bragg grating (FBG) sensor network employing the code division multiple access (CDMA) technique to identify information from individual sensors. To detect information without considering time delays between sensors, a sliding correlation method is applied, in which two different signals with the same pseudo-random binary sequence (PRBS) pattern, but slightly different frequencies, are applied to the source and detector sides. Moreover, for time domain detection, a wavelength-to-time conversion technique using a wavelength dispersive medium is introduced. The experimental results show that the proposed sensor network has a wide strain dynamic range of 2,400 με and a low crosstalk of 950:1. PMID:22778619
Faghih, Mohammad Mehdi; Moghaddam, Mohsen Ebrahimi
2011-01-01
Although much research in the area of Wireless Multimedia Sensor Networks (WMSNs) has been done in recent years, the programming of sensor nodes is still time-consuming and tedious. It requires expertise in low-level programming, mainly because of the use of resource constrained hardware and also the low level API provided by current operating systems. The code of the resulting systems has typically no clear separation between application and system logic. This minimizes the possibility of reusing code and often leads to the necessity of major changes when the underlying platform is changed. In this paper, we present a service oriented middleware named SOMM to support application development for WMSNs. The main goal of SOMM is to enable the development of modifiable and scalable WMSN applications. A network which uses the SOMM is capable of providing multiple services to multiple clients at the same time with the specified Quality of Service (QoS). SOMM uses a virtual machine with the ability to support mobile agents. Services in SOMM are provided by mobile agents and SOMM also provides a t space on each node which agents can use to communicate with each other. PMID:22346646
Faghih, Mohammad Mehdi; Moghaddam, Mohsen Ebrahimi
2011-01-01
Although much research in the area of Wireless Multimedia Sensor Networks (WMSNs) has been done in recent years, the programming of sensor nodes is still time-consuming and tedious. It requires expertise in low-level programming, mainly because of the use of resource constrained hardware and also the low level API provided by current operating systems. The code of the resulting systems has typically no clear separation between application and system logic. This minimizes the possibility of reusing code and often leads to the necessity of major changes when the underlying platform is changed. In this paper, we present a service oriented middleware named SOMM to support application development for WMSNs. The main goal of SOMM is to enable the development of modifiable and scalable WMSN applications. A network which uses the SOMM is capable of providing multiple services to multiple clients at the same time with the specified Quality of Service (QoS). SOMM uses a virtual machine with the ability to support mobile agents. Services in SOMM are provided by mobile agents and SOMM also provides a t space on each node which agents can use to communicate with each other. PMID:22346646
Comprehensive Reconstruction and Visualization of Non-Coding Regulatory Networks in Human
Bonnici, Vincenzo; Russo, Francesco; Bombieri, Nicola; Pulvirenti, Alfredo; Giugno, Rosalba
2014-01-01
Research attention has been powered to understand the functional roles of non-coding RNAs (ncRNAs). Many studies have demonstrated their deregulation in cancer and other human disorders. ncRNAs are also present in extracellular human body fluids such as serum and plasma, giving them a great potential as non-invasive biomarkers. However, non-coding RNAs have been relatively recently discovered and a comprehensive database including all of them is still missing. Reconstructing and visualizing the network of ncRNAs interactions are important steps to understand their regulatory mechanism in complex systems. This work presents ncRNA-DB, a NoSQL database that integrates ncRNAs data interactions from a large number of well established on-line repositories. The interactions involve RNA, DNA, proteins, and diseases. ncRNA-DB is available at http://ncrnadb.scienze.univr.it/ncrnadb/. It is equipped with three interfaces: web based, command-line, and a Cytoscape app called ncINetView. By accessing only one resource, users can search for ncRNAs and their interactions, build a network annotated with all known ncRNAs and associated diseases, and use all visual and mining features available in Cytoscape. PMID:25540777
Comprehensive reconstruction and visualization of non-coding regulatory networks in human.
Bonnici, Vincenzo; Russo, Francesco; Bombieri, Nicola; Pulvirenti, Alfredo; Giugno, Rosalba
2014-01-01
Research attention has been powered to understand the functional roles of non-coding RNAs (ncRNAs). Many studies have demonstrated their deregulation in cancer and other human disorders. ncRNAs are also present in extracellular human body fluids such as serum and plasma, giving them a great potential as non-invasive biomarkers. However, non-coding RNAs have been relatively recently discovered and a comprehensive database including all of them is still missing. Reconstructing and visualizing the network of ncRNAs interactions are important steps to understand their regulatory mechanism in complex systems. This work presents ncRNA-DB, a NoSQL database that integrates ncRNAs data interactions from a large number of well established on-line repositories. The interactions involve RNA, DNA, proteins, and diseases. ncRNA-DB is available at http://ncrnadb.scienze.univr.it/ncrnadb/. It is equipped with three interfaces: web based, command-line, and a Cytoscape app called ncINetView. By accessing only one resource, users can search for ncRNAs and their interactions, build a network annotated with all known ncRNAs and associated diseases, and use all visual and mining features available in Cytoscape. PMID:25540777
Improved Neural Networks with Random Weights for Short-Term Load Forecasting
Lang, Kun; Zhang, Mingyuan; Yuan, Yongbo
2015-01-01
An effective forecasting model for short-term load plays a significant role in promoting the management efficiency of an electric power system. This paper proposes a new forecasting model based on the improved neural networks with random weights (INNRW). The key is to introduce a weighting technique to the inputs of the model and use a novel neural network to forecast the daily maximum load. Eight factors are selected as the inputs. A mutual information weighting algorithm is then used to allocate different weights to the inputs. The neural networks with random weights and kernels (KNNRW) is applied to approximate the nonlinear function between the selected inputs and the daily maximum load due to the fast learning speed and good generalization performance. In the application of the daily load in Dalian, the result of the proposed INNRW is compared with several previously developed forecasting models. The simulation experiment shows that the proposed model performs the best overall in short-term load forecasting. PMID:26629825
Improved Neural Networks with Random Weights for Short-Term Load Forecasting.
Lang, Kun; Zhang, Mingyuan; Yuan, Yongbo
2015-01-01
An effective forecasting model for short-term load plays a significant role in promoting the management efficiency of an electric power system. This paper proposes a new forecasting model based on the improved neural networks with random weights (INNRW). The key is to introduce a weighting technique to the inputs of the model and use a novel neural network to forecast the daily maximum load. Eight factors are selected as the inputs. A mutual information weighting algorithm is then used to allocate different weights to the inputs. The neural networks with random weights and kernels (KNNRW) is applied to approximate the nonlinear function between the selected inputs and the daily maximum load due to the fast learning speed and good generalization performance. In the application of the daily load in Dalian, the result of the proposed INNRW is compared with several previously developed forecasting models. The simulation experiment shows that the proposed model performs the best overall in short-term load forecasting. PMID:26629825
Ilday, Serim; Ilday, F Ömer; Hübner, René; Prosa, Ty J; Martin, Isabelle; Nogay, Gizem; Kabacelik, Ismail; Mics, Zoltan; Bonn, Mischa; Turchinovich, Dmitry; Toffoli, Hande; Toffoli, Daniele; Friedrich, David; Schmidt, Bernd; Heinig, Karl-Heinz; Turan, Rasit
2016-03-01
Multiscale self-assembly is ubiquitous in nature but its deliberate use to synthesize multifunctional three-dimensional materials remains rare, partly due to the notoriously difficult problem of controlling topology from atomic to macroscopic scales to obtain intended material properties. Here, we propose a simple, modular, noncolloidal methodology that is based on exploiting universality in stochastic growth dynamics and driving the growth process under far-from-equilibrium conditions toward a preplanned structure. As proof of principle, we demonstrate a confined-but-connected solid structure, comprising an anisotropic random network of silicon quantum-dots that hierarchically self-assembles from the atomic to the microscopic scales. First, quantum-dots form to subsequently interconnect without inflating their diameters to form a random network, and this network then grows in a preferential direction to form undulated and branching nanowire-like structures. This specific topology simultaneously achieves two scale-dependent features, which were previously thought to be mutually exclusive: good electrical conduction on the microscale and a bandgap tunable over a range of energies on the nanoscale. PMID:26865561
Optimal power allocation and joint source-channel coding for wireless DS-CDMA visual sensor networks
NASA Astrophysics Data System (ADS)
Pandremmenou, Katerina; Kondi, Lisimachos P.; Parsopoulos, Konstantinos E.
2011-01-01
In this paper, we propose a scheme for the optimal allocation of power, source coding rate, and channel coding rate for each of the nodes of a wireless Direct Sequence Code Division Multiple Access (DS-CDMA) visual sensor network. The optimization is quality-driven, i.e. the received quality of the video that is transmitted by the nodes is optimized. The scheme takes into account the fact that the sensor nodes may be imaging scenes with varying levels of motion. Nodes that image low-motion scenes will require a lower source coding rate, so they will be able to allocate a greater portion of the total available bit rate to channel coding. Stronger channel coding will mean that such nodes will be able to transmit at lower power. This will both increase battery life and reduce interference to other nodes. Two optimization criteria are considered. One that minimizes the average video distortion of the nodes and one that minimizes the maximum distortion among the nodes. The transmission powers are allowed to take continuous values, whereas the source and channel coding rates can assume only discrete values. Thus, the resulting optimization problem lies in the field of mixed-integer optimization tasks and is solved using Particle Swarm Optimization. Our experimental results show the importance of considering the characteristics of the video sequences when determining the transmission power, source coding rate and channel coding rate for the nodes of the visual sensor network.
Lepage, E.; Tavernier, H.; Bouhaddou, O.; Jais, JP.; Gisselbrecht, C.; Aurengo, A.; Boiron, M.
1989-01-01
The usual Randomized Clinical Trials (RCT) management using an anachronic procedure involving a flowsheet exchange between the remote centers and the coordinating center presents a number of inadequacies. Eligibility criteria are not always verified by the coordinating center before inclusion in the trial and randomization. Laboratory tests and therapeutic adjustments are frequently decided from memory by the clinician which often leads to data oversight and variability of therapeutic decisions. This results in protocol deviations and alteration of the efficiency of the RCT. HICREN is a medical consultation system designed to take into account the different difficulties encountered during RCT driving. The system integrates a clinical database with artificial intelligence technics to manage clinical trial data on non-expensive and widely available Minitel® terminals. Randomization is then possible, after eligibility criteria are satisfied, anytime and anywhere in France through the national telematic network. HICREN also includes an intuitive graphic interface to increase physician's compliance: a user friendly dialogue manager supports on line data entry with multi-windowing facilities and pull down menus. Interactive data validation is achieved through an interface to dedicated C programs. Patient follow up is achieved by an expert system that proposes appropriate dose of treatment according to the rules defined in the trial. At present, HICREN is implemented on the CISARC system for conducting three randomized clinical trials and one epidemiologic study.
A design-by-treatment interaction model for network meta-analysis with random inconsistency effects
Jackson, Dan; Barrett, Jessica K; Rice, Stephen; White, Ian R; Higgins, Julian PT
2014-01-01
Network meta-analysis is becoming more popular as a way to analyse multiple treatments simultaneously and, in the right circumstances, rank treatments. A difficulty in practice is the possibility of ‘inconsistency’ or ‘incoherence’, where direct evidence and indirect evidence are not in agreement. Here, we develop a random-effects implementation of the recently proposed design-by-treatment interaction model, using these random effects to model inconsistency and estimate the parameters of primary interest. Our proposal is a generalisation of the model proposed by Lumley and allows trials with three or more arms to be included in the analysis. Our methods also facilitate the ranking of treatments under inconsistency. We derive R and I2 statistics to quantify the impact of the between-study heterogeneity and the inconsistency. We apply our model to two examples. © 2014 The Authors. Statistics in Medicine published by John Wiley & Sons, Ltd. PMID:24777711
NASA Astrophysics Data System (ADS)
Kumar, A.; Ovchinnikov, O.; Guo, S.; Griggio, F.; Jesse, S.; Trolier-McKinstry, S.; Kalinin, S. V.
2011-07-01
The spatial variability of the polarization dynamics in thin film ferroelectric capacitors was probed by recognition analysis of spatially resolved spectroscopic data. Switching spectroscopy piezoresponse force microscopy (SSPFM) was used to measure local hysteresis loops and map them on a two dimensional (2D) random-bond, random-field Ising model. A neural-network based recognition approach was utilized to analyze the hysteresis loops and their spatial variability. Strong variability is observed in the polarization dynamics around macroscopic cracks because of the modified local-elastic and electric-boundary conditions, with the most pronounced effect on the length scale of ˜100 nm away from the crack. The recognition approach developed here is universal and can potentially be applied for arbitrary macroscopic and spatially resolved data, including temperature- and field-dependent hysteresis, I-V curve mapping, electron microscopy electron energy loss spectroscopy (EELS) imaging, and many others.
Lefebvre, A; Saliou, P; Lucet, J C; Mimoz, O; Keita-Perse, O; Grandbastien, B; Bruyère, F; Boisrenoult, P; Lepelletier, D; Aho-Glélé, L S
2015-10-01
Preoperative hair removal has been used to prevent surgical site infections (SSIs) or to prevent hair from interfering with the incision site. We aimed to update the meta-analysis of published randomized controlled trials about hair removal for the prevention of SSIs, and conduct network meta-analyses to combine direct and indirect evidence and to compare chemical depilation with clipping. The PubMed, ScienceDirect and Cochrane databases were searched for randomized controlled trials analysing different hair removal techniques and no hair removal in similar groups. Paired and network meta-analyses were conducted. Two readers independently assessed the study limitations for each selected article according to the Grading of Recommendations Assessment, Development and Evaluation (GRADE) method. Nineteen studies met the inclusion criteria. No study compared clipping with chemical depilation. Network meta-analyses with shaving as the reference showed significantly fewer SSIs with clipping, chemical depilation, or no depilation [relative risk 0.55, 95% confidence interval 0.38-0.79; 0.60, 0.36-0.97; and 0.56, 0.34-0.96, respectively]. No significant difference was observed between the absence of depilation and chemical depilation or clipping (1.05, 0.55-2.00; 0.97, 0.51-1.82, respectively] or between chemical depilation and clipping (1.09, 0.59-2.01). This meta-analysis of 19 randomized controlled trials confirmed the absence of any benefit of depilation to prevent surgical site infection, and the higher risk of surgical site infection when shaving is used for depilation. Chemical depilation and clipping were compared for the first time. The risk of SSI seems to be similar with both methods. PMID:26320612
Distributed control of cluster synchronisation in networks with randomly occurring non-linearities
NASA Astrophysics Data System (ADS)
Hu, Aihua; Cao, Jinde; Hu, Manfeng; Guo, Liuxiao
2016-08-01
This paper is concerned with the issue of mean square cluster synchronisation in complex networks, which consist of non-identical nodes with randomly occurring non-linearities. In order to guarantee synchronisation, distributed controllers depending on the information from the neighbours in the same cluster are applied to each node, meanwhile, the control gains are supposed to be updated according to the given laws. Based on the Lyapunov stability theory, the sufficient synchronisation conditions are derived and proved theoretically. Finally, a numerical example is presented to demonstrate the effectiveness of the results.
Power-law exponent of the Bouchaud-Mézard model on regular random networks
NASA Astrophysics Data System (ADS)
Ichinomiya, Takashi
2013-07-01
We study the Bouchaud-Mézard model on a regular random network. By assuming adiabaticity and independency, and utilizing the generalized central limit theorem and the Tauberian theorem, we derive an equation that determines the exponent of the probability distribution function of the wealth as x→∞. The analysis shows that the exponent can be smaller than 2, while a mean-field analysis always gives the exponent as being larger than 2. The results of our analysis are shown to be in good agreement with those of the numerical simulations.
NASA Astrophysics Data System (ADS)
Hamaneh, Mehdi Bagheri; Haber, Jonah; Yu, Yi-Kuo
2015-11-01
A general model for random walks (RWs) on networks is proposed. It incorporates damping and time-dependent links, and it includes standard (undamped, noninteracting) RWs (SRWs), coalescing RWs, and coalescing-branching RWs as special cases. The exact, time-dependent solutions for the average numbers of visits (w ) to nodes and their fluctuations (σ2) are given, and the long-term σ -w relation is studied. Although σ ∝w1 /2 for SRWs, this power law can be fragile when coalescing-branching interaction is present. Damping, however, often strengthens it but with an exponent generally different from 1 /2 .
ERIC Educational Resources Information Center
German, D.; Sutcliffe, C. G.; Sirirojn, B.; Sherman, S. G.; Latkin, C. A.; Aramrattana, A.; Celentano, D. D.
2012-01-01
We examined the effect on depressive symptoms of a peer network-oriented intervention effective in reducing sexual risk behavior and methamphetamine (MA) use. Current Thai MA users aged 18-25 years and their drug and/or sex network members enrolled in a randomized controlled trial with 4 follow-ups over 12 months. A total of 415 index participants…
Aurela, B; Ketoja, J A
2002-01-01
Predictive migration models for polymers are already so well established that the European Commission intends to allow the use of the models as one quality assurance tool in product safety assessment of plastic materials and articles for food contact. The inhomogeneity of fibre-based materials makes modelling difficult--thus, little research has been done in this area. The authors compare experiments on the diffusion of certain volatile compounds through laboratory kraft pulp sheets with computer simulations in which the fibre network structure is modelled explicitly. The major advantage of the present random walk simulation is that it gives an estimate of the effective diffusion constant for the fibre network. For most compounds, the agreement between the experiments and simulations is good. The experiments and simulations indicate that gas diffusion rate is very sensitive to sheet porosity. PMID:11962715
Scaling of Directed Dynamical Small-World Networks with Random Responses
NASA Astrophysics Data System (ADS)
Zhu, Chen-Ping; Xiong, Shi-Jie; Tian, Ying-Jie; Li, Nan; Jiang, Ke-Sheng
2004-05-01
A dynamical model of small-world networks, with directed links which describe various correlations in social and natural phenomena, is presented. Random responses of sites to the input message are introduced to simulate real systems. The interplay of these ingredients results in the collective dynamical evolution of a spinlike variable S(t) of the whole network. The global average spreading length
NASA Astrophysics Data System (ADS)
Burioni, Raffaella; di Santo, Serena; di Volo, Matteo; Vezzani, Alessandro
2014-10-01
Self-organized quasiperiodicity is one of the most puzzling dynamical phases observed in systems of nonlinear coupled oscillators. The single dynamical units are not locked to the periodic mean field they produce, but they still feature a coherent behavior, through an unexplained complex form of correlation. We consider a class of leaky integrate-and-fire oscillators on random sparse and massive networks with dynamical synapses, featuring self-organized quasiperiodicity, and we show how complex collective oscillations arise from constructive interference of microscopic dynamics. In particular, we find a simple quantitative relationship between two relevant microscopic dynamical time scales and the macroscopic time scale of the global signal. We show that the proposed relation is a general property of collective oscillations, common to all the partially synchronous dynamical phases analyzed. We argue that an analogous mechanism could be at the origin of similar network dynamics.
Non-universal anomalous diffusion and adsorption in asymmetric random walks on hierarchical networks
NASA Astrophysics Data System (ADS)
Ball, Lauren; Farris, Alfred; Boettcher, Stefan
2014-03-01
We study an asymmetric random walk on a network consisting of a one-dimensional line and hierarchy of small-world links, called the Hanoi network.[2] Walkers are biased along the one-dimensional line, and move in the opposite direction only along the long-range links with a probability p. We study the mean-square displacement
Aceves, S M; Flowers, D L; Chen, J; Babaimopoulos, A
2006-08-29
We have developed an artificial neural network (ANN) based combustion model and have integrated it into a fluid mechanics code (KIVA3V) to produce a new analysis tool (titled KIVA3V-ANN) that can yield accurate HCCI predictions at very low computational cost. The neural network predicts ignition delay as a function of operating parameters (temperature, pressure, equivalence ratio and residual gas fraction). KIVA3V-ANN keeps track of the time history of the ignition delay during the engine cycle to evaluate the ignition integral and predict ignition for each computational cell. After a cell ignites, chemistry becomes active, and a two-step chemical kinetic mechanism predicts composition and heat generation in the ignited cells. KIVA3V-ANN has been validated by comparison with isooctane HCCI experiments in two different engines. The neural network provides reasonable predictions for HCCI combustion and emissions that, although typically not as good as obtained with the more physically representative multi-zone model, are obtained at a much reduced computational cost. KIVA3V-ANN can perform reasonably accurate HCCI calculations while requiring only 10% more computational effort than a motored KIVA3V run. It is therefore considered a valuable tool for evaluation of engine maps or other performance analysis tasks requiring multiple individual runs.
NASA Astrophysics Data System (ADS)
Guimarães, Paulo R., Jr.; de Aguiar, Marcus A. M.; Bascompte, Jordi; Jordano, Pedro; Dos Reis, Sérgio Furtado
2005-03-01
Barabasi-Albert networks are constructed by adding nodes via preferential attachment to an initial core of nodes. We study the topology of small scale-free networks as a function of the size and average connectivity of their initial random core. We show that these two parameters may strongly affect the tail of the degree distribution, by consistently leading to broad-scale or single-scale networks. In particular, we argue that the size of the initial network core and its density of connections may be the main responsible for the exponential truncation of the power-law behavior observed in some small scale-free networks.
Active transport on disordered microtubule networks: The generalized random velocity model
NASA Astrophysics Data System (ADS)
Kahana, Aviv; Kenan, Gilad; Feingold, Mario; Elbaum, Michael; Granek, Rony
2008-11-01
The motion of small cargo particles on microtubules by means of motor proteins in disordered microtubule networks is investigated theoretically using both analytical tools and computer simulations. Different network topologies in two and three dimensions are considered, one of which has been recently studied experimentally by Salman [Biophys. J. 89, 2134 (2005)]. A generalization of the random velocity model is used to derive the mean-square displacement of the cargo particle. We find that all cases belong to the class of anomalous superdiffusion, which is sensitive mainly to the dimensionality of the network and only marginally to its topology. Yet in three dimensions the motion is very close to simple diffusion, with sublogarithmic corrections that depend on the network topology. When details of the thermal diffusion in the bulk solution are included, no significant change to the asymptotic time behavior is found. However, a small asymmetry in the mean microtubule polarity affects the corresponding long-time behavior. We also study a three-dimensional model of the microtubule network in living animal cells. Three first-passage-time problems of intracellular transport are simulated and analyzed for different motor processivities: (i) cargo that originates near the nucleus and has to reach the membrane, (ii) cargo that originates from the membrane and has to reach the nucleus, and (iii) cargo that leaves the nucleus and has to reach a specific target in the cytoplasm. We conclude that while a higher motor processivity increases the transport efficiency in cases (i) and (ii), in case (iii) it has the opposite effect. We conjecture that the balance between the different network tasks, as manifested in cases (i) and (ii) versus case (iii), may be the reason for the evolutionary choice of a finite motor processivity.
Scaling of flow distance in random self-similar channel networks
Troutman, B.M.
2005-01-01
Natural river channel networks have been shown in empirical studies to exhibit power-law scaling behavior characteristic of self-similar and self-affine structures. Of particular interest is to describe how the distribution of distance to the outlet changes as a function of network size. In this paper, networks are modeled as random self-similar rooted tree graphs and scaling of distance to the root is studied using methods in stochastic branching theory. In particular, the asymptotic expectation of the width function (number of nodes as a function of distance to the outlet) is derived under conditions on the replacement generators. It is demonstrated further that the branching number describing rate of growth of node distance to the outlet is identical to the length ratio under a Horton-Strahler ordering scheme as order gets large, again under certain restrictions on the generators. These results are discussed in relation to drainage basin allometry and an application to an actual drainage network is presented. ?? World Scientific Publishing Company.
Ambient awareness: From random noise to digital closeness in online social networks
Levordashka, Ana; Utz, Sonja
2016-01-01
Ambient awareness refers to the awareness social media users develop of their online network in result of being constantly exposed to social information, such as microblogging updates. Although each individual bit of information can seem like random noise, their incessant reception can amass to a coherent representation of social others. Despite its growing popularity and important implications for social media research, ambient awareness on public social media has not been studied empirically. We provide evidence for the occurrence of ambient awareness and examine key questions related to its content and functions. A diverse sample of participants reported experiencing awareness, both as a general feeling towards their network as a whole, and as knowledge of individual members of the network, whom they had not met in real life. Our results indicate that ambient awareness can develop peripherally, from fragmented information and in the relative absence of extensive one-to-one communication. We report the effects of demographics, media use, and network variables and discuss the implications of ambient awareness for relational and informational processes online. PMID:27375343
Cota, Wesley; Ferreira, Silvio C; Ódor, Géza
2016-03-01
We provide numerical evidence for slow dynamics of the susceptible-infected-susceptible model evolving on finite-size random networks with power-law degree distributions. Extensive simulations were done by averaging the activity density over many realizations of networks. We investigated the effects of outliers in both highly fluctuating (natural cutoff) and nonfluctuating (hard cutoff) most connected vertices. Logarithmic and power-law decays in time were found for natural and hard cutoffs, respectively. This happens in extended regions of the control parameter space λ(1)<λ<λ(2), suggesting Griffiths effects, induced by the topological inhomogeneities. Optimal fluctuation theory considering sample-to-sample fluctuations of the pseudothresholds is presented to explain the observed slow dynamics. A quasistationary analysis shows that response functions remain bounded at λ(2). We argue these to be signals of a smeared transition. However, in the thermodynamic limit the Griffiths effects loose their relevancy and have a conventional critical point at λ(c)=0. Since many real networks are composed by heterogeneous and weakly connected modules, the slow dynamics found in our analysis of independent and finite networks can play an important role for the deeper understanding of such systems. PMID:27078381
Path statistics, memory, and coarse-graining of continuous-time random walks on networks.
Manhart, Michael; Kion-Crosby, Willow; Morozov, Alexandre V
2015-12-01
Continuous-time random walks (CTRWs) on discrete state spaces, ranging from regular lattices to complex networks, are ubiquitous across physics, chemistry, and biology. Models with coarse-grained states (for example, those employed in studies of molecular kinetics) or spatial disorder can give rise to memory and non-exponential distributions of waiting times and first-passage statistics. However, existing methods for analyzing CTRWs on complex energy landscapes do not address these effects. Here we use statistical mechanics of the nonequilibrium path ensemble to characterize first-passage CTRWs on networks with arbitrary connectivity, energy landscape, and waiting time distributions. Our approach can be applied to calculating higher moments (beyond the mean) of path length, time, and action, as well as statistics of any conservative or non-conservative force along a path. For homogeneous networks, we derive exact relations between length and time moments, quantifying the validity of approximating a continuous-time process with its discrete-time projection. For more general models, we obtain recursion relations, reminiscent of transfer matrix and exact enumeration techniques, to efficiently calculate path statistics numerically. We have implemented our algorithm in PathMAN (Path Matrix Algorithm for Networks), a Python script that users can apply to their model of choice. We demonstrate the algorithm on a few representative examples which underscore the importance of non-exponential distributions, memory, and coarse-graining in CTRWs. PMID:26646868
Path statistics, memory, and coarse-graining of continuous-time random walks on networks
NASA Astrophysics Data System (ADS)
Manhart, Michael; Kion-Crosby, Willow; Morozov, Alexandre V.
2015-12-01
Continuous-time random walks (CTRWs) on discrete state spaces, ranging from regular lattices to complex networks, are ubiquitous across physics, chemistry, and biology. Models with coarse-grained states (for example, those employed in studies of molecular kinetics) or spatial disorder can give rise to memory and non-exponential distributions of waiting times and first-passage statistics. However, existing methods for analyzing CTRWs on complex energy landscapes do not address these effects. Here we use statistical mechanics of the nonequilibrium path ensemble to characterize first-passage CTRWs on networks with arbitrary connectivity, energy landscape, and waiting time distributions. Our approach can be applied to calculating higher moments (beyond the mean) of path length, time, and action, as well as statistics of any conservative or non-conservative force along a path. For homogeneous networks, we derive exact relations between length and time moments, quantifying the validity of approximating a continuous-time process with its discrete-time projection. For more general models, we obtain recursion relations, reminiscent of transfer matrix and exact enumeration techniques, to efficiently calculate path statistics numerically. We have implemented our algorithm in PathMAN (Path Matrix Algorithm for Networks), a Python script that users can apply to their model of choice. We demonstrate the algorithm on a few representative examples which underscore the importance of non-exponential distributions, memory, and coarse-graining in CTRWs.
RRW: repeated random walks on genome-scale protein networks for local cluster discovery
Macropol, Kathy; Can, Tolga; Singh, Ambuj K
2009-01-01
Background We propose an efficient and biologically sensitive algorithm based on repeated random walks (RRW) for discovering functional modules, e.g., complexes and pathways, within large-scale protein networks. Compared to existing cluster identification techniques, RRW implicitly makes use of network topology, edge weights, and long range interactions between proteins. Results We apply the proposed technique on a functional network of yeast genes and accurately identify statistically significant clusters of proteins. We validate the biological significance of the results using known complexes in the MIPS complex catalogue database and well-characterized biological processes. We find that 90% of the created clusters have the majority of their catalogued proteins belonging to the same MIPS complex, and about 80% have the majority of their proteins involved in the same biological process. We compare our method to various other clustering techniques, such as the Markov Clustering Algorithm (MCL), and find a significant improvement in the RRW clusters' precision and accuracy values. Conclusion RRW, which is a technique that exploits the topology of the network, is more precise and robust in finding local clusters. In addition, it has the added flexibility of being able to find multi-functional proteins by allowing overlapping clusters. PMID:19740439
Analysis of the traffic running cost under random route choice behavior in a network with two routes
NASA Astrophysics Data System (ADS)
Tang, Tie-Qiao; Yu, Qiang; Liu, Kai
2016-05-01
In this paper, a car-following model is used to study each driver's three running costs in a network with two routes under the random route choice behavior. The numerical results indicate that each driver's three running costs and the corresponding total cost are relevant to the gap of the time the driver enters the network. The results can help us to further explore each driver's trip cost in a more complex network under other route choice behavior.
Rolls, David A.; Wang, Peng; McBryde, Emma; Pattison, Philippa; Robins, Garry
2015-01-01
We compare two broad types of empirically grounded random network models in terms of their abilities to capture both network features and simulated Susceptible-Infected-Recovered (SIR) epidemic dynamics. The types of network models are exponential random graph models (ERGMs) and extensions of the configuration model. We use three kinds of empirical contact networks, chosen to provide both variety and realistic patterns of human contact: a highly clustered network, a bipartite network and a snowball sampled network of a “hidden population”. In the case of the snowball sampled network we present a novel method for fitting an edge-triangle model. In our results, ERGMs consistently capture clustering as well or better than configuration-type models, but the latter models better capture the node degree distribution. Despite the additional computational requirements to fit ERGMs to empirical networks, the use of ERGMs provides only a slight improvement in the ability of the models to recreate epidemic features of the empirical network in simulated SIR epidemics. Generally, SIR epidemic results from using configuration-type models fall between those from a random network model (i.e., an Erdős-Rényi model) and an ERGM. The addition of subgraphs of size four to edge-triangle type models does improve agreement with the empirical network for smaller densities in clustered networks. Additional subgraphs do not make a noticeable difference in our example, although we would expect the ability to model cliques to be helpful for contact networks exhibiting household structure. PMID:26555701
Li, Dongfang; Lu, Zhaojun; Zou, Xuecheng; Liu, Zhenglin
2015-01-01
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. PMID:26501283
Li, Dongfang; Lu, Zhaojun; Zou, Xuecheng; Liu, Zhenglin
2015-01-01
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. PMID:26501283
NASA Astrophysics Data System (ADS)
Tang, Bin; Yang, Shenghao; Ye, Baoliu; Yin, Yitong; Lu, Sanglu
2015-12-01
Chunked codes are efficient random linear network coding (RLNC) schemes with low computational cost, where the input packets are encoded into small chunks (i.e., subsets of the coded packets). During the network transmission, RLNC is performed within each chunk. In this paper, we first introduce a simple transfer matrix model to characterize the transmission of chunks and derive some basic properties of the model to facilitate the performance analysis. We then focus on the design of overlapped chunked codes, a class of chunked codes whose chunks are non-disjoint subsets of input packets, which are of special interest since they can be encoded with negligible computational cost and in a causal fashion. We propose expander chunked (EC) codes, the first class of overlapped chunked codes that have an analyzable performance, where the construction of the chunks makes use of regular graphs. Numerical and simulation results show that in some practical settings, EC codes can achieve rates within 91 to 97 % of the optimum and outperform the state-of-the-art overlapped chunked codes significantly.
NASA Astrophysics Data System (ADS)
De Bacco, Caterina; Guggiola, Alberto; Kühn, Reimer; Paga, Pierre
2016-05-01
Rare event statistics for random walks on complex networks are investigated using the large deviation formalism. Within this formalism, rare events are realised as typical events in a suitably deformed path-ensemble, and their statistics can be studied in terms of spectral properties of a deformed Markov transition matrix. We observe two different types of phase transition in such systems: (i) rare events which are singled out for sufficiently large values of the deformation parameter may correspond to localised modes of the deformed transition matrix; (ii) ‘mode-switching transitions’ may occur as the deformation parameter is varied. Details depend on the nature of the observable for which the rare event statistics is studied, as well as on the underlying graph ensemble. In the present paper we report results on rare events statistics for path averages of random walks in Erdős–Rényi and scale free networks. Large deviation rate functions and localisation properties are studied numerically. For observables of the type considered here, we also derive an analytical approximation for the Legendre transform of the large deviation rate function, which is valid in the large connectivity limit. It is found to agree well with simulations.
Physical states in the canonical tensor model from the perspective of random tensor networks
NASA Astrophysics Data System (ADS)
Narain, Gaurav; Sasakura, Naoki; Sato, Yuki
2015-01-01
Tensor models, generalization of matrix models, are studied aiming for quantum gravity in dimensions larger than two. Among them, the canonical tensor model is formulated as a totally constrained system with first-class constraints, the algebra of which resembles the Dirac algebra of general relativity. When quantized, the physical states are defined to be vanished by the quantized constraints. In explicit representations, the constraint equations are a set of partial differential equations for the physical wave-functions, which do not seem straightforward to be solved due to their non-linear character. In this paper, after providing some explicit solutions for N = 2 , 3, we show that certain scale-free integration of partition functions of statistical systems on random networks (or random tensor networks more generally) provides a series of solutions for general N. Then, by generalizing this form, we also obtain various solutions for general N. Moreover, we show that the solutions for the cases with a cosmological constant can be obtained from those with no cosmological constant for increased N. This would imply the interesting possibility that a cosmological constant can always be absorbed into the dynamics and is not an input parameter in the canonical tensor model. We also observe the possibility of symmetry enhancement in N = 3, and comment on an extension of Airy function related to the solutions.
Analysis of an epidemic model with awareness decay on regular random networks.
Juher, David; Kiss, Istvan Z; Saldaña, Joan
2015-01-21
The existence of a die-out threshold (different from the classic disease-invasion one) defining a region of slow extinction of an epidemic has been proved elsewhere for susceptible-aware-infectious-susceptible models without awareness decay, through bifurcation analysis. By means of an equivalent mean-field model defined on regular random networks, we interpret the dynamics of the system in this region and prove that the existence of bifurcation for this second epidemic threshold crucially depends on the absence of awareness decay. We show that the continuum of equilibria that characterizes the slow die-out dynamics collapses into a unique equilibrium when a constant rate of awareness decay is assumed, no matter how small, and that the resulting bifurcation from the disease-free equilibrium is equivalent to that of standard epidemic models. We illustrate these findings with continuous-time stochastic simulations on regular random networks with different degrees. Finally, the behaviour of solutions with and without decay in awareness is compared around the second epidemic threshold for a small rate of awareness decay. PMID:25452138
Ortiz-Rodriguez, J. M.; Reyes Alfaro, A.; Reyes Haro, A.; Solis Sanches, L. O.; Miranda, R. Castaneda; Cervantes Viramontes, J. M.; Vega-Carrillo, H. R.
2013-07-03
In this work the performance of two neutron spectrum unfolding codes based on iterative procedures and artificial neural networks is evaluated. The first one code based on traditional iterative procedures and called Neutron spectrometry and dosimetry from the Universidad Autonoma de Zacatecas (NSDUAZ) use the SPUNIT iterative algorithm and was designed to unfold neutron spectrum and calculate 15 dosimetric quantities and 7 IAEA survey meters. The main feature of this code is the automated selection of the initial guess spectrum trough a compendium of neutron spectrum compiled by the IAEA. The second one code known as Neutron spectrometry and dosimetry with artificial neural networks (NDSann) is a code designed using neural nets technology. The artificial intelligence approach of neural net does not solve mathematical equations. By using the knowledge stored at synaptic weights on a neural net properly trained, the code is capable to unfold neutron spectrum and to simultaneously calculate 15 dosimetric quantities, needing as entrance data, only the rate counts measured with a Bonner spheres system. Similarities of both NSDUAZ and NSDann codes are: they follow the same easy and intuitive user's philosophy and were designed in a graphical interface under the LabVIEW programming environment. Both codes unfold the neutron spectrum expressed in 60 energy bins, calculate 15 dosimetric quantities and generate a full report in HTML format. Differences of these codes are: NSDUAZ code was designed using classical iterative approaches and needs an initial guess spectrum in order to initiate the iterative procedure. In NSDUAZ, a programming routine was designed to calculate 7 IAEA instrument survey meters using the fluence-dose conversion coefficients. NSDann code use artificial neural networks for solving the ill-conditioned equation system of neutron spectrometry problem through synaptic weights of a properly trained neural network. Contrary to iterative procedures, in neural
NASA Astrophysics Data System (ADS)
Ortiz-Rodríguez, J. M.; Reyes Alfaro, A.; Reyes Haro, A.; Solís Sánches, L. O.; Miranda, R. Castañeda; Cervantes Viramontes, J. M.; Vega-Carrillo, H. R.
2013-07-01
In this work the performance of two neutron spectrum unfolding codes based on iterative procedures and artificial neural networks is evaluated. The first one code based on traditional iterative procedures and called Neutron spectrometry and dosimetry from the Universidad Autonoma de Zacatecas (NSDUAZ) use the SPUNIT iterative algorithm and was designed to unfold neutron spectrum and calculate 15 dosimetric quantities and 7 IAEA survey meters. The main feature of this code is the automated selection of the initial guess spectrum trough a compendium of neutron spectrum compiled by the IAEA. The second one code known as Neutron spectrometry and dosimetry with artificial neural networks (NDSann) is a code designed using neural nets technology. The artificial intelligence approach of neural net does not solve mathematical equations. By using the knowledge stored at synaptic weights on a neural net properly trained, the code is capable to unfold neutron spectrum and to simultaneously calculate 15 dosimetric quantities, needing as entrance data, only the rate counts measured with a Bonner spheres system. Similarities of both NSDUAZ and NSDann codes are: they follow the same easy and intuitive user's philosophy and were designed in a graphical interface under the LabVIEW programming environment. Both codes unfold the neutron spectrum expressed in 60 energy bins, calculate 15 dosimetric quantities and generate a full report in HTML format. Differences of these codes are: NSDUAZ code was designed using classical iterative approaches and needs an initial guess spectrum in order to initiate the iterative procedure. In NSDUAZ, a programming routine was designed to calculate 7 IAEA instrument survey meters using the fluence-dose conversion coefficients. NSDann code use artificial neural networks for solving the ill-conditioned equation system of neutron spectrometry problem through synaptic weights of a properly trained neural network. Contrary to iterative procedures, in neural
Simply Coded Evolutionary Artificial Neural Networks on a Mobile Robot Control Problem
NASA Astrophysics Data System (ADS)
Katada, Yoshiaki; Hidaka, Takuya
One of the advantages of evolutionary robotics over other approaches in embodied cognitive science would be its parallel population search. Due to the population search, it takes a long time to evaluate all robot in a real environment. Thus, such techniques as to shorten the time are required for real robots to evolve in a real environment. This paper proposes to use simply coded evolutionary artificial neural networks for mobile robot control to make genetic search space as small as possible and investigates the performance of them using simulated and real robots. Two types of genetic algorithm (GA) are employed, one is the standard GA and the other is an extended GA, to achieve higher final fitnesses. The results suggest the benefits of the proposed method.
Standard-Compliant Multiple Description Video Coding over Packet Loss Network
NASA Astrophysics Data System (ADS)
Bai, Huihui; Zhao, Yao; Zhang, Mengmeng
2010-12-01
An effective scheme of multiple description video coding is proposed for transmission over packet loss network. Using priority encoding transmission, we attempt to overcome the limitation of specific scalable video codec and apply FEC-based multiple description to a common video coder, such as the standard H.264. Firstly, multiple descriptions can be generated using temporal downsampling and the frame with high motion changing is duplicated in each description. Then according to different motion characteristics between frames, each description can be divided into several messages, so in each message better temporal correlation can be maintained for better estimation when information losses occur. Based on priority encoding transmission, unequal protections are assigned in each message. Furthermore, the priority is designed in view of packet loss rate of channels and the significance of bit streams. Experimental results validate the effectiveness of the proposed scheme with better performance than the equal protection scheme and other state-of-the-art methods.
NASA Astrophysics Data System (ADS)
Hasegawa, Jun; Yomo, Hiroyuki; Kondo, Yoshihisa; Davis, Peter; Sakakibara, Katsumi; Miura, Ryu; Obana, Sadao
This paper proposes bidirectional packet aggregation and coding (BiPAC), a packet mixing technique which jointly applies packet aggregation and network coding in order to increase the number of supportable VoIP sessions in wireless multi-hop mesh networks. BiPAC applies network coding for aggregated VoIP packets by exploiting bidirectional nature of VoIP sessions, and largely reduces the required protocol overhead for transmitting short VoIP packets. We design BiPAC and related protocols so that the operations of aggregation and coding are well-integrated while satisfying the required quality of service by VoIP transmission, such as delay and packet loss rate. Our computer simulation results show that BiPAC can increase the number of supportable VoIP sessions maximum by around 87% as compared with the case when the packet aggregation alone is used, and 600% in comparison to the transmission without aggregation/coding. We also implement BiPAC in a wireless testbed, and run experiments in an actual indoor environment. Our experimental results show that BiPAC is a practical and efficient forwarding method, which can be implemented into the current mesh hardware and network stack.
NASA Astrophysics Data System (ADS)
Foster, Jacob G.; Foster, David V.; Grassberger, Peter; Paczuski, Maya
2007-10-01
The simplest null models for networks, used to distinguish significant features of a particular network from a priori expected features, are random ensembles with the degree sequence fixed by the specific network of interest. These “fixed degree sequence” (FDS) ensembles are, however, famously resistant to analytic attack. In this paper we introduce ensembles with partially-fixed degree sequences (PFDS) and compare analytic results obtained for them with Monte Carlo results for the FDS ensemble. These results include link likelihoods, subgraph likelihoods, and degree correlations. We find that local structural features in the FDS ensemble can be reasonably well estimated by simultaneously fixing only the degrees of a few nodes, in addition to the total number of nodes and links. As test cases we use two protein interaction networks (Escherichia coli, Saccharomyces cerevisiae), the internet on the autonomous system (AS) level, and the World Wide Web. Fixing just the degrees of two nodes gives the mean neighbor degree as a function of node degree, ⟨k'⟩k , in agreement with results explicitly obtained from rewiring. For power law degree distributions, we derive the disassortativity analytically. In the PFDS ensemble the partition function can be expanded diagrammatically. We obtain an explicit expression for the link likelihood to lowest order, which reduces in the limit of large, sparse undirected networks with L links and with kmax≪L to the simple formula P(k,k')=kk'/(2L+kk') . In a similar limit, the probability for three nodes to be linked into a triangle reduces to the factorized expression PΔ(k1,k2,k3)=P(k1,k2)P(k1,k3)P(k2,k3) .
Rheology of rod/random coil polymer systems, and interpenetrating networks
Clausen, T.M.
1993-12-31
Poly({gamma}-benzyl-L-glutamate) (PBLG), a synthetic {alpha}-helical rodlike polypeptide, and aqueous solutions of cetyltrimethylammonium chloride (CTAC), a surfactant that forms rodlike colloids, were used to study the properties of rod polymer solutions. Interpenetrating networks of PBLG and acrylic polymers were prepared and studied rheologically. The rheology of PBLG solutions in toluene and dimethyl formamide (DMF) was studied in the dilute, semi-dilute, and concentrated regimes. Steady shear results fit well to a theory recently proposed, but not to older theories in the literature. The rheology and morphology of viscoelastic solutions of CTAC were studied using steady and oscillatory shear measurements, and transmission electron microscopy. By titrating a fixed CTAC concentration with salicylate the surfactant solution changed from the Newtonian behavior of spherical micelles 5 nm in diameter to viscoelastic solutions of entangled rodlike micelles as long as several micrometers. The phase diagram was determined for the three component system PBLG, polystyrene (PS), DMF system at {approximately}23 C. The results did not fit the athermal theory for rod/random coil systems. However, the addition of enthalpic terms brings theoretical predictions in general agreement with experimental results. The kinetics of PBLG/DMF gelation were studied rheologically. Solutions of PBLG/DMF were observed using oscillatory shear as they were cooled below the gel point, and on heating from the gel to the solution phase. The results support the hypothesis that gelation occurs as a result of the kinetics of phase separation; however, the mechanism is unproven. The rheological properties of interpenetrating networks (IPNs) prepared from rod and random coil polymers were studied. Rod/random coil IPNs were prepared by polymerizing the diluent around an isotropic solution of rods, and by polymerizing the diluent around a microphase separated rod polymer gel.
Assessment of BeiDou differential code bias variations from multi-GNSS network observations
NASA Astrophysics Data System (ADS)
Jin, S. G.; Jin, R.; Li, D.
2016-02-01
The differential code bias (DCB) of global navigation satellite systems (GNSSs) affects precise ionospheric modeling and applications. In this paper, daily DCBs of the BeiDou Navigation Satellite System (BDS) are estimated and investigated from 2-year multi-GNSS network observations (2013-2014) based on global ionospheric maps (GIMs) from the Center for Orbit Determination in Europe (CODE), which are compared with Global Positioning System (GPS) results. The DCB of BDS satellites is a little less stable than GPS solutions, especially for geostationary Earth orbit (GEO) satellites. The BDS GEO observations decrease the precision of inclined geosynchronous satellite orbit (IGSO) and medium Earth orbit (MEO) DCB estimations. The RMS of BDS satellites DCB decreases to about 0.2 ns when we remove BDS GEO observations. Zero-mean condition effects are not the dominant factor for the higher RMS of BDS satellites DCB. Although there are no obvious secular variations in the DCB time series, sub-nanosecond variations are visible for both BDS and GPS satellites DCBs during 2013-2014. For satellites in the same orbital plane, their DCB variations have similar characteristics. In addition, variations in receivers DCB in the same region are found with a similar pattern between BDS and GPS. These variations in both GPS and BDS DCBs are mainly related to the estimated error from ionospheric variability, while the BDS DCB intrinsic variation is in sub-nanoseconds.
NASA Astrophysics Data System (ADS)
Kumar, Pravindra; Srivastava, Anand
2015-12-01
Passive optical networks based on orthogonal frequency division multiplexing (OFDM-PON) give better performance in high-speed optical access networks. For further improvement in performance, a new architecture of OFDM-PON based on spreading code in electrical domain is proposed and analytically analyzed in this paper. This approach is referred as hybrid multi-carrier code division multiple access-passive optical network (MC-CDMA-PON). Analytical results show that at bit error rate (BER) of 10-3, there is 9.4 dB and 14.2 dB improvement in optical power budget for downstream and upstream, respectively, with MC-CDMA-PON system as compared to conventional OFDM-PON system for the same number of optical network units (ONUs).
Pattern formation on networks with reactions: A continuous-time random-walk approach
NASA Astrophysics Data System (ADS)
Angstmann, C. N.; Donnelly, I. C.; Henry, B. I.
2013-03-01
We derive the generalized master equation for reaction-diffusion on networks from an underlying stochastic process, the continuous time random walk (CTRW). The nontrivial incorporation of the reaction process into the CTRW is achieved by splitting the derivation into two stages. The reactions are treated as birth-death processes and the first stage of the derivation is at the single particle level, taking into account the death process, while the second stage considers an ensemble of these particles including the birth process. Using this model we have investigated different types of pattern formation across the vertices on a range of networks. Importantly, the CTRW defines the Laplacian operator on the network in a non-ad hoc manner and the pattern formation depends on the structure of this Laplacian. Here we focus attention on CTRWs with exponential waiting times for two cases: one in which the rate parameter is constant for all vertices and the other where the rate parameter is proportional to the vertex degree. This results in nonsymmetric and symmetric CTRW Laplacians, respectively. In the case of symmetric Laplacians, pattern formation follows from the Turing instability. However in nonsymmetric Laplacians, pattern formation may be possible with or without a Turing instability.
(Quantum) spacetime as a statistical geometry of lumps in random networks
NASA Astrophysics Data System (ADS)
Requardt, Manfred
2000-05-01
In the following we undertake to describe how macroscopic spacetime (or rather, a microscopic protoform of it) is supposed to emerge as a superstructure of a web of lumps in a stochastic discrete network structure. As in preceding work (mentioned below), our analysis is based on the working philosophy that both physics and the corresponding mathematics have to be genuinely discrete on the primordial (Planck scale) level. This strategy is concretely implemented in the form of cellular networks and random graphs. One of our main themes is the development of the concept of physical (proto)points or lumps as densely entangled subcomplexes of the network and their respective web, establishing something like (proto)causality. It may perhaps be said that certain parts of our programme are realizations of some early ideas of Menger and more recent ones sketched by Smolin a couple of years ago. We briefly indicate how this two-storey concept of quantum spacetime can be used to encode the (at least in our view) existing non-local aspects of quantum theory without violating macroscopic spacetime causality!
Zhang, Yequn; Arabaci, Murat; Djordjevic, Ivan B
2012-04-01
Leveraging the advanced coherent optical communication technologies, this paper explores the feasibility of using four-dimensional (4D) nonbinary LDPC-coded modulation (4D-NB-LDPC-CM) schemes for long-haul transmission in future optical transport networks. In contrast to our previous works on 4D-NB-LDPC-CM which considered amplified spontaneous emission (ASE) noise as the dominant impairment, this paper undertakes transmission in a more realistic optical fiber transmission environment, taking into account impairments due to dispersion effects, nonlinear phase noise, Kerr nonlinearities, and stimulated Raman scattering in addition to ASE noise. We first reveal the advantages of using 4D modulation formats in LDPC-coded modulation instead of conventional two-dimensional (2D) modulation formats used with polarization-division multiplexing (PDM). Then we demonstrate that 4D LDPC-coded modulation schemes with nonbinary LDPC component codes significantly outperform not only their conventional PDM-2D counterparts but also the corresponding 4D bit-interleaved LDPC-coded modulation (4D-BI-LDPC-CM) schemes, which employ binary LDPC codes as component codes. We also show that the transmission reach improvement offered by the 4D-NB-LDPC-CM over 4D-BI-LDPC-CM increases as the underlying constellation size and hence the spectral efficiency of transmission increases. Our results suggest that 4D-NB-LDPC-CM can be an excellent candidate for long-haul transmission in next-generation optical networks. PMID:22513641
NASA Astrophysics Data System (ADS)
Mohamed, Khairi Ashour; Pap, Laszlo
1994-05-01
This paper is concerned with the performance analysis of frequency-hopped packet radio networks with random signal levels. We assume that a hit from an interfering packet necessitates a symbol error if and only if it brings on enough energy that exceeds the energy received from the wanted signal. The interdependence between symbol errors of an arbitrary packet is taken into consideration through the joint probability generating function of the so-called effective multiple access interference. Slotted networks, with both random and deterministic hopping patterns, are considered in the case of both synchronous and asynchronous hopping. A general closed-form expression is given for packet capture probability, in the case of Reed-Solomon error only decoding. After introducing a general description method, the following examples are worked out in details: (1) networks with random spatial distribution of stations (a model for mobile packet radio networks); (2) networks operating in slow fading channels; (3) networks with different power levels which are chosen randomly according to either discrete or continuous probability distribution (created captures).
NASA Technical Reports Server (NTRS)
Benson, Markland J.
2008-01-01
Presents a source code analysis tool (CodeSonar) for use in the Space Network Ground Segment. The Space Network requires 99.9% proficiency and 97.0% availability of systems. Software has historically accounted for an annual average of 28% of the Space Network loss of availability and proficiency. CSCI A and CSCI B account for 42% of the previous eight months of software data loss. The technology infusion of CodeSonar into the Space Network Ground segment is meant to aid in determining the impact of the technology on the project both in the expenditure of effort and the technical results of the technology. Running a CodeSonar analysis and performing a preliminary review of the results averaged 3.5 minutes per finding (approximately 20 hours total). An additional 40 hours is estimated to analyze the 37 findings deemed too complex for the initial review. Using CodeSonar's tools to suppress known non-problems, delta tool runs will not repeat findings that have been marked as non-problems, further reducing the time needed for review. The 'non-interesting' finding rate of 70% is a large number, but filtering, search, and detailed contextual features of CodeSonar reduce the time per finding. Integration of the tool into the build process may also provide further savings by preventing developers from having to configure and operate the tool separately. These preliminary results show the tool to be easy to use and incorporate into the engineering process. These findings also provide significant potential improvements in proficiency and availability on the part of the software. As time-to-fix data become available a better cost trade can be made on person hours saved versus tool cost. Selective factors may be necessary to determine where best to apply CodeSonar to balance cost and benefits.
Dynamic fair node spectrum allocation for ad hoc networks using random matrices
NASA Astrophysics Data System (ADS)
Rahmes, Mark; Lemieux, George; Chester, Dave; Sonnenberg, Jerry
2015-05-01
Dynamic Spectrum Access (DSA) is widely seen as a solution to the problem of limited spectrum, because of its ability to adapt the operating frequency of a radio. Mobile Ad Hoc Networks (MANETs) can extend high-capacity mobile communications over large areas where fixed and tethered-mobile systems are not available. In one use case with high potential impact, cognitive radio employs spectrum sensing to facilitate the identification of allocated frequencies not currently accessed by their primary users. Primary users own the rights to radiate at a specific frequency and geographic location, while secondary users opportunistically attempt to radiate at a specific frequency when the primary user is not using it. We populate a spatial radio environment map (REM) database with known information that can be leveraged in an ad hoc network to facilitate fair path use of the DSA-discovered links. Utilization of high-resolution geospatial data layers in RF propagation analysis is directly applicable. Random matrix theory (RMT) is useful in simulating network layer usage in nodes by a Wishart adjacency matrix. We use the Dijkstra algorithm for discovering ad hoc network node connection patterns. We present a method for analysts to dynamically allocate node-node path and link resources using fair division. User allocation of limited resources as a function of time must be dynamic and based on system fairness policies. The context of fair means that first available request for an asset is not envied as long as it is not yet allocated or tasked in order to prevent cycling of the system. This solution may also save money by offering a Pareto efficient repeatable process. We use a water fill queue algorithm to include Shapley value marginal contributions for allocation.
NASA Astrophysics Data System (ADS)
Pei, Yong; Modestino, James W.
2004-12-01
Digital video delivered over wired-to-wireless networks is expected to suffer quality degradation from both packet loss and bit errors in the payload. In this paper, the quality degradation due to packet loss and bit errors in the payload are quantitatively evaluated and their effects are assessed. We propose the use of a concatenated forward error correction (FEC) coding scheme employing Reed-Solomon (RS) codes and rate-compatible punctured convolutional (RCPC) codes to protect the video data from packet loss and bit errors, respectively. Furthermore, the performance of a joint source-channel coding (JSCC) approach employing this concatenated FEC coding scheme for video transmission is studied. Finally, we describe an improved end-to-end architecture using an edge proxy in a mobile support station to implement differential error protection for the corresponding channel impairments expected on the two networks. Results indicate that with an appropriate JSCC approach and the use of an edge proxy, FEC-based error-control techniques together with passive error-recovery techniques can significantly improve the effective video throughput and lead to acceptable video delivery quality over time-varying heterogeneous wired-to-wireless IP networks.
ERIC Educational Resources Information Center
Salisbury, Amy L.; Fallone, Melissa Duncan; Lester, Barry
2005-01-01
This review provides an overview and definition of the concept of neurobehavior in human development. Two neurobehavioral assessments used by the authors in current fetal and infant research are discussed: the NICU Network Neurobehavioral Assessment Scale and the Fetal Neurobehavior Coding System. This review will present how the two assessments…
Chen, Huifang; Fan, Guangyu; Xie, Lei; Cui, Jun-Hong
2013-01-01
Due to the characteristics of underwater acoustic channel, media access control (MAC) protocols designed for underwater acoustic sensor networks (UWASNs) are quite different from those for terrestrial wireless sensor networks. Moreover, in a sink-oriented network with event information generation in a sensor field and message forwarding to the sink hop-by-hop, the sensors near the sink have to transmit more packets than those far from the sink, and then a funneling effect occurs, which leads to packet congestion, collisions and losses, especially in UWASNs with long propagation delays. An improved CDMA-based MAC protocol, named path-oriented code assignment (POCA) CDMA MAC (POCA-CDMA-MAC), is proposed for UWASNs in this paper. In the proposed MAC protocol, both the round-robin method and CDMA technology are adopted to make the sink receive packets from multiple paths simultaneously. Since the number of paths for information gathering is much less than that of nodes, the length of the spreading code used in the POCA-CDMA-MAC protocol is shorter greatly than that used in the CDMA-based protocols with transmitter-oriented code assignment (TOCA) or receiver-oriented code assignment (ROCA). Simulation results show that the proposed POCA-CDMA-MAC protocol achieves a higher network throughput and a lower end-to-end delay compared to other CDMA-based MAC protocols. PMID:24193100
Note: Network random walk model of two-state protein folding: Test of the theory
NASA Astrophysics Data System (ADS)
Berezhkovskii, Alexander M.; Murphy, Ronan D.; Buchete, Nicolae-Viorel
2013-01-01
We study two-state protein folding in the framework of a toy model of protein dynamics. This model has an important advantage: it allows for an analytical solution for the sum of folding and unfolding rate constants [A. M. Berezhkovskii, F. Tofoleanu, and N.-V. Buchete, J. Chem. Theory Comput. 7, 2370 (2011), 10.1021/ct200281d] and hence for the reactive flux at equilibrium. We use the model to test the Kramers-type formula for the reactive flux, which was derived assuming that the protein dynamics is described by a Markov random walk on a network of complex connectivity [A. Berezhkovskii, G. Hummer, and A. Szabo, J. Chem. Phys. 130, 205102 (2009), 10.1063/1.3139063]. It is shown that the Kramers-type formula leads to the same result for the reactive flux as the sum of the rate constants.
Face Association for Videos Using Conditional Random Fields and Max-Margin Markov Networks.
Du, Ming; Chellappa, Rama
2016-09-01
We address the video-based face association problem, in which one attempts to extract the face tracks of multiple subjects while maintaining label consistency. Traditional tracking algorithms have difficulty in handling this task, especially when challenging nuisance factors like motion blur, low resolution or significant camera motions are present. We demonstrate that contextual features, in addition to face appearance itself, play an important role in this case. We propose principled methods to combine multiple features using Conditional Random Fields and Max-Margin Markov networks to infer labels for the detected faces. Different from many existing approaches, our algorithms work in online mode and hence have a wider range of applications. We address issues such as parameter learning, inference and handling false positves/negatives that arise in the proposed approach. Finally, we evaluate our approach on several public databases. PMID:26552075
NASA Astrophysics Data System (ADS)
Lara, Silvia; Lai, Ying Tong; Love, Cameron; Ramakrishnan, Navneeth; Adam, Shaffique
In recent years, the Effective Medium Theory (EMT) and the Random Resistor Network (RRN) have been separately used to explain disorder induced magnetoresistance that is quadratic at low fields and linear at high fields. We demonstrate that the quadratic and linear coefficients of the magnetoresistance and the transition point from the quadratic to the linear regime depend only on the inhomogeneous carrier density profile. We use this to find a mapping between the two models using dimensionless parameters that determine the magnetoresistance and show numerically that they belong to the same universality class. This work is supported by the Singapore National Research Foundation (NRF-NRFF2012-01) and the Singapore Ministry of Education and Yale-NUS College through Grant Number R-607-265-01312.
Propagating mode-I fracture in amorphous materials using the continuous random network model
NASA Astrophysics Data System (ADS)
Heizler, Shay I.; Kessler, David A.; Levine, Herbert
2011-08-01
We study propagating mode-I fracture in two-dimensional amorphous materials using atomistic simulations. We use the continuous random network model of an amorphous material, creating samples using a two-dimensional analog of the Wooten-Winer-Weaire Monte Carlo algorithm. For modeling fracture, molecular-dynamics simulations were run on the resulting samples. The results of our simulations reproduce the main experimental features. In addition to achieving a steady-state crack under a constant driving displacement (which has not yet been achieved by other atomistic models for amorphous materials), the runs show microbranching, which increases with driving, transitioning to macrobranching for the largest drivings. In addition to the qualitative visual similarity of the simulated cracks to experiment, the simulation also succeeds in reproducing qualitatively the experimentally observed oscillations of the crack velocity.
Zhang, Jingwen; Brackbill, Devon; Yang, Sijia; Becker, Joshua; Herbert, Natalie; Centola, Damon
2016-12-01
To identify what features of online social networks can increase physical activity, we conducted a 4-arm randomized controlled trial in 2014 in Philadelphia, PA. Students (n = 790, mean age = 25.2) at an university were randomly assigned to one of four conditions composed of either supportive or competitive relationships and either with individual or team incentives for attending exercise classes. The social comparison condition placed participants into 6-person competitive networks with individual incentives. The social support condition placed participants into 6-person teams with team incentives. The combined condition with both supportive and competitive relationships placed participants into 6-person teams, where participants could compare their team's performance to 5 other teams' performances. The control condition only allowed participants to attend classes with individual incentives. Rewards were based on the total number of classes attended by an individual, or the average number of classes attended by the members of a team. The outcome was the number of classes that participants attended. Data were analyzed using multilevel models in 2014. The mean attendance numbers per week were 35.7, 38.5, 20.3, and 16.8 in the social comparison, the combined, the control, and the social support conditions. Attendance numbers were 90% higher in the social comparison and the combined conditions (mean = 1.9, SE = 0.2) in contrast to the two conditions without comparison (mean = 1.0, SE = 0.2) (p = 0.003). Social comparison was more effective for increasing physical activity than social support and its effects did not depend on individual or team incentives. PMID:27617191
Cui, Laizhong; Lu, Nan; Chen, Fu
2014-01-01
Most large-scale peer-to-peer (P2P) live streaming systems use mesh to organize peers and leverage pull scheduling to transmit packets for providing robustness in dynamic environment. The pull scheduling brings large packet delay. Network coding makes the push scheduling feasible in mesh P2P live streaming and improves the efficiency. However, it may also introduce some extra delays and coding computational overhead. To improve the packet delay, streaming quality, and coding overhead, in this paper are as follows. we propose a QoS driven push scheduling approach. The main contributions of this paper are: (i) We introduce a new network coding method to increase the content diversity and reduce the complexity of scheduling; (ii) we formulate the push scheduling as an optimization problem and transform it to a min-cost flow problem for solving it in polynomial time; (iii) we propose a push scheduling algorithm to reduce the coding overhead and do extensive experiments to validate the effectiveness of our approach. Compared with previous approaches, the simulation results demonstrate that packet delay, continuity index, and coding ratio of our system can be significantly improved, especially in dynamic environments. PMID:25114968
Cui, Laizhong; Lu, Nan; Chen, Fu
2014-01-01
Most large-scale peer-to-peer (P2P) live streaming systems use mesh to organize peers and leverage pull scheduling to transmit packets for providing robustness in dynamic environment. The pull scheduling brings large packet delay. Network coding makes the push scheduling feasible in mesh P2P live streaming and improves the efficiency. However, it may also introduce some extra delays and coding computational overhead. To improve the packet delay, streaming quality, and coding overhead, in this paper are as follows. we propose a QoS driven push scheduling approach. The main contributions of this paper are: (i) We introduce a new network coding method to increase the content diversity and reduce the complexity of scheduling; (ii) we formulate the push scheduling as an optimization problem and transform it to a min-cost flow problem for solving it in polynomial time; (iii) we propose a push scheduling algorithm to reduce the coding overhead and do extensive experiments to validate the effectiveness of our approach. Compared with previous approaches, the simulation results demonstrate that packet delay, continuity index, and coding ratio of our system can be significantly improved, especially in dynamic environments. PMID:25114968
Exponential H∞ filtering for discrete-time switched neural networks with random delays.
Mathiyalagan, Kalidass; Su, Hongye; Shi, Peng; Sakthivel, Rathinasamy
2015-04-01
This paper addresses the exponential H∞ filtering problem for a class of discrete-time switched neural networks with random time-varying delays. The involved delays are assumed to be randomly time-varying which are characterized by introducing a Bernoulli stochastic variable. Effects of both variation range and distribution probability of the time delays are considered. The nonlinear activation functions are assumed to satisfy the sector conditions. Our aim is to estimate the state by designing a full order filter such that the filter error system is globally exponentially stable with an expected decay rate and a H∞ performance attenuation level. The filter is designed by using a piecewise Lyapunov-Krasovskii functional together with linear matrix inequality (LMI) approach and average dwell time method. First, a set of sufficient LMI conditions are established to guarantee the exponential mean-square stability of the augmented system and then the parameters of full-order filter are expressed in terms of solutions to a set of LMI conditions. The proposed LMI conditions can be easily solved by using standard software packages. Finally, numerical examples by means of practical problems are provided to illustrate the effectiveness of the proposed filter design. PMID:25020225
Chandrasekar, A; Rakkiyappan, R; Cao, Jinde
2015-10-01
This paper studies the impulsive synchronization of Markovian jumping randomly coupled neural networks with partly unknown transition probabilities via multiple integral approach. The array of neural networks are coupled in a random fashion which is governed by Bernoulli random variable. The aim of this paper is to obtain the synchronization criteria, which is suitable for both exactly known and partly unknown transition probabilities such that the coupled neural network is synchronized with mixed time-delay. The considered impulsive effects can be synchronized at partly unknown transition probabilities. Besides, a multiple integral approach is also proposed to strengthen the Markovian jumping randomly coupled neural networks with partly unknown transition probabilities. By making use of Kronecker product and some useful integral inequalities, a novel Lyapunov-Krasovskii functional was designed for handling the coupled neural network with mixed delay and then impulsive synchronization criteria are solvable in a set of linear matrix inequalities. Finally, numerical examples are presented to illustrate the effectiveness and advantages of the theoretical results. PMID:26210982
An Interactive network of long non-coding RNAs facilitates the Drosophila sex determination decision
Mulvey, Brett B.; Olcese, Ursula; Cabrera, Janel R.; Horabin, Jamila I.
2014-01-01
Genome analysis in several eukaryotes shows a surprising number of transcripts which do not encode conventional messenger RNAs. Once considered noise, these non-coding RNAs (ncRNAs) appear capable of controlling gene expression by various means. We find Drosophila sex determination, specifically the master-switch gene Sex-lethal (Sxl), is regulated by long ncRNAs (>200 nt). The lncRNAs influence the dose sensitive establishment promoter of Sxl, SxlPe, which must be activated to specify female sex. They are primarily from two regions, R1 and R2, upstream of SxlPeand show a dynamic developmental profile. Of the four lncRNA strands only one, R2 antisense, has its peak coincident with SxlPe transcription, suggesting it may promote activation. Indeed, its expression is regulated by the X chromosome counting genes, whose dose determines whether SxlPe is transcribed. Transgenic lines which ectopically express each of the lncRNAs show they can act in trans, impacting the process of sex determination but also altering the levels of the other lncRNAs. Generally, expression of R1 is negative whereas R2 is positive to females. This ectopic expression also results in a change in the local chromatin marks, affecting the timing and strength of SxlPe transcription. The chromatin marks are those deposited by the Polycomb and Trithorax groups of chromatin modifying proteins, which we find bind to the lncRNAs. We suggest the increasing numbers of non-coding transcripts being identified are a harbinger of interacting networks similar to the one we describe. PMID:24954180
Improving Computer-Aided Detection Using Convolutional Neural Networks and Random View Aggregation.
Roth, Holger R; Lu, Le; Liu, Jiamin; Yao, Jianhua; Seff, Ari; Cherry, Kevin; Kim, Lauren; Summers, Ronald M
2016-05-01
Automated computer-aided detection (CADe) has been an important tool in clinical practice and research. State-of-the-art methods often show high sensitivities at the cost of high false-positives (FP) per patient rates. We design a two-tiered coarse-to-fine cascade framework that first operates a candidate generation system at sensitivities ∼ 100% of but at high FP levels. By leveraging existing CADe systems, coordinates of regions or volumes of interest (ROI or VOI) are generated and function as input for a second tier, which is our focus in this study. In this second stage, we generate 2D (two-dimensional) or 2.5D views via sampling through scale transformations, random translations and rotations. These random views are used to train deep convolutional neural network (ConvNet) classifiers. In testing, the ConvNets assign class (e.g., lesion, pathology) probabilities for a new set of random views that are then averaged to compute a final per-candidate classification probability. This second tier behaves as a highly selective process to reject difficult false positives while preserving high sensitivities. The methods are evaluated on three data sets: 59 patients for sclerotic metastasis detection, 176 patients for lymph node detection, and 1,186 patients for colonic polyp detection. Experimental results show the ability of ConvNets to generalize well to different medical imaging CADe applications and scale elegantly to various data sets. Our proposed methods improve performance markedly in all cases. Sensitivities improved from 57% to 70%, 43% to 77%, and 58% to 75% at 3 FPs per patient for sclerotic metastases, lymph nodes and colonic polyps, respectively. PMID:26441412
Liu, Wei; Awate, Suyash P.; Anderson, Jeffrey S.; Fletcher, P. Thomas
2014-01-01
We propose a hierarchical Markov random field model that estimates both group and subject functional networks simultaneously. The model takes into account the within-subject spatial coherence as well as the between-subject consistency of the network label maps. The statistical dependency between group and subject networks acts as a regularization, which helps the network estimation on both layers. We use Gibbs sampling to approximate the posterior density of the network labels and Monte Carlo expectation maximization to estimate the model parameters. We compare our method with two alternative segmentation methods based on K-Means and normalized cuts, using synthetic and real fMRI data. The experimental results show our proposed model is able to identify both group and subject functional networks with higher accuracy, more robustness, and inter-session consistency. PMID:24954282
NASA Astrophysics Data System (ADS)
Payne, Joshua L.; Harris, Kameron Decker; Dodds, Peter Sheridan
2011-07-01
We derive analytic expressions for the possibility, probability, and expected size of global spreading events starting from a single infected seed for a broad collection of contagion processes acting on random networks with both directed and undirected edges and arbitrary degree-degree correlations. Our work extends previous theoretical developments for the undirected case, and we provide numerical support for our findings by investigating an example class of networks for which we are able to obtain closed-form expressions.
Relating permeability and electrical resistivity in fractures using random resistor network models
NASA Astrophysics Data System (ADS)
Kirkby, Alison; Heinson, Graham; Krieger, Lars
2016-03-01
We use random resistor network models to explore the relationship between electrical resistivity and permeability in a fracture filled with an electrically conductive fluid. Fluid flow and current are controlled by both the distribution and the volume of pore space. Therefore, the aperture distribution of fractures must be accurately modeled in order to realistically represent their hydraulic and electrical properties. We have constructed fracture surface pairs based on characteristics measured on rock samples. We use these to construct resistor networks with variable hydraulic and electrical resistance in order to investigate the changes in both properties as a fault is opened. At small apertures, electrical conductivity and permeability increase moderately with aperture until the fault reaches its percolation threshold. Above this point, the permeability increases by 4 orders of magnitude over a change in mean aperture of less than 0.1 mm, while the resistivity decreases by up to a factor of 10 over this aperture change. Because permeability increases at a greater rate than matrix to fracture resistivity ratio, the percolation threshold can also be defined in terms of the matrix to fracture resistivity ratio, M. The value of M at the percolation threshold, MPT, varies with the ratio of rock to fluid resistivity, the fault spacing, and the fault offset. However, MPT is almost always less than 10. Greater M values are associated with fractures above their percolation threshold. Therefore, if such M values are observed over fluid-filled fractures, it is likely that they are open for fluid flow.
NASA Astrophysics Data System (ADS)
Karlinger, M. R.; Troutman, B. M.
1985-11-01
An instantaneous unit hydrograph (iuh) based on the theory of topologically random networks (topological iuh) is evaluated in terms of sets of basin characteristics and hydraulic parameters. Hydrographs were computed using two linear routing methods for each of two drainage basins in the southeastern United States and are the basis of comparison for the topological iuh's. Elements in the sets of basin characteristics for the topological iuh's are the number of first-order streams only, (N), or the nuber of sources together with the number of channel links in the topological diameter (N, D); the hydraulic parameters are values of the celerity and diffusivity constant. Sensitivity analyses indicate that the mean celerity of the internal links in the network is the critical hydraulic parameter for determining the shape of the topological iuh, while the diffusivity constant has minimal effect on the topological iuh. Asymptotic results (source-only) indicate the number of sources need not be large to approximate the topological iuh with the Weibull probability density function.
NASA Astrophysics Data System (ADS)
Olekhno, N. A.; Beltukov, Y. M.; Parshin, D. A.
2016-05-01
One of the methods for the description of plasmon resonances in disordered metal-dielectric nanocomposites represents an initial composite as an electric network in the form of a lattice whose bonds are randomly arranged complex impedances. In this work, a general method is used to describe resonances in binary networks consisting of two types of impedances, which are arbitrary functions of the frequency [Th. Jonckheere and J.M. Luck, J. Phys. A 31, 3687 (1998)]. The generalization of the low-frequency L- C model where metal and dielectric regions in the lattice are replaced by inductive bonds L and capacitive bonds C d, respectively, has been considered. To analyze the spectrum of resonances in the entire optical region, a more accurate model involves the replacement of the metal regions by bonds in the form of parallel LC circuits with the resonant frequency equal to the plasma frequency of the metal ωp. The spectral properties of this model, as well as the model of a nanocomposite consisting of two metals with different plasma frequencies, have been considered. Analytical relations between the spectra of all such systems and the spectra of the initial L- C model have been established in the matrix representation. General expressions describing the dependence of the resonance spectrum of composites with arbitrary geometry on the permittivity of the matrix have been obtained.
A study of physician collaborations through social network and exponential random graph
2013-01-01
Background Physician collaboration, which evolves among physicians during the course of providing healthcare services to hospitalised patients, has been seen crucial to effective patient outcomes in healthcare organisations and hospitals. This study aims to explore physician collaborations using measures of social network analysis (SNA) and exponential random graph (ERG) model. Methods Based on the underlying assumption that collaborations evolve among physicians when they visit a common hospitalised patient, this study first proposes an approach to map collaboration network among physicians from the details of their visits to patients. This paper terms this network as physician collaboration network (PCN). Second, SNA measures of degree centralisation, betweenness centralisation and density are used to examine the impact of SNA measures on hospitalisation cost and readmission rate. As a control variable, the impact of patient age on the relation between network measures (i.e. degree centralisation, betweenness centralisation and density) and hospital outcome variables (i.e. hospitalisation cost and readmission rate) are also explored. Finally, ERG models are developed to identify micro-level structural properties of (i) high-cost versus low-cost PCN; and (ii) high-readmission rate versus low-readmission rate PCN. An electronic health insurance claim dataset of a very large Australian health insurance organisation is utilised to construct and explore PCN in this study. Results It is revealed that the density of PCN is positively correlated with hospitalisation cost and readmission rate. In contrast, betweenness centralisation is found negatively correlated with hospitalisation cost and readmission rate. Degree centralisation shows a negative correlation with readmission rate, but does not show any correlation with hospitalisation cost. Patient age does not have any impact for the relation of SNA measures with hospitalisation cost and hospital readmission rate. The
Zong, Shuang-Le; Zhao, Gang; Su, Li-Xin; Liang, Wei-Dong; Li, Li-Geng; Cheng, Guang; Wang, Ai-Jun; Cao, Xiao-Qiang; Zheng, Qiu-Tao; Li, Li-Dong; Kan, Shi-Lian
2016-03-01
The fifth metacarpal neck fractures (commonly termed boxer's fractures) are the most common type of metacarpal fractures. Many types of treatments are available in clinical practice, some of which have already been compared with other treatments by various researchers. However, a comprehensive treatment comparison is lacking. We estimated the comparative efficacy of different interventions for total complications, through a network meta-analysis of randomized controlled trials.We conducted a systematic search of the literature through October 2015. The outcome measurements were the total complications. We used a Bayesian network meta-analysis to combine direct and indirect evidence and to estimate the relative effects of treatment.We identified 6 RCTs registering a total of 288 patients who were eligible for our network meta-analysis. The literature's quality is relatively high. The median Structured Effectiveness for Quality Evaluation of Study score for the included trials was 33.8. The overall methodological quality was high. Of the 6 studies, all were 2-arm controlled trials comparing active intervention. Among the 4 treatments-conservative treatment (CT), antegrade intramedullary nailing (AIMN), transverse pinning (TP) with K-wires, and plate fixation (PF)-CT had the best rankings (ie, lowest risk of total complications), followed by PF, AIMN, and TP (ie, highest risk of total complications). Furthermore, we also presented the results using surface under the cumulative ranking curve. The surface under the cumulative ranking curve probabilities were 94.1%, 52.9%, 37.3%, and 15.7% for CT, PF, AIMN, and TP, respectively.In conclusion, current evidence suggested that conservative treatment is the optimum treatment for the fifth metacarpal neck fractures because of reduced total complication rates. Moreover, the TP with K-wires is the worst option with highly total complication rates. PF and AIMN therapy should be considered as the first-line choices. Larger and
Locating protein-coding regions in human DNA sequences by a multiple sensor-neural network approach
Uberbacher, E.C.; Mural, R.J. Univ. of Tennessee, Oak Ridge )
1991-12-15
Genes in higher eukaryotes may span tens or hundreds of kilobases with the protein-coding regions accounting for only a few percent of the total sequence. Identifying genes within large regions of uncharacterized DNA is a difficult undertaking and is currently the focus of many research efforts. The authors describe a reliable computational approach for locating protein-coding portions of genes in anonymous DNA sequence. Using a concept suggested by robotic environmental sensing, the authors method combines a set of sensor algorithms and a neural network to localize the coding regions. Several algorithms that report local characteristics of the DNA sequence, and therefore act as sensors, are also described. In its current configuration the coding recognition module identifies 90% of coding exons of length 100 bases or greater with less than one false positive coding exon indicated per five coding exons indicated. This is a significantly lower false positive rate than any method of which the authors are aware. This module demonstrates a method with general applicability to sequence-pattern recognition problems and is available for current research efforts.
Locating protein-coding regions in human DNA sequences by a multiple sensor-neural network approach.
Uberbacher, E C; Mural, R J
1991-01-01
Genes in higher eukaryotes may span tens or hundreds of kilobases with the protein-coding regions accounting for only a few percent of the total sequence. Identifying genes within large regions of uncharacterized DNA is a difficult undertaking and is currently the focus of many research efforts. We describe a reliable computational approach for locating protein-coding portions of genes in anonymous DNA sequence. Using a concept suggested by robotic environmental sensing, our method combines a set of sensor algorithms and a neural network to localize the coding regions. Several algorithms that report local characteristics of the DNA sequence, and therefore act as sensors, are also described. In its current configuration the "coding recognition module" identifies 90% of coding exons of length 100 bases or greater with less than one false positive coding exon indicated per five coding exons indicated. This is a significantly lower false positive rate than any method of which we are aware. This module demonstrates a method with general applicability to sequence-pattern recognition problems and is available for current research efforts. PMID:1763041
Kelley, David R; Snoek, Jasper; Rinn, John L
2016-07-01
The complex language of eukaryotic gene expression remains incompletely understood. Despite the importance suggested by many noncoding variants statistically associated with human disease, nearly all such variants have unknown mechanisms. Here, we address this challenge using an approach based on a recent machine learning advance-deep convolutional neural networks (CNNs). We introduce the open source package Basset to apply CNNs to learn the functional activity of DNA sequences from genomics data. We trained Basset on a compendium of accessible genomic sites mapped in 164 cell types by DNase-seq, and demonstrate greater predictive accuracy than previous methods. Basset predictions for the change in accessibility between variant alleles were far greater for Genome-wide association study (GWAS) SNPs that are likely to be causal relative to nearby SNPs in linkage disequilibrium with them. With Basset, a researcher can perform a single sequencing assay in their cell type of interest and simultaneously learn that cell's chromatin accessibility code and annotate every mutation in the genome with its influence on present accessibility and latent potential for accessibility. Thus, Basset offers a powerful computational approach to annotate and interpret the noncoding genome. PMID:27197224
Kelley, David R.; Snoek, Jasper; Rinn, John L.
2016-01-01
The complex language of eukaryotic gene expression remains incompletely understood. Despite the importance suggested by many noncoding variants statistically associated with human disease, nearly all such variants have unknown mechanisms. Here, we address this challenge using an approach based on a recent machine learning advance—deep convolutional neural networks (CNNs). We introduce the open source package Basset to apply CNNs to learn the functional activity of DNA sequences from genomics data. We trained Basset on a compendium of accessible genomic sites mapped in 164 cell types by DNase-seq, and demonstrate greater predictive accuracy than previous methods. Basset predictions for the change in accessibility between variant alleles were far greater for Genome-wide association study (GWAS) SNPs that are likely to be causal relative to nearby SNPs in linkage disequilibrium with them. With Basset, a researcher can perform a single sequencing assay in their cell type of interest and simultaneously learn that cell's chromatin accessibility code and annotate every mutation in the genome with its influence on present accessibility and latent potential for accessibility. Thus, Basset offers a powerful computational approach to annotate and interpret the noncoding genome. PMID:27197224
ERIC Educational Resources Information Center
Kullgren, Jeffrey T.; Harkins, Kristin A.; Bellamy, Scarlett L.; Gonzales, Amy; Tao, Yuanyuan; Zhu, Jingsan; Volpp, Kevin G.; Asch, David A.; Heisler, Michele; Karlawish, Jason
2014-01-01
Background: Financial incentives and peer networks could be delivered through eHealth technologies to encourage older adults to walk more. Methods: We conducted a 24-week randomized trial in which 92 older adults with a computer and Internet access received a pedometer, daily walking goals, and weekly feedback on goal achievement. Participants…
NASA Astrophysics Data System (ADS)
Bakuła, M.
GPS land surveys are usually based on the results of processing GPS carrier phase data. Code or pseudorange observations due to considerations of accuracy requirements and robustness are preferred in navigation and some GIS applications. Generally, the accuracy of that positioning is in the range of about 1-2meters or so, on average. But the main problem in code GPS positioning is to know how to estimate the real accuracy of DGPS positions. It is not such an easy process in code positioning when one reference station is used. In most commercial software, there are no values of accuracy but only positions are presented. DGPS positions without estimated errors cannot be used for surveying tasks and for most GIS applications due to the fact that every point has to have accuracy determined. However, when using static GPS positioning, it is well known that the accuracy is determined, both during baseline processing and next by the adjustment of a GPS network. These steps of validation with redundancy in classical static phase baseline solutions allow wide use of static or rapid static methods in the main land surveying tasks. Although these control steps are commonly used in many major surveying and engineering tasks, they are not always effective in terms of short-observation-time sessions. This paper presents a new network DGPS approach of positioning with the use of at least three reference stations. The approach concerns also valid accuracy estimation based on variance-covariance matrix in the least-squares calculations. The presented network DGPS approach has the ability of reliable accuracy estimation. Finally, network DGPS positioning is compared with static baselines solutions where five-min sessions were taken into consideration for two different rover stations. It was shown that in a short observation time of GPS positioning, code network DGPS results can give even centimetre accuracy and can be more reliable than static relative phase positioning where gross
An Online Social Network to Increase Walking in Dog Owners: A Randomized Trial
Schneider, Kristin L.; Murphy, Deirdra; Ferrara, Cynthia; Oleski, Jessica; Panza, Emily; Savage, Clara; Gada, Kimberly; Bozzella, Brianne; Olendzki, Effie; Kern, Daniel; Lemon, Stephenie C.
2014-01-01
PURPOSE Encouraging dog walking may increase physical activity in dog owners. This cluster randomized controlled trial investigated whether a social networking website (Meetup™) could be used to deliver a multi-component dog walking intervention to increase physical activity. METHODS Sedentary dog owners (n=102) participated. Eight neighborhoods were randomly assigned to the Meetup condition (Meetup) or a condition where participants received monthly emails with content from the American Heart Association on increasing physical activity (AHA). The Meetup intervention was delivered over 6 months and consisted of newsletters, dog walks, community events and an activity monitor. The primary outcome was steps; secondary outcomes included social support for walking, sense of community, perceived dog walking outcomes, barriers to dog walking and feasibility of the intervention. RESULTS Mixed model analyses examined change from baseline to post-intervention (6 months) and whether change in outcomes differed by condition. Daily steps increased over time (p=0.04, d=0.28), with no differences by condition. The time x condition interaction was significant for the perceived outcomes of dog walking (p=0.04, d=0.40), such that the Meetup condition reported an increase in the perceived positive outcomes of dog walking, whereas the AHA condition did not. Social support, sense of community and dog walking barriers did not significantly change. Meetup logins averaged 58.38 per week (SD=11.62). Within two months of the intervention ending, organization of the Meetup groups transitioned from study staff to Meetup members. CONCLUSION Results suggest that a Meetup group is feasible for increasing physical activity in dog owners. Further research is needed to understand how to increase participation in the Meetup group and facilitate greater connection among dog owners. PMID:25003777