Robust-yet-fragile nature of interdependent networks

Science.gov (United States)

Tan, Fei; Xia, Yongxiang; Wei, Zhi

2015-05-01

Interdependent networks have been shown to be extremely vulnerable based on the percolation model. Parshani et al. [Europhys. Lett. 92, 68002 (2010), 10.1209/0295-5075/92/68002] further indicated that the more intersimilar networks are, the more robust they are to random failures. When traffic load is considered, how do the coupling patterns impact cascading failures in interdependent networks? This question has been largely unexplored until now. In this paper, we address this question by investigating the robustness of interdependent Erdös-Rényi random graphs and Barabási-Albert scale-free networks under either random failures or intentional attacks. It is found that interdependent Erdös-Rényi random graphs are robust yet fragile under either random failures or intentional attacks. Interdependent Barabási-Albert scale-free networks, however, are only robust yet fragile under random failures but fragile under intentional attacks. We further analyze the interdependent communication network and power grid and achieve similar results. These results advance our understanding of how interdependency shapes network robustness.

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.

Modeling stochasticity and robustness in gene regulatory networks.

Science.gov (United States)

Garg, Abhishek; Mohanram, Kartik; Di Cara, Alessandro; De Micheli, Giovanni; Xenarios, Ioannis

2009-06-15

Understanding gene regulation in biological processes and modeling the robustness of underlying regulatory networks is an important problem that is currently being addressed by computational systems biologists. Lately, there has been a renewed interest in Boolean modeling techniques for gene regulatory networks (GRNs). However, due to their deterministic nature, it is often difficult to identify whether these modeling approaches are robust to the addition of stochastic noise that is widespread in gene regulatory processes. Stochasticity in Boolean models of GRNs has been addressed relatively sparingly in the past, mainly by flipping the expression of genes between different expression levels with a predefined probability. This stochasticity in nodes (SIN) model leads to over representation of noise in GRNs and hence non-correspondence with biological observations. In this article, we introduce the stochasticity in functions (SIF) model for simulating stochasticity in Boolean models of GRNs. By providing biological motivation behind the use of the SIF model and applying it to the T-helper and T-cell activation networks, we show that the SIF model provides more biologically robust results than the existing SIN model of stochasticity in GRNs. Algorithms are made available under our Boolean modeling toolbox, GenYsis. The software binaries can be downloaded from http://si2.epfl.ch/ approximately garg/genysis.html.

Robustness Envelopes of Networks

NARCIS (Netherlands)

Trajanovski, S.; Martín-Hernández, J.; Winterbach, W.; Van Mieghem, P.

2013-01-01

We study the robustness of networks under node removal, considering random node failure, as well as targeted node attacks based on network centrality measures. Whilst both of these have been studied in the literature, existing approaches tend to study random failure in terms of average-case

Impact of self-healing capability on network robustness

Science.gov (United States)

Shang, Yilun

2015-04-01

A wide spectrum of real-life systems ranging from neurons to botnets display spontaneous recovery ability. Using the generating function formalism applied to static uncorrelated random networks with arbitrary degree distributions, the microscopic mechanism underlying the depreciation-recovery process is characterized and the effect of varying self-healing capability on network robustness is revealed. It is found that the self-healing capability of nodes has a profound impact on the phase transition in the emergence of percolating clusters, and that salient difference exists in upholding network integrity under random failures and intentional attacks. The results provide a theoretical framework for quantitatively understanding the self-healing phenomenon in varied complex systems.

Robustness of airline alliance route networks

Science.gov (United States)

Lordan, Oriol; Sallan, Jose M.; Simo, Pep; Gonzalez-Prieto, David

2015-05-01

The aim of this study is to analyze the robustness of the three major airline alliances' (i.e., Star Alliance, oneworld and SkyTeam) route networks. Firstly, the normalization of a multi-scale measure of vulnerability is proposed in order to perform the analysis in networks with different sizes, i.e., number of nodes. An alternative node selection criterion is also proposed in order to study robustness and vulnerability of such complex networks, based on network efficiency. And lastly, a new procedure - the inverted adaptive strategy - is presented to sort the nodes in order to anticipate network breakdown. Finally, the robustness of the three alliance networks are analyzed with (1) a normalized multi-scale measure of vulnerability, (2) an adaptive strategy based on four different criteria and (3) an inverted adaptive strategy based on the efficiency criterion. The results show that Star Alliance has the most resilient route network, followed by SkyTeam and then oneworld. It was also shown that the inverted adaptive strategy based on the efficiency criterion - inverted efficiency - shows a great success in quickly breaking networks similar to that found with betweenness criterion but with even better results.

Data-driven quantification of the robustness and sensitivity of cell signaling networks

International Nuclear Information System (INIS)

Mukherjee, Sayak; Seok, Sang-Cheol; Vieland, Veronica J; Das, Jayajit

2013-01-01

Robustness and sensitivity of responses generated by cell signaling networks has been associated with survival and evolvability of organisms. However, existing methods analyzing robustness and sensitivity of signaling networks ignore the experimentally observed cell-to-cell variations of protein abundances and cell functions or contain ad hoc assumptions. We propose and apply a data-driven maximum entropy based method to quantify robustness and sensitivity of Escherichia coli (E. coli) chemotaxis signaling network. Our analysis correctly rank orders different models of E. coli chemotaxis based on their robustness and suggests that parameters regulating cell signaling are evolutionary selected to vary in individual cells according to their abilities to perturb cell functions. Furthermore, predictions from our approach regarding distribution of protein abundances and properties of chemotactic responses in individual cells based on cell population averaged data are in excellent agreement with their experimental counterparts. Our approach is general and can be used to evaluate robustness as well as generate predictions of single cell properties based on population averaged experimental data in a wide range of cell signaling systems. (paper)

A robust neural network-based approach for microseismic event detection

KAUST Repository

Akram, Jubran

2017-08-17

We present an artificial neural network based approach for robust event detection from low S/N waveforms. We use a feed-forward network with a single hidden layer that is tuned on a training dataset and later applied on the entire example dataset for event detection. The input features used include the average of absolute amplitudes, variance, energy-ratio and polarization rectilinearity. These features are calculated in a moving-window of same length for the entire waveform. The output is set as a user-specified relative probability curve, which provides a robust way of distinguishing between weak and strong events. An optimal network is selected by studying the weight-based saliency and effect of number of neurons on the predicted results. Using synthetic data examples, we demonstrate that this approach is effective in detecting weaker events and reduces the number of false positives.

Robust convergence of Cohen-Grossberg neural networks with time-varying delays

International Nuclear Information System (INIS)

Xiong Wenjun; Ma Deyi; Liang Jinling

2009-01-01

In this paper, robust convergence is studied for the Cohen-Grossberg neural networks (CGNNs) with time-varying delays. By applying the differential inequality and the Lyapunov method, some delay-independent conditions are derived ensuring the robust CGNNs to converge, globally, uniformly and exponentially, to a ball in the state space with a pre-specified convergence rate. Finally, the effectiveness of our results are verified by an illustrative example.

Robust adaptive synchronization of general dynamical networks ...

Indian Academy of Sciences (India)

Robust adaptive synchronization; dynamical network; multiple delays; multiple uncertainties. ... Networks such as neural networks, communication transmission networks, social rela- tionship networks etc. ..... a very good effect. Pramana – J.

Characterizing and predicting the robustness of power-law networks

International Nuclear Information System (INIS)

LaRocca, Sarah; Guikema, Seth D.

2015-01-01

Power-law networks such as the Internet, terrorist cells, species relationships, and cellular metabolic interactions are susceptible to node failures, yet maintaining network connectivity is essential for network functionality. Disconnection of the network leads to fragmentation and, in some cases, collapse of the underlying system. However, the influences of the topology of networks on their ability to withstand node failures are poorly understood. Based on a study of the response of 2000 randomly-generated power-law networks to node failures, we find that networks with higher nodal degree and clustering coefficient, lower betweenness centrality, and lower variability in path length and clustering coefficient maintain their cohesion better during such events. We also find that network robustness, i.e., the ability to withstand node failures, can be accurately predicted a priori for power-law networks across many fields. These results provide a basis for designing new, more robust networks, improving the robustness of existing networks such as the Internet and cellular metabolic pathways, and efficiently degrading networks such as terrorist cells. - Highlights: • Examine relationship between network topology and robustness to failures. • Relationship is statistically significant for scale-free networks. • Use statistical models to estimate robustness to failures for real-world networks

Abductive networks applied to electronic combat

Science.gov (United States)

Montgomery, Gerard J.; Hess, Paul; Hwang, Jong S.

1990-08-01

A practical approach to dealing with combinatorial decision problems and uncertainties associated with electronic combat through the use of networks of high-level functional elements called abductive networks is presented. It describes the application of the Abductory Induction Mechanism (AIMTM) a supervised inductive learning tool for synthesizing polynomial abductive networks to the electronic combat problem domain. From databases of historical expert-generated or simulated combat engagements AIM can often induce compact and robust network models for making effective real-time electronic combat decisions despite significant uncertainties or a combinatorial explosion of possible situations. The feasibility of applying abductive networks to realize advanced combat decision aiding capabilities was demonstrated by applying AIM to a set of electronic combat simulations. The networks synthesized by AIM generated accurate assessments of the intent lethality and overall risk associated with a variety of simulated threats and produced reasonable estimates of the expected effectiveness of a group of electronic countermeasures for a large number of simulated combat scenarios. This paper presents the application of abductive networks to electronic combat summarizes the results of experiments performed using AIM discusses the benefits and limitations of applying abductive networks to electronic combat and indicates why abductive networks can often result in capabilities not attainable using alternative approaches. 1. ELECTRONIC COMBAT. UNCERTAINTY. AND MACHINE LEARNING Electronic combat has become an essential part of the ability to make war and has become increasingly complex since

Robustness and modular structure in networks

DEFF Research Database (Denmark)

Bagrow, James P.; Lehmann, Sune; Ahn, Yong-Yeol

2015-01-01

-12]. Many complex systems, from power grids and the Internet to the brain and society [13-15], can be modeled using modular networks comprised of small, densely connected groups of nodes [16, 17]. These modules often overlap, with network elements belonging to multiple modules [18, 19]. Yet existing work...... on robustness has not considered the role of overlapping, modular structure. Here we study the robustness of these systems to the failure of elements. We show analytically and empirically that it is possible for the modules themselves to become uncoupled or non-overlapping well before the network disintegrates....... If overlapping modular organization plays a role in overall functionality, networks may be far more vulnerable than predicted by conventional percolation theory....

Two stage neural network modelling for robust model predictive control.

Science.gov (United States)

Patan, Krzysztof

2018-01-01

The paper proposes a novel robust model predictive control scheme realized by means of artificial neural networks. The neural networks are used twofold: to design the so-called fundamental model of a plant and to catch uncertainty associated with the plant model. In order to simplify the optimization process carried out within the framework of predictive control an instantaneous linearization is applied which renders it possible to define the optimization problem in the form of constrained quadratic programming. Stability of the proposed control system is also investigated by showing that a cost function is monotonically decreasing with respect to time. Derived robust model predictive control is tested and validated on the example of a pneumatic servomechanism working at different operating regimes. Copyright © 2017 ISA. Published by Elsevier Ltd. All rights reserved.

Approximability of Robust Network Design

NARCIS (Netherlands)

Olver, N.K.; Shepherd, F.B.

2014-01-01

We consider robust (undirected) network design (RND) problems where the set of feasible demands may be given by an arbitrary convex body. This model, introduced by Ben-Ameur and Kerivin [Ben-Ameur W, Kerivin H (2003) New economical virtual private networks. Comm. ACM 46(6):69-73], generalizes the

Robustness of networks against propagating attacks under vaccination strategies

International Nuclear Information System (INIS)

Hasegawa, Takehisa; Masuda, Naoki

2011-01-01

We study the effect of vaccination on the robustness of networks against propagating attacks that obey the susceptible–infected–removed model. By extending the generating function formalism developed by Newman (2005 Phys. Rev. Lett. 95 108701), we analytically determine the robustness of networks that depends on the vaccination parameters. We consider the random defense where nodes are vaccinated randomly and the degree-based defense where hubs are preferentially vaccinated. We show that, when vaccines are inefficient, the random graph is more robust against propagating attacks than the scale-free network. When vaccines are relatively efficient, the scale-free network with the degree-based defense is more robust than the random graph with the random defense and the scale-free network with the random defense

Tension and robustness in multitasking cellular networks.

Directory of Open Access Journals (Sweden)

Jeffrey V Wong

Full Text Available Cellular networks multitask by exhibiting distinct, context-dependent dynamics. However, network states (parameters that generate a particular dynamic are often sub-optimal for others, defining a source of "tension" between them. Though multitasking is pervasive, it is not clear where tension arises, what consequences it has, and how it is resolved. We developed a generic computational framework to examine the source and consequences of tension between pairs of dynamics exhibited by the well-studied RB-E2F switch regulating cell cycle entry. We found that tension arose from task-dependent shifts in parameters associated with network modules. Although parameter sets common to distinct dynamics did exist, tension reduced both their accessibility and resilience to perturbation, indicating a trade-off between "one-size-fits-all" solutions and robustness. With high tension, robustness can be preserved by dynamic shifting of modules, enabling the network to toggle between tasks, and by increasing network complexity, in this case by gene duplication. We propose that tension is a general constraint on the architecture and operation of multitasking biological networks. To this end, our work provides a framework to quantify the extent of tension between any network dynamics and how it affects network robustness. Such analysis would suggest new ways to interfere with network elements to elucidate the design principles of cellular networks.

Critical cooperation range to improve spatial network robustness.

Directory of Open Access Journals (Sweden)

Vitor H P Louzada

Full Text Available A robust worldwide air-transportation network (WAN is one that minimizes the number of stranded passengers under a sequence of airport closures. Building on top of this realistic example, here we address how spatial network robustness can profit from cooperation between local actors. We swap a series of links within a certain distance, a cooperation range, while following typical constraints of spatially embedded networks. We find that the network robustness is only improved above a critical cooperation range. Such improvement can be described in the framework of a continuum transition, where the critical exponents depend on the spatial correlation of connected nodes. For the WAN we show that, except for Australia, all continental networks fall into the same universality class. Practical implications of this result are also discussed.

Neutron spectrometry and dosimetry by means of Bonner spheres system and artificial neural networks applying robust design of artificial neural networks

Energy Technology Data Exchange (ETDEWEB)

Martinez B, M.R.; Ortiz R, J.M.; Vega C, H.R. [UAZ, Av. Ramon Lopez Velarde No. 801, 98000 Zacatecas (Mexico)

2006-07-01

An Artificial Neural Network has been designed, trained and tested to unfold neutron spectra and simultaneously to calculate equivalent doses. A set of 187 neutron spectra compiled by the International Atomic Energy Agency and 13 equivalent doses were used in the artificial neural network designed, trained and tested. In order to design the neural network was used the robust design of artificial neural networks methodology, which assures that the quality of the neural networks takes into account from the design stage. Unless previous works, here, for first time a group of neural networks were designed and trained to unfold 187 neutron spectra and at the same time to calculate 13 equivalent doses, starting from the count rates coming from the Bonner spheres system by using a systematic and experimental strategy. (Author)

Neutron spectrometry and dosimetry by means of Bonner spheres system and artificial neural networks applying robust design of artificial neural networks

International Nuclear Information System (INIS)

Martinez B, M.R.; Ortiz R, J.M.; Vega C, H.R.

2006-01-01

An Artificial Neural Network has been designed, trained and tested to unfold neutron spectra and simultaneously to calculate equivalent doses. A set of 187 neutron spectra compiled by the International Atomic Energy Agency and 13 equivalent doses were used in the artificial neural network designed, trained and tested. In order to design the neural network was used the robust design of artificial neural networks methodology, which assures that the quality of the neural networks takes into account from the design stage. Unless previous works, here, for first time a group of neural networks were designed and trained to unfold 187 neutron spectra and at the same time to calculate 13 equivalent doses, starting from the count rates coming from the Bonner spheres system by using a systematic and experimental strategy. (Author)

Robust adaptive synchronization of general dynamical networks ...

Indian Academy of Sciences (India)

Home; Journals; Pramana – Journal of Physics; Volume 86; Issue 6. Robust ... A robust adaptive synchronization scheme for these general complex networks with multiple delays and uncertainties is established and raised by employing the robust adaptive control principle and the Lyapunov stability theory. We choose ...

Optimization of robustness of interdependent network controllability by redundant design.

Directory of Open Access Journals (Sweden)

Zenghu Zhang

Full Text Available Controllability of complex networks has been a hot topic in recent years. Real networks regarded as interdependent networks are always coupled together by multiple networks. The cascading process of interdependent networks including interdependent failure and overload failure will destroy the robustness of controllability for the whole network. Therefore, the optimization of the robustness of interdependent network controllability is of great importance in the research area of complex networks. In this paper, based on the model of interdependent networks constructed first, we determine the cascading process under different proportions of node attacks. Then, the structural controllability of interdependent networks is measured by the minimum driver nodes. Furthermore, we propose a parameter which can be obtained by the structure and minimum driver set of interdependent networks under different proportions of node attacks and analyze the robustness for interdependent network controllability. Finally, we optimize the robustness of interdependent network controllability by redundant design including node backup and redundancy edge backup and improve the redundant design by proposing different strategies according to their cost. Comparative strategies of redundant design are conducted to find the best strategy. Results shows that node backup and redundancy edge backup can indeed decrease those nodes suffering from failure and improve the robustness of controllability. Considering the cost of redundant design, we should choose BBS (betweenness-based strategy or DBS (degree based strategy for node backup and HDF(high degree first for redundancy edge backup. Above all, our proposed strategies are feasible and effective at improving the robustness of interdependent network controllability.

On the Interplay between the Evolvability and Network Robustness in an Evolutionary Biological Network: A Systems Biology Approach

Science.gov (United States)

Chen, Bor-Sen; Lin, Ying-Po

2011-01-01

In the evolutionary process, the random transmission and mutation of genes provide biological diversities for natural selection. In order to preserve functional phenotypes between generations, gene networks need to evolve robustly under the influence of random perturbations. Therefore, the robustness of the phenotype, in the evolutionary process, exerts a selection force on gene networks to keep network functions. However, gene networks need to adjust, by variations in genetic content, to generate phenotypes for new challenges in the network’s evolution, ie, the evolvability. Hence, there should be some interplay between the evolvability and network robustness in evolutionary gene networks. In this study, the interplay between the evolvability and network robustness of a gene network and a biochemical network is discussed from a nonlinear stochastic system point of view. It was found that if the genetic robustness plus environmental robustness is less than the network robustness, the phenotype of the biological network is robust in evolution. The tradeoff between the genetic robustness and environmental robustness in evolution is discussed from the stochastic stability robustness and sensitivity of the nonlinear stochastic biological network, which may be relevant to the statistical tradeoff between bias and variance, the so-called bias/variance dilemma. Further, the tradeoff could be considered as an antagonistic pleiotropic action of a gene network and discussed from the systems biology perspective. PMID:22084563

Robustness of the ATLAS pixel clustering neural network algorithm

CERN Document Server

AUTHOR|(INSPIRE)INSPIRE-00407780; The ATLAS collaboration

2016-01-01

Proton-proton collisions at the energy frontier puts strong constraints on track reconstruction algorithms. In the ATLAS track reconstruction algorithm, an artificial neural network is utilised to identify and split clusters of neighbouring read-out elements in the ATLAS pixel detector created by multiple charged particles. The robustness of the neural network algorithm is presented, probing its sensitivity to uncertainties in the detector conditions. The robustness is studied by evaluating the stability of the algorithm's performance under a range of variations in the inputs to the neural networks. Within reasonable variation magnitudes, the neural networks prove to be robust to most variation types.

Stability, gain, and robustness in quantum feedback networks

International Nuclear Information System (INIS)

D'Helon, C.; James, M. R.

2006-01-01

In this paper we are concerned with the problem of stability for quantum feedback networks. We demonstrate in the context of quantum optics how stability of quantum feedback networks can be guaranteed using only simple gain inequalities for network components and algebraic relationships determined by the network. Quantum feedback networks are shown to be stable if the loop gain is less than one--this is an extension of the famous small gain theorem of classical control theory. We illustrate the simplicity and power of the small gain approach with applications to important problems of robust stability and robust stabilization

Robust emergence of small-world structure in networks of spiking neurons.

Science.gov (United States)

Kwok, Hoi Fei; Jurica, Peter; Raffone, Antonino; van Leeuwen, Cees

2007-03-01

Spontaneous activity in biological neural networks shows patterns of dynamic synchronization. We propose that these patterns support the formation of a small-world structure-network connectivity optimal for distributed information processing. We present numerical simulations with connected Hindmarsh-Rose neurons in which, starting from random connection distributions, small-world networks evolve as a result of applying an adaptive rewiring rule. The rule connects pairs of neurons that tend fire in synchrony, and disconnects ones that fail to synchronize. Repeated application of the rule leads to small-world structures. This mechanism is robustly observed for bursting and irregular firing regimes.

Quantifying the robustness of metro networks

NARCIS (Netherlands)

Wang, X.; Koç, Y.; Derrible, S.; Nasir Ahmad, Sk.; Kooij, R.E.

2015-01-01

Metros (heavy rail transit systems) are integral parts of urban transportation systems. Failures in their operations can have serious impacts on urban mobility, and measuring their robustness is therefore critical. Moreover, as physical networks, metros can be viewed as network topological entities,

Robustness Analysis of Real Network Topologies Under Multiple Failure Scenarios

DEFF Research Database (Denmark)

Manzano, M.; Marzo, J. L.; Calle, E.

2012-01-01

on topological characteristics. Recently approaches also consider the services supported by such networks. In this paper we carry out a robustness analysis of five real backbone telecommunication networks under defined multiple failure scenarios, taking into account the consequences of the loss of established......Nowadays the ubiquity of telecommunication networks, which underpin and fulfill key aspects of modern day living, is taken for granted. Significant large-scale failures have occurred in the last years affecting telecommunication networks. Traditionally, network robustness analysis has been focused...... connections. Results show which networks are more robust in response to a specific type of failure....

Network robustness assessed within a dual connectivity framework: joint dynamics of the Active and Idle Networks.

Science.gov (United States)

Tejedor, Alejandro; Longjas, Anthony; Zaliapin, Ilya; Ambroj, Samuel; Foufoula-Georgiou, Efi

2017-08-17

Network robustness against attacks has been widely studied in fields as diverse as the Internet, power grids and human societies. But current definition of robustness is only accounting for half of the story: the connectivity of the nodes unaffected by the attack. Here we propose a new framework to assess network robustness, wherein the connectivity of the affected nodes is also taken into consideration, acknowledging that it plays a crucial role in properly evaluating the overall network robustness in terms of its future recovery from the attack. Specifically, we propose a dual perspective approach wherein at any instant in the network evolution under attack, two distinct networks are defined: (i) the Active Network (AN) composed of the unaffected nodes and (ii) the Idle Network (IN) composed of the affected nodes. The proposed robustness metric considers both the efficiency of destroying the AN and that of building-up the IN. We show, via analysis of well-known prototype networks and real world data, that trade-offs between the efficiency of Active and Idle Network dynamics give rise to surprising robustness crossovers and re-rankings, which can have significant implications for decision making.

Design of Robust Neural Network Classifiers

DEFF Research Database (Denmark)

Larsen, Jan; Andersen, Lars Nonboe; Hintz-Madsen, Mads

1998-01-01

This paper addresses a new framework for designing robust neural network classifiers. The network is optimized using the maximum a posteriori technique, i.e., the cost function is the sum of the log-likelihood and a regularization term (prior). In order to perform robust classification, we present...... a modified likelihood function which incorporates the potential risk of outliers in the data. This leads to the introduction of a new parameter, the outlier probability. Designing the neural classifier involves optimization of network weights as well as outlier probability and regularization parameters. We...... suggest to adapt the outlier probability and regularisation parameters by minimizing the error on a validation set, and a simple gradient descent scheme is derived. In addition, the framework allows for constructing a simple outlier detector. Experiments with artificial data demonstrate the potential...

Robust quantum network architectures and topologies for entanglement distribution

Science.gov (United States)

Das, Siddhartha; Khatri, Sumeet; Dowling, Jonathan P.

2018-01-01

Entanglement distribution is a prerequisite for several important quantum information processing and computing tasks, such as quantum teleportation, quantum key distribution, and distributed quantum computing. In this work, we focus on two-dimensional quantum networks based on optical quantum technologies using dual-rail photonic qubits for the building of a fail-safe quantum internet. We lay out a quantum network architecture for entanglement distribution between distant parties using a Bravais lattice topology, with the technological constraint that quantum repeaters equipped with quantum memories are not easily accessible. We provide a robust protocol for simultaneous entanglement distribution between two distant groups of parties on this network. We also discuss a memory-based quantum network architecture that can be implemented on networks with an arbitrary topology. We examine networks with bow-tie lattice and Archimedean lattice topologies and use percolation theory to quantify the robustness of the networks. In particular, we provide figures of merit on the loss parameter of the optical medium that depend only on the topology of the network and quantify the robustness of the network against intermittent photon loss and intermittent failure of nodes. These figures of merit can be used to compare the robustness of different network topologies in order to determine the best topology in a given real-world scenario, which is critical in the realization of the quantum internet.

Robustness analysis of interdependent networks under multiple-attacking strategies

Science.gov (United States)

Gao, Yan-Li; Chen, Shi-Ming; Nie, Sen; Ma, Fei; Guan, Jun-Jie

2018-04-01

The robustness of complex networks under attacks largely depends on the structure of a network and the nature of the attacks. Previous research on interdependent networks has focused on two types of initial attack: random attack and degree-based targeted attack. In this paper, a deliberate attack function is proposed, where six kinds of deliberate attacking strategies can be derived by adjusting the tunable parameters. Moreover, the robustness of four types of interdependent networks (BA-BA, ER-ER, BA-ER and ER-BA) with different coupling modes (random, positive and negative correlation) is evaluated under different attacking strategies. Interesting conclusions could be obtained. It can be found that the positive coupling mode can make the vulnerability of the interdependent network to be absolutely dependent on the most vulnerable sub-network under deliberate attacks, whereas random and negative coupling modes make the vulnerability of interdependent network to be mainly dependent on the being attacked sub-network. The robustness of interdependent network will be enhanced with the degree-degree correlation coefficient varying from positive to negative. Therefore, The negative coupling mode is relatively more optimal than others, which can substantially improve the robustness of the ER-ER network and ER-BA network. In terms of the attacking strategies on interdependent networks, the degree information of node is more valuable than the betweenness. In addition, we found a more efficient attacking strategy for each coupled interdependent network and proposed the corresponding protection strategy for suppressing cascading failure. Our results can be very useful for safety design and protection of interdependent networks.

Attack robustness and centrality of complex networks.

Directory of Open Access Journals (Sweden)

Swami Iyer

Full Text Available Many complex systems can be described by networks, in which the constituent components are represented by vertices and the connections between the components are represented by edges between the corresponding vertices. A fundamental issue concerning complex networked systems is the robustness of the overall system to the failure of its constituent parts. Since the degree to which a networked system continues to function, as its component parts are degraded, typically depends on the integrity of the underlying network, the question of system robustness can be addressed by analyzing how the network structure changes as vertices are removed. Previous work has considered how the structure of complex networks change as vertices are removed uniformly at random, in decreasing order of their degree, or in decreasing order of their betweenness centrality. Here we extend these studies by investigating the effect on network structure of targeting vertices for removal based on a wider range of non-local measures of potential importance than simply degree or betweenness. We consider the effect of such targeted vertex removal on model networks with different degree distributions, clustering coefficients and assortativity coefficients, and for a variety of empirical networks.

Robust recurrent neural network modeling for software fault detection and correction prediction

International Nuclear Information System (INIS)

Hu, Q.P.; Xie, M.; Ng, S.H.; Levitin, G.

2007-01-01

Software fault detection and correction processes are related although different, and they should be studied together. A practical approach is to apply software reliability growth models to model fault detection, and fault correction process is assumed to be a delayed process. On the other hand, the artificial neural networks model, as a data-driven approach, tries to model these two processes together with no assumptions. Specifically, feedforward backpropagation networks have shown their advantages over analytical models in fault number predictions. In this paper, the following approach is explored. First, recurrent neural networks are applied to model these two processes together. Within this framework, a systematic networks configuration approach is developed with genetic algorithm according to the prediction performance. In order to provide robust predictions, an extra factor characterizing the dispersion of prediction repetitions is incorporated into the performance function. Comparisons with feedforward neural networks and analytical models are developed with respect to a real data set

Robust outer synchronization between two nonlinear complex networks with parametric disturbances and mixed time-varying delays

Science.gov (United States)

Zhang, Chuan; Wang, Xingyuan; Luo, Chao; Li, Junqiu; Wang, Chunpeng

2018-03-01

In this paper, we focus on the robust outer synchronization problem between two nonlinear complex networks with parametric disturbances and mixed time-varying delays. Firstly, a general complex network model is proposed. Besides the nonlinear couplings, the network model in this paper can possess parametric disturbances, internal time-varying delay, discrete time-varying delay and distributed time-varying delay. Then, according to the robust control strategy, linear matrix inequality and Lyapunov stability theory, several outer synchronization protocols are strictly derived. Simple linear matrix controllers are designed to driver the response network synchronize to the drive network. Additionally, our results can be applied on the complex networks without parametric disturbances. Finally, by utilizing the delayed Lorenz chaotic system as the dynamics of all nodes, simulation examples are given to demonstrate the effectiveness of our theoretical results.

Advanced neural network-based computational schemes for robust fault diagnosis

CERN Document Server

Mrugalski, Marcin

2014-01-01

The present book is devoted to problems of adaptation of artificial neural networks to robust fault diagnosis schemes. It presents neural networks-based modelling and estimation techniques used for designing robust fault diagnosis schemes for non-linear dynamic systems. A part of the book focuses on fundamental issues such as architectures of dynamic neural networks, methods for designing of neural networks and fault diagnosis schemes as well as the importance of robustness. The book is of a tutorial value and can be perceived as a good starting point for the new-comers to this field. The book is also devoted to advanced schemes of description of neural model uncertainty. In particular, the methods of computation of neural networks uncertainty with robust parameter estimation are presented. Moreover, a novel approach for system identification with the state-space GMDH neural network is delivered. All the concepts described in this book are illustrated by both simple academic illustrative examples and practica...

Structural and robustness properties of smart-city transportation networks

International Nuclear Information System (INIS)

Zhang Zhen-Gang; Ding Zhuo; Fan Jing-Fang; Chen Xiao-Song; Meng Jun; Ye Fang-Fu; Ding Yi-Min

2015-01-01

The concept of smart city gives an excellent resolution to construct and develop modern cities, and also demands infrastructure construction. How to build a safe, stable, and highly efficient public transportation system becomes an important topic in the process of city construction. In this work, we study the structural and robustness properties of transportation networks and their sub-networks. We introduce a complementary network model to study the relevance and complementarity between bus network and subway network. Our numerical results show that the mutual supplement of networks can improve the network robustness. This conclusion provides a theoretical basis for the construction of public traffic networks, and it also supports reasonable operation of managing smart cities. (rapid communication)

Some scale-free networks could be robust under selective node attacks

Science.gov (United States)

Zheng, Bojin; Huang, Dan; Li, Deyi; Chen, Guisheng; Lan, Wenfei

2011-04-01

It is a mainstream idea that scale-free network would be fragile under the selective attacks. Internet is a typical scale-free network in the real world, but it never collapses under the selective attacks of computer viruses and hackers. This phenomenon is different from the deduction of the idea above because this idea assumes the same cost to delete an arbitrary node. Hence this paper discusses the behaviors of the scale-free network under the selective node attack with different cost. Through the experiments on five complex networks, we show that the scale-free network is possibly robust under the selective node attacks; furthermore, the more compact the network is, and the larger the average degree is, then the more robust the network is; with the same average degrees, the more compact the network is, the more robust the network is. This result would enrich the theory of the invulnerability of the network, and can be used to build robust social, technological and biological networks, and also has the potential to find the target of drugs.

Tradeoff between robustness and elaboration in carotenoid networks produces cycles of avian color diversification.

Science.gov (United States)

Badyaev, Alexander V; Morrison, Erin S; Belloni, Virginia; Sanderson, Michael J

2015-08-20

Resolution of the link between micro- and macroevolution calls for comparing both processes on the same deterministic landscape, such as genomic, metabolic or fitness networks. We apply this perspective to the evolution of carotenoid pigmentation that produces spectacular diversity in avian colors and show that basic structural properties of the underlying carotenoid metabolic network are reflected in global patterns of elaboration and diversification in color displays. Birds color themselves by consuming and metabolizing several dietary carotenoids from the environment. Such fundamental dependency on the most upstream external compounds should intrinsically constrain sustained evolutionary elongation of multi-step metabolic pathways needed for color elaboration unless the metabolic network gains robustness - the ability to synthesize the same carotenoid from an additional dietary starting point. We found that gains and losses of metabolic robustness were associated with evolutionary cycles of elaboration and stasis in expressed carotenoids in birds. Lack of metabolic robustness constrained lineage's metabolic explorations to the immediate biochemical vicinity of their ecologically distinct dietary carotenoids, whereas gains of robustness repeatedly resulted in sustained elongation of metabolic pathways on evolutionary time scales and corresponding color elaboration. The structural link between length and robustness in metabolic pathways may explain periodic convergence of phylogenetically distant and ecologically distinct species in expressed carotenoid pigmentation; account for stasis in carotenoid colors in some ecological lineages; and show how the connectivity of the underlying metabolic network provides a mechanistic link between microevolutionary elaboration and macroevolutionary diversification.

Correlated network of networks enhances robustness against catastrophic failures.

Science.gov (United States)

Min, Byungjoon; Zheng, Muhua

2018-01-01

Networks in nature rarely function in isolation but instead interact with one another with a form of a network of networks (NoN). A network of networks with interdependency between distinct networks contains instability of abrupt collapse related to the global rule of activation. As a remedy of the collapse instability, here we investigate a model of correlated NoN. We find that the collapse instability can be removed when hubs provide the majority of interconnections and interconnections are convergent between hubs. Thus, our study identifies a stable structure of correlated NoN against catastrophic failures. Our result further suggests a plausible way to enhance network robustness by manipulating connection patterns, along with other methods such as controlling the state of node based on a local rule.

Robustness of pinning a general complex dynamical network

International Nuclear Information System (INIS)

Wang Lei; Sun Youxian

2010-01-01

This Letter studies the robustness problem of pinning a general complex dynamical network toward an assigned synchronous evolution. Several synchronization criteria are presented to guarantee the convergence of the pinning process locally and globally by construction of Lyapunov functions. In particular, if a pinning strategy has been designed for synchronization of a given complex dynamical network, then no matter what uncertainties occur among the pinned nodes, synchronization can still be guaranteed through the pinning. The analytical results show that pinning control has a certain robustness against perturbations on network architecture: adding, deleting and changing the weights of edges. Numerical simulations illustrated by scale-free complex networks verify the theoretical results above-acquired.

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.

An effective method to improve the robustness of small-world networks under attack

International Nuclear Information System (INIS)

Zhang Zheng-Zhen; Xu Wen-Jun; Lin Jia-Ru; Zeng Shang-You

2014-01-01

In this study, the robustness of small-world networks to three types of attack is investigated. Global efficiency is introduced as the network coefficient to measure the robustness of a small-world network. The simulation results prove that an increase in rewiring probability or average degree can enhance the robustness of the small-world network under all three types of attack. The effectiveness of simultaneously increasing both rewiring probability and average degree is also studied, and the combined increase is found to significantly improve the robustness of the small-world network. Furthermore, the combined effect of rewiring probability and average degree on network robustness is shown to be several times greater than that of rewiring probability or average degree individually. This means that small-world networks with a relatively high rewiring probability and average degree have advantages both in network communications and in good robustness to attacks. Therefore, simultaneously increasing rewiring probability and average degree is an effective method of constructing realistic networks. Consequently, the proposed method is useful to construct efficient and robust networks in a realistic scenario. (interdisciplinary physics and related areas of science and technology)

Structural and robustness properties of smart-city transportation networks

Science.gov (United States)

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

2015-09-01

The concept of smart city gives an excellent resolution to construct and develop modern cities, and also demands infrastructure construction. How to build a safe, stable, and highly efficient public transportation system becomes an important topic in the process of city construction. In this work, we study the structural and robustness properties of transportation networks and their sub-networks. We introduce a complementary network model to study the relevance and complementarity between bus network and subway network. Our numerical results show that the mutual supplement of networks can improve the network robustness. This conclusion provides a theoretical basis for the construction of public traffic networks, and it also supports reasonable operation of managing smart cities. Project supported by the Major Projects of the China National Social Science Fund (Grant No. 11 & ZD154).

Satellite network robust QoS-aware routing

CERN Document Server

Long, Fei

2014-01-01

Satellite Network Robust QoS-aware Routing presents a novel routing strategy for satellite networks. This strategy is useful for the design of multi-layered satellite networks as it can greatly reduce the number of time slots in one system cycle. The traffic prediction and engineering approaches make the system robust so that the traffic spikes can be handled effectively. The multi-QoS optimization routing algorithm can satisfy various potential user requirements. Clear and sufficient illustrations are also presented in the book. As the chapters cover the above topics independently, readers from different research backgrounds in constellation design, multi-QoS routing, and traffic engineering can benefit from the book.   Fei Long is a senior engineer at Beijing R&D Center of 54th Research Institute of China Electronics Technology Group Corporation.

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.

Robust Sequential Covariance Intersection Fusion Kalman Filtering over Multi-agent Sensor Networks with Measurement Delays and Uncertain Noise Variances

Institute of Scientific and Technical Information of China (English)

QI Wen-Juan; ZHANG Peng; DENG Zi-Li

2014-01-01

This paper deals with the problem of designing robust sequential covariance intersection (SCI) fusion Kalman filter for the clustering multi-agent sensor network system with measurement delays and uncertain noise variances. The sensor network is partitioned into clusters by the nearest neighbor rule. Using the minimax robust estimation principle, based on the worst-case conservative sensor network system with conservative upper bounds of noise variances, and applying the unbiased linear minimum variance (ULMV) optimal estimation rule, we present the two-layer SCI fusion robust steady-state Kalman filter which can reduce communication and computation burdens and save energy sources, and guarantee that the actual filtering error variances have a less-conservative upper-bound. A Lyapunov equation method for robustness analysis is proposed, by which the robustness of the local and fused Kalman filters is proved. The concept of the robust accuracy is presented and the robust accuracy relations of the local and fused robust Kalman filters are proved. It is proved that the robust accuracy of the global SCI fuser is higher than those of the local SCI fusers and the robust accuracies of all SCI fusers are higher than that of each local robust Kalman filter. A simulation example for a tracking system verifies the robustness and robust accuracy relations.

Robustness analysis of the Zhang neural network for online time-varying quadratic optimization

International Nuclear Information System (INIS)

Zhang Yunong; Ruan Gongqin; Li Kene; Yang Yiwen

2010-01-01

A general type of recurrent neural network (termed as Zhang neural network, ZNN) has recently been proposed by Zhang et al for the online solution of time-varying quadratic-minimization (QM) and quadratic-programming (QP) problems. Global exponential convergence of the ZNN could be achieved theoretically in an ideal error-free situation. In this paper, with the normal differentiation and dynamics-implementation errors considered, the robustness properties of the ZNN model are investigated for solving these time-varying problems. In addition, linear activation functions and power-sigmoid activation functions could be applied to such a perturbed ZNN model. Both theoretical-analysis and computer-simulation results demonstrate the good ZNN robustness and superior performance for online time-varying QM and QP problem solving, especially when using power-sigmoid activation functions.

An integer optimization algorithm for robust identification of non-linear gene regulatory networks

Directory of Open Access Journals (Sweden)

Chemmangattuvalappil Nishanth

2012-09-01

. Furthermore, in both the in silico and experimental case studies, the predicted gene expression profiles are in very close agreement with the dynamics of the input data. Conclusions Our integer programming algorithm effectively utilizes bootstrapping to identify robust gene regulatory networks from noisy, non-linear time-series gene expression data. With significant noise and non-linearities being inherent to biological systems, the present formulism, with the incorporation of network sparsity, is extremely relevant to gene regulatory networks, and while the formulation has been validated against in silico and E. Coli data, it can be applied to any biological system.

Global robust stability of delayed recurrent neural networks

International Nuclear Information System (INIS)

Cao Jinde; Huang Deshuang; Qu Yuzhong

2005-01-01

This paper is concerned with the global robust stability of a class of delayed interval recurrent neural networks which contain time-invariant uncertain parameters whose values are unknown but bounded in given compact sets. A new sufficient condition is presented for the existence, uniqueness, and global robust stability of equilibria for interval neural networks with time delays by constructing Lyapunov functional and using matrix-norm inequality. An error is corrected in an earlier publication, and an example is given to show the effectiveness of the obtained results

Robustness of the p53 network and biological hackers.

Science.gov (United States)

Dartnell, Lewis; Simeonidis, Evangelos; Hubank, Michael; Tsoka, Sophia; Bogle, I David L; Papageorgiou, Lazaros G

2005-06-06

The p53 protein interaction network is crucial in regulating the metazoan cell cycle and apoptosis. Here, the robustness of the p53 network is studied by analyzing its degeneration under two modes of attack. Linear Programming is used to calculate average path lengths among proteins and the network diameter as measures of functionality. The p53 network is found to be robust to random loss of nodes, but vulnerable to a targeted attack against its hubs, as a result of its architecture. The significance of the results is considered with respect to mutational knockouts of proteins and the directed attacks mounted by tumour inducing viruses.

Robust visual tracking via multiscale deep sparse networks

Science.gov (United States)

Wang, Xin; Hou, Zhiqiang; Yu, Wangsheng; Xue, Yang; Jin, Zefenfen; Dai, Bo

2017-04-01

In visual tracking, deep learning with offline pretraining can extract more intrinsic and robust features. It has significant success solving the tracking drift in a complicated environment. However, offline pretraining requires numerous auxiliary training datasets and is considerably time-consuming for tracking tasks. To solve these problems, a multiscale sparse networks-based tracker (MSNT) under the particle filter framework is proposed. Based on the stacked sparse autoencoders and rectifier linear unit, the tracker has a flexible and adjustable architecture without the offline pretraining process and exploits the robust and powerful features effectively only through online training of limited labeled data. Meanwhile, the tracker builds four deep sparse networks of different scales, according to the target's profile type. During tracking, the tracker selects the matched tracking network adaptively in accordance with the initial target's profile type. It preserves the inherent structural information more efficiently than the single-scale networks. Additionally, a corresponding update strategy is proposed to improve the robustness of the tracker. Extensive experimental results on a large scale benchmark dataset show that the proposed method performs favorably against state-of-the-art methods in challenging environments.

Two-level Robust Measurement Fusion Kalman Filter for Clustering Sensor Networks

Institute of Scientific and Technical Information of China (English)

ZHANG Peng; QI Wen-Juan; DENG Zi-Li

2014-01-01

This paper investigates the distributed fusion Kalman filtering over clustering sensor networks. The sensor network is partitioned as clusters by the nearest neighbor rule and each cluster consists of sensing nodes and cluster-head. Using the minimax robust estimation principle, based on the worst-case conservative system with the conservative upper bounds of noise variances, two-level robust measurement fusion Kalman filter is presented for the clustering sensor network systems with uncertain noise variances. It can significantly reduce the communication load and save energy when the number of sensors is very large. A Lyapunov equation approach for the robustness analysis is presented, by which the robustness of the local and fused Kalman filters is proved. The concept of the robust accuracy is presented, and the robust accuracy relations among the local and fused robust Kalman filters are proved. It is proved that the robust accuracy of the two-level weighted measurement fuser is equal to that of the global centralized robust fuser and is higher than those of each local robust filter and each local weighted measurement fuser. A simulation example shows the correctness and effectiveness of the proposed results.

RECOVERY ACT - Robust Optimization for Connectivity and Flows in Dynamic Complex Networks

Energy Technology Data Exchange (ETDEWEB)

Balasundaram, Balabhaskar [Oklahoma State Univ., Stillwater, OK (United States); Butenko, Sergiy [Texas A & M Univ., College Station, TX (United States); Boginski, Vladimir [Univ. of Florida, Gainesville, FL (United States); Uryasev, Stan [Univ. of Florida, Gainesville, FL (United States)

2013-12-25

The goal of this project was to study robust connectivity and flow patterns of complex multi-scale systems modeled as networks. Networks provide effective ways to study global, system level properties, as well as local, multi-scale interactions at a component level. Numerous applications from power systems, telecommunication, transportation, biology, social science, and other areas have benefited from novel network-based models and their analysis. Modeling and optimization techniques that employ appropriate measures of risk for identifying robust clusters and resilient network designs in networks subject to uncertain failures were investigated in this collaborative multi-university project. In many practical situations one has to deal with uncertainties associated with possible failures of network components, thereby affecting the overall efficiency and performance of the system (e.g., every node/connection has a probability of partial or complete failure). Some extreme examples include power grid component failures, airline hub failures due to weather, or freeway closures due to emergencies. These are also situations in which people, materials, or other resources need to be managed efficiently. Important practical examples include rerouting flow through power grids, adjusting flight plans, and identifying routes for emergency services and supplies, in the event network elements fail unexpectedly. Solutions that are robust under uncertainty, in addition to being economically efficient, are needed. This project has led to the development of novel models and methodologies that can tackle the optimization problems arising in such situations. A number of new concepts, which have not been previously applied in this setting, were investigated in the framework of the project. The results can potentially help decision-makers to better control and identify robust or risk-averse decisions in such situations. Formulations and optimal solutions of the considered problems need

A Gossip-based Energy Efficient Protocol for Robust In-network Aggregation in Wireless Sensor Networks

Science.gov (United States)

Fauji, Shantanu

We consider the problem of energy efficient and fault tolerant in--network aggregation for wireless sensor networks (WSNs). In-network aggregation is the process of aggregation while collecting data from sensors to the base station. This process should be energy efficient due to the limited energy at the sensors and tolerant to the high failure rates common in sensor networks. Tree based in--network aggregation protocols, although energy efficient, are not robust to network failures. Multipath routing protocols are robust to failures to a certain degree but are not energy efficient due to the overhead in the maintenance of multiple paths. We propose a new protocol for in-network aggregation in WSNs, which is energy efficient, achieves high lifetime, and is robust to the changes in the network topology. Our protocol, gossip--based protocol for in-network aggregation (GPIA) is based on the spreading of information via gossip. GPIA is not only adaptive to failures and changes in the network topology, but is also energy efficient. Energy efficiency of GPIA comes from all the nodes being capable of selective message reception and detecting convergence of the aggregation early. We experimentally show that GPIA provides significant improvement over some other competitors like the Ridesharing, Synopsis Diffusion and the pure version of gossip. GPIA shows ten fold, five fold and two fold improvement over the pure gossip, the synopsis diffusion and Ridesharing protocols in terms of network lifetime, respectively. Further, GPIA retains gossip's robustness to failures and improves upon the accuracy of synopsis diffusion and Ridesharing.

Novel results for global robust stability of delayed neural networks

International Nuclear Information System (INIS)

Yucel, Eylem; Arik, Sabri

2009-01-01

This paper investigates the global robust convergence properties of continuous-time neural networks with discrete time delays. By employing suitable Lyapunov functionals, some sufficient conditions for the existence, uniqueness and global robust asymptotic stability of the equilibrium point are derived. The conditions can be easily verified as they can be expressed in terms of the network parameters only. Some numerical examples are also given to compare our results with previous robust stability results derived in the literature.

Reconfigurable Robust Routing for Mobile Outreach Network

Science.gov (United States)

Lin, Ching-Fang

2010-01-01

The Reconfigurable Robust Routing for Mobile Outreach Network (R3MOO N) provides advanced communications networking technologies suitable for the lunar surface environment and applications. The R3MOON techn ology is based on a detailed concept of operations tailored for luna r surface networks, and includes intelligent routing algorithms and wireless mesh network implementation on AGNC's Coremicro Robots. The product's features include an integrated communication solution inco rporating energy efficiency and disruption-tolerance in a mobile ad h oc network, and a real-time control module to provide researchers an d engineers a convenient tool for reconfiguration, investigation, an d management.

Robust classification using mixtures of dependency networks

DEFF Research Database (Denmark)

Gámez, José A.; Mateo, Juan L.; Nielsen, Thomas Dyhre

2008-01-01

Dependency networks have previously been proposed as alternatives to e.g. Bayesian networks by supporting fast algorithms for automatic learning. Recently dependency networks have also been proposed as classification models, but as with e.g. general probabilistic inference, the reported speed......-ups are often obtained at the expense of accuracy. In this paper we try to address this issue through the use of mixtures of dependency networks. To reduce learning time and improve robustness when dealing with data sparse classes, we outline methods for reusing calculations across mixture components. Finally...

Characterization of complex networks : Application to robustness analysis

NARCIS (Netherlands)

Jamakovic, A.

2008-01-01

This thesis focuses on the topological characterization of complex networks. It specifically focuses on those elementary graph measures that are of interest when quantifying topology-related aspects of the robustness of complex networks. This thesis makes the following contributions to the field of

Robust adaptive backstepping neural networks control for spacecraft rendezvous and docking with input saturation.

Science.gov (United States)

Xia, Kewei; Huo, Wei

2016-05-01

This paper presents a robust adaptive neural networks control strategy for spacecraft rendezvous and docking with the coupled position and attitude dynamics under input saturation. Backstepping technique is applied to design a relative attitude controller and a relative position controller, respectively. The dynamics uncertainties are approximated by radial basis function neural networks (RBFNNs). A novel switching controller consists of an adaptive neural networks controller dominating in its active region combined with an extra robust controller to avoid invalidation of the RBFNNs destroying stability of the system outside the neural active region. An auxiliary signal is introduced to compensate the input saturation with anti-windup technique, and a command filter is employed to approximate derivative of the virtual control in the backstepping procedure. Globally uniformly ultimately bounded of the relative states is proved via Lyapunov theory. Simulation example demonstrates effectiveness of the proposed control scheme. Copyright © 2016 ISA. Published by Elsevier Ltd. All rights reserved.

On the Interplay between Entropy and Robustness of Gene Regulatory Networks

Directory of Open Access Journals (Sweden)

Bor-Sen Chen

2010-05-01

Full Text Available The interplay between entropy and robustness of gene network is a core mechanism of systems biology. The entropy is a measure of randomness or disorder of a physical system due to random parameter fluctuation and environmental noises in gene regulatory networks. The robustness of a gene regulatory network, which can be measured as the ability to tolerate the random parameter fluctuation and to attenuate the effect of environmental noise, will be discussed from the robust H∞ stabilization and filtering perspective. In this review, we will also discuss their balancing roles in evolution and potential applications in systems and synthetic biology.

Optimisation in the Design of Environmental Sensor Networks with Robustness Consideration

Science.gov (United States)

Budi, Setia; de Souza, Paulo; Timms, Greg; Malhotra, Vishv; Turner, Paul

2015-01-01

This work proposes the design of Environmental Sensor Networks (ESN) through balancing robustness and redundancy. An Evolutionary Algorithm (EA) is employed to find the optimal placement of sensor nodes in the Region of Interest (RoI). Data quality issues are introduced to simulate their impact on the performance of the ESN. Spatial Regression Test (SRT) is also utilised to promote robustness in data quality of the designed ESN. The proposed method provides high network representativeness (fit for purpose) with minimum sensor redundancy (cost), and ensures robustness by enabling the network to continue to achieve its objectives when some sensors fail. PMID:26633392

Robustness of Dengue Complex Network under Targeted versus Random Attack

Directory of Open Access Journals (Sweden)

Hafiz Abid Mahmood Malik

2017-01-01

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

Research on robust optimization of emergency logistics network considering the time dependence characteristic

Science.gov (United States)

WANG, Qingrong; ZHU, Changfeng; LI, Ying; ZHANG, Zhengkun

2017-06-01

Considering the time dependence of emergency logistic network and complexity of the environment that the network exists in, in this paper the time dependent network optimization theory and robust discrete optimization theory are combined, and the emergency logistics dynamic network optimization model with characteristics of robustness is built to maximize the timeliness of emergency logistics. On this basis, considering the complexity of dynamic network and the time dependence of edge weight, an improved ant colony algorithm is proposed to realize the coupling of the optimization algorithm and the network time dependence and robustness. Finally, a case study has been carried out in order to testify validity of this robustness optimization model and its algorithm, and the value of different regulation factors was analyzed considering the importance of the value of the control factor in solving the optimal path. Analysis results show that this model and its algorithm above-mentioned have good timeliness and strong robustness.

Robust output synchronization of heterogeneous nonlinear agents in uncertain networks.

Science.gov (United States)

Yang, Xi; Wan, Fuhua; Tu, Mengchuan; Shen, Guojiang

2017-11-01

This paper investigates the global robust output synchronization problem for a class of nonlinear multi-agent systems. In the considered setup, the controlled agents are heterogeneous and with both dynamic and parametric uncertainties, the controllers are incapable of exchanging their internal states with the neighbors, and the communication network among agents is defined by an uncertain simple digraph. The problem is pursued via nonlinear output regulation theory and internal model based design. For each agent, the input-driven filter and the internal model compose the controller, and the decentralized dynamic output feedback control law is derived by using backstepping method and the modified dynamic high-gain technique. The theoretical result is applied to output synchronization problem for uncertain network of Lorenz-type agents. Copyright © 2017 ISA. Published by Elsevier Ltd. All rights reserved.

Complex interdependent supply chain networks: Cascading failure and robustness

Science.gov (United States)

Tang, Liang; Jing, Ke; He, Jie; Stanley, H. Eugene

2016-02-01

A supply chain network is a typical interdependent network composed of an undirected cyber-layer network and a directed physical-layer network. To analyze the robustness of this complex interdependent supply chain network when it suffers from disruption events that can cause nodes to fail, we use a cascading failure process that focuses on load propagation. We consider load propagation via connectivity links as node failure spreads through one layer of an interdependent network, and we develop a priority redistribution strategy for failed loads subject to flow constraint. Using a giant component function and a one-to-one directed interdependence relation between nodes in a cyber-layer network and physical-layer network, we construct time-varied functional equations to quantify the dynamic process of failed loads propagation in an interdependent network. Finally, we conduct a numerical simulation for two cases, i.e., single node removal and multiple node removal at the initial disruption. The simulation results show that when we increase the number of removed nodes in an interdependent supply chain network its robustness undergoes a first-order discontinuous phase transition, and that even removing a small number of nodes will cause it to crash.

Robust synchronization of delayed neural networks based on adaptive control and parameters identification

International Nuclear Information System (INIS)

Zhou Jin; Chen Tianping; Xiang Lan

2006-01-01

This paper investigates synchronization dynamics of delayed neural networks with all the parameters unknown. By combining the adaptive control and linear feedback with the updated law, some simple yet generic criteria for determining the robust synchronization based on the parameters identification of uncertain chaotic delayed neural networks are derived by using the invariance principle of functional differential equations. It is shown that the approaches developed here further extend the ideas and techniques presented in recent literature, and they are also simple to implement in practice. Furthermore, the theoretical results are applied to a typical chaotic delayed Hopfied neural networks, and numerical simulation also demonstrate the effectiveness and feasibility of the proposed technique

Developing a robust wireless sensor network structure for environmental sensing

Science.gov (United States)

Zhang, Z.; Oroza, C.; Glaser, S. D.; Bales, R. C.; Conklin, M. H.

2013-12-01

The American River Hydrologic Observatory is being strategically deployed as a real-time ground-based measurement network that delivers accurate and timely information on snow conditions and other hydrologic attributes with a previously unheard of granularity of time and space. The basin-scale network involves 18 sub-networks set out at physiographically representative locations spanning the seasonally snow-covered half of the 5000 km2 American river basin. Each sub-network, covering about a 1-km2 area, consists of 10 wirelessly networked sensing nodes that continuously measure and telemeter temperature, and snow depth; plus selected locations are equipped with sensors for relative humidity, solar radiation, and soil moisture at several depths. The sensor locations were chosen to maximize the variance sampled for snow depth within the basin. Network design and deployment involves an iterative but efficient process. After sensor-station locations are determined, a robust network of interlinking sensor stations and signal repeaters must be constructed to route sensor data to a central base station with a two-way communicable data uplink. Data can then be uploaded from site to remote servers in real time through satellite and cell modems. Signal repeaters are placed for robustness of a self-healing network with redundant signal paths to the base station. Manual, trial-and-error heuristic approaches for node placement are inefficient and labor intensive. In that approach field personnel must restructure the network in real time and wait for new network statistics to be calculated at the base station before finalizing a placement, acting without knowledge of the global topography or overall network structure. We show how digital elevation plus high-definition aerial photographs to give foliage coverage can optimize planning of signal repeater placements and guarantee a robust network structure prior to the physical deployment. We can also 'stress test' the final network

ACRE: Absolute concentration robustness exploration in module-based combinatorial networks

KAUST Repository

Kuwahara, Hiroyuki; Umarov, Ramzan; Almasri, Islam; Gao, Xin

2017-01-01

To engineer cells for industrial-scale application, a deep understanding of how to design molecular control mechanisms to tightly maintain functional stability under various fluctuations is crucial. Absolute concentration robustness (ACR) is a category of robustness in reaction network models in which the steady-state concentration of a molecular species is guaranteed to be invariant even with perturbations in the other molecular species in the network. Here, we introduce a software tool, absolute concentration robustness explorer (ACRE), which efficiently explores combinatorial biochemical networks for the ACR property. ACRE has a user-friendly interface, and it can facilitate efficient analysis of key structural features that guarantee the presence and the absence of the ACR property from combinatorial networks. Such analysis is expected to be useful in synthetic biology as it can increase our understanding of how to design molecular mechanisms to tightly control the concentration of molecular species. ACRE is freely available at https://github.com/ramzan1990/ACRE.

ACRE: Absolute concentration robustness exploration in module-based combinatorial networks

KAUST Repository

Kuwahara, Hiroyuki

2017-03-01

To engineer cells for industrial-scale application, a deep understanding of how to design molecular control mechanisms to tightly maintain functional stability under various fluctuations is crucial. Absolute concentration robustness (ACR) is a category of robustness in reaction network models in which the steady-state concentration of a molecular species is guaranteed to be invariant even with perturbations in the other molecular species in the network. Here, we introduce a software tool, absolute concentration robustness explorer (ACRE), which efficiently explores combinatorial biochemical networks for the ACR property. ACRE has a user-friendly interface, and it can facilitate efficient analysis of key structural features that guarantee the presence and the absence of the ACR property from combinatorial networks. Such analysis is expected to be useful in synthetic biology as it can increase our understanding of how to design molecular mechanisms to tightly control the concentration of molecular species. ACRE is freely available at https://github.com/ramzan1990/ACRE.

Robust network design for multispecies conservation

Science.gov (United States)

Ronan Le Bras; Bistra Dilkina; Yexiang Xue; Carla P. Gomes; Kevin S. McKelvey; Michael K. Schwartz; Claire A. Montgomery

2013-01-01

Our work is motivated by an important network design application in computational sustainability concerning wildlife conservation. In the face of human development and climate change, it is important that conservation plans for protecting landscape connectivity exhibit certain level of robustness. While previous work has focused on conservation strategies that result...

Robustness of assembly supply chain networks by considering risk propagation and cascading failure

Science.gov (United States)

Tang, Liang; Jing, Ke; He, Jie; Stanley, H. Eugene

2016-10-01

An assembly supply chain network (ASCN) is composed of manufacturers located in different geographical regions. To analyze the robustness of this ASCN when it suffers from catastrophe disruption events, we construct a cascading failure model of risk propagation. In our model, different disruption scenarios s are considered and the probability equation of all disruption scenarios is developed. Using production capability loss as the robustness index (RI) of an ASCN, we conduct a numerical simulation to assess its robustness. Through simulation, we compare the network robustness at different values of linking intensity and node threshold and find that weak linking intensity or high node threshold increases the robustness of the ASCN. We also compare network robustness levels under different disruption scenarios.

Development of a method of robust rain gauge network optimization based on intensity-duration-frequency results

Directory of Open Access Journals (Sweden)

A. Chebbi

2013-10-01

Full Text Available Based on rainfall intensity-duration-frequency (IDF curves, fitted in several locations of a given area, a robust optimization approach is proposed to identify the best locations to install new rain gauges. The advantage of robust optimization is that the resulting design solutions yield networks which behave acceptably under hydrological variability. Robust optimization can overcome the problem of selecting representative rainfall events when building the optimization process. This paper reports an original approach based on Montana IDF model parameters. The latter are assumed to be geostatistical variables, and their spatial interdependence is taken into account through the adoption of cross-variograms in the kriging process. The problem of optimally locating a fixed number of new monitoring stations based on an existing rain gauge network is addressed. The objective function is based on the mean spatial kriging variance and rainfall variogram structure using a variance-reduction method. Hydrological variability was taken into account by considering and implementing several return periods to define the robust objective function. Variance minimization is performed using a simulated annealing algorithm. In addition, knowledge of the time horizon is needed for the computation of the robust objective function. A short- and a long-term horizon were studied, and optimal networks are identified for each. The method developed is applied to north Tunisia (area = 21 000 km2. Data inputs for the variogram analysis were IDF curves provided by the hydrological bureau and available for 14 tipping bucket type rain gauges. The recording period was from 1962 to 2001, depending on the station. The study concerns an imaginary network augmentation based on the network configuration in 1973, which is a very significant year in Tunisia because there was an exceptional regional flood event in March 1973. This network consisted of 13 stations and did not meet World

Robust Learning of Fixed-Structure Bayesian Networks

OpenAIRE

Diakonikolas, Ilias; Kane, Daniel; Stewart, Alistair

2016-01-01

We investigate the problem of learning Bayesian networks in an agnostic model where an $\\epsilon$-fraction of the samples are adversarially corrupted. Our agnostic learning model is similar to -- in fact, stronger than -- Huber's contamination model in robust statistics. In this work, we study the fully observable Bernoulli case where the structure of the network is given. Even in this basic setting, previous learning algorithms either run in exponential time or lose dimension-dependent facto...

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

Directory of Open Access Journals (Sweden)

Adel Dayarian

2009-01-01

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

Robust Synchronization in an E/I Network with Medium Synaptic Delay and High Level of Heterogeneity

International Nuclear Information System (INIS)

Han Fang; Wang Zhi-Jie; Gong Tao; Fan Hong

2015-01-01

It is known that both excitatory and inhibitory neuronal networks can achieve robust synchronization only under certain conditions, such as long synaptic delay or low level of heterogeneity. In this work, robust synchronization can be found in an excitatory/inhibitory (E/I) neuronal network with medium synaptic delay and high level of heterogeneity, which often occurs in real neuronal networks. Two effects of post-synaptic potentials (PSP) to network synchronization are presented, and the synaptic contribution of excitatory and inhibitory neurons to robust synchronization in this E/I network is investigated. It is found that both excitatory and inhibitory neurons may contribute to robust synchronization in E/I networks, especially the excitatory PSP has a more positive effect on synchronization in E/I networks than that in excitatory networks. This may explain the strong robustness of synchronization in E/I neuronal networks. (paper)

Cascade-robustness optimization of coupling preference in interconnected networks

International Nuclear Information System (INIS)

Zhang, Xue-Jun; Xu, Guo-Qiang; Zhu, Yan-Bo; Xia, Yong-Xiang

2016-01-01

Highlights: • A specific memetic algorithm was proposed to optimize coupling links. • A small toy model was investigated to examine the underlying mechanism. • The MA optimized strategy exhibits a moderate assortative pattern. • A novel coupling coefficient index was proposed to quantify coupling preference. - Abstract: Recently, the robustness of interconnected networks has attracted extensive attentions, one of which is to investigate the influence of coupling preference. In this paper, the memetic algorithm (MA) is employed to optimize the coupling links of interconnected networks. Afterwards, a comparison is made between MA optimized coupling strategy and traditional assortative, disassortative and random coupling preferences. It is found that the MA optimized coupling strategy with a moderate assortative value shows an outstanding performance against cascading failures on both synthetic scale-free interconnected networks and real-world networks. We then provide an explanation for this phenomenon from a micro-scope point of view and propose a coupling coefficient index to quantify the coupling preference. Our work is helpful for the design of robust interconnected networks.

Investigation on changes of modularity and robustness by edge-removal mutations in signaling networks.

Science.gov (United States)

Truong, Cong-Doan; Kwon, Yung-Keun

2017-12-21

Biological networks consisting of molecular components and interactions are represented by a graph model. There have been some studies based on that model to analyze a relationship between structural characteristics and dynamical behaviors in signaling network. However, little attention has been paid to changes of modularity and robustness in mutant networks. In this paper, we investigated the changes of modularity and robustness by edge-removal mutations in three signaling networks. We first observed that both the modularity and robustness increased on average in the mutant network by the edge-removal mutations. However, the modularity change was negatively correlated with the robustness change. This implies that it is unlikely that both the modularity and the robustness values simultaneously increase by the edge-removal mutations. Another interesting finding is that the modularity change was positively correlated with the degree, the number of feedback loops, and the edge betweenness of the removed edges whereas the robustness change was negatively correlated with them. We note that these results were consistently observed in randomly structure networks. Additionally, we identified two groups of genes which are incident to the highly-modularity-increasing and the highly-robustness-decreasing edges with respect to the edge-removal mutations, respectively, and observed that they are likely to be central by forming a connected component of a considerably large size. The gene-ontology enrichment of each of these gene groups was significantly different from the rest of genes. Finally, we showed that the highly-robustness-decreasing edges can be promising edgetic drug-targets, which validates the usefulness of our analysis. Taken together, the analysis of changes of robustness and modularity against edge-removal mutations can be useful to unravel novel dynamical characteristics underlying in signaling networks.

Neural network-based robust actuator fault diagnosis for a non-linear multi-tank system.

Science.gov (United States)

Mrugalski, Marcin; Luzar, Marcel; Pazera, Marcin; Witczak, Marcin; Aubrun, Christophe

2016-03-01

The paper is devoted to the problem of the robust actuator fault diagnosis of the dynamic non-linear systems. In the proposed method, it is assumed that the diagnosed system can be modelled by the recurrent neural network, which can be transformed into the linear parameter varying form. Such a system description allows developing the designing scheme of the robust unknown input observer within H∞ framework for a class of non-linear systems. The proposed approach is designed in such a way that a prescribed disturbance attenuation level is achieved with respect to the actuator fault estimation error, while guaranteeing the convergence of the observer. The application of the robust unknown input observer enables actuator fault estimation, which allows applying the developed approach to the fault tolerant control tasks. Copyright © 2016 ISA. Published by Elsevier Ltd. All rights reserved.

Robust Forecasting for Energy Efficiency of Wireless Multimedia Sensor Networks.

Science.gov (United States)

Wang, Xue; Ma, Jun-Jie; Ding, Liang; Bi, Dao-Wei

2007-11-15

An important criterion of wireless sensor network is the energy efficiency inspecified applications. In this wireless multimedia sensor network, the observations arederived from acoustic sensors. Focused on the energy problem of target tracking, this paperproposes a robust forecasting method to enhance the energy efficiency of wirelessmultimedia sensor networks. Target motion information is acquired by acoustic sensornodes while a distributed network with honeycomb configuration is constructed. Thereby,target localization is performed by multiple sensor nodes collaboratively through acousticsignal processing. A novel method, combining autoregressive moving average (ARMA)model and radial basis function networks (RBFNs), is exploited to perform robust targetposition forecasting during target tracking. Then sensor nodes around the target areawakened according to the forecasted target position. With committee decision of sensornodes, target localization is performed in a distributed manner and the uncertainty ofdetection is reduced. Moreover, a sensor-to-observer routing approach of the honeycombmesh network is investigated to solve the data reporting considering the residual energy ofsensor nodes. Target localization and forecasting are implemented in experiments.Meanwhile, sensor node awakening and dynamic routing are evaluated. Experimentalresults verify that energy efficiency of wireless multimedia sensor network is enhanced bythe proposed target tracking method.

An elementary quantum network using robust nuclear spin qubits in diamond

Science.gov (United States)

Kalb, Norbert; Reiserer, Andreas; Humphreys, Peter; Blok, Machiel; van Bemmelen, Koen; Twitchen, Daniel; Markham, Matthew; Taminiau, Tim; Hanson, Ronald

Quantum registers containing multiple robust qubits can form the nodes of future quantum networks for computation and communication. Information storage within such nodes must be resilient to any type of local operation. Here we demonstrate multiple robust memories by employing five nuclear spins adjacent to a nitrogen-vacancy defect centre in diamond. We characterize the storage of quantum superpositions and their resilience to entangling attempts with the electron spin of the defect centre. The storage fidelity is found to be limited by the probabilistic electron spin reset after failed entangling attempts. Control over multiple memories is then utilized to encode states in decoherence protected subspaces with increased robustness. Furthermore we demonstrate memory control in two optically linked network nodes and characterize the storage capabilities of both memories in terms of the process fidelity with the identity. These results pave the way towards multi-qubit quantum algorithms in a remote network setting.

Robust Distributed Kalman Filter for Wireless Sensor Networks with Uncertain Communication Channels

Directory of Open Access Journals (Sweden)

Du Yong Kim

2012-01-01

Full Text Available We address a state estimation problem over a large-scale sensor network with uncertain communication channel. Consensus protocol is usually used to adapt a large-scale sensor network. However, when certain parts of communication channels are broken down, the accuracy performance is seriously degraded. Specifically, outliers in the channel or temporal disconnection are avoided via proposed method for the practical implementation of the distributed estimation over large-scale sensor networks. We handle this practical challenge by using adaptive channel status estimator and robust L1-norm Kalman filter in design of the processor of the individual sensor node. Then, they are incorporated into the consensus algorithm in order to achieve the robust distributed state estimation. The robust property of the proposed algorithm enables the sensor network to selectively weight sensors of normal conditions so that the filter can be practically useful.

Viral conductance : Quantifying the robustness of networks with respect to spread of epidemics

NARCIS (Netherlands)

Youssef, M.; Kooij, R.E.; Scoglio, C.

2011-01-01

In this paper, we propose a novel measure, viral conductance (VC), to assess the robustness of complex networks with respect to the spread of SIS epidemics. In contrast to classical measures that assess the robustness of networks based on the epidemic threshold above which an epidemic takes place,

A new way to improve the robustness of complex communication networks by allocating redundancy links

International Nuclear Information System (INIS)

Shi Chunhui; Zhuo Yue; Tang Jieying; Long Keping; Peng Yunfeng

2012-01-01

We investigate the robustness of complex communication networks on allocating redundancy links. The protecting key nodes (PKN) strategy is proposed to improve the robustness of complex communication networks against intentional attack. Our numerical simulations show that allocating a few redundant links among key nodes using the PKN strategy will significantly increase the robustness of scale-free complex networks. We have also theoretically proved and demonstrated the effectiveness of the PKN strategy. We expect that our work will help achieve a better understanding of communication networks. (paper)

Analysis of robustness of urban bus network

Science.gov (United States)

Tao, Ren; Yi-Fan, Wang; Miao-Miao, Liu; Yan-Jie, Xu

2016-02-01

In this paper, the invulnerability and cascade failures are discussed for the urban bus network. Firstly, three static models(bus stop network, bus transfer network, and bus line network) are used to analyse the structure and invulnerability of urban bus network in order to understand the features of bus network comprehensively. Secondly, a new way is proposed to study the invulnerability of urban bus network by modelling two layered networks, i.e., the bus stop-line network and the bus line-transfer network and then the interactions between different models are analysed. Finally, by modelling a new layered network which can reflect the dynamic passenger flows, the cascade failures are discussed. Then a new load redistribution method is proposed to study the robustness of dynamic traffic. In this paper, the bus network of Shenyang City which is one of the biggest cities in China, is taken as a simulation example. In addition, some suggestions are given to improve the urban bus network and provide emergency strategies when traffic congestion occurs according to the numerical simulation results. Project supported by the National Natural Science Foundation of China (Grant Nos. 61473073, 61374178, 61104074, and 61203329), the Fundamental Research Funds for the Central Universities (Grant Nos. N130417006, L1517004), and the Program for Liaoning Excellent Talents in University (Grant No. LJQ2014028).

A robust fractional-order PID controller design based on active queue management for TCP network

Science.gov (United States)

Hamidian, Hamideh; Beheshti, Mohammad T. H.

2018-01-01

In this paper, a robust fractional-order controller is designed to control the congestion in transmission control protocol (TCP) networks with time-varying parameters. Fractional controllers can increase the stability and robustness. Regardless of advantages of fractional controllers, they are still not common in congestion control in TCP networks. The network parameters are time-varying, so the robust stability is important in congestion controller design. Therefore, we focused on the robust controller design. The fractional PID controller is developed based on active queue management (AQM). D-partition technique is used. The most important property of designed controller is the robustness to the time-varying parameters of the TCP network. The vertex quasi-polynomials of the closed-loop characteristic equation are obtained, and the stability boundaries are calculated for each vertex quasi-polynomial. The intersection of all stability regions is insensitive to network parameter variations, and results in robust stability of TCP/AQM system. NS-2 simulations show that the proposed algorithm provides a stable queue length. Moreover, simulations show smaller oscillations of the queue length and less packet drop probability for FPID compared to PI and PID controllers. We can conclude from NS-2 simulations that the average packet loss probability variations are negligible when the network parameters change.

Robustness analysis of geodetic networks in the case of correlated observations

Directory of Open Access Journals (Sweden)

Mevlut Yetkin

Full Text Available GPS (or GNSS networks are invaluable tools for monitoring natural hazards such as earthquakes. However, blunders in GPS observations may be mistakenly interpreted as deformation. Therefore, robust networks are needed in deformation monitoring using GPS networks. Robustness analysis is a natural merger of reliability and strain and defined as the ability to resist deformations caused by the maximum undetecle errors as determined from internal reliability analysis. However, to obtain rigorously correct results; the correlations among the observations must be considered while computing maximum undetectable errors. Therefore, we propose to use the normalized reliability numbers instead of redundancy numbers (Baarda's approach in robustness analysis of a GPS network. A simple mathematical relation showing the ratio between uncorrelated and correlated cases for maximum undetectable error is derived. The same ratio is also valid for the displacements. Numerical results show that if correlations among observations are ignored, dramatically different displacements can be obtained depending on the size of multiple correlation coefficients. Furthermore, when normalized reliability numbers are small, displacements get large, i.e., observations with low reliability numbers cause bigger displacements compared to observations with high reliability numbers.

A robust trust establishment scheme for wireless sensor networks.

Science.gov (United States)

Ishmanov, Farruh; Kim, Sung Won; Nam, Seung Yeob

2015-03-23

Security techniques like cryptography and authentication can fail to protect a network once a node is compromised. Hence, trust establishment continuously monitors and evaluates node behavior to detect malicious and compromised nodes. However, just like other security schemes, trust establishment is also vulnerable to attack. Moreover, malicious nodes might misbehave intelligently to trick trust establishment schemes. Unfortunately, attack-resistance and robustness issues with trust establishment schemes have not received much attention from the research community. Considering the vulnerability of trust establishment to different attacks and the unique features of sensor nodes in wireless sensor networks, we propose a lightweight and robust trust establishment scheme. The proposed trust scheme is lightweight thanks to a simple trust estimation method. The comprehensiveness and flexibility of the proposed trust estimation scheme make it robust against different types of attack and misbehavior. Performance evaluation under different types of misbehavior and on-off attacks shows that the detection rate of the proposed trust mechanism is higher and more stable compared to other trust mechanisms.

A Robust Trust Establishment Scheme for Wireless Sensor Networks

Directory of Open Access Journals (Sweden)

Farruh Ishmanov

2015-03-01

Full Text Available Security techniques like cryptography and authentication can fail to protect a network once a node is compromised. Hence, trust establishment continuously monitors and evaluates node behavior to detect malicious and compromised nodes. However, just like other security schemes, trust establishment is also vulnerable to attack. Moreover, malicious nodes might misbehave intelligently to trick trust establishment schemes. Unfortunately, attack-resistance and robustness issues with trust establishment schemes have not received much attention from the research community. Considering the vulnerability of trust establishment to different attacks and the unique features of sensor nodes in wireless sensor networks, we propose a lightweight and robust trust establishment scheme. The proposed trust scheme is lightweight thanks to a simple trust estimation method. The comprehensiveness and flexibility of the proposed trust estimation scheme make it robust against different types of attack and misbehavior. Performance evaluation under different types of misbehavior and on-off attacks shows that the detection rate of the proposed trust mechanism is higher and more stable compared to other trust mechanisms.

Topology and robustness in the Drosophila segment polarity network.

Directory of Open Access Journals (Sweden)

Nicholas T Ingolia

2004-06-01

Full Text Available A complex hierarchy of genetic interactions converts a single-celled Drosophila melanogaster egg into a multicellular embryo with 14 segments. Previously, von Dassow et al. reported that a mathematical model of the genetic interactions that defined the polarity of segments (the segment polarity network was robust (von Dassow et al. 2000. As quantitative information about the system was unavailable, parameters were sampled randomly. A surprisingly large fraction of these parameter sets allowed the model to maintain and elaborate on the segment polarity pattern. This robustness is due to the positive feedback of gene products on their own expression, which induces individual cells in a model segment to adopt different stable expression states (bistability corresponding to different cell types in the segment polarity pattern. A positive feedback loop will only yield multiple stable states when the parameters that describe it satisfy a particular inequality. By testing which random parameter sets satisfy these inequalities, I show that bistability is necessary to form the segment polarity pattern and serves as a strong predictor of which parameter sets will succeed in forming the pattern. Although the original model was robust to parameter variation, it could not reproduce the observed effects of cell division on the pattern of gene expression. I present a modified version that incorporates recent experimental evidence and does successfully mimic the consequences of cell division. The behavior of this modified model can also be understood in terms of bistability in positive feedback of gene expression. I discuss how this topological property of networks provides robust pattern formation and how large changes in parameters can change the specific pattern produced by a network.

Signaling mechanisms underlying the robustness and tunability of the plant immune network

Science.gov (United States)

Kim, Yungil; Tsuda, Kenichi; Igarashi, Daisuke; Hillmer, Rachel A.; Sakakibara, Hitoshi; Myers, Chad L.; Katagiri, Fumiaki

2014-01-01

Summary How does robust and tunable behavior emerge in a complex biological network? We sought to understand this for the signaling network controlling pattern-triggered immunity (PTI) in Arabidopsis. A dynamic network model containing four major signaling sectors, the jasmonate, ethylene, PAD4, and salicylate sectors, which together explain up to 80% of the PTI level, was built using data for dynamic sector activities and PTI levels under exhaustive combinatorial sector perturbations. Our regularized multiple regression model had a high level of predictive power and captured known and unexpected signal flows in the network. The sole inhibitory sector in the model, the ethylene sector, was central to the network robustness via its inhibition of the jasmonate sector. The model's multiple input sites linked specific signal input patterns varying in strength and timing to different network response patterns, indicating a mechanism enabling tunability. PMID:24439900

Global robust exponential stability for interval neural networks with delay

International Nuclear Information System (INIS)

Cui Shihua; Zhao Tao; Guo Jie

2009-01-01

In this paper, new sufficient conditions for globally robust exponential stability of neural networks with either constant delays or time-varying delays are given. We show the sufficient conditions for the existence, uniqueness and global robust exponential stability of the equilibrium point by employing Lyapunov stability theory and linear matrix inequality (LMI) technique. Numerical examples are given to show the approval of our results.

Decreasing-Rate Pruning Optimizes the Construction of Efficient and Robust Distributed Networks.

Directory of Open Access Journals (Sweden)

Saket Navlakha

2015-07-01

Full Text Available Robust, efficient, and low-cost networks are advantageous in both biological and engineered systems. During neural network development in the brain, synapses are massively over-produced and then pruned-back over time. This strategy is not commonly used when designing engineered networks, since adding connections that will soon be removed is considered wasteful. Here, we show that for large distributed routing networks, network function is markedly enhanced by hyper-connectivity followed by aggressive pruning and that the global rate of pruning, a developmental parameter not previously studied by experimentalists, plays a critical role in optimizing network structure. We first used high-throughput image analysis techniques to quantify the rate of pruning in the mammalian neocortex across a broad developmental time window and found that the rate is decreasing over time. Based on these results, we analyzed a model of computational routing networks and show using both theoretical analysis and simulations that decreasing rates lead to more robust and efficient networks compared to other rates. We also present an application of this strategy to improve the distributed design of airline networks. Thus, inspiration from neural network formation suggests effective ways to design distributed networks across several domains.

Potential energy landscape and robustness of a gene regulatory network: toggle switch.

Directory of Open Access Journals (Sweden)

Keun-Young Kim

2007-03-01

Full Text Available Finding a multidimensional potential landscape is the key for addressing important global issues, such as the robustness of cellular networks. We have uncovered the underlying potential energy landscape of a simple gene regulatory network: a toggle switch. This was realized by explicitly constructing the steady state probability of the gene switch in the protein concentration space in the presence of the intrinsic statistical fluctuations due to the small number of proteins in the cell. We explored the global phase space for the system. We found that the protein synthesis rate and the unbinding rate of proteins to the gene were small relative to the protein degradation rate; the gene switch is monostable with only one stable basin of attraction. When both the protein synthesis rate and the unbinding rate of proteins to the gene are large compared with the protein degradation rate, two global basins of attraction emerge for a toggle switch. These basins correspond to the biologically stable functional states. The potential energy barrier between the two basins determines the time scale of conversion from one to the other. We found as the protein synthesis rate and protein unbinding rate to the gene relative to the protein degradation rate became larger, the potential energy barrier became larger. This also corresponded to systems with less noise or the fluctuations on the protein numbers. It leads to the robustness of the biological basins of the gene switches. The technique used here is general and can be applied to explore the potential energy landscape of the gene networks.

Evolution of networks for body plan patterning; interplay of modularity, robustness and evolvability.

Directory of Open Access Journals (Sweden)

Kirsten H Ten Tusscher

2011-10-01

Full Text Available A major goal of evolutionary developmental biology (evo-devo is to understand how multicellular body plans of increasing complexity have evolved, and how the corresponding developmental programs are genetically encoded. It has been repeatedly argued that key to the evolution of increased body plan complexity is the modularity of the underlying developmental gene regulatory networks (GRNs. This modularity is considered essential for network robustness and evolvability. In our opinion, these ideas, appealing as they may sound, have not been sufficiently tested. Here we use computer simulations to study the evolution of GRNs' underlying body plan patterning. We select for body plan segmentation and differentiation, as these are considered to be major innovations in metazoan evolution. To allow modular networks to evolve, we independently select for segmentation and differentiation. We study both the occurrence and relation of robustness, evolvability and modularity of evolved networks. Interestingly, we observed two distinct evolutionary strategies to evolve a segmented, differentiated body plan. In the first strategy, first segments and then differentiation domains evolve (SF strategy. In the second scenario segments and domains evolve simultaneously (SS strategy. We demonstrate that under indirect selection for robustness the SF strategy becomes dominant. In addition, as a byproduct of this larger robustness, the SF strategy is also more evolvable. Finally, using a combined functional and architectural approach, we determine network modularity. We find that while SS networks generate segments and domains in an integrated manner, SF networks use largely independent modules to produce segments and domains. Surprisingly, we find that widely used, purely architectural methods for determining network modularity completely fail to establish this higher modularity of SF networks. Finally, we observe that, as a free side effect of evolving segmentation

Unravelling Darwin's entangled bank: architecture and robustness of mutualistic networks with multiple interaction types.

Science.gov (United States)

Dáttilo, Wesley; Lara-Rodríguez, Nubia; Jordano, Pedro; Guimarães, Paulo R; Thompson, John N; Marquis, Robert J; Medeiros, Lucas P; Ortiz-Pulido, Raul; Marcos-García, Maria A; Rico-Gray, Victor

2016-11-30

Trying to unravel Darwin's entangled bank further, we describe the architecture of a network involving multiple forms of mutualism (pollination by animals, seed dispersal by birds and plant protection by ants) and evaluate whether this multi-network shows evidence of a structure that promotes robustness. We found that species differed strongly in their contributions to the organization of the multi-interaction network, and that only a few species contributed to the structuring of these patterns. Moreover, we observed that the multi-interaction networks did not enhance community robustness compared with each of the three independent mutualistic networks when analysed across a range of simulated scenarios of species extinction. By simulating the removal of highly interacting species, we observed that, overall, these species enhance network nestedness and robustness, but decrease modularity. We discuss how the organization of interlinked mutualistic networks may be essential for the maintenance of ecological communities, and therefore the long-term ecological and evolutionary dynamics of interactive, species-rich communities. We suggest that conserving these keystone mutualists and their interactions is crucial to the persistence of species-rich mutualistic assemblages, mainly because they support other species and shape the network organization. © 2016 The Author(s).

Track filtering by robust neural network

International Nuclear Information System (INIS)

Baginyan, S.A.; Kisel', I.V.; Konotopskaya, E.V.; Ososkov, G.A.

1993-01-01

In the present paper we study the following problems of track information extraction by the artificial neural network (ANN) rotor model: providing initial ANN configuration by an algorithm general enough to be applicable for any discrete detector in- or out of a magnetic field; robustness to heavy contaminated raw data (up to 100% signal-to-noise ratio); stability to the growing event multiplicity. These problems were carried out by corresponding innovations of our model, namely: by a special one-dimensional histogramming, by multiplying weights by a specially designed robust multiplier, and by replacing the simulated annealing schedule by ANN dynamics with an optimally fixed temperature. Our approach is valid for both circular and straight (non-magnetic) tracks and tested on 2D simulated data contaminated by 100% noise points distributed uniformly. To be closer to some reality in our simulation, we keep parameters of the cylindrical spectrometer ARES. 12 refs.; 9 figs

Exploring the Impact of Network Structure and Demand Collaboration on the Dynamics of a Supply Chain Network Using a Robust Control Approach

Directory of Open Access Journals (Sweden)

Yongchang Wei

2015-01-01

uncertain environment. The impact of network structure and collaboration on the dynamics and robustness of supply chain network, however, remains to be explored. In this paper, a unified state space model for a two-layer supply chain network composed of multiple distributors and multiple retailers is developed. A robust control algorithm is advocated to reduce both order and demand fluctuations for unknown demand. Numerical simulations demonstrate that the robust control approach has the advantage to reduce both inventory and order fluctuations. In the simulation experiment, it is interesting to notice that complex network structure and collaborations might contribute to the reduction of inventory and order oscillations. This paper yields new insights into the overestimated bullwhip effect problem and helps us understand the complexities of supply chain networks.

Neural networks, cellular automata, and robust approach applications for vertex localization in the opera target tracker detector

International Nuclear Information System (INIS)

Dmitrievskij, S.G.; Gornushkin, Yu.A.; Ososkov, G.A.

2005-01-01

A neural-network (NN) approach for neutrino interaction vertex reconstruction in the OPERA experiment with the help of the Target Tracker (TT) detector is described. A feed-forward NN with the standard back propagation option is used. The energy functional minimization of the network is performed by the method of conjugate gradients. Data preprocessing by means of cellular automaton algorithm is performed. The Hough transform is applied for muon track determination and the robust fitting method is used for shower axis reconstruction. A comparison of the proposed approach with earlier studies, based on the use of the neural network package SNNS, shows their similar performance. The further development of the approach is underway

Robustness of non-interdependent and interdependent networks against dependent and adaptive attacks

Science.gov (United States)

Tyra, Adam; Li, Jingtao; Shang, Yilun; Jiang, Shuo; Zhao, Yanjun; Xu, Shouhuai

2017-09-01

Robustness of complex networks has been extensively studied via the notion of site percolation, which typically models independent and non-adaptive attacks (or disruptions). However, real-life attacks are often dependent and/or adaptive. This motivates us to characterize the robustness of complex networks, including non-interdependent and interdependent ones, against dependent and adaptive attacks. For this purpose, dependent attacks are accommodated by L-hop percolation where the nodes within some L-hop (L ≥ 0) distance of a chosen node are all deleted during one attack (with L = 0 degenerating to site percolation). Whereas, adaptive attacks are launched by attackers who can make node-selection decisions based on the network state in the beginning of each attack. The resulting characterization enriches the body of knowledge with new insights, such as: (i) the Achilles' Heel phenomenon is only valid for independent attacks, but not for dependent attacks; (ii) powerful attack strategies (e.g., targeted attacks and dependent attacks, dependent attacks and adaptive attacks) are not compatible and cannot help the attacker when used collectively. Our results shed some light on the design of robust complex networks.

Robust distributed two-way relay beamforming in cognitive radio networks

KAUST Repository

Pandarakkottilil, Ubaidulla

2012-04-01

In this paper, we present distributed beamformer designs for a cognitive radio network (CRN) consisting of a pair of cognitive (or secondary) transceiver nodes communicating with each other through a set of secondary non-regenerative two-way relays. The secondary network shares the spectrum with a licensed primary user (PU), and operates under a constraint on the maximum interference to the PU, in addition to its own resource and quality of service (QoS) constraints. We propose beamformer designs assuming that the available channel state information (CSI) is imperfect, which reflects realistic scenarios. The performance of proposed designs is robust to the CSI errors. Such robustness is critical in CRNs given the difficulty in acquiring perfect CSI due to loose cooperation between the PUs and the secondary users (SUs), and the need for strict enforcement of PU interference limit. We consider a mean-square error (MSE)-constrained beamformer that minimizes the total relay transmit power and an MSE-balancing beamformer with a constraint on the total relay transmit power. We show that the proposed designs can be reformulated as convex optimization problems that can be solved efficiently. Through numerical simulations, we illustrate the improved performance of the proposed robust designs compared to non-robust designs. © 2012 IEEE.

Robust Meter Network for Water Distribution Pipe Burst Detection

OpenAIRE

Donghwi Jung; Joong Hoon Kim

2017-01-01

A meter network is a set of meters installed throughout a water distribution system to measure system variables, such as the pipe flow rate and pressure. In the current hyper-connected world, meter networks are being exposed to meter failure conditions, such as malfunction of the meter’s physical system and communication system failure. Therefore, a meter network’s robustness should be secured for reliable provision of informative meter data. This paper introduces a multi-objective optimal me...

Robustness of the ATLAS pixel clustering neural network algorithm

CERN Document Server

AUTHOR|(INSPIRE)INSPIRE-00407780; The ATLAS collaboration

2016-01-01

Proton-proton collisions at the energy frontier puts strong constraints on track reconstruction algorithms. The algorithms depend heavily on accurate estimation of the position of particles as they traverse the inner detector elements. An artificial neural network algorithm is utilised to identify and split clusters of neighbouring read-out elements in the ATLAS pixel detector created by multiple charged particles. The method recovers otherwise lost tracks in dense environments where particles are separated by distances comparable to the size of the detector read-out elements. Such environments are highly relevant for LHC run 2, e.g. in searches for heavy resonances. Within the scope of run 2 track reconstruction performance and upgrades, the robustness of the neural network algorithm will be presented. The robustness has been studied by evaluating the stability of the algorithm’s performance under a range of variations in the pixel detector conditions.

Reconfigurable Flight Control Design using a Robust Servo LQR and Radial Basis Function Neural Networks

Science.gov (United States)

Burken, John J.

2005-01-01

This viewgraph presentation reviews the use of a Robust Servo Linear Quadratic Regulator (LQR) and a Radial Basis Function (RBF) Neural Network in reconfigurable flight control designs in adaptation to a aircraft part failure. The method uses a robust LQR servomechanism design with model Reference adaptive control, and RBF neural networks. During the failure the LQR servomechanism behaved well, and using the neural networks improved the tracking.

Robust synchronization of a class of chaotic networks

Czech Academy of Sciences Publication Activity Database

Čelikovský, Sergej; Lynnyk, Volodymyr; Chen, G.

2013-01-01

Roč. 350, č. 10 (2013), s. 2936-2948 ISSN 0016-0032 R&D Projects: GA ČR(CZ) GAP103/12/1794 Institutional support: RVO:67985556 Keywords : generalized Lorenz system * robust synchronization * dynamical complex network Subject RIV: BC - Control Systems Theory Impact factor: 2.260, year: 2013 http://library.utia.cas.cz/separaty/2013/TR/celikovsky-0398127.pdf

Assuring SS7 dependability: A robustness characterization of signaling network elements

Science.gov (United States)

Karmarkar, Vikram V.

1994-04-01

Current and evolving telecommunication services will rely on signaling network performance and reliability properties to build competitive call and connection control mechanisms under increasing demands on flexibility without compromising on quality. The dimensions of signaling dependability most often evaluated are the Rate of Call Loss and End-to-End Route Unavailability. A third dimension of dependability that captures the concern about large or catastrophic failures can be termed Network Robustness. This paper is concerned with the dependability aspects of the evolving Signaling System No. 7 (SS7) networks and attempts to strike a balance between the probabilistic and deterministic measures that must be evaluated to accomplish a risk-trend assessment to drive architecture decisions. Starting with high-level network dependability objectives and field experience with SS7 in the U.S., potential areas of growing stringency in network element (NE) dependability are identified to improve against current measures of SS7 network quality, as per-call signaling interactions increase. A sensitivity analysis is presented to highlight the impact due to imperfect coverage of duplex network component or element failures (i.e., correlated failures), to assist in the setting of requirements on NE robustness. A benefit analysis, covering several dimensions of dependability, is used to generate the domain of solutions available to the network architect in terms of network and network element fault tolerance that may be specified to meet the desired signaling quality goals.

Towards understanding the robustness of energy distribution networks based on macroscopic and microscopic evaluations

International Nuclear Information System (INIS)

Liu Jiming; Shi Benyun

2012-01-01

Supply disruptions on one node of a distribution network may spread to other nodes, and potentially bring various social and economic impacts. To understand the performance of a distribution network in the face of supply disruptions, it would be helpful for policy makers to quantitatively evaluate the robustness of the network, i.e., its ability of maintaining a supply–demand balance on individual nodes. In this paper, we first define a notion of network entropy to macroscopically characterize distribution robustness with respect to the dynamics of energy flows. Further, we look into how microscopic evaluation based on a failure spreading model helps us determine the extent to which disruptions on one node may affect the others. We take the natural gas distribution network in the USA as an example to demonstrate the introduced concepts and methods. Specifically, the proposed macroscopic and microscopic evaluations provide us a means of precisely identifying transmission bottlenecks in the U.S. interstate pipeline network, ranking the effects of supply disruptions on individual nodes, and planning geographically advantageous locations for natural gas storage. These findings can offer policy makers, planners, and network managers with further insights into emergency planning as well as possible design improvement. - Highlights: ► This paper evaluates distribution robustness by defining a notion of network entropy. ► The disruption impacts on individual node are evaluated by a failure spreading model. ► The robustness of the U.S. natural gas distribution network is studied. ► Results reveal pipeline bottlenecks, the node rank, and potential storage locations. ► Possible strategies for mitigating the impacts of supply disruptions are discussed.

Data-Driven Neural Network Model for Robust Reconstruction of Automobile Casting

Science.gov (United States)

Lin, Jinhua; Wang, Yanjie; Li, Xin; Wang, Lu

2017-09-01

In computer vision system, it is a challenging task to robustly reconstruct complex 3D geometries of automobile castings. However, 3D scanning data is usually interfered by noises, the scanning resolution is low, these effects normally lead to incomplete matching and drift phenomenon. In order to solve these problems, a data-driven local geometric learning model is proposed to achieve robust reconstruction of automobile casting. In order to relieve the interference of sensor noise and to be compatible with incomplete scanning data, a 3D convolution neural network is established to match the local geometric features of automobile casting. The proposed neural network combines the geometric feature representation with the correlation metric function to robustly match the local correspondence. We use the truncated distance field(TDF) around the key point to represent the 3D surface of casting geometry, so that the model can be directly embedded into the 3D space to learn the geometric feature representation; Finally, the training labels is automatically generated for depth learning based on the existing RGB-D reconstruction algorithm, which accesses to the same global key matching descriptor. The experimental results show that the matching accuracy of our network is 92.2% for automobile castings, the closed loop rate is about 74.0% when the matching tolerance threshold τ is 0.2. The matching descriptors performed well and retained 81.6% matching accuracy at 95% closed loop. For the sparse geometric castings with initial matching failure, the 3D matching object can be reconstructed robustly by training the key descriptors. Our method performs 3D reconstruction robustly for complex automobile castings.

Some criteria for robust stability of Cohen-Grossberg neural networks with delays

International Nuclear Information System (INIS)

Xiong Weili; Xu Baoguo

2008-01-01

This paper considers the problem of robust stability of Cohen-Grossberg neural networks with time-varying delays. Based on the Lyapunov stability theory and linear matrix inequality (LMI) technique, some sufficient conditions are derived to ensure the global robust convergence of the equilibrium point. The proposed LMI conditions can be checked easily by recently developed algorithms solving LMIs. Comparisons between our results and previous results admits our results establish a new set of stability criteria for delayed Cohen-Grossberg neural networks. Numerical examples are given to illustrate the effectiveness of our results

Formation of Robust Multi-Agent Networks through Self-Organizing Random Regular Graphs

KAUST Repository

Yasin Yazicioǧlu, A.; Egerstedt, Magnus; Shamma, Jeff S.

2015-01-01

Multi-Agent networks are often modeled as interaction graphs, where the nodes represent the agents and the edges denote some direct interactions. The robustness of a multi-Agent network to perturbations such as failures, noise, or malicious attacks largely depends on the corresponding graph. In many applications, networks are desired to have well-connected interaction graphs with relatively small number of links. One family of such graphs is the random regular graphs. In this paper, we present a decentralized scheme for transforming any connected interaction graph with a possibly non-integer average degree of k into a connected random m-regular graph for some m ϵ [k+k ] 2. Accordingly, the agents improve the robustness of the network while maintaining a similar number of links as the initial configuration by locally adding or removing some edges. © 2015 IEEE.

Formation of Robust Multi-Agent Networks through Self-Organizing Random Regular Graphs

KAUST Repository

Yasin Yazicioǧlu, A.

2015-11-25

Multi-Agent networks are often modeled as interaction graphs, where the nodes represent the agents and the edges denote some direct interactions. The robustness of a multi-Agent network to perturbations such as failures, noise, or malicious attacks largely depends on the corresponding graph. In many applications, networks are desired to have well-connected interaction graphs with relatively small number of links. One family of such graphs is the random regular graphs. In this paper, we present a decentralized scheme for transforming any connected interaction graph with a possibly non-integer average degree of k into a connected random m-regular graph for some m ϵ [k+k ] 2. Accordingly, the agents improve the robustness of the network while maintaining a similar number of links as the initial configuration by locally adding or removing some edges. © 2015 IEEE.

Robust and Cost-Efficient Communication Based on SNMP in Mobile Networks

Science.gov (United States)

Ryu, Sang-Hoon; Baik, Doo-Kwon

A main challenge in the design of this mobile network is the development of dynamic routing protocols that can efficiently find routes between two communicating nodes. Multimedia streaming services are receiving considerable interest in the mobile network business. An entire mobile network may change its point of attachment to the Internet. The mobile network is operated by a basic specification to support network mobility called Network Mobility (NEMO) Basic Support. However, NEMO basic Support mechanism has some problem in continuous communication. In this paper, we propose robust and cost-efficient algorithm. And we simulate proposed method and conclude some remarks.

Novel global robust stability criterion for neural networks with delay

International Nuclear Information System (INIS)

Singh, Vimal

2009-01-01

A novel criterion for the global robust stability of Hopfield-type interval neural networks with delay is presented. An example illustrating the improvement of the present criterion over several recently reported criteria is given.

Robust Adaptive Exponential Synchronization of Stochastic Perturbed Chaotic Delayed Neural Networks with Parametric Uncertainties

Directory of Open Access Journals (Sweden)

Yang Fang

2014-01-01

Full Text Available This paper investigates the robust adaptive exponential synchronization in mean square of stochastic perturbed chaotic delayed neural networks with nonidentical parametric uncertainties. A robust adaptive feedback controller is proposed based on Gronwally’s inequality, drive-response concept, and adaptive feedback control technique with the update laws of nonidentical parametric uncertainties as well as linear matrix inequality (LMI approach. The sufficient conditions for robust adaptive exponential synchronization in mean square of uncoupled uncertain stochastic chaotic delayed neural networks are derived in terms of linear matrix inequalities (LMIs. The effect of nonidentical uncertain parameter uncertainties is suppressed by the designed robust adaptive feedback controller rapidly. A numerical example is provided to validate the effectiveness of the proposed method.

Global robust stability of bidirectional associative memory neural networks with multiple time delays.

Science.gov (United States)

Senan, Sibel; Arik, Sabri

2007-10-01

This correspondence presents a sufficient condition for the existence, uniqueness, and global robust asymptotic stability of the equilibrium point for bidirectional associative memory neural networks with discrete time delays. The results impose constraint conditions on the network parameters of the neural system independently of the delay parameter, and they are applicable to all bounded continuous nonmonotonic neuron activation functions. Some numerical examples are given to compare our results with the previous robust stability results derived in the literature.

SeRLoc: Robust Localization for Wireless Sensor Networks

National Research Council Canada - National Science Library

Lazos, Loukas; Poovendran, Radha

2005-01-01

.... We show that SeRLoc is robust against known attacks on WSNs such as the wormhole attack, the Sybil attack, and compromise of network entities and analytically compute the probability of success for each attack. We also compare the performance of SeRLoc with state-of-the-art range-independent localization schemes and show that SeRLoc has better performance.

Robust neural network with applications to credit portfolio data analysis.

Science.gov (United States)

Feng, Yijia; Li, Runze; Sudjianto, Agus; Zhang, Yiyun

2010-01-01

In this article, we study nonparametric conditional quantile estimation via neural network structure. We proposed an estimation method that combines quantile regression and neural network (robust neural network, RNN). It provides good smoothing performance in the presence of outliers and can be used to construct prediction bands. A Majorization-Minimization (MM) algorithm was developed for optimization. Monte Carlo simulation study is conducted to assess the performance of RNN. Comparison with other nonparametric regression methods (e.g., local linear regression and regression splines) in real data application demonstrate the advantage of the newly proposed procedure.

Decentralized formation of random regular graphs for robust multi-agent networks

KAUST Repository

Yazicioglu, A. Yasin

2014-12-15

Multi-agent networks are often modeled via interaction graphs, where the nodes represent the agents and the edges denote direct interactions between the corresponding agents. Interaction graphs have significant impact on the robustness of networked systems. One family of robust graphs is the random regular graphs. In this paper, we present a locally applicable reconfiguration scheme to build random regular graphs through self-organization. For any connected initial graph, the proposed scheme maintains connectivity and the average degree while minimizing the degree differences and randomizing the links. As such, if the average degree of the initial graph is an integer, then connected regular graphs are realized uniformly at random as time goes to infinity.

A study of knowledge supernetworks and network robustness in different business incubators

Science.gov (United States)

Zhang, Haihong; Wu, Wenqing; Zhao, Liming

2016-04-01

As the most important intangible resource of the new generation of business incubators, knowledge has been studied extensively, particularly with respect to how it spreads among incubating firms through knowledge networks. However, these homogeneous networks do not adequately describe the heterogeneity of incubating firms in different types of business incubators. To solve the problem of heterogeneity, the notion of a knowledge supernetwork has been used both to construct a knowledge interaction model among incubating firms and to distinguish social network relationships from knowledge network relationships. The process of knowledge interaction and network evolution can then be simulated with a few rules for incubating firms regarding knowledge innovation/absorption, social network connection, and entry and exit, among other aspects. Knowledge and networks have been used as performance indicators to evaluate the evolution of knowledge supernetworks. Moreover, we study the robustness of incubating firms' social networks by employing four types of attack strategies. Based on our simulation results, we conclude that there have been significant knowledge interaction and network evolution among incubating firms on a periodic basis and that both specialized and diversified business incubators have every advantage necessary in terms of both knowledge and networks to cultivate start-up companies. As far as network robustness is concerned, there is no obvious difference between the two types of business incubators with respect to the stability of their network structures, but specialized business incubators have stronger network communication abilities than diversified business incubators.

A Robust Optimization Based Energy-Aware Virtual Network Function Placement Proposal for Small Cell 5G Networks with Mobile Edge Computing Capabilities

Directory of Open Access Journals (Sweden)

Bego Blanco

2017-01-01

Full Text Available In the context of cloud-enabled 5G radio access networks with network function virtualization capabilities, we focus on the virtual network function placement problem for a multitenant cluster of small cells that provide mobile edge computing services. Under an emerging distributed network architecture and hardware infrastructure, we employ cloud-enabled small cells that integrate microservers for virtualization execution, equipped with additional hardware appliances. We develop an energy-aware placement solution using a robust optimization approach based on service demand uncertainty in order to minimize the power consumption in the system constrained by network service latency requirements and infrastructure terms. Then, we discuss the results of the proposed placement mechanism in 5G scenarios that combine several service flavours and robust protection values. Once the impact of the service flavour and robust protection on the global power consumption of the system is analyzed, numerical results indicate that our proposal succeeds in efficiently placing the virtual network functions that compose the network services in the available hardware infrastructure while fulfilling service constraints.

Global Robust Stability of Switched Interval Neural Networks with Discrete and Distributed Time-Varying Delays of Neural Type

Directory of Open Access Journals (Sweden)

Huaiqin Wu

2012-01-01

Full Text Available By combing the theories of the switched systems and the interval neural networks, the mathematics model of the switched interval neural networks with discrete and distributed time-varying delays of neural type is presented. A set of the interval parameter uncertainty neural networks with discrete and distributed time-varying delays of neural type are used as the individual subsystem, and an arbitrary switching rule is assumed to coordinate the switching between these networks. By applying the augmented Lyapunov-Krasovskii functional approach and linear matrix inequality (LMI techniques, a delay-dependent criterion is achieved to ensure to such switched interval neural networks to be globally asymptotically robustly stable in terms of LMIs. The unknown gain matrix is determined by solving this delay-dependent LMIs. Finally, an illustrative example is given to demonstrate the validity of the theoretical results.

Highly Robust Methods in Data Mining

Czech Academy of Sciences Publication Activity Database

Kalina, Jan

2013-01-01

Roč. 8, č. 1 (2013), s. 9-24 ISSN 1452-4864 Institutional support: RVO:67985807 Keywords : data mining * robust statistics * high-dimensional data * cluster analysis * logistic regression * neural networks Subject RIV: BB - Applied Statistics, Operational Research

The influence of the depth of k-core layers on the robustness of interdependent networks against cascading failures

Science.gov (United States)

Dong, Zhengcheng; Fang, Yanjun; Tian, Meng; Kong, Zhengmin

The hierarchical structure, k-core, is common in various complex networks, and the actual network always has successive layers from 1-core layer (the peripheral layer) to km-core layer (the core layer). The nodes within the core layer have been proved to be the most influential spreaders, but there is few work about how the depth of k-core layers (the value of km) can affect the robustness against cascading failures, rather than the interdependent networks. First, following the preferential attachment, a novel method is proposed to generate the scale-free network with successive k-core layers (KCBA network), and the KCBA network is validated more realistic than the traditional BA network. Then, with KCBA interdependent networks, the effect of the depth of k-core layers is investigated. Considering the load-based model, the loss of capacity on nodes is adopted to quantify the robustness instead of the number of functional nodes in the end. We conduct two attacking strategies, i.e. the RO-attack (Randomly remove only one node) and the RF-attack (Randomly remove a fraction of nodes). Results show that the robustness of KCBA networks not only depends on the depth of k-core layers, but also is slightly influenced by the initial load. With RO-attack, the networks with less k-core layers are more robust when the initial load is small. With RF-attack, the robustness improves with small km, but the improvement is getting weaker with the increment of the initial load. In a word, the lower the depth is, the more robust the networks will be.

Robustness analysis of uncertain dynamical neural networks with multiple time delays.

Science.gov (United States)

Senan, Sibel

2015-10-01

This paper studies the problem of global robust asymptotic stability of the equilibrium point for the class of dynamical neural networks with multiple time delays with respect to the class of slope-bounded activation functions and in the presence of the uncertainties of system parameters of the considered neural network model. By using an appropriate Lyapunov functional and exploiting the properties of the homeomorphism mapping theorem, we derive a new sufficient condition for the existence, uniqueness and global robust asymptotic stability of the equilibrium point for the class of neural networks with multiple time delays. The obtained stability condition basically relies on testing some relationships imposed on the interconnection matrices of the neural system, which can be easily verified by using some certain properties of matrices. An instructive numerical example is also given to illustrate the applicability of our result and show the advantages of this new condition over the previously reported corresponding results. Copyright © 2015 Elsevier Ltd. All rights reserved.

Robustness of a Neural Network Model for Power Peak Factor Estimation in Protection Systems

International Nuclear Information System (INIS)

Souza, Rose Mary G.P.; Moreira, Joao M.L.

2006-01-01

This work presents results of robustness verification of artificial neural network correlations that improve the real time prediction of the power peak factor for reactor protection systems. The input variables considered in the correlation are those available in the reactor protection systems, namely, the axial power differences obtained from measured ex-core detectors, and the position of control rods. The correlations, based on radial basis function (RBF) and multilayer perceptron (MLP) neural networks, estimate the power peak factor, without faulty signals, with average errors between 0.13%, 0.19% and 0.15%, and maximum relative error of 2.35%. The robustness verification was performed for three different neural network correlations. The results show that they are robust against signal degradation, producing results with faulty signals with a maximum error of 6.90%. The average error associated to faulty signals for the MLP network is about half of that of the RBF network, and the maximum error is about 1% smaller. These results demonstrate that MLP neural network correlation is more robust than the RBF neural network correlation. The results also show that the input variables present redundant information. The axial power difference signals compensate the faulty signal for the position of a given control rod, and improves the results by about 10%. The results show that the errors in the power peak factor estimation by these neural network correlations, even in faulty conditions, are smaller than the current PWR schemes which may have uncertainties as high as 8%. Considering the maximum relative error of 2.35%, these neural network correlations would allow decreasing the power peak factor safety margin by about 5%. Such a reduction could be used for operating the reactor with a higher power level or with more flexibility. The neural network correlation has to meet requirements of high integrity software that performs safety grade actions. It is shown that the

Robustness of coevolution in resolving prisoner's dilemma games on interdependent networks subject to attack

Science.gov (United States)

Liu, Penghui; Liu, Jing

2017-08-01

Recently, coevolution between strategy and network structure has been established as a rule to resolve social dilemmas and reach optimal situations for cooperation. Many follow-up researches have focused on studying how coevolution helps networks reorganize to deter the defectors and many coevolution methods have been proposed. However, the robustness of the coevolution rules against attacks have not been studied much. Since attacks may directly influence the original evolutionary process of cooperation, the robustness should be an important index while evaluating the quality of a coevolution method. In this paper, we focus on investigating the robustness of an elementary coevolution method in resolving the prisoner's dilemma game upon the interdependent networks. Three different types of time-independent attacks, named as edge attacks, instigation attacks and node attacks have been employed to test its robustness. Through analyzing the simulation results obtained, we find this coevolution method is relatively robust against the edge attack and the node attack as it successfully maintains cooperation in the population over the entire attack range. However, when the instigation probability of the attacked individuals is large or the attack range of instigation attack is wide enough, coevolutionary rule finally fails in maintaining cooperation in the population.

Robust adjustment of a geodetic network measured by satellite technology in the Dargovských Hrdinov suburb

Directory of Open Access Journals (Sweden)

Slavomír Labant

2011-12-01

Full Text Available This article addresses the adjustment of a 3D geodetic network in the Dargovských Hrdinov suburbs using Global Navigation SatelliteSystems (GNSS for the purposes of deformation analysis. The advantage of using the GNSS compared to other terrestrial technology is thatit is not influenced by unpredictability in the ground level atmosphere and individual visibilities between points in the observed network arenot necessary. This article also includes the planning of GNSS observations using Planning Open Source software from Trimble as well assubsequent observations at individual network points. The geodetic network is processing on the basis of the Gauss-Markov model usingthe least square method and robust adjustment. From robust methods, Huber’s Robust M-estimation and Hampel’s Robust M-estimationwere used. Individual adjustments were tested and subsequently the results of analysis were graphically visualised using absolute confidenceellipsoids.

Boundedness and global robust stability analysis of delayed complex-valued neural networks with interval parameter uncertainties.

Science.gov (United States)

Song, Qiankun; Yu, Qinqin; Zhao, Zhenjiang; Liu, Yurong; Alsaadi, Fuad E

2018-07-01

In this paper, the boundedness and robust stability for a class of delayed complex-valued neural networks with interval parameter uncertainties are investigated. By using Homomorphic mapping theorem, Lyapunov method and inequality techniques, sufficient condition to guarantee the boundedness of networks and the existence, uniqueness and global robust stability of equilibrium point is derived for the considered uncertain neural networks. The obtained robust stability criterion is expressed in complex-valued LMI, which can be calculated numerically using YALMIP with solver of SDPT3 in MATLAB. An example with simulations is supplied to show the applicability and advantages of the acquired result. Copyright © 2018 Elsevier Ltd. All rights reserved.

Environmental Noise, Genetic Diversity and the Evolution of Evolvability and Robustness in Model Gene Networks

Science.gov (United States)

Steiner, Christopher F.

2012-01-01

The ability of organisms to adapt and persist in the face of environmental change is accepted as a fundamental feature of natural systems. More contentious is whether the capacity of organisms to adapt (or “evolvability”) can itself evolve and the mechanisms underlying such responses. Using model gene networks, I provide evidence that evolvability emerges more readily when populations experience positively autocorrelated environmental noise (red noise) compared to populations in stable or randomly varying (white noise) environments. Evolvability was correlated with increasing genetic robustness to effects on network viability and decreasing robustness to effects on phenotypic expression; populations whose networks displayed greater viability robustness and lower phenotypic robustness produced more additive genetic variation and adapted more rapidly in novel environments. Patterns of selection for robustness varied antagonistically with epistatic effects of mutations on viability and phenotypic expression, suggesting that trade-offs between these properties may constrain their evolutionary responses. Evolution of evolvability and robustness was stronger in sexual populations compared to asexual populations indicating that enhanced genetic variation under fluctuating selection combined with recombination load is a primary driver of the emergence of evolvability. These results provide insight into the mechanisms potentially underlying rapid adaptation as well as the environmental conditions that drive the evolution of genetic interactions. PMID:23284934

Robust collaborative process interactions under system crash and network failures

NARCIS (Netherlands)

Wang, Lei; Wombacher, Andreas; Ferreira Pires, Luis; van Sinderen, Marten J.; Chi, Chihung

2013-01-01

With the possibility of system crashes and network failures, the design of robust client/server interactions for collaborative process execution is a challenge. If a business process changes its state, it sends messages to the relevant processes to inform about this change. However, server crashes

Robust identification of transcriptional regulatory networks using a Gibbs sampler on outlier sum statistic.

Science.gov (United States)

Gu, Jinghua; Xuan, Jianhua; Riggins, Rebecca B; Chen, Li; Wang, Yue; Clarke, Robert

2012-08-01

Identification of transcriptional regulatory networks (TRNs) is of significant importance in computational biology for cancer research, providing a critical building block to unravel disease pathways. However, existing methods for TRN identification suffer from the inclusion of excessive 'noise' in microarray data and false-positives in binding data, especially when applied to human tumor-derived cell line studies. More robust methods that can counteract the imperfection of data sources are therefore needed for reliable identification of TRNs in this context. In this article, we propose to establish a link between the quality of one target gene to represent its regulator and the uncertainty of its expression to represent other target genes. Specifically, an outlier sum statistic was used to measure the aggregated evidence for regulation events between target genes and their corresponding transcription factors. A Gibbs sampling method was then developed to estimate the marginal distribution of the outlier sum statistic, hence, to uncover underlying regulatory relationships. To evaluate the effectiveness of our proposed method, we compared its performance with that of an existing sampling-based method using both simulation data and yeast cell cycle data. The experimental results show that our method consistently outperforms the competing method in different settings of signal-to-noise ratio and network topology, indicating its robustness for biological applications. Finally, we applied our method to breast cancer cell line data and demonstrated its ability to extract biologically meaningful regulatory modules related to estrogen signaling and action in breast cancer. The Gibbs sampler MATLAB package is freely available at http://www.cbil.ece.vt.edu/software.htm. xuan@vt.edu Supplementary data are available at Bioinformatics online.

A Language-Based Approach for Improving the Robustness of Network Application Protocol Implementations

DEFF Research Database (Denmark)

Burgy, Laurent; Reveillere, Laurent; Lawall, Julia Laetitia

2007-01-01

The secure and robust functioning of a network relies on the defect-free implementation of network applications. As network protocols have become increasingly complex, however, hand-writing network message processing code has become increasingly error-prone. In this paper, we present a domain...

Robust networked H∞ synchronization of nonidentical chaotic Lur'e systems

International Nuclear Information System (INIS)

Yang De-Dong

2014-01-01

We mainly investigate the robust networked H ∞ synchronization problem of nonidentical chaotic Lur'e systems. In the design of the synchronization scheme, some network characteristics, such as nonuniform sampling, transmission-induced delays, and data packet dropouts, are considered. The parameters of master—slave chaotic Lur'e systems often allow differences. The sufficient condition in terms of linear matrix inequality (LMI) is obtained to guarantee the dissipative synchronization of nonidentical chaotic Lur'e systems in network environments. A numerical example is given to illustrate the validity of the proposed method. (general)

The missing part of seed dispersal networks: structure and robustness of bat-fruit interactions.

Directory of Open Access Journals (Sweden)

Marco Aurelio Ribeiro Mello

2011-02-01

Full Text Available Mutualistic networks are crucial to the maintenance of ecosystem services. Unfortunately, what we know about seed dispersal networks is based only on bird-fruit interactions. Therefore, we aimed at filling part of this gap by investigating bat-fruit networks. It is known from population studies that: (i some bat species depend more on fruits than others, and (ii that some specialized frugivorous bats prefer particular plant genera. We tested whether those preferences affected the structure and robustness of the whole network and the functional roles of species. Nine bat-fruit datasets from the literature were analyzed and all networks showed lower complementary specialization (H(2' = 0.37±0.10, mean ± SD and similar nestedness (NODF = 0.56±0.12 than pollination networks. All networks were modular (M = 0.32±0.07, and had on average four cohesive subgroups (modules of tightly connected bats and plants. The composition of those modules followed the genus-genus associations observed at population level (Artibeus-Ficus, Carollia-Piper, and Sturnira-Solanum, although a few of those plant genera were dispersed also by other bats. Bat-fruit networks showed high robustness to simulated cumulative removals of both bats (R = 0.55±0.10 and plants (R = 0.68±0.09. Primary frugivores interacted with a larger proportion of the plants available and also occupied more central positions; furthermore, their extinction caused larger changes in network structure. We conclude that bat-fruit networks are highly cohesive and robust mutualistic systems, in which redundancy is high within modules, although modules are complementary to each other. Dietary specialization seems to be an important structuring factor that affects the topology, the guild structure and functional roles in bat-fruit networks.

TAO-robust backpropagation learning algorithm.

Science.gov (United States)

Pernía-Espinoza, Alpha V; Ordieres-Meré, Joaquín B; Martínez-de-Pisón, Francisco J; González-Marcos, Ana

2005-03-01

In several fields, as industrial modelling, multilayer feedforward neural networks are often used as universal function approximations. These supervised neural networks are commonly trained by a traditional backpropagation learning format, which minimises the mean squared error (mse) of the training data. However, in the presence of corrupted data (outliers) this training scheme may produce wrong models. We combine the benefits of the non-linear regression model tau-estimates [introduced by Tabatabai, M. A. Argyros, I. K. Robust Estimation and testing for general nonlinear regression models. Applied Mathematics and Computation. 58 (1993) 85-101] with the backpropagation algorithm to produce the TAO-robust learning algorithm, in order to deal with the problems of modelling with outliers. The cost function of this approach has a bounded influence function given by the weighted average of two psi functions, one corresponding to a very robust estimate and the other to a highly efficient estimate. The advantages of the proposed algorithm are studied with an example.

Determinants of long-term growth : New results applying robust estimation and extreme bounds analysis

NARCIS (Netherlands)

Sturm, J.-E.; de Haan, J.

2005-01-01

Two important problems exist in cross-country growth studies: outliers and model uncertainty. Employing Sala-i-Martin's (1997a,b) data set, we first use robust estimation and analyze to what extent outliers influence OLS regressions. We then use both OLS and robust estimation techniques in applying

Robust stability of interval bidirectional associative memory neural network with time delays.

Science.gov (United States)

Liao, Xiaofeng; Wong, Kwok-wo

2004-04-01

In this paper, the conventional bidirectional associative memory (BAM) neural network with signal transmission delay is intervalized in order to study the bounded effect of deviations in network parameters and external perturbations. The resultant model is referred to as a novel interval dynamic BAM (IDBAM) model. By combining a number of different Lyapunov functionals with the Razumikhin technique, some sufficient conditions for the existence of unique equilibrium and robust stability are derived. These results are fairly general and can be verified easily. To go further, we extend our investigation to the time-varying delay case. Some robust stability criteria for BAM with perturbations of time-varying delays are derived. Besides, our approach for the analysis allows us to consider several different types of activation functions, including piecewise linear sigmoids with bounded activations as well as the usual C1-smooth sigmoids. We believe that the results obtained have leading significance in the design and application of BAM neural networks.

Robust stability bounds for multi-delay networked control systems

Science.gov (United States)

Seitz, Timothy; Yedavalli, Rama K.; Behbahani, Alireza

2018-04-01

In this paper, the robust stability of a perturbed linear continuous-time system is examined when controlled using a sampled-data networked control system (NCS) framework. Three new robust stability bounds on the time-invariant perturbations to the original continuous-time plant matrix are presented guaranteeing stability for the corresponding discrete closed-loop augmented delay-free system (ADFS) with multiple time-varying sensor and actuator delays. The bounds are differentiated from previous work by accounting for the sampled-data nature of the NCS and for separate communication delays for each sensor and actuator, not a single delay. Therefore, this paper expands the knowledge base in multiple inputs multiple outputs (MIMO) sampled-data time delay systems. Bounds are presented for unstructured, semi-structured, and structured perturbations.

Robust transient stabilisation problem for a synchronous generator in a power network

Science.gov (United States)

Verrelli, C. M.; Damm, G.

2010-04-01

The robust transient stabilisation problem (with stability proof€) of a synchronous generator in an uncertain power network with transfer conductances is rigorously formulated and solved. The generator angular speed and electrical power are required to be kept close, when mechanical and electrical perturbations occur, to the synchronous speed and mechanical input power, respectively, while the generator terminal voltage is to be regulated, when perturbations are removed, to its pre-fault reference constant value. A robust adaptive nonlinear feedback control algorithm is designed on the basis of a third-order model of the synchronous machine: only two system parameters (synchronous machine damping and inertia constants) along with upper and lower bounds on the remaining uncertain ones are supposed to be known. The conditions to be satisfied by the remote network dynamics for guaranteeing ℒ2 and ℒ∞ robustness and asymptotic relative speed and voltage regulation to zero are weaker than those required by the single machine-infinite bus approximation: dynamic interactions between the local deviations of the generator states from the corresponding equilibrium values and the remote generators states are allowed.

Robustness of the Drinking Water Distribution Network under Changing Future Demand

NARCIS (Netherlands)

Agudelo-Vera, C.; Blokker, M.; Vreeburg, J.; Bongard, T.; Hillegers, S.; Van der Hoek, J.P.

2014-01-01

A methodology to determine the robustness of the drinking water distribution system is proposed. The performance of three networks under ten future demand scenarios was tested, using head loss and residence time as indicators. The scenarios consider technological and demographic changes. Daily

Applying network theory to animal movements to identify properties of landscape space use.

Science.gov (United States)

Bastille-Rousseau, Guillaume; Douglas-Hamilton, Iain; Blake, Stephen; Northrup, Joseph M; Wittemyer, George

2018-04-01

Network (graph) theory is a popular analytical framework to characterize the structure and dynamics among discrete objects and is particularly effective at identifying critical hubs and patterns of connectivity. The identification of such attributes is a fundamental objective of animal movement research, yet network theory has rarely been applied directly to animal relocation data. We develop an approach that allows the analysis of movement data using network theory by defining occupied pixels as nodes and connection among these pixels as edges. We first quantify node-level (local) metrics and graph-level (system) metrics on simulated movement trajectories to assess the ability of these metrics to pull out known properties in movement paths. We then apply our framework to empirical data from African elephants (Loxodonta africana), giant Galapagos tortoises (Chelonoidis spp.), and mule deer (Odocoileous hemionus). Our results indicate that certain node-level metrics, namely degree, weight, and betweenness, perform well in capturing local patterns of space use, such as the definition of core areas and paths used for inter-patch movement. These metrics were generally applicable across data sets, indicating their robustness to assumptions structuring analysis or strategies of movement. Other metrics capture local patterns effectively, but were sensitive to specified graph properties, indicating case specific applications. Our analysis indicates that graph-level metrics are unlikely to outperform other approaches for the categorization of general movement strategies (central place foraging, migration, nomadism). By identifying critical nodes, our approach provides a robust quantitative framework to identify local properties of space use that can be used to evaluate the effect of the loss of specific nodes on range wide connectivity. Our network approach is intuitive, and can be implemented across imperfectly sampled or large-scale data sets efficiently, providing a

Robustness of the Artificial Neural Networks Used for Clustering in the ATLAS Pixel Detector

CERN Document Server

The ATLAS collaboration

2015-01-01

A study of the robustness of the ATLAS pixel neural network clustering algorithm is presented. The sensitivity to variations to its input is evaluated. These variations are motivated by potential discrepancies between data and simulation due to uncertainties in the modelling of pixel clusters in simulation, as well as uncertainties from the detector calibration. Within reasonable variation magnitudes, the neural networks prove to be robust to most variations. The neural network used to identify pixel clusters created by multiple charged particles, is most sensitive to variations affecting the total amount of charge collected in the cluster. Modifying the read-out threshold has the biggest effect on the clustering's ability to estimate the position of the particle's intersection with the detector.

Food supply chain network robustness : a literature review and research agenda

NARCIS (Netherlands)

Vlajic, J.V.; Hendrix, E.M.T.; Vorst, van der J.G.A.J.

2008-01-01

Today’s business environment is characterized by challenges of strong global competition where companies tend to achieve leanness and maximum responsiveness. However, lean supply chain networks (SCNs) become more vulnerable to all kind of disruptions. Food SCNs have to become robust, i.e. they

Robustness and accuracy in sea urchin developmental gene regulatory networks

Directory of Open Access Journals (Sweden)

Smadar eBen-Tabou De-Leon

2016-02-01

Full Text Available Developmental gene regulatory networks robustly control the timely activation of regulatory and differentiation genes. The structure of these networks underlies their capacity to buffer intrinsic and extrinsic noise and maintain embryonic morphology. Here I illustrate how the use of specific architectures by the sea urchin developmental regulatory networks enables the robust control of cell fate decisions. The Wnt-βcatenin signaling pathway patterns the primary embryonic axis while the BMP signaling pathway patterns the secondary embryonic axis in the sea urchin embryo and across bilateria. Interestingly, in the sea urchin in both cases, the signaling pathway that defines the axis controls directly the expression of a set of downstream regulatory genes. I propose that this direct activation of a set of regulatory genes enables a uniform regulatory response and a clear cut cell fate decision in the endoderm and in the dorsal ectoderm. The specification of the mesodermal pigment cell lineage is activated by Delta signaling that initiates a triple positive feedback loop that locks down the pigment specification state. I propose that the use of compound positive feedback circuitry provides the endodermal cells enough time to turn off mesodermal genes and ensures correct mesoderm vs. endoderm fate decision. Thus, I argue that understanding the control properties of repeatedly used regulatory architectures illuminates their role in embryogenesis and provides possible explanations to their resistance to evolutionary change.

Quantum theory as plausible reasoning applied to data obtained by robust experiments.

Science.gov (United States)

De Raedt, H; Katsnelson, M I; Michielsen, K

2016-05-28

We review recent work that employs the framework of logical inference to establish a bridge between data gathered through experiments and their objective description in terms of human-made concepts. It is shown that logical inference applied to experiments for which the observed events are independent and for which the frequency distribution of these events is robust with respect to small changes of the conditions under which the experiments are carried out yields, without introducing any concept of quantum theory, the quantum theoretical description in terms of the Schrödinger or the Pauli equation, the Stern-Gerlach or Einstein-Podolsky-Rosen-Bohm experiments. The extraordinary descriptive power of quantum theory then follows from the fact that it is plausible reasoning, that is common sense, applied to reproducible and robust experimental data. © 2016 The Author(s).

Global robust exponential stability analysis for interval recurrent neural networks

International Nuclear Information System (INIS)

Xu Shengyuan; Lam, James; Ho, Daniel W.C.; Zou Yun

2004-01-01

This Letter investigates the problem of robust global exponential stability analysis for interval recurrent neural networks (RNNs) via the linear matrix inequality (LMI) approach. The values of the time-invariant uncertain parameters are assumed to be bounded within given compact sets. An improved condition for the existence of a unique equilibrium point and its global exponential stability of RNNs with known parameters is proposed. Based on this, a sufficient condition for the global robust exponential stability for interval RNNs is obtained. Both of the conditions are expressed in terms of LMIs, which can be checked easily by various recently developed convex optimization algorithms. Examples are provided to demonstrate the reduced conservatism of the proposed exponential stability condition

Applying Physical-Layer Network Coding in Wireless Networks

Directory of Open Access Journals (Sweden)

Liew SoungChang

2010-01-01

Full Text Available A main distinguishing feature of a wireless network compared with a wired network is its broadcast nature, in which the signal transmitted by a node may reach several other nodes, and a node may receive signals from several other nodes, simultaneously. Rather than a blessing, this feature is treated more as an interference-inducing nuisance in most wireless networks today (e.g., IEEE 802.11. This paper shows that the concept of network coding can be applied at the physical layer to turn the broadcast property into a capacity-boosting advantage in wireless ad hoc networks. Specifically, we propose a physical-layer network coding (PNC scheme to coordinate transmissions among nodes. In contrast to "straightforward" network coding which performs coding arithmetic on digital bit streams after they have been received, PNC makes use of the additive nature of simultaneously arriving electromagnetic (EM waves for equivalent coding operation. And in doing so, PNC can potentially achieve 100% and 50% throughput increases compared with traditional transmission and straightforward network coding, respectively, in 1D regular linear networks with multiple random flows. The throughput improvements are even larger in 2D regular networks: 200% and 100%, respectively.

A Robust Approach for Clock Offset Estimation in Wireless Sensor Networks

Directory of Open Access Journals (Sweden)

Kim Jang-Sub

2010-01-01

Full Text Available The maximum likelihood estimators (MLEs for the clock phase offset assuming a two-way message exchange mechanism between the nodes of a wireless sensor network were recently derived assuming Gaussian and exponential network delays. However, the MLE performs poorly in the presence of non-Gaussian or nonexponential network delay distributions. Currently, there is a need to develop clock synchronization algorithms that are robust to the distribution of network delays. This paper proposes a clock offset estimator based on the composite particle filter (CPF to cope with the possible asymmetries and non-Gaussianity of the network delay distributions. Also, a variant of the CPF approach based on the bootstrap sampling (BS is shown to exhibit good performance in the presence of reduced number of observations. Computer simulations illustrate that the basic CPF and its BS-based variant present superior performance than MLE under general random network delay distributions such as asymmetric Gaussian, exponential, Gamma, Weibull as well as various mixtures.

Optimization of controllability and robustness of complex networks by edge directionality

Science.gov (United States)

Liang, Man; Jin, Suoqin; Wang, Dingjie; Zou, Xiufen

2016-09-01

Recently, controllability of complex networks has attracted enormous attention in various fields of science and engineering. How to optimize structural controllability has also become a significant issue. Previous studies have shown that an appropriate directional assignment can improve structural controllability; however, the evolution of the structural controllability of complex networks under attacks and cascading has always been ignored. To address this problem, this study proposes a new edge orientation method (NEOM) based on residual degree that changes the link direction while conserving topology and directionality. By comparing the results with those of previous methods in two random graph models and several realistic networks, our proposed approach is demonstrated to be an effective and competitive method for improving the structural controllability of complex networks. Moreover, numerical simulations show that our method is near-optimal in optimizing structural controllability. Strikingly, compared to the original network, our method maintains the structural controllability of the network under attacks and cascading, indicating that the NEOM can also enhance the robustness of controllability of networks. These results alter the view of the nature of controllability in complex networks, change the understanding of structural controllability and affect the design of network models to control such networks.

Robustness of cooperation in the evolutionary prisoner's dilemma on complex networks

International Nuclear Information System (INIS)

Poncela, J; Gomez-Gardenes, J; FlorIa, L M; Moreno, Y

2007-01-01

Recent studies on the evolutionary dynamics of the prisoner's dilemma game in scale-free networks have demonstrated that the heterogeneity of the network interconnections enhances the evolutionary success of cooperation. In this paper we address the issue of how the characterization of the asymptotic states of the evolutionary dynamics depends on the initial concentration of cooperators. We find that the measure and the connectedness properties of the set of nodes where cooperation reaches fixation is largely independent of initial conditions, in contrast with the behaviour of both the set of nodes where defection is fixed, and the fluctuating nodes. We also check for the robustness of these results when varying the degree heterogeneity along a one-parametric family of networks interpolating between the class of Erdos-Renyi graphs and the Barabasi-Albert networks

Algebraic connectivity of brain networks shows patterns of segregation leading to reduced network robustness in Alzheimer's disease

Science.gov (United States)

Daianu, Madelaine; Jahanshad, Neda; Nir, Talia M.; Leonardo, Cassandra D.; Jack, Clifford R.; Weiner, Michael W.; Bernstein, Matthew A.; Thompson, Paul M.

2015-01-01

Measures of network topology and connectivity aid the understanding of network breakdown as the brain degenerates in Alzheimer's disease (AD). We analyzed 3-Tesla diffusion-weighted images from 202 patients scanned by the Alzheimer's Disease Neuroimaging Initiative – 50 healthy controls, 72 with early- and 38 with late-stage mild cognitive impairment (eMCI/lMCI) and 42 with AD. Using whole-brain tractography, we reconstructed structural connectivity networks representing connections between pairs of cortical regions. We examined, for the first time in this context, the network's Laplacian matrix and its Fiedler value, describing the network's algebraic connectivity, and the Fiedler vector, used to partition a graph. We assessed algebraic connectivity and four additional supporting metrics, revealing a decrease in network robustness and increasing disarray among nodes as dementia progressed. Network components became more disconnected and segregated, and their modularity increased. These measures are sensitive to diagnostic group differences, and may help understand the complex changes in AD. PMID:26640830

Robust and Agile System against Fault and Anomaly Traffic in Software Defined Networks

Directory of Open Access Journals (Sweden)

Mihui Kim

2017-03-01

Full Text Available The main advantage of software defined networking (SDN is that it allows intelligent control and management of networking though programmability in real time. It enables efficient utilization of network resources through traffic engineering, and offers potential attack defense methods when abnormalities arise. However, previous studies have only identified individual solutions for respective problems, instead of finding a more global solution in real time that is capable of addressing multiple situations in network status. To cover diverse network conditions, this paper presents a comprehensive reactive system for simultaneously monitoring failures, anomalies, and attacks for high availability and reliability. We design three main modules in the SDN controller for a robust and agile defense (RAD system against network anomalies: a traffic analyzer, a traffic engineer, and a rule manager. RAD provides reactive flow rule generation to control traffic while detecting network failures, anomalies, high traffic volume (elephant flows, and attacks. The traffic analyzer identifies elephant flows, traffic anomalies, and attacks based on attack signatures and network monitoring. The traffic engineer module measures network utilization and delay in order to determine the best path for multi-dimensional routing and load balancing under any circumstances. Finally, the rule manager generates and installs a flow rule for the selected best path to control traffic. We implement the proposed RAD system based on Floodlight, an open source project for the SDN controller. We evaluate our system using simulation with and without the aforementioned RAD modules. Experimental results show that our approach is both practical and feasible, and can successfully augment an existing SDN controller in terms of agility, robustness, and efficiency, even in the face of link failures, attacks, and elephant flows.

Global robust stability of neural networks with multiple discrete delays and distributed delays

International Nuclear Information System (INIS)

Gao Ming; Cui Baotong

2009-01-01

The problem of global robust stability is investigated for a class of uncertain neural networks with both multiple discrete time-varying delays and distributed time-varying delays. The uncertainties are assumed to be of norm-bounded form and the activation functions are supposed to be bounded and globally Lipschitz continuous. Based on the Lyapunov stability theory and linear matrix inequality technique, some robust stability conditions guaranteeing the global robust convergence of the equilibrium point are derived. The proposed LMI-based criteria are computationally efficient as they can be easily checked by using recently developed algorithms in solving LMIs. Two examples are given to show the effectiveness of the proposed results.

Robustness analysis of complex networks with power decentralization strategy via flow-sensitive centrality against cascading failures

Science.gov (United States)

Guo, Wenzhang; Wang, Hao; Wu, Zhengping

2018-03-01

Most existing cascading failure mitigation strategy of power grids based on complex network ignores the impact of electrical characteristics on dynamic performance. In this paper, the robustness of the power grid under a power decentralization strategy is analysed through cascading failure simulation based on AC flow theory. The flow-sensitive (FS) centrality is introduced by integrating topological features and electrical properties to help determine the siting of the generation nodes. The simulation results of the IEEE-bus systems show that the flow-sensitive centrality method is a more stable and accurate approach and can enhance the robustness of the network remarkably. Through the study of the optimal flow-sensitive centrality selection for different networks, we find that the robustness of the network with obvious small-world effect depends more on contribution of the generation nodes detected by community structure, otherwise, contribution of the generation nodes with important influence on power flow is more critical. In addition, community structure plays a significant role in balancing the power flow distribution and further slowing the propagation of failures. These results are useful in power grid planning and cascading failure prevention.

Robust stability of uncertain Markovian jumping Cohen-Grossberg neural networks with mixed time-varying delays

International Nuclear Information System (INIS)

Sheng Li; Yang Huizhong

2009-01-01

This paper considers the robust stability of a class of uncertain Markovian jumping Cohen-Grossberg neural networks (UMJCGNNs) with mixed time-varying delays. The parameter uncertainties are norm-bounded and the mixed time-varying delays comprise discrete and distributed time delays. Based on the Lyapunov stability theory and linear matrix inequality (LMI) technique, some robust stability conditions guaranteeing the global robust convergence of the equilibrium point are derived. An example is given to show the effectiveness of the proposed results.

New results for global robust stability of bidirectional associative memory neural networks with multiple time delays

International Nuclear Information System (INIS)

Senan, Sibel; Arik, Sabri

2009-01-01

This paper presents some new sufficient conditions for the global robust asymptotic stability of the equilibrium point for bidirectional associative memory (BAM) neural networks with multiple time delays. The results we obtain impose constraint conditions on the network parameters of neural system independently of the delay parameter, and they are applicable to all bounded continuous non-monotonic neuron activation functions. We also give some numerical examples to demonstrate the applicability and effectiveness of our results, and compare the results with the previous robust stability results derived in the literature.

Applying Robust Design in an Industrial Context

DEFF Research Database (Denmark)

Christensen, Martin Ebro

mechanical architectures. Furthermore a set of 15 robust design principles for reducing the variation in functional performance is compiled in a format directly supporting the work of the design engineer. With these foundational methods in place, the existing tools, methods and KPIs of Robust Design...

Nonlinear Robust Observer-Based Fault Detection for Networked Suspension Control System of Maglev Train

Directory of Open Access Journals (Sweden)

Yun Li

2013-01-01

Full Text Available A fault detection approach based on nonlinear robust observer is designed for the networked suspension control system of Maglev train with random induced time delay. First, considering random bounded time-delay and external disturbance, the nonlinear model of the networked suspension control system is established. Then, a nonlinear robust observer is designed using the input of the suspension gap. And the estimate error is proved to be bounded with arbitrary precision by adopting an appropriate parameter. When sensor faults happen, the residual between the real states and the observer outputs indicates which kind of sensor failures occurs. Finally, simulation results using the actual parameters of CMS-04 maglev train indicate that the proposed method is effective for maglev train.

Robust Manufacturing Control

CERN Document Server

2013-01-01

This contributed volume collects research papers, presented at the CIRP Sponsored Conference Robust Manufacturing Control: Innovative and Interdisciplinary Approaches for Global Networks (RoMaC 2012, Jacobs University, Bremen, Germany, June 18th-20th 2012). These research papers present the latest developments and new ideas focusing on robust manufacturing control for global networks. Today, Global Production Networks (i.e. the nexus of interconnected material and information flows through which products and services are manufactured, assembled and distributed) are confronted with and expected to adapt to: sudden and unpredictable large-scale changes of important parameters which are occurring more and more frequently, event propagation in networks with high degree of interconnectivity which leads to unforeseen fluctuations, and non-equilibrium states which increasingly characterize daily business. These multi-scale changes deeply influence logistic target achievement and call for robust planning and control ...

Robustness of cluster synchronous patterns in small-world networks with inter-cluster co-competition balance

International Nuclear Information System (INIS)

Zhang, Jianbao; Ma, Zhongjun; Chen, Guanrong

2014-01-01

All edges in the classical Watts and Strogatz's small-world network model are unweighted and cooperative (positive). By introducing competitive (negative) inter-cluster edges and assigning edge weights to mimic more realistic networks, this paper develops a modified model which possesses co-competitive weighted couplings and cluster structures while maintaining the common small-world network properties of small average shortest path lengths and large clustering coefficients. Based on theoretical analysis, it is proved that the new model with inter-cluster co-competition balance has an important dynamical property of robust cluster synchronous pattern formation. More precisely, clusters will neither merge nor split regardless of adding or deleting nodes and edges, under the condition of inter-cluster co-competition balance. Numerical simulations demonstrate the robustness of the model against the increase of the coupling strength and several topological variations

Robustness of cluster synchronous patterns in small-world networks with inter-cluster co-competition balance

Science.gov (United States)

Zhang, Jianbao; Ma, Zhongjun; Chen, Guanrong

2014-06-01

All edges in the classical Watts and Strogatz's small-world network model are unweighted and cooperative (positive). By introducing competitive (negative) inter-cluster edges and assigning edge weights to mimic more realistic networks, this paper develops a modified model which possesses co-competitive weighted couplings and cluster structures while maintaining the common small-world network properties of small average shortest path lengths and large clustering coefficients. Based on theoretical analysis, it is proved that the new model with inter-cluster co-competition balance has an important dynamical property of robust cluster synchronous pattern formation. More precisely, clusters will neither merge nor split regardless of adding or deleting nodes and edges, under the condition of inter-cluster co-competition balance. Numerical simulations demonstrate the robustness of the model against the increase of the coupling strength and several topological variations.

Robustness of cluster synchronous patterns in small-world networks with inter-cluster co-competition balance

Energy Technology Data Exchange (ETDEWEB)

Zhang, Jianbao [School of Science, Hangzhou Dianzi University, Hangzhou 310018 (China); Ma, Zhongjun, E-mail: mzj1234402@163.com [School of Mathematics and Computing Science, Guilin University of Electronic Technology, Guilin 541004 (China); Chen, Guanrong [Department of Electronic Engineering, City University of Hong Kong, Kowloon, Hong Kong (China)

2014-06-15

All edges in the classical Watts and Strogatz's small-world network model are unweighted and cooperative (positive). By introducing competitive (negative) inter-cluster edges and assigning edge weights to mimic more realistic networks, this paper develops a modified model which possesses co-competitive weighted couplings and cluster structures while maintaining the common small-world network properties of small average shortest path lengths and large clustering coefficients. Based on theoretical analysis, it is proved that the new model with inter-cluster co-competition balance has an important dynamical property of robust cluster synchronous pattern formation. More precisely, clusters will neither merge nor split regardless of adding or deleting nodes and edges, under the condition of inter-cluster co-competition balance. Numerical simulations demonstrate the robustness of the model against the increase of the coupling strength and several topological variations.

Robust Weak Chimeras in Oscillator Networks with Delayed Linear and Quadratic Interactions

Science.gov (United States)

Bick, Christian; Sebek, Michael; Kiss, István Z.

2017-10-01

We present an approach to generate chimera dynamics (localized frequency synchrony) in oscillator networks with two populations of (at least) two elements using a general method based on a delayed interaction with linear and quadratic terms. The coupling design yields robust chimeras through a phase-model-based design of the delay and the ratio of linear and quadratic components of the interactions. We demonstrate the method in the Brusselator model and experiments with electrochemical oscillators. The technique opens the way to directly bridge chimera dynamics in phase models and real-world oscillator networks.

Robustness and backbone motif of a cancer network regulated by miR-17-92 cluster during the G1/S transition.

Directory of Open Access Journals (Sweden)

Lijian Yang

Full Text Available Based on interactions among transcription factors, oncogenes, tumor suppressors and microRNAs, a Boolean model of cancer network regulated by miR-17-92 cluster is constructed, and the network is associated with the control of G1/S transition in the mammalian cell cycle. The robustness properties of this regulatory network are investigated by virtue of the Boolean network theory. It is found that, during G1/S transition in the cell cycle process, the regulatory networks are robustly constructed, and the robustness property is largely preserved with respect to small perturbations to the network. By using the unique process-based approach, the structure of this network is analyzed. It is shown that the network can be decomposed into a backbone motif which provides the main biological functions, and a remaining motif which makes the regulatory system more stable. The critical role of miR-17-92 in suppressing the G1/S cell cycle checkpoint and increasing the uncontrolled proliferation of the cancer cells by targeting a genetic network of interacting proteins is displayed with our model.

Social network analysis applied to team sports analysis

CERN Document Server

Clemente, Filipe Manuel; Mendes, Rui Sousa

2016-01-01

Explaining how graph theory and social network analysis can be applied to team sports analysis, This book presents useful approaches, models and methods that can be used to characterise the overall properties of team networks and identify the prominence of each team player. Exploring the different possible network metrics that can be utilised in sports analysis, their possible applications and variances from situation to situation, the respective chapters present an array of illustrative case studies. Identifying the general concepts of social network analysis and network centrality metrics, readers are shown how to generate a methodological protocol for data collection. As such, the book provides a valuable resource for students of the sport sciences, sports engineering, applied computation and the social sciences.

A robust and high-performance queue management controller for large round trip time networks

Science.gov (United States)

Khoshnevisan, Ladan; Salmasi, Farzad R.

2016-05-01

Congestion management for transmission control protocol is of utmost importance to prevent packet loss within a network. This necessitates strategies for active queue management. The most applied active queue management strategies have their inherent disadvantages which lead to suboptimal performance and even instability in the case of large round trip time and/or external disturbance. This paper presents an internal model control robust queue management scheme with two degrees of freedom in order to restrict the undesired effects of large and small round trip time and parameter variations in the queue management. Conventional approaches such as proportional integral and random early detection procedures lead to unstable behaviour due to large delay. Moreover, internal model control-Smith scheme suffers from large oscillations due to the large round trip time. On the other hand, other schemes such as internal model control-proportional integral and derivative show excessive sluggish performance for small round trip time values. To overcome these shortcomings, we introduce a system entailing two individual controllers for queue management and disturbance rejection, simultaneously. Simulation results based on Matlab/Simulink and also Network Simulator 2 (NS2) demonstrate the effectiveness of the procedure and verify the analytical approach.

Adaptive dynamic inversion robust control for BTT missile based on wavelet neural network

Science.gov (United States)

Li, Chuanfeng; Wang, Yongji; Deng, Zhixiang; Wu, Hao

2009-10-01

A new nonlinear control strategy incorporated the dynamic inversion method with wavelet neural networks is presented for the nonlinear coupling system of Bank-to-Turn(BTT) missile in reentry phase. The basic control law is designed by using the dynamic inversion feedback linearization method, and the online learning wavelet neural network is used to compensate the inversion error due to aerodynamic parameter errors, modeling imprecise and external disturbance in view of the time-frequency localization properties of wavelet transform. Weights adjusting laws are derived according to Lyapunov stability theory, which can guarantee the boundedness of all signals in the whole system. Furthermore, robust stability of the closed-loop system under this tracking law is proved. Finally, the six degree-of-freedom(6DOF) simulation results have shown that the attitude angles can track the anticipant command precisely under the circumstances of existing external disturbance and in the presence of parameter uncertainty. It means that the dependence on model by dynamic inversion method is reduced and the robustness of control system is enhanced by using wavelet neural network(WNN) to reconstruct inversion error on-line.

A new criterion for global robust stability of interval neural networks with discrete time delays

International Nuclear Information System (INIS)

Li Chuandong; Chen Jinyu; Huang Tingwen

2007-01-01

This paper further studies global robust stability of a class of interval neural networks with discrete time delays. By introducing an equivalent transformation of interval matrices, a new criterion on global robust stability is established. In comparison with the results reported in the literature, the proposed approach leads to results with less restrictive conditions. Numerical examples are also worked through to illustrate our results

Breakdown of interdependent directed networks.

Science.gov (United States)

Liu, Xueming; Stanley, H Eugene; Gao, Jianxi

2016-02-02

Increasing evidence shows that real-world systems interact with one another via dependency connectivities. Failing connectivities are the mechanism behind the breakdown of interacting complex systems, e.g., blackouts caused by the interdependence of power grids and communication networks. Previous research analyzing the robustness of interdependent networks has been limited to undirected networks. However, most real-world networks are directed, their in-degrees and out-degrees may be correlated, and they are often coupled to one another as interdependent directed networks. To understand the breakdown and robustness of interdependent directed networks, we develop a theoretical framework based on generating functions and percolation theory. We find that for interdependent Erdős-Rényi networks the directionality within each network increases their vulnerability and exhibits hybrid phase transitions. We also find that the percolation behavior of interdependent directed scale-free networks with and without degree correlations is so complex that two criteria are needed to quantify and compare their robustness: the percolation threshold and the integrated size of the giant component during an entire attack process. Interestingly, we find that the in-degree and out-degree correlations in each network layer increase the robustness of interdependent degree heterogeneous networks that most real networks are, but decrease the robustness of interdependent networks with homogeneous degree distribution and with strong coupling strengths. Moreover, by applying our theoretical analysis to real interdependent international trade networks, we find that the robustness of these real-world systems increases with the in-degree and out-degree correlations, confirming our theoretical analysis.

Robust stability for stochastic bidirectional associative memory neural networks with time delays

Science.gov (United States)

Shu, H. S.; Lv, Z. W.; Wei, G. L.

2008-02-01

In this paper, the asymptotic stability is considered for a class of uncertain stochastic bidirectional associative memory neural networks with time delays and parameter uncertainties. The delays are time-invariant and the uncertainties are norm-bounded that enter into all network parameters. The aim of this paper is to establish easily verifiable conditions under which the delayed neural network is robustly asymptotically stable in the mean square for all admissible parameter uncertainties. By employing a Lyapunov-Krasovskii functional and conducting the stochastic analysis, a linear matrix inequality matrix inequality (LMI) approach is developed to derive the stability criteria. The proposed criteria can be easily checked by the Matlab LMI toolbox. A numerical example is given to demonstrate the usefulness of the proposed criteria.

Robustness Analysis of Hybrid Stochastic Neural Networks with Neutral Terms and Time-Varying Delays

Directory of Open Access Journals (Sweden)

Chunmei Wu

2015-01-01

Full Text Available We analyze the robustness of global exponential stability of hybrid stochastic neural networks subject to neutral terms and time-varying delays simultaneously. Given globally exponentially stable hybrid stochastic neural networks, we characterize the upper bounds of contraction coefficients of neutral terms and time-varying delays by using the transcendental equation. Moreover, we prove theoretically that, for any globally exponentially stable hybrid stochastic neural networks, if additive neutral terms and time-varying delays are smaller than the upper bounds arrived, then the perturbed neural networks are guaranteed to also be globally exponentially stable. Finally, a numerical simulation example is given to illustrate the presented criteria.

Influence of Different Coupling Modes on the Robustness of Smart Grid under Targeted Attack

Directory of Open Access Journals (Sweden)

WenJie Kang

2018-05-01

Full Text Available Many previous works only focused on the cascading failure of global coupling of one-to-one structures in interdependent networks, but the local coupling of dual coupling structures has rarely been studied due to its complex structure. This will result in a serious consequence that many conclusions of the one-to-one structure may be incorrect in the dual coupling network and do not apply to the smart grid. Therefore, it is very necessary to subdivide the dual coupling link into a top-down coupling link and a bottom-up coupling link in order to study their influence on network robustness by combining with different coupling modes. Additionally, the power flow of the power grid can cause the load of a failed node to be allocated to its neighboring nodes and trigger a new round of load distribution when the load of these nodes exceeds their capacity. This means that the robustness of smart grids may be affected by four factors, i.e., load redistribution, local coupling, dual coupling link and coupling mode; however, the research on the influence of those factors on the network robustness is missing. In this paper, firstly, we construct the smart grid as a two-layer network with a dual coupling link and divide the power grid and communication network into many subnets based on the geographical location of their nodes. Secondly, we define node importance ( N I as an evaluation index to access the impact of nodes on the cyber or physical network and propose three types of coupling modes based on N I of nodes in the cyber and physical subnets, i.e., Assortative Coupling in Subnets (ACIS, Disassortative Coupling in Subnets (DCIS, and Random Coupling in Subnets (RCIS. Thirdly, a cascading failure model is proposed for studying the effect of local coupling of dual coupling link in combination with ACIS, DCIS, and RCIS on the robustness of the smart grid against a targeted attack, and the survival rate of functional nodes is used to assess the robustness of

Influence of Different Coupling Modes on the Robustness of Smart Grid under Targeted Attack.

Science.gov (United States)

Kang, WenJie; Hu, Gang; Zhu, PeiDong; Liu, Qiang; Hang, Zhi; Liu, Xin

2018-05-24

Many previous works only focused on the cascading failure of global coupling of one-to-one structures in interdependent networks, but the local coupling of dual coupling structures has rarely been studied due to its complex structure. This will result in a serious consequence that many conclusions of the one-to-one structure may be incorrect in the dual coupling network and do not apply to the smart grid. Therefore, it is very necessary to subdivide the dual coupling link into a top-down coupling link and a bottom-up coupling link in order to study their influence on network robustness by combining with different coupling modes. Additionally, the power flow of the power grid can cause the load of a failed node to be allocated to its neighboring nodes and trigger a new round of load distribution when the load of these nodes exceeds their capacity. This means that the robustness of smart grids may be affected by four factors, i.e., load redistribution, local coupling, dual coupling link and coupling mode; however, the research on the influence of those factors on the network robustness is missing. In this paper, firstly, we construct the smart grid as a two-layer network with a dual coupling link and divide the power grid and communication network into many subnets based on the geographical location of their nodes. Secondly, we define node importance ( N I ) as an evaluation index to access the impact of nodes on the cyber or physical network and propose three types of coupling modes based on N I of nodes in the cyber and physical subnets, i.e., Assortative Coupling in Subnets (ACIS), Disassortative Coupling in Subnets (DCIS), and Random Coupling in Subnets (RCIS). Thirdly, a cascading failure model is proposed for studying the effect of local coupling of dual coupling link in combination with ACIS, DCIS, and RCIS on the robustness of the smart grid against a targeted attack, and the survival rate of functional nodes is used to assess the robustness of the smart grid

Robustness of weighted networks

Science.gov (United States)

Bellingeri, Michele; Cassi, Davide

2018-01-01

Complex network response to node loss is a central question in different fields of network science because node failure can cause the fragmentation of the network, thus compromising the system functioning. Previous studies considered binary networks where the intensity (weight) of the links is not accounted for, i.e. a link is either present or absent. However, in real-world networks the weights of connections, and thus their importance for network functioning, can be widely different. Here, we analyzed the response of real-world and model networks to node loss accounting for link intensity and the weighted structure of the network. We used both classic binary node properties and network functioning measure, introduced a weighted rank for node importance (node strength), and used a measure for network functioning that accounts for the weight of the links (weighted efficiency). We find that: (i) the efficiency of the attack strategies changed using binary or weighted network functioning measures, both for real-world or model networks; (ii) in some cases, removing nodes according to weighted rank produced the highest damage when functioning was measured by the weighted efficiency; (iii) adopting weighted measure for the network damage changed the efficacy of the attack strategy with respect the binary analyses. Our results show that if the weighted structure of complex networks is not taken into account, this may produce misleading models to forecast the system response to node failure, i.e. consider binary links may not unveil the real damage induced in the system. Last, once weighted measures are introduced, in order to discover the best attack strategy, it is important to analyze the network response to node loss using nodes rank accounting the intensity of the links to the node.

Data-adaptive Robust Optimization Method for the Economic Dispatch of Active Distribution Networks

DEFF Research Database (Denmark)

Zhang, Yipu; Ai, Xiaomeng; Fang, Jiakun

2018-01-01

Due to the restricted mathematical description of the uncertainty set, the current two-stage robust optimization is usually over-conservative which has drawn concerns from the power system operators. This paper proposes a novel data-adaptive robust optimization method for the economic dispatch...... of active distribution network with renewables. The scenario-generation method and the two-stage robust optimization are combined in the proposed method. To reduce the conservativeness, a few extreme scenarios selected from the historical data are used to replace the conventional uncertainty set....... The proposed extreme-scenario selection algorithm takes advantage of considering the correlations and can be adaptive to different historical data sets. A theoretical proof is given that the constraints will be satisfied under all the possible scenarios if they hold in the selected extreme scenarios, which...

Hierarchical modular structure enhances the robustness of self-organized criticality in neural networks

International Nuclear Information System (INIS)

Wang Shengjun; Zhou Changsong

2012-01-01

One of the most prominent architecture properties of neural networks in the brain is the hierarchical modular structure. How does the structure property constrain or improve brain function? It is thought that operating near criticality can be beneficial for brain function. Here, we find that networks with modular structure can extend the parameter region of coupling strength over which critical states are reached compared to non-modular networks. Moreover, we find that one aspect of network function—dynamical range—is highest for the same parameter region. Thus, hierarchical modularity enhances robustness of criticality as well as function. However, too much modularity constrains function by preventing the neural networks from reaching critical states, because the modular structure limits the spreading of avalanches. Our results suggest that the brain may take advantage of the hierarchical modular structure to attain criticality and enhanced function. (paper)

Robust Stability Analysis of Neutral-Type Hybrid Bidirectional Associative Memory Neural Networks with Time-Varying Delays

OpenAIRE

Wei Feng; Simon X. Yang; Haixia Wu

2014-01-01

The global asymptotic robust stability of equilibrium is considered for neutral-type hybrid bidirectional associative memory neural networks with time-varying delays and parameters uncertainties. The results we obtained in this paper are delay-derivative-dependent and establish various relationships between the network parameters only. Therefore, the results of this paper are applicable to a larger class of neural networks and can be easily verified when compared with the previously reported ...

Optimal defense resource allocation in scale-free networks

Science.gov (United States)

Zhang, Xuejun; Xu, Guoqiang; Xia, Yongxiang

2018-02-01

The robustness research of networked systems has drawn widespread attention in the past decade, and one of the central topics is to protect the network from external attacks through allocating appropriate defense resource to different nodes. In this paper, we apply a specific particle swarm optimization (PSO) algorithm to optimize the defense resource allocation in scale-free networks. Results reveal that PSO based resource allocation shows a higher robustness than other resource allocation strategies such as uniform, degree-proportional, and betweenness-proportional allocation strategies. Furthermore, we find that assigning less resource to middle-degree nodes under small-scale attack while more resource to low-degree nodes under large-scale attack is conductive to improving the network robustness. Our work provides an insight into the optimal defense resource allocation pattern in scale-free networks and is helpful for designing a more robust network.

Modular Energy-Efficient and Robust Paradigms for a Disaster-Recovery Process over Wireless Sensor Networks.

Science.gov (United States)

Razaque, Abdul; Elleithy, Khaled

2015-07-06

Robust paradigms are a necessity, particularly for emerging wireless sensor network (WSN) applications. The lack of robust and efficient paradigms causes a reduction in the provision of quality of service (QoS) and additional energy consumption. In this paper, we introduce modular energy-efficient and robust paradigms that involve two archetypes: (1) the operational medium access control (O-MAC) hybrid protocol and (2) the pheromone termite (PT) model. The O-MAC protocol controls overhearing and congestion and increases the throughput, reduces the latency and extends the network lifetime. O-MAC uses an optimized data frame format that reduces the channel access time and provides faster data delivery over the medium. Furthermore, O-MAC uses a novel randomization function that avoids channel collisions. The PT model provides robust routing for single and multiple links and includes two new significant features: (1) determining the packet generation rate to avoid congestion and (2) pheromone sensitivity to determine the link capacity prior to sending the packets on each link. The state-of-the-art research in this work is based on improving both the QoS and energy efficiency. To determine the strength of O-MAC with the PT model; we have generated and simulated a disaster recovery scenario using a network simulator (ns-3.10) that monitors the activities of disaster recovery staff; hospital staff and disaster victims brought into the hospital. Moreover; the proposed paradigm can be used for general purpose applications. Finally; the QoS metrics of the O-MAC and PT paradigms are evaluated and compared with other known hybrid protocols involving the MAC and routing features. The simulation results indicate that O-MAC with PT produced better outcomes.

Multiplex social ecological network analysis reveals how social changes affect community robustness more than resource depletion.

Science.gov (United States)

Baggio, Jacopo A; BurnSilver, Shauna B; Arenas, Alex; Magdanz, James S; Kofinas, Gary P; De Domenico, Manlio

2016-11-29

Network analysis provides a powerful tool to analyze complex influences of social and ecological structures on community and household dynamics. Most network studies of social-ecological systems use simple, undirected, unweighted networks. We analyze multiplex, directed, and weighted networks of subsistence food flows collected in three small indigenous communities in Arctic Alaska potentially facing substantial economic and ecological changes. Our analysis of plausible future scenarios suggests that changes to social relations and key households have greater effects on community robustness than changes to specific wild food resources.

Robust sliding mode control for uncertain servo system using friction observer and recurrent fuzzy neural networks

International Nuclear Information System (INIS)

Han, Seong Ik; Jeong, Chan Se; Yang, Soon Yong

2012-01-01

A robust positioning control scheme has been developed using friction parameter observer and recurrent fuzzy neural networks based on the sliding mode control. As a dynamic friction model, the LuGre model is adopted for handling friction compensation because it has been known to capture sufficiently the properties of a nonlinear dynamic friction. A developed friction parameter observer has a simple structure and also well estimates friction parameters of the LuGre friction model. In addition, an approximation method for the system uncertainty is developed using recurrent fuzzy neural networks technology to improve the precision positioning degree. Some simulation and experiment provide the verification on the performance of a proposed robust control scheme

Robust sliding mode control for uncertain servo system using friction observer and recurrent fuzzy neural networks

Energy Technology Data Exchange (ETDEWEB)

Han, Seong Ik [Pusan National University, Busan (Korea, Republic of); Jeong, Chan Se; Yang, Soon Yong [University of Ulsan, Ulsan (Korea, Republic of)

2012-04-15

A robust positioning control scheme has been developed using friction parameter observer and recurrent fuzzy neural networks based on the sliding mode control. As a dynamic friction model, the LuGre model is adopted for handling friction compensation because it has been known to capture sufficiently the properties of a nonlinear dynamic friction. A developed friction parameter observer has a simple structure and also well estimates friction parameters of the LuGre friction model. In addition, an approximation method for the system uncertainty is developed using recurrent fuzzy neural networks technology to improve the precision positioning degree. Some simulation and experiment provide the verification on the performance of a proposed robust control scheme.

An analysis of global robust stability of uncertain cellular neural networks with discrete and distributed delays

International Nuclear Information System (INIS)

Park, Ju H.

2007-01-01

This paper considers the robust stability analysis of cellular neural networks with discrete and distributed delays. Based on the Lyapunov stability theory and linear matrix inequality (LMI) technique, a novel stability criterion guaranteeing the global robust convergence of the equilibrium point is derived. The criterion can be solved easily by various convex optimization algorithms. An example is given to illustrate the usefulness of our results

Neural-network-designed pulse sequences for robust control of singlet-triplet qubits

Science.gov (United States)

Yang, Xu-Chen; Yung, Man-Hong; Wang, Xin

2018-04-01

Composite pulses are essential for universal manipulation of singlet-triplet spin qubits. In the absence of noise, they are required to perform arbitrary single-qubit operations due to the special control constraint of a singlet-triplet qubit, while in a noisy environment, more complicated sequences have been developed to dynamically correct the error. Tailoring these sequences typically requires numerically solving a set of nonlinear equations. Here we demonstrate that these pulse sequences can be generated by a well-trained, double-layer neural network. For sequences designed for the noise-free case, the trained neural network is capable of producing almost exactly the same pulses known in the literature. For more complicated noise-correcting sequences, the neural network produces pulses with slightly different line shapes, but the robustness against noises remains comparable. These results indicate that the neural network can be a judicious and powerful alternative to existing techniques in developing pulse sequences for universal fault-tolerant quantum computation.

Neural-Network-Based Robust Optimal Tracking Control for MIMO Discrete-Time Systems With Unknown Uncertainty Using Adaptive Critic Design.

Science.gov (United States)

Liu, Lei; Wang, Zhanshan; Zhang, Huaguang

2018-04-01

This paper is concerned with the robust optimal tracking control strategy for a class of nonlinear multi-input multi-output discrete-time systems with unknown uncertainty via adaptive critic design (ACD) scheme. The main purpose is to establish an adaptive actor-critic control method, so that the cost function in the procedure of dealing with uncertainty is minimum and the closed-loop system is stable. Based on the neural network approximator, an action network is applied to generate the optimal control signal and a critic network is used to approximate the cost function, respectively. In contrast to the previous methods, the main features of this paper are: 1) the ACD scheme is integrated into the controllers to cope with the uncertainty and 2) a novel cost function, which is not in quadric form, is proposed so that the total cost in the design procedure is reduced. It is proved that the optimal control signals and the tracking errors are uniformly ultimately bounded even when the uncertainty exists. Finally, a numerical simulation is developed to show the effectiveness of the present approach.

Information processing in the transcriptional regulatory network of yeast: Functional robustness

Directory of Open Access Journals (Sweden)

Dehmer Matthias

2009-03-01

Full Text Available Abstract Background Gene networks are considered to represent various aspects of molecular biological systems meaningfully because they naturally provide a systems perspective of molecular interactions. In this respect, the functional understanding of the transcriptional regulatory network is considered as key to elucidate the functional organization of an organism. Results In this paper we study the functional robustness of the transcriptional regulatory network of S. cerevisiae. We model the information processing in the network as a first order Markov chain and study the influence of single gene perturbations on the global, asymptotic communication among genes. Modification in the communication is measured by an information theoretic measure allowing to predict genes that are 'fragile' with respect to single gene knockouts. Our results demonstrate that the predicted set of fragile genes contains a statistically significant enrichment of so called essential genes that are experimentally found to be necessary to ensure vital yeast. Further, a structural analysis of the transcriptional regulatory network reveals that there are significant differences between fragile genes, hub genes and genes with a high betweenness centrality value. Conclusion Our study does not only demonstrate that a combination of graph theoretical, information theoretical and statistical methods leads to meaningful biological results but also that such methods allow to study information processing in gene networks instead of just their structural properties.

Robust Bayesian decision theory applied to optimal dosage.

Science.gov (United States)

Abraham, Christophe; Daurès, Jean-Pierre

2004-04-15

We give a model for constructing an utility function u(theta,d) in a dose prescription problem. theta and d denote respectively the patient state of health and the dose. The construction of u is based on the conditional probabilities of several variables. These probabilities are described by logistic models. Obviously, u is only an approximation of the true utility function and that is why we investigate the sensitivity of the final decision with respect to the utility function. We construct a class of utility functions from u and approximate the set of all Bayes actions associated to that class. Then, we measure the sensitivity as the greatest difference between the expected utilities of two Bayes actions. Finally, we apply these results to weighing up a chemotherapy treatment of lung cancer. This application emphasizes the importance of measuring robustness through the utility of decisions rather than the decisions themselves. Copyright 2004 John Wiley & Sons, Ltd.

Strategies for optical transport network recovery under epidemic network failures

DEFF Research Database (Denmark)

Ruepp, Sarah Renée; Fagertun, Anna Manolova; Kosteas, Vasileios

2015-01-01

The current trend in deploying automatic control plane solutions for increased flexibility in the optical transport layer leads to numerous advantages for both the operators and the customers, but also pose challenges related to the stability of the network and its ability to operate in a robust...... manner under different failure scenarios. This work evaluates two rerouting strategies and proposes four policies for failure handling in a connection-oriented optical transport network, under generalized multiprotocol label switching control plane. The performance of the strategies and the policies......, and that there exist a clear trade-off between policy performance and network resource consumption, which must be addressed by network operators for improved robustness of their transport infrastructures. Applying proactive methods for avoiding areas where epidemic failures spread results in 50% less connections...

Robust stability analysis of switched Hopfield neural networks with time-varying delay under uncertainty

International Nuclear Information System (INIS)

Huang He; Qu Yuzhong; Li Hanxiong

2005-01-01

With the development of intelligent control, switched systems have been widely studied. Here we try to introduce some ideas of the switched systems into the field of neural networks. In this Letter, a class of switched Hopfield neural networks with time-varying delay is investigated. The parametric uncertainty is considered and assumed to be norm bounded. Firstly, the mathematical model of the switched Hopfield neural networks is established in which a set of Hopfield neural networks are used as the individual subsystems and an arbitrary switching rule is assumed; Secondly, robust stability analysis for such switched Hopfield neural networks is addressed based on the Lyapunov-Krasovskii approach. Some criteria are given to guarantee the switched Hopfield neural networks to be globally exponentially stable for all admissible parametric uncertainties. These conditions are expressed in terms of some strict linear matrix inequalities (LMIs). Finally, a numerical example is provided to illustrate our results

Modular Energy-Efficient and Robust Paradigms for a Disaster-Recovery Process over Wireless Sensor Networks

Directory of Open Access Journals (Sweden)

Abdul Razaque

2015-07-01

Full Text Available Robust paradigms are a necessity, particularly for emerging wireless sensor network (WSN applications. The lack of robust and efficient paradigms causes a reduction in the provision of quality of service (QoS and additional energy consumption. In this paper, we introduce modular energy-efficient and robust paradigms that involve two archetypes: (1 the operational medium access control (O-MAC hybrid protocol and (2 the pheromone termite (PT model. The O-MAC protocol controls overhearing and congestion and increases the throughput, reduces the latency and extends the network lifetime. O-MAC uses an optimized data frame format that reduces the channel access time and provides faster data delivery over the medium. Furthermore, O-MAC uses a novel randomization function that avoids channel collisions. The PT model provides robust routing for single and multiple links and includes two new significant features: (1 determining the packet generation rate to avoid congestion and (2 pheromone sensitivity to determine the link capacity prior to sending the packets on each link. The state-of-the-art research in this work is based on improving both the QoS and energy efficiency. To determine the strength of O-MAC with the PT model; we have generated and simulated a disaster recovery scenario using a network simulator (ns-3.10 that monitors the activities of disaster recovery staff; hospital staff and disaster victims brought into the hospital. Moreover; the proposed paradigm can be used for general purpose applications. Finally; the QoS metrics of the O-MAC and PT paradigms are evaluated and compared with other known hybrid protocols involving the MAC and routing features. The simulation results indicate that O-MAC with PT produced better outcomes.

Robust state estimation for uncertain fuzzy bidirectional associative memory networks with time-varying delays

Science.gov (United States)

Vadivel, P.; Sakthivel, R.; Mathiyalagan, K.; Arunkumar, A.

2013-09-01

This paper addresses the issue of robust state estimation for a class of fuzzy bidirectional associative memory (BAM) neural networks with time-varying delays and parameter uncertainties. By constructing the Lyapunov-Krasovskii functional, which contains the triple-integral term and using the free-weighting matrix technique, a set of sufficient conditions are derived in terms of linear matrix inequalities (LMIs) to estimate the neuron states through available output measurements such that the dynamics of the estimation error system is robustly asymptotically stable. In particular, we consider a generalized activation function in which the traditional assumptions on the boundedness, monotony and differentiability of the activation functions are removed. More precisely, the design of the state estimator for such BAM neural networks can be obtained by solving some LMIs, which are dependent on the size of the time derivative of the time-varying delays. Finally, a numerical example with simulation result is given to illustrate the obtained theoretical results.

Robust state estimation for uncertain fuzzy bidirectional associative memory networks with time-varying delays

International Nuclear Information System (INIS)

Vadivel, P; Sakthivel, R; Mathiyalagan, K; Arunkumar, A

2013-01-01

This paper addresses the issue of robust state estimation for a class of fuzzy bidirectional associative memory (BAM) neural networks with time-varying delays and parameter uncertainties. By constructing the Lyapunov–Krasovskii functional, which contains the triple-integral term and using the free-weighting matrix technique, a set of sufficient conditions are derived in terms of linear matrix inequalities (LMIs) to estimate the neuron states through available output measurements such that the dynamics of the estimation error system is robustly asymptotically stable. In particular, we consider a generalized activation function in which the traditional assumptions on the boundedness, monotony and differentiability of the activation functions are removed. More precisely, the design of the state estimator for such BAM neural networks can be obtained by solving some LMIs, which are dependent on the size of the time derivative of the time-varying delays. Finally, a numerical example with simulation result is given to illustrate the obtained theoretical results. (paper)

Quantitative proteomics and network analysis of SSA1 and SSB1 deletion mutants reveals robustness of chaperone HSP70 network in Saccharomyces cerevisiae.

Science.gov (United States)

Jarnuczak, Andrew F; Eyers, Claire E; Schwartz, Jean-Marc; Grant, Christopher M; Hubbard, Simon J

2015-09-01

Molecular chaperones play an important role in protein homeostasis and the cellular response to stress. In particular, the HSP70 chaperones in yeast mediate a large volume of protein folding through transient associations with their substrates. This chaperone interaction network can be disturbed by various perturbations, such as environmental stress or a gene deletion. Here, we consider deletions of two major chaperone proteins, SSA1 and SSB1, from the chaperone network in Sacchromyces cerevisiae. We employ a SILAC-based approach to examine changes in global and local protein abundance and rationalise our results via network analysis and graph theoretical approaches. Although the deletions result in an overall increase in intracellular protein content, correlated with an increase in cell size, this is not matched by substantial changes in individual protein concentrations. Despite the phenotypic robustness to deletion of these major hub proteins, it cannot be simply explained by the presence of paralogues. Instead, network analysis and a theoretical consideration of folding workload suggest that the robustness to perturbation is a product of the overall network structure. This highlights how quantitative proteomics and systems modelling can be used to rationalise emergent network properties, and how the HSP70 system can accommodate the loss of major hubs. © 2015 The Authors. PROTEOMICS published by Wiley-VCH Verlag GmbH & Co. KGaA, Weinheim.

Second Law of Thermodynamics Applied to Metabolic Networks

Science.gov (United States)

Nigam, R.; Liang, S.

2003-01-01

We present a simple algorithm based on linear programming, that combines Kirchoff's flux and potential laws and applies them to metabolic networks to predict thermodynamically feasible reaction fluxes. These law's represent mass conservation and energy feasibility that are widely used in electrical circuit analysis. Formulating the Kirchoff's potential law around a reaction loop in terms of the null space of the stoichiometric matrix leads to a simple representation of the law of entropy that can be readily incorporated into the traditional flux balance analysis without resorting to non-linear optimization. Our technique is new as it can easily check the fluxes got by applying flux balance analysis for thermodynamic feasibility and modify them if they are infeasible so that they satisfy the law of entropy. We illustrate our method by applying it to the network dealing with the central metabolism of Escherichia coli. Due to its simplicity this algorithm will be useful in studying large scale complex metabolic networks in the cell of different organisms.

Distributed Robust Optimization in Networked System.

Science.gov (United States)

Wang, Shengnan; Li, Chunguang

2016-10-11

In this paper, we consider a distributed robust optimization (DRO) problem, where multiple agents in a networked system cooperatively minimize a global convex objective function with respect to a global variable under the global constraints. The objective function can be represented by a sum of local objective functions. The global constraints contain some uncertain parameters which are partially known, and can be characterized by some inequality constraints. After problem transformation, we adopt the Lagrangian primal-dual method to solve this problem. We prove that the primal and dual optimal solutions of the problem are restricted in some specific sets, and we give a method to construct these sets. Then, we propose a DRO algorithm to find the primal-dual optimal solutions of the Lagrangian function, which consists of a subgradient step, a projection step, and a diffusion step, and in the projection step of the algorithm, the optimized variables are projected onto the specific sets to guarantee the boundedness of the subgradients. Convergence analysis and numerical simulations verifying the performance of the proposed algorithm are then provided. Further, for nonconvex DRO problem, the corresponding approach and algorithm framework are also provided.

Enhanced robust fractional order proportional-plus-integral controller based on neural network for velocity control of permanent magnet synchronous motor.

Science.gov (United States)

Zhang, Bitao; Pi, YouGuo

2013-07-01

The traditional integer order proportional-integral-differential (IO-PID) controller is sensitive to the parameter variation or/and external load disturbance of permanent magnet synchronous motor (PMSM). And the fractional order proportional-integral-differential (FO-PID) control scheme based on robustness tuning method is proposed to enhance the robustness. But the robustness focuses on the open-loop gain variation of controlled plant. In this paper, an enhanced robust fractional order proportional-plus-integral (ERFOPI) controller based on neural network is proposed. The control law of the ERFOPI controller is acted on a fractional order implement function (FOIF) of tracking error but not tracking error directly, which, according to theory analysis, can enhance the robust performance of system. Tuning rules and approaches, based on phase margin, crossover frequency specification and robustness rejecting gain variation, are introduced to obtain the parameters of ERFOPI controller. And the neural network algorithm is used to adjust the parameter of FOIF. Simulation and experimental results show that the method proposed in this paper not only achieve favorable tracking performance, but also is robust with regard to external load disturbance and parameter variation. Crown Copyright © 2013. Published by Elsevier Ltd. All rights reserved.

Robust synchronization analysis in nonlinear stochastic cellular networks with time-varying delays, intracellular perturbations and intercellular noise.

Science.gov (United States)

Chen, Po-Wei; Chen, Bor-Sen

2011-08-01

Naturally, a cellular network consisted of a large amount of interacting cells is complex. These cells have to be synchronized in order to emerge their phenomena for some biological purposes. However, the inherently stochastic intra and intercellular interactions are noisy and delayed from biochemical processes. In this study, a robust synchronization scheme is proposed for a nonlinear stochastic time-delay coupled cellular network (TdCCN) in spite of the time-varying process delay and intracellular parameter perturbations. Furthermore, a nonlinear stochastic noise filtering ability is also investigated for this synchronized TdCCN against stochastic intercellular and environmental disturbances. Since it is very difficult to solve a robust synchronization problem with the Hamilton-Jacobi inequality (HJI) matrix, a linear matrix inequality (LMI) is employed to solve this problem via the help of a global linearization method. Through this robust synchronization analysis, we can gain a more systemic insight into not only the robust synchronizability but also the noise filtering ability of TdCCN under time-varying process delays, intracellular perturbations and intercellular disturbances. The measures of robustness and noise filtering ability of a synchronized TdCCN have potential application to the designs of neuron transmitters, on-time mass production of biochemical molecules, and synthetic biology. Finally, a benchmark of robust synchronization design in Escherichia coli repressilators is given to confirm the effectiveness of the proposed methods. Copyright © 2011 Elsevier Inc. All rights reserved.

Evaluation of Robust Estimators Applied to Fluorescence Assays

Directory of Open Access Journals (Sweden)

U. Ruotsalainen

2007-12-01

Full Text Available We evaluated standard robust methods in the estimation of fluorescence signal in novel assays used for determining the biomolecule concentrations. The objective was to obtain an accurate and reliable estimate using as few observations as possible by decreasing the influence of outliers. We assumed the true signals to have Gaussian distribution, while no assumptions about the outliers were made. The experimental results showed that arithmetic mean performs poorly even with the modest deviations. Further, the robust methods, especially the M-estimators, performed extremely well. The results proved that the use of robust methods is advantageous in the estimation problems where noise and deviations are significant, such as in biological and medical applications.

Robust Stability Analysis of Neutral-Type Hybrid Bidirectional Associative Memory Neural Networks with Time-Varying Delays

Directory of Open Access Journals (Sweden)

Wei Feng

2014-01-01

Full Text Available The global asymptotic robust stability of equilibrium is considered for neutral-type hybrid bidirectional associative memory neural networks with time-varying delays and parameters uncertainties. The results we obtained in this paper are delay-derivative-dependent and establish various relationships between the network parameters only. Therefore, the results of this paper are applicable to a larger class of neural networks and can be easily verified when compared with the previously reported literature results. Two numerical examples are illustrated to verify our results.

Evolution of Boolean networks under selection for a robust response to external inputs yields an extensive neutral space

Science.gov (United States)

Szejka, Agnes; Drossel, Barbara

2010-02-01

We study the evolution of Boolean networks as model systems for gene regulation. Inspired by biological networks, we select simultaneously for robust attractors and for the ability to respond to external inputs by changing the attractor. Mutations change the connections between the nodes and the update functions. In order to investigate the influence of the type of update functions, we perform our simulations with canalizing as well as with threshold functions. We compare the properties of the fitness landscapes that result for different versions of the selection criterion and the update functions. We find that for all studied cases the fitness landscape has a plateau with maximum fitness resulting in the fact that structurally very different networks are able to fulfill the same task and are connected by neutral paths in network (“genotype”) space. We find furthermore a connection between the attractor length and the mutational robustness, and an extremely long memory of the initial evolutionary stage.

A biological network-based regularized artificial neural network model for robust phenotype prediction from gene expression data.

Science.gov (United States)

Kang, Tianyu; Ding, Wei; Zhang, Luoyan; Ziemek, Daniel; Zarringhalam, Kourosh

2017-12-19

Stratification of patient subpopulations that respond favorably to treatment or experience and adverse reaction is an essential step toward development of new personalized therapies and diagnostics. It is currently feasible to generate omic-scale biological measurements for all patients in a study, providing an opportunity for machine learning models to identify molecular markers for disease diagnosis and progression. However, the high variability of genetic background in human populations hampers the reproducibility of omic-scale markers. In this paper, we develop a biological network-based regularized artificial neural network model for prediction of phenotype from transcriptomic measurements in clinical trials. To improve model sparsity and the overall reproducibility of the model, we incorporate regularization for simultaneous shrinkage of gene sets based on active upstream regulatory mechanisms into the model. We benchmark our method against various regression, support vector machines and artificial neural network models and demonstrate the ability of our method in predicting the clinical outcomes using clinical trial data on acute rejection in kidney transplantation and response to Infliximab in ulcerative colitis. We show that integration of prior biological knowledge into the classification as developed in this paper, significantly improves the robustness and generalizability of predictions to independent datasets. We provide a Java code of our algorithm along with a parsed version of the STRING DB database. In summary, we present a method for prediction of clinical phenotypes using baseline genome-wide expression data that makes use of prior biological knowledge on gene-regulatory interactions in order to increase robustness and reproducibility of omic-scale markers. The integrated group-wise regularization methods increases the interpretability of biological signatures and gives stable performance estimates across independent test sets.

Distributed redundancy and robustness in complex systems

KAUST Repository

Randles, Martin

2011-03-01

The uptake and increasing prevalence of Web 2.0 applications, promoting new large-scale and complex systems such as Cloud computing and the emerging Internet of Services/Things, requires tools and techniques to analyse and model methods to ensure the robustness of these new systems. This paper reports on assessing and improving complex system resilience using distributed redundancy, termed degeneracy in biological systems, to endow large-scale complicated computer systems with the same robustness that emerges in complex biological and natural systems. However, in order to promote an evolutionary approach, through emergent self-organisation, it is necessary to specify the systems in an \\'open-ended\\' manner where not all states of the system are prescribed at design-time. In particular an observer system is used to select robust topologies, within system components, based on a measurement of the first non-zero Eigen value in the Laplacian spectrum of the components\\' network graphs; also known as the algebraic connectivity. It is shown, through experimentation on a simulation, that increasing the average algebraic connectivity across the components, in a network, leads to an increase in the variety of individual components termed distributed redundancy; the capacity for structurally distinct components to perform an identical function in a particular context. The results are applied to a specific application where active clustering of like services is used to aid load balancing in a highly distributed network. Using the described procedure is shown to improve performance and distribute redundancy. © 2010 Elsevier Inc.

Robust stabilization of burn conditions in subignited fusion reactors using artificial neural networks

International Nuclear Information System (INIS)

Vitela, E. Javier; Martinell, J. Julio

2000-01-01

In this work it is shown that robust burn control in long pulse operations of thermonuclear reactors can be successfully achieved with artificial neural networks. The results reported here correspond to a volume averaged zero-dimensional nonlinear model of a subignited fusion device using the design parameters of the tokamak EDA-ITER group. A Radial Basis Neural Network (RBNN) was trained to provide feedback stabilization at a fixed operating point independently of any particular scaling law that the reactor confinement time may follow. A numerically simulated transient is used to illustrate the stabilization capabilities of the resulting RBNN when the reactor follows an ELMy scaling law corrupted with Gaussian noise. (author)

Robust client/server shared state interactions of collaborative process with system crash and network failures

NARCIS (Netherlands)

Wang, Lei; Wombacher, Andreas; Ferreira Pires, Luis; van Sinderen, Marten J.; Chi, Chihung

With the possibility of system crashes and network failures, the design of robust client/server interactions for collaborative process execution is a challenge. If a business process changes state, it sends messages to relevant processes to inform about this change. However, server crashes and

Design principles for robust oscillatory behavior.

Science.gov (United States)

Castillo-Hair, Sebastian M; Villota, Elizabeth R; Coronado, Alberto M

2015-09-01

Oscillatory responses are ubiquitous in regulatory networks of living organisms, a fact that has led to extensive efforts to study and replicate the circuits involved. However, to date, design principles that underlie the robustness of natural oscillators are not completely known. Here we study a three-component enzymatic network model in order to determine the topological requirements for robust oscillation. First, by simulating every possible topological arrangement and varying their parameter values, we demonstrate that robust oscillators can be obtained by augmenting the number of both negative feedback loops and positive autoregulations while maintaining an appropriate balance of positive and negative interactions. We then identify network motifs, whose presence in more complex topologies is a necessary condition for obtaining oscillatory responses. Finally, we pinpoint a series of simple architectural patterns that progressively render more robust oscillators. Together, these findings can help in the design of more reliable synthetic biomolecular networks and may also have implications in the understanding of other oscillatory systems.

Global robust asymptotical stability of multi-delayed interval neural networks: an LMI approach

International Nuclear Information System (INIS)

Li Chuandong; Liao Xiaofeng; Zhang Rong

2004-01-01

Based on the Lyapunov-Krasovskii stability theory for functional differential equations and the linear matrix inequality (LMI) technique, some delay-dependent criteria for interval neural networks (IDNN) with multiple time-varying delays are derived to guarantee global robust asymptotic stability. The main results are generalizations of some recent results reported in the literature. Numerical example is also given to show the effectiveness of our results

Global robust stability for shunting inhibitory CNNs with delays.

Science.gov (United States)

Wang, Lingna; Lin, Yiping

2004-08-01

In this paper, the problem of global robust stability for shunting inhibitory cellular neural networks (SICNNs) is studied. A sufficient condition guaranteeing the network's global robust stability is established. The result can easily be used to verify globally robust stable networks. An example is given to illustrate that the conditions of our results are feasible.

A new delay-independent condition for global robust stability of neural networks with time delays.

Science.gov (United States)

Samli, Ruya

2015-06-01

This paper studies the problem of robust stability of dynamical neural networks with discrete time delays under the assumptions that the network parameters of the neural system are uncertain and norm-bounded, and the activation functions are slope-bounded. By employing the results of Lyapunov stability theory and matrix theory, new sufficient conditions for the existence, uniqueness and global asymptotic stability of the equilibrium point for delayed neural networks are presented. The results reported in this paper can be easily tested by checking some special properties of symmetric matrices associated with the parameter uncertainties of neural networks. We also present a numerical example to show the effectiveness of the proposed theoretical results. Copyright © 2015 Elsevier Ltd. All rights reserved.

Subject independent facial expression recognition with robust face detection using a convolutional neural network.

Science.gov (United States)

Matsugu, Masakazu; Mori, Katsuhiko; Mitari, Yusuke; Kaneda, Yuji

2003-01-01

Reliable detection of ordinary facial expressions (e.g. smile) despite the variability among individuals as well as face appearance is an important step toward the realization of perceptual user interface with autonomous perception of persons. We describe a rule-based algorithm for robust facial expression recognition combined with robust face detection using a convolutional neural network. In this study, we address the problem of subject independence as well as translation, rotation, and scale invariance in the recognition of facial expression. The result shows reliable detection of smiles with recognition rate of 97.6% for 5600 still images of more than 10 subjects. The proposed algorithm demonstrated the ability to discriminate smiling from talking based on the saliency score obtained from voting visual cues. To the best of our knowledge, it is the first facial expression recognition model with the property of subject independence combined with robustness to variability in facial appearance.

Connectivity diagnostics in the Mediterranean obtained from Lagrangian Flow Networks; global patterns, sensitivity and robustness

Science.gov (United States)

Monroy, Pedro; Rossi, Vincent; Ser-Giacomi, Enrico; López, Cristóbal; Hernández-García, Emilio

2017-04-01

Lagrangian Flow Network (LFN) is a modeling framework in which geographical sub-areas of the ocean are represented as nodes in a network and are interconnected by links representing the transport of water, substances or propagules (eggs and larvae) by currents. Here we compute for the surface of the whole Mediterranean basin four connectivity metrics derived from LFN that measure retention and exchange processes, thus providing a systematic characterization of propagule dispersal driven by the ocean circulation. Then we assess the sensitivity and robustness of the results with respect to the most relevant parameters: the density of released particles, the node size (spatial-scales of discretization), the Pelagic Larval Duration (PLD) and the modality of spawning. We find a threshold for the number of particles per node that guarantees reliable values for most of the metrics examined, independently of node size. For our setup, this threshold is 100 particles per node. We also find that the size of network nodes has a non-trivial influence on the spatial variability of both exchange and retention metrics. Although the spatio-temporal fluctuations of the circulation affect larval transport in a complex and unpredictable manner, our analyses evidence how specific biological parametrization impact the robustness of connectivity diagnostics. Connectivity estimates for long PLDs are more robust against biological uncertainties (PLD and spawning date) than for short PLDs. Furthermore, our model suggests that for mass-spawners that release propagules over short periods (≃ 2 to 10 days), daily release must be simulated to properly consider connectivity fluctuations. In contrast, average connectivity estimates for species that spawn repeatedly over longer duration (a few weeks to a few months) remain robust even using longer periodicity (5 to 10 days). Our results give a global view of the surface connectivity of the Mediterranean Sea and have implications for the design of

Green provisioning of the traffic partition grooming in robust, reconfigurable and heterogeneous optical networks

Science.gov (United States)

Hou, Weigang; Yu, Yao; Song, Qingyang; Gong, Xiaoxue

2013-01-01

In recent years, various high-speed network architectures have been widespread deployed. Dense Wavelength Division Multiplexing (DWDM) has gained favor as a terabit solution. The optical circuit switching has also been provided for "sub-rate" aggregation. Such that, the granular types of demands tend to be diverse and must be evaluated. However, current dedicated optical networks do not offer sufficient flexibility to satisfy the requirements of demands with such wide range of granularities. The traffic grooming becomes a power-efficient one only when it does not utilize the aggregation of Coarse-Granularity (CG) demands. The waveband switching merely provides port-cost-effective connections for CG demands regardless of fine-granularity ones. Consequently, in this paper, we devise a heterogeneous grooming method called traffic partition grooming. It combines the power efficiency advantage of the traffic grooming under fine-granularity environment and the port savings advantage of the waveband switching under coarse-granularity environment to provide green provisioning. In addition, the optical virtual topology self-reconfigures along with various optimization objectives variation and has the robustness to determine the pre-unknown information. This paper is also the first work on investigating the issue of Robust, Reconfigurable and Heterogeneous Optical Networking (R2HON). The effective green provisioning and OPEX savings of our R2HON have been demonstrated by numerical simulations.

RObust header compression (ROHC) performance for multimedia transmission over 3G/4G wireless networks

DEFF Research Database (Denmark)

Fitzek, Frank; Rein, S.; Seeling, P.

2005-01-01

Robust Header Compression (ROHC) has recently been proposed to reduce the large protocol header overhead when transmitting voice and other continuous meadi over IP based control stacks in wireless networks. In this paper we evaluate the real-time transmission of GSM encoded voice and H. 26L encod...

RIDES: Robust Intrusion Detection System for IP-Based Ubiquitous Sensor Networks.

Science.gov (United States)

Amin, Syed Obaid; Siddiqui, Muhammad Shoaib; Hong, Choong Seon; Lee, Sungwon

2009-01-01

The IP-based Ubiquitous Sensor Network (IP-USN) is an effort to build the "Internet of things". By utilizing IP for low power networks, we can benefit from existing well established tools and technologies of IP networks. Along with many other unresolved issues, securing IP-USN is of great concern for researchers so that future market satisfaction and demands can be met. Without proper security measures, both reactive and proactive, it is hard to envisage an IP-USN realm. In this paper we present a design of an IDS (Intrusion Detection System) called RIDES (Robust Intrusion DEtection System) for IP-USN. RIDES is a hybrid intrusion detection system, which incorporates both Signature and Anomaly based intrusion detection components. For signature based intrusion detection this paper only discusses the implementation of distributed pattern matching algorithm with the help of signature-code, a dynamically created attack-signature identifier. Other aspects, such as creation of rules are not discussed. On the other hand, for anomaly based detection we propose a scoring classifier based on the SPC (Statistical Process Control) technique called CUSUM charts. We also investigate the settings and their effects on the performance of related parameters for both of the components.

Adaptation of irrigation networks to climate change: Linking robust design and stakeholder contribution

Energy Technology Data Exchange (ETDEWEB)

Granados, A.; Martín-Carrasco, F.J.; García de Jalón, S.; Iglesias, A.

2015-07-01

Agriculture is a particularly sensitive sector to the potential impacts of climate change. Thus, irrigation infrastructure is required to be robust to cope with these potential threats. The objective of this research is designing more robust irrigation networks, considering cost and stakeholder contribution. To that end, the investigation was addressed in three phases: a sensitivity analysis to understand the effectiveness of the distinct variables, a cost-effectiveness analysis assessing their efficiency, and a global study of the most efficient variables to provide an insight into their function. The sensitivity analysis indicates that the networks oversized by means of the coefficient of utilisation or the factor of safety, behave better than those oversized via the continuous specific discharge; moreover, the degree of freedom has been shown ineffective. The cost-effectiveness analysis shows that the coefficient of utilisation and the factor of safety are the most efficient variables, as they introduced safety margin oversizing fewer network elements and to a lesser extent than the continuous specific discharge. It also shows that stakeholder contribution, conveyed as a reduction of the degree of freedom, plays an important role in the network’s adaptive capacity to change. The global study of these variables reveals the subtlety of the coefficient of utilisation, which is the variable that better reproduces the farmer behaviour during demand increase scenarios. In conclusion, the results identify the coefficient of utilisation as the variable which provides the safest margins and reveal the importance of stakeholder contribution in absorb the demand increase in a better manner. (Author)

Adaptation of irrigation networks to climate change: Linking robust design and stakeholder contribution

Directory of Open Access Journals (Sweden)

Alfredo Granados

2015-12-01

Full Text Available Agriculture is a particularly sensitive sector to the potential impacts of climate change. Thus, irrigation infrastructure is required to be robust to cope with these potential threats. The objective of this research is designing more robust irrigation networks, considering cost and stakeholder contribution. To that end, the investigation was addressed in three phases: a sensitivity analysis to understand the effectiveness of the distinct variables, a cost-effectiveness analysis assessing their efficiency, and a global study of the most efficient variables to provide an insight into their function. The sensitivity analysis indicates that the networks oversized by means of the coefficient of utilisation or the factor of safety, behave better than those oversized via the continuous specific discharge; moreover, the degree of freedom has been shown ineffective. The cost-effectiveness analysis shows that the coefficient of utilisation and the factor of safety are the most efficient variables, as they introduced safety margin oversizing fewer network elements and to a lesser extent than the continuous specific discharge. It also shows that stakeholder contribution, conveyed as a reduction of the degree of freedom, plays an important role in the network’s adaptive capacity to change. The global study of these variables reveals the subtlety of the coefficient of utilisation, which is the variable that better reproduces the farmer behaviour during demand increase scenarios. In conclusion, the results identify the coefficient of utilisation as the variable which provides the safest margins and reveal the importance of stakeholder contribution in absorb the demand increase in a better manner.

Applying differential dynamic logic to reconfigurable biological networks.

Science.gov (United States)

Figueiredo, Daniel; Martins, Manuel A; Chaves, Madalena

2017-09-01

Qualitative and quantitative modeling frameworks are widely used for analysis of biological regulatory networks, the former giving a preliminary overview of the system's global dynamics and the latter providing more detailed solutions. Another approach is to model biological regulatory networks as hybrid systems, i.e., systems which can display both continuous and discrete dynamic behaviors. Actually, the development of synthetic biology has shown that this is a suitable way to think about biological systems, which can often be constructed as networks with discrete controllers, and present hybrid behaviors. In this paper we discuss this approach as a special case of the reconfigurability paradigm, well studied in Computer Science (CS). In CS there are well developed computational tools to reason about hybrid systems. We argue that it is worth applying such tools in a biological context. One interesting tool is differential dynamic logic (dL), which has recently been developed by Platzer and applied to many case-studies. In this paper we discuss some simple examples of biological regulatory networks to illustrate how dL can be used as an alternative, or also as a complement to methods already used. Copyright © 2017 Elsevier Inc. All rights reserved.

Robust receding horizon control for networked and distributed nonlinear systems

CERN Document Server

Li, Huiping

2017-01-01

This book offers a comprehensive, easy-to-understand overview of receding-horizon control for nonlinear networks. It presents novel general strategies that can simultaneously handle general nonlinear dynamics, system constraints, and disturbances arising in networked and large-scale systems and which can be widely applied. These receding-horizon-control-based strategies can achieve sub-optimal control performance while ensuring closed-loop stability: a feature attractive to engineers. The authors address the problems of networked and distributed control step-by-step, gradually increasing the level of challenge presented. The book first introduces the state-feedback control problems of nonlinear networked systems and then studies output feedback control problems. For large-scale nonlinear systems, disturbance is considered first, then communication delay separately, and lastly the simultaneous combination of delays and disturbances. Each chapter of this easy-to-follow book not only proposes and analyzes novel ...

Robust exponential stability and domains of attraction in a class of interval neural networks

International Nuclear Information System (INIS)

Yang Xiaofan; Liao Xiaofeng; Bai Sen; Evans, David J

2005-01-01

This paper addresses robust exponential stability as well as domains of attraction in a class of interval neural networks. A sufficient condition for an equilibrium point to be exponentially stable is established. And an estimate on the domains of attraction of exponentially stable equilibrium points is presented. Both the condition and the estimate are formulated in terms of the parameter intervals, the neurons' activation functions and the equilibrium point. Hence, they are easily checkable. In addition, our results neither depend on monotonicity of the activation functions nor on coupling conditions between the neurons. Consequently, these results are of practical importance in evaluating the performance of interval associative memory networks

An H(∞) control approach to robust learning of feedforward neural networks.

Science.gov (United States)

Jing, Xingjian

2011-09-01

A novel H(∞) robust control approach is proposed in this study to deal with the learning problems of feedforward neural networks (FNNs). The analysis and design of a desired weight update law for the FNN is transformed into a robust controller design problem for a discrete dynamic system in terms of the estimation error. The drawbacks of some existing learning algorithms can therefore be revealed, especially for the case that the output data is fast changing with respect to the input or the output data is corrupted by noise. Based on this approach, the optimal learning parameters can be found by utilizing the linear matrix inequality (LMI) optimization techniques to achieve a predefined H(∞) "noise" attenuation level. Several existing BP-type algorithms are shown to be special cases of the new H(∞)-learning algorithm. Theoretical analysis and several examples are provided to show the advantages of the new method. Copyright © 2011 Elsevier Ltd. All rights reserved.

Benford's Law Applies to Online Social Networks.

Science.gov (United States)

Golbeck, Jennifer

2015-01-01

Benford's Law states that, in naturally occurring systems, the frequency of numbers' first digits is not evenly distributed. Numbers beginning with a 1 occur roughly 30% of the time, and are six times more common than numbers beginning with a 9. We show that Benford's Law applies to social and behavioral features of users in online social networks. Using social data from five major social networks (Facebook, Twitter, Google Plus, Pinterest, and LiveJournal), we show that the distribution of first significant digits of friend and follower counts for users in these systems follow Benford's Law. The same is true for the number of posts users make. We extend this to egocentric networks, showing that friend counts among the people in an individual's social network also follows the expected distribution. We discuss how this can be used to detect suspicious or fraudulent activity online and to validate datasets.

Benford's Law Applies to Online Social Networks.

Directory of Open Access Journals (Sweden)

Jennifer Golbeck

Full Text Available Benford's Law states that, in naturally occurring systems, the frequency of numbers' first digits is not evenly distributed. Numbers beginning with a 1 occur roughly 30% of the time, and are six times more common than numbers beginning with a 9. We show that Benford's Law applies to social and behavioral features of users in online social networks. Using social data from five major social networks (Facebook, Twitter, Google Plus, Pinterest, and LiveJournal, we show that the distribution of first significant digits of friend and follower counts for users in these systems follow Benford's Law. The same is true for the number of posts users make. We extend this to egocentric networks, showing that friend counts among the people in an individual's social network also follows the expected distribution. We discuss how this can be used to detect suspicious or fraudulent activity online and to validate datasets.

Robust stability analysis of uncertain stochastic neural networks with interval time-varying delay

International Nuclear Information System (INIS)

Feng Wei; Yang, Simon X.; Fu Wei; Wu Haixia

2009-01-01

This paper addresses the stability analysis problem for uncertain stochastic neural networks with interval time-varying delays. The parameter uncertainties are assumed to be norm bounded, and the delay factor is assumed to be time-varying and belong to a given interval, which means that the lower and upper bounds of interval time-varying delays are available. A sufficient condition is derived such that for all admissible uncertainties, the considered neural network is robustly, globally, asymptotically stable in the mean square. Some stability criteria are formulated by means of the feasibility of a linear matrix inequality (LMI), which can be effectively solved by some standard numerical packages. Finally, numerical examples are provided to demonstrate the usefulness of the proposed criteria.

Corporate Social Networks Applied in the Classroom

Directory of Open Access Journals (Sweden)

Hugo de Juan-Jordán

2016-10-01

This study also tries to propose some guidelines and best practices obtained as a result of the experience of use and the adoption of social networks in class in order to improve the learning process and innovate in the methodology applied to education.

Surface-Supported Robust 2D Lanthanide-Carboxylate Coordination Networks.

Science.gov (United States)

Urgel, José I; Cirera, Borja; Wang, Yang; Auwärter, Willi; Otero, Roberto; Gallego, José M; Alcamí, Manuel; Klyatskaya, Svetlana; Ruben, Mario; Martín, Fernando; Miranda, Rodolfo; Ecija, David; Barth, Johannes V

2015-12-16

Lanthanide-based metal-organic compounds and architectures are promising systems for sensing, heterogeneous catalysis, photoluminescence, and magnetism. Herein, the fabrication of interfacial 2D lanthanide-carboxylate networks is introduced. This study combines low- and variable-temperature scanning tunneling microscopy (STM) and X-ray photoemission spectroscopy (XPS) experiments, and density functional theory (DFT) calculations addressing their design and electronic properties. The bonding of ditopic linear linkers to Gd centers on a Cu(111) surface gives rise to extended nanoporous grids, comprising mononuclear nodes featuring eightfold lateral coordination. XPS and DFT elucidate the nature of the bond, indicating ionic characteristics, which is also manifest in appreciable thermal stability. This study introduces a new generation of robust low-dimensional metallosupramolecular systems incorporating the functionalities of the f-block elements. © 2015 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim.

Robust synthetic biology design: stochastic game theory approach.

Science.gov (United States)

Chen, Bor-Sen; Chang, Chia-Hung; Lee, Hsiao-Ching

2009-07-15

Synthetic biology is to engineer artificial biological systems to investigate natural biological phenomena and for a variety of applications. However, the development of synthetic gene networks is still difficult and most newly created gene networks are non-functioning due to uncertain initial conditions and disturbances of extra-cellular environments on the host cell. At present, how to design a robust synthetic gene network to work properly under these uncertain factors is the most important topic of synthetic biology. A robust regulation design is proposed for a stochastic synthetic gene network to achieve the prescribed steady states under these uncertain factors from the minimax regulation perspective. This minimax regulation design problem can be transformed to an equivalent stochastic game problem. Since it is not easy to solve the robust regulation design problem of synthetic gene networks by non-linear stochastic game method directly, the Takagi-Sugeno (T-S) fuzzy model is proposed to approximate the non-linear synthetic gene network via the linear matrix inequality (LMI) technique through the Robust Control Toolbox in Matlab. Finally, an in silico example is given to illustrate the design procedure and to confirm the efficiency and efficacy of the proposed robust gene design method. http://www.ee.nthu.edu.tw/bschen/SyntheticBioDesign_supplement.pdf.

A robust control strategy for a class of distributed network with transmission delays

DEFF Research Database (Denmark)

Vahid Naghavi, S.; A. Safavi, A.; Khooban, Mohammad Hassan

2016-01-01

Purpose The purpose of this paper is to concern the design of a robust model predictive controller for distributed networked systems with transmission delays. Design/methodology/approach The overall system is composed of a number of interconnected nonlinear subsystems with time-varying transmission...... as an optimization problem of a “worst-case” objective function over an infinite moving horizon. Findings The aim is to propose control synthesis approach that depends on nonlinearity and time varying delay characteristics. The MPC problem is represented in a time varying delayed state feedback structure....... Then the synthesis sufficient condition is provided in the form of a linear matrix inequality (LMI) optimization and is solved online at each time instant. In the rest, an LMI-based decentralized observer-based robust model predictive control strategy is proposed. Originality/value The authors develop RMPC...

Network evolution driven by dynamics applied to graph coloring

International Nuclear Information System (INIS)

Wu Jian-She; Li Li-Guang; Yu Xin; Jiao Li-Cheng; Wang Xiao-Hua

2013-01-01

An evolutionary network driven by dynamics is studied and applied to the graph coloring problem. From an initial structure, both the topology and the coupling weights evolve according to the dynamics. On the other hand, the dynamics of the network are determined by the topology and the coupling weights, so an interesting structure-dynamics co-evolutionary scheme appears. By providing two evolutionary strategies, a network described by the complement of a graph will evolve into several clusters of nodes according to their dynamics. The nodes in each cluster can be assigned the same color and nodes in different clusters assigned different colors. In this way, a co-evolution phenomenon is applied to the graph coloring problem. The proposed scheme is tested on several benchmark graphs for graph coloring

Robust Template Decomposition without Weight Restriction for Cellular Neural Networks Implementing Arbitrary Boolean Functions Using Support Vector Classifiers

Directory of Open Access Journals (Sweden)

Yih-Lon Lin

2013-01-01

Full Text Available If the given Boolean function is linearly separable, a robust uncoupled cellular neural network can be designed as a maximal margin classifier. On the other hand, if the given Boolean function is linearly separable but has a small geometric margin or it is not linearly separable, a popular approach is to find a sequence of robust uncoupled cellular neural networks implementing the given Boolean function. In the past research works using this approach, the control template parameters and thresholds are restricted to assume only a given finite set of integers, and this is certainly unnecessary for the template design. In this study, we try to remove this restriction. Minterm- and maxterm-based decomposition algorithms utilizing the soft margin and maximal margin support vector classifiers are proposed to design a sequence of robust templates implementing an arbitrary Boolean function. Several illustrative examples are simulated to demonstrate the efficiency of the proposed method by comparing our results with those produced by other decomposition methods with restricted weights.

Robust Single Image Super-Resolution via Deep Networks With Sparse Prior.

Science.gov (United States)

Liu, Ding; Wang, Zhaowen; Wen, Bihan; Yang, Jianchao; Han, Wei; Huang, Thomas S

2016-07-01

Single image super-resolution (SR) is an ill-posed problem, which tries to recover a high-resolution image from its low-resolution observation. To regularize the solution of the problem, previous methods have focused on designing good priors for natural images, such as sparse representation, or directly learning the priors from a large data set with models, such as deep neural networks. In this paper, we argue that domain expertise from the conventional sparse coding model can be combined with the key ingredients of deep learning to achieve further improved results. We demonstrate that a sparse coding model particularly designed for SR can be incarnated as a neural network with the merit of end-to-end optimization over training data. The network has a cascaded structure, which boosts the SR performance for both fixed and incremental scaling factors. The proposed training and testing schemes can be extended for robust handling of images with additional degradation, such as noise and blurring. A subjective assessment is conducted and analyzed in order to thoroughly evaluate various SR techniques. Our proposed model is tested on a wide range of images, and it significantly outperforms the existing state-of-the-art methods for various scaling factors both quantitatively and perceptually.

RIDES: Robust Intrusion Detection System for IP-Based Ubiquitous Sensor Networks

Directory of Open Access Journals (Sweden)

Sungwon Lee

2009-05-01

Full Text Available TheIP-based Ubiquitous Sensor Network (IP-USN is an effort to build the “Internet of things”. By utilizing IP for low power networks, we can benefit from existing well established tools and technologies of IP networks. Along with many other unresolved issues, securing IP-USN is of great concern for researchers so that future market satisfaction and demands can be met. Without proper security measures, both reactive and proactive, it is hard to envisage an IP-USN realm. In this paper we present a design of an IDS (Intrusion Detection System called RIDES (Robust Intrusion DEtection System for IP-USN. RIDES is a hybrid intrusion detection system, which incorporates both Signature and Anomaly based intrusion detection components. For signature based intrusion detection this paper only discusses the implementation of distributed pattern matching algorithm with the help of signature-code, a dynamically created attack-signature identifier. Other aspects, such as creation of rules are not discussed. On the other hand, for anomaly based detection we propose a scoring classifier based on the SPC (Statistical Process Control technique called CUSUM charts. We also investigate the settings and their effects on the performance of related parameters for both of the components.

Applied network security monitoring collection, detection, and analysis

CERN Document Server

Sanders, Chris

2013-01-01

Applied Network Security Monitoring is the essential guide to becoming an NSM analyst from the ground up. This book takes a fundamental approach to NSM, complete with dozens of real-world examples that teach you the key concepts of NSM. Network security monitoring is based on the principle that prevention eventually fails. In the current threat landscape, no matter how much you try, motivated attackers will eventually find their way into your network. At that point, it is your ability to detect and respond to that intrusion that can be the difference between a small incident and a major di

Incentive-Compatible Robust Line Planning

Science.gov (United States)

Bessas, Apostolos; Kontogiannis, Spyros; Zaroliagis, Christos

The problem of robust line planning requests for a set of origin-destination paths (lines) along with their frequencies in an underlying railway network infrastructure, which are robust to fluctuations of real-time parameters of the solution. In this work, we investigate a variant of robust line planning stemming from recent regulations in the railway sector that introduce competition and free railway markets, and set up a new application scenario: there is a (potentially large) number of line operators that have their lines fixed and operate as competing entities issuing frequency requests, while the management of the infrastructure itself remains the responsibility of a single entity, the network operator. The line operators are typically unwilling to reveal their true incentives, while the network operator strives to ensure a fair (or socially optimal) usage of the infrastructure, e.g., by maximizing the (unknown to him) aggregate incentives of the line operators.

Robust Deep Network with Maximum Correntropy Criterion for Seizure Detection

Directory of Open Access Journals (Sweden)

Yu Qi

2014-01-01

Full Text Available Effective seizure detection from long-term EEG is highly important for seizure diagnosis. Existing methods usually design the feature and classifier individually, while little work has been done for the simultaneous optimization of the two parts. This work proposes a deep network to jointly learn a feature and a classifier so that they could help each other to make the whole system optimal. To deal with the challenge of the impulsive noises and outliers caused by EMG artifacts in EEG signals, we formulate a robust stacked autoencoder (R-SAE as a part of the network to learn an effective feature. In R-SAE, the maximum correntropy criterion (MCC is proposed to reduce the effect of noise/outliers. Unlike the mean square error (MSE, the output of the new kernel MCC increases more slowly than that of MSE when the input goes away from the center. Thus, the effect of those noises/outliers positioned far away from the center can be suppressed. The proposed method is evaluated on six patients of 33.6 hours of scalp EEG data. Our method achieves a sensitivity of 100% and a specificity of 99%, which is promising for clinical applications.

RUASN: A Robust User Authentication Framework for Wireless Sensor Networks

Directory of Open Access Journals (Sweden)

Hoon-Jae Lee

2011-05-01

Full Text Available In recent years, wireless sensor networks (WSNs have been considered as a potential solution for real-time monitoring applications and these WSNs have potential practical impact on next generation technology too. However, WSNs could become a threat if suitable security is not considered before the deployment and if there are any loopholes in their security, which might open the door for an attacker and hence, endanger the application. User authentication is one of the most important security services to protect WSN data access from unauthorized users; it should provide both mutual authentication and session key establishment services. This paper proposes a robust user authentication framework for wireless sensor networks, based on a two-factor (password and smart card concept. This scheme facilitates many services to the users such as user anonymity, mutual authentication, secure session key establishment and it allows users to choose/update their password regularly, whenever needed. Furthermore, we have provided the formal verification using Rubin logic and compare RUASN with many existing schemes. As a result, we found that the proposed scheme possesses many advantages against popular attacks, and achieves better efficiency at low computation cost.

Robust FDI for a Class of Nonlinear Networked Systems with ROQs

Directory of Open Access Journals (Sweden)

An-quan Sun

2014-01-01

Full Text Available This paper considers the robust fault detection and isolation (FDI problem for a class of nonlinear networked systems (NSs with randomly occurring quantisations (ROQs. After vector augmentation, Lyapunov function is introduced to ensure the asymptotically mean-square stability of fault detection system. By transforming the quantisation effects into sector-bounded parameter uncertainties, sufficient conditions ensuring the existence of fault detection filter are proposed, which can reduce the difference between output residuals and fault signals as small as possible under H∞ framework. Finally, an example linearized from a vehicle system is introduced to show the efficiency of the proposed fault detection filter.

Design of Active Queue Management for Robust Control on Access Router for Heterogeneous Networks

Directory of Open Access Journals (Sweden)

Åhlund Christer

2011-01-01

Full Text Available The Internet architecture is a packet switching technology that allows dynamic sharing of bandwidth among different flows with in an IP network. Packets are stored and forwarded from one node to the next until reaching their destination. Major issues in this integration are congestion control and how to meet different quality of service requirements associated with various services. In other words streaming media quality degrades with increased packet delay and jitter caused by network congestion. To mitigate the impact of network congestion, various techniques have been used to improve multimedia quality and one of those techniques is Active Queue Management (AQM. Access routers require a buffer to hold packets during times of congestion. A large buffer can absorb the bursty arrivals, and this tends to increase the link utilizations but results in higher queuing delays. Traffic burstiness has a considerable negative impact on network performance. AQM is now considered an effective congestion control mechanism for enhancing transport protocol performance over wireless links. In order to have good link utilization, it is necessary for queues to adapt to varying traffic loads. This paper considers a particular scheme which is called Adaptive AQM (AAQM and studies its performance in the presence of feedback delays and its ability to maintain a small queue length as well as its robustness in the presence of traffic burstiness. The paper also presents a method based on the well-known Markov Modulated Poisson Process (MPP to capture traffic burstiness and buffer occupancy. To demonstrate the generality of the presented method, an analytic model is described and verified by extensive simulations of different adaptive AQM algorithms. The analysis and simulations show that AAQM outperforms the other AQMs with respect to responsiveness and robustness.

Novel global robust stability criteria for interval neural networks with multiple time-varying delays

International Nuclear Information System (INIS)

Xu Shengyuan; Lam, James; Ho, Daniel W.C.

2005-01-01

This Letter is concerned with the problem of robust stability analysis for interval neural networks with multiple time-varying delays and parameter uncertainties. The parameter uncertainties are assumed to be bounded in given compact sets and the activation functions are supposed to be bounded and globally Lipschitz continuous. A sufficient condition is obtained by means of Lyapunov functionals, which guarantees the existence, uniqueness and global asymptotic stability of the delayed neural network for all admissible uncertainties. This condition is in terms of a linear matrix inequality (LMI), which can be easily checked by using recently developed algorithms in solving LMIs. Finally, a numerical example is provided to demonstrate the effectiveness of the proposed method

Global robust stability of delayed neural networks: Estimating upper limit of norm of delayed connection weight matrix

International Nuclear Information System (INIS)

Singh, Vimal

2007-01-01

The question of estimating the upper limit of -parallel B -parallel 2 , which is a key step in some recently reported global robust stability criteria for delayed neural networks, is revisited ( B denotes the delayed connection weight matrix). Recently, Cao, Huang, and Qu have given an estimate of the upper limit of -parallel B -parallel 2 . In the present paper, an alternative estimate of the upper limit of -parallel B -parallel 2 is highlighted. It is shown that the alternative estimate may yield some new global robust stability results

A Two-Stage Robust Optimization for Centralized-Optimal Dispatch of Photovoltaic Inverters in Active Distribution Networks

DEFF Research Database (Denmark)

Ding, Tao; Li, Cheng; Yang, Yongheng

2017-01-01

Optimally dispatching Photovoltaic (PV) inverters is an efficient way to avoid overvoltage in active distribution networks, which may occur in the case of PV generation surplus load demand. Typically, the dispatching optimization objective is to identify critical PV inverters that have the most...... nature of solar PV energy may affect the selection of the critical PV inverters and also the final optimal objective value. In order to address this issue, a two-stage robust optimization model is proposed in this paper to achieve a robust optimal solution to the PV inverter dispatch, which can hedge...... against any possible realization within the uncertain PV outputs. In addition, the conic relaxation-based branch flow formulation and second-order cone programming based column-and-constraint generation algorithm are employed to deal with the proposed robust optimization model. Case studies on a 33-bus...

Applied Knowledge Management to Mitigate Cognitive Load in Network-Enabled Mission Command

Science.gov (United States)

2017-11-22

ARL-TN-0859 ● NOV 2017 US Army Research Laboratory Applied Knowledge Management to Mitigate Cognitive Load in Network-Enabled...Applied Knowledge Management to Mitigate Cognitive Load in Network-Enabled Mission Command by John K Hawley Human Research and Engineering...REPORT TYPE Technical Note 3. DATES COVERED (From - To) 1 May 2016–20 April 2017 4. TITLE AND SUBTITLE Applied Knowledge Management to Mitigate

High Resolution Robust GPS-free Localization for Wireless Sensor Networks and its Applications

KAUST Repository

Mirza, Mohammed

2011-12-12

In this thesis we investigate the problem of robustness and scalability w.r.t. estimating the position of randomly deployed motes/nodes of a Wireless Sensor Network (WSN) without the help of Global Positioning System (GPS) devices. We propose a few applications of range independent localization algorithms that allow the sensors to actively determine their location with high resolution without increasing the complexity of the hardware or any additional device setup. In our first application we try to present a localized and centralized cooperative spectrum sensing using RF sensor networks. This scheme collaboratively sense the spectrum and localize the whole network efficiently and with less difficulty. In second application we try to focus on how efficiently we can localize the nodes, to detect underwater threats, without the use of beacons. In third application we try to focus on 3-Dimensional localization for LTE systems. Our performance evaluation shows that these schemes lead to a significant improvement in localization accuracy compared to the state-of-art range independent localization schemes, without requiring GPS support.

Robust stability analysis for Markovian jumping interval neural networks with discrete and distributed time-varying delays

International Nuclear Information System (INIS)

Balasubramaniam, P.; Lakshmanan, S.; Manivannan, A.

2012-01-01

Highlights: ► Robust stability analysis for Markovian jumping interval neural networks is considered. ► Both linear fractional and interval uncertainties are considered. ► A new LKF is constructed with triple integral terms. ► MATLAB LMI control toolbox is used to validate theoretical results. ► Numerical examples are given to illustrate the effectiveness of the proposed method. - Abstract: This paper investigates robust stability analysis for Markovian jumping interval neural networks with discrete and distributed time-varying delays. The parameter uncertainties are assumed to be bounded in given compact sets. The delay is assumed to be time-varying and belong to a given interval, which means that the lower and upper bounds of interval time-varying delays are available. Based on the new Lyapunov–Krasovskii functional (LKF), some inequality techniques and stochastic stability theory, new delay-dependent stability criteria have been obtained in terms of linear matrix inequalities (LMIs). Finally, two numerical examples are given to illustrate the less conservative and effectiveness of our theoretical results.

Revisiting Robustness and Evolvability: Evolution in Weighted Genotype Spaces

Science.gov (United States)

Partha, Raghavendran; Raman, Karthik

2014-01-01

Robustness and evolvability are highly intertwined properties of biological systems. The relationship between these properties determines how biological systems are able to withstand mutations and show variation in response to them. Computational studies have explored the relationship between these two properties using neutral networks of RNA sequences (genotype) and their secondary structures (phenotype) as a model system. However, these studies have assumed every mutation to a sequence to be equally likely; the differences in the likelihood of the occurrence of various mutations, and the consequence of probabilistic nature of the mutations in such a system have previously been ignored. Associating probabilities to mutations essentially results in the weighting of genotype space. We here perform a comparative analysis of weighted and unweighted neutral networks of RNA sequences, and subsequently explore the relationship between robustness and evolvability. We show that assuming an equal likelihood for all mutations (as in an unweighted network), underestimates robustness and overestimates evolvability of a system. In spite of discarding this assumption, we observe that a negative correlation between sequence (genotype) robustness and sequence evolvability persists, and also that structure (phenotype) robustness promotes structure evolvability, as observed in earlier studies using unweighted networks. We also study the effects of base composition bias on robustness and evolvability. Particularly, we explore the association between robustness and evolvability in a sequence space that is AU-rich – sequences with an AU content of 80% or higher, compared to a normal (unbiased) sequence space. We find that evolvability of both sequences and structures in an AU-rich space is lesser compared to the normal space, and robustness higher. We also observe that AU-rich populations evolving on neutral networks of phenotypes, can access less phenotypic variation compared to

Dynamics robustness of cascading systems.

Directory of Open Access Journals (Sweden)

Jonathan T Young

2017-03-01

Full Text Available A most important property of biochemical systems is robustness. Static robustness, e.g., homeostasis, is the insensitivity of a state against perturbations, whereas dynamics robustness, e.g., homeorhesis, is the insensitivity of a dynamic process. In contrast to the extensively studied static robustness, dynamics robustness, i.e., how a system creates an invariant temporal profile against perturbations, is little explored despite transient dynamics being crucial for cellular fates and are reported to be robust experimentally. For example, the duration of a stimulus elicits different phenotypic responses, and signaling networks process and encode temporal information. Hence, robustness in time courses will be necessary for functional biochemical networks. Based on dynamical systems theory, we uncovered a general mechanism to achieve dynamics robustness. Using a three-stage linear signaling cascade as an example, we found that the temporal profiles and response duration post-stimulus is robust to perturbations against certain parameters. Then analyzing the linearized model, we elucidated the criteria of when signaling cascades will display dynamics robustness. We found that changes in the upstream modules are masked in the cascade, and that the response duration is mainly controlled by the rate-limiting module and organization of the cascade's kinetics. Specifically, we found two necessary conditions for dynamics robustness in signaling cascades: 1 Constraint on the rate-limiting process: The phosphatase activity in the perturbed module is not the slowest. 2 Constraints on the initial conditions: The kinase activity needs to be fast enough such that each module is saturated even with fast phosphatase activity and upstream changes are attenuated. We discussed the relevance of such robustness to several biological examples and the validity of the above conditions therein. Given the applicability of dynamics robustness to a variety of systems, it

How to implement and apply robust design: insights from industrial practice

DEFF Research Database (Denmark)

Krogstie, Lars; Ebro, Martin; Howard, Thomas J.

2015-01-01

. Empirical findings are based on a series of semi-structured interviews with four major engineering companies in Northern Europe. We present why they were motivated to use RD, how it has been implemented and currently applied. Success factors for solving implementation challenges are also presented......Robust design (RD) is a framework for designing products and processes which perform consistently in spite of variations. Although it is well described in literature, research shows limited industrial application. The purpose of this paper is to describe and discuss industrial best-practice on RD...... have all been successful in using RD but with quite different approaches, depending on, for example, their organisational culture, and (3) Not just management commitment, but also true management competencies in RD are essential for a successful implementation. The paper is aimed at professionals...

Robust Vehicle Detection in Aerial Images Based on Cascaded Convolutional Neural Networks.

Science.gov (United States)

Zhong, Jiandan; Lei, Tao; Yao, Guangle

2017-11-24

Vehicle detection in aerial images is an important and challenging task. Traditionally, many target detection models based on sliding-window fashion were developed and achieved acceptable performance, but these models are time-consuming in the detection phase. Recently, with the great success of convolutional neural networks (CNNs) in computer vision, many state-of-the-art detectors have been designed based on deep CNNs. However, these CNN-based detectors are inefficient when applied in aerial image data due to the fact that the existing CNN-based models struggle with small-size object detection and precise localization. To improve the detection accuracy without decreasing speed, we propose a CNN-based detection model combining two independent convolutional neural networks, where the first network is applied to generate a set of vehicle-like regions from multi-feature maps of different hierarchies and scales. Because the multi-feature maps combine the advantage of the deep and shallow convolutional layer, the first network performs well on locating the small targets in aerial image data. Then, the generated candidate regions are fed into the second network for feature extraction and decision making. Comprehensive experiments are conducted on the Vehicle Detection in Aerial Imagery (VEDAI) dataset and Munich vehicle dataset. The proposed cascaded detection model yields high performance, not only in detection accuracy but also in detection speed.

Network properties of robust immunity in plants.

Directory of Open Access Journals (Sweden)

Kenichi Tsuda

2009-12-01

Full Text Available Two modes of plant immunity against biotrophic pathogens, Effector Triggered Immunity (ETI and Pattern-Triggered Immunity (PTI, are triggered by recognition of pathogen effectors and Microbe-Associated Molecular Patterns (MAMPs, respectively. Although the jasmonic acid (JA/ethylene (ET and salicylic acid (SA signaling sectors are generally antagonistic and important for immunity against necrotrophic and biotrophic pathogens, respectively, their precise roles and interactions in ETI and PTI have not been clear. We constructed an Arabidopsis dde2/ein2/pad4/sid2-quadruple mutant. DDE2, EIN2, and SID2 are essential components of the JA, ET, and SA sectors, respectively. The pad4 mutation affects the SA sector and a poorly characterized sector. Although the ETI triggered by the bacterial effector AvrRpt2 (AvrRpt2-ETI and the PTI triggered by the bacterial MAMP flg22 (flg22-PTI were largely intact in plants with mutations in any one of these genes, they were mostly abolished in the quadruple mutant. For the purposes of this study, AvrRpt2-ETI and flg22-PTI were measured as relative growth of Pseudomonas syringae bacteria within leaves. Immunity to the necrotrophic fungal pathogen Alternaria brassicicola was also severely compromised in the quadruple mutant. Quantitative measurements of the immunity levels in all combinatorial mutants and wild type allowed us to estimate the effects of the wild-type genes and their interactions on the immunity by fitting a mixed general linear model. This signaling allocation analysis showed that, contrary to current ideas, each of the JA, ET, and SA signaling sectors can positively contribute to immunity against both biotrophic and necrotrophic pathogens. The analysis also revealed that while flg22-PTI and AvrRpt2-ETI use a highly overlapping signaling network, the way they use the common network is very different: synergistic relationships among the signaling sectors are evident in PTI, which may amplify the signal

Performance and complexity of tunable sparse network coding with gradual growing tuning functions over wireless networks

OpenAIRE

Garrido Ortiz, Pablo; Sørensen, Chres W.; Lucani Roetter, Daniel Enrique; Agüero Calvo, Ramón

2016-01-01

Random Linear Network Coding (RLNC) has been shown to be a technique with several benefits, in particular when applied over wireless mesh networks, since it provides robustness against packet losses. On the other hand, Tunable Sparse Network Coding (TSNC) is a promising concept, which leverages a trade-off between computational complexity and goodput. An optimal density tuning function has not been found yet, due to the lack of a closed-form expression that links density, performance and comp...

Retail optimization in Romanian metallurgical industry by applying of fuzzy networks concept

Directory of Open Access Journals (Sweden)

Ioana Adrian

2017-01-01

Full Text Available Our article presents possibilities of applying the concept Fuzzy Networks for an efficient metallurgical industry in Romania. We also present and analyze Fuzzy Networks complementary concepts, such as Expert Systems (ES, Enterprise Resource Planning (ERP, Analytics and Intelligent Strategies (SAI. The main results of our article are based on a case study of the possibilities of applying these concepts in metallurgy through Fuzzy Networks. Also, it is presented a case study on the application of the FUZZY concept on the Romanian metallurgical industry.

Applying Trusted Network Technology To Process Control Systems

Science.gov (United States)

Okhravi, Hamed; Nicol, David

Interconnections between process control networks and enterprise networks expose instrumentation and control systems and the critical infrastructure components they operate to a variety of cyber attacks. Several architectural standards and security best practices have been proposed for industrial control systems. However, they are based on older architectures and do not leverage the latest hardware and software technologies. This paper describes new technologies that can be applied to the design of next generation security architectures for industrial control systems. The technologies are discussed along with their security benefits and design trade-offs.

Experimental Investigation on Adaptive Robust Controller Designs Applied to Constrained Manipulators

Directory of Open Access Journals (Sweden)

Marco H. Terra

2013-04-01

Full Text Available In this paper, two interlaced studies are presented. The first is directed to the design and construction of a dynamic 3D force/moment sensor. The device is applied to provide a feedback signal of forces and moments exerted by the robotic end-effector. This development has become an alternative solution to the existing multi-axis load cell based on static force and moment sensors. The second one shows an experimental investigation on the performance of four different adaptive nonlinear H∞ control methods applied to a constrained manipulator subject to uncertainties in the model and external disturbances. Coordinated position and force control is evaluated. Adaptive procedures are based on neural networks and fuzzy systems applied in two different modeling strategies. The first modeling strategy requires a well-known nominal model for the robot, so that the intelligent systems are applied only to estimate the effects of uncertainties, unmodeled dynamics and external disturbances. The second strategy considers that the robot model is completely unknown and, therefore, intelligent systems are used to estimate these dynamics. A comparative study is conducted based on experimental implementations performed with an actual planar manipulator and with the dynamic force sensor developed for this purpose.

Instrumentation for Scientific Computing in Neural Networks, Information Science, Artificial Intelligence, and Applied Mathematics.

Science.gov (United States)

1987-10-01

include Security Classification) Instrumentation for scientific computing in neural networks, information science, artificial intelligence, and...instrumentation grant to purchase equipment for support of research in neural networks, information science, artificail intellignece , and applied mathematics...in Neural Networks, Information Science, Artificial Intelligence, and Applied Mathematics Contract AFOSR 86-0282 Principal Investigator: Stephen

Perceptual Robust Design

DEFF Research Database (Denmark)

Pedersen, Søren Nygaard

The research presented in this PhD thesis has focused on a perceptual approach to robust design. The results of the research and the original contribution to knowledge is a preliminary framework for understanding, positioning, and applying perceptual robust design. Product quality is a topic...... been presented. Therefore, this study set out to contribute to the understanding and application of perceptual robust design. To achieve this, a state-of-the-art and current practice review was performed. From the review two main research problems were identified. Firstly, a lack of tools...... for perceptual robustness was found to overlap with the optimum for functional robustness and at most approximately 2.2% out of the 14.74% could be ascribed solely to the perceptual robustness optimisation. In conclusion, the thesis have offered a new perspective on robust design by merging robust design...

Assessing the Liquidity of Firms: Robust Neural Network Regression as an Alternative to the Current Ratio

Science.gov (United States)

de Andrés, Javier; Landajo, Manuel; Lorca, Pedro; Labra, Jose; Ordóñez, Patricia

Artificial neural networks have proven to be useful tools for solving financial analysis problems such as financial distress prediction and audit risk assessment. In this paper we focus on the performance of robust (least absolute deviation-based) neural networks on measuring liquidity of firms. The problem of learning the bivariate relationship between the components (namely, current liabilities and current assets) of the so-called current ratio is analyzed, and the predictive performance of several modelling paradigms (namely, linear and log-linear regressions, classical ratios and neural networks) is compared. An empirical analysis is conducted on a representative data base from the Spanish economy. Results indicate that classical ratio models are largely inadequate as a realistic description of the studied relationship, especially when used for predictive purposes. In a number of cases, especially when the analyzed firms are microenterprises, the linear specification is improved by considering the flexible non-linear structures provided by neural networks.

Applying Model Based Systems Engineering to NASA's Space Communications Networks

Science.gov (United States)

Bhasin, Kul; Barnes, Patrick; Reinert, Jessica; Golden, Bert

2013-01-01

System engineering practices for complex systems and networks now require that requirement, architecture, and concept of operations product development teams, simultaneously harmonize their activities to provide timely, useful and cost-effective products. When dealing with complex systems of systems, traditional systems engineering methodology quickly falls short of achieving project objectives. This approach is encumbered by the use of a number of disparate hardware and software tools, spreadsheets and documents to grasp the concept of the network design and operation. In case of NASA's space communication networks, since the networks are geographically distributed, and so are its subject matter experts, the team is challenged to create a common language and tools to produce its products. Using Model Based Systems Engineering methods and tools allows for a unified representation of the system in a model that enables a highly related level of detail. To date, Program System Engineering (PSE) team has been able to model each network from their top-level operational activities and system functions down to the atomic level through relational modeling decomposition. These models allow for a better understanding of the relationships between NASA's stakeholders, internal organizations, and impacts to all related entities due to integration and sustainment of existing systems. Understanding the existing systems is essential to accurate and detailed study of integration options being considered. In this paper, we identify the challenges the PSE team faced in its quest to unify complex legacy space communications networks and their operational processes. We describe the initial approaches undertaken and the evolution toward model based system engineering applied to produce Space Communication and Navigation (SCaN) PSE products. We will demonstrate the practice of Model Based System Engineering applied to integrating space communication networks and the summary of its

2016 Network Games, Control, and Optimization Conference

CERN Document Server

Jimenez, Tania; Solan, Eilon

2017-01-01

This contributed volume offers a collection of papers presented at the 2016 Network Games, Control, and Optimization conference (NETGCOOP), held at the University of Avignon in France, November 23-25, 2016. These papers highlight the increasing importance of network control and optimization in many networking application domains, such as mobile and fixed access networks, computer networks, social networks, transportation networks, and, more recently, electricity grids and biological networks. Covering a wide variety of both theoretical and applied topics in the areas listed above, the authors explore several conceptual and algorithmic tools that are needed for efficient and robust control operation, performance optimization, and better understanding the relationships between entities that may be acting cooperatively or selfishly in uncertain and possibly adversarial environments. As such, this volume will be of interest to applied mathematicians, computer scientists, engineers, and researchers in other relate...

Robust Growth Determinants

OpenAIRE

Doppelhofer, Gernot; Weeks, Melvyn

2011-01-01

This paper investigates the robustness of determinants of economic growth in the presence of model uncertainty, parameter heterogeneity and outliers. The robust model averaging approach introduced in the paper uses a flexible and parsi- monious mixture modeling that allows for fat-tailed errors compared to the normal benchmark case. Applying robust model averaging to growth determinants, the paper finds that eight out of eighteen variables found to be significantly related to economic growth ...

Aerodynamic design applying automatic differentiation and using robust variable fidelity optimization

Science.gov (United States)

Takemiya, Tetsushi

, and that (2) the AMF terminates optimization erroneously when the optimization problems have constraints. The first problem is due to inaccuracy in computing derivatives in the AMF, and the second problem is due to erroneous treatment of the trust region ratio, which sets the size of the domain for an optimization in the AMF. In order to solve the first problem of the AMF, automatic differentiation (AD) technique, which reads the codes of analysis models and automatically generates new derivative codes based on some mathematical rules, is applied. If derivatives are computed with the generated derivative code, they are analytical, and the required computational time is independent of the number of design variables, which is very advantageous for realistic aerospace engineering problems. However, if analysis models implement iterative computations such as computational fluid dynamics (CFD), which solves system partial differential equations iteratively, computing derivatives through the AD requires a massive memory size. The author solved this deficiency by modifying the AD approach and developing a more efficient implementation with CFD, and successfully applied the AD to general CFD software. In order to solve the second problem of the AMF, the governing equation of the trust region ratio, which is very strict against the violation of constraints, is modified so that it can accept the violation of constraints within some tolerance. By accepting violations of constraints during the optimization process, the AMF can continue optimization without terminating immaturely and eventually find the true optimum design point. With these modifications, the AMF is referred to as "Robust AMF," and it is applied to airfoil and wing aerodynamic design problems using Euler CFD software. The former problem has 21 design variables, and the latter 64. In both problems, derivatives computed with the proposed AD method are first compared with those computed with the finite

Studies of stability and robustness for artificial neural networks and boosted decision trees

International Nuclear Information System (INIS)

Yang, H.-J.; Roe, Byron P.; Zhu Ji

2007-01-01

In this paper, we compare the performance, stability and robustness of Artificial Neural Networks (ANN) and Boosted Decision Trees (BDT) using MiniBooNE Monte Carlo samples. These methods attempt to classify events given a number of identification variables. The BDT algorithm has been discussed by us in previous publications. Testing is done in this paper by smearing and shifting the input variables of testing samples. Based on these studies, BDT has better particle identification performance than ANN. The degradation of the classifications obtained by shifting or smearing variables of testing results is smaller for BDT than for ANN

PARAMETER COORDINATION AND ROBUST OPTIMIZATION FOR MULTIDISCIPLINARY DESIGN

Institute of Scientific and Technical Information of China (English)

HU Jie; PENG Yinghong; XIONG Guangleng

2006-01-01

A new parameter coordination and robust optimization approach for multidisciplinary design is presented. Firstly, the constraints network model is established to support engineering change, coordination and optimization. In this model, interval boxes are adopted to describe the uncertainty of design parameters quantitatively to enhance the design robustness. Secondly, the parameter coordination method is presented to solve the constraints network model, monitor the potential conflicts due to engineering changes, and obtain the consistency solution space corresponding to the given product specifications. Finally, the robust parameter optimization model is established, and genetic arithmetic is used to obtain the robust optimization parameter. An example of bogie design is analyzed to show the scheme to be effective.

Monitoring of Thermal Protection Systems Using Robust Self-Organizing Optical Fiber Sensing Networks

Science.gov (United States)

Richards, Lance

2013-01-01

The general aim of this work is to develop and demonstrate a prototype structural health monitoring system for thermal protection systems that incorporates piezoelectric acoustic emission (AE) sensors to detect the occurrence and location of damaging impacts, and an optical fiber Bragg grating (FBG) sensor network to evaluate the effect of detected damage on the thermal conductivity of the TPS material. Following detection of an impact, the TPS would be exposed to a heat source, possibly the sun, and the temperature distribution on the inner surface in the vicinity of the impact measured by the FBG network. A similar procedure could also be carried out as a screening test immediately prior to re-entry. The implications of any detected anomalies in the measured temperature distribution will be evaluated for their significance in relation to the performance of the TPS during re-entry. Such a robust TPS health monitoring system would ensure overall crew safety throughout the mission, especially during reentry

A simulation-based robust biofuel facility location model for an integrated bio-energy logistics network

Directory of Open Access Journals (Sweden)

Jae-Dong Hong

2014-10-01

Full Text Available Purpose: The purpose of this paper is to propose a simulation-based robust biofuel facility location model for solving an integrated bio-energy logistics network (IBLN problem, where biomass yield is often uncertain or difficult to determine.Design/methodology/approach: The IBLN considered in this paper consists of four different facilities: farm or harvest site (HS, collection facility (CF, biorefinery (BR, and blending station (BS. Authors propose a mixed integer quadratic modeling approach to simultaneously determine the optimal CF and BR locations and corresponding biomass and bio-energy transportation plans. The authors randomly generate biomass yield of each HS and find the optimal locations of CFs and BRs for each generated biomass yield, and select the robust locations of CFs and BRs to show the effects of biomass yield uncertainty on the optimality of CF and BR locations. Case studies using data from the State of South Carolina in the United State are conducted to demonstrate the developed model’s capability to better handle the impact of uncertainty of biomass yield.Findings: The results illustrate that the robust location model for BRs and CFs works very well in terms of the total logistics costs. The proposed model would help decision-makers find the most robust locations for biorefineries and collection facilities, which usually require huge investments, and would assist potential investors in identifying the least cost or important facilities to invest in the biomass and bio-energy industry.Originality/value: An optimal biofuel facility location model is formulated for the case of deterministic biomass yield. To improve the robustness of the model for cases with probabilistic biomass yield, the model is evaluated by a simulation approach using case studies. The proposed model and robustness concept would be a very useful tool that helps potential biofuel investors minimize their investment risk.

Integrating network ecology with applied conservation: a synthesis and guide to implementation.

Science.gov (United States)

Kaiser-Bunbury, Christopher N; Blüthgen, Nico

2015-07-10

Ecological networks are a useful tool to study the complexity of biotic interactions at a community level. Advances in the understanding of network patterns encourage the application of a network approach in other disciplines than theoretical ecology, such as biodiversity conservation. So far, however, practical applications have been meagre. Here we present a framework for network analysis to be harnessed to advance conservation management by using plant-pollinator networks and islands as model systems. Conservation practitioners require indicators to monitor and assess management effectiveness and validate overall conservation goals. By distinguishing between two network attributes, the 'diversity' and 'distribution' of interactions, on three hierarchical levels (species, guild/group and network) we identify seven quantitative metrics to describe changes in network patterns that have implications for conservation. Diversity metrics are partner diversity, vulnerability/generality, interaction diversity and interaction evenness, and distribution metrics are the specialization indices d' and [Formula: see text] and modularity. Distribution metrics account for sampling bias and may therefore be suitable indicators to detect human-induced changes to plant-pollinator communities, thus indirectly assessing the structural and functional robustness and integrity of ecosystems. We propose an implementation pathway that outlines the stages that are required to successfully embed a network approach in biodiversity conservation. Most importantly, only if conservation action and study design are aligned by practitioners and ecologists through joint experiments, are the findings of a conservation network approach equally beneficial for advancing adaptive management and ecological network theory. We list potential obstacles to the framework, highlight the shortfall in empirical, mostly experimental, network data and discuss possible solutions. Published by Oxford University

Preliminary Studies Concerning the Evaluation of Road Network Robustness for Iaşi National Roads Department

OpenAIRE

Cozar, Alexandru; Horobeţ, Iulian

2011-01-01

Structural robustness in road field is a new concept, very little addressed in specialized literature, both in Romania and abroad. Natural and weather phenomena that occur more frequently are more destructive than ever, endanger normal activities and can wreck road networks, causing significant damages (Grecu, 2005). These phenomena can be diverse: earthquakes, volcanic eruptions, tsunami, landslides, storms, floods, droughts, fire or avalanches. Our country is also affected by natural dis...

Robust spatial memory maps in flickering neuronal networks: a topological model

Science.gov (United States)

Dabaghian, Yuri; Babichev, Andrey; Memoli, Facundo; Chowdhury, Samir; Rice University Collaboration; Ohio State University Collaboration

It is widely accepted that the hippocampal place cells provide a substrate of the neuronal representation of the environment--the ``cognitive map''. However, hippocampal network, as any other network in the brain is transient: thousands of hippocampal neurons die every day and the connections formed by these cells constantly change due to various forms of synaptic plasticity. What then explains the remarkable reliability of our spatial memories? We propose a computational approach to answering this question based on a couple of insights. First, we propose that the hippocampal cognitive map is fundamentally topological, and hence it is amenable to analysis by topological methods. We then apply several novel methods from homology theory, to understand how dynamic connections between cells influences the speed and reliability of spatial learning. We simulate the rat's exploratory movements through different environments and study how topological invariants of these environments arise in a network of simulated neurons with ``flickering'' connectivity. We find that despite transient connectivity the network of place cells produces a stable representation of the topology of the environment.

Nonlinear Dynamics in Gene Regulation Promote Robustness and Evolvability of Gene Expression Levels.

Science.gov (United States)

Steinacher, Arno; Bates, Declan G; Akman, Ozgur E; Soyer, Orkun S

2016-01-01

Cellular phenotypes underpinned by regulatory networks need to respond to evolutionary pressures to allow adaptation, but at the same time be robust to perturbations. This creates a conflict in which mutations affecting regulatory networks must both generate variance but also be tolerated at the phenotype level. Here, we perform mathematical analyses and simulations of regulatory networks to better understand the potential trade-off between robustness and evolvability. Examining the phenotypic effects of mutations, we find an inverse correlation between robustness and evolvability that breaks only with nonlinearity in the network dynamics, through the creation of regions presenting sudden changes in phenotype with small changes in genotype. For genotypes embedding low levels of nonlinearity, robustness and evolvability correlate negatively and almost perfectly. By contrast, genotypes embedding nonlinear dynamics allow expression levels to be robust to small perturbations, while generating high diversity (evolvability) under larger perturbations. Thus, nonlinearity breaks the robustness-evolvability trade-off in gene expression levels by allowing disparate responses to different mutations. Using analytical derivations of robustness and system sensitivity, we show that these findings extend to a large class of gene regulatory network architectures and also hold for experimentally observed parameter regimes. Further, the effect of nonlinearity on the robustness-evolvability trade-off is ensured as long as key parameters of the system display specific relations irrespective of their absolute values. We find that within this parameter regime genotypes display low and noisy expression levels. Examining the phenotypic effects of mutations, we find an inverse correlation between robustness and evolvability that breaks only with nonlinearity in the network dynamics. Our results provide a possible solution to the robustness-evolvability trade-off, suggest an explanation for

Nonlinear Dynamics in Gene Regulation Promote Robustness and Evolvability of Gene Expression Levels.

Directory of Open Access Journals (Sweden)

Arno Steinacher

Full Text Available Cellular phenotypes underpinned by regulatory networks need to respond to evolutionary pressures to allow adaptation, but at the same time be robust to perturbations. This creates a conflict in which mutations affecting regulatory networks must both generate variance but also be tolerated at the phenotype level. Here, we perform mathematical analyses and simulations of regulatory networks to better understand the potential trade-off between robustness and evolvability. Examining the phenotypic effects of mutations, we find an inverse correlation between robustness and evolvability that breaks only with nonlinearity in the network dynamics, through the creation of regions presenting sudden changes in phenotype with small changes in genotype. For genotypes embedding low levels of nonlinearity, robustness and evolvability correlate negatively and almost perfectly. By contrast, genotypes embedding nonlinear dynamics allow expression levels to be robust to small perturbations, while generating high diversity (evolvability under larger perturbations. Thus, nonlinearity breaks the robustness-evolvability trade-off in gene expression levels by allowing disparate responses to different mutations. Using analytical derivations of robustness and system sensitivity, we show that these findings extend to a large class of gene regulatory network architectures and also hold for experimentally observed parameter regimes. Further, the effect of nonlinearity on the robustness-evolvability trade-off is ensured as long as key parameters of the system display specific relations irrespective of their absolute values. We find that within this parameter regime genotypes display low and noisy expression levels. Examining the phenotypic effects of mutations, we find an inverse correlation between robustness and evolvability that breaks only with nonlinearity in the network dynamics. Our results provide a possible solution to the robustness-evolvability trade-off, suggest

Robust solid polymer electrolyte for conducting IPN actuators

Science.gov (United States)

Festin, Nicolas; Maziz, Ali; Plesse, Cédric; Teyssié, Dominique; Chevrot, Claude; Vidal, Frédéric

2013-10-01

Interpenetrating polymer networks (IPNs) based on nitrile butadiene rubber (NBR) as first component and poly(ethylene oxide) (PEO) as second component were synthesized and used as a solid polymer electrolyte film in the design of a mechanically robust conducting IPN actuator. IPN mechanical properties and morphologies were mainly investigated by dynamic mechanical analysis and transmission electron microscopy. For 1-ethyl-3-methylimidazolium bis-(trifluoromethylsulfonyl)-imide (EMITFSI) swollen IPNs, conductivity values are close to 1 × 10-3 S cm-1 at 25 ° C. Conducting IPN actuators have been synthesized by chemical polymerization of 3,4-ethylenedioxythiophene (EDOT) within the PEO/NBR IPN. A pseudo-trilayer configuration has been obtained with PEO/NBR IPN sandwiched between two interpenetrated PEDOT electrodes. The robust conducting IPN actuators showed a free strain of 2.4% and a blocking force of 30 mN for a low applied potential of ±2 V.

Robust segmentation of medical images using competitive hop field neural network as a clustering tool

International Nuclear Information System (INIS)

Golparvar Roozbahani, R.; Ghassemian, M. H.; Sharafat, A. R.

2001-01-01

This paper presents the application of competitive Hop field neural network for medical images segmentation. Our proposed approach consists of Two steps: 1) translating segmentation of the given medical image into an optimization problem, and 2) solving this problem by a version of Hop field network known as competitive Hop field neural network. Segmentation is considered as a clustering problem and its validity criterion is based on both intra set distance and inter set distance. The algorithm proposed in this paper is based on gray level features only. This leads to near optimal solutions if both intra set distance and inter set distance are considered at the same time. If only one of these distances is considered, the result of segmentation process by competitive Hop field neural network will be far from optimal solution and incorrect even for very simple cases. Furthermore, sometimes the algorithm receives at unacceptable states. Both these problems may be solved by contributing both in tera distance and inter distances in the segmentation (optimization) process. The performance of the proposed algorithm is tested on both phantom and real medical images. The promising results and the robustness of algorithm to system noises show near optimal solutions

microRNA as a potential vector for the propagation of robustness in protein expression and oscillatory dynamics within a ceRNA network.

Directory of Open Access Journals (Sweden)

Claude Gérard

Full Text Available microRNAs (miRNAs are small noncoding RNAs that are important post-transcriptional regulators of gene expression. miRNAs can induce thresholds in protein synthesis. Such thresholds in protein output can be also achieved by oligomerization of transcription factors (TF for the control of gene expression. First, we propose a minimal model for protein expression regulated by miRNA and by oligomerization of TF. We show that miRNA and oligomerization of TF generate a buffer, which increases the robustness of protein output towards molecular noise as well as towards random variation of kinetics parameters. Next, we extend the model by considering that the same miRNA can bind to multiple messenger RNAs, which accounts for the dynamics of a minimal competing endogenous RNAs (ceRNAs network. The model shows that, through common miRNA regulation, TF can control the expression of all proteins formed by the ceRNA network, even if it drives the expression of only one gene in the network. The model further suggests that the threshold in protein synthesis mediated by the oligomerization of TF can be propagated to the other genes, which can increase the robustness of the expression of all genes in such ceRNA network. Furthermore, we show that a miRNA could increase the time delay of a "Goodwin-like" oscillator model, which may favor the occurrence of oscillations of large amplitude. This result predicts important roles of miRNAs in the control of the molecular mechanisms leading to the emergence of biological rhythms. Moreover, a model for the latter oscillator embedded in a ceRNA network indicates that the oscillatory behavior can be propagated, via the shared miRNA, to all proteins formed by such ceRNA network. Thus, by means of computational models, we show that miRNAs could act as vectors allowing the propagation of robustness in protein synthesis as well as oscillatory behaviors within ceRNA networks.

Performance and Complexity of Tunable Sparse Network Coding with Gradual Growing Tuning Functions over Wireless Networks

DEFF Research Database (Denmark)

Garrido, Pablo; Sørensen, Chres Wiant; Roetter, Daniel Enrique Lucani

2016-01-01

Random Linear Network Coding (RLNC) has been shown to be a technique with several benefits, in particular when applied over wireless mesh networks, since it provides robustness against packet losses. On the other hand, Tunable Sparse Network Coding (TSNC) is a promising concept, which leverages...... a trade-off between computational complexity and goodput. An optimal density tuning function has not been found yet, due to the lack of a closed-form expression that links density, performance and computational cost. In addition, it would be difficult to implement, due to the feedback delay. In this work...

The impact of gene expression variation on the robustness and evolvability of a developmental gene regulatory network.

Directory of Open Access Journals (Sweden)

David A Garfield

2013-10-01

Full Text Available Regulatory interactions buffer development against genetic and environmental perturbations, but adaptation requires phenotypes to change. We investigated the relationship between robustness and evolvability within the gene regulatory network underlying development of the larval skeleton in the sea urchin Strongylocentrotus purpuratus. We find extensive variation in gene expression in this network throughout development in a natural population, some of which has a heritable genetic basis. Switch-like regulatory interactions predominate during early development, buffer expression variation, and may promote the accumulation of cryptic genetic variation affecting early stages. Regulatory interactions during later development are typically more sensitive (linear, allowing variation in expression to affect downstream target genes. Variation in skeletal morphology is associated primarily with expression variation of a few, primarily structural, genes at terminal positions within the network. These results indicate that the position and properties of gene interactions within a network can have important evolutionary consequences independent of their immediate regulatory role.

Robust pattern decoding in shape-coded structured light

Science.gov (United States)

Tang, Suming; Zhang, Xu; Song, Zhan; Song, Lifang; Zeng, Hai

2017-09-01

Decoding is a challenging and complex problem in a coded structured light system. In this paper, a robust pattern decoding method is proposed for the shape-coded structured light in which the pattern is designed as grid shape with embedded geometrical shapes. In our decoding method, advancements are made at three steps. First, a multi-template feature detection algorithm is introduced to detect the feature point which is the intersection of each two orthogonal grid-lines. Second, pattern element identification is modelled as a supervised classification problem and the deep neural network technique is applied for the accurate classification of pattern elements. Before that, a training dataset is established, which contains a mass of pattern elements with various blurring and distortions. Third, an error correction mechanism based on epipolar constraint, coplanarity constraint and topological constraint is presented to reduce the false matches. In the experiments, several complex objects including human hand are chosen to test the accuracy and robustness of the proposed method. The experimental results show that our decoding method not only has high decoding accuracy, but also owns strong robustness to surface color and complex textures.

Dynamic assembly of ultrasoft colloidal networks enables cell invasion within restrictive fibrillar polymers

Science.gov (United States)

Douglas, Alison M.; Fragkopoulos, Alexandros A.; Gaines, Michelle K.; Lyon, L. Andrew; Fernandez-Nieves, Alberto; Barker, Thomas H.

2017-01-01

In regenerative medicine, natural protein-based polymers offer enhanced endogenous bioactivity and potential for seamless integration with tissue, yet form weak hydrogels that lack the physical robustness required for surgical manipulation, making them difficult to apply in practice. The use of higher concentrations of protein, exogenous cross-linkers, and blending synthetic polymers has all been applied to form more mechanically robust networks. Each relies on generating a smaller network mesh size, which increases the elastic modulus and robustness, but critically inhibits cell spreading and migration, hampering tissue regeneration. Here we report two unique observations; first, that colloidal suspensions, at sufficiently high volume fraction (ϕ), dynamically assemble into a fully percolated 3D network within high-concentration protein polymers. Second, cells appear capable of leveraging these unique domains for highly efficient cell migration throughout the composite construct. In contrast to porogens, the particles in our system remain embedded within the bulk polymer, creating a network of particle-filled tunnels. Whereas this would normally physically restrict cell motility, when the particulate network is created using ultralow cross-linked microgels, the colloidal suspension displays viscous behavior on the same timescale as cell spreading and migration and thus enables efficient cell infiltration of the construct through the colloidal-filled tunnels.

Robust solid polymer electrolyte for conducting IPN actuators

International Nuclear Information System (INIS)

Festin, Nicolas; Maziz, Ali; Plesse, Cédric; Teyssié, Dominique; Chevrot, Claude; Vidal, Frédéric

2013-01-01

Interpenetrating polymer networks (IPNs) based on nitrile butadiene rubber (NBR) as first component and poly(ethylene oxide) (PEO) as second component were synthesized and used as a solid polymer electrolyte film in the design of a mechanically robust conducting IPN actuator. IPN mechanical properties and morphologies were mainly investigated by dynamic mechanical analysis and transmission electron microscopy. For 1-ethyl-3-methylimidazolium bis-(trifluoromethylsulfonyl)-imide (EMITFSI) swollen IPNs, conductivity values are close to 1 × 10 −3 S cm −1 at 25 ° C. Conducting IPN actuators have been synthesized by chemical polymerization of 3,4-ethylenedioxythiophene (EDOT) within the PEO/NBR IPN. A pseudo-trilayer configuration has been obtained with PEO/NBR IPN sandwiched between two interpenetrated PEDOT electrodes. The robust conducting IPN actuators showed a free strain of 2.4% and a blocking force of 30 mN for a low applied potential of ±2 V. (paper)

Leak Signature Space: An Original Representation for Robust Leak Location in Water Distribution Networks

Directory of Open Access Journals (Sweden)

Myrna V. Casillas

2015-03-01

Full Text Available In this paper, an original model-based scheme for leak location using pressure sensors in water distribution networks is introduced. The proposed approach is based on a new representation called the Leak Signature Space (LSS that associates a specific signature to each leak location being minimally affected by leak magnitude. The LSS considers a linear model approximation of the relation between pressure residuals and leaks that is projected onto a selected hyperplane. This new approach allows to infer the location of a given leak by comparing the position of its signature with other leak signatures. Moreover, two ways of improving the method’s robustness are proposed. First, by associating a domain of influence to each signature and second, through a time horizon analysis. The efficiency of the method is highlighted by means of a real network using several scenarios involving different number of sensors and considering the presence of noise in the measurements.

A reverse engineering algorithm for neural networks, applied to the subthalamopallidal network of basal ganglia.

Science.gov (United States)

Floares, Alexandru George

2008-01-01

Modeling neural networks with ordinary differential equations systems is a sensible approach, but also very difficult. This paper describes a new algorithm based on linear genetic programming which can be used to reverse engineer neural networks. The RODES algorithm automatically discovers the structure of the network, including neural connections, their signs and strengths, estimates its parameters, and can even be used to identify the biophysical mechanisms involved. The algorithm is tested on simulated time series data, generated using a realistic model of the subthalamopallidal network of basal ganglia. The resulting ODE system is highly accurate, and results are obtained in a matter of minutes. This is because the problem of reverse engineering a system of coupled differential equations is reduced to one of reverse engineering individual algebraic equations. The algorithm allows the incorporation of common domain knowledge to restrict the solution space. To our knowledge, this is the first time a realistic reverse engineering algorithm based on linear genetic programming has been applied to neural networks.

A robust and coherent network statistic for detecting gravitational waves from inspiralling compact binaries in non-Gaussian noise

CERN Document Server

Bose, S

2002-01-01

The robust statistic proposed by Creighton (Creighton J D E 1999 Phys. Rev. D 60 021101) and Allen et al (Allen et al 2001 Preprint gr-gc/010500) for the detection of stationary non-Gaussian noise is briefly reviewed. We compute the robust statistic for generic weak gravitational-wave signals in the mixture-Gaussian noise model to an accuracy higher than in those analyses, and reinterpret its role. Specifically, we obtain the coherent statistic for detecting gravitational-wave signals from inspiralling compact binaries with an arbitrary network of earth-based interferometers. Finally, we show that excess computational costs incurred owing to non-Gaussianity is negligible compared to the cost of detection in Gaussian noise.

The application of network teaching in applied optics teaching

Science.gov (United States)

Zhao, Huifu; Piao, Mingxu; Li, Lin; Liu, Dongmei

2017-08-01

Network technology has become a creative tool of changing human productivity, the rapid development of it has brought profound changes to our learning, working and life. Network technology has many advantages such as rich contents, various forms, convenient retrieval, timely communication and efficient combination of resources. Network information resources have become the new education resources, get more and more application in the education, has now become the teaching and learning tools. Network teaching enriches the teaching contents, changes teaching process from the traditional knowledge explanation into the new teaching process by establishing situation, independence and cooperation in the network technology platform. The teacher's role has shifted from teaching in classroom to how to guide students to learn better. Network environment only provides a good platform for the teaching, we can get a better teaching effect only by constantly improve the teaching content. Changchun university of science and technology introduced a BB teaching platform, on the platform, the whole optical classroom teaching and the classroom teaching can be improved. Teachers make assignments online, students learn independently offline or the group learned cooperatively, this expands the time and space of teaching. Teachers use hypertext form related knowledge of applied optics, rich cases and learning resources, set up the network interactive platform, homework submission system, message board, etc. The teaching platform simulated the learning interest of students and strengthens the interaction in the teaching.

Analysis of the robustness of network-based disease-gene prioritization methods reveals redundancy in the human interactome and functional diversity of disease-genes.

Directory of Open Access Journals (Sweden)

Emre Guney

Full Text Available Complex biological systems usually pose a trade-off between robustness and fragility where a small number of perturbations can substantially disrupt the system. Although biological systems are robust against changes in many external and internal conditions, even a single mutation can perturb the system substantially, giving rise to a pathophenotype. Recent advances in identifying and analyzing the sequential variations beneath human disorders help to comprehend a systemic view of the mechanisms underlying various disease phenotypes. Network-based disease-gene prioritization methods rank the relevance of genes in a disease under the hypothesis that genes whose proteins interact with each other tend to exhibit similar phenotypes. In this study, we have tested the robustness of several network-based disease-gene prioritization methods with respect to the perturbations of the system using various disease phenotypes from the Online Mendelian Inheritance in Man database. These perturbations have been introduced either in the protein-protein interaction network or in the set of known disease-gene associations. As the network-based disease-gene prioritization methods are based on the connectivity between known disease-gene associations, we have further used these methods to categorize the pathophenotypes with respect to the recoverability of hidden disease-genes. Our results have suggested that, in general, disease-genes are connected through multiple paths in the human interactome. Moreover, even when these paths are disturbed, network-based prioritization can reveal hidden disease-gene associations in some pathophenotypes such as breast cancer, cardiomyopathy, diabetes, leukemia, parkinson disease and obesity to a greater extend compared to the rest of the pathophenotypes tested in this study. Gene Ontology (GO analysis highlighted the role of functional diversity for such diseases.

Abnormal cascading failure spreading on complex networks

International Nuclear Information System (INIS)

Wang, Jianwei; Sun, Enhui; Xu, Bo; Li, Peng; Ni, Chengzhang

2016-01-01

Applying the mechanism of the preferential selection of the flow destination, we develop a new method to quantify the initial load on an edge, of which the flow is transported along the path with the shortest edge weight between two nodes. Considering the node weight, we propose a cascading model on the edge and investigate cascading dynamics induced by the removal of the edge with the largest load. We perform simulated attacks on four types of constructed networks and two actual networks and observe an interesting and counterintuitive phenomenon of the cascading spreading, i.e., gradually improving the capacity of nodes does not lead to the monotonous increase in the robustness of these networks against cascading failures. The non monotonous behavior of cascading dynamics is well explained by the analysis on a simple graph. We additionally study the effect of the parameter of the node weight on cascading dynamics and evaluate the network robustness by a new metric.

Info-Gap robustness pathway method for transitioning of urban drainage systems under deep uncertainties.

Science.gov (United States)

Zischg, Jonatan; Goncalves, Mariana L R; Bacchin, Taneha Kuzniecow; Leonhardt, Günther; Viklander, Maria; van Timmeren, Arjan; Rauch, Wolfgang; Sitzenfrei, Robert

2017-09-01

In the urban water cycle, there are different ways of handling stormwater runoff. Traditional systems mainly rely on underground piped, sometimes named 'gray' infrastructure. New and so-called 'green/blue' ambitions aim for treating and conveying the runoff at the surface. Such concepts are mainly based on ground infiltration and temporal storage. In this work a methodology to create and compare different planning alternatives for stormwater handling on their pathways to a desired system state is presented. Investigations are made to assess the system performance and robustness when facing the deeply uncertain spatial and temporal developments in the future urban fabric, including impacts caused by climate change, urbanization and other disruptive events, like shifts in the network layout and interactions of 'gray' and 'green/blue' structures. With the Info-Gap robustness pathway method, three planning alternatives are evaluated to identify critical performance levels at different stages over time. This novel methodology is applied to a real case study problem where a city relocation process takes place during the upcoming decades. In this case study it is shown that hybrid systems including green infrastructures are more robust with respect to future uncertainties, compared to traditional network design.

An Improved Generalized Predictive Control in a Robust Dynamic Partial Least Square Framework

Directory of Open Access Journals (Sweden)

Jin Xin

2015-01-01

Full Text Available To tackle the sensitivity to outliers in system identification, a new robust dynamic partial least squares (PLS model based on an outliers detection method is proposed in this paper. An improved radial basis function network (RBFN is adopted to construct the predictive model from inputs and outputs dataset, and a hidden Markov model (HMM is applied to detect the outliers. After outliers are removed away, a more robust dynamic PLS model is obtained. In addition, an improved generalized predictive control (GPC with the tuning weights under dynamic PLS framework is proposed to deal with the interaction which is caused by the model mismatch. The results of two simulations demonstrate the effectiveness of proposed method.

Robustly Fitting and Forecasting Dynamical Data With Electromagnetically Coupled Artificial Neural Network: A Data Compression Method.

Science.gov (United States)

Wang, Ziyin; Liu, Mandan; Cheng, Yicheng; Wang, Rubin

2017-06-01

In this paper, a dynamical recurrent artificial neural network (ANN) is proposed and studied. Inspired from a recent research in neuroscience, we introduced nonsynaptic coupling to form a dynamical component of the network. We mathematically proved that, with adequate neurons provided, this dynamical ANN model is capable of approximating any continuous dynamic system with an arbitrarily small error in a limited time interval. Its extreme concise Jacobian matrix makes the local stability easy to control. We designed this ANN for fitting and forecasting dynamic data and obtained satisfied results in simulation. The fitting performance is also compared with those of both the classic dynamic ANN and the state-of-the-art models. Sufficient trials and the statistical results indicated that our model is superior to those have been compared. Moreover, we proposed a robust approximation problem, which asking the ANN to approximate a cluster of input-output data pairs in large ranges and to forecast the output of the system under previously unseen input. Our model and learning scheme proposed in this paper have successfully solved this problem, and through this, the approximation becomes much more robust and adaptive to noise, perturbation, and low-order harmonic wave. This approach is actually an efficient method for compressing massive external data of a dynamic system into the weight of the ANN.

Earthquake Complex Network applied along the Chilean Subduction Zone.

Science.gov (United States)

Martin, F.; Pasten, D.; Comte, D.

2017-12-01

In recent years the earthquake complex networks have been used as a useful tool to describe and characterize the behavior of seismicity. The earthquake complex network is built in space, dividing the three dimensional space in cubic cells. If the cubic cell contains a hypocenter, we call this cell like a node. The connections between nodes follows the time sequence of the occurrence of the seismic events. In this sense, we have a spatio-temporal configuration of a specific region using the seismicity in that zone. In this work, we are applying complex networks to characterize the subduction zone along the coast of Chile using two networks: a directed and an undirected network. The directed network takes in consideration the time-direction of the connections, that is very important for the connectivity of the network: we are considering the connectivity, ki of the i-th node, like the number of connections going out from the node i and we add the self-connections (if two seismic events occurred successive in time in the same cubic cell, we have a self-connection). The undirected network is the result of remove the direction of the connections and the self-connections from the directed network. These two networks were building using seismic data events recorded by CSN (Chilean Seismological Center) in Chile. This analysis includes the last largest earthquakes occurred in Iquique (April 2014) and in Illapel (September 2015). The result for the directed network shows a change in the value of the critical exponent along the Chilean coast. The result for the undirected network shows a small-world behavior without important changes in the topology of the network. Therefore, the complex network analysis shows a new form to characterize the Chilean subduction zone with a simple method that could be compared with another methods to obtain more details about the behavior of the seismicity in this region.

Fabrication of Robust Superhydrophobic Bamboo Based on ZnO Nanosheet Networks with Improved Water-, UV-, and Fire-Resistant Properties

Directory of Open Access Journals (Sweden)

Jingpeng Li

2015-01-01

Full Text Available Bamboo with water-resistant, UV-resistant, and fire-resistant properties was desirable in modern society. In this paper, the original bamboo was firstly treated with ZnO sol and then hydrothermally the ZnO nanosheet networks grow onto the bamboo surface and subsequently modified with fluoroalkyl silane (FAS-17. The FAS-17 treated bamboo substrate exhibited not only robust superhydrophobicity with a high contact angle of 161° but also stable repellency towards simulated acid rain (pH = 3 with a contact angle of 152°. Except for its robust superhydrophobicity, such a bamboo also presents superior water-resistant, UV-resistant, and fire-resistant properties.

Interlinked bistable mechanisms generate robust mitotic transitions.

Science.gov (United States)

Hutter, Lukas H; Rata, Scott; Hochegger, Helfrid; Novák, Béla

2017-10-18

The transitions between phases of the cell cycle have evolved to be robust and switch-like, which ensures temporal separation of DNA replication, sister chromatid separation, and cell division. Mathematical models describing the biochemical interaction networks of cell cycle regulators attribute these properties to underlying bistable switches, which inherently generate robust, switch-like, and irreversible transitions between states. We have recently presented new mathematical models for two control systems that regulate crucial transitions in the cell cycle: mitotic entry and exit, 1 and the mitotic checkpoint. 2 Each of the two control systems is characterized by two interlinked bistable switches. In the case of mitotic checkpoint control, these switches are mutually activating, whereas in the case of the mitotic entry/exit network, the switches are mutually inhibiting. In this Perspective we describe the qualitative features of these regulatory motifs and show that having two interlinked bistable mechanisms further enhances robustness and irreversibility. We speculate that these network motifs also underlie other cell cycle transitions and cellular transitions between distinct biochemical states.

Efficient estimation of the robustness region of biological models with oscillatory behavior.

Directory of Open Access Journals (Sweden)

Mochamad Apri

Full Text Available Robustness is an essential feature of biological systems, and any mathematical model that describes such a system should reflect this feature. Especially, persistence of oscillatory behavior is an important issue. A benchmark model for this phenomenon is the Laub-Loomis model, a nonlinear model for cAMP oscillations in Dictyostelium discoideum. This model captures the most important features of biomolecular networks oscillating at constant frequencies. Nevertheless, the robustness of its oscillatory behavior is not yet fully understood. Given a system that exhibits oscillating behavior for some set of parameters, the central question of robustness is how far the parameters may be changed, such that the qualitative behavior does not change. The determination of such a "robustness region" in parameter space is an intricate task. If the number of parameters is high, it may be also time consuming. In the literature, several methods are proposed that partially tackle this problem. For example, some methods only detect particular bifurcations, or only find a relatively small box-shaped estimate for an irregularly shaped robustness region. Here, we present an approach that is much more general, and is especially designed to be efficient for systems with a large number of parameters. As an illustration, we apply the method first to a well understood low-dimensional system, the Rosenzweig-MacArthur model. This is a predator-prey model featuring satiation of the predator. It has only two parameters and its bifurcation diagram is available in the literature. We find a good agreement with the existing knowledge about this model. When we apply the new method to the high dimensional Laub-Loomis model, we obtain a much larger robustness region than reported earlier in the literature. This clearly demonstrates the power of our method. From the results, we conclude that the biological system underlying is much more robust than was realized until now.

A SIMULATION OF THE PENICILLIN G PRODUCTION BIOPROCESS APPLYING NEURAL NETWORKS

Directory of Open Access Journals (Sweden)

A.J.G. da Cruz

1997-12-01

Full Text Available The production of penicillin G by Penicillium chrysogenum IFO 8644 was simulated employing a feedforward neural network with three layers. The neural network training procedure used an algorithm combining two procedures: random search and backpropagation. The results of this approach were very promising, and it was observed that the neural network was able to accurately describe the nonlinear behavior of the process. Besides, the results showed that this technique can be successfully applied to control process algorithms due to its long processing time and its flexibility in the incorporation of new data

Robust Control Methods for On-Line Statistical Learning

Directory of Open Access Journals (Sweden)

Capobianco Enrico

2001-01-01

Full Text Available The issue of controlling that data processing in an experiment results not affected by the presence of outliers is relevant for statistical control and learning studies. Learning schemes should thus be tested for their capacity of handling outliers in the observed training set so to achieve reliable estimates with respect to the crucial bias and variance aspects. We describe possible ways of endowing neural networks with statistically robust properties by defining feasible error criteria. It is convenient to cast neural nets in state space representations and apply both Kalman filter and stochastic approximation procedures in order to suggest statistically robustified solutions for on-line learning.

Spatio-temporal networks: reachability, centrality and robustness.

Science.gov (United States)

Williams, Matthew J; Musolesi, Mirco

2016-06-01

Recent advances in spatial and temporal networks have enabled researchers to more-accurately describe many real-world systems such as urban transport networks. In this paper, we study the response of real-world spatio-temporal networks to random error and systematic attack, taking a unified view of their spatial and temporal performance. We propose a model of spatio-temporal paths in time-varying spatially embedded networks which captures the property that, as in many real-world systems, interaction between nodes is non-instantaneous and governed by the space in which they are embedded. Through numerical experiments on three real-world urban transport systems, we study the effect of node failure on a network's topological, temporal and spatial structure. We also demonstrate the broader applicability of this framework to three other classes of network. To identify weaknesses specific to the behaviour of a spatio-temporal system, we introduce centrality measures that evaluate the importance of a node as a structural bridge and its role in supporting spatio-temporally efficient flows through the network. This exposes the complex nature of fragility in a spatio-temporal system, showing that there is a variety of failure modes when a network is subject to systematic attacks.

Fault Tolerant Neural Network for ECG Signal Classification Systems

Directory of Open Access Journals (Sweden)

MERAH, M.

2011-08-01

Full Text Available The aim of this paper is to apply a new robust hardware Artificial Neural Network (ANN for ECG classification systems. This ANN includes a penalization criterion which makes the performances in terms of robustness. Specifically, in this method, the ANN weights are normalized using the auto-prune method. Simulations performed on the MIT ? BIH ECG signals, have shown that significant robustness improvements are obtained regarding potential hardware artificial neuron failures. Moreover, we show that the proposed design achieves better generalization performances, compared to the standard back-propagation algorithm.

Robust optimisation of forest transportation networks: a case study ...

African Journals Online (AJOL)

Forest transportation costs are the major cost component for many forest product supply chains. In order to minimise these costs, many organisations have turned ... The simulation results are then evaluated for robustness by means of seven robustness performance measures. For our case study, the results show that (1) the ...

Robustness indicators and capacity models for railway networks

DEFF Research Database (Denmark)

Jensen, Lars Wittrup

In a world continuous striving for higher mobility and the use of more sustainable modes of transport, there is a constant pressure on utilising railway capacity better and, at the same time, obtaining a high robustness against delays. During the planning of railway operations and infrastructure ....... This has motivated the research conducted and described in this thesis, where the objective has been to develop and improve existing methods to achieve timetable and infrastructure plans with robust capacity utilisation aimed at the strategic and early tactical planning phases....

A robust sound perception model suitable for neuromorphic implementation.

Science.gov (United States)

Coath, Martin; Sheik, Sadique; Chicca, Elisabetta; Indiveri, Giacomo; Denham, Susan L; Wennekers, Thomas

2013-01-01

We have recently demonstrated the emergence of dynamic feature sensitivity through exposure to formative stimuli in a real-time neuromorphic system implementing a hybrid analog/digital network of spiking neurons. This network, inspired by models of auditory processing in mammals, includes several mutually connected layers with distance-dependent transmission delays and learning in the form of spike timing dependent plasticity, which effects stimulus-driven changes in the network connectivity. Here we present results that demonstrate that the network is robust to a range of variations in the stimulus pattern, such as are found in naturalistic stimuli and neural responses. This robustness is a property critical to the development of realistic, electronic neuromorphic systems. We analyze the variability of the response of the network to "noisy" stimuli which allows us to characterize the acuity in information-theoretic terms. This provides an objective basis for the quantitative comparison of networks, their connectivity patterns, and learning strategies, which can inform future design decisions. We also show, using stimuli derived from speech samples, that the principles are robust to other challenges, such as variable presentation rate, that would have to be met by systems deployed in the real world. Finally we demonstrate the potential applicability of the approach to real sounds.

A Robust Sound Perception Model Suitable for Neuromorphic Implementation

Directory of Open Access Journals (Sweden)

Martin eCoath

2014-01-01

Full Text Available We have recently demonstrated the emergence of dynamic feature sensitivity through exposure to formative stimuli in a real-time neuromorphic system implementing a hybrid analogue/digital network of spiking neurons. This network, inspired by models of auditory processing in mammals, includes several mutually connected layers with distance-dependent transmission delays and learning in the form of spike timing dependent plasticity, which effects stimulus-driven changes in the network connectivity.Here we present results that demonstrate that the network is robust to a range of variations in the stimulus pattern, such as are found in naturalistic stimuli and neural responses. This robustness is a property critical to the development of realistic, electronic neuromorphic systems.We analyse the variability of the response of the network to `noisy' stimuli which allows us to characterize the acuity in information-theoretic terms. This provides an objective basis for the quantitative comparison of networks, their connectivity patterns, and learning strategies, which can inform future design decisions. We also show, using stimuli derived from speech samples, that the principles are robust to other challenges, such as variable presentation rate, that would have to be met by systems deployed in the real world. Finally we demonstrate the potential applicability of the approach to real sounds.

Forecasting exchange rates: a robust regression approach

OpenAIRE

Preminger, Arie; Franck, Raphael

2005-01-01

The least squares estimation method as well as other ordinary estimation method for regression models can be severely affected by a small number of outliers, thus providing poor out-of-sample forecasts. This paper suggests a robust regression approach, based on the S-estimation method, to construct forecasting models that are less sensitive to data contamination by outliers. A robust linear autoregressive (RAR) and a robust neural network (RNN) models are estimated to study the predictabil...

Optimizing Diamond Structured Automobile Supply Chain Network Towards a Robust Business Continuity Management

Directory of Open Access Journals (Sweden)

Abednico Montshiwa

2016-02-01

Full Text Available This paper presents an optimized diamond structured automobile supply chain network towards a robust Business Continuity Management model. The model is necessitated by the nature of the automobile supply chain. Companies in tier two are centralized and numerically limited and have to supply multiple tier one companies with goods and services. The challenge with this supply chain structure is the inherent risks in the supply chain. Once supply chain disruption takes place at tier 2 level, the whole supply chain network suffers huge loses. To address this challenge, the paper replaces Risk Analysis with Risk Ranking and it introduces Supply Chain Cooperation (SCC to the traditional Business Continuity Plan (BCP concept. The paper employed three statistical analysis techniques (correlation analysis, regression analysis and Smart PLS 3.0 calculations. In this study, correlation and regression analysis results on risk rankings, SCC and Business Impact Analysis were significant, ascertaining the value of the model. The multivariate data analysis calculations demonstrated that SCC has a positive total significant effect on risk rankings and BCM while BIA has strongest positive effects on all BCP factors. Finally, sensitivity analysis demonstrated that company size plays a role in BCM.

Robust Airborne Networking Extensions (RANGE)

National Research Council Canada - National Science Library

Henderson, Thomas R

2008-01-01

.... The secondary objective is to investigate the application of these protocols to hybrid Navy/USMC/Joint/Coalition networks, including the integration of shore and ground-based (littoral) components...

Robust environmental closed-loop supply chain design under uncertainty

International Nuclear Information System (INIS)

MA, Ruimin; YAO, Lifei; JIN, Maozhu; REN, Peiyu; LV, Zhihan

2016-01-01

With the fast developments in product remanufacturing to improve economic and environmental performance, an environmental closed-loop supply (ECLSC) chain is important for enterprises' competitiveness. In this paper, a robust ECLSC network is investigated which includes multiple plants, collection centers, demand zones, and products, and consists of both forward and reverse supply chains. First, a robust multi-objective mixed integer nonlinear programming model is proposed to deal with ECLSC considering two conflicting objectives simultaneously, as well as the uncertain nature of the supply chain. Cost parameters of the supply chain and demand fluctuations are subject to uncertainty. The first objective function aims to minimize the economical cost and the second objective function is to minimize the environmental influence. Then, the proposed model is solved as a single-objective mixed integer programming model applying the LP-metrics method. Finally, numerical example has been presented to test the model. The results indicate that the proposed model is applicable in practice.

Investigating risk and robustness measures for supply chain network design under demand uncertainty

DEFF Research Database (Denmark)

Govindan, Kannan; Fattahi, Mohammad

2017-01-01

to obtain risk-averse and robust solutions, respectively. Computational results are presented on a real-life case study to illustrate the applicability of the proposed approaches. To compare these different decision-making situations, a simulation approach is used. Furthermore, by several test problems......-variable demands. To deal with the stochastic demands, a Latin Hypercube Sampling method is applied to generate a fan of scenarios and then, a backward scenario reduction technique reduces the number of scenarios. Weighted mean-risk objectives by using different risk measures and minimax objective are examined...

Deep Learning with Convolutional Neural Networks Applied to Electromyography Data: A Resource for the Classification of Movements for Prosthetic Hands.

Science.gov (United States)

Atzori, Manfredo; Cognolato, Matteo; Müller, Henning

2016-01-01

Natural control methods based on surface electromyography (sEMG) and pattern recognition are promising for hand prosthetics. However, the control robustness offered by scientific research is still not sufficient for many real life applications, and commercial prostheses are capable of offering natural control for only a few movements. In recent years deep learning revolutionized several fields of machine learning, including computer vision and speech recognition. Our objective is to test its methods for natural control of robotic hands via sEMG using a large number of intact subjects and amputees. We tested convolutional networks for the classification of an average of 50 hand movements in 67 intact subjects and 11 transradial amputees. The simple architecture of the neural network allowed to make several tests in order to evaluate the effect of pre-processing, layer architecture, data augmentation and optimization. The classification results are compared with a set of classical classification methods applied on the same datasets. The classification accuracy obtained with convolutional neural networks using the proposed architecture is higher than the average results obtained with the classical classification methods, but lower than the results obtained with the best reference methods in our tests. The results show that convolutional neural networks with a very simple architecture can produce accurate results comparable to the average classical classification methods. They show that several factors (including pre-processing, the architecture of the net and the optimization parameters) can be fundamental for the analysis of sEMG data. Larger networks can achieve higher accuracy on computer vision and object recognition tasks. This fact suggests that it may be interesting to evaluate if larger networks can increase sEMG classification accuracy too.

Deep Learning with Convolutional Neural Networks Applied to Electromyography Data: A Resource for the Classification of Movements for Prosthetic Hands

Science.gov (United States)

Atzori, Manfredo; Cognolato, Matteo; Müller, Henning

2016-01-01

Natural control methods based on surface electromyography (sEMG) and pattern recognition are promising for hand prosthetics. However, the control robustness offered by scientific research is still not sufficient for many real life applications, and commercial prostheses are capable of offering natural control for only a few movements. In recent years deep learning revolutionized several fields of machine learning, including computer vision and speech recognition. Our objective is to test its methods for natural control of robotic hands via sEMG using a large number of intact subjects and amputees. We tested convolutional networks for the classification of an average of 50 hand movements in 67 intact subjects and 11 transradial amputees. The simple architecture of the neural network allowed to make several tests in order to evaluate the effect of pre-processing, layer architecture, data augmentation and optimization. The classification results are compared with a set of classical classification methods applied on the same datasets. The classification accuracy obtained with convolutional neural networks using the proposed architecture is higher than the average results obtained with the classical classification methods, but lower than the results obtained with the best reference methods in our tests. The results show that convolutional neural networks with a very simple architecture can produce accurate results comparable to the average classical classification methods. They show that several factors (including pre-processing, the architecture of the net and the optimization parameters) can be fundamental for the analysis of sEMG data. Larger networks can achieve higher accuracy on computer vision and object recognition tasks. This fact suggests that it may be interesting to evaluate if larger networks can increase sEMG classification accuracy too. PMID:27656140

Modular design of metabolic network for robust production of n-butanol from galactose-glucose mixtures.

Science.gov (United States)

Lim, Hyun Gyu; Lim, Jae Hyung; Jung, Gyoo Yeol

2015-01-01

Refactoring microorganisms for efficient production of advanced biofuel such as n-butanol from a mixture of sugars in the cheap feedstock is a prerequisite to achieve economic feasibility in biorefinery. However, production of biofuel from inedible and cheap feedstock is highly challenging due to the slower utilization of biomass-driven sugars, arising from complex assimilation pathway, difficulties in amplification of biosynthetic pathways for heterologous metabolite, and redox imbalance caused by consuming intracellular reducing power to produce quite reduced biofuel. Even with these problems, the microorganisms should show robust production of biofuel to obtain industrial feasibility. Thus, refactoring microorganisms for efficient conversion is highly desirable in biofuel production. In this study, we engineered robust Escherichia coli to accomplish high production of n-butanol from galactose-glucose mixtures via the design of modular pathway, an efficient and systematic way, to reconstruct the entire metabolic pathway with many target genes. Three modular pathways designed using the predictable genetic elements were assembled for efficient galactose utilization, n-butanol production, and redox re-balancing to robustly produce n-butanol from a sugar mixture of galactose and glucose. Specifically, the engineered strain showed dramatically increased n-butanol production (3.3-fold increased to 6.2 g/L after 48-h fermentation) compared to the parental strain (1.9 g/L) in galactose-supplemented medium. Moreover, fermentation with mixtures of galactose and glucose at various ratios from 2:1 to 1:2 confirmed that our engineered strain was able to robustly produce n-butanol regardless of sugar composition with simultaneous utilization of galactose and glucose. Collectively, modular pathway engineering of metabolic network can be an effective approach in strain development for optimal biofuel production with cost-effective fermentable sugars. To the best of our

Influence of different initial distributions on robust cooperation in scale-free networks: A comparative study

International Nuclear Information System (INIS)

Chen Xiaojie; Fu Feng; Wang Long

2008-01-01

We study the evolutionary Prisoner's dilemma game on scale-free networks, focusing on the influence of different initial distributions for cooperators and defectors on the evolution of cooperation. To address this issue, we consider three types of initial distributions for defectors: uniform distribution at random, occupying the most connected nodes, and occupying the lowest-degree nodes, respectively. It is shown that initial configurations for defectors can crucially influence the cooperation level and the evolution speed of cooperation. Interestingly, the situation where defectors initially occupy the lowest-degree vertices can exhibit the most robust cooperation, compared with two other distributions. That is, the cooperation level is least affected by the initial percentage of defectors. Moreover, in this situation, the whole system evolves fastest to the prevalent cooperation. Besides, we obtain the critical values of initial frequency of defectors above which the extinction of cooperators occurs for the respective initial distributions. Our results might be helpful in explaining the maintenance of high cooperation in scale-free networks

On Consensus of Star-Composed Networks with an Application of Laplacian Spectrum

Directory of Open Access Journals (Sweden)

Da Huang

2017-01-01

Full Text Available In this paper, we mainly study the performance of star-composed networks which can achieve consensus. Specifically, we investigate the convergence speed and robustness of the consensus of the networks, which can be measured by the smallest nonzero eigenvalue λ2 of the Laplacian matrix and the H2 norm of the graph, respectively. In particular, we introduce the notion of the corona of two graphs to construct star-composed networks and apply the Laplacian spectrum to discuss the convergence speed and robustness for the communication network. Finally, the performances of the star-composed networks have been compared, and we find that the network in which the centers construct a balanced complete bipartite graph has the most advantages of performance. Our research would provide a new insight into the combination between the field of consensus study and the theory of graph spectra.

Robust Selection Algorithm (RSA) for Multi-Omic Biomarker Discovery; Integration with Functional Network Analysis to Identify miRNA Regulated Pathways in Multiple Cancers.

Science.gov (United States)

Sehgal, Vasudha; Seviour, Elena G; Moss, Tyler J; Mills, Gordon B; Azencott, Robert; Ram, Prahlad T

2015-01-01

MicroRNAs (miRNAs) play a crucial role in the maintenance of cellular homeostasis by regulating the expression of their target genes. As such, the dysregulation of miRNA expression has been frequently linked to cancer. With rapidly accumulating molecular data linked to patient outcome, the need for identification of robust multi-omic molecular markers is critical in order to provide clinical impact. While previous bioinformatic tools have been developed to identify potential biomarkers in cancer, these methods do not allow for rapid classification of oncogenes versus tumor suppressors taking into account robust differential expression, cutoffs, p-values and non-normality of the data. Here, we propose a methodology, Robust Selection Algorithm (RSA) that addresses these important problems in big data omics analysis. The robustness of the survival analysis is ensured by identification of optimal cutoff values of omics expression, strengthened by p-value computed through intensive random resampling taking into account any non-normality in the data and integration into multi-omic functional networks. Here we have analyzed pan-cancer miRNA patient data to identify functional pathways involved in cancer progression that are associated with selected miRNA identified by RSA. Our approach demonstrates the way in which existing survival analysis techniques can be integrated with a functional network analysis framework to efficiently identify promising biomarkers and novel therapeutic candidates across diseases.

An Experimentation Platform for On-Chip Integration of Analog Neural Networks: A Pathway to Trusted and Robust Analog/RF ICs.

Science.gov (United States)

Maliuk, Dzmitry; Makris, Yiorgos

2015-08-01

We discuss the design of an experimentation platform intended for prototyping low-cost analog neural networks for on-chip integration with analog/RF circuits. The objective of such integration is to support various tasks, such as self-test, self-tuning, and trust/aging monitoring, which require classification of analog measurements obtained from on-chip sensors. Particular emphasis is given to cost-efficient implementation reflected in: 1) low energy and area budgets of circuits dedicated to neural networks; 2) robust learning in presence of analog inaccuracies; and 3) long-term retention of learned functionality. Our chip consists of a reconfigurable array of synapses and neurons operating below threshold and featuring sub-μW power consumption. The synapse circuits employ dual-mode weight storage: 1) a dynamic mode, for fast bidirectional weight updates during training and 2) a nonvolatile mode, for permanent storage of learned functionality. We discuss a robust learning strategy, and we evaluate the system performance on several benchmark problems, such as the XOR2-6 and two-spirals classification tasks.

Artificial neural network applying for justification of tractors undercarriages parameters

Directory of Open Access Journals (Sweden)

V. A. Kuz’Min

2017-01-01

Full Text Available One of the most important properties that determine undercarriage layout on design stage is the soil compaction effect. Existing domestic standards of undercarriages impact to soil do not meet modern agricultural requirements completely. The authors justify the need for analysis of traction and transportation machines travel systems and recommendations for these parameters applied to machines that are on design or modernization stage. The database of crawler agricultural tractors particularly in such parameters as traction class and basic operational weight, engine power rating, average ground pressure, square of track basic branch surface area was modeled. Meanwhile the considered machines were divided into two groups by producing countries: Europe/North America and Russian Federation/CIS. The main graphical dependences for every group of machines are plotted, and the conforming analytical dependences within the ranges with greatest concentration of machines are generated. To make the procedure of obtaining parameters of the soil panning by tractors easier it is expedient to use the program tool - artificial neural network (or perceptron. It is necessary to apply to the solution of this task multilayered perceptron - neutron network of direct distribution of signals (without feedback. To carry out the analysis of parameters of running systems taking into account parameters of the soil panning by them and to recommend the choice of these parameters for newly created machines. The program code of artificial neural network is developed. On the basis of the created base of tractors the artificial neural network was created and tested. Accumulated error was not more than 5 percent. These data indicate the results accuracy and tool reliability. It is possible by operating initial design-data base and using the designed artificial neural network to define missing parameters.

Parameters affecting the resilience of scale-free networks to random failures.

Energy Technology Data Exchange (ETDEWEB)

Link, Hamilton E.; LaViolette, Randall A.; Lane, Terran (University of New Mexico, Albuquerque, NM); Saia, Jared (University of New Mexico, Albuquerque, NM)

2005-09-01

It is commonly believed that scale-free networks are robust to massive numbers of random node deletions. For example, Cohen et al. in (1) study scale-free networks including some which approximate the measured degree distribution of the Internet. Their results suggest that if each node in this network failed independently with probability 0.99, most of the remaining nodes would still be connected in a giant component. In this paper, we show that a large and important subclass of scale-free networks are not robust to massive numbers of random node deletions. In particular, we study scale-free networks which have minimum node degree of 1 and a power-law degree distribution beginning with nodes of degree 1 (power-law networks). We show that, in a power-law network approximating the Internet's reported distribution, when the probability of deletion of each node is 0.5 only about 25% of the surviving nodes in the network remain connected in a giant component, and the giant component does not persist beyond a critical failure rate of 0.9. The new result is partially due to improved analytical accommodation of the large number of degree-0 nodes that result after node deletions. Our results apply to power-law networks with a wide range of power-law exponents, including Internet-like networks. We give both analytical and empirical evidence that such networks are not generally robust to massive random node deletions.

A robust cloud registration method based on redundant data reduction using backpropagation neural network and shift window

Science.gov (United States)

Xin, Meiting; Li, Bing; Yan, Xiao; Chen, Lei; Wei, Xiang

2018-02-01

A robust coarse-to-fine registration method based on the backpropagation (BP) neural network and shift window technology is proposed in this study. Specifically, there are three steps: coarse alignment between the model data and measured data, data simplification based on the BP neural network and point reservation in the contour region of point clouds, and fine registration with the reweighted iterative closest point algorithm. In the process of rough alignment, the initial rotation matrix and the translation vector between the two datasets are obtained. After performing subsequent simplification operations, the number of points can be reduced greatly. Therefore, the time and space complexity of the accurate registration can be significantly reduced. The experimental results show that the proposed method improves the computational efficiency without loss of accuracy.

Optimal interdependence enhances robustness of complex systems

OpenAIRE

Singh, R. K.; Sinha, Sitabhra

2017-01-01

While interdependent systems have usually been associated with increased fragility, we show that strengthening the interdependence between dynamical processes on different networks can make them more robust. By coupling the dynamics of networks that in isolation exhibit catastrophic collapse with extinction of nodal activity, we demonstrate system-wide persistence of activity for an optimal range of interdependence between the networks. This is related to the appearance of attractors of the g...

Training of reverse propagation neural networks applied to neutron dosimetry

International Nuclear Information System (INIS)

Hernandez P, C. F.; Martinez B, M. R.; Leon P, A. A.; Espinoza G, J. G.; Castaneda M, V. H.; Solis S, L. O.; Castaneda M, R.; Ortiz R, M.; Vega C, H. R.; Mendez V, R.; Gallego, E.; De Sousa L, M. A.

2016-10-01

Neutron dosimetry is of great importance in radiation protection as aims to provide dosimetric quantities to assess the magnitude of detrimental health effects due to exposure of neutron radiation. To quantify detriment to health is necessary to evaluate the dose received by the occupationally exposed personnel using different detection systems called dosimeters, which have very dependent responses to the energy distribution of neutrons. The neutron detection is a much more complex problem than the detection of charged particles, since it does not carry an electric charge, does not cause direct ionization and has a greater penetration power giving the possibility of interacting with matter in a different way. Because of this, various neutron detection systems have been developed, among which the Bonner spheres spectrometric system stands out due to the advantages that possesses, such as a wide range of energy, high sensitivity and easy operation. However, once obtained the counting rates, the problem lies in the neutron spectrum deconvolution, necessary for the calculation of the doses, using different mathematical methods such as Monte Carlo, maximum entropy, iterative methods among others, which present various difficulties that have motivated the development of new technologies. Nowadays, methods based on artificial intelligence technologies are being used to perform neutron dosimetry, mainly using the theory of artificial neural networks. In these new methods the need for spectrum reconstruction can be eliminated for the calculation of the doses. In this work an artificial neural network or reverse propagation was trained for the calculation of 15 equivalent doses from the counting rates of the Bonner spheres spectrometric system using a set of 7 spheres, one of 2 spheres and two of a single sphere of different sizes, testing different error values until finding the most appropriate. The optimum network topology was obtained through the robust design

Tinnitus: Network pathophysiology-network pharmacology

Directory of Open Access Journals (Sweden)

Ana Belen eElgoyhen

2012-01-01

Full Text Available Tinnitus, the phantom perception of sound, is a prevalent disorder. One in 10 adults has clinically significant subjective tinnitus, and for 1 in 100, tinnitus severely affects their quality of life. Despite the significant unmet clinical need for a safe and effective drug targeting tinnitus relief, there is currently not a single FDA-approved drug on the market. The search for drugs that target tinnitus is hampered by the lack of a deep knowledge of the underlying neural substrates of this pathology. Recent studies are increasingly demonstrating that, as described for other central nervous system disorders, tinnitus is a pathology of brain networks. The application of graph theoretical analysis to brain networks has recently provided new information concerning their topology, their robustness and their vulnerability to attacks. Moreover, the philosophy behind drug design and pharmacotherapy in central nervous system pathologies is changing from that of magic bullets that target individual chemoreceptors or disease-causing genes into that of magic shotguns, promiscuous or dirty drugs that target disease-causing networks, also known as network pharmacology. In the present work we provide some insight into how this knowledge could be applied to tinnitus pathophysiology and pharmacotherapy.

Tinnitus: network pathophysiology-network pharmacology.

Science.gov (United States)

Elgoyhen, Ana B; Langguth, Berthold; Vanneste, Sven; De Ridder, Dirk

2012-01-01

Tinnitus, the phantom perception of sound, is a prevalent disorder. One in 10 adults has clinically significant subjective tinnitus, and for one in 100, tinnitus severely affects their quality of life. Despite the significant unmet clinical need for a safe and effective drug targeting tinnitus relief, there is currently not a single Food and Drug Administration (FDA)-approved drug on the market. The search for drugs that target tinnitus is hampered by the lack of a deep knowledge of the underlying neural substrates of this pathology. Recent studies are increasingly demonstrating that, as described for other central nervous system (CNS) disorders, tinnitus is a pathology of brain networks. The application of graph theoretical analysis to brain networks has recently provided new information concerning their topology, their robustness and their vulnerability to attacks. Moreover, the philosophy behind drug design and pharmacotherapy in CNS pathologies is changing from that of "magic bullets" that target individual chemoreceptors or "disease-causing genes" into that of "magic shotguns," "promiscuous" or "dirty drugs" that target "disease-causing networks," also known as network pharmacology. In the present work we provide some insight into how this knowledge could be applied to tinnitus pathophysiology and pharmacotherapy.

Robust gene network analysis reveals alteration of the STAT5a network as a hallmark of prostate cancer.

Science.gov (United States)

Reddy, Anupama; Huang, C Chris; Liu, Huiqing; Delisi, Charles; Nevalainen, Marja T; Szalma, Sandor; Bhanot, Gyan

2010-01-01

We develop a general method to identify gene networks from pair-wise correlations between genes in a microarray data set and apply it to a public prostate cancer gene expression data from 69 primary prostate tumors. We define the degree of a node as the number of genes significantly associated with the node and identify hub genes as those with the highest degree. The correlation network was pruned using transcription factor binding information in VisANT (http://visant.bu.edu/) as a biological filter. The reliability of hub genes was determined using a strict permutation test. Separate networks for normal prostate samples, and prostate cancer samples from African Americans (AA) and European Americans (EA) were generated and compared. We found that the same hubs control disease progression in AA and EA networks. Combining AA and EA samples, we generated networks for low low (cancer (e.g. possible turning on of oncogenes). (ii) Some hubs reduced their degree in the tumor network compared to their degree in the normal network, suggesting that these genes are associated with loss of regulatory control in cancer (e.g. possible loss of tumor suppressor genes). A striking result was that for both AA and EA tumor samples, STAT5a, CEBPB and EGR1 are major hubs that gain neighbors compared to the normal prostate network. Conversely, HIF-lα is a major hub that loses connections in the prostate cancer network compared to the normal prostate network. We also find that the degree of these hubs changes progressively from normal to low grade to high grade disease, suggesting that these hubs are master regulators of prostate cancer and marks disease progression. STAT5a was identified as a central hub, with ~120 neighbors in the prostate cancer network and only 81 neighbors in the normal prostate network. Of the 120 neighbors of STAT5a, 57 are known cancer related genes, known to be involved in functional pathways associated with tumorigenesis. Our method is general and can easily

Forecasting Baltic Dirty Tanker Index by Applying Wavelet Neural Networks

DEFF Research Database (Denmark)

Fan, Shuangrui; JI, TINGYUN; Bergqvist, Rickard

2013-01-01

modeling techniques used in freight rate forecasting. At the same time research in shipping index forecasting e.g. BDTI applying artificial intelligent techniques is scarce. This analyses the possibilities to forecast the BDTI by applying Wavelet Neural Networks (WNN). Firstly, the characteristics...... of traditional and artificial intelligent forecasting techniques are discussed and rationales for choosing WNN are explained. Secondly, the components and features of BDTI will be explicated. After that, the authors delve the determinants and influencing factors behind fluctuations of the BDTI in order to set...

Robust Target Tracking with Multi-Static Sensors under Insufficient TDOA Information.

Science.gov (United States)

Shin, Hyunhak; Ku, Bonhwa; Nelson, Jill K; Ko, Hanseok

2018-05-08

This paper focuses on underwater target tracking based on a multi-static sonar network composed of passive sonobuoys and an active ping. In the multi-static sonar network, the location of the target can be estimated using TDOA (Time Difference of Arrival) measurements. However, since the sensor network may obtain insufficient and inaccurate TDOA measurements due to ambient noise and other harsh underwater conditions, target tracking performance can be significantly degraded. We propose a robust target tracking algorithm designed to operate in such a scenario. First, track management with track splitting is applied to reduce performance degradation caused by insufficient measurements. Second, a target location is estimated by a fusion of multiple TDOA measurements using a Gaussian Mixture Model (GMM). In addition, the target trajectory is refined by conducting a stack-based data association method based on multiple-frames measurements in order to more accurately estimate target trajectory. The effectiveness of the proposed method is verified through simulations.

A Combination of Central Pattern Generator-based and Reflex-based Neural Networks for Dynamic, Adaptive, Robust Bipedal Locomotion

DEFF Research Database (Denmark)

Di Canio, Giuliano; Larsen, Jørgen Christian; Wörgötter, Florentin

2016-01-01

Robotic systems inspired from humans have always been lightening up the curiosity of engineers and scientists. Of many challenges, human locomotion is a very difficult one where a number of different systems needs to interact in order to generate a correct and balanced pattern. To simulate...... the interaction of these systems, implementations with reflexbased or central pattern generator (CPG)-based controllers have been tested on bipedal robot systems. In this paper we will combine the two controller types, into a controller that works with both reflex and CPG signals. We use a reflex-based neural...... network to generate basic walking patterns of a dynamic bipedal walking robot (DACBOT) and then a CPG-based neural network to ensure robust walking behavior...

Artificial Neural Networks for differential diagnosis of breast lesions in MR-Mammography: A systematic approach addressing the influence of network architecture on diagnostic performance using a large clinical database

International Nuclear Information System (INIS)

Dietzel, Matthias; Baltzer, Pascal A.T.; Dietzel, Andreas; Zoubi, Ramy; Gröschel, Tobias; Burmeister, Hartmut P.; Bogdan, Martin; Kaiser, Werner A.

2012-01-01

Rationale and objectives: Differential diagnosis of lesions in MR-Mammography (MRM) remains a complex task. The aim of this MRM study was to design and to test robustness of Artificial Neural Network architectures to predict malignancy using a large clinical database. Materials and methods: For this IRB-approved investigation standardized protocols and study design were applied (T1w-FLASH; 0.1 mmol/kgBW Gd-DTPA; T2w-TSE; histological verification after MRM). All lesions were evaluated by two experienced (>500 MRM) radiologists in consensus. In every lesion, 18 previously published descriptors were assessed and documented in the database. An Artificial Neural Network (ANN) was developed to process this database (The-MathWorks/Inc., feed-forward-architecture/resilient back-propagation-algorithm). All 18 descriptors were set as input variables, whereas histological results (malignant vs. benign) was defined as classification variable. Initially, the ANN was optimized in terms of “Training Epochs” (TE), “Hidden Layers” (HL), “Learning Rate” (LR) and “Neurons” (N). Robustness of the ANN was addressed by repeated evaluation cycles (n: 9) with receiver operating characteristics (ROC) analysis of the results applying 4-fold Cross Validation. The best network architecture was identified comparing the corresponding Area under the ROC curve (AUC). Results: Histopathology revealed 436 benign and 648 malignant lesions. Enhancing the level of complexity could not increase diagnostic accuracy of the network (P: n.s.). The optimized ANN architecture (TE: 20, HL: 1, N: 5, LR: 1.2) was accurate (mean-AUC 0.888; P: <0.001) and robust (CI: 0.885–0.892; range: 0.880–0.898). Conclusion: The optimized neural network showed robust performance and high diagnostic accuracy for prediction of malignancy on unknown data.

Artificial Neural Networks for differential diagnosis of breast lesions in MR-Mammography: a systematic approach addressing the influence of network architecture on diagnostic performance using a large clinical database.

Science.gov (United States)

Dietzel, Matthias; Baltzer, Pascal A T; Dietzel, Andreas; Zoubi, Ramy; Gröschel, Tobias; Burmeister, Hartmut P; Bogdan, Martin; Kaiser, Werner A

2012-07-01

Differential diagnosis of lesions in MR-Mammography (MRM) remains a complex task. The aim of this MRM study was to design and to test robustness of Artificial Neural Network architectures to predict malignancy using a large clinical database. For this IRB-approved investigation standardized protocols and study design were applied (T1w-FLASH; 0.1 mmol/kgBW Gd-DTPA; T2w-TSE; histological verification after MRM). All lesions were evaluated by two experienced (>500 MRM) radiologists in consensus. In every lesion, 18 previously published descriptors were assessed and documented in the database. An Artificial Neural Network (ANN) was developed to process this database (The-MathWorks/Inc., feed-forward-architecture/resilient back-propagation-algorithm). All 18 descriptors were set as input variables, whereas histological results (malignant vs. benign) was defined as classification variable. Initially, the ANN was optimized in terms of "Training Epochs" (TE), "Hidden Layers" (HL), "Learning Rate" (LR) and "Neurons" (N). Robustness of the ANN was addressed by repeated evaluation cycles (n: 9) with receiver operating characteristics (ROC) analysis of the results applying 4-fold Cross Validation. The best network architecture was identified comparing the corresponding Area under the ROC curve (AUC). Histopathology revealed 436 benign and 648 malignant lesions. Enhancing the level of complexity could not increase diagnostic accuracy of the network (P: n.s.). The optimized ANN architecture (TE: 20, HL: 1, N: 5, LR: 1.2) was accurate (mean-AUC 0.888; P: <0.001) and robust (CI: 0.885-0.892; range: 0.880-0.898). The optimized neural network showed robust performance and high diagnostic accuracy for prediction of malignancy on unknown data. Copyright © 2011 Elsevier Ireland Ltd. All rights reserved.

Robust Parameter Coordination for Multidisciplinary Design

Institute of Scientific and Technical Information of China (English)

无

2006-01-01

This paper introduced a robust parameter coordination method to analyze parameter uncertainties so as to predict conflicts and coordinate parameters in multidisciplinary design. The proposed method is based on constraints network, which gives a formulated model to analyze the coupling effects between design variables and product specifications. In this model, interval boxes are adopted to describe the uncertainty of design parameters quantitatively to enhance the design robustness. To solve this constraint network model, a general consistent algorithm framework is designed and implemented with interval arithmetic and the genetic algorithm, which can deal with both algebraic and ordinary differential equations. With the help of this method, designers could infer the consistent solution space from the given specifications. A case study involving the design of a bogie dumping system demonstrates the usefulness of this approach.

Fabrication of Robust Super hydrophobic Bamboo Based on ZnO Nano sheet Networks with Improved Water-, UV-, and Fire-Resistant Properties

International Nuclear Information System (INIS)

Li, J.; Sun, Q.; Yao, Q.; Wang, J.; Han, Sh.; Jin, Ch.

2014-01-01

Bamboo with water-resistant, UV-resistant, and fire-resistant properties was desirable in modern society. In this paper, the original bamboo was firstly treated with ZnO sol and then hydrothermally the ZnO nano sheet networks grow onto the bamboo surface and subsequently modified with fluoro alkyl silane (FAS-17). The FAS-17 treated bamboo substrate exhibited not only robust super hydrophobicity with a high contact angle of 161° but also stable repellency towards simulated acid rain (ph = 3) with a contact angle of 152°. Except for its robust super hydrophobicity, such a bamboo also presents superior water-resistant, UV-resistant, and fire-resistant properties.

Collaboration Networks in Applied Conservation Projects across Europe.

Science.gov (United States)

Nita, Andreea; Rozylowicz, Laurentiu; Manolache, Steluta; Ciocănea, Cristiana Maria; Miu, Iulia Viorica; Popescu, Viorel Dan

2016-01-01

The main funding instrument for implementing EU policies on nature conservation and supporting environmental and climate action is the LIFE Nature programme, established by the European Commission in 1992. LIFE Nature projects (>1400 awarded) are applied conservation projects in which partnerships between institutions are critical for successful conservation outcomes, yet little is known about the structure of collaborative networks within and between EU countries. The aim of our study is to understand the nature of collaboration in LIFE Nature projects using a novel application of social network theory at two levels: (1) collaboration between countries, and (2) collaboration within countries using six case studies: Western Europe (United Kingdom and Netherlands), Eastern Europe (Romania and Latvia) and Southern Europe (Greece and Portugal). Using data on 1261 projects financed between 1996 and 2013, we found that Italy was the most successful country not only in terms of awarded number of projects, but also in terms of overall influence being by far the most influent country in the European LIFE Nature network, having the highest eigenvector (0.989) and degree centrality (0.177). Another key player in the network is Netherlands, which ensures a fast communication flow with other network members (closeness-0.318) by staying connected with the most active countries. Although Western European countries have higher centrality scores than most of the Eastern European countries, our results showed that overall there is a lower tendency to create partnerships between different organization categories. Also, the comparisons of the six case studies indicates significant differences in regards to the pattern of creating partnerships, providing valuable information on collaboration on EU nature conservation. This study represents a starting point in predicting the formation of future partnerships within LIFE Nature programme, suggesting ways to improve transnational

On robustness in food supply chain networks

NARCIS (Netherlands)

Vlajic, J.V.; Vorst, van der J.G.A.J.; Hendrix, E.M.T.

2010-01-01

Purpose: Today's business environment is characterized by challenges of strong global competition where companies tend to achieve leanness and maximum responsiveness to customer demand. Lean supply chain networks are vulnerable to all kind of disruptions. For food supply chain networks (FSCNs), due

Robust sequential learning of feedforward neural networks in the presence of heavy-tailed noise.

Science.gov (United States)

Vuković, Najdan; Miljković, Zoran

2015-03-01

Feedforward neural networks (FFNN) are among the most used neural networks for modeling of various nonlinear problems in engineering. In sequential and especially real time processing all neural networks models fail when faced with outliers. Outliers are found across a wide range of engineering problems. Recent research results in the field have shown that to avoid overfitting or divergence of the model, new approach is needed especially if FFNN is to run sequentially or in real time. To accommodate limitations of FFNN when training data contains a certain number of outliers, this paper presents new learning algorithm based on improvement of conventional extended Kalman filter (EKF). Extended Kalman filter robust to outliers (EKF-OR) is probabilistic generative model in which measurement noise covariance is not constant; the sequence of noise measurement covariance is modeled as stochastic process over the set of symmetric positive-definite matrices in which prior is modeled as inverse Wishart distribution. In each iteration EKF-OR simultaneously estimates noise estimates and current best estimate of FFNN parameters. Bayesian framework enables one to mathematically derive expressions, while analytical intractability of the Bayes' update step is solved by using structured variational approximation. All mathematical expressions in the paper are derived using the first principles. Extensive experimental study shows that FFNN trained with developed learning algorithm, achieves low prediction error and good generalization quality regardless of outliers' presence in training data. Copyright © 2014 Elsevier Ltd. All rights reserved.

The Private Lives of Minerals: Social Network Analysis Applied to Mineralogy and Petrology

Science.gov (United States)

Hazen, R. M.; Morrison, S. M.; Fox, P. A.; Golden, J. J.; Downs, R. T.; Eleish, A.; Prabhu, A.; Li, C.; Liu, C.

2016-12-01

Comprehensive databases of mineral species (rruff.info/ima) and their geographic localities and co-existing mineral assemblages (mindat.org) reveal patterns of mineral association and distribution that mimic social networks, as commonly applied to such varied topics as social media interactions, the spread of disease, terrorism networks, and research collaborations. Applying social network analysis (SNA) to common assemblages of rock-forming igneous and regional metamorphic mineral species, we find patterns of cohesion, segregation, density, and cliques that are similar to those of human social networks. These patterns highlight classic trends in lithologic evolution and are illustrated with sociograms, in which mineral species are the "nodes" and co-existing species form "links." Filters based on chemistry, age, structural group, and other parameters highlight visually both familiar and new aspects of mineralogy and petrology. We quantify sociograms with SNA metrics, including connectivity (based on the frequency of co-occurrence of mineral pairs), homophily (the extent to which co-existing mineral species share compositional and other characteristics), network closure (based on the degree of network interconnectivity), and segmentation (as revealed by isolated "cliques" of mineral species). Exploitation of large and growing mineral data resources with SNA offers promising avenues for discovering previously hidden trends in mineral diversity-distribution systematics, as well as providing new pedagogical approaches to teaching mineralogy and petrology.

Cancer as robust intrinsic state shaped by evolution: a key issues review

Science.gov (United States)

Yuan, Ruoshi; Zhu, Xiaomei; Wang, Gaowei; Li, Site; Ao, Ping

2017-04-01

Cancer is a complex disease: its pathology cannot be properly understood in terms of independent players—genes, proteins, molecular pathways, or their simple combinations. This is similar to many-body physics of a condensed phase that many important properties are not determined by a single atom or molecule. The rapidly accumulating large ‘omics’ data also require a new mechanistic and global underpinning to organize for rationalizing cancer complexity. A unifying and quantitative theory was proposed by some of the present authors that cancer is a robust state formed by the endogenous molecular-cellular network, which is evolutionarily built for the developmental processes and physiological functions. Cancer state is not optimized for the whole organism. The discovery of crucial players in cancer, together with their developmental and physiological roles, in turn, suggests the existence of a hierarchical structure within molecular biology systems. Such a structure enables a decision network to be constructed from experimental knowledge. By examining the nonlinear stochastic dynamics of the network, robust states corresponding to normal physiological and abnormal pathological phenotypes, including cancer, emerge naturally. The nonlinear dynamical model of the network leads to a more encompassing understanding than the prevailing linear-additive thinking in cancer research. So far, this theory has been applied to prostate, hepatocellular, gastric cancers and acute promyelocytic leukemia with initial success. It may offer an example of carrying physics inquiring spirit beyond its traditional domain: while quantitative approaches can address individual cases, however there must be general rules/laws to be discovered in biology and medicine.

Monitoring of Thermal Protection Systems and MMOD using Robust Self-Organizing Optical Fiber Sensing Networks

Science.gov (United States)

Richards, Lance

2014-01-01

The general aim of this work is to develop and demonstrate a prototype structural health monitoring system for thermal protection systems that incorporates piezoelectric acoustic emission (AE) sensors to detect the occurrence and location of damaging impacts, such as those from Micrometeoroid Orbital Debris (MMOD). The approach uses an optical fiber Bragg grating (FBG) sensor network to evaluate the effect of detected damage on the thermal conductivity of the TPS material. Following detection of an impact, the TPS would be exposed to a heat source, possibly the sun, and the temperature distribution on the inner surface in the vicinity of the impact measured by the FBG network. A similar procedure could also be carried out as a screening test immediately prior to re-entry. The implications of any detected anomalies in the measured temperature distribution will be evaluated for their significance in relation to the performance of the TPS during reentry. Such a robust TPS health monitoring system would ensure overall crew safety throughout the mission, especially during reentry.

Exploiting Deep Neural Networks and Head Movements for Robust Binaural Localization of Multiple Sources in Reverberant Environments

DEFF Research Database (Denmark)

Ma, Ning; May, Tobias; Brown, Guy J.

2017-01-01

This paper presents a novel machine-hearing system that exploits deep neural networks (DNNs) and head movements for robust binaural localization of multiple sources in reverberant environments. DNNs are used to learn the relationship between the source azimuth and binaural cues, consisting...... of the complete cross-correlation function (CCF) and interaural level differences (ILDs). In contrast to many previous binaural hearing systems, the proposed approach is not restricted to localization of sound sources in the frontal hemifield. Due to the similarity of binaural cues in the frontal and rear...

Track reconstruction in discrete detectors by neutral networks

Energy Technology Data Exchange (ETDEWEB)

Glazov, A A; Kisel` , I V; Konotopskaya, E V; Neskoromnyj, V N; Ososkov, G A

1993-12-31

On the basis of applying neutral networks to the track recognition problem the investigations are made according to the specific properties of such discrete detectors as multiwire proportional chambers. These investigations result in the modification of the so-called rotor model in a neutral neural network. The energy function of a network in this modification contains only one cost term. This speeds up calculations considerably. The reduction of the energy function is done by the neuron selection with the help of simplegeometrical and energetical criteria. Besides, the cellular automata were applied to preliminary selection of data that made it possible to create an initial network configuration with the energy closer to its global minimum. The algorithm was tested on 10{sup 4} real three-prong events obtained from the ARES-spectrometer. The results are satisfactory including the noise robustness and good resolution of nearby going tracks. 12 refs.; 10 figs.

Track reconstruction in discrete detectors by neutral networks

International Nuclear Information System (INIS)

Glazov, A.A.; Kisel', I.V.; Konotopskaya, E.V.; Neskoromnyj, V.N.; Ososkov, G.A.

1992-01-01

On the basis of applying neutral networks to the track recognition problem the investigations are made according to the specific properties of such discrete detectors as multiwire proportional chambers. These investigations result in the modification of the so-called rotor model in a neutral neural network. The energy function of a network in this modification contains only one cost term. This speeds up calculations considerably. The reduction of the energy function is done by the neuron selection with the help of simplegeometrical and energetical criteria. Besides, the cellular automata were applied to preliminary selection of data that made it possible to create an initial network configuration with the energy closer to its global minimum. The algorithm was tested on 10 4 real three-prong events obtained from the ARES-spectrometer. The results are satisfactory including the noise robustness and good resolution of nearby going tracks. 12 refs.; 10 figs

Applying long short-term memory recurrent neural networks to intrusion detection

Directory of Open Access Journals (Sweden)

Ralf C. Staudemeyer

2015-07-01

Full Text Available We claim that modelling network traffic as a time series with a supervised learning approach, using known genuine and malicious behaviour, improves intrusion detection. To substantiate this, we trained long short-term memory (LSTM recurrent neural networks with the training data provided by the DARPA / KDD Cup ’99 challenge. To identify suitable LSTM-RNN network parameters and structure we experimented with various network topologies. We found networks with four memory blocks containing two cells each offer a good compromise between computational cost and detection performance. We applied forget gates and shortcut connections respectively. A learning rate of 0.1 and up to 1,000 epochs showed good results. We tested the performance on all features and on extracted minimal feature sets respectively. We evaluated different feature sets for the detection of all attacks within one network and also to train networks specialised on individual attack classes. Our results show that the LSTM classifier provides superior performance in comparison to results previously published results of strong static classifiers. With 93.82% accuracy and 22.13 cost, LSTM outperforms the winning entries of the KDD Cup ’99 challenge by far. This is due to the fact that LSTM learns to look back in time and correlate consecutive connection records. For the first time ever, we have demonstrated the usefulness of LSTM networks to intrusion detection.

Application of improved PSO-RBF neural network in the synthetic ammonia decarbonization

Directory of Open Access Journals (Sweden)

Yongwei LI

2017-12-01

Full Text Available The synthetic ammonia decarbonization is a typical complex industrial process, which has the characteristics of time variation, nonlinearity and uncertainty, and the on-line control model is difficult to be established. An improved PSO-RBF neural network control algorithm is proposed to solve the problems of low precision and poor robustness in the complex process of the synthetic ammonia decarbonization. The particle swarm optimization algorithm and RBF neural network are combined. The improved particle swarm algorithm is used to optimize the RBF neural network's hidden layer primary function center, width and the output layer's connection value to construct the RBF neural network model optimized by the improved PSO algorithm. The improved PSO-RBF neural network control model is applied to the key carbonization process and compared with the traditional fuzzy neural network. The simulation results show that the improved PSO-RBF neural network control method used in the synthetic ammonia decarbonization process has higher control accuracy and system robustness, which provides an effective way to solve the modeling and optimization control of a complex industrial process.

Robustness: confronting lessons from physics and biology.

Science.gov (United States)

Lesne, Annick

2008-11-01

The term robustness is encountered in very different scientific fields, from engineering and control theory to dynamical systems to biology. The main question addressed herein is whether the notion of robustness and its correlates (stability, resilience, self-organisation) developed in physics are relevant to biology, or whether specific extensions and novel frameworks are required to account for the robustness properties of living systems. To clarify this issue, the different meanings covered by this unique term are discussed; it is argued that they crucially depend on the kind of perturbations that a robust system should by definition withstand. Possible mechanisms underlying robust behaviours are examined, either encountered in all natural systems (symmetries, conservation laws, dynamic stability) or specific to biological systems (feedbacks and regulatory networks). Special attention is devoted to the (sometimes counterintuitive) interrelations between robustness and noise. A distinction between dynamic selection and natural selection in the establishment of a robust behaviour is underlined. It is finally argued that nested notions of robustness, relevant to different time scales and different levels of organisation, allow one to reconcile the seemingly contradictory requirements for robustness and adaptability in living systems.

The Pediatric Emergency Care Applied Research Network Registry: A Multicenter Electronic Health Record Registry of Pediatric Emergency Care.

Science.gov (United States)

Deakyne Davies, Sara J; Grundmeier, Robert W; Campos, Diego A; Hayes, Katie L; Bell, Jamie; Alessandrini, Evaline A; Bajaj, Lalit; Chamberlain, James M; Gorelick, Marc H; Enriquez, Rene; Casper, T Charles; Scheid, Beth; Kittick, Marlena; Dean, J Michael; Alpern, Elizabeth R

2018-04-01

 Electronic health record (EHR)-based registries allow for robust data to be derived directly from the patient clinical record and can provide important information about processes of care delivery and patient health outcomes.  A data dictionary, and subsequent data model, were developed describing EHR data sources to include all processes of care within the emergency department (ED). ED visit data were deidentified and XML files were created and submitted to a central data coordinating center for inclusion in the registry. Automated data quality control occurred prior to submission through an application created for this project. Data quality reports were created for manual data quality review.  The Pediatric Emergency Care Applied Research Network (PECARN) Registry, representing four hospital systems and seven EDs, demonstrates that ED data from disparate health systems and EHR vendors can be harmonized for use in a single registry with a common data model. The current PECARN Registry represents data from 2,019,461 pediatric ED visits, 894,503 distinct patients, more than 12.5 million narrative reports, and 12,469,754 laboratory tests and continues to accrue data monthly.  The Registry is a robust harmonized clinical registry that includes data from diverse patients, sites, and EHR vendors derived via data extraction, deidentification, and secure submission to a central data coordinating center. The data provided may be used for benchmarking, clinical quality improvement, and comparative effectiveness research. Schattauer.

Robust artificial neural network for reliability and sensitivity analyses of complex non-linear systems.

Science.gov (United States)

Oparaji, Uchenna; Sheu, Rong-Jiun; Bankhead, Mark; Austin, Jonathan; Patelli, Edoardo

2017-12-01

Artificial Neural Networks (ANNs) are commonly used in place of expensive models to reduce the computational burden required for uncertainty quantification, reliability and sensitivity analyses. ANN with selected architecture is trained with the back-propagation algorithm from few data representatives of the input/output relationship of the underlying model of interest. However, different performing ANNs might be obtained with the same training data as a result of the random initialization of the weight parameters in each of the network, leading to an uncertainty in selecting the best performing ANN. On the other hand, using cross-validation to select the best performing ANN based on the ANN with the highest R 2 value can lead to biassing in the prediction. This is as a result of the fact that the use of R 2 cannot determine if the prediction made by ANN is biased. Additionally, R 2 does not indicate if a model is adequate, as it is possible to have a low R 2 for a good model and a high R 2 for a bad model. Hence, in this paper, we propose an approach to improve the robustness of a prediction made by ANN. The approach is based on a systematic combination of identical trained ANNs, by coupling the Bayesian framework and model averaging. Additionally, the uncertainties of the robust prediction derived from the approach are quantified in terms of confidence intervals. To demonstrate the applicability of the proposed approach, two synthetic numerical examples are presented. Finally, the proposed approach is used to perform a reliability and sensitivity analyses on a process simulation model of a UK nuclear effluent treatment plant developed by National Nuclear Laboratory (NNL) and treated in this study as a black-box employing a set of training data as a test case. This model has been extensively validated against plant and experimental data and used to support the UK effluent discharge strategy. Copyright © 2017 Elsevier Ltd. All rights reserved.

Robust Networking Architecture and Secure Communication Scheme for Heterogeneous Wireless Sensor Networks

Science.gov (United States)

McNeal, McKenzie, III.

2012-01-01

Current networking architectures and communication protocols used for Wireless Sensor Networks (WSNs) have been designed to be energy efficient, low latency, and long network lifetime. One major issue that must be addressed is the security in data communication. Due to the limited capabilities of low cost and small sized sensor nodes, designing…

Attractive ellipsoids in robust control

CERN Document Server

Poznyak, Alexander; Azhmyakov, Vadim

2014-01-01

This monograph introduces a newly developed robust-control design technique for a wide class of continuous-time dynamical systems called the “attractive ellipsoid method.” Along with a coherent introduction to the proposed control design and related topics, the monograph studies nonlinear affine control systems in the presence of uncertainty and presents a constructive and easily implementable control strategy that guarantees certain stability properties. The authors discuss linear-style feedback control synthesis in the context of the above-mentioned systems. The development and physical implementation of high-performance robust-feedback controllers that work in the absence of complete information is addressed, with numerous examples to illustrate how to apply the attractive ellipsoid method to mechanical and electromechanical systems. While theorems are proved systematically, the emphasis is on understanding and applying the theory to real-world situations. Attractive Ellipsoids in Robust Control will a...

Applying a social network analysis (SNA) approach to understanding radiologists' performance in reading mammograms

Science.gov (United States)

Tavakoli Taba, Seyedamir; Hossain, Liaquat; Heard, Robert; Brennan, Patrick; Lee, Warwick; Lewis, Sarah

2017-03-01

Rationale and objectives: Observer performance has been widely studied through examining the characteristics of individuals. Applying a systems perspective, while understanding of the system's output, requires a study of the interactions between observers. This research explains a mixed methods approach to applying a social network analysis (SNA), together with a more traditional approach of examining personal/ individual characteristics in understanding observer performance in mammography. Materials and Methods: Using social networks theories and measures in order to understand observer performance, we designed a social networks survey instrument for collecting personal and network data about observers involved in mammography performance studies. We present the results of a study by our group where 31 Australian breast radiologists originally reviewed 60 mammographic cases (comprising of 20 abnormal and 40 normal cases) and then completed an online questionnaire about their social networks and personal characteristics. A jackknife free response operating characteristic (JAFROC) method was used to measure performance of radiologists. JAFROC was tested against various personal and network measures to verify the theoretical model. Results: The results from this study suggest a strong association between social networks and observer performance for Australian radiologists. Network factors accounted for 48% of variance in observer performance, in comparison to 15.5% for the personal characteristics for this study group. Conclusion: This study suggest a strong new direction for research into improving observer performance. Future studies in observer performance should consider social networks' influence as part of their research paradigm, with equal or greater vigour than traditional constructs of personal characteristics.

Multilayer perceptron for robust nonlinear interval regression analysis using genetic algorithms.

Science.gov (United States)

Hu, Yi-Chung

2014-01-01

On the basis of fuzzy regression, computational models in intelligence such as neural networks have the capability to be applied to nonlinear interval regression analysis for dealing with uncertain and imprecise data. When training data are not contaminated by outliers, computational models perform well by including almost all given training data in the data interval. Nevertheless, since training data are often corrupted by outliers, robust learning algorithms employed to resist outliers for interval regression analysis have been an interesting area of research. Several approaches involving computational intelligence are effective for resisting outliers, but the required parameters for these approaches are related to whether the collected data contain outliers or not. Since it seems difficult to prespecify the degree of contamination beforehand, this paper uses multilayer perceptron to construct the robust nonlinear interval regression model using the genetic algorithm. Outliers beyond or beneath the data interval will impose slight effect on the determination of data interval. Simulation results demonstrate that the proposed method performs well for contaminated datasets.

Geometrical methods for power network analysis

Energy Technology Data Exchange (ETDEWEB)

Bellucci, Stefano; Tiwari, Bhupendra Nath [Istituto Nazioneale di Fisica Nucleare, Frascati, Rome (Italy). Lab. Nazionali di Frascati; Gupta, Neeraj [Indian Institute of Technology, Kanpur (India). Dept. of Electrical Engineering

2013-02-01

Uses advanced geometrical methods to analyse power networks. Provides a self-contained and tutorial introduction. Includes a fully worked-out example for the IEEE 5 bus system. This book is a short introduction to power system planning and operation using advanced geometrical methods. The approach is based on well-known insights and techniques developed in theoretical physics in the context of Riemannian manifolds. The proof of principle and robustness of this approach is examined in the context of the IEEE 5 bus system. This work addresses applied mathematicians, theoretical physicists and power engineers interested in novel mathematical approaches to power network theory.

An Intuitive Dominant Test Algorithm of CP-nets Applied on Wireless Sensor Network

Directory of Open Access Journals (Sweden)

Liu Zhaowei

2014-07-01

Full Text Available A wireless sensor network is of spatially distributed with autonomous sensors, just like a multi-Agent system with single Agent. Conditional Preference networks is a qualitative tool for representing ceteris paribus (all other things being equal preference statements, it has been a research hotspot in artificial intelligence recently. But the algorithm and complexity of strong dominant test with respect to binary-valued structure CP-nets have not been solved, and few researchers address the application to other domain. In this paper, strong dominant test and application of CP-nets are studied in detail. Firstly, by constructing induced graph of CP-nets and studying its properties, we make a conclusion that the problem of strong dominant test on binary-valued CP-nets is single source shortest path problem essentially, so strong dominant test problem can be solved by improved Dijkstra’s algorithm. Secondly, we apply the algorithm above mentioned to the completeness of wireless sensor network, and design a completeness judging algorithm based on strong dominant test. Thirdly, we apply the algorithm on wireless sensor network to solve routing problem. In the end, we point out some interesting work in the future.

Attraction Basins as Gauges of Robustness against Boundary Conditions in Biological Complex Systems

Science.gov (United States)

Demongeot, Jacques; Goles, Eric; Morvan, Michel; Noual, Mathilde; Sené, Sylvain

2010-01-01

One fundamental concept in the context of biological systems on which researches have flourished in the past decade is that of the apparent robustness of these systems, i.e., their ability to resist to perturbations or constraints induced by external or boundary elements such as electromagnetic fields acting on neural networks, micro-RNAs acting on genetic networks and even hormone flows acting both on neural and genetic networks. Recent studies have shown the importance of addressing the question of the environmental robustness of biological networks such as neural and genetic networks. In some cases, external regulatory elements can be given a relevant formal representation by assimilating them to or modeling them by boundary conditions. This article presents a generic mathematical approach to understand the influence of boundary elements on the dynamics of regulation networks, considering their attraction basins as gauges of their robustness. The application of this method on a real genetic regulation network will point out a mathematical explanation of a biological phenomenon which has only been observed experimentally until now, namely the necessity of the presence of gibberellin for the flower of the plant Arabidopsis thaliana to develop normally. PMID:20700525

Attraction basins as gauges of robustness against boundary conditions in biological complex systems.

Directory of Open Access Journals (Sweden)

Jacques Demongeot

Full Text Available One fundamental concept in the context of biological systems on which researches have flourished in the past decade is that of the apparent robustness of these systems, i.e., their ability to resist to perturbations or constraints induced by external or boundary elements such as electromagnetic fields acting on neural networks, micro-RNAs acting on genetic networks and even hormone flows acting both on neural and genetic networks. Recent studies have shown the importance of addressing the question of the environmental robustness of biological networks such as neural and genetic networks. In some cases, external regulatory elements can be given a relevant formal representation by assimilating them to or modeling them by boundary conditions. This article presents a generic mathematical approach to understand the influence of boundary elements on the dynamics of regulation networks, considering their attraction basins as gauges of their robustness. The application of this method on a real genetic regulation network will point out a mathematical explanation of a biological phenomenon which has only been observed experimentally until now, namely the necessity of the presence of gibberellin for the flower of the plant Arabidopsis thaliana to develop normally.

Application of artificial neural networks in analysis of CHF experimental data in round tubes

International Nuclear Information System (INIS)

Huang Yanping; Chen Bingde; Lang Xuemei; Wang Xiaojun; Shan Jianqiang; Jia Dounan

2004-01-01

Artificial neural networks (ANNs) are applied successfully to analyze the critical heat flux (CHF) experimental data from some round tubes in this paper. A set of software adopting artificial neural network method for predicting CHF in round tube and a set of CHF database are gotten. Comparing with common CHF correlations and CHF look-up table, ANN method has stronger ability of allow-wrong and nice robustness. The CHF predicting software adopting artificial neural network technology can improve the predicting accuracy in a wider parameter range, and is easier to update and to use. The artificial neural network method used in this paper can be applied to some similar physical problems. (authors)

Confidence from uncertainty - A multi-target drug screening method from robust control theory

Directory of Open Access Journals (Sweden)

Petzold Linda R

2010-11-01

Full Text Available Abstract Background Robustness is a recognized feature of biological systems that evolved as a defence to environmental variability. Complex diseases such as diabetes, cancer, bacterial and viral infections, exploit the same mechanisms that allow for robust behaviour in healthy conditions to ensure their own continuance. Single drug therapies, while generally potent regulators of their specific protein/gene targets, often fail to counter the robustness of the disease in question. Multi-drug therapies offer a powerful means to restore disrupted biological networks, by targeting the subsystem of interest while preventing the diseased network from reconciling through available, redundant mechanisms. Modelling techniques are needed to manage the high number of combinatorial possibilities arising in multi-drug therapeutic design, and identify synergistic targets that are robust to system uncertainty. Results We present the application of a method from robust control theory, Structured Singular Value or μ- analysis, to identify highly effective multi-drug therapies by using robustness in the face of uncertainty as a new means of target discrimination. We illustrate the method by means of a case study of a negative feedback network motif subject to parametric uncertainty. Conclusions The paper contributes to the development of effective methods for drug screening in the context of network modelling affected by parametric uncertainty. The results have wide applicability for the analysis of different sources of uncertainty like noise experienced in the data, neglected dynamics, or intrinsic biological variability.

Robustness in Regulatory Interaction Networks. A Generic Approach with Applications at Different Levels: Physiologic, Metabolic and Genetic

Science.gov (United States)

Demongeot, Jacques; Ben Amor, Hedi; Elena, Adrien; Gillois, Pierre; Noual, Mathilde; Sené, Sylvain

2009-01-01

Regulatory interaction networks are often studied on their dynamical side (existence of attractors, study of their stability). We focus here also on their robustness, that is their ability to offer the same spatiotemporal patterns and to resist to external perturbations such as losses of nodes or edges in the networks interactions architecture, changes in their environmental boundary conditions as well as changes in the update schedule (or updating mode) of the states of their elements (e.g., if these elements are genes, their synchronous coexpression mode versus their sequential expression). We define the generic notions of boundary, core, and critical vertex or edge of the underlying interaction graph of the regulatory network, whose disappearance causes dramatic changes in the number and nature of attractors (e.g., passage from a bistable behaviour to a unique periodic regime) or in the range of their basins of stability. The dynamic transition of states will be presented in the framework of threshold Boolean automata rules. A panorama of applications at different levels will be given: brain and plant morphogenesis, bulbar cardio-respiratory regulation, glycolytic/oxidative metabolic coupling, and eventually cell cycle and feather morphogenesis genetic control. PMID:20057955

Robustness in Regulatory Interaction Networks. A Generic Approach with Applications at Different Levels: Physiologic, Metabolic and Genetic

Directory of Open Access Journals (Sweden)

Sylvain Sené

2009-10-01

Full Text Available Regulatory interaction networks are often studied on their dynamical side (existence of attractors, study of their stability. We focus here also on their robustness, that is their ability to offer the same spatiotemporal patterns and to resist to external perturbations such as losses of nodes or edges in the networks interactions architecture, changes in their environmental boundary conditions as well as changes in the update schedule (or updating mode of the states of their elements (e.g., if these elements are genes, their synchronous coexpression mode versus their sequential expression. We define the generic notions of boundary, core, and critical vertex or edge of the underlying interaction graph of the regulatory network, whose disappearance causes dramatic changes in the number and nature of attractors (e.g., passage from a bistable behaviour to a unique periodic regime or in the range of their basins of stability. The dynamic transition of states will be presented in the framework of threshold Boolean automata rules. A panorama of applications at different levels will be given: brain and plant morphogenesis, bulbar cardio-respiratory regulation, glycolytic/oxidative metabolic coupling, and eventually cell cycle and feather morphogenesis genetic control.

Robust statistical methods with R

CERN Document Server

Jureckova, Jana

2005-01-01

Robust statistical methods were developed to supplement the classical procedures when the data violate classical assumptions. They are ideally suited to applied research across a broad spectrum of study, yet most books on the subject are narrowly focused, overly theoretical, or simply outdated. Robust Statistical Methods with R provides a systematic treatment of robust procedures with an emphasis on practical application.The authors work from underlying mathematical tools to implementation, paying special attention to the computational aspects. They cover the whole range of robust methods, including differentiable statistical functions, distance of measures, influence functions, and asymptotic distributions, in a rigorous yet approachable manner. Highlighting hands-on problem solving, many examples and computational algorithms using the R software supplement the discussion. The book examines the characteristics of robustness, estimators of real parameter, large sample properties, and goodness-of-fit tests. It...

Robust Portfolio Optimization using CAPM Approach

Directory of Open Access Journals (Sweden)

mohsen gharakhani

2013-08-01

Full Text Available In this paper, a new robust model of multi-period portfolio problem has been developed. One of the key concerns in any asset allocation problem is how to cope with uncertainty about future returns. There are some approaches in the literature for this purpose including stochastic programming and robust optimization. Applying these techniques to multi-period portfolio problem may increase the problem size in a way that the resulting model is intractable. In this paper, a novel approach has been proposed to formulate multi-period portfolio problem as an uncertain linear program assuming that asset return follows the single-index factor model. Robust optimization technique has been also used to solve the problem. In order to evaluate the performance of the proposed model, a numerical example has been applied using simulated data.

Connection Management and Recovery Strategies under Epidemic Network Failures in Optical Transport Networks

DEFF Research Database (Denmark)

Fagertun, Anna Manolova; Ruepp, Sarah Renée

2014-01-01

The current trend in deploying automatic control plane solutions for increased flexibility in the optical transport layer leads to numerous advantages for both the operators and the customers, but also pose challenges related to the stability of the network and its ability to operate in a robust...... manner under attacks. This work proposes four policies for failure handling in a connection-oriented optical transport network, under Generalized MultiProtocol Label Switching control plane, and evaluates their performance under multiple correlated large-scale failures. We employ the Susceptible...... of their transport infrastructures. Applying proactive methods for avoiding areas where epidemic failures spread results in 50% less connections requiring recovery, which translates in improved quality of service to customers....

Multidisciplinary Design Optimization for High Reliability and Robustness

National Research Council Canada - National Science Library

Grandhi, Ramana

2005-01-01

.... Over the last 3 years Wright State University has been applying analysis tools to predict the behavior of critical disciplines to produce highly robust torpedo designs using robust multi-disciplinary...

On the Adaptive Design Rules of Biochemical Networks in Evolution

Directory of Open Access Journals (Sweden)

Bor-Sen Chen

2007-01-01

Full Text Available Biochemical networks are the backbones of physiological systems of organisms. Therefore, a biochemical network should be sufficiently robust (not sensitive to tolerate genetic mutations and environmental changes in the evolutionary process. In this study, based on the robustness and sensitivity criteria of biochemical networks, the adaptive design rules are developed for natural selection in the evolutionary process. This will provide insights into the robust adaptive mechanism of biochemical networks in the evolutionary process. We find that if a mutated biochemical network satisfies the robustness and sensitivity criteria of natural selection, there is a high probability for the biochemical network to prevail during natural selection in the evolutionary process. Since there are various mutated biochemical networks that can satisfy these criteria but have some differences in phenotype, the biochemical networks increase their diversities in the evolutionary process. The robustness of a biochemical network enables co-option so that new phenotypes can be generated in evolution. The proposed robust adaptive design rules of natural selection gain much insight into the evolutionary mechanism and provide a systematic robust biochemical circuit design method of biochemical networks for biotechnological and therapeutic purposes in the future.

Ant colony optimization and neural networks applied to nuclear power plant monitoring

International Nuclear Information System (INIS)

Santos, Gean Ribeiro dos; Andrade, Delvonei Alves de; Pereira, Iraci Martinez

2015-01-01

A recurring challenge in production processes is the development of monitoring and diagnosis systems. Those systems help on detecting unexpected changes and interruptions, preventing losses and mitigating risks. Artificial Neural Networks (ANNs) have been extensively used in creating monitoring systems. Usually the ANNs created to solve this kind of problem are created by taking into account only parameters as the number of inputs, outputs, and hidden layers. The result networks are generally fully connected and have no improvements in its topology. This work intends to use an Ant Colony Optimization (ACO) algorithm to create a tuned neural network. The ACO search algorithm will use Back Error Propagation (BP) to optimize the network topology by suggesting the best neuron connections. The result ANN will be applied to monitoring the IEA-R1 research reactor at IPEN. (author)

Ant colony optimization and neural networks applied to nuclear power plant monitoring

Energy Technology Data Exchange (ETDEWEB)

Santos, Gean Ribeiro dos; Andrade, Delvonei Alves de; Pereira, Iraci Martinez, E-mail: gean@usp.br, E-mail: delvonei@ipen.br, E-mail: martinez@ipen.br [Instituto de Pesquisas Energeticas e Nucleares (IPEN/CNEN-SP), Sao Paulo, SP (Brazil)

2015-07-01

A recurring challenge in production processes is the development of monitoring and diagnosis systems. Those systems help on detecting unexpected changes and interruptions, preventing losses and mitigating risks. Artificial Neural Networks (ANNs) have been extensively used in creating monitoring systems. Usually the ANNs created to solve this kind of problem are created by taking into account only parameters as the number of inputs, outputs, and hidden layers. The result networks are generally fully connected and have no improvements in its topology. This work intends to use an Ant Colony Optimization (ACO) algorithm to create a tuned neural network. The ACO search algorithm will use Back Error Propagation (BP) to optimize the network topology by suggesting the best neuron connections. The result ANN will be applied to monitoring the IEA-R1 research reactor at IPEN. (author)

Signed directed social network analysis applied to group conflict

DEFF Research Database (Denmark)

Zheng, Quan; Skillicorn, David; Walther, Olivier

2015-01-01

Real-world social networks contain relationships of multiple different types, but this richness is often ignored in graph-theoretic modelling. We show how two recently developed spectral embedding techniques, for directed graphs (relationships are asymmetric) and for signed graphs (relationships...... are both positive and negative), can be combined. This combination is particularly appropriate for intelligence, terrorism, and law enforcement applications. We illustrate by applying the novel embedding technique to datasets describing conflict in North-West Africa, and show how unusual interactions can...

REINA at CLEF 2007 Robust Task

OpenAIRE

Zazo Rodríguez, Ángel Francisco; Figuerola, Carlos G.; Alonso Berrocal, José Luis

2007-01-01

This paper describes our work at CLEF 2007 Robust Task. We have participated in the monolingual (English, French and Portuguese) and the bilingual (English to French) subtask. At CLEF 2006 our research group obtained very good results applying local query expansion using windows of terms in the robust task. This year we have used the same expansion technique, but taking into account some criteria of robustness: MAP, GMAP, MMR, GS@10, P@10, number of failed topics, number of topics bellow 0.1 ...

Robust model predictive control of nonlinear systems with unmodeled dynamics and bounded uncertainties based on neural networks.

Science.gov (United States)

Yan, Zheng; Wang, Jun

2014-03-01

This paper presents a neural network approach to robust model predictive control (MPC) for constrained discrete-time nonlinear systems with unmodeled dynamics affected by bounded uncertainties. The exact nonlinear model of underlying process is not precisely known, but a partially known nominal model is available. This partially known nonlinear model is first decomposed to an affine term plus an unknown high-order term via Jacobian linearization. The linearization residue combined with unmodeled dynamics is then modeled using an extreme learning machine via supervised learning. The minimax methodology is exploited to deal with bounded uncertainties. The minimax optimization problem is reformulated as a convex minimization problem and is iteratively solved by a two-layer recurrent neural network. The proposed neurodynamic approach to nonlinear MPC improves the computational efficiency and sheds a light for real-time implementability of MPC technology. Simulation results are provided to substantiate the effectiveness and characteristics of the proposed approach.

A systematic design method for robust synthetic biology to satisfy design specifications.

Science.gov (United States)

Chen, Bor-Sen; Wu, Chih-Hung

2009-06-30

Synthetic biology is foreseen to have important applications in biotechnology and medicine, and is expected to contribute significantly to a better understanding of the functioning of complex biological systems. However, the development of synthetic gene networks is still difficult and most newly created gene networks are non-functioning due to intrinsic parameter uncertainties, external disturbances and functional variations of intra- and extra-cellular environments. The design method for a robust synthetic gene network that works properly in a host cell under these intrinsic parameter uncertainties and external disturbances is the most important topic in synthetic biology. In this study, we propose a stochastic model that includes parameter fluctuations and external disturbances to mimic the dynamic behaviors of a synthetic gene network in the host cell. Then, based on this stochastic model, four design specifications are introduced to guarantee that a synthetic gene network can achieve its desired steady state behavior in spite of parameter fluctuations, external disturbances and functional variations in the host cell. We propose a systematic method to select a set of appropriate design parameters for a synthetic gene network that will satisfy these design specifications so that the intrinsic parameter fluctuations can be tolerated, the external disturbances can be efficiently filtered, and most importantly, the desired steady states can be achieved. Thus the synthetic gene network can work properly in a host cell under intrinsic parameter uncertainties, external disturbances and functional variations. Finally, a design procedure for the robust synthetic gene network is developed and a design example is given in silico to confirm the performance of the proposed method. Based on four design specifications, a systematic design procedure is developed for designers to engineer a robust synthetic biology network that can achieve its desired steady state behavior

Technical Challenges Hindering Development of Robust Wireless ...

African Journals Online (AJOL)

PROF. OLIVER OSUAGWA

2015-12-01

Dec 1, 2015 ... challenges remain to be resolved, in designing robust wireless networks that can deliver the performance ... demonstrated the first radio transmission from the Isle of ... distances with better quality, less power, and smaller ...

Indications of marine bioinvasion from network theory. An analysis of the global cargo ship network

Science.gov (United States)

Kölzsch, A.; Blasius, B.

2011-12-01

The transport of huge amounts of small aquatic organisms in the ballast tanks and at the hull of large cargo ships leads to ever increasing rates of marine bioinvasion. In this study, we apply a network theoretic approach to examine the introduction of invasive species into new ports by global shipping. This is the first stage of the invasion process where it is still possible to intervene with regulating measures. We compile a selection of widely used and newly developed network properties and apply these to analyse the structure and spread characteristics of the directed and weighted global cargo ship network (GCSN). Our results reveal that the GCSN is highly efficient, shows small world characteristics and is positive assortative, indicating that quick spread of invasive organisms between ports is likely. The GCSN shows strong community structure and contains two large communities, the Atlantic and Pacific trading groups. Ports that appear as connector hubs and are of high centralities are the Suez and Panama Canal, Singapore and Shanghai. Furthermore, from robustness analyses and the network's percolation behaviour, we evaluate differences of onboard and in-port ballast water treatment, set them into context with previous studies and advise bioinvasion management strategies.

Robustness and Optimization of Complex Networks : Reconstructability, Algorithms and Modeling

NARCIS (Netherlands)

Liu, D.

2013-01-01

The infrastructure networks, including the Internet, telecommunication networks, electrical power grids, transportation networks (road, railway, waterway, and airway networks), gas networks and water networks, are becoming more and more complex. The complex infrastructure networks are crucial to our

CX: A Scalable, Robust Network for Parallel Computing

Directory of Open Access Journals (Sweden)

Peter Cappello

2002-01-01

Full Text Available CX, a network-based computational exchange, is presented. The system's design integrates variations of ideas from other researchers, such as work stealing, non-blocking tasks, eager scheduling, and space-based coordination. The object-oriented API is simple, compact, and cleanly separates application logic from the logic that supports interprocess communication and fault tolerance. Computations, of course, run to completion in the presence of computational hosts that join and leave the ongoing computation. Such hosts, or producers, use task caching and prefetching to overlap computation with interprocessor communication. To break a potential task server bottleneck, a network of task servers is presented. Even though task servers are envisioned as reliable, the self-organizing, scalable network of n- servers, described as a sibling-connected height-balanced fat tree, tolerates a sequence of n-1 server failures. Tasks are distributed throughout the server network via a simple "diffusion" process. CX is intended as a test bed for research on automated silent auctions, reputation services, authentication services, and bonding services. CX also provides a test bed for algorithm research into network-based parallel computation.

Ensemble Modeling for Robustness Analysis in engineering non-native metabolic pathways.

Science.gov (United States)

Lee, Yun; Lafontaine Rivera, Jimmy G; Liao, James C

2014-09-01

Metabolic pathways in cells must be sufficiently robust to tolerate fluctuations in expression levels and changes in environmental conditions. Perturbations in expression levels may lead to system failure due to the disappearance of a stable steady state. Increasing evidence has suggested that biological networks have evolved such that they are intrinsically robust in their network structure. In this article, we presented Ensemble Modeling for Robustness Analysis (EMRA), which combines a continuation method with the Ensemble Modeling approach, for investigating the robustness issue of non-native pathways. EMRA investigates a large ensemble of reference models with different parameters, and determines the effects of parameter drifting until a bifurcation point, beyond which a stable steady state disappears and system failure occurs. A pathway is considered to have high bifurcational robustness if the probability of system failure is low in the ensemble. To demonstrate the utility of EMRA, we investigate the bifurcational robustness of two synthetic central metabolic pathways that achieve carbon conservation: non-oxidative glycolysis and reverse glyoxylate cycle. With EMRA, we determined the probability of system failure of each design and demonstrated that alternative designs of these pathways indeed display varying degrees of bifurcational robustness. Furthermore, we demonstrated that target selection for flux improvement should consider the trade-offs between robustness and performance. Copyright © 2014 The Authors. Published by Elsevier Inc. All rights reserved.

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.

Real-time control systems: feedback, scheduling and robustness

Science.gov (United States)

Simon, Daniel; Seuret, Alexandre; Sename, Olivier

2017-08-01

The efficient control of real-time distributed systems, where continuous components are governed through digital devices and communication networks, needs a careful examination of the constraints arising from the different involved domains inside co-design approaches. Thanks to the robustness of feedback control, both new control methodologies and slackened real-time scheduling schemes are proposed beyond the frontiers between these traditionally separated fields. A methodology to design robust aperiodic controllers is provided, where the sampling interval is considered as a control variable of the system. Promising experimental results are provided to show the feasibility and robustness of the approach.

ELUCIDATING BRAIN CONNECTIVITY NETWORKS IN MAJOR DEPRESSIVE DISORDER USING CLASSIFICATION-BASED SCORING.

Science.gov (United States)

Sacchet, Matthew D; Prasad, Gautam; Foland-Ross, Lara C; Thompson, Paul M; Gotlib, Ian H

2014-04-01

Graph theory is increasingly used in the field of neuroscience to understand the large-scale network structure of the human brain. There is also considerable interest in applying machine learning techniques in clinical settings, for example, to make diagnoses or predict treatment outcomes. Here we used support-vector machines (SVMs), in conjunction with whole-brain tractography, to identify graph metrics that best differentiate individuals with Major Depressive Disorder (MDD) from nondepressed controls. To do this, we applied a novel feature-scoring procedure that incorporates iterative classifier performance to assess feature robustness. We found that small-worldness , a measure of the balance between global integration and local specialization, most reliably differentiated MDD from nondepressed individuals. Post-hoc regional analyses suggested that heightened connectivity of the subcallosal cingulate gyrus (SCG) in MDDs contributes to these differences. The current study provides a novel way to assess the robustness of classification features and reveals anomalies in large-scale neural networks in MDD.

Robust recognition via information theoretic learning

CERN Document Server

He, Ran; Yuan, Xiaotong; Wang, Liang

2014-01-01

This Springer Brief represents a comprehensive review of information theoretic methods for robust recognition. A variety of information theoretic methods have been proffered in the past decade, in a large variety of computer vision applications; this work brings them together, attempts to impart the theory, optimization and usage of information entropy.The?authors?resort to a new information theoretic concept, correntropy, as a robust measure and apply it to solve robust face recognition and object recognition problems. For computational efficiency,?the brief?introduces the additive and multip

Convolutional neural networks applied to neutrino events in a liquid argon time projection chamber

International Nuclear Information System (INIS)

Acciarri, R.; Adams, C.; An, R.; Asaadi, J.; Auger, M.

2017-01-01

Here, we present several studies of convolutional neural networks applied to data coming from the MicroBooNE detector, a liquid argon time projection chamber (LArTPC). The algorithms studied include the classification of single particle images, the localization of single particle and neutrino interactions in an image, and the detection of a simulated neutrino event overlaid with cosmic ray backgrounds taken from real detector data. These studies demonstrate the potential of convolutional neural networks for particle identification or event detection on simulated neutrino interactions. Lastly, we also address technical issues that arise when applying this technique to data from a large LArTPC at or near ground level.

Convolutional neural networks applied to neutrino events in a liquid argon time projection chamber

Energy Technology Data Exchange (ETDEWEB)

Acciarri, R.; Adams, C.; An, R.; Asaadi, J.; Auger, M.; Bagby, L.; Baller, B.; Barr, G.; Bass, M.; Bay, F.; Bishai, M.; Blake, A.; Bolton, T.; Bugel, L.; Camilleri, L.; Caratelli, D.; Carls, B.; Fernandez, R. Castillo; Cavanna, F.; Chen, H.; Church, E.; Cianci, D.; Collin, G. H.; Conrad, J. M.; Convery, M.; Crespo-Anad?n, J. I.; Del Tutto, M.; Devitt, D.; Dytman, S.; Eberly, B.; Ereditato, A.; Sanchez, L. Escudero; Esquivel, J.; Fleming, B. T.; Foreman, W.; Furmanski, A. P.; Garvey, G. T.; Genty, V.; Goeldi, D.; Gollapinni, S.; Graf, N.; Gramellini, E.; Greenlee, H.; Grosso, R.; Guenette, R.; Hackenburg, A.; Hamilton, P.; Hen, O.; Hewes, J.; Hill, C.; Ho, J.; Horton-Smith, G.; James, C.; de Vries, J. Jan; Jen, C. -M.; Jiang, L.; Johnson, R. A.; Jones, B. J. P.; Joshi, J.; Jostlein, H.; Kaleko, D.; Karagiorgi, G.; Ketchum, W.; Kirby, B.; Kirby, M.; Kobilarcik, T.; Kreslo, I.; Laube, A.; Li, Y.; Lister, A.; Littlejohn, B. R.; Lockwitz, S.; Lorca, D.; Louis, W. C.; Luethi, M.; Lundberg, B.; Luo, X.; Marchionni, A.; Mariani, C.; Marshall, J.; Caicedo, D. A. Martinez; Meddage, V.; Miceli, T.; Mills, G. B.; Moon, J.; Mooney, M.; Moore, C. D.; Mousseau, J.; Murrells, R.; Naples, D.; Nienaber, P.; Nowak, J.; Palamara, O.; Paolone, V.; Papavassiliou, V.; Pate, S. F.; Pavlovic, Z.; Porzio, D.; Pulliam, G.; Qian, X.; Raaf, J. L.; Rafique, A.; Rochester, L.; von Rohr, C. Rudolf; Russell, B.; Schmitz, D. W.; Schukraft, A.; Seligman, W.; Shaevitz, M. H.; Sinclair, J.; Snider, E. L.; Soderberg, M.; S?ldner-Rembold, S.; Soleti, S. R.; Spentzouris, P.; Spitz, J.; St. John, J.; Strauss, T.; Szelc, A. M.; Tagg, N.; Terao, K.; Thomson, M.; Toups, M.; Tsai, Y. -T.; Tufanli, S.; Usher, T.; Van de Water, R. G.; Viren, B.; Weber, M.; Weston, J.; Wickremasinghe, D. A.; Wolbers, S.; Wongjirad, T.; Woodruff, K.; Yang, T.; Zeller, G. P.; Zennamo, J.; Zhang, C.

2017-03-01

We present several studies of convolutional neural networks applied to data coming from the MicroBooNE detector, a liquid argon time projection chamber (LArTPC). The algorithms studied include the classification of single particle images, the localization of single particle and neutrino interactions in an image, and the detection of a simulated neutrino event overlaid with cosmic ray backgrounds taken from real detector data. These studies demonstrate the potential of convolutional neural networks for particle identification or event detection on simulated neutrino interactions. We also address technical issues that arise when applying this technique to data from a large LArTPC at or near ground level.

Interdependent networks - Topological percolation research and application in finance

Science.gov (United States)

Zhou, Di

This dissertation covers the two major parts of my Ph.D. research: i) developing a theoretical framework of complex networks and applying simulation and numerical methods to study the robustness of the network system, and ii) applying statistical physics concepts and methods to quantitatively analyze complex systems and applying the theoretical framework to study real-world systems. In part I, we focus on developing theories of interdependent networks as well as building computer simulation models, which includes three parts: 1) We report on the effects of topology on failure propagation for a model system consisting of two interdependent networks. We find that the internal node correlations in each of the networks significantly changes the critical density of failures, which can trigger the total disruption of the two-network system. Specifically, we find that the assortativity within a single network decreases the robustness of the entire system. 2) We study the percolation behavior of two interdependent scale-free (SF) networks under random failure of 1-p fraction of nodes. We find that as the coupling strength q between the two networks reduces from 1 (fully coupled) to 0 (no coupling), there exist two critical coupling strengths q1 and q2 , which separate the behaviors of the giant component as a function of p into three different regions, and for q2 relationship both analytically and numerically. We study a starlike network of n Erdos-Renyi (ER), SF networks and a looplike network of n ER networks, and we find for starlike networks, their phase transition regions change with n, but for looplike networks the phase regions change with average degree k . In part II, we apply concepts and methods developed in statistical physics to study economic systems. We analyze stock market indices and foreign exchange daily returns for 60 countries over the period of 1999-2012. We build a multi-layer network model based on different correlation measures, and introduce a

Interference-robust Air Interface for 5G Small Cells

DEFF Research Database (Denmark)

Tavares, Fernando Menezes Leitão

the existing wireless network infrastructure to the limit. Mobile network operators must invest in network expansion to deal with this problem, but the predicted network requirements show that a new Radio Access Technology (RAT) standard will be fundamental to reach the future target performance. This new 5th...... to the fundamental role of inter-cell interference in this type of networks, the inter-cell interference problem must be addressed since the beginning of the design of the new standard. This Ph.D. thesis deals with the design of an interference-robust air interface for 5G small cell networks. The interference...

Comparison of HMM experts with MLP experts in the Full Combination Multi-Band Approach to Robust ASR

OpenAIRE

Hagen, Astrid; Morris, Andrew

2000-01-01

In this paper we apply the Full Combination (FC) multi-band approach, which has originally been introduced in the framework of posterior-based HMM/ANN (Hidden Markov Model/Artificial Neural Network) hybrid systems, to systems in which the ANN (or Multilayer Perceptron (MLP)) is itself replaced by a Multi Gaussian HMM (MGM). Both systems represent the most widely used statistical models for robust ASR (automatic speech recognition). It is shown how the FC formula for the likelihood--based MGMs...

Robust loss functions for boosting.

Science.gov (United States)

Kanamori, Takafumi; Takenouchi, Takashi; Eguchi, Shinto; Murata, Noboru

2007-08-01

Boosting is known as a gradient descent algorithm over loss functions. It is often pointed out that the typical boosting algorithm, Adaboost, is highly affected by outliers. In this letter, loss functions for robust boosting are studied. Based on the concept of robust statistics, we propose a transformation of loss functions that makes boosting algorithms robust against extreme outliers. Next, the truncation of loss functions is applied to contamination models that describe the occurrence of mislabels near decision boundaries. Numerical experiments illustrate that the proposed loss functions derived from the contamination models are useful for handling highly noisy data in comparison with other loss functions.

Applying deep bidirectional LSTM and mixture density network for basketball trajectory prediction

NARCIS (Netherlands)

Zhao, Yu; Yang, Rennong; Chevalier, Guillaume; Shah, Rajiv C.; Romijnders, Rob

2018-01-01

Data analytics helps basketball teams to create tactics. However, manual data collection and analytics are costly and ineffective. Therefore, we applied a deep bidirectional long short-term memory (BLSTM) and mixture density network (MDN) approach. This model is not only capable of predicting a

Design Robust Controller for Rotary Kiln

Directory of Open Access Journals (Sweden)

Omar D. Hernández-Arboleda

2013-11-01

Full Text Available This paper presents the design of a robust controller for a rotary kiln. The designed controller is a combination of a fractional PID and linear quadratic regulator (LQR, these are not used to control the kiln until now, in addition robustness criteria are evaluated (gain margin, phase margin, strength gain, rejecting high frequency noise and sensitivity applied to the entire model (controller-plant, obtaining good results with a frequency range of 0.020 to 90 rad/s, which contributes to the robustness of the system.

Assessment of Process Robustness for Mass Customization

DEFF Research Database (Denmark)

Nielsen, Kjeld; Brunø, Thomas Ditlev

2013-01-01

robustness and their capability to develop it. Through literature study and analysis of robust process design characteristics a number of metrics are described which can be used for assessment. The metrics are evaluated and analyzed to be applied as KPI’s to help MC companies prioritize efforts in business...

Planning for robust reserve networks using uncertainty analysis

Science.gov (United States)

Moilanen, A.; Runge, M.C.; Elith, Jane; Tyre, A.; Carmel, Y.; Fegraus, E.; Wintle, B.A.; Burgman, M.; Ben-Haim, Y.

2006-01-01

Planning land-use for biodiversity conservation frequently involves computer-assisted reserve selection algorithms. Typically such algorithms operate on matrices of species presence?absence in sites, or on species-specific distributions of model predicted probabilities of occurrence in grid cells. There are practically always errors in input data?erroneous species presence?absence data, structural and parametric uncertainty in predictive habitat models, and lack of correspondence between temporal presence and long-run persistence. Despite these uncertainties, typical reserve selection methods proceed as if there is no uncertainty in the data or models. Having two conservation options of apparently equal biological value, one would prefer the option whose value is relatively insensitive to errors in planning inputs. In this work we show how uncertainty analysis for reserve planning can be implemented within a framework of information-gap decision theory, generating reserve designs that are robust to uncertainty. Consideration of uncertainty involves modifications to the typical objective functions used in reserve selection. Search for robust-optimal reserve structures can still be implemented via typical reserve selection optimization techniques, including stepwise heuristics, integer-programming and stochastic global search.

Towards effective and robust list-based packet filter for signature-based network intrusion detection: an engineering approach

DEFF Research Database (Denmark)

Meng, Weizhi; Li, Wenjuan; Kwok, Lam For

2017-01-01

Network intrusion detection systems (NIDSs) which aim to identify various attacks, have become an essential part of current security infrastructure. In particular, signature-based NIDSs are being widely implemented in industry due to their low rate of false alarms. However, the signature matching...... this problem, packet filtration is a promising solution to reduce unwanted traffic. Motivated by this, in this work, a list-based packet filter was designed and an engineering method of combining both blacklist and whitelist techniques was introduced. To further secure such filters against IP spoofing attacks...... in traffic filtration as well as workload reduction, and is robust against IP spoofing attacks....

A Hybrid Neural Network-Genetic Algorithm Technique for Aircraft Engine Performance Diagnostics

Science.gov (United States)

Kobayashi, Takahisa; Simon, Donald L.

2001-01-01

In this paper, a model-based diagnostic method, which utilizes Neural Networks and Genetic Algorithms, is investigated. Neural networks are applied to estimate the engine internal health, and Genetic Algorithms are applied for sensor bias detection and estimation. This hybrid approach takes advantage of the nonlinear estimation capability provided by neural networks while improving the robustness to measurement uncertainty through the application of Genetic Algorithms. The hybrid diagnostic technique also has the ability to rank multiple potential solutions for a given set of anomalous sensor measurements in order to reduce false alarms and missed detections. The performance of the hybrid diagnostic technique is evaluated through some case studies derived from a turbofan engine simulation. The results show this approach is promising for reliable diagnostics of aircraft engines.

Intelligent microchip networks: an agent-on-chip synthesis framework for the design of smart and robust sensor networks

Science.gov (United States)

Bosse, Stefan

2013-05-01

Sensorial materials consisting of high-density, miniaturized, and embedded sensor networks require new robust and reliable data processing and communication approaches. Structural health monitoring is one major field of application for sensorial materials. Each sensor node provides some kind of sensor, electronics, data processing, and communication with a strong focus on microchip-level implementation to meet the goals of miniaturization and low-power energy environments, a prerequisite for autonomous behaviour and operation. Reliability requires robustness of the entire system in the presence of node, link, data processing, and communication failures. Interaction between nodes is required to manage and distribute information. One common interaction model is the mobile agent. An agent approach provides stronger autonomy than a traditional object or remote-procedure-call based approach. Agents can decide for themselves, which actions are performed, and they are capable of flexible behaviour, reacting on the environment and other agents, providing some degree of robustness. Traditionally multi-agent systems are abstract programming models which are implemented in software and executed on program controlled computer architectures. This approach does not well scale to micro-chip level and requires full equipped computers and communication structures, and the hardware architecture does not consider and reflect the requirements for agent processing and interaction. We propose and demonstrate a novel design paradigm for reliable distributed data processing systems and a synthesis methodology and framework for multi-agent systems implementable entirely on microchip-level with resource and power constrained digital logic supporting Agent-On-Chip architectures (AoC). The agent behaviour and mobility is fully integrated on the micro-chip using pipelined communicating processes implemented with finite-state machines and register-transfer logic. The agent behaviour

Design of a sensor network system with a self-maintenance function for homeland security applications

International Nuclear Information System (INIS)

Fujiwara, Takeshi; Takahashi, Hiroyuki; Iyomoto, Naoko

2008-01-01

In this study, we develop a new concept of a robust wireless sensor network for homeland security applications. The sensor system consists of intelligent radiation sensors that can communicate each other through the wireless network. This structure can cover a wide area with a flexible geometry which is suitable for detecting a moving object with a detectable radiation source. Also, it has a tolerance against both the partial node's failure and packet errors; realized by a Self-Maintenance function. The Self-maintenance function is a function that enables an artifact to find, diagnosis and fix the trouble automatically and maintain itself. So far some approaches have been tried to realize robust monitoring system by applying the idea of multiplex system, based on ''2 out of 3'', but this requires a large amount of the hardware and is not suitable for sensor network systems. We designed a sensor network system with Self-Maintenance function based on qualitative reasoning technique for robust wireless sensor network system, and an instrument network based on ZigBee has been set up for investigations. CsI(Tl) gamma-ray detectors are used as sensors. The network system picks up correlation signals from sensors even some of sensors send false signals, which can be used as a reliable detection system for practical use. (author)