Self-Consistent Scheme for Spike-Train Power Spectra in Heterogeneous Sparse Networks

Directory of Open Access Journals (Sweden)

Rodrigo F. O. Pena

2018-03-01

Full Text Available Recurrent networks of spiking neurons can be in an asynchronous state characterized by low or absent cross-correlations and spike statistics which resemble those of cortical neurons. Although spatial correlations are negligible in this state, neurons can show pronounced temporal correlations in their spike trains that can be quantified by the autocorrelation function or the spike-train power spectrum. Depending on cellular and network parameters, correlations display diverse patterns (ranging from simple refractory-period effects and stochastic oscillations to slow fluctuations and it is generally not well-understood how these dependencies come about. Previous work has explored how the single-cell correlations in a homogeneous network (excitatory and inhibitory integrate-and-fire neurons with nearly balanced mean recurrent input can be determined numerically from an iterative single-neuron simulation. Such a scheme is based on the fact that every neuron is driven by the network noise (i.e., the input currents from all its presynaptic partners but also contributes to the network noise, leading to a self-consistency condition for the input and output spectra. Here we first extend this scheme to homogeneous networks with strong recurrent inhibition and a synaptic filter, in which instabilities of the previous scheme are avoided by an averaging procedure. We then extend the scheme to heterogeneous networks in which (i different neural subpopulations (e.g., excitatory and inhibitory neurons have different cellular or connectivity parameters; (ii the number and strength of the input connections are random (Erdős-Rényi topology and thus different among neurons. In all heterogeneous cases, neurons are lumped in different classes each of which is represented by a single neuron in the iterative scheme; in addition, we make a Gaussian approximation of the input current to the neuron. These approximations seem to be justified over a broad range of

Self-consistent determination of the spike-train power spectrum in a neural network with sparse connectivity

Directory of Open Access Journals (Sweden)

Benjamin eDummer

2014-09-01

Full Text Available A major source of random variability in cortical networks is the quasi-random arrival of presynaptic action potentials from many other cells. In network studies as well as in the study of the response properties of single cells embedded in a network, synaptic background input is often approximated by Poissonian spike trains. However, the output statistics of the cells is in most cases far from being Poisson. This is inconsistent with the assumption of similar spike-train statistics for pre- and postsynaptic cells in a recurrent network. Here we tackle this problem for the popular class of integrate-and-fire neurons and study a self-consistent statistics of input and output spectra of neural spike trains. Instead of actually using a large network, we use an iterative scheme, in which we simulate a single neuron over several generations. In each of these generations, the neuron is stimulated with surrogate stochastic input that has a similar statistics as the output of the previous generation. For the surrogate input, we employ two distinct approximations: (i a superposition of renewal spike trains with the same interspike interval density as observed in the previous generation and (ii a Gaussian current with a power spectrum proportional to that observed in the previous generation. For input parameters that correspond to balanced input in the network, both the renewal and the Gaussian iteration procedure converge quickly and yield comparable results for the self-consistent spike-train power spectrum. We compare our results to large-scale simulations of a random sparsely connected network of leaky integrate-and-fire neurons (Brunel, J. Comp. Neurosci. 2000 and show that in the asynchronous regime close to a state of balanced synaptic input from the network, our iterative schemes provide excellent approximations to the autocorrelation of spike trains in the recurrent network.

Surface Level Ozone and its Adverse Effects on Crops and Forests: A Need for an Interdisciplinary Understanding

Directory of Open Access Journals (Sweden)

Sagar V. Krupa

2001-01-01

Full Text Available Surface level ozone (O3 is clearly a global scale problem with regard to its adverse effects on crops, forests and native, terrestrial plant ecosystems. Photochemists and meteorologists are continuing to define the chemistry and physics of the prevalence of O3 at the ground level. Similarly, plant scientists in the U.S. and Europe have examined the effects of O3 on crops and tree seedlings or saplings through large-scale studies. Examples include the U.S. National Crop Loss Assessment Network (NCLAN, the U.S. EPA’s (Environmental Protection Agency’s San Bernardino National Forest Photochemical Oxidant Study, European Open-top Chambers Programme (EOTCP, and several ongoing EU (European Union projects. In addition, there have been studies on mature tree responses through field measurements and by simulation modeling.

Neural network consistent empirical physical formula construction for neutron–gamma discrimination in gamma ray tracking

International Nuclear Information System (INIS)

Yildiz, Nihat; Akkoyun, Serkan

2013-01-01

Highlights: ► Detector responses in neutron–gamma discrimination were estimated by neural networks. ► Novel consistent neural network empirical physical formulas (EPFs) were constructed for detector responses. ► The EPFs are of explicit mathematical functional form. ► The EPFs can be used to derive various physical functions relevant to neutron–gamma discrimination in gamma ray tracking. -- Abstract: Gamma ray tracking is an efficient detection technique in studying exotic nuclei which lies far from beta stability line. To achieve very powerful and extraordinary resolution ability, new detectors based on gamma ray tracking are currently being developed. To reach this achievement, the neutron–gamma discrimination in these detectors is also an important task. In this paper, by suitable layered feedforward neural networks (LFNNs), we have constructed novel and consistent empirical physical formulas (EPFs) for some highly nonlinear detector counts measured in neutron–gamma discrimination. The detector counts data used in the discrimination was actually borrowed from our previous paper. The counts used here had been originally measured versus the following parameters: energy deposited in the first interaction points, difference in the incoming direction of initial gamma rays, and finally figure of merit values of the clusters determined by tracking. The LFNN–EPFs are of explicit mathematical functional form. Therefore, by various suitable operations of mathematical analysis, these LFNN–EPFs can be used to derivate further physical functions which might be potentially relevant to neutron–gamma discrimination performance of gamma ray tracking.

Rubber elasticity for percolation network consisting of Gaussian chains

Energy Technology Data Exchange (ETDEWEB)

Nishi, Kengo, E-mail: kengo.nishi@phys.uni-goettingen.de, E-mail: sakai@tetrapod.t.u-tokyo.ac.jp, E-mail: sibayama@issp.u-tokyo.ac.jp; Noguchi, Hiroshi; Shibayama, Mitsuhiro, E-mail: kengo.nishi@phys.uni-goettingen.de, E-mail: sakai@tetrapod.t.u-tokyo.ac.jp, E-mail: sibayama@issp.u-tokyo.ac.jp [Institute for Solid State Physics, The University of Tokyo, 5-1-5 Kashiwanoha, Kashiwa, Chiba 277-8581 (Japan); Sakai, Takamasa, E-mail: kengo.nishi@phys.uni-goettingen.de, E-mail: sakai@tetrapod.t.u-tokyo.ac.jp, E-mail: sibayama@issp.u-tokyo.ac.jp [Department of Bioengineering, School of Engineering, The University of Tokyo, 7-3-1 Hongo, Bunkyo-ku, Tokyo 113-8656 (Japan)

2015-11-14

A theory describing the elastic modulus for percolation networks of Gaussian chains on general lattices such as square and cubic lattices is proposed and its validity is examined with simulation and mechanical experiments on well-defined polymer networks. The theory was developed by generalizing the effective medium approximation (EMA) for Hookian spring network to Gaussian chain networks. From EMA theory, we found that the ratio of the elastic modulus at p, G to that at p = 1, G{sub 0}, must be equal to G/G{sub 0} = (p − 2/f)/(1 − 2/f) if the position of sites can be determined so as to meet the force balance, where p is the degree of cross-linking reaction. However, the EMA prediction cannot be applicable near its percolation threshold because EMA is a mean field theory. Thus, we combine real-space renormalization and EMA and propose a theory called real-space renormalized EMA, i.e., REMA. The elastic modulus predicted by REMA is in excellent agreement with the results of simulations and experiments of near-ideal diamond lattice gels.

Rubber elasticity for percolation network consisting of Gaussian chains

International Nuclear Information System (INIS)

Nishi, Kengo; Noguchi, Hiroshi; Shibayama, Mitsuhiro; Sakai, Takamasa

2015-01-01

A theory describing the elastic modulus for percolation networks of Gaussian chains on general lattices such as square and cubic lattices is proposed and its validity is examined with simulation and mechanical experiments on well-defined polymer networks. The theory was developed by generalizing the effective medium approximation (EMA) for Hookian spring network to Gaussian chain networks. From EMA theory, we found that the ratio of the elastic modulus at p, G to that at p = 1, G 0 , must be equal to G/G 0 = (p − 2/f)/(1 − 2/f) if the position of sites can be determined so as to meet the force balance, where p is the degree of cross-linking reaction. However, the EMA prediction cannot be applicable near its percolation threshold because EMA is a mean field theory. Thus, we combine real-space renormalization and EMA and propose a theory called real-space renormalized EMA, i.e., REMA. The elastic modulus predicted by REMA is in excellent agreement with the results of simulations and experiments of near-ideal diamond lattice gels

Bitcoin Meets Strong Consistency

OpenAIRE

Decker, Christian; Seidel, Jochen; Wattenhofer, Roger

2014-01-01

The Bitcoin system only provides eventual consistency. For everyday life, the time to confirm a Bitcoin transaction is prohibitively slow. In this paper we propose a new system, built on the Bitcoin blockchain, which enables strong consistency. Our system, PeerCensus, acts as a certification authority, manages peer identities in a peer-to-peer network, and ultimately enhances Bitcoin and similar systems with strong consistency. Our extensive analysis shows that PeerCensus is in a secure state...

CONSISTENCY UNDER SAMPLING OF EXPONENTIAL RANDOM GRAPH MODELS.

Science.gov (United States)

Shalizi, Cosma Rohilla; Rinaldo, Alessandro

2013-04-01

The growing availability of network data and of scientific interest in distributed systems has led to the rapid development of statistical models of network structure. Typically, however, these are models for the entire network, while the data consists only of a sampled sub-network. Parameters for the whole network, which is what is of interest, are estimated by applying the model to the sub-network. This assumes that the model is consistent under sampling , or, in terms of the theory of stochastic processes, that it defines a projective family. Focusing on the popular class of exponential random graph models (ERGMs), we show that this apparently trivial condition is in fact violated by many popular and scientifically appealing models, and that satisfying it drastically limits ERGM's expressive power. These results are actually special cases of more general results about exponential families of dependent random variables, which we also prove. Using such results, we offer easily checked conditions for the consistency of maximum likelihood estimation in ERGMs, and discuss some possible constructive responses.

Consistent sensor, relay, and link selection in wireless sensor networks

NARCIS (Netherlands)

Arroyo Valles, M.D.R.; Simonetto, A.; Leus, G.J.T.

2017-01-01

In wireless sensor networks, where energy is scarce, it is inefficient to have all nodes active because they consume a non-negligible amount of battery. In this paper we consider the problem of jointly selecting sensors, relays and links in a wireless sensor network where the active sensors need

A Network-Based Impact Measure for Propagated Losses in a Supply Chain Network Consisting of Resilient Components

Directory of Open Access Journals (Sweden)

Jesus Felix Bayta Valenzuela

2018-01-01

Full Text Available The topology of a supply chain network affects the impacts of disruptions in it. We formulate a network-based measure of the impact of a disruption loss in a supply chain propagating downstream from an originating node. The measure takes into account the loss profile of the originating node, the structure of the supply network, and the resilience of the network components. We obtain an analytical expression for the impact measure under a beta-distributed initial loss (generalizable to any continuous distribution supported on the interval 0,1, under a breakthrough scenario (in which a fraction of the initial production loss reaches a focal company downstream as opposed to containment upstream or at the originating point. Furthermore, we obtain a closed-form solution for a supply chain network with a k-ary tree topology; a numerical study is performed for a scale-free network and a random network. Our proposed approach enables the evaluation of potential losses for a focal company considering its supply chain network structure, which may help the company to plan or redesign a robust and resilient network in response to different types of disruptions.

For a consistent policy in the struggle against proliferation networks

International Nuclear Information System (INIS)

Schlumberger, Guillaume; Gruselle, Bruno

2007-01-01

Proliferation networks operate like companies. They must be capable of coordinating a series of elementary logistics, financial and technical functions. Due to the increase in worldwide exchanges, the reinforcement of existing export control tools alone will not be sufficient to face the increase in proliferation flows. Despite widespread reporting in the media, interdiction operations also can only have limited effect on networks, due to their occasional nature, if they are undertaken independently of an approach targeting other functions. It also seems hardly realistic to wish to neutralize a proliferation network only by freezing part of its credits in the framework of a repressive approach. Setting up an overall policy provides a means of coordinating intelligence actions, repression tools and interdiction means both nationally and internationally, and therefore appears as the only viable solution in the struggle against proliferation networks. This is a complex task for it requires the organization of inter-ministerial (or interagency) responsibilities, and in particular it requires an equilibrium between long term and short term actions. Finally, it depends on the reinforcement of links between the administrations involved and private participants including service companies, financial institutions and enterprises. (authors)

Consistent robustness analysis (CRA) identifies biologically relevant properties of regulatory network models.

Science.gov (United States)

Saithong, Treenut; Painter, Kevin J; Millar, Andrew J

2010-12-16

A number of studies have previously demonstrated that "goodness of fit" is insufficient in reliably classifying the credibility of a biological model. Robustness and/or sensitivity analysis is commonly employed as a secondary method for evaluating the suitability of a particular model. The results of such analyses invariably depend on the particular parameter set tested, yet many parameter values for biological models are uncertain. Here, we propose a novel robustness analysis that aims to determine the "common robustness" of the model with multiple, biologically plausible parameter sets, rather than the local robustness for a particular parameter set. Our method is applied to two published models of the Arabidopsis circadian clock (the one-loop [1] and two-loop [2] models). The results reinforce current findings suggesting the greater reliability of the two-loop model and pinpoint the crucial role of TOC1 in the circadian network. Consistent Robustness Analysis can indicate both the relative plausibility of different models and also the critical components and processes controlling each model.

Consistent individual differences and population plasticity in network-derived sociality: An experimental manipulation of density in a gregarious ungulate

Science.gov (United States)

O’Brien, Paul P.; Vander Wal, Eric

2018-01-01

In many taxa, individual social traits appear to be consistent across time and context, thus meeting the criteria for animal personality. How these differences are maintained in response to changes in population density is unknown, particularly in large mammals, such as ungulates. Using a behavioral reaction norm (BRN) framework, we examined how among- and within-individual variation in social connectedness, measured using social network analyses, change as a function of population density. We studied a captive herd of elk (Cervus canadensis) separated into a group of male elk and a group of female elk. Males and females were exposed to three different density treatments and we recorded social associations between individuals with proximity-detecting radio-collars fitted to elk. We constructed social networks using dyadic association data and calculated three social network metrics reflective of social connectedness: eigenvector centrality, graph strength, and degree. Elk exhibited consistent individual differences in social connectedness across densities; however, they showed little individual variation in their response to changes in density, i.e., individuals oftentimes responded plastically, but in the same manner to changes in density. Female elk had highest connectedness at an intermediate density. In contrast, male elk increased connectedness with increasing density. Whereas this may suggest that the benefits of social connectedness outweigh the costs of increased competition at higher density for males, females appear to exhibit a threshold in social benefits (e.g. predator detection and forage information). Our study illustrates the importance of viewing social connectedness as a density-dependent trait, particularly in the context of plasticity. Moreover, we highlight the need to revisit our understanding of density dependence as a population-level phenomenon by accounting for consistent individual differences not only in social connectedness, but likely

The pairwise phase consistency in cortical network and its relationship with neuronal activation

Directory of Open Access Journals (Sweden)

Wang Daming

2017-01-01

Full Text Available Gamma-band neuronal oscillation and synchronization with the range of 30-90 Hz are ubiquitous phenomenon across numerous brain areas and various species, and correlated with plenty of cognitive functions. The phase of the oscillation, as one aspect of CTC (Communication through Coherence hypothesis, underlies various functions for feature coding, memory processing and behaviour performing. The PPC (Pairwise Phase Consistency, an improved coherence measure, statistically quantifies the strength of phase synchronization. In order to evaluate the PPC and its relationships with input stimulus, neuronal activation and firing rate, a simplified spiking neuronal network is constructed to simulate orientation columns in primary visual cortex. If the input orientation stimulus is preferred for a certain orientation column, neurons within this corresponding column will obtain higher firing rate and stronger neuronal activation, which consequently engender higher PPC values, with higher PPC corresponding to higher firing rate. In addition, we investigate the PPC in time resolved analysis with a sliding window.

Worst-case optimal approximation algorithms for maximizing triplet consistency within phylogenetic networks

NARCIS (Netherlands)

J. Byrka (Jaroslaw); K.T. Huber; S.M. Kelk (Steven); P. Gawrychowski

2009-01-01

htmlabstractThe study of phylogenetic networks is of great interest to computational evolutionary biology and numerous different types of such structures are known. This article addresses the following question concerning rooted versions of phylogenetic networks. What is the maximum value of pset

Decentralized Consistent Updates in SDN

KAUST Repository

Nguyen, Thanh Dang

2017-04-10

We present ez-Segway, a decentralized mechanism to consistently and quickly update the network state while preventing forwarding anomalies (loops and blackholes) and avoiding link congestion. In our design, the centralized SDN controller only pre-computes information needed by the switches during the update execution. This information is distributed to the switches, which use partial knowledge and direct message passing to efficiently realize the update. This separation of concerns has the key benefit of improving update performance as the communication and computation bottlenecks at the controller are removed. Our evaluations via network emulations and large-scale simulations demonstrate the efficiency of ez-Segway, which compared to a centralized approach, improves network update times by up to 45% and 57% at the median and the 99th percentile, respectively. A deployment of a system prototype in a real OpenFlow switch and an implementation in P4 demonstrate the feasibility and low overhead of implementing simple network update functionality within switches.

Mood-dependent integration in discourse comprehension: happy and sad moods affect consistency processing via different brain networks.

Science.gov (United States)

Egidi, Giovanna; Caramazza, Alfonso

2014-12-01

According to recent research on language comprehension, the semantic features of a text are not the only determinants of whether incoming information is understood as consistent. Listeners' pre-existing affective states play a crucial role as well. The current fMRI experiment examines the effects of happy and sad moods during comprehension of consistent and inconsistent story endings, focusing on brain regions previously linked to two integration processes: inconsistency detection, evident in stronger responses to inconsistent endings, and fluent processing (accumulation), evident in stronger responses to consistent endings. The analysis evaluated whether differences in the BOLD response for consistent and inconsistent story endings correlated with self-reported mood scores after a mood induction procedure. Mood strongly affected regions previously associated with inconsistency detection. Happy mood increased sensitivity to inconsistency in regions specific for inconsistency detection (e.g., left IFG, left STS), whereas sad mood increased sensitivity to inconsistency in regions less specific for language processing (e.g., right med FG, right SFG). Mood affected more weakly regions involved in accumulation of information. These results show that mood can influence activity in areas mediating well-defined language processes, and highlight that integration is the result of context-dependent mechanisms. The finding that language comprehension can involve different networks depending on people's mood highlights the brain's ability to reorganize its functions. Copyright © 2014 Elsevier Inc. All rights reserved.

Orthogonal Operation of Constitutional Dynamic Networks Consisting of DNA-Tweezer Machines.

Science.gov (United States)

Yue, Liang; Wang, Shan; Cecconello, Alessandro; Lehn, Jean-Marie; Willner, Itamar

2017-12-26

Overexpression or down-regulation of cellular processes are often controlled by dynamic chemical networks. Bioinspired by nature, we introduce constitutional dynamic networks (CDNs) as systems that emulate the principle of the nature processes. The CDNs comprise dynamically interconvertible equilibrated constituents that respond to external triggers by adapting the composition of the dynamic mixture to the energetic stabilization of the constituents. We introduce a nucleic acid-based CDN that includes four interconvertible and mechanically triggered tweezers, AA', BB', AB' and BA', existing in closed, closed, open, and open configurations, respectively. By subjecting the CDN to auxiliary triggers, the guided stabilization of one of the network constituents dictates the dynamic reconfiguration of the structures of the tweezers constituents. The orthogonal and reversible operations of the CDN DNA tweezers are demonstrated, using T-A·T triplex or K + -stabilized G-quadruplex as structural motifs that control the stabilities of the constituents. The implications of the study rest on the possible applications of input-guided CDN assemblies for sensing, logic gate operations, and programmed activation of molecular machines.

Hierarchical Network Design

DEFF Research Database (Denmark)

Thomadsen, Tommy

2005-01-01

Communication networks are immensely important today, since both companies and individuals use numerous services that rely on them. This thesis considers the design of hierarchical (communication) networks. Hierarchical networks consist of layers of networks and are well-suited for coping...... with changing and increasing demands. Two-layer networks consist of one backbone network, which interconnects cluster networks. The clusters consist of nodes and links, which connect the nodes. One node in each cluster is a hub node, and the backbone interconnects the hub nodes of each cluster and thus...... the clusters. The design of hierarchical networks involves clustering of nodes, hub selection, and network design, i.e. selection of links and routing of ows. Hierarchical networks have been in use for decades, but integrated design of these networks has only been considered for very special types of networks...

An Analysis of Weakly Consistent Replication Systems in an Active Distributed Network

OpenAIRE

Amit Chougule; Pravin Ghewari

2011-01-01

With the sudden increase in heterogeneity and distribution of data in wide-area networks, more flexible, efficient and autonomous approaches for management and data distribution are needed. In recent years, the proliferation of inter-networks and distributed applications has increased the demand for geographically-distributed replicated databases. The architecture of Bayou provides features that address the needs of database storage of world-wide applications. Key is the use of weak consisten...

Self-consistent signal-to-noise analysis of the statistical behavior of analog neural networks and enhancement of the storage capacity

Science.gov (United States)

Shiino, Masatoshi; Fukai, Tomoki

1993-08-01

Based on the self-consistent signal-to-noise analysis (SCSNA) capable of dealing with analog neural networks with a wide class of transfer functions, enhancement of the storage capacity of associative memory and the related statistical properties of neural networks are studied for random memory patterns. Two types of transfer functions with the threshold parameter θ are considered, which are derived from the sigmoidal one to represent the output of three-state neurons. Neural networks having a monotonically increasing transfer function FM, FM(u)=sgnu (||u||>θ), FM(u)=0 (||u||memory patterns), implying the reduction of the number of spurious states. The behavior of the storage capacity with changing θ is qualitatively the same as that of the Ising spin neural networks with varying temperature. On the other hand, the nonmonotonic transfer function FNM, FNM(u)=sgnu (||u||=θ) gives rise to remarkable features in several respects. First, it yields a large enhancement of the storage capacity compared with the Amit-Gutfreund-Sompolinsky (AGS) value: with decreasing θ from θ=∞, the storage capacity αc of such a network is increased from the AGS value (~=0.14) to attain its maximum value of ~=0.42 at θ~=0.7 and afterwards is decreased to vanish at θ=0. Whereas for θ>~1 the storage capacity αc coincides with the value αc~ determined by the SCSNA as the upper bound of α ensuring the existence of retrieval solutions, for θr≠0 (i.e., finite width of the local field distribution), which is implied by the order-parameter equations of the SCSNA, disappears at a certain critical loading rate α0, and for αr=0+). As a consequence, memory retrieval without errors becomes possible even in the saturation limit α≠0. Results of the computer simulations on the statistical properties of the novel phase with αstorage capacity is also analyzed for the two types of networks. It is conspicuous for the networks with FNM, where the self-couplings increase the stability of

Statistical mechanics of stochastic neural networks: Relationship between the self-consistent signal-to-noise analysis, Thouless-Anderson-Palmer equation, and replica symmetric calculation approaches

International Nuclear Information System (INIS)

Shiino, Masatoshi; Yamana, Michiko

2004-01-01

We study the statistical mechanical aspects of stochastic analog neural network models for associative memory with correlation type learning. We take three approaches to derive the set of the order parameter equations for investigating statistical properties of retrieval states: the self-consistent signal-to-noise analysis (SCSNA), the Thouless-Anderson-Palmer (TAP) equation, and the replica symmetric calculation. On the basis of the cavity method the SCSNA can be generalized to deal with stochastic networks. We establish the close connection between the TAP equation and the SCSNA to elucidate the relationship between the Onsager reaction term of the TAP equation and the output proportional term of the SCSNA that appear in the expressions for the local fields

Personalized recommendation based on unbiased consistence

Science.gov (United States)

Zhu, Xuzhen; Tian, Hui; Zhang, Ping; Hu, Zheng; Zhou, Tao

2015-08-01

Recently, in physical dynamics, mass-diffusion-based recommendation algorithms on bipartite network provide an efficient solution by automatically pushing possible relevant items to users according to their past preferences. However, traditional mass-diffusion-based algorithms just focus on unidirectional mass diffusion from objects having been collected to those which should be recommended, resulting in a biased causal similarity estimation and not-so-good performance. In this letter, we argue that in many cases, a user's interests are stable, and thus bidirectional mass diffusion abilities, no matter originated from objects having been collected or from those which should be recommended, should be consistently powerful, showing unbiased consistence. We further propose a consistence-based mass diffusion algorithm via bidirectional diffusion against biased causality, outperforming the state-of-the-art recommendation algorithms in disparate real data sets, including Netflix, MovieLens, Amazon and Rate Your Music.

Toward a self-consistent and unitary reaction network for big bang nucleosynthesis

International Nuclear Information System (INIS)

Paris, Mark W.; Brown, Lowell S.; Hale, Gerald M.; Hayes-Sterbenz, Anna C.; Jungman, Gerard; Kawano, Toshihiko; Fuller, George M.; Grohs, Evan B.; Kunieda, Satoshi

2014-01-01

Unitarity, the mathematical expression of the conservation of probability in multichannel reactions, is an essential ingredient in the development of accurate nuclear reaction networks appropriate for nucleosynthesis in a variety of environments. We describe our ongoing program to develop a 'unitary reaction network' for the big-bang nucleosynthesis environment and look at an example of the need and power of unitary parametrizations of nuclear scattering and reaction data. Recent attention has been focused on the possible role of the 9 B compound nuclear system in the resonant destruction of 7 Li during primordial nucleosynthesis. We have studied reactions in the 9 B compound system with a multichannel, two-body unitary R-matrix code (EDA) using the known elastic and reaction data, in a four-channel treatment. The data include elastic 6 Li( 3 He, 3 He) 6 Li differential cross sections from 0.7 to 2.0 MeV, integrated reaction cross sections for energies from 0.7 to 5.0 MeV for 6 Li( 3 He,p) 8 Be* and from 0.4 to 5.0 MeV for the 6 Li( 3 He,γ) 7 Be reaction. Capture data have been added to the previous analysis with integrated cross section measurements from 0.7 to 0.825 MeV for 6 Li( 3 He,γ) 9 B. The resulting resonance parameters are compared with tabulated values from TUNL Nuclear Data Group analyses. Previously unidentified resonances are noted and the relevance of this analysis and a unitary reaction network for big-bang nucleosynthesis are emphasized. (author)

Toward a self-consistent and unitary reaction network for big bang nucleosynthesis

Energy Technology Data Exchange (ETDEWEB)

Paris, Mark W.; Brown, Lowell S.; Hale, Gerald M.; Hayes-Sterbenz, Anna C.; Jungman, Gerard; Kawano, Toshihiko, E-mail: mparis@lanl.gov [Los Alamos National Laboratory, Los Alamos, New Mexico (United States); Fuller, George M.; Grohs, Evan B. [Department of Physics, University of California, San Diego, La Jolla, CA (United States); Kunieda, Satoshi [Nuclear Data Center, Japan Atomic Energy Agency, Tokai-mura Naka-gun, Ibaraki (Japan)

2014-07-01

Unitarity, the mathematical expression of the conservation of probability in multichannel reactions, is an essential ingredient in the development of accurate nuclear reaction networks appropriate for nucleosynthesis in a variety of environments. We describe our ongoing program to develop a 'unitary reaction network' for the big-bang nucleosynthesis environment and look at an example of the need and power of unitary parametrizations of nuclear scattering and reaction data. Recent attention has been focused on the possible role of the {sup 9}B compound nuclear system in the resonant destruction of {sup 7}Li during primordial nucleosynthesis. We have studied reactions in the {sup 9}B compound system with a multichannel, two-body unitary R-matrix code (EDA) using the known elastic and reaction data, in a four-channel treatment. The data include elastic {sup 6}Li({sup 3}He,{sup 3}He){sup 6}Li differential cross sections from 0.7 to 2.0 MeV, integrated reaction cross sections for energies from 0.7 to 5.0 MeV for {sup 6}Li({sup 3}He,p){sup 8}Be* and from 0.4 to 5.0 MeV for the {sup 6}Li({sup 3}He,γ){sup 7}Be reaction. Capture data have been added to the previous analysis with integrated cross section measurements from 0.7 to 0.825 MeV for {sup 6}Li({sup 3}He,γ){sup 9}B. The resulting resonance parameters are compared with tabulated values from TUNL Nuclear Data Group analyses. Previously unidentified resonances are noted and the relevance of this analysis and a unitary reaction network for big-bang nucleosynthesis are emphasized. (author)

Design of micro distribution systems consisting of long channels with arbitrary cross sections

International Nuclear Information System (INIS)

Misdanitis, S; Valougeorgis, D

2012-01-01

Gas flows through long micro-channels of various cross sections have been extensively investigated over the years both numerically and experimentally. In various technological applications including microfluidics, these micro-channels are combined together in order to form a micro-channel network. Computational algorithms for solving gas pipe networks in the hydrodynamic regime are well developed. However, corresponding tools for solving networks consisting of micro-channels under any degree of gas rarefaction is very limited. Recently a kinetic algorithm has been developed to simulate gas distribution systems consisting of long circular channels under any vacuum conditions. In the present work this algorithm is generalized and extended into micro-channels of arbitrary cross-section etched by KOH in silicon (triangular and trapezoidal channels with acute angle of 54.74°). Since a kinetic approach is implemented, the analysis is valid and the results are accurate in the whole range of the Knudsen number, while the involved computational effort is very small. This is achieved by successfully integrating the kinetic results for the corresponding single channels into the general solver for designing the gas pipe network. To demonstrate the feasibility of the approach two typical systems consisting of long rectangular and trapezoidal micro-channels are solved.

Network and Service Monitoring in Heterogeneous Home Networks

NARCIS (Netherlands)

Delphinanto, A.

2012-01-01

Home networks are becoming dynamic and technologically heterogeneous. They consist of an increasing number of devices which offer several functionalities and can be used for many different services. In the home, these devices are interconnected using a mixture of networking technologies (for

Texture synthesis using convolutional neural networks with long-range consistency and spectral constraints

NARCIS (Netherlands)

Schreiber, Shaun; Geldenhuys, Jaco; Villiers, De Hendrik

2017-01-01

Procedural texture generation enables the creation of more rich and detailed virtual environments without the help of an artist. However, finding a flexible generative model of real world textures remains an open problem. We present a novel Convolutional Neural Network based texture model

Reciprocity of weighted networks.

Science.gov (United States)

Squartini, Tiziano; Picciolo, Francesco; Ruzzenenti, Franco; Garlaschelli, Diego

2013-01-01

In directed networks, reciprocal links have dramatic effects on dynamical processes, network growth, and higher-order structures such as motifs and communities. While the reciprocity of binary networks has been extensively studied, that of weighted networks is still poorly understood, implying an ever-increasing gap between the availability of weighted network data and our understanding of their dyadic properties. Here we introduce a general approach to the reciprocity of weighted networks, and define quantities and null models that consistently capture empirical reciprocity patterns at different structural levels. We show that, counter-intuitively, previous reciprocity measures based on the similarity of mutual weights are uninformative. By contrast, our measures allow to consistently classify different weighted networks according to their reciprocity, track the evolution of a network's reciprocity over time, identify patterns at the level of dyads and vertices, and distinguish the effects of flux (im)balances or other (a)symmetries from a true tendency towards (anti-)reciprocation.

Direct lifts of coupled cell networks

Science.gov (United States)

Dias, A. P. S.; Moreira, C. S.

2018-04-01

In networks of dynamical systems, there are spaces defined in terms of equalities of cell coordinates which are flow-invariant under any dynamical system that has a form consistent with the given underlying network structure—the network synchrony subspaces. Given a network and one of its synchrony subspaces, any system with a form consistent with the network, restricted to the synchrony subspace, defines a new system which is consistent with a smaller network, called the quotient network of the original network by the synchrony subspace. Moreover, any system associated with the quotient can be interpreted as the restriction to the synchrony subspace of a system associated with the original network. We call the larger network a lift of the smaller network, and a lift can be interpreted as a result of the cellular splitting of the smaller network. In this paper, we address the question of the uniqueness in this lifting process in terms of the networks’ topologies. A lift G of a given network Q is said to be direct when there are no intermediate lifts of Q between them. We provide necessary and sufficient conditions for a lift of a general network to be direct. Our results characterize direct lifts using the subnetworks of all splitting cells of Q and of all split cells of G. We show that G is a direct lift of Q if and only if either the split subnetwork is a direct lift or consists of two copies of the splitting subnetwork. These results are then applied to the class of regular uniform networks and to the special classes of ring networks and acyclic networks. We also illustrate that one of the applications of our results is to the lifting bifurcation problem.

Consistency Checking of Web Service Contracts

DEFF Research Database (Denmark)

Cambronero, M. Emilia; Okika, Joseph C.; Ravn, Anders Peter

2008-01-01

Behavioural properties are analyzed for web service contracts formulated in Business Process Execution Language (BPEL) and Choreography Description Language (CDL). The key result reported is an automated technique to check consistency between protocol aspects of the contracts. The contracts...... are abstracted to (timed) automata and from there a simulation is set up, which is checked using automated tools for analyzing networks of finite state processes. Here we use the Concurrency Work Bench. The proposed techniques are illustrated with a case study that include otherwise difficult to analyze fault...

Network security

CERN Document Server

Perez, André

2014-01-01

This book introduces the security mechanisms deployed in Ethernet, Wireless-Fidelity (Wi-Fi), Internet Protocol (IP) and MultiProtocol Label Switching (MPLS) networks. These mechanisms are grouped throughout the book according to the following four functions: data protection, access control, network isolation, and data monitoring. Data protection is supplied by data confidentiality and integrity control services. Access control is provided by a third-party authentication service. Network isolation is supplied by the Virtual Private Network (VPN) service. Data monitoring consists of applying

Incorporating rapid neocortical learning of new schema-consistent information into complementary learning systems theory.

Science.gov (United States)

McClelland, James L

2013-11-01

The complementary learning systems theory of the roles of hippocampus and neocortex (McClelland, McNaughton, & O'Reilly, 1995) holds that the rapid integration of arbitrary new information into neocortical structures is avoided to prevent catastrophic interference with structured knowledge representations stored in synaptic connections among neocortical neurons. Recent studies (Tse et al., 2007, 2011) showed that neocortical circuits can rapidly acquire new associations that are consistent with prior knowledge. The findings challenge the complementary learning systems theory as previously presented. However, new simulations extending those reported in McClelland et al. (1995) show that new information that is consistent with knowledge previously acquired by a putatively cortexlike artificial neural network can be learned rapidly and without interfering with existing knowledge; it is when inconsistent new knowledge is acquired quickly that catastrophic interference ensues. Several important features of the findings of Tse et al. (2007, 2011) are captured in these simulations, indicating that the neural network model used in McClelland et al. has characteristics in common with neocortical learning mechanisms. An additional simulation generalizes beyond the network model previously used, showing how the rate of change of cortical connections can depend on prior knowledge in an arguably more biologically plausible network architecture. In sum, the findings of Tse et al. are fully consistent with the idea that hippocampus and neocortex are complementary learning systems. Taken together, these findings and the simulations reported here advance our knowledge by bringing out the role of consistency of new experience with existing knowledge and demonstrating that the rate of change of connections in real and artificial neural networks can be strongly prior-knowledge dependent. PsycINFO Database Record (c) 2013 APA, all rights reserved.

Consistent empirical physical formula construction for recoil energy distribution in HPGe detectors by using artificial neural networks

International Nuclear Information System (INIS)

Akkoyun, Serkan; Yildiz, Nihat

2012-01-01

The gamma-ray tracking technique is a highly efficient detection method in experimental nuclear structure physics. On the basis of this method, two gamma-ray tracking arrays, AGATA in Europe and GRETA in the USA, are currently being tested. The interactions of neutrons in these detectors lead to an unwanted background in the gamma-ray spectra. Thus, the interaction points of neutrons in these detectors have to be determined in the gamma-ray tracking process in order to improve photo-peak efficiencies and peak-to-total ratios of the gamma-ray peaks. In this paper, the recoil energy distributions of germanium nuclei due to inelastic scatterings of 1–5 MeV neutrons were first obtained by simulation experiments. Secondly, as a novel approach, for these highly nonlinear detector responses of recoiling germanium nuclei, consistent empirical physical formulas (EPFs) were constructed by appropriate feedforward neural networks (LFNNs). The LFNN-EPFs are of explicit mathematical functional form. Therefore, the LFNN-EPFs can be used to derive further physical functions which could be potentially relevant for the determination of neutron interactions in gamma-ray tracking process.

LHCb DAQ network upgrade tests

CERN Document Server

Pisani, Flavio

2013-01-01

My project concerned the evaluation of new technologies for the DAQ network upgrade of LHCb. The first part consisted in developing and Open Flow-based Clos network. This new technology is very interesting and powerful but, as shown by the results, it still needs further improvements. The second part consisted in testing and benchmarking 40GbE network equipment: Mellanox MT27500, Chelsio T580 and Huawei Cloud Engine 12804. An event-building simulation is currently been performed in order to check the feasibility of the DAQ network upgrade in LS2. The first results are promising.

Optimal Network-Topology Design

Science.gov (United States)

Li, Victor O. K.; Yuen, Joseph H.; Hou, Ting-Chao; Lam, Yuen Fung

1987-01-01

Candidate network designs tested for acceptability and cost. Optimal Network Topology Design computer program developed as part of study on topology design and analysis of performance of Space Station Information System (SSIS) network. Uses efficient algorithm to generate candidate network designs consisting of subsets of set of all network components, in increasing order of total costs and checks each design to see whether it forms acceptable network. Technique gives true cost-optimal network and particularly useful when network has many constraints and not too many components. Program written in PASCAL.

Structural Consistency, Consistency, and Sequential Rationality.

OpenAIRE

Kreps, David M; Ramey, Garey

1987-01-01

Sequential equilibria comprise consistent beliefs and a sequentially ra tional strategy profile. Consistent beliefs are limits of Bayes ratio nal beliefs for sequences of strategies that approach the equilibrium strategy. Beliefs are structurally consistent if they are rationaliz ed by some single conjecture concerning opponents' strategies. Consis tent beliefs are not necessarily structurally consistent, notwithstan ding a claim by Kreps and Robert Wilson (1982). Moreover, the spirit of stru...

Home area networks

NARCIS (Netherlands)

Koonen, A.M.J.

2013-01-01

This article consists of a collection of slides from the author's conference presentation. Some of the specific areas/topics discussed include: Convergence in home networks, home service scenarios; Home wired network architectures, CapEx and OpEx; Residential Gateway; Optical fiber types;

The Laplacian spectrum of neural networks

Science.gov (United States)

de Lange, Siemon C.; de Reus, Marcel A.; van den Heuvel, Martijn P.

2014-01-01

The brain is a complex network of neural interactions, both at the microscopic and macroscopic level. Graph theory is well suited to examine the global network architecture of these neural networks. Many popular graph metrics, however, encode average properties of individual network elements. Complementing these “conventional” graph metrics, the eigenvalue spectrum of the normalized Laplacian describes a network's structure directly at a systems level, without referring to individual nodes or connections. In this paper, the Laplacian spectra of the macroscopic anatomical neuronal networks of the macaque and cat, and the microscopic network of the Caenorhabditis elegans were examined. Consistent with conventional graph metrics, analysis of the Laplacian spectra revealed an integrative community structure in neural brain networks. Extending previous findings of overlap of network attributes across species, similarity of the Laplacian spectra across the cat, macaque and C. elegans neural networks suggests a certain level of consistency in the overall architecture of the anatomical neural networks of these species. Our results further suggest a specific network class for neural networks, distinct from conceptual small-world and scale-free models as well as several empirical networks. PMID:24454286

Managerial Challenges Within Networks - Emphasizing the Paradox of Network Participation

DEFF Research Database (Denmark)

Jakobsen, Morten

2003-01-01

Flexibility and access to numerous resources are essential benefits associated with network participation. An important aspect of managing the network participation of a company is to maintain a dynamic portfolio of partners, and thereby keep up the strategic opportunities for development. However......, maintaining the dynamics within a network seems to be a complex challenge. There is a risk that the network ends up in The Paradox of Network Participation. The desired renewal and flexibility are not utilised because the involved parties preserve the existing networks structure consisting of the same...... and thereby sort out the paradox of network participation. Trust and information are mechanisms employed to absorb uncertainty. The relationship between trust and the requirement for information depends on the maturity of the relationship. When trust becomes too important as uncertainty absorption mechanism...

Managerial challenges within networks: emphasizing the paradox of network participation

DEFF Research Database (Denmark)

Jakobsen, Morten

Flexibility and access to numerous resources are essential benefits associated with network participation. An important aspect of managing the network participation of a company is to maintain a dynamic portfolio of partners, and thereby keep up the strategic opportunities for development. However......, maintaining the dynamics within a network seems to be a complex challenge. There is a risk that the network ends up in The Paradox of Network Participation. The desired renewal and flexibility are not utilised because the involved parties preserve the existing networks structure consisting of the same...... and thereby sort out the paradox of network participation. Trust and information are mechanisms employed to absorb uncertainty. The relationship between trust and the requirement for information depends on the maturity of the relationship. When trust becomes too important as uncertainty absorption mechanism...

Cross-linked structure of network evolution

International Nuclear Information System (INIS)

Bassett, Danielle S.; Wymbs, Nicholas F.; Grafton, Scott T.; Porter, Mason A.; Mucha, Peter J.

2014-01-01

We study the temporal co-variation of network co-evolution via the cross-link structure of networks, for which we take advantage of the formalism of hypergraphs to map cross-link structures back to network nodes. We investigate two sets of temporal network data in detail. In a network of coupled nonlinear oscillators, hyperedges that consist of network edges with temporally co-varying weights uncover the driving co-evolution patterns of edge weight dynamics both within and between oscillator communities. In the human brain, networks that represent temporal changes in brain activity during learning exhibit early co-evolution that then settles down with practice. Subsequent decreases in hyperedge size are consistent with emergence of an autonomous subgraph whose dynamics no longer depends on other parts of the network. Our results on real and synthetic networks give a poignant demonstration of the ability of cross-link structure to uncover unexpected co-evolution attributes in both real and synthetic dynamical systems. This, in turn, illustrates the utility of analyzing cross-links for investigating the structure of temporal networks

Cross-linked structure of network evolution

Energy Technology Data Exchange (ETDEWEB)

Bassett, Danielle S., E-mail: dsb@seas.upenn.edu [Department of Bioengineering, University of Pennsylvania, Philadelphia, Pennsylvania 19104 (United States); Department of Physics, University of California, Santa Barbara, California 93106 (United States); Sage Center for the Study of the Mind, University of California, Santa Barbara, California 93106 (United States); Wymbs, Nicholas F.; Grafton, Scott T. [Department of Psychology and UCSB Brain Imaging Center, University of California, Santa Barbara, California 93106 (United States); Porter, Mason A. [Oxford Centre for Industrial and Applied Mathematics, Mathematical Institute, University of Oxford, Oxford OX2 6GG (United Kingdom); CABDyN Complexity Centre, University of Oxford, Oxford, OX1 1HP (United Kingdom); Mucha, Peter J. [Carolina Center for Interdisciplinary Applied Mathematics, Department of Mathematics, University of North Carolina, Chapel Hill, North Carolina 27599 (United States); Department of Applied Physical Sciences, University of North Carolina, Chapel Hill, North Carolina 27599 (United States)

2014-03-15

We study the temporal co-variation of network co-evolution via the cross-link structure of networks, for which we take advantage of the formalism of hypergraphs to map cross-link structures back to network nodes. We investigate two sets of temporal network data in detail. In a network of coupled nonlinear oscillators, hyperedges that consist of network edges with temporally co-varying weights uncover the driving co-evolution patterns of edge weight dynamics both within and between oscillator communities. In the human brain, networks that represent temporal changes in brain activity during learning exhibit early co-evolution that then settles down with practice. Subsequent decreases in hyperedge size are consistent with emergence of an autonomous subgraph whose dynamics no longer depends on other parts of the network. Our results on real and synthetic networks give a poignant demonstration of the ability of cross-link structure to uncover unexpected co-evolution attributes in both real and synthetic dynamical systems. This, in turn, illustrates the utility of analyzing cross-links for investigating the structure of temporal networks.

Three-dimensional aromatic networks.

Science.gov (United States)

Toyota, Shinji; Iwanaga, Tetsuo

2014-01-01

Three-dimensional (3D) networks consisting of aromatic units and linkers are reviewed from various aspects. To understand principles for the construction of such compounds, we generalize the roles of building units, the synthetic approaches, and the classification of networks. As fundamental compounds, cyclophanes with large aromatic units and aromatic macrocycles with linear acetylene linkers are highlighted in terms of transannular interactions between aromatic units, conformational preference, and resolution of chiral derivatives. Polycyclic cage compounds are constructed from building units by linkages via covalent bonds, metal-coordination bonds, or hydrogen bonds. Large cage networks often include a wide range of guest species in their cavity to afford novel inclusion compounds. Topological isomers consisting of two or more macrocycles are formed by cyclization of preorganized species. Some complicated topological networks are constructed by self-assembly of simple building units.

Global Electricity Trade Network: Structures and Implications

Science.gov (United States)

Ji, Ling; Jia, Xiaoping; Chiu, Anthony S. F.; Xu, Ming

2016-01-01

Nations increasingly trade electricity, and understanding the structure of the global power grid can help identify nations that are critical for its reliability. This study examines the global grid as a network with nations as nodes and international electricity trade as links. We analyze the structure of the global electricity trade network and find that the network consists of four sub-networks, and provide a detailed analysis of the largest network, Eurasia. Russia, China, Ukraine, and Azerbaijan have high betweenness measures in the Eurasian sub-network, indicating the degrees of centrality of the positions they hold. The analysis reveals that the Eurasian sub-network consists of seven communities based on the network structure. We find that the communities do not fully align with geographical proximity, and that the present international electricity trade in the Eurasian sub-network causes an approximately 11 million additional tons of CO2 emissions. PMID:27504825

Identification of Resting State Networks Involved in Executive Function.

Science.gov (United States)

Connolly, Joanna; McNulty, Jonathan P; Boran, Lorraine; Roche, Richard A P; Delany, David; Bokde, Arun L W

2016-06-01

The structural networks in the human brain are consistent across subjects, and this is reflected also in that functional networks across subjects are relatively consistent. These findings are not only present during performance of a goal oriented task but there are also consistent functional networks during resting state. It suggests that goal oriented activation patterns may be a function of component networks identified using resting state. The current study examines the relationship between resting state networks measured and patterns of neural activation elicited during a Stroop task. The association between the Stroop-activated networks and the resting state networks was quantified using spatial linear regression. In addition, we investigated if the degree of spatial association of resting state networks with the Stroop task may predict performance on the Stroop task. The results of this investigation demonstrated that the Stroop activated network can be decomposed into a number of resting state networks, which were primarily associated with attention, executive function, visual perception, and the default mode network. The close spatial correspondence between the functional organization of the resting brain and task-evoked patterns supports the relevance of resting state networks in cognitive function.

Dissemination Patterns and Associated Network Effects of Sentiments in Social Networks

DEFF Research Database (Denmark)

Hillmann, Robert; Trier, Matthias

2012-01-01

. The dissemination patterns analyzed in this study consist of network motifs based on triples of actors and the ties among them. These motifs are associated with common social network effects to derive meaningful insights about dissemination activities. The data basis includes several thousand social networks...... with textual messages classified according to embedded positive and negative sentiments. Based on this data, sub-networks are extracted and analyzed with a dynamic network motif analysis to determine dissemination patterns and associated network effects. Results indicate that the emergence of digital social...... networks exhibits a strong tendency towards reciprocity, followed by the dominance of hierarchy as an intermediate step leading to social clustering with hubs and transitivity effects for both positive and negative sentiments to the same extend. Sentiments embedded in exchanged textual messages do only...

A Secure Localization Approach against Wormhole Attacks Using Distance Consistency

Directory of Open Access Journals (Sweden)

Lou Wei

2010-01-01

Full Text Available Wormhole attacks can negatively affect the localization in wireless sensor networks. A typical wormhole attack can be launched by two colluding attackers, one of which sniffs packets at one point in the network and tunnels them through a wired or wireless link to another point, and the other relays them within its vicinity. In this paper, we investigate the impact of the wormhole attack on the localization and propose a novel distance-consistency-based secure localization scheme against wormhole attacks, which includes three phases of wormhole attack detection, valid locators identification and self-localization. The theoretical model is further formulated to analyze the proposed secure localization scheme. The simulation results validate the theoretical results and also demonstrate the effectiveness of our proposed scheme.

Community detection for networks with unipartite and bipartite structure

Science.gov (United States)

Chang, Chang; Tang, Chao

2014-09-01

Finding community structures in networks is important in network science, technology, and applications. To date, most algorithms that aim to find community structures only focus either on unipartite or bipartite networks. A unipartite network consists of one set of nodes and a bipartite network consists of two nonoverlapping sets of nodes with only links joining the nodes in different sets. However, a third type of network exists, defined here as the mixture network. Just like a bipartite network, a mixture network also consists of two sets of nodes, but some nodes may simultaneously belong to two sets, which breaks the nonoverlapping restriction of a bipartite network. The mixture network can be considered as a general case, with unipartite and bipartite networks viewed as its limiting cases. A mixture network can represent not only all the unipartite and bipartite networks, but also a wide range of real-world networks that cannot be properly represented as either unipartite or bipartite networks in fields such as biology and social science. Based on this observation, we first propose a probabilistic model that can find modules in unipartite, bipartite, and mixture networks in a unified framework based on the link community model for a unipartite undirected network [B Ball et al (2011 Phys. Rev. E 84 036103)]. We test our algorithm on synthetic networks (both overlapping and nonoverlapping communities) and apply it to two real-world networks: a southern women bipartite network and a human transcriptional regulatory mixture network. The results suggest that our model performs well for all three types of networks, is competitive with other algorithms for unipartite or bipartite networks, and is applicable to real-world networks.

Self-consistency of a heterogeneous continuum porous medium representation of a fractured medium

International Nuclear Information System (INIS)

Hoch, A.R.; Jackson, C.P.; Todman, S.

1998-01-01

For many of the rocks that are, or have been, under investigation as potential host rocks for a radioactive waste repository, groundwater flow is considered to take place predominantly through discontinuities such as fractures. Although models of networks of discrete features (DFN models) would be the most realistic models for such rocks, calculations on large length scales would not be computationally practicable. A possible approach would be to use heterogeneous continuum porous-medium (CPM) models in which each block has an effective permeability appropriate to represent the network of features within the block. In order to build confidence in this approach, it is necessary to demonstrate that the approach is self-consistent, in the sense that if the effective permeability on a large length scale is derived using the CPM model, the result is close to the value derived directly from the underlying network model. It is also desirable to demonstrate self-consistency for the use of stochastic heterogeneous CPM models that are built as follows. The correlation structure of the effective permeability on the scale of the blocks is inferred by analysis of the effective permeabilities obtained from the underlying DFN model. Then realizations of the effective permeability within the domain of interest are generated on the basis of the correlation structure, rather than being obtained directly from the underlying DFN model. A study of self-consistency is presented for two very different underlying DFN models: one based on the properties of the Borrowdale Volcanic Group at Sellafield, and one based on the properties of the granite at Aespoe in Sweden. It is shown that, in both cases, the use of heterogeneous CPM models based directly on the DFN model is self-consistent, provided that care is taken in the evaluation of the effective permeability for the DFN models. It is also shown that the use of stochastic heterogeneous CPM models based on the correlation structure of the

Data Exchange Network

DEFF Research Database (Denmark)

Grau Larsen, Anton; Ellersgaard, Christoph

2015-01-01

This article presents the extensive Danish elite network. Collected during 2012 and 2013, the data comprises 56,536 positions within 5,079 affiliations, and connects 37,750 individuals. The network consists of the largest Danish corporations, state institutions, NGO’s, and other integrative...... networks such as social clubs or royal events. Data were gathered through an inclusion principle, adding all potentially interesting affiliations. Procedures of name-matching and quality control are presented. Finally, the data are introduced: made available through a package for R, which enables...

Bayesian Network Induction via Local Neighborhoods

National Research Council Canada - National Science Library

Margaritis, Dimitris

1999-01-01

.... We present an efficient algorithm for learning Bayesian networks from data. Our approach constructs Bayesian networks by first identifying each node's Markov blankets, then connecting nodes in a consistent way...

NASA Networks: The Second Time Around.

Science.gov (United States)

Frate, A. Del

1988-01-01

Traces the development of a second generation library network consisting of 15 autonomous National Aeronautics and Space Administration (NASA) libraries. The discussion covers some comparisons between the first and second generation networks, types of computerized systems and communication systems used in the current network, and future plans.…

Stabilizing weighted complex networks

International Nuclear Information System (INIS)

Xiang Linying; Chen Zengqiang; Liu Zhongxin; Chen Fei; Yuan Zhuzhi

2007-01-01

Real networks often consist of local units which interact with each other via asymmetric and heterogeneous connections. In this paper, the V-stability problem is investigated for a class of asymmetric weighted coupled networks with nonidentical node dynamics, which includes the unweighted network as a special case. Pinning control is suggested to stabilize such a coupled network. The complicated stabilization problem is reduced to measuring the semi-negative property of the characteristic matrix which embodies not only the network topology, but also the node self-dynamics and the control gains. It is found that network stabilizability depends critically on the second largest eigenvalue of the characteristic matrix. The smaller the second largest eigenvalue is, the more the network is pinning controllable. Numerical simulations of two representative networks composed of non-chaotic systems and chaotic systems, respectively, are shown for illustration and verification

Self-sustained oscillations of complex genomic regulatory networks

International Nuclear Information System (INIS)

Ye Weiming; Huang Xiaodong; Huang Xuhui; Li Pengfei; Xia Qinzhi; Hu Gang

2010-01-01

Recently, self-sustained oscillations in complex networks consisting of non-oscillatory nodes have attracted great interest in diverse natural and social fields. Oscillatory genomic regulatory networks are one of the most typical examples of this kind. Given an oscillatory genomic network, it is important to reveal the central structure generating the oscillation. However, if the network consists of large numbers of genes and interactions, the oscillation generator is deeply hidden in the complicated interactions. We apply the dominant phase-advanced driving path method proposed in Qian et al. (2010) to reduce complex genomic regulatory networks to one-dimensional and unidirectionally linked network graphs where negative regulatory loops are explored to play as the central generators of the oscillations, and oscillation propagation pathways in the complex networks are clearly shown by tree branches radiating from the loops. Based on the above understanding we can control oscillations of genomic networks with high efficiency.

Wireless Sensor Network –A Survey

OpenAIRE

Nirvika Chouhan; P.D.Vyavahare; Rekha Jain

2013-01-01

Wireless sensor networks are the networks consisting of large number of small and tiny sensor nodes. The nodes are supplied with limited power, memory and other resources and perform in-network processing. In this paper, various issues are discussed that actually put the limitations in the well working and the life time of the network. In Wireless sensor network, nodes should consume less power, memoryand so data aggregation should be performed. Security is another aspect which should be pres...

Contemporary Network Proteomics and Its Requirements

Science.gov (United States)

Goh, Wilson Wen Bin; Wong, Limsoon; Sng, Judy Chia Ghee

2013-01-01

The integration of networks with genomics (network genomics) is a familiar field. Conventional network analysis takes advantage of the larger coverage and relative stability of gene expression measurements. Network proteomics on the other hand has to develop further on two critical factors: (1) expanded data coverage and consistency, and (2) suitable reference network libraries, and data mining from them. Concerning (1) we discuss several contemporary themes that can improve data quality, which in turn will boost the outcome of downstream network analysis. For (2), we focus on network analysis developments, specifically, the need for context-specific networks and essential considerations for localized network analysis. PMID:24833333

Investigation on network utilization efficiency and image transmission time for the PACS network

International Nuclear Information System (INIS)

Tawara, K.; Nishihara, E.; Komatsu, K.I.

1987-01-01

The authors investigated the following features of a PACS network: (1) network utilization efficiency and (2) image transmission time. They changed the following parameters, which the two items shown above depend on: (1) transfer rate between imaging equipment and network (10 kB/econd-8 MB/second), (2) network transmission speed (100 kB/second-50 MB/second), (3) packet length (10 kB-4 MB), and (4) message length (image data) (64 kB-4 MB). As a result, a conventional-type network cannot meet a need for PACS. To solve this problem, the authors propose a multiplexed network that consists of the high-speed network for image transmission and the conventional speed of control network for commands and shorter messages. If the packet length of the image network is designed to be variable, they can choose an optimum packet length for image transmission

Risk measures on networks and expected utility

International Nuclear Information System (INIS)

Cerqueti, Roy; Lupi, Claudio

2016-01-01

In reliability theory projects are usually evaluated in terms of their riskiness, and often decision under risk is intended as the one-shot-type binary choice of accepting or not accepting the risk. In this paper we elaborate on the concept of risk acceptance, and propose a theoretical framework based on network theory. In doing this, we deal with system reliability, where the interconnections among the random quantities involved in the decision process are explicitly taken into account. Furthermore, we explore the conditions to be satisfied for risk-acceptance criteria to be consistent with the axiomatization of standard expected utility theory within the network framework. In accordance with existing literature, we show that a risk evaluation criterion can be meaningful even if it is not consistent with the standard axiomatization of expected utility, once this is suitably reinterpreted in the light of networks. Finally, we provide some illustrative examples. - Highlights: • We discuss risk acceptance and theoretically develop this theme on the basis of network theory. • We propose an original framework for describing the algebraic structure of the set of the networks, when they are viewed as risks. • We introduce the risk measures on networks, which induce total orders on the set of networks. • We state conditions on the risk measures on networks to let the induced risk-acceptance criterion be consistent with a new formulation of the expected utility theory.

Network Visualization Project (NVP)

Science.gov (United States)

2016-07-01

Application data flow .............................................................................2 Fig. 2 Sample JSON data...interface supporting improved network analysis and network communication visualization. 2. Application Design NVP consists of 2 parts: back-end data...notation ( JSON ) format. This JSON is provided as input to the front-end application of the project. This interaction of the user with the back-end

Multimodal network design and assessment

NARCIS (Netherlands)

Brands, Ties; Alkim, T.P.; van Eck, Gijs; van Arem, Bart; Arentze, T.

2010-01-01

A framework is proposed for the design of an optimal multimodal transport network for the Randstad area. This research framework consists of a multi-objective optimization heuristic and a fast network assessment module, which results in a set of Pareto optimal solutions. Subsequently, a proper

Thermodynamically consistent coarse graining of biocatalysts beyond Michaelis–Menten

Science.gov (United States)

Wachtel, Artur; Rao, Riccardo; Esposito, Massimiliano

2018-04-01

Starting from the detailed catalytic mechanism of a biocatalyst we provide a coarse-graining procedure which, by construction, is thermodynamically consistent. This procedure provides stoichiometries, reaction fluxes (rate laws), and reaction forces (Gibbs energies of reaction) for the coarse-grained level. It can treat active transporters and molecular machines, and thus extends the applicability of ideas that originated in enzyme kinetics. Our results lay the foundations for systematic studies of the thermodynamics of large-scale biochemical reaction networks. Moreover, we identify the conditions under which a relation between one-way fluxes and forces holds at the coarse-grained level as it holds at the detailed level. In doing so, we clarify the speculations and broad claims made in the literature about such a general flux–force relation. As a further consequence we show that, in contrast to common belief, the second law of thermodynamics does not require the currents and the forces of biochemical reaction networks to be always aligned.

Analyzing security protocols in hierarchical networks

DEFF Research Database (Denmark)

Zhang, Ye; Nielson, Hanne Riis

2006-01-01

Validating security protocols is a well-known hard problem even in a simple setting of a single global network. But a real network often consists of, besides the public-accessed part, several sub-networks and thereby forms a hierarchical structure. In this paper we first present a process calculus...... capturing the characteristics of hierarchical networks and describe the behavior of protocols on such networks. We then develop a static analysis to automate the validation. Finally we demonstrate how the technique can benefit the protocol development and the design of network systems by presenting a series...

Default network modulation and large-scale network interactivity in healthy young and old adults.

Science.gov (United States)

Spreng, R Nathan; Schacter, Daniel L

2012-11-01

We investigated age-related changes in default, attention, and control network activity and their interactions in young and old adults. Brain activity during autobiographical and visuospatial planning was assessed using multivariate analysis and with intrinsic connectivity networks as regions of interest. In both groups, autobiographical planning engaged the default network while visuospatial planning engaged the attention network, consistent with a competition between the domains of internalized and externalized cognition. The control network was engaged for both planning tasks. In young subjects, the control network coupled with the default network during autobiographical planning and with the attention network during visuospatial planning. In old subjects, default-to-control network coupling was observed during both planning tasks, and old adults failed to deactivate the default network during visuospatial planning. This failure is not indicative of default network dysfunction per se, evidenced by default network engagement during autobiographical planning. Rather, a failure to modulate the default network in old adults is indicative of a lower degree of flexible network interactivity and reduced dynamic range of network modulation to changing task demands.

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

Science.gov (United States)

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

2018-04-01

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

On Nakhleh's metric for reduced phylogenetic networks

OpenAIRE

Cardona, Gabriel; Llabrés, Mercè; Rosselló, Francesc; Valiente Feruglio, Gabriel Alejandro

2009-01-01

We prove that Nakhleh’s metric for reduced phylogenetic networks is also a metric on the classes of tree-child phylogenetic networks, semibinary tree-sibling time consistent phylogenetic networks, and multilabeled phylogenetic trees. We also prove that it separates distinguishable phylogenetic networks. In this way, it becomes the strongest dissimilarity measure for phylogenetic networks available so far. Furthermore, we propose a generalization of that metric that separates arbitrary phyl...

Molecular ecological network analyses.

Science.gov (United States)

Deng, Ye; Jiang, Yi-Huei; Yang, Yunfeng; He, Zhili; Luo, Feng; Zhou, Jizhong

2012-05-30

Understanding the interaction among different species within a community and their responses to environmental changes is a central goal in ecology. However, defining the network structure in a microbial community is very challenging due to their extremely high diversity and as-yet uncultivated status. Although recent advance of metagenomic technologies, such as high throughout sequencing and functional gene arrays, provide revolutionary tools for analyzing microbial community structure, it is still difficult to examine network interactions in a microbial community based on high-throughput metagenomics data. Here, we describe a novel mathematical and bioinformatics framework to construct ecological association networks named molecular ecological networks (MENs) through Random Matrix Theory (RMT)-based methods. Compared to other network construction methods, this approach is remarkable in that the network is automatically defined and robust to noise, thus providing excellent solutions to several common issues associated with high-throughput metagenomics data. We applied it to determine the network structure of microbial communities subjected to long-term experimental warming based on pyrosequencing data of 16 S rRNA genes. We showed that the constructed MENs under both warming and unwarming conditions exhibited topological features of scale free, small world and modularity, which were consistent with previously described molecular ecological networks. Eigengene analysis indicated that the eigengenes represented the module profiles relatively well. In consistency with many other studies, several major environmental traits including temperature and soil pH were found to be important in determining network interactions in the microbial communities examined. To facilitate its application by the scientific community, all these methods and statistical tools have been integrated into a comprehensive Molecular Ecological Network Analysis Pipeline (MENAP), which is open

Basketball teams as strategic networks.

Science.gov (United States)

Fewell, Jennifer H; Armbruster, Dieter; Ingraham, John; Petersen, Alexander; Waters, James S

2012-01-01

We asked how team dynamics can be captured in relation to function by considering games in the first round of the NBA 2010 play-offs as networks. Defining players as nodes and ball movements as links, we analyzed the network properties of degree centrality, clustering, entropy and flow centrality across teams and positions, to characterize the game from a network perspective and to determine whether we can assess differences in team offensive strategy by their network properties. The compiled network structure across teams reflected a fundamental attribute of basketball strategy. They primarily showed a centralized ball distribution pattern with the point guard in a leadership role. However, individual play-off teams showed variation in their relative involvement of other players/positions in ball distribution, reflected quantitatively by differences in clustering and degree centrality. We also characterized two potential alternate offensive strategies by associated variation in network structure: (1) whether teams consistently moved the ball towards their shooting specialists, measured as "uphill/downhill" flux, and (2) whether they distributed the ball in a way that reduced predictability, measured as team entropy. These network metrics quantified different aspects of team strategy, with no single metric wholly predictive of success. However, in the context of the 2010 play-offs, the values of clustering (connectedness across players) and network entropy (unpredictability of ball movement) had the most consistent association with team advancement. Our analyses demonstrate the utility of network approaches in quantifying team strategy and show that testable hypotheses can be evaluated using this approach. These analyses also highlight the richness of basketball networks as a dataset for exploring the relationships between network structure and dynamics with team organization and effectiveness.

Security For Wireless Sensor Network

OpenAIRE

Saurabh Singh,; Dr. Harsh Kumar Verma

2011-01-01

Wireless sensor network is highly vulnerable to attacks because it consists of various resourceconstrained devices with their low battery power, less memory, and associated low energy. Sensor nodescommunicate among themselves via wireless links. However, there are still a lot of unresolved issues in wireless sensor networks of which security is one of the hottest research issues. Sensor networks aredeployed in hostile environments. Environmental conditions along with resource-constraints give...

A method for identifying hierarchical sub-networks / modules and weighting network links based on their similarity in sub-network / module affiliation

Directory of Open Access Journals (Sweden)

WenJun Zhang

2016-06-01

Full Text Available Some networks, including biological networks, consist of hierarchical sub-networks / modules. Based on my previous study, in present study a method for both identifying hierarchical sub-networks / modules and weighting network links is proposed. It is based on the cluster analysis in which between-node similarity in sets of adjacency nodes is used. Two matrices, linkWeightMat and linkClusterIDs, are achieved by using the algorithm. Two links with both the same weight in linkWeightMat and the same cluster ID in linkClusterIDs belong to the same sub-network / module. Two links with the same weight in linkWeightMat but different cluster IDs in linkClusterIDs belong to two sub-networks / modules at the same hirarchical level. However, a link with an unique cluster ID in linkClusterIDs does not belong to any sub-networks / modules. A sub-network / module of the greater weight is the more connected sub-network / modules. Matlab codes of the algorithm are presented.

Force10 networks performance in world's first transcontinental 10 gigabit ethernet network verified by Ixia

CERN Multimedia

2003-01-01

Force10 Networks, Inc., today announced that the performance of the Force10 E-Series switch/routers deployed in a transcontinental network has been verified as line-rate 10 GE throughput by Ixia, a leading provider of high-speed, network performance and conformance analysis systems. The network, the world's first transcontinental 10 GE wide area network, consists of a SURFnet OC-192 lambda between Geneva and the StarLight facility in Chicago via Amsterdam and another OC-192 lambda between this same facility in Chicago and Carleton University in Ottawa, Canada provided by CANARIE and ORANO (1/2 page).

Scheduling Network Traffic for Grid Purposes

DEFF Research Database (Denmark)

Gamst, Mette

This thesis concerns scheduling of network traffic in grid context. Grid computing consists of a number of geographically distributed computers, which work together for solving large problems. The computers are connected through a network. When scheduling job execution in grid computing, data...... transmission has so far not been taken into account. This causes stability problems, because data transmission takes time and thus causes delays to the execution plan. This thesis proposes the integration of job scheduling and network routing. The scientific contribution is based on methods from operations...... research and consists of six papers. The first four considers data transmission in grid context. The last two solves the data transmission problem, where the number of paths per data connection is bounded from above. The thesis shows that it is possible to solve the integrated job scheduling and network...

Financial stability from a network perspective

NARCIS (Netherlands)

Leon Rincon, C.E.

2015-01-01

This thesis consists of six chapters related to applications of network analysis’ methods for financial stability. The first chapter introduces the network perspective as a new mapping technique for studying and understanding financial markets’architecture. The second chapter breaks down the

Measuring the evolutionary rewiring of biological networks.

Directory of Open Access Journals (Sweden)

Chong Shou

Full Text Available We have accumulated a large amount of biological network data and expect even more to come. Soon, we anticipate being able to compare many different biological networks as we commonly do for molecular sequences. It has long been believed that many of these networks change, or "rewire", at different rates. It is therefore important to develop a framework to quantify the differences between networks in a unified fashion. We developed such a formalism based on analogy to simple models of sequence evolution, and used it to conduct a systematic study of network rewiring on all the currently available biological networks. We found that, similar to sequences, biological networks show a decreased rate of change at large time divergences, because of saturation in potential substitutions. However, different types of biological networks consistently rewire at different rates. Using comparative genomics and proteomics data, we found a consistent ordering of the rewiring rates: transcription regulatory, phosphorylation regulatory, genetic interaction, miRNA regulatory, protein interaction, and metabolic pathway network, from fast to slow. This ordering was found in all comparisons we did of matched networks between organisms. To gain further intuition on network rewiring, we compared our observed rewirings with those obtained from simulation. We also investigated how readily our formalism could be mapped to other network contexts; in particular, we showed how it could be applied to analyze changes in a range of "commonplace" networks such as family trees, co-authorships and linux-kernel function dependencies.

Basketball Teams as Strategic Networks

Science.gov (United States)

Fewell, Jennifer H.; Armbruster, Dieter; Ingraham, John; Petersen, Alexander; Waters, James S.

2012-01-01

We asked how team dynamics can be captured in relation to function by considering games in the first round of the NBA 2010 play-offs as networks. Defining players as nodes and ball movements as links, we analyzed the network properties of degree centrality, clustering, entropy and flow centrality across teams and positions, to characterize the game from a network perspective and to determine whether we can assess differences in team offensive strategy by their network properties. The compiled network structure across teams reflected a fundamental attribute of basketball strategy. They primarily showed a centralized ball distribution pattern with the point guard in a leadership role. However, individual play-off teams showed variation in their relative involvement of other players/positions in ball distribution, reflected quantitatively by differences in clustering and degree centrality. We also characterized two potential alternate offensive strategies by associated variation in network structure: (1) whether teams consistently moved the ball towards their shooting specialists, measured as “uphill/downhill” flux, and (2) whether they distributed the ball in a way that reduced predictability, measured as team entropy. These network metrics quantified different aspects of team strategy, with no single metric wholly predictive of success. However, in the context of the 2010 play-offs, the values of clustering (connectedness across players) and network entropy (unpredictability of ball movement) had the most consistent association with team advancement. Our analyses demonstrate the utility of network approaches in quantifying team strategy and show that testable hypotheses can be evaluated using this approach. These analyses also highlight the richness of basketball networks as a dataset for exploring the relationships between network structure and dynamics with team organization and effectiveness. PMID:23139744

Basketball teams as strategic networks.

Directory of Open Access Journals (Sweden)

Jennifer H Fewell

Full Text Available We asked how team dynamics can be captured in relation to function by considering games in the first round of the NBA 2010 play-offs as networks. Defining players as nodes and ball movements as links, we analyzed the network properties of degree centrality, clustering, entropy and flow centrality across teams and positions, to characterize the game from a network perspective and to determine whether we can assess differences in team offensive strategy by their network properties. The compiled network structure across teams reflected a fundamental attribute of basketball strategy. They primarily showed a centralized ball distribution pattern with the point guard in a leadership role. However, individual play-off teams showed variation in their relative involvement of other players/positions in ball distribution, reflected quantitatively by differences in clustering and degree centrality. We also characterized two potential alternate offensive strategies by associated variation in network structure: (1 whether teams consistently moved the ball towards their shooting specialists, measured as "uphill/downhill" flux, and (2 whether they distributed the ball in a way that reduced predictability, measured as team entropy. These network metrics quantified different aspects of team strategy, with no single metric wholly predictive of success. However, in the context of the 2010 play-offs, the values of clustering (connectedness across players and network entropy (unpredictability of ball movement had the most consistent association with team advancement. Our analyses demonstrate the utility of network approaches in quantifying team strategy and show that testable hypotheses can be evaluated using this approach. These analyses also highlight the richness of basketball networks as a dataset for exploring the relationships between network structure and dynamics with team organization and effectiveness.

Macroecology of pollination networks

DEFF Research Database (Denmark)

Nielsen, Kristian Trøjelsgaard; Olesen, Jens Mogens

2013-01-01

towards the tropics, and that network topology would be affected by current climate. Location Global. Methods Each network was organized as a presence/absence matrix, consisting of P plant species, A pollinator species and their links. From these matrices, network parameters were estimated. Additionally...... with either latitude or elevation. However, network modularity decreased significantly with latitude whereas mean number of links per plant species (Lp) and A/P ratio peaked at mid-latitude. Above 500 m a.s.l., A/P ratio decreased and mean number of links per pollinator species (La) increased with elevation......Aim Interacting communities of species are organized into complex networks, and network analysis is reckoned to be a strong tool for describing their architecture. Many species assemblies show strong macroecological patterns, e.g. increasing species richness with decreasing latitude, but whether...

Estimating Conditional Distributions by Neural Networks

DEFF Research Database (Denmark)

Kulczycki, P.; Schiøler, Henrik

1998-01-01

Neural Networks for estimating conditionaldistributions and their associated quantiles are investigated in this paper. A basic network structure is developed on the basis of kernel estimation theory, and consistency property is considered from a mild set of assumptions. A number of applications...

COMMUNICA TION NETWORK FOR TELEMEDICINE Debretsion G ...

African Journals Online (AJOL)

(3) continuing medical education and (4) Training the medical ... Telemedicine system consists of at least five major subsystems. [l,4]. ... and wire-line (optical network) telecommunication facilities .... An ATM network needs certain traffic control.

The performance evaluation of a new neural network based traffic management scheme for a satellite communication network

Science.gov (United States)

Ansari, Nirwan; Liu, Dequan

1991-01-01

A neural-network-based traffic management scheme for a satellite communication network is described. The scheme consists of two levels of management. The front end of the scheme is a derivation of Kohonen's self-organization model to configure maps for the satellite communication network dynamically. The model consists of three stages. The first stage is the pattern recognition task, in which an exemplar map that best meets the current network requirements is selected. The second stage is the analysis of the discrepancy between the chosen exemplar map and the state of the network, and the adaptive modification of the chosen exemplar map to conform closely to the network requirement (input data pattern) by means of Kohonen's self-organization. On the basis of certain performance criteria, whether a new map is generated to replace the original chosen map is decided in the third stage. A state-dependent routing algorithm, which arranges the incoming call to some proper path, is used to make the network more efficient and to lower the call block rate. Simulation results demonstrate that the scheme, which combines self-organization and the state-dependent routing mechanism, provides better performance in terms of call block rate than schemes that only have either the self-organization mechanism or the routing mechanism.

Software network analyzer for computer network performance measurement planning over heterogeneous services in higher educational institutes

OpenAIRE

Ismail, Mohd Nazri

2009-01-01

In 21st century, convergences of technologies and services in heterogeneous environment have contributed multi-traffic. This scenario will affect computer network on learning system in higher educational Institutes. Implementation of various services can produce different types of content and quality. Higher educational institutes should have a good computer network infrastructure to support usage of various services. The ability of computer network should consist of i) higher bandwidth; ii) ...

Risk-Aware Design of Value and Coordination Networks

NARCIS (Netherlands)

Fatemi, Hassan

2012-01-01

A collaborative network is a network consisting of a set of autonomous actors (e.g. enterprizes, organizations and people) that collaborate to achieve common or compatible goals. In a collaborative network each enterprize contributes with its own specific products or services to satisfy the consumer

Enhancing Sensor Network Data Quality via Collaborated Circuit and Network Operations

Directory of Open Access Journals (Sweden)

Lucas Vespa

2013-04-01

Full Text Available In many applications, the quality of data gathered by sensor networks is directly related to the signal-to-noise ratio (SNR of the sensor data being transmitted in the networks. Different from the SNR that is often used in measuring the quality of communication links, the SNR used in this work measures how accurately the data in the network packets represent the physical parameters being sensed. Hence, the signal here refers to the physical parameters that are being monitored by sensor networks; the noise is due to environmental interference and circuit noises at sensor nodes, and packet loss during network transmission. While issues affecting SNR at sensor nodes have been intensively investigated, the impact of network packet loss on data SNR has not attracted significant attention in sensor network design. This paper investigates the impact of packet loss on sensor network data SNR and shows that data SNR is dramatically affected by network packet loss. A data quality metric, based on data SNR, is developed and a cross-layer adaptive scheme is presented to minimize data quality degradation in congested sensor networks. The proposed scheme consists of adaptive downsampling and bit truncation at sensor nodes and intelligent traffic management techniques at the network level. Simulation results are presented to demonstrate the validity and effectiveness of the proposed techniques.

International research networks in pharmaceuticals

DEFF Research Database (Denmark)

Cantner, Uwe; Rake, Bastian

2014-01-01

of scientific publications related to pharmaceutical research and applying social network analysis, we find that both the number of countries and their connectivity increase in almost all disease group specific networks. The cores of the networks consist of high income OECD countries and remain rather stable......Knowledge production and scientific research have become increasingly more collaborative and international, particularly in pharmaceuticals. We analyze this tendency in general and tie formation in international research networks on the country level in particular. Based on a unique dataset...... over time. Using network regression techniques to analyze the network dynamics our results indicate that accumulative advantages based on connectedness and multi-connectivity are positively related to changes in the countries' collaboration intensity whereas various indicators on similarity between...

Design and value of service oriented technologies for smart business networking

NARCIS (Netherlands)

Alt, R.; Smits, M.T.; Beverungen, D.; Tuunanen, T.; Wijnhoven, F.

2014-01-01

Business networks that effectively use technologies and outperform competing networks are known as smart business networks. Theory hypothesizes that smart business networking requires a ‘Networked Business Operating System’ (NBOS), a technological architecture consisting of business logic, that

Research of Innovation Diffusion on Industrial Networks

Directory of Open Access Journals (Sweden)

Yongtai Chen

2014-01-01

Full Text Available The real value of innovation consists in its diffusion on industrial network. The factors which affect the diffusion of innovation on industrial network are the topology of industrial network and rules of diffusion. Industrial network is a complex network which has scale-free and small-world characters; its structure has some affection on threshold, length of path, enterprise’s status, and information share of innovation diffusion. Based on the cost and attitude to risk of technical innovation, we present the “avalanche” diffusing model of technical innovation on industrial network.

An Optimal Path Computation Architecture for the Cloud-Network on Software-Defined Networking

Directory of Open Access Journals (Sweden)

Hyunhun Cho

2015-05-01

Full Text Available Legacy networks do not open the precise information of the network domain because of scalability, management and commercial reasons, and it is very hard to compute an optimal path to the destination. According to today’s ICT environment change, in order to meet the new network requirements, the concept of software-defined networking (SDN has been developed as a technological alternative to overcome the limitations of the legacy network structure and to introduce innovative concepts. The purpose of this paper is to propose the application that calculates the optimal paths for general data transmission and real-time audio/video transmission, which consist of the major services of the National Research & Education Network (NREN in the SDN environment. The proposed SDN routing computation (SRC application is designed and applied in a multi-domain network for the efficient use of resources, selection of the optimal path between the multi-domains and optimal establishment of end-to-end connections.

Centralized Networks to Generate Human Body Motions.

Science.gov (United States)

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

2017-12-14

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

Green heterogeneous wireless networks

CERN Document Server

Ismail, Muhammad; Nee, Hans-Peter; Qaraqe, Khalid A; Serpedin, Erchin

2016-01-01

This book focuses on the emerging research topic "green (energy efficient) wireless networks" which has drawn huge attention recently from both academia and industry. This topic is highly motivated due to important environmental, financial, and quality-of-experience (QoE) considerations. Specifically, the high energy consumption of the wireless networks manifests in approximately 2% of all CO2 emissions worldwide. This book presents the authors’ visions and solutions for deployment of energy efficient (green) heterogeneous wireless communication networks. The book consists of three major parts. The first part provides an introduction to the "green networks" concept, the second part targets the green multi-homing resource allocation problem, and the third chapter presents a novel deployment of device-to-device (D2D) communications and its successful integration in Heterogeneous Networks (HetNets). The book is novel in that it specifically targets green networking in a heterogeneous wireless medium, which re...

The modularity of pollination networks

DEFF Research Database (Denmark)

Olesen, Jens Mogens; Bascompte, J.; Dupont, Yoko

2007-01-01

In natural communities, species and their interactions are often organized as nonrandom networks, showing distinct and repeated complex patterns. A prevalent, but poorly explored pattern is ecological modularity, with weakly interlinked subsets of species (modules), which, however, internally...... consist of strongly connected species. The importance of modularity has been discussed for a long time, but no consensus on its prevalence in ecological networks has yet been reached. Progress is hampered by inadequate methods and a lack of large datasets. We analyzed 51 pollination networks including...... almost 10,000 species and 20,000 links and tested for modularity by using a recently developed simulated annealing algorithm. All networks with >150 plant and pollinator species were modular, whereas networks with

Arabic Handwriting Recognition Using Neural Network Classifier

African Journals Online (AJOL)

pc

2018-03-05

Mar 5, 2018 ... an OCR using Neural Network classifier preceded by a set of preprocessing .... Artificial Neural Networks (ANNs), which we adopt in this research, consist of ... advantage and disadvantages of each technique. In [9],. Khemiri ...

Cognitive Radio-based Home Area Networks

NARCIS (Netherlands)

Sarijari, M.A.B.

2016-01-01

A future home area network (HAN) is envisaged to consist of a large number of devices that support various applications such as smart grid, security and safety systems, voice call, and video streaming. Most of these home devices are communicating based on various wireless networking technologies

Functional classification of the Gauteng provincial road network ...

African Journals Online (AJOL)

The built environment consists of various land uses and activities connected by a road network. The efficiency and effectiveness of the road network directly impacts economic growth and societal movement. This study involved the functional classification of the Gauteng provincial road network using the South African Road ...

Measuring Networking as an Outcome Variable in Undergraduate Research Experiences.

Science.gov (United States)

Hanauer, David I; Hatfull, Graham

2015-01-01

The aim of this paper is to propose, present, and validate a simple survey instrument to measure student conversational networking. The tool consists of five items that cover personal and professional social networks, and its basic principle is the self-reporting of degrees of conversation, with a range of specific discussion partners. The networking instrument was validated in three studies. The basic psychometric characteristics of the scales were established by conducting a factor analysis and evaluating internal consistency using Cronbach's alpha. The second study used a known-groups comparison and involved comparing outcomes for networking scales between two different undergraduate laboratory courses (one involving a specific effort to enhance networking). The final study looked at potential relationships between specific networking items and the established psychosocial variable of project ownership through a series of binary logistic regressions. Overall, the data from the three studies indicate that the networking scales have high internal consistency (α = 0.88), consist of a unitary dimension, can significantly differentiate between research experiences with low and high networking designs, and are related to project ownership scales. The ramifications of the networking instrument for student retention, the enhancement of public scientific literacy, and the differentiation of laboratory courses are discussed. © 2015 D. I. Hanauer and G. Hatfull. CBE—Life Sciences Education © 2015 The American Society for Cell Biology. This article is distributed by The American Society for Cell Biology under license from the author(s). It is available to the public under an Attribution–Noncommercial–Share Alike 3.0 Unported Creative Commons License (http://creativecommons.org/licenses/by-nc-sa/3.0).

Growth of cortical neuronal network in vitro: Modeling and analysis

International Nuclear Information System (INIS)

Lai, P.-Y.; Jia, L. C.; Chan, C. K.

2006-01-01

We present a detailed analysis and theoretical growth models to account for recent experimental data on the growth of cortical neuronal networks in vitro [Phys. Rev. Lett. 93, 088101 (2004)]. The experimentally observed synchronized firing frequency of a well-connected neuronal network is shown to be proportional to the mean network connectivity. The growth of the network is consistent with the model of an early enhanced growth of connection, but followed by a retarded growth once the synchronized cluster is formed. Microscopic models with dominant excluded volume interactions are consistent with the observed exponential decay of the mean connection probability as a function of the mean network connectivity. The biological implications of the growth model are also discussed

An evolving network model with community structure

International Nuclear Information System (INIS)

Li Chunguang; Maini, Philip K

2005-01-01

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

Functional Module Analysis for Gene Coexpression Networks with Network Integration.

Science.gov (United States)

Zhang, Shuqin; Zhao, Hongyu; Ng, Michael K

2015-01-01

Network has been a general tool for studying the complex interactions between different genes, proteins, and other small molecules. Module as a fundamental property of many biological networks has been widely studied and many computational methods have been proposed to identify the modules in an individual network. However, in many cases, a single network is insufficient for module analysis due to the noise in the data or the tuning of parameters when building the biological network. The availability of a large amount of biological networks makes network integration study possible. By integrating such networks, more informative modules for some specific disease can be derived from the networks constructed from different tissues, and consistent factors for different diseases can be inferred. In this paper, we have developed an effective method for module identification from multiple networks under different conditions. The problem is formulated as an optimization model, which combines the module identification in each individual network and alignment of the modules from different networks together. An approximation algorithm based on eigenvector computation is proposed. Our method outperforms the existing methods, especially when the underlying modules in multiple networks are different in simulation studies. We also applied our method to two groups of gene coexpression networks for humans, which include one for three different cancers, and one for three tissues from the morbidly obese patients. We identified 13 modules with three complete subgraphs, and 11 modules with two complete subgraphs, respectively. The modules were validated through Gene Ontology enrichment and KEGG pathway enrichment analysis. We also showed that the main functions of most modules for the corresponding disease have been addressed by other researchers, which may provide the theoretical basis for further studying the modules experimentally.

Disruption of a Regulatory Network Consisting of Neutrophils and Platelets Fosters Persisting Inflammation in Rheumatic Diseases.

Science.gov (United States)

Maugeri, Norma; Rovere-Querini, Patrizia; Manfredi, Angelo A

2016-01-01

A network of cellular interactions that involve blood leukocytes and platelets maintains vessel homeostasis. It plays a critical role in the response to invading microbes by recruiting intravascular immunity and through the generation of neutrophil extracellular traps (NETs) and immunothrombosis. Moreover, it enables immune cells to respond to remote chemoattractants by crossing the endothelial barrier and reaching sites of infection. Once the network operating under physiological conditions is disrupted, the reciprocal activation of cells in the blood and the vessel walls determines the vascular remodeling via inflammatory signals delivered to stem/progenitor cells. A deregulated leukocyte/mural cell interaction is an early critical event in the natural history of systemic inflammation. Despite intense efforts, the signals that initiate and sustain the immune-mediated vessel injury, or those that enforce the often-prolonged phases of clinical quiescence in patients with vasculitis, have only been partially elucidated. Here, we discuss recent evidence that implicates the prototypic damage-associated molecular pattern/alarmin, the high mobility group box 1 (HMGB1) protein in systemic vasculitis and in the vascular inflammation associated with systemic sclerosis. HMGB1 could represent a player in the pathogenesis of rheumatic diseases and an attractive target for molecular interventions.

Conceptual and methodological biases in network models.

Science.gov (United States)

Lamm, Ehud

2009-10-01

Many natural and biological phenomena can be depicted as networks. Theoretical and empirical analyses of networks have become prevalent. I discuss theoretical biases involved in the delineation of biological networks. The network perspective is shown to dissolve the distinction between regulatory architecture and regulatory state, consistent with the theoretical impossibility of distinguishing a priori between "program" and "data." The evolutionary significance of the dynamics of trans-generational and interorganism regulatory networks is explored and implications are presented for understanding the evolution of the biological categories development-heredity, plasticity-evolvability, and epigenetic-genetic.

Poster: A Software-Defined Multi-Camera Network

OpenAIRE

Chen, Po-Yen; Chen, Chien; Selvaraj, Parthiban; Claesen, Luc

2016-01-01

The widespread popularity of OpenFlow leads to a significant increase in the number of applications developed in SoftwareDefined Networking (SDN). In this work, we propose the architecture of a Software-Defined Multi-Camera Network consisting of small, flexible, economic, and programmable cameras which combine the functions of the processor, switch, and camera. A Software-Defined Multi-Camera Network can effectively reduce the overall network bandwidth and reduce a large amount of the Capex a...

Dynamic Frequency Control in Power Networks

OpenAIRE

Zhao, Changhong; Mallada Garcia, Enrique; Low, Steven H.

2016-01-01

Node controllers in power distribution networks in accordance with embodiments of the invention enable dynamic frequency control. One embodiment includes a node controller comprising a network interface a processor; and a memory containing a frequency control application; and a plurality of node operating parameters describing the operating parameters of a node, where the node is selected from a group consisting of at least one generator node in a power distribution network wherein the proces...

Strategies for the diffusion of innovations on networks

NARCIS (Netherlands)

Alkemade, F.; Castaldi, C.

2005-01-01

We investigate the spread of innovations on a social network. The network consists of agents that are exposed to the introduction of a new product. Consumers decide whether or not to buy the product based on their own preferences and the decisions of their neighbors in the social network.We use and

Achieving Consistent Near-Optimal Pattern Recognition Accuracy Using Particle Swarm Optimization to Pre-Train Artificial Neural Networks

Science.gov (United States)

Nikelshpur, Dmitry O.

2014-01-01

Similar to mammalian brains, Artificial Neural Networks (ANN) are universal approximators, capable of yielding near-optimal solutions to a wide assortment of problems. ANNs are used in many fields including medicine, internet security, engineering, retail, robotics, warfare, intelligence control, and finance. "ANNs have a tendency to get…

NETWORK, HOW? Perceptions of business people on networking practices

Directory of Open Access Journals (Sweden)

Saskia De Klerk

2010-12-01

Full Text Available Purpose: The purpose of this paper was to contribute to literature on networking from a South African perspective. Literature on networking is mainly concentrated on the European and American contexts with homogeneous groups and traditional divisions. The business landscape of South Africa thus requires more investigation. Problem investigated: Literature regarding networking in an South African context with its dynamic business environment is limited. This article addresses the concerns of how South African business owners and managers perceive networking in their businesses and specifically focus on the South African perspective. Therefore, the focus is on the perceptions of business owners and managers on current networking practices in South Africa. Methodology: A qualitative research design to uncover the rich underlying feelings of business owners and managers was used. The qualitative enquiry consisted of five focus group discussions (n=41 participants among prominent business owners and managers in the Gauteng Province, South Africa. The Gauteng Province was selected since it is the economic and innovation hub of South Africa. Findings and implications: The main findings showed the following main themes of networking that emerged from the data, and included (1 networking as a skill versus a natural ability; (2 the motivation behind networking; (3 the loci of networking; (4 the type of relationships that determine the character of the network; and (5 the relationship characteristics of successful networking. The main contribution of this is that there seems to be different networking situations and applications for different circumstances. According to the participants, it seems that networking in the South African landscape appears to be either relationship or business based. Originality and value of the research: The value of these findings lies in the fact that they contribute to networking literature from a South African perspective

Online Social Network Interactions:

Directory of Open Access Journals (Sweden)

Hui-Jung Chang

2018-01-01

Full Text Available A cross-cultural comparison of social networking structure on McDonald’s Facebook fan sites between Taiwan and the USA was conducted utilizing the individualism/collectivism dimension proposed by Hofstede. Four network indicators are used to describe the network structure of McDonald’s Facebook fan sites: size, density, clique and centralization. Individuals who post on both Facebook sites for the year of 2012 were considered as network participants for the purpose of the study. Due to the huge amount of data, only one thread of postings was sampled from each month of the year of 2012. The final data consists of 1002 postings written by 896 individuals and 5962 postings written by 5532 individuals from Taiwan and the USA respectively. The results indicated that the USA McDonald’s Facebook fan network has more fans, while Taiwan’s McDonald’s Facebook fan network is more densely connected. Cliques did form among the overall multiplex and within the individual uniplex networks in two countries, yet no significant differences were found between them. All the fan networks in both countries are relatively centralized, mostly on the site operators.

Bayes and Networks

NARCIS (Netherlands)

Gao, F.

2017-01-01

The dissertation consists of research in three subjects in two themes—Bayes and networks: The first studies the posterior contraction rates for the Dirichlet-Laplace mixtures in a deconvolution setting (Chapter 1). The second subject regards the statistical inference in preferential attachment

Dynamic reliability modeling of three-state networks

OpenAIRE

Ashrafi, S.; Asadi, M.

2014-01-01

This paper is an investigation into the reliability and stochastic properties of three-state networks. We consider a single-step network consisting of n links and we assume that the links are subject to failure. We assume that the network can be in three states, up (K = 2), partial performance (K = 1), and down (K = 0). Using the concept of the two-dimensional signature, we study the residual lifetimes of the networks under different scenarios on the states and the number of...

Energy Efficient Clustering Based Network Protocol Stack for 3D Airborne Monitoring System

Directory of Open Access Journals (Sweden)

Abhishek Joshi

2017-01-01

Full Text Available Wireless Sensor Network consists of large number of nodes densely deployed in ad hoc manner. Usually, most of the application areas of WSNs require two-dimensional (2D topology. Various emerging application areas such as airborne networks and underwater wireless sensor networks are usually deployed using three-dimensional (3D network topology. In this paper, a static 3D cluster-based network topology has been proposed for airborne networks. A network protocol stack consisting of various protocols such as TDMA MAC and dynamic routing along with services such as time synchronization, Cluster Head rotation, and power level management has been proposed for this airborne network. The proposed protocol stack has been implemented on the hardware platform consisting of number of TelosB nodes. This 3D airborne network architecture can be used to measure Air Quality Index (AQI in an area. Various parameters of network such as energy consumption, Cluster Head rotation, time synchronization, and Packet Delivery Ratio (PDR have been analyzed. Detailed description of the implementation of the protocol stack along with results of implementation has been provided in this paper.

A TLD dose algorithm using artificial neural networks

International Nuclear Information System (INIS)

Moscovitch, M.; Rotunda, J.E.; Tawil, R.A.; Rathbone, B.A.

1995-01-01

An artificial neural network was designed and used to develop a dose algorithm for a multi-element thermoluminescence dosimeter (TLD). The neural network architecture is based on the concept of functional links network (FLN). Neural network is an information processing method inspired by the biological nervous system. A dose algorithm based on neural networks is fundamentally different as compared to conventional algorithms, as it has the capability to learn from its own experience. The neural network algorithm is shown the expected dose values (output) associated with given responses of a multi-element dosimeter (input) many times. The algorithm, being trained that way, eventually is capable to produce its own unique solution to similar (but not exactly the same) dose calculation problems. For personal dosimetry, the output consists of the desired dose components: deep dose, shallow dose and eye dose. The input consists of the TL data obtained from the readout of a multi-element dosimeter. The neural network approach was applied to the Harshaw Type 8825 TLD, and was shown to significantly improve the performance of this dosimeter, well within the U.S. accreditation requirements for personnel dosimeters

A descriptive model of resting-state networks using Markov chains.

Science.gov (United States)

Xie, H; Pal, R; Mitra, S

2016-08-01

Resting-state functional connectivity (RSFC) studies considering pairwise linear correlations have attracted great interests while the underlying functional network structure still remains poorly understood. To further our understanding of RSFC, this paper presents an analysis of the resting-state networks (RSNs) based on the steady-state distributions and provides a novel angle to investigate the RSFC of multiple functional nodes. This paper evaluates the consistency of two networks based on the Hellinger distance between the steady-state distributions of the inferred Markov chain models. The results show that generated steady-state distributions of default mode network have higher consistency across subjects than random nodes from various RSNs.

Iberdrola's Innovation Network

International Nuclear Information System (INIS)

Tejedor-Escobar, E.; Martinez-Cid, P. M.

2009-01-01

Iberdrola's Innovation Network was created as a place where the company shares and promotes ideas and projects with its technological partners. The network consists of multiple nodes each one with its specific scope where the company exposes its vision and strategy related to the node's thematic. It also enables a interchange of opinions, know-how and resources in order to develop R and D projects that solve Iberdrola's needs. Based on the concept of Open Innovation, the network is open for anybody that wants to join and that has interest in the diverse matters treated in the nodes. The Innovation Network is targeted to manufacturers/providers, universities, technological centers and associations. The Innovation Network offers to its member the acquisitions of relevant information and know-how, as well as the possibility of participating in the projects that are generated. Iberdrola's strong commitment with Innovation, together with its definitive internationalization process, make that the available resources provided by Iberdrola itself, as well as the interest areas and the project are very important for any stake holder in the sector. (Author) 4 refs

Copercolating Networks: An Approach for Realizing High-Performance Transparent Conductors using Multicomponent Nanostructured Networks

Directory of Open Access Journals (Sweden)

Das Suprem R.

2016-06-01

Full Text Available Although transparent conductive oxides such as indium tin oxide (ITO are widely employed as transparent conducting electrodes (TCEs for applications such as touch screens and displays, new nanostructured TCEs are of interest for future applications, including emerging transparent and flexible electronics. A number of twodimensional networks of nanostructured elements have been reported, including metallic nanowire networks consisting of silver nanowires, metallic carbon nanotubes (m-CNTs, copper nanowires or gold nanowires, and metallic mesh structures. In these single-component systems, it has generally been difficult to achieve sheet resistances that are comparable to ITO at a given broadband optical transparency. A relatively new third category of TCEs consisting of networks of 1D-1D and 1D-2D nanocomposites (such as silver nanowires and CNTs, silver nanowires and polycrystalline graphene, silver nanowires and reduced graphene oxide have demonstrated TCE performance comparable to, or better than, ITO. In such hybrid networks, copercolation between the two components can lead to relatively low sheet resistances at nanowire densities corresponding to high optical transmittance. This review provides an overview of reported hybrid networks, including a comparison of the performance regimes achievable with those of ITO and single-component nanostructured networks. The performance is compared to that expected from bulk thin films and analyzed in terms of the copercolation model. In addition, performance characteristics relevant for flexible and transparent applications are discussed. The new TCEs are promising, but significant work must be done to ensure earth abundance, stability, and reliability so that they can eventually replace traditional ITO-based transparent conductors.

Evaluation of Persian Professional Web Social Networks\\\\\\' Features, to Provide a Suitable Solution for Optimization of These Networks in Iran

Directory of Open Access Journals (Sweden)

Nadjla Hariri

2013-03-01

Full Text Available This study aimed to determine the status of Persian professional web social networks' features and provide a suitable solution for optimization of these networks in Iran. The research methods were library research and evaluative method, and study population consisted of 10 Persian professional web social networks. In this study, for data collection, a check list of social networks important tools and features was used. According to the results, “Cloob”, “IR Experts” and “Doreh” were the most compatible networks with the criteria of social networks. Finally, some solutions were presented for optimization of capabilities of Persian professional web social networks.

Disruption of a regulatory network consisting of neutrophils and platelets fosters persisting inflammation in rheumatic diseases

Directory of Open Access Journals (Sweden)

Norma eMaugeri

2016-05-01

Full Text Available A network of cellular interactions that involve blood leukocytes and platelets maintains vessel homeostasis. It plays a critical role in the response to invading microbes by recruiting intravascular immunity and through the generation of Neutrophil Extracellular Traps (NETs and immunothrombosis. Moreover it enables immune cells to respond to remote chemoattractants by crossing the endothelial barrier and reaching sites of infection. Once the network operating under physiological conditions is disrupted, the reciprocal activation of cells in the blood and the vessel walls determines the vascular remodelling via inflammatory signals delivered to stem/progenitor cells. A deregulated leukocyte/mural cell interaction is an early critical event in the natural history of systemic inflammation. Despite intense efforts, the signals that initiate and sustain the immune-mediated vessel injury, or those that enforce the often-prolonged phases of clinical quiescence in patients with vasculitis, have only been partially elucidated. Here we discuss recent evidence that implicates the prototypic Damage-Associated Molecular Pattern/ alarmin, the High Mobility Group Box 1 (HMGB1 protein in systemic vasculitis and in the vascular inflammation associated to systemic sclerosis. HMGB1 could represent a player in the pathogenesis of rheumatic diseases and an attractive target for molecular interventions.

Altered network hub connectivity after acute LSD administration

Directory of Open Access Journals (Sweden)

Felix Müller

Full Text Available LSD is an ambiguous substance, said to mimic psychosis and to improve mental health in people suffering from anxiety and depression. Little is known about the neuronal correlates of altered states of consciousness induced by this substance. Limited previous studies indicated profound changes in functional connectivity of resting state networks after the administration of LSD. The current investigation attempts to replicate and extend those findings in an independent sample. In a double-blind, randomized, cross-over study, 100 μg LSD and placebo were orally administered to 20 healthy participants. Resting state brain activity was assessed by functional magnetic resonance imaging. Within-network and between-network connectivity measures of ten established resting state networks were compared between drug conditions. Complementary analysis were conducted using resting state networks as sources in seed-to-voxel analyses. Acute LSD administration significantly decreased functional connectivity within visual, sensorimotor and auditory networks and the default mode network. While between-network connectivity was widely increased and all investigated networks were affected to some extent, seed-to-voxel analyses consistently indicated increased connectivity between networks and subcortical (thalamus, striatum and cortical (precuneus, anterior cingulate cortex hub structures. These latter observations are consistent with findings on the importance of hubs in psychopathological states, especially in psychosis, and could underlay therapeutic effects of hallucinogens as proposed by a recent model. Keywords: LSD, fMRI, Functional connectivity, Networks, Hubs

Seeded Bayesian Networks: Constructing genetic networks from microarray data

Directory of Open Access Journals (Sweden)

Quackenbush John

2008-07-01

Full Text Available Abstract Background DNA microarrays and other genomics-inspired technologies provide large datasets that often include hidden patterns of correlation between genes reflecting the complex processes that underlie cellular metabolism and physiology. The challenge in analyzing large-scale expression data has been to extract biologically meaningful inferences regarding these processes – often represented as networks – in an environment where the datasets are often imperfect and biological noise can obscure the actual signal. Although many techniques have been developed in an attempt to address these issues, to date their ability to extract meaningful and predictive network relationships has been limited. Here we describe a method that draws on prior information about gene-gene interactions to infer biologically relevant pathways from microarray data. Our approach consists of using preliminary networks derived from the literature and/or protein-protein interaction data as seeds for a Bayesian network analysis of microarray results. Results Through a bootstrap analysis of gene expression data derived from a number of leukemia studies, we demonstrate that seeded Bayesian Networks have the ability to identify high-confidence gene-gene interactions which can then be validated by comparison to other sources of pathway data. Conclusion The use of network seeds greatly improves the ability of Bayesian Network analysis to learn gene interaction networks from gene expression data. We demonstrate that the use of seeds derived from the biomedical literature or high-throughput protein-protein interaction data, or the combination, provides improvement over a standard Bayesian Network analysis, allowing networks involving dynamic processes to be deduced from the static snapshots of biological systems that represent the most common source of microarray data. Software implementing these methods has been included in the widely used TM4 microarray analysis package.

Extending Resolution of Fault Slip With Geodetic Networks Through Optimal Network Design

Science.gov (United States)

Sathiakumar, Sharadha; Barbot, Sylvain Denis; Agram, Piyush

2017-12-01

Geodetic networks consisting of high precision and high rate Global Navigation Satellite Systems (GNSS) stations continuously monitor seismically active regions of the world. These networks measure surface displacements and the amount of geodetic strain accumulated in the region and give insight into the seismic potential. SuGar (Sumatra GPS Array) in Sumatra, GEONET (GNSS Earth Observation Network System) in Japan, and PBO (Plate Boundary Observatory) in California are some examples of established networks around the world that are constantly expanding with the addition of new stations to improve the quality of measurements. However, installing new stations to existing networks is tedious and expensive. Therefore, it is important to choose suitable locations for new stations to increase the precision obtained in measuring the geophysical parameters of interest. Here we describe a methodology to design optimal geodetic networks that augment the existing system and use it to investigate seismo-tectonics at convergent and transform boundaries considering land-based and seafloor geodesy. The proposed network design optimization would be pivotal to better understand seismic and tsunami hazards around the world. Land-based and seafloor networks can monitor fault slip around subduction zones with significant resolution, but transform faults are more challenging to monitor due to their near-vertical geometry.

Node counting in wireless ad-hoc networks

NARCIS (Netherlands)

Evers, J.H.M.; Kiss, D.; Kowalczyk, W.; Navilarekallu, T.; Renger, D.R.M.; Sella, L.; Timperio, V.; Viorel, A.; Wijk, van A.C.C.; Yzelman, A.J.; Planqué, B.; Bhulai, S.; Hulshof, J.; Kager, W.; Rot, T.

2012-01-01

We study wireless ad-hoc networks consisting of small microprocessors with limited memory, where the wireless communication between the processors can be highly unreliable. For this setting, we propose a number of algorithms to estimate the number of nodes in the network, and the number of direct

T-cell movement on the reticular network.

Science.gov (United States)

Donovan, Graham M; Lythe, Grant

2012-02-21

The idea that the apparently random motion of T cells in lymph nodes is a result of movement on a reticular network (RN) has received support from dynamic imaging experiments and theoretical studies. We present a mathematical representation of the RN consisting of edges connecting vertices that are randomly distributed in three-dimensional space, and models of lymphocyte movement on such networks including constant speed motion along edges and Brownian motion, not in three-dimensions, but only along edges. The simplest model, in which a cell moves with a constant speed along edges, is consistent with mean-squared displacement proportional to time over intervals long enough to include several changes of direction. A non-random distribution of turning angles is one consequence of motion on a preformed network. Confining cell movement to a network does not, in itself, increase the frequency of cell-cell encounters. Copyright © 2011 Elsevier Ltd. All rights reserved.

BAKNET - Communication network for radiation monitoring devices

International Nuclear Information System (INIS)

Cohen, Y.; Wengrowicz, U.; Tirosh, D.; Barak, D.

1997-01-01

A system, based on a new concept of controlling and monitoring distributed radiation monitors, has been developed and approved at the NRCN. The system, named B AKNET Network , consists of a series of communication adapters connected to a main PC via an RS-485 communication network (see Fig. 1). The network's maximal length is 1200 meters and it enables connection of up to 128 adapters. The BAKNET adapters are designed to interface output signals of different types of stationary radiation monitors to a main PC. The BAKNET adapters' interface type includes: digital, analog, RS-232, and mixed output signals. This allows versatile interfacing of different stationary radiation monitors to the main computer. The connection to the main computer is via an RS-485 network, utilizing an identical communication protocol. The PC software, written in C ++ under MS-Windows, consists of two main programs. The first is the data collection program and the second is the Human Machine Interface (HMI). (authors)

Wireless sensor networks distributed consensus estimation

CERN Document Server

Chen, Cailian; Guan, Xinping

2014-01-01

This SpringerBrief evaluates the cooperative effort of sensor nodes to accomplish high-level tasks with sensing, data processing and communication. The metrics of network-wide convergence, unbiasedness, consistency and optimality are discussed through network topology, distributed estimation algorithms and consensus strategy. Systematic analysis reveals that proper deployment of sensor nodes and a small number of low-cost relays (without sensing function) can speed up the information fusion and thus improve the estimation capability of wireless sensor networks (WSNs). This brief also investiga

Efficient Cancer Detection Using Multiple Neural Networks.

Science.gov (United States)

Shell, John; Gregory, William D

2017-01-01

The inspection of live excised tissue specimens to ascertain malignancy is a challenging task in dermatopathology and generally in histopathology. We introduce a portable desktop prototype device that provides highly accurate neural network classification of malignant and benign tissue. The handheld device collects 47 impedance data samples from 1 Hz to 32 MHz via tetrapolar blackened platinum electrodes. The data analysis was implemented with six different backpropagation neural networks (BNN). A data set consisting of 180 malignant and 180 benign breast tissue data files in an approved IRB study at the Aurora Medical Center, Milwaukee, WI, USA, were utilized as a neural network input. The BNN structure consisted of a multi-tiered consensus approach autonomously selecting four of six neural networks to determine a malignant or benign classification. The BNN analysis was then compared with the histology results with consistent sensitivity of 100% and a specificity of 100%. This implementation successfully relied solely on statistical variation between the benign and malignant impedance data and intricate neural network configuration. This device and BNN implementation provides a novel approach that could be a valuable tool to augment current medical practice assessment of the health of breast, squamous, and basal cell carcinoma and other excised tissue without requisite tissue specimen expertise. It has the potential to provide clinical management personnel with a fast non-invasive accurate assessment of biopsied or sectioned excised tissue in various clinical settings.

Time-consistent and market-consistent evaluations

NARCIS (Netherlands)

Pelsser, A.; Stadje, M.A.

2014-01-01

We consider evaluation methods for payoffs with an inherent financial risk as encountered for instance for portfolios held by pension funds and insurance companies. Pricing such payoffs in a way consistent to market prices typically involves combining actuarial techniques with methods from

Modelling the impact of social network on energy savings

International Nuclear Information System (INIS)

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

2016-01-01

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

Control of a hybrid compensator in a power network by an artificial neural network

Directory of Open Access Journals (Sweden)

I. S. Shaw

1998-07-01

Full Text Available Increased interest in the elimination of distortion in electrical power networks has led to the development of various compensator topologies. The increasing cost of electrical energy necessitates the cost-effective operation of any of these topologies. This paper considers the development of an artificial neural network based controller, trained by means of the backpropagation method, that ensures the cost-effective operation of the hybrid compensator consisting of various converters and filters.

Contingent factors affecting network learning

OpenAIRE

Peters, Linda D.; Pressey, Andrew D.; Johnston, Wesley J.

2016-01-01

To increase understanding of the impact of individuals on organizational learning processes, this paper explores the impact of individual cognition and action on the absorptive capacity process of the wider network. In particular this study shows how contingent factors such as social integration mechanisms and power relationships influence how network members engage in, and benefit from, learning. The use of cognitive consistency and sensemaking theory enables examination of how these conting...

Global Operations Networks

DEFF Research Database (Denmark)

In the current context of global economic liberalisation and technological advancements, industrial companies are less likely to generate value in the traditional vertically integrated chain. Instead, they are doing so by means of elaborate cross-border and cross-organisational networks. As a rule......, these networks are configured on a global basis and consist of diverse and interdependent affiliates (linked both through ownership and non-equity relationships), which are engaged in an exchange of goods, services and information. The Scandinavian context is no exception to this trend. Nevertheless......, international comparative studies providing comprehensive insights from it are still rare. With the objective of bridging this gap, Global Operations Networks (GONE) project (sponsored by the Danish Research Council) brought together numerous academic and industrial partners from Denmark, Sweden and Finland...

Making the Sustainable Development Goals Consistent with Sustainability

Directory of Open Access Journals (Sweden)

Mathis Wackernagel

2017-07-01

Full Text Available The UN’s Sustainable development Goals (SDGs are the most significant global effort so far to advance global sustainable development. Bertelsmann Stiftung and the sustainable development solutions network released an SDG index to assess countries’ average performance on SDGs. Ranking high on the SDG index strongly correlates with high per person demand on nature (or “Footprints”, and low ranking with low Footprints, making evident that the SDGs as expressed today vastly underperform on sustainability. Such underperformance is anti-poor because lowest-income people exposed to resource insecurity will lack the financial means to shield themselves from the consequences. Given the significance of the SDGs for guiding development, rigorous accounting is essential for making them consistent with the goals of sustainable development: thriving within the means of planet Earth.

Making the Sustainable Development Goals Consistent with Sustainability

International Nuclear Information System (INIS)

Wackernagel, Mathis; Hanscom, Laurel; Lin, David

2017-01-01

The UN’s Sustainable development Goals (SDGs) are the most significant global effort so far to advance global sustainable development. Bertelsmann Stiftung and the sustainable development solutions network released an SDG index to assess countries’ average performance on SDGs. Ranking high on the SDG index strongly correlates with high per person demand on nature (or “Footprints”), and low ranking with low Footprints, making evident that the SDGs as expressed today vastly underperform on sustainability. Such underperformance is anti-poor because lowest-income people exposed to resource insecurity will lack the financial means to shield themselves from the consequences. Given the significance of the SDGs for guiding development, rigorous accounting is essential for making them consistent with the goals of sustainable development: thriving within the means of planet Earth.

Making the Sustainable Development Goals Consistent with Sustainability

Energy Technology Data Exchange (ETDEWEB)

Wackernagel, Mathis, E-mail: mathis.wackernagel@footprintnetwork.org; Hanscom, Laurel; Lin, David [Global Footprint Network, Oakland, CA (United States)

2017-07-11

The UN’s Sustainable development Goals (SDGs) are the most significant global effort so far to advance global sustainable development. Bertelsmann Stiftung and the sustainable development solutions network released an SDG index to assess countries’ average performance on SDGs. Ranking high on the SDG index strongly correlates with high per person demand on nature (or “Footprints”), and low ranking with low Footprints, making evident that the SDGs as expressed today vastly underperform on sustainability. Such underperformance is anti-poor because lowest-income people exposed to resource insecurity will lack the financial means to shield themselves from the consequences. Given the significance of the SDGs for guiding development, rigorous accounting is essential for making them consistent with the goals of sustainable development: thriving within the means of planet Earth.

Scale-free models for the structure of business firm networks.

Science.gov (United States)

Kitsak, Maksim; Riccaboni, Massimo; Havlin, Shlomo; Pammolli, Fabio; Stanley, H Eugene

2010-03-01

We study firm collaborations in the life sciences and the information and communication technology sectors. We propose an approach to characterize industrial leadership using k -shell decomposition, with top-ranking firms in terms of market value in higher k -shell layers. We find that the life sciences industry network consists of three distinct components: a "nucleus," which is a small well-connected subgraph, "tendrils," which are small subgraphs consisting of small degree nodes connected exclusively to the nucleus, and a "bulk body," which consists of the majority of nodes. Industrial leaders, i.e., the largest companies in terms of market value, are in the highest k -shells of both networks. The nucleus of the life sciences sector is very stable: once a firm enters the nucleus, it is likely to stay there for a long time. At the same time we do not observe the above three components in the information and communication technology sector. We also conduct a systematic study of these three components in random scale-free networks. Our results suggest that the sizes of the nucleus and the tendrils in scale-free networks decrease as the exponent of the power-law degree distribution lambda increases, and disappear for lambda>or=3 . We compare the k -shell structure of random scale-free model networks with two real-world business firm networks in the life sciences and in the information and communication technology sectors. We argue that the observed behavior of the k -shell structure in the two industries is consistent with the coexistence of both preferential and random agreements in the evolution of industrial networks.

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

Science.gov (United States)

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

2017-12-28

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

Towards a proof of the Kahn principle for linear dynamic networks

NARCIS (Netherlands)

A. de Bruin (Arie); S-H. Nienhuys-Cheng (Shan-Hwei)

1994-01-01

textabstractWe consider dynamic Kahn-like data flow networks, i.e. networks consisting of deterministic processes each of which is able to expand into a subnetwork. The Kahn principle states that such networks are deterministic, i.e. that for each network we have that each execution provided with

COMPLEX NETWORK SIMULATION OF FOREST NETWORK SPATIAL PATTERN IN PEARL RIVER DELTA

Directory of Open Access Journals (Sweden)

Y. Zeng

2017-09-01

Full Text Available Forest network-construction uses for the method and model with the scale-free features of complex network theory based on random graph theory and dynamic network nodes which show a power-law distribution phenomenon. The model is suitable for ecological disturbance by larger ecological landscape Pearl River Delta consistent recovery. Remote sensing and GIS spatial data are available through the latest forest patches. A standard scale-free network node distribution model calculates the area of forest network’s power-law distribution parameter value size; The recent existing forest polygons which are defined as nodes can compute the network nodes decaying index value of the network’s degree distribution. The parameters of forest network are picked up then make a spatial transition to GIS real world models. Hence the connection is automatically generated by minimizing the ecological corridor by the least cost rule between the near nodes. Based on scale-free network node distribution requirements, select the number compared with less, a huge point of aggregation as a future forest planning network’s main node, and put them with the existing node sequence comparison. By this theory, the forest ecological projects in the past avoid being fragmented, scattered disorderly phenomena. The previous regular forest networks can be reduced the required forest planting costs by this method. For ecological restoration of tropical and subtropical in south China areas, it will provide an effective method for the forest entering city project guidance and demonstration with other ecological networks (water, climate network, etc. for networking a standard and base datum.

Statistical mechanics of the fashion game on random networks

International Nuclear Information System (INIS)

Sun, YiFan

2016-01-01

A model of fashion on networks is studied. This model consists of two groups of agents that are located on a network and have opposite viewpoints towards being fashionable: behaving consistently with either the majority or the minority of adjacent agents. Checking whether the fashion game has a pure Nash equilibrium (pure NE) is a non-deterministic polynomial complete problem. Using replica-symmetric mean field theory, the largest proportion of satisfied agents and the region where at least one pure NE should exist are determined for several types of random networks. Furthermore, a quantitive analysis of the asynchronous best response dynamics yields the phase diagram of existence and detectability of pure NE in the fashion game on some random networks. (paper: classical statistical mechanics, equilibrium and non-equilibrium).

ATLAS-Canada Network

Energy Technology Data Exchange (ETDEWEB)

Gable, I; Sobie, R J [HEPnet/Canada, Victoria, BC (Canada); Bedinelli, M; Butterworth, S; Groer, L; Kupchinsky, V [University of Toronto, Toronto, ON (Canada); Caron, B; McDonald, S; Payne, C [TRIUMF Laboratory, Vancouver, BC (Canada); Chambers, R [University of Alberta, Edmonton, AB (Canada); Fitzgerald, B [University of Victoria, Victoria, BC (Canada); Hatem, R; Marshall, P; Pobric, D [CANARIE Inc., Ottawa, ON (Canada); Maddalena, P; Mercure, P; Robertson, S; Rochefort, M [McGill University, Montreal, QC (Canada); McWilliam, D [BCNet, Vancouver, BC (Canada); Siegert, M [Simon Fraser University, Burnaby, BC (Canada)], E-mail: igable@uvic.ca (and others)

2008-12-15

The ATLAS-Canada computing model consists of a WLCG Tier-1 computing centre located at the TRIUMF Laboratory in Vancouver, Canada, and two distributed Tier-2 computing centres in eastern and western Canadian universities. The TRIUMF Tier-1 is connected to the CERN Tier-0 via a 10G dedicated circuit provided by CANARIE. The Canadian institutions hosting Tier-2 facilities are connected to TRIUMF via 1G lightpaths, and routing between Tier-2s occurs through TRIUMF. This paper discusses the architecture of the ATLAS-Canada network, the challenges of building the network, and the future plans.

Noise Analysis studies with neural networks

International Nuclear Information System (INIS)

Seker, S.; Ciftcioglu, O.

1996-01-01

Noise analysis studies with neural network are aimed. Stochastic signals at the input of the network are used to obtain an algorithmic multivariate stochastic signal modeling. To this end, lattice modeling of a stochastic signal is performed to obtain backward residual noise sources which are uncorrelated among themselves. There are applied together with an additional input to the network to obtain an algorithmic model which is used for signal detection for early failure in plant monitoring. The additional input provides the information to the network to minimize the difference between the signal and the network's one-step-ahead prediction. A stochastic algorithm is used for training where the errors reflecting the measurement error during the training are also modelled so that fast and consistent convergence of network's weights is obtained. The lattice structure coupled to neural network investigated with measured signals from an actual power plant. (authors)

Modeling, Optimization & Control of Hydraulic Networks

DEFF Research Database (Denmark)

Tahavori, Maryamsadat

2014-01-01

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

Developing a Framework and Implementing User-Driven Innovation in Supply and Value Network

DEFF Research Database (Denmark)

Jacobsen, Alexia; Lassen, Astrid Heidemann; Wandahl, Søren

2011-01-01

This paper serves to create a framework for and, subsequently, implementing user-driven innovation in a construction material industry network. The research has its outset in Project InnoDoors that consists of a Danish university and a construction material network. The framework and the implemen......This paper serves to create a framework for and, subsequently, implementing user-driven innovation in a construction material industry network. The research has its outset in Project InnoDoors that consists of a Danish university and a construction material network. The framework...

Functional connectivity modeling of consistent cortico-striatal degeneration in Huntington's disease

Directory of Open Access Journals (Sweden)

Imis Dogan

2015-01-01

Full Text Available Huntington's disease (HD is a progressive neurodegenerative disorder characterized by a complex neuropsychiatric phenotype. In a recent meta-analysis we identified core regions of consistent neurodegeneration in premanifest HD in the striatum and middle occipital gyrus (MOG. For early manifest HD convergent evidence of atrophy was most prominent in the striatum, motor cortex (M1 and inferior frontal junction (IFJ. The aim of the present study was to functionally characterize this topography of brain atrophy and to investigate differential connectivity patterns formed by consistent cortico-striatal atrophy regions in HD. Using areas of striatal and cortical atrophy at different disease stages as seeds, we performed task-free resting-state and task-based meta-analytic connectivity modeling (MACM. MACM utilizes the large data source of the BrainMap database and identifies significant areas of above-chance co-activation with the seed-region via the activation-likelihood-estimation approach. In order to delineate functional networks formed by cortical as well as striatal atrophy regions we computed the conjunction between the co-activation profiles of striatal and cortical seeds in the premanifest and manifest stages of HD, respectively. Functional characterization of the seeds was obtained using the behavioral meta-data of BrainMap. Cortico-striatal atrophy seeds of the premanifest stage of HD showed common co-activation with a rather cognitive network including the striatum, anterior insula, lateral prefrontal, premotor, supplementary motor and parietal regions. A similar but more pronounced co-activation pattern, additionally including the medial prefrontal cortex and thalamic nuclei was found with striatal and IFJ seeds at the manifest HD stage. The striatum and M1 were functionally connected mainly to premotor and sensorimotor areas, posterior insula, putamen and thalamus. Behavioral characterization of the seeds confirmed that experiments

Communication Network Architectures Based on Ethernet Passive Optical Network for Offshore Wind Power Farms

Directory of Open Access Journals (Sweden)

Mohamed A. Ahmed

2016-03-01

Full Text Available Nowadays, with large-scale offshore wind power farms (WPFs becoming a reality, more efforts are needed to maintain a reliable communication network for WPF monitoring. Deployment topologies, redundancy, and network availability are the main items to enhance the communication reliability between wind turbines (WTs and control centers. Traditional communication networks for monitoring and control (i.e., supervisory control and data acquisition (SCADA systems using switched gigabit Ethernet will not be sufficient for the huge amount of data passing through the network. In this paper, the optical power budget, optical path loss, reliability, and network cost of the proposed Ethernet Passive Optical Network (EPON-based communication network for small-size offshore WPFs have been evaluated for five different network architectures. The proposed network model consists of an optical network unit device (ONU deployed on the WT side for collecting data from different internal networks. All ONUs from different WTs are connected to a central optical line terminal (OLT, placed in the control center. There are no active electronic elements used between the ONUs and the OLT, which reduces the costs and complexity of maintenance and deployment. As fiber access networks without any protection are characterized by poor reliability, three different protection schemes have been configured, explained, and discussed. Considering the cost of network components, the total implementation expense of different architectures with, or without, protection have been calculated and compared. The proposed network model can significantly contribute to the communication network architecture for next generation WPFs.

The APS control system network

International Nuclear Information System (INIS)

Sidorowicz, K.V.; McDowell, W.P.

1995-01-01

The APS accelerator control system is a distributed system consisting of operator interfaces, a network, and computer-controlled interfaces to hardware. This implementation of a control system has come to be called the open-quotes Standard Model.close quotes The operator interface is a UNDC-based workstation with an X-windows graphical user interface. The workstation may be located at any point on the facility network and maintain full functionality. The function of the network is to provide a generalized communication path between the host computers, operator workstations, input/output crates, and other hardware that comprise the control system. The crate or input/output controller (IOC) provides direct control and input/output interfaces for each accelerator subsystem. The network is an integral part of all modem control systems and network performance will determine many characteristics of a control system. This paper will describe the overall APS network and examine the APS control system network in detail. Metrics are provided on the performance of the system under various conditions

A network architecture for International Business Satellite communications

Science.gov (United States)

Takahata, Fumio; Nohara, Mitsuo; Takeuchi, Yoshio

Demand Assignment (DA) control is expected to be introduced in the International Business Satellte communications (IBS) network in order to cope with a growing international business traffic. The paper discusses the DA/IBS network from the viewpoints of network configuration, satellite channel configuration and DA control. The network configuration proposed here consists of one Central Station with network management function and several Network Coordination Stations with user management function. A satellite channel configuration is also presented along with a tradeoff study on transmission bit rate, high power amplifier output power requirement, and service quality. The DA control flow and protocol based on CCITT Signalling System No. 7 are also proposed.

Dissipation, Voltage Profile and Levy Dragon in a Special Ladder Network

Science.gov (United States)

Ucak, C.

2009-01-01

A ladder network constructed by an elementary two-terminal network consisting of a parallel resistor-inductor block in series with a parallel resistor-capacitor block sometimes is said to have a non-dispersive dissipative response. This special ladder network is created iteratively by replacing the elementary two-terminal network in place of the…

Consistency between GRUAN sondes, LBLRTM and IASI

Directory of Open Access Journals (Sweden)

X. Calbet

2017-06-01

Full Text Available Radiosonde soundings from the GCOS Reference Upper-Air Network (GRUAN data record are shown to be consistent with Infrared Atmospheric Sounding Instrument (IASI-measured radiances via LBLRTM (Line-By-Line Radiative Transfer Model in the part of the spectrum that is mostly affected by water vapour absorption in the upper troposphere (from 700 hPa up. This result is key for climate data records, since GRUAN, IASI and LBLRTM constitute reference measurements or a reference radiative transfer model in each of their fields. This is specially the case for night-time radiosonde measurements. Although the sample size is small (16 cases, daytime GRUAN radiosonde measurements seem to have a small dry bias of 2.5 % in absolute terms of relative humidity, located mainly in the upper troposphere, with respect to LBLRTM and IASI. Full metrological closure is not yet possible and will not be until collocation uncertainties are better characterized and a full uncertainty covariance matrix is clarified for GRUAN.

Characterizations of the Beta and the Degree Network Power Measure

NARCIS (Netherlands)

van den Brink, J.R.; Borm, P.; Hendrickx, R.; Owen, G.

2008-01-01

A symmetric network consists of a set of positions and a set of bilateral links between these positions. For every symmetric network we define a cooperative transferable utility game that measures the "power" of each coalition of positions in the network. Applying the Shapley value to this game

Backend solutions for AA in the MUSE network supporting FMC

NARCIS (Netherlands)

Neerbos, A.N.R. van; Prins, M.; Melander, B.; Pimilla Larrucea, I.; Thakur, M.J.; Fredricx, F.

2007-01-01

The European MUSE project investigated fixed-mobile convergence from the perspective of an unbundled fixed network. A major part of the work consisted of finding solutions for the authentication and authorisation of users who roam from their home network to a visited network. This paper shows how AA

Relationships, networks and innovation - squaring the circle?

DEFF Research Database (Denmark)

Goduscheit, René Chester

2009-01-01

energy sector, two specific aspects are addressed: 1) the trade-off between explorative innovation and network efficiency, and 2) the effect of innovating in a network, in which the organisations have established relationships. The case study illustrates that a network based on existing relationships......The virtue of interorganisational networks as the locus of innovation is widely acknowledged. However, it is often neglected that interorganisational collaboration does not automatically lead to idea generation and the exploration of new possibilities. On the basis of a case study from the Danish...... was working efficiently but was lacking the ability to explore new possibilities. On the other hand, a comprehensive network consisting of ‘new' partners did not succeed in getting an outcome from the network....

Multisector Health Policy Networks in 15 Large US Cities

Science.gov (United States)

Leider, J. P.; Carothers, Bobbi J.; Castrucci, Brian C.; Hearne, Shelley

2016-01-01

Context: Local health departments (LHDs) have historically not prioritized policy development, although it is one of the 3 core areas they address. One strategy that may influence policy in LHD jurisdictions is the formation of partnerships across sectors to work together on local public health policy. Design: We used a network approach to examine LHD local health policy partnerships across 15 large cities from the Big Cities Health Coalition. Setting/Participants: We surveyed the health departments and their partners about their working relationships in 5 policy areas: core local funding, tobacco control, obesity and chronic disease, violence and injury prevention, and infant mortality. Outcome Measures: Drawing on prior literature linking network structures with performance, we examined network density, transitivity, centralization and centrality, member diversity, and assortativity of ties. Results: Networks included an average of 21.8 organizations. Nonprofits and government agencies made up the largest proportions of the networks, with 28.8% and 21.7% of network members, whereas for-profits and foundations made up the smallest proportions in all of the networks, with just 1.2% and 2.4% on average. Mean values of density, transitivity, diversity, assortativity, centralization, and centrality showed similarity across policy areas and most LHDs. The tobacco control and obesity/chronic disease networks were densest and most diverse, whereas the infant mortality policy networks were the most centralized and had the highest assortativity. Core local funding policy networks had lower scores than other policy area networks by most network measures. Conclusion: Urban LHDs partner with organizations from diverse sectors to conduct local public health policy work. Network structures are similar across policy areas jurisdictions. Obesity and chronic disease, tobacco control, and infant mortality networks had structures consistent with higher performing networks, whereas

Structural covariance networks in the mouse brain.

Science.gov (United States)

Pagani, Marco; Bifone, Angelo; Gozzi, Alessandro

2016-04-01

The presence of networks of correlation between regional gray matter volume as measured across subjects in a group of individuals has been consistently described in several human studies, an approach termed structural covariance MRI (scMRI). Complementary to prevalent brain mapping modalities like functional and diffusion-weighted imaging, the approach can provide precious insights into the mutual influence of trophic and plastic processes in health and pathological states. To investigate whether analogous scMRI networks are present in lower mammal species amenable to genetic and experimental manipulation such as the laboratory mouse, we employed high resolution morphoanatomical MRI in a large cohort of genetically-homogeneous wild-type mice (C57Bl6/J) and mapped scMRI networks using a seed-based approach. We show that the mouse brain exhibits robust homotopic scMRI networks in both primary and associative cortices, a finding corroborated by independent component analyses of cortical volumes. Subcortical structures also showed highly symmetric inter-hemispheric correlations, with evidence of distributed antero-posterior networks in diencephalic regions of the thalamus and hypothalamus. Hierarchical cluster analysis revealed six identifiable clusters of cortical and sub-cortical regions corresponding to previously described neuroanatomical systems. Our work documents the presence of homotopic cortical and subcortical scMRI networks in the mouse brain, thus supporting the use of this species to investigate the elusive biological and neuroanatomical underpinnings of scMRI network development and its derangement in neuropathological states. The identification of scMRI networks in genetically homogeneous inbred mice is consistent with the emerging view of a key role of environmental factors in shaping these correlational networks. Copyright © 2016 Elsevier Inc. All rights reserved.

Generic, network schema agnostic sparse tensor factorization for single-pass clustering of heterogeneous information networks.

Science.gov (United States)

Wu, Jibing; Meng, Qinggang; Deng, Su; Huang, Hongbin; Wu, Yahui; Badii, Atta

2017-01-01

Heterogeneous information networks (e.g. bibliographic networks and social media networks) that consist of multiple interconnected objects are ubiquitous. Clustering analysis is an effective method to understand the semantic information and interpretable structure of the heterogeneous information networks, and it has attracted the attention of many researchers in recent years. However, most studies assume that heterogeneous information networks usually follow some simple schemas, such as bi-typed networks or star network schema, and they can only cluster one type of object in the network each time. In this paper, a novel clustering framework is proposed based on sparse tensor factorization for heterogeneous information networks, which can cluster multiple types of objects simultaneously in a single pass without any network schema information. The types of objects and the relations between them in the heterogeneous information networks are modeled as a sparse tensor. The clustering issue is modeled as an optimization problem, which is similar to the well-known Tucker decomposition. Then, an Alternating Least Squares (ALS) algorithm and a feasible initialization method are proposed to solve the optimization problem. Based on the tensor factorization, we simultaneously partition different types of objects into different clusters. The experimental results on both synthetic and real-world datasets have demonstrated that our proposed clustering framework, STFClus, can model heterogeneous information networks efficiently and can outperform state-of-the-art clustering algorithms as a generally applicable single-pass clustering method for heterogeneous network which is network schema agnostic.

A Weighted Evolving Network with Community Size Preferential Attachment

International Nuclear Information System (INIS)

Zhuo Zhiwei; Shan Erfang

2010-01-01

Community structure is an important characteristic in real complex network. It is a network consists of groups of nodes within which links are dense but among which links are sparse. In this paper, the evolving network include node, link and community growth and we apply the community size preferential attachment and strength preferential attachment to a growing weighted network model and utilize weight assigning mechanism from BBV model. The resulting network reflects the intrinsic community structure with generalized power-law distributions of nodes' degrees and strengths.

RegnANN: Reverse Engineering Gene Networks using Artificial Neural Networks.

Directory of Open Access Journals (Sweden)

Marco Grimaldi

Full Text Available RegnANN is a novel method for reverse engineering gene networks based on an ensemble of multilayer perceptrons. The algorithm builds a regressor for each gene in the network, estimating its neighborhood independently. The overall network is obtained by joining all the neighborhoods. RegnANN makes no assumptions about the nature of the relationships between the variables, potentially capturing high-order and non linear dependencies between expression patterns. The evaluation focuses on synthetic data mimicking plausible submodules of larger networks and on biological data consisting of submodules of Escherichia coli. We consider Barabasi and Erdös-Rényi topologies together with two methods for data generation. We verify the effect of factors such as network size and amount of data to the accuracy of the inference algorithm. The accuracy scores obtained with RegnANN is methodically compared with the performance of three reference algorithms: ARACNE, CLR and KELLER. Our evaluation indicates that RegnANN compares favorably with the inference methods tested. The robustness of RegnANN, its ability to discover second order correlations and the agreement between results obtained with this new methods on both synthetic and biological data are promising and they stimulate its application to a wider range of problems.

Wireless sensor network for irrigation application in cotton

Science.gov (United States)

A wireless sensor network was deployed in a cotton field to monitor soil water status for irrigation. The network included two systems, a Decagon system and a microcontroller-based system. The Decagon system consists of soil volumetric water-content sensors, wireless data loggers, and a central data...

Simulation studies of a wide area health care network.

Science.gov (United States)

McDaniel, J. G.

1994-01-01

There is an increasing number of efforts to install wide area health care networks. Some of these networks are being built to support several applications over a wide user base consisting primarily of medical practices, hospitals, pharmacies, medical laboratories, payors, and suppliers. Although on-line, multi-media telecommunication is desirable for some purposes such as cardiac monitoring, store-and-forward messaging is adequate for many common, high-volume applications. Laboratory test results and payment claims, for example, can be distributed using electronic messaging networks. Several network prototypes have been constructed to determine the technical problems and to assess the effectiveness of electronic messaging in wide area health care networks. Our project, Health Link, developed prototype software that was able to use the public switched telephone network to exchange messages automatically, reliably and securely. The network could be configured to accommodate the many different traffic patterns and cost constraints of its users. Discrete event simulations were performed on several network models. Canonical star and mesh networks, that were composed of nodes operating at steady state under equal loads, were modeled. Both topologies were found to support the throughput of a generic wide area health care network. The mean message delivery time of the mesh network was found to be less than that of the star network. Further simulations were conducted for a realistic large-scale health care network consisting of 1,553 doctors, 26 hospitals, four medical labs, one provincial lab and one insurer. Two network topologies were investigated: one using predominantly peer-to-peer communication, the other using client-server communication.(ABSTRACT TRUNCATED AT 250 WORDS) PMID:7949966

Strategies for the diffusion of innovations on networks

OpenAIRE

Alkemade, F.; Castaldi, C.

2005-01-01

We investigate the spread of innovations on a social network. The network consists of agents that are exposed to the introduction of a new product. Consumers decide whether or not to buy the product based on their own preferences and the decisions of their neighbors in the social network.We use and extend concepts from the literature on epidemics and herd behavior to study this problem. The central question of this paper is whether firms can learn about the network structure and consumer char...

Domain wall networks on solitons

International Nuclear Information System (INIS)

Sutcliffe, Paul

2003-01-01

Domain wall networks on the surface of a soliton are studied in a simple theory. It consists of two complex scalar fields, in 3+1 dimensions, with a global U(1)xZ n symmetry, where n>2. Solutions are computed numerically in which one of the fields forms a Q ball and the other field forms a network of domain walls localized on the surface of the Q ball. Examples are presented in which the domain walls lie along the edges of a spherical polyhedron, forming junctions at its vertices. It is explained why only a small restricted class of polyhedra can arise as domain wall networks

Software Defined Networking (SDN) controlled all optical switching networks with multi-dimensional switching architecture

Science.gov (United States)

Zhao, Yongli; Ji, Yuefeng; Zhang, Jie; Li, Hui; Xiong, Qianjin; Qiu, Shaofeng

2014-08-01

Ultrahigh throughout capacity requirement is challenging the current optical switching nodes with the fast development of data center networks. Pbit/s level all optical switching networks need to be deployed soon, which will cause the high complexity of node architecture. How to control the future network and node equipment together will become a new problem. An enhanced Software Defined Networking (eSDN) control architecture is proposed in the paper, which consists of Provider NOX (P-NOX) and Node NOX (N-NOX). With the cooperation of P-NOX and N-NOX, the flexible control of the entire network can be achieved. All optical switching network testbed has been experimentally demonstrated with efficient control of enhanced Software Defined Networking (eSDN). Pbit/s level all optical switching nodes in the testbed are implemented based on multi-dimensional switching architecture, i.e. multi-level and multi-planar. Due to the space and cost limitation, each optical switching node is only equipped with four input line boxes and four output line boxes respectively. Experimental results are given to verify the performance of our proposed control and switching architecture.

Design Guidelines for New Generation Network Architecture

Science.gov (United States)

Harai, Hiroaki; Fujikawa, Kenji; Kafle, Ved P.; Miyazawa, Takaya; Murata, Masayuki; Ohnishi, Masaaki; Ohta, Masataka; Umezawa, Takeshi

Limitations are found in the recent Internet because a lot of functions and protocols are patched to the original suite of layered protocols without considering global optimization. This reveals that end-to-end argument in the original Internet was neither sufficient for the current societal network and nor for a sustainable network of the future. In this position paper, we present design guidelines for a future network, which we call the New Generation Network, which provides the inclusion of diverse human requirements, reliable connection between the real-world and virtual network space, and promotion of social potentiality for human emergence. The guidelines consist of the crystal synthesis, the reality connection, and the sustainable & evolutional guidelines.

Networks and knowledge creation for meaning

DEFF Research Database (Denmark)

Brink, Tove

2016-01-01

. The findings show that business networks provide an important frame for organising both central- and distributed leadership to provide meaning on all levels of the network organisations. The business network consists of customers, suppliers and business partners for support of reciprocal learning for providing......The research in this paper reveals how business networks can create organisational knowledge to provide meaning for enabling innovation and reduction of Levelized Cost Of Energy (LCOE)? The research was conducted from June 2014 to May 2015, using a qualitative deductive research approach...... and due to the organising process highly valuable findings regarding innovation can be utilised both for improved central decisions and for improved application of knowledge locally when the meaning is established. Further research is needed for elaboration of the business network frame and the organising...

Network Completion for Static Gene Expression Data

Directory of Open Access Journals (Sweden)

Natsu Nakajima

2014-01-01

Full Text Available We tackle the problem of completing and inferring genetic networks under stationary conditions from static data, where network completion is to make the minimum amount of modifications to an initial network so that the completed network is most consistent with the expression data in which addition of edges and deletion of edges are basic modification operations. For this problem, we present a new method for network completion using dynamic programming and least-squares fitting. This method can find an optimal solution in polynomial time if the maximum indegree of the network is bounded by a constant. We evaluate the effectiveness of our method through computational experiments using synthetic data. Furthermore, we demonstrate that our proposed method can distinguish the differences between two types of genetic networks under stationary conditions from lung cancer and normal gene expression data.

Diagnosing Anomalous Network Performance with Confidence

Energy Technology Data Exchange (ETDEWEB)

Settlemyer, Bradley W [ORNL; Hodson, Stephen W [ORNL; Kuehn, Jeffery A [ORNL; Poole, Stephen W [ORNL

2011-04-01

Variability in network performance is a major obstacle in effectively analyzing the throughput of modern high performance computer systems. High performance interconnec- tion networks offer excellent best-case network latencies; how- ever, highly parallel applications running on parallel machines typically require consistently high levels of performance to adequately leverage the massive amounts of available computing power. Performance analysts have usually quantified network performance using traditional summary statistics that assume the observational data is sampled from a normal distribution. In our examinations of network performance, we have found this method of analysis often provides too little data to under- stand anomalous network performance. Our tool, Confidence, instead uses an empirically derived probability distribution to characterize network performance. In this paper we describe several instances where the Confidence toolkit allowed us to understand and diagnose network performance anomalies that we could not adequately explore with the simple summary statis- tics provided by traditional measurement tools. In particular, we examine a multi-modal performance scenario encountered with an Infiniband interconnection network and we explore the performance repeatability on the custom Cray SeaStar2 interconnection network after a set of software and driver updates.

Calcium K-line network in coronal holes

Energy Technology Data Exchange (ETDEWEB)

Marsh, K A [Hale Observatories, Pasadena, Calif. (USA)

1977-05-01

Microphotometry of calcium K-line photographs in the regions of polar coronal holes shows that the chromospheric network exterior to a hole has a slightly broader intensity distribution than that inside the hole itself, a fact which can be attributed to a greater number of bright network elements outside the hole. These bright elements presumably represent the enhanced network resulting from the dispersal of magnetic flux from old active regions, a hypothesis which is consistent with current ideas of coronal hole formation.

Constructing level-2 phylogenetic networks from triplets

OpenAIRE

Iersel, Leo; Keijsper, J.C.M.; Kelk, Steven; Stougie, Leen; Hagen, F.; Boekhout, T.; Vingron, M.; Wong, L.

2009-01-01

htmlabstractJansson and Sung showed that, given a dense set of input triplets T (representing hypotheses about the local evolutionary relationships of triplets of taxa), it is possible to determine in polynomial time whether there exists a level-1 network consistent with T, and if so to construct such a network (Inferring a Level-1 Phylogenetic Network from a Dense Set of Rooted Triplets, Theoretical Computer Science, 363, pp. 60-68 (2006)). Here we extend this work by showing that this probl...

Mobile network architecture of the long-range WindScanner system

DEFF Research Database (Denmark)

Vasiljevic, Nikola; Lea, Guillaume; Hansen, Per

to the acquisition of the mobile network connections with static public IP addresses. The architecture consists of a hardware VPN solution based on the network appliances Z1 and MX60 from Cisco Meraki with additional 3G or 4G dongles. With the presented network architecture and appropriate configuration, we fulfill...

A complex network based model for detecting isolated communities in water distribution networks

Science.gov (United States)

Sheng, Nan; Jia, Youwei; Xu, Zhao; Ho, Siu-Lau; Wai Kan, Chi

2013-12-01

Water distribution network (WDN) is a typical real-world complex network of major infrastructure that plays an important role in human's daily life. In this paper, we explore the formation of isolated communities in WDN based on complex network theory. A graph-algebraic model is proposed to effectively detect the potential communities due to pipeline failures. This model can properly illustrate the connectivity and evolution of WDN during different stages of contingency events, and identify the emerging isolated communities through spectral analysis on Laplacian matrix. A case study on a practical urban WDN in China is conducted, and the consistency between the simulation results and the historical data are reported to showcase the feasibility and effectiveness of the proposed model.

Analysis and Reduction of Complex Networks Under Uncertainty.

Energy Technology Data Exchange (ETDEWEB)

Ghanem, Roger G [University of Southern California

2014-07-31

This effort was a collaboration with Youssef Marzouk of MIT, Omar Knio of Duke University (at the time at Johns Hopkins University) and Habib Najm of Sandia National Laboratories. The objective of this effort was to develop the mathematical and algorithmic capacity to analyze complex networks under uncertainty. Of interest were chemical reaction networks and smart grid networks. The statements of work for USC focused on the development of stochastic reduced models for uncertain networks. The USC team was led by Professor Roger Ghanem and consisted of one graduate student and a postdoc. The contributions completed by the USC team consisted of 1) methodology and algorithms to address the eigenvalue problem, a problem of significance in the stability of networks under stochastic perturbations, 2) methodology and algorithms to characterize probability measures on graph structures with random flows. This is an important problem in characterizing random demand (encountered in smart grid) and random degradation (encountered in infrastructure systems), as well as modeling errors in Markov Chains (with ubiquitous relevance !). 3) methodology and algorithms for treating inequalities in uncertain systems. This is an important problem in the context of models for material failure and network flows under uncertainty where conditions of failure or flow are described in the form of inequalities between the state variables.

Mutational robustness of gene regulatory networks.

Directory of Open Access Journals (Sweden)

Aalt D J van Dijk

Full Text Available Mutational robustness of gene regulatory networks refers to their ability to generate constant biological output upon mutations that change network structure. Such networks contain regulatory interactions (transcription factor-target gene interactions but often also protein-protein interactions between transcription factors. Using computational modeling, we study factors that influence robustness and we infer several network properties governing it. These include the type of mutation, i.e. whether a regulatory interaction or a protein-protein interaction is mutated, and in the case of mutation of a regulatory interaction, the sign of the interaction (activating vs. repressive. In addition, we analyze the effect of combinations of mutations and we compare networks containing monomeric with those containing dimeric transcription factors. Our results are consistent with available data on biological networks, for example based on evolutionary conservation of network features. As a novel and remarkable property, we predict that networks are more robust against mutations in monomer than in dimer transcription factors, a prediction for which analysis of conservation of DNA binding residues in monomeric vs. dimeric transcription factors provides indirect evidence.

Activity-Driven Influence Maximization in Social Networks

DEFF Research Database (Denmark)

Kumar, Rohit; Saleem, Muhammad Aamir; Calders, Toon

2017-01-01

-driven approach based on the identification of influence propagation patterns. In the first work, we identify so-called information-channels to model potential pathways for information spread, while the second work exploits how users in a location-based social network check in to locations in order to identify...... influential locations. To make our algorithms scalable, approximate versions based on sketching techniques from the data streams domain have been developed. Experiments show that in this way it is possible to efficiently find good seed sets for influence propagation in social networks.......Interaction networks consist of a static graph with a timestamped list of edges over which interaction took place. Examples of interaction networks are social networks whose users interact with each other through messages or location-based social networks where people interact by checking...

The Deep Structure of Organizational Online Networking

DEFF Research Database (Denmark)

Trier, Matthias; Richter, Alexander

2015-01-01

While research on organizational online networking recently increased significantly, most studies adopt quantitative research designs with a focus on the consequences of social network configurations. Very limited attention is paid to comprehensive theoretical conceptions of the complex phenomenon...... of organizational online networking. We address this gap by adopting a theoretical framework of the deep structure of organizational online networking with a focus on their emerging meaning for the employees. We apply and assess the framework in a qualitative case study of a large-scale implementation...... of a corporate social network site (SNS) in a global organization. We reveal organizational online networking as a multi-dimensional phenomenon with multiplex relationships that are unbalanced, primarily consist of weak ties and are subject to temporal change. Further, we identify discourse drivers...

Detection of generalized synchronization using echo state networks

Science.gov (United States)

Ibáñez-Soria, D.; Garcia-Ojalvo, J.; Soria-Frisch, A.; Ruffini, G.

2018-03-01

Generalized synchronization between coupled dynamical systems is a phenomenon of relevance in applications that range from secure communications to physiological modelling. Here, we test the capabilities of reservoir computing and, in particular, echo state networks for the detection of generalized synchronization. A nonlinear dynamical system consisting of two coupled Rössler chaotic attractors is used to generate temporal series consisting of time-locked generalized synchronized sequences interleaved with unsynchronized ones. Correctly tuned, echo state networks are able to efficiently discriminate between unsynchronized and synchronized sequences even in the presence of relatively high levels of noise. Compared to other state-of-the-art techniques of synchronization detection, the online capabilities of the proposed Echo State Network based methodology make it a promising choice for real-time applications aiming to monitor dynamical synchronization changes in continuous signals.

Medical image segmentation by means of constraint satisfaction neural network

International Nuclear Information System (INIS)

Chen, C.T.; Tsao, C.K.; Lin, W.C.

1990-01-01

This paper applies the concept of constraint satisfaction neural network (CSNN) to the problem of medical image segmentation. Constraint satisfaction (or constraint propagation), the procedure to achieve global consistency through local computation, is an important paradigm in artificial intelligence. CSNN can be viewed as a three-dimensional neural network, with the two-dimensional image matrix as its base, augmented by various constraint labels for each pixel. These constraint labels can be interpreted as the connections and the topology of the neural network. Through parallel and iterative processes, the CSNN will approach a solution that satisfies the given constraints thus providing segmented regions with global consistency

Energy efficiency networks; Energieeffizienz-Netzwerke

Energy Technology Data Exchange (ETDEWEB)

Gruber, Anna [Forschungsgesellschaft fuer Energiewirtschaft mbH (FfE GmbH), Muenchen (Germany)

2011-07-01

Energy efficiency networks are an attractive method to increase the energy efficiency and to reduce the costs and CO{sub 2} emissions of the companies operating in this network. A special feature of the energy efficiency networks is the exchange of experiences and training of the energy managers. Energy efficiency networks consist of about ten to fifteen locally domiciled companies. During the project period of three to four years, there are two main phases. In the first phase, the initial consultation phase, the actual state of a company is captured, and measures to increase the efficiency and energy conservation are identified. Parallel to this, in the second phase every three months a meeting with the participating companies takes place. Experience exchange and implementation of energy efficiency measures are the focus of these meetings. Initial studies show that the increase of the energy efficiency during participating in the energy efficiency network almost can be doubled in comparison to the average of the industry.

Potential theory for directed networks.

Directory of Open Access Journals (Sweden)

Qian-Ming Zhang

Full Text Available Uncovering factors underlying the network formation is a long-standing challenge for data mining and network analysis. In particular, the microscopic organizing principles of directed networks are less understood than those of undirected networks. This article proposes a hypothesis named potential theory, which assumes that every directed link corresponds to a decrease of a unit potential and subgraphs with definable potential values for all nodes are preferred. Combining the potential theory with the clustering and homophily mechanisms, it is deduced that the Bi-fan structure consisting of 4 nodes and 4 directed links is the most favored local structure in directed networks. Our hypothesis receives strongly positive supports from extensive experiments on 15 directed networks drawn from disparate fields, as indicated by the most accurate and robust performance of Bi-fan predictor within the link prediction framework. In summary, our main contribution is twofold: (i We propose a new mechanism for the local organization of directed networks; (ii We design the corresponding link prediction algorithm, which can not only testify our hypothesis, but also find out direct applications in missing link prediction and friendship recommendation.

Potential Theory for Directed Networks

Science.gov (United States)

Zhang, Qian-Ming; Lü, Linyuan; Wang, Wen-Qiang; Zhou, Tao

2013-01-01

Uncovering factors underlying the network formation is a long-standing challenge for data mining and network analysis. In particular, the microscopic organizing principles of directed networks are less understood than those of undirected networks. This article proposes a hypothesis named potential theory, which assumes that every directed link corresponds to a decrease of a unit potential and subgraphs with definable potential values for all nodes are preferred. Combining the potential theory with the clustering and homophily mechanisms, it is deduced that the Bi-fan structure consisting of 4 nodes and 4 directed links is the most favored local structure in directed networks. Our hypothesis receives strongly positive supports from extensive experiments on 15 directed networks drawn from disparate fields, as indicated by the most accurate and robust performance of Bi-fan predictor within the link prediction framework. In summary, our main contribution is twofold: (i) We propose a new mechanism for the local organization of directed networks; (ii) We design the corresponding link prediction algorithm, which can not only testify our hypothesis, but also find out direct applications in missing link prediction and friendship recommendation. PMID:23408979

Frontal parietal control network regulates the anti-correlated default and dorsal attention networks.

Science.gov (United States)

Gao, Wei; Lin, Weili

2012-01-01

Recent reports demonstrate the anti-correlated behaviors between the default (DF) and the dorsal attention (DA) networks. We aimed to investigate the roles of the frontal parietal control (FPC) network in regulating the two anti-correlated networks through three experimental conditions, including resting, continuous self-paced/attended sequential finger tapping (FT), and natural movie watching (MW), respectively. The two goal-directed tasks were chosen to engage either one of the two competing networks-FT for DA whereas MW for default. We hypothesized that FPC will selectively augment/suppress either network depending on how the task targets the specific network; FPC will positively correlate with the target network, but negatively correlate with the network anti-correlated with the target network. We further hypothesized that significant causal links from FPC to both DA and DF are present during all three experimental conditions, supporting the initiative regulating role of FPC over the two opposing systems. Consistent with our hypotheses, FPC exhibited a significantly higher positive correlation with DA (P = 0.0095) whereas significantly more negative correlation with default (P = 0.0025) during FT when compared to resting. Completely opposite to that observed during FT, the FPC was significantly anti-correlated with DA (P = 2.1e-6) whereas positively correlated with default (P = 0.0035) during MW. Furthermore, extensive causal links from FPC to both DA and DF were observed across all three experimental states. Together, our results strongly support the notion that the FPC regulates the anti-correlated default and DA networks. Copyright © 2011 Wiley Periodicals, Inc.

Structure and growth of weighted networks

Energy Technology Data Exchange (ETDEWEB)

Riccaboni, Massimo [Department of Computer and Management Sciences, University of Trento, Trento (Italy); Schiavo, Stefano [Department of Economics, University of Trento, Trento (Italy)], E-mail: massimo.riccaboni@unitn.it, E-mail: stefano.schiavo@unitn.it

2010-02-15

We develop a simple theoretical framework for the evolution of weighted networks that is consistent with a number of stylized features of real-world data. In our framework, the Barabasi-Albert model of network evolution is extended by assuming that link weights evolve according to a geometric Brownian motion. Our model is verified by means of simulations and real-world trade data. We show that the model correctly predicts the intensity and growth distribution of links, the size-variance relationship of the growth of link weights, the relationship between the degree and strength of nodes, and the scale-free structure of the network.

Tool wear modeling using abductive networks

Science.gov (United States)

Masory, Oren

1992-09-01

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

Neural network tagging in a toy model

International Nuclear Information System (INIS)

Milek, Marko; Patel, Popat

1999-01-01

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

Virtual Stationary Automata for Mobile Networks

National Research Council Canada - National Science Library

Dolev, Shlomi; Gilbert, Seth; Lahiani, Limor; Lynch, Nancy; Nolte, Tina

2005-01-01

We define a programming abstraction for mobile networks called the Virtual Stationary Automata programming layer, consisting of real mobile clients, virtual timed I/O automata called virtual stationary automata (VSAs...

Event localization in underwater wireless sensor networks using Monitoring Courses

KAUST Repository

Debont, Matthew John Robert; Jamshaid, Kamran; Shihada, Basem; Ho, Pin-Han

2012-01-01

We propose m-courses (Monitoring Courses), a novel solution to localize events in an underwater wireless sensor network. These networks consists of surface gateways and relay nodes. GPS can localize the position of surface gateways which can

Relay Precoder Optimization in MIMO-Relay Networks With Imperfect CSI

KAUST Repository

Pandarakkottilil, Ubaidulla; Chockalingam, A.

2011-01-01

In this paper, we consider robust joint designs of relay precoder and destination receive filters in a nonregenerative multiple-input multiple-output (MIMO) relay network. The network consists of multiple source-destination node pairs assisted by a

Network analysis reveals multiscale controls on streamwater chemistry

Science.gov (United States)

Kevin J. McGuire; Christian E. Torgersen; Gene E. Likens; Donald C. Buso; Winsor H. Lowe; Scott W. Bailey

2014-01-01

By coupling synoptic data from a basin-wide assessment of streamwater chemistry with network-based geostatistical analysis, we show that spatial processes differentially affect biogeochemical condition and pattern across a headwater stream network. We analyzed a high-resolution dataset consisting of 664 water samples collected every 100 m throughout 32 tributaries in...

The Functional Segregation and Integration Model: Mixture Model Representations of Consistent and Variable Group-Level Connectivity in fMRI

DEFF Research Database (Denmark)

Churchill, Nathan William; Madsen, Kristoffer Hougaard; Mørup, Morten

2016-01-01

flexibility: they only estimate segregated structure and do not model interregional functional connectivity, nor do they account for network variability across voxels or between subjects. To address these issues, this letter develops the functional segregation and integration model (FSIM). This extension......The brain consists of specialized cortical regions that exchange information between each other, reflecting a combination of segregated (local) and integrated (distributed) processes that define brain function. Functional magnetic resonance imaging (fMRI) is widely used to characterize...... brain regions where network expression predicts subject age in the experimental data. Thus, the FSIM is effective at summarizing functional connectivity structure in group-level fMRI, with applications in modeling the relationships between network variability and behavioral/demographic variables....

Connecting Mobile Users Through Mobile Social Networks

Directory of Open Access Journals (Sweden)

Faisal Alkhateeb

2012-10-01

Full Text Available Nowadays, social networks become popular with the emerging of web-based social networking services. Recently, several mobile services are developed to connect users to their favourite social networks such as Facebook, Twitter, Flickr, etc. However, these services depends upon the existing web-based social networks. In this paper, we present a mobile service for joining groups across communities. The originality of the work is that the framework of the service allows creating and joining social networks that are self-contained for mobile company servers. The service consists of several sub-services such as users invitation, group finding and others. Users, regardless of their disability, can use the service and its sub-services without the need to create their own accounts on social web sites and thus their own groups. We also propose a privacy control policy for mobile social networks.

Two statistical mechanics aspects of complex networks

Science.gov (United States)

Thurner, Stefan; Biely, Christoly

2006-12-01

By adopting an ensemble interpretation of non-growing rewiring networks, network theory can be reduced to a counting problem of possible network states and an identification of their associated probabilities. We present two scenarios of how different rewirement schemes can be used to control the state probabilities of the system. In particular, we review how by generalizing the linking rules of random graphs, in combination with superstatistics and quantum mechanical concepts, one can establish an exact relation between the degree distribution of any given network and the nodes’ linking probability distributions. In a second approach, we control state probabilities by a network Hamiltonian, whose characteristics are motivated by biological and socio-economical statistical systems. We demonstrate that a thermodynamics of networks becomes a fully consistent concept, allowing to study e.g. ‘phase transitions’ and computing entropies through thermodynamic relations.

5th Workshop on Complex Networks

CERN Document Server

Menezes, Ronaldo; Omicini, Andrea; Poncela-Casasnovas, Julia

2014-01-01

A network is a mathematical object consisting of a set of points that are connected to each other in some fashion by lines. It turns out this simple description corresponds to a bewildering array of systems in the real world, ranging from technological ones such as the Internet and World Wide Web, biological networks such as that of connections of the nervous systems, food webs, or  protein interactions, infrastructural systems such as networks of roads, airports or the power-grid, to patterns of social and professional relationships such as friendship, sex partners, network of Hollywood actors, co-authorship networks and many more. Recent years have witnessed a substantial amount of interest within the scientific community in the properties of these networks. The emergence of the internet in particular, coupled with the widespread availability of inexpensive computing resources has facilitated studies ranging from large scale empirical analysis of networks in the real world, to the development...

Novel recurrent neural network for modelling biological networks: oscillatory p53 interaction dynamics.

Science.gov (United States)

Ling, Hong; Samarasinghe, Sandhya; Kulasiri, Don

2013-12-01

Understanding the control of cellular networks consisting of gene and protein interactions and their emergent properties is a central activity of Systems Biology research. For this, continuous, discrete, hybrid, and stochastic methods have been proposed. Currently, the most common approach to modelling accurate temporal dynamics of networks is ordinary differential equations (ODE). However, critical limitations of ODE models are difficulty in kinetic parameter estimation and numerical solution of a large number of equations, making them more suited to smaller systems. In this article, we introduce a novel recurrent artificial neural network (RNN) that addresses above limitations and produces a continuous model that easily estimates parameters from data, can handle a large number of molecular interactions and quantifies temporal dynamics and emergent systems properties. This RNN is based on a system of ODEs representing molecular interactions in a signalling network. Each neuron represents concentration change of one molecule represented by an ODE. Weights of the RNN correspond to kinetic parameters in the system and can be adjusted incrementally during network training. The method is applied to the p53-Mdm2 oscillation system - a crucial component of the DNA damage response pathways activated by a damage signal. Simulation results indicate that the proposed RNN can successfully represent the behaviour of the p53-Mdm2 oscillation system and solve the parameter estimation problem with high accuracy. Furthermore, we presented a modified form of the RNN that estimates parameters and captures systems dynamics from sparse data collected over relatively large time steps. We also investigate the robustness of the p53-Mdm2 system using the trained RNN under various levels of parameter perturbation to gain a greater understanding of the control of the p53-Mdm2 system. Its outcomes on robustness are consistent with the current biological knowledge of this system. As more

Information theory perspective on network robustness

International Nuclear Information System (INIS)

Schieber, Tiago A.; Carpi, Laura; Frery, Alejandro C.; Rosso, Osvaldo A.; Pardalos, Panos M.; Ravetti, Martín G.

2016-01-01

A crucial challenge in network theory is the study of the robustness of a network when facing a sequence of failures. In this work, we propose a dynamical definition of network robustness based on Information Theory, that considers measurements of the structural changes caused by failures of the network's components. Failures are defined here as a temporal process defined in a sequence. Robustness is then evaluated by measuring dissimilarities between topologies after each time step of the sequence, providing a dynamical information about the topological damage. We thoroughly analyze the efficiency of the method in capturing small perturbations by considering different probability distributions on networks. In particular, we find that distributions based on distances are more consistent in capturing network structural deviations, as better reflect the consequences of the failures. Theoretical examples and real networks are used to study the performance of this methodology. - Highlights: • A novel methodology to measure the robustness of a network to component failure or targeted attacks is proposed. • The use of the network's distance PDF allows a precise analysis. • The method provides a dynamic robustness profile showing the response of the topology to each failure event. • The measure is capable to detect network's critical elements.

Evaluation of a Cyber Security System for Hospital Network.

Science.gov (United States)

Faysel, Mohammad A

2015-01-01

Most of the cyber security systems use simulated data in evaluating their detection capabilities. The proposed cyber security system utilizes real hospital network connections. It uses a probabilistic data mining algorithm to detect anomalous events and takes appropriate response in real-time. On an evaluation using real-world hospital network data consisting of incoming network connections collected for a 24-hour period, the proposed system detected 15 unusual connections which were undetected by a commercial intrusion prevention system for the same network connections. Evaluation of the proposed system shows a potential to secure protected patient health information on a hospital network.

Context-free parsing with connectionist networks

Science.gov (United States)

Fanty, M. A.

1986-08-01

This paper presents a simple algorithm which converts any context-free grammar into a connectionist network which parses strings (of arbitrary but fixed maximum length) in the language defined by that grammar. The network is fast, O(n), and deterministicd. It consists of binary units which compute a simple function of their input. When the grammar is put in Chomsky normal form, O(n3) units needed to parse inputs of length up to n.

An energy-efficient data gathering protocol in large wireless sensor network

Science.gov (United States)

Wang, Yamin; Zhang, Ruihua; Tao, Shizhong

2006-11-01

Wireless sensor network consisting of a large number of small sensors with low-power transceiver can be an effective tool for gathering data in a variety of environment. The collected data must be transmitted to the base station for further processing. Since a network consists of sensors with limited battery energy, the method for data gathering and routing must be energy efficient in order to prolong the lifetime of the network. In this paper, we presented an energy-efficient data gathering protocol in wireless sensor network. The new protocol used data fusion technology clusters nodes into groups and builds a chain among the cluster heads according to a hybrid of the residual energy and distance to the base station. Results in stochastic geometry are used to derive the optimum parameter of our algorithm that minimizes the total energy spent in the network. Simulation results show performance superiority of the new protocol.

[Health care networks].

Science.gov (United States)

Mendes, Eugênio Vilaça

2010-08-01

The demographic and epidemiologic transition resulting from aging and the increase of life expectation means an increment related to chronic conditions. The healthcare systems contemporary crisis is characterized by the organization of the focus on fragmented systems turned to the acute conditions care, in spite of the chronic conditions prevalence, and by the hierarchical structure without communication flow among the different health care levels. Brazil health care situation profile is now presenting a triple burden of diseases, due to the concomitant presence of infectious diseases, external causes and chronic diseases. The solution is to restore the consistence between the triple burden of diseases on the health situation and the current system of healthcare practice, with the implantation of health care networks. The conclusion is that there are evidences in the international literature on health care networks that these networks may improve the clinical quality, the sanitation results and the user's satisfaction and the reduction of healthcare systems costs.

Network topology and interbank credit risk

International Nuclear Information System (INIS)

González-Avella, Juan Carlos; Hoffmann de Quadros, Vanessa; Iglesias, José Roberto

2016-01-01

Modern financial systems are greatly entangled. They exhibit a complex interdependence, including a network of bilateral exposures in the interbank market. The most frequent interaction consists in operations where institutions with surplus liquidity lend to those with a liquidity shortage. These loans may be interpreted as links between the banks and the links display features in some way representative of scale-free networks. While the interbank market is responsible for efficient liquidity allocation, it also introduces the possibility for systemic risk via financial contagion. Insolvency of one bank can propagate through links leading to insolvency of other banks. In this paper, we explore the characteristics of financial contagion in interbank networks whose distribution of links approaches a power law, as well as we improve previous models by introducing a simple mechanism to describe banks’ balance sheets, that are obtained from information on network connectivity. By varying the parameters for the creation of the network, several interbank networks are built, in which the concentration of debt and credit comes from the distribution of links. The results suggest that more connected networks that have a high concentration of credit are more resilient to contagion than other types of networks analyzed.

Interpolative Boolean Networks

Directory of Open Access Journals (Sweden)

Vladimir Dobrić

2017-01-01

Full Text Available Boolean networks are used for modeling and analysis of complex systems of interacting entities. Classical Boolean networks are binary and they are relevant for modeling systems with complex switch-like causal interactions. More descriptive power can be provided by the introduction of gradation in this model. If this is accomplished by using conventional fuzzy logics, the generalized model cannot secure the Boolean frame. Consequently, the validity of the model’s dynamics is not secured. The aim of this paper is to present the Boolean consistent generalization of Boolean networks, interpolative Boolean networks. The generalization is based on interpolative Boolean algebra, the [0,1]-valued realization of Boolean algebra. The proposed model is adaptive with respect to the nature of input variables and it offers greater descriptive power as compared with traditional models. For illustrative purposes, IBN is compared to the models based on existing real-valued approaches. Due to the complexity of the most systems to be analyzed and the characteristics of interpolative Boolean algebra, the software support is developed to provide graphical and numerical tools for complex system modeling and analysis.

SOUNET: Self-Organized Underwater Wireless Sensor Network

Directory of Open Access Journals (Sweden)

Hee-won Kim

2017-02-01

Full Text Available In this paper, we propose an underwater wireless sensor network (UWSN named SOUNET where sensor nodes form and maintain a tree-topological network for data gathering in a self-organized manner. After network topology discovery via packet flooding, the sensor nodes consistently update their parent node to ensure the best connectivity by referring to the timevarying neighbor tables. Such a persistent and self-adaptive method leads to high network connectivity without any centralized control, even when sensor nodes are added or unexpectedly lost. Furthermore, malfunctions that frequently happen in self-organized networks such as node isolation and closed loop are resolved in a simple way. Simulation results show that SOUNET outperforms other conventional schemes in terms of network connectivity, packet delivery ratio (PDR, and energy consumption throughout the network. In addition, we performed an experiment at the Gyeongcheon Lake in Korea using commercial underwater modems to verify that SOUNET works well in a real environment.

SOUNET: Self-Organized Underwater Wireless Sensor Network.

Science.gov (United States)

Kim, Hee-Won; Cho, Ho-Shin

2017-02-02

In this paper, we propose an underwater wireless sensor network (UWSN) named SOUNET where sensor nodes form and maintain a tree-topological network for data gathering in a self-organized manner. After network topology discovery via packet flooding, the sensor nodes consistently update their parent node to ensure the best connectivity by referring to the timevarying neighbor tables. Such a persistent and self-adaptive method leads to high network connectivity without any centralized control, even when sensor nodes are added or unexpectedly lost. Furthermore, malfunctions that frequently happen in self-organized networks such as node isolation and closed loop are resolved in a simple way. Simulation results show that SOUNET outperforms other conventional schemes in terms of network connectivity, packet delivery ratio (PDR), and energy consumption throughout the network. In addition, we performed an experiment at the Gyeongcheon Lake in Korea using commercial underwater modems to verify that SOUNET works well in a real environment.

Modelling, Synthesis, and Configuration of Networks-on-Chips

DEFF Research Database (Denmark)

Stuart, Matthias Bo

This thesis presents three contributions in two different areas of network-on-chip and system-on-chip research: Application modelling and identifying and solving different optimization problems related to two specific network-on-chip architectures. The contribution related to application modelling...... is an analytical method for deriving the worst-case traffic pattern caused by an application and the cache-coherence protocol in a cache-coherent shared-memory system. The contributions related to network-on-chip optimization problems consist of two parts: The development and evaluation of six heuristics...... for solving the network synthesis problem in the MANGO network-on-chip, and the identification and formalization of the ReNoC configuration problem together with three heuristics for solving it....

Mobile network architecture of the long-range WindScanner system

OpenAIRE

Vasiljevic, Nikola; Lea, Guillaume; Hansen, Per; Jensen, Henrik M.

2016-01-01

In this report we have presented the network architecture of the long-range WindScanner system that allows utilization of mobile network connections without the use of static public IP addresses. The architecture mitigates the issues of additional fees and contractual obligations that are linked to the acquisition of the mobile network connections with static public IP addresses. The architecture consists of a hardware VPN solution based on the network appliances Z1 and MX60 from Cisco Meraki...

Nestedness of ectoparasite-vertebrate host networks.

Directory of Open Access Journals (Sweden)

Sean P Graham

2009-11-01

Full Text Available Determining the structure of ectoparasite-host networks will enable disease ecologists to better understand and predict the spread of vector-borne diseases. If these networks have consistent properties, then studying the structure of well-understood networks could lead to extrapolation of these properties to others, including those that support emerging pathogens. Borrowing a quantitative measure of network structure from studies of mutualistic relationships between plants and their pollinators, we analyzed 29 ectoparasite-vertebrate host networks--including three derived from molecular bloodmeal analysis of mosquito feeding patterns--using measures of nestedness to identify non-random interactions among species. We found significant nestedness in ectoparasite-vertebrate host lists for habitats ranging from tropical rainforests to polar environments. These networks showed non-random patterns of nesting, and did not differ significantly from published estimates of nestedness from mutualistic networks. Mutualistic and antagonistic networks appear to be organized similarly, with generalized ectoparasites interacting with hosts that attract many ectoparasites and more specialized ectoparasites usually interacting with these same "generalized" hosts. This finding has implications for understanding the network dynamics of vector-born pathogens. We suggest that nestedness (rather than random ectoparasite-host associations can allow rapid transfer of pathogens throughout a network, and expand upon such concepts as the dilution effect, bridge vectors, and host switching in the context of nested ectoparasite-vertebrate host networks.

Self-assembled interpenetrating networks by orthogonal self assembly of surfactants and hydrogelators

NARCIS (Netherlands)

Brizard, Aurelie M.; Stuart, Marc C. A.; van Esch, Jan H.

2009-01-01

Interpenetrating networks (IPN) consist of two or more networks of different components which are entangled on a molecular scale and cannot be separated without breaking at least one of the networks. They are of great technological interest because they allow the blending of two or more otherwise

Mobile telecommunication networks choice among Ghanaians

Directory of Open Access Journals (Sweden)

Boateng Henry

2013-07-01

Full Text Available The paper investigates the factors influencing customers choice of telecommunication network in Ghana. The survey design was employed to enable the researchers perform statistical analysis. Questionnaire consisting of Likert scale question was used to collect the primary data. Multiple regression analysis was performed to ascertain the factors influencing customers’ choice of telecommunication networks. The study found six factors that influence customers to choose a particular network. These factors include; brand awareness, brand image, perceived quality, price, convenience and brand loyalty. The study concludes that all the six factors contribute to the factors that drive consumer choice of telecommunications service in Ghana.

Quantum key distribution network for multiple applications

Science.gov (United States)

Tajima, A.; Kondoh, T.; Ochi, T.; Fujiwara, M.; Yoshino, K.; Iizuka, H.; Sakamoto, T.; Tomita, A.; Shimamura, E.; Asami, S.; Sasaki, M.

2017-09-01

The fundamental architecture and functions of secure key management in a quantum key distribution (QKD) network with enhanced universal interfaces for smooth key sharing between arbitrary two nodes and enabling multiple secure communication applications are proposed. The proposed architecture consists of three layers: a quantum layer, key management layer and key supply layer. We explain the functions of each layer, the key formats in each layer and the key lifecycle for enabling a practical QKD network. A quantum key distribution-advanced encryption standard (QKD-AES) hybrid system and an encrypted smartphone system were developed as secure communication applications on our QKD network. The validity and usefulness of these systems were demonstrated on the Tokyo QKD Network testbed.

Creation and perturbation of planar networks of chemical oscillators

Science.gov (United States)

Tompkins, Nathan; Cambria, Matthew Carl; Wang, Adam L.; Heymann, Michael; Fraden, Seth

2015-01-01

Methods for creating custom planar networks of diffusively coupled chemical oscillators and perturbing individual oscillators within the network are presented. The oscillators consist of the Belousov-Zhabotinsky (BZ) reaction contained in an emulsion. Networks of drops of the BZ reaction are created with either Dirichlet (constant-concentration) or Neumann (no-flux) boundary conditions in a custom planar configuration using programmable illumination for the perturbations. The differences between the observed network dynamics for each boundary condition are described. Using light, we demonstrate the ability to control the initial conditions of the network and to cause individual oscillators within the network to undergo sustained period elongation or a one-time phase delay. PMID:26117136

Toward more effective regional networks: a multi-method study on top-down stimulated networks within the Dutch public-policy areas of education and employment

NARCIS (Netherlands)

Klaster, E.

2015-01-01

Regional networks have become a popular way for the Dutch central government to translate national ambitions into regional policies and actions. This thesis focuses on regional networks in the public-policy fields of education and employment, which consist of various actors, including schools, local

Load balancing in 5G Networks

Directory of Open Access Journals (Sweden)

Tsirakis Christos

2017-01-01

Full Text Available The expected huge increase of mobile devices and user data demand by 2020 will stress the current mobile network in an unprecedented way. The future mobile networks must meet several strong requirements regarding the data rate, latency, quality of service and experience, mobility, spectrum and energy efficiency. Therefore, efforts for more efficient mobile network solutions have been recently initiated. To this direction, load balancing has attracted much attention as a promising solution for higher resource utilization, improved system performance and decreased operational cost. It is an effective method for balancing the traffic and alleviating the congestion among heterogeneous networks in the upcoming 5G networks. In this paper, we focus on an offloading scenario for load balancing among LTE and Wi-Fi networks. Additionally, network graphs methodology and its abstracted parameters are investigated in order to better manage wireless resource allocation among multiple connections. The COHERENT architectural framework, which consists of two main control components, makes use of such abstracted network graphs for controlling or managing various tasks such as traffic steering, load balancing, spectrum sharing and RAN sharing. As a result, the COHERENT project eventually develops a unified programmable control framework used to efficiently coordinate the underlying heterogeneous mobile networks as a whole.

Inferring Phylogenetic Networks Using PhyloNet.

Science.gov (United States)

Wen, Dingqiao; Yu, Yun; Zhu, Jiafan; Nakhleh, Luay

2018-07-01

PhyloNet was released in 2008 as a software package for representing and analyzing phylogenetic networks. At the time of its release, the main functionalities in PhyloNet consisted of measures for comparing network topologies and a single heuristic for reconciling gene trees with a species tree. Since then, PhyloNet has grown significantly. The software package now includes a wide array of methods for inferring phylogenetic networks from data sets of unlinked loci while accounting for both reticulation (e.g., hybridization) and incomplete lineage sorting. In particular, PhyloNet now allows for maximum parsimony, maximum likelihood, and Bayesian inference of phylogenetic networks from gene tree estimates. Furthermore, Bayesian inference directly from sequence data (sequence alignments or biallelic markers) is implemented. Maximum parsimony is based on an extension of the "minimizing deep coalescences" criterion to phylogenetic networks, whereas maximum likelihood and Bayesian inference are based on the multispecies network coalescent. All methods allow for multiple individuals per species. As computing the likelihood of a phylogenetic network is computationally hard, PhyloNet allows for evaluation and inference of networks using a pseudolikelihood measure. PhyloNet summarizes the results of the various analyzes and generates phylogenetic networks in the extended Newick format that is readily viewable by existing visualization software.

Smart Collision Avoidance and Hazard Routing Mechanism for Intelligent Transport Network

Science.gov (United States)

Singh, Gurpreet; Gupta, Pooja; Wahab, Mohd Helmy Abd

2017-08-01

The smart vehicular ad-hoc network is the network that consists of vehicles for smooth movement and better management of the vehicular connectivity across the given network. This research paper aims to propose a set of solution for the VANETs consisting of the automatic driven vehicles, also called as the autonomous car. Such vehicular networks are always prone to collision due to the natural or un-natural reasons which must be solved before the large-scale deployment of the autonomous transport systems. The newly designed intelligent transport movement control mechanism is based upon the intelligent data propagation along with the vehicle collision and traffic jam prevention schema [8], which may help the future designs of smart cities to become more robust and less error-prone. In the proposed model, the focus is on designing a new dynamic and robust hazard routing protocol for intelligent vehicular networks for improvement of the overall performance in various aspects. It is expected to improve the overall transmission delay as well as the number of collisions or adversaries across the vehicular network zone.

Optimising Transport in a Homogeneous Network

OpenAIRE

WEAIRE, DENIS LAWRENCE

2004-01-01

PUBLISHED Many situations in physics, biology, and engineering consist of the transport of some physical quantity through a network of narrow channels. The ability of a network to transport such a quantity in every direction can be described by the average conductivity associated with it. When the flow through each channel is conserved and derives from a potential function, we show that there exists an upper bound of the average conductivity and explicitly give the expression f...

Optimizing transport in a homogeneous network

OpenAIRE

WEAIRE, DENIS LAWRENCE

2004-01-01

PUBLISHED Many situations in physics, biology, and engineering consist of the transport of some physical quantity through a network of narrow channels. The ability of a network to transport such a quantity in every direction can be described by the average conductivity associated with it. When the flow through each channel is conserved and derives from a potential function, we show that there exists an upper bound of the average conductivity and explicitly give the expression f...

Network topology exploration of mesh-based coarse-grain reconfigurable architectures

NARCIS (Netherlands)

Bansal, N.; Gupta, S.; Dutt, N.D.; Nicolau, A.; Gupta, R.

2004-01-01

Several coarse-grain reconfigurable architectures proposed recently consist of a large number of processing elements (PEs) connected in a mesh-like network topology. We study the effects of three aspects of network topology exploration on the performance of applications on these architectures: (a)

Self-Organization of Microcircuits in Networks of Spiking Neurons with Plastic Synapses.

Directory of Open Access Journals (Sweden)

Gabriel Koch Ocker

2015-08-01

Full Text Available The synaptic connectivity of cortical networks features an overrepresentation of certain wiring motifs compared to simple random-network models. This structure is shaped, in part, by synaptic plasticity that promotes or suppresses connections between neurons depending on their joint spiking activity. Frequently, theoretical studies focus on how feedforward inputs drive plasticity to create this network structure. We study the complementary scenario of self-organized structure in a recurrent network, with spike timing-dependent plasticity driven by spontaneous dynamics. We develop a self-consistent theory for the evolution of network structure by combining fast spiking covariance with a slow evolution of synaptic weights. Through a finite-size expansion of network dynamics we obtain a low-dimensional set of nonlinear differential equations for the evolution of two-synapse connectivity motifs. With this theory in hand, we explore how the form of the plasticity rule drives the evolution of microcircuits in cortical networks. When potentiation and depression are in approximate balance, synaptic dynamics depend on weighted divergent, convergent, and chain motifs. For additive, Hebbian STDP these motif interactions create instabilities in synaptic dynamics that either promote or suppress the initial network structure. Our work provides a consistent theoretical framework for studying how spiking activity in recurrent networks interacts with synaptic plasticity to determine network structure.

Self-Organization of Microcircuits in Networks of Spiking Neurons with Plastic Synapses.

Science.gov (United States)

Ocker, Gabriel Koch; Litwin-Kumar, Ashok; Doiron, Brent

2015-08-01

The synaptic connectivity of cortical networks features an overrepresentation of certain wiring motifs compared to simple random-network models. This structure is shaped, in part, by synaptic plasticity that promotes or suppresses connections between neurons depending on their joint spiking activity. Frequently, theoretical studies focus on how feedforward inputs drive plasticity to create this network structure. We study the complementary scenario of self-organized structure in a recurrent network, with spike timing-dependent plasticity driven by spontaneous dynamics. We develop a self-consistent theory for the evolution of network structure by combining fast spiking covariance with a slow evolution of synaptic weights. Through a finite-size expansion of network dynamics we obtain a low-dimensional set of nonlinear differential equations for the evolution of two-synapse connectivity motifs. With this theory in hand, we explore how the form of the plasticity rule drives the evolution of microcircuits in cortical networks. When potentiation and depression are in approximate balance, synaptic dynamics depend on weighted divergent, convergent, and chain motifs. For additive, Hebbian STDP these motif interactions create instabilities in synaptic dynamics that either promote or suppress the initial network structure. Our work provides a consistent theoretical framework for studying how spiking activity in recurrent networks interacts with synaptic plasticity to determine network structure.

Clustering and visualizing similarity networks of membrane proteins.

Science.gov (United States)

Hu, Geng-Ming; Mai, Te-Lun; Chen, Chi-Ming

2015-08-01

We proposed a fast and unsupervised clustering method, minimum span clustering (MSC), for analyzing the sequence-structure-function relationship of biological networks, and demonstrated its validity in clustering the sequence/structure similarity networks (SSN) of 682 membrane protein (MP) chains. The MSC clustering of MPs based on their sequence information was found to be consistent with their tertiary structures and functions. For the largest seven clusters predicted by MSC, the consistency in chain function within the same cluster is found to be 100%. From analyzing the edge distribution of SSN for MPs, we found a characteristic threshold distance for the boundary between clusters, over which SSN of MPs could be properly clustered by an unsupervised sparsification of the network distance matrix. The clustering results of MPs from both MSC and the unsupervised sparsification methods are consistent with each other, and have high intracluster similarity and low intercluster similarity in sequence, structure, and function. Our study showed a strong sequence-structure-function relationship of MPs. We discussed evidence of convergent evolution of MPs and suggested applications in finding structural similarities and predicting biological functions of MP chains based on their sequence information. © 2015 Wiley Periodicals, Inc.

An Esprit Project: A Local Integrated Optical Network

Science.gov (United States)

Rey, J.-C.; Luvison, A.; Maaloe, J.; Toft, Fl.

1986-10-01

The paper describes a fibreoptical wideband local area network, (LION) which is being developed under the European ESPRIT (European Strategic Programme for Research and Development in Information Technology) programme. The consortium consists of Thomson-TITN, CSELT and NKT Elektronik. The network will carry both real-time voice and compressed video traffic, and it will also offer a Transport Service for packet-switched data transmission. The network is composed by a number of subnets operating on 140 Mbit/s and an interconnecting backbone network operating on 565 Mbit/s. In large organisations the total network may span more than 10 miles and it can handle more than 10,000 users. The network will have gateways to ISDN and other public services, and interfaces to host computers and other common resources.

Brain anatomical network and intelligence.

Directory of Open Access Journals (Sweden)

Yonghui Li

2009-05-01

Full Text Available Intuitively, higher intelligence might be assumed to correspond to more efficient information transfer in the brain, but no direct evidence has been reported from the perspective of brain networks. In this study, we performed extensive analyses to test the hypothesis that individual differences in intelligence are associated with brain structural organization, and in particular that higher scores on intelligence tests are related to greater global efficiency of the brain anatomical network. We constructed binary and weighted brain anatomical networks in each of 79 healthy young adults utilizing diffusion tensor tractography and calculated topological properties of the networks using a graph theoretical method. Based on their IQ test scores, all subjects were divided into general and high intelligence groups and significantly higher global efficiencies were found in the networks of the latter group. Moreover, we showed significant correlations between IQ scores and network properties across all subjects while controlling for age and gender. Specifically, higher intelligence scores corresponded to a shorter characteristic path length and a higher global efficiency of the networks, indicating a more efficient parallel information transfer in the brain. The results were consistently observed not only in the binary but also in the weighted networks, which together provide convergent evidence for our hypothesis. Our findings suggest that the efficiency of brain structural organization may be an important biological basis for intelligence.

The application of artificial neural networks to TLD dose algorithm

International Nuclear Information System (INIS)

Moscovitch, M.

1997-01-01

We review the application of feed forward neural networks to multi element thermoluminescence dosimetry (TLD) dose algorithm development. A Neural Network is an information processing method inspired by the biological nervous system. A dose algorithm based on a neural network is a fundamentally different approach from conventional algorithms, as it has the capability to learn from its own experience. The neural network algorithm is shown the expected dose values (output) associated with a given response of a multi-element dosimeter (input) many times.The algorithm, being trained that way, eventually is able to produce its own unique solution to similar (but not exactly the same) dose calculation problems. For personnel dosimetry, the output consists of the desired dose components: deep dose, shallow dose, and eye dose. The input consists of the TL data obtained from the readout of a multi-element dosimeter. For this application, a neural network architecture was developed based on the concept of functional links network (FLN). The FLN concept allowed an increase in the dimensionality of the input space and construction of a neural network without any hidden layers. This simplifies the problem and results in a relatively simple and reliable dose calculation algorithm. Overall, the neural network dose algorithm approach has been shown to significantly improve the precision and accuracy of dose calculations. (authors)

Connectivity strategies to enhance the capacity of weight-bearing networks

International Nuclear Information System (INIS)

Janaki, T.M.; Gupte, Neelima

2003-01-01

The connectivity properties of a weight-bearing network are exploited to enhance its capacity. We study a 2D network of sites where the weight-bearing capacity of a given site depends on the capacities of the sites connected to it in the layers above. The network consists of clusters, viz., a set of sites connected with each other with the largest such collection of sites being denoted as the maximal cluster. New connections are made between sites in successive layers using two distinct strategies. The key element of our strategies consists of adding as many disjoint clusters as possible to the sites on the trunk T of the maximal cluster. In the first strategy the reconnections start from the last layer upwards and stop when no new sites are added. In the second case, the reconnections start from the top layer and go all the way down to the last layer. The new networks can bear much higher weights than the original networks and have much lower failure rates. The first strategy leads to a greater enhancement of stability, whereas the second leads to a greater enhancement of capacity compared to the original networks. The original network used here is a typical example of the branching hierarchical class. However, the application of strategies similar to ours can yield useful results in other types of networks as well

Cooperative and Adaptive Network Coding for Gradient Based Routing in Wireless Sensor Networks with Multiple Sinks

Directory of Open Access Journals (Sweden)

M. E. Migabo

2017-01-01

Full Text Available Despite its low computational cost, the Gradient Based Routing (GBR broadcast of interest messages in Wireless Sensor Networks (WSNs causes significant packets duplications and unnecessary packets transmissions. This results in energy wastage, traffic load imbalance, high network traffic, and low throughput. Thanks to the emergence of fast and powerful processors, the development of efficient network coding strategies is expected to enable efficient packets aggregations and reduce packets retransmissions. For multiple sinks WSNs, the challenge consists of efficiently selecting a suitable network coding scheme. This article proposes a Cooperative and Adaptive Network Coding for GBR (CoAdNC-GBR technique which considers the network density as dynamically defined by the average number of neighbouring nodes, to efficiently aggregate interest messages. The aggregation is performed by means of linear combinations of random coefficients of a finite Galois Field of variable size GF(2S at each node and the decoding is performed by means of Gaussian elimination. The obtained results reveal that, by exploiting the cooperation of the multiple sinks, the CoAdNC-GBR not only improves the transmission reliability of links and lowers the number of transmissions and the propagation latency, but also enhances the energy efficiency of the network when compared to the GBR-network coding (GBR-NC techniques.

A Neural Network Based Dutch Part of Speech Tagger

NARCIS (Netherlands)

Boschman, E.; op den Akker, Hendrikus J.A.; Nijholt, A.; Nijholt, Antinus; Pantic, Maja; Pantic, M.; Poel, M.; Poel, Mannes; Hondorp, G.H.W.

2008-01-01

In this paper a Neural Network is designed for Part-of-Speech Tagging of Dutch text. Our approach uses the Corpus Gesproken Nederlands (CGN) consisting of almost 9 million transcribed words of spoken Dutch, divided into 15 different categories. The outcome of the design is a Neural Network with an

Modular architectures for quantum networks

Science.gov (United States)

Pirker, A.; Wallnöfer, J.; Dür, W.

2018-05-01

We consider the problem of generating multipartite entangled states in a quantum network upon request. We follow a top-down approach, where the required entanglement is initially present in the network in form of network states shared between network devices, and then manipulated in such a way that the desired target state is generated. This minimizes generation times, and allows for network structures that are in principle independent of physical links. We present a modular and flexible architecture, where a multi-layer network consists of devices of varying complexity, including quantum network routers, switches and clients, that share certain resource states. We concentrate on the generation of graph states among clients, which are resources for numerous distributed quantum tasks. We assume minimal functionality for clients, i.e. they do not participate in the complex and distributed generation process of the target state. We present architectures based on shared multipartite entangled Greenberger–Horne–Zeilinger states of different size, and fully connected decorated graph states, respectively. We compare the features of these architectures to an approach that is based on bipartite entanglement, and identify advantages of the multipartite approach in terms of memory requirements and complexity of state manipulation. The architectures can handle parallel requests, and are designed in such a way that the network state can be dynamically extended if new clients or devices join the network. For generation or dynamical extension of the network states, we propose a quantum network configuration protocol, where entanglement purification is used to establish high fidelity states. The latter also allows one to show that the entanglement generated among clients is private, i.e. the network is secure.

Hardness prediction of HAZ in temper bead welding by non-consistent layer technique

International Nuclear Information System (INIS)

Yu, Lina; Saida, Kazuyoshi; Mochizuki, Masahito; Kameyama, Masashi; Chigusa, Naoki; Nishimoto, Kazutoshi

2014-01-01

Based on the experimentally obtained hardness database, the neural network-based hardness prediction system of heat affect zone (HAZ) in temper bead welding by Consistent Layer (CSL) technique has been constructed by the authors. However in practical operation, CSL technique is sometimes difficult to perform because of difficulty of the precise heat input controlling, and in such case non-CSL techniques are mainly used in the actual repair process. Therefore in the present study, the neural network-based hardness prediction system of HAZ in temper bead welding by non-CSL techniques has been constructed through thermal cycle simplification, from the view of engineering. The hardness distribution in HAZ with non-CSL techniques was calculated based on the thermal cycles numerically obtained by finite element method. The experimental result has shown that the predicted hardness is in good accordance with the measured ones. It follows that the currently proposed method is effective for estimating the tempering effect during temper bead welding by non-CSL techniques. (author)

Consistent model driven architecture

Science.gov (United States)

Niepostyn, Stanisław J.

2015-09-01

The goal of the MDA is to produce software systems from abstract models in a way where human interaction is restricted to a minimum. These abstract models are based on the UML language. However, the semantics of UML models is defined in a natural language. Subsequently the verification of consistency of these diagrams is needed in order to identify errors in requirements at the early stage of the development process. The verification of consistency is difficult due to a semi-formal nature of UML diagrams. We propose automatic verification of consistency of the series of UML diagrams originating from abstract models implemented with our consistency rules. This Consistent Model Driven Architecture approach enables us to generate automatically complete workflow applications from consistent and complete models developed from abstract models (e.g. Business Context Diagram). Therefore, our method can be used to check practicability (feasibility) of software architecture models.

Major technological innovations introduced in the large antennas of the Deep Space Network

Science.gov (United States)

Imbriale, W. A.

2002-01-01

The NASA Deep Space Network (DSN) is the largest and most sensitive scientific, telecommunications and radio navigation network in the world. Its principal responsibilities are to provide communications, tracking, and science services to most of the world's spacecraft that travel beyond low Earth orbit. The network consists of three Deep Space Communications Complexes. Each of the three complexes consists of multiple large antennas equipped with ultra sensitive receiving systems. A centralized Signal Processing Center (SPC) remotely controls the antennas, generates and transmits spacecraft commands, and receives and processes the spacecraft telemetry.

Inclusion of tank configurations as a variable in the cost optimization of branched piped-water networks

Science.gov (United States)

Hooda, Nikhil; Damani, Om

2017-06-01

The classic problem of the capital cost optimization of branched piped networks consists of choosing pipe diameters for each pipe in the network from a discrete set of commercially available pipe diameters. Each pipe in the network can consist of multiple segments of differing diameters. Water networks also consist of intermediate tanks that act as buffers between incoming flow from the primary source and the outgoing flow to the demand nodes. The network from the primary source to the tanks is called the primary network, and the network from the tanks to the demand nodes is called the secondary network. During the design stage, the primary and secondary networks are optimized separately, with the tanks acting as demand nodes for the primary network. Typically the choice of tank locations, their elevations, and the set of demand nodes to be served by different tanks is manually made in an ad hoc fashion before any optimization is done. It is desirable therefore to include this tank configuration choice in the cost optimization process itself. In this work, we explain why the choice of tank configuration is important to the design of a network and describe an integer linear program model that integrates the tank configuration to the standard pipe diameter selection problem. In order to aid the designers of piped-water networks, the improved cost optimization formulation is incorporated into our existing network design system called JalTantra.

Contagion processes on the static and activity driven coupling networks

OpenAIRE

Lei, Yanjun; Jiang, Xin; Guo, Quantong; Ma, Yifang; Li, Meng; Zheng, Zhiming

2015-01-01

The evolution of network structure and the spreading of epidemic are common coexistent dynamical processes. In most cases, network structure is treated either static or time-varying, supposing the whole network is observed in a same time window. In this paper, we consider the epidemic spreading on a network consisting of both static and time-varying structures. At meanwhile, the time-varying part and the epidemic spreading are supposed to be of the same time scale. We introduce a static and a...

Geodetic Networks, This is udated by the use of GPS and updated weekely. It consist of interstate highways, state highways, major roads and local roads as well as private streets with address range, speed limit and elevation data associated to each segement., Published in 2007, Johnson County Government.

Data.gov (United States)

NSGIC Local Govt | GIS Inventory — Geodetic Networks dataset current as of 2007. This is udated by the use of GPS and updated weekely. It consist of interstate highways, state highways, major roads...

Using network screening methods to determine locations with specific safety issues: A design consistency case study.

Science.gov (United States)

Butsick, Andrew J; Wood, Jonathan S; Jovanis, Paul P

2017-09-01

The Highway Safety Manual provides multiple methods that can be used to identify sites with promise (SWiPs) for safety improvement. However, most of these methods cannot be used to identify sites with specific problems. Furthermore, given that infrastructure funding is often specified for use related to specific problems/programs, a method for identifying SWiPs related to those programs would be very useful. This research establishes a method for Identifying SWiPs with specific issues. This is accomplished using two safety performance functions (SPFs). This method is applied to identifying SWiPs with geometric design consistency issues. Mixed effects negative binomial regression was used to develop two SPFs using 5 years of crash data and over 8754km of two-lane rural roadway. The first SPF contained typical roadway elements while the second contained additional geometric design consistency parameters. After empirical Bayes adjustments, sites with promise (SWiPs) were identified. The disparity between SWiPs identified by the two SPFs was evident; 40 unique sites were identified by each model out of the top 220 segments. By comparing sites across the two models, candidate road segments can be identified where a lack design consistency may be contributing to an increase in expected crashes. Practitioners can use this method to more effectively identify roadway segments suffering from reduced safety performance due to geometric design inconsistency, with detailed engineering studies of identified sites required to confirm the initial assessment. Copyright © 2017 Elsevier Ltd. All rights reserved.

Topology Recognition and Leader Election in Colored Networks

OpenAIRE

Dereniowski, Dariusz; Pelc, Andrzej

2016-01-01

Topology recognition and leader election are fundamental tasks in distributed computing in networks. The first of them requires each node to find a labeled isomorphic copy of the network, while the result of the second one consists in a single node adopting the label 1 (leader), with all other nodes adopting the label 0 and learning a path to the leader. We consider both these problems in networks whose nodes are equipped with not necessarily distinct labels called colors, and ports at each n...

The functional consequences of mutualistic network architecture.

Directory of Open Access Journals (Sweden)

José M Gómez

Full Text Available The architecture and properties of many complex networks play a significant role in the functioning of the systems they describe. Recently, complex network theory has been applied to ecological entities, like food webs or mutualistic plant-animal interactions. Unfortunately, we still lack an accurate view of the relationship between the architecture and functioning of ecological networks. In this study we explore this link by building individual-based pollination networks from eight Erysimum mediohispanicum (Brassicaceae populations. In these individual-based networks, each individual plant in a population was considered a node, and was connected by means of undirected links to conspecifics sharing pollinators. The architecture of these unipartite networks was described by means of nestedness, connectivity and transitivity. Network functioning was estimated by quantifying the performance of the population described by each network as the number of per-capita juvenile plants produced per population. We found a consistent relationship between the topology of the networks and their functioning, since variation across populations in the average per-capita production of juvenile plants was positively and significantly related with network nestedness, connectivity and clustering. Subtle changes in the composition of diverse pollinator assemblages can drive major consequences for plant population performance and local persistence through modifications in the structure of the inter-plant pollination networks.

Estimation of Conditional Quantile using Neural Networks

DEFF Research Database (Denmark)

Kulczycki, P.; Schiøler, Henrik

1999-01-01

The problem of estimating conditional quantiles using neural networks is investigated here. A basic structure is developed using the methodology of kernel estimation, and a theory guaranteeing con-sistency on a mild set of assumptions is provided. The constructed structure constitutes a basis...... for the design of a variety of different neural networks, some of which are considered in detail. The task of estimating conditional quantiles is related to Bayes point estimation whereby a broad range of applications within engineering, economics and management can be suggested. Numerical results illustrating...... the capabilities of the elaborated neural network are also given....

Reconstruction of periodic signals using neural networks

Directory of Open Access Journals (Sweden)

José Danilo Rairán Antolines

2014-01-01

Full Text Available In this paper, we reconstruct a periodic signal by using two neural networks. The first network is trained to approximate the period of a signal, and the second network estimates the corresponding coefficients of the signal's Fourier expansion. The reconstruction strategy consists in minimizing the mean-square error via backpro-pagation algorithms over a single neuron with a sine transfer function. Additionally, this paper presents mathematical proof about the quality of the approximation as well as a first modification of the algorithm, which requires less data to reach the same estimation; thus making the algorithm suitable for real-time implementations.

Complex Dynamics of Delay-Coupled Neural Networks

Science.gov (United States)

Mao, Xiaochen

2016-09-01

This paper reveals the complicated dynamics of a delay-coupled system that consists of a pair of sub-networks and multiple bidirectional couplings. Time delays are introduced into the internal connections and network-couplings, respectively. The stability and instability of the coupled network are discussed. The sufficient conditions for the existence of oscillations are given. Case studies of numerical simulations are given to validate the analytical results. Interesting and complicated neuronal activities are observed numerically, such as rest states, periodic oscillations, multiple switches of rest states and oscillations, and the coexistence of different types of oscillations.

Cooperative robots and sensor networks 2014

CERN Document Server

Khelil, Abdelmajid

2014-01-01

This book is the second volume on Cooperative Robots and Sensor Networks. The primary objective of this book is to provide an up-to-date reference for cutting-edge studies and research trends related to mobile robots and wireless sensor networks, and in particular for the coupling between them. Indeed, mobile robots and wireless sensor networks have enabled great potentials and a large space for ubiquitous and pervasive applications. Robotics and wireless sensor networks have mostly been considered as separate research fields and little work has investigated the marriage between these two technologies. However, these two technologies share several features, enable common cyber-physical applications and provide complementary support to each other. The book consists of ten chapters, organized into four parts. The first part of the book presents three chapters related to localization of mobile robots using wireless sensor networks. Two chapters presented new solutions based Extended Kalman Filter and Particle Fi...

Bidirectional selection between two classes in complex social networks.

Science.gov (United States)

Zhou, Bin; He, Zhe; Jiang, Luo-Luo; Wang, Nian-Xin; Wang, Bing-Hong

2014-12-19

The bidirectional selection between two classes widely emerges in various social lives, such as commercial trading and mate choosing. Until now, the discussions on bidirectional selection in structured human society are quite limited. We demonstrated theoretically that the rate of successfully matching is affected greatly by individuals' neighborhoods in social networks, regardless of the type of networks. Furthermore, it is found that the high average degree of networks contributes to increasing rates of successful matches. The matching performance in different types of networks has been quantitatively investigated, revealing that the small-world networks reinforces the matching rate more than scale-free networks at given average degree. In addition, our analysis is consistent with the modeling result, which provides the theoretical understanding of underlying mechanisms of matching in complex networks.

The QKD network: model and routing scheme

Science.gov (United States)

Yang, Chao; Zhang, Hongqi; Su, Jinhai

2017-11-01

Quantum key distribution (QKD) technology can establish unconditional secure keys between two communicating parties. Although this technology has some inherent constraints, such as the distance and point-to-point mode limits, building a QKD network with multiple point-to-point QKD devices can overcome these constraints. Considering the development level of current technology, the trust relaying QKD network is the first choice to build a practical QKD network. However, the previous research didn't address a routing method on the trust relaying QKD network in detail. This paper focuses on the routing issues, builds a model of the trust relaying QKD network for easily analysing and understanding this network, and proposes a dynamical routing scheme for this network. From the viewpoint of designing a dynamical routing scheme in classical network, the proposed scheme consists of three components: a Hello protocol helping share the network topology information, a routing algorithm to select a set of suitable paths and establish the routing table and a link state update mechanism helping keep the routing table newly. Experiments and evaluation demonstrates the validity and effectiveness of the proposed routing scheme.

COMPARATIVE ANALYSIS OF LEACH AND HEEMPCP PROTOCOLS FOR WIRELESS SENSOR NETWORKS SYSTEM

OpenAIRE

Richa Asstt. Pro.Misha Thakur

2018-01-01

In this paper author aims at describing a wireless sensor network. wireless sensor network consisting of spatially distributed autonomous devices using sensor to monitor physical or environmental conditions. Wireless sensor network can be used in wide range of applications including environmental monitoring, habitat monitoring, various military applications, smart home technologiesand agriculture. Wireless sensor networks constitute one of promising application areas of the recently developed...

Innovations and networking fostering tourist destination development in Slovakia

Directory of Open Access Journals (Sweden)

Gajdošík Tomáš

2017-12-01

Full Text Available The paper focuses on the implementation of innovations and networking in the sector of tourism in two Slovak mountain destinations of international significance. The main objective of the paper is to identify and evaluate how innovations and networking contribute to tourist destination development in Slovakia. The implementation of institutional innovation resulted in the establishment of formal and informal networks. The developed networks consist of representatives of all sectors co-ordinating all relevant stakeholders. Formal and informal networks and the collaboration among stakeholders have launched other types of innovations in the tourism sector. The interactions and intensity of relations among stakeholders are analysed by network analysis. Destinations are compared with the network of the same size and density through quantitative network characteristics. Based on empirical research we investigate the impact of networks and innovations on tourist destination development. Due to the synergy effect of networking and implementation of multiple innovations, tourist destination development is observed.

Cooperative and networking strategies in small business

CERN Document Server

Ferreira, João

2017-01-01

The book aims to collect the most recent research and best practices in the cooperative and networking small business field identifying new theoretical models and describing the relationship between cooperation and networks in the small business strategy context. It examines different concepts and analytical techniques better understand the links between cooperative strategies and networks in small business. It also studies the existing economic conditions of network and strategic implications to small business from the point of view of their internal and external consistency. Cooperation and networks is a fashionable topic. It is receiving increasing attention in popular management publications, as well as specialized academic journals. Cooperation between firms and industries is a means of leveraging and aggregating knowledge also generating direct benefits in terms of innovation, productivity and competitiveness. Various options and decisions made within the framework of strategic alliances may be identifi...

Gas Classification Using Deep Convolutional Neural Networks

Science.gov (United States)

Peng, Pai; Zhao, Xiaojin; Pan, Xiaofang; Ye, Wenbin

2018-01-01

In this work, we propose a novel Deep Convolutional Neural Network (DCNN) tailored for gas classification. Inspired by the great success of DCNN in the field of computer vision, we designed a DCNN with up to 38 layers. In general, the proposed gas neural network, named GasNet, consists of: six convolutional blocks, each block consist of six layers; a pooling layer; and a fully-connected layer. Together, these various layers make up a powerful deep model for gas classification. Experimental results show that the proposed DCNN method is an effective technique for classifying electronic nose data. We also demonstrate that the DCNN method can provide higher classification accuracy than comparable Support Vector Machine (SVM) methods and Multiple Layer Perceptron (MLP). PMID:29316723

Gas Classification Using Deep Convolutional Neural Networks.

Science.gov (United States)

Peng, Pai; Zhao, Xiaojin; Pan, Xiaofang; Ye, Wenbin

2018-01-08

In this work, we propose a novel Deep Convolutional Neural Network (DCNN) tailored for gas classification. Inspired by the great success of DCNN in the field of computer vision, we designed a DCNN with up to 38 layers. In general, the proposed gas neural network, named GasNet, consists of: six convolutional blocks, each block consist of six layers; a pooling layer; and a fully-connected layer. Together, these various layers make up a powerful deep model for gas classification. Experimental results show that the proposed DCNN method is an effective technique for classifying electronic nose data. We also demonstrate that the DCNN method can provide higher classification accuracy than comparable Support Vector Machine (SVM) methods and Multiple Layer Perceptron (MLP).

Mechanics of anisotropic spring networks.

Science.gov (United States)

Zhang, T; Schwarz, J M; Das, Moumita

2014-12-01

We construct and analyze a model for a disordered linear spring network with anisotropy. The modeling is motivated by, for example, granular systems, nematic elastomers, and ultimately cytoskeletal networks exhibiting some underlying anisotropy. The model consists of a triangular lattice with two different bond occupation probabilities, p(x) and p(y), for the linear springs. We develop an effective medium theory (EMT) to describe the network elasticity as a function of p(x) and p(y). We find that the onset of rigidity in the EMT agrees with Maxwell constraint counting. We also find beyond linear behavior in the shear and bulk modulus as a function of occupation probability in the rigid phase for small strains, which differs from the isotropic case. We compare our EMT with numerical simulations to find rather good agreement. Finally, we discuss the implications of extending the reach of effective medium theory as well as draw connections with prior work on both anisotropic and isotropic spring networks.

Distributed Estimation, Coding, and Scheduling in Wireless Visual Sensor Networks

Science.gov (United States)

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

Analyzing complex networks through correlations in centrality measurements

International Nuclear Information System (INIS)

Ricardo Furlan Ronqui, José; Travieso, Gonzalo

2015-01-01

Many real world systems can be expressed as complex networks of interconnected nodes. It is frequently important to be able to quantify the relative importance of the various nodes in the network, a task accomplished by defining some centrality measures, with different centrality definitions stressing different aspects of the network. It is interesting to know to what extent these different centrality definitions are related for different networks. In this work, we study the correlation between pairs of a set of centrality measures for different real world networks and two network models. We show that the centralities are in general correlated, but with stronger correlations for network models than for real networks. We also show that the strength of the correlation of each pair of centralities varies from network to network. Taking this fact into account, we propose the use of a centrality correlation profile, consisting of the values of the correlation coefficients between all pairs of centralities of interest, as a way to characterize networks. Using the yeast protein interaction network as an example we show also that the centrality correlation profile can be used to assess the adequacy of a network model as a representation of a given real network. (paper)

Dynamics of nephron-vascular network

DEFF Research Database (Denmark)

Postnov, Dmitry; Postnov, D E; Marsh, D J

2012-01-01

The paper presents a modeling study of the spatial dynamics of a nephro-vascular network consisting of individual nephrons connected via a tree-like vascular branching structure. We focus on the effects of nonlinear mechanisms that are responsible for the formation of synchronous patterns in order...

Epidemics and dimensionality in hierarchical networks

Science.gov (United States)

Zheng, Da-Fang; Hui, P. M.; Trimper, Steffen; Zheng, Bo

2005-07-01

Epidemiological processes are studied within a recently proposed hierarchical network model using the susceptible-infected-refractory dynamics of an epidemic. Within the network model, a population may be characterized by H independent hierarchies or dimensions, each of which consists of groupings of individuals into layers of subgroups. Detailed numerical simulations reveal that for H>1, global spreading results regardless of the degree of homophily of the individuals forming a social circle. For H=1, a transition from global to local spread occurs as the population becomes decomposed into increasingly homophilous groups. Multiple dimensions in classifying individuals (nodes) thus make a society (computer network) highly susceptible to large-scale outbreaks of infectious diseases (viruses).

Impact of Network Coding on Delay and Throughput in Practical Wireless Chain Topologies

DEFF Research Database (Denmark)

Hundebøll, Martin; Rein, Stephan Alexander; Fitzek, Frank

2013-01-01

In this paper, we present results from a practical evaluation of network coding in a setup consisting of eight nodes deployed in a chain topology. With the tradition pure relaying, delay increases dramatically as the network gets congested, and here network coding helps to moderate this increase ...

Inferring a Drive-Response Network from Time Series of Topological Measures in Complex Networks with Transfer Entropy

Directory of Open Access Journals (Sweden)

Xinbo Ai

2014-11-01

Full Text Available Topological measures are crucial to describe, classify and understand complex networks. Lots of measures are proposed to characterize specific features of specific networks, but the relationships among these measures remain unclear. Taking into account that pulling networks from different domains together for statistical analysis might provide incorrect conclusions, we conduct our investigation with data observed from the same network in the form of simultaneously measured time series. We synthesize a transfer entropy-based framework to quantify the relationships among topological measures, and then to provide a holistic scenario of these measures by inferring a drive-response network. Techniques from Symbolic Transfer Entropy, Effective Transfer Entropy, and Partial Transfer Entropy are synthesized to deal with challenges such as time series being non-stationary, finite sample effects and indirect effects. We resort to kernel density estimation to assess significance of the results based on surrogate data. The framework is applied to study 20 measures across 2779 records in the Technology Exchange Network, and the results are consistent with some existing knowledge. With the drive-response network, we evaluate the influence of each measure by calculating its strength, and cluster them into three classes, i.e., driving measures, responding measures and standalone measures, according to the network communities.

Clustering of resting state networks.

Directory of Open Access Journals (Sweden)

Megan H Lee

Full Text Available The goal of the study was to demonstrate a hierarchical structure of resting state activity in the healthy brain using a data-driven clustering algorithm.The fuzzy-c-means clustering algorithm was applied to resting state fMRI data in cortical and subcortical gray matter from two groups acquired separately, one of 17 healthy individuals and the second of 21 healthy individuals. Different numbers of clusters and different starting conditions were used. A cluster dispersion measure determined the optimal numbers of clusters. An inner product metric provided a measure of similarity between different clusters. The two cluster result found the task-negative and task-positive systems. The cluster dispersion measure was minimized with seven and eleven clusters. Each of the clusters in the seven and eleven cluster result was associated with either the task-negative or task-positive system. Applying the algorithm to find seven clusters recovered previously described resting state networks, including the default mode network, frontoparietal control network, ventral and dorsal attention networks, somatomotor, visual, and language networks. The language and ventral attention networks had significant subcortical involvement. This parcellation was consistently found in a large majority of algorithm runs under different conditions and was robust to different methods of initialization.The clustering of resting state activity using different optimal numbers of clusters identified resting state networks comparable to previously obtained results. This work reinforces the observation that resting state networks are hierarchically organized.

Experimental and computational analysis of a large protein network that controls fat storage reveals the design principles of a signaling network.

Science.gov (United States)

Al-Anzi, Bader; Arpp, Patrick; Gerges, Sherif; Ormerod, Christopher; Olsman, Noah; Zinn, Kai

2015-05-01

An approach combining genetic, proteomic, computational, and physiological analysis was used to define a protein network that regulates fat storage in budding yeast (Saccharomyces cerevisiae). A computational analysis of this network shows that it is not scale-free, and is best approximated by the Watts-Strogatz model, which generates "small-world" networks with high clustering and short path lengths. The network is also modular, containing energy level sensing proteins that connect to four output processes: autophagy, fatty acid synthesis, mRNA processing, and MAP kinase signaling. The importance of each protein to network function is dependent on its Katz centrality score, which is related both to the protein's position within a module and to the module's relationship to the network as a whole. The network is also divisible into subnetworks that span modular boundaries and regulate different aspects of fat metabolism. We used a combination of genetics and pharmacology to simultaneously block output from multiple network nodes. The phenotypic results of this blockage define patterns of communication among distant network nodes, and these patterns are consistent with the Watts-Strogatz model.

A Bell inequality for a class of multilocal ring networks

Science.gov (United States)

Frey, Michael

2017-11-01

Quantum networks with independent sources of entanglement (hidden variables) and nodes that execute joint quantum measurements can create strong quantum correlations spanning the breadth of the network. Understanding of these correlations has to the present been limited to standard Bell experiments with one source of shared randomness, bilocal arrangements having two local sources of shared randomness, and multilocal networks with tree topologies. We introduce here a class of quantum networks with ring topologies comprised of subsystems each with its own internally shared source of randomness. We prove a Bell inequality for these networks, and to demonstrate violations of this inequality, we focus on ring networks with three-qubit subsystems. Three qubits are capable of two non-equivalent types of entanglement, GHZ and W-type. For rings of any number N of three-qubit subsystems, our inequality is violated when the subsystems are each internally GHZ-entangled. This violation is consistently stronger when N is even. This quantitative even-odd difference for GHZ entanglement becomes extreme in the case of W-type entanglement. When the ring size N is even, the presence of W-type entanglement is successfully detected; when N is odd, the inequality consistently fails to detect its presence.

A last updating evolution model for online social networks

Science.gov (United States)

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

2013-05-01

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

An accelerator controls network designed for reliability and flexibility

International Nuclear Information System (INIS)

McDowell, W. P.; Sidorowicz, K. V.

1997-01-01

The APS accelerator control system is a typical modern system based on the standard control system model, which consists of operator interfaces to a network and computer-controlled interfaces to hardware. The network provides a generalized communication path between the host computers, operator workstations, input/output crates, and other hardware that comprise the control system. The network is an integral part of all modern control systems and network performance will determine many characteristics of a control system. This paper describes the methods used to provide redundancy for various network system components as well as methods used to provide comprehensive monitoring of this network. The effect of archiving tens of thousands of data points on a regular basis and the effect on the controls network will be discussed. Metrics are provided on the performance of the system under various conditions

Evidence for a Functional Hierarchy of Association Networks.

Science.gov (United States)

Choi, Eun Young; Drayna, Garrett K; Badre, David

2018-05-01

Patient lesion and neuroimaging studies have identified a rostral-to-caudal functional gradient in the lateral frontal cortex (LFC) corresponding to higher-order (complex or abstract) to lower-order (simple or concrete) cognitive control. At the same time, monkey anatomical and human functional connectivity studies show that frontal regions are reciprocally connected with parietal and temporal regions, forming parallel and distributed association networks. Here, we investigated the link between the functional gradient of LFC regions observed during control tasks and the parallel, distributed organization of association networks. Whole-brain fMRI task activity corresponding to four orders of hierarchical control [Badre, D., & D'Esposito, M. Functional magnetic resonance imaging evidence for a hierarchical organization of the prefrontal cortex. Journal of Cognitive Neuroscience, 19, 2082-2099, 2007] was compared with a resting-state functional connectivity MRI estimate of cortical networks [Yeo, B. T., Krienen, F. M., Sepulcre, J., Sabuncu, M. R., Lashkari, D., Hollinshead, M., et al. The organization of the human cerebral cortex estimated by intrinsic functional connectivity. Journal of Neurophysiology, 106, 1125-1165, 2011]. Critically, at each order of control, activity in the LFC and parietal cortex overlapped onto a common association network that differed between orders. These results are consistent with a functional organization based on separable association networks that are recruited during hierarchical control. Furthermore, corticostriatal functional connectivity MRI showed that, consistent with their participation in functional networks, rostral-to-caudal LFC and caudal-to-rostral parietal regions had similar, order-specific corticostriatal connectivity that agreed with a striatal gating model of hierarchical rule use. Our results indicate that hierarchical cognitive control is subserved by parallel and distributed association networks, together forming

Stability of a giant connected component in a complex network

Science.gov (United States)

Kitsak, Maksim; Ganin, Alexander A.; Eisenberg, Daniel A.; Krapivsky, Pavel L.; Krioukov, Dmitri; Alderson, David L.; Linkov, Igor

2018-01-01

We analyze the stability of the network's giant connected component under impact of adverse events, which we model through the link percolation. Specifically, we quantify the extent to which the largest connected component of a network consists of the same nodes, regardless of the specific set of deactivated links. Our results are intuitive in the case of single-layered systems: the presence of large degree nodes in a single-layered network ensures both its robustness and stability. In contrast, we find that interdependent networks that are robust to adverse events have unstable connected components. Our results bring novel insights to the design of resilient network topologies and the reinforcement of existing networked systems.

Fiber Orientation Estimation Guided by a Deep Network.

Science.gov (United States)

Ye, Chuyang; Prince, Jerry L

2017-09-01

Diffusion magnetic resonance imaging (dMRI) is currently the only tool for noninvasively imaging the brain's white matter tracts. The fiber orientation (FO) is a key feature computed from dMRI for tract reconstruction. Because the number of FOs in a voxel is usually small, dictionary-based sparse reconstruction has been used to estimate FOs. However, accurate estimation of complex FO configurations in the presence of noise can still be challenging. In this work we explore the use of a deep network for FO estimation in a dictionary-based framework and propose an algorithm named Fiber Orientation Reconstruction guided by a Deep Network (FORDN). FORDN consists of two steps. First, we use a smaller dictionary encoding coarse basis FOs to represent diffusion signals. To estimate the mixture fractions of the dictionary atoms, a deep network is designed to solve the sparse reconstruction problem. Second, the coarse FOs inform the final FO estimation, where a larger dictionary encoding a dense basis of FOs is used and a weighted ℓ 1 -norm regularized least squares problem is solved to encourage FOs that are consistent with the network output. FORDN was evaluated and compared with state-of-the-art algorithms that estimate FOs using sparse reconstruction on simulated and typical clinical dMRI data. The results demonstrate the benefit of using a deep network for FO estimation.

The control network of air quality in the Lorraine steel industry country: an example of a specific steel industry network

International Nuclear Information System (INIS)

Poncin, G.

1991-01-01

This specific (for steel industry region) network for the air quality control mainly measures the concentrations in sulfur dioxide, airborne dust and fall out particles. The recent automation of this network implied a preliminary optimization study which consisted of a statistical analysis of the numerous data collected by many hand operated sensors. The implementation and working conditions of the new equipment have required the use of air-conditioned monoblock metallic cabins

Analysis of Network Topologies Underlying Ethylene Growth Response Kinetics

Directory of Open Access Journals (Sweden)

Aaron M. Prescott

2016-08-01

Full Text Available Most models for ethylene signaling involve a linear pathway. However, measurements of seedling growth kinetics when ethylene is applied and removed have resulted in more complex network models that include coherent feedforward, negative feedback, and positive feedback motifs. However, the dynamical responses of the proposed networks have not been explored in a quantitative manner. Here, we explore (i whether any of the proposed models are capable of producing growth-response behaviors consistent with experimental observations and (ii what mechanistic roles various parts of the network topologies play in ethylene signaling. To address this, we used computational methods to explore two general network topologies: The first contains a coherent feedforward loop that inhibits growth and a negative feedback from growth onto itself (CFF/NFB. In the second, ethylene promotes the cleavage of EIN2, with the product of the cleavage inhibiting growth and promoting the production of EIN2 through a positive feedback loop (PFB. Since few network parameters for ethylene signaling are known in detail, we used an evolutionary algorithm to explore sets of parameters that produce behaviors similar to experimental growth response kinetics of both wildtype and mutant seedlings. We generated a library of parameter sets by independently running the evolutionary algorithm many times. Both network topologies produce behavior consistent with experimental observations and analysis of the parameter sets allows us to identify important network interactions and parameter constraints. We additionally screened these parameter sets for growth recovery in the presence of sub-saturating ethylene doses, which is an experimentally-observed property that emerges in some of the evolved parameter sets. Finally, we probed simplified networks maintaining key features of the CFF/NFB and PFB topologies. From this, we verified observations drawn from the larger networks about mechanisms

Analysis of Network Topologies Underlying Ethylene Growth Response Kinetics.

Science.gov (United States)

Prescott, Aaron M; McCollough, Forest W; Eldreth, Bryan L; Binder, Brad M; Abel, Steven M

2016-01-01

Most models for ethylene signaling involve a linear pathway. However, measurements of seedling growth kinetics when ethylene is applied and removed have resulted in more complex network models that include coherent feedforward, negative feedback, and positive feedback motifs. The dynamical responses of the proposed networks have not been explored in a quantitative manner. Here, we explore (i) whether any of the proposed models are capable of producing growth-response behaviors consistent with experimental observations and (ii) what mechanistic roles various parts of the network topologies play in ethylene signaling. To address this, we used computational methods to explore two general network topologies: The first contains a coherent feedforward loop that inhibits growth and a negative feedback from growth onto itself (CFF/NFB). In the second, ethylene promotes the cleavage of EIN2, with the product of the cleavage inhibiting growth and promoting the production of EIN2 through a positive feedback loop (PFB). Since few network parameters for ethylene signaling are known in detail, we used an evolutionary algorithm to explore sets of parameters that produce behaviors similar to experimental growth response kinetics of both wildtype and mutant seedlings. We generated a library of parameter sets by independently running the evolutionary algorithm many times. Both network topologies produce behavior consistent with experimental observations, and analysis of the parameter sets allows us to identify important network interactions and parameter constraints. We additionally screened these parameter sets for growth recovery in the presence of sub-saturating ethylene doses, which is an experimentally-observed property that emerges in some of the evolved parameter sets. Finally, we probed simplified networks maintaining key features of the CFF/NFB and PFB topologies. From this, we verified observations drawn from the larger networks about mechanisms underlying ethylene

SPLAI: Computational Finite Element Model for Sensor Networks

Directory of Open Access Journals (Sweden)

Ruzana Ishak

2006-01-01

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

Observation and inverse problems in coupled cell networks

International Nuclear Information System (INIS)

Joly, Romain

2012-01-01

A coupled cell network is a model for many situations such as food webs in ecosystems, cellular metabolism and economic networks. It consists in a directed graph G, each node (or cell) representing an agent of the network and each directed arrow representing which agent acts on which. It yields a system of differential equations .x(t)=f(x(t)), where the component i of f depends only on the cells x j (t) for which the arrow j → i exists in G. In this paper, we investigate the observation problems in coupled cell networks: can one deduce the behaviour of the whole network (oscillations, stabilization, etc) by observing only one of the cells? We show that the natural observation properties hold for almost all the interactions f

Interorganizational networks: fundamental to the Accreditation Canada program.

Science.gov (United States)

Mitchell, Jonathan I; Nicklin, Wendy; MacDonald, Bernadette

2014-01-01

Within the Canadian healthcare system, the term population-accountable health network defines the use of collective resources to optimize the health of a population through integrated interventions. The leadership of these networks has also been identified as a critical factor, highlighting the need for creative management of resources in determining effective, balanced sets of interventions. In this article, using specific principles embedded in the Accreditation Canada program, the benefits of a network approach are highlighted, including knowledge sharing, improving the consistency of practice through standards, and a broader systems-and-population view of healthcare delivery across the continuum of care. The implications for Canadian health leaders to leverage the benefits of interorganizational networks are discussed.

Classification Method in Integrated Information Network Using Vector Image Comparison

Directory of Open Access Journals (Sweden)

Zhou Yuan

2014-05-01

Full Text Available Wireless Integrated Information Network (WMN consists of integrated information that can get data from its surrounding, such as image, voice. To transmit information, large resource is required which decreases the service time of the network. In this paper we present a Classification Approach based on Vector Image Comparison (VIC for WMN that improve the service time of the network. The available methods for sub-region selection and conversion are also proposed.

Three neural network based sensor systems for environmental monitoring

International Nuclear Information System (INIS)

Keller, P.E.; Kouzes, R.T.; Kangas, L.J.

1994-05-01

Compact, portable systems capable of quickly identifying contaminants in the field are of great importance when monitoring the environment. One of the missions of the Pacific Northwest Laboratory is to examine and develop new technologies for environmental restoration and waste management at the Hanford Site. In this paper, three prototype sensing systems are discussed. These prototypes are composed of sensing elements, data acquisition system, computer, and neural network implemented in software, and are capable of automatically identifying contaminants. The first system employs an array of tin-oxide gas sensors and is used to identify chemical vapors. The second system employs an array of optical sensors and is used to identify the composition of chemical dyes in liquids. The third system contains a portable gamma-ray spectrometer and is used to identify radioactive isotopes. In these systems, the neural network is used to identify the composition of the sensed contaminant. With a neural network, the intense computation takes place during the training process. Once the network is trained, operation consists of propagating the data through the network. Since the computation involved during operation consists of vector-matrix multiplication and application of look-up tables unknown samples can be rapidly identified in the field

Network monitoring in the Tier2 site in Prague

International Nuclear Information System (INIS)

Eliáš, Marek; Fiala, Lukáš; Horký, Jirí; Chudoba, Jirí; Kouba, Tomáš; Kundrát, Jan; Švec, Jan

2011-01-01

Network monitoring provides different types of view on the network traffic. It's output enables computing centre staff to make qualified decisions about changes in the organization of computing centre network and to spot possible problems. In this paper we present network monitoring framework used at Tier-2 in Prague in Institute of Physics (FZU). The framework consists of standard software and custom tools. We discuss our system for hardware failures detection using syslog logging and Nagios active checks, bandwidth monitoring of physical links and analysis of NetFlow exports from Cisco routers. We present tool for automatic detection of network layout based on SNMP. This tool also records topology changes into SVN repository. Adapted weathermap4rrd is used to visualize recorded data to get fast overview showing current bandwidth usage of links in network.

Distributed and Cooperative Link Scheduling for Large-Scale Multihop Wireless Networks

Directory of Open Access Journals (Sweden)

Swami Ananthram

2007-01-01

Full Text Available A distributed and cooperative link-scheduling (DCLS algorithm is introduced for large-scale multihop wireless networks. With this algorithm, each and every active link in the network cooperatively calibrates its environment and converges to a desired link schedule for data transmissions within a time frame of multiple slots. This schedule is such that the entire network is partitioned into a set of interleaved subnetworks, where each subnetwork consists of concurrent cochannel links that are properly separated from each other. The desired spacing in each subnetwork can be controlled by a tuning parameter and the number of time slots specified for each frame. Following the DCLS algorithm, a distributed and cooperative power control (DCPC algorithm can be applied to each subnetwork to ensure a desired data rate for each link with minimum network transmission power. As shown consistently by simulations, the DCLS algorithm along with a DCPC algorithm yields significant power savings. The power savings also imply an increased feasible region of averaged link data rates for the entire network.

Distributed and Cooperative Link Scheduling for Large-Scale Multihop Wireless Networks

Directory of Open Access Journals (Sweden)

Ananthram Swami

2007-12-01

Full Text Available A distributed and cooperative link-scheduling (DCLS algorithm is introduced for large-scale multihop wireless networks. With this algorithm, each and every active link in the network cooperatively calibrates its environment and converges to a desired link schedule for data transmissions within a time frame of multiple slots. This schedule is such that the entire network is partitioned into a set of interleaved subnetworks, where each subnetwork consists of concurrent cochannel links that are properly separated from each other. The desired spacing in each subnetwork can be controlled by a tuning parameter and the number of time slots specified for each frame. Following the DCLS algorithm, a distributed and cooperative power control (DCPC algorithm can be applied to each subnetwork to ensure a desired data rate for each link with minimum network transmission power. As shown consistently by simulations, the DCLS algorithm along with a DCPC algorithm yields significant power savings. The power savings also imply an increased feasible region of averaged link data rates for the entire network.

Modeling of contact tracing in social networks

Science.gov (United States)

Tsimring, Lev S.; Huerta, Ramón

2003-07-01

Spreading of certain infections in complex networks is effectively suppressed by using intelligent strategies for epidemic control. One such standard epidemiological strategy consists in tracing contacts of infected individuals. In this paper, we use a recently introduced generalization of the standard susceptible-infectious-removed stochastic model for epidemics in sparse random networks which incorporates an additional (traced) state. We describe a deterministic mean-field description which yields quantitative agreement with stochastic simulations on random graphs. We also discuss the role of contact tracing in epidemics control in small-world and scale-free networks. Effectiveness of contact tracing grows as the rewiring probability is reduced.

Relay-assisted Network Coding Multicast in the Presence of Neighbours

DEFF Research Database (Denmark)

Khamfroush, Hana; Roetter, Daniel Enrique Lucani; Pahlevani, Peyman

2015-01-01

We study the problem of minimizing the cost of packet transmission from a source to two receivers with the help of a relay and using network coding in wireless mesh networks consisting of many active neighbours sharing the same channel. The cost minimization problem is modeled as a Markov Decisio...

Simulation of Routing Protocol with CoS/QoS Enhancements in Heterogeneous Communication Network

National Research Council Canada - National Science Library

Kubera, Emil; Sliwa, Joanna; Zubel, Krzysztof; Mroczko, Adrian

2006-01-01

The article describes the subject of QoS routing mechanism in tactical heterogeneous communication network consisting of network elements built in different technologies and connected following rules...

A Network-Individual-Resource Model for HIV Prevention

Science.gov (United States)

Johnson, Blair T.; Redding, Colleen A.; DiClemente, Ralph J.; Mustanski, Brian S.; Dodge, Brian M.; Sheeran, Paschal; Warren, Michelle R.; Zimmerman, Rick S.; Fisher, William A.; Conner, Mark T.; Carey, Michael P.; Fisher, Jeffrey D.; Stall, Ronald D.; Fishbein, Martin

2014-01-01

HIV is transmitted through dyadic exchanges of individuals linked in transitory or permanent networks of varying sizes. To optimize prevention efficacy, a complementary theoretical perspective that bridges key individual level elements with important network elements can be a foundation for developing and implementing HIV interventions with outcomes that are more sustainable over time and have greater dissemination potential. Toward that end, we introduce a Network-Individual-Resource (NIR) model for HIV prevention that recognizes how exchanges of resources between individuals and their networks underlies and sustains HIV-risk behaviors. Individual behavior change for HIV prevention, then, may be dependent on increasing the supportiveness of that individual's relevant networks for such change. Among other implications, an NIR model predicts that the success of prevention efforts depends on whether the prevention efforts (1) prompt behavior changes that can be sustained by the resources the individual or their networks possess; (2) meet individual and network needs and are consistent with the individual's current situation/developmental stage; (3) are trusted and valued; and (4) target high HIV-prevalence networks. PMID:20862606

NOSArmor: Building a Secure Network Operating System

Directory of Open Access Journals (Sweden)

Hyeonseong Jo

2018-01-01

Full Text Available Software-Defined Networking (SDN, controlling underlying network devices (i.e., data plane in a logically centralized manner, is now actively adopted in many real world networking environments. It is clear that a network administrator can easily understand and manage his networking environments with the help of SDN. In SDN, a network operating system (NOS, also known as an SDN controller, is the most critical component because it should be involved in all transactions for controlling network devices, and thus the security of NOS cannot be highly exaggerated. However, in spite of its importance, no previous works have thoroughly investigated the security of NOS. In this work, to address this problem, we present the NOSArmor, which integrates several security mechanisms, named as security building block (SBB, into a consolidated SDN controller. NOSArmor consists of eight SBBs and each of them addresses different security principles of network assets. For example, while role-based authorization focuses on securing confidentiality of internal storage from malicious applications, OpenFlow protocol verifier protects availability of core service in the controller from malformed control messages received from switches. In addition, NOSArmor shows competitive performance compared to existing other controllers (i.e., ONOS, Floodlight with secureness of network assets.

SI infection on a dynamic partnership network : characterization of R0

NARCIS (Netherlands)

Leung, Ka Yin; Kretzschmar, MEE; Diekmann, Odo

We model the spread of an SI (Susceptible → Infectious) sexually transmitted infection on a dynamic homosexual network. The network consists of individuals with a dynamically varying number of partners. There is demographic turnover due to individuals entering the population at a constant rate and

Utilizing Network QoS for Dependability of Adaptive Smart Grid Control

DEFF Research Database (Denmark)

Madsen, Jacob Theilgaard; Kristensen, Thomas le Fevre; Olsen, Rasmus Løvenstein

2014-01-01

A smart grid is a complex system consisting of a wide range of electric grid components, entities controlling power distribution, generation and consumption, and a communication network supporting data exchange. This paper focuses on the influence of imperfect network conditions on smart grid con...

Evaluation of EOR Processes Using Network Models

DEFF Research Database (Denmark)

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

1998-01-01

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

Cultured Neural Networks: Optimization of Patterned Network Adhesiveness and Characterization of their Neural Activity

Directory of Open Access Journals (Sweden)

W. L. C. Rutten

2006-01-01

Full Text Available One type of future, improved neural interface is the “cultured probe”. It is a hybrid type of neural information transducer or prosthesis, for stimulation and/or recording of neural activity. It would consist of a microelectrode array (MEA on a planar substrate, each electrode being covered and surrounded by a local circularly confined network (“island” of cultured neurons. The main purpose of the local networks is that they act as biofriendly intermediates for collateral sprouts from the in vivo system, thus allowing for an effective and selective neuron–electrode interface. As a secondary purpose, one may envisage future information processing applications of these intermediary networks. In this paper, first, progress is shown on how substrates can be chemically modified to confine developing networks, cultured from dissociated rat cortex cells, to “islands” surrounding an electrode site. Additional coating of neurophobic, polyimide-coated substrate by triblock-copolymer coating enhances neurophilic-neurophobic adhesion contrast. Secondly, results are given on neuronal activity in patterned, unconnected and connected, circular “island” networks. For connected islands, the larger the island diameter (50, 100 or 150 μm, the more spontaneous activity is seen. Also, activity may show a very high degree of synchronization between two islands. For unconnected islands, activity may start at 22 days in vitro (DIV, which is two weeks later than in unpatterned networks.

Optimized and Executive Survey of Physical Node Capture Attack in Wireless Sensor Network

OpenAIRE

Bhavana Butani; Piyush Kumar Shukla; Sanjay Silakari

2014-01-01

Wireless sensor networks (WSNs) are novel large-scale wireless networks that consist of distributed, self organizing, low-power, low-cost, tiny sensor devices to cooperatively collect information through infrastructure less wireless networks. These networks are envisioned to play a crucial role in variety of applications like critical military surveillance applications, forest fire monitoring, commercial applications such as building security monitoring, traffic surveillance, habitat monitori...

Method for assessing reliability of a network considering probabilistic safety assessment

International Nuclear Information System (INIS)

Cepin, M.

2005-01-01

A method for assessment of reliability of the network is developed, which uses the features of the fault tree analysis. The method is developed in a way that the increase of the network under consideration does not require significant increase of the model. The method is applied to small examples of network consisting of a small number of nodes and a small number of their connections. The results give the network reliability. They identify equipment, which is to be carefully maintained in order that the network reliability is not reduced, and equipment, which is a candidate for redundancy, as this would improve network reliability significantly. (author)

Impact of Entertainment Motivational Drivers on User Acceptance of Online Social Network Banner Advertising: A Gratification Perspective

Directory of Open Access Journals (Sweden)

Mir Imran Anwar

2017-05-01

Full Text Available Social media has phenomenally changed the communication landscape. Particularly social network sites have received enormous popularity and user acceptance globally. The business model of many social network sites is based on advertising. The survival of these social network sites depends on the user acceptance of advertising appearing on these websites. Users usually accept the advertising which is consistent with their motivations for using social network sites. The current study examines the underlying dimensions of entertainment motivation for using social network sites and their impact on user acceptance of social network advertising. Analysis of data from 450 university students show entertainment motivation for using social network sites a multidimensional (SNSs construct consisting of enjoyment, social escapism, relaxation and pass time factors. Furthermore, the results exhibit that SNSs entertainment motivation partially impacts user acceptance of social network advertising.

Detection of protein complex from protein-protein interaction network using Markov clustering

International Nuclear Information System (INIS)

Ochieng, P J; Kusuma, W A; Haryanto, T

2017-01-01

Detection of complexes, or groups of functionally related proteins, is an important challenge while analysing biological networks. However, existing algorithms to identify protein complexes are insufficient when applied to dense networks of experimentally derived interaction data. Therefore, we introduced a graph clustering method based on Markov clustering algorithm to identify protein complex within highly interconnected protein-protein interaction networks. Protein-protein interaction network was first constructed to develop geometrical network, the network was then partitioned using Markov clustering to detect protein complexes. The interest of the proposed method was illustrated by its application to Human Proteins associated to type II diabetes mellitus. Flow simulation of MCL algorithm was initially performed and topological properties of the resultant network were analysed for detection of the protein complex. The results indicated the proposed method successfully detect an overall of 34 complexes with 11 complexes consisting of overlapping modules and 20 non-overlapping modules. The major complex consisted of 102 proteins and 521 interactions with cluster modularity and density of 0.745 and 0.101 respectively. The comparison analysis revealed MCL out perform AP, MCODE and SCPS algorithms with high clustering coefficient (0.751) network density and modularity index (0.630). This demonstrated MCL was the most reliable and efficient graph clustering algorithm for detection of protein complexes from PPI networks. (paper)

Aging and Network Properties: Stability Over Time and Links with Learning during Working Memory Training

Directory of Open Access Journals (Sweden)

Alexandru D. Iordan

2018-01-01

Full Text Available Growing evidence suggests that healthy aging affects the configuration of large-scale functional brain networks. This includes reducing network modularity and local efficiency. However, the stability of these effects over time and their potential role in learning remain poorly understood. The goal of the present study was to further clarify previously reported age effects on “resting-state” networks, to test their reliability over time, and to assess their relation to subsequent learning during training. Resting-state fMRI data from 23 young (YA and 20 older adults (OA were acquired in 2 sessions 2 weeks apart. Graph-theoretic analyses identified both consistencies in network structure and differences in module composition between YA and OA, suggesting topological changes and less stability of functional network configuration with aging. Brain-wide, OA showed lower modularity and local efficiency compared to YA, consistent with the idea of age-related functional dedifferentiation, and these effects were replicable over time. At the level of individual networks, OA consistently showed greater participation and lower local efficiency and within-network connectivity in the cingulo-opercular network, as well as lower intra-network connectivity in the default-mode network and greater participation of the somato-sensorimotor network, suggesting age-related differential effects at the level of specialized brain modules. Finally, brain-wide network properties showed associations, albeit limited, with learning rates, as assessed with 10 days of computerized working memory training administered after the resting-state sessions, suggesting that baseline network configuration may influence subsequent learning outcomes. Identification of neural mechanisms associated with learning-induced plasticity is important for further clarifying whether and how such changes predict the magnitude and maintenance of training gains, as well as the extent and limits of

Creating wi-fi bluetooth mesh network for crisis management applications

Science.gov (United States)

Al-Tekreeti, Safa; Adams, Christopher; Al-Jawad, Naseer

2010-04-01

This paper proposes a wireless mesh network implementation consisting of both Wi-Fi Ad-Hoc networks as well as Bluetooth Piconet/Scatternet networks, organised in an energy and throughput efficient structure. This type of networks can be easily constructed for Crises management applications, for example in an Earthquake disaster. The motivation of this research is to form mesh network from the mass availability of WiFi and Bluetooth enabled electronic devices such as mobile phones and PC's that are normally present in most regions were major crises occurs. The target of this study is to achieve an effective solution that will enable Wi-Fi and/or Bluetooth nodes to seamlessly configure themselves to act as a bridge between their own network and that of the other network to achieve continuous routing for our proposed mesh networks.

Mathematical model for spreading dynamics of social network worms

International Nuclear Information System (INIS)

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

2012-01-01

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

Automatic selection of resting-state networks with functional magnetic resonance imaging

Directory of Open Access Journals (Sweden)

Silvia Francesca eStorti

2013-05-01

Full Text Available Functional magnetic resonance imaging (fMRI during a resting-state condition can reveal the co-activation of specific brain regions in distributed networks, called resting-state networks, which are selected by independent component analysis (ICA of the fMRI data. One of the major difficulties with component analysis is the automatic selection of the ICA features related to brain activity. In this study we describe a method designed to automatically select networks of potential functional relevance, specifically, those regions known to be involved in motor function, visual processing, executive functioning, auditory processing, memory, and the default-mode network. To do this, image analysis was based on probabilistic ICA as implemented in FSL software. After decomposition, the optimal number of components was selected by applying a novel algorithm which takes into account, for each component, Pearson's median coefficient of skewness of the spatial maps generated by FSL, followed by clustering, segmentation, and spectral analysis. To evaluate the performance of the approach, we investigated the resting-state networks in 25 subjects. For each subject, three resting-state scans were obtained with a Siemens Allegra 3 T scanner (NYU data set. Comparison of the visually and the automatically identified neuronal networks showed that the algorithm had high accuracy (first scan: 95%, second scan: 95%, third scan: 93% and precision (90%, 90%, 84%. The reproducibility of the networks for visual and automatic selection was very close: it was highly consistent in each subject for the default-mode network (≥ 92% and the occipital network, which includes the medial visual cortical areas (≥ 94%, and consistent for the attention network (≥ 80%, the right and/or left lateralized frontoparietal attention networks, and the temporal-motor network (≥ 80%. The automatic selection method may be used to detect neural networks and reduce subjectivity in ICA

Quantum logic networks for probabilistic teleportation

Institute of Scientific and Technical Information of China (English)

刘金明; 张永生; 等

2003-01-01

By eans of the primitive operations consisting of single-qubit gates.two-qubit controlled-not gates,Von Neuman measurement and classically controlled operations.,we construct efficient quantum logic networks for implementing probabilistic teleportation of a single qubit,a two-particle entangled state,and an N-particle entanglement.Based on the quantum networks,we show that after the partially entangled states are concentrated into maximal entanglement,the above three kinds of probabilistic teleportation are the same as the standard teleportation using the corresponding maximally entangled states as the quantum channels.

Consistent framework data for modeling and formation of scenarios in the Federal Environment Office; Konsistente Rahmendaten fuer Modellierungen und Szenariobildung im Umweltbundesamt

Energy Technology Data Exchange (ETDEWEB)

Weimer-Jehle, Wolfgang; Wassermann, Sandra; Kosow, Hannah [Internationales Zentrum fuer Kultur- und Technikforschung an der Univ. Stuttgart (Germany). ZIRN Interdisziplinaerer Forschungsschwerpunkt Risiko und Nachhaltige Technikentwicklung

2011-04-15

Model-based environmental scenarios normally require multiple framework assumptions regarding future social, political and economic developments (external developments). In most cases these framework assumptions are highly uncertain. Furthermore, different external developments are not isolated from each other and their interdependences can be described by qualitative judgments only. If the internal consistency of framework assumptions is not methodologically addressed, environmental models risk to be based on inconsistent combinations of framework assumptions which do not reflect existing relations between the respective factors in an appropriate way. This report aims at demonstrating how consistent context scenarios can be developed with the help of the cross-impact balance analysis (CIB). This method allows not only for the internal consistency of framework assumptions of a single model but also for the overall consistency of framework assumptions of modeling instruments, supporting the integrated interpretation of the results of different models. In order to demonstrate the method, in a first step, ten common framework assumptions were chosen and their possible future developments until 2030 were described. In a second step, a qualitative impact network was developed based on expert elicitation. The impact network provided the basis for a qualitative but systematic analysis of the internal consistency of combinations of framework assumptions. This analysis was carried out with the CIB-method and resulted in a set of consistent context scenarios. These scenarios can be used as an informative background for defining framework assumptions for environmental models at the UBA. (orig.)

Wireless Sensing Node Network Management for Monitoring Landslide Disaster

International Nuclear Information System (INIS)

Takayama, S; Akiyama, J; Fujiki, T; Mokhtar, N A B

2013-01-01

This paper shows the network management and operation to monitor landslide disaster at slop of mountain and hill. Natural disasters damage a measuring system easily. It is necessary for the measuring system to be flexible and robust. The measuring network proposed in this paper is the telemetry system consisted of host system (HS) and local sensing nodes network system (LSNNS). LSNNS operates autonomously and sometimes is controlled by commands from HS. HS collects data/information of landslide disaster from LSNNS, and controls LSNNS remotely. HS and LSNNS are communicated by using 'cloud' system. The dual communication is very effective and convenient to manage a network system operation

Rational design of functional and tunable oscillating enzymatic networks

Science.gov (United States)

Semenov, Sergey N.; Wong, Albert S. Y.; van der Made, R. Martijn; Postma, Sjoerd G. J.; Groen, Joost; van Roekel, Hendrik W. H.; de Greef, Tom F. A.; Huck, Wilhelm T. S.

2015-02-01

Life is sustained by complex systems operating far from equilibrium and consisting of a multitude of enzymatic reaction networks. The operating principles of biology's regulatory networks are known, but the in vitro assembly of out-of-equilibrium enzymatic reaction networks has proved challenging, limiting the development of synthetic systems showing autonomous behaviour. Here, we present a strategy for the rational design of programmable functional reaction networks that exhibit dynamic behaviour. We demonstrate that a network built around autoactivation and delayed negative feedback of the enzyme trypsin is capable of producing sustained oscillating concentrations of active trypsin for over 65 h. Other functions, such as amplification, analog-to-digital conversion and periodic control over equilibrium systems, are obtained by linking multiple network modules in microfluidic flow reactors. The methodology developed here provides a general framework to construct dissipative, tunable and robust (bio)chemical reaction networks.

Reconstructing Genetic Regulatory Networks Using Two-Step Algorithms with the Differential Equation Models of Neural Networks.

Science.gov (United States)

Chen, Chi-Kan

2017-07-26

The identification of genetic regulatory networks (GRNs) provides insights into complex cellular processes. A class of recurrent neural networks (RNNs) captures the dynamics of GRN. Algorithms combining the RNN and machine learning schemes were proposed to reconstruct small-scale GRNs using gene expression time series. We present new GRN reconstruction methods with neural networks. The RNN is extended to a class of recurrent multilayer perceptrons (RMLPs) with latent nodes. Our methods contain two steps: the edge rank assignment step and the network construction step. The former assigns ranks to all possible edges by a recursive procedure based on the estimated weights of wires of RNN/RMLP (RE RNN /RE RMLP ), and the latter constructs a network consisting of top-ranked edges under which the optimized RNN simulates the gene expression time series. The particle swarm optimization (PSO) is applied to optimize the parameters of RNNs and RMLPs in a two-step algorithm. The proposed RE RNN -RNN and RE RMLP -RNN algorithms are tested on synthetic and experimental gene expression time series of small GRNs of about 10 genes. The experimental time series are from the studies of yeast cell cycle regulated genes and E. coli DNA repair genes. The unstable estimation of RNN using experimental time series having limited data points can lead to fairly arbitrary predicted GRNs. Our methods incorporate RNN and RMLP into a two-step structure learning procedure. Results show that the RE RMLP using the RMLP with a suitable number of latent nodes to reduce the parameter dimension often result in more accurate edge ranks than the RE RNN using the regularized RNN on short simulated time series. Combining by a weighted majority voting rule the networks derived by the RE RMLP -RNN using different numbers of latent nodes in step one to infer the GRN, the method performs consistently and outperforms published algorithms for GRN reconstruction on most benchmark time series. The framework of two

Multi-objective ant algorithm for wireless sensor network positioning

International Nuclear Information System (INIS)

Fidanova, S.; Shindarov, M.; Marinov, P.

2013-01-01

It is impossible to imagine our modern life without telecommunications. Wireless networks are a part of telecommunications. Wireless sensor networks (WSN) consist of spatially distributed sensors, which communicate in wireless way. This network monitors physical or environmental conditions. The objective is the full coverage of the monitoring region and less energy consumption of the network. The most appropriate approach to solve the problem is metaheuristics. In this paper the full coverage of the area is treated as a constrain. The objectives which are optimized are a minimal number of sensors and energy (lifetime) of the network. We apply multi-objective Ant Colony Optimization to solve this important telecommunication problem. We chose MAX-MIN Ant System approach, because it is proven to converge to the global optima

Measuring process and knowledge consistency

DEFF Research Database (Denmark)

Edwards, Kasper; Jensen, Klaes Ladeby; Haug, Anders

2007-01-01

When implementing configuration systems, knowledge about products and processes are documented and replicated in the configuration system. This practice assumes that products are specified consistently i.e. on the same rule base and likewise for processes. However, consistency cannot be taken...... for granted; rather the contrary, and attempting to implement a configuration system may easily ignite a political battle. This is because stakes are high in the sense that the rules and processes chosen may only reflect one part of the practice, ignoring a majority of the employees. To avoid this situation......, this paper presents a methodology for measuring product and process consistency prior to implementing a configuration system. The methodology consists of two parts: 1) measuring knowledge consistency and 2) measuring process consistency. Knowledge consistency is measured by developing a questionnaire...

Energy flow models for the estimation of technical losses in distribution network

International Nuclear Information System (INIS)

Au, Mau Teng; Tan, Chin Hooi

2013-01-01

This paper presents energy flow models developed to estimate technical losses in distribution network. Energy flow models applied in this paper is based on input energy and peak demand of distribution network, feeder length and peak demand, transformer loading capacity, and load factor. Two case studies, an urban distribution network and a rural distribution network are used to illustrate application of the energy flow models. Results on technical losses obtained for the two distribution networks are consistent and comparable to network of similar types and characteristics. Hence, the energy flow models are suitable for practical application.

Competition between global and local online social networks

Science.gov (United States)

Kleineberg, Kaj-Kolja; Boguñá, Marián

2016-04-01

The overwhelming success of online social networks, the key actors in the Web 2.0 cosmos, has reshaped human interactions globally. To help understand the fundamental mechanisms which determine the fate of online social networks at the system level, we describe the digital world as a complex ecosystem of interacting networks. In this paper, we study the impact of heterogeneity in network fitnesses on the competition between an international network, such as Facebook, and local services. The higher fitness of international networks is induced by their ability to attract users from all over the world, which can then establish social interactions without the limitations of local networks. In other words, inter-country social ties lead to increased fitness of the international network. To study the competition between an international network and local ones, we construct a 1:1000 scale model of the digital world, consisting of the 80 countries with the most Internet users. Under certain conditions, this leads to the extinction of local networks; whereas under different conditions, local networks can persist and even dominate completely. In particular, our model suggests that, with the parameters that best reproduce the empirical overtake of Facebook, this overtake could have not taken place with a significant probability.

Competition between global and local online social networks.

Science.gov (United States)

Kleineberg, Kaj-Kolja; Boguñá, Marián

2016-04-27

The overwhelming success of online social networks, the key actors in the Web 2.0 cosmos, has reshaped human interactions globally. To help understand the fundamental mechanisms which determine the fate of online social networks at the system level, we describe the digital world as a complex ecosystem of interacting networks. In this paper, we study the impact of heterogeneity in network fitnesses on the competition between an international network, such as Facebook, and local services. The higher fitness of international networks is induced by their ability to attract users from all over the world, which can then establish social interactions without the limitations of local networks. In other words, inter-country social ties lead to increased fitness of the international network. To study the competition between an international network and local ones, we construct a 1:1000 scale model of the digital world, consisting of the 80 countries with the most Internet users. Under certain conditions, this leads to the extinction of local networks; whereas under different conditions, local networks can persist and even dominate completely. In particular, our model suggests that, with the parameters that best reproduce the empirical overtake of Facebook, this overtake could have not taken place with a significant probability.

OPTIMAL NETWORK TOPOLOGY DESIGN

Science.gov (United States)

Yuen, J. H.

1994-01-01

This program was developed as part of a research study on the topology design and performance analysis for the Space Station Information System (SSIS) network. It uses an efficient algorithm to generate candidate network designs (consisting of subsets of the set of all network components) in increasing order of their total costs, and checks each design to see if it forms an acceptable network. This technique gives the true cost-optimal network, and is particularly useful when the network has many constraints and not too many components. It is intended that this new design technique consider all important performance measures explicitly and take into account the constraints due to various technical feasibilities. In the current program, technical constraints are taken care of by the user properly forming the starting set of candidate components (e.g. nonfeasible links are not included). As subsets are generated, they are tested to see if they form an acceptable network by checking that all requirements are satisfied. Thus the first acceptable subset encountered gives the cost-optimal topology satisfying all given constraints. The user must sort the set of "feasible" link elements in increasing order of their costs. The program prompts the user for the following information for each link: 1) cost, 2) connectivity (number of stations connected by the link), and 3) the stations connected by that link. Unless instructed to stop, the program generates all possible acceptable networks in increasing order of their total costs. The program is written only to generate topologies that are simply connected. Tests on reliability, delay, and other performance measures are discussed in the documentation, but have not been incorporated into the program. This program is written in PASCAL for interactive execution and has been implemented on an IBM PC series computer operating under PC DOS. The disk contains source code only. This program was developed in 1985.

Fault-Tolerant Topology Selection for TTEthernet Networks

DEFF Research Database (Denmark)

Gavrilut, Voica Maria; Tamas-Selicean, Domitian; Pop, Paul

2015-01-01

Many safety-critical real-time applications are implemented using distributed architectures, composed of heterogeneous processing elements (PEs) interconnected in a network. In this paper, we are interested in the TTEthernet protocol, which is a deterministic, synchronized and congestion-free net......Many safety-critical real-time applications are implemented using distributed architectures, composed of heterogeneous processing elements (PEs) interconnected in a network. In this paper, we are interested in the TTEthernet protocol, which is a deterministic, synchronized and congestion......-free network protocol based on the IEEE 802.3 Ethernet standard and compliant with ARINC 664p7. TTEthernet supports three types of traffic: static time-triggered (TT) traffic and dynamic traffic, which is further subdivided into Rate Constrained (RC) traffic that has bounded end-to-end latencies, and Best...... a fault-tolerant network topology, consisting of redundant physical links and network switches, such that the architecture cost is minimized, the applications are fault-tolerant to a given number of permanent faults occurring in the communication network, and the timing constraints of the TT and RC...

Artificial neural network intelligent method for prediction

Science.gov (United States)

Trifonov, Roumen; Yoshinov, Radoslav; Pavlova, Galya; Tsochev, Georgi

2017-09-01

Accounting and financial classification and prediction problems are high challenge and researchers use different methods to solve them. Methods and instruments for short time prediction of financial operations using artificial neural network are considered. The methods, used for prediction of financial data as well as the developed forecasting system with neural network are described in the paper. The architecture of a neural network used four different technical indicators, which are based on the raw data and the current day of the week is presented. The network developed is used for forecasting movement of stock prices one day ahead and consists of an input layer, one hidden layer and an output layer. The training method is algorithm with back propagation of the error. The main advantage of the developed system is self-determination of the optimal topology of neural network, due to which it becomes flexible and more precise The proposed system with neural network is universal and can be applied to various financial instruments using only basic technical indicators as input data.

Information diffusion in structured online social networks

Science.gov (United States)

Li, Pei; Zhang, Yini; Qiao, Fengcai; Wang, Hui

2015-05-01

Nowadays, due to the word-of-mouth effect, online social networks have been considered to be efficient approaches to conduct viral marketing, which makes it of great importance to understand the diffusion dynamics in online social networks. However, most research on diffusion dynamics in epidemiology and existing social networks cannot be applied directly to characterize online social networks. In this paper, we propose models to characterize the information diffusion in structured online social networks with push-based forwarding mechanism. We introduce the term user influence to characterize the average number of times that messages are browsed which is incurred by a given type user generating a message, and study the diffusion threshold, above which the user influence of generating a message will approach infinity. We conduct simulations and provide the simulation results, which are consistent with the theoretical analysis results perfectly. These results are of use in understanding the diffusion dynamics in online social networks and also critical for advertisers in viral marketing who want to estimate the user influence before posting an advertisement.

A Multi-Hop Energy Neutral Clustering Algorithm for Maximizing Network Information Gathering in Energy Harvesting Wireless Sensor Networks.

Science.gov (United States)

Yang, Liu; Lu, Yinzhi; Zhong, Yuanchang; Wu, Xuegang; Yang, Simon X

2015-12-26

Energy resource limitation is a severe problem in traditional wireless sensor networks (WSNs) because it restricts the lifetime of network. Recently, the emergence of energy harvesting techniques has brought with them the expectation to overcome this problem. In particular, it is possible for a sensor node with energy harvesting abilities to work perpetually in an Energy Neutral state. In this paper, a Multi-hop Energy Neutral Clustering (MENC) algorithm is proposed to construct the optimal multi-hop clustering architecture in energy harvesting WSNs, with the goal of achieving perpetual network operation. All cluster heads (CHs) in the network act as routers to transmit data to base station (BS) cooperatively by a multi-hop communication method. In addition, by analyzing the energy consumption of intra- and inter-cluster data transmission, we give the energy neutrality constraints. Under these constraints, every sensor node can work in an energy neutral state, which in turn provides perpetual network operation. Furthermore, the minimum network data transmission cycle is mathematically derived using convex optimization techniques while the network information gathering is maximal. Simulation results show that our protocol can achieve perpetual network operation, so that the consistent data delivery is guaranteed. In addition, substantial improvements on the performance of network throughput are also achieved as compared to the famous traditional clustering protocol LEACH and recent energy harvesting aware clustering protocols.

A Multi-Hop Energy Neutral Clustering Algorithm for Maximizing Network Information Gathering in Energy Harvesting Wireless Sensor Networks

Directory of Open Access Journals (Sweden)

Liu Yang

2015-12-01

Full Text Available Energy resource limitation is a severe problem in traditional wireless sensor networks (WSNs because it restricts the lifetime of network. Recently, the emergence of energy harvesting techniques has brought with them the expectation to overcome this problem. In particular, it is possible for a sensor node with energy harvesting abilities to work perpetually in an Energy Neutral state. In this paper, a Multi-hop Energy Neutral Clustering (MENC algorithm is proposed to construct the optimal multi-hop clustering architecture in energy harvesting WSNs, with the goal of achieving perpetual network operation. All cluster heads (CHs in the network act as routers to transmit data to base station (BS cooperatively by a multi-hop communication method. In addition, by analyzing the energy consumption of intra- and inter-cluster data transmission, we give the energy neutrality constraints. Under these constraints, every sensor node can work in an energy neutral state, which in turn provides perpetual network operation. Furthermore, the minimum network data transmission cycle is mathematically derived using convex optimization techniques while the network information gathering is maximal. Simulation results show that our protocol can achieve perpetual network operation, so that the consistent data delivery is guaranteed. In addition, substantial improvements on the performance of network throughput are also achieved as compared to the famous traditional clustering protocol LEACH and recent energy harvesting aware clustering protocols.

The Simultaneous Effects of Spatial and Social Networks on Cholera Transmission

Directory of Open Access Journals (Sweden)

Sophia Giebultowicz

2011-01-01

Full Text Available This study uses social network and spatial analytical methods simultaneously to understand cholera transmission in rural Bangladesh. Both have been used separately to incorporate context into health studies, but using them together is a new and recent approach. Data include a spatially referenced longitudinal demographic database consisting of approximately 200,000 people and a database of all laboratory-confirmed cholera cases from 1983 to 2003. A complete kinship-based network linking households is created, and distance matrices are also constructed to model spatial relationships. A spatial error-social effects model tested for cholera clustering in socially linked households while accounting for spatial factors. Results show that there was social clustering in five out of twenty-one years while accounting for both known and unknown environmental variables. This suggests that environmental cholera transmission is significant and social networks also influence transmission, but not as consistently. Simultaneous spatial and social network analysis may improve understanding of disease transmission.

Software-defined optical network for metro-scale geographically distributed data centers.

Science.gov (United States)

Samadi, Payman; Wen, Ke; Xu, Junjie; Bergman, Keren

2016-05-30

The emergence of cloud computing and big data has rapidly increased the deployment of small and mid-sized data centers. Enterprises and cloud providers require an agile network among these data centers to empower application reliability and flexible scalability. We present a software-defined inter data center network to enable on-demand scale out of data centers on a metro-scale optical network. The architecture consists of a combined space/wavelength switching platform and a Software-Defined Networking (SDN) control plane equipped with a wavelength and routing assignment module. It enables establishing transparent and bandwidth-selective connections from L2/L3 switches, on-demand. The architecture is evaluated in a testbed consisting of 3 data centers, 5-25 km apart. We successfully demonstrated end-to-end bulk data transfer and Virtual Machine (VM) migrations across data centers with less than 100 ms connection setup time and close to full link capacity utilization.

Gender differences in working memory networks: a BrainMap meta-analysis.

Science.gov (United States)

Hill, Ashley C; Laird, Angela R; Robinson, Jennifer L

2014-10-01

Gender differences in psychological processes have been of great interest in a variety of fields. While the majority of research in this area has focused on specific differences in relation to test performance, this study sought to determine the underlying neurofunctional differences observed during working memory, a pivotal cognitive process shown to be predictive of academic achievement and intelligence. Using the BrainMap database, we performed a meta-analysis and applied activation likelihood estimation to our search set. Our results demonstrate consistent working memory networks across genders, but also provide evidence for gender-specific networks whereby females consistently activate more limbic (e.g., amygdala and hippocampus) and prefrontal structures (e.g., right inferior frontal gyrus), and males activate a distributed network inclusive of more parietal regions. These data provide a framework for future investigations using functional or effective connectivity methods to elucidate the underpinnings of gender differences in neural network recruitment during working memory tasks. Copyright © 2014 Elsevier B.V. All rights reserved.

Effective comparative analysis of protein-protein interaction networks by measuring the steady-state network flow using a Markov model.

Science.gov (United States)

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

2016-10-06

Comparative analysis of protein-protein interaction (PPI) networks provides an effective means of detecting conserved functional network modules across different species. Such modules typically consist of orthologous proteins with conserved interactions, which can be exploited to computationally predict the modules through network comparison. In this work, we propose a novel probabilistic framework for comparing PPI networks and effectively predicting the correspondence between proteins, represented as network nodes, that belong to conserved functional modules across the given PPI networks. The basic idea is to estimate the steady-state network flow between nodes that belong to different PPI networks based on a Markov random walk model. The random walker is designed to make random moves to adjacent nodes within a PPI network as well as cross-network moves between potential orthologous nodes with high sequence similarity. Based on this Markov random walk model, we estimate the steady-state network flow - or the long-term relative frequency of the transitions that the random walker makes - between nodes in different PPI networks, which can be used as a probabilistic score measuring their potential correspondence. Subsequently, the estimated scores can be used for detecting orthologous proteins in conserved functional modules through network alignment. Through evaluations based on multiple real PPI networks, we demonstrate that the proposed scheme leads to improved alignment results that are biologically more meaningful at reduced computational cost, outperforming the current state-of-the-art algorithms. The source code and datasets can be downloaded from http://www.ece.tamu.edu/~bjyoon/CUFID .

The Impact of Metagovernance on Local Governance Networks

DEFF Research Database (Denmark)

Damgaard, Bodil; Torfing, Jacob

2011-01-01

in which the municipality and a state agency shared responsibility for employment policy, while the other two were linked to jobcentres in which the municipality had full responsibility. We explore two types of metagovernance that the local governance networks were subject to: general, hands......This article analyses the impact of metagovernance on the functioning of local governance networks. It does so by comparing the functioning of four local governance networks in the field of local employment policy in Denmark. Between 2007 and 2009, two of these networks were linked to jobcentres......-off metagovernance consisting of the assignment of full responsibility to the municipality alone, or of shared responsibility to the municipality and the state jointly; and tailored and fine-tuned metagovernance directed towards only one or a few networks and their corresponding jobcentre(s). Our findings suggest...

On the origins of hierarchy in complex networks

Science.gov (United States)

Corominas-Murtra, Bernat; Goñi, Joaquín; Solé, Ricard V.; Rodríguez-Caso, Carlos

2013-01-01

Hierarchy seems to pervade complexity in both living and artificial systems. Despite its relevance, no general theory that captures all features of hierarchy and its origins has been proposed yet. Here we present a formal approach resulting from the convergence of theoretical morphology and network theory that allows constructing a 3D morphospace of hierarchies and hence comparing the hierarchical organization of ecological, cellular, technological, and social networks. Embedded within large voids in the morphospace of all possible hierarchies, four major groups are identified. Two of them match the expected from random networks with similar connectivity, thus suggesting that nonadaptive factors are at work. Ecological and gene networks define the other two, indicating that their topological order is the result of functional constraints. These results are consistent with an exploration of the morphospace, using in silico evolved networks. PMID:23898177

On the Consistent Migration of Unsplittable Flows

DEFF Research Database (Denmark)

Förster, Klaus-Tycho

2017-01-01

in an inherently asynchronous system, the switches distributed over the network. To this end, a multitude of scheduling systems have been proposed since the initial papers of Reitblatt et al. (Abstractions for Network Update, SIGCOMM ’12) and Hong et al. (SWAN, SIGCOMM ’13). While the the complexity...

Numerical simulation of coherent resonance in a model network of Rulkov neurons

Science.gov (United States)

Andreev, Andrey V.; Runnova, Anastasia E.; Pisarchik, Alexander N.

2018-04-01

In this paper we study the spiking behaviour of a neuronal network consisting of Rulkov elements. We find that the regularity of this behaviour maximizes at a certain level of environment noise. This effect referred to as coherence resonance is demonstrated in a random complex network of Rulkov neurons. An external stimulus added to some of neurons excites them, and then activates other neurons in the network. The network coherence is also maximized at the certain stimulus amplitude.

Quantized Synchronization of Chaotic Neural Networks With Scheduled Output Feedback Control.

Science.gov (United States)

Wan, Ying; Cao, Jinde; Wen, Guanghui

In this paper, the synchronization problem of master-slave chaotic neural networks with remote sensors, quantization process, and communication time delays is investigated. The information communication channel between the master chaotic neural network and slave chaotic neural network consists of several remote sensors, with each sensor able to access only partial knowledge of output information of the master neural network. At each sampling instants, each sensor updates its own measurement and only one sensor is scheduled to transmit its latest information to the controller's side in order to update the control inputs for the slave neural network. Thus, such communication process and control strategy are much more energy-saving comparing with the traditional point-to-point scheme. Sufficient conditions for output feedback control gain matrix, allowable length of sampling intervals, and upper bound of network-induced delays are derived to ensure the quantized synchronization of master-slave chaotic neural networks. Lastly, Chua's circuit system and 4-D Hopfield neural network are simulated to validate the effectiveness of the main results.In this paper, the synchronization problem of master-slave chaotic neural networks with remote sensors, quantization process, and communication time delays is investigated. The information communication channel between the master chaotic neural network and slave chaotic neural network consists of several remote sensors, with each sensor able to access only partial knowledge of output information of the master neural network. At each sampling instants, each sensor updates its own measurement and only one sensor is scheduled to transmit its latest information to the controller's side in order to update the control inputs for the slave neural network. Thus, such communication process and control strategy are much more energy-saving comparing with the traditional point-to-point scheme. Sufficient conditions for output feedback control

Aligning Biomolecular Networks Using Modular Graph Kernels

Science.gov (United States)

Towfic, Fadi; Greenlee, M. Heather West; Honavar, Vasant

Comparative analysis of biomolecular networks constructed using measurements from different conditions, tissues, and organisms offer a powerful approach to understanding the structure, function, dynamics, and evolution of complex biological systems. We explore a class of algorithms for aligning large biomolecular networks by breaking down such networks into subgraphs and computing the alignment of the networks based on the alignment of their subgraphs. The resulting subnetworks are compared using graph kernels as scoring functions. We provide implementations of the resulting algorithms as part of BiNA, an open source biomolecular network alignment toolkit. Our experiments using Drosophila melanogaster, Saccharomyces cerevisiae, Mus musculus and Homo sapiens protein-protein interaction networks extracted from the DIP repository of protein-protein interaction data demonstrate that the performance of the proposed algorithms (as measured by % GO term enrichment of subnetworks identified by the alignment) is competitive with some of the state-of-the-art algorithms for pair-wise alignment of large protein-protein interaction networks. Our results also show that the inter-species similarity scores computed based on graph kernels can be used to cluster the species into a species tree that is consistent with the known phylogenetic relationships among the species.

Detection of network attacks based on adaptive resonance theory

Science.gov (United States)

Bukhanov, D. G.; Polyakov, V. M.

2018-05-01

The paper considers an approach to intrusion detection systems using a neural network of adaptive resonant theory. It suggests the structure of an intrusion detection system consisting of two types of program modules. The first module manages connections of user applications by preventing the undesirable ones. The second analyzes the incoming network traffic parameters to check potential network attacks. After attack detection, it notifies the required stations using a secure transmission channel. The paper describes the experiment on the detection and recognition of network attacks using the test selection. It also compares the obtained results with similar experiments carried out by other authors. It gives findings and conclusions on the sufficiency of the proposed approach. The obtained information confirms the sufficiency of applying the neural networks of adaptive resonant theory to analyze network traffic within the intrusion detection system.

Topology Counts: Force Distributions in Circular Spring Networks

Science.gov (United States)

Heidemann, Knut M.; Sageman-Furnas, Andrew O.; Sharma, Abhinav; Rehfeldt, Florian; Schmidt, Christoph F.; Wardetzky, Max

2018-02-01

Filamentous polymer networks govern the mechanical properties of many biological materials. Force distributions within these networks are typically highly inhomogeneous, and, although the importance of force distributions for structural properties is well recognized, they are far from being understood quantitatively. Using a combination of probabilistic and graph-theoretical techniques, we derive force distributions in a model system consisting of ensembles of random linear spring networks on a circle. We show that characteristic quantities, such as the mean and variance of the force supported by individual springs, can be derived explicitly in terms of only two parameters: (i) average connectivity and (ii) number of nodes. Our analysis shows that a classical mean-field approach fails to capture these characteristic quantities correctly. In contrast, we demonstrate that network topology is a crucial determinant of force distributions in an elastic spring network. Our results for 1D linear spring networks readily generalize to arbitrary dimensions.

Topology Counts: Force Distributions in Circular Spring Networks.

Science.gov (United States)

Heidemann, Knut M; Sageman-Furnas, Andrew O; Sharma, Abhinav; Rehfeldt, Florian; Schmidt, Christoph F; Wardetzky, Max

2018-02-09

Filamentous polymer networks govern the mechanical properties of many biological materials. Force distributions within these networks are typically highly inhomogeneous, and, although the importance of force distributions for structural properties is well recognized, they are far from being understood quantitatively. Using a combination of probabilistic and graph-theoretical techniques, we derive force distributions in a model system consisting of ensembles of random linear spring networks on a circle. We show that characteristic quantities, such as the mean and variance of the force supported by individual springs, can be derived explicitly in terms of only two parameters: (i) average connectivity and (ii) number of nodes. Our analysis shows that a classical mean-field approach fails to capture these characteristic quantities correctly. In contrast, we demonstrate that network topology is a crucial determinant of force distributions in an elastic spring network. Our results for 1D linear spring networks readily generalize to arbitrary dimensions.

Experimental and computational analysis of a large protein network that controls fat storage reveals the design principles of a signaling network.

Directory of Open Access Journals (Sweden)

Bader Al-Anzi

2015-05-01

Full Text Available An approach combining genetic, proteomic, computational, and physiological analysis was used to define a protein network that regulates fat storage in budding yeast (Saccharomyces cerevisiae. A computational analysis of this network shows that it is not scale-free, and is best approximated by the Watts-Strogatz model, which generates "small-world" networks with high clustering and short path lengths. The network is also modular, containing energy level sensing proteins that connect to four output processes: autophagy, fatty acid synthesis, mRNA processing, and MAP kinase signaling. The importance of each protein to network function is dependent on its Katz centrality score, which is related both to the protein's position within a module and to the module's relationship to the network as a whole. The network is also divisible into subnetworks that span modular boundaries and regulate different aspects of fat metabolism. We used a combination of genetics and pharmacology to simultaneously block output from multiple network nodes. The phenotypic results of this blockage define patterns of communication among distant network nodes, and these patterns are consistent with the Watts-Strogatz model.

Spoken Word Recognition and Serial Recall of Words from Components in the Phonological Network

Science.gov (United States)

Siew, Cynthia S. Q.; Vitevitch, Michael S.

2016-01-01

Network science uses mathematical techniques to study complex systems such as the phonological lexicon (Vitevitch, 2008). The phonological network consists of a "giant component" (the largest connected component of the network) and "lexical islands" (smaller groups of words that are connected to each other, but not to the giant…

Views on personal networks and business opportunities

DEFF Research Database (Denmark)

Windekilde, Iwona Maria; Roswall, Rune

2009-01-01

opportunities. The aim has been to examine new business opportunities PNs. This work consists of three main elements: a) classification and categorisation of different business opportunity areas, b) an overview of relevant Industry trends, c) explanation of stakeholder opportunities and the strategies......The EU project MAGNET-Beyond has examined the business opportunities regarding Personal Networks (PN) for the typical value network stakeholders. In the current communication markets, companies deliver services to customers in cooperation with other market players profiting on different business...

A fusion network for semantic segmentation using RGB-D data

Science.gov (United States)

Yuan, Jiahui; Zhang, Kun; Xia, Yifan; Qi, Lin; Dong, Junyu

2018-04-01

Semantic scene parsing is considerable in many intelligent field, including perceptual robotics. For the past few years, pixel-wise prediction tasks like semantic segmentation with RGB images has been extensively studied and has reached very remarkable parsing levels, thanks to convolutional neural networks (CNNs) and large scene datasets. With the development of stereo cameras and RGBD sensors, it is expected that additional depth information will help improving accuracy. In this paper, we propose a semantic segmentation framework incorporating RGB and complementary depth information. Motivated by the success of fully convolutional networks (FCN) in semantic segmentation field, we design a fully convolutional networks consists of two branches which extract features from both RGB and depth data simultaneously and fuse them as the network goes deeper. Instead of aggregating multiple model, our goal is to utilize RGB data and depth data more effectively in a single model. We evaluate our approach on the NYU-Depth V2 dataset, which consists of 1449 cluttered indoor scenes, and achieve competitive results with the state-of-the-art methods.

The Canarian Seismic Monitoring Network: design, development and first result

Science.gov (United States)

D'Auria, Luca; Barrancos, José; Padilla, Germán D.; García-Hernández, Rubén; Pérez, Aaron; Pérez, Nemesio M.

2017-04-01

Tenerife is an active volcanic island which experienced several eruptions of moderate intensity in historical times, and few explosive eruptions in the Holocene. The increasing population density and the consistent number of tourists are constantly raising the volcanic risk. In June 2016 Instituto Volcanologico de Canarias started the deployment of a seismological volcano monitoring network consisting of 15 broadband seismic stations. The network began its full operativity in November 2016. The aim of the network are both volcano monitoring and scientific research. Currently data are continuously recorded and processed in real-time. Seismograms, hypocentral parameters, statistical informations about the seismicity and other data are published on a web page. We show the technical characteristics of the network and an estimate of its detection threshold and earthquake location performances. Furthermore we present other near-real time procedures on the data: analysis of the ambient noise for determining the shallow velocity model and temporal velocity variations, detection of earthquake multiplets through massive data mining of the seismograms and automatic relocation of events through double-difference location.

Processing of seismic signals from a seismometer network

International Nuclear Information System (INIS)

Key, F.A.; Warburton, P.J.

1983-08-01

A description is given of the Seismometer Network Analysis Computer (SNAC) which processes short period data from a network of seismometers (UKNET). The nine stations of the network are distributed throughout the UK and their outputs are transmitted to a control laboratory (Blacknest) where SNAC monitors the data for seismic signals. The computer gives an estimate of the source location of the detected signals and stores the waveforms. The detection logic is designed to maintain high sensitivity without excessive ''false alarms''. It is demonstrated that the system is able to detect seismic signals at an amplitude level consistent with a network of single stations and, within the limitations of signal onset time measurements made by machine, can locate the source of the seismic disturbance. (author)

Analysis of critical operating conditions for LV distribution networks with microgrids

Science.gov (United States)

Zehir, M. A.; Batman, A.; Sonmez, M. A.; Font, A.; Tsiamitros, D.; Stimoniaris, D.; Kollatou, T.; Bagriyanik, M.; Ozdemir, A.; Dialynas, E.

2016-11-01

Increase in the penetration of Distributed Generation (DG) in distribution networks, raises the risk of voltage limit violations while contributing to line losses. Especially in low voltage (LV) distribution networks (secondary distribution networks), impacts of active power flows on the bus voltages and on the network losses are more dominant. As network operators must meet regulatory limitations, they have to take into account the most critical operating conditions in their systems. In this study, it is aimed to present the impact of the worst operation cases of LV distribution networks comprising microgrids. Simulation studies are performed on a field data-based virtual test-bed. The simulations are repeated for several cases consisting different microgrid points of connection with different network loading and microgrid supply/demand conditions.

Application of GPS in a high precision engineering survey network

International Nuclear Information System (INIS)

Ruland, R.; Leick, A.

1985-04-01

A GPS satellite survey was carried out with the Macrometer to support construction at the Stanford Linear Accelerator Center (SLAC). The network consists of 16 stations of which 9 stations were part of the Macrometer network. The horizontal and vertical accuracy of the GPS survey is estimated to be 1 to 2 mm and 2 to 3 mm respectively. The horizontal accuracy of the terrestrial survey, consisting of angles and distances, equals that of the GPS survey only in the ''loop'' portion of the network. All stations are part of a precise level network. The ellipsoidal heights obtained from the GPS survey and the orthometric heights of the level network are used to compute geoid undulations. A geoid profile along the linac was computed by the National Geodetic Survey in 1963. This profile agreed with the observed geoid within the standard deviation of the GPS survey. Angles and distances were adjusted together (TERRA), and all terrestrial observations were combined with the GPS vector observations in a combination adjustment (COMB). A comparison of COMB and TERRA revealed systematic errors in the terrestrial solution. A scale factor of 1.5 ppM +- .8 ppM was estimated. This value is of the same magnitude as the over-all horizontal accuracy of both networks. 10 refs., 3 figs., 5 tabs

Distributed Data Networks That Support Public Health Information Needs.

Science.gov (United States)

Tabano, David C; Cole, Elizabeth; Holve, Erin; Davidson, Arthur J

Data networks, consisting of pooled electronic health data assets from health care providers serving different patient populations, promote data sharing, population and disease monitoring, and methods to assess interventions. Better understanding of data networks, and their capacity to support public health objectives, will help foster partnerships, expand resources, and grow learning health systems. We conducted semistructured interviews with 16 key informants across the United States, identified as network stakeholders based on their respective experience in advancing health information technology and network functionality. Key informants were asked about their experience with and infrastructure used to develop data networks, including each network's utility to identify and characterize populations, usage, and sustainability. Among 11 identified data networks representing hundreds of thousands of patients, key informants described aggregated health care clinical data contributing to population health measures. Key informant interview responses were thematically grouped to illustrate how networks support public health, including (1) infrastructure and information sharing; (2) population health measures; and (3) network sustainability. Collaboration between clinical data networks and public health entities presents an opportunity to leverage infrastructure investments to support public health. Data networks can provide resources to enhance population health information and infrastructure.

Reference Architecture for Multi-Layer Software Defined Optical Data Center Networks

Directory of Open Access Journals (Sweden)

Casimer DeCusatis

2015-09-01

Full Text Available As cloud computing data centers grow larger and networking devices proliferate; many complex issues arise in the network management architecture. We propose a framework for multi-layer; multi-vendor optical network management using open standards-based software defined networking (SDN. Experimental results are demonstrated in a test bed consisting of three data centers interconnected by a 125 km metropolitan area network; running OpenStack with KVM and VMW are components. Use cases include inter-data center connectivity via a packet-optical metropolitan area network; intra-data center connectivity using an optical mesh network; and SDN coordination of networking equipment within and between multiple data centers. We create and demonstrate original software to implement virtual network slicing and affinity policy-as-a-service offerings. Enhancements to synchronous storage backup; cloud exchanges; and Fibre Channel over Ethernet topologies are also discussed.

Predicting economic growth with stock networks

Science.gov (United States)

Heiberger, Raphael H.

2018-01-01

Networks derived from stock prices are often used to model developments on financial markets and are tightly intertwined with crises. Yet, the influence of changing market topologies on the broader economy (i.e. GDP) is unclear. In this paper, we propose a Bayesian approach that utilizes individual-level network measures of companies as lagged probabilistic features to predict national economic growth. We use a comprehensive data set consisting of Standard and Poor's 500 corporations from January 1988 until October 2016. The final model forecasts correctly all major recession and prosperity phases of the U.S. economy up to one year ahead. By employing different network measures on the level of corporations, we can also identify which companies' stocks possess a key role in a changing economic environment and may be used as indication of critical (and prosperous) developments. More generally, the proposed approach allows to predict probabilities for different overall states of social entities by using local network positions and could be applied on various phenomena.

Pheromone Static Routing Strategy for Complex Networks

Science.gov (United States)

Hu, Mao-Bin; Henry, Y. K. Lau; Ling, Xiang; Jiang, Rui

2012-12-01

We adopt the concept of using pheromones to generate a set of static paths that can reach the performance of global dynamic routing strategy [Phys. Rev. E 81 (2010) 016113]. The path generation method consists of two stages. In the first stage, a pheromone is dropped to the nodes by packets forwarded according to the global dynamic routing strategy. In the second stage, pheromone static paths are generated according to the pheromone density. The output paths can greatly improve traffic systems' overall capacity on different network structures, including scale-free networks, small-world networks and random graphs. Because the paths are static, the system needs much less computational resources than the global dynamic routing strategy.

The use of conflicts in searching Bayesian networks

OpenAIRE

Poole, David L.

2013-01-01

This paper discusses how conflicts (as used by the consistency-based diagnosis community) can be adapted to be used in a search-based algorithm for computing prior and posterior probabilities in discrete Bayesian Networks. This is an "anytime" algorithm, that at any stage can estimate the probabilities and give an error bound. Whereas the most popular Bayesian net algorithms exploit the structure of the network for efficiency, we exploit probability distributions for efficiency; this algorith...

Analysis of organizational culture with social network models

OpenAIRE

Titov, S.

2015-01-01

Organizational culture is nowadays an object of numerous scientific papers. However, only marginal part of existing research attempts to use the formal models of organizational cultures. The lack of organizational culture models significantly limits the further research in this area and restricts the application of the theory to practice of organizational culture change projects. The article consists of general views on potential application of network models and social network analysis to th...

Home Area Networks and the Smart Grid

Energy Technology Data Exchange (ETDEWEB)

Clements, Samuel L.; Carroll, Thomas E.; Hadley, Mark D.

2011-04-01

With the wide array of home area network (HAN) options being presented as solutions to smart grid challenges for the home, it is time to compare and contrast their strengths and weaknesses. This white paper examines leading and emerging HAN technologies. The emergence of the smart grid is bringing more networking players into the field. The need for low consistent bandwidth usage differs enough from the traditional information technology world to open the door to new technologies. The predominant players currently consist of a blend of the old and new. Within the wired world Ethernet and HomePlug Green PHY are leading the way with an advantage to HomePlug because it doesn't require installing new wires. In the wireless the realm there are many more competitors but WiFi and ZigBee seem to have the most momentum.

An improved algorithm for finding all minimal paths in a network

International Nuclear Information System (INIS)

Bai, Guanghan; Tian, Zhigang; Zuo, Ming J.

2016-01-01

Minimal paths (MPs) play an important role in network reliability evaluation. In this paper, we report an efficient recursive algorithm for finding all MPs in two-terminal networks, which consist of a source node and a sink node. A linked path structure indexed by nodes is introduced, which accepts both directed and undirected form of networks. The distance between each node and the sink node is defined, and a simple recursive algorithm is presented for labeling the distance for each node. Based on the distance between each node and the sink node, additional conditions for backtracking are incorporated to reduce the number of search branches. With the newly introduced linked node structure, the distances between each node and the sink node, and the additional backtracking conditions, an improved backtracking algorithm for searching for all MPs is developed. In addition, the proposed algorithm can be adapted to search for all minimal paths for each source–sink pair in networks consisting of multiple source nodes and/or multiple sink nodes. Through computational experiments, it is demonstrated that the proposed algorithm is more efficient than existing algorithms when the network size is not too small. The proposed algorithm becomes more advantageous as the size of the network grows. - Highlights: • A linked path structure indexed by nodes is introduced to represent networks. • Additional conditions for backtracking are proposed based on the distance of each node. • An efficient algorithm is developed to find all MPs for two-terminal networks. • The computational efficiency of the algorithm for two-terminal networks is investigated. • The computational efficiency of the algorithm for multi-terminal networks is investigated.

A Consistent Fuzzy Preference Relations Based ANP Model for R&D Project Selection

Directory of Open Access Journals (Sweden)

Chia-Hua Cheng

2017-08-01

Full Text Available In today’s rapidly changing economy, technology companies have to make decisions on research and development (R&D projects investment on a routine bases with such decisions having a direct impact on that company’s profitability, sustainability and future growth. Companies seeking profitable opportunities for investment and project selection must consider many factors such as resource limitations and differences in assessment, with consideration of both qualitative and quantitative criteria. Often, differences in perception by the various stakeholders hinder the attainment of a consensus of opinion and coordination efforts. Thus, in this study, a hybrid model is developed for the consideration of the complex criteria taking into account the different opinions of the various stakeholders who often come from different departments within the company and have different opinions about which direction to take. The decision-making trial and evaluation laboratory (DEMATEL approach is used to convert the cause and effect relations representing the criteria into a visual network structure. A consistent fuzzy preference relations based analytic network process (CFPR-ANP method is developed to calculate the preference-weights of the criteria based on the derived network structure. The CFPR-ANP is an improvement over the original analytic network process (ANP method in that it reduces the problem of inconsistency as well as the number of pairwise comparisons. The combined complex proportional assessment (COPRAS-G method is applied with fuzzy grey relations to resolve conflicts arising from differences in information and opinions provided by the different stakeholders about the selection of the most suitable R&D projects. This novel combination approach is then used to assist an international brand-name company to prioritize projects and make project decisions that will maximize returns and ensure sustainability for the company.

Industrial entrepreneurial network: Structural and functional analysis

Science.gov (United States)

Medvedeva, M. A.; Davletbaev, R. H.; Berg, D. B.; Nazarova, J. J.; Parusheva, S. S.

2016-12-01

Structure and functioning of two model industrial entrepreneurial networks are investigated in the present paper. One of these networks is forming when implementing an integrated project and consists of eight agents, which interact with each other and external environment. The other one is obtained from the municipal economy and is based on the set of the 12 real business entities. Analysis of the networks is carried out on the basis of the matrix of mutual payments aggregated over the certain time period. The matrix is created by the methods of experimental economics. Social Network Analysis (SNA) methods and instruments were used in the present research. The set of basic structural characteristics was investigated: set of quantitative parameters such as density, diameter, clustering coefficient, different kinds of centrality, and etc. They were compared with the random Bernoulli graphs of the corresponding size and density. Discovered variations of random and entrepreneurial networks structure are explained by the peculiarities of agents functioning in production network. Separately, were identified the closed exchange circuits (cyclically closed contours of graph) forming an autopoietic (self-replicating) network pattern. The purpose of the functional analysis was to identify the contribution of the autopoietic network pattern in its gross product. It was found that the magnitude of this contribution is more than 20%. Such value allows using of the complementary currency in order to stimulate economic activity of network agents.

Information Extraction with Character-level Neural Networks and Free Noisy Supervision

OpenAIRE

Meerkamp, Philipp; Zhou, Zhengyi

2016-01-01

We present an architecture for information extraction from text that augments an existing parser with a character-level neural network. The network is trained using a measure of consistency of extracted data with existing databases as a form of noisy supervision. Our architecture combines the ability of constraint-based information extraction systems to easily incorporate domain knowledge and constraints with the ability of deep neural networks to leverage large amounts of data to learn compl...

Transcriptional control in the segmentation gene network of Drosophila.

Directory of Open Access Journals (Sweden)

Mark D Schroeder

2004-09-01

Full Text Available The segmentation gene network of Drosophila consists of maternal and zygotic factors that generate, by transcriptional (cross- regulation, expression patterns of increasing complexity along the anterior-posterior axis of the embryo. Using known binding site information for maternal and zygotic gap transcription factors, the computer algorithm Ahab recovers known segmentation control elements (modules with excellent success and predicts many novel modules within the network and genome-wide. We show that novel module predictions are highly enriched in the network and typically clustered proximal to the promoter, not only upstream, but also in intronic space and downstream. When placed upstream of a reporter gene, they consistently drive patterned blastoderm expression, in most cases faithfully producing one or more pattern elements of the endogenous gene. Moreover, we demonstrate for the entire set of known and newly validated modules that Ahab's prediction of binding sites correlates well with the expression patterns produced by the modules, revealing basic rules governing their composition. Specifically, we show that maternal factors consistently act as activators and that gap factors act as repressors, except for the bimodal factor Hunchback. Our data suggest a simple context-dependent rule for its switch from repressive to activating function. Overall, the composition of modules appears well fitted to the spatiotemporal distribution of their positive and negative input factors. Finally, by comparing Ahab predictions with different categories of transcription factor input, we confirm the global regulatory structure of the segmentation gene network, but find odd skipped behaving like a primary pair-rule gene. The study expands our knowledge of the segmentation gene network by increasing the number of experimentally tested modules by 50%. For the first time, the entire set of validated modules is analyzed for binding site composition under a

Design of Hybrid Mobile Communication Networks for Planetary Exploration

Science.gov (United States)

Alena, Richard L.; Ossenfort, John; Lee, Charles; Walker, Edward; Stone, Thom

2004-01-01

The Mobile Exploration System Project (MEX) at NASA Ames Research Center has been conducting studies into hybrid communication networks for future planetary missions. These networks consist of space-based communication assets connected to ground-based Internets and planetary surface-based mobile wireless networks. These hybrid mobile networks have been deployed in rugged field locations in the American desert and the Canadian arctic for support of science and simulation activities on at least six occasions. This work has been conducted over the past five years resulting in evolving architectural complexity, improved component characteristics and better analysis and test methods. A rich set of data and techniques have resulted from the development and field testing of the communication network during field expeditions such as the Haughton Mars Project and NASA Mobile Agents Project.

Common and distinct brain networks underlying panic and social anxiety disorders.

Science.gov (United States)

Kim, Yong-Ku; Yoon, Ho-Kyoung

2018-01-03

Although panic disorder (PD) and phobic disorders are independent anxiety disorders with distinct sets of diagnostic criteria, there is a high level of overlap between them in terms of pathogenesis and neural underpinnings. Functional connectivity research using resting-state functional magnetic resonance imaging (rsfMRI) shows great potential in identifying the similarities and differences between PD and phobias. Understanding common and distinct networks between PD and phobic disorders is critical for identifying both specific and general neural characteristics of these disorders. We review recent rsfMRI studies and explore the clinical relevance of resting-state functional connectivity (rsFC) in PD and phobias. Although findings differ between studies, there are some meaningful, consistent findings. Social anxiety disorder (SAD) and PD share common default mode network alterations. Alterations within the sensorimotor network are observed primarily in PD. Increased connectivity in the salience network is consistently reported in SAD. This review supports hypotheses that PD and phobic disorders share common rsFC abnormalities and that the different clinical phenotypes between the disorders come from distinct brain functional network alterations. Copyright © 2017 Elsevier Inc. All rights reserved.

A Multi-Vehicles, Wireless Testbed for Networked Control, Communications and Computing

Science.gov (United States)

Murray, Richard; Doyle, John; Effros, Michelle; Hickey, Jason; Low, Steven

2002-03-01

We have constructed a testbed consisting of 4 mobile vehicles (with 4 additional vehicles being completed), each with embedded computing and communications capability for use in testing new approaches for command and control across dynamic networks. The system is being used or is planned to be used for testing of a variety of communications-related technologies, including distributed command and control algorithms, dynamically reconfigurable network topologies, source coding for real-time transmission of data in lossy environments, and multi-network communications. A unique feature of the testbed is the use of vehicles that have second order dynamics. Requiring real-time feedback algorithms to stabilize the system while performing cooperative tasks. The testbed was constructed in the Caltech Vehicles Laboratory and consists of individual vehicles with PC-based computation and controls, and multiple communications devices (802.11 wireless Ethernet, Bluetooth, and infrared). The vehicles are freely moving, wheeled platforms propelled by high performance dotted fairs. The room contains an access points for an 802.11 network, overhead visual sensing (to allow emulation of CI'S signal processing), a centralized computer for emulating certain distributed computations, and network gateways to control and manipulate communications traffic.

Consistently violating the non-Gaussian consistency relation

International Nuclear Information System (INIS)

Mooij, Sander; Palma, Gonzalo A.

2015-01-01

Non-attractor models of inflation are characterized by the super-horizon evolution of curvature perturbations, introducing a violation of the non-Gaussian consistency relation between the bispectrum's squeezed limit and the power spectrum's spectral index. In this work we show that the bispectrum's squeezed limit of non-attractor models continues to respect a relation dictated by the evolution of the background. We show how to derive this relation using only symmetry arguments, without ever needing to solve the equations of motion for the perturbations

Physics of flow in weighted complex networks

Science.gov (United States)

Wu, Zhenhua

This thesis uses concepts from statistical physics to understand the physics of flow in weighted complex networks. The traditional model for random networks is the Erdoḧs-Renyi (ER.) network, where a network of N nodes is created by connecting each of the N(N - 1)/2 pairs of nodes with a probability p. The degree distribution, which is the probability distribution of the number of links per node, is a Poisson distribution. Recent studies of the topology in many networks such as the Internet and the world-wide airport network (WAN) reveal a power law degree distribution, known as a scale-free (SF) distribution. To yield a better description of network dynamics, we study weighted networks, where each link or node is given a number. One asks how the weights affect the static and the dynamic properties of the network. In this thesis, two important dynamic problems are studied: the current flow problem, described by Kirchhoff's laws, and the maximum flow problem, which maximizes the flow between two nodes. Percolation theory is applied to these studies of the dynamics in complex networks. We find that the current flow in disordered media belongs to the same universality class as the optimal path. In a randomly weighted network, we identify the infinite incipient percolation cluster as the "superhighway", which contains most of the traffic in a network. We propose an efficient strategy to improve significantly the global transport by improving the superhighways, which comprise a small fraction of the network. We also propose a network model with correlated weights to describe weighted networks such as the WAN. Our model agrees with WAN data, and provides insight into the advantages of correlated weights in networks. Lastly, the upper critical dimension is evaluated using two different numerical methods, and the result is consistent with the theoretical prediction.

Detecting groups of similar components in complex networks

International Nuclear Information System (INIS)

Wang Jiao; Lai, C-H

2008-01-01

We study how to detect groups in a complex network each of which consists of component nodes sharing a similar connection pattern. Based on the mixture models and the exploratory analysis set up by Newman and Leicht (2007 Proc. Natl. Acad. Sci. USA 104 9564), we develop an algorithm that is applicable to a network with any degree distribution. The partition of a network suggested by this algorithm also applies to its complementary network. In general, groups of similar components are not necessarily identical with the communities in a community network; thus partitioning a network into groups of similar components provides additional information of the network structure. The proposed algorithm can also be used for community detection when the groups and the communities overlap. By introducing a tunable parameter that controls the involved effects of the heterogeneity, we can also investigate conveniently how the group structure can be coupled with the heterogeneity characteristics. In particular, an interesting example shows a group partition can evolve into a community partition in some situations when the involved heterogeneity effects are tuned. The extension of this algorithm to weighted networks is discussed as well.

Ethnic boundaries in high school students’ networks in Flanders and the Netherlands

NARCIS (Netherlands)

Baerveldt, C.; Zijlstra, Bonne; De Wolf, M.; Van Rossem, R.; van Duijn, M.A.J.

2007-01-01

Ethnic boundaries were tested in students' networks in 34 Flemish and 19 Dutch high schools. Each network consisted of a school cohort in an intermediate level of education ( track). While students from the native majority predominantly had friendships within their own ethnic category, minority

An ad hoc wireless sensor network for tele medicine applications

International Nuclear Information System (INIS)

Sheltami, Tarek R.; Mahmoud, Ashraf S.; Abu-Amara, Marwan H.

2007-01-01

Recent advances in embedded computing systems have led to the emergence of wireless sensor networks (SNETs), consisting of small, battery-powered motes with limited computation and radio communication capabilities. SNETs permit data gathering and computation to be deeply embedded in the physical environment. Large scale ad hoc sensor networks (ASNET), when deployed among mobile patients, can provide dynamic data query architecture to allow medical specialists to monitor patients at any place via the web or cellular network. In case of an emergency, doctors and/or nurses will be contacted automatically through their handheld personal digital assistants (PDAs) or cellular phones. In specific, the proposed network consists of sensor nodes at the first layer whose responsibility is to measure, collect and communicate, via wired or wireless interface, readings to a microcontroller presenting the second layer of architecture. Deployed microcontrollers process incoming readings and report to a central system via a wireless interface. The implemented network distinguishes between periodic sensor readings and critical or event driven readings where higher priorities is given for the latter. In this paper we implement 3 special cases for tracking and monitoring patients and doctors using SNETs. In addition, the performance of a large scale of our implementation has been tested by means of mathematical analysis. (author)

A Complex Network Approach to Distributional Semantic Models.

Directory of Open Access Journals (Sweden)

Akira Utsumi

Full Text Available A number of studies on network analysis have focused on language networks based on free word association, which reflects human lexical knowledge, and have demonstrated the small-world and scale-free properties in the word association network. Nevertheless, there have been very few attempts at applying network analysis to distributional semantic models, despite the fact that these models have been studied extensively as computational or cognitive models of human lexical knowledge. In this paper, we analyze three network properties, namely, small-world, scale-free, and hierarchical properties, of semantic networks created by distributional semantic models. We demonstrate that the created networks generally exhibit the same properties as word association networks. In particular, we show that the distribution of the number of connections in these networks follows the truncated power law, which is also observed in an association network. This indicates that distributional semantic models can provide a plausible model of lexical knowledge. Additionally, the observed differences in the network properties of various implementations of distributional semantic models are consistently explained or predicted by considering the intrinsic semantic features of a word-context matrix and the functions of matrix weighting and smoothing. Furthermore, to simulate a semantic network with the observed network properties, we propose a new growing network model based on the model of Steyvers and Tenenbaum. The idea underlying the proposed model is that both preferential and random attachments are required to reflect different types of semantic relations in network growth process. We demonstrate that this model provides a better explanation of network behaviors generated by distributional semantic models.

Temporal correlation coefficient for directed networks.

Science.gov (United States)

Büttner, Kathrin; Salau, Jennifer; Krieter, Joachim

2016-01-01

Previous studies dealing with network theory focused mainly on the static aggregation of edges over specific time window lengths. Thus, most of the dynamic information gets lost. To assess the quality of such a static aggregation the temporal correlation coefficient can be calculated. It measures the overall possibility for an edge to persist between two consecutive snapshots. Up to now, this measure is only defined for undirected networks. Therefore, we introduce the adaption of the temporal correlation coefficient to directed networks. This new methodology enables the distinction between ingoing and outgoing edges. Besides a small example network presenting the single calculation steps, we also calculated the proposed measurements for a real pig trade network to emphasize the importance of considering the edge direction. The farm types at the beginning of the pork supply chain showed clearly higher values for the outgoing temporal correlation coefficient compared to the farm types at the end of the pork supply chain. These farm types showed higher values for the ingoing temporal correlation coefficient. The temporal correlation coefficient is a valuable tool to understand the structural dynamics of these systems, as it assesses the consistency of the edge configuration. The adaption of this measure for directed networks may help to preserve meaningful additional information about the investigated network that might get lost if the edge directions are ignored.

A DRM Security Architecture for Home Networks

NARCIS (Netherlands)

Popescu, B.C.; Crispo, B.; Kamperman, F.L.A.J.; Tanenbaum, A.S.; Kiayias, A.; Yung, M.

2004-01-01

This paper describes a security architecture allowing digital rights management in home networks consisting of consumer electronic devices. The idea is to allow devices to establish dynamic groups, so called "Authorized Domains", where legally acquired copyrighted content can seamlessly move from

Optimal control of epidemic information dissemination over networks.

Science.gov (United States)

Chen, Pin-Yu; Cheng, Shin-Ming; Chen, Kwang-Cheng

2014-12-01

Information dissemination control is of crucial importance to facilitate reliable and efficient data delivery, especially in networks consisting of time-varying links or heterogeneous links. Since the abstraction of information dissemination much resembles the spread of epidemics, epidemic models are utilized to characterize the collective dynamics of information dissemination over networks. From a systematic point of view, we aim to explore the optimal control policy for information dissemination given that the control capability is a function of its distribution time, which is a more realistic model in many applications. The main contributions of this paper are to provide an analytically tractable model for information dissemination over networks, to solve the optimal control signal distribution time for minimizing the accumulated network cost via dynamic programming, and to establish a parametric plug-in model for information dissemination control. In particular, we evaluate its performance in mobile and generalized social networks as typical examples.

Network chemistry, network toxicology, network informatics, and network behavioristics: A scientific outline

OpenAIRE

WenJun Zhang

2016-01-01

In present study, I proposed some new sciences: network chemistry, network toxicology, network informatics, and network behavioristics. The aims, scope and scientific foundation of these sciences are outlined.

Detection of generalized synchronization using echo state networks

OpenAIRE

Ibáñez-Soria, D.; García Ojalvo, Jordi; Soria Frisch, Aureli; Ruffini, G.

2018-01-01

Generalized synchronization between coupled dynamical systems is a phenomenon of relevance in applications that range from secure communications to physiological modelling. Here, we test the capabilities of reservoir computing and, in particular, echo state networks for the detection of generalized synchronization. A nonlinear dynamical system consisting of two coupled Rössler chaotic attractors is used to generate temporal series consisting of time-locked generalized synchronized sequences i...

Do Health Systems Have Consistent Performance Across Locations and Is Consistency Associated With Higher Performance?

Science.gov (United States)

Crespin, Daniel J; Christianson, Jon B; McCullough, Jeffrey S; Finch, Michael D

This study addresses whether health systems have consistent diabetes care performance across their ambulatory clinics and whether increasing consistency is associated with improvements in clinic performance. Study data included 2007 to 2013 diabetes care intermediate outcome measures for 661 ambulatory clinics in Minnesota and bordering states. Health systems provided more consistent performance, as measured by the standard deviation of performance for clinics in a system, relative to propensity score-matched proxy systems created for comparison purposes. No evidence was found that improvements in consistency were associated with higher clinic performance. The combination of high performance and consistent care is likely to enhance a health system's brand reputation, allowing it to better mitigate the financial risks of consumers seeking care outside the organization. These results suggest that larger health systems are most likely to deliver the combination of consistent and high-performance care. Future research should explore the mechanisms that drive consistent care within health systems.

Craniofacial Reconstruction Evaluation by Geodesic Network

Directory of Open Access Journals (Sweden)

Junli Zhao

2014-01-01

Full Text Available Craniofacial reconstruction is to estimate an individual’s face model from its skull. It has a widespread application in forensic medicine, archeology, medical cosmetic surgery, and so forth. However, little attention is paid to the evaluation of craniofacial reconstruction. This paper proposes an objective method to evaluate globally and locally the reconstructed craniofacial faces based on the geodesic network. Firstly, the geodesic networks of the reconstructed craniofacial face and the original face are built, respectively, by geodesics and isogeodesics, whose intersections are network vertices. Then, the absolute value of the correlation coefficient of the features of all corresponding geodesic network vertices between two models is taken as the holistic similarity, where the weighted average of the shape index values in a neighborhood is defined as the feature of each network vertex. Moreover, the geodesic network vertices of each model are divided into six subareas, that is, forehead, eyes, nose, mouth, cheeks, and chin, and the local similarity is measured for each subarea. Experiments using 100 pairs of reconstructed craniofacial faces and their corresponding original faces show that the evaluation by our method is roughly consistent with the subjective evaluation derived from thirty-five persons in five groups.

Consistency argued students of fluid

Science.gov (United States)

Viyanti; Cari; Suparmi; Winarti; Slamet Budiarti, Indah; Handika, Jeffry; Widyastuti, Fatma

2017-01-01

Problem solving for physics concepts through consistency arguments can improve thinking skills of students and it is an important thing in science. The study aims to assess the consistency of the material Fluid student argmentation. The population of this study are College students PGRI Madiun, UIN Sunan Kalijaga Yogyakarta and Lampung University. Samples using cluster random sampling, 145 samples obtained by the number of students. The study used a descriptive survey method. Data obtained through multiple-choice test and interview reasoned. Problem fluid modified from [9] and [1]. The results of the study gained an average consistency argmentation for the right consistency, consistency is wrong, and inconsistent respectively 4.85%; 29.93%; and 65.23%. Data from the study have an impact on the lack of understanding of the fluid material which is ideally in full consistency argued affect the expansion of understanding of the concept. The results of the study as a reference in making improvements in future studies is to obtain a positive change in the consistency of argumentations.

Understanding Knowledge Network, Learning and Connectivism

Science.gov (United States)

AlDahdouh, Alaa A.; Osório, António J.; Caires, Susana

2015-01-01

Behaviorism, Cognitivism, Constructivism and other growing theories such as Actor-Network and Connectivism are circulating in the educational field. For each, there are allies who stand behind research evidence and consistency of observation. Meantime, those existing theories dominate the field until the background is changed or new concrete…

Consistency of orthodox gravity

Energy Technology Data Exchange (ETDEWEB)

Bellucci, S. [INFN, Frascati (Italy). Laboratori Nazionali di Frascati; Shiekh, A. [International Centre for Theoretical Physics, Trieste (Italy)

1997-01-01

A recent proposal for quantizing gravity is investigated for self consistency. The existence of a fixed-point all-order solution is found, corresponding to a consistent quantum gravity. A criterion to unify couplings is suggested, by invoking an application of their argument to more complex systems.

Design of a tripartite network for the prediction of drug targets

Science.gov (United States)

Kunimoto, Ryo; Bajorath, Jürgen

2018-02-01

Drug-target networks have aided in many target prediction studies aiming at drug repurposing or the analysis of side effects. Conventional drug-target networks are bipartite. They contain two different types of nodes representing drugs and targets, respectively, and edges indicating pairwise drug-target interactions. In this work, we introduce a tripartite network consisting of drugs, other bioactive compounds, and targets from different sources. On the basis of analog relationships captured in the network and so-called neighbor targets of drugs, new drug targets can be inferred. The tripartite network was found to have a stable structure and simulated network growth was accompanied by a steady increase in assortativity, reflecting increasing correlation between degrees of connected nodes leading to even network connectivity. Local drug environments in the tripartite network typically contained neighbor targets and revealed interesting drug-compound-target relationships for further analysis. Candidate targets were prioritized. The tripartite network design extends standard drug-target networks and provides additional opportunities for drug target prediction.

Applying self-organizing map and modified radial based neural network for clustering and routing optimal path in wireless network

Science.gov (United States)

Hoomod, Haider K.; Kareem Jebur, Tuka

2018-05-01

Mobile ad hoc networks (MANETs) play a critical role in today’s wireless ad hoc network research and consist of active nodes that can be in motion freely. Because it consider very important problem in this network, we suggested proposed method based on modified radial basis function networks RBFN and Self-Organizing Map SOM. These networks can be improved by the use of clusters because of huge congestion in the whole network. In such a system, the performance of MANET is improved by splitting the whole network into various clusters using SOM. The performance of clustering is improved by the cluster head selection and number of clusters. Modified Radial Based Neural Network is very simple, adaptable and efficient method to increase the life time of nodes, packet delivery ratio and the throughput of the network will increase and connection become more useful because the optimal path has the best parameters from other paths including the best bitrate and best life link with minimum delays. Proposed routing algorithm depends on the group of factors and parameters to select the path between two points in the wireless network. The SOM clustering average time (1-10 msec for stall nodes) and (8-75 msec for mobile nodes). While the routing time range (92-510 msec).The proposed system is faster than the Dijkstra by 150-300%, and faster from the RBFNN (without modify) by 145-180%.

On attracting sets in artificial networks: cross activation

Directory of Open Access Journals (Sweden)

Sadyrbaev Felix

2018-01-01

Full Text Available Mathematical models of artificial networks can be formulated in terms of dynamical systems describing the behaviour of a network over time. The interrelation between nodes (elements of a network is encoded in the regulatory matrix. We consider a system of ordinary differential equations that describes in particular also genomic regulatory networks (GRN and contains a sigmoidal function. The results are presented on attractors of such systems for a particular case of cross activation. The regulatory matrix is then of particular form consisting of unit entries everywhere except the main diagonal. We show that such a system can have not more than three critical points. At least n–1 eigenvalues corresponding to any of the critical points are negative. An example for a particular choice of sigmoidal function is considered.

Competitive game theoretic optimal routing in optical networks

Science.gov (United States)

Yassine, Abdulsalam; Kabranov, Ognian; Makrakis, Dimitrios

2002-09-01

Optical transport service providers need control and optimization strategies for wavelength management, network provisioning, restoration and protection, allowing them to define and deploy new services and maintain competitiveness. In this paper, we investigate a game theory based model for wavelength and flow assignment in multi wavelength optical networks, consisting of several backbone long-haul optical network transport service providers (TSPs) who are offering their services -in terms of bandwidth- to Internet service providers (ISPs). The ISPs act as brokers or agents between the TSP and end user. The agent (ISP) buys services (bandwidth) from the TSP. The TSPs compete among themselves to sell their services and maintain profitability. We present a case study, demonstrating the impact of different bandwidth broker demands on the supplier's profit and the price paid by the network broker.

Large scale network management. Condition indicators for network stations, high voltage power conductions and cables

International Nuclear Information System (INIS)

Eggen, Arnt Ove; Rolfseng, Lars; Langdal, Bjoern Inge

2006-02-01

In the Strategic Institute Programme (SIP) 'Electricity Business enters e-business (eBee)' SINTEF Energy research has developed competency that can help the energy business employ ICT systems and computer technology in an improved way. Large scale network management is now a reality, and it is characterized by large entities with increasing demands on efficiency and quality. These are goals that can only be reached by using ICT systems and computer technology in a more clever way than what is the case today. At the same time it is important that knowledge held by experienced co-workers is consulted when formal rules for evaluations and decisions in ICT systems are developed. In this project an analytical concept for evaluation of networks based information in different ICT systems has been developed. The method estimating the indicators to describe different conditions in a network is general, and indicators can be made to fit different levels of decision and network levels, for example network station, transformer circuit, distribution network and regional network. Moreover, the indicators can contain information about technical aspects, economy and HSE. An indicator consists of an indicator name, an indicator value, and an indicator colour based on a traffic-light analogy to indicate a condition or a quality for the indicator. Values on one or more indicators give an impression of important conditions in the network, and make up the basis for knowing where more detailed evaluations have to be conducted before a final decision on for example maintenance or renewal is made. A prototype has been developed for testing the new method. The prototype has been developed in Excel, and especially designed for analysing transformer circuits in a distribution network. However, the method is a general one, and well suited for implementation in a commercial computer system (ml)

Constitutive modelling of composite biopolymer networks.

Science.gov (United States)

Fallqvist, B; Kroon, M

2016-04-21

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

Dynamic social networks based on movement

Science.gov (United States)

Scharf, Henry; Hooten, Mevin B.; Fosdick, Bailey K.; Johnson, Devin S.; London, Joshua M.; Durban, John W.

2016-01-01

Network modeling techniques provide a means for quantifying social structure in populations of individuals. Data used to define social connectivity are often expensive to collect and based on case-specific, ad hoc criteria. Moreover, in applications involving animal social networks, collection of these data is often opportunistic and can be invasive. Frequently, the social network of interest for a given population is closely related to the way individuals move. Thus, telemetry data, which are minimally invasive and relatively inexpensive to collect, present an alternative source of information. We develop a framework for using telemetry data to infer social relationships among animals. To achieve this, we propose a Bayesian hierarchical model with an underlying dynamic social network controlling movement of individuals via two mechanisms: an attractive effect and an aligning effect. We demonstrate the model and its ability to accurately identify complex social behavior in simulation, and apply our model to telemetry data arising from killer whales. Using auxiliary information about the study population, we investigate model validity and find the inferred dynamic social network is consistent with killer whale ecology and expert knowledge.

Heuristic algorithm for determination of local properties of scale-free networks

CERN Document Server

Mitrovic, M

2006-01-01

Complex networks are everywhere. Many phenomena in nature can be modeled as networks: - brain structures - protein-protein interaction networks - social interactions - the Internet and WWW. They can be represented in terms of nodes and edges connecting them. Important characteristics: - these networks are not random; they have a structured architecture. Structure of different networks are similar: - all have power law degree distribution (scale-free property) - despite large size there is usually relatively short path between any two nodes (small world property). Global characteristics: - degree distribution, clustering coefficient and the diameter. Local structure: - frequency of subgraphs of given type (subgraph of order k is a part of the network consisting of k nodes and edges between them). There are different types of subgraphs of the same order.

Incorporating profile information in community detection for online social networks

Science.gov (United States)

Fan, W.; Yeung, K. H.

2014-07-01

Community structure is an important feature in the study of complex networks. It is because nodes of the same community may have similar properties. In this paper we extend two popular community detection methods to partition online social networks. In our extended methods, the profile information of users is used for partitioning. We apply the extended methods in several sample networks of Facebook. Compared with the original methods, the community structures we obtain have higher modularity. Our results indicate that users' profile information is consistent with the community structure of their friendship network to some extent. To the best of our knowledge, this paper is the first to discuss how profile information can be used to improve community detection in online social networks.

Satellite communications for the next generation telecommunication services and networks

Science.gov (United States)

Chitre, D. M.

1991-01-01

Satellite communications can play an important role in provisioning the next-generation telecommunication services and networks, provided the protocols specifying these services and networks are satellite-compatible and the satellite subnetworks, consisting of earth stations interconnected by the processor and the switch on board the satellite, interwork effectively with the terrestrial networks. The specific parameters and procedures of frame relay and broadband integrated services digital network (B-ISDN) protocols which are impacted by a satellite delay. Congestion and resource management functions for frame relay and B-ISDN are discussed in detail, describing the division of these functions between earth stations and on board the satellite. Specific onboard and ground functions are identified as potential candidates for their implementation via neural network technology.

Utility communication networks and services specification, deployment and operation

CERN Document Server

2017-01-01

This CIGRE green book begins by addressing the specification and provision of communication services in the context of operational applications for electrical power utilities, before subsequently providing guidelines on the deployment or transformation of networks to deliver these specific communication services. Lastly, it demonstrates how these networks and their services can be monitored, operated, and maintained to ensure that the requisite high level of service quality is consistently achieved.

The Nordic Health Promotion Research Network (NHPRN).

Science.gov (United States)

Ringsberg, Karin C

2015-08-01

The Nordic Health Promotion Research Network (NHPRN) was established in 2007 at the Nordic School of Public Health (NHV). This article aims to describe the foundation of the NHPRN, the development and the present status of the work of NHPRN. The NHPRN consists of about 50 senior and junior researchers from all Nordic countries. It is a working network that aims to develop the theoretical understanding of health promotion, to create research cooperation in health promotion from a Nordic perspective and to extend the scope of health promotion through education. Network members meet biannually to discuss and further develop research within the field and are also responsible for the Nordic conference on Health Promotion, organized every 3 years. The NHV hosted the network between 2007 and 2014; and the World Health Organisation (WHO) will assume this role in 2015. © 2015 the Nordic Societies of Public Health.

Interactions of the Salience Network and Its Subsystems with the Default-Mode and the Central-Executive Networks in Normal Aging and Mild Cognitive Impairment.

Science.gov (United States)

Chand, Ganesh B; Wu, Junjie; Hajjar, Ihab; Qiu, Deqiang

2017-09-01

Previous functional magnetic resonance imaging (fMRI) investigations suggest that the intrinsically organized large-scale networks and the interaction between them might be crucial for cognitive activities. A triple network model, which consists of the default-mode network, salience network, and central-executive network, has been recently used to understand the connectivity patterns of the cognitively normal brains versus the brains with disorders. This model suggests that the salience network dynamically controls the default-mode and central-executive networks in healthy young individuals. However, the patterns of interactions have remained largely unknown in healthy aging or those with cognitive decline. In this study, we assess the patterns of interactions between the three networks using dynamical causal modeling in resting state fMRI data and compare them between subjects with normal cognition and mild cognitive impairment (MCI). In healthy elderly subjects, our analysis showed that the salience network, especially its dorsal subnetwork, modulates the interaction between the default-mode network and the central-executive network (Mann-Whitney U test; p control correlated significantly with lower overall cognitive performance measured by Montreal Cognitive Assessment (r = 0.295; p control, especially the dorsal salience network, over other networks provides a neuronal basis for cognitive decline and may be a candidate neuroimaging biomarker of cognitive impairment.

Simulation of noise-assisted transport via optical cavity networks

International Nuclear Information System (INIS)

Caruso, Filippo; Plenio, Martin B.; Spagnolo, Nicolo; Vitelli, Chiara; Sciarrino, Fabio

2011-01-01

Recently, the presence of noise has been found to play a key role in assisting the transport of energy and information in complex quantum networks and even in biomolecular systems. Here we propose an experimentally realizable optical network scheme for the demonstration of the basic mechanisms underlying noise-assisted transport. The proposed system consists of a network of coupled quantum-optical cavities, injected with a single photon, whose transmission efficiency can be measured. Introducing dephasing in the photon path, this system exhibits a characteristic enhancement of the transport efficiency that can be observed with presently available technology.

Novel approaches to pin cluster synchronization on complex dynamical networks in Lur'e forms

Science.gov (United States)

Tang, Ze; Park, Ju H.; Feng, Jianwen

2018-04-01

This paper investigates the cluster synchronization of complex dynamical networks consisted of identical or nonidentical Lur'e systems. Due to the special topology structure of the complex networks and the existence of stochastic perturbations, a kind of randomly occurring pinning controller is designed which not only synchronizes all Lur'e systems in the same cluster but also decreases the negative influence among different clusters. Firstly, based on an extended integral inequality, the convex combination theorem and S-procedure, the conditions for cluster synchronization of identical Lur'e networks are derived in a convex domain. Secondly, randomly occurring adaptive pinning controllers with two independent Bernoulli stochastic variables are designed and then sufficient conditions are obtained for the cluster synchronization on complex networks consisted of nonidentical Lur'e systems. In addition, suitable control gains for successful cluster synchronization of nonidentical Lur'e networks are acquired by designing some adaptive updating laws. Finally, we present two numerical examples to demonstrate the validity of the control scheme and the theoretical analysis.

Learning a Markov Logic network for supervised gene regulatory network inference.

Science.gov (United States)

Brouard, Céline; Vrain, Christel; Dubois, Julie; Castel, David; Debily, Marie-Anne; d'Alché-Buc, Florence

2013-09-12

Gene regulatory network inference remains a challenging problem in systems biology despite the numerous approaches that have been proposed. When substantial knowledge on a gene regulatory network is already available, supervised network inference is appropriate. Such a method builds a binary classifier able to assign a class (Regulation/No regulation) to an ordered pair of genes. Once learnt, the pairwise classifier can be used to predict new regulations. In this work, we explore the framework of Markov Logic Networks (MLN) that combine features of probabilistic graphical models with the expressivity of first-order logic rules. We propose to learn a Markov Logic network, e.g. a set of weighted rules that conclude on the predicate "regulates", starting from a known gene regulatory network involved in the switch proliferation/differentiation of keratinocyte cells, a set of experimental transcriptomic data and various descriptions of genes all encoded into first-order logic. As training data are unbalanced, we use asymmetric bagging to learn a set of MLNs. The prediction of a new regulation can then be obtained by averaging predictions of individual MLNs. As a side contribution, we propose three in silico tests to assess the performance of any pairwise classifier in various network inference tasks on real datasets. A first test consists of measuring the average performance on balanced edge prediction problem; a second one deals with the ability of the classifier, once enhanced by asymmetric bagging, to update a given network. Finally our main result concerns a third test that measures the ability of the method to predict regulations with a new set of genes. As expected, MLN, when provided with only numerical discretized gene expression data, does not perform as well as a pairwise SVM in terms of AUPR. However, when a more complete description of gene properties is provided by heterogeneous sources, MLN achieves the same performance as a black-box model such as a

Use of Microsoft HoloLens to survey and visualize buried networks

CERN Multimedia

CERN. Geneva

2017-01-01

Survey and positioning of buried infrastructure networks are crucial issues for their maintenance and a starting point for every new Civil Engineering project. 3DCity is a research & development project which consists in a development of software providing a method for quick underground pipe networks surveying and holographic visualization, by using Microsoft HoloLens devices.

Network model of chemical-sensing system inspired by mouse taste buds.

Science.gov (United States)

Tateno, Katsumi; Igarashi, Jun; Ohtubo, Yoshitaka; Nakada, Kazuki; Miki, Tsutomu; Yoshii, Kiyonori

2011-07-01

Taste buds endure extreme changes in temperature, pH, osmolarity, so on. Even though taste bud cells are replaced in a short span, they contribute to consistent taste reception. Each taste bud consists of about 50 cells whose networks are assumed to process taste information, at least preliminarily. In this article, we describe a neural network model inspired by the taste bud cells of mice. It consists of two layers. In the first layer, the chemical stimulus is transduced into an irregular spike train. The synchronization of the output impulses is induced by the irregular spike train at the second layer. These results show that the intensity of the chemical stimulus is encoded as the degree of the synchronization of output impulses. The present algorithms for signal processing result in a robust chemical-sensing system.

Using XCO2 retrievals for assessing the long-term consistency of NDACC/FTIR data sets

Science.gov (United States)

Barthlott, S.; Schneider, M.; Hase, F.; Wiegele, A.; Christner, E.; González, Y.; Blumenstock, T.; Dohe, S.; García, O. E.; Sepúlveda, E.; Strong, K.; Mendonca, J.; Weaver, D.; Palm, M.; Deutscher, N. M.; Warneke, T.; Notholt, J.; Lejeune, B.; Mahieu, E.; Jones, N.; Griffith, D. W. T.; Velazco, V. A.; Smale, D.; Robinson, J.; Kivi, R.; Heikkinen, P.; Raffalski, U.

2015-03-01

Within the NDACC (Network for the Detection of Atmospheric Composition Change), more than 20 FTIR (Fourier-transform infrared) spectrometers, spread worldwide, provide long-term data records of many atmospheric trace gases. We present a method that uses measured and modelled XCO2 for assessing the consistency of these NDACC data records. Our XCO2 retrieval setup is kept simple so that it can easily be adopted for any NDACC/FTIR-like measurement made since the late 1950s. By a comparison to coincident TCCON (Total Carbon Column Observing Network) measurements, we empirically demonstrate the useful quality of this suggested NDACC XCO2 product (empirically obtained scatter between TCCON and NDACC is about 4‰ for daily mean as well as monthly mean comparisons, and the bias is 25‰). Our XCO2 model is a simple regression model fitted to CarbonTracker results and the Mauna Loa CO2 in situ records. A comparison to TCCON data suggests an uncertainty of the model for monthly mean data of below 3‰. We apply the method to the NDACC/FTIR spectra that are used within the project MUSICA (multi-platform remote sensing of isotopologues for investigating the cycle of atmospheric water) and demonstrate that there is a good consistency for these globally representative set of spectra measured since 1996: the scatter between the modelled and measured XCO2 on a yearly time scale is only 3‰.

End-to-end unsupervised deformable image registration with a convolutional neural network

NARCIS (Netherlands)

de Vos, Bob D.; Berendsen, Floris; Viergever, Max A.; Staring, Marius; Išgum, Ivana

2017-01-01

In this work we propose a deep learning network for deformable image registration (DIRNet). The DIRNet consists of a convolutional neural network (ConvNet) regressor, a spatial transformer, and a resampler. The ConvNet analyzes a pair of fixed and moving images and outputs parameters for the spatial

A Study of Recurrent and Convolutional Neural Networks in the Native Language Identification Task

KAUST Repository

Werfelmann, Robert

2018-01-01

around the world. The neural network models consisted of Long Short-Term Memory and Convolutional networks using the sentences of each document as the input. Additional statistical features were generated from the text to complement the predictions

Computationally Efficient Nonlinear Bell Inequalities for Quantum Networks

Science.gov (United States)

Luo, Ming-Xing

2018-04-01

The correlations in quantum networks have attracted strong interest with new types of violations of the locality. The standard Bell inequalities cannot characterize the multipartite correlations that are generated by multiple sources. The main problem is that no computationally efficient method is available for constructing useful Bell inequalities for general quantum networks. In this work, we show a significant improvement by presenting new, explicit Bell-type inequalities for general networks including cyclic networks. These nonlinear inequalities are related to the matching problem of an equivalent unweighted bipartite graph that allows constructing a polynomial-time algorithm. For the quantum resources consisting of bipartite entangled pure states and generalized Greenberger-Horne-Zeilinger (GHZ) states, we prove the generic nonmultilocality of quantum networks with multiple independent observers using new Bell inequalities. The violations are maximal with respect to the presented Tsirelson's bound for Einstein-Podolsky-Rosen states and GHZ states. Moreover, these violations hold for Werner states or some general noisy states. Our results suggest that the presented Bell inequalities can be used to characterize experimental quantum networks.

Reliability of Wireless Sensor Networks

Science.gov (United States)

Dâmaso, Antônio; Rosa, Nelson; Maciel, Paulo

2014-01-01

Wireless Sensor Networks (WSNs) consist of hundreds or thousands of sensor nodes with limited processing, storage, and battery capabilities. There are several strategies to reduce the power consumption of WSN nodes (by increasing the network lifetime) and increase the reliability of the network (by improving the WSN Quality of Service). However, there is an inherent conflict between power consumption and reliability: an increase in reliability usually leads to an increase in power consumption. For example, routing algorithms can send the same packet though different paths (multipath strategy), which it is important for reliability, but they significantly increase the WSN power consumption. In this context, this paper proposes a model for evaluating the reliability of WSNs considering the battery level as a key factor. Moreover, this model is based on routing algorithms used by WSNs. In order to evaluate the proposed models, three scenarios were considered to show the impact of the power consumption on the reliability of WSNs. PMID:25157553

Computing Tutte polynomials of contact networks in classrooms

Science.gov (United States)

Hincapié, Doracelly; Ospina, Juan

2013-05-01

Objective: The topological complexity of contact networks in classrooms and the potential transmission of an infectious disease were analyzed by sex and age. Methods: The Tutte polynomials, some topological properties and the number of spanning trees were used to algebraically compute the topological complexity. Computations were made with the Maple package GraphTheory. Published data of mutually reported social contacts within a classroom taken from primary school, consisting of children in the age ranges of 4-5, 7-8 and 10-11, were used. Results: The algebraic complexity of the Tutte polynomial and the probability of disease transmission increases with age. The contact networks are not bipartite graphs, gender segregation was observed especially in younger children. Conclusion: Tutte polynomials are tools to understand the topology of the contact networks and to derive numerical indexes of such topologies. It is possible to establish relationships between the Tutte polynomial of a given contact network and the potential transmission of an infectious disease within such network

Social networks and spreading of epidemics

Science.gov (United States)

Trimper, Steffen; Zheng, Dafang; Brandau, Marian

2004-05-01

Epidemiological processes are studied within a recently proposed social network model using the susceptible-infected-refractory dynamics (SIR) of an epidemic. Within the network model, a population of individuals may be characterized by H independent hierarchies or dimensions, each of which consists of groupings of individuals into layers of subgroups. Detailed numerical simulations reveals that for H > 1, the global spreading results regardless of the degree of homophily α of the individuals forming a social circle. For H = 1, a transition from a global to a local spread occurs as the population becomes decomposed into increasingly homophilous groups. Multiple dimensions in classifying individuals (nodes) thus make a society (computer network) highly susceptible to large scale outbreaks of infectious diseases (viruses). The SIR-model can be extended by the inclusion of waiting times resulting in modified distribution function of the recovered.

Scaling properties of domain wall networks

International Nuclear Information System (INIS)

Leite, A. M. M.; Martins, C. J. A. P.

2011-01-01

We revisit the cosmological evolution of domain wall networks, taking advantage of recent improvements in computing power. We carry out high-resolution field theory simulations in two, three and four spatial dimensions to study the effects of dimensionality and damping on the evolution of the network. Our results are consistent with the expected scale-invariant evolution of the network, which suggests that previous hints of deviations from this behavior may have been due to the limited dynamical range of those simulations. We also use the results of very large (1024 3 ) simulations in three cosmological epochs to provide a calibration for the velocity-dependent one-scale model for domain walls: we numerically determine the two free model parameters to have the values c w =0.5±0.2 and k w =1.1±0.3.

Modular networks with delayed coupling: Synchronization and frequency control

Science.gov (United States)

Maslennikov, Oleg V.; Nekorkin, Vladimir I.

2014-07-01

We study the collective dynamics of modular networks consisting of map-based neurons which generate irregular spike sequences. Three types of intramodule topology are considered: a random Erdös-Rényi network, a small-world Watts-Strogatz network, and a scale-free Barabási-Albert network. The interaction between the neurons of different modules is organized by relatively sparse connections with time delay. For all the types of the network topology considered, we found that with increasing delay two regimes of module synchronization alternate with each other: inphase and antiphase. At the same time, the average rate of collective oscillations decreases within each of the time-delay intervals corresponding to a particular synchronization regime. A dual role of the time delay is thus established: controlling a synchronization mode and degree and controlling an average network frequency. Furthermore, we investigate the influence on the modular synchronization by other parameters: the strength of intermodule coupling and the individual firing rate.

An introduction to neural network methods for differential equations

CERN Document Server

Yadav, Neha; Kumar, Manoj

2015-01-01

This book introduces a variety of neural network methods for solving differential equations arising in science and engineering. The emphasis is placed on a deep understanding of the neural network techniques, which has been presented in a mostly heuristic and intuitive manner. This approach will enable the reader to understand the working, efficiency and shortcomings of each neural network technique for solving differential equations. The objective of this book is to provide the reader with a sound understanding of the foundations of neural networks, and a comprehensive introduction to neural network methods for solving differential equations together with recent developments in the techniques and their applications. The book comprises four major sections. Section I consists of a brief overview of differential equations and the relevant physical problems arising in science and engineering. Section II illustrates the history of neural networks starting from their beginnings in the 1940s through to the renewed...

Chimera states in networks of logistic maps with hierarchical connectivities

Science.gov (United States)

zur Bonsen, Alexander; Omelchenko, Iryna; Zakharova, Anna; Schöll, Eckehard

2018-04-01

Chimera states are complex spatiotemporal patterns consisting of coexisting domains of coherence and incoherence. We study networks of nonlocally coupled logistic maps and analyze systematically how the dilution of the network links influences the appearance of chimera patterns. The network connectivities are constructed using an iterative Cantor algorithm to generate fractal (hierarchical) connectivities. Increasing the hierarchical level of iteration, we compare the resulting spatiotemporal patterns. We demonstrate that a high clustering coefficient and symmetry of the base pattern promotes chimera states, and asymmetric connectivities result in complex nested chimera patterns.

Two Distinct Scene-Processing Networks Connecting Vision and Memory.

Science.gov (United States)

Baldassano, Christopher; Esteva, Andre; Fei-Fei, Li; Beck, Diane M

2016-01-01

A number of regions in the human brain are known to be involved in processing natural scenes, but the field has lacked a unifying framework for understanding how these different regions are organized and interact. We provide evidence from functional connectivity and meta-analyses for a new organizational principle, in which scene processing relies upon two distinct networks that split the classically defined parahippocampal place area (PPA). The first network of strongly connected regions consists of the occipital place area/transverse occipital sulcus and posterior PPA, which contain retinotopic maps and are not strongly coupled to the hippocampus at rest. The second network consists of the caudal inferior parietal lobule, retrosplenial complex, and anterior PPA, which connect to the hippocampus (especially anterior hippocampus), and are implicated in both visual and nonvisual tasks, including episodic memory and navigation. We propose that these two distinct networks capture the primary functional division among scene-processing regions, between those that process visual features from the current view of a scene and those that connect information from a current scene view with a much broader temporal and spatial context. This new framework for understanding the neural substrates of scene-processing bridges results from many lines of research, and makes specific functional predictions.

Market-consistent actuarial valuation

CERN Document Server

Wüthrich, Mario V

2016-01-01

This is the third edition of this well-received textbook, presenting powerful methods for measuring insurance liabilities and assets in a consistent way, with detailed mathematical frameworks that lead to market-consistent values for liabilities. Topics covered are stochastic discounting with deflators, valuation portfolio in life and non-life insurance, probability distortions, asset and liability management, financial risks, insurance technical risks, and solvency. Including updates on recent developments and regulatory changes under Solvency II, this new edition of Market-Consistent Actuarial Valuation also elaborates on different risk measures, providing a revised definition of solvency based on industry practice, and presents an adapted valuation framework which takes a dynamic view of non-life insurance reserving risk.

Using function approximation to determine neural network accuracy

International Nuclear Information System (INIS)

Wichman, R.F.; Alexander, J.

2013-01-01

Many, if not most, control processes demonstrate nonlinear behavior in some portion of their operating range and the ability of neural networks to model non-linear dynamics makes them very appealing for control. Control of high reliability safety systems, and autonomous control in process or robotic applications, however, require accurate and consistent control and neural networks are only approximators of various functions so their degree of approximation becomes important. In this paper, the factors affecting the ability of a feed-forward back-propagation neural network to accurately approximate a non-linear function are explored. Compared to pattern recognition using a neural network for function approximation provides an easy and accurate method for determining the network's accuracy. In contrast to other techniques, we show that errors arising in function approximation or curve fitting are caused by the neural network itself rather than scatter in the data. A method is proposed that provides improvements in the accuracy achieved during training and resulting ability of the network to generalize after training. Binary input vectors provided a more accurate model than with scalar inputs and retraining using a small number of the outlier x,y pairs improved generalization. (author)

The application of deep confidence network in the problem of image recognition

Directory of Open Access Journals (Sweden)

Chumachenko О.І.

2016-12-01

Full Text Available In order to study the concept of deep learning, in particular the substitution of multilayer perceptron on the corresponding network of deep confidence, computer simulations of the learning process to test voters was carried out. Multi-layer perceptron has been replaced by a network of deep confidence, consisting of successive limited Boltzmann machines. After training of a network of deep confidence algorithm of layer-wise training it was found that the use of networks of deep confidence greatly improves the accuracy of multilayer perceptron training by method of reverse distribution errors.

Whitelists Based Multiple Filtering Techniques in SCADA Sensor Networks

Directory of Open Access Journals (Sweden)

DongHo Kang

2014-01-01

Full Text Available Internet of Things (IoT consists of several tiny devices connected together to form a collaborative computing environment. Recently IoT technologies begin to merge with supervisory control and data acquisition (SCADA sensor networks to more efficiently gather and analyze real-time data from sensors in industrial environments. But SCADA sensor networks are becoming more and more vulnerable to cyber-attacks due to increased connectivity. To safely adopt IoT technologies in the SCADA environments, it is important to improve the security of SCADA sensor networks. In this paper we propose a multiple filtering technique based on whitelists to detect illegitimate packets. Our proposed system detects the traffic of network and application protocol attacks with a set of whitelists collected from normal traffic.

Lifetime Maximizing Adaptive Power Control in Wireless Sensor Networks

National Research Council Canada - National Science Library

Sun, Fangting; Shayman, Mark

2006-01-01

...: adaptive power control. They focus on the sensor networks that consist of a sink and a set of homogeneous wireless sensor nodes, which are randomly deployed according to a uniform distribution...

Quasiparticles and thermodynamical consistency

International Nuclear Information System (INIS)

Shanenko, A.A.; Biro, T.S.; Toneev, V.D.

2003-01-01

A brief and simple introduction into the problem of the thermodynamical consistency is given. The thermodynamical consistency relations, which should be taken into account under constructing a quasiparticle model, are found in a general manner from the finite-temperature extension of the Hellmann-Feynman theorem. Restrictions following from these relations are illustrated by simple physical examples. (author)

Web server's reliability improvements using recurrent neural networks

DEFF Research Database (Denmark)

Madsen, Henrik; Albu, Rǎzvan-Daniel; Felea, Ioan

2012-01-01

In this paper we describe an interesting approach to error prediction illustrated by experimental results. The application consists of monitoring the activity for the web servers in order to collect the specific data. Predicting an error with severe consequences for the performance of a server (t...... usage, network usage and memory usage. We collect different data sets from monitoring the web server's activity and for each one we predict the server's reliability with the proposed recurrent neural network. © 2012 Taylor & Francis Group...

Autonomous power networks based power system

International Nuclear Information System (INIS)

Jokic, A.; Van den Bosch, P.P.J.

2006-01-01

This paper presented the concept of autonomous networks to cope with this increased complexity in power systems while enhancing market-based operation. The operation of future power systems will be more challenging and demanding than present systems because of increased uncertainties, less inertia in the system, replacement of centralized coordinating activities by decentralized parties and the reliance on dynamic markets for both power balancing and system reliability. An autonomous network includes the aggregation of networked producers and consumers in a relatively small area with respect to the overall system. The operation of an autonomous network is coordinated and controlled with one central unit acting as an interface between internal producers/consumers and the rest of the power system. In this study, the power balance problem and system reliability through provision of ancillary services was formulated as an optimization problem for the overall autonomous networks based power system. This paper described the simulation of an optimal autonomous network dispatching in day ahead markets, based on predicted spot prices for real power, and two ancillary services. It was concluded that large changes occur in a power systems structure and operation, most of them adding to the uncertainty and complexity of the system. The introduced concept of an autonomous power network-based power system was shown to be a realistic and consistent approach to formulate and operate a market-based dispatch of both power and ancillary services. 9 refs., 4 figs

Intrinsic and task-evoked network architectures of the human brain

Science.gov (United States)

Cole, Michael W.; Bassett, Danielle S.; Power, Jonathan D.; Braver, Todd S.; Petersen, Steven E.

2014-01-01

Summary Many functional network properties of the human brain have been identified during rest and task states, yet it remains unclear how the two relate. We identified a whole-brain network architecture present across dozens of task states that was highly similar to the resting-state network architecture. The most frequent functional connectivity strengths across tasks closely matched the strengths observed at rest, suggesting this is an “intrinsic”, standard architecture of functional brain organization. Further, a set of small but consistent changes common across tasks suggests the existence of a task-general network architecture distinguishing task states from rest. These results indicate the brain’s functional network architecture during task performance is shaped primarily by an intrinsic network architecture that is also present during rest, and secondarily by evoked task-general and task-specific network changes. This establishes a strong relationship between resting-state functional connectivity and task-evoked functional connectivity – areas of neuroscientific inquiry typically considered separately. PMID:24991964

Macroscopic Models of Clique Tree Growth for Bayesian Networks

Data.gov (United States)

National Aeronautics and Space Administration — In clique tree clustering, inference consists of propagation in a clique tree compiled from a Bayesian network. In this paper, we develop an analytical approach to...

Violence on canadian television networks.

Science.gov (United States)

Paquette, Guy

2004-02-01

Over the past twenty years, the question of the effects of violence on television has figured prominently in public opinion and hundreds of studies have been devoted to this subject. Many researchers have determined that violence has a negative impact on behavior. The public, broadcasters and political figures all support the idea of reducing the total amount of violence on television - in particular in shows for children. A thousand programs aired between 1993 and 2001 on major non-specialty television networks in Canada were analyzed: TVA, TQS, as well as CTV and Global, private French and English networks, as well as the English CBC Radio and French Radio-Canada for the public networks. The methodology consists of a classic analysis of content where an act of violence constitutes a unit of analysis. The data collected revealed that the amount of violence has increased regularly since 1993 despite the stated willingness on the part of broadcasters to produce programs with less violence. The total number of violent acts, as well as the number of violent acts per hour, is increasing. Private networks deliver three times more violence than public networks. Researchers have also noted that a high proportion of violence occurs in programs airing before 21:00 hours, thereby exposing a large number of children to this violence. Psychological violence is taking on a more significant role in Canadian Television.

Networked Rectenna Array for Smart Material Actuators

Science.gov (United States)

Choi, Sang H.; Golembiewski, Walter T.; Song, Kyo D.

2000-01-01

The concept of microwave-driven smart material actuators is envisioned as the best option to alleviate the complexity associated with hard-wired control circuitry. Networked rectenna patch array receives and converts microwave power into a DC power for an array of smart actuators. To use microwave power effectively, the concept of a power allocation and distribution (PAD) circuit is adopted for networking a rectenna/actuator patch array. The PAD circuit is imbedded into a single embodiment of rectenna and actuator array. The thin-film microcircuit embodiment of PAD circuit adds insignificant amount of rigidity to membrane flexibility. Preliminary design and fabrication of PAD circuitry that consists of a few nodal elements were made for laboratory testing. The networked actuators were tested to correlate the network coupling effect, power allocation and distribution, and response time. The features of preliminary design are 16-channel computer control of actuators by a PCI board and the compensator for a power failure or leakage of one or more rectennas.

Synchronization in networks with multiple interaction layers

Science.gov (United States)

del Genio, Charo I.; Gómez-Gardeñes, Jesús; Bonamassa, Ivan; Boccaletti, Stefano

2016-01-01

The structure of many real-world systems is best captured by networks consisting of several interaction layers. Understanding how a multilayered structure of connections affects the synchronization properties of dynamical systems evolving on top of it is a highly relevant endeavor in mathematics and physics and has potential applications in several socially relevant topics, such as power grid engineering and neural dynamics. We propose a general framework to assess the stability of the synchronized state in networks with multiple interaction layers, deriving a necessary condition that generalizes the master stability function approach. We validate our method by applying it to a network of Rössler oscillators with a double layer of interactions and show that highly rich phenomenology emerges from this. This includes cases where the stability of synchronization can be induced even if both layers would have individually induced unstable synchrony, an effect genuinely arising from the true multilayer structure of the interactions among the units in the network. PMID:28138540

Friendship network position and salivary cortisol levels.

Science.gov (United States)

Kornienko, Olga; Clemans, Katherine H; Out, Dorothée; Granger, Douglas A

2013-01-01

We employed a social network analysis approach to examine the associations between friendship network position and cortisol levels. The sample consisted of 74 first-year students (93% female, ages 22-38 years, M = 27) from a highly competitive, accelerated Nursing program. Participants completed questionnaires online, and the entire group met at one time to complete a series of sociometric nominations and donated a saliva sample. Saliva was later assayed for cortisol. Metrics derived from directed friendship nominations indexed each student's friendship network status regarding popularity, gregariousness, and degree of interconnectedness. Results revealed that (1) individuals with lower gregariousness status (i.e., lowest number of outgoing ties) had higher cortisol levels, and (2) individuals with higher popularity status (i.e., higher numbers of incoming ties) had higher cortisol levels. Popularity and gregariousness-based network status is significantly associated with hypothalamic-pituitary-adrenal axis activity. Implications for prevailing theories of the social determinants of individual differences in biological sensitivity and susceptibility to context are discussed.

Computing with networks of nonlinear mechanical oscillators.

Directory of Open Access Journals (Sweden)

Jean C Coulombe

Full Text Available As it is getting increasingly difficult to achieve gains in the density and power efficiency of microelectronic computing devices because of lithographic techniques reaching fundamental physical limits, new approaches are required to maximize the benefits of distributed sensors, micro-robots or smart materials. Biologically-inspired devices, such as artificial neural networks, can process information with a high level of parallelism to efficiently solve difficult problems, even when implemented using conventional microelectronic technologies. We describe a mechanical device, which operates in a manner similar to artificial neural networks, to solve efficiently two difficult benchmark problems (computing the parity of a bit stream, and classifying spoken words. The device consists in a network of masses coupled by linear springs and attached to a substrate by non-linear springs, thus forming a network of anharmonic oscillators. As the masses can directly couple to forces applied on the device, this approach combines sensing and computing functions in a single power-efficient device with compact dimensions.

Percolation of interdependent network of networks

International Nuclear Information System (INIS)

Havlin, Shlomo; Stanley, H. Eugene; Bashan, Amir; Gao, Jianxi; Kenett, Dror Y.

2015-01-01

Complex networks appear in almost every aspect of science and technology. Previous work in network theory has focused primarily on analyzing single networks that do not interact with other networks, despite the fact that many real-world networks interact with and depend on each other. Very recently an analytical framework for studying the percolation properties of interacting networks has been introduced. Here we review the analytical framework and the results for percolation laws for a Network Of Networks (NONs) formed by n interdependent random networks. The percolation properties of a network of networks differ greatly from those of single isolated networks. In particular, because the constituent networks of a NON are connected by node dependencies, a NON is subject to cascading failure. When there is strong interdependent coupling between networks, the percolation transition is discontinuous (first-order) phase transition, unlike the well-known continuous second-order transition in single isolated networks. Moreover, although networks with broader degree distributions, e.g., scale-free networks, are more robust when analyzed as single networks, they become more vulnerable in a NON. We also review the effect of space embedding on network vulnerability. It is shown that for spatially embedded networks any finite fraction of dependency nodes will lead to abrupt transition

Design and implementation considerations of a MSAT packet data network

Science.gov (United States)

Karam, Fouad G.; Hearn, Terry; Rohr, Doug; Guibord, Arthur F.

1993-01-01

The Mobile Data System, which is intended to provide for packet switched data services is currently under development. The system is based on a star network topology consisting of a centralized Data Hub (DH) serving a large number of mobile terminals. Through the Data Hub, end-to-end connections can be established between terrestrial users on public or private data networks and mobile users. The MDS network will be capable of offering a variety of services some of which are based on the standard X.25 network interface protocol, and others optimized for short messages and broadcast messages. A description of these services and the trade-offs in the DH design are presented.

Feasibility of Optical Packet Switched WDM Networks without Packet Synchronisation Under Bursty Traffic Conditions

DEFF Research Database (Denmark)

Fjelde, Tina; Hansen, Peter Bukhave; Kloch, Allan

1999-01-01

We show that complex packet synchronisation may be avoided in optical packetswitched networks. Detailed traffic analysis demonstrates that packet lossratios of 1e-10 are feasible under bursty traffic conditions for a highcapacity network consisting of asynchronously operated add-drop switch...

Heterogeneous Wireless Mesh Network Technology Evaluation for Space Proximity and Surface Applications

Science.gov (United States)

DeCristofaro, Michael A.; Lansdowne, Chatwin A.; Schlesinger, Adam M.

2014-01-01

NASA has identified standardized wireless mesh networking as a key technology for future human and robotic space exploration. Wireless mesh networks enable rapid deployment, provide coverage in undeveloped regions. Mesh networks are also self-healing, resilient, and extensible, qualities not found in traditional infrastructure-based networks. Mesh networks can offer lower size, weight, and power (SWaP) than overlapped infrastructure-perapplication. To better understand the maturity, characteristics and capability of the technology, we developed an 802.11 mesh network consisting of a combination of heterogeneous commercial off-the-shelf devices and opensource firmware and software packages. Various streaming applications were operated over the mesh network, including voice and video, and performance measurements were made under different operating scenarios. During the testing several issues with the currently implemented mesh network technology were identified and outlined for future work.

Robustness and Vulnerability of Networks with Dynamical Dependency Groups.

Science.gov (United States)

Bai, Ya-Nan; Huang, Ning; Wang, Lei; Wu, Zhi-Xi

2016-11-28

The dependency property and self-recovery of failure nodes both have great effects on the robustness of networks during the cascading process. Existing investigations focused mainly on the failure mechanism of static dependency groups without considering the time-dependency of interdependent nodes and the recovery mechanism in reality. In this study, we present an evolving network model consisting of failure mechanisms and a recovery mechanism to explore network robustness, where the dependency relations among nodes vary over time. Based on generating function techniques, we provide an analytical framework for random networks with arbitrary degree distribution. In particular, we theoretically find that an abrupt percolation transition exists corresponding to the dynamical dependency groups for a wide range of topologies after initial random removal. Moreover, when the abrupt transition point is above the failure threshold of dependency groups, the evolving network with the larger dependency groups is more vulnerable; when below it, the larger dependency groups make the network more robust. Numerical simulations employing the Erdős-Rényi network and Barabási-Albert scale free network are performed to validate our theoretical results.