Interpolative Boolean Networks
Directory of Open Access Journals (Sweden)
Vladimir Dobrić
2017-01-01
Full Text Available Boolean networks are used for modeling and analysis of complex systems of interacting entities. Classical Boolean networks are binary and they are relevant for modeling systems with complex switch-like causal interactions. More descriptive power can be provided by the introduction of gradation in this model. If this is accomplished by using conventional fuzzy logics, the generalized model cannot secure the Boolean frame. Consequently, the validity of the model’s dynamics is not secured. The aim of this paper is to present the Boolean consistent generalization of Boolean networks, interpolative Boolean networks. The generalization is based on interpolative Boolean algebra, the [0,1]-valued realization of Boolean algebra. The proposed model is adaptive with respect to the nature of input variables and it offers greater descriptive power as compared with traditional models. For illustrative purposes, IBN is compared to the models based on existing real-valued approaches. Due to the complexity of the most systems to be analyzed and the characteristics of interpolative Boolean algebra, the software support is developed to provide graphical and numerical tools for complex system modeling and analysis.
Forced synchronization of autonomous dynamical Boolean networks
Energy Technology Data Exchange (ETDEWEB)
Rivera-Durón, R. R., E-mail: roberto.rivera@ipicyt.edu.mx; Campos-Cantón, E., E-mail: eric.campos@ipicyt.edu.mx [División de Matemáticas Aplicadas, Instituto Potosino de Investigación Científica y Tecnológica A. C., Camino a la Presa San José 2055, Col. Lomas 4 Sección, C.P. 78216, San Luis Potosí, S.L.P. (Mexico); Campos-Cantón, I. [Facultad de Ciencias, Universidad Autónoma de San Luis Potosí, Álvaro Obregón 64, C.P. 78000, San Luis Potosí, S.L.P. (Mexico); Gauthier, Daniel J. [Department of Physics and Center for Nonlinear and Complex Systems, Duke University, Box 90305, Durham, North Carolina 27708 (United States)
2015-08-15
We present the design of an autonomous time-delay Boolean network realized with readily available electronic components. Through simulations and experiments that account for the detailed nonlinear response of each circuit element, we demonstrate that a network with five Boolean nodes displays complex behavior. Furthermore, we show that the dynamics of two identical networks display near-instantaneous synchronization to a periodic state when forced by a common periodic Boolean signal. A theoretical analysis of the network reveals the conditions under which complex behavior is expected in an individual network and the occurrence of synchronization in the forced networks. This research will enable future experiments on autonomous time-delay networks using readily available electronic components with dynamics on a slow enough time-scale so that inexpensive data collection systems can faithfully record the dynamics.
Detecting controlling nodes of boolean regulatory networks.
Schober, Steffen; Kracht, David; Heckel, Reinhard; Bossert, Martin
2011-10-11
Boolean models of regulatory networks are assumed to be tolerant to perturbations. That qualitatively implies that each function can only depend on a few nodes. Biologically motivated constraints further show that functions found in Boolean regulatory networks belong to certain classes of functions, for example, the unate functions. It turns out that these classes have specific properties in the Fourier domain. That motivates us to study the problem of detecting controlling nodes in classes of Boolean networks using spectral techniques. We consider networks with unbalanced functions and functions of an average sensitivity less than 23k, where k is the number of controlling variables for a function. Further, we consider the class of 1-low networks which include unate networks, linear threshold networks, and networks with nested canalyzing functions. We show that the application of spectral learning algorithms leads to both better time and sample complexity for the detection of controlling nodes compared with algorithms based on exhaustive search. For a particular algorithm, we state analytical upper bounds on the number of samples needed to find the controlling nodes of the Boolean functions. Further, improved algorithms for detecting controlling nodes in large-scale unate networks are given and numerically studied.
Boolean networks with robust and reliable trajectories
Schmal, Christoph; Peixoto, Tiago P.; Drossel, Barbara
2010-11-01
We construct and investigate Boolean networks that follow a given reliable trajectory in state space, which is insensitive to fluctuations in the updating schedule and which is also robust against noise. Robustness is quantified as the probability that the dynamics return to the reliable trajectory after a perturbation of the state of a single node. In order to achieve high robustness, we navigate through the space of possible update functions by using an evolutionary algorithm. We constrain the networks to those having the minimum number of connections required to obtain the reliable trajectory. Surprisingly, we find that robustness always reaches values close to 100% during the evolutionary optimization process. The set of update functions can be evolved such that it differs only slightly from that of networks that were not optimized with respect to robustness. The state space of the optimized networks is dominated by the basin of attraction of the reliable trajectory.
Boolean networks with robust and reliable trajectories
Energy Technology Data Exchange (ETDEWEB)
Schmal, Christoph; Peixoto, Tiago P; Drossel, Barbara, E-mail: schmal@physik.uni-bielefeld.d, E-mail: tiago@fkp.tu-darmstadt.d, E-mail: drossel@fkp.tu-darmstadt.d [Institut fuer Festkoerperphysik, TU Darmstadt, Hochschulstrasse 6, 64289 Darmstadt (Germany)
2010-11-15
We construct and investigate Boolean networks that follow a given reliable trajectory in state space, which is insensitive to fluctuations in the updating schedule and which is also robust against noise. Robustness is quantified as the probability that the dynamics return to the reliable trajectory after a perturbation of the state of a single node. In order to achieve high robustness, we navigate through the space of possible update functions by using an evolutionary algorithm. We constrain the networks to those having the minimum number of connections required to obtain the reliable trajectory. Surprisingly, we find that robustness always reaches values close to 100% during the evolutionary optimization process. The set of update functions can be evolved such that it differs only slightly from that of networks that were not optimized with respect to robustness. The state space of the optimized networks is dominated by the basin of attraction of the reliable trajectory.
The value of less connected agents in Boolean networks
Epstein, Daniel; Bazzan, Ana L. C.
2013-11-01
In multiagent systems, agents often face binary decisions where one seeks to take either the minority or the majority side. Examples are minority and congestion games in general, i.e., situations that require coordination among the agents in order to depict efficient decisions. In minority games such as the El Farol Bar Problem, previous works have shown that agents may reach appropriate levels of coordination, mostly by looking at the history of past decisions. Not many works consider any kind of structure of the social network, i.e., how agents are connected. Moreover, when structure is indeed considered, it assumes some kind of random network with a given, fixed connectivity degree. The present paper departs from the conventional approach in some ways. First, it considers more realistic network topologies, based on preferential attachments. This is especially useful in social networks. Second, the formalism of random Boolean networks is used to help agents to make decisions given their attachments (for example acquaintances). This is coupled with a reinforcement learning mechanism that allows agents to select strategies that are locally and globally efficient. Third, we use agent-based modeling and simulation, a microscopic approach, which allows us to draw conclusions about individuals and/or classes of individuals. Finally, for the sake of illustration we use two different scenarios, namely the El Farol Bar Problem and a binary route choice scenario. With this approach we target systems that adapt dynamically to changes in the environment, including other adaptive decision-makers. Our results using preferential attachments and random Boolean networks are threefold. First we show that an efficient equilibrium can be achieved, provided agents do experimentation. Second, microscopic analysis show that influential agents tend to consider few inputs in their Boolean functions. Third, we have also conducted measurements related to network clustering and centrality
A full bayesian approach for boolean genetic network inference.
Directory of Open Access Journals (Sweden)
Shengtong Han
Full Text Available Boolean networks are a simple but efficient model for describing gene regulatory systems. A number of algorithms have been proposed to infer Boolean networks. However, these methods do not take full consideration of the effects of noise and model uncertainty. In this paper, we propose a full Bayesian approach to infer Boolean genetic networks. Markov chain Monte Carlo algorithms are used to obtain the posterior samples of both the network structure and the related parameters. In addition to regular link addition and removal moves, which can guarantee the irreducibility of the Markov chain for traversing the whole network space, carefully constructed mixture proposals are used to improve the Markov chain Monte Carlo convergence. Both simulations and a real application on cell-cycle data show that our method is more powerful than existing methods for the inference of both the topology and logic relations of the Boolean network from observed data.
optPBN: an optimisation toolbox for probabilistic Boolean networks.
Trairatphisan, Panuwat; Mizera, Andrzej; Pang, Jun; Tantar, Alexandru Adrian; Sauter, Thomas
2014-01-01
There exist several computational tools which allow for the optimisation and inference of biological networks using a Boolean formalism. Nevertheless, the results from such tools yield only limited quantitative insights into the complexity of biological systems because of the inherited qualitative nature of Boolean networks. We introduce optPBN, a Matlab-based toolbox for the optimisation of probabilistic Boolean networks (PBN) which operates under the framework of the BN/PBN toolbox. optPBN offers an easy generation of probabilistic Boolean networks from rule-based Boolean model specification and it allows for flexible measurement data integration from multiple experiments. Subsequently, optPBN generates integrated optimisation problems which can be solved by various optimisers. In term of functionalities, optPBN allows for the construction of a probabilistic Boolean network from a given set of potential constitutive Boolean networks by optimising the selection probabilities for these networks so that the resulting PBN fits experimental data. Furthermore, the optPBN pipeline can also be operated on large-scale computational platforms to solve complex optimisation problems. Apart from exemplary case studies which we correctly inferred the original network, we also successfully applied optPBN to study a large-scale Boolean model of apoptosis where it allows identifying the inverse correlation between UVB irradiation, NFκB and Caspase 3 activations, and apoptosis in primary hepatocytes quantitatively. Also, the results from optPBN help elucidating the relevancy of crosstalk interactions in the apoptotic network. The optPBN toolbox provides a simple yet comprehensive pipeline for integrated optimisation problem generation in the PBN formalism that can readily be solved by various optimisers on local or grid-based computational platforms. optPBN can be further applied to various biological studies such as the inference of gene regulatory networks or the identification
The stability of Boolean network with transmission sensitivity
Wang, Jiannan; Guo, Binghui; Wei, Wei; Mi, Zhilong; Yin, Ziqiao; Zheng, Zhiming
2017-09-01
Boolean network has been widely used in modeling biological systems and one of the key problems is its stability in response to small perturbations. Based on the hypothesis that the states of all nodes are homogenously updated, great progress has been made in previous works. In real biological networks, however, the updates of genes typically show much heterogeneity. To address such conditions, we introduce transmission sensitivity into Boolean network model. By the method of semi-annealed approximation, we illustrate that in a homogenous network, the critical condition of stability has no connection with its transmission sensitivity. As for heterogeneous networks, it reveals that correlations between network topology and transmission sensitivity can have profound effects on the its stability. This result shows a new mechanism that affects the stability of Boolean network, which could be used to control the dynamics in real biological systems.
Algebraic model checking for Boolean gene regulatory networks.
Tran, Quoc-Nam
2011-01-01
We present a computational method in which modular and Groebner bases (GB) computation in Boolean rings are used for solving problems in Boolean gene regulatory networks (BN). In contrast to other known algebraic approaches, the degree of intermediate polynomials during the calculation of Groebner bases using our method will never grow resulting in a significant improvement in running time and memory space consumption. We also show how calculation in temporal logic for model checking can be done by means of our direct and efficient Groebner basis computation in Boolean rings. We present our experimental results in finding attractors and control strategies of Boolean networks to illustrate our theoretical arguments. The results are promising. Our algebraic approach is more efficient than the state-of-the-art model checker NuSMV on BNs. More importantly, our approach finds all solutions for the BN problems.
Piecewise linear and Boolean models of chemical reaction networks.
Veliz-Cuba, Alan; Kumar, Ajit; Josić, Krešimir
2014-12-01
Models of biochemical networks are frequently complex and high-dimensional. Reduction methods that preserve important dynamical properties are therefore essential for their study. Interactions in biochemical networks are frequently modeled using Hill functions ([Formula: see text]). Reduced ODEs and Boolean approximations of such model networks have been studied extensively when the exponent [Formula: see text] is large. However, while the case of small constant [Formula: see text] appears in practice, it is not well understood. We provide a mathematical analysis of this limit and show that a reduction to a set of piecewise linear ODEs and Boolean networks can be mathematically justified. The piecewise linear systems have closed-form solutions that closely track those of the fully nonlinear model. The simpler, Boolean network can be used to study the qualitative behavior of the original system. We justify the reduction using geometric singular perturbation theory and compact convergence, and illustrate the results in network models of a toggle switch and an oscillator.
Dynamic network-based epistasis analysis: Boolean examples
Directory of Open Access Journals (Sweden)
Eugenio eAzpeitia
2011-12-01
Full Text Available In this review we focus on how the hierarchical and single-path assumptions of epistasis analysis can bias the topologies of gene interactions infered. This has been acknowledged in several previous papers and reviews, but here we emphasize the critical importance of dynamic analyses, and specifically illustrate the use of Boolean network models. Epistasis in a broad sense refers to gene interactions, however, as originally proposed by Bateson (herein, classical epistasis, defined as the blocking of a particular allelic effect due to the effect of another allele at a different locus. Classical epistasis analysis has proven powerful and useful, allowing researchers to infer and assign directionality to gene interactions. As larger data sets are becoming available, the analysis of classical epistasis is being complemented with computer science tools and system biology approaches. We show that when the hierarchical and single-path assumptions are not met in classical epistasis analysis, the access to relevant information and the correct gene interaction topologies are hindered, and it becomes necessary to consider the temporal dynamics of gene interactions. The use of dynamical networks can overcome these limitations. We particularly focus on the use of Boolean networks that, like classical epistasis analysis, relies on logical formalisms, and hence can complement classical epistasis analysis and relax its assumptions. We develop a couple of theoretical examples and analyze them from a dynamic Boolean network model perspective. Boolean networks could help to guide additional experiments and discern among alternative regulatory schemes that would be impossible or difficult to infer without the elimination of these assumption from the classical epistasis analysis. We also use examples from the literature to show how a Boolean network-based approach has resolved ambiguities and guided epistasis analysis. Our review complements previous accounts, not
Aggregation algorithm towards large-scale Boolean network analysis
Zhao, Y.; Kim, J.; Filippone, M.
2013-01-01
The analysis of large-scale Boolean network dynamics is of great importance in understanding complex phenomena where systems are characterized by a large number of components. The computational cost to reveal the number of attractors and the period of each attractor increases exponentially as the number of nodes in the networks increases. This paper presents an efficient algorithm to find attractors for medium to large-scale networks. This is achieved by analyzing subnetworks within the netwo...
Estimation of delays in generalized asynchronous Boolean networks.
Das, Haimabati; Layek, Ritwik Kumar
2016-10-20
A new generalized asynchronous Boolean network (GABN) model has been proposed in this paper. This continuous-time discrete-state model captures the biological reality of cellular dynamics without compromising the computational efficiency of the Boolean framework. The GABN synthesis procedure is based on the prior knowledge of the logical structure of the regulatory network, and the experimental transcriptional parameters. The novelty of the proposed methodology lies in considering different delays associated with the activation and deactivation of a particular protein (especially the transcription factors). A few illustrative examples of some well-studied network motifs have been provided to explore the scope of using the GABN model for larger networks. The GABN model of the p53-signaling pathway in response to γ-irradiation has also been simulated in the current paper to provide an indirect validation of the proposed schema.
Algorithms for Finding Small Attractors in Boolean Networks
Directory of Open Access Journals (Sweden)
Hayashida Morihiro
2007-01-01
Full Text Available A Boolean network is a model used to study the interactions between different genes in genetic regulatory networks. In this paper, we present several algorithms using gene ordering and feedback vertex sets to identify singleton attractors and small attractors in Boolean networks. We analyze the average case time complexities of some of the proposed algorithms. For instance, it is shown that the outdegree-based ordering algorithm for finding singleton attractors works in time for , which is much faster than the naive time algorithm, where is the number of genes and is the maximum indegree. We performed extensive computational experiments on these algorithms, which resulted in good agreement with theoretical results. In contrast, we give a simple and complete proof for showing that finding an attractor with the shortest period is NP-hard.
Approximating Attractors of Boolean Networks by Iterative CTL Model Checking.
Klarner, Hannes; Siebert, Heike
2015-01-01
This paper introduces the notion of approximating asynchronous attractors of Boolean networks by minimal trap spaces. We define three criteria for determining the quality of an approximation: "faithfulness" which requires that the oscillating variables of all attractors in a trap space correspond to their dimensions, "univocality" which requires that there is a unique attractor in each trap space, and "completeness" which requires that there are no attractors outside of a given set of trap spaces. Each is a reachability property for which we give equivalent model checking queries. Whereas faithfulness and univocality can be decided by model checking the corresponding subnetworks, the naive query for completeness must be evaluated on the full state space. Our main result is an alternative approach which is based on the iterative refinement of an initially poor approximation. The algorithm detects so-called autonomous sets in the interaction graph, variables that contain all their regulators, and considers their intersection and extension in order to perform model checking on the smallest possible state spaces. A benchmark, in which we apply the algorithm to 18 published Boolean networks, is given. In each case, the minimal trap spaces are faithful, univocal, and complete, which suggests that they are in general good approximations for the asymptotics of Boolean networks.
Stability of functions in Boolean models of gene regulatory networks
Rämö, Pauli; Kesseli, Juha; Yli-Harja, Olli
2005-09-01
Boolean networks are used to model large nonlinear systems such as gene regulatory networks. We will present results that can be used to understand how the choice of functions affects the network dynamics. The so called bias-map and its fixed points depict much of the function's dynamical role in the network. We define the concept of stabilizing functions and show that many Post and canalizing functions are also stabilizing functions. Boolean networks constructed using the same type of stabilizing functions are always stable regardless of the average in-degree of network functions. We derive the number of all stabilizing functions and find it to be much larger than the number of Post and canalizing functions. We also discuss the implementation of functions and apply the presented results to biological data that give an approximation of the distribution of regulatory functions in eucaryotic cells. We find that the obtained theoretical results on the number of active genes are biologically plausible. Finally, based on the presented results, we discuss why canalizing and Post regulatory functions seem to be common in cells.
State feedback controller design for the synchronization of Boolean networks with time delays
Li, Fangfei; Li, Jianning; Shen, Lijuan
2018-01-01
State feedback control design to make the response Boolean network synchronize with the drive Boolean network is far from being solved in the literature. Motivated by this, this paper studies the feedback control design for the complete synchronization of two coupled Boolean networks with time delays. A necessary condition for the existence of a state feedback controller is derived first. Then the feedback control design procedure for the complete synchronization of two coupled Boolean networks is provided based on the necessary condition. Finally, an example is given to illustrate the proposed design procedure.
Adaptive parallel logic networks
Martinez, Tony R.; Vidal, Jacques J.
1988-01-01
Adaptive, self-organizing concurrent systems (ASOCS) that combine self-organization with massive parallelism for such applications as adaptive logic devices, robotics, process control, and system malfunction management, are presently discussed. In ASOCS, an adaptive network composed of many simple computing elements operating in combinational and asynchronous fashion is used and problems are specified by presenting if-then rules to the system in the form of Boolean conjunctions. During data processing, which is a different operational phase from adaptation, the network acts as a parallel hardware circuit.
Synchronization Analysis of Master-Slave Probabilistic Boolean Networks.
Lu, Jianquan; Zhong, Jie; Li, Lulu; Ho, Daniel W C; Cao, Jinde
2015-08-28
In this paper, we analyze the synchronization problem of master-slave probabilistic Boolean networks (PBNs). The master Boolean network (BN) is a deterministic BN, while the slave BN is determined by a series of possible logical functions with certain probability at each discrete time point. In this paper, we firstly define the synchronization of master-slave PBNs with probability one, and then we investigate synchronization with probability one. By resorting to new approach called semi-tensor product (STP), the master-slave PBNs are expressed in equivalent algebraic forms. Based on the algebraic form, some necessary and sufficient criteria are derived to guarantee synchronization with probability one. Further, we study the synchronization of master-slave PBNs in probability. Synchronization in probability implies that for any initial states, the master BN can be synchronized by the slave BN with certain probability, while synchronization with probability one implies that master BN can be synchronized by the slave BN with probability one. Based on the equivalent algebraic form, some efficient conditions are derived to guarantee synchronization in probability. Finally, several numerical examples are presented to show the effectiveness of the main results.
Expected Number of Fixed Points in Boolean Networks with Arbitrary Topology
Mori, Fumito; Mochizuki, Atsushi
2017-07-01
Boolean network models describe genetic, neural, and social dynamics in complex networks, where the dynamics depend generally on network topology. Fixed points in a genetic regulatory network are typically considered to correspond to cell types in an organism. We prove that the expected number of fixed points in a Boolean network, with Boolean functions drawn from probability distributions that are not required to be uniform or identical, is one, and is independent of network topology if only a feedback arc set satisfies a stochastic neutrality condition. We also demonstrate that the expected number is increased by the predominance of positive feedback in a cycle.
Recent development and biomedical applications of probabilistic Boolean networks
2013-01-01
Probabilistic Boolean network (PBN) modelling is a semi-quantitative approach widely used for the study of the topology and dynamic aspects of biological systems. The combined use of rule-based representation and probability makes PBN appealing for large-scale modelling of biological networks where degrees of uncertainty need to be considered. A considerable expansion of our knowledge in the field of theoretical research on PBN can be observed over the past few years, with a focus on network inference, network intervention and control. With respect to areas of applications, PBN is mainly used for the study of gene regulatory networks though with an increasing emergence in signal transduction, metabolic, and also physiological networks. At the same time, a number of computational tools, facilitating the modelling and analysis of PBNs, are continuously developed. A concise yet comprehensive review of the state-of-the-art on PBN modelling is offered in this article, including a comparative discussion on PBN versus similar models with respect to concepts and biomedical applications. Due to their many advantages, we consider PBN to stand as a suitable modelling framework for the description and analysis of complex biological systems, ranging from molecular to physiological levels. PMID:23815817
Boolean network model predicts cell cycle sequence of fission yeast.
Directory of Open Access Journals (Sweden)
Maria I Davidich
Full Text Available A Boolean network model of the cell-cycle regulatory network of fission yeast (Schizosaccharomyces Pombe is constructed solely on the basis of the known biochemical interaction topology. Simulating the model in the computer faithfully reproduces the known activity sequence of regulatory proteins along the cell cycle of the living cell. Contrary to existing differential equation models, no parameters enter the model except the structure of the regulatory circuitry. The dynamical properties of the model indicate that the biological dynamical sequence is robustly implemented in the regulatory network, with the biological stationary state G1 corresponding to the dominant attractor in state space, and with the biological regulatory sequence being a strongly attractive trajectory. Comparing the fission yeast cell-cycle model to a similar model of the corresponding network in S. cerevisiae, a remarkable difference in circuitry, as well as dynamics is observed. While the latter operates in a strongly damped mode, driven by external excitation, the S. pombe network represents an auto-excited system with external damping.
Robustness and information propagation in attractors of Random Boolean Networks.
Lloyd-Price, Jason; Gupta, Abhishekh; Ribeiro, Andre S
2012-01-01
Attractors represent the long-term behaviors of Random Boolean Networks. We study how the amount of information propagated between the nodes when on an attractor, as quantified by the average pairwise mutual information (I(A)), relates to the robustness of the attractor to perturbations (R(A)). We find that the dynamical regime of the network affects the relationship between I(A) and R(A). In the ordered and chaotic regimes, I(A) is anti-correlated with R(A), implying that attractors that are highly robust to perturbations have necessarily limited information propagation. Between order and chaos (for so-called "critical" networks) these quantities are uncorrelated. Finite size effects cause this behavior to be visible for a range of networks, from having a sensitivity of 1 to the point where I(A) is maximized. In this region, the two quantities are weakly correlated and attractors can be almost arbitrarily robust to perturbations without restricting the propagation of information in the network.
Modeling integrated cellular machinery using hybrid Petri-Boolean networks.
Directory of Open Access Journals (Sweden)
Natalie Berestovsky
Full Text Available The behavior and phenotypic changes of cells are governed by a cellular circuitry that represents a set of biochemical reactions. Based on biological functions, this circuitry is divided into three types of networks, each encoding for a major biological process: signal transduction, transcription regulation, and metabolism. This division has generally enabled taming computational complexity dealing with the entire system, allowed for using modeling techniques that are specific to each of the components, and achieved separation of the different time scales at which reactions in each of the three networks occur. Nonetheless, with this division comes loss of information and power needed to elucidate certain cellular phenomena. Within the cell, these three types of networks work in tandem, and each produces signals and/or substances that are used by the others to process information and operate normally. Therefore, computational techniques for modeling integrated cellular machinery are needed. In this work, we propose an integrated hybrid model (IHM that combines Petri nets and Boolean networks to model integrated cellular networks. Coupled with a stochastic simulation mechanism, the model simulates the dynamics of the integrated network, and can be perturbed to generate testable hypotheses. Our model is qualitative and is mostly built upon knowledge from the literature and requires fine-tuning of very few parameters. We validated our model on two systems: the transcriptional regulation of glucose metabolism in human cells, and cellular osmoregulation in S. cerevisiae. The model produced results that are in very good agreement with experimental data, and produces valid hypotheses. The abstract nature of our model and the ease of its construction makes it a very good candidate for modeling integrated networks from qualitative data. The results it produces can guide the practitioner to zoom into components and interconnections and investigate them
A SAT-based algorithm for finding attractors in synchronous Boolean networks.
Dubrova, Elena; Teslenko, Maxim
2011-01-01
This paper addresses the problem of finding attractors in synchronous Boolean networks. The existing Boolean decision diagram-based algorithms have limited capacity due to the excessive memory requirements of decision diagrams. The simulation-based algorithms can be applied to larger networks, however, they are incomplete. We present an algorithm, which uses a SAT-based bounded model checking to find all attractors in a Boolean network. The efficiency of the presented algorithm is evaluated by analyzing seven networks models of real biological processes, as well as 150,000 randomly generated Boolean networks of sizes between 100 and 7,000. The results show that our approach has a potential to handle an order of magnitude larger models than currently possible.
An Attractor-Based Complexity Measurement for Boolean Recurrent Neural Networks
Cabessa, Jérémie; Villa, Alessandro E. P.
2014-01-01
We provide a novel refined attractor-based complexity measurement for Boolean recurrent neural networks that represents an assessment of their computational power in terms of the significance of their attractor dynamics. This complexity measurement is achieved by first proving a computational equivalence between Boolean recurrent neural networks and some specific class of -automata, and then translating the most refined classification of -automata to the Boolean neural network context. As a result, a hierarchical classification of Boolean neural networks based on their attractive dynamics is obtained, thus providing a novel refined attractor-based complexity measurement for Boolean recurrent neural networks. These results provide new theoretical insights to the computational and dynamical capabilities of neural networks according to their attractive potentialities. An application of our findings is illustrated by the analysis of the dynamics of a simplified model of the basal ganglia-thalamocortical network simulated by a Boolean recurrent neural network. This example shows the significance of measuring network complexity, and how our results bear new founding elements for the understanding of the complexity of real brain circuits. PMID:24727866
An attractor-based complexity measurement for Boolean recurrent neural networks.
Cabessa, Jérémie; Villa, Alessandro E P
2014-01-01
We provide a novel refined attractor-based complexity measurement for Boolean recurrent neural networks that represents an assessment of their computational power in terms of the significance of their attractor dynamics. This complexity measurement is achieved by first proving a computational equivalence between Boolean recurrent neural networks and some specific class of ω-automata, and then translating the most refined classification of ω-automata to the Boolean neural network context. As a result, a hierarchical classification of Boolean neural networks based on their attractive dynamics is obtained, thus providing a novel refined attractor-based complexity measurement for Boolean recurrent neural networks. These results provide new theoretical insights to the computational and dynamical capabilities of neural networks according to their attractive potentialities. An application of our findings is illustrated by the analysis of the dynamics of a simplified model of the basal ganglia-thalamocortical network simulated by a Boolean recurrent neural network. This example shows the significance of measuring network complexity, and how our results bear new founding elements for the understanding of the complexity of real brain circuits.
Inference of a Probabilistic Boolean Network from a Single Observed Temporal Sequence
Directory of Open Access Journals (Sweden)
Xiao Yufei
2007-01-01
Full Text Available The inference of gene regulatory networks is a key issue for genomic signal processing. This paper addresses the inference of probabilistic Boolean networks (PBNs from observed temporal sequences of network states. Since a PBN is composed of a finite number of Boolean networks, a basic observation is that the characteristics of a single Boolean network without perturbation may be determined by its pairwise transitions. Because the network function is fixed and there are no perturbations, a given state will always be followed by a unique state at the succeeding time point. Thus, a transition counting matrix compiled over a data sequence will be sparse and contain only one entry per line. If the network also has perturbations, with small perturbation probability, then the transition counting matrix would have some insignificant nonzero entries replacing some (or all of the zeros. If a data sequence is sufficiently long to adequately populate the matrix, then determination of the functions and inputs underlying the model is straightforward. The difficulty comes when the transition counting matrix consists of data derived from more than one Boolean network. We address the PBN inference procedure in several steps: (1 separate the data sequence into "pure" subsequences corresponding to constituent Boolean networks; (2 given a subsequence, infer a Boolean network; and (3 infer the probabilities of perturbation, the probability of there being a switch between constituent Boolean networks, and the selection probabilities governing which network is to be selected given a switch. Capturing the full dynamic behavior of probabilistic Boolean networks, be they binary or multivalued, will require the use of temporal data, and a great deal of it. This should not be surprising given the complexity of the model and the number of parameters, both transitional and static, that must be estimated. In addition to providing an inference algorithm, this paper
Inference of a Probabilistic Boolean Network from a Single Observed Temporal Sequence
Directory of Open Access Journals (Sweden)
Le Yu
2007-05-01
Full Text Available The inference of gene regulatory networks is a key issue for genomic signal processing. This paper addresses the inference of probabilistic Boolean networks (PBNs from observed temporal sequences of network states. Since a PBN is composed of a finite number of Boolean networks, a basic observation is that the characteristics of a single Boolean network without perturbation may be determined by its pairwise transitions. Because the network function is fixed and there are no perturbations, a given state will always be followed by a unique state at the succeeding time point. Thus, a transition counting matrix compiled over a data sequence will be sparse and contain only one entry per line. If the network also has perturbations, with small perturbation probability, then the transition counting matrix would have some insignificant nonzero entries replacing some (or all of the zeros. If a data sequence is sufficiently long to adequately populate the matrix, then determination of the functions and inputs underlying the model is straightforward. The difficulty comes when the transition counting matrix consists of data derived from more than one Boolean network. We address the PBN inference procedure in several steps: (1 separate the data sequence into Ã‚Â“pureÃ‚Â” subsequences corresponding to constituent Boolean networks; (2 given a subsequence, infer a Boolean network; and (3 infer the probabilities of perturbation, the probability of there being a switch between constituent Boolean networks, and the selection probabilities governing which network is to be selected given a switch. Capturing the full dynamic behavior of probabilistic Boolean networks, be they binary or multivalued, will require the use of temporal data, and a great deal of it. This should not be surprising given the complexity of the model and the number of parameters, both transitional and static, that must be estimated. In addition to providing an inference algorithm
Controllability of Boolean networks via input controls under Harvey's update scheme
Luo, Chao; Zhang, Xiaolin; Shao, Rui; Zheng, YuanJie
2016-02-01
In this article, the controllability of Boolean networks via input controls under Harvey's update scheme is investigated. First, the model of Boolean control networks under Harvey's stochastic update is proposed, by means of semi-tensor product approach, which is converted into discrete-time linear representation. And, a general formula of control-depending network transition matrix is provided. Second, based on discrete-time dynamics, controllability of the proposed model is analytically discussed by revealing the necessary and sufficient conditions of the reachable sets, respectively, for three kinds of controls, i.e., free Boolean control sequence, input control networks, and close-loop control. Examples are showed to demonstrate the effectiveness and feasibility of the proposed scheme.
Veliz-Cuba, Alan; Aguilar, Boris; Hinkelmann, Franziska; Laubenbacher, Reinhard
2014-06-26
A key problem in the analysis of mathematical models of molecular networks is the determination of their steady states. The present paper addresses this problem for Boolean network models, an increasingly popular modeling paradigm for networks lacking detailed kinetic information. For small models, the problem can be solved by exhaustive enumeration of all state transitions. But for larger models this is not feasible, since the size of the phase space grows exponentially with the dimension of the network. The dimension of published models is growing to over 100, so that efficient methods for steady state determination are essential. Several methods have been proposed for large networks, some of them heuristic. While these methods represent a substantial improvement in scalability over exhaustive enumeration, the problem for large networks is still unsolved in general. This paper presents an algorithm that consists of two main parts. The first is a graph theoretic reduction of the wiring diagram of the network, while preserving all information about steady states. The second part formulates the determination of all steady states of a Boolean network as a problem of finding all solutions to a system of polynomial equations over the finite number system with two elements. This problem can be solved with existing computer algebra software. This algorithm compares favorably with several existing algorithms for steady state determination. One advantage is that it is not heuristic or reliant on sampling, but rather determines algorithmically and exactly all steady states of a Boolean network. The code for the algorithm, as well as the test suite of benchmark networks, is available upon request from the corresponding author. The algorithm presented in this paper reliably determines all steady states of sparse Boolean networks with up to 1000 nodes. The algorithm is effective at analyzing virtually all published models even those of moderate connectivity. The problem for
The objective of this work is to elucidate biological networks underlying cellular tipping points using time-course data. We discretized the high-content imaging (HCI) data and inferred Boolean networks (BNs) that could accurately predict dynamic cellular trajectories. We found t...
An efficient algorithm for computing attractors of synchronous and asynchronous Boolean networks.
Zheng, Desheng; Yang, Guowu; Li, Xiaoyu; Wang, Zhicai; Liu, Feng; He, Lei
2013-01-01
Biological networks, such as genetic regulatory networks, often contain positive and negative feedback loops that settle down to dynamically stable patterns. Identifying these patterns, the so-called attractors, can provide important insights for biologists to understand the molecular mechanisms underlying many coordinated cellular processes such as cellular division, differentiation, and homeostasis. Both synchronous and asynchronous Boolean networks have been used to simulate genetic regulatory networks and identify their attractors. The common methods of computing attractors are that start with a randomly selected initial state and finish with exhaustive search of the state space of a network. However, the time complexity of these methods grows exponentially with respect to the number and length of attractors. Here, we build two algorithms to achieve the computation of attractors in synchronous and asynchronous Boolean networks. For the synchronous scenario, combing with iterative methods and reduced order binary decision diagrams (ROBDD), we propose an improved algorithm to compute attractors. For another algorithm, the attractors of synchronous Boolean networks are utilized in asynchronous Boolean translation functions to derive attractors of asynchronous scenario. The proposed algorithms are implemented in a procedure called geneFAtt. Compared to existing tools such as genYsis, geneFAtt is significantly [Formula: see text] faster in computing attractors for empirical experimental systems. The software package is available at https://sites.google.com/site/desheng619/download.
Directory of Open Access Journals (Sweden)
Johan Kerkhofs
Full Text Available Boolean models have been instrumental in predicting general features of gene networks and more recently also as explorative tools in specific biological applications. In this study we introduce a basic quantitative and a limited time resolution to a discrete (Boolean framework. Quantitative resolution is improved through the employ of normalized variables in unison with an additive approach. Increased time resolution stems from the introduction of two distinct priority classes. Through the implementation of a previously published chondrocyte network and T helper cell network, we show that this addition of quantitative and time resolution broadens the scope of biological behaviour that can be captured by the models. Specifically, the quantitative resolution readily allows models to discern qualitative differences in dosage response to growth factors. The limited time resolution, in turn, can influence the reachability of attractors, delineating the likely long term system behaviour. Importantly, the information required for implementation of these features, such as the nature of an interaction, is typically obtainable from the literature. Nonetheless, a trade-off is always present between additional computational cost of this approach and the likelihood of extending the model's scope. Indeed, in some cases the inclusion of these features does not yield additional insight. This framework, incorporating increased and readily available time and semi-quantitative resolution, can help in substantiating the litmus test of dynamics for gene networks, firstly by excluding unlikely dynamics and secondly by refining falsifiable predictions on qualitative behaviour.
Kerkhofs, Johan; Geris, Liesbet
2015-01-01
Boolean models have been instrumental in predicting general features of gene networks and more recently also as explorative tools in specific biological applications. In this study we introduce a basic quantitative and a limited time resolution to a discrete (Boolean) framework. Quantitative resolution is improved through the employ of normalized variables in unison with an additive approach. Increased time resolution stems from the introduction of two distinct priority classes. Through the implementation of a previously published chondrocyte network and T helper cell network, we show that this addition of quantitative and time resolution broadens the scope of biological behaviour that can be captured by the models. Specifically, the quantitative resolution readily allows models to discern qualitative differences in dosage response to growth factors. The limited time resolution, in turn, can influence the reachability of attractors, delineating the likely long term system behaviour. Importantly, the information required for implementation of these features, such as the nature of an interaction, is typically obtainable from the literature. Nonetheless, a trade-off is always present between additional computational cost of this approach and the likelihood of extending the model's scope. Indeed, in some cases the inclusion of these features does not yield additional insight. This framework, incorporating increased and readily available time and semi-quantitative resolution, can help in substantiating the litmus test of dynamics for gene networks, firstly by excluding unlikely dynamics and secondly by refining falsifiable predictions on qualitative behaviour.
Analysis and control of Boolean networks a semi-tensor product approach
Cheng, Daizhan; Li, Zhiqiang
2010-01-01
This book presents a new approach to the investigation of Boolean control networks, using the semi-tensor product (STP), which can express a logical function as a conventional discrete-time linear system. This makes it possible to analyze basic control problems.
Reverse engineering Boolean networks: from Bernoulli mixture models to rule based systems.
Saeed, Mehreen; Ijaz, Maliha; Javed, Kashif; Babri, Haroon Atique
2012-01-01
A Boolean network is a graphical model for representing and analyzing the behavior of gene regulatory networks (GRN). In this context, the accurate and efficient reconstruction of a Boolean network is essential for understanding the gene regulation mechanism and the complex relations that exist therein. In this paper we introduce an elegant and efficient algorithm for the reverse engineering of Boolean networks from a time series of multivariate binary data corresponding to gene expression data. We call our method ReBMM, i.e., reverse engineering based on Bernoulli mixture models. The time complexity of most of the existing reverse engineering techniques is quite high and depends upon the indegree of a node in the network. Due to the high complexity of these methods, they can only be applied to sparsely connected networks of small sizes. ReBMM has a time complexity factor, which is independent of the indegree of a node and is quadratic in the number of nodes in the network, a big improvement over other techniques and yet there is little or no compromise in accuracy. We have tested ReBMM on a number of artificial datasets along with simulated data derived from a plant signaling network. We also used this method to reconstruct a network from real experimental observations of microarray data of the yeast cell cycle. Our method provides a natural framework for generating rules from a probabilistic model. It is simple, intuitive and illustrates excellent empirical results.
Zhang, Rui; de S Cavalcante, Hugo L D; Gao, Zheng; Gauthier, Daniel J; Socolar, Joshua E S; Adams, Matthew M; Lathrop, Daniel P
2009-10-01
We observe deterministic chaos in a simple network of electronic logic gates that are not regulated by a clocking signal. The resulting power spectrum is ultrawide band, extending from dc to beyond 2 GHz. The observed behavior is reproduced qualitatively using an autonomously updating Boolean model with signal propagation times that depend on the recent history of the gates and filtering of pulses of short duration, whose presence is confirmed experimentally. Electronic Boolean chaos may find application as an ultrawide-band source of radio waves.
Identification of control targets in Boolean molecular network models via computational algebra.
Murrugarra, David; Veliz-Cuba, Alan; Aguilar, Boris; Laubenbacher, Reinhard
2016-09-23
Many problems in biomedicine and other areas of the life sciences can be characterized as control problems, with the goal of finding strategies to change a disease or otherwise undesirable state of a biological system into another, more desirable, state through an intervention, such as a drug or other therapeutic treatment. The identification of such strategies is typically based on a mathematical model of the process to be altered through targeted control inputs. This paper focuses on processes at the molecular level that determine the state of an individual cell, involving signaling or gene regulation. The mathematical model type considered is that of Boolean networks. The potential control targets can be represented by a set of nodes and edges that can be manipulated to produce a desired effect on the system. This paper presents a method for the identification of potential intervention targets in Boolean molecular network models using algebraic techniques. The approach exploits an algebraic representation of Boolean networks to encode the control candidates in the network wiring diagram as the solutions of a system of polynomials equations, and then uses computational algebra techniques to find such controllers. The control methods in this paper are validated through the identification of combinatorial interventions in the signaling pathways of previously reported control targets in two well studied systems, a p53-mdm2 network and a blood T cell lymphocyte granular leukemia survival signaling network. Supplementary data is available online and our code in Macaulay2 and Matlab are available via http://www.ms.uky.edu/~dmu228/ControlAlg . This paper presents a novel method for the identification of intervention targets in Boolean network models. The results in this paper show that the proposed methods are useful and efficient for moderately large networks.
PyBoolNet: a python package for the generation, analysis and visualization of boolean networks.
Klarner, Hannes; Streck, Adam; Siebert, Heike
2017-03-01
The goal of this project is to provide a simple interface to working with Boolean networks. Emphasis is put on easy access to a large number of common tasks including the generation and manipulation of networks, attractor and basin computation, model checking and trap space computation, execution of established graph algorithms as well as graph drawing and layouts. P y B ool N et is a Python package for working with Boolean networks that supports simple access to model checking via N u SMV, standard graph algorithms via N etwork X and visualization via dot . In addition, state of the art attractor computation exploiting P otassco ASP is implemented. The package is function-based and uses only native Python and N etwork X data types. https://github.com/hklarner/PyBoolNet. hannes.klarner@fu-berlin.de.
Ching, Wai-Ki; Zhang, Shuqin; Ng, Michael K; Akutsu, Tatsuya
2007-06-15
Probabilistic Boolean networks (PBNs) have been proposed to model genetic regulatory interactions. The steady-state probability distribution of a PBN gives important information about the captured genetic network. The computation of the steady-state probability distribution usually includes construction of the transition probability matrix and computation of the steady-state probability distribution. The size of the transition probability matrix is 2(n)-by-2(n) where n is the number of genes in the genetic network. Therefore, the computational costs of these two steps are very expensive and it is essential to develop a fast approximation method. In this article, we propose an approximation method for computing the steady-state probability distribution of a PBN based on neglecting some Boolean networks (BNs) with very small probabilities during the construction of the transition probability matrix. An error analysis of this approximation method is given and theoretical result on the distribution of BNs in a PBN with at most two Boolean functions for one gene is also presented. These give a foundation and support for the approximation method. Numerical experiments based on a genetic network are given to demonstrate the efficiency of the proposed method.
Neural Networks Retrieving Boolean Patterns in a Sea of Gaussian Ones
Agliari, Elena; Barra, Adriano; Longo, Chiara; Tantari, Daniele
2017-09-01
Restricted Boltzmann machines are key tools in machine learning and are described by the energy function of bipartite spin-glasses. From a statistical mechanical perspective, they share the same Gibbs measure of Hopfield networks for associative memory. In this equivalence, weights in the former play as patterns in the latter. As Boltzmann machines usually require real weights to be trained with gradient-descent-like methods, while Hopfield networks typically store binary patterns to be able to retrieve, the investigation of a mixed Hebbian network, equipped with both real (e.g., Gaussian) and discrete (e.g., Boolean) patterns naturally arises. We prove that, in the challenging regime of a high storage of real patterns, where retrieval is forbidden, an additional load of Boolean patterns can still be retrieved, as long as the ratio between the overall load and the network size does not exceed a critical threshold, that turns out to be the same of the standard Amit-Gutfreund-Sompolinsky theory. Assuming replica symmetry, we study the case of a low load of Boolean patterns combining the stochastic stability and Hamilton-Jacobi interpolating techniques. The result can be extended to the high load by a non rigorous but standard replica computation argument.
Exploring candidate biological functions by Boolean Function Networks for Saccharomyces cerevisiae.
Directory of Open Access Journals (Sweden)
Maria Simak
Full Text Available The great amount of gene expression data has brought a big challenge for the discovery of Gene Regulatory Network (GRN. For network reconstruction and the investigation of regulatory relations, it is desirable to ensure directness of links between genes on a map, infer their directionality and explore candidate biological functions from high-throughput transcriptomic data. To address these problems, we introduce a Boolean Function Network (BFN model based on techniques of hidden Markov model (HMM, likelihood ratio test and Boolean logic functions. BFN consists of two consecutive tests to establish links between pairs of genes and check their directness. We evaluate the performance of BFN through the application to S. cerevisiae time course data. BFN produces regulatory relations which show consistency with succession of cell cycle phases. Furthermore, it also improves sensitivity and specificity when compared with alternative methods of genetic network reverse engineering. Moreover, we demonstrate that BFN can provide proper resolution for GO enrichment of gene sets. Finally, the Boolean functions discovered by BFN can provide useful insights for the identification of control mechanisms of regulatory processes, which is the special advantage of the proposed approach. In combination with low computational complexity, BFN can serve as an efficient screening tool to reconstruct genes relations on the whole genome level. In addition, the BFN approach is also feasible to a wide range of time course datasets.
Adaptiveness in monotone pseudo-Boolean optimization and stochastic neural computation.
Grossi, Giuliano
2009-08-01
Hopfield neural network (HNN) is a nonlinear computational model successfully applied in finding near-optimal solutions of several difficult combinatorial problems. In many cases, the network energy function is obtained through a learning procedure so that its minima are states falling into a proper subspace (feasible region) of the search space. However, because of the network nonlinearity, a number of undesirable local energy minima emerge from the learning procedure, significantly effecting the network performance. In the neural model analyzed here, we combine both a penalty and a stochastic process in order to enhance the performance of a binary HNN. The penalty strategy allows us to gradually lead the search towards states representing feasible solutions, so avoiding oscillatory behaviors or asymptotically instable convergence. Presence of stochastic dynamics potentially prevents the network to fall into shallow local minima of the energy function, i.e., quite far from global optimum. Hence, for a given fixed network topology, the desired final distribution on the states can be reached by carefully modulating such process. The model uses pseudo-Boolean functions both to express problem constraints and cost function; a combination of these two functions is then interpreted as energy of the neural network. A wide variety of NP-hard problems fall in the class of problems that can be solved by the model at hand, particularly those having a monotonic quadratic pseudo-Boolean function as constraint function. That is, functions easily derived by closed algebraic expressions representing the constraint structure and easy (polynomial time) to maximize. We show the asymptotic convergence properties of this model characterizing its state space distribution at thermal equilibrium in terms of Markov chain and give evidence of its ability to find high quality solutions on benchmarks and randomly generated instances of two specific problems taken from the computational graph
Steady-State Analysis of Genetic Regulatory Networks Modelled by Probabilistic Boolean Networks
Directory of Open Access Journals (Sweden)
Wei Zhang
2006-04-01
Full Text Available Probabilistic Boolean networks (PBNs have recently been introduced as a promising class of models of genetic regulatory networks. The dynamic behaviour of PBNs can be analysed in the context of Markov chains. A key goal is the determination of the steady-state (long-run behaviour of a PBN by analysing the corresponding Markov chain. This allows one to compute the long-term influence of a gene on another gene or determine the long-term joint probabilistic behaviour of a few selected genes. Because matrix-based methods quickly become prohibitive for large sizes of networks, we propose the use of Monte Carlo methods. However, the rate of convergence to the stationary distribution becomes a central issue. We discuss several approaches for determining the number of iterations necessary to achieve convergence of the Markov chain corresponding to a PBN. Using a recently introduced method based on the theory of two-state Markov chains, we illustrate the approach on a sub-network designed from human glioma gene expression data and determine the joint steadystate probabilities for several groups of genes.
Hong, Changki; Hwang, Jeewon; Cho, Kwang-Hyun; Shin, Insik
2015-01-01
Boolean networks have been widely used to model biological processes lacking detailed kinetic information. Despite their simplicity, Boolean network dynamics can still capture some important features of biological systems such as stable cell phenotypes represented by steady states. For small models, steady states can be determined through exhaustive enumeration of all state transitions. As the number of nodes increases, however, the state space grows exponentially thus making it difficult to find steady states. Over the last several decades, many studies have addressed how to handle such a state space explosion. Recently, increasing attention has been paid to a satisfiability solving algorithm due to its potential scalability to handle large networks. Meanwhile, there still lies a problem in the case of large models with high maximum node connectivity where the satisfiability solving algorithm is known to be computationally intractable. To address the problem, this paper presents a new partitioning-based method that breaks down a given network into smaller subnetworks. Steady states of each subnetworks are identified by independently applying the satisfiability solving algorithm. Then, they are combined to construct the steady states of the overall network. To efficiently apply the satisfiability solving algorithm to each subnetwork, it is crucial to find the best partition of the network. In this paper, we propose a method that divides each subnetwork to be smallest in size and lowest in maximum node connectivity. This minimizes the total cost of finding all steady states in entire subnetworks. The proposed algorithm is compared with others for steady states identification through a number of simulations on both published small models and randomly generated large models with differing maximum node connectivities. The simulation results show that our method can scale up to several hundreds of nodes even for Boolean networks with high maximum node connectivity. The
Evolution of a designless nanoparticle network into reconfigurable Boolean logic
Bose, Saurabh; Lawrence, Celestine Preetham; Liu, Zhihua; Makarenko, K.S.; van Damme, Rudolf M.J.; Broersma, Haitze J.; van der Wiel, Wilfred Gerard
2015-01-01
Natural computers exploit the emergent properties and massive parallelism of interconnected networks of locally active components. Evolution has resulted in systems that compute quickly and that use energy efficiently, utilizing whatever physical properties are exploitable. Man-made computers, on
Lu, Wei; Tamura, Takeyuki; Song, Jiangning; Akutsu, Tatsuya
2014-01-01
In this paper, we consider the Minimum Reaction Insertion (MRI) problem for finding the minimum number of additional reactions from a reference metabolic network to a host metabolic network so that a target compound becomes producible in the revised host metabolic network in a Boolean model. Although a similar problem for larger networks is solvable in a flux balance analysis (FBA)-based model, the solution of the FBA-based model tends to include more reactions than that of the Boolean model. However, solving MRI using the Boolean model is computationally more expensive than using the FBA-based model since the Boolean model needs more integer variables. Therefore, in this study, to solve MRI for larger networks in the Boolean model, we have developed an efficient Integer Programming formalization method in which the number of integer variables is reduced by the notion of feedback vertex set and minimal valid assignment. As a result of computer experiments conducted using the data of metabolic networks of E. coli and reference networks downloaded from the Kyoto Encyclopedia of Genes and Genomes (KEGG) database, we have found that the developed method can appropriately solve MRI in the Boolean model and is applicable to large scale-networks for which an exhaustive search does not work. We have also compared the developed method with the existing connectivity-based methods and FBA-based methods, and show the difference between the solutions of our method and the existing methods. A theoretical analysis of MRI is also conducted, and the NP-completeness of MRI is proved in the Boolean model. Our developed software is available at "http://sunflower.kuicr.kyoto-u.ac.jp/~rogi/minRect/minRect.html."
Li, X Y; Yang, G W; Zheng, D S; Guo, W S; Hung, W N N
2015-04-28
Genetic regulatory networks are the key to understanding biochemical systems. One condition of the genetic regulatory network under different living environments can be modeled as a synchronous Boolean network. The attractors of these Boolean networks will help biologists to identify determinant and stable factors. Existing methods identify attractors based on a random initial state or the entire state simultaneously. They cannot identify the fixed length attractors directly. The complexity of including time increases exponentially with respect to the attractor number and length of attractors. This study used the bounded model checking to quickly locate fixed length attractors. Based on the SAT solver, we propose a new algorithm for efficiently computing the fixed length attractors, which is more suitable for large Boolean networks and numerous attractors' networks. After comparison using the tool BooleNet, empirical experiments involving biochemical systems demonstrated the feasibility and efficiency of our approach.
Inference of biological pathway from gene expression profiles by time delay boolean networks.
Directory of Open Access Journals (Sweden)
Tung-Hung Chueh
Full Text Available One great challenge of genomic research is to efficiently and accurately identify complex gene regulatory networks. The development of high-throughput technologies provides numerous experimental data such as DNA sequences, protein sequence, and RNA expression profiles makes it possible to study interactions and regulations among genes or other substance in an organism. However, it is crucial to make inference of genetic regulatory networks from gene expression profiles and protein interaction data for systems biology. This study will develop a new approach to reconstruct time delay boolean networks as a tool for exploring biological pathways. In the inference strategy, we will compare all pairs of input genes in those basic relationships by their corresponding p-scores for every output gene. Then, we will combine those consistent relationships to reveal the most probable relationship and reconstruct the genetic network. Specifically, we will prove that O(log n state transition pairs are sufficient and necessary to reconstruct the time delay boolean network of n nodes with high accuracy if the number of input genes to each gene is bounded. We also have implemented this method on simulated and empirical yeast gene expression data sets. The test results show that this proposed method is extensible for realistic networks.
Directory of Open Access Journals (Sweden)
Claudia Stötzel
Full Text Available In this paper, we present a systematic transition scheme for a large class of ordinary differential equations (ODEs into Boolean networks. Our transition scheme can be applied to any system of ODEs whose right hand sides can be written as sums and products of monotone functions. It performs an Euler-like step which uses the signs of the right hand sides to obtain the Boolean update functions for every variable of the corresponding discrete model. The discrete model can, on one hand, be considered as another representation of the biological system or, alternatively, it can be used to further the analysis of the original ODE model. Since the generic transformation method does not guarantee any property conservation, a subsequent validation step is required. Depending on the purpose of the model this step can be based on experimental data or ODE simulations and characteristics. Analysis of the resulting Boolean model, both on its own and in comparison with the ODE model, then allows to investigate system properties not accessible in a purely continuous setting. The method is exemplarily applied to a previously published model of the bovine estrous cycle, which leads to new insights regarding the regulation among the components, and also indicates strongly that the system is tailored to generate stable oscillations.
Dorier, Julien; Crespo, Isaac; Niknejad, Anne; Liechti, Robin; Ebeling, Martin; Xenarios, Ioannis
2016-10-06
Prior knowledge networks (PKNs) provide a framework for the development of computational biological models, including Boolean models of regulatory networks which are the focus of this work. PKNs are created by a painstaking process of literature curation, and generally describe all relevant regulatory interactions identified using a variety of experimental conditions and systems, such as specific cell types or tissues. Certain of these regulatory interactions may not occur in all biological contexts of interest, and their presence may dramatically change the dynamical behaviour of the resulting computational model, hindering the elucidation of the underlying mechanisms and reducing the usefulness of model predictions. Methods are therefore required to generate optimized contextual network models from generic PKNs. We developed a new approach to generate and optimize Boolean networks, based on a given PKN. Using a genetic algorithm, a model network is built as a sub-network of the PKN and trained against experimental data to reproduce the experimentally observed behaviour in terms of attractors and the transitions that occur between them under specific perturbations. The resulting model network is therefore contextualized to the experimental conditions and constitutes a dynamical Boolean model closer to the observed biological process used to train the model than the original PKN. Such a model can then be interrogated to simulate response under perturbation, to detect stable states and their properties, to get insights into the underlying mechanisms and to generate new testable hypotheses. Generic PKNs attempt to synthesize knowledge of all interactions occurring in a biological process of interest, irrespective of the specific biological context. This limits their usefulness as a basis for the development of context-specific, predictive dynamical Boolean models. The optimization method presented in this article produces specific, contextualized models from generic
Szallasi, Zoltan; Liang, Shoudan
2000-01-01
In this paper we show how Boolean genetic networks could be used to address complex problems in cancer biology. First, we describe a general strategy to generate Boolean genetic networks that incorporate all relevant biochemical and physiological parameters and cover all of their regulatory interactions in a deterministic manner. Second, we introduce 'realistic Boolean genetic networks' that produce time series measurements very similar to those detected in actual biological systems. Third, we outline a series of essential questions related to cancer biology and cancer therapy that could be addressed by the use of 'realistic Boolean genetic network' modeling.
Altered Micro-RNA Degradation Promotes Tumor Heterogeneity: A Result from Boolean Network Modeling.
Wu, Yunyi; Krueger, Gerhard R F; Wang, Guanyu
2016-02-01
Cancer heterogeneity may reflect differential dynamical outcomes of the regulatory network encompassing biomolecules at both transcriptional and post-transcriptional levels. In other words, differential gene-expression profiles may correspond to different stable steady states of a mathematical model for simulation of biomolecular networks. To test this hypothesis, we simplified a regulatory network that is important for soft-tissue sarcoma metastasis and heterogeneity, comprising of transcription factors, micro-RNAs, and signaling components of the NOTCH pathway. We then used a Boolean network model to simulate the dynamics of this network, and particularly investigated the consequences of differential miRNA degradation modes. We found that efficient miRNA degradation is crucial for sustaining a homogenous and healthy phenotype, while defective miRNA degradation may lead to multiple stable steady states and ultimately to carcinogenesis and heterogeneity. Copyright© 2016 International Institute of Anticancer Research (Dr. John G. Delinassios), All rights reserved.
Variances as order parameter and complexity measure for random Boolean networks
Energy Technology Data Exchange (ETDEWEB)
Luque, Bartolo [Departamento de Matematica Aplicada y EstadIstica, Escuela Superior de Ingenieros Aeronauticos, Universidad Politecnica de Madrid, Plaza Cardenal Cisneros 3, Madrid 28040 (Spain); Ballesteros, Fernando J [Observatori Astronomic, Universitat de Valencia, Ed. Instituts d' Investigacio, Pol. La Coma s/n, E-46980 Paterna, Valencia (Spain); Fernandez, Manuel [Departamento de Matematica Aplicada y EstadIstica, Escuela Superior de Ingenieros Aeronauticos, Universidad Politecnica de Madrid, Plaza Cardenal Cisneros 3, Madrid 28040 (Spain)
2005-02-04
Several order parameters have been considered to predict and characterize the transition between ordered and disordered phases in random Boolean networks, such as the Hamming distance between replicas or the stable core, which have been successfully used. In this work, we propose a natural and clear new order parameter: the temporal variance. We compute its value analytically and compare it with the results of numerical experiments. Finally, we propose a complexity measure based on the compromise between temporal and spatial variances. This new order parameter and its related complexity measure can be easily applied to other complex systems.
Damage Spreading in Spatial and Small-world Random Boolean Networks
Energy Technology Data Exchange (ETDEWEB)
Lu, Qiming [Fermilab; Teuscher, Christof [Portland State U.
2014-02-18
The study of the response of complex dynamical social, biological, or technological networks to external perturbations has numerous applications. Random Boolean Networks (RBNs) are commonly used a simple generic model for certain dynamics of complex systems. Traditionally, RBNs are interconnected randomly and without considering any spatial extension and arrangement of the links and nodes. However, most real-world networks are spatially extended and arranged with regular, power-law, small-world, or other non-random connections. Here we explore the RBN network topology between extreme local connections, random small-world, and pure random networks, and study the damage spreading with small perturbations. We find that spatially local connections change the scaling of the relevant component at very low connectivities ($\\bar{K} \\ll 1$) and that the critical connectivity of stability $K_s$ changes compared to random networks. At higher $\\bar{K}$, this scaling remains unchanged. We also show that the relevant component of spatially local networks scales with a power-law as the system size N increases, but with a different exponent for local and small-world networks. The scaling behaviors are obtained by finite-size scaling. We further investigate the wiring cost of the networks. From an engineering perspective, our new findings provide the key design trade-offs between damage spreading (robustness), the network's wiring cost, and the network's communication characteristics.
Modeling and controlling the two-phase dynamics of the p53 network: a Boolean network approach
Lin, Guo-Qiang; Ao, Bin; Chen, Jia-Wei; Wang, Wen-Xu; Di, Zeng-Ru
2014-12-01
Although much empirical evidence has demonstrated that p53 plays a key role in tumor suppression, the dynamics and function of the regulatory network centered on p53 have not yet been fully understood. Here, we develop a Boolean network model to reproduce the two-phase dynamics of the p53 network in response to DNA damage. In particular, we map the fates of cells into two types of Boolean attractors, and we find that the apoptosis attractor does not exist for minor DNA damage, reflecting that the cell is reparable. As the amount of DNA damage increases, the basin of the repair attractor shrinks, accompanied by the rising of the apoptosis attractor and the expansion of its basin, indicating that the cell becomes more irreparable with more DNA damage. For severe DNA damage, the repair attractor vanishes, and the apoptosis attractor dominates the state space, accounting for the exclusive fate of death. Based on the Boolean network model, we explore the significance of links, in terms of the sensitivity of the two-phase dynamics, to perturbing the weights of links and removing them. We find that the links are either critical or ordinary, rather than redundant. This implies that the p53 network is irreducible, but tolerant of small mutations at some ordinary links, and this can be interpreted with evolutionary theory. We further devised practical control schemes for steering the system into the apoptosis attractor in the presence of DNA damage by pinning the state of a single node or perturbing the weight of a single link. Our approach offers insights into understanding and controlling the p53 network, which is of paramount importance for medical treatment and genetic engineering.
Directory of Open Access Journals (Sweden)
Hong Changki
2012-09-01
Full Text Available Abstract Background Cell cycle process of budding yeast (Saccharomyces cerevisiae consists of four phases: G1, S, G2 and M. Initiated by stimulation of the G1 phase, cell cycle returns to the G1 stationary phase through a sequence of the S, G2 and M phases. During the cell cycle, a cell verifies whether necessary conditions are satisfied at the end of each phase (i.e., checkpoint since damages of any phase can cause severe cell cycle defect. The cell cycle can proceed to the next phase properly only if checkpoint conditions are met. Over the last decade, there have been several studies to construct Boolean models that capture checkpoint conditions. However, they mostly focused on robustness to network perturbations, and the timing robustness has not been much addressed. Only recently, some studies suggested extension of such models towards timing-robust models, but they have not considered checkpoint conditions. Results To construct a timing-robust Boolean model that preserves checkpoint conditions of the budding yeast cell cycle, we used a model verification technique, ‘model checking’. By utilizing automatic and exhaustive verification of model checking, we found that previous models cannot properly capture essential checkpoint conditions in the presence of timing variations. In particular, such models violate the M phase checkpoint condition so that it allows a division of a budding yeast cell into two before the completion of its full DNA replication and synthesis. In this paper, we present a timing-robust model that preserves all the essential checkpoint conditions properly against timing variations. Our simulation results show that the proposed timing-robust model is more robust even against network perturbations and can better represent the nature of cell cycle than previous models. Conclusions To our knowledge this is the first work that rigorously examined the timing robustness of the cell cycle process of budding yeast with respect
French, J.; Burningham, H.
2011-12-01
A major challenge in coastal geomorphology is the prediction of morphological change at a meso-scale (10 to 100 km; 10 to 100 yr). This scale sits awkwardly between understanding of geomorphological processes at the micro-scale, and broader aspects of coastal evolution informed by the Holocene stratigraphic record. In this paper, we explore the potential of a new kind of qualitative mathematical model implemented at a system level. Qualitative models derive predictions from the structure of the system rather from the detailed physics of the underlying processes. Although systems thinking is well established in geomorphology methodologies for converting system diagrams into simulation tools have not been widely investigated. In a recent Defra-funded project in the UK, a Boolean network approach was piloted and applied to the simulation of generic aspects of estuary response to environmental and anthropogenic forcing. We build on this to present a generic approach to the construction of system diagrams for estuaries and adjacent open coasts and their conversion into a network graph. In a Boolean model, each node of this graph is assigned a binary value, the state of which is determined by a logical function that specifies the combined influence of other nodes to which it is connected. System evolution is simulated by specifying a set of initial conditions and repeatedly evaluating the logical functions until an equilibrium condition is reached (either a steady state or a cyclical sequence between two end states). In our enhanced Boolean scheme, changes in morphology are allowed to feed back into intrinsic process variables (e.g. estuary waves or tidal prism), although some processes are externally imposed (e.g. sea-level rise). Arbitrary time lags condition the response of morphology to a change in process, such that some landforms adjust more rapidly than others. We also present a simulator architecture based around a solver and externally specified model components
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.
Hörrmann, Julia; Weil, Wolfgang
2015-01-01
Valuations, as additive functionals, allow various applications in Stochastic Geometry, yielding mean value formulas for specific random closed sets and processes of convex or polyconvex particles. In particular, valuations are especially adapted to Boolean models, the latter being the union sets of Poisson particle processes. In this chapter, we collect mean value formulas for scalar- and tensor-valued valuations applied to Boolean models under quite general invariance assumptions.
Goodstein, R L
2007-01-01
This elementary treatment by a distinguished mathematician employs Boolean algebra as a simple medium for introducing important concepts of modern algebra. Numerous examples appear throughout the text, plus full solutions.
Kobayashi, Koichi; Hiraishi, Kunihiko
2014-01-01
One of the significant topics in systems biology is to develop control theory of gene regulatory networks (GRNs). In typical control of GRNs, expression of some genes is inhibited (activated) by manipulating external stimuli and expression of other genes. It is expected to apply control theory of GRNs to gene therapy technologies in the future. In this paper, a control method using a Boolean network (BN) is studied. A BN is widely used as a model of GRNs, and gene expression is expressed by a binary value (ON or OFF). In particular, a context-sensitive probabilistic Boolean network (CS-PBN), which is one of the extended models of BNs, is used. For CS-PBNs, the verification problem and the optimal control problem are considered. For the verification problem, a solution method using the probabilistic model checker PRISM is proposed. For the optimal control problem, a solution method using polynomial optimization is proposed. Finally, a numerical example on the WNT5A network, which is related to melanoma, is presented. The proposed methods provide us useful tools in control theory of GRNs.
Maslennikov, O. V.; Nekorkin, V. I.
2017-10-01
Dynamical networks are systems of active elements (nodes) interacting with each other through links. Examples are power grids, neural structures, coupled chemical oscillators, and communications networks, all of which are characterized by a networked structure and intrinsic dynamics of their interacting components. If the coupling structure of a dynamical network can change over time due to nodal dynamics, then such a system is called an adaptive dynamical network. The term ‘adaptive’ implies that the coupling topology can be rewired; the term ‘dynamical’ implies the presence of internal node and link dynamics. The main results of research on adaptive dynamical networks are reviewed. Key notions and definitions of the theory of complex networks are given, and major collective effects that emerge in adaptive dynamical networks are described.
Ge, Hao; Qian, Min
2009-01-01
Deterministic and stochastic Boolean network models are built for the dynamics of negative feedback loops of the p53 pathways. It is shown that the main function of the negative feedback in the p53 pathways is to keep p53 at a low steady state level, and each sequence of protein states in the negative feedback loops, is globally attracted to a closed cycle of the p53 dynamics after being perturbed by outside signal (e.g., DNA damage). Our theoretical and numerical studies show that both the biological stationary state and the biological oscillation after being perturbed are stable for a wide range of noise level. Applying the mathematical circulation theory of Markov chains, we investigate their stochastic synchronized dynamics and by comparing the network dynamics of the stochastic model with its corresponding deterministic network counterpart, a dominant circulation in the stochastic model is the natural generalization of the deterministic limit cycle in the deterministic system. Moreover, the period of the main peak in the power spectrum, which is in common use to characterize the synchronized dynamics, perfectly corresponds to the number of states in the main cycle with dominant circulation. Such a large separation in the magnitude of the circulations--between a dominant, main cycle and the rest--gives rise to the stochastic synchronization phenomenon.
Boolean reasoning the logic of boolean equations
Brown, Frank Markham
2012-01-01
A systematic treatment of Boolean reasoning, this concise, newly revised edition combines the works of early logicians with recent investigations, including previously unpublished research results. Brown begins with an overview of elementary mathematical concepts and outlines the theory of Boolean algebras. Two concluding chapters deal with applications. 1990 edition.
Directory of Open Access Journals (Sweden)
Jorge Marcelo Aráus Patiño
2011-01-01
Full Text Available In the present study we have generated a GRN comprising the process by which neural crest stem cells develop to two types of sensory neurons (Propioceptors and Nocioceptors. We have also been able to fi nd patterns of regulation (motifs that act cooperatively to control such process. Surprisingly, these motifs take place in similar stages during the development of erythrocytes from hematopoietic stem cells. Regarding the complexity of the GRN found, we then used Random Boolean Networks (RBN for this purpose, which showed key components as well as the dynamics of the process through changes in initial conditions. Finally, the motifs were refl ected in the model, suggesting insights for further studies.
Solomon, Alan D
2012-01-01
REA's Essentials provide quick and easy access to critical information in a variety of different fields, ranging from the most basic to the most advanced. As its name implies, these concise, comprehensive study guides summarize the essentials of the field covered. Essentials are helpful when preparing for exams, doing homework and will remain a lasting reference source for students, teachers, and professionals. Boolean Algebra includes set theory, sentential calculus, fundamental ideas of Boolean algebras, lattices, rings and Boolean algebras, the structure of a Boolean algebra, and Boolean
Tucker, Jerry H.; Tapia, Moiez A.; Bennett, A. Wayne
1988-01-01
The concept of Boolean integration is developed, and different Boolean integral operators are introduced. Given the changes in a desired function in terms of the changes in its arguments, the ways of 'integrating' (i.e. realizing) such a function, if it exists, are presented. The necessary and sufficient conditions for integrating, in different senses, the expression specifying the changes are obtained. Boolean calculus has applications in the design of logic circuits and in fault analysis.
Caglar, Mehmet Umut; Pal, Ranadip
2011-03-01
Central dogma of molecular biology states that ``information cannot be transferred back from protein to either protein or nucleic acid''. However, this assumption is not exactly correct in most of the cases. There are a lot of feedback loops and interactions between different levels of systems. These types of interactions are hard to analyze due to the lack of cell level data and probabilistic - nonlinear nature of interactions. Several models widely used to analyze and simulate these types of nonlinear interactions. Stochastic Master Equation (SME) models give probabilistic nature of the interactions in a detailed manner, with a high calculation cost. On the other hand Probabilistic Boolean Network (PBN) models give a coarse scale picture of the stochastic processes, with a less calculation cost. Differential Equation (DE) models give the time evolution of mean values of processes in a highly cost effective way. The understanding of the relations between the predictions of these models is important to understand the reliability of the simulations of genetic regulatory networks. In this work the success of the mapping between SME, PBN and DE models is analyzed and the accuracy and affectivity of the control policies generated by using PBN and DE models is compared.
Computation emerges from adaptive synchronization of networking neurons.
Directory of Open Access Journals (Sweden)
Massimiliano Zanin
Full Text Available The activity of networking neurons is largely characterized by the alternation of synchronous and asynchronous spiking sequences. One of the most relevant challenges that scientists are facing today is, then, relating that evidence with the fundamental mechanisms through which the brain computes and processes information, as well as with the arousal (or progress of a number of neurological illnesses. In other words, the problem is how to associate an organized dynamics of interacting neural assemblies to a computational task. Here we show that computation can be seen as a feature emerging from the collective dynamics of an ensemble of networking neurons, which interact by means of adaptive dynamical connections. Namely, by associating logical states to synchronous neuron's dynamics, we show how the usual Boolean logics can be fully recovered, and a universal Turing machine can be constructed. Furthermore, we show that, besides the static binary gates, a wider class of logical operations can be efficiently constructed as the fundamental computational elements interact within an adaptive network, each operation being represented by a specific motif. Our approach qualitatively differs from the past attempts to encode information and compute with complex systems, where computation was instead the consequence of the application of control loops enforcing a desired state into the specific system's dynamics. Being the result of an emergent process, the computation mechanism here described is not limited to a binary Boolean logic, but it can involve a much larger number of states. As such, our results can enlighten new concepts for the understanding of the real computing processes taking place in the brain.
Moisset de Espanés, P; Osses, A; Rapaport, I
2016-12-01
Fixed points are fundamental states in any dynamical system. In the case of gene regulatory networks (GRNs) they correspond to stable genes profiles associated to the various cell types. We use Kauffman's approach to model GRNs with random Boolean networks (RBNs). In this paper we explore how the topology affects the distribution of the number of fixed points in randomly generated networks. We also study the size of the basins of attraction of these fixed points if we assume the α-asynchronous dynamics (where every node is updated independently with probability 0≤α≤1). It is well-known that asynchrony avoids the cyclic attractors into which parallel dynamics tends to fall. We observe the remarkable property that, in all our simulations, if for a given RBN with Barabási-Albert topology and α-asynchronous dynamics an initial configuration reaches a fixed point, then every configuration also reaches a fixed point. By contrast, in the parallel regime, the percentage of initial configurations reaching a fixed point (for the same networks) is dramatically smaller. We contrast the results of the simulations on Barabási-Albert networks with the classical Erdös-Rényi model of random networks. Everything indicates that Barabási-Albert networks are extremely robust. Finally, we study the mean and maximum time/work needed to reach a fixed point when starting from randomly chosen initial configurations. Copyright Â© 2016 Elsevier Ireland Ltd. All rights reserved.
Boolean differential equations
Steinbach, Bernd
2013-01-01
The Boolean Differential Calculus (BDC) is a very powerful theory that extends the structure of a Boolean Algebra significantly. Based on a small number of definitions, many theorems have been proven. The available operations have been efficiently implemented in several software packages. There is a very wide field of applications. While a Boolean Algebra is focused on values of logic functions, the BDC allows the evaluation of changes of function values. Such changes can be explored for pairs of function values as well as for whole subspaces. Due to the same basic data structures, the BDC can
Boolean gates on actin filaments
Energy Technology Data Exchange (ETDEWEB)
Siccardi, Stefano, E-mail: ssiccardi@2ssas.it [The Unconventional Computing Centre, University of the West of England, Bristol (United Kingdom); Tuszynski, Jack A., E-mail: jackt@ualberta.ca [Department of Oncology, University of Alberta, Edmonton, Alberta (Canada); Adamatzky, Andrew, E-mail: andrew.adamatzky@uwe.ac.uk [The Unconventional Computing Centre, University of the West of England, Bristol (United Kingdom)
2016-01-08
Actin is a globular protein which forms long polar filaments in the eukaryotic cytoskeleton. Actin networks play a key role in cell mechanics and cell motility. They have also been implicated in information transmission and processing, memory and learning in neuronal cells. The actin filaments have been shown to support propagation of voltage pulses. Here we apply a coupled nonlinear transmission line model of actin filaments to study interactions between voltage pulses. To represent digital information we assign a logical TRUTH value to the presence of a voltage pulse in a given location of the actin filament, and FALSE to the pulse's absence, so that information flows along the filament with pulse transmission. When two pulses, representing Boolean values of input variables, interact, then they can facilitate or inhibit further propagation of each other. We explore this phenomenon to construct Boolean logical gates and a one-bit half-adder with interacting voltage pulses. We discuss implications of these findings on cellular process and technological applications. - Highlights: • We simulate interaction between voltage pulses using on actin filaments. • We use a coupled nonlinear transmission line model. • We design Boolean logical gates via interactions between the voltage pulses. • We construct one-bit half-adder with interacting voltage pulses.
Decentralized clustering over adaptive networks
Khawatmi, Sahar; Zoubir, Abdelhak M.; Sayed, Ali H.
2015-01-01
Cooperation among agents across the network leads to better estimation accuracy. However, in many network applications the agents infer and track different models of interest in an environment where agents do not know beforehand which models are being observed by their neighbors. In this work, we propose an adaptive and distributed clustering technique that allows agents to learn and form clusters from streaming data in a robust manner. Once clusters are formed, cooperation among agents with ...
DEFF Research Database (Denmark)
Andersen, Henrik Reif; Hulgaard, Henrik
2002-01-01
a BED into a reduced ordered BDD. One is a generalized version of the BDD apply-operator while the other can exploit the structural information of the Boolean expression. This ability is demonstrated by verifying that two different circuit implementations of a 16-bit multiplier implement the same...... Boolean function. Using BEDs, this verification problem is solved efficiently, while using standard BDD techniques this problem is infeasible. Generally, BEDs are useful in applications, for example tautology checking, where the end-result as a reduced ordered BDD is small. Moreover, using operators...... for substitution and existential quantification they allow for the verification of large hierarchical circuits....
DEFF Research Database (Denmark)
Andersen, Henrik Reif; Hulgaard, Henrik
1997-01-01
properties of BDDs. Two algorithms are described for transforming a BED into a reduced ordered BDD. One closely mimics the BDD apply-operator while the other can exploit the structural information of the Boolean expression. The efficacy of the BED representation is demonstrated by verifying...... that the redundant and non-redundant versions of the ISCAS 85 benchmark circuits are identical. In particular, it is verified that the two 16-bit multiplication circuits (c6288 and c6288nr) implement the same Boolean functions. Using BEDs, this verification problem is solved in less than a second, while using...
Algebraic partial Boolean algebras
Smith, D
2003-01-01
Partial Boolean algebras, first studied by Kochen and Specker in the 1960s, provide the structure for Bell-Kochen-Specker theorems which deny the existence of non-contextual hidden variable theories. In this paper, we study partial Boolean algebras which are 'algebraic' in the sense that their elements have coordinates in an algebraic number field. Several of these algebras have been discussed recently in a debate on the validity of Bell-Kochen-Specker theorems in the context of finite precision measurements. The main result of this paper is that every algebraic finitely-generated partial Boolean algebra B(T) is finite when the underlying space H is three-dimensional, answering a question of Kochen and showing that Conway and Kochen's infinite algebraic partial Boolean algebra has minimum dimension. This result contrasts the existence of an infinite (non-algebraic) B(T) generated by eight elements in an abstract orthomodular lattice of height 3. We then initiate a study of higher-dimensional algebraic partial...
Robustness of Boolean dynamics under knockouts
Boldhaus, Gunnar; Bertschinger, Nils; Rauh, Johannes; Olbrich, Eckehard; Klemm, Konstantin
2010-08-01
The response to a knockout of a node is a characteristic feature of a networked dynamical system. Knockout resilience in the dynamics of the remaining nodes is a sign of robustness. Here we study the effect of knockouts for binary state sequences and their implementations in terms of Boolean threshold networks. Besides random sequences with biologically plausible constraints, we analyze the cell cycle sequence of the species Saccharomyces cerevisiae and the Boolean networks implementing it. Comparing with an appropriate null model we do not find evidence that the yeast wildtype network is optimized for high knockout resilience. Our notion of knockout resilience weakly correlates with the size of the basin of attraction, which has also been considered a measure of robustness.
Digital clocks: simple Boolean models can quantitatively describe circadian systems
Akman, Ozgur E.; Watterson, Steven; Parton, Andrew; Binns, Nigel; Millar, Andrew J.; Ghazal, Peter
2012-01-01
The gene networks that comprise the circadian clock modulate biological function across a range of scales, from gene expression to performance and adaptive behaviour. The clock functions by generating endogenous rhythms that can be entrained to the external 24-h day–night cycle, enabling organisms to optimally time biochemical processes relative to dawn and dusk. In recent years, computational models based on differential equations have become useful tools for dissecting and quantifying the complex regulatory relationships underlying the clock's oscillatory dynamics. However, optimizing the large parameter sets characteristic of these models places intense demands on both computational and experimental resources, limiting the scope of in silico studies. Here, we develop an approach based on Boolean logic that dramatically reduces the parametrization, making the state and parameter spaces finite and tractable. We introduce efficient methods for fitting Boolean models to molecular data, successfully demonstrating their application to synthetic time courses generated by a number of established clock models, as well as experimental expression levels measured using luciferase imaging. Our results indicate that despite their relative simplicity, logic models can (i) simulate circadian oscillations with the correct, experimentally observed phase relationships among genes and (ii) flexibly entrain to light stimuli, reproducing the complex responses to variations in daylength generated by more detailed differential equation formulations. Our work also demonstrates that logic models have sufficient predictive power to identify optimal regulatory structures from experimental data. By presenting the first Boolean models of circadian circuits together with general techniques for their optimization, we hope to establish a new framework for the systematic modelling of more complex clocks, as well as other circuits with different qualitative dynamics. In particular, we
Multitask Diffusion Adaptation Over Networks
Chen, Jie; Richard, Cedric; Sayed, Ali H.
2014-08-01
Adaptive networks are suitable for decentralized inference tasks, e.g., to monitor complex natural phenomena. Recent research works have intensively studied distributed optimization problems in the case where the nodes have to estimate a single optimum parameter vector collaboratively. However, there are many important applications that are multitask-oriented in the sense that there are multiple optimum parameter vectors to be inferred simultaneously, in a collaborative manner, over the area covered by the network. In this paper, we employ diffusion strategies to develop distributed algorithms that address multitask problems by minimizing an appropriate mean-square error criterion with $\\ell_2$-regularization. The stability and convergence of the algorithm in the mean and in the mean-square sense is analyzed. Simulations are conducted to verify the theoretical findings, and to illustrate how the distributed strategy can be used in several useful applications related to spectral sensing, target localization, and hyperspectral data unmixing.
Adaptive Dynamics of Regulatory Networks: Size Matters
Directory of Open Access Journals (Sweden)
Martinetz Thomas
2009-01-01
Full Text Available To accomplish adaptability, all living organisms are constructed of regulatory networks on different levels which are capable to differentially respond to a variety of environmental inputs. Structure of regulatory networks determines their phenotypical plasticity, that is, the degree of detail and appropriateness of regulatory replies to environmental or developmental challenges. This regulatory network structure is encoded within the genotype. Our conceptual simulation study investigates how network structure constrains the evolution of networks and their adaptive abilities. The focus is on the structural parameter network size. We show that small regulatory networks adapt fast, but not as good as larger networks in the longer perspective. Selection leads to an optimal network size dependent on heterogeneity of the environment and time pressure of adaptation. Optimal mutation rates are higher for smaller networks. We put special emphasis on discussing our simulation results on the background of functional observations from experimental and evolutionary biology.
Using Bayesian belief networks in adaptive management.
J.B. Nyberg; B.G. Marcot; R. Sulyma
2006-01-01
Bayesian belief and decision networks are relatively new modeling methods that are especially well suited to adaptive-management applications, but they appear not to have been widely used in adaptive management to date. Bayesian belief networks (BBNs) can serve many purposes for practioners of adaptive management, from illustrating system relations conceptually to...
Boolean Delay Equations: A Simple Way of Looking at Interactions and Extreme Events
Ghil, Michael
2013-04-01
Boolean Delay Equations (BDEs) are semi-discrete dynamical models with Boolean-valued variables that evolve in continuous time. Systems of BDEs can be classified into conservative or dissipative, in a manner that parallels the classification of ordinary or partial differential equations. Solutions to certain conservative BDEs exhibit growth of complexity in time; such BDEs can be seen therefore as metaphors for biological evolution or human history. Dissipative BDEs are structurally stable and exhibit multiple equilibria and limit cycles, as well as more complex, fractal solution sets, such as Devil's staircases and ``fractal sunbursts.'' BDE systems have been used as highly idealized models of climate change on several time scales, as well as in earthquake modeling and prediction, and in genetics. BDEs with an infinite number of variables on a regular spatial grid have been called "partial BDEs" and we discuss connections with other types of discrete dynamical systems, including cellular automata and Boolean networks. We present recent BDE work on damage propagation in networks, with an emphasis on production-chain models. This formalism turns out to be well adapted to investigating propagation of an initial damage due to a climatic or other natural disaster. It thus serves to study economic impacts of extreme events, as well as extreme disruption of a network of interactions.
Adaptive Networks: the Governance for Sustainable Development
S.G. Nooteboom (Sibout)
2006-01-01
textabstractIn this book, I reconstruct how policy makers, working together in what I term adaptive networks, have enabled a breakthrough in thinking about sustainable mobility in certain policy circles. I define the conduct of leading actors in these adaptive networks as sustainable change
Dynamical Adaptation in Terrorist Cells/Networks
DEFF Research Database (Denmark)
Hussain, Dil Muhammad Akbar; Ahmed, Zaki
2010-01-01
Typical terrorist cells/networks have dynamical structure as they evolve or adapt to changes which may occur due to capturing or killing of a member of the cell/network. Analytical measures in graph theory like degree centrality, betweenness and closeness centralities are very common and have long...... history of their successful use in revealing the importance of various members of the network. However, modeling of covert, terrorist or criminal networks through social graph dose not really provide the hierarchical structure which exist in these networks as these networks are composed of leaders...... and followers etc. In this research we analyze and predict the most likely role a particular node can adapt once a member of the network is either killed or caught. The adaptation is based on computing Bayes posteriori probability of each node and the level of the said node in the network structure....
Geometric Operators on Boolean Functions
DEFF Research Database (Denmark)
Frisvad, Jeppe Revall; Falster, Peter
In truth-functional propositional logic, any propositional formula represents a Boolean function (according to some valuation of the formula). We describe operators based on Decartes' concept of constructing coordinate systems, for translation of a propositional formula to the image of a Boolean...
Reversible synthesis of incompletely specified Boolean functions using functional decomposition
Rawski, Mariusz; Szotkowski, Piotr
2017-08-01
Conventional microelectronic technology reaches its limits, and reversible logic circuits might address at least one of the problems: unwanted energy dissipation. Unfortunately, current methods of reversible function synthesis have certain limitations, including suboptimal handling of incompletely specified Boolean functions and yielding circuit sizes (and costs) that can be vastly improved upon. This paper presents the application of functional decomposition as a crucial step in synthesis of reversible logic that cost-efficiently implements incompletely specified Boolean functions. A decomposition of an incompletely specified Boolean function into a network of smaller sub-functions, subsequently synthesized into reversible blocks and composed into a reversible system, yields significantly better results than direct reversible synthesis of the original, incompletely specified Boolean function. The experimental results presented in this paper demonstrate the potential of the proposed approach.
Cryptographic Boolean functions and applications
Cusick, Thomas W
2009-01-01
Boolean functions are the building blocks of symmetric cryptographic systems. Symmetrical cryptographic algorithms are fundamental tools in the design of all types of digital security systems (i.e. communications, financial and e-commerce).Cryptographic Boolean Functions and Applications is a concise reference that shows how Boolean functions are used in cryptography. Currently, practitioners who need to apply Boolean functions in the design of cryptographic algorithms and protocols need to patch together needed information from a variety of resources (books, journal articles and other sources). This book compiles the key essential information in one easy to use, step-by-step reference. Beginning with the basics of the necessary theory the book goes on to examine more technical topics, some of which are at the frontier of current research.-Serves as a complete resource for the successful design or implementation of cryptographic algorithms or protocols using Boolean functions -Provides engineers and scient...
Interpolative Boolean algebra based multicriteria routing algorithm
Directory of Open Access Journals (Sweden)
Jeremić Marina
2015-01-01
Full Text Available In order to improve the quality-of-service of distributed applications, we propose a multi-criteria algorithm based on interpolative Boolean algebra for routing in an overlay network. We use a mesh topology because it can be easily implemented, and it makes addressing of the cores quite simple during routing. In this paper, we consider four criteria: buffer usage, the distance between peers, bandwidth, and remaining battery power. The proposed routing algorithm determines the path which satisfies quality-of service requirements using interpolative Boolean algebra; the decision at each node is made based on the ranking of available options considering multiple constraints. The simulation shows that the proposed approach provides better results than the standard shortest path routing algorithm.
Adaptability in dynamic wireless networks
Iyer, V.G.
2012-01-01
Software for networked embedded systems faces several challenges when the deployed network is subject to changing circumstances during operation. Typically, inter-node communication and network connectivity are two crucial aspects that are directly affected by dynamics such as failing wireless links
Recruitment dynamics in adaptive social networks
Shkarayev, Maxim S.; Schwartz, Ira B.; Shaw, Leah B.
2013-06-01
We model recruitment in adaptive social networks in the presence of birth and death processes. Recruitment is characterized by nodes changing their status to that of the recruiting class as a result of contact with recruiting nodes. Only a susceptible subset of nodes can be recruited. The recruiting individuals may adapt their connections in order to improve recruitment capabilities, thus changing the network structure adaptively. We derive a mean-field theory to predict the dependence of the growth threshold of the recruiting class on the adaptation parameter. Furthermore, we investigate the effect of adaptation on the recruitment level, as well as on network topology. The theoretical predictions are compared with direct simulations of the full system. We identify two parameter regimes with qualitatively different bifurcation diagrams depending on whether nodes become susceptible frequently (multiple times in their lifetime) or rarely (much less than once per lifetime).
Energy-efficient adaptive wireless network design
Havinga, Paul J.M.; Smit, Gerardus Johannes Maria; Bos, M.
Energy efficiency is an important issue for mobile computers since they must rely on their batteries. We present an energy-efficient highly adaptive architecture of a network interface and novel data link layer protocol for wireless networks that provides quality of service (QoS) support for diverse
Adaptive Learning in Weighted Network Games
Bayer, Péter; Herings, P. Jean-Jacques; Peeters, Ronald; Thuijsman, Frank
2017-01-01
This paper studies adaptive learning in the class of weighted network games. This class of games includes applications like research and development within interlinked firms, crime within social networks, the economics of pollution, and defense expenditures within allied nations. We show that for
Adaptive Networks Theory, Models and Applications
Gross, Thilo
2009-01-01
With adaptive, complex networks, the evolution of the network topology and the dynamical processes on the network are equally important and often fundamentally entangled. Recent research has shown that such networks can exhibit a plethora of new phenomena which are ultimately required to describe many real-world networks. Some of those phenomena include robust self-organization towards dynamical criticality, formation of complex global topologies based on simple, local rules, and the spontaneous division of "labor" in which an initially homogenous population of network nodes self-organizes into functionally distinct classes. These are just a few. This book is a state-of-the-art survey of those unique networks. In it, leading researchers set out to define the future scope and direction of some of the most advanced developments in the vast field of complex network science and its applications.
Using Granular-Evidence-Based Adaptive Networks for Sensitivity Analysis
Vališevskis, A.
2002-01-01
This paper considers the possibility of using adaptive networks for sensitivity analysis. Adaptive network that processes fuzzy granules is described. The adaptive network training algorithm can be used for sensitivity analysis of decision making models. Furthermore, a case study concerning sensitivity analysis is described, which shows in what way the adaptive network can be used for sensitivity analysis.
In-Network Adaptation of Video Streams Using Network Processors
Directory of Open Access Journals (Sweden)
Mohammad Shorfuzzaman
2009-01-01
problem can be addressed, near the network edge, by applying dynamic, in-network adaptation (e.g., transcoding of video streams to meet available connection bandwidth, machine characteristics, and client preferences. In this paper, we extrapolate from earlier work of Shorfuzzaman et al. 2006 in which we implemented and assessed an MPEG-1 transcoding system on the Intel IXP1200 network processor to consider the feasibility of in-network transcoding for other video formats and network processor architectures. The use of “on-the-fly” video adaptation near the edge of the network offers the promise of simpler support for a wide range of end devices with different display, and so forth, characteristics that can be used in different types of environments.
Polynomial threshold functions and Boolean threshold circuits
DEFF Research Database (Denmark)
Hansen, Kristoffer Arnsfelt; Podolskii, Vladimir V.
2013-01-01
We study the complexity of computing Boolean functions on general Boolean domains by polynomial threshold functions (PTFs). A typical example of a general Boolean domain is 12n . We are mainly interested in the length (the number of monomials) of PTFs, with their degree and weight being of second......We study the complexity of computing Boolean functions on general Boolean domains by polynomial threshold functions (PTFs). A typical example of a general Boolean domain is 12n . We are mainly interested in the length (the number of monomials) of PTFs, with their degree and weight being...
Designing Networks that are Capable of Self-Healing and Adapting
2017-04-01
Time, Evolution, Networks , and Function’ (program manager : C. Macedonia). Part of this program focuses on robustness of networks , which compliments...8725 John J. Kingman Road, MS 6201 Fort Belvoir, VA 22060-6201 T E C H N IC A L R E P O R T DTRA-TR-15-78 Designing Networks that are...from statistical mechanics, combinatorics, boolean networks , and numerical simulations, and inspired by design principles from biological networks , we
An adaptive complex network model for brain functional networks.
Directory of Open Access Journals (Sweden)
Ignacio J Gomez Portillo
Full Text Available Brain functional networks are graph representations of activity in the brain, where the vertices represent anatomical regions and the edges their functional connectivity. These networks present a robust small world topological structure, characterized by highly integrated modules connected sparsely by long range links. Recent studies showed that other topological properties such as the degree distribution and the presence (or absence of a hierarchical structure are not robust, and show different intriguing behaviors. In order to understand the basic ingredients necessary for the emergence of these complex network structures we present an adaptive complex network model for human brain functional networks. The microscopic units of the model are dynamical nodes that represent active regions of the brain, whose interaction gives rise to complex network structures. The links between the nodes are chosen following an adaptive algorithm that establishes connections between dynamical elements with similar internal states. We show that the model is able to describe topological characteristics of human brain networks obtained from functional magnetic resonance imaging studies. In particular, when the dynamical rules of the model allow for integrated processing over the entire network scale-free non-hierarchical networks with well defined communities emerge. On the other hand, when the dynamical rules restrict the information to a local neighborhood, communities cluster together into larger ones, giving rise to a hierarchical structure, with a truncated power law degree distribution.
Adaptive Capacity Management in Bluetooth Networks
DEFF Research Database (Denmark)
Son, L.T.
With the Internet and mobile wireless development, accelerated by high-speed and low cost VLSI device evolution, short range wireless communications have become more and more popular, especially Bluetooth. Bluetooth is a new short range radio technology that promises to be very convenient, low...... of Bluetooth devices is increasing, a larger-scale ad hoc network, scatternet, is formed, as well as the booming of Internet has demanded for large bandwidth and low delay mobile access. This dissertation is to address the capacity management issues in Bluetooth networks. The main goals of the network capacity...... resource constraints in Bluetooth networks and adapt to mobility and frequent changes of the network topology, as well as to bursty traffic of Internet data applications, which are supposedly very common in Bluetooth. Some performance characteristics of these approaches are illustrated by analysis as well...
Modular Decomposition of Boolean Functions
J.C. Bioch (Cor)
2002-01-01
textabstractModular decomposition is a thoroughly investigated topic in many areas such as switching theory, reliability theory, game theory and graph theory. Most appli- cations can be formulated in the framework of Boolean functions. In this paper we give a uni_ed treatment of modular
Understanding Supply Networks from Complex Adaptive Systems
Directory of Open Access Journals (Sweden)
Jamur Johnas Marchi
2014-10-01
Full Text Available This theoretical paper is based on complex adaptive systems (CAS that integrate dynamic and holistic elements, aiming to discuss supply networks as complex systems and their dynamic and co-evolutionary processes. The CAS approach can give clues to understand the dynamic nature and co-evolution of supply networks because it consists of an approach that incorporates systems and complexity. This paper’s overall contribution is to reinforce the theoretical discussion of studies that have addressed supply chain issues, such as CAS.
Quantum algorithms for testing Boolean functions
Directory of Open Access Journals (Sweden)
Erika Andersson
2010-06-01
Full Text Available We discuss quantum algorithms, based on the Bernstein-Vazirani algorithm, for finding which variables a Boolean function depends on. There are 2^n possible linear Boolean functions of n variables; given a linear Boolean function, the Bernstein-Vazirani quantum algorithm can deterministically identify which one of these Boolean functions we are given using just one single function query. The same quantum algorithm can also be used to learn which input variables other types of Boolean functions depend on, with a success probability that depends on the form of the Boolean function that is tested, but does not depend on the total number of input variables. We also outline a procedure to futher amplify the success probability, based on another quantum algorithm, the Grover search.
Rational Verification in Iterated Electric Boolean Games
Directory of Open Access Journals (Sweden)
Youssouf Oualhadj
2016-07-01
Full Text Available Electric boolean games are compact representations of games where the players have qualitative objectives described by LTL formulae and have limited resources. We study the complexity of several decision problems related to the analysis of rationality in electric boolean games with LTL objectives. In particular, we report that the problem of deciding whether a profile is a Nash equilibrium in an iterated electric boolean game is no harder than in iterated boolean games without resource bounds. We show that it is a PSPACE-complete problem. As a corollary, we obtain that both rational elimination and rational construction of Nash equilibria by a supervising authority are PSPACE-complete problems.
Social networks as embedded complex adaptive systems.
Benham-Hutchins, Marge; Clancy, Thomas R
2010-09-01
As systems evolve over time, their natural tendency is to become increasingly more complex. Studies in the field of complex systems have generated new perspectives on management in social organizations such as hospitals. Much of this research appears as a natural extension of the cross-disciplinary field of systems theory. This is the 15th in a series of articles applying complex systems science to the traditional management concepts of planning, organizing, directing, coordinating, and controlling. In this article, the authors discuss healthcare social networks as a hierarchy of embedded complex adaptive systems. The authors further examine the use of social network analysis tools as a means to understand complex communication patterns and reduce medical errors.
Version Spaces and Generalized Monotone Boolean Functions
J.C. Bioch (Cor); T. Ibaraki
2002-01-01
textabstractWe consider generalized monotone functions f: X --> {0,1} defined for an arbitrary binary relation <= on X by the property x <= y implies f(x) <= f(y). These include the standard monotone (or positive) Boolean functions, regular Boolean functions and other interesting functions as
Boolean integral calculus for digital systems
Tucker, J. H.; Tapia, M. A.; Bennett, A. W.
1985-01-01
The concept of Boolean integration is introduced and developed. When the changes in a desired function are specified in terms of changes in its arguments, then ways of 'integrating' (i.e., realizing) the function, if it exists, are presented. Boolean integral calculus has applications in design of logic circuits.
Integrated Adaptive Analysis and Visualization of Satellite Network Data Project
National Aeronautics and Space Administration — We propose to develop a system that enables integrated and adaptive analysis and visualization of satellite network management data. Integrated analysis and...
Optimization Models for Flexible and Adaptive SDN Network Virtualization Layers
Zerwas, Johannes; Blenk, Andreas; Kellerer, Wolfgang
2016-01-01
Network hypervisors provide the network virtualization layer for Software Defined Networking (SDN). They enable virtual network (VN) tenants to bring their SDN controllers to program their logical networks individually according to their demands. In order to make use of the high flexibility of virtual SDN networks and to provide high performance, the deployment of the virtualization layer needs to adapt to changing VN demands. This paper initializes the study of the optimization of dynamic SD...
Generalized synchronization in complex dynamical networks via adaptive couplings
Liu, Hui; Chen, Juan; Lu, Jun-an; Cao, Ming
2010-01-01
This paper investigates generalized synchronization of three typical classes of complex dynamical networks: scale-free networks, small-world networks. and interpolating networks. The proposed synchronization strategy is to adjust adaptively a node's coupling strength based oil the node's local
Adaptive training of feedforward neural networks by Kalman filtering
Energy Technology Data Exchange (ETDEWEB)
Ciftcioglu, Oe. [Istanbul Technical Univ. (Turkey). Dept. of Electrical Engineering; Tuerkcan, E. [Netherlands Energy Research Foundation (ECN), Petten (Netherlands)
1995-02-01
Adaptive training of feedforward neural networks by Kalman filtering is described. Adaptive training is particularly important in estimation by neural network in real-time environmental where the trained network is used for system estimation while the network is further trained by means of the information provided by the experienced/exercised ongoing operation. As result of this, neural network adapts itself to a changing environment to perform its mission without recourse to re-training. The performance of the training method is demonstrated by means of actual process signals from a nuclear power plant. (orig.).
Public goods games on adaptive coevolutionary networks
Pichler, Elgar; Shapiro, Avi M.
2017-07-01
Productive societies feature high levels of cooperation and strong connections between individuals. Public Goods Games (PGGs) are frequently used to study the development of social connections and cooperative behavior in model societies. In such games, contributions to the public good are made only by cooperators, while all players, including defectors, reap public goods benefits, which are shares of the contributions amplified by a synergy factor. Classic results of game theory show that mutual defection, as opposed to cooperation, is the Nash Equilibrium of PGGs in well-mixed populations, where each player interacts with all others. In this paper, we explore the coevolutionary dynamics of a low information public goods game on a complex network in which players adapt to their environment in order to increase individual payoffs relative to past payoffs parameterized by greediness. Players adapt by changing their strategies, either to cooperate or to defect, and by altering their social connections. We find that even if players do not know other players' strategies and connectivity, cooperation can arise and persist despite large short-term fluctuations.
Speed Adaptation in Urban Road Network Management
Directory of Open Access Journals (Sweden)
Raiyn Jamal
2016-06-01
Full Text Available Various forecasting schemes have been proposed to manage traffic data, which is collected by videos cameras, sensors, and mobile phone services. However, these are not sufficient for collecting data because of their limited coverage and high costs for installation and maintenance. To overcome the limitations of these tools, we introduce a hybrid scheme based on intelligent transportation system (ITS and global navigation satellite system (GNSS. Applying the GNSS to calculate travel time has proven efficient in terms of accuracy. In this case, GNSS data is managed to reduce traffic congestion and road accidents. This paper introduces a short-time forecasting model based on real-time travel time for urban heterogeneous road networks. Travel time forecasting has been achieved by predicting travel speeds using an optimized exponential moving Average (EMA model. Furthermore for speed adaptation in heterogeneous road networks, it is necessary to introduce asuitable control strategy for longitude, based on the GNSS. GNSS products provide worldwide and real-time services using precise timing information and, positioning technologies.
Mining TCGA data using Boolean implications.
Directory of Open Access Journals (Sweden)
Subarna Sinha
Full Text Available Boolean implications (if-then rules provide a conceptually simple, uniform and highly scalable way to find associations between pairs of random variables. In this paper, we propose to use Boolean implications to find relationships between variables of different data types (mutation, copy number alteration, DNA methylation and gene expression from the glioblastoma (GBM and ovarian serous cystadenoma (OV data sets from The Cancer Genome Atlas (TCGA. We find hundreds of thousands of Boolean implications from these data sets. A direct comparison of the relationships found by Boolean implications and those found by commonly used methods for mining associations show that existing methods would miss relationships found by Boolean implications. Furthermore, many relationships exposed by Boolean implications reflect important aspects of cancer biology. Examples of our findings include cis relationships between copy number alteration, DNA methylation and expression of genes, a new hierarchy of mutations and recurrent copy number alterations, loss-of-heterozygosity of well-known tumor suppressors, and the hypermethylation phenotype associated with IDH1 mutations in GBM. The Boolean implication results used in the paper can be accessed at http://crookneck.stanford.edu/microarray/TCGANetworks/.
Epidemics in Adaptive Social Networks with Temporary Link Deactivation
Tunc, Ilker; Shkarayev, Maxim S.; Shaw, Leah B.
2013-04-01
Disease spread in a society depends on the topology of the network of social contacts. Moreover, individuals may respond to the epidemic by adapting their contacts to reduce the risk of infection, thus changing the network structure and affecting future disease spread. We propose an adaptation mechanism where healthy individuals may choose to temporarily deactivate their contacts with sick individuals, allowing reactivation once both individuals are healthy. We develop a mean-field description of this system and find two distinct regimes: slow network dynamics, where the adaptation mechanism simply reduces the effective number of contacts per individual, and fast network dynamics, where more efficient adaptation reduces the spread of disease by targeting dangerous connections. Analysis of the bifurcation structure is supported by numerical simulations of disease spread on an adaptive network. The system displays a single parameter-dependent stable steady state and non-monotonic dependence of connectivity on link deactivation rate.
LTE Adaptation for Mobile Broadband Satellite Networks
Directory of Open Access Journals (Sweden)
Bastia Francesco
2009-01-01
Full Text Available One of the key factors for the successful deployment of mobile satellite systems in 4G networks is the maximization of the technology commonalities with the terrestrial systems. An effective way of achieving this objective consists in considering the terrestrial radio interface as the baseline for the satellite radio interface. Since the 3GPP Long Term Evolution (LTE standard will be one of the main players in the 4G scenario, along with other emerging technologies, such as mobile WiMAX; this paper analyzes the possible applicability of the 3GPP LTE interface to satellite transmission, presenting several enabling techniques for this adaptation. In particular, we propose the introduction of an inter-TTI interleaving technique that exploits the existing H-ARQ facilities provided by the LTE physical layer, the use of PAPR reduction techniques to increase the resilience of the OFDM waveform to non linear distortion, and the design of the sequences for Random Access, taking into account the requirements deriving from the large round trip times. The outcomes of this analysis show that, with the required proposed enablers, it is possible to reuse the existing terrestrial air interface to transmit over the satellite link.
Adaptive Mobile Positioning in WCDMA Networks
Directory of Open Access Journals (Sweden)
Dong B.
2005-01-01
Full Text Available We propose a new technique for mobile tracking in wideband code-division multiple-access (WCDMA systems employing multiple receive antennas. To achieve a high estimation accuracy, the algorithm utilizes the time difference of arrival (TDOA measurements in the forward link pilot channel, the angle of arrival (AOA measurements in the reverse-link pilot channel, as well as the received signal strength. The mobility dynamic is modelled by a first-order autoregressive (AR vector process with an additional discrete state variable as the motion offset, which evolves according to a discrete-time Markov chain. It is assumed that the parameters in this model are unknown and must be jointly estimated by the tracking algorithm. By viewing a nonlinear dynamic system such as a jump-Markov model, we develop an efficient auxiliary particle filtering algorithm to track both the discrete and continuous state variables of this system as well as the associated system parameters. Simulation results are provided to demonstrate the excellent performance of the proposed adaptive mobile positioning algorithm in WCDMA networks.
Cryptographic Properties of Monotone Boolean Functions
2016-01-01
and D. Phillips, On the Walsh–Hadamard transform of monotone Boolean functions , Tbilisi Math . J. 5 (2012), 19–35. [5] N. Courtois and W. Meier...J. Math . Cryptol. 2016; aop Research Article Claude Carlet, David Joyner*, Pantelimon Stănică and Deng Tang Cryptographic properties of monotone...Boolean functions DOI: 10.1515/jmc-2014-0030 Received September 2, 2014; revised December 28, 2015; accepted December 30, 2015 Abstract:We prove various
Boolean models of biosurfactants production in Pseudomonas fluorescens.
Directory of Open Access Journals (Sweden)
Adrien Richard
Full Text Available Cyclolipopeptides (CLPs are biosurfactants produced by numerous Pseudomonas fluorescens strains. CLP production is known to be regulated at least by the GacA/GacS two-component pathway, but the full regulatory network is yet largely unknown. In the clinical strain MFN1032, CLP production is abolished by a mutation in the phospholipase C gene (plcC and not restored by plcC complementation. Their production is also subject to phenotypic variation. We used a modelling approach with Boolean networks, which takes into account all these observations concerning CLP production without any assumption on the topology of the considered network. Intensive computation yielded numerous models that satisfy these properties. All models minimizing the number of components point to a bistability in CLP production, which requires the presence of a yet unknown key self-inducible regulator. Furthermore, all suggest that a set of yet unexplained phenotypic variants might also be due to this epigenetic switch. The simplest of these Boolean networks was used to propose a biological regulatory network for CLP production. This modelling approach has allowed a possible regulation to be unravelled and an unusual behaviour of CLP production in P. fluorescens to be explained.
How adaptation shapes spike rate oscillations in recurrent neuronal networks
Directory of Open Access Journals (Sweden)
Moritz eAugustin
2013-02-01
Full Text Available Neural mass signals from in-vivo recordings often show oscillations with frequencies ranging from <1 Hz to 100 Hz. Fast rhythmic activity in the beta and gamma range can be generated by network based mechanisms such as recurrent synaptic excitation-inhibition loops. Slower oscillations might instead depend on neuronal adaptation currents whose timescales range from tens of milliseconds to seconds. Here we investigate how the dynamics of such adaptation currents contribute to spike rate oscillations and resonance properties in recurrent networks of excitatory and inhibitory neurons. Based on a network of sparsely coupled spiking model neurons with two types of adaptation current and conductance based synapses with heterogeneous strengths and delays we use a mean-field approach to analyze oscillatory network activity. For constant external input, we find that spike-triggered adaptation currents provide a mechanism to generate slow oscillations over a wide range of adaptation timescales as long as recurrent synaptic excitation is sufficiently strong. Faster rhythms occur when recurrent inhibition is slower than excitation and oscillation frequency increases with the strength of inhibition. Adaptation facilitates such network based oscillations for fast synaptic inhibition and leads to decreased frequencies. For oscillatory external input, adaptation currents amplify a narrow band of frequencies and cause phase advances for low frequencies in addition to phase delays at higher frequencies. Our results therefore identify the different key roles of neuronal adaptation dynamics for rhythmogenesis and selective signal propagation in recurrent networks.
Information Theoretic Adaptive Tracking of Epidemics in Complex Networks
Harrington, Patrick L
2013-01-01
Adaptively monitoring the states of nodes in a large complex network is of interest in domains such as national security, public health, and energy grid management. Here, we present an information theoretic adaptive tracking and sampling framework that recursively selects measurements using the feedback from performing inference on a dynamic Bayesian Network. We also present conditions for the existence of a network specific, observation dependent, phase transition in the updated posterior of hidden node states resulting from actively monitoring the network. Since traditional epidemic thresholds are derived using observation independent Markov chains, the threshold of the posterior should more accurately model the true phase transition of a network. The adaptive tracking framework and epidemic threshold should provide insight into modeling the dynamic response of the updated posterior to active intervention and control policies while monitoring modern complex networks.
Adaptive Dynamics, Control, and Extinction in Networked Populations
2015-07-09
Adaptive Dynamics, Control, and Extinction in Networked Populations Ira B. Schwartz US Naval Research Laboratory Code 6792 Nonlinear System Dynamics...theory of large deviations to stochastic network extinction to predict extinction times. In particular, we use the theory to find the most probable...paths leading to extinction . We then apply the methodology to network models and discover how mean extinction times scale with network parameters in Erdos
ADAPTIVE NETWORK CODING IN WIRELESS COMMUNICATIONS
DEFF Research Database (Denmark)
2017-01-01
A first network node (eNB) is configured to receive (404), from a second network node (UE), channel performance indicator values regarding a serving cell, and estimate (404) a number of network-coded packets based on the received channel performance indicator values, such that the estimated numbe...
Collaborative Trust Networks in Engineering Design Adaptation
DEFF Research Database (Denmark)
Atkinson, Simon Reay; Maier, Anja; Caldwell, Nicholas
2011-01-01
); applying the Change Prediction Method (CPM) tool. It posits the idea of the ‘Networks-in-Being’ with varying individual and collective characteristics. [Social] networks are considered to facilitate information exchange between actors. At the same time, networks failing to provide trusted-information can...... collaboration and decision-making by using the change prediction method as a way of scoping information propagation between actors within a network....... hinder effective communication and collaboration. Different combinations of trust may therefore improve or impair the likelihood of information flow, transfer and subsequent action (cause and effect). This paper investigates how analysing different types of network-structures-in-being can support...
Global network reorganization during dynamic adaptations of Bacillus subtilis metabolism
DEFF Research Database (Denmark)
Buescher, Joerg Martin; Liebermeister, Wolfram; Jules, Matthieu
2012-01-01
Adaptation of cells to environmental changes requires dynamic interactions between metabolic and regulatory networks, but studies typically address only one or a few layers of regulation. For nutritional shifts between two preferred carbon sources of Bacillus subtilis, we combined statistical...
Adaptive Charging Algorithms for a Network of Electric Vehicles
Low, Zhi H.; Low, Steven H.
2017-01-01
Electric vehicle node controllers in accordance with embodiments of the invention enable adaptive charging. One embodiment includes one or more centralized computing systems; a communications network; a plurality of electric vehicle node controllers, where each electric vehicle node controller in the plurality of node controllers contains: a network interface; a processor; a memory containing: an adaptive charging application; a plurality of electric vehicle node parameters describing chargin...
Adaptive relaying for ground fault protection of a distribution network
Energy Technology Data Exchange (ETDEWEB)
Sachdev, M.S.; Sidhu, T.S.; Talukdar, B.K.
1995-12-31
With the advent of digital technology and microprocessor-based relays, it is possible to continuously monitor a power network, analyze it in real time, and change the relay settings to those most suitable at that time, thereby achieving improved protection of the network. This approach, known as adaptive relaying, was applied to the Saskatoon distribution network. This paper describes the software modules developed for setting ground fault overcurrent relays in the adaptive relay protection system. The major task in this system was the on-line coordination of relays, as most faults in a distribution system are of the single-phase to ground type and current unbalance due to single-phase loading contributes to the complexity of relay coordination. The modules served for network topology detection, state estimation, fault analysis, and relay setting and coordination. The paper also presents results of a study of the proposed adaptive ground fault protection scheme using a model distribution network.
Adaptive optimization and control using neural networks
Energy Technology Data Exchange (ETDEWEB)
Mead, W.C.; Brown, S.K.; Jones, R.D.; Bowling, P.S.; Barnes, C.W.
1993-10-22
Recent work has demonstrated the ability of neural-network-based controllers to optimize and control machines with complex, non-linear, relatively unknown control spaces. We present a brief overview of neural networks via a taxonomy illustrating some capabilities of different kinds of neural networks. We present some successful control examples, particularly the optimization and control of a small-angle negative ion source.
Adapting Bayes Network Structures to Non-stationary Domains
DEFF Research Database (Denmark)
Nielsen, Søren Holbech; Nielsen, Thomas Dyhre
2006-01-01
When an incremental structural learning method gradually modifies a Bayesian network (BN) structure to fit observations, as they are read from a database, we call the process structural adaptation. Structural adaptation is useful when the learner is set to work in an unknown environment, where a BN...
Adapting Bayes Network Structures to Non-stationary Domains
DEFF Research Database (Denmark)
Nielsen, Søren Holbech; Nielsen, Thomas Dyhre
2008-01-01
When an incremental structural learning method gradually modifies a Bayesian network (BN) structure to fit a sequential stream of observations, we call the process structural adaptation. Structural adaptation is useful when the learner is set to work in an unknown environment, where a BN...
Implementation of an Adaptive Learning System Using a Bayesian Network
Yasuda, Keiji; Kawashima, Hiroyuki; Hata, Yoko; Kimura, Hiroaki
2015-01-01
An adaptive learning system is proposed that incorporates a Bayesian network to efficiently gauge learners' understanding at the course-unit level. Also, learners receive content that is adapted to their measured level of understanding. The system works on an iPad via the Edmodo platform. A field experiment using the system in an elementary school…
Networked Airbourne Communications Using Adaptive Multi Beam Directional Links
2016-03-05
January 8, 2009. works introduce more sophisticated channel models, and route selection by a method called percolation [7], [8]. For these examples ...Networked Airborne Communications Using Adaptive Multi-Beam Directional Links R. Bruce MacLeod Member, IEEE, and Adam Margetts Member, IEEE MIT...provide new techniques for increasing throughput in airborne adaptive directional net- works. By adaptive directional linking, we mean systems that can
Periodic pattern detection in sparse boolean sequences
Directory of Open Access Journals (Sweden)
Hérisson Joan
2010-09-01
Full Text Available Abstract Background The specific position of functionally related genes along the DNA has been shown to reflect the interplay between chromosome structure and genetic regulation. By investigating the statistical properties of the distances separating such genes, several studies have highlighted various periodic trends. In many cases, however, groups built up from co-functional or co-regulated genes are small and contain wrong information (data contamination so that the statistics is poorly exploitable. In addition, gene positions are not expected to satisfy a perfectly ordered pattern along the DNA. Within this scope, we present an algorithm that aims to highlight periodic patterns in sparse boolean sequences, i.e. sequences of the type 010011011010... where the ratio of the number of 1's (denoting here the transcription start of a gene to 0's is small. Results The algorithm is particularly robust with respect to strong signal distortions such as the addition of 1's at arbitrary positions (contaminated data, the deletion of existing 1's in the sequence (missing data and the presence of disorder in the position of the 1's (noise. This robustness property stems from an appropriate exploitation of the remarkable alignment properties of periodic points in solenoidal coordinates. Conclusions The efficiency of the algorithm is demonstrated in situations where standard Fourier-based spectral methods are poorly adapted. We also show how the proposed framework allows to identify the 1's that participate in the periodic trends, i.e. how the framework allows to allocate a positional score to genes, in the same spirit of the sequence score. The software is available for public use at http://www.issb.genopole.fr/MEGA/Softwares/iSSB_SolenoidalApplication.zip.
Adaptive Neurons For Artificial Neural Networks
Tawel, Raoul
1990-01-01
Training time decreases dramatically. In improved mathematical model of neural-network processor, temperature of neurons (in addition to connection strengths, also called weights, of synapses) varied during supervised-learning phase of operation according to mathematical formalism and not heuristic rule. Evidence that biological neural networks also process information at neuronal level.
Compensation for unmatched uncertainty with adaptive RBF network
African Journals Online (AJOL)
user
3 Control Systems Research Group, School of Engineering, Liverpool John Moores University, Liverpool, UK ... Introduction ... new integral sliding surface that includes an additional design matrix with an adaptive RBF neural network. In addition to ... This may be tackled by neural network modeling in on-line mode but the.
Adaptive Data Broadcast in Hybrid Networks
National Research Council Canada - National Science Library
Stathatos, Konstantinos; Roussopoulos, Nick; Baras, John S
1997-01-01
.... The goal is to build highly scalable systems with small response time. In this paper, we describe a technique that continuously adapts the broadcast content to match the hot-spot of the workload...
Adaptation Methods in Mobile Communication Networks
National Research Council Canada - National Science Library
Vladimir Wieser
2003-01-01
Adaptation methods are the main tool for transmission rate maximization through the mobile channel and today the great attention is directed to them not only in theoretical domain but in standardization process, too...
Adaptation Methods in Mobile Communication Networks
National Research Council Canada - National Science Library
Vladimir Wieser
2003-01-01
Adaptation methods are the main tool for transmission rate maximization through the mobile channel and today the great attention is directed to them not only in theoretical domain but in standardization process, too...
Cryptographic Boolean Functions with Biased Inputs
2015-07-31
negabent Boolean functions. Whether such functions exist for other values of p is a question whose answer is contained in our next result. Since ρ is...of cryptanalytic techniques by using the gen- eralized spectra of Boolean functions as a future research problem. The connection between the affine...as nlp (f) = 2 n−1 min u∈Fn2 √ 1− 2|<((1− p)nW (p)f (u))|+ |(1− p)nW (p) f (u)|2. We define µp-bent functions as follows, deriving its motivation from
EXACT SIMULATION OF A BOOLEAN MODEL
Directory of Open Access Journals (Sweden)
Christian Lantuéjoul
2013-06-01
Full Text Available A Boolean model is a union of independent objects (compact random subsets located at Poisson points. Two algorithms are proposed for simulating a Boolean model in a bounded domain. The first one applies only to stationary models. It generates the objects prior to their Poisson locations. Two examples illustrate its applicability. The second algorithm applies to stationary and non-stationary models. It generates the Poisson points prior to the objects. Its practical difficulties of implementation are discussed. Both algorithms are based on importance sampling techniques, and the generated objects are weighted.
The Permeability of Boolean Sets of Cylinders
Directory of Open Access Journals (Sweden)
Willot F.
2016-07-01
Full Text Available Numerical and analytical results on the permeability of Boolean models of randomly-oriented cylinders with circular cross-section are reported. The present work investigates cylinders of prolate (highly-elongated and oblate (nearly flat types. The fluid flows either inside or outside of the cylinders. The Stokes flow is solved using full-fields Fourier-based computations on 3D binarized microstructures. The permeability is given for varying volume fractions of pores. A new upper-bound is derived for the permeability of the Boolean model of oblate cylinders. The behavior of the permeability in the dilute limit is discussed.
Dynamic Virtual LANs for Adaptive Network Security
National Research Council Canada - National Science Library
Merani, Diego; Berni, Alessandro; Leonard, Michel
2004-01-01
The development of Network-Enabled capabilities in support of undersea research requires architectures for the interconnection and data sharing that are flexible, scalable, and built on open standards...
Engineering Issues for an Adaptive Defense Network
National Research Council Canada - National Science Library
Piszcz, Alan; Orlans, Nicholas; Eyler-Walker, Zachary; Moore, David
2001-01-01
.... The primary issue was the capability to detect and defend against DDoS. Experimentation was performed with a packet filtering firewall, a network Quality of Service manager, multiple DDoS tools, and traffic generation tools...
Adaptive Influence Maximization in Dynamic Social Networks
Tong, Guangmo; Wu, Weili; Tang, Shaojie; Du, Ding-Zhu
2015-01-01
For the purpose of propagating information and ideas through a social network, a seeding strategy aims to find a small set of seed users that are able to maximize the spread of the influence, which is termed as influence maximization problem. Despite a large number of works have studied this problem, the existing seeding strategies are limited to the static social networks. In fact, due to the high speed data transmission and the large population of participants, the diffusion processes in re...
Adaptive Capacity Management in Bluetooth Networks
Son, L.T.
2004-01-01
With the Internet and mobile wireless development, accelerated by high-speed and low cost VLSI device evolution, short range wireless communications have become more and more popular, especially Bluetooth. Bluetooth is a new short range radio technology that promises to be very convenient, low power, and low cost mobile ad hoc solution for the global interconnection of all mobile devices. To implement Bluetooth network as a true mobile ad hoc wireless network operating in short radio range, h...
Connection adaption for control of networked mobile chaotic agents.
Zhou, Jie; Zou, Yong; Guan, Shuguang; Liu, Zonghua; Xiao, Gaoxi; Boccaletti, S
2017-11-22
In this paper, we propose a strategy for the control of mobile chaotic oscillators by adaptively rewiring connections between nearby agents with local information. In contrast to the dominant adaptive control schemes where coupling strength is adjusted continuously according to the states of the oscillators, our method does not request adaption of coupling strength. As the resulting interaction structure generated by this proposed strategy is strongly related to unidirectional chains, by investigating synchronization property of unidirectional chains, we reveal that there exists a certain coupling range in which the agents could be controlled regardless of the length of the chain. This feature enables the adaptive strategy to control the mobile oscillators regardless of their moving speed. Compared with existing adaptive control strategies for networked mobile agents, our proposed strategy is simpler for implementation where the resulting interaction networks are kept unweighted at all time.
QOS-aware error recovery in wireless body sensor networks using adaptive network coding.
Razzaque, Mohammad Abdur; Javadi, Saeideh S; Coulibaly, Yahaya; Hira, Muta Tah
2014-12-29
Wireless body sensor networks (WBSNs) for healthcare and medical applications are real-time and life-critical infrastructures, which require a strict guarantee of quality of service (QoS), in terms of latency, error rate and reliability. Considering the criticality of healthcare and medical applications, WBSNs need to fulfill users/applications and the corresponding network's QoS requirements. For instance, for a real-time application to support on-time data delivery, a WBSN needs to guarantee a constrained delay at the network level. A network coding-based error recovery mechanism is an emerging mechanism that can be used in these systems to support QoS at very low energy, memory and hardware cost. However, in dynamic network environments and user requirements, the original non-adaptive version of network coding fails to support some of the network and user QoS requirements. This work explores the QoS requirements of WBSNs in both perspectives of QoS. Based on these requirements, this paper proposes an adaptive network coding-based, QoS-aware error recovery mechanism for WBSNs. It utilizes network-level and user-/application-level information to make it adaptive in both contexts. Thus, it provides improved QoS support adaptively in terms of reliability, energy efficiency and delay. Simulation results show the potential of the proposed mechanism in terms of adaptability, reliability, real-time data delivery and network lifetime compared to its counterparts.
A complexity theory based on Boolean algebra
DEFF Research Database (Denmark)
Skyum, Sven; Valiant, Leslie
1985-01-01
A projection of a Boolean function is a function obtained by substituting for each of its variables a variable, the negation of a variable, or a constant. Reducibilities among computational problems under this relation of projection are considered. It is shown that much of what is of everyday rel...
Expressive power of LL( k ) Boolean grammars
National Research Council Canada - National Science Library
Okhotin, Alexander
2011-01-01
... alphabet, these languages are always regular, while Boolean LL subsets of Î£âaâ obey a certain periodicity property, which, in particular, makes the language {anb2n |n â©¾ 0} non- represen...
Robust adaptive synchronization of general dynamical networks ...
Indian Academy of Sciences (India)
1School of Information Science & Engineering, Northeastern University, Shenyang,. Liaoning, 110819, People's ... Introduction. Complex networks exist extensively in ecosystems, power grids, food webs and in many other spheres in our daily lives. Over the course of the past 30 years, technological revolu- tions of complex ...
Designing Networked Adaptive Interactive Hybrid Systems
Kester, L.J.H.M.
2008-01-01
Advances in network technologies enable distributed systems, operating in complex physical environments, to coordinate their activities over larger areas within shorter time intervals. In these systems humans and intelligent machines will, in close interaction, be able to reach their goals under
Adaptive Importance Sampling Simulation of Queueing Networks
de Boer, Pieter-Tjerk; Nicola, V.F.; Rubinstein, N.; Rubinstein, Reuven Y.
2000-01-01
In this paper, a method is presented for the efficient estimation of rare-event (overflow) probabilities in Jackson queueing networks using importance sampling. The method differs in two ways from methods discussed in most earlier literature: the change of measure is state-dependent, i.e., it is a
Adaptive traffic control systems for urban networks
Directory of Open Access Journals (Sweden)
Radivojević Danilo
2017-01-01
Full Text Available Adaptive traffic control systems represent complex, but powerful tool for improvement of traffic flow conditions in locations or zones where applied. Many traffic agencies, especially those that have a large number of signalized intersections with high variability of the traffic demand, choose to apply some of the adaptive traffic control systems. However, those systems are manufactured and offered by multiple vendors (companies that are competing for the market share. Due to that fact, besides the information available from the vendors themselves, or the information from different studies conducted on different continents, very limited amount of information is available about the details how those systems are operating. The reason for that is the protecting of the intellectual property from plagiarism. The primary goal of this paper is to make a brief analysis of the functionalities, characteristics, abilities and results of the most recognized, but also less known adaptive traffic control systems to the professional public and other persons with interest in this subject.
Adaptive relaying for ground fault protection of a distribution network
Energy Technology Data Exchange (ETDEWEB)
Sachdev, M.S.; Sidhu, T.S.; Talukdar, B.K. [Saskatchewan Univ., Saskatoon, SK (Canada)
1995-12-31
Adaptive protection was used for designing a protection system for the City of Saskatoon`s distribution network. The software and hardware were developed and the protection system was implemented in the laboratory at the University of Saskatchewan. In the first phase of the project, phase overcurrent relays were coordinated on the basis of three-phase faults. Most faults in distribution networks were single-phase to ground faults. Ground fault currents varied due to different grounding practices, changes in operating conditions and system topology. In the second phase of the project, adaptive capabilities for ground overcurrent and directional ground overcurrent protection were added. Software modules developed for achieving adaptive ground fault protection were described. Results from system studies carried out using the City of Saskatoon`s distribution network were also analyzed. 7 refs., 8 figs.
QoS-Aware Error Recovery in Wireless Body Sensor Networks Using Adaptive Network Coding
Directory of Open Access Journals (Sweden)
Mohammad Abdur Razzaque
2014-12-01
Full Text Available Wireless body sensor networks (WBSNs for healthcare and medical applications are real-time and life-critical infrastructures, which require a strict guarantee of quality of service (QoS, in terms of latency, error rate and reliability. Considering the criticality of healthcare and medical applications, WBSNs need to fulfill users/applications and the corresponding network’s QoS requirements. For instance, for a real-time application to support on-time data delivery, a WBSN needs to guarantee a constrained delay at the network level. A network coding-based error recovery mechanism is an emerging mechanism that can be used in these systems to support QoS at very low energy, memory and hardware cost. However, in dynamic network environments and user requirements, the original non-adaptive version of network coding fails to support some of the network and user QoS requirements. This work explores the QoS requirements of WBSNs in both perspectives of QoS. Based on these requirements, this paper proposes an adaptive network coding-based, QoS-aware error recovery mechanism for WBSNs. It utilizes network-level and user-/application-level information to make it adaptive in both contexts. Thus, it provides improved QoS support adaptively in terms of reliability, energy efficiency and delay. Simulation results show the potential of the proposed mechanism in terms of adaptability, reliability, real-time data delivery and network lifetime compared to its counterparts.
A candidate multimodal functional genetic network for thermal adaptation
Directory of Open Access Journals (Sweden)
Katharina C. Wollenberg Valero
2014-09-01
Full Text Available Vertebrate ectotherms such as reptiles provide ideal organisms for the study of adaptation to environmental thermal change. Comparative genomic and exomic studies can recover markers that diverge between warm and cold adapted lineages, but the genes that are functionally related to thermal adaptation may be difficult to identify. We here used a bioinformatics genome-mining approach to predict and identify functions for suitable candidate markers for thermal adaptation in the chicken. We first established a framework of candidate functions for such markers, and then compiled the literature on genes known to adapt to the thermal environment in different lineages of vertebrates. We then identified them in the genomes of human, chicken, and the lizard Anolis carolinensis, and established a functional genetic interaction network in the chicken. Surprisingly, markers initially identified from diverse lineages of vertebrates such as human and fish were all in close functional relationship with each other and more associated than expected by chance. This indicates that the general genetic functional network for thermoregulation and/or thermal adaptation to the environment might be regulated via similar evolutionarily conserved pathways in different vertebrate lineages. We were able to identify seven functions that were statistically overrepresented in this network, corresponding to four of our originally predicted functions plus three unpredicted functions. We describe this network as multimodal: central regulator genes with the function of relaying thermal signal (1, affect genes with different cellular functions, namely (2 lipoprotein metabolism, (3 membrane channels, (4 stress response, (5 response to oxidative stress, (6 muscle contraction and relaxation, and (7 vasodilation, vasoconstriction and regulation of blood pressure. This network constitutes a novel resource for the study of thermal adaptation in the closely related nonavian reptiles and
Topology detection for adaptive protection of distribution networks
Energy Technology Data Exchange (ETDEWEB)
Sachdev, M.S.; Sidhu, T.S.; Talukdar, B.K. [Univ. of Saskatchewan, Saskatoon, Saskatchewan (Canada). Power System Research Group
1995-12-31
A general purpose network topology detection technique suitable for use in adaptive relaying applications is presented in this paper. Three test systems were used to check the performance of the proposed technique. Results obtained from the tests are included. The proposed technique was implemented in the laboratory as a part of the implementation of the adaptive protection scheme. The execution times of the topology detection software were monitored and were found to be acceptable.
Scalable Harmonization of Complex Networks With Local Adaptive Controllers
Czech Academy of Sciences Publication Activity Database
Kárný, Miroslav; Herzallah, R.
2017-01-01
Roč. 47, č. 3 (2017), s. 394-404 ISSN 2168-2216 R&D Projects: GA ČR GA13-13502S Institutional support: RVO:67985556 Keywords : Adaptive control * Adaptive estimation * Bayes methods * Complex networks * Decentralized control * Feedback * Feedforward systems * Recursive estimation Subject RIV: BB - Applied Statistics, Operational Research Impact factor: 2.350, year: 2016 http://library.utia.cas.cz/separaty/2016/AS/karny-0457337.pdf
Adaptive thresholds for neural networks with synaptic noise.
Bollé, D; Heylen, R
2007-08-01
The inclusion of a macroscopic adaptive threshold is studied for the retrieval dynamics of both layered feedforward and fully connected neural network models with synaptic noise. These two types of architectures require a different method to be solved numerically. In both cases it is shown that, if the threshold is chosen appropriately as a function of the cross-talk noise and of the activity of the stored patterns, adapting itself automatically in the course of the recall process, an autonomous functioning of the network is guaranteed. This self-control mechanism considerably improves the quality of retrieval, in particular the storage capacity, the basins of attraction and the mutual information content.
Radio propagation and adaptive antennas for wireless communication networks
Blaunstein, Nathan
2014-01-01
Explores novel wireless networks beyond 3G, and advanced 4G technologies, such as MIMO, via propagation phenomena and the fundamentals of adapted antenna usage.Explains how adaptive antennas can improve GoS and QoS for any wireless channel, with specific examples and applications in land, aircraft and satellite communications.Introduces new stochastic approach based on several multi-parametric models describing various terrestrial scenarios, which have been experimentally verified in different environmental conditionsNew chapters on fundamentals of wireless networks, cellular and non-cellular,
Direct Adaptive Aircraft Control Using Dynamic Cell Structure Neural Networks
Jorgensen, Charles C.
1997-01-01
A Dynamic Cell Structure (DCS) Neural Network was developed which learns topology representing networks (TRNS) of F-15 aircraft aerodynamic stability and control derivatives. The network is integrated into a direct adaptive tracking controller. The combination produces a robust adaptive architecture capable of handling multiple accident and off- nominal flight scenarios. This paper describes the DCS network and modifications to the parameter estimation procedure. The work represents one step towards an integrated real-time reconfiguration control architecture for rapid prototyping of new aircraft designs. Performance was evaluated using three off-line benchmarks and on-line nonlinear Virtual Reality simulation. Flight control was evaluated under scenarios including differential stabilator lock, soft sensor failure, control and stability derivative variations, and air turbulence.
Adaptive bridge control strategy for opinion evolution on social networks.
Qian, Cheng; Cao, Jinde; Lu, Jianquan; Kurths, Jürgen
2011-06-01
In this paper, we present an efficient opinion control strategy for complex networks, in particular, for social networks. The proposed adaptive bridge control (ABC) strategy calls for controlling a special kind of nodes named bridge and requires no knowledge of the node degrees or any other global or local knowledge, which are necessary for some other immunization strategies including targeted immunization and acquaintance immunization. We study the efficiency of the proposed ABC strategy on random networks, small-world networks, scale-free networks, and the random networks adjusted by the edge exchanging method. Our results show that the proposed ABC strategy is efficient for all of these four kinds of networks. Through an adjusting clustering coefficient by the edge exchanging method, it is found out that the efficiency of our ABC strategy is closely related with the clustering coefficient. The main contributions of this paper can be listed as follows: (1) A new high-order social network is proposed to describe opinion dynamic. (2) An algorithm, which does not require the knowledge of the nodes' degree and other global∕local network structure information, is proposed to control the "bridges" more accurately and further control the opinion dynamics of the social networks. The efficiency of our ABC strategy is illustrated by numerical examples. (3) The numerical results indicate that our ABC strategy is more efficient for networks with higher clustering coefficient.
Shaping embodied neural networks for adaptive goal-directed behavior.
Directory of Open Access Journals (Sweden)
Zenas C Chao
2008-03-01
Full Text Available The acts of learning and memory are thought to emerge from the modifications of synaptic connections between neurons, as guided by sensory feedback during behavior. However, much is unknown about how such synaptic processes can sculpt and are sculpted by neuronal population dynamics and an interaction with the environment. Here, we embodied a simulated network, inspired by dissociated cortical neuronal cultures, with an artificial animal (an animat through a sensory-motor loop consisting of structured stimuli, detailed activity metrics incorporating spatial information, and an adaptive training algorithm that takes advantage of spike timing dependent plasticity. By using our design, we demonstrated that the network was capable of learning associations between multiple sensory inputs and motor outputs, and the animat was able to adapt to a new sensory mapping to restore its goal behavior: move toward and stay within a user-defined area. We further showed that successful learning required proper selections of stimuli to encode sensory inputs and a variety of training stimuli with adaptive selection contingent on the animat's behavior. We also found that an individual network had the flexibility to achieve different multi-task goals, and the same goal behavior could be exhibited with different sets of network synaptic strengths. While lacking the characteristic layered structure of in vivo cortical tissue, the biologically inspired simulated networks could tune their activity in behaviorally relevant manners, demonstrating that leaky integrate-and-fire neural networks have an innate ability to process information. This closed-loop hybrid system is a useful tool to study the network properties intermediating synaptic plasticity and behavioral adaptation. The training algorithm provides a stepping stone towards designing future control systems, whether with artificial neural networks or biological animats themselves.
Social Networking Adapted for Distributed Scientific Collaboration
Karimabadi, Homa
2012-01-01
Share is a social networking site with novel, specially designed feature sets to enable simultaneous remote collaboration and sharing of large data sets among scientists. The site will include not only the standard features found on popular consumer-oriented social networking sites such as Facebook and Myspace, but also a number of powerful tools to extend its functionality to a science collaboration site. A Virtual Observatory is a promising technology for making data accessible from various missions and instruments through a Web browser. Sci-Share augments services provided by Virtual Observatories by enabling distributed collaboration and sharing of downloaded and/or processed data among scientists. This will, in turn, increase science returns from NASA missions. Sci-Share also enables better utilization of NASA s high-performance computing resources by providing an easy and central mechanism to access and share large files on users space or those saved on mass storage. The most common means of remote scientific collaboration today remains the trio of e-mail for electronic communication, FTP for file sharing, and personalized Web sites for dissemination of papers and research results. Each of these tools has well-known limitations. Sci-Share transforms the social networking paradigm into a scientific collaboration environment by offering powerful tools for cooperative discourse and digital content sharing. Sci-Share differentiates itself by serving as an online repository for users digital content with the following unique features: a) Sharing of any file type, any size, from anywhere; b) Creation of projects and groups for controlled sharing; c) Module for sharing files on HPC (High Performance Computing) sites; d) Universal accessibility of staged files as embedded links on other sites (e.g. Facebook) and tools (e.g. e-mail); e) Drag-and-drop transfer of large files, replacing awkward e-mail attachments (and file size limitations); f) Enterprise-level data and
Opportunistic Adaptive Transmission for Network Coding Using Nonbinary LDPC Codes
Directory of Open Access Journals (Sweden)
Cocco Giuseppe
2010-01-01
Full Text Available Network coding allows to exploit spatial diversity naturally present in mobile wireless networks and can be seen as an example of cooperative communication at the link layer and above. Such promising technique needs to rely on a suitable physical layer in order to achieve its best performance. In this paper, we present an opportunistic packet scheduling method based on physical layer considerations. We extend channel adaptation proposed for the broadcast phase of asymmetric two-way bidirectional relaying to a generic number of sinks and apply it to a network context. The method consists of adapting the information rate for each receiving node according to its channel status and independently of the other nodes. In this way, a higher network throughput can be achieved at the expense of a slightly higher complexity at the transmitter. This configuration allows to perform rate adaptation while fully preserving the benefits of channel and network coding. We carry out an information theoretical analysis of such approach and of that typically used in network coding. Numerical results based on nonbinary LDPC codes confirm the effectiveness of our approach with respect to previously proposed opportunistic scheduling techniques.
Comparison of Seven Methods for Boolean Factor Analysis and Their Evaluation by Information Gain
Czech Academy of Sciences Publication Activity Database
Frolov, A.; Húsek, Dušan; Polyakov, P.Y.
2016-01-01
Roč. 27, č. 3 (2016), s. 538-550 ISSN 2162-237X R&D Projects: GA MŠk ED1.1.00/02.0070 Institutional support: RVO:67985807 Keywords : associative memory * bars problem (BP) * Boolean factor analysis (BFA) * data mining * dimension reduction * Hebbian learning rule * information gain * likelihood maximization (LM) * neural network application * recurrent neural network * statistics Subject RIV: IN - Informatics, Computer Science Impact factor: 6.108, year: 2016
Emergence of local synchronization in neuronal networks with adaptive couplings.
Directory of Open Access Journals (Sweden)
Shilpa Chakravartula
Full Text Available Local synchronization, both prolonged and transient, of oscillatory neuronal behavior in cortical networks plays a fundamental role in many aspects of perception and cognition. Here we study networks of Hindmarsh-Rose neurons with a new type of adaptive coupling, and show that these networks naturally produce both permanent and transient synchronization of local clusters of neurons. These deterministic systems exhibit complex dynamics with 1/fη power spectra, which appears to be a consequence of a novel form of self-organized criticality.
Emergence of local synchronization in neuronal networks with adaptive couplings.
Chakravartula, Shilpa; Indic, Premananda; Sundaram, Bala; Killingback, Timothy
2017-01-01
Local synchronization, both prolonged and transient, of oscillatory neuronal behavior in cortical networks plays a fundamental role in many aspects of perception and cognition. Here we study networks of Hindmarsh-Rose neurons with a new type of adaptive coupling, and show that these networks naturally produce both permanent and transient synchronization of local clusters of neurons. These deterministic systems exhibit complex dynamics with 1/fη power spectra, which appears to be a consequence of a novel form of self-organized criticality.
In-network adaptation of SHVC video in software-defined networks
Awobuluyi, Olatunde; Nightingale, James; Wang, Qi; Alcaraz Calero, Jose Maria; Grecos, Christos
2016-04-01
Software Defined Networks (SDN), when combined with Network Function Virtualization (NFV) represents a paradigm shift in how future networks will behave and be managed. SDN's are expected to provide the underpinning technologies for future innovations such as 5G mobile networks and the Internet of Everything. The SDN architecture offers features that facilitate an abstracted and centralized global network view in which packet forwarding or dropping decisions are based on application flows. Software Defined Networks facilitate a wide range of network management tasks, including the adaptation of real-time video streams as they traverse the network. SHVC, the scalable extension to the recent H.265 standard is a new video encoding standard that supports ultra-high definition video streams with spatial resolutions of up to 7680×4320 and frame rates of 60fps or more. The massive increase in bandwidth required to deliver these U-HD video streams dwarfs the bandwidth requirements of current high definition (HD) video. Such large bandwidth increases pose very significant challenges for network operators. In this paper we go substantially beyond the limited number of existing implementations and proposals for video streaming in SDN's all of which have primarily focused on traffic engineering solutions such as load balancing. By implementing and empirically evaluating an SDN enabled Media Adaptation Network Entity (MANE) we provide a valuable empirical insight into the benefits and limitations of SDN enabled video adaptation for real time video applications. The SDN-MANE is the video adaptation component of our Video Quality Assurance Manager (VQAM) SDN control plane application, which also includes an SDN monitoring component to acquire network metrics and a decision making engine using algorithms to determine the optimum adaptation strategy for any real time video application flow given the current network conditions. Our proposed VQAM application has been implemented and
Compensation for unmatched uncertainty with adaptive RBF network
African Journals Online (AJOL)
Robust control for nonlinear uncertain systems has been solved for matched uncertainty but has not been completely solved yet for unmatched uncertainty. This paper developed a new method in which an adaptive radial basis function neural network is used to compensate for the effects of unmatched uncertainty in the ...
Evolving RBF neural networks for adaptive soft-sensor design.
Alexandridis, Alex
2013-12-01
This work presents an adaptive framework for building soft-sensors based on radial basis function (RBF) neural network models. The adaptive fuzzy means algorithm is utilized in order to evolve an RBF network, which approximates the unknown system based on input-output data from it. The methodology gradually builds the RBF network model, based on two separate levels of adaptation: On the first level, the structure of the hidden layer is modified by adding or deleting RBF centers, while on the second level, the synaptic weights are adjusted with the recursive least squares with exponential forgetting algorithm. The proposed approach is tested on two different systems, namely a simulated nonlinear DC Motor and a real industrial reactor. The results show that the produced soft-sensors can be successfully applied to model the two nonlinear systems. A comparison with two different adaptive modeling techniques, namely a dynamic evolving neural-fuzzy inference system (DENFIS) and neural networks trained with online backpropagation, highlights the advantages of the proposed methodology.
Adaptive dynamic capacity borrowing in road-covering mobile networks
Ule, A.; Boucherie, Richardus J.; Li, W.; Pan, Y.
2006-01-01
This paper introduces adaptive dynamic capacity borrowing strategies for wireless networks covering a road. In a F/TDMA-based model, road traffic prediction models are used to characterise the movement of hot spots, such as traffic jams, and subsequently to predict the teletraffic load offered to
Dynamic Adaptive Neural Network Arrays: A Neuromorphic Architecture
Energy Technology Data Exchange (ETDEWEB)
Disney, Adam [University of Tennessee (UT); Reynolds, John [University of Tennessee (UT)
2015-01-01
Dynamic Adaptive Neural Network Array (DANNA) is a neuromorphic hardware implementation. It differs from most other neuromorphic projects in that it allows for programmability of structure, and it is trained or designed using evolutionary optimization. This paper describes the DANNA structure, how DANNA is trained using evolutionary optimization, and an application of DANNA to a very simple classification task.
Adaptive Media Access Control for Energy Harvesting - Wireless Sensor Networks
DEFF Research Database (Denmark)
Fafoutis, Xenofon; Dragoni, Nicola
2012-01-01
ODMAC (On-Demand Media Access Control) is a recently proposed MAC protocol designed to support individual duty cycles for Energy Harvesting — Wireless Sensor Networks (EH-WSNs). Individual duty cycles are vital for EH-WSNs, because they allow nodes to adapt their energy consumption to the ever...
Neural network based adaptive control for nonlinear dynamic regimes
Shin, Yoonghyun
Adaptive control designs using neural networks (NNs) based on dynamic inversion are investigated for aerospace vehicles which are operated at highly nonlinear dynamic regimes. NNs play a key role as the principal element of adaptation to approximately cancel the effect of inversion error, which subsequently improves robustness to parametric uncertainty and unmodeled dynamics in nonlinear regimes. An adaptive control scheme previously named 'composite model reference adaptive control' is further developed so that it can be applied to multi-input multi-output output feedback dynamic inversion. It can have adaptive elements in both the dynamic compensator (linear controller) part and/or in the conventional adaptive controller part, also utilizing state estimation information for NN adaptation. This methodology has more flexibility and thus hopefully greater potential than conventional adaptive designs for adaptive flight control in highly nonlinear flight regimes. The stability of the control system is proved through Lyapunov theorems, and validated with simulations. The control designs in this thesis also include the use of 'pseudo-control hedging' techniques which are introduced to prevent the NNs from attempting to adapt to various actuation nonlinearities such as actuator position and rate saturations. Control allocation is introduced for the case of redundant control effectors including thrust vectoring nozzles. A thorough comparison study of conventional and NN-based adaptive designs for a system under a limit cycle, wing-rock, is included in this research, and the NN-based adaptive control designs demonstrate their performances for two highly maneuverable aerial vehicles, NASA F-15 ACTIVE and FQM-117B unmanned aerial vehicle (UAV), operated under various nonlinearities and uncertainties.
Adaptive clustering algorithm for community detection in complex networks
Ye, Zhenqing; Hu, Songnian; Yu, Jun
2008-10-01
Community structure is common in various real-world networks; methods or algorithms for detecting such communities in complex networks have attracted great attention in recent years. We introduced a different adaptive clustering algorithm capable of extracting modules from complex networks with considerable accuracy and robustness. In this approach, each node in a network acts as an autonomous agent demonstrating flocking behavior where vertices always travel toward their preferable neighboring groups. An optimal modular structure can emerge from a collection of these active nodes during a self-organization process where vertices constantly regroup. In addition, we show that our algorithm appears advantageous over other competing methods (e.g., the Newman-fast algorithm) through intensive evaluation. The applications in three real-world networks demonstrate the superiority of our algorithm to find communities that are parallel with the appropriate organization in reality.
"Antelope": a hybrid-logic model checker for branching-time Boolean GRN analysis
Directory of Open Access Journals (Sweden)
Arellano Gustavo
2011-12-01
Full Text Available Abstract Background In Thomas' formalism for modeling gene regulatory networks (GRNs, branching time, where a state can have more than one possible future, plays a prominent role. By representing a certain degree of unpredictability, branching time can model several important phenomena, such as (a asynchrony, (b incompletely specified behavior, and (c interaction with the environment. Introducing more than one possible future for a state, however, creates a difficulty for ordinary simulators, because infinitely many paths may appear, limiting ordinary simulators to statistical conclusions. Model checkers for branching time, by contrast, are able to prove properties in the presence of infinitely many paths. Results We have developed Antelope ("Analysis of Networks through TEmporal-LOgic sPEcifications", http://turing.iimas.unam.mx:8080/AntelopeWEB/, a model checker for analyzing and constructing Boolean GRNs. Currently, software systems for Boolean GRNs use branching time almost exclusively for asynchrony. Antelope, by contrast, also uses branching time for incompletely specified behavior and environment interaction. We show the usefulness of modeling these two phenomena in the development of a Boolean GRN of the Arabidopsis thaliana root stem cell niche. There are two obstacles to a direct approach when applying model checking to Boolean GRN analysis. First, ordinary model checkers normally only verify whether or not a given set of model states has a given property. In comparison, a model checker for Boolean GRNs is preferable if it reports the set of states having a desired property. Second, for efficiency, the expressiveness of many model checkers is limited, resulting in the inability to express some interesting properties of Boolean GRNs. Antelope tries to overcome these two drawbacks: Apart from reporting the set of all states having a given property, our model checker can express, at the expense of efficiency, some properties that ordinary
A Prediction-Driven Adaptation Approach for Self-Adaptive Sensor Networks
Paez Anaya, Ivan Dario; Simko, Viliam; Bourcier, Johann; Plouzeau, Noël; Jézéquel, Jean-Marc
2014-01-01
International audience; Engineering self-adaptive software in unpredictable environments such as pervasive systems, where network's ability, remaining battery power and environmental conditions may vary over the lifetime of the system is a very challenging task. Many current software engineering approaches leverage run-time architectural models to ease the design of the autonomic control loop of these self-adaptive systems. While these approaches perform well in reacting to various evolutions...
Totally optimal decision trees for Boolean functions
Chikalov, Igor
2016-07-28
We study decision trees which are totally optimal relative to different sets of complexity parameters for Boolean functions. A totally optimal tree is an optimal tree relative to each parameter from the set simultaneously. We consider the parameters characterizing both time (in the worst- and average-case) and space complexity of decision trees, i.e., depth, total path length (average depth), and number of nodes. We have created tools based on extensions of dynamic programming to study totally optimal trees. These tools are applicable to both exact and approximate decision trees, and allow us to make multi-stage optimization of decision trees relative to different parameters and to count the number of optimal trees. Based on the experimental results we have formulated the following hypotheses (and subsequently proved): for almost all Boolean functions there exist totally optimal decision trees (i) relative to the depth and number of nodes, and (ii) relative to the depth and average depth.
Adaptive relaying for ground fault protection of distribution network
Energy Technology Data Exchange (ETDEWEB)
Sachdev, M. S.; Sidhu, T. S.; Talukdar, B. K.
1995-06-01
In consequence of the increasing complexity of power distribution networks frequent changes in relay settings to achieve effective protection against ground faults is essential. The principal focus of this paper was adaptive relaying which makes use of digital technology and microprocessors to design systems which can provide protection of complex distribution networks under all operating conditions. Specifically, the paper described software modules that were developed to achieve this capability, developed for the City of Saskatoon`s distribution network. The system provides reliable, fast and selective protection of all components of the distribution system by constantly monitoring all the buses and currents in the circuit by substation computers, which are under the control of a central control computer. In addition to adaptive protection, the system can also provide optimal control of feeder loads, transformers, reactors, and capacitors, cold load pick up and reclosing of circuit breakers and reclosers. 2 refs., 8 figs.
Dual adaptive dynamic control of mobile robots using neural networks.
Bugeja, Marvin K; Fabri, Simon G; Camilleri, Liberato
2009-02-01
This paper proposes two novel dual adaptive neural control schemes for the dynamic control of nonholonomic mobile robots. The two schemes are developed in discrete time, and the robot's nonlinear dynamic functions are assumed to be unknown. Gaussian radial basis function and sigmoidal multilayer perceptron neural networks are used for function approximation. In each scheme, the unknown network parameters are estimated stochastically in real time, and no preliminary offline neural network training is used. In contrast to other adaptive techniques hitherto proposed in the literature on mobile robots, the dual control laws presented in this paper do not rely on the heuristic certainty equivalence property but account for the uncertainty in the estimates. This results in a major improvement in tracking performance, despite the plant uncertainty and unmodeled dynamics. Monte Carlo simulation and statistical hypothesis testing are used to illustrate the effectiveness of the two proposed stochastic controllers as applied to the trajectory-tracking problem of a differentially driven wheeled mobile robot.
DEFF Research Database (Denmark)
Hundebøll, Martin; Pedersen, Morten Videbæk; Roetter, Daniel Enrique Lucani
2014-01-01
This work studies the potential and impact of the FRANC network coding protocol for delivering high quality Dynamic Adaptive Streaming over HTTP (DASH) in wireless networks. Although DASH aims to tailor the video quality rate based on the available throughput to the destination, it relies...
Network Experiences Lead to the Adaption of a Firm’s Network Competence
Directory of Open Access Journals (Sweden)
Bianka Kühne
2011-12-01
Full Text Available Networks become increasingly important as external sources of innovation for firms. Through networks firms get incontact with different actors with whom they can exchange information and collaborate. A firm’s ability to be asuccessful network actor depends on its network competence. This term can be defined as having the necessaryknowledge, skills and qualifications for networking as well as using them effectively. In this paper we investigate thelink between a firm’s network competence and the benefits resulting from it in a two‐way direction. First, thenetwork competence of the firm facilitates the adoption of information from other network actors which may leadto innovation success. Second the perceived network benefits shall in their turn influence the network competenceof the firm. Consequently, firms will adapt their network strategy corresponding their experiences. The objective ofthis paper is to investigate the dynamics of networking and its influence on the firm’s network competence. For thisexploratory research 3 Belgian networks are examined. In‐depth interviews are used in combination with semistructuredinterview guides to conduct the research. Our results indicate that some firms perceive benefits fromtheir network efforts, for others it is more a burden. Furthermore, in some of our cases we found that positiveexperiences with clear benefits motivate the firm to enhance its network competence. This is illustrated by the factthat collaborations are more frequently initiated, trust is more easily build, firms are more open to communicateinformation and the confidentiality threshold is overcome.
Spontaneous formation of dynamical groups in an adaptive networked system
Li, Menghui; Guan, Shuguang; Lai, C.-H.
2010-10-01
In this work, we investigate a model of an adaptive networked dynamical system, where the coupling strengths among phase oscillators coevolve with the phase states. It is shown that in this model the oscillators can spontaneously differentiate into two dynamical groups after a long time evolution. Within each group, the oscillators have similar phases, while oscillators in different groups have approximately opposite phases. The network gradually converts from the initial random structure with a uniform distribution of connection strengths into a modular structure that is characterized by strong intra-connections and weak inter-connections. Furthermore, the connection strengths follow a power-law distribution, which is a natural consequence of the coevolution of the network and the dynamics. Interestingly, it is found that if the inter-connections are weaker than a certain threshold, the two dynamical groups will almost decouple and evolve independently. These results are helpful in further understanding the empirical observations in many social and biological networks.
SVC VIDEO STREAM ALLOCATION AND ADAPTATION IN HETEROGENEOUS NETWORK
Directory of Open Access Journals (Sweden)
E. A. Pakulova
2016-07-01
Full Text Available The paper deals with video data transmission in format H.264/SVC standard with QoS requirements satisfaction. The Sender-Side Path Scheduling (SSPS algorithm and Sender-Side Video Adaptation (SSVA algorithm were developed. SSPS algorithm gives the possibility to allocate video traffic among several interfaces while SSVA algorithm dynamically changes the quality of video sequence in relation to QoS requirements. It was shown that common usage of two developed algorithms enables to aggregate throughput of access networks, increase parameters of Quality of Experience and decrease losses in comparison with Round Robin algorithm. For evaluation of proposed solution, the set-up was made. The trace files with throughput of existing public networks were used in experiments. Based on this information the throughputs of networks were limited and losses for paths were set. The results of research may be used for study and transmission of video data in heterogeneous wireless networks.
Exploring complex networks by means of adaptive walkers.
Prignano, Luce; Moreno, Yamir; Díaz-Guilera, Albert
2012-12-01
Finding efficient algorithms to explore large networks with the aim of recovering information about their structure is an open problem. Here, we investigate this challenge by proposing a model in which random walkers with previously assigned home nodes navigate through the network during a fixed amount of time. We consider that the exploration is successful if the walker gets the information gathered back home, otherwise no data are retrieved. Consequently, at each time step, the walkers, with some probability, have the choice to either go backward approaching their home or go farther away. We show that there is an optimal solution to this problem in terms of the average information retrieved and the degree of the home nodes and design an adaptive strategy based on the behavior of the random walker. Finally, we compare different strategies that emerge from the model in the context of network reconstruction. Our results could be useful for the discovery of unknown connections in large-scale networks.
An Adaptive Relocation Strategy for heterogeneous sensor networks
Directory of Open Access Journals (Sweden)
Salah Abdel-Mageid
2011-07-01
Full Text Available Heterogeneous sensor networks (HSNs have grown to be familiar in recent years due to their capabilities to increase network lifetime and reliability without a significant increase in the cost. Deploying sensor nodes in large-scale applications (i.e., battlefields and environmental monitoring requires decentralized solutions. In this paper, we propose a novel decentralized approach enabling us to consider the heterogeneous characteristics of sensor nodes. In the Adaptive Relocation Strategy, new geometric approaches are designed to perfectly deal with the most heterogeneous sensor characteristics. The simulation results are presented to show that the proposed solution achieves the high coverage performance in few rounds with minimum energy consumption and minimum computations. The performance comparison is also introduced to study how the designed parameters affect the network performance in terms of the network cost, the coverage enhancement, and the total energy consumption measured by the computational complexity and the average moving distance.
Stiller, S.J.; Meijerink, S.V.
2016-01-01
In the climate adaptation literature, leadership tends to be an understudied factor, although it may be crucial for regional adaptation governance. This article shows how leadership can be usefully conceptualized and operationalized within regional governance networks dealing with climate
Adaptive nonlinear control of missiles using neural networks
McFarland, Michael Bryan
Research has shown that neural networks can be used to improve upon approximate dynamic inversion for control of uncertain nonlinear systems. In one architecture, the neural network adaptively cancels inversion errors through on-line learning. Such learning is accomplished by a simple weight update rule derived from Lyapunov theory, thus assuring stability of the closed-loop system. In this research, previous results using linear-in-parameters neural networks were reformulated in the context of a more general class of composite nonlinear systems, and the control scheme was shown to possess important similarities and major differences with established methods of adaptive control. The neural-adaptive nonlinear control methodology in question has been used to design an autopilot for an anti-air missile with enhanced agile maneuvering capability, and simulation results indicate that this approach is a feasible one. There are, however, certain difficulties associated with choosing the proper network architecture which make it difficult to achieve the rapid learning required in this application. Accordingly, this technique has been further extended to incorporate the important class of feedforward neural networks with a single hidden layer. These neural networks feature well-known approximation capabilities and provide an effective, although nonlinear, parameterization of the adaptive control problem. Numerical results from a six-degree-of-freedom nonlinear agile anti-air missile simulation demonstrate the effectiveness of the autopilot design based on multilayer networks. Previous work in this area has implicitly assumed precise knowledge of the plant order, and made no allowances for unmodeled dynamics. This thesis describes an approach to the problem of controlling a class of nonlinear systems in the face of both unknown nonlinearities and unmodeled dynamics. The proposed methodology is similar to robust adaptive control techniques derived for control of linear
Coupled interference based rate adaptation in ad hoc networks
CSIR Research Space (South Africa)
Awuor, F
2011-09-01
Full Text Available since the channel condition is time variant [5], [6]. Hence CIN considers link adaptation based on SINR performance to derive transmit power that minimizes coupled interference in the network. In [5], an algorithm is proposed where an average value... channel condition variance for proper choice of PHY mode. In [7], rate adaptation scheme is proposed wherein nodes select the power-rate pair to maximize their utility based on the previous measured SINRs. The values of SINR employed by [5],[6] and [7...
Adaptive Regularization of Neural Networks Using Conjugate Gradient
DEFF Research Database (Denmark)
Goutte, Cyril; Larsen, Jan
1998-01-01
Andersen et al. (1997) and Larsen et al. (1996, 1997) suggested a regularization scheme which iteratively adapts regularization parameters by minimizing validation error using simple gradient descent. In this contribution we present an improved algorithm based on the conjugate gradient technique........ Numerical experiments with feedforward neural networks successfully demonstrate improved generalization ability and lower computational cost......Andersen et al. (1997) and Larsen et al. (1996, 1997) suggested a regularization scheme which iteratively adapts regularization parameters by minimizing validation error using simple gradient descent. In this contribution we present an improved algorithm based on the conjugate gradient technique...
National Research Council Canada - National Science Library
Julian Zubek; Michał Denkiewicz; Juliusz Barański; Przemysław Wróblewski; Joanna Rączaszek-Leonardi; Dariusz Plewczynski
2017-01-01
... network centrality measures. We measure dynamic social adaptation when either network topology or environment is subject to change during the experiment, and the system has to adapt to new conditions...
Boolean Differentiation Equations Applicable in Reconfigurable Computational Medium
Directory of Open Access Journals (Sweden)
Shidlovskiy Stanislav
2016-01-01
Full Text Available High performance computing environment synthesis with parallel architecture reconstructing throughout the process itself is described. Synthesized computational medium involving Boolean differential equation calculations so as to function in real-time image processing. Automaton imaging was illustrated involving the rearrangement of every processing medium element to calculate the partial differentials of n-th order in respect to Boolean function variables. The method of obtaining setting codes for each element was also described. An example in calculating 2nd -order Boolean derivative to two differentials in respect to Boolean functions, depending on three arguments within the reconstructible computational medium of 8×8 processing elements was given.
The Number of Monotone and Self-Dual Boolean Functions
Directory of Open Access Journals (Sweden)
Haviarova L.
2014-12-01
Full Text Available In the present paper we study properties of pre-complete class of Boolean functions - monotone Boolean functions. We discuss interval graph, the abbreviated d.n.f., a minimal d.n.f. and a shortest d.n.f. of this function. Then we present a d.n.f. with the highest number of conjunctionsand we determinate the exact number of them. We count the number of monotone Boolean functions with some special properties. In the end we estimate the number of Boolean functionthat are monotone and self-dual at the same time.
Directory of Open Access Journals (Sweden)
Jiao-Hong Yi
2016-01-01
Full Text Available Probabilistic neural network has successfully solved all kinds of engineering problems in various fields since it is proposed. In probabilistic neural network, Spread has great influence on its performance, and probabilistic neural network will generate bad prediction results if it is improperly selected. It is difficult to select the optimal manually. In this article, a variant of probabilistic neural network with self-adaptive strategy, called self-adaptive probabilistic neural network, is proposed. In self-adaptive probabilistic neural network, Spread can be self-adaptively adjusted and selected and then the best selected Spread is used to guide the self-adaptive probabilistic neural network train and test. In addition, two simplified strategies are incorporated into the proposed self-adaptive probabilistic neural network with the aim of further improving its performance and then two versions of simplified self-adaptive probabilistic neural network (simplified self-adaptive probabilistic neural networks 1 and 2 are proposed. The variants of self-adaptive probabilistic neural networks are further applied to solve the transformer fault diagnosis problem. By comparing them with basic probabilistic neural network, and the traditional back propagation, extreme learning machine, general regression neural network, and self-adaptive extreme learning machine, the results have experimentally proven that self-adaptive probabilistic neural networks have a more accurate prediction and better generalization performance when addressing the transformer fault diagnosis problem.
Adaptive Reference Control for Pressure Management in Water Networks
DEFF Research Database (Denmark)
Kallesøe, Carsten; Jensen, Tom Nørgaard; Wisniewski, Rafal
2015-01-01
Water scarcity is an increasing problem worldwide and at the same time a huge amount of water is lost through leakages in the distribution network. It is well known that improved pressure control can lower the leakage problems. In this work water networks with a single pressure actuator and several....... Subsequently, these relations are exploited in an adaptive reference control scheme for the actuator pressure that ensures constant pressure at the critical points. Numerical experiments underpin the results. © Copyright IEEE - All rights reserved....
Effects of Adaptive Wormhole Routing in Event Builder Networks
Moser, R; Branson, J; Brett, A; Cano, E; Carboni, A; Ciganek, M; Cittolin, S; Erhan, S; Gigi, D; Glege, F; Gómez-Reino, Robert; Gulmini, M; Gutiérrez-Mlot, E; Gutleber, J; Jacobs, C; Kim, J C; Klute, M; Lipeles, E; Lopez-Perez, Juan Antonio; Maron, G; Meijers, F; Meschi, E; Murray, S; Oh, A; Orsini, L; Paus, C; Petrucci, A; Pieri, M; Pollet, L; Rácz, A; Sakulin, H; Sani, M; Schieferdecker, P; Schwick, C; Sumorok, K; Suzuki, I; Tsirigkas, D; Varela, J; Bauer, G
2007-01-01
The data acquisition system of the CMS experiment at the Large Hadron Collider features a two-stage event builder, which combines data from about 500 sources into full events at an aggregate throughput of 100 GByte/s. To meet the requirements, several architectures and interconnect technologies have been quantitatively evaluated. Both Gigabit Ethernet and Myrinet networks will be employed during the first run. Nearly full bi-section throughput can be obtained using a custom software driver for Myrinet based on barrel shifter traffic shaping. This paper discusses the use of Myrinet dual-port network interface cards supporting channel bonding to achieve virtual 5GBit/s links with adaptive routing to alleviate the throughput limitations associated with wormhole routing. Adaptive routing is not expected to be suitable for high-throughput event builder applications in high-energy physics. To corroborate this claim, results from the CMS event builder preseries installation at CERN are presented and the problems of ...
Adaptive PID control based on orthogonal endocrine neural networks.
Milovanović, Miroslav B; Antić, Dragan S; Milojković, Marko T; Nikolić, Saša S; Perić, Staniša Lj; Spasić, Miodrag D
2016-12-01
A new intelligent hybrid structure used for online tuning of a PID controller is proposed in this paper. The structure is based on two adaptive neural networks, both with built-in Chebyshev orthogonal polynomials. First substructure network is a regular orthogonal neural network with implemented artificial endocrine factor (OENN), in the form of environmental stimuli, to its weights. It is used for approximation of control signals and for processing system deviation/disturbance signals which are introduced in the form of environmental stimuli. The output values of OENN are used to calculate artificial environmental stimuli (AES), which represent required adaptation measure of a second network-orthogonal endocrine adaptive neuro-fuzzy inference system (OEANFIS). OEANFIS is used to process control, output and error signals of a system and to generate adjustable values of proportional, derivative, and integral parameters, used for online tuning of a PID controller. The developed structure is experimentally tested on a laboratory model of the 3D crane system in terms of analysing tracking performances and deviation signals (error signals) of a payload. OENN-OEANFIS performances are compared with traditional PID and 6 intelligent PID type controllers. Tracking performance comparisons (in transient and steady-state period) showed that the proposed adaptive controller possesses performances within the range of other tested controllers. The main contribution of OENN-OEANFIS structure is significant minimization of deviation signals (17%-79%) compared to other controllers. It is recommended to exploit it when dealing with a highly nonlinear system which operates in the presence of undesirable disturbances. Copyright © 2016 Elsevier Ltd. All rights reserved.
Naming game with biased assimilation over adaptive networks
Fu, Guiyuan; Zhang, Weidong
2018-01-01
The dynamics of two-word naming game incorporating the influence of biased assimilation over adaptive network is investigated in this paper. Firstly an extended naming game with biased assimilation (NGBA) is proposed. The hearer in NGBA accepts the received information in a biased manner, where he may refuse to accept the conveyed word from the speaker with a predefined probability, if the conveyed word is different from his current memory. Secondly, the adaptive network is formulated by rewiring the links. Theoretical analysis is developed to show that the population in NGBA will eventually reach global consensus on either A or B. Numerical simulation results show that the larger strength of biased assimilation on both words, the slower convergence speed, while larger strength of biased assimilation on only one word can slightly accelerate the convergence; larger population size can make the rate of convergence slower to a large extent when it increases from a relatively small size, while such effect becomes minor when the population size is large; the behavior of adaptively reconnecting the existing links can greatly accelerate the rate of convergence especially on the sparse connected network.
Complex Environmental Data Modelling Using Adaptive General Regression Neural Networks
Kanevski, Mikhail
2015-04-01
The research deals with an adaptation and application of Adaptive General Regression Neural Networks (GRNN) to high dimensional environmental data. GRNN [1,2,3] are efficient modelling tools both for spatial and temporal data and are based on nonparametric kernel methods closely related to classical Nadaraya-Watson estimator. Adaptive GRNN, using anisotropic kernels, can be also applied for features selection tasks when working with high dimensional data [1,3]. In the present research Adaptive GRNN are used to study geospatial data predictability and relevant feature selection using both simulated and real data case studies. The original raw data were either three dimensional monthly precipitation data or monthly wind speeds embedded into 13 dimensional space constructed by geographical coordinates and geo-features calculated from digital elevation model. GRNN were applied in two different ways: 1) adaptive GRNN with the resulting list of features ordered according to their relevancy; and 2) adaptive GRNN applied to evaluate all possible models N [in case of wind fields N=(2^13 -1)=8191] and rank them according to the cross-validation error. In both cases training were carried out applying leave-one-out procedure. An important result of the study is that the set of the most relevant features depends on the month (strong seasonal effect) and year. The predictabilities of precipitation and wind field patterns, estimated using the cross-validation and testing errors of raw and shuffled data, were studied in detail. The results of both approaches were qualitatively and quantitatively compared. In conclusion, Adaptive GRNN with their ability to select features and efficient modelling of complex high dimensional data can be widely used in automatic/on-line mapping and as an integrated part of environmental decision support systems. 1. Kanevski M., Pozdnoukhov A., Timonin V. Machine Learning for Spatial Environmental Data. Theory, applications and software. EPFL Press
Ma, Chuang; Bao, Zhong-Kui; Zhang, Hai-Feng
2017-10-01
So far, many network-structure-based link prediction methods have been proposed. However, these methods only highlight one or two structural features of networks, and then use the methods to predict missing links in different networks. The performances of these existing methods are not always satisfied in all cases since each network has its unique underlying structural features. In this paper, by analyzing different real networks, we find that the structural features of different networks are remarkably different. In particular, even in the same network, their inner structural features are utterly different. Therefore, more structural features should be considered. However, owing to the remarkably different structural features, the contributions of different features are hard to be given in advance. Inspired by these facts, an adaptive fusion model regarding link prediction is proposed to incorporate multiple structural features. In the model, a logistic function combing multiple structural features is defined, then the weight of each feature in the logistic function is adaptively determined by exploiting the known structure information. Last, we use the "learnt" logistic function to predict the connection probabilities of missing links. According to our experimental results, we find that the performance of our adaptive fusion model is better than many similarity indices.
Kenney, Michael; Horgan, John; Horne, Cale; Vining, Peter; Carley, Kathleen M; Bigrigg, Michael W; Bloom, Mia; Braddock, Kurt
2013-09-01
Social networks are said to facilitate learning and adaptation by providing the connections through which network nodes (or agents) share information and experience. Yet, our understanding of how this process unfolds in real-world networks remains underdeveloped. This paper explores this gap through a case study of al-Muhajiroun, an activist network that continues to call for the establishment of an Islamic state in Britain despite being formally outlawed by British authorities. Drawing on organisation theory and social network analysis, we formulate three hypotheses regarding the learning capacity and social network properties of al-Muhajiroun (AM) and its successor groups. We then test these hypotheses using mixed methods. Our methods combine quantitative analysis of three agent-based networks in AM measured for structural properties that facilitate learning, including connectedness, betweenness centrality and eigenvector centrality, with qualitative analysis of interviews with AM activists focusing organisational adaptation and learning. The results of these analyses confirm that al-Muhajiroun activists respond to government pressure by changing their operations, including creating new platforms under different names and adjusting leadership roles among movement veterans to accommodate their spiritual leader's unwelcome exodus to Lebanon. Simple as they are effective, these adaptations have allowed al-Muhajiroun and its successor groups to continue their activism in an increasingly hostile environment. Copyright © 2012 Elsevier Ltd and The Ergonomics Society. All rights reserved.
Supervised Learning in Adaptive DNA Strand Displacement Networks.
Lakin, Matthew R; Stefanovic, Darko
2016-08-19
The development of engineered biochemical circuits that exhibit adaptive behavior is a key goal of synthetic biology and molecular computing. Such circuits could be used for long-term monitoring and control of biochemical systems, for instance, to prevent disease or to enable the development of artificial life. In this article, we present a framework for developing adaptive molecular circuits using buffered DNA strand displacement networks, which extend existing DNA strand displacement circuit architectures to enable straightforward storage and modification of behavioral parameters. As a proof of concept, we use this framework to design and simulate a DNA circuit for supervised learning of a class of linear functions by stochastic gradient descent. This work highlights the potential of buffered DNA strand displacement as a powerful circuit architecture for implementing adaptive molecular systems.
Adaptive Gain Scheduled Semiactive Vibration Control Using a Neural Network
Directory of Open Access Journals (Sweden)
Kazuhiko Hiramoto
2018-01-01
Full Text Available We propose an adaptive gain scheduled semiactive control method using an artificial neural network for structural systems subject to earthquake disturbance. In order to design a semiactive control system with high control performance against earthquakes with different time and/or frequency properties, multiple semiactive control laws with high performance for each of multiple earthquake disturbances are scheduled with an adaptive manner. Each semiactive control law to be scheduled is designed based on the output emulation approach that has been proposed by the authors. As the adaptive gain scheduling mechanism, we introduce an artificial neural network (ANN. Input signals of the ANN are the measured earthquake disturbance itself, for example, the acceleration, velocity, and displacement. The output of the ANN is the parameter for the scheduling of multiple semiactive control laws each of which has been optimized for a single disturbance. Parameters such as weight and bias in the ANN are optimized by the genetic algorithm (GA. The proposed design method is applied to semiactive control design of a base-isolated building with a semiactive damper. With simulation study, the proposed adaptive gain scheduling method realizes control performance exceeding single semiactive control optimizing the average of the control performance subject to various earthquake disturbances.
Adaptive comanagement of a marine protected area network in Fiji.
Weeks, Rebecca; Jupiter, Stacy D
2013-12-01
Adaptive management of natural resources is an iterative process of decision making whereby management strategies are progressively changed or adjusted in response to new information. Despite an increasing focus on the need for adaptive conservation strategies, there remain few applied examples. We describe the 9-year process of adaptive comanagement of a marine protected area network in Kubulau District, Fiji. In 2011, a review of protected area boundaries and management rules was motivated by the need to enhance management effectiveness and the desire to improve resilience to climate change. Through a series of consultations, with the Wildlife Conservation Society providing scientific input to community decision making, the network of marine protected areas was reconfigured so as to maximize resilience and compliance. Factors identified as contributing to this outcome include well-defined resource-access rights; community respect for a flexible system of customary governance; long-term commitment and presence of comanagement partners; supportive policy environment for comanagement; synthesis of traditional management approaches with systematic monitoring; and district-wide coordination, which provided a broader spatial context for adaptive-management decision making. Co-Manejo Adaptativo de una Red de Áreas Marinas Protegidas en Fiyi. © 2013 The Authors. Conservation Biology published by Wiley Periodicals, Inc., on behalf of the Society for Conservation Biology.
Sparse gamma rhythms arising through clustering in adapting neuronal networks.
Directory of Open Access Journals (Sweden)
Zachary P Kilpatrick
2011-11-01
Full Text Available Gamma rhythms (30-100 Hz are an extensively studied synchronous brain state responsible for a number of sensory, memory, and motor processes. Experimental evidence suggests that fast-spiking interneurons are responsible for carrying the high frequency components of the rhythm, while regular-spiking pyramidal neurons fire sparsely. We propose that a combination of spike frequency adaptation and global inhibition may be responsible for this behavior. Excitatory neurons form several clusters that fire every few cycles of the fast oscillation. This is first shown in a detailed biophysical network model and then analyzed thoroughly in an idealized model. We exploit the fact that the timescale of adaptation is much slower than that of the other variables. Singular perturbation theory is used to derive an approximate periodic solution for a single spiking unit. This is then used to predict the relationship between the number of clusters arising spontaneously in the network as it relates to the adaptation time constant. We compare this to a complementary analysis that employs a weak coupling assumption to predict the first Fourier mode to destabilize from the incoherent state of an associated phase model as the external noise is reduced. Both approaches predict the same scaling of cluster number with respect to the adaptation time constant, which is corroborated in numerical simulations of the full system. Thus, we develop several testable predictions regarding the formation and characteristics of gamma rhythms with sparsely firing excitatory neurons.
A Bayesian regularized artificial neural network for adaptive optics forecasting
Sun, Zhi; Chen, Ying; Li, Xinyang; Qin, Xiaolin; Wang, Huiyong
2017-01-01
Real-time adaptive optics is a technology for enhancing the resolution of ground-based optical telescopes and overcoming the disturbance of atmospheric turbulence. The performance of the system is limited by delay errors induced by the servo system and photoelectrons noise of wavefront sensor. In order to cut these delay errors, this paper proposes a novel model to forecast the future control voltages of the deformable mirror. The predictive model is constructed by a multi-layered back propagation network with Bayesian regularization (BRBP). For the purpose of parallel computation and less disturbance, we adopt a number of sub-BP neural networks to substitute the whole network. The Bayesian regularized network assigns a probability to the network weights, allowing the network to automatically and optimally penalize excessively complex models. The simulation results show that the BRBP introduces smaller mean absolute percentage error (MAPE) and mean square errors (MSE) than other typical algorithms. Meanwhile, real data analysis results show that the BRBP model has strong generalization capability and parallelism.
LAMAN: Load Adaptable MAC for Ad Hoc Networks
Directory of Open Access Journals (Sweden)
Realp Marc
2005-01-01
Full Text Available In mobile ad hoc radio networks, mechanisms on how to access the radio channel are extremely important in order to improve network efficiency. In this paper, the load adaptable medium access control for ad hoc networks (LAMAN protocol is described. LAMAN is a novel decentralized multipacket MAC protocol designed following a cross-layer approach. Basically, this protocol is a hybrid CDMA-TDMA-based protocol that aims at throughput maximization in multipacket communication environments by efficiently combining contention and conflict-free protocol components. Such combination of components is used to adapt the nodes' access priority to changes on the traffic load while, at the same time, accounting for the multipacket reception (MPR capability of the receivers. A theoretical analysis of the system is developed presenting closed expressions of network throughput and packet delay. By simulations the validity of our analysis is shown and the performances of a LAMAN-based system and an Aloha-CDMA-based one are compared.
Adaptive multi-resolution Modularity for detecting communities in networks
Chen, Shi; Wang, Zhi-Zhong; Bao, Mei-Hua; Tang, Liang; Zhou, Ji; Xiang, Ju; Li, Jian-Ming; Yi, Chen-He
2018-02-01
Community structure is a common topological property of complex networks, which attracted much attention from various fields. Optimizing quality functions for community structures is a kind of popular strategy for community detection, such as Modularity optimization. Here, we introduce a general definition of Modularity, by which several classical (multi-resolution) Modularity can be derived, and then propose a kind of adaptive (multi-resolution) Modularity that can combine the advantages of different Modularity. By applying the Modularity to various synthetic and real-world networks, we study the behaviors of the methods, showing the validity and advantages of the multi-resolution Modularity in community detection. The adaptive Modularity, as a kind of multi-resolution method, can naturally solve the first-type limit of Modularity and detect communities at different scales; it can quicken the disconnecting of communities and delay the breakup of communities in heterogeneous networks; and thus it is expected to generate the stable community structures in networks more effectively and have stronger tolerance against the second-type limit of Modularity.
Adaptive Decision-Making Scheme for Cognitive Radio Networks
Alqerm, Ismail
2014-05-01
Radio resource management becomes an important aspect of the current wireless networks because of spectrum scarcity and applications heterogeneity. Cognitive radio is a potential candidate for resource management because of its capability to satisfy the growing wireless demand and improve network efficiency. Decision-making is the main function of the radio resources management process as it determines the radio parameters that control the use of these resources. In this paper, we propose an adaptive decision-making scheme (ADMS) for radio resources management of different types of network applications including: power consuming, emergency, multimedia, and spectrum sharing. ADMS exploits genetic algorithm (GA) as an optimization tool for decision-making. It consists of the several objective functions for the decision-making process such as minimizing power consumption, packet error rate (PER), delay, and interference. On the other hand, maximizing throughput and spectral efficiency. Simulation results and test bed evaluation demonstrate ADMS functionality and efficiency.
Network and adaptive system of systems modeling and analysis.
Energy Technology Data Exchange (ETDEWEB)
Lawton, Craig R.; Campbell, James E. Dr. (.; .); Anderson, Dennis James; Eddy, John P.
2007-05-01
This report documents the results of an LDRD program entitled ''Network and Adaptive System of Systems Modeling and Analysis'' that was conducted during FY 2005 and FY 2006. The purpose of this study was to determine and implement ways to incorporate network communications modeling into existing System of Systems (SoS) modeling capabilities. Current SoS modeling, particularly for the Future Combat Systems (FCS) program, is conducted under the assumption that communication between the various systems is always possible and occurs instantaneously. A more realistic representation of these communications allows for better, more accurate simulation results. The current approach to meeting this objective has been to use existing capabilities to model network hardware reliability and adding capabilities to use that information to model the impact on the sustainment supply chain and operational availability.
Assortative and modular networks are shaped by adaptive synchronization processes.
Avalos-Gaytán, Vanesa; Almendral, Juan A; Papo, David; Schaeffer, Satu Elisa; Boccaletti, Stefano
2012-07-01
Modular organization and degree-degree correlations are ubiquitous in the connectivity structure of biological, technological, and social interacting systems. So far most studies have concentrated on unveiling both features in real world networks, but a model that succeeds in generating them simultaneously is needed. We consider a network of interacting phase oscillators, and an adaptation mechanism for the coupling that promotes the connection strengths between those elements that are dynamically correlated. We show that, under these circumstances, the dynamical organization of the oscillators shapes the topology of the graph in such a way that modularity and assortativity features emerge spontaneously and simultaneously. In turn, we prove that such an emergent structure is associated with an asymptotic arrangement of the collective dynamical state of the network into cluster synchronization.
Weak isometries of the Boolean cube
Winter, S De; Korb, M
2014-01-01
Consider the metric space $\\mathcal{C}$ consisting of the $n$-dimensional Boolean cube equipped with the Hamming distance. A weak isometry of $\\mathcal{C}$ is a permutation of $\\mathcal{C}$ preserving a given subset of Hamming distances. In \\cite{Krasin} Krasin showed that in most cases preserving a single Hamming distance forces a weak isometry to be an isometry. In this article we study those weak isometries that are not automatically an isometry, providing a complete classification of weak...
Towards Boolean operations with thermal photons
Ben-Abdallah, Philippe; Biehs, Svend-Age
2016-12-01
The Boolean algebra is the natural theoretical framework for a classical information treatment. The basic logical operations are usually performed using logic gates. In this Rapid Communication we demonstrate that not, or, and and gates can be realized exploiting the near-field radiative interaction in N -body systems with phase change materials. With the recent development of a photon thermal transistor and thermal memory, this result paves the way for a full information treatment and smart solutions for active thermal management at nanoscale with photons.
Computation as an emergent feature of adaptive synchronization.
Zanin, M; Papo, D; Sendiña-Nadal, I; Boccaletti, S
2011-12-01
We report on the spontaneous emergence of computation from adaptive synchronization of networked dynamical systems. The fundamentals are nonlinear elements, interacting in a directed graph via a coupling that adapts itself to the synchronization level between two input signals. These units can emulate different Boolean logics, and perform any computational task in a Turing sense, each specific operation being associated with a given network's motif. The resilience of the computation against noise is proven, and the general applicability is demonstrated with regard to periodic and chaotic oscillators, and excitable systems mimicking neural dynamics.
TCP adaptation with network coding and opportunistic data forwarding in multi-hop wireless networks
Directory of Open Access Journals (Sweden)
Chen Zhang
2016-10-01
Full Text Available Opportunistic data forwarding significantly increases the throughput in multi-hop wireless mesh networks by utilizing the broadcast nature of wireless transmissions and the fluctuation of link qualities. Network coding strengthens the robustness of data transmissions over unreliable wireless links. However, opportunistic data forwarding and network coding are rarely incorporated with TCP because the frequent occurrences of out-of-order packets in opportunistic data forwarding and long decoding delay in network coding overthrow TCP’s congestion control. In this paper, we propose a solution dubbed TCPFender, which supports opportunistic data forwarding and network coding in TCP. Our solution adds an adaptation layer to mask the packet loss caused by wireless link errors and provides early positive feedbacks to trigger a larger congestion window for TCP. This adaptation layer functions over the network layer and reduces the delay of ACKs for each coded packet. The simulation results show that TCPFender significantly outperforms TCP/IP in terms of the network throughput in different topologies of wireless networks.
Traffic Adaptive MAC Protocols in Wireless Body Area Networks
Directory of Open Access Journals (Sweden)
Farhan Masud
2017-01-01
Full Text Available In Wireless Body Area Networks (WBANs, every healthcare application that is based on physical sensors is responsible for monitoring the vital signs data of patient. WBANs applications consist of heterogeneous and dynamic traffic loads. Routine patient’s observation is described as low-load traffic while an alarming situation that is unpredictable by nature is referred to as high-load traffic. This paper offers a thematic review of traffic adaptive Medium Access Control (MAC protocols in WBANs. First, we have categorized them based on their goals, methods, and metrics of evaluation. The Zigbee standard IEEE 802.15.4 and the baseline MAC IEEE 802.15.6 are also reviewed in terms of traffic adaptive approaches. Furthermore, a comparative analysis of the protocols is made and their performances are analyzed in terms of delay, packet delivery ratio (PDR, and energy consumption. The literature shows that no review work has been done on traffic adaptive MAC protocols in WBANs. This review work, therefore, could add enhancement to traffic adaptive MAC protocols and will stimulate a better way of solving the traffic adaptivity problem.
Adaptive Management of Computing and Network Resources for Spacecraft Systems
Pfarr, Barbara; Welch, Lonnie R.; Detter, Ryan; Tjaden, Brett; Huh, Eui-Nam; Szczur, Martha R. (Technical Monitor)
2000-01-01
It is likely that NASA's future spacecraft systems will consist of distributed processes which will handle dynamically varying workloads in response to perceived scientific events, the spacecraft environment, spacecraft anomalies and user commands. Since all situations and possible uses of sensors cannot be anticipated during pre-deployment phases, an approach for dynamically adapting the allocation of distributed computational and communication resources is needed. To address this, we are evolving the DeSiDeRaTa adaptive resource management approach to enable reconfigurable ground and space information systems. The DeSiDeRaTa approach embodies a set of middleware mechanisms for adapting resource allocations, and a framework for reasoning about the real-time performance of distributed application systems. The framework and middleware will be extended to accommodate (1) the dynamic aspects of intra-constellation network topologies, and (2) the complete real-time path from the instrument to the user. We are developing a ground-based testbed that will enable NASA to perform early evaluation of adaptive resource management techniques without the expense of first deploying them in space. The benefits of the proposed effort are numerous, including the ability to use sensors in new ways not anticipated at design time; the production of information technology that ties the sensor web together; the accommodation of greater numbers of missions with fewer resources; and the opportunity to leverage the DeSiDeRaTa project's expertise, infrastructure and models for adaptive resource management for distributed real-time systems.
Stability in random Boolean cellular automata on the integer lattice
A.C. Fey (Anne); L. van Driel; F.M. Dekking
2010-01-01
htmlabstractWe consider random boolean cellular automata on the integer lattice, i.e., the cells are identified with the integers from 1 to $N$. The behaviour of the automaton is mainly determined by the support of the random variable that selects one of the sixteen possible Boolean rules,
Efficient Instantiation of Parameterised Boolean Equation Systems to Parity Games
Kant, Gijs; van de Pol, Jan Cornelis; Wijs, A.J.; Bošnački, D.; Edelkamp, S.
Parameterised Boolean Equation Systems (PBESs) are sequences of Boolean fixed point equations with data variables, used for, e.g., verification of modal μ-calculus formulae for process algebraic specifications with data. Solving a PBES is usually done by instantiation to a Parity Game and then
Rescue of endemic states in interconnected networks with adaptive coupling
Vazquez, F; Miguel, M San
2015-01-01
We study the Susceptible-Infected-Susceptible model of epidemic spreading on two layers of networks interconnected by adaptive links, which are rewired at random to avoid contacts between infected and susceptible nodes at the interlayer. We find that the rewiring reduces the effective connectivity for the transmission of the disease between layers, and may even totally decouple the networks. Weak endemic states, in which the epidemics spreads only if the two layers are interconnected, show a transition from the endemic to the healthy phase when the rewiring overcomes a threshold value that depends on the infection rate, the strength of the coupling and the mean connectivity of the networks. In the strong endemic scenario, in which the epidemics is able to spread on each separate network, the prevalence in each layer decreases when increasing the rewiring, arriving to single network values only in the limit of infinitely fast rewiring. We also find that finite-size effects are amplified by the rewiring, as the...
ADAPTIVE SERVICE PROVISIONING FOR MOBILE AD HOC NETWORKS
Directory of Open Access Journals (Sweden)
Cynthia Jayapal
2010-09-01
Full Text Available Providing efficient and scalable service provisioning in Mobile Ad Hoc Network (MANET is a big research challenge. In adaptive service provisioning mechanism an adaptive election procedure is used to select a coordinator node. The role of a service coordinator is crucial in any distributed directory based service provisioning scheme. The existing coordinator election schemes use either the nodeID or a hash function to choose the coordinator. In these schemes, the leader changes are more frequent due to node mobility. We propose an adaptive scheme that makes use of an eligibility factor that is calculated based on the distance to the zone center, remaining battery power and average speed to elect a core node that change according to the network dynamics. We also retain the node with the second highest priority as a backup node. Our algorithm is compared with the existing solution by simulation and the result shows that the core node selected by us is more stable and hence reduces the number of handoffs. This in turn improves the service delivery performance by increasing the packet delivery ratio and decreasing the delay, the overhead and the forwarding cost.
Covalent Adaptable Networks (CANs): A Unique Paradigm in Crosslinked Polymers.
Kloxin, Christopher J; Scott, Timothy F; Adzima, Brian J; Bowman, Christopher N
2010-03-23
Polymer networks possessing reversible covalent crosslinks constitute a novel material class with the capacity for adapting to an externally applied stimulus. These covalent adaptable networks (CANs) represent a trend in polymer network fabrication towards the rational design of structural materials possessing dynamic characteristics for specialty applications. Herein, we discuss the unique attributes of CANs that must be considered when designing, fabricating, and characterizing these smart materials that respond to either thermal or photochemical stimuli. While there are many reversible reactions which to consider as possible crosslink candidates in CANs, there are very few that are readily and repeatedly reversible. Furthermore, characterization of the mechanical properties of CANs requires special consideration owing to their unique attributes. Ultimately, these attributes are what lead to the advantageous properties displayed by CANs, such as recyclability, healability, tunability, shape changes, and low polymerization stress. Throughout this perspective, we identify several trends and future directions in the emerging field of CANs that demonstrate the progress to date as well as the essential elements that are needed for further advancement.
Understanding the Generation of Network Bursts by Adaptive Oscillatory Neurons
Directory of Open Access Journals (Sweden)
Tanguy Fardet
2018-02-01
Full Text Available Experimental and numerical studies have revealed that isolated populations of oscillatory neurons can spontaneously synchronize and generate periodic bursts involving the whole network. Such a behavior has notably been observed for cultured neurons in rodent's cortex or hippocampus. We show here that a sufficient condition for this network bursting is the presence of an excitatory population of oscillatory neurons which displays spike-driven adaptation. We provide an analytic model to analyze network bursts generated by coupled adaptive exponential integrate-and-fire neurons. We show that, for strong synaptic coupling, intrinsically tonic spiking neurons evolve to reach a synchronized intermittent bursting state. The presence of inhibitory neurons or plastic synapses can then modulate this dynamics in many ways but is not necessary for its appearance. Thanks to a simple self-consistent equation, our model gives an intuitive and semi-quantitative tool to understand the bursting behavior. Furthermore, it suggests that after-hyperpolarization currents are sufficient to explain bursting termination. Through a thorough mapping between the theoretical parameters and ion-channel properties, we discuss the biological mechanisms that could be involved and the relevance of the explored parameter-space. Such an insight enables us to propose experimentally-testable predictions regarding how blocking fast, medium or slow after-hyperpolarization channels would affect the firing rate and burst duration, as well as the interburst interval.
Event-driven approach of layered multicast to network adaptation in RED-based IP networks
Nahm, Kitae; Li, Qing; Kuo, C.-C. J.
2003-11-01
In this work, we investigate the congestion control problem for layered video multicast in IP networks of active queue management (AQM) using a simple random early detection (RED) queue model. AQM support from networks improves the visual quality of video streaming but makes network adaptation more di+/-cult for existing layered video multicast proticols that use the event-driven timer-based approach. We perform a simplified analysis on the response of the RED algorithm to burst traffic. The analysis shows that the primary problem lies in the weak correlation between the network feedback and the actual network congestion status when the RED queue is driven by burst traffic. Finally, a design guideline of the layered multicast protocol is proposed to overcome this problem.
Distributed estimation for adaptive sensor selection in wireless sensor networks
Mahmoud, Magdi S.; Hassan Hamid, Matasm M.
2014-05-01
Wireless sensor networks (WSNs) are usually deployed for monitoring systems with the distributed detection and estimation of sensors. Sensor selection in WSNs is considered for target tracking. A distributed estimation scenario is considered based on the extended information filter. A cost function using the geometrical dilution of precision measure is derived for active sensor selection. A consensus-based estimation method is proposed in this paper for heterogeneous WSNs with two types of sensors. The convergence properties of the proposed estimators are analyzed under time-varying inputs. Accordingly, a new adaptive sensor selection (ASS) algorithm is presented in which the number of active sensors is adaptively determined based on the absolute local innovations vector. Simulation results show that the tracking accuracy of the ASS is comparable to that of the other algorithms.
Boolean model of yeast apoptosis as a tool to study yeast and human apoptotic regulations.
Kazemzadeh, Laleh; Cvijovic, Marija; Petranovic, Dina
2012-01-01
Programmed cell death (PCD) is an essential cellular mechanism that is evolutionary conserved, mediated through various pathways and acts by integrating different stimuli. Many diseases such as neurodegenerative diseases and cancers are found to be caused by, or associated with, regulations in the cell death pathways. Yeast Saccharomyces cerevisiae, is a unicellular eukaryotic organism that shares with human cells components and pathways of the PCD and is therefore used as a model organism. Boolean modeling is becoming promising approach to capture qualitative behavior and describe essential properties of such complex networks. Here we present large literature-based and to our knowledge first Boolean model that combines pathways leading to apoptosis (a type of PCD) in yeast. Analysis of the yeast model confirmed experimental findings of anti-apoptotic role of Bir1p and pro-apoptotic role of Stm1p and revealed activation of the stress protein kinase Hog proposing the maximal level of activation upon heat stress. In addition we extended the yeast model and created an in silico humanized yeast in which human pro- and anti-apoptotic regulators Bcl-2 family and Valosin-contain protein (VCP) are included in the model. We showed that accumulation of Bax in silico humanized yeast shows apoptotic markers and that VCP is essential target of Akt Signaling. The presented Boolean model provides comprehensive description of yeast apoptosis network behavior. Extended model of humanized yeast gives new insights of how complex human disease like neurodegeneration can initially be tested.
Adaptive Information Access on Multiple Applications Support Wireless Sensor Networks
DEFF Research Database (Denmark)
Tobgay, Sonam; Olsen, Rasmus Løvenstein; Prasad, Ramjee
2014-01-01
is used for safety and security monitoring purposes. In this paper, we evaluate different access strategies to remote dynamic information and compare between achieving information reliability (mismatch probability) and the associated power consumption. Lastly, based on the models, we propose an adaptive......Accessing information remotely to dynamically changing information elements cannot be avoided and has become a required functionality for various network services. Most applications require up-to-date information which is reliable and accurate. The information reliability in terms of using correct...... information is challenged by dynamic nature of information elements. These challenges are more prominent in case of wireless sensor network (WSN) applications, as the information that the sensor node collects are mostly dynamic in nature (say, temperature). Therefore, it is likely that there can be a mismatch...
Adaptive model predictive process control using neural networks
Buescher, K.L.; Baum, C.C.; Jones, R.D.
1997-08-19
A control system for controlling the output of at least one plant process output parameter is implemented by adaptive model predictive control using a neural network. An improved method and apparatus provides for sampling plant output and control input at a first sampling rate to provide control inputs at the fast rate. The MPC system is, however, provided with a network state vector that is constructed at a second, slower rate so that the input control values used by the MPC system are averaged over a gapped time period. Another improvement is a provision for on-line training that may include difference training, curvature training, and basis center adjustment to maintain the weights and basis centers of the neural in an updated state that can follow changes in the plant operation apart from initial off-line training data. 46 figs.
The emergence of complexity and restricted pleiotropy in adapting networks
Directory of Open Access Journals (Sweden)
Le Nagard Hervé
2011-11-01
Full Text Available Abstract Background The emergence of organismal complexity has been a difficult subject for researchers because it is not readily amenable to investigation by experimental approaches. Complexity has a myriad of untested definitions and our understanding of its evolution comes primarily from static snapshots gleaned from organisms ranked on an intuitive scale. Fisher's geometric model of adaptation, which defines complexity as the number of phenotypes an organism exposes to natural selection, provides a theoretical framework to study complexity. Yet investigations of this model reveal phenotypic complexity as costly and therefore unlikely to emerge. Results We have developed a computational approach to study the emergence of complexity by subjecting neural networks to adaptive evolution in environments exacting different levels of demands. We monitored complexity by a variety of metrics. Top down metrics derived from Fisher's geometric model correlated better with the environmental demands than bottom up ones such as network size. Phenotypic complexity was found to increase towards an environment-dependent level through the emergence of restricted pleiotropy. Such pleiotropy, which confined the action of mutations to only a subset of traits, better tuned phenotypes in challenging environments. However, restricted pleiotropy also came at a cost in the form of a higher genetic load, as it required the maintenance by natural selection of more independent traits. Consequently, networks of different sizes converged in complexity when facing similar environment. Conclusions Phenotypic complexity evolved as a function of the demands of the selective pressures, rather than the physical properties of the network architecture, such as functional size. Our results show that complexity may be more predictable, and understandable, if analyzed from the perspective of the integrated task the organism performs, rather than the physical architecture used to
Adaptive and ubiquitous video streaming over Wireless Mesh Networks
Directory of Open Access Journals (Sweden)
Malik Mubashir Hassan
2016-10-01
Full Text Available In recent years, with the dramatic improvement on scalability of H.264/MPEG-4 standard and growing demand for new multimedia services have spurred the research on scalable video streaming over wireless networks in both industry and academia. Video streaming applications are increasingly being deployed in Wireless Mesh Networks (WMNs. However, robust streaming of video over WMNs poses many challenges due to varying nature of wireless networks. Bit-errors, packet-losses and burst-packet-losses are very common in such type of networks, which severely influence the perceived video quality at receiving end. Therefore, a carefully-designed error recovery scheme must be employed. In this paper, we propose an interactive and ubiquitous video streaming scheme for Scalable Video Coding (SVC based video streaming over WMNs towards heterogeneous receivers. Intelligently taking the benefit of path diversity, the proposed scheme initially calculates the quality of all candidate paths and then based on quality of path it decides adaptively the size and level of error protection for all packets in order to combat the effect of losses on perceived quality of reconstructed video at receiving end. Our experimental results show that the proposed streaming approach can react to varying channel conditions with less degradation in video quality.
Adaptive elastic networks as models of supercooled liquids
Yan, Le; Wyart, Matthieu
2015-08-01
The thermodynamics and dynamics of supercooled liquids correlate with their elasticity. In particular for covalent networks, the jump of specific heat is small and the liquid is strong near the threshold valence where the network acquires rigidity. By contrast, the jump of specific heat and the fragility are large away from this threshold valence. In a previous work [Proc. Natl. Acad. Sci. USA 110, 6307 (2013), 10.1073/pnas.1300534110], we could explain these behaviors by introducing a model of supercooled liquids in which local rearrangements interact via elasticity. However, in that model the disorder characterizing elasticity was frozen, whereas it is itself a dynamic variable in supercooled liquids. Here we study numerically and theoretically adaptive elastic network models where polydisperse springs can move on a lattice, thus allowing for the geometry of the elastic network to fluctuate and evolve with temperature. We show numerically that our previous results on the relationship between structure and thermodynamics hold in these models. We introduce an approximation where redundant constraints (highly coordinated regions where the frustration is large) are treated as an ideal gas, leading to analytical predictions that are accurate in the range of parameters relevant for real materials. Overall, these results lead to a description of supercooled liquids, in which the distance to the rigidity transition controls the number of directions in phase space that cost energy and the specific heat.
Adaptive control of call acceptance in WCDMA network
Directory of Open Access Journals (Sweden)
Milan Manojle Šunjevarić
2013-10-01
Full Text Available In this paper, an overview of the algorithms for access control in mobile wireless networks is presented. A review of adaptive control methods of accepting a call in WCDMA networks is discussed, based on the overview of the algorithms used for this purpose, and their comparison. Appropriate comments and conculsions in comparison with the basic characteristics of these algorithms are given. The OVSF codes are explained as well as how the allocation method influences the capacity and probability of blocking.. Introduction We are witnessing a steady increase in the number of demands placed upon modern wireless networks. New applications and an increasing number of users as well as user activities growth in recent years reinforce the need for an efficient use of the spectrum and its proper distribution among different applications and classes of services. Besides humans, the last few years saw different computers, machines, applications, and, in the future, many other devices, RFID applications, and finally networked objects, as a new kind of wireless networks "users". Because of the exceptional rise in the number of users, the demands placed upon modern wireless networks are becoming larger, and spectrum management plays an important role. For these reasons, choosing an appropriate call admission control algorithm is of great importance. Multiple access and resource management in wireless networks Radio resource management of mobile networks is a set of algorithms to manage the use of radio resources with the aim is to maximize the total capacity of wireless systems with equal distribution of resources to users. Management of radio resources in cellular networks is usually located in the base station controller, the base station and the mobile terminal, and is based on decisions made on appropriate measurement and feedback. It is often defined as the maximum volume of traffic load that the system can provide for some of the requirements for the
Ordered Boolean List (OBL): reducing the footprint for evaluating Boolean expressions.
Rossignac, Jaroslaw Jarek
2011-09-01
An Expanded Boolean Expression (EBE) does not contain any XOR or EQUAL operators. The occurrence of each variable is a different literal. We provide a linear time algorithm that converts an EBE of n literals into a logically equivalent Ordered Boolean List (OBL) and show how to use the OBL to evaluate the EBE in n steps and O(log log n) space, if the values of the literals are each read once in the order prescribed by the OBL. (An evaluation workspace of 5 bits suffices for all EBEs of up to six billion literals.) The primary application is the SIMD architecture, where the same EBE is evaluated in parallel for different input vectors when rendering solid models on the GPU directly from their Constructive Solid Geometry (CSG) representation. We compare OBL to the Reduced Ordered Binary Decision Diagram (ROBDD) and suggest possible applications of OBL to logic verification and to circuit design.
Trajanovski, S.; Guo, D.; Van Mieghem, P.F.A.
2015-01-01
The continuous-time adaptive susceptible-infected-susceptible (ASIS) epidemic model and the adaptive information diffusion (AID) model are two adaptive spreading processes on networks, in which a link in the network changes depending on the infectious state of its end nodes, but in opposite ways:
Evolutionary Algorithms for Boolean Functions in Diverse Domains of Cryptography.
Picek, Stjepan; Carlet, Claude; Guilley, Sylvain; Miller, Julian F; Jakobovic, Domagoj
2016-01-01
The role of Boolean functions is prominent in several areas including cryptography, sequences, and coding theory. Therefore, various methods for the construction of Boolean functions with desired properties are of direct interest. New motivations on the role of Boolean functions in cryptography with attendant new properties have emerged over the years. There are still many combinations of design criteria left unexplored and in this matter evolutionary computation can play a distinct role. This article concentrates on two scenarios for the use of Boolean functions in cryptography. The first uses Boolean functions as the source of the nonlinearity in filter and combiner generators. Although relatively well explored using evolutionary algorithms, it still presents an interesting goal in terms of the practical sizes of Boolean functions. The second scenario appeared rather recently where the objective is to find Boolean functions that have various orders of the correlation immunity and minimal Hamming weight. In both these scenarios we see that evolutionary algorithms are able to find high-quality solutions where genetic programming performs the best.
Formalization of Human Categorization Process Using Interpolative Boolean Algebra
Directory of Open Access Journals (Sweden)
Vladimir Dobrić
2015-01-01
Full Text Available Since the ancient times, it has been assumed that categorization has the basic form of classical sets. This implies that the categorization process rests on the Boolean laws. In the second half of the twentieth century, the classical theory has been challenged in cognitive science. According to the prototype theory, objects belong to categories with intensities, while humans categorize objects by comparing them to prototypes of relevant categories. Such categorization process is governed by the principles of perceived world structure and cognitive economy. Approaching the prototype theory by using truth-functional fuzzy logic has been harshly criticized due to not satisfying the complementation laws. In this paper, the prototype theory is approached by using structure-functional fuzzy logic, the interpolative Boolean algebra. The proposed formalism is within the Boolean frame. Categories are represented as fuzzy sets of objects, while comparisons between objects and prototypes are formalized by using Boolean consistent fuzzy relations. Such relations are directly constructed from a Boolean consistent fuzzy partial order relation, which is treated by Boolean implication. The introduced formalism secures the principles of categorization showing that Boolean laws are fundamental in the categorization process. For illustration purposes, the artificial cognitive system which mimics human categorization activity is proposed.
Directory of Open Access Journals (Sweden)
M. E. Migabo
2017-01-01
Full Text Available Despite its low computational cost, the Gradient Based Routing (GBR broadcast of interest messages in Wireless Sensor Networks (WSNs causes significant packets duplications and unnecessary packets transmissions. This results in energy wastage, traffic load imbalance, high network traffic, and low throughput. Thanks to the emergence of fast and powerful processors, the development of efficient network coding strategies is expected to enable efficient packets aggregations and reduce packets retransmissions. For multiple sinks WSNs, the challenge consists of efficiently selecting a suitable network coding scheme. This article proposes a Cooperative and Adaptive Network Coding for GBR (CoAdNC-GBR technique which considers the network density as dynamically defined by the average number of neighbouring nodes, to efficiently aggregate interest messages. The aggregation is performed by means of linear combinations of random coefficients of a finite Galois Field of variable size GF(2S at each node and the decoding is performed by means of Gaussian elimination. The obtained results reveal that, by exploiting the cooperation of the multiple sinks, the CoAdNC-GBR not only improves the transmission reliability of links and lowers the number of transmissions and the propagation latency, but also enhances the energy efficiency of the network when compared to the GBR-network coding (GBR-NC techniques.
The Boolean algebra of Galois algebras
Directory of Open Access Journals (Sweden)
Lianyong Xue
2003-02-01
Full Text Available Let B be a Galois algebra with Galois group G, Jg={bÃ¢ÂˆÂˆB|bx=g(xbÃ¢Â€Â‰for allÃ¢Â€Â‰xÃ¢ÂˆÂˆB} for each gÃ¢ÂˆÂˆG, and BJg=Beg for a central idempotent eg, Ba the Boolean algebra generated by {0,eg|gÃ¢ÂˆÂˆG}, e a nonzero element in Ba, and He={gÃ¢ÂˆÂˆG|eeg=e}. Then, a monomial e is characterized, and the Galois extension Be, generated by e with Galois group He, is investigated.
Representing Boolean Functions by Decision Trees
Chikalov, Igor
2011-01-01
A Boolean or discrete function can be represented by a decision tree. A compact form of decision tree named binary decision diagram or branching program is widely known in logic design [2, 40]. This representation is equivalent to other forms, and in some cases it is more compact than values table or even the formula [44]. Representing a function in the form of decision tree allows applying graph algorithms for various transformations [10]. Decision trees and branching programs are used for effective hardware [15] and software [5] implementation of functions. For the implementation to be effective, the function representation should have minimal time and space complexity. The average depth of decision tree characterizes the expected computing time, and the number of nodes in branching program characterizes the number of functional elements required for implementation. Often these two criteria are incompatible, i.e. there is no solution that is optimal on both time and space complexity. © Springer-Verlag Berlin Heidelberg 2011.
Synthesizing Biomolecule-based Boolean Logic Gates
Miyamoto, Takafumi; Razavi, Shiva; DeRose, Robert; Inoue, Takanari
2012-01-01
One fascinating recent avenue of study in the field of synthetic biology is the creation of biomolecule-based computers. The main components of a computing device consist of an arithmetic logic unit, the control unit, memory, and the input and output devices. Boolean logic gates are at the core of the operational machinery of these parts, hence to make biocomputers a reality, biomolecular logic gates become a necessity. Indeed, with the advent of more sophisticated biological tools, both nucleic acid- and protein-based logic systems have been generated. These devices function in the context of either test tubes or living cells and yield highly specific outputs given a set of inputs. In this review, we discuss various types of biomolecular logic gates that have been synthesized, with particular emphasis on recent developments that promise increased complexity of logic gate circuitry, improved computational speed, and potential clinical applications. PMID:23526588
Multipath Detection Using Boolean Satisfiability Techniques
Directory of Open Access Journals (Sweden)
Fadi A. Aloul
2011-01-01
Full Text Available A new technique for multipath detection in wideband mobile radio systems is presented. The proposed scheme is based on an intelligent search algorithm using Boolean Satisfiability (SAT techniques to search through the uncertainty region of the multipath delays. The SAT-based scheme utilizes the known structure of the transmitted wideband signal, for example, pseudo-random (PN code, to effectively search through the entire space by eliminating subspaces that do not contain a possible solution. The paper presents a framework for modeling the multipath detection problem as a SAT application. It also provides simulation results that demonstrate the effectiveness of the proposed scheme in detecting the multipath components in frequency-selective Rayleigh fading channels.
Understanding Homophily and More-Becomes-More Through Adaptive Temporal-Causal Network Models
Beukel, Sven van den; Goos, Simon; Treur, J.; De la Prieta, F
2017-01-01
This study describes the use of adaptive temporal-causal networks to model and simulate the development of mutually interacting opinion states and connections between individuals in social networks. The focus is on adaptive networks combining the homophily principle with the more becomes more
Particle Swarm Optimization for Adaptive Resource Allocation in Communication Networks
Directory of Open Access Journals (Sweden)
Gheitanchi Shahin
2010-01-01
Full Text Available A generalized model of particle swarm optimization (PSO technique is proposed as a low complexity method for adaptive centralized and distributed resource allocation in communication networks. The proposed model is applied to adaptive multicarrier cooperative communications (MCCC technique which utilizes the subcarriers in deep fade using a relay node in order to improve the bandwidth efficiency. Centralized PSO, based on virtual particles (VPs, is introduced for single layer and cross-layer subcarrier allocation to improve the bit error rate performance in multipath frequency selective fading channels. In the single layer strategy, the subcarriers are allocated based on the channel gains. In the cross-layer strategy, the subcarriers are allocated based on a joint measure of channel gains and distance provided by the physical layer and network layer to mitigate the effect of path loss. The concept of training particles in distributed PSO is proposed and then is applied for relay node selection. The computational complexity and traffic of the proposed techniques are investigated, and it is shown that using PSO for subcarrier allocation has a lower complexity than the techniques in the literature. Significant reduction in the traffic overhead of PSO is demonstrated when using trained particles in distributed optimizations.
Equivalence Checking of Combinational Circuits using Boolean Expression Diagrams
DEFF Research Database (Denmark)
Hulgaard, Henrik; Williams, Poul Frederick; Andersen, Henrik Reif
1999-01-01
The combinational logic-level equivalence problem is to determine whether two given combinational circuits implement the same Boolean function. This problem arises in a number of CAD applications, for example when checking the correctness of incremental design changes (performed either manually...... or by a design automation tool).This paper introduces a data structure called Boolean Expression Diagrams (BEDs) and two algorithms for transforming a BED into a Reduced Ordered Binary Decision Diagram (OBDD). BEDs are capable of representing any Boolean circuit in linear space and can exploit structural...
Adaptive NetworkProfiler for Identifying Cancer Characteristic-Specific Gene Regulatory Networks.
Park, Heewon; Shimamura, Teppei; Imoto, Seiya; Miyano, Satoru
2017-10-20
There is currently much discussion about sample (patient)-specific gene regulatory network identification, since the efficiently constructed sample-specific gene networks lead to effective personalized cancer therapy. Although statistical approaches have been proposed for inferring gene regulatory networks, the methods cannot reveal sample-specific characteristics because the existing methods, such as an L1-type regularization, provide averaged results for all samples. Thus, we cannot reveal sample-specific characteristics in transcriptional regulatory networks. To settle on this issue, the NetworkProfiler was proposed based on the kernel-based L1-type regularization. The NetworkProfiler imposes a weight on each sample based on the Gaussian kernal function for controlling effect of samples on modeling a target sample, where the amount of weight depends on similarity of cancer characteristics between samples. The method, however, cannot perform gene regulatory network identification well for a target sample in a sparse region (i.e., for a target sample, there are only a few samples having a similar characteristic of the target sample, where the characteristic is considered as a modulator in sample-specific gene network construction), since a constant bandwidth in the Gaussian kernel function cannot effectively group samples for modeling a target sample in sparse region. The cancer characteristics, such as an anti-cancer drug sensitivity, are usually nonuniformly distributed, and thus modeling for samples in a sparse region is also a crucial issue. We propose a novel kernel-based L1-type regularization method based on a modified k-nearest neighbor (KNN)-Gaussian kernel function, called an adaptive NetworkProfiler. By using the modified KNN-Gaussian kernel function, our method provides robust results against the distribution of modulators, and properly groups samples according to a cancer characteristic for sample-specific analysis. Furthermore, we propose a sample
Institutional networks and adaptive water governance in the Klamath River Basin, USA.
Polycentric networks of formal organizations and informal stakeholder groups, as opposed to centralized institutional hierarchies, can be critically important for strengthening the capacity of governance systems to adapt to unexpected social and biophysical change. Adaptive gover...
Directory of Open Access Journals (Sweden)
Xueling Jiang
2014-01-01
Full Text Available The problem of adaptive asymptotical synchronization is discussed for the stochastic complex dynamical networks with time-delay and Markovian switching. By applying the stochastic analysis approach and the M-matrix method for stochastic complex networks, several sufficient conditions to ensure adaptive asymptotical synchronization for stochastic complex networks are derived. Through the adaptive feedback control techniques, some suitable parameters update laws are obtained. Simulation result is provided to substantiate the effectiveness and characteristics of the proposed approach.
Constant-overhead secure computation of Boolean circuits using preprocessing
DEFF Research Database (Denmark)
Damgård, Ivan Bjerre; Zakarias, S.
2013-01-01
We present a protocol for securely computing a Boolean circuit C in presence of a dishonest and malicious majority. The protocol is unconditionally secure, assuming a preprocessing functionality that is not given the inputs. For a large number of players the work for each player is the same...... algorithm for verifying the product of Boolean matrices in quadratic time with exponentially small error probability, where previous methods only achieved constant error....
Robust adaptive learning of feedforward neural networks via LMI optimizations.
Jing, Xingjian
2012-07-01
Feedforward neural networks (FNNs) have been extensively applied to various areas such as control, system identification, function approximation, pattern recognition etc. A novel robust control approach to the learning problems of FNNs is further investigated in this study in order to develop efficient learning algorithms which can be implemented with optimal parameter settings and considering noise effect in the data. To this aim, the learning problem of a FNN is cast into a robust output feedback control problem of a discrete time-varying linear dynamic system. New robust learning algorithms with adaptive learning rate are therefore developed, using linear matrix inequality (LMI) techniques to find the appropriate learning rates and to guarantee the fast and robust convergence. Theoretical analysis and examples are given to illustrate the theoretical results. Copyright © 2012 Elsevier Ltd. All rights reserved.
Scalable Lunar Surface Networks and Adaptive Orbit Access Project
National Aeronautics and Space Administration — Innovative network architecture, protocols, and algorithms are proposed for both lunar surface networks and orbit access networks. Firstly, an overlaying...
Mobilization and Adaptation of a Rural Cradle-to-Career Network
Zuckerman, Sarah J.
2016-01-01
This case study explored the development of a rural cradle-to-career network with a dual focus on the initial mobilization of network members and subsequent adaptations made to maintain mobilization, while meeting local needs. Data sources included interviews with network members, observations of meetings, and documentary evidence. Network-based…
Modeling and adaptive pinning synchronization control for a chaotic-motion motor in complex network
Zhu, Darui; Liu, Chongxin; Yan, Bingnan
2014-01-01
We introduce a chaos model for a permanent-magnet synchronous motor and construct a coupled chaotic motor in a complex dynamic network using the Newman-Watts small-world network algorithm. We apply adaptive pinning control theory for complex networks to obtain suitable adaptive feedback gain and the number of nodes to be pinned. Nodes of low degree are pinned to realize global asymptotic synchronization in the complex network. The proposed adaptive pinning controller is added to the complex motor network for simulation and verification.
Neural network based adaptive output feedback control: Applications and improvements
Kutay, Ali Turker
Application of recently developed neural network based adaptive output feedback controllers to a diverse range of problems both in simulations and experiments is investigated in this thesis. The purpose is to evaluate the theory behind the development of these controllers numerically and experimentally, identify the needs for further development in practical applications, and to conduct further research in directions that are identified to ultimately enhance applicability of adaptive controllers to real world problems. We mainly focus our attention on adaptive controllers that augment existing fixed gain controllers. A recently developed approach holds great potential for successful implementations on real world applications due to its applicability to systems with minimal information concerning the plant model and the existing controller. In this thesis the formulation is extended to the multi-input multi-output case for distributed control of interconnected systems and successfully tested on a formation flight wind tunnel experiment. The command hedging method is formulated for the approach to further broaden the class of systems it can address by including systems with input nonlinearities. Also a formulation is adopted that allows the approach to be applied to non-minimum phase systems for which non-minimum phase characteristics are modeled with sufficient accuracy and treated properly in the design of the existing controller. It is shown that the approach can also be applied to augment nonlinear controllers under certain conditions and an example is presented where the nonlinear guidance law of a spinning projectile is augmented. Simulation results on a high fidelity 6 degrees-of-freedom nonlinear simulation code are presented. The thesis also presents a preliminary adaptive controller design for closed loop flight control with active flow actuators. Behavior of such actuators in dynamic flight conditions is not known. To test the adaptive controller design in
Modeling multiple time scale firing rate adaptation in a neural network of local field potentials.
Lundstrom, Brian Nils
2015-02-01
In response to stimulus changes, the firing rates of many neurons adapt, such that stimulus change is emphasized. Previous work has emphasized that rate adaptation can span a wide range of time scales and produce time scale invariant power law adaptation. However, neuronal rate adaptation is typically modeled using single time scale dynamics, and constructing a conductance-based model with arbitrary adaptation dynamics is nontrivial. Here, a modeling approach is developed in which firing rate adaptation, or spike frequency adaptation, can be understood as a filtering of slow stimulus statistics. Adaptation dynamics are modeled by a stimulus filter, and quantified by measuring the phase leads of the firing rate in response to varying input frequencies. Arbitrary adaptation dynamics are approximated by a set of weighted exponentials with parameters obtained by fitting to a desired filter. With this approach it is straightforward to assess the effect of multiple time scale adaptation dynamics on neural networks. To demonstrate this, single time scale and power law adaptation were added to a network model of local field potentials. Rate adaptation enhanced the slow oscillations of the network and flattened the output power spectrum, dampening intrinsic network frequencies. Thus, rate adaptation may play an important role in network dynamics.
Adaptive Neural Network Nonparametric Identifier With Normalized Learning Laws.
Chairez, Isaac
2017-05-01
This paper addresses the design of a normalized convergent learning law for neural networks (NNs) with continuous dynamics. The NN is used here to obtain a nonparametric model for uncertain systems described by a set of ordinary differential equations. The source of uncertainties is the presence of some external perturbations and poor knowledge of the nonlinear function describing the system dynamics. A new adaptive algorithm based on normalized algorithms was used to adjust the weights of the NN. The adaptive algorithm was derived by means of a nonstandard logarithmic Lyapunov function (LLF). Two identifiers were designed using two variations of LLFs leading to a normalized learning law for the first identifier and a variable gain normalized learning law. In the case of the second identifier, the inclusion of normalized learning laws yields to reduce the size of the convergence region obtained as solution of the practical stability analysis. On the other hand, the velocity of convergence for the learning laws depends on the norm of errors in inverse form. This fact avoids the peaking transient behavior in the time evolution of weights that accelerates the convergence of identification error. A numerical example demonstrates the improvements achieved by the algorithm introduced in this paper compared with classical schemes with no-normalized continuous learning methods. A comparison of the identification performance achieved by the no-normalized identifier and the ones developed in this paper shows the benefits of the learning law proposed in this paper.
Adaptive pinning control of deteriorated nonlinear coupling networks with circuit realization.
Jin, Xiao-Zheng; Yang, Guang-Hong; Che, Wei-Wei
2012-09-01
This paper deals with a class of complex networks with nonideal coupling networks, and addresses the problem of asymptotic synchronization of the complex network through designing adaptive pinning control and coupling adjustment strategies. A more general coupled nonlinearity is considered as perturbations of the network, while a serious faulty network named deteriorated network is also proposed to be further study. For the sake of eliminating these adverse impacts for synchronization, indirect adaptive schemes are designed to construct controllers and adjusters on pinned nodes and nonuniform couplings of un-pinned nodes, respectively. According to Lyapunov stability theory, the proposed adaptive strategies are successful in ensuring the achievement of asymptotic synchronization of the complex network even in the presence of perturbed and deteriorated networks. The proposed schemes are physically implemented by circuitries and tested by simulation on a Chua's circuit network.
Deblurring adaptive optics retinal images using deep convolutional neural networks.
Fei, Xiao; Zhao, Junlei; Zhao, Haoxin; Yun, Dai; Zhang, Yudong
2017-12-01
The adaptive optics (AO) can be used to compensate for ocular aberrations to achieve near diffraction limited high-resolution retinal images. However, many factors such as the limited aberration measurement and correction accuracy with AO, intraocular scatter, imaging noise and so on will degrade the quality of retinal images. Image post processing is an indispensable and economical method to make up for the limitation of AO retinal imaging procedure. In this paper, we proposed a deep learning method to restore the degraded retinal images for the first time. The method directly learned an end-to-end mapping between the blurred and restored retinal images. The mapping was represented as a deep convolutional neural network that was trained to output high-quality images directly from blurry inputs without any preprocessing. This network was validated on synthetically generated retinal images as well as real AO retinal images. The assessment of the restored retinal images demonstrated that the image quality had been significantly improved.
Disruption and adaptation of urban transport networks from flooding
Directory of Open Access Journals (Sweden)
Pregnolato Maria
2016-01-01
Full Text Available Transport infrastructure networks are increasingly vulnerable to disruption from extreme rainfall events due to increasing surface water runoff from urbanization and changes in climate. Impacts from such disruptions typically extend far beyond the flood footprint, because of the interconnection and spatial extent of modern infrastructure. An integrated flood risk assessment couples high resolution information on depth and velocity from the CityCAT urban flood model with empirical analysis of vehicle speeds in different depths of flood water, to perturb a transport accessibility model and determine the impact of a given event on journey times across the urban area. A case study in Newcastle-upon-Tyne (UK shows that even minor flooding associate with a 1 in 10 year event can cause traffic disruptions of nearly half an hour. Two adaptation scenarios are subsequently tested (i hardening (i.e. flood protection a single major junction, (ii introduction of green roofs across all buildings. Both options have benefits in terms of reduced disruption, but for a 1 in 200 year event greening all roofs in the city provided only three times the benefit of protecting one critical road junction, highlighting the importance of understanding network attributes such as capacity and flows.
Spontaneous neuronal network dynamics reveal circuit's functional adaptations for behavior.
Romano, Sebastián A; Pietri, Thomas; Pérez-Schuster, Verónica; Jouary, Adrien; Haudrechy, Mathieu; Sumbre, Germán
2015-03-04
Spontaneous neuronal activity is spatiotemporally structured, influencing brain computations. Nevertheless, the neuronal interactions underlying these spontaneous activity patterns, and their biological relevance, remain elusive. Here, we addressed these questions using two-photon calcium imaging of intact zebrafish larvae to monitor the neuron-to-neuron spontaneous activity fine structure in the tectum, a region involved in visual spatial detection. Spontaneous activity was organized in topographically compact assemblies, grouping functionally similar neurons rather than merely neighboring ones, reflecting the tectal retinotopic map despite being independent of retinal drive. Assemblies represent all-or-none-like sub-networks shaped by competitive dynamics, mechanisms advantageous for visual detection in noisy natural environments. Notably, assemblies were tuned to the same angular sizes and spatial positions as prey-detection performance in behavioral assays, and their spontaneous activation predicted directional tail movements. Therefore, structured spontaneous activity represents "preferred" network states, tuned to behaviorally relevant features, emerging from the circuit's intrinsic non-linear dynamics, adapted for its functional role. Copyright © 2015 The Authors. Published by Elsevier Inc. All rights reserved.
Development of quantum-based adaptive neuro-fuzzy networks.
Kim, Sung-Suk; Kwak, Keun-Chang
2010-02-01
In this study, we are concerned with a method for constructing quantum-based adaptive neuro-fuzzy networks (QANFNs) with a Takagi-Sugeno-Kang (TSK) fuzzy type based on the fuzzy granulation from a given input-output data set. For this purpose, we developed a systematic approach in producing automatic fuzzy rules based on fuzzy subtractive quantum clustering. This clustering technique is not only an extension of ideas inherent to scale-space and support-vector clustering but also represents an effective prototype that exhibits certain characteristics of the target system to be modeled from the fuzzy subtractive method. Furthermore, we developed linear-regression QANFN (LR-QANFN) as an incremental model to deal with localized nonlinearities of the system, so that all modeling discrepancies can be compensated. After adopting the construction of the linear regression as the first global model, we refined it through a series of local fuzzy if-then rules in order to capture the remaining localized characteristics. The experimental results revealed that the proposed QANFN and LR-QANFN yielded a better performance in comparison with radial basis function networks and the linguistic model obtained in previous literature for an automobile mile-per-gallon prediction, Boston Housing data, and a coagulant dosing process in a water purification plant.
Discrete rate and variable power adaptation for underlay cognitive networks
Abdallah, Mohamed M.
2010-01-01
We consider the problem of maximizing the average spectral efficiency of a secondary link in underlay cognitive networks. In particular, we consider the network setting whereby the secondary transmitter employs discrete rate and variable power adaptation under the constraints of maximum average transmit power and maximum average interference power allowed at the primary receiver due to the existence of an interference link between the secondary transmitter and the primary receiver. We first find the optimal discrete rates assuming a predetermined partitioning of the signal-to-noise ratio (SNR) of both the secondary and interference links. We then present an iterative algorithm for finding a suboptimal partitioning of the SNR of the interference link assuming a fixed partitioning of the SNR of secondary link selected for the case where no interference link exists. Our numerical results show that the average spectral efficiency attained by using the iterative algorithm is close to that achieved by the computationally extensive exhaustive search method for the case of Rayleigh fading channels. In addition, our simulations show that selecting the optimal partitioning of the SNR of the secondary link assuming no interference link exists still achieves the maximum average spectral efficiency for the case where the average interference constraint is considered. © 2010 IEEE.
An Adaptive Computational Network Model for Multi-Emotional Social Interaction
Roller, Ramona; Blommestijn, Suzan Q.; Treur, J.
2017-01-01
The study reported in this paper investigates an adaptive temporal-causal network-model for emotion contagion. The dynamic network principles of emotion contagion and the adaptive principles of homophily and Hebbian learning were used to simulate the change in multiple emotions and social
Boussalis, Dhemetrios; Wang, Shyh J.
1992-01-01
This paper presents a method for utilizing artificial neural networks for direct adaptive control of dynamic systems with poorly known dynamics. The neural network weights (controller gains) are adapted in real time using state measurements and a random search optimization algorithm. The results are demonstrated via simulation using two highly nonlinear systems.
Yang, Li-xin; Jiang, Jun
2014-05-01
This paper investigates the adaptive synchronization in the drive-response fractional-order dynamical networks with uncertain parameters. By means of both the stability theory of fractional-order differential system and the adaptive control technique, a novel adaptive synchronization controller is developed with a more general and simpler analytical expression, which does not contain the parameters of the complex network, and effective adaptive laws of parameters. Furthermore, the very strong and conservative uniformly Lipschitz condition on the node dynamics of complex network is released. To demonstrate the validity of the proposed method, the examples for the synchronization of systems with the chaotic and hyper-chaotic node dynamics are presented.
An OCP Compliant Network Adapter for GALS-based SoC Design Using the MANGO Network-on-Chip
DEFF Research Database (Denmark)
Bjerregaard, Tobias; Mahadevan, Shankar; Olsen, Rasmus Grøndahl
2005-01-01
The demand for IP reuse and system level scalability in System-on-Chip (SoC) designs is growing. Network-onchip (NoC) constitutes a viable solution space to emerging SoC design challenges. In this paper we describe an OCP compliant network adapter (NA) architecture for the MANGO NoC. The NA...... decouples communication and computation, providing memory-mapped OCP transactions based on primitive message-passing services of the network. Also, it facilitates GALS-type systems, by adapting to the clockless network. This helps leverage a modular SoC design flow. We evaluate performance and cost of 0...
A symmetry perceiving adaptive neural network and facial image recognition.
Sinha, P
1998-11-30
The paper deals with the forensic problem of comparing nearly from view and facial images for personal identification. The human recognition process for such problems, is primarily based on both holistic as well as feature-wise symmetry perception aided by subjective analysis for detecting ill-defined features. It has been attempted to approach the modelling of such a process by designing a robust symmetry perceiving adaptive neural network. The pair of images to be compared should be presented to the proposed neural network (NN) as source (input) and target images. The NN learns about the symmetry between the pair of images by analysing examples of associated feature pairs belonging to the source and the target images. In order to prepare a paired example of associated features for training purpose, when we select one particular feature on the source image as a unique pixel, we must associate it with the corresponding feature on the target image also. But, in practice, it is not always possible to fix the latter feature also as a unique pixel due to pictorial ambiguity. The robust or fault tolerant NN takes care of such a situation and allows fixing the associated target feature as a rectangular array of pixels, rather than fixing it as a unique pixel, which is pretty difficult to be done with certainty. From such a pair of sets of associated features, the NN searches out proper locations of the target features from the sets of ambiguous target features by a fuzzy analysis during its learning. If any of target features, searched out by the NN, lies outside the prespecified zone, the training of the NN is unsuccessful. This amounts to non-existence of symmetry between the pair of images and confirms non-identity. In case of a successful training, the NN gets adapted with appropriate symmetry relation between the pair of images and when the source image is input to the trained NN, it responds by outputting a processed source image which is superimposable over the
On adaptive control of mobile slotted aloha networks
Directory of Open Access Journals (Sweden)
Lim J.-T.
1995-01-01
Full Text Available An adaptive control scheme for mobile slotted ALOHA is presented and the effect of capture on the adaptive control scheme is investigated. It is shown that with the proper choice of adaptation parameters the adaptive control scheme can be made independent of the effect of capture.
National Research Council Canada - National Science Library
Leal, Daniele Lopes; Paiva, Saul Martins; Werneck, Marcos Azeredo Furquim; Oliveira, Ana Cristina Borges de
2014-01-01
.... The current study aimed to describe the stages in the adaptation of the oral healthcare version of an instrument to evaluate the stage of development in the healthcare network under the Unified National Health System (SUS...
Adaptive Synchronization of Fractional Neural Networks with Unknown Parameters and Time Delays
Directory of Open Access Journals (Sweden)
Weiyuan Ma
2014-12-01
Full Text Available In this paper, the parameters identification and synchronization problem of fractional-order neural networks with time delays are investigated. Based on some analytical techniques and an adaptive control method, a simple adaptive synchronization controller and parameter update laws are designed to synchronize two uncertain complex networks with time delays. Besides, the system parameters in the uncertain network can be identified in the process of synchronization. To demonstrate the validity of the proposed method, several illustrative examples are presented.
Adaptive autonomous Communications Routing Optimizer for Network Efficiency Management Project
National Aeronautics and Space Administration — Maximizing network efficiency for NASA's Space Networking resources is a large, complex, distributed problem, requiring substantial collaboration. We propose the...
Second moment method for a family of boolean CSP
Boufkhad, Yacine
2011-01-01
The estimation of phase transitions in random boolean Constraint Satisfaction Problems (CSP) is based on two fundamental tools: the first and second moment methods. While the first moment method on the number of solutions permits to compute upper bounds on any boolean CSP, the second moment method used for computing lower bounds proves to be more tricky and in most cases gives only the trivial lower bound 0. In this paper, we define a subclass of boolean CSP covering the monotone versions of many known NP-Complete boolean CSPs. We give a method for computing non trivial lower bounds for any member of this subclass. This is achieved thanks to an application of the second moment method to some selected solutions called characteristic solutions that depend on the boolean CSP considered. We apply, as an example, this method to establish that the threshold r_{k} of monotone 1-in-k-SAT is \\log k/k\\leq r_{k}\\leq\\log^{2}k/k
Distributed reinforcement learning for adaptive and robust network intrusion response
Malialis, Kleanthis; Devlin, Sam; Kudenko, Daniel
2015-07-01
Distributed denial of service (DDoS) attacks constitute a rapidly evolving threat in the current Internet. Multiagent Router Throttling is a novel approach to defend against DDoS attacks where multiple reinforcement learning agents are installed on a set of routers and learn to rate-limit or throttle traffic towards a victim server. The focus of this paper is on online learning and scalability. We propose an approach that incorporates task decomposition, team rewards and a form of reward shaping called difference rewards. One of the novel characteristics of the proposed system is that it provides a decentralised coordinated response to the DDoS problem, thus being resilient to DDoS attacks themselves. The proposed system learns remarkably fast, thus being suitable for online learning. Furthermore, its scalability is successfully demonstrated in experiments involving 1000 learning agents. We compare our approach against a baseline and a popular state-of-the-art throttling technique from the network security literature and show that the proposed approach is more effective, adaptive to sophisticated attack rate dynamics and robust to agent failures.
An Adaptive Amplifier System for Wireless Sensor Network Applications
Directory of Open Access Journals (Sweden)
Mónica Lovay
2012-01-01
Full Text Available This paper presents an adaptive amplifier that is part of a sensor node in a wireless sensor network. The system presents a target gain that has to be maintained without direct human intervention despite the presence of faults. In addition, its bandwidth must be as large as possible. The system is composed of a software-based built-in self-test scheme implemented in the node that checks all the available gains in the amplifiers, a reconfigurable amplifier, and a genetic algorithm (GA for reconfiguring the node resources that runs on a host computer. We adopt a PSoC device from Cypress for the node implementation. The performance evaluation of the scheme presented is made by adopting four different types of fault models in the amplifier gains. The fault simulation results show that GA finds the target gain with low error, maintains the bandwidth above the minimum tolerable bandwidth, and presents a runtime lower than exhaustive search method.
Adaptive moment closure for parameter inference of biochemical reaction networks.
Schilling, Christian; Bogomolov, Sergiy; Henzinger, Thomas A; Podelski, Andreas; Ruess, Jakob
2016-11-01
Continuous-time Markov chain (CTMC) models have become a central tool for understanding the dynamics of complex reaction networks and the importance of stochasticity in the underlying biochemical processes. When such models are employed to answer questions in applications, in order to ensure that the model provides a sufficiently accurate representation of the real system, it is of vital importance that the model parameters are inferred from real measured data. This, however, is often a formidable task and all of the existing methods fail in one case or the other, usually because the underlying CTMC model is high-dimensional and computationally difficult to analyze. The parameter inference methods that tend to scale best in the dimension of the CTMC are based on so-called moment closure approximations. However, there exists a large number of different moment closure approximations and it is typically hard to say a priori which of the approximations is the most suitable for the inference procedure. Here, we propose a moment-based parameter inference method that automatically chooses the most appropriate moment closure method. Accordingly, contrary to existing methods, the user is not required to be experienced in moment closure techniques. In addition to that, our method adaptively changes the approximation during the parameter inference to ensure that always the best approximation is used, even in cases where different approximations are best in different regions of the parameter space. Copyright © 2016 Elsevier Ireland Ltd. All rights reserved.
Composite learning from adaptive backstepping neural network control.
Pan, Yongping; Sun, Tairen; Liu, Yiqi; Yu, Haoyong
2017-11-01
In existing neural network (NN) learning control methods, the trajectory of NN inputs must be recurrent to satisfy a stringent condition termed persistent excitation (PE) so that NN parameter convergence is obtainable. This paper focuses on command-filtered backstepping adaptive control for a class of strict-feedback nonlinear systems with functional uncertainties, where an NN composite learning technique is proposed to guarantee convergence of NN weights to their ideal values without the PE condition. In the NN composite learning, spatially localized NN approximation is employed to handle functional uncertainties, online historical data together with instantaneous data are exploited to generate prediction errors, and both tracking errors and prediction errors are employed to update NN weights. The influence of NN approximation errors on the control performance is also clearly shown. The distinctive feature of the proposed NN composite learning is that NN parameter convergence is guaranteed without the requirement of the trajectory of NN inputs being recurrent. Illustrative results have verified effectiveness and superiority of the proposed method compared with existing NN learning control methods. Copyright © 2017 Elsevier Ltd. All rights reserved.
Reward and Punishment based Cooperative Adaptive Sampling in Wireless Sensor Networks
Masoum, Alireza; Meratnia, Nirvana; Taghikhaki, Zahra; Havinga, Paul J.M.
2010-01-01
Energy conservation is one of the main concerns in wireless sensor networks. One of the mechanisms to better manage energy in wireless sensor networks is adaptive sampling, by which instead of using a fixed frequency interval for sensing and data transmission, the wireless sensor network employs a
Attractor-Based Obstructions to Growth in Homogeneous Cyclic Boolean Automata.
Khan, Bilal; Cantor, Yuri; Dombrowski, Kirk
2015-11-01
We consider a synchronous Boolean organism consisting of N cells arranged in a circle, where each cell initially takes on an independently chosen Boolean value. During the lifetime of the organism, each cell updates its own value by responding to the presence (or absence) of diversity amongst its two neighbours' values. We show that if all cells eventually take a value of 0 (irrespective of their initial values) then the organism necessarily has a cell count that is a power of 2. In addition, the converse is also proved: if the number of cells in the organism is a proper power of 2, then no matter what the initial values of the cells are, eventually all cells take on a value of 0 and then cease to change further. We argue that such an absence of structure in the dynamical properties of the organism implies a lack of adaptiveness, and so is evolutionarily disadvantageous. It follows that as the organism doubles in size (say from m to 2m) it will necessarily encounter an intermediate size that is a proper power of 2, and suffers from low adaptiveness. Finally we show, through computational experiments, that one way an organism can grow to more than twice its size and still avoid passing through intermediate sizes that lack structural dynamics, is for the organism to depart from assumptions of homogeneity at the cellular level.
Optimal Base Encodings for Pseudo-Boolean Constraints
Codish, Michael; Fuhs, Carsten; Schneider-Kamp, Peter
2010-01-01
This paper formalizes the "optimal base problem", presents an algorithm to solve it, and describes its application to the encoding of Pseudo-Boolean constraints to SAT. We demonstrate the impact of integrating our algorithm within the Pseudo-Boolean constraint solver MiniSAT+. Experimentation indicates that our algorithm scales to consider bases involving numbers up to 1,000,000, improving on the restriction in MiniSAT+ to prime numbers up to 17. We show that, while for many examples primes up to 17 do suffice, encoding with respect to arbitrary bases improves the subsequent SAT solving time considerably.
Refinement monoids, equidecomposability types, and boolean inverse semigroups
Wehrung, Friedrich
2017-01-01
Adopting a new universal algebraic approach, this book explores and consolidates the link between Tarski's classical theory of equidecomposability types monoids, abstract measure theory (in the spirit of Hans Dobbertin's work on monoid-valued measures on Boolean algebras) and the nonstable K-theory of rings. This is done via the study of a monoid invariant, defined on Boolean inverse semigroups, called the type monoid. The new techniques contrast with the currently available topological approaches. Many positive results, but also many counterexamples, are provided.
Adaptive robotic control driven by a versatile spiking cerebellar network.
Casellato, Claudia; Antonietti, Alberto; Garrido, Jesus A; Carrillo, Richard R; Luque, Niceto R; Ros, Eduardo; Pedrocchi, Alessandra; D'Angelo, Egidio
2014-01-01
The cerebellum is involved in a large number of different neural processes, especially in associative learning and in fine motor control. To develop a comprehensive theory of sensorimotor learning and control, it is crucial to determine the neural basis of coding and plasticity embedded into the cerebellar neural circuit and how they are translated into behavioral outcomes in learning paradigms. Learning has to be inferred from the interaction of an embodied system with its real environment, and the same cerebellar principles derived from cell physiology have to be able to drive a variety of tasks of different nature, calling for complex timing and movement patterns. We have coupled a realistic cerebellar spiking neural network (SNN) with a real robot and challenged it in multiple diverse sensorimotor tasks. Encoding and decoding strategies based on neuronal firing rates were applied. Adaptive motor control protocols with acquisition and extinction phases have been designed and tested, including an associative Pavlovian task (Eye blinking classical conditioning), a vestibulo-ocular task and a perturbed arm reaching task operating in closed-loop. The SNN processed in real-time mossy fiber inputs as arbitrary contextual signals, irrespective of whether they conveyed a tone, a vestibular stimulus or the position of a limb. A bidirectional long-term plasticity rule implemented at parallel fibers-Purkinje cell synapses modulated the output activity in the deep cerebellar nuclei. In all tasks, the neurorobot learned to adjust timing and gain of the motor responses by tuning its output discharge. It succeeded in reproducing how human biological systems acquire, extinguish and express knowledge of a noisy and changing world. By varying stimuli and perturbations patterns, real-time control robustness and generalizability were validated. The implicit spiking dynamics of the cerebellar model fulfill timing, prediction and learning functions.
Breast image feature learning with adaptive deconvolutional networks
Jamieson, Andrew R.; Drukker, Karen; Giger, Maryellen L.
2012-03-01
Feature extraction is a critical component of medical image analysis. Many computer-aided diagnosis approaches employ hand-designed, heuristic lesion extracted features. An alternative approach is to learn features directly from images. In this preliminary study, we explored the use of Adaptive Deconvolutional Networks (ADN) for learning high-level features in diagnostic breast mass lesion images with potential application to computer-aided diagnosis (CADx) and content-based image retrieval (CBIR). ADNs (Zeiler, et. al., 2011), are recently-proposed unsupervised, generative hierarchical models that decompose images via convolution sparse coding and max pooling. We trained the ADNs to learn multiple layers of representation for two breast image data sets on two different modalities (739 full field digital mammography (FFDM) and 2393 ultrasound images). Feature map calculations were accelerated by use of GPUs. Following Zeiler et. al., we applied the Spatial Pyramid Matching (SPM) kernel (Lazebnik, et. al., 2006) on the inferred feature maps and combined this with a linear support vector machine (SVM) classifier for the task of binary classification between cancer and non-cancer breast mass lesions. Non-linear, local structure preserving dimension reduction, Elastic Embedding (Carreira-Perpiñán, 2010), was then used to visualize the SPM kernel output in 2D and qualitatively inspect image relationships learned. Performance was found to be competitive with current CADx schemes that use human-designed features, e.g., achieving a 0.632+ bootstrap AUC (by case) of 0.83 [0.78, 0.89] for an ultrasound image set (1125 cases).
Adaptive robotic control driven by a versatile spiking cerebellar network.
Directory of Open Access Journals (Sweden)
Claudia Casellato
Full Text Available The cerebellum is involved in a large number of different neural processes, especially in associative learning and in fine motor control. To develop a comprehensive theory of sensorimotor learning and control, it is crucial to determine the neural basis of coding and plasticity embedded into the cerebellar neural circuit and how they are translated into behavioral outcomes in learning paradigms. Learning has to be inferred from the interaction of an embodied system with its real environment, and the same cerebellar principles derived from cell physiology have to be able to drive a variety of tasks of different nature, calling for complex timing and movement patterns. We have coupled a realistic cerebellar spiking neural network (SNN with a real robot and challenged it in multiple diverse sensorimotor tasks. Encoding and decoding strategies based on neuronal firing rates were applied. Adaptive motor control protocols with acquisition and extinction phases have been designed and tested, including an associative Pavlovian task (Eye blinking classical conditioning, a vestibulo-ocular task and a perturbed arm reaching task operating in closed-loop. The SNN processed in real-time mossy fiber inputs as arbitrary contextual signals, irrespective of whether they conveyed a tone, a vestibular stimulus or the position of a limb. A bidirectional long-term plasticity rule implemented at parallel fibers-Purkinje cell synapses modulated the output activity in the deep cerebellar nuclei. In all tasks, the neurorobot learned to adjust timing and gain of the motor responses by tuning its output discharge. It succeeded in reproducing how human biological systems acquire, extinguish and express knowledge of a noisy and changing world. By varying stimuli and perturbations patterns, real-time control robustness and generalizability were validated. The implicit spiking dynamics of the cerebellar model fulfill timing, prediction and learning functions.
Energy Technology Data Exchange (ETDEWEB)
Xu Yuhua, E-mail: yuhuaxu2004@163.co [College of Information Science and Technology, Donghua University, Shanghai 201620 (China) and Department of Maths, Yunyang Teacher' s College, Hubei 442000 (China); Zhou Wuneng, E-mail: wnzhou@163.co [College of Information Science and Technology, Donghua University, Shanghai 201620 (China); Fang Jian' an [College of Information Science and Technology, Donghua University, Shanghai 201620 (China); Lu Hongqian [Shandong Institute of Light Industry, Shandong Jinan 250353 (China)
2009-12-28
This Letter proposes an approach to identify the topological structure and unknown parameters for uncertain general complex networks simultaneously. By designing effective adaptive controllers, we achieve synchronization between two complex networks. The unknown network topological structure and system parameters of uncertain general complex dynamical networks are identified simultaneously in the process of synchronization. Several useful criteria for synchronization are given. Finally, an illustrative example is presented to demonstrate the application of the theoretical results.
Adaptive Naive Bayes classification for wireless sensor networks
Zwartjes, G.J.
2017-01-01
Wireless Sensor Networks are tiny devices equipped with sensors and wireless communication. These devices observe environments and communicatie about these observations. Machine Learning techniques are of interest for Wireless Sensor Network applications since they can reduce the amount of needed
Exploring Educational and Cultural Adaptation through Social Networking Sites
Ryan, Sherry D.; Magro, Michael J.; Sharp, Jason H.
2011-01-01
Social networking sites have seen tremendous growth and are widely used around the world. Nevertheless, the use of social networking sites in educational contexts is an under explored area. This paper uses a qualitative methodology, autoethnography, to investigate how social networking sites, specifically Facebook[TM], can help first semester…
Energy Technology Data Exchange (ETDEWEB)
Matthew Andrews; Spyridon Antonakopoulos; Steve Fortune; Andrea Francini; Lisa Zhang
2011-07-12
This Concept Definition Study focused on developing a scientific understanding of methods to reduce energy consumption in data networks using rate adaptation. Rate adaptation is a collection of techniques that reduce energy consumption when traffic is light, and only require full energy when traffic is at full provisioned capacity. Rate adaptation is a very promising technique for saving energy: modern data networks are typically operated at average rates well below capacity, but network equipment has not yet been designed to incorporate rate adaptation. The Study concerns packet-switching equipment, routers and switches; such equipment forms the backbone of the modern Internet. The focus of the study is on algorithms and protocols that can be implemented in software or firmware to exploit hardware power-control mechanisms. Hardware power-control mechanisms are widely used in the computer industry, and are beginning to be available for networking equipment as well. Network equipment has different performance requirements than computer equipment because of the very fast rate of packet arrival; hence novel power-control algorithms are required for networking. This study resulted in five published papers, one internal report, and two patent applications, documented below. The specific technical accomplishments are the following: • A model for the power consumption of switching equipment used in service-provider telecommunication networks as a function of operating state, and measured power-consumption values for typical current equipment. • An algorithm for use in a router that adapts packet processing rate and hence power consumption to traffic load while maintaining performance guarantees on delay and throughput. • An algorithm that performs network-wide traffic routing with the objective of minimizing energy consumption, assuming that routers have less-than-ideal rate adaptivity. • An estimate of the potential energy savings in service-provider networks
Mobilization and Adaptation of a Rural Cradle-to-Career Network
Directory of Open Access Journals (Sweden)
Sarah J. Zuckerman
2016-10-01
Full Text Available This case study explored the development of a rural cradle-to-career network with a dual focus on the initial mobilization of network members and subsequent adaptations made to maintain mobilization, while meeting local needs. Data sources included interviews with network members, observations of meetings, and documentary evidence. Network-based social capital facilitated mobilization. Where networks were absent and where distrust and different values were evident, mobilization faltered. Three network adaptations were discovered: Special rural community organizing strategies, district-level action planning, and a theory of action focused on out-of-school factors. All three were attributable to the composition of mobilized stakeholders and this network’s rural social geography. These findings illuminate the importance of social geography in the development and advancement of rural cradle-to-career networks.
Adaptive Noise Cancellation for speech Employing Fuzzy and Neural Network
Mohammed Hussein Miry; Ali Hussein Miry; Hussain Kareem Khleaf
2011-01-01
Adaptive filtering constitutes one of the core technologies in digital signal processing and finds numerous application areas in science as well as in industry. Adaptive filtering techniques are used in a wide range of applications such as noise cancellation. Noise cancellation is a common occurrence in today telecommunication systems. The LMS algorithm which is one of the most efficient criteria for determining the values of the adaptive noise cancellation coefficient...
National Research Council Canada - National Science Library
Pakdaman, Khashayar; Perthame, Benoît; Salort, Delphine
2014-01-01
Motivated by a model for neural networks with adaptation and fatigue, we study a conservative fragmentation equation that describes the density probability of neurons with an elapsed time s after its last...
National Research Council Canada - National Science Library
Ibrahim, A.M; El-Khattam, W; ElMesallamy, M; Talaat, H.A
2016-01-01
This paper presents an adaptive protection coordination scheme for optimal coordination of DOCRs in interconnected power networks with the impact of DG, the used coordination technique is the Artificial Bee Colony (ABC...
Adaptive RBF Neural Network Control for Three-Phase Active Power Filter
Directory of Open Access Journals (Sweden)
Juntao Fei
2013-05-01
Full Text Available Abstract An adaptive radial basis function (RBF neural network control system for three-phase active power filter (APF is proposed to eliminate harmonics. Compensation current is generated to track command current so as to eliminate the harmonic current of non-linear load and improve the quality of the power system. The asymptotical stability of the APF system can be guaranteed with the proposed adaptive neural network strategy. The parameters of the neural network can be adaptively updated to achieve the desired tracking task. The simulation results demonstrate good performance, for example showing small current tracking error, reduced total harmonic distortion (THD, improved accuracy and strong robustness in the presence of parameters variation and nonlinear load. It is shown that the adaptive RBF neural network control system for three-phase APF gives better control than hysteresis control.
Combinational Logic-Level Verification using Boolean Expression Diagrams
DEFF Research Database (Denmark)
Hulgaard, Henrik; Williams, Poul Frederick; Andersen, Henrik Reif
1997-01-01
of BDDs. This paper demonstrates that BEDs are well suited for solving the combinational logic-level verification problem which is, given two combinational circuits, to determine whether they implement the same Boolean functions. Based on all combinational circuits in the ISCAS 85 and LGSynth 91...
Parallel object-oriented term rewriting : the booleans
Rodenburg, P.H.; Vrancken, J.L.M.
As a first case study in parallel object-oriented term rewriting, we give two implementations of term rewriting algorithms for boolean terms, using the parallel object-oriented features of the language Pool-T. The term rewriting systems are specified in the specification formalism
Complexity of Identification and Dualization of Positive Boolean Functions
J.C. Bioch (Cor); T. Ibaraki
1995-01-01
textabstractWe consider in this paper the problem of identifying min T(f{hook}) and max F(f{hook}) of a positive (i.e., monotone) Boolean function f{hook}, by using membership queries only, where min T(f{hook}) (max F(f{hook})) denotes the set of minimal true vectors (maximal false vectors) of
Graphical interpretation of Boolean operators for protein NMR assignments
Verdegem, Dries; Dijkstra, Klaas; Hanoulle, Xavier; Lippens, Guy
We have developed a graphics based algorithm for semi-automated protein NMR assignments. Using the basic sequential triple resonance assignment strategy, the method is inspired by the Boolean operators as it applies "AND"-, "OR"- and "NOT"-like operations on planes pulled out of the classical
A Boolean Approach to Airline Business Model Innovation
DEFF Research Database (Denmark)
Hvass, Kristian Anders
analyzes the business models of North America low-cost carriers from 2001 to 2010 using a Boolean minimization algorithm to identify which combinations of business model activities lead to operational profitability. The research aim is threefold: complement airline literature in the realm of business model...
Azhoni, Adani; Holman, Ian P.; Jude, Simon J.
2017-01-01
The capacity of a nation to address the hydrological impacts of climate change depends on the institutions through which water is governed. Inter-institutional networks that enable institutions to adapt and the factors that hinder smooth coordination are poorly understood. Using water governance in India as an example of a complex top-down bureaucratic system that requires effective networks between all key institutions, this research unravels the barriers to adaptation by combining quantitat...
Simulation and experimental testbed for adaptive video streaming in ad hoc networks
Gonzalez-Martinez, Santiago Renan; Castellanos Hernández, Wilder Eduardo; Guzman Castillo, Paola Fernanda; Arce Vila, Pau; Guerri Cebollada, Juan Carlos
2016-01-01
This paper presents a performance evaluation of the scalable video streaming over mobile ad hoc networks. In particular, we focus on the rate-adaptive method for streaming scalable video (H.264/SVC). For effective adaptation a new cross-layer routing protocol is introduced. This protocol provides an efficient algorithm for available bandwidth estimation. With this information, the video source adjusts its bit rate during the video transmission according to the network state. We also propose a...
[Robustness analysis of adaptive neural network model based on spike timing-dependent plasticity].
Chen, Yunzhi; Xu, Guizhi; Zhou, Qian; Guo, Miaomiao; Guo, Lei; Wan, Xiaowei
2015-02-01
To explore the self-organization robustness of the biological neural network, and thus to provide new ideas and methods for the electromagnetic bionic protection, we studied both the information transmission mechanism of neural network and spike timing-dependent plasticity (STDP) mechanism, and then investigated the relationship between synaptic plastic and adaptive characteristic of biology. Then a feedforward neural network with the Izhikevich model and the STDP mechanism was constructed, and the adaptive robust capacity of the network was analyzed. Simulation results showed that the neural network based on STDP mechanism had good rubustness capacity, and this characteristics is closely related to the STDP mechanisms. Based on this simulation work, the cell circuit with neurons and synaptic circuit which can simulate the information processing mechanisms of biological nervous system will be further built, then the electronic circuits with adaptive robustness will be designed based on the cell circuit.
Finding Robust Adaptation Gene Regulatory Networks Using Multi-Objective Genetic Algorithm.
Ren, Hai-Peng; Huang, Xiao-Na; Hao, Jia-Xuan
2016-01-01
Robust adaptation plays a key role in gene regulatory networks, and it is thought to be an important attribute for the organic or cells to survive in fluctuating conditions. In this paper, a simplified three-node enzyme network is modeled by the Michaelis-Menten rate equations for all possible topologies, and a family of topologies and the corresponding parameter sets of the network with satisfactory adaptation are obtained using the multi-objective genetic algorithm. The proposed approach improves the computation efficiency significantly as compared to the time consuming exhaustive searching method. This approach provides a systemic way for searching the feasible topologies and the corresponding parameter sets to make the gene regulatory networks have robust adaptation. The proposed methodology, owing to its universality and simplicity, can be used to address more complex issues in biological networks.
Network Adaptability from WMD Disruption and Cascading Failures
2016-04-01
and this will cause a traffic flood which may cause blocking or congestion of services required for rescue operations. After the post-attack period...Transparent Optical Networks (ICTON), Stockholm, Sweden ; June 27, 2011. 4. B. Mukherjee, "Panorama of Optical Network Survivability," Keynote Talk...Design and Modeling Conference, Kista, Sweden , May 22, 2014. 8. B. Mukherjee, “Disaster preparedness for network and information infrastructures
Donges, Jonathan; Lucht, Wolfgang; Wiedermann, Marc; Heitzig, Jobst; Kurths, Jürgen
2015-04-01
In the anthropocene, the rise of global social and economic networks with ever increasing connectivity and speed of interactions, e.g., the internet or global financial markets, is a key challenge for sustainable development. The spread of opinions, values or technologies on these networks, in conjunction with the coevolution of the network structures themselves, underlies nexuses of current concern such as anthropogenic climate change, biodiversity loss or global land use change. To isolate and quantitatively study the effects and implications of network dynamics for sustainable development, we propose an agent-based model of information flow on adaptive networks between myopic harvesters that exploit private renewable resources. In this conceptual model of a network of socio-ecological systems, information on management practices flows between agents via boundedly rational imitation depending on the state of the resource stocks involved in an interaction. Agents can also adapt the structure of their social network locally by preferentially connecting to culturally similar agents with identical management practices and, at the same time, disconnecting from culturally dissimilar agents. Investigating in detail the statistical mechanics of this model, we find that an increasing rate of information flow through faster imitation dynamics or growing density of network connectivity leads to a marked increase in the likelihood of environmental resource collapse. However, we show that an optimal rate of social network adaptation can mitigate this negative effect without loss of social cohesion through network fragmentation. Our results highlight that seemingly immaterial network dynamics of spreading opinions or values can be of large relevance for the sustainable management of socio-ecological systems and suggest smartly conservative network adaptation as a strategy for mitigating environmental collapse. Hence, facing the great acceleration, these network dynamics should
Directory of Open Access Journals (Sweden)
A.M. Ibrahim
2016-09-01
Full Text Available This paper presents an adaptive protection coordination scheme for optimal coordination of DOCRs in interconnected power networks with the impact of DG, the used coordination technique is the Artificial Bee Colony (ABC. The scheme adapts to system changes; new relays settings are obtained as generation-level or system-topology changes. The developed adaptive scheme is applied on the IEEE 30-bus test system for both single- and multi-DG existence where results are shown and discussed.
Directory of Open Access Journals (Sweden)
Joshua Rodewald
2016-10-01
Full Text Available Supply networks existing today in many industries can behave as complex adaptive systems making them more difficult to analyze and assess. Being able to fully understand both the complex static and dynamic structures of a complex adaptive supply network (CASN are key to being able to make more informed management decisions and prioritize resources and production throughout the network. Previous efforts to model and analyze CASN have been impeded by the complex, dynamic nature of the systems. However, drawing from other complex adaptive systems sciences, information theory provides a model-free methodology removing many of those barriers, especially concerning complex network structure and dynamics. With minimal information about the network nodes, transfer entropy can be used to reverse engineer the network structure while local transfer entropy can be used to analyze the network structure’s dynamics. Both simulated and real-world networks were analyzed using this methodology. Applying the methodology to CASNs allows the practitioner to capitalize on observations from the highly multidisciplinary field of information theory which provides insights into CASN’s self-organization, emergence, stability/instability, and distributed computation. This not only provides managers with a more thorough understanding of a system’s structure and dynamics for management purposes, but also opens up research opportunities into eventual strategies to monitor and manage emergence and adaption within the environment.
2016-12-22
trains of organizational elements, just as in neuroscience , one can determine the information flow patterns through the organization . [9] 6 Transfer...many service industries. Organizations have been noted to behave as complex adaptive systems or information supply networks with both formal and...informal structures. Thoroughly understanding supply network structure and behavior are critical to managing such organizations effectively, but their
Boolean Modeling of Cellular and Molecular Pathways Involved in Influenza Infection
Directory of Open Access Journals (Sweden)
Christopher S. Anderson
2016-01-01
Full Text Available Systems virology integrates host-directed approaches with molecular profiling to understand viral pathogenesis. Self-contained statistical approaches that combine expression profiles of genes with the available databases defining the genes involved in the pathways (gene-sets have allowed characterization of predictive gene-signatures associated with outcome of the influenza virus (IV infection. However, such enrichment techniques do not take into account interactions among pathways that are responsible for the IV infection pathogenesis. We investigate dendritic cell response to seasonal H1N1 influenza A/New Caledonia/20/1999 (NC infection and infer the Boolean logic rules underlying the interaction network of ligand induced signaling pathways and transcription factors. The model reveals several novel regulatory modes and provides insights into mechanism of cross talk between NFκB and IRF mediated signaling. Additionally, the logic rule underlying the regulation of IL2 pathway that was predicted by the Boolean model was experimentally validated. Thus, the model developed in this paper integrates pathway analysis tools with the dynamic modeling approaches to reveal the regulation between signaling pathways and transcription factors using genome-wide transcriptional profiles measured upon influenza infection.
Directory of Open Access Journals (Sweden)
Tat-Bao-Thien Nguyen
2014-01-01
Full Text Available In this paper, based on fuzzy neural networks, we develop an adaptive sliding mode controller for chaos suppression and tracking control in a chaotic permanent magnet synchronous motor (PMSM drive system. The proposed controller consists of two parts. The first is an adaptive sliding mode controller which employs a fuzzy neural network to estimate the unknown nonlinear models for constructing the sliding mode controller. The second is a compensational controller which adaptively compensates estimation errors. For stability analysis, the Lyapunov synthesis approach is used to ensure the stability of controlled systems. Finally, simulation results are provided to verify the validity and superiority of the proposed method.
Xue, Y.; Liu, S.; Hu, Y.; Yang, J.; Chen, Q.
2007-01-01
To improve the accuracy in prediction, Genetic Algorithm based Adaptive Neural Network Ensemble (GA-ANNE) is presented. Intersections are allowed between different training sets based on the fuzzy clustering analysis, which ensures the diversity as well as the accuracy of individual Neural Networks (NNs). Moreover, to improve the accuracy of the adaptive weights of individual NNs, GA is used to optimize the cluster centers. Empirical results in predicting carbon flux of Duke Forest reveal that GA-ANNE can predict the carbon flux more accurately than Radial Basis Function Neural Network (RBFNN), Bagging NN ensemble, and ANNE. ?? 2007 IEEE.
An Adaptive-PSO-Based Self-Organizing RBF Neural Network.
Han, Hong-Gui; Lu, Wei; Hou, Ying; Qiao, Jun-Fei
2018-01-01
In this paper, a self-organizing radial basis function (SORBF) neural network is designed to improve both accuracy and parsimony with the aid of adaptive particle swarm optimization (APSO). In the proposed APSO algorithm, to avoid being trapped into local optimal values, a nonlinear regressive function is developed to adjust the inertia weight. Furthermore, the APSO algorithm can optimize both the network size and the parameters of an RBF neural network simultaneously. As a result, the proposed APSO-SORBF neural network can effectively generate a network model with a compact structure and high accuracy. Moreover, the analysis of convergence is given to guarantee the successful application of the APSO-SORBF neural network. Finally, multiple numerical examples are presented to illustrate the effectiveness of the proposed APSO-SORBF neural network. The results demonstrate that the proposed method is more competitive in solving nonlinear problems than some other existing SORBF neural networks.
Active random noise control using adaptive learning rate neural networks with an immune feedback law
Sasaki, Minoru; Kuribayashi, Takumi; Ito, Satoshi
2005-12-01
In this paper an active random noise control using adaptive learning rate neural networks with an immune feedback law is presented. The adaptive learning rate strategy increases the learning rate by a small constant if the current partial derivative of the objective function with respect to the weight and the exponential average of the previous derivatives have the same sign, otherwise the learning rate is decreased by a proportion of its value. The use of an adaptive learning rate attempts to keep the learning step size as large as possible without leading to oscillation. In the proposed method, because of the immune feedback law change a learning rate of the neural networks individually and adaptively, it is expected that a cost function minimize rapidly and training time is decreased. Numerical simulations and experiments of active random noise control with the transfer function of the error path will be performed, to validate the convergence properties of the adaptive learning rate Neural Networks with the immune feedback law. Control results show that adaptive learning rate Neural Networks control structure can outperform linear controllers and conventional neural network controller for the active random noise control.
Community detection in complex networks via adapted Kuramoto dynamics
Maia, Daniel M. N.; de Oliveira, João E. M.; Quiles, Marcos G.; Macau, Elbert E. N.
2017-12-01
Based on the Kuramoto model, a new network model, namely, the generalized Kuramoto model with Fourier term, is introduced for studying community detection in complex networks. In particular, the Fourier term provides a natural phase locking of the trajectories into a pre-defined number of clusters. A mathematical approach is used to study the behavior of the solutions and its properties. Conditions for properly choosing the coupling parameters so that phase locking takes place are presented and a quality function called clustering density is introduced to measure the effectiveness of the communities identification. Illustrations with real and synthetic networks with community structure are presented.
Zubek, Julian; Denkiewicz, Michał; Barański, Juliusz; Wróblewski, Przemysław; Rączaszek-Leonardi, Joanna; Plewczynski, Dariusz
2017-01-01
This paper explores how information flow properties of a network affect the formation of categories shared between individuals, who are communicating through that network. Our work is based on the established multi-agent model of the emergence of linguistic categories grounded in external environment. We study how network information propagation efficiency and the direction of information flow affect categorization by performing simulations with idealized network topologies optimizing certain network centrality measures. We measure dynamic social adaptation when either network topology or environment is subject to change during the experiment, and the system has to adapt to new conditions. We find that both decentralized network topology efficient in information propagation and the presence of central authority (information flow from the center to peripheries) are beneficial for the formation of global agreement between agents. Systems with central authority cope well with network topology change, but are less robust in the case of environment change. These findings help to understand which network properties affect processes of social adaptation. They are important to inform the debate on the advantages and disadvantages of centralized systems.
Benefit of adaptive FEC in shared backup path protected elastic optical network.
Guo, Hong; Dai, Hua; Wang, Chao; Li, Yongcheng; Bose, Sanjay K; Shen, Gangxiang
2015-07-27
We apply an adaptive forward error correction (FEC) allocation strategy to an Elastic Optical Network (EON) operated with shared backup path protection (SBPP). To maximize the protected network capacity that can be carried, an Integer Linear Programing (ILP) model and a spectrum window plane (SWP)-based heuristic algorithm are developed. Simulation results show that the FEC coding overhead required by the adaptive FEC scheme is significantly lower than that needed by a fixed FEC allocation strategy resulting in higher network capacity for the adaptive strategy. The adaptive FEC allocation strategy can also significantly outperform the fixed FEC allocation strategy both in terms of the spare capacity redundancy and the average FEC coding overhead needed per optical channel. The proposed heuristic algorithm is efficient and not only performs closer to the ILP model but also does much better than the shortest-path algorithm.
Location-Based Self-Adaptive Routing Algorithm for Wireless Sensor Networks in Home Automation
Directory of Open Access Journals (Sweden)
Hong SeungHo
2011-01-01
Full Text Available The use of wireless sensor networks in home automation (WSNHA is attractive due to their characteristics of self-organization, high sensing fidelity, low cost, and potential for rapid deployment. Although the AODVjr routing algorithm in IEEE 802.15.4/ZigBee and other routing algorithms have been designed for wireless sensor networks, not all are suitable for WSNHA. In this paper, we propose a location-based self-adaptive routing algorithm for WSNHA called WSNHA-LBAR. It confines route discovery flooding to a cylindrical request zone, which reduces the routing overhead and decreases broadcast storm problems in the MAC layer. It also automatically adjusts the size of the request zone using a self-adaptive algorithm based on Bayes' theorem. This makes WSNHA-LBAR more adaptable to the changes of the network state and easier to implement. Simulation results show improved network reliability as well as reduced routing overhead.
Evolutionarily conserved coupling of adaptive and excitable networks mediates eukaryotic chemotaxis
Tang, Ming; Wang, Mingjie; Shi, Changji; Iglesias, Pablo A.; Devreotes, Peter N.; Huang, Chuan-Hsiang
2014-10-01
Numerous models explain how cells sense and migrate towards shallow chemoattractant gradients. Studies show that an excitable signal transduction network acts as a pacemaker that controls the cytoskeleton to drive motility. Here we show that this network is required to link stimuli to actin polymerization and chemotactic motility and we distinguish the various models of chemotaxis. First, signalling activity is suppressed towards the low side in a gradient or following removal of uniform chemoattractant. Second, signalling activities display a rapid shut off and a slower adaptation during which responsiveness to subsequent test stimuli decline. Simulations of various models indicate that these properties require coupled adaptive and excitable networks. Adaptation involves a G-protein-independent inhibitor, as stimulation of cells lacking G-protein function suppresses basal activities. The salient features of the coupled networks were observed for different chemoattractants in Dictyostelium and in human neutrophils, suggesting an evolutionarily conserved mechanism for eukaryotic chemotaxis.
Macroscopic description of complex adaptive networks co-evolving with dynamic node states
Wiedermann, Marc; Heitzig, Jobst; Lucht, Wolfgang; Kurths, Jürgen
2015-01-01
In many real-world complex systems, the time-evolution of the network's structure and the dynamic state of its nodes are closely entangled. Here, we study opinion formation and imitation on an adaptive complex network which is dependent on the individual dynamic state of each node and vice versa to model the co-evolution of renewable resources with the dynamics of harvesting agents on a social network. The adaptive voter model is coupled to a set of identical logistic growth models and we show that in such systems, the rate of interactions between nodes as well as the adaptive rewiring probability play a crucial role for the sustainability of the system's equilibrium state. We derive a macroscopic description of the system which provides a general framework to model and quantify the influence of single node dynamics on the macroscopic state of the network and is applicable to many fields of study, such as epidemic spreading or social modeling.
de Nijs, Patrick J; Berry, Nicholas J; Wells, Geoff J; Reay, Dave S
2014-10-20
The need for smallholder farmers to adapt their practices to a changing climate is well recognised, particularly in Africa. The cost of adapting to climate change in Africa is estimated to be $20 to $30 billion per year, but the total amount pledged to finance adaptation falls significantly short of this requirement. The difficulty of assessing and monitoring when adaptation is achieved is one of the key barriers to the disbursement of performance-based adaptation finance. To demonstrate the potential of Bayesian Belief Networks for describing the impacts of specific activities on climate change resilience, we developed a simple model that incorporates climate projections, local environmental data, information from peer-reviewed literature and expert opinion to account for the adaptation benefits derived from Climate-Smart Agriculture activities in Malawi. This novel approach allows assessment of vulnerability to climate change under different land use activities and can be used to identify appropriate adaptation strategies and to quantify biophysical adaptation benefits from activities that are implemented. We suggest that multiple-indicator Bayesian Belief Network approaches can provide insights into adaptation planning for a wide range of applications and, if further explored, could be part of a set of important catalysts for the expansion of adaptation finance.
Online Algorithms for Adaptive Optimization in Heterogeneous Delay Tolerant Networks
Directory of Open Access Journals (Sweden)
Wissam Chahin
2013-12-01
Full Text Available Delay Tolerant Networks (DTNs are an emerging type of networks which do not need a predefined infrastructure. In fact, data forwarding in DTNs relies on the contacts among nodes which may possess different features, radio range, battery consumption and radio interfaces. On the other hand, efficient message delivery under limited resources, e.g., battery or storage, requires to optimize forwarding policies. We tackle optimal forwarding control for a DTN composed of nodes of different types, forming a so-called heterogeneous network. Using our model, we characterize the optimal policies and provide a suitable framework to design a new class of multi-dimensional stochastic approximation algorithms working for heterogeneous DTNs. Crucially, our proposed algorithms drive online the source node to the optimal operating point without requiring explicit estimation of network parameters. A thorough analysis of the convergence properties and stability of our algorithms is presented.
Method for designing networking adaptive interactive hybrid systems
Kester, L. J.H.M.
2010-01-01
Advances in network technologies enable distributed systems, operating in complex physical environments, to co-ordinate their activities over larger areas within shorter time intervals. Some envisioned application domains for such systems are defence, crisis management, traffic management and public
Networked Adaptive Interactive Hybrid Systems (NAIHS) for multiplatform engagement capability
Kester, L.J.H.M.
2008-01-01
Advances in network technologies enable distributed systems, operating in complex physical environments, to coordinate their activities over larger areas within shorter time intervals. Some envisioned application domains for such systems are defence, crisis management, traffic management and public
Creating networking adaptive interactive hybrid systems : A methodic approach
Kester, L.J.
2011-01-01
Advances in network technologies enable distributed systems, operating in complex physical environments, to coordinate their activities over larger areas within shorter time intervals. Some envisioned application domains for such systems are defense, crisis management, traffic management, public
Exploring complex networks by means of adaptive walkers
Prignano, Luce; Moreno, Yamir; Diaz-Guilera, Albert
2012-01-01
Finding efficient algorithms to explore large networks with the aim of recovering information about their structure is an open problem. Here, we investigate this challenge by proposing a model in which random walkers with previously assigned home nodes navigate through the network during a fixed amount of time. We consider that the exploration is successful if the walker gets the information gathered back home, otherwise, no data is retrieved. Consequently, at each time step, the walkers, wit...
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.
Directory of Open Access Journals (Sweden)
Natalia A. Tomashenko
2016-11-01
Full Text Available Subject of Research. We study speaker adaptation of deep neural network (DNN acoustic models in automatic speech recognition systems. The aim of speaker adaptation techniques is to improve the accuracy of the speech recognition system for a particular speaker. Method. A novel method for training and adaptation of deep neural network acoustic models has been developed. It is based on using an auxiliary GMM (Gaussian Mixture Models model and GMMD (GMM-derived features. The principle advantage of the proposed GMMD features is the possibility of performing the adaptation of a DNN through the adaptation of the auxiliary GMM. In the proposed approach any methods for the adaptation of the auxiliary GMM can be used, hence, it provides a universal method for transferring adaptation algorithms developed for GMMs to DNN adaptation.Main Results. The effectiveness of the proposed approach was shown by means of one of the most common adaptation algorithms for GMM models – MAP (Maximum A Posteriori adaptation. Different ways of integration of the proposed approach into state-of-the-art DNN architecture have been proposed and explored. Analysis of choosing the type of the auxiliary GMM model is given. Experimental results on the TED-LIUM corpus demonstrate that, in an unsupervised adaptation mode, the proposed adaptation technique can provide, approximately, a 11–18% relative word error reduction (WER on different adaptation sets, compared to the speaker-independent DNN system built on conventional features, and a 3–6% relative WER reduction compared to the SAT-DNN trained on fMLLR adapted features.
Epidemic Dynamics On Information-Driven Adaptive Networks
Zhan, Xiu-Xiu; Sun, Gui-Quan; Zhang, Zi-Ke
2015-01-01
can evolve simultaneously. For the information-driven adaptive process, susceptible (infected) individuals who have abilities to recognize the disease would break the links of their infected (susceptible) neighbors to prevent the epidemic from further spreading. Simulation results and numerical analyses based on the pairwise approach indicate that the information-driven adaptive process can not only slow down the speed of epidemic spreading, but can also diminish the epidemic prevalence at the final state significantly. In addition, the disease spreading and information diffusion pattern on the lattice give a visual representation about how the disease is trapped into an isolated field with the information-driven adaptive process. Furthermore, we perform the local bifurcation analysis on four types of dynamical regions, including healthy, oscillatory, bistable and endemic, to understand the evolution of the observed dynamical behaviors. This work may shed some lights on understanding how information affects h...
Multitask Diffusion Adaptation Over Networks With Common Latent Representations
Chen, Jie; Richard, Cedric; Sayed, Ali H.
2017-04-01
Online learning with streaming data in a distributed and collaborative manner can be useful in a wide range of applications. This topic has been receiving considerable attention in recent years with emphasis on both single-task and multitask scenarios. In single-task adaptation, agents cooperate to track an objective of common interest, while in multitask adaptation agents track multiple objectives simultaneously. Regularization is one useful technique to promote and exploit similarity among tasks in the latter scenario. This work examines an alternative way to model relations among tasks by assuming that they all share a common latent feature representation. As a result, a new multitask learning formulation is presented and algorithms are developed for its solution in a distributed online manner. We present a unified framework to analyze the mean-square-error performance of the adaptive strategies, and conduct simulations to illustrate the theoretical findings and potential applications.
Adaptive Security Architecture based on EC-MQV Algorithm in Personal Network (PN)
DEFF Research Database (Denmark)
Mihovska, Albena D.; Prasad, Neeli R.
2007-01-01
Abstract — Personal Networks (PNs) have been focused on in order to support the user’s business and private activities without jeopardizing privacy and security of the users and their data. In such a network, it is necessary to produce a proper key agreement method according to the feature...... of the network. One of the features of the network is that the personal devices have deferent capabilities such as computational ability, memory size, transmission power, processing speed and implementation cost. Therefore an adaptive security mechanism should be contrived for such a network of various device...... combinations based on user’s location and device’s capability. The paper proposes new adaptive security architecture with three levels of asymmetric key agreement scheme by using context-aware security manager (CASM) based on elliptic curve cryptosystem (EC-MQV)....
Analysis of utility-theoretic heuristics for intelligent adaptive network routing
Energy Technology Data Exchange (ETDEWEB)
Mikler, A.R.; Honavar, V.; Wong, J.S.K. [Iowa State Univ., Ames, IA (United States)
1996-12-31
Utility theory offers an elegant and powerful theoretical framework for design and analysis of autonomous adaptive communication networks. Routing of messages in such networks presents a real-time instance of a multi-criterion optimization problem in a dynamic and uncertain environment. In this paper, we incrementally develop a set of heuristic decision functions that can be used to guide messages along a near-optimal (e.g., minimum delay) path in a large network. We present an analysis of properties of such heuristics under a set of simplifying assumptions about the network topology and load dynamics and identify the conditions under which they are guaranteed to route messages along an optimal path. The paper concludes with a discussion of the relevance of the theoretical results presented in the paper to the design of intelligent autonomous adaptive communication networks and an outline of some directions of future research.
Adaptation, Growth, and Resilience in Biological Distribution Networks
Ronellenfitsch, Henrik; Katifori, Eleni
Highly optimized complex transport networks serve crucial functions in many man-made and natural systems such as power grids and plant or animal vasculature. Often, the relevant optimization functional is nonconvex and characterized by many local extrema. In general, finding the global, or nearly global optimum is difficult. In biological systems, it is believed that such an optimal state is slowly achieved through natural selection. However, general coarse grained models for flow networks with local positive feedback rules for the vessel conductivity typically get trapped in low efficiency, local minima. We show how the growth of the underlying tissue, coupled to the dynamical equations for network development, can drive the system to a dramatically improved optimal state. This general model provides a surprisingly simple explanation for the appearance of highly optimized transport networks in biology such as plant and animal vasculature. In addition, we show how the incorporation of spatially collective fluctuating sources yields a minimal model of realistic reticulation in distribution networks and thus resilience against damage.
Breakdown of Modularity in Complex Networks.
Valverde, Sergi
2017-01-01
The presence of modular organization is a common property of a wide range of complex systems, from cellular or brain networks to technological graphs. Modularity allows some degree of segregation between different parts of the network and has been suggested to be a prerequisite for the evolvability of biological systems. In technology, modularity defines a clear division of tasks and it is an explicit design target. However, many natural and artificial systems experience a breakdown in their modular pattern of connections, which has been associated with failures in hub nodes or the activation of global stress responses. In spite of its importance, no general theory of the breakdown of modularity and its implications has been advanced yet. Here we propose a new, simple model of network landscape where it is possible to exhaustively characterize the breakdown of modularity in a well-defined way. Specifically, by considering the space of minimal Boolean feed-forward networks implementing the 256 Boolean functions with 3 inputs, we were able to relate functional characteristics with the breakdown of modularity. We found that evolution cannot reach maximally modular networks under the presence of functional and cost constraints, implying the breakdown of modularity is an adaptive feature.
Directory of Open Access Journals (Sweden)
Anna Lovrics
Full Text Available We have assembled a network of cell-fate determining transcription factors that play a key role in the specification of the ventral neuronal subtypes of the spinal cord on the basis of published transcriptional interactions. Asynchronous Boolean modelling of the network was used to compare simulation results with reported experimental observations. Such comparison highlighted the need to include additional regulatory connections in order to obtain the fixed point attractors of the model associated with the five known progenitor cell types located in the ventral spinal cord. The revised gene regulatory network reproduced previously observed cell state switches between progenitor cells observed in knock-out animal models or in experiments where the transcription factors were overexpressed. Furthermore the network predicted the inhibition of Irx3 by Nkx2.2 and this prediction was tested experimentally. Our results provide evidence for the existence of an as yet undescribed inhibitory connection which could potentially have significance beyond the ventral spinal cord. The work presented in this paper demonstrates the strength of Boolean modelling for identifying gene regulatory networks.
Lovrics, Anna
2014-11-14
We have assembled a network of cell-fate determining transcription factors that play a key role in the specification of the ventral neuronal subtypes of the spinal cord on the basis of published transcriptional interactions. Asynchronous Boolean modelling of the network was used to compare simulation results with reported experimental observations. Such comparison highlighted the need to include additional regulatory connections in order to obtain the fixed point attractors of the model associated with the five known progenitor cell types located in the ventral spinal cord. The revised gene regulatory network reproduced previously observed cell state switches between progenitor cells observed in knock-out animal models or in experiments where the transcription factors were overexpressed. Furthermore the network predicted the inhibition of Irx3 by Nkx2.2 and this prediction was tested experimentally. Our results provide evidence for the existence of an as yet undescribed inhibitory connection which could potentially have significance beyond the ventral spinal cord. The work presented in this paper demonstrates the strength of Boolean modelling for identifying gene regulatory networks.
Utilizing Network QoS for Dependability of Adaptive Smart Grid Control
DEFF Research Database (Denmark)
Madsen, Jacob Theilgaard; Kristensen, Thomas le Fevre; Olsen, Rasmus Løvenstein
2014-01-01
A smart grid is a complex system consisting of a wide range of electric grid components, entities controlling power distribution, generation and consumption, and a communication network supporting data exchange. This paper focuses on the influence of imperfect network conditions on smart grid con......- trollers, and how this can be counteracted by utilizing Quality of Service (QoS) information from the communication network. Such an interface between grid controller and network QoS is particularly relevant for smart grid scenarios that use third party communication network infrastructure, where...... modification of networking and lower layer protocols are impossible. This paper defines a middleware solution for adaptation of smart grid control, which uses network QoS information and interacts with the smart grid controller to increase dependability. In order to verify the methodology, an example scenario...
Adaptive Multipath Key Reinforcement for Energy Harvesting Wireless Sensor Networks
DEFF Research Database (Denmark)
Di Mauro, Alessio; Dragoni, Nicola
2015-01-01
reinforcement scheme specifically designed for EH-WSNs. The proposed scheme allows each node to take into consideration and adapt to the amount of energy available in the system. In particular, we present two approaches, one static and one fully dynamic, and we discuss some experimental results....
Adaptive Relay Activation in the Network Coding Protocols
DEFF Research Database (Denmark)
Pahlevani, Peyman; Roetter, Daniel Enrique Lucani; Fitzek, Frank
2015-01-01
of the channel states. Furthermore, measurements using our Raspberry Pi testbed demonstrate that our adaptive approach outperforms the previous mechanism in real channel conditions, with only 1% overhead due to linearly dependent coded packets compared to the 11% overhead of the standard PlayNCool approach....
Adaptive Forward Error Correction for Energy Efficient Optical Transport Networks
DEFF Research Database (Denmark)
Rasmussen, Anders; Ruepp, Sarah Renée; Berger, Michael Stübert
2013-01-01
In this paper we propose a novel scheme for on the fly code rate adjustment for forward error correcting (FEC) codes on optical links. The proposed scheme makes it possible to adjust the code rate independently for each optical frame. This allows for seamless rate adaption based on the link state...
Spectrum management considerations of adaptive power control in satellite networks
Sawitz, P.; Sullivan, T.
1983-01-01
Adaptive power control concepts for the compensation of rain attenuation are considered for uplinks and downlinks. The performance of example power-controlled and fixed-EIRP uplinks is compared in terms of C/Ns and C/Is. Provisional conclusions are drawn with regard to the efficacy of uplink and downlink power control orbit/spectrum utilization efficiency.
An adaptive failure detector based on quality of service in peer-to-peer networks.
Dong, Jian; Ren, Xiao; Zuo, Decheng; Liu, Hongwei
2014-09-05
The failure detector is one of the fundamental components that maintain high availability of Peer-to-Peer (P2P) networks. Under different network conditions, the adaptive failure detector based on quality of service (QoS) can achieve the detection time and accuracy required by upper applications with lower detection overhead. In P2P systems, complexity of network and high churn lead to high message loss rate. To reduce the impact on detection accuracy, baseline detection strategy based on retransmission mechanism has been employed widely in many P2P applications; however, Chen's classic adaptive model cannot describe this kind of detection strategy. In order to provide an efficient service of failure detection in P2P systems, this paper establishes a novel QoS evaluation model for the baseline detection strategy. The relationship between the detection period and the QoS is discussed and on this basis, an adaptive failure detector (B-AFD) is proposed, which can meet the quantitative QoS metrics under changing network environment. Meanwhile, it is observed from the experimental analysis that B-AFD achieves better detection accuracy and time with lower detection overhead compared to the traditional baseline strategy and the adaptive detectors based on Chen's model. Moreover, B-AFD has better adaptability to P2P network.
An Adaptive Failure Detector Based on Quality of Service in Peer-to-Peer Networks
Directory of Open Access Journals (Sweden)
Jian Dong
2014-09-01
Full Text Available The failure detector is one of the fundamental components that maintain high availability of Peer-to-Peer (P2P networks. Under different network conditions, the adaptive failure detector based on quality of service (QoS can achieve the detection time and accuracy required by upper applications with lower detection overhead. In P2P systems, complexity of network and high churn lead to high message loss rate. To reduce the impact on detection accuracy, baseline detection strategy based on retransmission mechanism has been employed widely in many P2P applications; however, Chen’s classic adaptive model cannot describe this kind of detection strategy. In order to provide an efficient service of failure detection in P2P systems, this paper establishes a novel QoS evaluation model for the baseline detection strategy. The relationship between the detection period and the QoS is discussed and on this basis, an adaptive failure detector (B-AFD is proposed, which can meet the quantitative QoS metrics under changing network environment. Meanwhile, it is observed from the experimental analysis that B-AFD achieves better detection accuracy and time with lower detection overhead compared to the traditional baseline strategy and the adaptive detectors based on Chen’s model. Moreover, B-AFD has better adaptability to P2P network.
Noisy random Boolean formulae: A statistical physics perspective
Mozeika, Alexander; Saad, David; Raymond, Jack
2010-10-01
Properties of computing Boolean circuits composed of noisy logical gates are studied using the statistical physics methodology. A formula-growth model that gives rise to random Boolean functions is mapped onto a spin system, which facilitates the study of their typical behavior in the presence of noise. Bounds on their performance, derived in the information theory literature for specific gates, are straightforwardly retrieved, generalized and identified as the corresponding macroscopic phase transitions. The framework is employed for deriving results on error-rates at various function-depths and function sensitivity, and their dependence on the gate-type and noise model used. These are difficult to obtain via the traditional methods used in this field.
Mapping knowledge to boolean dynamic systems in Bateson's epistemology.
Malloy, Thomas E; Jensen, Gary C; Song, Timothy
2005-01-01
Gregory Bateson (1972, 1979) established an epistemology that integrates mind and nature as a necessary unity, a unity in which learning and evolution share fundamental principles and in which criteria for mental process are explicitly specified. E42 is a suite of freely available Java applets that constitute an online research lab for creating and interacting with simulations of the Boolean systems developed by Kauffman (1993) in his study of evolution where he proposed that self-organization and natural selection are co-principles "weaving the tapestry of life." This paper maps Boolean systems, developed in the study of evolution, onto Bateson's epistemology in general and onto his criteria of mental process in particular.
High Quality Test Pattern Generation and Boolean Satisfiability
Eggersglüß, Stephan
2012-01-01
This book provides an overview of automatic test pattern generation (ATPG) and introduces novel techniques to complement classical ATPG, based on Boolean Satisfiability (SAT). A fast and highly fault efficient SAT-based ATPG framework is presented which is also able to generate high-quality delay tests such as robust path delay tests, as well as tests with long propagation paths to detect small delay defects. The aim of the techniques and methodologies presented in this book is to improve SAT-based ATPG, in order to make it applicable in industrial practice. Readers will learn to improve the performance and robustness of the overall test generation process, so that the ATPG algorithm reliably will generate test patterns for most targeted faults in acceptable run time to meet the high fault coverage demands of industry. The techniques and improvements presented in this book provide the following advantages: Provides a comprehensive introduction to test generation and Boolean Satisfiability (SAT); Describes a...
An adaptive routing scheme in scale-free networks
Ben Haddou, Nora; Ez-Zahraouy, Hamid; Benyoussef, Abdelilah
2015-05-01
We suggest an optimal form of traffic awareness already introduced as a routing protocol which combines structural and local dynamic properties of the network to determine the followed path between source and destination of the packet. Instead of using the shortest path, we incorporate the "efficient path" in the protocol and we propose a new parameter α that controls the contribution of the queue in the routing process. Compared to the original model, the capacity of the network can be improved more than twice when using the optimal conditions of our model. Moreover, the adjustment of the proposed parameter allows the minimization of the travel time.
Directory of Open Access Journals (Sweden)
Susan L. Manring
2005-12-01
Full Text Available Adaptive ecosystem management (AEM requires building and managing an interorganizational network of stakeholders to conserve ecosystem integrity while sustaining ecosystem services. This paper demonstrates the usefulness of applying the concepts of interorganizational networks and learning organizations to AEM. A case study of the lower Roanoke River in North Carolina illustrates how an AEM network can evolve to guide stakeholders in creating a shared framework for generative learning, consensus building through collaboration, and decision making. Environmental professionals can use this framework to guide institutional arrangements and to coordinate the systematic development of cohesive interorganizational AEM networks.
Adaptive Control of Nonlinear Discrete-Time Systems by Using OS-ELM Neural Networks
Directory of Open Access Journals (Sweden)
Xiao-Li Li
2014-01-01
Full Text Available As a kind of novel feedforward neural network with single hidden layer, ELM (extreme learning machine neural networks are studied for the identification and control of nonlinear dynamic systems. The property of simple structure and fast convergence of ELM can be shown clearly. In this paper, we are interested in adaptive control of nonlinear dynamic plants by using OS-ELM (online sequential extreme learning machine neural networks. Based on data scope division, the problem that training process of ELM neural network is sensitive to the initial training data is also solved. According to the output range of the controlled plant, the data corresponding to this range will be used to initialize ELM. Furthermore, due to the drawback of conventional adaptive control, when the OS-ELM neural network is used for adaptive control of the system with jumping parameters, the topological structure of the neural network can be adjusted dynamically by using multiple model switching strategy, and an MMAC (multiple model adaptive control will be used to improve the control performance. Simulation results are included to complement the theoretical results.
Chang, H.-C.; Kopaska-Merkel, D. C.; Chen, H.-C.; Rocky, Durrans S.
2000-01-01
Lithofacies identification supplies qualitative information about rocks. Lithofacies represent rock textures and are important components of hydrocarbon reservoir description. Traditional techniques of lithofacies identification from core data are costly and different geologists may provide different interpretations. In this paper, we present a low-cost intelligent system consisting of three adaptive resonance theory neural networks and a rule-based expert system to consistently and objectively identify lithofacies from well-log data. The input data are altered into different forms representing different perspectives of observation of lithofacies. Each form of input is processed by a different adaptive resonance theory neural network. Among these three adaptive resonance theory neural networks, one neural network processes the raw continuous data, another processes categorial data, and the third processes fuzzy-set data. Outputs from these three networks are then combined by the expert system using fuzzy inference to determine to which facies the input data should be assigned. Rules are prioritized to emphasize the importance of firing order. This new approach combines the learning ability of neural networks, the adaptability of fuzzy logic, and the expertise of geologists to infer facies of the rocks. This approach is applied to the Appleton Field, an oil field located in Escambia County, Alabama. The hybrid intelligence system predicts lithofacies identity from log data with 87.6% accuracy. This prediction is more accurate than those of single adaptive resonance theory networks, 79.3%, 68.0% and 66.0%, using raw, fuzzy-set, and categorical data, respectively, and by an error-backpropagation neural network, 57.3%. (C) 2000 Published by Elsevier Science Ltd. All rights reserved.
Synchronization of general complex networks via adaptive control ...
Indian Academy of Sciences (India)
2014-03-07
Mar 7, 2014 ... 3Artificial Intelligence Key Laboratory of Sichuan Province, Sichuan University of Science &. Engineering, Zigong, Sichuan, 643000, People's Republic of China ...... inputs ui(t) (i = 1, 2, 3) and the values of control inputs are acceptable. From figures 1–5, it is easy to see that the controlled complex network ...
Adaptive, Tactical Mesh Networking: Control Base MANET Model
2010-09-01
pp. 316–320 Available: IEEE Xplore , http://ieeexplore.ieee.org [Accessed: June 9, 2010]. [5] N. Sidiropoulos, “Multiuser Transmit Beamforming...Mobile Mesh Segments of TNT Testbed .......... 11 Figure 5. Infrastructure and Ad Hoc Mode of IEEE 802.11................................ 13 Figure...6. The Power Spectral Density of OFDM................................................ 14 Figure 7. A Typical IEEE 802.16 Network
Pliable Cognitive MAC for Heterogeneous Adaptive Cognitive Radio Sensor Networks.
Al-Medhwahi, Mohammed; Hashim, Fazirulhisyam; Ali, Borhanuddin Mohd; Sali, Aduwati
2016-01-01
The rapid expansion of wireless monitoring and surveillance applications in several domains reinforces the trend of exploiting emerging technologies such as the cognitive radio. However, these technologies have to adjust their working concepts to consider the common characteristics of conventional wireless sensor networks (WSNs). The cognitive radio sensor network (CRSN), still an immature technology, has to deal with new networks that might have different types of data, traffic patterns, or quality of service (QoS) requirements. In this paper, we design and model a new cognitive radio-based medium access control (MAC) algorithm dealing with the heterogeneous nature of the developed networks in terms of either the traffic pattern or the required QoS for the node applications. The proposed algorithm decreases the consumed power on several fronts, provides satisfactory levels of latency and spectrum utilization with efficient scheduling, and manages the radio resources for various traffic conditions. An intensive performance evaluation is conducted to study the impact of key parameters such as the channel idle time length, node density, and the number of available channels. The performance evaluation of the proposed algorithm shows a better performance than the comparable protocols. Moreover, the results manifest that the proposed algorithm is suitable for real time monitoring applications.
Effects of Implementing Adaptable Channelization in Wi-Fi Networks
Directory of Open Access Journals (Sweden)
Abid Hussain
2016-01-01
Full Text Available The unprecedented increase of wireless devices is now facing a serious threat of spectrum scarcity. The situation becomes even worse due to inefficient frequency distribution protocols, deployed in trivial Wi-Fi networks. The primary source of this inefficiency is static channelization used in wireless networks. In this work, we investigate the use of dynamic and flexible channelization, for optimal spectrum utilization in Wi-Fi networks. We propose optimal spectrum sharing algorithm (OSSA and analyze its effect on exhaustive list of essential network performance measuring parameters. The elementary concept of the proposed algorithm lies in the fact that frequency spectrum should be assigned to any access point (AP based on its current requirement. The OSSA algorithm assigns channels with high granularity, thus maximizing spectrum utilization by more than 20% as compared to static width channel allocation. This optimum spectrum utilization, in turn, increases throughput by almost 30% in many deployment scenarios. The achieved results depict considerable decrease in interference, while simultaneously increasing range. Similarly signal strength values at relatively longer distances improve significantly at narrower channel widths while simultaneously decreasing bit error rates. We found that almost 25% reduction in interference is possible in certain scenarios through proposed algorithm.
Adaptive spectrum decision framework for heterogeneous dynamic spectrum access networks
CSIR Research Space (South Africa)
Masonta, M
2015-09-01
Full Text Available Spectrum decision is the ability of a cognitive radio (CR) system to select the best available spectrum band to satisfy dynamic spectrum access network (DSAN) users¿ quality of service (QoS) requirements without causing harmful interference...
MILES FORMULAE FOR BOOLEAN MODELS OBSERVED ON LATTICES
Directory of Open Access Journals (Sweden)
Joachim Ohser
2011-05-01
Full Text Available The densities of the intrinsic volumes – in 3D the volume density, surface density, the density of the integral of the mean curvature and the density of the Euler number – are a very useful collection of geometric characteristics of random sets. Combining integral and digital geometry we develop a method for efficient and simultaneous calculation of the intrinsic volumes of random sets observed in binary images in arbitrary dimensions. We consider isotropic and reflection invariant Boolean models sampled on homogeneous lattices and compute the expectations of the estimators of the intrinsic volumes. It turns out that the estimator for the surface density is proved to be asymptotically unbiased and thusmultigrid convergent for Boolean models with convex grains. The asymptotic bias of the estimators for the densities of the integral of the mean curvature and of the Euler number is assessed for Boolean models of balls of random diameters. Miles formulae with corresponding correction terms are derived for the 3D case.
Creep-induced anisotropy in covalent adaptable network polymers.
Hanzon, Drew W; He, Xu; Yang, Hua; Shi, Qian; Yu, Kai
2017-10-11
Anisotropic polymers with aligned macromolecule chains exhibit directional strengthening of mechanical and physical properties. However, manipulating the orientation of polymer chains in a fully cured thermoset is almost impossible due to its permanently crosslinked nature. In this paper, we demonstrate that rearrangeable networks with bond exchange reactions (BERs) can be utilized to tailor the anisotropic mechanical properties of thermosetting polymers. When a constant force is maintained at BER activated temperatures, the malleable thermoset creeps in the direction of stress, and macromolecule chains align themselves in the same direction. The aligned polymer chains result in an anisotropic network with a stiffer mechanical behavior in the direction of creep, while with a more compliant behavior in the transverse direction. The degree of network anisotropy is proportional to the amount of creep strain. A multi-length scale constitutive model is developed to study the creep-induced anisotropy of thermosetting polymers. The model connects the micro-scale BER kinetics, orientation of polymer chains, and directional mechanical properties of network polymers. Without any fitting parameters, it is able to predict the evolution of creep strain at different temperatures and anisotropic stress-strain behaviors of CANs after creep. Predictions on the chain orientation are verified by molecular dynamics (MD) simulation. Based on parametric studies, it is shown that the influences of creep time and temperature on the network anisotropy can be generalized into a single parameter, and the evolution of directional modulus follows an Arrhenius type time-temperature superposition principle (TTSP). The presented work provides a facile approach to transform isotropic thermosets into anisotropic ones using simple heating, and their directional properties can be readily tailored by the processing conditions.
Canalizing Kauffman Networks: Nonergodicity and Its Effect on Their Critical Behavior
Moreira, André Auto; Nunes Amaral, Luís A.
2005-01-01
Boolean networks have been used to study numerous phenomena, including gene regulation, neural networks, social interactions, and biological evolution. Here, we propose a general method for determining the critical behavior of Boolean systems built from arbitrary ensembles of Boolean functions. In particular, we solve the critical condition for systems of units operating according to canalizing functions and present strong numerical evidence that our approach correctly predicts the phase tran...
Canalizing Kauffman networks: non-ergodicity and its effect on their critical behavior
Moreira, Andre A.; Amaral, Luis A. N.
2005-01-01
Boolean Networks have been used to study numerous phenomena, including gene regulation, neural networks, social interactions, and biological evolution. Here, we propose a general method for determining the critical behavior of Boolean systems built from arbitrary ensembles of Boolean functions. In particular, we solve the critical condition for systems of units operating according to canalizing functions and present strong numerical evidence that our approach correctly predicts the phase tran...
Evolving artificial neural networks for cross-adaptive audio effects
Jordal, Iver
2017-01-01
Cross-adaptive audio effects have many applications within music technology, including for automatic mixing and live music. Commonly used methods of signal analysis capture the acoustical and mathematical features of the signal well, but struggle to capture the musical meaning. Together with the vast number of possible signal interactions, this makes manual exploration of signal interactions difficult and tedious. This project investigates Artificial Intelligence (AI) methods for finding usef...
Adaptive learning in tracking control based on the dual critic network design.
Ni, Zhen; He, Haibo; Wen, Jinyu
2013-06-01
In this paper, we present a new adaptive dynamic programming approach by integrating a reference network that provides an internal goal representation to help the systems learning and optimization. Specifically, we build the reference network on top of the critic network to form a dual critic network design that contains the detailed internal goal representation to help approximate the value function. This internal goal signal, working as the reinforcement signal for the critic network in our design, is adaptively generated by the reference network and can also be adjusted automatically. In this way, we provide an alternative choice rather than crafting the reinforcement signal manually from prior knowledge. In this paper, we adopt the online action-dependent heuristic dynamic programming (ADHDP) design and provide the detailed design of the dual critic network structure. Detailed Lyapunov stability analysis for our proposed approach is presented to support the proposed structure from a theoretical point of view. Furthermore, we also develop a virtual reality platform to demonstrate the real-time simulation of our approach under different disturbance situations. The overall adaptive learning performance has been tested on two tracking control benchmarks with a tracking filter. For comparative studies, we also present the tracking performance with the typical ADHDP, and the simulation results justify the improved performance with our approach.
Dur-e-Ahmad, Muhammad; Nicola, Wilten; Campbell, Sue Ann; Skinner, Frances K
2012-08-01
The hippocampus is a brain structure critical for memory functioning. Its network dynamics include several patterns such as sharp waves that are generated in the CA3 region. To understand how population outputs are generated, models need to consider aspects of network size, cellular and synaptic characteristics and context, which are necessarily 'balanced' in appropriate ways to produce particular outputs. Thick slice hippocampal preparations spontaneously produce sharp waves that are initiated in CA3 regions and depend on the right balance of glutamatergic activities. As a step toward developing network models that can explain important balances in the generation of hippocampal output, we develop models of CA3 pyramidal cells. Our models are single compartment in nature, use an Izhikevich-type structure and involve parameter values that are specifically designed to encompass CA3 intrinsic properties. Importantly, they incorporate spike frequency adaptation characteristics that are directly comparable to those measured experimentally. Excitatory networks using these model cells are able to produce bursting suggesting that the amount of spike frequency adaptation expressed in the biological cells is an essential contributor to network bursting, and as such, may be important for sharp wave generation. The network bursting mechanism is numerically dissected showing the critical balance between adaptation and excitatory drive. The compact nature of our models allows large network simulations to be efficiently computed. This, together with the linkage of our models to cellular characteristics, will allow us to develop an understanding of population output of CA3 hippocampus with direct biological comparisons.
Zeng, Yuanyuan; Sreenan, Cormac J.; Sitanayah, Lanny; Xiong, Naixue; Park, Jong Hyuk; Zheng, Guilin
2011-01-01
Fire hazard monitoring and evacuation for building environments is a novel application area for the deployment of wireless sensor networks. In this context, adaptive routing is essential in order to ensure safe and timely data delivery in building evacuation and fire fighting resource applications. Existing routing mechanisms for wireless sensor networks are not well suited for building fires, especially as they do not consider critical and dynamic network scenarios. In this paper, an emergency-adaptive, real-time and robust routing protocol is presented for emergency situations such as building fire hazard applications. The protocol adapts to handle dynamic emergency scenarios and works well with the routing hole problem. Theoretical analysis and simulation results indicate that our protocol provides a real-time routing mechanism that is well suited for dynamic emergency scenarios in building fires when compared with other related work. PMID:22163774
Zeng, Yuanyuan; Sreenan, Cormac J; Sitanayah, Lanny; Xiong, Naixue; Park, Jong Hyuk; Zheng, Guilin
2011-01-01
Fire hazard monitoring and evacuation for building environments is a novel application area for the deployment of wireless sensor networks. In this context, adaptive routing is essential in order to ensure safe and timely data delivery in building evacuation and fire fighting resource applications. Existing routing mechanisms for wireless sensor networks are not well suited for building fires, especially as they do not consider critical and dynamic network scenarios. In this paper, an emergency-adaptive, real-time and robust routing protocol is presented for emergency situations such as building fire hazard applications. The protocol adapts to handle dynamic emergency scenarios and works well with the routing hole problem. Theoretical analysis and simulation results indicate that our protocol provides a real-time routing mechanism that is well suited for dynamic emergency scenarios in building fires when compared with other related work.
Directory of Open Access Journals (Sweden)
Yuanyuan Zeng
2010-06-01
Full Text Available Fire hazard monitoring and evacuation for building environments is a novel application area for the deployment of wireless sensor networks. In this context, adaptive routing is essential in order to ensure safe and timely data delivery in building evacuation and fire fighting resource applications. Existing routing mechanisms for wireless sensor networks are not well suited for building fires, especially as they do not consider critical and dynamic network scenarios. In this paper, an emergency-adaptive, real-time and robust routing protocol is presented for emergency situations such as building fire hazard applications. The protocol adapts to handle dynamic emergency scenarios and works well with the routing hole problem. Theoretical analysis and simulation results indicate that our protocol provides a real-time routing mechanism that is well suited for dynamic emergency scenarios in building fires when compared with other related work.
Directory of Open Access Journals (Sweden)
Guilin Zheng
2011-03-01
Full Text Available Fire hazard monitoring and evacuation for building environments is a novel application area for the deployment of wireless sensor networks. In this context, adaptive routing is essential in order to ensure safe and timely data delivery in building evacuation and fire fighting resource applications. Existing routing mechanisms for wireless sensor networks are not well suited for building fires, especially as they do not consider critical and dynamic network scenarios. In this paper, an emergency-adaptive, real-time and robust routing protocol is presented for emergency situations such as building fire hazard applications. The protocol adapts to handle dynamic emergency scenarios and works well with the routing hole problem. Theoretical analysis and simulation results indicate that our protocol provides a real-time routing mechanism that is well suited for dynamic emergency scenarios in building fires when compared with other related work.
Adaptive Global Sliding Mode Control for MEMS Gyroscope Using RBF Neural Network
Directory of Open Access Journals (Sweden)
Yundi Chu
2015-01-01
Full Text Available An adaptive global sliding mode control (AGSMC using RBF neural network (RBFNN is proposed for the system identification and tracking control of micro-electro-mechanical system (MEMS gyroscope. Firstly, a new kind of adaptive identification method based on the global sliding mode controller is designed to update and estimate angular velocity and other system parameters of MEMS gyroscope online. Moreover, the output of adaptive neural network control is used to adjust the switch gain of sliding mode control dynamically to approach the upper bound of unknown disturbances. In this way, the switch item of sliding mode control can be converted to the output of continuous neural network which can weaken the chattering in the sliding mode control in contrast to the conventional fixed gain sliding mode control. Simulation results show that the designed control system can get satisfactory tracking performance and effective estimation of unknown parameters of MEMS gyroscope.
Profile-based adaptive anomaly detection for network security.
Energy Technology Data Exchange (ETDEWEB)
Zhang, Pengchu C. (Sandia National Laboratories, Albuquerque, NM); Durgin, Nancy Ann
2005-11-01
As information systems become increasingly complex and pervasive, they become inextricably intertwined with the critical infrastructure of national, public, and private organizations. The problem of recognizing and evaluating threats against these complex, heterogeneous networks of cyber and physical components is a difficult one, yet a solution is vital to ensuring security. In this paper we investigate profile-based anomaly detection techniques that can be used to address this problem. We focus primarily on the area of network anomaly detection, but the approach could be extended to other problem domains. We investigate using several data analysis techniques to create profiles of network hosts and perform anomaly detection using those profiles. The ''profiles'' reduce multi-dimensional vectors representing ''normal behavior'' into fewer dimensions, thus allowing pattern and cluster discovery. New events are compared against the profiles, producing a quantitative measure of how ''anomalous'' the event is. Most network intrusion detection systems (IDSs) detect malicious behavior by searching for known patterns in the network traffic. This approach suffers from several weaknesses, including a lack of generalizability, an inability to detect stealthy or novel attacks, and lack of flexibility regarding alarm thresholds. Our research focuses on enhancing current IDS capabilities by addressing some of these shortcomings. We identify and evaluate promising techniques for data mining and machine-learning. The algorithms are ''trained'' by providing them with a series of data-points from ''normal'' network traffic. A successful algorithm can be trained automatically and efficiently, will have a low error rate (low false alarm and miss rates), and will be able to identify anomalies in ''pseudo real-time'' (i.e., while the intrusion is still in progress
Zou, An-Min; Dev Kumar, Krishna; Hou, Zeng-Guang
2010-09-01
This paper investigates the problem of output feedback attitude control of an uncertain spacecraft. Two robust adaptive output feedback controllers based on Chebyshev neural networks (CNN) termed adaptive neural networks (NN) controller-I and adaptive NN controller-II are proposed for the attitude tracking control of spacecraft. The four-parameter representations (quaternion) are employed to describe the spacecraft attitude for global representation without singularities. The nonlinear reduced-order observer is used to estimate the derivative of the spacecraft output, and the CNN is introduced to further improve the control performance through approximating the spacecraft attitude motion. The implementation of the basis functions of the CNN used in the proposed controllers depends only on the desired signals, and the smooth robust compensator using the hyperbolic tangent function is employed to counteract the CNN approximation errors and external disturbances. The adaptive NN controller-II can efficiently avoid the over-estimation problem (i.e., the bound of the CNNs output is much larger than that of the approximated unknown function, and hence, the control input may be very large) existing in the adaptive NN controller-I. Both adaptive output feedback controllers using CNN can guarantee that all signals in the resulting closed-loop system are uniformly ultimately bounded. For performance comparisons, the standard adaptive controller using the linear parameterization of spacecraft attitude motion is also developed. Simulation studies are presented to show the advantages of the proposed CNN-based output feedback approach over the standard adaptive output feedback approach.
Neural network L1 adaptive control of MIMO systems with nonlinear uncertainty.
Zhen, Hong-tao; Qi, Xiao-hui; Li, Jie; Tian, Qing-min
2014-01-01
An indirect adaptive controller is developed for a class of multiple-input multiple-output (MIMO) nonlinear systems with unknown uncertainties. This control system is comprised of an L 1 adaptive controller and an auxiliary neural network (NN) compensation controller. The L 1 adaptive controller has guaranteed transient response in addition to stable tracking. In this architecture, a low-pass filter is adopted to guarantee fast adaptive rate without generating high-frequency oscillations in control signals. The auxiliary compensation controller is designed to approximate the unknown nonlinear functions by MIMO RBF neural networks to suppress the influence of uncertainties. NN weights are tuned on-line with no prior training and the project operator ensures the weights bounded. The global stability of the closed-system is derived based on the Lyapunov function. Numerical simulations of an MIMO system coupled with nonlinear uncertainties are used to illustrate the practical potential of our theoretical results.
Strong Attractors in Stochastic Adaptive Networks: Emergence and Characterization
Santos, Augusto Almeida; Krishnan, Ramayya; Moura, José M F
2016-01-01
We propose a family of models to study the evolution of ties in a network of interacting agents by reinforcement and penalization of their connections according to certain local laws of interaction. The family of stochastic dynamical systems, on the edges of a graph, exhibits \\emph{good} convergence properties, in particular, we prove a strong-stability result: a subset of binary matrices or graphs -- characterized by certain compatibility properties -- is a global almost sure attractor of the family of stochastic dynamical systems. To illustrate finer properties of the corresponding strong attractor, we present some simulation results that capture, e.g., the conspicuous phenomenon of emergence and downfall of leaders in social networks.
Scalable and Media Aware Adaptive Video Streaming over Wireless Networks
Tizon, Nicolas; Pesquet-Popescu, Béatrice
2008-12-01
This paper proposes an advanced video streaming system based on scalable video coding in order to optimize resource utilization in wireless networks with retransmission mechanisms at radio protocol level. The key component of this system is a packet scheduling algorithm which operates on the different substreams of a main scalable video stream and which is implemented in a so-called media aware network element. The concerned type of transport channel is a dedicated channel subject to parameters (bitrate, loss rate) variations on the long run. Moreover, we propose a combined scalability approach in which common temporal and SNR scalability features can be used jointly with a partitioning of the image into regions of interest. Simulation results show that our approach provides substantial quality gain compared to classical packet transmission methods and they demonstrate how ROI coding combined with SNR scalability allows to improve again the visual quality.
Photo Aesthetics Ranking Network with Attributes and Content Adaptation
Kong, Shu; Shen, Xiaohui; Lin, Zhe; Mech, Radomir; Fowlkes, Charless
2016-01-01
Real-world applications could benefit from the ability to automatically generate a fine-grained ranking of photo aesthetics. However, previous methods for image aesthetics analysis have primarily focused on the coarse, binary categorization of images into high- or low-aesthetic categories. In this work, we propose to learn a deep convolutional neural network to rank photo aesthetics in which the relative ranking of photo aesthetics are directly modeled in the loss function. Our model incorpor...
A QoS-Driven Self-Adaptive Architecture For Wireless Sensor Networks
Jemal, Ahmed; Ben Halima, Riadh
2013-01-01
6 pages; International audience; Recently, Wireless Sensor Networks (WSN) have become increasingly used to perform distributed sensing and convey useful information. These kinds of environments are complex, heterogeneous and often affected by unpredictable behavior and poor management. This fostered considerable research on designs and techniques that enhance these systems with an adaptation behavior. In this paper, we focus on the self-adaptation branch of the research and give an overview o...
Directory of Open Access Journals (Sweden)
Bo Liu
2013-01-01
Full Text Available This paper investigates the adaptive synchronization of complex dynamical networks satisfying the local Lipschitz condition with switching topology. Based on differential inclusion and nonsmooth analysis, it is proved that all nodes can converge to the synchronous state, even though only one node is informed by the synchronous state via introducing decentralized adaptive strategies to the coupling strengths and feedback gains. Finally, some numerical simulations are worked out to illustrate the analytical results.
Jarman, Nicholas; Trengove, Chris; Steur, Erik; Tyukin, Ivan; van Leeuwen, Cees
2014-12-01
A modular small-world topology in functional and anatomical networks of the cortex is eminently suitable as an information processing architecture. This structure was shown in model studies to arise adaptively; it emerges through rewiring of network connections according to patterns of synchrony in ongoing oscillatory neural activity. However, in order to improve the applicability of such models to the cortex, spatial characteristics of cortical connectivity need to be respected, which were previously neglected. For this purpose we consider networks endowed with a metric by embedding them into a physical space. We provide an adaptive rewiring model with a spatial distance function and a corresponding spatially local rewiring bias. The spatially constrained adaptive rewiring principle is able to steer the evolving network topology to small world status, even more consistently so than without spatial constraints. Locally biased adaptive rewiring results in a spatial layout of the connectivity structure, in which topologically segregated modules correspond to spatially segregated regions, and these regions are linked by long-range connections. The principle of locally biased adaptive rewiring, thus, may explain both the topological connectivity structure and spatial distribution of connections between neuronal units in a large-scale cortical architecture.
Robustness of non-interdependent and interdependent networks against dependent and adaptive attacks
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.
Schleussner, Carl-Friedrich; Engemann, Denis A; Levermann, Anders
2015-01-01
Human behaviour is largely shaped by local social interactions and depends on the structure of connections between individuals in social networks. These two dimensions of behaviour selection are commonly studied in isolation by different disciplines and are often treated as independent processes. To the contrary, empirical findings on spread of behaviour in social networks suggest that local interactions between individuals and network evolution are interdependent. Empirical evidence, however, remains inconclusive as social network studies often suffer from limited sample sizes or are prohibitive on ethical grounds. Here we introduce a co-evolutionary adaptive network model of social behaviour selection that provides insights into generative mechanisms by resolving both these aspects through computer simulations. We considered four complementary models and evaluated them with regard to emulating empirical behaviour dynamics in social networks. For this purpose we modelled the prevalence of smoking and and the...
Adaptive Synchronization for a Class of Uncertain Fractional-Order Neural Networks
Directory of Open Access Journals (Sweden)
Heng Liu
2015-10-01
Full Text Available In this paper, synchronization for a class of uncertain fractional-order neural networks subject to external disturbances and disturbed system parameters is studied. Based on the fractional-order extension of the Lyapunov stability criterion, an adaptive synchronization controller is designed, and fractional-order adaptation law is proposed to update the controller parameter online. The proposed controller can guarantee that the synchronization errors between two uncertain fractional-order neural networks converge to zero asymptotically. By using some proposed lemmas, the quadratic Lyapunov functions are employed in the stability analysis. Finally, numerical simulations are presented to confirm the effectiveness of the proposed method.
Energy Technology Data Exchange (ETDEWEB)
Xu Yuhua, E-mail: yuhuaxu2004@163.co [College of Information Science and Technology, Donghua University, Shanghai 201620 (China) and Department of Maths, Yunyang Teachers' College, Hubei 442000 (China); Zhou Wuneng, E-mail: wnzhou@163.co [College of Information Science and Technology, Donghua University, Shanghai 201620 (China); Fang Jian' an [College of Information Science and Technology, Donghua University, Shanghai 201620 (China); Sun Wen [School of Mathematics and Information, Yangtze University, Hubei Jingzhou 434023 (China)
2010-04-05
This Letter investigates the synchronization of a general complex dynamical network with non-derivative and derivative coupling. Based on LaSalle's invariance principle, adaptive synchronization criteria are obtained. Analytical result shows that under the designed adaptive controllers, a general complex dynamical network with non-derivative and derivative coupling can asymptotically synchronize to a given trajectory, and several useful criteria for synchronization are given. What is more, the coupling matrix is not assumed to be symmetric or irreducible. Finally, simulations results show the method is effective.
Papadopoulos, Lia; Kim, Jason Z.; Kurths, Jürgen; Bassett, Danielle S.
2017-07-01
Synchronization of non-identical oscillators coupled through complex networks is an important example of collective behavior, and it is interesting to ask how the structural organization of network interactions influences this process. Several studies have explored and uncovered optimal topologies for synchronization by making purposeful alterations to a network. On the other hand, the connectivity patterns of many natural systems are often not static, but are rather modulated over time according to their dynamics. However, this co-evolution and the extent to which the dynamics of the individual units can shape the organization of the network itself are less well understood. Here, we study initially randomly connected but locally adaptive networks of Kuramoto oscillators. In particular, the system employs a co-evolutionary rewiring strategy that depends only on the instantaneous, pairwise phase differences of neighboring oscillators, and that conserves the total number of edges, allowing the effects of local reorganization to be isolated. We find that a simple rule—which preserves connections between more out-of-phase oscillators while rewiring connections between more in-phase oscillators—can cause initially disordered networks to organize into more structured topologies that support enhanced synchronization dynamics. We examine how this process unfolds over time, finding a dependence on the intrinsic frequencies of the oscillators, the global coupling, and the network density, in terms of how the adaptive mechanism reorganizes the network and influences the dynamics. Importantly, for large enough coupling and after sufficient adaptation, the resulting networks exhibit interesting characteristics, including degree-frequency and frequency-neighbor frequency correlations. These properties have previously been associated with optimal synchronization or explosive transitions in which the networks were constructed using global information. On the contrary, by
The Adaptive Neural Network Control of Quadrotor Helicopter
Directory of Open Access Journals (Sweden)
A. S. Yushenko
2017-01-01
Full Text Available The current steady-rising interest in using the unmanned multi-rotor aerial vehicles (UMAV designed to solve a wide range of tasks is, mainly, due to their simple design and high weight-carrying capacity as compared to classical helicopter options. Unfortunately, to solve a problem of multi-copter control is complicated because of essential nonlinearity and environmental perturbations. The most widely spread PID controllers and linear-quadratic regulators do not quite well cope with this task. The need arises for the prompt adjustment of PID controller coefficients in the course of operation or their complete re-tuning in cases of changing parameters of the control object.One of the control methods under changing conditions is the use of the sliding mode. This technology enables us to reach the stabilization and proper operation of the controlled system even under accidental external exposures and when there is a lack of the reasonably accurate mathematical model of the control object. The sliding principle is to ensure the system motion in the immediate vicinity of the sliding surface in the phase space. On the other hand, the sliding mode has some essential disadvantages. The most significant one is the high-frequency jitter of the system near the sliding surface. The sliding mode also implies the complete knowledge of the system dynamics. Various methods have been proposed to eliminate these drawbacks. For example, A.G. Aissaoui’s, H. Abid’s and M. Abid’s paper describes the application of fuzzy logic to control a drive and in Lon-Chen Hung’s and Hung-Yuan Chung’s paper an artificial neural network is used for the manipulator control.This paper presents a method of the quad-copter control with the aid of a neural network controller. This method enables us to control the system without a priori information on parameters of the dynamic model of the controlled object. The main neural network is a MIMO (“Multiple Input Multiple
Adaptive Suspicious Prevention for Defending DoS Attacks in SDN-Based Convergent Networks.
Dao, Nhu-Ngoc; Kim, Joongheon; Park, Minho; Cho, Sungrae
2016-01-01
The convergent communication network will play an important role as a single platform to unify heterogeneous networks and integrate emerging technologies and existing legacy networks. Although there have been proposed many feasible solutions, they could not become convergent frameworks since they mainly focused on converting functions between various protocols and interfaces in edge networks, and handling functions for multiple services in core networks, e.g., the Multi-protocol Label Switching (MPLS) technique. Software-defined networking (SDN), on the other hand, is expected to be the ideal future for the convergent network since it can provide a controllable, dynamic, and cost-effective network. However, SDN has an original structural vulnerability behind a lot of advantages, which is the centralized control plane. As the brains of the network, a controller manages the whole network, which is attractive to attackers. In this context, we proposes a novel solution called adaptive suspicious prevention (ASP) mechanism to protect the controller from the Denial of Service (DoS) attacks that could incapacitate an SDN. The ASP is integrated with OpenFlow protocol to detect and prevent DoS attacks effectively. Our comprehensive experimental results show that the ASP enhances the resilience of an SDN network against DoS attacks by up to 38%.
Adaptive Suspicious Prevention for Defending DoS Attacks in SDN-Based Convergent Networks.
Directory of Open Access Journals (Sweden)
Nhu-Ngoc Dao
Full Text Available The convergent communication network will play an important role as a single platform to unify heterogeneous networks and integrate emerging technologies and existing legacy networks. Although there have been proposed many feasible solutions, they could not become convergent frameworks since they mainly focused on converting functions between various protocols and interfaces in edge networks, and handling functions for multiple services in core networks, e.g., the Multi-protocol Label Switching (MPLS technique. Software-defined networking (SDN, on the other hand, is expected to be the ideal future for the convergent network since it can provide a controllable, dynamic, and cost-effective network. However, SDN has an original structural vulnerability behind a lot of advantages, which is the centralized control plane. As the brains of the network, a controller manages the whole network, which is attractive to attackers. In this context, we proposes a novel solution called adaptive suspicious prevention (ASP mechanism to protect the controller from the Denial of Service (DoS attacks that could incapacitate an SDN. The ASP is integrated with OpenFlow protocol to detect and prevent DoS attacks effectively. Our comprehensive experimental results show that the ASP enhances the resilience of an SDN network against DoS attacks by up to 38%.
Selective adaptation in networks of heterogeneous populations: model, simulation, and experiment.
Directory of Open Access Journals (Sweden)
Avner Wallach
2008-02-01
Full Text Available Biological systems often change their responsiveness when subject to persistent stimulation, a phenomenon termed adaptation. In neural systems, this process is often selective, allowing the system to adapt to one stimulus while preserving its sensitivity to another. In some studies, it has been shown that adaptation to a frequent stimulus increases the system's sensitivity to rare stimuli. These phenomena were explained in previous work as a result of complex interactions between the various subpopulations of the network. A formal description and analysis of neuronal systems, however, is hindered by the network's heterogeneity and by the multitude of processes taking place at different time-scales. Viewing neural networks as populations of interacting elements, we develop a framework that facilitates a formal analysis of complex, structured, heterogeneous networks. The formulation developed is based on an analysis of the availability of activity dependent resources, and their effects on network responsiveness. This approach offers a simple mechanistic explanation for selective adaptation, and leads to several predictions that were corroborated in both computer simulations and in cultures of cortical neurons developing in vitro. The framework is sufficiently general to apply to different biological systems, and was demonstrated in two different cases.
Adaptive Neural Network Sliding Mode Control for Quad Tilt Rotor Aircraft
Directory of Open Access Journals (Sweden)
Yanchao Yin
2017-01-01
Full Text Available A novel neural network sliding mode control based on multicommunity bidirectional drive collaborative search algorithm (M-CBDCS is proposed to design a flight controller for performing the attitude tracking control of a quad tilt rotors aircraft (QTRA. Firstly, the attitude dynamic model of the QTRA concerning propeller tension, channel arm, and moment of inertia is formulated, and the equivalent sliding mode control law is stated. Secondly, an adaptive control algorithm is presented to eliminate the approximation error, where a radial basis function (RBF neural network is used to online regulate the equivalent sliding mode control law, and the novel M-CBDCS algorithm is developed to uniformly update the unknown neural network weights and essential model parameters adaptively. The nonlinear approximation error is obtained and serves as a novel leakage term in the adaptations to guarantee the sliding surface convergence and eliminate the chattering phenomenon, which benefit the overall attitude control performance for QTRA. Finally, the appropriate comparisons among the novel adaptive neural network sliding mode control, the classical neural network sliding mode control, and the dynamic inverse PID control are examined, and comparative simulations are included to verify the efficacy of the proposed control method.
Adaptive Information Access in Multiple Applications Support Wireless Sensor Network
DEFF Research Database (Denmark)
Tobgay, Sonam; Olsen, Rasmus Løvenstein; Prasad, Ramjee
2012-01-01
set of requirements. Lastly, the paper suggests a mechanism by which the information access or acquisition can be adapted as per the requirements of the application. The main parameters focused in this paper are mismatch probability [1] and power dissipation with respect to sampling rate....... specific WSN considering its resource constraints, neglecting the return-of-investment and usefulness of the system. In this paper, we bring out the WSN scenario which supports multiple applications and study the challenges that would pose in implementation as each specific application has its own specific...
Using Social Network Analysis to Evaluate Health-Related Adaptation Decision-Making in Cambodia
Directory of Open Access Journals (Sweden)
Kathryn J. Bowen
2014-01-01
Full Text Available Climate change adaptation in the health sector requires decisions across sectors, levels of government, and organisations. The networks that link these different institutions, and the relationships among people within these networks, are therefore critical influences on the nature of adaptive responses to climate change in the health sector. This study uses social network research to identify key organisational players engaged in developing health-related adaptation activities in Cambodia. It finds that strong partnerships are reported as developing across sectors and different types of organisations in relation to the health risks from climate change. Government ministries are influential organisations, whereas donors, development banks and non-government organisations do not appear to be as influential in the development of adaptation policy in the health sector. Finally, the study highlights the importance of informal partnerships (or ‘shadow networks’ in the context of climate change adaptation policy and activities. The health governance ‘map’ in relation to health and climate change adaptation that is developed in this paper is a novel way of identifying organisations that are perceived as key agents in the decision-making process, and it holds substantial benefits for both understanding and intervening in a broad range of climate change-related policy problems where collaboration is paramount for successful outcomes.
Multidimensional adaptive evolution of a feed-forward network and the illusion of compensation
Bullaughey, Kevin
2016-01-01
When multiple substitutions affect a trait in opposing ways, they are often assumed to be compensatory, not only with respect to the trait, but also with respect to fitness. This type of compensatory evolution has been suggested to underlie the evolution of protein structures and interactions, RNA secondary structures, and gene regulatory modules and networks. The possibility for compensatory evolution results from epistasis. Yet if epistasis is widespread, then it is also possible that the opposing substitutions are individually adaptive. I term this possibility an adaptive reversal. Although possible for arbitrary phenotype-fitness mappings, it has not yet been investigated whether such epistasis is prevalent in a biologically-realistic setting. I investigate a particular regulatory circuit, the type I coherent feed-forward loop, which is ubiquitous in natural systems and is accurately described by a simple mathematical model. I show that such reversals are common during adaptive evolution, can result solely from the topology of the fitness landscape, and can occur even when adaptation follows a modest environmental change and the network was well adapted to the original environment. The possibility of adaptive reversals warrants a systems perspective when interpreting substitution patterns in gene regulatory networks. PMID:23289561
Using Social Network Analysis to Evaluate Health-Related Adaptation Decision-Making in Cambodia
Bowen, Kathryn J.; Alexander, Damon; Miller, Fiona; Dany, Va
2014-01-01
Climate change adaptation in the health sector requires decisions across sectors, levels of government, and organisations. The networks that link these different institutions, and the relationships among people within these networks, are therefore critical influences on the nature of adaptive responses to climate change in the health sector. This study uses social network research to identify key organisational players engaged in developing health-related adaptation activities in Cambodia. It finds that strong partnerships are reported as developing across sectors and different types of organisations in relation to the health risks from climate change. Government ministries are influential organisations, whereas donors, development banks and non-government organisations do not appear to be as influential in the development of adaptation policy in the health sector. Finally, the study highlights the importance of informal partnerships (or ‘shadow networks’) in the context of climate change adaptation policy and activities. The health governance ‘map’ in relation to health and climate change adaptation that is developed in this paper is a novel way of identifying organisations that are perceived as key agents in the decision-making process, and it holds substantial benefits for both understanding and intervening in a broad range of climate change-related policy problems where collaboration is paramount for successful outcomes. PMID:24487452
An Adaptive Recurrent Neural Network for Remaining Useful Life Prediction of Lithium-ion Batteries
2010-10-01
application for RUL prediction. We compare its performance with the classical recurrent neural network (RNN) and the recurrent neural fuzzy system ...Jang (1993). ANFIS: adaptive-network-based fuzzy inference system , IEEE Transactions on Systems , Man, and Cybernetics-Part B: Cybernetics, vol. 23...pp. 665-685, 1993. J. Jang, C. T. Sun, and E. Mizutani (1997). Neuro - Fuzzy and Soft Computing: A computational approach to learning and machine
An adaptive distributed admission approach in Bluetooth network with QoS provisions
DEFF Research Database (Denmark)
Son, L.T.; Schiøler, Henrik; Madsen, Ole Brun
2002-01-01
In this paper, a method of adaptive distributed admission with end-to-end Quality of Service (QoS) provisions for real time and non real time tra°cs in Blue-tooth networks is highlighted, its mathematic background is analyzed and a simulation with bursty tra°c sources, Interrupted Bernoulli Process...... (IBP), is carried out. The simulation results show that the performance of Bluetooth network is improved when applying the distributed admission method...
Implementation Issues of Adaptive Energy Detection in Heterogeneous Wireless Networks.
Sobron, Iker; Eizmendi, Iñaki; Martins, Wallace A; Diniz, Paulo S R; Ordiales, Juan Luis; Velez, Manuel
2017-04-23
Spectrum sensing (SS) enables the coexistence of non-coordinated heterogeneous wireless systems operating in the same band. Due to its computational simplicity, energy detection (ED) technique has been widespread employed in SS applications; nonetheless, the conventional ED may be unreliable under environmental impairments, justifying the use of ED-based variants. Assessing ED algorithms from theoretical and simulation viewpoints relies on several assumptions and simplifications which, eventually, lead to conclusions that do not necessarily meet the requirements imposed by real propagation environments. This work addresses those problems by dealing with practical implementation issues of adaptive least mean square (LMS)-based ED algorithms. The paper proposes a new adaptive ED algorithm that uses a variable step-size guaranteeing the LMS convergence in time-varying environments. Several implementation guidelines are provided and, additionally, an empirical assessment and validation with a software defined radio-based hardware is carried out. Experimental results show good performance in terms of probabilities of detection ( P d > 0 . 9 ) and false alarm ( P f ∼ 0 . 05 ) in a range of low signal-to-noise ratios around [ - 4 , 1 ] dB, in both single-node and cooperative modes. The proposed sensing methodology enables a seamless monitoring of the radio electromagnetic spectrum in order to provide band occupancy information for an efficient usage among several wireless communications systems.
Implementation Issues of Adaptive Energy Detection in Heterogeneous Wireless Networks
Directory of Open Access Journals (Sweden)
Iker Sobron
2017-04-01
Full Text Available Spectrum sensing (SS enables the coexistence of non-coordinated heterogeneous wireless systems operating in the same band. Due to its computational simplicity, energy detection (ED technique has been widespread employed in SS applications; nonetheless, the conventional ED may be unreliable under environmental impairments, justifying the use of ED-based variants. Assessing ED algorithms from theoretical and simulation viewpoints relies on several assumptions and simplifications which, eventually, lead to conclusions that do not necessarily meet the requirements imposed by real propagation environments. This work addresses those problems by dealing with practical implementation issues of adaptive least mean square (LMS-based ED algorithms. The paper proposes a new adaptive ED algorithm that uses a variable step-size guaranteeing the LMS convergence in time-varying environments. Several implementation guidelines are provided and, additionally, an empirical assessment and validation with a software defined radio-based hardware is carried out. Experimental results show good performance in terms of probabilities of detection ( P d > 0 . 9 and false alarm ( P f ∼ 0 . 05 in a range of low signal-to-noise ratios around [ - 4 , 1 ] dB, in both single-node and cooperative modes. The proposed sensing methodology enables a seamless monitoring of the radio electromagnetic spectrum in order to provide band occupancy information for an efficient usage among several wireless communications systems.
A simple mechanical system for studying adaptive oscillatory neural networks
DEFF Research Database (Denmark)
Jouffroy, Guillaume; Jouffroy, Jerome
model, etc.) might be too complex to study. In this paper, we use a comparatively simple mechanical system, the nonholonomic vehicle referred to as the Roller-Racer, as a means towards testing different learning strategies for an Recurrent Neural Network-based (RNN) controller/guidance system. After...... a brief description of the Roller-Racer, we present as a preliminary study an RNN-based feed-forward controller whose parameters are obtained through the well-known teacher forcing learning algorithm, extended to learn signals with a continuous component....
The mathematics of a quantum Hamiltonian computing half adder Boolean logic gate.
Dridi, G; Julien, R; Hliwa, M; Joachim, C
2015-08-28
The mathematics behind the quantum Hamiltonian computing (QHC) approach of designing Boolean logic gates with a quantum system are given. Using the quantum eigenvalue repulsion effect, the QHC AND, NAND, OR, NOR, XOR, and NXOR Hamiltonian Boolean matrices are constructed. This is applied to the construction of a QHC half adder Hamiltonian matrix requiring only six quantum states to fullfil a half Boolean logical truth table. The QHC design rules open a nano-architectronic way of constructing Boolean logic gates inside a single molecule or atom by atom at the surface of a passivated semi-conductor.
Spatio-Temporally Adaptive Waiting Time for Cell Phone Sensor Networks
Deepthi Chander; Bhushan Jagyasi; Desai, U. B.; Merchant, S N
2011-01-01
In cell phone sensor networks (CpSN), sensor-embedded cell phones communicate sensor data using Near Field Communication outlets such as Wi-Fi or Bluetooth. This paper considers a query dissemination application of CpSN, where sensor data belonging to a certain time window [ts,min, ts,max] is needed from a region of interest. Existing approaches, such as ADAPT, use adaptive broadcast ranges at the Wireless Access Point (WAP) for query dissemination. This paper proposes the adaptation of waiti...
An adaptive neural swarm approach for intrusion defense in ad hoc networks
Cannady, James
2011-06-01
Wireless sensor networks (WSN) and mobile ad hoc networks (MANET) are being increasingly deployed in critical applications due to the flexibility and extensibility of the technology. While these networks possess numerous advantages over traditional wireless systems in dynamic environments they are still vulnerable to many of the same types of host-based and distributed attacks common to those systems. Unfortunately, the limited power and bandwidth available in WSNs and MANETs, combined with the dynamic connectivity that is a defining characteristic of the technology, makes it extremely difficult to utilize traditional intrusion detection techniques. This paper describes an approach to accurately and efficiently detect potentially damaging activity in WSNs and MANETs. It enables the network as a whole to recognize attacks, anomalies, and potential vulnerabilities in a distributive manner that reflects the autonomic processes of biological systems. Each component of the network recognizes activity in its local environment and then contributes to the overall situational awareness of the entire system. The approach utilizes agent-based swarm intelligence to adaptively identify potential data sources on each node and on adjacent nodes throughout the network. The swarm agents then self-organize into modular neural networks that utilize a reinforcement learning algorithm to identify relevant behavior patterns in the data without supervision. Once the modular neural networks have established interconnectivity both locally and with neighboring nodes the analysis of events within the network can be conducted collectively in real-time. The approach has been shown to be extremely effective in identifying distributed network attacks.
Molecular networks of human muscle adaptation to exercise and age.
Directory of Open Access Journals (Sweden)
Bethan E Phillips
2013-03-01
Full Text Available Physical activity and molecular ageing presumably interact to precipitate musculoskeletal decline in humans with age. Herein, we have delineated molecular networks for these two major components of sarcopenic risk using multiple independent clinical cohorts. We generated genome-wide transcript profiles from individuals (n = 44 who then undertook 20 weeks of supervised resistance-exercise training (RET. Expectedly, our subjects exhibited a marked range of hypertrophic responses (3% to +28%, and when applying Ingenuity Pathway Analysis (IPA up-stream analysis to ~580 genes that co-varied with gain in lean mass, we identified rapamycin (mTOR signaling associating with growth (P = 1.4 × 10(-30. Paradoxically, those displaying most hypertrophy exhibited an inhibited mTOR activation signature, including the striking down-regulation of 70 rRNAs. Differential analysis found networks mimicking developmental processes (activated all-trans-retinoic acid (ATRA, Z-score = 4.5; P = 6 × 10(-13 and inhibited aryl-hydrocarbon receptor signaling (AhR, Z-score = -2.3; P = 3 × 10(-7 with RET. Intriguingly, as ATRA and AhR gene-sets were also a feature of endurance exercise training (EET, they appear to represent "generic" physical activity responsive gene-networks. For age, we found that differential gene-expression methods do not produce consistent molecular differences between young versus old individuals. Instead, utilizing two independent cohorts (n = 45 and n = 52, with a continuum of subject ages (18-78 y, the first reproducible set of age-related transcripts in human muscle was identified. This analysis identified ~500 genes highly enriched in post-transcriptional processes (P = 1 × 10(-6 and with negligible links to the aforementioned generic exercise regulated gene-sets and some overlap with ribosomal genes. The RNA signatures from multiple compounds all targeting serotonin, DNA topoisomerase antagonism, and RXR activation were significantly related to
Adaptive Load-Balancing Algorithms using Symmetric Broadcast Networks
Das, Sajal K.; Harvey, Daniel J.; Biswas, Rupak; Biegel, Bryan A. (Technical Monitor)
2002-01-01
In a distributed computing environment, it is important to ensure that the processor workloads are adequately balanced, Among numerous load-balancing algorithms, a unique approach due to Das and Prasad defines a symmetric broadcast network (SBN) that provides a robust communication pattern among the processors in a topology-independent manner. In this paper, we propose and analyze three efficient SBN-based dynamic load-balancing algorithms, and implement them on an SGI Origin2000. A thorough experimental study with Poisson distributed synthetic loads demonstrates that our algorithms are effective in balancing system load. By optimizing completion time and idle time, the proposed algorithms are shown to compare favorably with several existing approaches.
On-line identification of hybrid systems using an adaptive growing and pruning RBF neural network
DEFF Research Database (Denmark)
Alizadeh, Tohid
2008-01-01
This paper introduces an adaptive growing and pruning radial basis function (GAP-RBF) neural network for on-line identification of hybrid systems. The main idea is to identify a global nonlinear model that can predict the continuous outputs of hybrid systems. In the proposed approach, GAP-RBF neu...
2015-09-30
Dimensional Environmental Acoustics in Distributed Undersea Networks PI: Henrik Schmidt Massachusetts Institute of Technology 77 Massachusetts Avenue...and understanding the spatial diversity of strongly 3D acoustic environments, including both signal and noise. SA core objective is to identify...adaptive waypoint behaviors required by this approach, with validation through field experiments of opportunity. APPROACH The fundamental approach of
An adaptive resource control mechanism in multi-hop ad-hoc networks
Yang, Y.; Heijenk, Geert; Haverkort, Boudewijn R.H.M.; Masip Bruin, Xavier; Verchere, Dominique; Tsaoussidis, Vassilis; Yannuzzi, Marcelo
This paper presents an adaptive resource control mechanism for multi-hop ad-hoc network systems, which avoids bottleneck problems caused by the node-fairness property of IEEE 802.11. In our proposal, the feedback information from the downstream bottleneck, derived from Request-To-Send (RTS) and
A note on "Multicriteria adaptive paths in stochastic, time-varying networks"
DEFF Research Database (Denmark)
Pretolani, Daniele; Nielsen, Lars Relund; Andersen, Kim Allan
In a recent paper, Opasanon and Miller-Hooks study multicriteria adaptive paths in stochastic time-varying networks. They propose a label correcting algorithm for finding the full set of efficient strategies. In this note we show that their algorithm is not correct, since it is based on a property...
An Adaptive Temporal-Causal Network Model for Enabling Learning of Social Interaction
Commu, Charlotte; Theelen, Mathilde; Treur, J.
2017-01-01
In this study, an adaptive temporal-causal network model is present-ed for learning of basic skills for social interaction. It focuses on greeting a known person and how that relates to learning how to recognize a person from seeing his or her face. The model involves a Hebbian learning process. The
Linking Climate Risk, Policy Networks and Adaptation Planning in Public Lands
Lubell, M.; Schwartz, M.; Peters, C.
2014-12-01
Federal public land management agencies in the United States have engaged a variety of planning efforts to address climate adaptation. A major goal of these efforts is to build policy networks that enable land managers to access information and expertise needed for responding to local climate risks. This paper investigates whether the perceived and modeled climate risk faced by different land managers is leading to larger networks or more participating in climate adaptation. In theory, the benefits of climate planning networks are larger when land managers are facing more potential changes. The basic hypothesis is tested with a survey of public land managers from hundreds of local and regional public lands management units in the Southwestern United States, as well as other stakeholders involved with climate adaptation planning. All survey respondents report their perceptions of climate risk along a variety of dimensions, as well as their participation in climate adaptation planning and information sharing networks. For a subset of respondents, we have spatially explicity GIS data about their location, which will be linked with downscaled climate model data. With the focus on climate change, the analysis is a subset of the overall idea of linking social and ecological systems.
Liu, Hua-Kuang; Diep, J.; Huang, K.
1991-01-01
Viewgraphs on multi-channel holographic bifurcative neural network system for real-time adaptive Earth Observing System (EOS) data analysis are presented. The objective is to research and develop an optical bifurcating neuromorphic pattern recognition system for making optical data array comparisons and to evaluate the use of the system for EOS data classification, reduction, analysis, and other applications.
Ros, S.; Robles-Gomez, A.; Hernandez, R.; Caminero, A. C.; Pastor, R.
2012-01-01
This paper outlines the adaptation of a course on the management of network services in operating systems, called NetServicesOS, to the context of the new European Higher Education Area (EHEA). NetServicesOS is a mandatory course in one of the official graduate programs in the Faculty of Computer Science at the Universidad Nacional de Educacion a…
Adaptive Voltage Control Strategy for Variable-Speed Wind Turbine Connected to a Weak Network
DEFF Research Database (Denmark)
Abulanwar, Elsayed; Hu, Weihao; Chen, Zhe
2016-01-01
continuous operation. This study investigates and analyses the repercussions raised by integrating a doubly-fed induction generator wind turbine into an ac network of different parameters and very weak conditions. An adaptive voltage control (AVC) strategy is proposed to retain voltage constancy...
Largenet2: an object-oriented programming library for simulating large adaptive networks.
Zschaler, Gerd; Gross, Thilo
2013-01-15
The largenet2 C++ library provides an infrastructure for the simulation of large dynamic and adaptive networks with discrete node and link states. The library is released as free software. It is available at http://biond.github.com/largenet2. Largenet2 is licensed under the Creative Commons Attribution-NonCommercial 3.0 Unported License. gerd@biond.org
A Comprehensive Review on Adaptability of Network Forensics Frameworks for Mobile Cloud Computing
Abdul Wahab, Ainuddin Wahid; Han, Qi; Bin Abdul Rahman, Zulkanain
2014-01-01
Network forensics enables investigation and identification of network attacks through the retrieved digital content. The proliferation of smartphones and the cost-effective universal data access through cloud has made Mobile Cloud Computing (MCC) a congenital target for network attacks. However, confines in carrying out forensics in MCC is interrelated with the autonomous cloud hosting companies and their policies for restricted access to the digital content in the back-end cloud platforms. It implies that existing Network Forensic Frameworks (NFFs) have limited impact in the MCC paradigm. To this end, we qualitatively analyze the adaptability of existing NFFs when applied to the MCC. Explicitly, the fundamental mechanisms of NFFs are highlighted and then analyzed using the most relevant parameters. A classification is proposed to help understand the anatomy of existing NFFs. Subsequently, a comparison is given that explores the functional similarities and deviations among NFFs. The paper concludes by discussing research challenges for progressive network forensics in MCC. PMID:25097880
A comprehensive review on adaptability of network forensics frameworks for mobile cloud computing.
Khan, Suleman; Shiraz, Muhammad; Wahab, Ainuddin Wahid Abdul; Gani, Abdullah; Han, Qi; Rahman, Zulkanain Bin Abdul
2014-01-01
Network forensics enables investigation and identification of network attacks through the retrieved digital content. The proliferation of smartphones and the cost-effective universal data access through cloud has made Mobile Cloud Computing (MCC) a congenital target for network attacks. However, confines in carrying out forensics in MCC is interrelated with the autonomous cloud hosting companies and their policies for restricted access to the digital content in the back-end cloud platforms. It implies that existing Network Forensic Frameworks (NFFs) have limited impact in the MCC paradigm. To this end, we qualitatively analyze the adaptability of existing NFFs when applied to the MCC. Explicitly, the fundamental mechanisms of NFFs are highlighted and then analyzed using the most relevant parameters. A classification is proposed to help understand the anatomy of existing NFFs. Subsequently, a comparison is given that explores the functional similarities and deviations among NFFs. The paper concludes by discussing research challenges for progressive network forensics in MCC.
Distance-Based and Low Energy Adaptive Clustering Protocol for Wireless Sensor Networks.
Liaqat, Misbah; Gani, Abdullah; Anisi, Mohammad Hossein; Ab Hamid, Siti Hafizah; Akhunzada, Adnan; Khan, Muhammad Khurram; Ali, Rana Liaqat
A wireless sensor network (WSN) comprises small sensor nodes with limited energy capabilities. The power constraints of WSNs necessitate efficient energy utilization to extend the overall network lifetime of these networks. We propose a distance-based and low-energy adaptive clustering (DISCPLN) protocol to streamline the green issue of efficient energy utilization in WSNs. We also enhance our proposed protocol into the multi-hop-DISCPLN protocol to increase the lifetime of the network in terms of high throughput with minimum delay time and packet loss. We also propose the mobile-DISCPLN protocol to maintain the stability of the network. The modelling and comparison of these protocols with their corresponding benchmarks exhibit promising results.
An Autonomous Self-Aware and Adaptive Fault Tolerant Routing Technique for Wireless Sensor Networks.
Abba, Sani; Lee, Jeong-A
2015-08-18
We propose an autonomous self-aware and adaptive fault-tolerant routing technique (ASAART) for wireless sensor networks. We address the limitations of self-healing routing (SHR) and self-selective routing (SSR) techniques for routing sensor data. We also examine the integration of autonomic self-aware and adaptive fault detection and resiliency techniques for route formation and route repair to provide resilience to errors and failures. We achieved this by using a combined continuous and slotted prioritized transmission back-off delay to obtain local and global network state information, as well as multiple random functions for attaining faster routing convergence and reliable route repair despite transient and permanent node failure rates and efficient adaptation to instantaneous network topology changes. The results of simulations based on a comparison of the ASAART with the SHR and SSR protocols for five different simulated scenarios in the presence of transient and permanent node failure rates exhibit a greater resiliency to errors and failure and better routing performance in terms of the number of successfully delivered network packets, end-to-end delay, delivered MAC layer packets, packet error rate, as well as efficient energy conservation in a highly congested, faulty, and scalable sensor network.
Adaptive control of dynamical synchronization on evolving networks with noise disturbances
Yuan, Wu-Jie; Zhou, Jian-Fang; Sendiña-Nadal, Irene; Boccaletti, Stefano; Wang, Zhen
2018-02-01
In real-world networked systems, the underlying structure is often affected by external and internal unforeseen factors, making its evolution typically inaccessible. An adaptive strategy was introduced for maintaining synchronization on unpredictably evolving networks [Sorrentino and Ott, Phys. Rev. Lett. 100, 114101 (2008), 10.1103/PhysRevLett.100.114101], which yet does not consider the noise disturbances widely existing in networks' environments. We provide here strategies to control dynamical synchronization on slowly and unpredictably evolving networks subjected to noise disturbances which are observed at the node and at the communication channel level. With our strategy, the nodes' coupling strength is adaptively adjusted with the aim of controlling synchronization, and according only to their received signal and noise disturbances. We first provide a theoretical analysis of the control scheme by introducing an error potential function to seek for the minimization of the synchronization error. Then, we show numerical experiments which verify our theoretical results. In particular, it is found that our adaptive strategy is effective even for the case in which the dynamics of the uncontrolled network would be explosive (i.e., the states of all the nodes would diverge to infinity).
Adaptive Synchronization of Fractional Order Complex-Variable Dynamical Networks via Pinning Control
Ding, Da-Wei; Yan, Jie; Wang, Nian; Liang, Dong
2017-09-01
In this paper, the synchronization of fractional order complex-variable dynamical networks is studied using an adaptive pinning control strategy based on close center degree. Some effective criteria for global synchronization of fractional order complex-variable dynamical networks are derived based on the Lyapunov stability theory. From the theoretical analysis, one concludes that under appropriate conditions, the complex-variable dynamical networks can realize the global synchronization by using the proper adaptive pinning control method. Meanwhile, we succeed in solving the problem about how much coupling strength should be applied to ensure the synchronization of the fractional order complex networks. Therefore, compared with the existing results, the synchronization method in this paper is more general and convenient. This result extends the synchronization condition of the real-variable dynamical networks to the complex-valued field, which makes our research more practical. Finally, two simulation examples show that the derived theoretical results are valid and the proposed adaptive pinning method is effective. Supported by National Natural Science Foundation of China under Grant No. 61201227, National Natural Science Foundation of China Guangdong Joint Fund under Grant No. U1201255, the Natural Science Foundation of Anhui Province under Grant No. 1208085MF93, 211 Innovation Team of Anhui University under Grant Nos. KJTD007A and KJTD001B, and also supported by Chinese Scholarship Council
Unsupervised Remote Sensing Domain Adaptation Method with Adversarial Network and Auxiliary Task
Directory of Open Access Journals (Sweden)
XU Suhui
2017-12-01
Full Text Available An important prerequisite when annotating the remote sensing images by machine learning is that there are enough training samples for training, but labeling the samples is very time-consuming. In this paper, we solve the problem of unsupervised learning with small sample size in remote sensing image scene classification by domain adaptation method. A new domain adaptation framework is proposed which combines adversarial network and auxiliary task. Firstly, a novel remote sensing scene classification framework is established based on deep convolution neural networks. Secondly, a domain classifier is added to the network, in order to learn the domain-invariant features. The gradient direction of the domain loss is opposite to the label loss during the back propagation, which makes the domain predictor failed to distinguish the sample's domain. Lastly, we introduce an auxiliary task for the network, which augments the training samples and improves the generalization ability of the network. The experiments demonstrate better results in unsupervised classification with small sample sizes of remote sensing images compared to the baseline unsupervised domain adaptation approaches.
Nonlinear Adaptive PID Control for Greenhouse Environment Based on RBF Network
Zeng, Songwei; Hu, Haigen; Xu, Lihong; Li, Guanghui
2012-01-01
This paper presents a hybrid control strategy, combining Radial Basis Function (RBF) network with conventional proportional, integral, and derivative (PID) controllers, for the greenhouse climate control. A model of nonlinear conservation laws of enthalpy and matter between numerous system variables affecting the greenhouse climate is formulated. RBF network is used to tune and identify all PID gain parameters online and adaptively. The presented Neuro-PID control scheme is validated through simulations of set-point tracking and disturbance rejection. We compare the proposed adaptive online tuning method with the offline tuning scheme that employs Genetic Algorithm (GA) to search the optimal gain parameters. The results show that the proposed strategy has good adaptability, strong robustness and real-time performance while achieving satisfactory control performance for the complex and nonlinear greenhouse climate control system, and it may provide a valuable reference to formulate environmental control strategies for actual application in greenhouse production. PMID:22778587
Comparative Study of Neural Network Frameworks for the Next Generation of Adaptive Optics Systems.
González-Gutiérrez, Carlos; Santos, Jesús Daniel; Martínez-Zarzuela, Mario; Basden, Alistair G; Osborn, James; Díaz-Pernas, Francisco Javier; De Cos Juez, Francisco Javier
2017-06-02
Many of the next generation of adaptive optics systems on large and extremely large telescopes require tomographic techniques in order to correct for atmospheric turbulence over a large field of view. Multi-object adaptive optics is one such technique. In this paper, different implementations of a tomographic reconstructor based on a machine learning architecture named "CARMEN" are presented. Basic concepts of adaptive optics are introduced first, with a short explanation of three different control systems used on real telescopes and the sensors utilised. The operation of the reconstructor, along with the three neural network frameworks used, and the developed CUDA code are detailed. Changes to the size of the reconstructor influence the training and execution time of the neural network. The native CUDA code turns out to be the best choice for all the systems, although some of the other frameworks offer good performance under certain circumstances.
Nonlinear adaptive PID control for greenhouse environment based on RBF network.
Zeng, Songwei; Hu, Haigen; Xu, Lihong; Li, Guanghui
2012-01-01
This paper presents a hybrid control strategy, combining Radial Basis Function (RBF) network with conventional proportional, integral, and derivative (PID) controllers, for the greenhouse climate control. A model of nonlinear conservation laws of enthalpy and matter between numerous system variables affecting the greenhouse climate is formulated. RBF network is used to tune and identify all PID gain parameters online and adaptively. The presented Neuro-PID control scheme is validated through simulations of set-point tracking and disturbance rejection. We compare the proposed adaptive online tuning method with the offline tuning scheme that employs Genetic Algorithm (GA) to search the optimal gain parameters. The results show that the proposed strategy has good adaptability, strong robustness and real-time performance while achieving satisfactory control performance for the complex and nonlinear greenhouse climate control system, and it may provide a valuable reference to formulate environmental control strategies for actual application in greenhouse production.
Taheri, Mehdi; Sheikholeslam, Farid; Najafi, Majddedin; Zekri, Maryam
2017-07-01
In this paper, consensus problem is considered for second order multi-agent systems with unknown nonlinear dynamics under undirected graphs. A novel distributed control strategy is suggested for leaderless systems based on adaptive fuzzy wavelet networks. Adaptive fuzzy wavelet networks are employed to compensate for the effect of unknown nonlinear dynamics. Moreover, the proposed method is developed for leader following systems and leader following systems with state time delays. Lyapunov functions are applied to prove uniformly ultimately bounded stability of closed loop systems and to obtain adaptive laws. Three simulation examples are presented to illustrate the effectiveness of the proposed control algorithms. Copyright © 2017 ISA. Published by Elsevier Ltd. All rights reserved.
DEFF Research Database (Denmark)
Grinke, Eduard; Tetzlaff, Christian; Wörgötter, Florentin
2015-01-01
Walking animals, like insects, with little neural computing can effectively perform complex behaviors. For example, they can walk around their environment, escape from corners/deadlocks, and avoid or climb over obstacles. While performing all these behaviors, they can also adapt their movements...... correlation-based learning with synaptic scaling is applied to adequately change the connections of the network. By doing so, we can effectively exploit neural dynamics (i.e., hysteresis effects and single attractors) in the network to generate different turning angles with short-term memory for a walking...... robot. The turning information is transmitted as descending steering signals to the neural locomotion control which translates the signals into motor actions. As a result, the robot can walk around and adapt its turning angle for avoiding obstacles in different situations. The adaptation also enables...
Directory of Open Access Journals (Sweden)
Wang Chao
2016-03-01
Full Text Available Due to the complexities existing in the electric load simulator, this article develops a high-performance nonlinear adaptive controller to improve the torque tracking performance of the electric load simulator, which mainly consists of an adaptive fuzzy self-recurrent wavelet neural network controller with variable structure (VSFSWC and a complementary controller. The VSFSWC is clearly and easily used for real-time systems and greatly improves the convergence rate and control precision. The complementary controller is designed to eliminate the effect of the approximation error between the proposed neural network controller and the ideal feedback controller without chattering phenomena. Moreover, adaptive learning laws are derived to guarantee the system stability in the sense of the Lyapunov theory. Finally, the hardware-in-the-loop simulations are carried out to verify the feasibility and effectiveness of the proposed algorithms in different working styles.
Adaptive Robust Control for Space Robot with Ucertainty base on Neural Network
Directory of Open Access Journals (Sweden)
Zhang Wenhui
2013-11-01
Full Text Available The trajectory tracking problems of a class of space robot manipulators with parameters and non-parameters uncertainty are considered. An adaptive robust control algorithm based on neural network is proposed by the paper. Neutral network is used to adaptive learn and compensate the unknown system for parameters uncertainties? the weight adaptive laws are designed by the paper? System stability base on Lyapunov theory is analysised to ensure the convergence of the algorithm. Non-parameters uncertainties are estimated and compensated by robust controller. It is proven that the designed controller can guarantee the asymptotic convergence of tracking error. The controller could guarantee good robust and the stability of closed-loop system. The simulation results show that the presented method is effective.
Carrillo, Snaider; Harkin, Jim; McDaid, Liam; Pande, Sandeep; Cawley, Seamus; McGinley, Brian; Morgan, Fearghal
2012-09-01
The brain is highly efficient in how it processes information and tolerates faults. Arguably, the basic processing units are neurons and synapses that are interconnected in a complex pattern. Computer scientists and engineers aim to harness this efficiency and build artificial neural systems that can emulate the key information processing principles of the brain. However, existing approaches cannot provide the dense interconnect for the billions of neurons and synapses that are required. Recently a reconfigurable and biologically inspired paradigm based on network-on-chip (NoC) and spiking neural networks (SNNs) has been proposed as a new method of realising an efficient, robust computing platform. However, the use of the NoC as an interconnection fabric for large-scale SNNs demands a good trade-off between scalability, throughput, neuron/synapse ratio and power consumption. This paper presents a novel traffic-aware, adaptive NoC router, which forms part of a proposed embedded mixed-signal SNN architecture called EMBRACE (EMulating Biologically-inspiRed ArChitectures in hardwarE). The proposed adaptive NoC router provides the inter-neuron connectivity for EMBRACE, maintaining router communication and avoiding dropped router packets by adapting to router traffic congestion. Results are presented on throughput, power and area performance analysis of the adaptive router using a 90 nm CMOS technology which outperforms existing NoCs in this domain. The adaptive behaviour of the router is also verified on a Stratix II FPGA implementation of a 4 × 2 router array with real-time traffic congestion. The presented results demonstrate the feasibility of using the proposed adaptive NoC router within the EMBRACE architecture to realise large-scale SNNs on embedded hardware. Copyright © 2012 Elsevier Ltd. All rights reserved.
Neural network adapted to wound cell analysis in surgical patients.
Viljanto, Jouko; Koski, Antti
2011-01-01
Assessment of the real state of wound healing of closed surgical wounds is uncertain both clinically and from conventional laboratory tests. Therefore, a novel approach based on early analysis of exactly timed wound cells, computerized further with an artificial neural network, was developed. At the end of routine surgery performed on 481 children under 18 years of age, a specific wound drain Cellstick™ was inserted subcutaneously between the wound edges to harvest wound cells. The Cellsticks™ were removed from 1 to 50 hours, mainly at hour 3 or 24 postsurgery. Immediately, the cellular contents were washed out using a pump constructed for the purpose. After cytocentrifugation, the cells were stained and counted differentially. Based on their relative proportions at selected time intervals, an artificial self-organizing neural map was developed. This was further transformed to a unidirectional linear graph where each node represents one set of relative cell quantities. As early as 3 hours, but more precisely 24 hours after surgery, the location of the nodes on this graph showed individually the patients' initial speed of wound inflammatory cell response. Similarly, timed Cellstick™ specimens from new surgical patients could be analyzed, computerized, and compared with these node values to assess their initial speed in wound inflammatory cell response. Location of the node on the graph does not express the time lapse after surgery but the speed of wound inflammatory cell response in relation to that of other patients. © 2011 by the Wound Healing Society.
A cascade reaction network mimicking the basic functional steps of adaptive immune response
Han, Da; Wu, Cuichen; You, Mingxu; Zhang, Tao; Wan, Shuo; Chen, Tao; Qiu, Liping; Zheng, Zheng; Liang, Hao; Tan, Weihong
2015-10-01
Biological systems use complex ‘information-processing cores’ composed of molecular networks to coordinate their external environment and internal states. An example of this is the acquired, or adaptive, immune system (AIS), which is composed of both humoral and cell-mediated components. Here we report the step-by-step construction of a prototype mimic of the AIS that we call an adaptive immune response simulator (AIRS). DNA and enzymes are used as simple artificial analogues of the components of the AIS to create a system that responds to specific molecular stimuli in vitro. We show that this network of reactions can function in a manner that is superficially similar to the most basic responses of the vertebrate AIS, including reaction sequences that mimic both humoral and cellular responses. As such, AIRS provides guidelines for the design and engineering of artificial reaction networks and molecular devices.
Optimal Channel Width Adaptation, Logical Topology Design, and Routing in Wireless Mesh Networks
Directory of Open Access Journals (Sweden)
Li Li
2009-01-01
Full Text Available Radio frequency spectrum is a finite and scarce resource. How to efficiently use the spectrum resource is one of the fundamental issues for multi-radio multi-channel wireless mesh networks. However, past research efforts that attempt to exploit multiple channels always assume channels of fixed predetermined width, which prohibits the further effective use of the spectrum resource. In this paper, we address how to optimally adapt channel width to more efficiently utilize the spectrum in IEEE802.11-based multi-radio multi-channel mesh networks. We mathematically formulate the channel width adaptation, logical topology design, and routing as a joint mixed 0-1 integer linear optimization problem, and we also propose our heuristic assignment algorithm. Simulation results show that our method can significantly improve spectrum use efficiency and network performance.
Directory of Open Access Journals (Sweden)
Chuan Zhu
2014-01-01
Full Text Available This paper exploits sink mobility to prolong the lifetime of sensor networks while maintaining the data transmission delay relatively low. A location predictive and time adaptive data gathering scheme is proposed. In this paper, we introduce a sink location prediction principle based on loose time synchronization and deduce the time-location formulas of the mobile sink. According to local clocks and the time-location formulas of the mobile sink, nodes in the network are able to calculate the current location of the mobile sink accurately and route data packets timely toward the mobile sink by multihop relay. Considering that data packets generating from different areas may be different greatly, an adaptive dwelling time adjustment method is also proposed to balance energy consumption among nodes in the network. Simulation results show that our data gathering scheme enables data routing with less data transmission time delay and balance energy consumption among nodes.
DEFF Research Database (Denmark)
Grinke, Eduard; Tetzlaff, Christian; Wörgötter, Florentin
2015-01-01
dynamics, plasticity, sensory feedback, and biomechanics. Generating such versatile and adaptive behaviors for a many degrees-of-freedom (DOFs) walking robot is a challenging task. Thus, in this study, we present a bio-inspired approach to solve this task. Specifically, the approach combines neural...... mechanisms with plasticity, exteroceptive sensory feedback, and biomechanics. The neural mechanisms consist of adaptive neural sensory processing and modular neural locomotion control. The sensory processing is based on a small recurrent neural network consisting of two fully connected neurons. Online...... correlation-based learning with synaptic scaling is applied to adequately change the connections of the network. By doing so, we can effectively exploit neural dynamics (i.e., hysteresis effects and single attractors) in the network to generate different turning angles with short-term memory for a walking...
Kim, Nakwan
Utilizing the universal approximation property of neural networks, we develop several novel approaches to neural network-based adaptive output feedback control of nonlinear systems, and illustrate these approaches for several flight control applications. In particular, we address the problem of non-affine systems and eliminate the fixed point assumption present in earlier work. All of the stability proofs are carried out in a form that eliminates an algebraic loop in the neural network implementation. An approximate input/output feedback linearizing controller is augmented with a neural network using input/output sequences of the uncertain system. These approaches permit adaptation to both parametric uncertainty and unmodeled dynamics. All physical systems also have control position and rate limits, which may either deteriorate performance or cause instability for a sufficiently high control bandwidth. Here we apply a method for protecting an adaptive process from the effects of input saturation and time delays, known as "pseudo control hedging". This method was originally developed for the state feedback case, and we provide a stability analysis that extends its domain of applicability to the case of output feedback. The approach is illustrated by the design of a pitch-attitude flight control system for a linearized model of an R-50 experimental helicopter, and by the design of a pitch-rate control system for a 58-state model of a flexible aircraft consisting of rigid body dynamics coupled with actuator and flexible modes. A new approach to augmentation of an existing linear controller is introduced. It is especially useful when there is limited information concerning the plant model, and the existing controller. The approach is applied to the design of an adaptive autopilot for a guided munition. Design of a neural network adaptive control that ensures asymptotically stable tracking performance is also addressed.
On Weak and Strong 2k- bent Boolean Functions
2016-01-01
no. 1, 34–64; translation in J. Appl. Ind. Math . 5:1 (2011), 110–129. [17] N. Tokareva, Bent Functions – Results and Applications to Cryptogra- phy...On weak and strong 2k-bent Boolean functions Pantelimon Stănică Department of Applied Mathematics Naval Postgraduate School Monterey, CA 93943-5212... functions , which we shall call (weak, strong) octa/hexadeca and in general, 2k-bent functions . We investigate relationships between these classes and
Bebop to the Boolean boogie an unconventional guide to electronics
Maxfield, Clive
2003-01-01
From reviews of the first edition:""If you want to be reminded of the joy of electronics, take a look at Clive (Max) Maxfield's book Bebop to the Boolean Boogie.""--Computer Design ""Lives up to its title as a useful and entertaining technical guide....well-suited for students, technical writers, technicians, and sales and marketing people.""--Electronic Design""Writing a book like this one takes audacity! ... Maxfield writes lucidly on a variety of complex topics without 'writing down' to his audience."" --EDN""A highly readable, well-illustrated guided tour
Unlimited multistability and Boolean logic in microbial signalling
DEFF Research Database (Denmark)
Kothamachu, Varun B; Feliu, Elisenda; Cardelli, Luca
2015-01-01
further prove that sharing of downstream components allows a system with n multi-domain hybrid HKs to attain 3n steady states. We find that such systems, when sensing distinct signals, can readily implement Boolean logic functions on these signals. Using two experimentally studied examples of two......-component systems implementing hybrid HKs, we show that bistability and implementation of logic functions are possible under biologically feasible reaction rates. Furthermore, we show that all sequenced microbial genomes contain significant numbers of hybrid and unorthodox HKs, and some genomes have a larger...
Boolean Variables in Economic Models Solved by Linear Programming
Directory of Open Access Journals (Sweden)
Lixandroiu D.
2014-12-01
Full Text Available The article analyses the use of logical variables in economic models solved by linear programming. Focus is given to the presentation of the way logical constraints are obtained and of the definition rules based on predicate logic. Emphasis is also put on the possibility to use logical variables in constructing a linear objective function on intervals. Such functions are encountered when costs or unitary receipts are different on disjunct intervals of production volumes achieved or sold. Other uses of Boolean variables are connected to constraint systems with conditions and the case of a variable which takes values from a finite set of integers.
Energy Technology Data Exchange (ETDEWEB)
Reed, Daniel A. [Univ. of Illinois, Urbana, IL (United States)
2003-03-14
Developers of advanced network applications such as remote instrument control, distributed data management, tele-immersion and collaboration, and distributed computing face a daunting challenge: sustaining robust application performance despite time-varying resource demands and dynamically changing resource availability. It is widely recognized that network-aware middleware is key to achieving performance robustness.
Büttner, Kathrin; Salau, Jennifer; Krieter, Joachim
2016-01-01
The average topological overlap of two graphs of two consecutive time steps measures the amount of changes in the edge configuration between the two snapshots. This value has to be zero if the edge configuration changes completely and one if the two consecutive graphs are identical. Current methods depend on the number of nodes in the network or on the maximal number of connected nodes in the consecutive time steps. In the first case, this methodology breaks down if there are nodes with no edges. In the second case, it fails if the maximal number of active nodes is larger than the maximal number of connected nodes. In the following, an adaption of the calculation of the temporal correlation coefficient and of the topological overlap of the graph between two consecutive time steps is presented, which shows the expected behaviour mentioned above. The newly proposed adaption uses the maximal number of active nodes, i.e. the number of nodes with at least one edge, for the calculation of the topological overlap. The three methods were compared with the help of vivid example networks to reveal the differences between the proposed notations. Furthermore, these three calculation methods were applied to a real-world network of animal movements in order to detect influences of the network structure on the outcome of the different methods.
Finite-Time Stabilization and Adaptive Control of Memristor-Based Delayed Neural Networks.
Wang, Leimin; Shen, Yi; Zhang, Guodong
Finite-time stability problem has been a hot topic in control and system engineering. This paper deals with the finite-time stabilization issue of memristor-based delayed neural networks (MDNNs) via two control approaches. First, in order to realize the stabilization of MDNNs in finite time, a delayed state feedback controller is proposed. Then, a novel adaptive strategy is applied to the delayed controller, and finite-time stabilization of MDNNs can also be achieved by using the adaptive control law. Some easily verified algebraic criteria are derived to ensure the stabilization of MDNNs in finite time, and the estimation of the settling time functional is given. Moreover, several finite-time stability results as our special cases for both memristor-based neural networks (MNNs) without delays and neural networks are given. Finally, three examples are provided for the illustration of the theoretical results.Finite-time stability problem has been a hot topic in control and system engineering. This paper deals with the finite-time stabilization issue of memristor-based delayed neural networks (MDNNs) via two control approaches. First, in order to realize the stabilization of MDNNs in finite time, a delayed state feedback controller is proposed. Then, a novel adaptive strategy is applied to the delayed controller, and finite-time stabilization of MDNNs can also be achieved by using the adaptive control law. Some easily verified algebraic criteria are derived to ensure the stabilization of MDNNs in finite time, and the estimation of the settling time functional is given. Moreover, several finite-time stability results as our special cases for both memristor-based neural networks (MNNs) without delays and neural networks are given. Finally, three examples are provided for the illustration of the theoretical results.
Directory of Open Access Journals (Sweden)
Yepeng Ni
2016-01-01
Full Text Available We consider the problem of streaming media transmission in a heterogeneous network from a multisource server to home multiple terminals. In wired network, the transmission performance is limited by network state (e.g., the bandwidth variation, jitter, and packet loss. In wireless network, the multiple user terminals can cause bandwidth competition. Thus, the streaming media distribution in a heterogeneous network becomes a severe challenge which is critical for QoS guarantee. In this paper, we propose a context-aware adaptive streaming media distribution system (CAASS, which implements the context-aware module to perceive the environment parameters and use the strategy analysis (SA module to deduce the most suitable service level. This approach is able to improve the video quality for guarantying streaming QoS. We formulate the optimization problem of QoS relationship with the environment parameters based on the QoS testing algorithm for IPTV in ITU-T G.1070. We evaluate the performance of the proposed CAASS through 12 types of experimental environments using a prototype system. Experimental results show that CAASS can dynamically adjust the service level according to the environment variation (e.g., network state and terminal performances and outperforms the existing streaming approaches in adaptive streaming media distribution according to peak signal-to-noise ratio (PSNR.
Development of an Adaptive Routing Mechanism in Software-Deﬁned Networks
Directory of Open Access Journals (Sweden)
A. N. Noskov
2015-01-01
Full Text Available The purpose of this work is to develop a unitary mechanism of adaptive routing of diﬀerent kinds, basing on the current requirements on the quality of service. The software conﬁguration of a network is the technology of the future. The trend in communication systems constantly conﬁrms this fact. However, the application of this technology in its current form is justiﬁed only in large networks of technology giants and telecom operators. Today we have a large number of dynamic routing protocols to route big volume traﬃc in communication networks. Our task is to create the solution that can use the opportunities of each node to make a decision on the transmission of information by all possible means for each type of traﬃc. Achieving this goal is possible by solving the problem of the development of generalized metrics, which details the links between devices in the network, and the problem of establishing a framework of adaptive logical network topology (route management to ensure the quality of the whole network in order to meet the current requirements on the quality of a particular type service.
Peng, Jinzhu; Dubay, Rickey
2011-10-01
In this paper, an adaptive control approach based on the neural networks is presented to control a DC motor system with dead-zone characteristics (DZC), where two neural networks are proposed to formulate the traditional identification and control approaches. First, a Wiener-type neural network (WNN) is proposed to identify the motor DZC, which formulates the Wiener model with a linear dynamic block in cascade with a nonlinear static gain. Second, a feedforward neural network is proposed to formulate the traditional PID controller, termed as PID-type neural network (PIDNN), which is then used to control and compensate for the DZC. In this way, the DC motor system with DZC is identified by the WNN identifier, which provides model information to the PIDNN controller in order to make it adaptive. Back-propagation algorithms are used to train both neural networks. Also, stability and convergence analysis are conducted using the Lyapunov theorem. Finally, experiments on the DC motor system demonstrated accurate identification and good compensation for dead-zone with improved control performance over the conventional PID control. Copyright © 2011 ISA. Published by Elsevier Ltd. All rights reserved.
OSPF for Implementing Self-adaptive Routing in Autonomic Networks: A Case Study
Rétvári, Gábor; Németh, Felicián; Chaparadza, Ranganai; Szabó, Róbert
Autonomicity, realized through control-loop structures operating within network devices and the network as a whole, is an enabler for advanced and enriched self-manageability of network devices and networks. In this paper, we argue that the degree of self-management and self-adaptation embedded by design into existing protocols needs to be well understood before one can enhance or integrate such protocols into self-managing network architectures that exhibit more advanced autonomic behaviors. We justify this claim through an illustrative case study: we show that the well-known and extensively used intra-domain IP routing protocol, OSPF, is itself a quite capable self-managing entity, complete with all the basic components of an autonomic networking element like embedded control-loops, decision-making modules, distributed knowledge repositories, etc. We describe these components in detail, concentrating on the numerous control-loops inherent to OSPF, and discuss how some of the control-loops can be enriched with external decision making logics to implement a truly self-adapting routing functionality.
Wang, Wei
2014-06-22
In this work, we propose a novel framework of autonomic intrusion detection that fulfills online and adaptive intrusion detection over unlabeled HTTP traffic streams in computer networks. The framework holds potential for self-managing: self-labeling, self-updating and self-adapting. Our framework employs the Affinity Propagation (AP) algorithm to learn a subject’s behaviors through dynamical clustering of the streaming data. It automatically labels the data and adapts to normal behavior changes while identifies anomalies. Two large real HTTP traffic streams collected in our institute as well as a set of benchmark KDD’99 data are used to validate the framework and the method. The test results show that the autonomic model achieves better results in terms of effectiveness and efficiency compared to adaptive Sequential Karhunen–Loeve method and static AP as well as three other static anomaly detection methods, namely, k-NN, PCA and SVM.
Neural network-based adaptive dynamic surface control for permanent magnet synchronous motors.
Yu, Jinpeng; Shi, Peng; Dong, Wenjie; Chen, Bing; Lin, Chong
2015-03-01
This brief considers the problem of neural networks (NNs)-based adaptive dynamic surface control (DSC) for permanent magnet synchronous motors (PMSMs) with parameter uncertainties and load torque disturbance. First, NNs are used to approximate the unknown and nonlinear functions of PMSM drive system and a novel adaptive DSC is constructed to avoid the explosion of complexity in the backstepping design. Next, under the proposed adaptive neural DSC, the number of adaptive parameters required is reduced to only one, and the designed neural controllers structure is much simpler than some existing results in literature, which can guarantee that the tracking error converges to a small neighborhood of the origin. Then, simulations are given to illustrate the effectiveness and potential of the new design technique.
Yes/No/Maybe: A Boolean attempt at feedback | Louw | Journal for ...
African Journals Online (AJOL)
The experiment conducted was a two-draft assignment in which three different kinds of feedback (technique A: handwritten comments, B: consciousnessraising through generalised Boolean feedback, and C: specific Boolean feedback) were presented to three different groups of students. The results indicate that specific ...
2017-09-01
Communication theory of secrecy systems,” Bell Systems Technical Journal, vol. 28, pp. 656–715, 1949. [40] T. Siegenthaler, “Correlation immunity of nonlinear...Cryptography, coding theory , Boolean functions, generalized Boolean functions, correlation immunity, strict avalanche criterion, bent functions, cyber...information warfare, information security, communications security. 15. NUMBER OF PAGES 161 16. PRICE CODE 17. SECURITY CLASSIFICATION OF REPORT
A Boolean extension of a frame and a representation of discontinuity ...
African Journals Online (AJOL)
A Boolean extension of a frame and a representation of discontinuity. ... We mend it in this paper using a certain extension Sc(L) of a frame L, which is, a.o., Boolean and idempotent. Doing this we do not lose the merits ... Key words: Frame, locale, subt, regular, sublocale, sublocale lattice, open sublocale, closed sublocale ...
Lan, Ganhui; Tu, Yuhai
2013-10-06
The incoherent type-1 feed-forward loop (I1-FFL) is ubiquitous in biological regulatory circuits. Although much is known about the functions of the I1-FFL motif, the energy cost incurred in the network and how it affects the performance of the network have not been investigated. Here, we study a generic I1-FFL enzymatic reaction network modelled after the GEF-GAP-Ras pathway responsible for chemosensory adaptation in eukaryotic cells. Our analysis shows that the I1-FFL network always operates out of equilibrium. Continuous energy dissipation is necessary to drive an internal phosphorylation-dephosphorylation cycle that is crucial in achieving strong short-time response and accurate long-time adaptation. In particular, we show quantitatively that the energy dissipated in the I1-FFL network is used (i) to increase the system's initial response to the input signals; (ii) to enhance the adaptation accuracy at steady state; and (iii) to expand the range of such accurate adaptation. Moreover, we find that the energy dissipation rate, the catalytic speed and the maximum adaptation accuracy in the I1-FFL network satisfy the same energy-speed-accuracy relationship as in the negative-feedback-loop (NFL) networks. Because the I1-FFL and NFL are the only two basic network motifs that enable accurate adaptation, our results suggest that a universal cost-performance trade-off principle may underlie all cellular adaptation processes independent of the detailed biochemical circuit architecture.
Mata-Machuca, Juan L.; Aguilar-López, Ricardo
2018-01-01
This work deals with the adaptative synchronization of complex dynamical networks with fractional-order nodes and its application in secure communications employing chaotic parameter modulation. The complex network is composed of multiple fractional-order systems with mismatch parameters and the coupling functions are given to realize the network synchronization. We introduce a fractional algebraic synchronizability condition (FASC) and a fractional algebraic identifiability condition (FAIC) which are used to know if the synchronization and parameters estimation problems can be solved. To overcome these problems, an adaptative synchronization methodology is designed; the strategy consists in proposing multiple receiver systems which tend to follow asymptotically the uncertain transmitters systems. The coupling functions and parameters of the receiver systems are adjusted continually according to a convenient sigmoid-like adaptative controller (SLAC), until the measurable output errors converge to zero, hence, synchronization between transmitter and receivers is achieved and message signals are recovered. Indeed, the stability analysis of the synchronization error is based on the fractional Lyapunov direct method. Finally, numerical results corroborate the satisfactory performance of the proposed scheme by means of the synchronization of a complex network consisting of several fractional-order unified chaotic systems.
An Adaptive Damping Network Designed for Strapdown Fiber Optic Gyrocompass System for Ships
Directory of Open Access Journals (Sweden)
Jin Sun
2017-03-01
Full Text Available The strapdown fiber optic gyrocompass (strapdown FOGC system for ships primarily works on external horizontal damping and undamping statuses. When there are large sea condition changes, the system will switch frequently between the external horizontal damping status and the undamping status. This means that the system is always in an adjustment status and influences the dynamic accuracy of the system. Aiming at the limitations of the conventional damping method, a new design idea is proposed, where the adaptive control method is used to design the horizontal damping network of the strapdown FOGC system. According to the size of acceleration, the parameters of the damping network are changed to make the system error caused by the ship’s maneuvering to a minimum. Furthermore, the jump in damping coefficient was transformed into gradual change to make a smooth system status switch. The adaptive damping network was applied for strapdown FOGC under the static and dynamic condition, and its performance was compared with the conventional damping, and undamping means. Experimental results showed that the adaptive damping network was effective in improving the dynamic performance of the strapdown FOGC.
Trajanovski, Stojan; Guo, Dongchao; Van Mieghem, Piet
2015-09-01
The continuous-time adaptive susceptible-infected-susceptible (ASIS) epidemic model and the adaptive information diffusion (AID) model are two adaptive spreading processes on networks, in which a link in the network changes depending on the infectious state of its end nodes, but in opposite ways: (i) In the ASIS model a link is removed between two nodes if exactly one of the nodes is infected to suppress the epidemic, while a link is created in the AID model to speed up the information diffusion; (ii) a link is created between two susceptible nodes in the ASIS model to strengthen the healthy part of the network, while a link is broken in the AID model due to the lack of interest in informationless nodes. The ASIS and AID models may be considered as first-order models for cascades in real-world networks. While the ASIS model has been exploited in the literature, we show that the AID model is realistic by obtaining a good fit with Facebook data. Contrary to the common belief and intuition for such similar models, we show that the ASIS and AID models exhibit different but not opposite properties. Most remarkably, a unique metastable state always exists in the ASIS model, while there an hourglass-shaped region of instability in the AID model. Moreover, the epidemic threshold is a linear function in the effective link-breaking rate in the AID model, while it is almost constant but noisy in the AID model.
Fortuna, Miguel A; Zaman, Luis; Wagner, Andreas; Bascompte, Jordi
2017-12-05
The origin of evolutionary innovations is a central problem in evolutionary biology. To what extent such innovations have adaptive or non-adaptive origins is hard to assess in real organisms. This limitation, however, can be overcome using digital organisms, i.e. self-replicating computer programs that mutate, evolve and coevolve within a user-defined computational environment. Here, we quantify the role of the non-adaptive origins of host resistance traits in determining the evolution of ecological interactions among host and parasite digital organisms. We find that host resistance traits arising spontaneously as exaptations increase the complexity of antagonistic host-parasite networks. Specifically, they lead to higher host phenotypic diversification, a larger number of ecological interactions and higher heterogeneity in interaction strengths. Given the potential of network architecture to affect network dynamics, such exaptations may increase the persistence of entire communities. Our in silico approach, therefore, may complement current theoretical advances aimed at disentangling the ecological and evolutionary mechanisms shaping species interaction networks.This article is part of the themed issue 'Process and pattern in innovations from cells to societies'. © 2017 The Author(s).
Trajanovski, Stojan; Guo, Dongchao; Van Mieghem, Piet
2015-09-01
The continuous-time adaptive susceptible-infected-susceptible (ASIS) epidemic model and the adaptive information diffusion (AID) model are two adaptive spreading processes on networks, in which a link in the network changes depending on the infectious state of its end nodes, but in opposite ways: (i) In the ASIS model a link is removed between two nodes if exactly one of the nodes is infected to suppress the epidemic, while a link is created in the AID model to speed up the information diffusion; (ii) a link is created between two susceptible nodes in the ASIS model to strengthen the healthy part of the network, while a link is broken in the AID model due to the lack of interest in informationless nodes. The ASIS and AID models may be considered as first-order models for cascades in real-world networks. While the ASIS model has been exploited in the literature, we show that the AID model is realistic by obtaining a good fit with Facebook data. Contrary to the common belief and intuition for such similar models, we show that the ASIS and AID models exhibit different but not opposite properties. Most remarkably, a unique metastable state always exists in the ASIS model, while there an hourglass-shaped region of instability in the AID model. Moreover, the epidemic threshold is a linear function in the effective link-breaking rate in the AID model, while it is almost constant but noisy in the AID model.
The Optimization of the Data Packet Length in Adaptive Radio Networks
Directory of Open Access Journals (Sweden)
Anatolii P. Voiter
2017-10-01
Full Text Available Background. Development of methods and means of the adaptive management of the radio networks bandwidth with competitive access to the radio channel. Objective. The aim of the paper is to determine the packet length effect on the effective radio networks transmission rate with taking into account the parameters, formats, and procedures of the physical and link levels at using the MAC protocol with a rigid strategy of competitive access to the radio channel. Methods. The goal is achieved by creating and analyzing the mathematical model of the effective transmission rate in radio networks. The model is described by the equation for the effective transmission rate, which is the function of both the probability of the conflict-free transmission of the MAC protocol and the coefficient of the data packet size deviation from the optimal for LLC protocol. Results. It is proved that there is the optimal deviation of the data packet length for each MAC protocol traffic intensity value, which provides the most effective transfer rate. This makes the possibility for adaptive management of the radio bandwidth by applying a pre-calculated deviation of the data packet size in dependence on the traffic intensity. Conclusions. The proposed mathematical model is the tool for calculation of both the radio bandwidth network capacity and the optimal deviation of the data packet length at adaptive management of competitive access to a radio channel with a rigid strategy at conditions of the significant fluctuation in traffic intensity.
Adaptive Neural Network Algorithm for Power Control in Nuclear Power Plants
Masri Husam Fayiz, Al
2017-01-01
The aim of this paper is to design, test and evaluate a prototype of an adaptive neural network algorithm for the power controlling system of a nuclear power plant. The task of power control in nuclear reactors is one of the fundamental tasks in this field. Therefore, researches are constantly conducted to ameliorate the power reactor control process. Currently, in the Department of Automation in the National Research Nuclear University (NRNU) MEPhI, numerous studies are utilizing various methodologies of artificial intelligence (expert systems, neural networks, fuzzy systems and genetic algorithms) to enhance the performance, safety, efficiency and reliability of nuclear power plants. In particular, a study of an adaptive artificial intelligent power regulator in the control systems of nuclear power reactors is being undertaken to enhance performance and to minimize the output error of the Automatic Power Controller (APC) on the grounds of a multifunctional computer analyzer (simulator) of the Water-Water Energetic Reactor known as Vodo-Vodyanoi Energetichesky Reaktor (VVER) in Russian. In this paper, a block diagram of an adaptive reactor power controller was built on the basis of an intelligent control algorithm. When implementing intelligent neural network principles, it is possible to improve the quality and dynamic of any control system in accordance with the principles of adaptive control. It is common knowledge that an adaptive control system permits adjusting the controller’s parameters according to the transitions in the characteristics of the control object or external disturbances. In this project, it is demonstrated that the propitious options for an automatic power controller in nuclear power plants is a control system constructed on intelligent neural network algorithms.
Adaptive critic autopilot design of bank-to-turn missiles using fuzzy basis function networks.
Lin, Chuan-Kai
2005-04-01
A new adaptive critic autopilot design for bank-to-turn missiles is presented. In this paper, the architecture of adaptive critic learning scheme contains a fuzzy-basis-function-network based associative search element (ASE), which is employed to approximate nonlinear and complex functions of bank-to-turn missiles, and an adaptive critic element (ACE) generating the reinforcement signal to tune the associative search element. In the design of the adaptive critic autopilot, the control law receives signals from a fixed gain controller, an ASE and an adaptive robust element, which can eliminate approximation errors and disturbances. Traditional adaptive critic reinforcement learning is the problem faced by an agent that must learn behavior through trial-and-error interactions with a dynamic environment, however, the proposed tuning algorithm can significantly shorten the learning time by online tuning all parameters of fuzzy basis functions and weights of ASE and ACE. Moreover, the weight updating law derived from the Lyapunov stability theory is capable of guaranteeing both tracking performance and stability. Computer simulation results confirm the effectiveness of the proposed adaptive critic autopilot.
Directory of Open Access Journals (Sweden)
Bahita Mohamed
2011-01-01
Full Text Available In this work, we introduce an adaptive neural network controller for a class of nonlinear systems. The approach uses two Radial Basis Functions, RBF networks. The first RBF network is used to approximate the ideal control law which cannot be implemented since the dynamics of the system are unknown. The second RBF network is used for on-line estimating the control gain which is a nonlinear and unknown function of the states. The updating laws for the combined estimator and controller are derived through Lyapunov analysis. Asymptotic stability is established with the tracking errors converging to a neighborhood of the origin. Finally, the proposed method is applied to control and stabilize the inverted pendulum system.
Towards a Framework for Self-Adaptive Reliable Network Services in Highly-Uncertain Environments
DEFF Research Database (Denmark)
Grønbæk, Lars Jesper; Schwefel, Hans-Peter; Ceccarelli, Andrea
2010-01-01
to improve resilience of end-node services. In this paper we present a framework, called ODDR (Observation, Diagnosis, Decision, Remediation), for improving resilience of network based services through integration of self-adaptive monitoring services, network diagnosis, decision actions, and finally......In future inhomogeneous, pervasive and highly dynamic networks, end-nodes may often only rely on unreliable and uncertain observations to diagnose hidden network states and decide upon possible remediation actions. Inherent challenges exists to identify good and timely decision strategies...... execution (and monitoring) of remediation actions. We detail the motivations to the ODDR design, then we present its architecture, and finally we describe our current activities towards the realization and assessment of the framework services and the main results currently achieved....
Hou, Runmin; Wang, Li; Gao, Qiang; Hou, Yuanglong; Wang, Chao
2017-09-01
This paper proposes a novel indirect adaptive fuzzy wavelet neural network (IAFWNN) to control the nonlinearity, wide variations in loads, time-variation and uncertain disturbance of the ac servo system. In the proposed approach, the self-recurrent wavelet neural network (SRWNN) is employed to construct an adaptive self-recurrent consequent part for each fuzzy rule of TSK fuzzy model. For the IAFWNN controller, the online learning algorithm is based on back propagation (BP) algorithm. Moreover, an improved particle swarm optimization (IPSO) is used to adapt the learning rate. The aid of an adaptive SRWNN identifier offers the real-time gradient information to the adaptive fuzzy wavelet neural controller to overcome the impact of parameter variations, load disturbances and other uncertainties effectively, and has a good dynamic. The asymptotical stability of the system is guaranteed by using the Lyapunov method. The result of the simulation and the prototype test prove that the proposed are effective and suitable. Copyright © 2017. Published by Elsevier Ltd.
Wang, Bohui; Wang, Jingcheng; Zhang, Langwen; Zhang, Bin; Li, Xiaocheng
2017-06-01
This paper proposes an adaptive explicit synchronization framework to address the cooperative control for heterogeneous uncertain dynamical networks under switching communication topologies. The main contribution is to develop an adaptive explicit synchronization algorithm, in which the synchronization state can be completely tracked by each agent in real time rather than only be measured after the synchronization process of all agents is over. By introducing appropriate assumptions, a class of adaptive explicit synchronization protocols is designed by using a combination of the virtual leader's states, the neighboring agents' relative information, distributed feedback gain, and distributed average weighted parameters. It is proved in the sense of Lyapunov that, if the dwell time is larger than a positive threshold, the cooperative control problem for the closed-loop heterogeneous uncertain dynamical networks under switching of strongly-connected communication topologies can be solved by the proposed adaptive explicit synchronization algorithm. Furthermore, by assuming that the topology is frequently strongly-connected, it shows that intermittent adaptive explicit synchronization can be achieved with well-designed control parameters. Two examples are presented to demonstrate the effectiveness of the proposed theory.
Untangling perceptual memory: hysteresis and adaptation map into separate cortical networks.
Schwiedrzik, Caspar M; Ruff, Christian C; Lazar, Andreea; Leitner, Frauke C; Singer, Wolf; Melloni, Lucia
2014-05-01
Perception is an active inferential process in which prior knowledge is combined with sensory input, the result of which determines the contents of awareness. Accordingly, previous experience is known to help the brain "decide" what to perceive. However, a critical aspect that has not been addressed is that previous experience can exert 2 opposing effects on perception: An attractive effect, sensitizing the brain to perceive the same again (hysteresis), or a repulsive effect, making it more likely to perceive something else (adaptation). We used functional magnetic resonance imaging and modeling to elucidate how the brain entertains these 2 opposing processes, and what determines the direction of such experience-dependent perceptual effects. We found that although affecting our perception concurrently, hysteresis and adaptation map into distinct cortical networks: a widespread network of higher-order visual and fronto-parietal areas was involved in perceptual stabilization, while adaptation was confined to early visual areas. This areal and hierarchical segregation may explain how the brain maintains the balance between exploiting redundancies and staying sensitive to new information. We provide a Bayesian model that accounts for the coexistence of hysteresis and adaptation by separating their causes into 2 distinct terms: Hysteresis alters the prior, whereas adaptation changes the sensory evidence (the likelihood function).
DEFF Research Database (Denmark)
Pedersen, Søren Damkiær; Yang, Lei; Molin, Søren
2013-01-01
The genetic basis of bacterial adaptation to a natural environment has been investigated in a highly successful Pseudomonas aeruginosa lineage (DK2) that evolved within the airways of patients with cystic fibrosis (CF) for more than 35 y. During evolution in the CF airways, the DK2 lineage...... phenotypes. Our results suggest that adaptation to a highly selective environment, such as the CF airways, is a highly dynamic and complex process, which involves continuous optimization of existing regulatory networks to match the fluctuations in the environment....
DEFF Research Database (Denmark)
Yao, Wei; Fang, Jiakun; Zhao, Ping
2013-01-01
In this paper, a nonlinear adaptive damping controller based on radial basis function neural network (RBFNN), which can infinitely approximate to nonlinear system, is proposed for thyristor controlled series capacitor (TCSC). The proposed TCSC adaptive damping controller can not only have...... system and a four-machine two-area power system under different operating conditions in comparison with the lead-lag damping controller tuned by evolutionary algorithm (EA). Simulation results show that the proposed damping controller achieves good robust performance for damping the low frequency...
Adaptive QoS in 802.11e Wireless Networks for Lunar Communications
Spearman, Will; Martin, Jim; Gao, Jay L.
2008-01-01
This slide presentation reviews the issues around Adaptive Quality of Service (QoS) in wireless networks for lunar communications, and how a dynamic 802.11e standard meets the requirements for all aspects of communications for lunar surface missions. This paper focuses on the use of Enhanced Distributed Channel Access (EDCA). It includes a description of an adaptive QoS Algorithm, a review of the set up of the simulation of the 802.11e standard, and the results of the simulation are included.
A Traffic Prediction Model for Self-Adapting Routing Overlay Network in Publish/Subscribe System
Directory of Open Access Journals (Sweden)
Meng Chi
2017-01-01
Full Text Available In large-scale location-based service, an ideal situation is that self-adapting routing strategies use future traffic data as input to generate a topology which could adapt to the changing traffic well. In the paper, we propose a traffic prediction model for the broker in publish/subscribe system, which can predict the traffic of the link in future by neural network. We first introduced our traffic prediction model and then described the model integration. Finally, the experimental results show that our traffic prediction model could predict the traffic of link well.
End to end adaptive congestion control in TCP/IP networks
Houmkozlis, Christos N
2012-01-01
This book provides an adaptive control theory perspective on designing congestion controls for packet-switching networks. Relevant to a wide range of disciplines and industries, including the music industry, computers, image trading, and virtual groups, the text extensively discusses source oriented, or end to end, congestion control algorithms. The book empowers readers with clear understanding of the characteristics of packet-switching networks and their effects on system stability and performance. It provides schemes capable of controlling congestion and fairness and presents real-world app
Design of an Adaptive-Neural Network Attitude Controller of a Satellite using Reaction Wheels
Directory of Open Access Journals (Sweden)
Abbas Ajorkar
2015-04-01
Full Text Available In this paper, an adaptive attitude control algorithm is developed based on neural network for a satellite using four reaction wheels in a tetrahedron configuration. Then, an attitude control based on feedback linearization control has been designed and uncertainties in the moment of inertia matrix and disturbances torque have been considered. In order to eliminate the effect of these uncertainties, a multilayer neural network with back-propagation law is designed. In this structure, the parameters of the moment of inertia matrix and external disturbances are estimated and used in feedback linearization control law. Finally, the performance of the designed attitude controller is investigated by several simulations.
Grantham, Katie
2003-01-01
Reusable Launch Vehicles (RLVs) have different mission requirements than the Space Shuttle, which is used for benchmark guidance design. Therefore, alternative Terminal Area Energy Management (TAEM) and Approach and Landing (A/L) Guidance schemes can be examined in the interest of cost reduction. A neural network based solution for a finite horizon trajectory optimization problem is presented in this paper. In this approach the optimal trajectory of the vehicle is produced by adaptive critic based neural networks, which were trained off-line to maintain a gradual glideslope.
Directory of Open Access Journals (Sweden)
Pim Vugteveen
2015-03-01
Full Text Available We elaborate the necessary conceptual and strategic elements for developing an effective adaptive monitoring network to support Integrated Coastal Management (ICM in a multiuser nature reserve in the Dutch Wadden Sea Region. We discuss quality criteria and enabling actions essential to accomplish and sustain monitoring excellence to support ICM. The Wadden Sea Long-Term Ecosystem Research project (WaLTER was initiated to develop an adaptive monitoring network and online data portal to better understand and support ICM in the Dutch Wadden Sea Region. Our comprehensive approach integrates ecological and socioeconomic data and links research-driven and policy-driven monitoring for system analysis using indicators of pressures, state, benefits, and responses. The approach and concepts we elaborated are transferable to other coastal regions to accomplish ICM in complex social-ecological systems in which scientists, multisectoral stakeholders, resource managers, and governmental representatives seek to balance long-term ecological, economic, and social objectives within natural limits.
Command Filtered Adaptive Fuzzy Neural Network Backstepping Control for Marine Power System
Directory of Open Access Journals (Sweden)
Xin Zhang
2014-01-01
Full Text Available In order to retrain chaotic oscillation of marine power system which is excited by periodic electromagnetism perturbation, a novel command-filtered adaptive fuzzy neural network backstepping control method is designed. First, the mathematical model of marine power system is established based on the two parallel nonlinear model. Then, main results of command-filtered adaptive fuzzy neural network backstepping control law are given. And the Lyapunov stability theory is applied to prove that the system can remain closed-loop asymptotically stable with this controller. Finally, simulation results indicate that the designed controller can suppress chaotic oscillation with fast convergence speed that makes the system return to the equilibrium point quickly; meanwhile, the parameter which induces chaotic oscillation can also be discriminated.
Directory of Open Access Journals (Sweden)
Hui Zhou
2015-08-01
Full Text Available Attracting increasing attention in recent years, the Free Space Optics (FSO technology has been recognized as a cost-effective wireless access technology for multi-Gigabit rate wireless networks. Radio on Free Space Optics (RoFSO provides a new approach to support various bandwidth-intensive wireless services in an optical wireless link. In an RoFSO system using wavelength-division multiplexing (WDM, it is possible to concurrently transmit multiple data streams consisting of various wireless services at very high rate. In this paper, we investigate the problem of optical power allocation under power budget and eye safety constraints for adaptive WDM transmission in RoFSO networks. We develop power allocation schemes for adaptive WDM transmissions to combat the effect of weather turbulence on RoFSO links. Simulation results show that WDM RoFSO can support high data rates even over long distance or under bad weather conditions with an adequate system design.
Transcoding-Based Error-Resilient Video Adaptation for 3G Wireless Networks
Directory of Open Access Journals (Sweden)
Dogan Safak
2007-01-01
Full Text Available Transcoding is an effective method to provide video adaptation for heterogeneous internetwork video access and communication environments, which require the tailoring (i.e., repurposing of coded video properties to channel conditions, terminal capabilities, and user preferences. This paper presents a video transcoding system that is capable of applying a suite of error resilience tools on the input compressed video streams while controlling the output rates to provide robust communications over error-prone and bandwidth-limited 3G wireless networks. The transcoder is also designed to employ a new adaptive intra-refresh algorithm, which is responsive to the detected scene activity inherently embedded into the video content and the reported time-varying channel error conditions of the wireless network. Comprehensive computer simulations demonstrate significant improvements in the received video quality performances using the new transcoding architecture without an extra computational cost.
Content-Adaptive Packetization and Streaming of Wavelet Video over IP Networks
Directory of Open Access Journals (Sweden)
Chien-Peng Ho
2007-03-01
Full Text Available This paper presents a framework of content-adaptive packetization scheme for streaming of 3D wavelet-based video content over lossy IP networks. The tradeoff between rate and distortion is controlled by jointly adapting scalable source coding rate and level of forward error correction (FEC protection. A content dependent packetization mechanism with data-interleaving and Reed-Solomon protection for wavelet-based video codecs is proposed to provide unequal error protection. This paper also tries to answer an important question for scalable video streaming systems: given extra bandwidth, should one increase the level of channel protection for the most important packets, or transmit more scalable source data? Experimental results show that the proposed framework achieves good balance between quality of the received video and level of error protection under bandwidth-varying lossy IP networks.
Content-Adaptive Packetization and Streaming of Wavelet Video over IP Networks
Directory of Open Access Journals (Sweden)
Ho Chien-Peng
2007-01-01
Full Text Available This paper presents a framework of content-adaptive packetization scheme for streaming of 3D wavelet-based video content over lossy IP networks. The tradeoff between rate and distortion is controlled by jointly adapting scalable source coding rate and level of forward error correction (FEC protection. A content dependent packetization mechanism with data-interleaving and Reed-Solomon protection for wavelet-based video codecs is proposed to provide unequal error protection. This paper also tries to answer an important question for scalable video streaming systems: given extra bandwidth, should one increase the level of channel protection for the most important packets, or transmit more scalable source data? Experimental results show that the proposed framework achieves good balance between quality of the received video and level of error protection under bandwidth-varying lossy IP networks.
Transcoding-Based Error-Resilient Video Adaptation for 3G Wireless Networks
Eminsoy, Sertac; Dogan, Safak; Kondoz, Ahmet M.
2007-12-01
Transcoding is an effective method to provide video adaptation for heterogeneous internetwork video access and communication environments, which require the tailoring (i.e., repurposing) of coded video properties to channel conditions, terminal capabilities, and user preferences. This paper presents a video transcoding system that is capable of applying a suite of error resilience tools on the input compressed video streams while controlling the output rates to provide robust communications over error-prone and bandwidth-limited 3G wireless networks. The transcoder is also designed to employ a new adaptive intra-refresh algorithm, which is responsive to the detected scene activity inherently embedded into the video content and the reported time-varying channel error conditions of the wireless network. Comprehensive computer simulations demonstrate significant improvements in the received video quality performances using the new transcoding architecture without an extra computational cost.
Boutalis, Yiannis; Kottas, Theodore; Christodoulou, Manolis A
2014-01-01
Presenting current trends in the development and applications of intelligent systems in engineering, this monograph focuses on recent research results in system identification and control. The recurrent neurofuzzy and the fuzzy cognitive network (FCN) models are presented. Both models are suitable for partially-known or unknown complex time-varying systems. Neurofuzzy Adaptive Control contains rigorous proofs of its statements which result in concrete conclusions for the selection of the design parameters of the algorithms presented. The neurofuzzy model combines concepts from fuzzy systems and recurrent high-order neural networks to produce powerful system approximations that are used for adaptive control. The FCN model stems from fuzzy cognitive maps and uses the notion of “concepts” and their causal relationships to capture the behavior of complex systems. The book shows how, with the benefit of proper training algorithms, these models are potent system emulators suitable for use in engineering s...
Adaptive Sliding Mode Control of MEMS Gyroscope Based on Neural Network Approximation
Directory of Open Access Journals (Sweden)
Yuzheng Yang
2014-01-01
Full Text Available An adaptive sliding controller using radial basis function (RBF network to approximate the unknown system dynamics microelectromechanical systems (MEMS gyroscope sensor is proposed. Neural controller is proposed to approximate the unknown system model and sliding controller is employed to eliminate the approximation error and attenuate the model uncertainties and external disturbances. Online neural network (NN weight tuning algorithms, including correction terms, are designed based on Lyapunov stability theory, which can guarantee bounded tracking errors as well as bounded NN weights. The tracking error bound can be made arbitrarily small by increasing a certain feedback gain. Numerical simulation for a MEMS angular velocity sensor is investigated to verify the effectiveness of the proposed adaptive neural control scheme and demonstrate the satisfactory tracking performance and robustness.
Directory of Open Access Journals (Sweden)
Jean-Denis Mathias
2017-03-01
Full Text Available Information and collaboration patterns embedded in social networks play key roles in multilevel and polycentric modes of governance. However, modeling the dynamics of such social networks in multilevel settings has been seldom addressed in the literature. Here we use an adaptive social network model to elaborate the interplay between a central and a local government in order to maintain a polycentric governance. More specifically, our analysis explores in what ways specific policy choices made by a central agent affect the features of an emerging social network composed of local organizations and local users. Using two types of stylized policies, adaptive co-management and adaptive one-level management, we focus on the benefits of multi-level adaptive cooperation for network management. Our analysis uses viability theory to explore and to quantify the ability of these policies to achieve specific network properties. Viability theory gives the family of policies that enables maintaining the polycentric governance unlike optimal control that gives a unique blueprint. We found that the viability of the policies can change dramatically depending on the goals and features of the social network. For some social networks, we also found a very large difference between the viability of the adaptive one-level management and adaptive co-management policies. However, results also show that adaptive co-management doesn’t always provide benefits. Hence, we argue that applying viability theory to governance networks can help policy design by analyzing the trade-off between the costs of adaptive co-management and the benefits associated with its ability to maintain desirable social network properties in a polycentric governance framework.
Directory of Open Access Journals (Sweden)
Ufa Ruslan A.
2015-01-01
Full Text Available The motivation of the presented research is based on the needs for development of new methods and tools for adequate simulation of intelligent electric power systems with active-adaptive electric networks (IES including Flexible Alternating Current Transmission System (FACTS devices. The key requirements for the simulation were formed. The presented analysis of simulation results of IES confirms the need to use a hybrid modelling approach.
Simankov V. S.; Kolodiy A. S.; Kucher V. A.; Trofimov V. M.
2015-01-01
This article describes the results of networks anomalies detection system based on modular adaptive approach practical implementation. The list of specific modules used in the practical implementation of IPS, their architecture, algorithms, software, organizational and technical support determined at technical working design based on the results of the audit, evaluation and risk analysis. In the general list of modules (subsystems) we may include: intrusion detection and prevention (IPS / IDS...
An Energy-Efficient Link with Adaptive Transmit Power Control for Long Range Networks
DEFF Research Database (Denmark)
Blaszczyk, Tomasz; Lynggaard, Per
2016-01-01
— A considerable amount of research is carried out to develop a reliable smart sensor system with high energy efficiency for battery operated wireless IoT devices in the agriculture sector. However, only a limited amount of research has covered automatic transmission power adjustment schemes...... and algorithms which are essential for deployment of wireless IoT nodes. This paper presents an adaptive link algorithm for farm applications with emphasis on power adjustment for long range communication networks....
An Energy-Efficient Link with Adaptive Transmit Power Control for Long Range Networks
DEFF Research Database (Denmark)
Lynggaard, P.; Blaszczyk, Tomasz
2016-01-01
A considerable amount of research is carried out to develop a reliable smart sensor system with high energy efficiency for battery operated wireless IoT devices in the agriculture sector. However, only a limited amount of research has covered automatic transmission power adjustment schemes...... and algorithms which are essential for deployment of wireless IoT nodes. This paper presents an adaptive link algorithm for farm applications with emphasis on power adjustment for long range communication networks....
Diffusion Adaptation Over Clustered Multitask Networks Based on the Affine Projection Algorithm
Gogineni, Vinay Chakravarthi; Chakraborty, Mrityunjoy
2015-01-01
Distributed adaptive networks achieve better estimation performance by exploiting temporal and as well spatial diversity while consuming few resources. Recent works have studied the single task distributed estimation problem, in which the nodes estimate a single optimum parameter vector collaboratively. However, there are many important applications where the multiple vectors have to estimated simultaneously, in a collaborative manner. This paper presents multi-task diffusion strategies based...
TCP-ADaLR: TCP with adaptive delay and loss response for broadband GEO satellite networks
Omueti, Modupe Omogbohun
2007-01-01
Transmission Control Protocol (TCP) performance degrades in broadband geostationary satellite networks due to long propagation delays and high bit error rates. In this thesis, we propose TCP with algorithm modifications for adaptive delay and loss response (TCP-ADaLR) to improve TCP performance. TCP-ADaLR incorporates delayed acknowledgement mechanism recommended for Internet hosts. We evaluate and compare the performance of TCP-ADaLR, TCP SACK, and TCP NewReno, with and without delayed ackno...
Directory of Open Access Journals (Sweden)
Eduard eGrinke
2015-10-01
Full Text Available Walking animals, like insects, with little neural computing can effectively perform complex behaviors. They can walk around their environment, escape from corners/deadlocks, and avoid or climb over obstacles. While performing all these behaviors, they can also adapt their movements to deal with an unknown situation. As a consequence, they successfully navigate through their complex environment. The versatile and adaptive abilities are the result of an integration of several ingredients embedded in their sensorimotor loop. Biological studies reveal that the ingredients include neural dynamics, plasticity, sensory feedback, and biomechanics. Generating such versatile and adaptive behaviors for a walking robot is a challenging task. In this study, we present a bio-inspired approach to solve this task. Specifically, the approach combines neural mechanisms with plasticity, sensory feedback, and biomechanics. The neural mechanisms consist of adaptive neural sensory processing and modular neural locomotion control. The sensory processing is based on a small recurrent network consisting of two fully connected neurons. Online correlation-based learning with synaptic scaling is applied to adequately change the connections of the network. By doing so, we can effectively exploit neural dynamics (i.e., hysteresis effects and single attractors in the network to generate different turning angles with short-term memory for a biomechanical walking robot. The turning information is transmitted as descending steering signals to the locomotion control which translates the signals into motor actions. As a result, the robot can walk around and adapt its turning angle for avoiding obstacles in different situations as well as escaping from sharp corners or deadlocks. Using backbone joint control embedded in the locomotion control allows the robot to climb over small obstacles. Consequently, it can successfully explore and navigate in complex environments.
Fatemeh. Dehghani; Shahram. Darooei
2016-01-01
Network on chip has emerged as a long-term and effective method in Multiprocessor System-on-Chip communications in order to overcome the bottleneck in bus based communication architectures. Efficiency and performance of network on chip is so dependent on the architecture and structure of the network. In this paper a new structure and architecture for adaptive traffic control in network on chip using Code Division Multiple Access technique is presented. To solve the problem of synchronous acce...
Reconfigurable and adaptive photonic networks for high-performance computing systems.
Kodi, Avinash; Louri, Ahmed
2009-08-01
As feature sizes decrease to the submicrometer regime and clock rates increase to the multigigahertz range, the limited bandwidth at higher bit rates and longer communication distances in electrical interconnects will create a major bandwidth imbalance in future high-performance computing (HPC) systems. We explore the application of an optoelectronic interconnect for the design of flexible, high-bandwidth, reconfigurable and adaptive interconnection architectures for chip-to-chip and board-to-board HPC systems. Reconfigurability is realized by interconnecting arrays of optical transmitters, and adaptivity is implemented by a dynamic bandwidth reallocation (DBR) technique that balances the load on each communication channel. We evaluate a DBR technique, the lockstep (LS) protocol, that monitors traffic intensities, reallocates bandwidth, and adapts to changes in communication patterns. We incorporate this DBR technique into a detailed discrete-event network simulator to evaluate the performance for uniform, nonuniform, and permutation communication patterns. Simulation results indicate that, without reconfiguration techniques being applied, optical based system architecture shows better performance than electrical interconnects for uniform and nonuniform patterns; with reconfiguration techniques being applied, the dynamically reconfigurable optoelectronic interconnect provides much better performance for all communication patterns. Based on the performance study, the reconfigured architecture shows 30%-50% increased throughput and 50%-75% reduced network latency compared with HPC electrical networks.
Shao, Haidong; Jiang, Hongkai; Wang, Fuan; Wang, Yanan
2017-07-01
Automatic and accurate identification of rolling bearing fault categories, especially for the fault severities and compound faults, is a challenge in rotating machinery fault diagnosis. For this purpose, a novel method called adaptive deep belief network (DBN) with dual-tree complex wavelet packet (DTCWPT) is developed in this paper. DTCWPT is used to preprocess the vibration signals to refine the fault characteristics information, and an original feature set is designed from each frequency-band signal of DTCWPT. An adaptive DBN is constructed to improve the convergence rate and identification accuracy with multiple stacked adaptive restricted Boltzmann machines (RBMs). The proposed method is applied to the fault diagnosis of rolling bearings. The results confirm that the proposed method is more effective than the existing methods. Copyright © 2017 ISA. Published by Elsevier Ltd. All rights reserved.
Adaptive Neural Network Control for the Trajectory Tracking of the Furuta Pendulum.
Moreno-Valenzuela, Javier; Aguilar-Avelar, Carlos; Puga-Guzman, Sergio A; Santibanez, Victor
2016-12-01
The purpose of this paper is to introduce a novel adaptive neural network-based control scheme for the Furuta pendulum, which is a two degree-of-freedom underactuated system. Adaptation laws for the input and output weights are also provided. The proposed controller is able to guarantee tracking of a reference signal for the arm while the pendulum remains in the upright position. The key aspect of the derivation of the controller is the definition of an output function that depends on the position and velocity errors. The internal and external dynamics are rigorously analyzed, thereby proving the uniform ultimate boundedness of the error trajectories. By using real-time experiments, the new scheme is compared with other control methodologies, therein demonstrating the improved performance of the proposed adaptive algorithm.
Learning from adaptive neural network output feedback control of a unicycle-type mobile robot.
Zeng, Wei; Wang, Qinghui; Liu, Fenglin; Wang, Ying
2016-03-01
This paper studies learning from adaptive neural network (NN) output feedback control of nonholonomic unicycle-type mobile robots. The major difficulties are caused by the unknown robot system dynamics and the unmeasurable states. To overcome these difficulties, a new adaptive control scheme is proposed including designing a new adaptive NN output feedback controller and two high-gain observers. It is shown that the stability of the closed-loop robot system and the convergence of tracking errors are guaranteed. The unknown robot system dynamics can be approximated by radial basis function NNs. When repeating same or similar control tasks, the learned knowledge can be recalled and reused to achieve guaranteed stability and better control performance, thereby avoiding the tremendous repeated training process of NNs. Copyright © 2016 ISA. Published by Elsevier Ltd. All rights reserved.
Adaptive Time Stepping for Transient Network Flow Simulation in Rocket Propulsion Systems
Majumdar, Alok K.; Ravindran, S. S.
2017-01-01
Fluid and thermal transients found in rocket propulsion systems such as propellant feedline system is a complex process involving fast phases followed by slow phases. Therefore their time accurate computation requires use of short time step initially followed by the use of much larger time step. Yet there are instances that involve fast-slow-fast phases. In this paper, we present a feedback control based adaptive time stepping algorithm, and discuss its use in network flow simulation of fluid and thermal transients. The time step is automatically controlled during the simulation by monitoring changes in certain key variables and by feedback. In order to demonstrate the viability of time adaptivity for engineering problems, we applied it to simulate water hammer and cryogenic chill down in pipelines. Our comparison and validation demonstrate the accuracy and efficiency of this adaptive strategy.
Governance for Resilience: CALFED as a Complex Adaptive Network for Resource Management
Directory of Open Access Journals (Sweden)
David E. Booher
2010-09-01
Full Text Available A study of California's water planning and management process, known as CALFED, offers insights into governance strategies that can deal with adaptive management of environmental resources in ways that conventional bureaucratic procedures cannot. CALFED created an informal policy-making system, engaging multiple agencies and stakeholders. The research is built on data from 5 years of field work that included interviews with participants, review of documents, and observation of meetings. We argue that CALFED can be seen as a self-organizing complex adaptive network (CAN in which interactions were generally guided by collaborative heuristics. The case demonstrates several innovative governance practices, including new practices and norms for interactions among the agents, a distributed structure of information and decision making, a nonlinear planning method, self-organizing system behavior, and adaptation. An example of a resulting policy innovation, a method to provide real-time environmental use of water while protecting a reliable supply of water for agricultural and urban interests, is described. We outline how ideas about complex adaptive network governance differ from ideas about traditional governance. These differences result in ongoing tension and turbulence as they do for other self-organizing governance processes that operate in a context of traditional governance.
An adaptive handover prediction scheme for seamless mobility based wireless networks.
Sadiq, Ali Safa; Fisal, Norsheila Binti; Ghafoor, Kayhan Zrar; Lloret, Jaime
2014-01-01
We propose an adaptive handover prediction (AHP) scheme for seamless mobility based wireless networks. That is, the AHP scheme incorporates fuzzy logic with AP prediction process in order to lend cognitive capability to handover decision making. Selection metrics, including received signal strength, mobile node relative direction towards the access points in the vicinity, and access point load, are collected and considered inputs of the fuzzy decision making system in order to select the best preferable AP around WLANs. The obtained handover decision which is based on the calculated quality cost using fuzzy inference system is also based on adaptable coefficients instead of fixed coefficients. In other words, the mean and the standard deviation of the normalized network prediction metrics of fuzzy inference system, which are collected from available WLANs are obtained adaptively. Accordingly, they are applied as statistical information to adjust or adapt the coefficients of membership functions. In addition, we propose an adjustable weight vector concept for input metrics in order to cope with the continuous, unpredictable variation in their membership degrees. Furthermore, handover decisions are performed in each MN independently after knowing RSS, direction toward APs, and AP load. Finally, performance evaluation of the proposed scheme shows its superiority compared with representatives of the prediction approaches.
Lei, Shufei; Iles, Alastair; Kelly, Maggi
2015-07-01
Some of the factors that can contribute to the success of collaborative adaptive management--such as social learning, open communication, and trust--are built upon a foundation of the open exchange of information about science and management between participants and the public. Despite the importance of information transparency, the use and flow of information in collaborative adaptive management has not been characterized in detail in the literature, and currently there exist opportunities to develop strategies for increasing the exchange of information, as well as to track information flow in such contexts. As digital information channels and networks have been increased over the last decade, powerful new information monitoring tools have also been evolved allowing for the complete characterization of information products through their production, transport, use, and monitoring. This study uses these tools to investigate the use of various science and management information products in a case study--the Sierra Nevada Adaptive Management Project--using a mixed method (citation analysis, web analytics, and content analysis) research approach borrowed from the information processing and management field. The results from our case study show that information technologies greatly facilitate the flow and use of digital information, leading to multiparty collaborations such as knowledge transfer and public participation in science research. We conclude with recommendations for expanding information exchange in collaborative adaptive management by taking advantage of available information technologies and networks.
An Adaptive Handover Prediction Scheme for Seamless Mobility Based Wireless Networks
Directory of Open Access Journals (Sweden)
Ali Safa Sadiq
2014-01-01
Full Text Available We propose an adaptive handover prediction (AHP scheme for seamless mobility based wireless networks. That is, the AHP scheme incorporates fuzzy logic with AP prediction process in order to lend cognitive capability to handover decision making. Selection metrics, including received signal strength, mobile node relative direction towards the access points in the vicinity, and access point load, are collected and considered inputs of the fuzzy decision making system in order to select the best preferable AP around WLANs. The obtained handover decision which is based on the calculated quality cost using fuzzy inference system is also based on adaptable coefficients instead of fixed coefficients. In other words, the mean and the standard deviation of the normalized network prediction metrics of fuzzy inference system, which are collected from available WLANs are obtained adaptively. Accordingly, they are applied as statistical information to adjust or adapt the coefficients of membership functions. In addition, we propose an adjustable weight vector concept for input metrics in order to cope with the continuous, unpredictable variation in their membership degrees. Furthermore, handover decisions are performed in each MN independently after knowing RSS, direction toward APs, and AP load. Finally, performance evaluation of the proposed scheme shows its superiority compared with representatives of the prediction approaches.
Self-Adaptive Context Aware Routing Protocol for Unicast Communication in Delay and Tolerant Network
Directory of Open Access Journals (Sweden)
Yunbo Chen
2014-05-01
Full Text Available At present, most of research works in mobile network focus on the network overhead of the known path which exists between the sender and the receiver. However, the trend of the current practical application demands is becoming increasingly distributed and decentralized. The Delay and Tolerant Network (DTN just comes out of such background of the conflicts between them. The DTN could effectively eliminate the gap between the mobile network and the practical application demands. In this paper, a Self-Adaptive Context Aware Routing Protocol (SACARP for the unicast communication in delay and tolerant networks is presented. Meanwhile, according to the real-time context information of DTN, the Kalman filter theory is introduced to predict the information state of mobility for the optional message ferrying node, and then gives the optimal selection strategy of the message ferrying nodes. The simulation experiments have shown that, compared to the familiar single- copy and multi-copy protocols, the SACARP proposed in this paper has better transmission performance and stability, especially when the network is free, the protocol would keep a good performance with fewer connections and less buffer space.
Liu, Huanlin; Xu, Yifan; Chen, Yong; Zhang, Mingjia
2016-09-01
With the development of one point to multiple point applications, network resources become scarcer and wavelength channels become more crowded in optical networks. To improve the bandwidth utilization, the multicast routing algorithm based on network coding can greatly increase the resource utilization, but it is most difficult to maximize the network throughput owing to ignoring the differences between the multicast receiving nodes. For making full use of the destination nodes' receives ability to maximize optical multicast's network throughput, a new optical multicast routing algorithm based on teaching-learning-based optimization (MR-iTLBO) is proposed in the paper. In order to increase the diversity of learning, a self-driven learning method is adopted in MR-iTLBO algorithm, and the mutation operator of genetic algorithm is introduced to prevent the algorithm into a local optimum. For increasing learner's learning efficiency, an adaptive learning factor is designed to adjust the learning process. Moreover, the reconfiguration scheme based on probability vector is devised to expand its global search capability in MR-iTLBO algorithm. The simulation results show that performance in terms of network throughput and convergence rate has been improved significantly with respect to the TLBO and the variant TLBO.
Valdovinos, Fernanda S; Brosi, Berry J; Briggs, Heather M; Moisset de Espanés, Pablo; Ramos-Jiliberto, Rodrigo; Martinez, Neo D
2016-10-01
Much research debates whether properties of ecological networks such as nestedness and connectance stabilise biological communities while ignoring key behavioural aspects of organisms within these networks. Here, we computationally assess how adaptive foraging (AF) behaviour interacts with network architecture to determine the stability of plant-pollinator networks. We find that AF reverses negative effects of nestedness and positive effects of connectance on the stability of the networks by partitioning the niches among species within guilds. This behaviour enables generalist pollinators to preferentially forage on the most specialised of their plant partners which increases the pollination services to specialist plants and cedes the resources of generalist plants to specialist pollinators. We corroborate these behavioural preferences with intensive field observations of bee foraging. Our results show that incorporating key organismal behaviours with well-known biological mechanisms such as consumer-resource interactions into the analysis of ecological networks may greatly improve our understanding of complex ecosystems. © 2016 John Wiley & Sons Ltd/CNRS.
Time-Varying, Multi-Scale Adaptive System Reliability Analysis of Lifeline Infrastructure Networks
Energy Technology Data Exchange (ETDEWEB)
Gearhart, Jared Lee [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States); Kurtz, Nolan Scot [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States)
2014-09-01
The majority of current societal and economic needs world-wide are met by the existing networked, civil infrastructure. Because the cost of managing such infrastructure is high and increases with time, risk-informed decision making is essential for those with management responsibilities for these systems. To address such concerns, a methodology that accounts for new information, deterioration, component models, component importance, group importance, network reliability, hierarchical structure organization, and efficiency concerns has been developed. This methodology analyzes the use of new information through the lens of adaptive Importance Sampling for structural reliability problems. Deterioration, multi-scale bridge models, and time-variant component importance are investigated for a specific network. Furthermore, both bridge and pipeline networks are studied for group and component importance, as well as for hierarchical structures in the context of specific networks. Efficiency is the primary driver throughout this study. With this risk-informed approach, those responsible for management can address deteriorating infrastructure networks in an organized manner.
Capitán, José A; Manrubia, Susanna
2015-12-01
The distribution of human linguistic groups presents a number of interesting and nontrivial patterns. The distributions of the number of speakers per language and the area each group covers follow log-normal distributions, while population and area fulfill an allometric relationship. The topology of networks of spatial contacts between different linguistic groups has been recently characterized, showing atypical properties of the degree distribution and clustering, among others. Human demography, spatial conflicts, and the construction of networks of contacts between linguistic groups are mutually dependent processes. Here we introduce an adaptive network model that takes all of them into account and successfully reproduces, using only four model parameters, not only those features of linguistic groups already described in the literature, but also correlations between demographic and topological properties uncovered in this work. Besides their relevance when modeling and understanding processes related to human biogeography, our adaptive network model admits a number of generalizations that broaden its scope and make it suitable to represent interactions between agents based on population dynamics and competition for space.
Intelligent Broadcasting in Mobile Ad Hoc Networks: Three Classes of Adaptive Protocols
Directory of Open Access Journals (Sweden)
Colagrosso Michael D
2007-01-01
Full Text Available Because adaptability greatly improves the performance of a broadcast protocol, we identify three ways in which machine learning can be applied to broadcasting in a mobile ad hoc network (MANET. We chose broadcasting because it functions as a foundation of MANET communication. Unicast, multicast, and geocast protocols utilize broadcasting as a building block, providing important control and route establishment functionality. Therefore, any improvements to the process of broadcasting can be immediately realized by higher-level MANET functionality and applications. While efficient broadcast protocols have been proposed, no single broadcasting protocol works well in all possible MANET conditions. Furthermore, protocols tend to fail catastrophically in severe network environments. Our three classes of adaptive protocols are pure machine learning, intra-protocol learning, and inter-protocol learning. In the pure machine learning approach, we exhibit a new approach to the design of a broadcast protocol: the decision of whether to rebroadcast a packet is cast as a classification problem. Each mobile node (MN builds a classifier and trains it on data collected from the network environment. Using intra-protocol learning, each MN consults a simple machine model for the optimal value of one of its free parameters. Lastly, in inter-protocol learning, MNs learn to switch between different broadcasting protocols based on network conditions. For each class of learning method, we create a prototypical protocol and examine its performance in simulation.