Coevolution of information processing and topology in hierarchical adaptive random Boolean networks
Górski, Piotr J.; Czaplicka, Agnieszka; Hołyst, Janusz A.
2016-02-01
Random Boolean Networks (RBNs) are frequently used for modeling complex systems driven by information processing, e.g. for gene regulatory networks (GRNs). Here we propose a hierarchical adaptive random Boolean Network (HARBN) as a system consisting of distinct adaptive RBNs (ARBNs) - subnetworks - connected by a set of permanent interlinks. We investigate mean node information, mean edge information as well as mean node degree. Information measures and internal subnetworks topology of HARBN coevolve and reach steady-states that are specific for a given network structure. The main natural feature of ARBNs, i.e. their adaptability, is preserved in HARBNs and they evolve towards critical configurations which is documented by power law distributions of network attractor lengths. The mean information processed by a single node or a single link increases with the number of interlinks added to the system. The mean length of network attractors and the mean steady-state connectivity possess minima for certain specific values of the quotient between the density of interlinks and the density of all links in networks. It means that the modular network displays extremal values of its observables when subnetworks are connected with a density a few times lower than a mean density of all links.
Boolean networks with multiexpressions and parameters.
Zou, Yi Ming
2013-01-01
To model biological systems using networks, it is desirable to allow more than two levels of expression for the nodes and to allow the introduction of parameters. Various modeling and simulation methods addressing these needs using Boolean models, both synchronous and asynchronous, have been proposed in the literature. However, analytical study of these more general Boolean networks models is lagging. This paper aims to develop a concise theory for these different Boolean logic-based modeling methods. Boolean models for networks where each node can have more than two levels of expression and Boolean models with parameters are defined algebraically with examples provided. Certain classes of random asynchronous Boolean networks and deterministic moduli asynchronous Boolean networks are investigated in detail using the setting introduced in this paper. The derived theorems provide a clear picture for the attractor structures of these asynchronous Boolean networks.
Partial stability and stabilisation of Boolean networks
Chen, Hong-Wei; Sun, Liang-Jie; Liu, Yang
2016-07-01
In this paper, we investigate the stability of Boolean networks and the stabilisation of Boolean control networks with respect to part of the system's states. First, an algebraic expression of the Boolean (control) network is derived by the semi-tensor product of matrices. Then, some necessary and sufficient conditions for partial stability of Boolean networks are given. Finally, the stabilisation of Boolean control networks by a free control sequence and a state-feedback control is investigated and the respective necessary and sufficient conditions are obtained. Examples are provided to illustrate the efficiency of the obtained results.
Synchronization of Asynchronous Switched Boolean Network.
Zhang, Hao; Wang, Xingyuan; Lin, Xiaohui
2015-01-01
In this paper, the complete synchronizations for asynchronous switched Boolean network with free Boolean sequence controllers and close-loop controllers are studied. First, the basic asynchronous switched Boolean network model is provided. With the method of semi-tensor product, the Boolean dynamics is translated into linear representation. Second, necessary and sufficient conditions for ASBN synchronization with free Boolean sequence control and close-loop control are derived, respectively. Third, some illustrative examples are provided to show the efficiency of the proposed methods.
Boolean networks with veto functions
Ebadi, Haleh; Klemm, Konstantin
2014-08-01
Boolean networks are discrete dynamical systems for modeling regulation and signaling in living cells. We investigate a particular class of Boolean functions with inhibiting inputs exerting a veto (forced zero) on the output. We give analytical expressions for the sensitivity of these functions and provide evidence for their role in natural systems. In an intracellular signal transduction network [Helikar et al., Proc. Natl. Acad. Sci. USA 105, 1913 (2008), 10.1073/pnas.0705088105], the functions with veto are over-represented by a factor exceeding the over-representation of threshold functions and canalyzing functions in the same system. In Boolean networks for control of the yeast cell cycle [Li et al., Proc. Natl. Acad. Sci. USA 101, 4781 (2004), 10.1073/pnas.0305937101; Davidich et al., PLoS ONE 3, e1672 (2008), 10.1371/journal.pone.0001672], no or minimal changes to the wiring diagrams are necessary to formulate their dynamics in terms of the veto functions introduced here.
Boolean networks as modelling framework
Directory of Open Access Journals (Sweden)
Florian eGreil
2012-08-01
Full Text Available In a network, the components of a given system are represented as nodes, the interactions are abstracted as links between the nodes. Boolean networks refer to a class of dynamics on networks, in fact it is the simplest possible dynamics where each node has a value 0 or 1. This allows to investigate extensively the dynamics both analytically and by numerical experiments. The present article focuses on the theoretical concept of relevant components and the immediate application in plant biology, references for more in-depths treatment of the mathematical details are also given.
Synchronization of Boolean Networks with Different Update Schemes.
Zhang, Hao; Wang, Xingyuan; Lin, Xiaohui
2014-01-01
In this paper, the synchronizations of Boolean networks with different update schemes (synchronized Boolean networks and asynchronous Boolean networks) are investigated. All nodes in Boolean network are represented in terms of semi-tensor product. First, we give the concept of inner synchronization and observe that all nodes in a Boolean network are synchronized with each other. Second, we investigate the outer synchronization between a driving Boolean network and a corresponding response Boolean network. We provide not only the concept of traditional complete synchronization, but also the anti-synchronization and get the anti-synchronization in simulation. Third, we extend the outer synchronization to asynchronous Boolean network and get the complete synchronization between an asynchronous Boolean network and a response Boolean network. Consequently, theorems for synchronization of Boolean networks and asynchronous Boolean networks are derived. Examples are provided to show the correctness of our theorems.
Boolean networks with reliable dynamics
Peixoto, Tiago P
2009-01-01
We investigated the properties of Boolean networks that follow a given reliable trajectory in state space. A reliable trajectory is defined as a sequence of states which is independent of the order in which the nodes are updated. We explored numerically the topology, the update functions, and the state space structure of these networks, which we constructed using a minimum number of links and the simplest update functions. We found that the clustering coefficient is larger than in random networks, and that the probability distribution of three-node motifs is similar to that found in gene regulation networks. Among the update functions, only a subset of all possible functions occur, and they can be classified according to their probability. More homogeneous functions occur more often, leading to a dominance of canalyzing functions. Finally, we studied the entire state space of the networks. We observed that with increasing systems size, fixed points become more dominant, moving the networks close to the frozen...
Delay synchronization of temporal Boolean networks
Wei, Qiang; Xie, Cheng-jun; Liang, Yi; Niu, Yu-jun; Lin, Da
2016-01-01
This paper investigates the delay synchronization between two temporal Boolean networks base on semi-tensor product method, which improve complete synchronization. Necessary and sufficient conditions for delay synchronization are drawn base on algebraic expression of temporal Boolean networks. A example is presented to show the effectiveness of theoretical analysis.
Symmetry in critical random Boolean network dynamics.
Hossein, Shabnam; Reichl, Matthew D; Bassler, Kevin E
2014-04-01
Using Boolean networks as prototypical examples, the role of symmetry in the dynamics of heterogeneous complex systems is explored. We show that symmetry of the dynamics, especially in critical states, is a controlling feature that can be used both to greatly simplify analysis and to characterize different types of dynamics. Symmetry in Boolean networks is found by determining the frequency at which the various Boolean output functions occur. There are classes of functions that consist of Boolean functions that behave similarly. These classes are orbits of the controlling symmetry group. We find that the symmetry that controls the critical random Boolean networks is expressed through the frequency by which output functions are utilized by nodes that remain active on dynamical attractors. This symmetry preserves canalization, a form of network robustness. We compare it to a different symmetry known to control the dynamics of an evolutionary process that allows Boolean networks to organize into a critical state. Our results demonstrate the usefulness and power of using the symmetry of the behavior of the nodes to characterize complex network dynamics, and introduce an alternative approach to the analysis of heterogeneous complex systems.
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.
Forced synchronization of autonomous dynamical Boolean networks.
Rivera-Durón, R R; Campos-Cantón, E; Campos-Cantón, I; Gauthier, Daniel J
2015-08-01
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.
Boolean Networks with Multi-Expressions and Parameters.
Zou, Yi Ming
2013-07-01
To model biological systems using networks, it is desirable to allow more than two levels of expression for the nodes and to allow the introduction of parameters. Various modeling and simulation methods addressing these needs using Boolean models, both synchronous and asynchronous, have been proposed in the literature. However, analytical study of these more general Boolean networks models is lagging. This paper aims to develop a concise theory for these different Boolean logic based modeling methods. Boolean models for networks where each node can have more than two levels of expression and Boolean models with parameters are defined algebraically with examples provided. Certain classes of random asynchronous Boolean networks and deterministic moduli asynchronous Boolean networks are investigated in detail using the setting introduced in this paper. The derived theorems provide a clear picture for the attractor structures of these asynchronous Boolean networks.
Energy and criticality in random Boolean networks
Energy Technology Data Exchange (ETDEWEB)
Andrecut, M. [Institute for Biocomplexity and Informatics, University of Calgary, 2500 University Drive NW, Calgary, Alberta, T2N 1N4 (Canada)], E-mail: mandrecu@ucalgary.ca; Kauffman, S.A. [Institute for Biocomplexity and Informatics, University of Calgary, 2500 University Drive NW, Calgary, Alberta, T2N 1N4 (Canada)
2008-06-30
The central issue of the research on the Random Boolean Networks (RBNs) model is the characterization of the critical transition between ordered and chaotic phases. Here, we discuss an approach based on the 'energy' associated with the unsatisfiability of the Boolean functions in the RBNs model, which provides an upper bound estimation for the energy used in computation. We show that in the ordered phase the RBNs are in a 'dissipative' regime, performing mostly 'downhill' moves on the 'energy' landscape. Also, we show that in the disordered phase the RBNs have to 'hillclimb' on the 'energy' landscape in order to perform computation. The analytical results, obtained using Derrida's approximation method, are in complete agreement with numerical simulations.
Effect of memory in non-Markovian Boolean networks
Ebadi, Haleh; Ausloos, Marcel; Jafari, GholamReza
2016-01-01
One successful model of interacting biological systems is the Boolean network. The dynamics of a Boolean network, controlled with Boolean functions, is usually considered to be a Markovian (memory-less) process. However, both self organizing features of biological phenomena and their intelligent nature should raise some doubt about ignoring the history of their time evolution. Here, we extend the Boolean network Markovian approach: we involve the effect of memory on the dynamics. This can be explored by modifying Boolean functions into non-Markovian functions, for example, by investigating the usual non-Markovian threshold function, - one of the most applied Boolean functions. By applying the non-Markovian threshold function on the dynamical process of a cell cycle network, we discover a power law memory with a more robust dynamics than the Markovian dynamics.
Control of Large-Scale Boolean Networks via Network Aggregation.
Zhao, Yin; Ghosh, Bijoy K; Cheng, Daizhan
2016-07-01
A major challenge to solve problems in control of Boolean networks is that the computational cost increases exponentially when the number of nodes in the network increases. We consider the problem of controllability and stabilizability of Boolean control networks, address the increasing cost problem by partitioning the network graph into several subnetworks, and analyze the subnetworks separately. Easily verifiable necessary conditions for controllability and stabilizability are proposed for a general aggregation structure. For acyclic aggregation, we develop a sufficient condition for stabilizability. It dramatically reduces the computational complexity if the number of nodes in each block of the acyclic aggregation is small enough compared with the number of nodes in the entire Boolean network.
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
ON REDUCED SCALAR EQUATIONS FOR SYNCHRONOUS BOOLEAN NETWORKS
Ali Muhammad Ali Rushdi; Adnan Ahmad Alsogati
2013-01-01
A total description of a synchronous Boolean network is typically achieved by a matrix recurrence relation. A simpler alternative is to use a scalar equation which is a possibly nonlinear equation that involves two or more instances of a single scalar variable and some Boolean operator(s). Further simplification is possible in terms of a linear reduced scalar equation which is the simplest two-term scalar equation that includes no Boolean operators and equates the value of a scalar variable a...
Intervention in Context-Sensitive Probabilistic Boolean Networks Revisited
Directory of Open Access Journals (Sweden)
Babak Faryabi
2009-01-01
Full Text Available An approximate representation for the state space of a context-sensitive probabilistic Boolean network has previously been proposed and utilized to devise therapeutic intervention strategies. Whereas the full state of a context-sensitive probabilistic Boolean network is specified by an ordered pair composed of a network context and a gene-activity profile, this approximate representation collapses the state space onto the gene-activity profiles alone. This reduction yields an approximate transition probability matrix, absent of context, for the Markov chain associated with the context-sensitive probabilistic Boolean network. As with many approximation methods, a price must be paid for using a reduced model representation, namely, some loss of optimality relative to using the full state space. This paper examines the effects on intervention performance caused by the reduction with respect to various values of the model parameters. This task is performed using a new derivation for the transition probability matrix of the context-sensitive probabilistic Boolean network. This expression of transition probability distributions is in concert with the original definition of context-sensitive probabilistic Boolean network. The performance of optimal and approximate therapeutic strategies is compared for both synthetic networks and a real case study. It is observed that the approximate representation describes the dynamics of the context-sensitive probabilistic Boolean network through the instantaneously random probabilistic Boolean network with similar parameters.
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.
Supercriticality for Annealed Approximations of Boolean Networks
Mountford, Thomas
2010-01-01
We consider a model proposed by Derrida and Pomeau (1986) and recently studied by Chatterjee and Durrett (2009); it is defined as an approximation to S. Kauffman's boolean networks (1969). The model starts with the choice of a random directed graph on $n$ vertices; each node has $r$ input nodes pointing at it. A discrete time threshold contact process is then considered on this graph: at each instant, each site has probability $q$ of choosing to receive input; if it does, and if at least one of its inputs were occupied by a $1$ at the previous instant, then it is labeled with a $1$; in all other cases, it is labeled with a $0$. $r$ and $q$ are kept fixed and $n$ is taken to infinity. Improving a result of Chatterjee and Durrett, we show that if $qr > 1$, then the time of persistence of the dynamics is exponential in $n$.
Perturbation propagation in random and evolved Boolean networks
Energy Technology Data Exchange (ETDEWEB)
Fretter, Christoph [Instistut fuer Informatik, Martin-Luther-Universitaet Halle-Wittenberg, Von-Seckendorffplatz 1, 06120 Halle (Germany); Szejka, Agnes; Drossel, Barbara [Institut fuer Festkoerperphysik, Technische Universitaet Darmstadt, Hochschulstrasse 6, 64289 Darmstadt (Germany)], E-mail: Christoph.Fretter@informatik.uni-halle.de
2009-03-15
In this paper, we investigate the propagation of perturbations in Boolean networks by evaluating the Derrida plot and its modifications. We show that even small random Boolean networks agree well with the predictions of the annealed approximation, but nonrandom networks show a very different behaviour. We focus on networks that were evolved for high dynamical robustness. The most important conclusion is that the simple distinction between frozen, critical and chaotic networks is no longer useful, since such evolved networks can display the properties of all three types of networks. Furthermore, we evaluate a simplified empirical network and show how its specific state space properties are reflected in the modified Derrida plots.
Control of random Boolean networks via average sensitivity of Boolean functions
Institute of Scientific and Technical Information of China (English)
Chen Shi-Jian; Hong Yi-Guang
2011-01-01
In this paper, we discuss how to transform the disordered phase into an ordered phase in random Boolean networks. To increase the effectiveness, a control scheme is proposed, which periodically freezes a fraction of the network based on the average sensitivity of Boolean functions of the nodes. Theoretical analysis is carried out to estimate the expected critical value of the fraction, and shows that the critical value is reduced using this scheme compared to that of randomly freezing a fraction of the nodes. Finally, the simulation is given for illustrating the effectiveness of the proposed method.
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.
Enhancing Boolean networks with fuzzy operators and edge tuning
Poret, Arnaud; Monteiro Sousa, Claudio; Boissel, Jean-Pierre
2014-01-01
Quantitative modeling in systems biology can be difficult due to the scarcity of quantitative details about biological phenomenons, especially at the subcellular scale. An alternative to escape this difficulty is qualitative modeling since it requires few to no quantitative information. Among the qualitative modeling approaches, the Boolean network formalism is one of the most popular. However, Boolean models allow variables to be valued at only true or false, which can appear too simplistic ...
IMS Algorithm for Learning Representations in Boolean Neural Networks
Biswas, Nripendra N; Murthy, TVMK; Chandrasekhar, M.
1991-01-01
A new algorithm for learning representations in Boolean neural networks, where the inputs and outputs are binary bits, is presented. The algorithm has become feasible because of a newly discovered theorem which states that any non-linearly separable Boolean function can be expressed as a convergent series of linearly separable functions connected by the logical OR (+) and the logical INHIBIT (-) operators. The formation of the series is carried out by many important properties exhibited by th...
The Influence of Canalization on the Robustness of Boolean Networks
Kadelka, Claus; Laubenbacher, Reinhard
2016-01-01
Time- and state-discrete dynamical systems are frequently used to model molecular networks. This paper provides a collection of mathematical and computational tools for the study of robustness in Boolean network models. The focus is on networks governed by $k$-canalizing functions, a recently introduced class of Boolean functions that contains the well-studied class of nested canalizing functions. The activities and sensitivity of a function quantify the impact of input changes on the function output. This paper generalizes the latter concept to $c$-sensitivity and provides formulas for the activities and $c$-sensitivity of general $k$-canalizing functions as well as canalizing functions with more precisely defined structure. A popular measure for the robustness of a network, the Derrida value, can be expressed as a weighted sum of the $c$-sensitivities of the governing canalizing functions, and can also be calculated for a stochastic extension of Boolean networks. These findings provide a computationally eff...
Stability of biological networks as represented in Random Boolean Nets.
Energy Technology Data Exchange (ETDEWEB)
Slepoy, Alexander; Thompson, Marshall
2004-09-01
We explore stability of Random Boolean Networks as a model of biological interaction networks. We introduce surface-to-volume ratio as a measure of stability of the network. Surface is defined as the set of states within a basin of attraction that maps outside the basin by a bit-flip operation. Volume is defined as the total number of states in the basin. We report development of an object-oriented Boolean network analysis code (Attract) to investigate the structure of stable vs. unstable networks. We find two distinct types of stable networks. The first type is the nearly trivial stable network with a few basins of attraction. The second type contains many basins. We conclude that second type stable networks are extremely rare.
Learning restricted Boolean network model by time-series data.
Ouyang, Hongjia; Fang, Jie; Shen, Liangzhong; Dougherty, Edward R; Liu, Wenbin
2014-01-01
Restricted Boolean networks are simplified Boolean networks that are required for either negative or positive regulations between genes. Higa et al. (BMC Proc 5:S5, 2011) proposed a three-rule algorithm to infer a restricted Boolean network from time-series data. However, the algorithm suffers from a major drawback, namely, it is very sensitive to noise. In this paper, we systematically analyze the regulatory relationships between genes based on the state switch of the target gene and propose an algorithm with which restricted Boolean networks may be inferred from time-series data. We compare the proposed algorithm with the three-rule algorithm and the best-fit algorithm based on both synthetic networks and a well-studied budding yeast cell cycle network. The performance of the algorithms is evaluated by three distance metrics: the normalized-edge Hamming distance [Formula: see text], the normalized Hamming distance of state transition [Formula: see text], and the steady-state distribution distance μ (ssd). Results show that the proposed algorithm outperforms the others according to both [Formula: see text] and [Formula: see text], whereas its performance according to μ (ssd) is intermediate between best-fit and the three-rule algorithms. Thus, our new algorithm is more appropriate for inferring interactions between genes from time-series data.
Tracking perturbations in Boolean networks with spectral methods.
Kesseli, Juha; Rämö, Pauli; Yli-Harja, Olli
2005-08-01
In this paper we present a method for predicting the spread of perturbations in Boolean networks. The method is applicable to networks that have no regular topology. The prediction of perturbations can be performed easily by using a presented result which enables the efficient computation of the required iterative formulas. This result is based on abstract Fourier transform of the functions in the network. In this paper the method is applied to show the spread of perturbations in networks containing a distribution of functions found from biological data. The advances in the study of the spread of perturbations can directly be applied to enable ways of quantifying chaos in Boolean networks. Derrida plots over an arbitrary number of time steps can be computed and thus distributions of functions compared with each other with respect to the amount of order they create in random networks. PMID:16196674
Binary higher order neural networks for realizing Boolean functions.
Zhang, Chao; Yang, Jie; Wu, Wei
2011-05-01
In order to more efficiently realize Boolean functions by using neural networks, we propose a binary product-unit neural network (BPUNN) and a binary π-ς neural network (BPSNN). The network weights can be determined by one-step training. It is shown that the addition " σ," the multiplication " π," and two kinds of special weighting operations in BPUNN and BPSNN can implement the logical operators " ∨," " ∧," and " ¬" on Boolean algebra 〈Z(2),∨,∧,¬,0,1〉 (Z(2)={0,1}), respectively. The proposed two neural networks enjoy the following advantages over the existing networks: 1) for a complete truth table of N variables with both truth and false assignments, the corresponding Boolean function can be realized by accordingly choosing a BPUNN or a BPSNN such that at most 2(N-1) hidden nodes are needed, while O(2(N)), precisely 2(N) or at most 2(N), hidden nodes are needed by existing networks; 2) a new network BPUPS based on a collaboration of BPUNN and BPSNN can be defined to deal with incomplete truth tables, while the existing networks can only deal with complete truth tables; and 3) the values of the weights are all simply -1 or 1, while the weights of all the existing networks are real numbers. Supporting numerical experiments are provided as well. Finally, we present the risk bounds of BPUNN, BPSNN, and BPUPS, and then analyze their probably approximately correct learnability. PMID:21427020
ON REDUCED SCALAR EQUATIONS FOR SYNCHRONOUS BOOLEAN NETWORKS
Directory of Open Access Journals (Sweden)
Ali Muhammad Ali Rushdi
2013-01-01
Full Text Available A total description of a synchronous Boolean network is typically achieved by a matrix recurrence relation. A simpler alternative is to use a scalar equation which is a possibly nonlinear equation that involves two or more instances of a single scalar variable and some Boolean operator(s. Further simplification is possible in terms of a linear reduced scalar equation which is the simplest two-term scalar equation that includes no Boolean operators and equates the value of a scalar variable at a latter instance t2 to its value at an earlier instance t1. This equation remains valid when the times t1 and t2 are both augmented by any integral multiple of the underlying time period. In other words, there are infinitely many versions of a reduced scalar equation, any of which is useful for deducing information about the cyclic behavior of the network. However, to obtain correct information about the transient behavior of the network, one must find the true reduced scalar equation for which instances t1 and t2 are minimal. This study investigates the nature, derivation and utilization of reduced scalar equations. It relies on Boolean-algebraic manipulations for the derivation of such equations and suggests that this derivation can be facilitated by seeking certain orthogonality relations among certain successive (albeit not necessarily consecutive instances of the same scalar variable. We demonstrate, contrary to previously published assumptions or assertions, that there is typically no common reduced scalar equation for all the scalar variables. Each variable usually satisfies its own distinct reduced scalar equation. We also demonstrate that the derivation of a reduced scalar equation is achieved not only by proving it but also by disproving an immediately preceding version of it when such a version might exist. We also demonstrate that, despite the useful insight supplied by the reduced scalar equations, they do not provide a total solution like the
Feedback Controller Design for the Synchronization of Boolean Control Networks.
Liu, Yang; Sun, Liangjie; Lu, Jianquan; Liang, Jinling
2016-09-01
This brief investigates the partial and complete synchronization of two Boolean control networks (BCNs). Necessary and sufficient conditions for partial and complete synchronization are established by the algebraic representations of logical dynamics. An algorithm is obtained to construct the feedback controller that guarantees the synchronization of master and slave BCNs. Two biological examples are provided to illustrate the effectiveness of the obtained results.
Optimal Computation of Symmetric Boolean Functions in Collocated Networks
Kowshik, Hemant
2011-01-01
We consider collocated wireless sensor networks, where each node has a Boolean measurement and the goal is to compute a given Boolean function of these measurements. We first consider the worst case setting and study optimal block computation strategies for computing symmetric Boolean functions. We study three classes of functions: threshold functions, delta functions and interval functions. We provide exactly optimal strategies for the first two classes, and a scaling law order-optimal strategy with optimal preconstant for interval functions. We also extend the results to the case of integer measurements and certain integer-valued functions. We use lower bounds from communication complexity theory, and provide an achievable scheme using information theoretic tools. Next, we consider the case where nodes measurements are random and drawn from independent Bernoulli distributions. We address the problem of optimal function computation so as to minimize the expected total number of bits that are transmitted. In ...
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. PMID:27464825
Boolean network representation of contagion dynamics during a financial crisis
Caetano, Marco Antonio Leonel; Yoneyama, Takashi
2015-01-01
This work presents a network model for representation of the evolution of certain patterns of economic behavior. More specifically, after representing the agents as points in a space in which each dimension associated to a relevant economic variable, their relative "motions" that can be either stationary or discordant, are coded into a boolean network. Patterns with stationary averages indicate the maintenance of status quo, whereas discordant patterns represent aggregation of new agent into the cluster or departure from the former policies. The changing patterns can be embedded into a network representation, particularly using the concept of autocatalytic boolean networks. As a case study, the economic tendencies of the BRIC countries + Argentina were studied. Although Argentina is not included in the cluster formed by BRIC countries, it tends to follow the BRIC members because of strong commercial ties.
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.
Controllability and observability of Boolean networks arising from biology.
Li, Rui; Yang, Meng; Chu, Tianguang
2015-02-01
Boolean networks are currently receiving considerable attention as a computational scheme for system level analysis and modeling of biological systems. Studying control-related problems in Boolean networks may reveal new insights into the intrinsic control in complex biological systems and enable us to develop strategies for manipulating biological systems using exogenous inputs. This paper considers controllability and observability of Boolean biological networks. We propose a new approach, which draws from the rich theory of symbolic computation, to solve the problems. Consequently, simple necessary and sufficient conditions for reachability, controllability, and observability are obtained, and algorithmic tests for controllability and observability which are based on the Gröbner basis method are presented. As practical applications, we apply the proposed approach to several different biological systems, namely, the mammalian cell-cycle network, the T-cell activation network, the large granular lymphocyte survival signaling network, and the Drosophila segment polarity network, gaining novel insights into the control and/or monitoring of the specific biological systems.
Controllability and observability of Boolean networks arising from biology
Li, Rui; Yang, Meng; Chu, Tianguang
2015-02-01
Boolean networks are currently receiving considerable attention as a computational scheme for system level analysis and modeling of biological systems. Studying control-related problems in Boolean networks may reveal new insights into the intrinsic control in complex biological systems and enable us to develop strategies for manipulating biological systems using exogenous inputs. This paper considers controllability and observability of Boolean biological networks. We propose a new approach, which draws from the rich theory of symbolic computation, to solve the problems. Consequently, simple necessary and sufficient conditions for reachability, controllability, and observability are obtained, and algorithmic tests for controllability and observability which are based on the Gröbner basis method are presented. As practical applications, we apply the proposed approach to several different biological systems, namely, the mammalian cell-cycle network, the T-cell activation network, the large granular lymphocyte survival signaling network, and the Drosophila segment polarity network, gaining novel insights into the control and/or monitoring of the specific biological systems.
An efficient approach of attractor calculation for large-scale Boolean gene regulatory networks.
He, Qinbin; Xia, Zhile; Lin, Bin
2016-11-01
Boolean network models provide an efficient way for studying gene regulatory networks. The main dynamics of a Boolean network is determined by its attractors. Attractor calculation plays a key role for analyzing Boolean gene regulatory networks. An approach of attractor calculation was proposed in this study, which improved the predecessor-based approach. Furthermore, the proposed approach combined with the identification of constant nodes and simplified Boolean networks to accelerate attractor calculation. The proposed algorithm is effective to calculate all attractors for large-scale Boolean gene regulatory networks. If the average degree of the network is not too large, the algorithm can get all attractors of a Boolean network with dozens or even hundreds of nodes.
Inference of asynchronous Boolean network from biological pathways.
Das, Haimabati; Layek, Ritwik Kumar
2015-01-01
Gene regulation is a complex process with multiple levels of interactions. In order to describe this complex dynamical system with tractable parameterization, the choice of the dynamical system model is of paramount importance. The right abstraction of the modeling scheme can reduce the complexity in the inference and intervention design, both computationally and experimentally. This article proposes an asynchronous Boolean network framework to capture the transcriptional regulation as well as the protein-protein interactions in a genetic regulatory system. The inference of asynchronous Boolean network from biological pathways information and experimental evidence are explained using an algorithm. The suitability of this paradigm for the variability of several reaction rates is also discussed. This methodology and model selection open up new research challenges in understanding gene-protein interactive system in a coherent way and can be beneficial for designing effective therapeutic intervention strategy.
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.
An Evaluation of Methods for Inferring Boolean Networks from Time-Series Data.
Berestovsky, Natalie; Nakhleh, Luay
2013-01-01
Regulatory networks play a central role in cellular behavior and decision making. Learning these regulatory networks is a major task in biology, and devising computational methods and mathematical models for this task is a major endeavor in bioinformatics. Boolean networks have been used extensively for modeling regulatory networks. In this model, the state of each gene can be either 'on' or 'off' and that next-state of a gene is updated, synchronously or asynchronously, according to a Boolean rule that is applied to the current-state of the entire system. Inferring a Boolean network from a set of experimental data entails two main steps: first, the experimental time-series data are discretized into Boolean trajectories, and then, a Boolean network is learned from these Boolean trajectories. In this paper, we consider three methods for data discretization, including a new one we propose, and three methods for learning Boolean networks, and study the performance of all possible nine combinations on four regulatory systems of varying dynamics complexities. We find that employing the right combination of methods for data discretization and network learning results in Boolean networks that capture the dynamics well and provide predictive power. Our findings are in contrast to a recent survey that placed Boolean networks on the low end of the "faithfulness to biological reality" and "ability to model dynamics" spectra. Further, contrary to the common argument in favor of Boolean networks, we find that a relatively large number of time points in the time-series data is required to learn good Boolean networks for certain data sets. Last but not least, while methods have been proposed for inferring Boolean networks, as discussed above, missing still are publicly available implementations thereof. Here, we make our implementation of the methods available publicly in open source at http://bioinfo.cs.rice.edu/.
Self-organized networks of competing boolean agents
Paczuski; Bassler; Corral
2000-04-01
A model of Boolean agents competing in a market is presented where each agent bases his action on information obtained from a small group of other agents. The agents play a competitive game that rewards those in the minority. After a long time interval, the poorest player's strategy is changed randomly, and the process is repeated. Eventually the network evolves to a stationary but intermittent state where random mutation of the worst strategy can change the behavior of the entire network, often causing a switch in the dynamics between attractors of vastly different lengths. PMID:11019043
Additive functions in boolean models of gene regulatory network modules.
Darabos, Christian; Di Cunto, Ferdinando; Tomassini, Marco; Moore, Jason H; Provero, Paolo; Giacobini, Mario
2011-01-01
Gene-on-gene regulations are key components of every living organism. Dynamical abstract models of genetic regulatory networks help explain the genome's evolvability and robustness. These properties can be attributed to the structural topology of the graph formed by genes, as vertices, and regulatory interactions, as edges. Moreover, the actual gene interaction of each gene is believed to play a key role in the stability of the structure. With advances in biology, some effort was deployed to develop update functions in boolean models that include recent knowledge. We combine real-life gene interaction networks with novel update functions in a boolean model. We use two sub-networks of biological organisms, the yeast cell-cycle and the mouse embryonic stem cell, as topological support for our system. On these structures, we substitute the original random update functions by a novel threshold-based dynamic function in which the promoting and repressing effect of each interaction is considered. We use a third real-life regulatory network, along with its inferred boolean update functions to validate the proposed update function. Results of this validation hint to increased biological plausibility of the threshold-based function. To investigate the dynamical behavior of this new model, we visualized the phase transition between order and chaos into the critical regime using Derrida plots. We complement the qualitative nature of Derrida plots with an alternative measure, the criticality distance, that also allows to discriminate between regimes in a quantitative way. Simulation on both real-life genetic regulatory networks show that there exists a set of parameters that allows the systems to operate in the critical region. This new model includes experimentally derived biological information and recent discoveries, which makes it potentially useful to guide experimental research. The update function confers additional realism to the model, while reducing the complexity
Evolution of a designless nanoparticle network into reconfigurable Boolean logic
Bose, S. K.; Lawrence, C. P.; Liu, Z.; Makarenko, K. S.; van Damme, R. M. J.; Broersma, H. J.; van der Wiel, W. G.
2015-12-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 the other hand, are based on circuits of functional units that follow given design rules. Hence, potentially exploitable physical processes, such as capacitive crosstalk, to solve a problem are left out. Until now, designless nanoscale networks of inanimate matter that exhibit robust computational functionality had not been realized. Here we artificially evolve the electrical properties of a disordered nanomaterials system (by optimizing the values of control voltages using a genetic algorithm) to perform computational tasks reconfigurably. We exploit the rich behaviour that emerges from interconnected metal nanoparticles, which act as strongly nonlinear single-electron transistors, and find that this nanoscale architecture can be configured in situ into any Boolean logic gate. This universal, reconfigurable gate would require about ten transistors in a conventional circuit. Our system meets the criteria for the physical realization of (cellular) neural networks: universality (arbitrary Boolean functions), compactness, robustness and evolvability, which implies scalability to perform more advanced tasks. Our evolutionary approach works around device-to-device variations and the accompanying uncertainties in performance. Moreover, it bears a great potential for more energy-efficient computation, and for solving problems that are very hard to tackle in conventional architectures.
Harmonic Analysis of Boolean Networks: Determinative Power and Perturbations
Heckel, Reinhard; Bossert, Martin
2011-01-01
Consider a large Boolean network with a feed forward structure. Given a probability distribution for the inputs, can one find-possibly small-collections of input nodes that determine the states of most other nodes in the network? To identify these nodes, a notion that quantifies the determinative power of an input over states in the network is needed. We argue that the mutual information (MI) between a subset of the inputs X = {X_1, ..., X_n} of node i and the function f_i(X)$ associated with node i quantifies the determinative power of this subset of inputs over node i. To study the relation of determinative power to sensitivity to perturbations, we relate the MI to measures of perturbations, such as the influence of a variable, in terms of inequalities. The result shows that, maybe surprisingly, an input that has large influence does not necessarily have large determinative power. The main tool for the analysis is Fourier analysis of Boolean functions. Whether a function is sensitive to perturbations or not...
Evolution of a designless nanoparticle network into reconfigurable Boolean logic.
Bose, S K; Lawrence, C P; Liu, Z; Makarenko, K S; van Damme, R M J; Broersma, H J; van der Wiel, W G
2015-12-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 the other hand, are based on circuits of functional units that follow given design rules. Hence, potentially exploitable physical processes, such as capacitive crosstalk, to solve a problem are left out. Until now, designless nanoscale networks of inanimate matter that exhibit robust computational functionality had not been realized. Here we artificially evolve the electrical properties of a disordered nanomaterials system (by optimizing the values of control voltages using a genetic algorithm) to perform computational tasks reconfigurably. We exploit the rich behaviour that emerges from interconnected metal nanoparticles, which act as strongly nonlinear single-electron transistors, and find that this nanoscale architecture can be configured in situ into any Boolean logic gate. This universal, reconfigurable gate would require about ten transistors in a conventional circuit. Our system meets the criteria for the physical realization of (cellular) neural networks: universality (arbitrary Boolean functions), compactness, robustness and evolvability, which implies scalability to perform more advanced tasks. Our evolutionary approach works around device-to-device variations and the accompanying uncertainties in performance. Moreover, it bears a great potential for more energy-efficient computation, and for solving problems that are very hard to tackle in conventional architectures. PMID:26389658
Evolution and Controllability of Cancer Networks: A Boolean Perspective.
Srihari, Sriganesh; Raman, Venkatesh; Leong, Hon Wai; Ragan, Mark A
2014-01-01
Cancer forms a robust system capable of maintaining stable functioning (cell sustenance and proliferation) despite perturbations. Cancer progresses as stages over time typically with increasing aggressiveness and worsening prognosis. Characterizing these stages and identifying the genes driving transitions between them is critical to understand cancer progression and to develop effective anti-cancer therapies. In this work, we propose a novel model for the `cancer system' as a Boolean state space in which a Boolean network, built from protein-interaction and gene-expression data from different stages of cancer, transits between Boolean satisfiability states by "editing" interactions and "flipping" genes. Edits reflect rewiring of the PPI network while flipping of genes reflect activation or silencing of genes between stages. We formulate a minimization problem min flip to identify these genes driving the transitions. The application of our model (called BoolSpace) on three case studies-pancreatic and breast tumours in human and post spinal-cord injury (SCI) in rats-reveals valuable insights into the phenomenon of cancer progression: (i) interactions involved in core cell-cycle and DNA-damage repair pathways are significantly rewired in tumours, indicating significant impact to key genome-stabilizing mechanisms; (ii) several of the genes flipped are serine/threonine kinases which act as biological switches, reflecting cellular switching mechanisms between stages; and (iii) different sets of genes are flipped during the initial and final stages indicating a pattern to tumour progression. Based on these results, we hypothesize that robustness of cancer partly stems from "passing of the baton" between genes at different stages-genes from different biological processes and/or cellular components are involved in different stages of tumour progression thereby allowing tumour cells to evade targeted therapy, and therefore an effective therapy should target a "cover set" of
Stability depends on positive autoregulation in Boolean gene regulatory networks.
Directory of Open Access Journals (Sweden)
Ricardo Pinho
2014-11-01
Full Text Available Network motifs have been identified as building blocks of regulatory networks, including gene regulatory networks (GRNs. The most basic motif, autoregulation, has been associated with bistability (when positive and with homeostasis and robustness to noise (when negative, but its general importance in network behavior is poorly understood. Moreover, how specific autoregulatory motifs are selected during evolution and how this relates to robustness is largely unknown. Here, we used a class of GRN models, Boolean networks, to investigate the relationship between autoregulation and network stability and robustness under various conditions. We ran evolutionary simulation experiments for different models of selection, including mutation and recombination. Each generation simulated the development of a population of organisms modeled by GRNs. We found that stability and robustness positively correlate with autoregulation; in all investigated scenarios, stable networks had mostly positive autoregulation. Assuming biological networks correspond to stable networks, these results suggest that biological networks should often be dominated by positive autoregulatory loops. This seems to be the case for most studied eukaryotic transcription factor networks, including those in yeast, flies and mammals.
Synchronization Analysis of Master-Slave Probabilistic Boolean Networks.
Lu, Jianquan; Zhong, Jie; Li, Lulu; Ho, Daniel W C; Cao, Jinde
2015-01-01
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.
An optimal control approach to probabilistic Boolean networks
Liu, Qiuli
2012-12-01
External control of some genes in a genetic regulatory network is useful for avoiding undesirable states associated with some diseases. For this purpose, a number of stochastic optimal control approaches have been proposed. Probabilistic Boolean networks (PBNs) as powerful tools for modeling gene regulatory systems have attracted considerable attention in systems biology. In this paper, we deal with a problem of optimal intervention in a PBN with the help of the theory of discrete time Markov decision process. Specifically, we first formulate a control model for a PBN as a first passage model for discrete time Markov decision processes and then find, using a value iteration algorithm, optimal effective treatments with the minimal expected first passage time over the space of all possible treatments. In order to demonstrate the feasibility of our approach, an example is also displayed.
The role of certain Post classes in Boolean network models of genetic networks.
Shmulevich, Ilya; Lähdesmäki, Harri; Dougherty, Edward R; Astola, Jaakko; Zhang, Wei
2003-09-16
A topic of great interest and debate concerns the source of order and remarkable robustness observed in genetic regulatory networks. The study of the generic properties of Boolean networks has proven to be useful for gaining insight into such phenomena. The main focus, as regards ordered behavior in networks, has been on canalizing functions, internal homogeneity or bias, and network connectivity. Here we examine the role that certain classes of Boolean functions that are closed under composition play in the emergence of order in Boolean networks. The closure property implies that any gene at any number of steps in the future is guaranteed to be governed by a function from the same class. By means of Derrida curves on random Boolean networks and percolation simulations on square lattices, we demonstrate that networks constructed from functions belonging to these classes have a tendency toward ordered behavior. Thus they are not overly sensitive to initial conditions, and damage does not readily spread throughout the network. In addition, the considered classes are significantly larger than the class of canalizing functions as the connectivity increases. The functions in these classes exhibit the same kind of preference toward biased functions as do canalizing functions, meaning that functions from this class are likely to be biased. Finally, functions from this class have a natural way of ensuring robustness against noise and perturbations, thus representing plausible evolutionarily selected candidates for regulatory rules in genetic networks. PMID:12963822
Sampled-Data State Feedback Stabilization of Boolean Control Networks.
Liu, Yang; Cao, Jinde; Sun, Liangjie; Lu, Jianquan
2016-04-01
In this letter, we investigate the sampled-data state feedback control (SDSFC) problem of Boolean control networks (BCNs). Some necessary and sufficient conditions are obtained for the global stabilization of BCNs by SDSFC. Different from conventional state feedback controls, new phenomena observed the study of SDSFC. Based on the controllability matrix, we derive some necessary and sufficient conditions under which the trajectories of BCNs can be stabilized to a fixed point by piecewise constant control (PCC). It is proved that the global stabilization of BCNs under SDSFC is equivalent to that by PCC. Moreover, algorithms are given to construct the sampled-data state feedback controllers. Numerical examples are given to illustrate the efficiency of the obtained results.
Feedback control design for the complete synchronisation of two coupled Boolean networks
Li, Fangfei
2016-09-01
In the literatures, to design state feedback controllers to make the response Boolean network synchronise with the drive Boolean network is rarely considered. Motivated by this, feedback control design for the complete synchronisation of two coupled Boolean networks is investigated in this paper. A necessary condition for the existence of a state feedback controller achieving the complete synchronisation is established first. Then, based on the necessary condition, the feedback control law is proposed. Finally, an example is worked out to illustrate the proposed design procedure.
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.
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. PMID:21778527
An attractor-based complexity measurement for Boolean recurrent neural networks.
Directory of Open Access Journals (Sweden)
Jérémie Cabessa
Full Text Available 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.
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.
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
Characterizing short-term stability for Boolean networks over any distribution of transfer functions
Seshadhri, C.; Smith, Andrew M.; Vorobeychik, Yevgeniy; Mayo, Jackson R.; Armstrong, Robert C.
2016-07-01
We present a characterization of short-term stability of Kauffman's N K (random) Boolean networks under arbitrary distributions of transfer functions. Given such a Boolean network where each transfer function is drawn from the same distribution, we present a formula that determines whether short-term chaos (damage spreading) will happen. Our main technical tool which enables the formal proof of this formula is the Fourier analysis of Boolean functions, which describes such functions as multilinear polynomials over the inputs. Numerical simulations on mixtures of threshold functions and nested canalyzing functions demonstrate the formula's correctness.
Optimal computation of symmetric Boolean functions in Tree networks
Kowshik, Hemant
2010-01-01
In this paper, we address the scenario where nodes with sensor data are connected in a tree network, and every node wants to compute a given symmetric Boolean function of the sensor data. We first consider the problem of computing a function of two nodes with integer measurements. We allow for block computation to enhance data fusion efficiency, and determine the minimum worst-case total number of bits to be exchanged to perform the desired computation. We establish lower bounds using fooling sets, and provide a novel scheme which attains the lower bounds, using information theoretic tools. For a class of functions called sum-threshold functions, this scheme is shown to be optimal. We then turn to tree networks and derive a lower bound for the number of bits exchanged on each link by viewing it as a two node problem. We show that the protocol of recursive innetwork aggregation achieves this lower bound in the case of sumthreshold functions. Thus we have provided a communication and in-network computation stra...
SAT-based Distributed Reactive Control Protocol Synthesis for Boolean Networks
Sahin, Yunus Emre; Ozay, Necmiye
2016-01-01
This paper considers the synthesis of distributed reactive control protocols for a Boolean network in a distributed manner. We start with a directed acyclic graph representing a network of Boolean subsystems and a global contract, given as an assumption-guarantee pair. Assumption captures the environment behavior, and guarantee is the requirements to be satisfied by the system. Local assumption-guarantee contracts, together with local control protocols ensuring these local contracts, are comp...
Feedback control and output feedback control for the stabilisation of switched Boolean networks
Li, Fangfei; Yu, Zhaoxu
2016-02-01
This paper presents the feedback control and output feedback control for the stabilisation of switched Boolean network. A necessary condition for the existence of a state feedback controller for the stabilisation of switched Boolean networks under arbitrary switching signal is derived first, and constructive procedures for feedback control and output feedback control design are provided. An example is introduced to show the effectiveness of this paper.
Propagation of external regulation and asynchronous dynamics in random Boolean networks
Mahmoudi, Hamed; Pagnani, Andrea; Weigt, Martin; Zecchina, Riccardo
2007-01-01
Boolean Networks and their dynamics are of great interest as abstract modeling schemes in various disciplines, ranging from biology to computer science. Whereas parallel update schemes have been studied extensively in past years, the level of understanding of asynchronous updates schemes is still very poor. In this paper we study the propagation of external information given by regulatory input variables into a random Boolean network. We compute both analytically and numerically the time evol...
Dynamical modeling of the cholesterol regulatory pathway with Boolean networks
Directory of Open Access Journals (Sweden)
Corcos Laurent
2008-11-01
Full Text Available Abstract Background Qualitative dynamics of small gene regulatory networks have been studied in quite some details both with synchronous and asynchronous analysis. However, both methods have their drawbacks: synchronous analysis leads to spurious attractors and asynchronous analysis lacks computational efficiency, which is a problem to simulate large networks. We addressed this question through the analysis of a major biosynthesis pathway. Indeed the cholesterol synthesis pathway plays a pivotal role in dislypidemia and, ultimately, in cancer through intermediates such as mevalonate, farnesyl pyrophosphate and geranyl geranyl pyrophosphate, but no dynamic model of this pathway has been proposed until now. Results We set up a computational framework to dynamically analyze large biological networks. This framework associates a classical and computationally efficient synchronous Boolean analysis with a newly introduced method based on Markov chains, which identifies spurious cycles among the results of the synchronous simulation. Based on this method, we present here the results of the analysis of the cholesterol biosynthesis pathway and its physiological regulation by the Sterol Response Element Binding Proteins (SREBPs, as well as the modeling of the action of statins, inhibitor drugs, on this pathway. The in silico experiments show the blockade of the cholesterol endogenous synthesis by statins and its regulation by SREPBs, in full agreement with the known biochemical features of the pathway. Conclusion We believe that the method described here to identify spurious cycles opens new routes to compute large and biologically relevant models, thanks to the computational efficiency of synchronous simulation. Furthermore, to the best of our knowledge, we present here the first dynamic systems biology model of the human cholesterol pathway and several of its key regulatory control elements, hoping it would provide a good basis to perform in silico
Guo, Wensheng; Yang, Guowu; Wu, Wei; He, Lei; Sun, Mingyu
2014-01-01
In biological systems, the dynamic analysis method has gained increasing attention in the past decade. The Boolean network is the most common model of a genetic regulatory network. The interactions of activation and inhibition in the genetic regulatory network are modeled as a set of functions of the Boolean network, while the state transitions in the Boolean network reflect the dynamic property of a genetic regulatory network. A difficult problem for state transition analysis is the finding of attractors. In this paper, we modeled the genetic regulatory network as a Boolean network and proposed a solving algorithm to tackle the attractor finding problem. In the proposed algorithm, we partitioned the Boolean network into several blocks consisting of the strongly connected components according to their gradients, and defined the connection between blocks as decision node. Based on the solutions calculated on the decision nodes and using a satisfiability solving algorithm, we identified the attractors in the state transition graph of each block. The proposed algorithm is benchmarked on a variety of genetic regulatory networks. Compared with existing algorithms, it achieved similar performance on small test cases, and outperformed it on larger and more complex ones, which happens to be the trend of the modern genetic regulatory network. Furthermore, while the existing satisfiability-based algorithms cannot be parallelized due to their inherent algorithm design, the proposed algorithm exhibits a good scalability on parallel computing architectures.
Directory of Open Access Journals (Sweden)
Wensheng Guo
Full Text Available In biological systems, the dynamic analysis method has gained increasing attention in the past decade. The Boolean network is the most common model of a genetic regulatory network. The interactions of activation and inhibition in the genetic regulatory network are modeled as a set of functions of the Boolean network, while the state transitions in the Boolean network reflect the dynamic property of a genetic regulatory network. A difficult problem for state transition analysis is the finding of attractors. In this paper, we modeled the genetic regulatory network as a Boolean network and proposed a solving algorithm to tackle the attractor finding problem. In the proposed algorithm, we partitioned the Boolean network into several blocks consisting of the strongly connected components according to their gradients, and defined the connection between blocks as decision node. Based on the solutions calculated on the decision nodes and using a satisfiability solving algorithm, we identified the attractors in the state transition graph of each block. The proposed algorithm is benchmarked on a variety of genetic regulatory networks. Compared with existing algorithms, it achieved similar performance on small test cases, and outperformed it on larger and more complex ones, which happens to be the trend of the modern genetic regulatory network. Furthermore, while the existing satisfiability-based algorithms cannot be parallelized due to their inherent algorithm design, the proposed algorithm exhibits a good scalability on parallel computing architectures.
Decisional Processes with Boolean Neural Network: the Emergence of Mental Schemes
Barnabei, Graziano; Conversano, Ciro; Lensi, Elena
2010-01-01
Human decisional processes result from the employment of selected quantities of relevant information, generally synthesized from environmental incoming data and stored memories. Their main goal is the production of an appropriate and adaptive response to a cognitive or behavioral task. Different strategies of response production can be adopted, among which haphazard trials, formation of mental schemes and heuristics. In this paper, we propose a model of Boolean neural network that incorporates these strategies by recurring to global optimization strategies during the learning session. The model characterizes as well the passage from an unstructured/chaotic attractor neural network typical of data-driven processes to a faster one, forward-only and representative of schema-driven processes. Moreover, a simplified version of the Iowa Gambling Task (IGT) is introduced in order to test the model. Our results match with experimental data and point out some relevant knowledge coming from psychological domain.
On the robustness of NK-Kauffman networks against changes in their connections and Boolean functions
Zertuche, Federico
2009-04-01
NK-Kauffman networks LKN are a subset of the Boolean functions on N Boolean variables to themselves, ΛN={ξ :Z2N→Z2N}. To each NK-Kauffman network it is possible to assign a unique Boolean function on N variables through the function Ψ :LKN→ΛN. The probability PK that Ψ(f )=Ψ(f'), when f' is obtained through f by a change in one of its K-Boolean functions (bK:Z2K→Z2), and/or connections, is calculated. The leading term of the asymptotic expansion of PK, for N ≫1, turns out to depend on the probability to extract the tautology and contradiction Boolean functions, and in the average value of the distribution of probability of the Boolean functions, the other terms decay as O(1/N). In order to accomplish this, a classification of the Boolean functions in terms of what I have called their irreducible degree of connectivity is established. The mathematical findings are discussed in the biological context, where Ψ is used to model the genotype-phenotype map.
Polynomial-Time Algorithm for Controllability Test of a Class of Boolean Biological Networks
Directory of Open Access Journals (Sweden)
Koichi Kobayashi
2010-01-01
Full Text Available In recent years, Boolean-network-model-based approaches to dynamical analysis of complex biological networks such as gene regulatory networks have been extensively studied. One of the fundamental problems in control theory of such networks is the problem of determining whether a given substance quantity can be arbitrarily controlled by operating the other substance quantities, which we call the controllability problem. This paper proposes a polynomial-time algorithm for solving this problem. Although the algorithm is based on a sufficient condition for controllability, it is easily computable for a wider class of large-scale biological networks compared with the existing approaches. A key to this success in our approach is to give up computing Boolean operations in a rigorous way and to exploit an adjacency matrix of a directed graph induced by a Boolean network. By applying the proposed approach to a neurotransmitter signaling pathway, it is shown that it is effective.
Relative stability of network states in Boolean network models of gene regulation in development.
Zhou, Joseph Xu; Samal, Areejit; d'Hérouël, Aymeric Fouquier; Price, Nathan D; Huang, Sui
2016-01-01
Progress in cell type reprogramming has revived the interest in Waddington's concept of the epigenetic landscape. Recently researchers developed the quasi-potential theory to represent the Waddington's landscape. The Quasi-potential U(x), derived from interactions in the gene regulatory network (GRN) of a cell, quantifies the relative stability of network states, which determine the effort required for state transitions in a multi-stable dynamical system. However, quasi-potential landscapes, originally developed for continuous systems, are not suitable for discrete-valued networks which are important tools to study complex systems. In this paper, we provide a framework to quantify the landscape for discrete Boolean networks (BNs). We apply our framework to study pancreas cell differentiation where an ensemble of BN models is considered based on the structure of a minimal GRN for pancreas development. We impose biologically motivated structural constraints (corresponding to specific type of Boolean functions) and dynamical constraints (corresponding to stable attractor states) to limit the space of BN models for pancreas development. In addition, we enforce a novel functional constraint corresponding to the relative ordering of attractor states in BN models to restrict the space of BN models to the biological relevant class. We find that BNs with canalyzing/sign-compatible Boolean functions best capture the dynamics of pancreas cell differentiation. This framework can also determine the genes' influence on cell state transitions, and thus can facilitate the rational design of cell reprogramming protocols.
ILP/SMT-Based Method for Design of Boolean Networks Based on Singleton Attractors.
Kobayashi, Koichi; Hiraishi, Kunihiko
2014-01-01
Attractors in gene regulatory networks represent cell types or states of cells. In system biology and synthetic biology, it is important to generate gene regulatory networks with desired attractors. In this paper, we focus on a singleton attractor, which is also called a fixed point. Using a Boolean network (BN) model, we consider the problem of finding Boolean functions such that the system has desired singleton attractors and has no undesired singleton attractors. To solve this problem, we propose a matrix-based representation of BNs. Using this representation, the problem of finding Boolean functions can be rewritten as an Integer Linear Programming (ILP) problem and a Satisfiability Modulo Theories (SMT) problem. Furthermore, the effectiveness of the proposed method is shown by a numerical example on a WNT5A network, which is related to melanoma. The proposed method provides us a basic method for design of gene regulatory networks.
Grieb, Melanie; Burkovski, Andre; Sträng, J Eric; Kraus, Johann M; Groß, Alexander; Palm, Günther; Kühl, Michael; Kestler, Hans A
2015-01-01
Gene interactions in cells can be represented by gene regulatory networks. A Boolean network models gene interactions according to rules where gene expression is represented by binary values (on / off or {1, 0}). In reality, however, the gene's state can have multiple values due to biological properties. Furthermore, the noisy nature of the experimental design results in uncertainty about a state of the gene. Here we present a new Boolean network paradigm to allow intermediate values on the interval [0, 1]. As in the Boolean network, fixed points or attractors of such a model correspond to biological phenotypes or states. We use our new extension of the Boolean network paradigm to model gene expression in first and second heart field lineages which are cardiac progenitor cell populations involved in early vertebrate heart development. By this we are able to predict additional biological phenotypes that the Boolean model alone is not able to identify without utilizing additional biological knowledge. The additional phenotypes predicted by the model were confirmed by published biological experiments. Furthermore, the new method predicts gene expression propensities for modelled but yet to be analyzed genes.
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.
Poret, Arnaud; Boissel, Jean-Pierre
2014-12-01
Target identification aims at identifying biomolecules whose function should be therapeutically altered to cure the considered pathology. An algorithm for in silico target identification using Boolean network attractors is proposed. It assumes that attractors correspond to phenotypes produced by the modeled biological network. It identifies target combinations which allow disturbed networks to avoid attractors associated with pathological phenotypes. The algorithm is tested on a Boolean model of the mammalian cell cycle and its applications are illustrated on a Boolean model of Fanconi anemia. Results show that the algorithm returns target combinations able to remove attractors associated with pathological phenotypes and then succeeds in performing the proposed in silico target identification. However, as with any in silico evidence, there is a bridge to cross between theory and practice. Nevertheless, it is expected that the algorithm is of interest for target identification.
Chaos Control in Random Boolean Networks by Reducing Mean Damage Percolation Rate
Institute of Scientific and Technical Information of China (English)
JIANG Nan; CHEN Shi-Jian
2011-01-01
Chaos control in random Boolean networks is implemented by freezing part of the network to drive it from chaotic to ordered phase. However, controlled nodes are only viewed as passive blocks to prevent perturbation spread. We propose a new control method in which controlled nodes can exert an active impact on the network.Controlled nodes and frozen values are deliberately selected according to the information of connection and Boolean functions. Simulation results showy that the number of nodes needed to achieve control is largely reduced compared to the previous method. Theoretical analysis is also given to estimate the least fraction of nodes needed to achieve control.%Chaos control in random Boolean networks is implemented by freezing part of the network to drive it from chaotic to ordered phase.However, controlled nodes are only viewed as passive blocks to prevent perturbation spread.We propose a new control method in which controlled nodes can exert an active impact on the network.Controlled nodes and frozen values are deliberately selected according to the information of connection and Boolean functions.Simulation results show that the number of nodes needed to achieve control is largely reduced compared to the previous method.Theoretical analysis is also given to estimate the least fraction of nodes needed to achieve control
Mapping Complex Networks: Exploring Boolean Modeling of Signal Transduction Pathways
Bhardwaj, Gaurav; Wells, Christine P.; Albert, Reka; van Rossum, Damian B.; Patterson, Randen L
2009-01-01
In this study, we explored the utility of a descriptive and predictive bionetwork model for phospholipase C-coupled calcium signaling pathways, built with non-kinetic experimental information. Boolean models generated from these data yield oscillatory activity patterns for both the endoplasmic reticulum resident inositol-1,4,5-trisphosphate receptor (IP3R) and the plasma-membrane resident canonical transient receptor potential channel 3 (TRPC3). These results are specific as randomization of ...
Directory of Open Access Journals (Sweden)
Frolova A. O.
2012-06-01
Full Text Available Reverse engineering of gene regulatory networks is an intensively studied topic in Systems Biology as it reconstructs regulatory interactions between all genes in the genome in the most complete form. The extreme computational complexity of this problem and lack of thorough reviews on reconstruction methods of gene regulatory network is a significant obstacle to further development of this area. In this article the two most common methods for modeling gene regulatory networks are surveyed: Boolean and Bayesian networks. The mathematical description of each method is given, as well as several algorithmic approaches to modeling gene networks using these methods; the complexity of algorithms and the problems that arise during its implementation are also noted.
Influence of a Structure on System's Dynamics on Example of Boolean Networks
Kirillova, O.
1999-01-01
In this work we study the Boolean Networks of different geometric shape and lattice organization. It was revealed that no only a spatial shape but also type of lattice are very important for definition of the structure-dynamics relation. The regular structures do not give a critical regime in the investigated cases. Hierarchy together with the irregular structure reveals characteristic features of criticality.
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.
Directory of Open Access Journals (Sweden)
Mehreen Saeed
Full Text Available 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.
From Boolean Network Model to Continuous Model Helps in Design of Functional Circuits
Bin Shao; Xiang Liu; Dongliang Zhang; Jiayi Wu; Qi Ouyang
2015-01-01
Computational circuit design with desired functions in a living cell is a challenging task in synthetic biology. To achieve this task, numerous methods that either focus on small scale networks or use evolutionary algorithms have been developed. Here, we propose a two-step approach to facilitate the design of functional circuits. In the first step, the search space of possible topologies for target functions is reduced by reverse engineering using a Boolean network model. In the second step, ...
Dahlhaus, Meike; Burkovski, Andre; Hertwig, Falk; Mussel, Christoph; Volland, Ruth; Fischer, Matthias; Debatin, Klaus-Michael; Kestler, Hans A; Beltinger, Christian
2016-02-01
Aurora Kinase A (AURKA) is often overexpressed in neuroblastoma (NB) with poor outcome. The causes of AURKA overexpression in NB are unknown. Here, we describe a gene regulatory network consisting of core regulators of AURKA protein expression and activation during mitosis to identify potential causes. This network was transformed to a dynamic Boolean model. Simulated activation of the serine/threonine protein kinase Greatwall (GWL, encoded by MASTL) that attenuates the pivotal AURKA inhibitor PP2A, predicted stabilization of AURKA. Consistent with this notion, gene set enrichment analysis showed enrichment of mitotic spindle assembly genes and MYCN target genes in NB with high GWL/MASTL expression. In line with the prediction of GWL/MASTL enhancing AURKA, elevated expression of GWL/MASTL was associated with NB risk factors and poor survival of patients. These results establish Boolean network modeling of oncogenic pathways in NB as a useful means for guided discovery in this enigmatic cancer.
Stabilizing Motifs in Autonomous Boolean Networks and the Yeast Cell Cycle Oscillator
Sevim, Volkan; Gong, Xinwei; Socolar, Joshua
2009-03-01
Synchronously updated Boolean networks are widely used to model gene regulation. Some properties of these model networks are known to be artifacts of the clocking in the update scheme. Autonomous updating is a less artificial scheme that allows one to introduce small timing perturbations and study stability of the attractors. We argue that the stabilization of a limit cycle in an autonomous Boolean network requires a combination of motifs such as feed-forward loops and auto-repressive links that can correct small fluctuations in the timing of switching events. A recently published model of the transcriptional cell-cycle oscillator in yeast contains the motifs necessary for stability under autonomous updating [1]. [1] D. A. Orlando, et al. Nature (London), 4530 (7197):0 944--947, 2008.
Exploring phospholipase C-coupled Ca(2+) signalling networks using Boolean modelling.
Bhardwaj, G; Wells, C P; Albert, R; van Rossum, D B; Patterson, R L
2011-05-01
In this study, the authors explored the utility of a descriptive and predictive bionetwork model for phospholipase C-coupled calcium signalling pathways, built with non-kinetic experimental information. Boolean models generated from these data yield oscillatory activity patterns for both the endoplasmic reticulum resident inositol-1,4,5-trisphosphate receptor (IP(3)R) and the plasma-membrane resident canonical transient receptor potential channel 3 (TRPC3). These results are specific as randomisation of the Boolean operators ablates oscillatory pattern formation. Furthermore, knock-out simulations of the IP(3)R, TRPC3 and multiple other proteins recapitulate experimentally derived results. The potential of this approach can be observed by its ability to predict previously undescribed cellular phenotypes using in vitro experimental data. Indeed, our cellular analysis of the developmental and calcium-regulatory protein, DANGER1a, confirms the counter-intuitive predictions from our Boolean models in two highly relevant cellular models. Based on these results, the authors theorise that with sufficient legacy knowledge and/or computational biology predictions, Boolean networks can provide a robust method for predictive modelling of any biological system. [Includes supplementary material]. PMID:21639591
Detecting small attractors of large Boolean networks by function-reduction-based strategy.
Zheng, Qiben; Shen, Liangzhong; Shang, Xuequn; Liu, Wenbin
2016-04-01
Boolean networks (BNs) are widely used to model gene regulatory networks and to design therapeutic intervention strategies to affect the long-term behaviour of systems. A central aim of Boolean-network analysis is to find attractors that correspond to various cellular states, such as cell types or the stage of cell differentiation. This problem is NP-hard and various algorithms have been used to tackle it with considerable success. The idea is that a singleton attractor corresponds to n consistent subsequences in the truth table. To find these subsequences, the authors gradually reduce the entire truth table of Boolean functions by extending a partial gene activity profile (GAP). Not only does this process delete inconsistent subsequences in truth tables, it also directly determines values for some nodes not extended, which means it can abandon the partial GAPs that cannot lead to an attractor as early as possible. The results of simulation show that the proposed algorithm can detect small attractors with length p = 4 in BNs of up to 200 nodes with average indegree K = 2.
Directory of Open Access Journals (Sweden)
Wei Lu
Full Text Available 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."
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-01-01
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.
Random Boolean Networks and Attractors of their Intersecting Circuits
Demongeot, Jacques; Elena, Adrien; Noual, Mathilde; Sené, Sylvain
2011-01-01
International audience The multi-scale strategy in studying biological regulatory networks analysis is based on two level of analysis. The first level is structural and consists in examining the architecture of the interaction graph underlying the network and the second level is functional and analyse the regulatory properties of the network. We apply this dual approach to the "immunetworks" involved in the control of the immune system. As a result, we show that the small number of attract...
Dynamical modeling of the cholesterol regulatory pathway with Boolean networks
Corcos Laurent; Kervizic Gwenael
2008-01-01
Abstract Background Qualitative dynamics of small gene regulatory networks have been studied in quite some details both with synchronous and asynchronous analysis. However, both methods have their drawbacks: synchronous analysis leads to spurious attractors and asynchronous analysis lacks computational efficiency, which is a problem to simulate large networks. We addressed this question through the analysis of a major biosynthesis pathway. Indeed the cholesterol synthesis pathway plays a pivo...
Stötzel, Claudia; Röblitz, Susanna; Siebert, Heike
2015-01-01
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.
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.
HSP70 mediates survival in apoptotic cells-Boolean network prediction and experimental validation.
Vasaikar, Suhas V; Ghosh, Sourish; Narain, Priyam; Basu, Anirban; Gomes, James
2015-01-01
Neuronal stress or injury results in the activation of proteins, which regulate the balance between survival and apoptosis. However, the complex mechanism of cell signaling involving cell death and survival, activated in response to cellular stress is not yet completely understood. To bring more clarity about these mechanisms, a Boolean network was constructed that represented the apoptotic pathway in neuronal cells. FasL and neurotrophic growth factor (NGF) were considered as inputs in the absence and presence of heat shock proteins known to shift the balance toward survival by rescuing pro-apoptotic cells. The probabilities of survival, DNA repair and apoptosis as cellular fates, in the presence of either the growth factor or FasL, revealed a survival bias encoded in the network. Boolean predictions tested by measuring the mRNA level of caspase-3, caspase-8, and BAX in neuronal Neuro2a (N2a) cell line with NGF and FasL as external input, showed positive correlation with the observed experimental results for survival and apoptotic states. It was observed that HSP70 contributed more toward rescuing cells from apoptosis in comparison to HSP27, HSP40, and HSP90. Overexpression of HSP70 in N2a transfected cells showed reversal of cellular fate from FasL-induced apoptosis to survival. Further, the pro-survival role of the proteins BCL2, IAP, cFLIP, and NFκB determined by vertex perturbation analysis was experimentally validated through protein inhibition experiments using EM20-25, Embelin and Wedelolactone, which resulted in 1.27-, 1.26-, and 1.46-fold increase in apoptosis of N2a cells. The existence of a one-to-one correspondence between cellular fates and attractor states shows that Boolean networks may be employed with confidence in qualitative analytical studies of biological networks.
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.
Evolution of a designless nanoparticle network into reconfigurable Boolean logic
Bose, S.K.; Lawrence, C.P.; Liu, Z.; Makarenko, K.S.; Damme, van R.M.J.; Broersma, H.J.; Wiel, van der W.G.
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 th
Damage spreading in spatial and small-world random boolean networks
Energy Technology Data Exchange (ETDEWEB)
Lu, Qiming [Los Alamos National Laboratory; Teuscher, Christof [Los Alamos National Laboratory
2008-01-01
Random Boolean Networks (RBNs) are often used as generic models for certain dynamics of complex systems, ranging from social networks, neural networks, to gene or protein interaction networks. Traditionally, RBNs are interconnected randomly and without considering any spatial arrangement of the links and nodes. However, most real-world networks are spatially extended and arranged with regular, small-world, or other non-random connections. Here we explore the RBN network topology between extreme local connections, random small-world, and random networks, and study the damage spreading with small perturbations. We find that spatially local connections change the scaling of the relevant component at very low connectivities ({bar K} << 1) and that the critical connectivity of stability K{sub s} changes compared to random networks. At higher {bar K}, this scaling remains unchanged. We also show that the relevant component of spatially local networks scales with a power-law as the system size N increases, but with a different exponent for local and small-world networks. The scaling behaviors are obtained by finite-size scaling. We further investigate the wiring cost of the networks. From an engineering perspective, our new findings provide the key trade-offs between damage spreading (robustness), the network wiring cost, and the network's communication characteristics.
The receptor mosaic hypothesis of the engram: possible relevance of Boolean network modeling.
Zoli, M; Guidolin, D; Fuxe, K; Agnati, L F
1996-09-01
In the past 15 years, several lines of evidence have shown that receptors for chemical signals can interact in domains of the plasma membrane and possibly form molecular circuits encoding logical operators. In this frame, the receptor mosaic hypothesis of the engram was advanced. According to this proposal, aggregates of different receptor species (mosaics) may form in neuronal membranes (typically synapses) and constitute a memory trace (engram) of its activity. In the present paper, we present an attempt to model the functioning of aggregates of interacting receptors in membrane domains by means of random Boolean networks. PMID:8968825
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.
Super-transient scaling in time-delay autonomous Boolean network motifs
D'Huys, Otti; Lohmann, Johannes; Haynes, Nicholas D.; Gauthier, Daniel J.
2016-09-01
Autonomous Boolean networks are commonly used to model the dynamics of gene regulatory networks and allow for the prediction of stable dynamical attractors. However, most models do not account for time delays along the network links and noise, which are crucial features of real biological systems. Concentrating on two paradigmatic motifs, the toggle switch and the repressilator, we develop an experimental testbed that explicitly includes both inter-node time delays and noise using digital logic elements on field-programmable gate arrays. We observe transients that last millions to billions of characteristic time scales and scale exponentially with the amount of time delays between nodes, a phenomenon known as super-transient scaling. We develop a hybrid model that includes time delays along network links and allows for stochastic variation in the delays. Using this model, we explain the observed super-transient scaling of both motifs and recreate the experimentally measured transient distributions.
Computing smallest intervention strategies for multiple metabolic networks in a boolean model.
Lu, Wei; Tamura, Takeyuki; Song, Jiangning; Akutsu, Tatsuya
2015-02-01
This article considers the problem whereby, given two metabolic networks N1 and N2, a set of source compounds, and a set of target compounds, we must find the minimum set of reactions whose removal (knockout) ensures that the target compounds are not producible in N1 but are producible in N2. Similar studies exist for the problem of finding the minimum knockout with the smallest side effect for a single network. However, if technologies of external perturbations are advanced in the near future, it may be important to develop methods of computing the minimum knockout for multiple networks (MKMN). Flux balance analysis (FBA) is efficient if a well-polished model is available. However, that is not always the case. Therefore, in this article, we study MKMN in Boolean models and an elementary mode (EM)-based model. Integer linear programming (ILP)-based methods are developed for these models, since MKMN is NP-complete for both the Boolean model and the EM-based model. Computer experiments are conducted with metabolic networks of clostridium perfringens SM101 and bifidobacterium longum DJO10A, respectively known as bad bacteria and good bacteria for the human intestine. The results show that larger networks are more likely to have MKMN solutions. However, solving for these larger networks takes a very long time, and often the computation cannot be completed. This is reasonable, because small networks do not have many alternative pathways, making it difficult to satisfy the MKMN condition, whereas in large networks the number of candidate solutions explodes. Our developed software minFvskO is available online.
Diffusion Adaptation over Networks
Sayed, Ali H
2012-01-01
Adaptive networks are well-suited to perform decentralized information processing and optimization tasks and to model various types of self organized and complex behavior encountered in nature. Adaptive networks consist of a collection of agents with processing and learning abilities. The agents are linked together through a connection topology, and they cooperate with each other through local interactions to solve distributed inference problems in real-time. The continuous diffusion of information across the network enables agents to adapt their performance in relation to changing data and network conditions; it also results in improved adaptation and learning performance relative to non-cooperative networks. This article provides an overview of diffusion strategies for adaptation and learning over networks. The article is divided into several sections: 1. Motivation; 2. Mean-Square-Error Estimation; 3. Distributed Optimization via Diffusion Strategies; 4. Adaptive Diffusion Strategies; 5. Performance of Ste...
Trinh, Hung-Cuong; Kwon, Yung-Keun
2015-11-01
Efficiently identifying functionally important genes in order to understand the minimal requirements of normal cellular development is challenging. To this end, a variety of structural measures have been proposed and their effectiveness has been investigated in recent literature; however, few studies have shown the effectiveness of dynamics-based measures. This led us to investigate a dynamic measure to identify functionally important genes, and the effectiveness of which was verified through application on two large-scale human signaling networks. We specifically consider Boolean sensitivity-based dynamics against an update-rule perturbation (BSU) as a dynamic measure. Through investigations on two large-scale human signaling networks, we found that genes with relatively high BSU values show slower evolutionary rate and higher proportions of essential genes and drug targets than other genes. Gene-ontology analysis showed clear differences between the former and latter groups of genes. Furthermore, we compare the identification accuracies of essential genes and drug targets via BSU and five well-known structural measures. Although BSU did not always show the best performance, it effectively identified the putative set of genes, which is significantly different from the results obtained via the structural measures. Most interestingly, BSU showed the highest synergy effect in identifying the functionally important genes in conjunction with other measures. Our results imply that Boolean-sensitive dynamics can be used as a measure to effectively identify functionally important genes in signaling networks.
高阶布尔网络的结构%Structure of higher order Boolean networks*
Institute of Scientific and Technical Information of China (English)
李志强; 赵寅; 程代展
2011-01-01
The higher order Boolean (control) network is introduced and its topological structure is studied.Using semi-tensor product of matrices,its dynamics is converted into two algebraic forms,which are standard discrete-time dynamic systems.The one-to-one correspondence of the network dynamics and its first algebraic form is proved,and certain topological structures,including fixed points,cycles,and transient time,of higher order Boolean (control) networks are revealed.The relationship between the original system and its second algebraic form is also studied.%介绍高阶布尔（控制）网络,并研究了其拓扑结构.以矩阵的半张量积作为工具,把高阶布尔网络的动态过程转化为2种标准离散事件动态系统的代数形式.证明了高阶布尔网络和第1代数形式的一一对应关系,并由此得到其拓扑结构（不动点、极限圈以及暂态期等）.还研究了高阶布尔网络系统与它第2代数形式的关系.
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.
Chaudhuri, Arijit
2014-01-01
Combining the two statistical techniques of network sampling and adaptive sampling, this book illustrates the advantages of using them in tandem to effectively capture sparsely located elements in unknown pockets. It shows how network sampling is a reliable guide in capturing inaccessible entities through linked auxiliaries. The text also explores how adaptive sampling is strengthened in information content through subsidiary sampling with devices to mitigate unmanageable expanding sample sizes. Empirical data illustrates the applicability of both methods.
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.
Adaptive network countermeasures.
Energy Technology Data Exchange (ETDEWEB)
McClelland-Bane, Randy; Van Randwyk, Jamie A.; Carathimas, Anthony G.; Thomas, Eric D.
2003-10-01
This report describes the results of a two-year LDRD funded by the Differentiating Technologies investment area. The project investigated the use of countermeasures in protecting computer networks as well as how current countermeasures could be changed in order to adapt with both evolving networks and evolving attackers. The work involved collaboration between Sandia employees and students in the Sandia - California Center for Cyber Defenders (CCD) program. We include an explanation of the need for adaptive countermeasures, a description of the architecture we designed to provide adaptive countermeasures, and evaluations of the system.
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
Albert, Réka; Thakar, Juilee
2014-01-01
The biomolecules inside or near cells form a complex interacting system. Cellular phenotypes and behaviors arise from the totality of interactions among the components of this system. A fruitful way of modeling interacting biomolecular systems is by network-based dynamic models that characterize each component by a state variable, and describe the change in the state variables due to the interactions in the system. Dynamic models can capture the stable state patterns of this interacting system and can connect them to different cell fates or behaviors. A Boolean or logic model characterizes each biomolecule by a binary state variable that relates the abundance of that molecule to a threshold abundance necessary for downstream processes. The regulation of this state variable is described in a parameter free manner, making Boolean modeling a practical choice for systems whose kinetic parameters have not been determined. Boolean models integrate the body of knowledge regarding the components and interactions of biomolecular systems, and capture the system's dynamic repertoire, for example the existence of multiple cell fates. These models were used for a variety of systems and led to important insights and predictions. Boolean models serve as an efficient exploratory model, a guide for follow-up experiments, and as a foundation for more quantitative models.
Detecting a Singleton Attractor in a Boolean Network Utilizing SAT Algorithms
Tamura, Takeyuki; Akutsu, Tatsuya
The Boolean network (BN) is a mathematical model of genetic networks. It is known that detecting a singleton attractor, which is also called a fixed point, is NP-hard even for AND/OR BNs (i.e., BNs consisting of AND/OR nodes), where singleton attractors correspond to steady states. Though a naive algorithm can detect a singleton attractor for an AND/OR BN in O(n 2n) time, no O((2-ε)n) (ε > 0) time algorithm was known even for an AND/OR BN with non-restricted indegree, where n is the number of nodes in a BN. In this paper, we present an O(1.787n) time algorithm for detecting a singleton attractor of a given AND/OR BN, along with related results. We also show that detection of a singleton attractor in a BN with maximum indegree two is NP-hard and can be polynomially reduced to a satisfiability problem.
Computational complexity of Boolean functions
Korshunov, Aleksei D.
2012-02-01
Boolean functions are among the fundamental objects of discrete mathematics, especially in those of its subdisciplines which fall under mathematical logic and mathematical cybernetics. The language of Boolean functions is convenient for describing the operation of many discrete systems such as contact networks, Boolean circuits, branching programs, and some others. An important parameter of discrete systems of this kind is their complexity. This characteristic has been actively investigated starting from Shannon's works. There is a large body of scientific literature presenting many fundamental results. The purpose of this survey is to give an account of the main results over the last sixty years related to the complexity of computation (realization) of Boolean functions by contact networks, Boolean circuits, and Boolean circuits without branching. Bibliography: 165 titles.
Dependency in Cooperative Boolean Games
Sauro, Luigi; van der Torre, Leon; Villata, Serena
2009-01-01
Cooperative boolean games are coalitional games with both goals and costs associated to actions, and dependence networks for boolean games are a kind of social networks representing how the actions of other agents have an influence on the achievement of an agent’s goal. In this paper, we introduce two new types of dependence networks, called the abstract dependence network and the refined dependence network. Moreover, we show that the notion of stability is complete with respect to the soluti...
Determining a singleton attractor of a boolean network with nested canalyzing functions.
Akutsu, Tatsuya; Melkman, Avraham A; Tamura, Takeyuki; Yamamoto, Masaki
2011-10-01
In this article, we study the problem of finding a singleton attractor for several biologically important subclasses of Boolean networks (BNs). The problem of finding a singleton attractor in a BN is known to be NP-hard in general. For BNs consisting of n nested canalyzing functions, we present an O(1.799(n)) time algorithm. The core part of this development is an O(min(2(k/2) · 2(m/2), 2(k)) · poly(k, m)) time algorithm for the satisfiability problem for m nested canalyzing functions over k variables. For BNs consisting of chain functions, a subclass of nested canalyzing functions, we present an O(1.619(n)) time algorithm and show that the problem remains NP-hard, even though the satisfiability problem for m chain functions over k variables is solvable in polynomial time. Finally, we present an o(2(n)) time algorithm for bounded degree BNs consisting of canalyzing functions.
Institute of Scientific and Technical Information of China (English)
闵应骅; 李忠诚; 赵著行
1997-01-01
Boolean algebra successfully describes the logical behavior of a digital circuit, and has been widely used in electronic circuit design and test With the development of high speed VLSIs it is a drawback for Boolean algebra to be unable to describe circuit timing behavior. Therefore a Boolean process is defined as a family of Boolean van ables relevant to the time parameter t. A real-valued sample of a Boolean process is a waveform. Waveform functions can be manipulated formally by using mathematical tools. The distance, difference and limit of a waveform polynomial are defined, and a sufficient and necessary condition of the limit existence is presented. Based on this, the concept of sensitization is redefined precisely to demonstrate the potential and wide application possibility The new definition is very different from the traditional one, and has an impact on determining the sensitizable paths with maximum or minimum length, and false paths, and then designing and testing high performance circuits
Parameter Learning of Boolean Bayesian Networks%布尔型贝叶斯网络参数学习
Institute of Scientific and Technical Information of China (English)
吴永广; 周兴旺
2015-01-01
布尔型贝叶斯网络是一类由布尔型变量组成的网络，它能够以线性多变量函数描述，使计算和处理上灵活高效。通过运用连接树算法对络进行分块化处理的方法，可以提高算法的效率，然后以传统的最大似然估计方法对布尔型网络的参数进行学习。服从同一分布律的贝叶斯网络参数学习算法发展比较成熟，这类以狄利克雷或者高斯分布为基础的算法在应用领域中难以发挥其应有的价值。相比之下，基于布尔型贝叶斯网络下的参数学习更贴近于应用，在人工智能和数据挖掘等领域有很好的发展前景。%Boolean Bayesian network is a class of Bayesian networks which are made up of Boolean varia-bles. The method to describe the network with a multi-linear function is flexible and efficient to compute and process variables. By introducing Junction Tree algorithm,the network can be divided into blocks which can make it easy to calculate. Then the traditional maximum likelihood estimation method was used for learning Boolean networks. Parameter learning algorithm following the same distribution is more ma-ture,but this kind of algorithm based on Dirichlet or Gaussian distribution is difficult to play its proper val-ue in practice. In contrast,parameter learning based on Boolean networks gets close to applications. It has good prospects for development in areas such as artificial intelligence and data mining.
Information diffusion on adaptive network
Institute of Scientific and Technical Information of China (English)
Hu Ke; Tang Yi
2008-01-01
Based on the adaptive network,the feedback mechanism and interplay between the network topology and the diffusive process of information are studied.The results reveal that the adaptation of network topology can drive systems into the scale-free one with the assortative or disassortative degree correlations,and the hierarchical clustering.Meanwhile,the processes of the information diffusion are extremely speeded up by the adaptive changes of network topology.
Boolean Differential Operators
Catumba, Jorge; Diaz, Rafael
2012-01-01
We consider four combinatorial interpretations for the algebra of Boolean differential operators. We show that each interpretation yields an explicit matrix representation for Boolean differential operators.
Computation emerges from adaptive synchronization of networking neurons.
Zanin, Massimiliano; Del Pozo, Francisco; Boccaletti, Stefano
2011-01-01
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. PMID:22073167
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.
Combinatorics of Boolean automata circuits dynamics
Demongeot, Jacques; Noual, Mathilde; Sené, Sylvain
2012-01-01
International audience In line with fields of theoretical computer science and biology that study Boolean automata networks to model regulation networks, we present some results concerning the dynamics of networks whose underlying structures are oriented cycles, that is, Boolean automata circuits. In the context of biological regulation, former studies have highlighted the importance of circuits on the asymptotic dynamical behaviour of the biological networks that contain them. Our work fo...
Probabilistic Boolean Network Modelling and Analysis Framework for mRNA Translation.
Zhao, Yun-Bo; Krishnan, J
2016-01-01
mRNA translation is a complex process involving the progression of ribosomes on the mRNA, resulting in the synthesis of proteins, and is subject to multiple layers of regulation. This process has been modelled using different formalisms, both stochastic and deterministic. Recently, we introduced a Probabilistic Boolean modelling framework for mRNA translation, which possesses the advantage of tools for numerically exact computation of steady state probability distribution, without requiring simulation. Here, we extend this model to incorporate both random sequential and parallel update rules, and demonstrate its effectiveness in various settings, including its flexibility in accommodating additional static and dynamic biological complexities and its role in parameter sensitivity analysis. In these applications, the results from the model analysis match those of TASEP model simulations. Importantly, the proposed modelling framework maintains the stochastic aspects of mRNA translation and provides a way to exactly calculate probability distributions, providing additional tools of analysis in this context. Finally, the proposed modelling methodology provides an alternative approach to the understanding of the mRNA translation process, by bridging the gap between existing approaches, providing new analysis tools, and contributing to a more robust platform for modelling and understanding translation.
Memory-Based Boolean Game and Self-Organized Phenomena on Networks
Institute of Scientific and Technical Information of China (English)
HUANG Zi-Gang; WU Zhi-Xi; GUAN Jian-Yue; WANG Ying-Hai
2006-01-01
@@ We study a memory-based Boolean game (MBBG) taking place on a regular ring, wherein each agent acts according to its local optimal states of the last M time steps recorded in memory, and the agents in the minority are rewarded. One free parameter p between 0 and 1 is introduced to denote the strength of the agent willing to make a decision according to its memory. It is found that giving proper willing strength p, the MBBG system can spontaneously evolve to a state of performance better than the random game; while for larger p, the herd behaviour emerges to reduce the system profit. By analysing the dependence of dynamics of the system on the memory capacity M, we find that a higher memory capacity favours the emergence of the better performance state, and effectively restrains the herd behaviour, thus increases the system profit. Considering the high cost of long-time memory, the enhancement of memory capacity for restraining the herd behaviour is also discussed,and M = 5 is suggested to be a good choice.
Evolution of regulatory networks towards adaptability and stability in a changing environment
Lee, Deok-Sun
2014-11-01
Diverse biological networks exhibit universal features distinguished from those of random networks, calling much attention to their origins and implications. Here we propose a minimal evolution model of Boolean regulatory networks, which evolve by selectively rewiring links towards enhancing adaptability to a changing environment and stability against dynamical perturbations. We find that sparse and heterogeneous connectivity patterns emerge, which show qualitative agreement with real transcriptional regulatory networks and metabolic networks. The characteristic scaling behavior of stability reflects the balance between robustness and flexibility. The scaling of fluctuation in the perturbation spread shows a dynamic crossover, which is analyzed by investigating separately the stochasticity of internal dynamics and the network structure differences depending on the evolution pathways. Our study delineates how the ambivalent pressure of evolution shapes biological networks, which can be helpful for studying general complex systems interacting with environments.
Hu, Mingxiao; Shen, Liangzhong; Zan, Xiangzhen; Shang, Xuequn; Liu, Wenbin
2016-01-01
Boolean networks are widely used to model gene regulatory networks and to design therapeutic intervention strategies to affect the long-term behavior of systems. In this paper, we investigate the less-studied one-bit perturbation, which falls under the category of structural intervention. Previous works focused on finding the optimal one-bit perturbation to maximally alter the steady-state distribution (SSD) of undesirable states through matrix perturbation theory. However, the application of the SSD is limited to Boolean networks with about ten genes. In 2007, Xiao et al. proposed to search the optimal one-bit perturbation by altering the sizes of the basin of attractions (BOAs). However, their algorithm requires close observation of the state-transition diagram. In this paper, we propose an algorithm that efficiently determines the BOA size after a perturbation. Our idea is that, if we construct the basin of states for all states, then the size of the BOA of perturbed networks can be obtained just by updating the paths of the states whose transitions have been affected. Results from both synthetic and real biological networks show that the proposed algorithm performs better than the exhaustive SSD-based algorithm and can be applied to networks with about 25 genes.
Hu, Mingxiao; Shen, Liangzhong; Zan, Xiangzhen; Shang, Xuequn; Liu, Wenbin
2016-01-01
Boolean networks are widely used to model gene regulatory networks and to design therapeutic intervention strategies to affect the long-term behavior of systems. In this paper, we investigate the less-studied one-bit perturbation, which falls under the category of structural intervention. Previous works focused on finding the optimal one-bit perturbation to maximally alter the steady-state distribution (SSD) of undesirable states through matrix perturbation theory. However, the application of the SSD is limited to Boolean networks with about ten genes. In 2007, Xiao et al. proposed to search the optimal one-bit perturbation by altering the sizes of the basin of attractions (BOAs). However, their algorithm requires close observation of the state-transition diagram. In this paper, we propose an algorithm that efficiently determines the BOA size after a perturbation. Our idea is that, if we construct the basin of states for all states, then the size of the BOA of perturbed networks can be obtained just by updating the paths of the states whose transitions have been affected. Results from both synthetic and real biological networks show that the proposed algorithm performs better than the exhaustive SSD-based algorithm and can be applied to networks with about 25 genes. PMID:27196530
Montanaro, Ashley; Osborne, Tobias J.
2008-01-01
In this paper we introduce the study of quantum boolean functions, which are unitary operators f whose square is the identity: f^2 = I. We describe several generalisations of well-known results in the theory of boolean functions, including quantum property testing; a quantum version of the Goldreich-Levin algorithm for finding the large Fourier coefficients of boolean functions; and two quantum versions of a theorem of Friedgut, Kalai and Naor on the Fourier spectra of boolean functions. In o...
布尔表达式的化简与并行排序网络验证%Boolean expression simplification and parallel sort network validation
Institute of Scientific and Technical Information of China (English)
王德才; 徐建国; 吴哲辉; 罗永亮; 王传民
2009-01-01
To design an effective tool that can be used to verify the correctness of a parallel sorting network, a Boolean expression sim-plification algorithm based on the [0,1] theory and Boolean function of the characteristics and the nature is put forward, based on this algorithm a validation tool is designed. The characteristics and the nature of [0,1] theory and Boolean function are discussed and the natures that are helpful to simplify of the operation are pointed out. The tool can be used for the design of parallel sorting networks based on the parameters of the network graphics, and it can automatically generate the Boolean expressions and simplify it. The tool's output will be helpful to analyze the network, and it can also be used to design and optimize the sort network. Finally, the validity of the tool is demonstrated by the application.%为设计出能够验证并行排序网络正确性的有效工具,根据[0,1]原理和布尔函数的特点和性质,提出一种布尔表达式的化简算法,并根据此算法设计出验证工具.对[0,1]原理和布尔函数的特点和性质进行了讨论,指出有利于化简操作的性质.设计出的工具能够根据并行排序网络的参数显示网络图形、自动生成布尔表达式并实现化简验证,工具的输出有利于对排序网络的分析,也可以用于辅助排序网络的设计和优化.实验结果表明了该工具的有效性.
Free Boolean Topological Groups
Directory of Open Access Journals (Sweden)
Ol’ga Sipacheva
2015-11-01
Full Text Available Known and new results on free Boolean topological groups are collected. An account of the properties that these groups share with free or free Abelian topological groups and properties specific to free Boolean groups is given. Special emphasis is placed on the application of set-theoretic methods to the study of Boolean topological groups.
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.
Controllability and observability of Boolean control networks%布尔控制网络的能控性与能观性
Institute of Scientific and Technical Information of China (English)
李志强; 宋金利
2013-01-01
Using the semi-tensor product,we convert the Boolean control network to its algebraic form.From the structure matrix of Boolean control network,the controllability and observability of the Boolean control network are discussed.A novel necessary and sufficient condition for controllability,which improves the recent results,is given.The new controllability condition eliminates the redundant computation of controllability matrix.The highest power of matrix is reduced from 2m+n to 2 n.Also,a sufficient condition for observability is obtained,which can be computed easily.A numerical example is presented to show the applicability of our controllability and observability condition.%利用矩阵的半张量积,布尔控制网络被转化为离散时间系统.本文从离散时间系统的结构矩阵出发,讨论了逻辑控制系统的能控能观性条件,得到了一个新的能控性条件.新的条件简化了原有能控性矩阵的计算复杂性,矩阵的最高阶数由原来的2m+n降到了2n.另外,还得到了检验布尔控制网络能观性的条件.与原有条件相比,新的条件更容易计算检验.最后,给出一个实例,检验给出的能控能观性判断条件的正确性.
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
Fluctuating epidemics on adaptive networks
Shaw, Leah B
2008-01-01
A model for epidemics on an adaptive network is considered. Nodes follow an SIRS (susceptible-infective-recovered-susceptible) pattern. Connections are rewired to break links from non-infected nodes to infected nodes and are reformed to connect to other non-infected nodes, as the nodes that are not infected try to avoid the infection. Monte Carlo simulation and numerical solution of a mean field model are employed. The introduction of rewiring affects both the network structure and the epidemic dynamics. Degree distributions are altered, and the average distance from a node to the nearest infective increases. The rewiring leads to regions of bistability where either an endemic or a disease-free steady state can exist. Fluctuations around the endemic state and the lifetime of the endemic state are considered. The fluctuations are found to exhibit power law behavior.
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.
Adaptive Dynamics of Regulatory Networks: Size Matters
Directory of Open Access Journals (Sweden)
2009-03-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.
Cho Kwang-Hyun; Choi Sun; Kwon Yung-Keun
2007-01-01
Abstract Background A number of studies on biological networks have been carried out to unravel the topological characteristics that can explain the functional importance of network nodes. For instance, connectivity, clustering coefficient, and shortest path length were previously proposed for this purpose. However, there is still a pressing need to investigate another topological measure that can better describe the functional importance of network nodes. In this respect, we considered a fee...
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.
DEFF Research Database (Denmark)
Andersen, Henrik Reif; Hulgaard, Henrik
1997-01-01
This paper presents a new data structure called Boolean Expression Diagrams (BEDs) for representing and manipulating Boolean functions. BEDs are a generalization of Binary Decision Diagrams (BDDs) which can represent any Boolean circuit in linear space and still maintain many of the desirable pro...... standard BDD techniques this problem is infeasible. BEDs are useful in applications where the end-result as a reduced ordered BDD is small, for example for tautology checking...
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 manag
Analysis and Control of Boolean Networks:A Semi-tensor Product Approach%布尔网络的分析与控制-矩阵半张量积方法
Institute of Scientific and Technical Information of China (English)
程代展; 齐洪胜; 赵寅
2011-01-01
布尔网络是描述基因调控网络的一个有力工具.由于系统生物学的发展,布尔网络的分析与控制成为生物学与系统控制学科的交叉热点.本文综述作者用其原创的矩阵半张量积方法在布尔网络的分析与控制中得到的一系列结果.内容包括:布尔网络的拓扑结构,布尔控制网络的能控、能观性与实现,布尔网络的稳定性和布尔控制网络的镇定,布尔控制网络的干扰解耦,布尔(控制)网络的辨识,以及布尔网络的最优控制等.%Boolean network is a powerful tool for describing gene regulatory network. With the development of the systems biology, the analysis and control of Boolean networks become a hot topic for multidisciplinary research. This paper surveys some recent results obtained in the analysis and control of Boolean networks using semi-tensor product of matrices. The contents of this paper include the topological structure of Boolean networks, the controllability and observability, realization, stability and stabilization, disturbance decoupling, identification, and optimal control of Boolean (control) networks.
Recruitment dynamics in adaptive social networks
Shkarayev, Maxim S.; Schwartz, Ira B.; Shaw, Leah B.
2011-01-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...
Directory of Open Access Journals (Sweden)
Panuwat Trairatphisan
Full Text Available Signal transduction networks are increasingly studied with mathematical modelling approaches while each of them is suited for a particular problem. For the contextualisation and analysis of signalling networks with steady-state protein data, we identified probabilistic Boolean network (PBN as a promising framework which could capture quantitative changes of molecular changes at steady-state with a minimal parameterisation.In our case study, we successfully applied the PBN approach to model and analyse the deregulated Platelet-Derived Growth Factor (PDGF signalling pathway in Gastrointestinal Stromal Tumour (GIST. We experimentally determined a rich and accurate dataset of steady-state profiles of selected downstream kinases of PDGF-receptor-alpha mutants in combination with inhibitor treatments. Applying the tool optPBN, we fitted a literature-derived candidate network model to the training dataset consisting of single perturbation conditions. Model analysis suggested several important crosstalk interactions. The validity of these predictions was further investigated experimentally pointing to relevant ongoing crosstalk from PI3K to MAPK signalling in tumour cells. The refined model was evaluated with a validation dataset comprising multiple perturbation conditions. The model thereby showed excellent performance allowing to quantitatively predict the combinatorial responses from the individual treatment results in this cancer setting. The established optPBN pipeline is also widely applicable to gain a better understanding of other signalling networks at steady-state in a context-specific fashion.
On the number of attractors of Boolean automata circuits
Demongeot, Jacques; Noual, Mathilde; Sené, Sylvain
2009-01-01
In line with fields of theoretical computer science and biology that study Boolean automata networks often seen as models of regulation networks, we present some results concerning the dynamics of networks whose underlying interaction graphs are circuits, that is Boolean automata circuits. In the context of biological regulation, former studies have highlighted the importance of circuits on the asymptotic dynamical behaviour of the biological networks that contain them. Our work focuses on th...
广义Boolean-like环%Generalized Boolean-like Rings
Institute of Scientific and Technical Information of China (English)
秦蕊
2013-01-01
广义Boolean-like环是Boolean-like环的一个推广,文章主要介绍了广义Boolean-like环的构建,从而列举了若干广义Boolean-like环的相关例子及基本性质.并且,考虑了广义Boolean-like环的部分扩张,如上三角矩阵环.
Neural Network Adaptations to Hardware Implementations
Moerland, Perry,; Fiesler,Emile
1997-01-01
In order to take advantage of the massive parallelism offered by artificial neural networks, hardware implementations are essential.However, most standard neural network models are not very suitable for implementation in hardware and adaptations are needed. In this section an overview is given of the various issues that are encountered when mapping an ideal neural network model onto a compact and reliable neural network hardware implementation, like quantization, handling nonuniformities and ...
Neural Network Adaptations to Hardware Implementations
Moerland, Perry,; Fiesler,Emile; Beale, R
1997-01-01
In order to take advantage of the massive parallelism offered by artificial neural networks, hardware implementations are essential. However, most standard neural network models are not very suitable for implementation in hardware and adaptations are needed. In this section an overview is given of the various issues that are encountered when mapping an ideal neural network model onto a compact and reliable neural network hardware implementation, like quantization, handling nonuniformities and...
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...
Recruitment dynamics in adaptive social networks.
Shkarayev, Maxim S; Schwartz, Ira B; Shaw, Leah B
2013-01-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). PMID:25395989
Recruitment dynamics in adaptive social networks
International Nuclear Information System (INIS)
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). (paper)
Leont'ev, V. K.
2015-11-01
A pseudo-Boolean function is an arbitrary mapping of the set of binary n-tuples to the real line. Such functions are a natural generalization of classical Boolean functions and find numerous applications in various applied studies. Specifically, the Fourier transform of a Boolean function is a pseudo-Boolean function. A number of facts associated with pseudo-Boolean polynomials are presented, and their applications to well-known discrete optimization problems are described.
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
Arshad, Osama A; Venkatasubramani, Priyadharshini S; Datta, Aniruddha; Venkatraj, Jijayanagaram
2016-01-01
The uncontrolled cell proliferation that is characteristically associated with cancer is usually accompanied by alterations in the genome and cell metabolism. Indeed, the phenomenon of cancer cells metabolizing glucose using a less efficient anaerobic process even in the presence of normal oxygen levels, termed the Warburg effect, is currently considered to be one of the hallmarks of cancer. Diabetes, much like cancer, is defined by significant metabolic changes. Recent epidemiological studies have shown that diabetes patients treated with the antidiabetic drug Metformin have significantly lowered risk of cancer as compared to patients treated with other antidiabetic drugs. We utilize a Boolean logic model of the pathways commonly mutated in cancer to not only investigate the efficacy of Metformin for cancer therapeutic purposes but also demonstrate how Metformin in concert with other cancer drugs could provide better and less toxic clinical outcomes as compared to using cancer drugs alone.
Network measures for characterising team adaptation processes
Barth, S.K.; Schraagen, J.M.C.; Schmettow, M.
2015-01-01
The aim of this study was to advance the conceptualisation of team adaptation by applying social network analysis (SNA) measures in a field study of a paediatric cardiac surgical team adapting to changes in task complexity and ongoing dynamic complexity. Forty surgical procedures were observed by tr
Neural network with dynamically adaptable neurons
Tawel, Raoul (Inventor)
1994-01-01
This invention is an adaptive neuron for use in neural network processors. The adaptive neuron participates in the supervised learning phase of operation on a co-equal basis with the synapse matrix elements by adaptively changing its gain in a similar manner to the change of weights in the synapse IO elements. In this manner, training time is decreased by as much as three orders of magnitude.
Stratification and enumeration of Boolean functions by canalizing depth
He, Qijun; Macauley, Matthew
2016-01-01
Boolean network models have gained popularity in computational systems biology over the last dozen years. Many of these networks use canalizing Boolean functions, which has led to increased interest in the study of these functions. The canalizing depth of a function describes how many canalizing variables can be recursively "picked off", until a non-canalizing function remains. In this paper, we show how every Boolean function has a unique algebraic form involving extended monomial layers and a well-defined core polynomial. This generalizes recent work on the algebraic structure of nested canalizing functions, and it yields a stratification of all Boolean functions by their canalizing depth. As a result, we obtain closed formulas for the number of n-variable Boolean functions with depth k, which simultaneously generalizes enumeration formulas for canalizing, and nested canalizing functions.
Stratification and enumeration of Boolean functions by canalizing depth
He, Qijun
2015-01-01
Boolean network models have gained popularity in computational systems biology over the last dozen years. Many of these networks use canalizing Boolean functions, which has led to increased interest in the study of these functions. The canalizing depth of a function describes how many canalizing variables can be recursively picked off, until a non-canalizing function remains. In this paper, we show how every Boolean function has a unique algebraic form involving extended monomial layers and a well-defined core polynomial. This generalizes recent work on the algebraic structure of nested canalizing functions, and it yields a stratification of all Boolean functions by their canalizing depth. As a result, we obtain closed formulas for the number of n-variable Boolean functions with depth k, which simultaneously generalizes enumeration formulas for canalizing, and nested canalizing functions.
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.
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.
Adaptive Capacity Management in Bluetooth Networks
DEFF Research Database (Denmark)
Son, L.T.
capacity allocation, network traffic control, inter-piconet scheduling, and buffer management. First, after a short presentation about Bluetooth technology, and QoS issues, queueing models and a simulation-based buffer management have been constructed. Then by using analysis and simulation, it shows some...... 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...... issues of the current Bluetooth specification, which lead to the following research to improve Bluetooth performance: Inter-piconet predictive scheduling, adaptive distributed network traffic control and hybrid distributed capacity allocation. These approaches are proposed as heuristic solutions...
Lahoz-Beltra, R; Hameroff, S R; Dayhoff, J E
1993-01-01
Adaptive behaviors and dynamic activities within living cells are organized by the cytoskeleton: intracellular networks of interconnected protein polymers which include microtubules (MTs), actin, intermediate filaments, microtubule associated proteins (MAPs) and other protein structures. Cooperative interactions among cytoskeletal protein subunit conformational states have been used to model signal transmission and information processing. In the present work we present a theoretical model for molecular computing in which Boolean logic is implemented in parallel networks of individual MTs interconnected by MAPs. Conformational signals propagate on MTs as in data buses and in the model MAPs are considered as Boolean operators, either as bit-lines (like MTs) where a signal can be transported unchanged between MTs ('BUS-MAP'), or as bit-lines where a Boolean operation is performed in one of the two MAP-MT attachments ('LOGIC-MAP'). Three logic MAPs have been defined ('NOT-MAP, 'AND-MAP', 'XOR-MAP') and used to demonstrate addition, subtraction and other arithmetic operations. Although our choice of Boolean logic is arbitrary, the simulations demonstrate symbolic manipulation in a connectionist system and suggest that MT-MAP networks can perform computation in living cells and are candidates for future molecular computing devices. PMID:8318677
Criticality and Adaptivity in Enzymatic Networks.
Steiner, Paul J; Williams, Ruth J; Hasty, Jeff; Tsimring, Lev S
2016-09-01
The contrast between the stochasticity of biochemical networks and the regularity of cellular behavior suggests that biological networks generate robust behavior from noisy constituents. Identifying the mechanisms that confer this ability on biological networks is essential to understanding cells. Here we show that queueing for a limited shared resource in broad classes of enzymatic networks in certain conditions leads to a critical state characterized by strong and long-ranged correlations between molecular species. An enzymatic network reaches this critical state when the input flux of its substrate is balanced by the maximum processing capacity of the network. We then consider enzymatic networks with adaptation, when the limiting resource (enzyme or cofactor) is produced in proportion to the demand for it. We show that the critical state becomes an attractor for these networks, which points toward the onset of self-organized criticality. We suggest that the adaptive queueing motif that leads to significant correlations between multiple species may be widespread in biological systems. PMID:27602735
Knox, H. A.; Draelos, T.; Young, C. J.; Lawry, B.; Chael, E. P.; Faust, A.; Peterson, M. G.
2015-12-01
The quality of automatic detections from seismic sensor networks depends on a large number of data processing parameters that interact in complex ways. The largely manual process of identifying effective parameters is painstaking and does not guarantee that the resulting controls are the optimal configuration settings. Yet, achieving superior automatic detection of seismic events is closely related to these parameters. We present an automated sensor tuning (AST) system that learns near-optimal parameter settings for each event type using neuro-dynamic programming (reinforcement learning) trained with historic data. AST learns to test the raw signal against all event-settings and automatically self-tunes to an emerging event in real-time. The overall goal is to reduce the number of missed legitimate event detections and the number of false event detections. Reducing false alarms early in the seismic pipeline processing will have a significant impact on this goal. Applicable both for existing sensor performance boosting and new sensor deployment, this system provides an important new method to automatically tune complex remote sensing systems. Systems tuned in this way will achieve better performance than is currently possible by manual tuning, and with much less time and effort devoted to the tuning process. With ground truth on detections in seismic waveforms from a network of stations, we show that AST increases the probability of detection while decreasing false alarms.
Coordinated adaptive beamformer over distributed antenna network
Institute of Scientific and Technical Information of China (English)
Liu Desheng; Lu Songtao; Sun Jinping; Wang Jun
2013-01-01
The spatial diversity of distributed network demands the individual filter to accommodate the topology of interference environment.In this paper,a type of distributed adaptive beamformer is proposed to mitigate interference over coordinated antenna arrays network.The proposed approach is formulated as generalized sidelobe canceller (GSC) structure to facilitate the convex combination of neighboring nodes' weights,and then it is solved by unconstrained least mean square (LMS) algorithm due to simplicity.Numerical results show that the robustness and convergence rate of antenna arrays network can be significantly improved in strong interference scenario.And they also clearly illustrate that mixing vector is optimized adaptively and adjusted according to the spatial diversity of the distributed nodes which are placed in different power of received signals to interference ratio (SIR) environments.
Boolean gates on actin filaments
Siccardi, Stefano; Tuszynski, Jack A.; Adamatzky, Andrew
2016-01-01
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.
DEFF Research Database (Denmark)
Andersen, Henrik Reif; Hulgaard, Henrik
2002-01-01
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...
Adaptation by Plasticity of Genetic Regulatory Networks
Brenner, Naama
2007-03-01
Genetic regulatory networks have an essential role in adaptation and evolution of cell populations. This role is strongly related to their dynamic properties over intermediate-to-long time scales. We have used the budding yeast as a model Eukaryote to study the long-term dynamics of the genetic regulatory system and its significance in evolution. A continuous cell growth technique (chemostat) allows us to monitor these systems over long times under controlled condition, enabling a quantitative characterization of dynamics: steady states and their stability, transients and relaxation. First, we have demonstrated adaptive dynamics in the GAL system, a classic model for a Eukaryotic genetic switch, induced and repressed by different carbon sources in the environment. We found that both induction and repression are only transient responses; over several generations, the system converges to a single robust steady state, independent of external conditions. Second, we explored the functional significance of such plasticity of the genetic regulatory network in evolution. We used genetic engineering to mimic the natural process of gene recruitment, placing the gene HIS3 under the regulation of the GAL system. Such genetic rewiring events are important in the evolution of gene regulation, but little is known about the physiological processes supporting them and the dynamics of their assimilation in a cell population. We have shown that cells carrying the rewired genome adapted to a demanding change of environment and stabilized a population, maintaining the adaptive state for hundreds of generations. Using genome-wide expression arrays we showed that underlying the observed adaptation is a global transcriptional programming that allowed tuning expression of the recruited gene to demands. Our results suggest that non-specific properties reflecting the natural plasticity of the regulatory network support adaptation of cells to novel challenges and enhance their evolvability.
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.
Inadmissible Class of Boolean Functions under Stuck-at Faults
Das, Debesh K.; Chowdhury, Debabani; Bhattacharya, Bhargab B; Sasao, Tsutomu
2013-01-01
Many underlying structural and functional factors that determine the fault behavior of a combinational network, are not yet fully understood. In this paper, we show that there exists a large class of Boolean functions, called root functions, which can never appear as faulty response in irredundant two-level circuits even when any arbitrary multiple stuck-at faults are injected. Conversely, we show that any other Boolean function can appear as a faulty response from an irredundant realization ...
Deep Adaptive Networks for Visual Data Classification
Directory of Open Access Journals (Sweden)
Shusen Zhou
2014-10-01
Full Text Available This paper proposes a classifier called deep adaptive networks (DAN based on deep belief networks (DBN for visual data classification. First, we construct a directed deep belief nets by using a set of Restricted Boltzmann Machines (RBM and a Gaussian RBM via greedy and layerwise unsupervised learning. Then, we refine the parameter space of the deep architecture to adapt the classification requirement by using global gradient-descent based supervised learning. An exponential loss function is utilized to maximize the separability of different classes. Moreover, we apply DAN to visual data classification task and observe an important fact that the learning ability of deep architecture is seriously underrated in real-world applications, especially when there are not enough labeled data. Experiments conducted on standard datasets of different types and different scales demonstrate that the proposed classifier outperforms the representative classification techniques and deep learning methods.
Adaptive scheduling in cellular access, wireless mesh and IP networks
Nieminen, Johanna
2011-01-01
Networking scenarios in the future will be complex and will include fixed networks and hybrid Fourth Generation (4G) networks, consisting of both infrastructure-based and infrastructureless, wireless parts. In such scenarios, adaptive provisioning and management of network resources becomes of critical importance. Adaptive mechanisms are desirable since they enable a self-configurable network that is able to adjust itself to varying traffic and channel conditions. The operation of adaptive me...
A Neural Network for Generating Adaptive Lessons
Directory of Open Access Journals (Sweden)
Hassina Seridi-Bouchelaghem
2005-01-01
Full Text Available Traditional sequencing technology developed in the field of intelligent tutoring systems have not find an immediate place in large-scale Web-based education. This study investigates the use of computational intelligence for adaptive lesson generation in a distance learning environment over the Web. An approach for adaptive pedagogical hypermedia document generation is proposed and implemented in a prototype called KnowledgeClass. This approach is based on a specialized artificial neural network model. The system allows automatic generation of individualised courses according to the learners goal and previous knowledge and can dynamically adapt the course according to the learners success in acquiring knowledge. Several experiments showed the effectiveness of the proposed method.
Adaptive vertical handoff algorithm in heterogeneous networks
Institute of Scientific and Technical Information of China (English)
XIE Sheng-dong; WU Meng
2007-01-01
The integration of cellular network (CN) and wireless local area network (WLAN) is the trend of the next generation mobile communication systems, and nodes will handoff between the two kinds of networks. The received signal strength (RSS) is the dominant factor consijered when handoff occurs. In order to improve the handoff efficiency, this study proposes an adaptive decision algorithm for vertical handoff on the basis of fast Fourier transform (FFT). The algorithm makes handoff decision after analyzing the signal strength fluctuation which is caused by slow fading through FFT. Simulations show that the algorithm reduces the number of handoff by 35%, shortens the areas influenced by slow fading, and enables the nodes to make full use of WLAN in communication compared with traditional algorithms.
Institute of Scientific and Technical Information of China (English)
Antonio AIZPURU; Antonio GUTI(E)RREZ-D(A)VILA
2004-01-01
In this paper we will study some families and subalgebras ( ) of ( )(N) that let us characterize the unconditional convergence of series through the weak convergence of subseries ∑i∈A xi, A ∈ ( ).As a consequence, we obtain a new version of the Orlicz-Pettis theorem, for Banach spaces. We also study some relationships between algebraic properties of Boolean algebras and topological properties of the corresponding Stone spaces.
Geometric Operators on Boolean Functions
Frisvad, Jeppe Revall; Falster, Peter
2007-01-01
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 function. With this image of a Boolean function corresponding to a propositional formula, we prove that the orthogonal projection operator leads to a theorem describing all rules of inference in propo...
On Capability-Related Adaptation in Networked Service Systems
Finn Arve Aagesen; Patcharee Thongtra
2012-01-01
Adaptability is a property related to engineering as well as to the execution of networked service systems. This publication considers issues of adaptability both within a general and a scoped view. The generalview considers issues of adaptation at two levels: 1) System of entities, functions and adaptability types, and 2) Architectures supporting adaptability. Adaptability types defined are capability-related, functionality-related and context-related adaptation. The scoped view of the publi...
Public Goods Games on Adaptive Coevolutionary Networks
Shapiro, Avi M
2016-01-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, can reap public goods benefits. 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 network without spatial constraints in which players adapt to their environment in order to increase individual payoffs. 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 ...
Quantitative Adaptive RED in Differentiated Service Networks
Institute of Scientific and Technical Information of China (English)
LONG KePing(隆克平); WANG Qian(王茜); CHENG ShiDuan(程时端); CHEN JunLiang(陈俊亮)
2003-01-01
This paper derives a quantitative model between RED (Random Early Detection)maxp and committed traffic rate for token-based marking schemes in DiffServ IP networks. Then,a DiffServ Quantitative RED (DQRED) is presented, which can adapt its dropping probabilityto marking probability of the edge router to reflect not only the sharing bandwidth but also therequirement of performance of these services. Hence, DQRED can cooperate with marking schemesto guarantee fairness between different DiffServ AF class services. A new marking probabilitymetering algorithm is also proposed to cooperate with DQRED. Simulation results verify thatDQRED mechanism can not only control congestion of DiffServ network very well, but also satisfydifferent quality requirements of AF class service. The performance of DQRED is better than thatof WRED.
J-Boolean like环%J-Boolean Like Ring
Institute of Scientific and Technical Information of China (English)
秦蕊
2013-01-01
本文首先引进了Boolean-like环的一类新的扩张J-Boolean like环,即对任意环R中元素a,b都有(a-a2)(b-b2)∈J(R),这里J(R)为环R的Jacobson根,则环R称为J-Boolean like环.证明了两个定理分别为(1)设D是一个环,C是D的一个子环,R[D,C]是一个J-Boolean like环(=)(a)C,D是J-Boolean like环,(b)J2(C)(∈)J(D).(2)如果B/J(B)是Boolean环,并且B[i]={a+bi| i2=ui+η,a,b,u,η∈B},那么B[i]是J-Booleanlike环当且仅当uη∈J(B).
Adaptive bipartite consensus on coopetition networks
Hu, Jiangping; Zhu, Hong
2015-07-01
In this paper, a bipartite consensus tracking problem is considered for a group of autonomous agents on a coopetition network, on which the agents interact cooperatively and competitively simultaneously. The coopetition network involves positive and negative edges and is conveniently modeled by a signed graph. Additionally, the dynamics of all the agents are subjected to unknown disturbances, which are represented by linearly parameterized models. An adaptive estimation scheme is designed for each agent by virtue of the relative position measurements and the relative velocity measurements from its neighbors. Then a consensus tracking law is proposed for a new distributed system, which uses the relative measurements as the new state variables. The convergence of the consensus tracking error and the parameter estimation are analyzed even when the coopetition network is time-varying and no more global information about the bounds of the unknown disturbances is available to all the agents. Finally, some simulation results are provided to demonstrate the formation of the bipartite consensus on the coopetition network.
Approximate Reasoning with Fuzzy Booleans
Broek, van den P.M.; Noppen, J.A.R.
2004-01-01
This paper introduces, in analogy to the concept of fuzzy numbers, the concept of fuzzy booleans, and examines approximate reasoning with the compositional rule of inference using fuzzy booleans. It is shown that each set of fuzzy rules is equivalent to a set of fuzzy rules with singleton crisp ante
Symmetry in Boolean Satisfiability
Directory of Open Access Journals (Sweden)
Fadi A. Aloul
2010-06-01
Full Text Available This paper reviews recent approaches on how to accelerate Boolean Satisfiability (SAT search by exploiting symmetries in the problem space. SAT search algorithms traverse an exponentially large search space looking for an assignment that satisfies a set of constraints. The presence of symmetries in the search space induces equivalence classes on the set of truth assignments. The goal is to use symmetries to avoid traversing all assignments by constraining the search to visit a few representative assignments in each equivalence class. This can lead to a significant reduction in search runtime without affecting the completeness of the search.
Boolean Orthogonalizing Combination Methods
Directory of Open Access Journals (Sweden)
Yavuz Can
2015-05-01
Full Text Available In this paper a new logical operation method called “ presented. It is used to calculate the difference, but also the complement of a function as well as the EXOR and EXNOR of two minterms respectively two ternary respectively two ternary-vector logical operation method called “orthogonal OR advantages of both methods are their results, which are already available form that has an essential advantage for continuing calculations. Since it applies, an orthogonal disjunctive normal form is equal to orthogonal antivalence normal form, subsequent Boolean differential calculus will be simplified.
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...... function. With this image of a Boolean function corresponding to a propositional formula, we prove that the orthogonal projection operator leads to a theorem describing all rules of inference in propositional reasoning. In other words, we can capture all kinds of inference in propositional logic by means...... of a few geometric operators working on the images of Boolean functions. The operators we describe, arise from the niche area of array-based logic and have previously been tightly bound to an array-based representation of Boolean functions. We redefine the operators in an abstract form to make them...
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...
Probabilistic Adaptive Anonymous Authentication in Vehicular Networks
Institute of Scientific and Technical Information of China (English)
Yong Xi; Ke-Wei Sha; Wei-Song Shi; Loren Schwiebert; Tao Zhang
2008-01-01
Vehicular networks have attracted extensive attention in recent years for their promises in improving safety and enabling other value-added services. Most previous work focuses on designing the media access and physical layer protocols.Privacy issues in vehicular systems have not been well addressed. We argue that privacy is a user-specific concept, and a good privacy protection mechanism should allow users to select the levels of privacy they wish to have. To address this requirement, we propose an adaptive anonymous authentication mechanism that can trade off the anonymity level with computational and communication overheads (resource usage). This mechanism, to our knowledge, is the first effort on adaptive anonymous authentication. The resources used by our protocol are few. A high traffic volume of 2000 vehicles per hour consumes about 60kbps bandwidth, which is less than one percent of the bandwidth of DSRC (Dedicated Short Range Communications). By using adaptive anonymity, the protocol response time can further be improved 2～4 times with lessthan 20% bandwidth overheads.
On the Number of Attractors of Positive and Negative Boolean Automata Circuits.
Demongeot, Jacques; Noual, Mathilde; Sené, Sylvain
2010-01-01
International audience In line with fields of theoretical computer science and biology that study Boolean automata networks often seen as models of regulation networks, we present some results concerning the dynamics of networks whose underlying interaction graphs are circuits, that is, Boolean automata circuits. In the context of biological regulation, former studies have highlighted the importance of circuits on the asymptotic dynamical behaviour of the biological networks that contain t...
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...
Adaptive Filtering Using Recurrent Neural Networks
Parlos, Alexander G.; Menon, Sunil K.; Atiya, Amir F.
2005-01-01
A method for adaptive (or, optionally, nonadaptive) filtering has been developed for estimating the states of complex process systems (e.g., chemical plants, factories, or manufacturing processes at some level of abstraction) from time series of measurements of system inputs and outputs. The method is based partly on the fundamental principles of the Kalman filter and partly on the use of recurrent neural networks. The standard Kalman filter involves an assumption of linearity of the mathematical model used to describe a process system. The extended Kalman filter accommodates a nonlinear process model but still requires linearization about the state estimate. Both the standard and extended Kalman filters involve the often unrealistic assumption that process and measurement noise are zero-mean, Gaussian, and white. In contrast, the present method does not involve any assumptions of linearity of process models or of the nature of process noise; on the contrary, few (if any) assumptions are made about process models, noise models, or the parameters of such models. In this regard, the method can be characterized as one of nonlinear, nonparametric filtering. The method exploits the unique ability of neural networks to approximate nonlinear functions. In a given case, the process model is limited mainly by limitations of the approximation ability of the neural networks chosen for that case. Moreover, despite the lack of assumptions regarding process noise, the method yields minimum- variance filters. In that they do not require statistical models of noise, the neural- network-based state filters of this method are comparable to conventional nonlinear least-squares estimators.
On Kolmogorov's superpositions and Boolean functions
Energy Technology Data Exchange (ETDEWEB)
Beiu, V.
1998-12-31
The paper overviews results dealing with the approximation capabilities of neural networks, as well as bounds on the size of threshold gate circuits. Based on an explicit numerical (i.e., constructive) algorithm for Kolmogorov's superpositions they will show that for obtaining minimum size neutral networks for implementing any Boolean function, the activation function of the neurons is the identity function. Because classical AND-OR implementations, as well as threshold gate implementations require exponential size (in the worst case), it will follow that size-optimal solutions for implementing arbitrary Boolean functions require analog circuitry. Conclusions and several comments on the required precision are ending the paper.
Opportunistic Adaptive Relaying in Cognitive Radio Networks
Jaafar, Wael; Haccoun, David
2012-01-01
Combining cognitive radio technology with user cooperation could be advantageous to both primary and secondary transmissions. In this paper, we propose a first relaying scheme for cognitive radio networks (called "Adaptive relaying scheme 1"), where one relay node can assist the primary or the secondary transmission with the objective of improving the outage probability of the secondary transmission with respect to a primary outage probability threshold. Upper bound expressions of the secondary outage probability using the proposed scheme are derived over Rayleigh fading channels. Numerical and simulation results show that the secondary outage probability using the proposed scheme is lower than that of other relaying schemes. Then, we extend the proposed scheme to the case where the relay node has the ability to decode both the primary and secondary signals and also can assist simultaneously both transmissions. Simulations show the performance improvement that can be obtained due to this extension in terms of...
Adaptive Synchronization in Small-World Dynamical Networks
Institute of Scientific and Technical Information of China (English)
ZOU Yan-li; ZHU Jie; LUO Xiao-shu
2007-01-01
Adaptive synchronization in NW small-world dynamical networks was studied. Firstly, an adaptive synchronization method is presented and explained. Then, it is applied to two different classes of dynamical networks,one is a class-B network, small-world connected R(o)ssler oscillators, the other is a class-A network, small-world connected Chua's circuits. The simulation verifies the validity of the presented method. It also shows that the adaptive synchronization method is robust to the variations of the node systems parameters. So the presented method can be used in networks whose node systems have unknown or time-varying parameters.
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.).
Techniques for solving Boolean equation systems
Keinänen, Misa
2006-01-01
Boolean equation systems are ordered sequences of Boolean equations decorated with least and greatest fixpoint operators. Boolean equation systems provide a useful framework for formal verification because various specification and verification problems, for instance, μ-calculus model checking can be represented as the problem of solving Boolean equation systems. The general problem of solving a Boolean equation system is a computationally hard task, and no polynomial time solution technique ...
Opinion dynamics on an adaptive random network
Benczik, I. J.; Benczik, S. Z.; Schmittmann, B.; Zia, R. K. P.
2009-04-01
We revisit the classical model for voter dynamics in a two-party system with two basic modifications. In contrast to the original voter model studied in regular lattices, we implement the opinion formation process in a random network of agents in which interactions are no longer restricted by geographical distance. In addition, we incorporate the rapidly changing nature of the interpersonal relations in the model. At each time step, agents can update their relationships. This update is determined by their own opinion, and by their preference to make connections with individuals sharing the same opinion, or rather with opponents. In this way, the network is built in an adaptive manner, in the sense that its structure is correlated and evolves with the dynamics of the agents. The simplicity of the model allows us to examine several issues analytically. We establish criteria to determine whether consensus or polarization will be the outcome of the dynamics and on what time scales these states will be reached. In finite systems consensus is typical, while in infinite systems a disordered metastable state can emerge and persist for infinitely long time before consensus is reached.
Brain network adaptability across task states.
Directory of Open Access Journals (Sweden)
Elizabeth N Davison
2015-01-01
Full Text Available Activity in the human brain moves between diverse functional states to meet the demands of our dynamic environment, but fundamental principles guiding these transitions remain poorly understood. Here, we capitalize on recent advances in network science to analyze patterns of functional interactions between brain regions. We use dynamic network representations to probe the landscape of brain reconfigurations that accompany task performance both within and between four cognitive states: a task-free resting state, an attention-demanding state, and two memory-demanding states. Using the formalism of hypergraphs, we identify the presence of groups of functional interactions that fluctuate coherently in strength over time both within (task-specific and across (task-general brain states. In contrast to prior emphases on the complexity of many dyadic (region-to-region relationships, these results demonstrate that brain adaptability can be described by common processes that drive the dynamic integration of cognitive systems. Moreover, our results establish the hypergraph as an effective measure for understanding functional brain dynamics, which may also prove useful in examining cross-task, cross-age, and cross-cohort functional change.
A more robust Boolean model describing inhibitor binding
Institute of Scientific and Technical Information of China (English)
Zhaoqian Steven XIE; Chao TANG
2008-01-01
From the first application of the Boolean model to the cell cycle regulation network of budding yeast, new regulative pathways have been discovered, par-ticularly in the G1/S transition circuit. This discovery called for finer modeling to study the essential biology, and the resulting outcomes are first introduced in the ar-ticle. A traditional Boolean network model set up for the new G1/S transition circuit shows that it cannot correctly simulate real biology unless the model parameters are fine tuned. The deficiency is caused by an overly coarse-grained description of the inhibitor binding process, which shall be overcome by a two-vector model proposed whose robustness is surveyed using random perturba-tions. Simulations show that the proposed two-vector model is much more robust in describing inhibitor binding processes within the Boolean framework.
A Note on the Inversion Complexity of Boolean Functions in Boolean Formulas
Morizumi, Hiroki
2008-01-01
In this note, we consider the minimum number of NOT operators in a Boolean formula representing a Boolean function. In circuit complexity theory, the minimum number of NOT gates in a Boolean circuit computing a Boolean function $f$ is called the inversion complexity of $f$. In 1958, Markov determined the inversion complexity of every Boolean function and particularly proved that $\\lceil \\log_2(n+1) \\rceil$ NOT gates are sufficient to compute any Boolean function on $n$ variables. As far as we...
Synchronization of general complex networks via adaptive control schemes
Indian Academy of Sciences (India)
Ping He; Chun-Guo Jing; Chang-Zhong Chen; Tao Fan; Hassan Saberi Nik
2014-03-01
In this paper, the synchronization problem of general complex networks is investigated by using adaptive control schemes. Time-delay coupling, derivative coupling, nonlinear coupling etc. exist universally in real-world complex networks. The adaptive synchronization scheme is designed for the complex network with multiple class of coupling terms. A criterion guaranteeing synchronization of such complex networks is established by employing the Lyapunov stability theorem and adaptive control schemes. Finally, an illustrative example with numerical simulation is given to show the feasibility and efficiency of theoretical results.
Neural Network Inverse Adaptive Controller Based on Davidon Least Square
Institute of Scientific and Technical Information of China (English)
无
2000-01-01
General neural network inverse adaptive controller haa two flaws: the first is the slow convergence speed; the second is the invalidation to the non-minimum phase system.These defects limit the scope in which the neural network inverse adaptive controller is used.We employ Davidon least squares in training the multi-layer feedforward neural network used in approximating the inverse model of plant to expedite the convergence,and then through constructing the pseudo-plant,a neural network inverse adaptive controller is put forward which is still effective to the nonlinear non-minimum phase system.The simulation results show the validity of this scheme.
Fuzzy Optimized Metric for Adaptive Network Routing
Directory of Open Access Journals (Sweden)
Ahmad Khader Haboush
2012-04-01
Full Text Available Network routing algorithms used today calculate least cost (shortest paths between nodes. The cost of a path is the sum of the cost of all links on that path. The use of a single metric for adaptive routing is insufficient to reflect the actual state of the link. In general, there is a limitation on the accuracy of the link state information obtained by the routing protocol. Hence it becomes useful if two or more metrics can be associated to produce a single metric that can describe the state of the link more accurately. In this paper, a fuzzy inference rule base is implemented to generate the fuzzy cost of each candidate path to be used in routing the incoming calls. This fuzzy cost is based on the crisp values of the different metrics; a fuzzy membership function is defined. The parameters of these membership functions reflect dynamically the requirement of the incoming traffic service as well as the current state of the links in the path. And this paper investigates how three metrics, the mean link bandwidth, queue utilization and the mean link delay, can be related using a simple fuzzy logic algorithm to produce a optimized cost of the link for a certain interval that is more „precise‟ than either of the single metric, to solve routing problem .
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.
Temporal percolation of a susceptible adaptive network
Valdez, L D; Braunstein, L A
2013-01-01
In the last decades, due to the appearance of many diseases such as SARS and the H1N1 flu strain, many authors studied the impact of the disease spreading in the evolution of the infected individuals using the susceptible-infected-recovered model. However, few authors focused on the temporal behavior of the susceptible individuals. Recently it was found that in an epidemic spreading, the dynamic of the size of the biggest susceptible cluster can be explained by a temporal node void percolation [Valdez et al PLoS ONE 7, e44188 (2012)]. It was shown that the size of the biggest susceptible cluster is the order parameter of this temporal percolation where the control parameter can be related to the number of links between susceptible individuals at a given time. As a consequence, there is a critical time at which the biggest susceptible cluster is destroyed. In this paper, we study the susceptible-infected-recovered model in an adaptive network where an intermittent social distancing strategy is applied. In this...
Dynamic multimedia stream adaptation and rate control for heterogeneous networks
Institute of Scientific and Technical Information of China (English)
SZWABE Andrzej; SCHORR Andreas; HAUCK Franz J.; KASSLER Andreas J.
2006-01-01
Dynamic adaptation of multimedia content is seen as an important feature of next generation networks and pervasive systems enabling terminals and applications to adapt to changes in e.g. context, access network, and available Quality-of-Service(QoS) due to mobility of users, devices or sessions. We present the architecture of a multimedia stream adaptation service which enables communication between terminals having heterogeneous hardware and software capabilities and served by heterogeneous networks. The service runs on special content adaptation nodes which can be placed at any location within the network. The flexible structure of our architecture allows using a variety of different adaptation engines. A generic transcoding engine is used to change the codec of streams. An MPEG-21 Digital Item Adaptation (DIA) based transformation engine allows adjusting the data rate of scalable media streams. An intelligent decision-taking engine implements adaptive flow control which takes into account current network QoS parameters and congestion information. Measurements demonstrate the quality gains achieved through adaptive congestion control mechanisms under conditions typical for a heterogeneous network.
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.
Boolean Searches--A Life Skill.
Ala, Judy; Cerabona, Kathy
1992-01-01
Discusses the importance of Boolean searching as a skill that students will need in the future. Methods for teaching Boolean searching are described, and the value of truncation as an online searching aid is considered. (MES)
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...
Generalized join-hemimorphisms on Boolean algebras
Sergio Celani
2003-01-01
We introduce the notions of generalized join-hemimorphism and generalized Boolean relation as an extension of the notions of join-hemimorphism and Boolean relation, respectively. We prove a duality between these two notions. We will also define a generalization of the notion of Boolean algebra with operators by considering a finite family of Boolean algebras endowed with a generalized join-hemimorphism. Finally, we define suitable notions of subalgebra, congruences, Boole...
Robust adaptive neural network control with supervisory controller
Institute of Scientific and Technical Information of China (English)
张天平; 梅建东
2004-01-01
The problem of direct adaptive neural network control for a class of uncertain nonlinear systems with unknown constant control gain is studied in this paper. Based on the supervisory control strategy and the approximation capability of multilayer neural networks (MNNs), a novel design scheme of direct adaptive neural network controller is proposed.The adaptive law of the adjustable parameter vector and the matrix of weights in the neural networks and the gain of sliding mode control term to adaptively compensate for the residual and the approximation error of MNNs is determined by using a Lyapunov method. The approach does not require the optimal approximation error to be square-integrable or the supremum of the optimal approximation error to be known. By theoretical analysis, the closed-loop control system is proven to be globally stable in the sense that all signals involved are bounded, with tracking error converging to zero.Simulation results demonstrate the effectiveness of the approach.
On the Performance of Adaptive Modulation in Cognitive Radio Networks
Foukalas, F.; Karetsos, G. T.
2013-01-01
We study the performance of cognitive radio networks (CRNs) when incorporating adaptive modulation at the physical layer. Three types of CRNs are considered, namely opportunistic spectrum access (OSA), spectrum sharing (SS) and sensing-based SS. We obtain closed-form expressions for the average spectral efficiency achieved at the secondary network and the optimal power allocation for both continuous and discrete rate types of adaptive modulation assuming perfect channel state information. The...
Adaptive Dynamics of Realistic Small-World Networks
Mogren, Olof; Verendel, Vilhelm; Dubhashi, Devdatt
2008-01-01
Continuing in the steps of Jon Kleinberg's and others celebrated work on decentralized search in small-world networks, we conduct an experimental analysis of a dynamic algorithm that produces small-world networks. We find that the algorithm adapts robustly to a wide variety of situations in realistic geographic networks with synthetic test data and with real world data, even when vertices are uneven and non-homogeneously distributed. We investigate the same algorithm in the case where some vertices are more popular destinations for searches than others, for example obeying power-laws. We find that the algorithm adapts and adjusts the networks according to the distributions, leading to improved performance. The ability of the dynamic process to adapt and create small worlds in such diverse settings suggests a possible mechanism by which such networks appear in nature.
Stochastic analysis of epidemics on adaptive time varying networks
Kotnis, Bhushan; Kuri, Joy
2013-06-01
Many studies investigating the effect of human social connectivity structures (networks) and human behavioral adaptations on the spread of infectious diseases have assumed either a static connectivity structure or a network which adapts itself in response to the epidemic (adaptive networks). However, human social connections are inherently dynamic or time varying. Furthermore, the spread of many infectious diseases occur on a time scale comparable to the time scale of the evolving network structure. Here we aim to quantify the effect of human behavioral adaptations on the spread of asymptomatic infectious diseases on time varying networks. We perform a full stochastic analysis using a continuous time Markov chain approach for calculating the outbreak probability, mean epidemic duration, epidemic reemergence probability, etc. Additionally, we use mean-field theory for calculating epidemic thresholds. Theoretical predictions are verified using extensive simulations. Our studies have uncovered the existence of an “adaptive threshold,” i.e., when the ratio of susceptibility (or infectivity) rate to recovery rate is below the threshold value, adaptive behavior can prevent the epidemic. However, if it is above the threshold, no amount of behavioral adaptations can prevent the epidemic. Our analyses suggest that the interaction patterns of the infected population play a major role in sustaining the epidemic. Our results have implications on epidemic containment policies, as awareness campaigns and human behavioral responses can be effective only if the interaction levels of the infected populace are kept in check.
Linking Individual and Collective Behavior in Adaptive Social Networks
Pinheiro, Flávio L.; Santos, Francisco C.; Pacheco, Jorge M.
2016-03-01
Adaptive social structures are known to promote the evolution of cooperation. However, up to now the characterization of the collective, population-wide dynamics resulting from the self-organization of individual strategies on a coevolving, adaptive network has remained unfeasible. Here we establish a (reversible) link between individual (micro)behavior and collective (macro)behavior for coevolutionary processes. We demonstrate that an adaptive network transforms a two-person social dilemma locally faced by individuals into a collective dynamics that resembles that associated with an N -person coordination game, whose characterization depends sensitively on the relative time scales between the entangled behavioral and network evolutions. In particular, we show that the faster the relative rate of adaptation of the network, the smaller the critical fraction of cooperators required for cooperation to prevail, thus establishing a direct link between network adaptation and the evolution of cooperation. The framework developed here is general and may be readily applied to other dynamical processes occurring on adaptive networks, notably, the spreading of contagious diseases or the diffusion of innovations.
Boolean Operations on Conic Polygons
Institute of Scientific and Technical Information of China (English)
Yong-Xi Gong; Yu Liu; Lun Wu; Yu-Bo Xie
2009-01-01
An algorithm for Boolean operations on conic polygons is proposed. Conic polygons are polygons consisting of conic segments or bounded conics with directions. Preliminaries of Boolean operations on general polygons are presented. In our algorithm, the intersection points and the topological relationships between two conic polygons are computed. Boundaries are obtained by tracking path and selecting uncrossed boundaries following rule tables to build resulting conic polygons.We define a set of rules for the intersection, union, and subtraction operations on conic polygons. The algorithm considers degeneration cases such as homology, complement, interior, and exterior. The algorithm is also evaluated and implemented.
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…
Adaptive control of mobile robots using a neural network.
de Sousa Júnior, C; Hermerly, E M
2001-06-01
A Neural Network - based control approach for mobile robot is proposed. The weight adaptation is made on-line, without previous learning. Several possible situations in robot navigation are considered, including uncertainties in the model and presence of disturbance. Weight adaptation laws are presented as well as simulation results.
Adaptation to synchronization in phase-oscillator networks
Arizmendi, Fernando; Zanette, Damian H.
2008-01-01
We introduce an adaptation algorithm by which an ensemble of coupled oscillators with attractive and repulsive interactions is induced to adopt a prescribed synchronized state. While the performance of adaptation is controlled by measuring a macroscopic quantity, which characterizes the achieved degree of synchronization, adaptive changes are introduced at the microscopic level of the interaction network, by modifying the configuration of repulsive interactions. This scheme emulates the disti...
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.
Wavelet Neural Networks for Adaptive Equalization
Institute of Scientific and Technical Information of China (English)
JIANGMinghu; DENGBeixing; GIELENGeorges; ZHANGBo
2003-01-01
A structure based on the Wavelet neural networks (WNNs) is proposed for nonlinear channel equalization in a digital communication system. The construction algorithm of the Minimum error probability (MEP) is presented and applied as a performance criterion to update the parameter matrix of wavelet networks. Our experimental results show that performance of the proposed wavelet networks based on equalizer can significantly improve the neural modeling accuracy, perform quite well in compensating the nonlinear distortion introduced by the channel, and outperform the conventional neural networks in signal to noise ratio and channel non-llnearity.
Profiling of genetic switches using boolean implications in expression data.
Çakır, Mehmet Volkan; Binder, Hans; Wirth, Henry
2014-01-01
Correlation analysis assuming coexpression of the genes is a widely used method for gene expression analysis in molecular biology. Yet growing extent, quality and dimensionality of the molecular biological data permits emerging, more sophisticated approaches like Boolean implications. We present an approach which is a combination of the SOM (self organizing maps) machine learning method and Boolean implication analysis to identify relations between genes, metagenes and similarly behaving metagene groups (spots). Our method provides a way to assign Boolean states to genes/metagenes/spots and offers a functional view over significantly variant elements of gene expression data on these three different levels. While being able to cover relations between weakly correlated entities Boolean implication method also decomposes these relations into six implication classes. Our method allows one to validate or identify potential relationships between genes and functional modules of interest and to assess their switching behaviour. Furthermore the output of the method renders it possible to construct and study the network of genes. By providing logical implications as updating rules for the network it can also serve to aid modelling approaches.
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.
Network-topology-adaptive quantum conference protocols
Institute of Scientific and Technical Information of China (English)
Zhang Sheng; Wang Jian; Tang Chao-Jing; Zhang Quan
2011-01-01
As an important application of the quantum network communication,quantum multiparty conference has made multiparty secret communication possible.Previous quantum multiparty conference schemes based on quantum data encryption are insensitive to network topology.However,the topology of the quantum network significantly affects the communication efficiency,e.g.,parallel transmission in a channel with limited bandwidth.We have proposed two distinctive protocols,which work in two basic network topologies with efficiency higher than the existing ones.We first present a protocol which works in the reticulate network using Greeberger-Horne-Zeilinger states and entanglement swapping.Another protocol,based on quantum multicasting with quantum data compression,which can improve the efficiency of the network,works in the star-like network.The security of our protocols is guaranteed by quantum key distribution and one-time-pad encryption.In general,the two protocols can be applied to any quantum network where the topology can be equivalently transformed to one of the two structures we propose in our protocols.
Adaptive swarm-based routing in communication networks
Institute of Scientific and Technical Information of China (English)
吕勇; 赵光宙; 苏凡军; 历小润
2004-01-01
Swarm intelligence inspired by the social behavior of ants boasts a number of attractive features,including adaptation,robustness and distributed,decentralized nature,which are well suited for routing in modern communication networks.This paper describes an adaptive swarm-based routing algorithm that increases convergence speed,reduces routing instabilities and oscillations by using a novel variation of reinforcement learning and a technique called momentum.Experiment on the dynamic network showed that adaptive swarm-based routing learns the optimum routing in terms of convergence speed and average packet latency.
Adaptive swarm-based routing in communication networks
Institute of Scientific and Technical Information of China (English)
吕勇; 赵光宙; 苏凡军; 历小润
2004-01-01
Swarm intelligence inspired by the social behavior of ants boasts a number of attractive features, including adaptation, robustness and distributed, decentralized nature, which are well suited for routing in modern communication networks. This paper describes an adaptive swarm-based routing algorithm that increases convergence speed, reduces routing instabilities and oscillations by using a novel variation of reinforcement learning and a technique called momentum.Experiment on the dynamic network showed that adaptive swarm-based routing learns the optimum routing in terms of convergence speed and average packet latency.
Temporal and structural heterogeneities emerging in adaptive temporal networks
Aoki, Takaaki; Rocha, Luis E. C.; Gross, Thilo
2016-04-01
We introduce a model of adaptive temporal networks whose evolution is regulated by an interplay between node activity and dynamic exchange of information through links. We study the model by using a master equation approach. Starting from a homogeneous initial configuration, we show that temporal and structural heterogeneities, characteristic of real-world networks, spontaneously emerge. This theoretically tractable model thus contributes to the understanding of the dynamics of human activity and interaction networks.
Temporal and structural heterogeneities emerging in adaptive temporal networks
Aoki, Takaaki; Gross, Thilo
2015-01-01
We introduce a model of adaptive temporal networks whose evolution is regulated by an interplay between node activity and dynamic exchange of information through links. We study the model by using a master equation approach. Starting from a homogeneous initial configuration, we show that temporal and structural heterogeneities, characteristic of real-world networks, spontaneously emerge. This theoretically tractable model thus contributes to the understanding of the dynamics of human activity and interaction networks.
Adaptive Network Dynamics and Evolution of Leadership in Collective Migration
Pais, Darren
2013-01-01
The evolution of leadership in migratory populations depends not only on costs and benefits of leadership investments but also on the opportunities for individuals to rely on cues from others through social interactions. We derive an analytically tractable adaptive dynamic network model of collective migration with fast timescale migration dynamics and slow timescale adaptive dynamics of individual leadership investment and social interaction. For large populations, our analysis of bifurcations with respect to investment cost explains the observed hysteretic effect associated with recovery of migration in fragmented environments. Further, we show a minimum connectivity threshold above which there is evolutionary branching into leader and follower populations. For small populations, we show how the topology of the underlying social interaction network influences the emergence and location of leaders in the adaptive system. Our model and analysis can describe other adaptive network dynamics involving collective...
Adaptive impulsive cluster synchronization in community network with nonidentical nodes
Gong, Xiaoli; Gan, Luyining; Wu, Zhaoyan
2016-07-01
In this paper, cluster synchronization in community network with nonidentical nodes is investigated. Through introducing proper adaptive strategy into impulsive control scheme, adaptive impulsive controllers are designed for achieving the cluster synchronization. In this adaptive impulsive control scheme, for any given networks, the impulsive gains can adjust themselves to proper values according to the proposed adaptive strategy when the impulsive intervals are fixed. The impulsive instants can be estimated by solving a sequence of maximum value problems when the impulsive gains are fixed. Both community networks without and with coupling delay are considered. Based on the Lyapunov function method and mathematical analysis technique, two synchronization criteria are derived. Several numerical examples are performed to verify the effectiveness of the derived theoretical results.
Time-adaptive and history-adaptive multicriterion routing in stochastic, time-dependent networks
DEFF Research Database (Denmark)
Pretolani, Daniele; Nielsen, Lars Relund; Andersen, Kim Allan;
2009-01-01
We compare two different models for multicriterion routing in stochastic time-dependent networks: the classic "time-adaptive'' model and the more flexible "history-adaptive'' one. We point out several properties of the sets of efficient solutions found under the two models. We also devise a metho...
Construction of optimized Boolean functions
Institute of Scientific and Technical Information of China (English)
CHEN Wei; YANG Yi-xian; NIU Xin-xin
2006-01-01
Considering connections of characteristics,this paper is aimed at the construction of optimized Boolean functions.A new method based on the Bent function,discrete Walsh spectrum and characteristics matrices are presented by concatenating,breaking,and revising output sequences conditionally.This new construction can be used to construct different kinds of functions satisfying different design criteria.
Mental Models of Boolean Concepts
Goodwin, Geoffrey P.; Johnson-Laird, P. N.
2011-01-01
Negation, conjunction, and disjunction are major building blocks in the formation of concepts. This article presents a new model-based theory of these Boolean components. It predicts that individuals simplify the models of instances of concepts. Evidence corroborates the theory and challenges alternative accounts, such as those based on minimal…
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 decompositio
Evolutionary Design of Boolean Functions
Institute of Scientific and Technical Information of China (English)
WANG Zhang-yi; ZHANG Huan-guo; QIN Zhong-ping; MENG Qing-shu
2005-01-01
We use evolutionary computing to synthesize Boolean functions randomly. By using specific crossover and mutation operator in evolving process and modifying search space and fitness function, we get some high non-linearity functions which have other good cryptography characteristics such as autocorrelation etc. Comparing to other heuristic search techniques, evolutionary computing approach is more effective because of global search strategy and implicit parallelism.
Concurrent enhancement of percolation and synchronization in adaptive networks
Eom, Young-Ho; Caldarelli, Guido
2015-01-01
Co-evolutionary adaptive mechanisms are not only ubiquitous in nature, but also beneficial for the functioning of a variety of systems. We here consider an adaptive network of oscillators with a stochastic, fitness-based, rule of connectivity, and show that it self-organizes from fragmented and incoherent states to connected and synchronized ones. The synchronization and percolation are associated to abrupt transitions, and they are concurrently (and significantly) enhanced as compared to the non-adaptive case. Finally we provide evidence that only partial adaptation is sufficient to determine these enhancements. Our study, therefore, indicates that inclusion of simple adaptive mechanisms can efficiently describe some emergent features of networked systems' collective behaviors, and suggests also self-organized ways to control synchronization and percolation in natural and social systems.
Concurrent enhancement of percolation and synchronization in adaptive networks
Eom, Young-Ho; Boccaletti, Stefano; Caldarelli, Guido
2016-06-01
Co-evolutionary adaptive mechanisms are not only ubiquitous in nature, but also beneficial for the functioning of a variety of systems. We here consider an adaptive network of oscillators with a stochastic, fitness-based, rule of connectivity, and show that it self-organizes from fragmented and incoherent states to connected and synchronized ones. The synchronization and percolation are associated to abrupt transitions, and they are concurrently (and significantly) enhanced as compared to the non-adaptive case. Finally we provide evidence that only partial adaptation is sufficient to determine these enhancements. Our study, therefore, indicates that inclusion of simple adaptive mechanisms can efficiently describe some emergent features of networked systems’ collective behaviors, and suggests also self-organized ways to control synchronization and percolation in natural and social systems.
Controling contagious processes on temporal networks via adaptive rewiring
Belik, Vitaly; Hövel, Philipp
2015-01-01
We consider recurrent contagious processes on a time-varying network. As a control procedure to mitigate the epidemic, we propose an adaptive rewiring mechanism for temporary isolation of infected nodes upon their detection. As a case study, we investigate the network of pig trade in Germany. Based on extensive numerical simulations for a wide range of parameters, we demonstrate that the adaptation mechanism leads to a significant extension of the parameter range, for which most of the index nodes (origins of the epidemic) lead to vanishing epidemics. We find that diseases with detection times around a week and infectious periods up to 3 months can be effectively controlled. Furthermore the performance of adaptation is very heterogeneous with respect to the index node. We identify index nodes that are most responsive to the adaptation strategy and quantify the success of the proposed adaptation scheme in dependence on the infectious period and detection times.
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 adaptation
Adaptive computational resource allocation for sensor networks
Institute of Scientific and Technical Information of China (English)
WANG Dian-hong; FEI E; YAN Yu-jie
2008-01-01
To efficiently utilize the limited computational resource in real-time sensor networks, this paper focu-ses on the challenge of computational resource allocation in sensor networks and provides a solution with the method of economies. It designs a mieroeconomic system in which the applications distribute their computational resource consumption across sensor networks by virtue of mobile agent. Further, it proposes the market-based computational resource allocation policy named MCRA which satisfies the uniform consumption of computational energy in network and the optimal division of the single computational capacity for multiple tasks. The simula-tion in the scenario of target tracing demonstrates that MCRA realizes an efficient allocation of computational re-sources according to the priority of tasks, achieves the superior allocation performance and equilibrium perform-ance compared to traditional allocation policies, and ultimately prolongs the system lifetime.
Network Reliability Algorithm Based on Pathset Matrix and Boolean Operation%基于路集矩阵与布尔运算的网络可靠度算法
Institute of Scientific and Technical Information of China (English)
高会生; 展敬宇; 王博颖; 李潇睿
2012-01-01
This paper analyzes the network reliability algorithm based on pathset matrix, and there exists a serious combination explosion problem in this algorithm. Aiming at this problem, it proposes a network reliability algorithm based on pathset matrix and boolean operation. The concept of bit vector is introduced. In addition, the pre-process of special pathsets and count of all-one bit vectors are also implied. Experimental results show that it not only increases the memory utilization, reduce the redundancy but also relieve the combination explosion problem in some degree.%分析基于路集矩阵与布尔运算的网络可靠度算法,指出其存在组合爆炸问题.为此,提出一种改进算法,引入位矢量以减少内存需求,对特殊路集进行预处理并统计全1位矢量.实验结果表明,改进算法可提高内存利用率、减少冗余运算,能在一定程度上缓解组合爆炸问题.
Extending the Lifetime of Sensor Networks through Adaptive Reclustering
Directory of Open Access Journals (Sweden)
Ferrari Gianluigi
2007-01-01
Full Text Available We analyze the lifetime of clustered sensor networks with decentralized binary detection under a physical layer quality-of-service (QoS constraint, given by the maximum tolerable probability of decision error at the access point (AP. In order to properly model the network behavior, we consider four different distributions (exponential, uniform, Rayleigh, and lognormal for the lifetime of a single sensor. We show the benefits, in terms of longer network lifetime, of adaptive reclustering. We also derive an analytical framework for the computation of the network lifetime and the penalty, in terms of time delay and energy consumption, brought by adaptive reclustering. On the other hand, absence of reclustering leads to a shorter network lifetime, and we show the impact of various clustering configurations under different QoS conditions. Our results show that the organization of sensors in a few big clusters is the winning strategy to maximize the network lifetime. Moreover, the observation of the phenomenon should be frequent in order to limit the penalties associated with the reclustering procedure. We also apply the developed framework to analyze the energy consumption associated with the proposed reclustering protocol, obtaining results in good agreement with the performance of realistic wireless sensor networks. Finally, we present simulation results on the lifetime of IEEE 802.15.4 wireless sensor networks, which enrich the proposed analytical framework and show that typical networking performance metrics (such as throughput and delay are influenced by the sensor network lifetime.
Epidemic processes over adaptive state-dependent networks
Ogura, Masaki; Preciado, Victor M.
2016-06-01
In this paper we study the dynamics of epidemic processes taking place in adaptive networks of arbitrary topology. We focus our study on the adaptive susceptible-infected-susceptible (ASIS) model, where healthy individuals are allowed to temporarily cut edges connecting them to infected nodes in order to prevent the spread of the infection. In this paper we derive a closed-form expression for a lower bound on the epidemic threshold of the ASIS model in arbitrary networks with heterogeneous node and edge dynamics. For networks with homogeneous node and edge dynamics, we show that the resulting lower bound is proportional to the epidemic threshold of the standard SIS model over static networks, with a proportionality constant that depends on the adaptation rates. Furthermore, based on our results, we propose an efficient algorithm to optimally tune the adaptation rates in order to eradicate epidemic outbreaks in arbitrary networks. We confirm the tightness of the proposed lower bounds with several numerical simulations and compare our optimal adaptation rates with popular centrality measures.
Scalable Lunar Surface Networks and Adaptive Orbit Access
Wang, Xudong
2015-01-01
Teranovi Technologies, Inc., has developed innovative network architecture, protocols, and algorithms for both lunar surface and orbit access networks. A key component of the overall architecture is a medium access control (MAC) protocol that includes a novel mechanism of overlaying time division multiple access (TDMA) and carrier sense multiple access with collision avoidance (CSMA/CA), ensuring scalable throughput and quality of service. The new MAC protocol is compatible with legacy Institute of Electrical and Electronics Engineers (IEEE) 802.11 networks. Advanced features include efficiency power management, adaptive channel width adjustment, and error control capability. A hybrid routing protocol combines the advantages of ad hoc on-demand distance vector (AODV) routing and disruption/delay-tolerant network (DTN) routing. Performance is significantly better than AODV or DTN and will be particularly effective for wireless networks with intermittent links, such as lunar and planetary surface networks and orbit access networks.
Cost-Optimal Execution of Trees of Boolean Operators with Shared Streams
Casanova, Henri; Lim, Lipyeow; Robert, Yves; Vivien, Frédéric; Zaidouni, Dounia
2013-01-01
The processing of queries expressed as trees of boolean operators applied to predicates on sensor data streams has several applications in mobile computing. Sensor data must be retrieved from the sensors to a query processing device, such as a smartphone, over one or more network interfaces. Retrieving a data item incurs a cost, e.g., an energy expense that depletes the smartphone's battery. Since the query tree contains boolean operators, part of the tree can be shortcircuited depending on t...
Adaptive mechanism-based congestion control for networked systems
Liu, Zhi; Zhang, Yun; Chen, C. L. Philip
2013-03-01
In order to assure the communication quality in network systems with heavy traffic and limited bandwidth, a new ATRED (adaptive thresholds random early detection) congestion control algorithm is proposed for the congestion avoidance and resource management of network systems. Different to the traditional AQM (active queue management) algorithms, the control parameters of ATRED are not configured statically, but dynamically adjusted by the adaptive mechanism. By integrating with the adaptive strategy, ATRED alleviates the tuning difficulty of RED (random early detection) and shows a better control on the queue management, and achieve a more robust performance than RED under varying network conditions. Furthermore, a dynamic transmission control protocol-AQM control system using ATRED controller is introduced for the systematic analysis. It is proved that the stability of the network system can be guaranteed when the adaptive mechanism is finely designed. Simulation studies show the proposed ATRED algorithm achieves a good performance in varying network environments, which is superior to the RED and Gentle-RED algorithm, and providing more reliable service under varying network conditions.
Explosive Synchronization and Emergence of Assortativity on Adaptive Networks
Institute of Scientific and Technical Information of China (English)
JIANG Hui-Jun; WU Hao; HOU Zhong-Huai
2011-01-01
@@ We report an explosive transition from incoherence to synchronization of coupled phase oscillators on adaptive networks,following an Achlioptas process based on dynamic clustering information.During each adaptive step of the network topology,a portion of the links is randomly removed and the same amount of new links is generated following the so-called product rules(PRs) applied to the dynamic clusters.Particularly,two types of PRs are considered,namely,the min-PR and max-PR.We demonstrate that the synchronization transition becomes explosive in both cases.Interestingly,we find that the min-PR rule can lead to disassortativity of the network topology,while the max-PR rule leads to assortativity.%We report an explosive transition from incoherence to synchronization of coupled phase oscillators on adaptive networks, following an Achlioptas process based on dynamic clustering information. During each adaptive step of the network topology, a portion of the links is randomly removed and the same amount of new links is generated following the so-called product rules (PRs) applied to the dynamic clusters. Particularly, two types of PRs are considered, namely, the min-PR and max-PR. We demonstrate that the synchronization transition becomes explosive in both cases. Interestingly, we find that the min-PR rule can lead to disassortativity of the network topology, while the max-PR rule leads to assortativity.
Adaptive Neural Network Based Control of Noncanonical Nonlinear Systems.
Zhang, Yanjun; Tao, Gang; Chen, Mou
2016-09-01
This paper presents a new study on the adaptive neural network-based control of a class of noncanonical nonlinear systems with large parametric uncertainties. Unlike commonly studied canonical form nonlinear systems whose neural network approximation system models have explicit relative degree structures, which can directly be used to derive parameterized controllers for adaptation, noncanonical form nonlinear systems usually do not have explicit relative degrees, and thus their approximation system models are also in noncanonical forms. It is well-known that the adaptive control of noncanonical form nonlinear systems involves the parameterization of system dynamics. As demonstrated in this paper, it is also the case for noncanonical neural network approximation system models. Effective control of such systems is an open research problem, especially in the presence of uncertain parameters. This paper shows that it is necessary to reparameterize such neural network system models for adaptive control design, and that such reparameterization can be realized using a relative degree formulation, a concept yet to be studied for general neural network system models. This paper then derives the parameterized controllers that guarantee closed-loop stability and asymptotic output tracking for noncanonical form neural network system models. An illustrative example is presented with the simulation results to demonstrate the control design procedure, and to verify the effectiveness of such a new design method.
Boolean Models of Biological Processes Explain Cascade-Like Behavior.
Chen, Hao; Wang, Guanyu; Simha, Rahul; Du, Chenghang; Zeng, Chen
2016-01-01
Biological networks play a key role in determining biological function and therefore, an understanding of their structure and dynamics is of central interest in systems biology. In Boolean models of such networks, the status of each molecule is either "on" or "off" and along with the molecules interact with each other, their individual status changes from "on" to "off" or vice-versa and the system of molecules in the network collectively go through a sequence of changes in state. This sequence of changes is termed a biological process. In this paper, we examine the common perception that events in biomolecular networks occur sequentially, in a cascade-like manner, and ask whether this is likely to be an inherent property. In further investigations of the budding and fission yeast cell-cycle, we identify two generic dynamical rules. A Boolean system that complies with these rules will automatically have a certain robustness. By considering the biological requirements in robustness and designability, we show that those Boolean dynamical systems, compared to an arbitrary dynamical system, statistically present the characteristics of cascadeness and sequentiality, as observed in the budding and fission yeast cell- cycle. These results suggest that cascade-like behavior might be an intrinsic property of biological processes.
Boolean Models of Biological Processes Explain Cascade-Like Behavior.
Chen, Hao; Wang, Guanyu; Simha, Rahul; Du, Chenghang; Zeng, Chen
2016-01-01
Biological networks play a key role in determining biological function and therefore, an understanding of their structure and dynamics is of central interest in systems biology. In Boolean models of such networks, the status of each molecule is either "on" or "off" and along with the molecules interact with each other, their individual status changes from "on" to "off" or vice-versa and the system of molecules in the network collectively go through a sequence of changes in state. This sequence of changes is termed a biological process. In this paper, we examine the common perception that events in biomolecular networks occur sequentially, in a cascade-like manner, and ask whether this is likely to be an inherent property. In further investigations of the budding and fission yeast cell-cycle, we identify two generic dynamical rules. A Boolean system that complies with these rules will automatically have a certain robustness. By considering the biological requirements in robustness and designability, we show that those Boolean dynamical systems, compared to an arbitrary dynamical system, statistically present the characteristics of cascadeness and sequentiality, as observed in the budding and fission yeast cell- cycle. These results suggest that cascade-like behavior might be an intrinsic property of biological processes. PMID:26821940
Adaptive Network Dynamics and Evolution of Leadership in Collective Migration
Pais, Darren; Leonard, Naomi Ehrich
2013-01-01
The evolution of leadership in migratory populations depends not only on costs and benefits of leadership investments but also on the opportunities for individuals to rely on cues from others through social interactions. We derive an analytically tractable adaptive dynamic network model of collective migration with fast timescale migration dynamics and slow timescale adaptive dynamics of individual leadership investment and social interaction. For large populations, our analysis of bifurcatio...
Adaptive network models of collective decision making in swarming systems
Chen, Li; Huepe, Cristián; Gross, Thilo
2016-08-01
We consider a class of adaptive network models where links can only be created or deleted between nodes in different states. These models provide an approximate description of a set of systems where nodes represent agents moving in physical or abstract space, the state of each node represents the agent's heading direction, and links indicate mutual awareness. We show analytically that the adaptive network description captures a phase transition to collective motion in some swarming systems, such as the Vicsek model, and that the properties of this transition are determined by the number of states (discrete heading directions) that can be accessed by each agent.
Adaptive network models of collective decision making in swarming systems
Chen, Li; Gross, Thilo
2015-01-01
We consider a class of adaptive network models where links can only be created or deleted between nodes in different states. These models provide an approximate description of a set of systems where nodes represent agents moving in physical or abstract space, the state of each node represents the agent's heading direction, and links indicate mutual awareness. We show analytically that the adaptive network description captures the phase transition to collective motion in swarming systems and that the properties of this transition are determined by the number of states (discrete heading directions) that can be accessed by each agent.
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,
An Adaptive Complex Network Model for Brain Functional Networks
Gomez Portillo, Ignacio J.; Gleiser, Pablo M.
2009-01-01
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 diffe...
Decentralized adaptive synchronization of an uncertain complex delayed dynamical network
Institute of Scientific and Technical Information of China (English)
Weisong ZHONG; Jun ZHAO; Georgi M.DIMIROVSKI
2009-01-01
In this paper,we investigate the locally and globally adaptive synchronization problem for an uncertain complex dynamical network with time-varying coupling delays based on the decentralized control.The coupling terms here are bounded by high-order polynomials with known gains that are ubiquitous in a large class of complex dynamical networks.We generalize the usual technology of searching for an appropriate coordinates transformation to change the network dynamics into a series of decoupled lower-dimensional systems.Several adaptive synchronization criteria are derived by constructing the Lyapunov-Krasovskii functional and Barbalat lemma,and the proposed criteria are simple in form and convenient for the practical engineering design.Numerical simulations illustrated by a nearest-neighbor coupling network verify the effectiveness of the proposed synchronization scheme.
Study on Adaptive Control with Neural Network Compensation
Institute of Scientific and Technical Information of China (English)
单剑锋; 黄忠华; 崔占忠
2004-01-01
A scheme of adaptive control based on a recurrent neural network with a neural network compensation is presented for a class of nonlinear systems with a nonlinear prefix. The recurrent neural network is used to identify the unknown nonlinear part and compensate the difference between the real output and the identified model output. The identified model of the controlled object consists of a linear model and the neural network. The generalized minimum variance control method is used to identify pareters, which can deal with the problem of adaptive control of systems with unknown nonlinear part, which can not be controlled by traditional methods. Simulation results show that this algorithm has higher precision, faster convergent speed.
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.
Boolean Factor Congruences and Property (*)
Terraf, Pedro Sánchez
2008-01-01
A variety V has Boolean factor congruences (BFC) if the set of factor congruences of every algebra in V is a distributive sublattice of its congruence lattice; this property holds in rings with unit and in every variety which has a semilattice operation. BFC has a prominent role in the study of uniqueness of direct product representations of algebras, since it is a strengthening of the refinement property. We provide an explicit Mal'cev condition for BFC. With the aid of this condition, it is shown that BFC is equivalent to a variant of the definability property (*), an open problem in R. Willard's work ("Varieties Having Boolean Factor Congruences," J. Algebra, 132 (1990)).
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.
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.
Adaptive projective synchronization with different scaling factors in networks
Institute of Scientific and Technical Information of China (English)
Guo Liu-Xiao; Xu Zhen-Yuan; Hu Man-Feng
2008-01-01
We study projective synchronization with different scaling factors (PSDF) in N coupled chaotic systems networks.By using the adaptive linear control,some sufficient criteria for the PSDF in symmetrical and asymmetrical coupled networks are separately given based on the Lyapunov function method and the left eigenvalue theory.Numerical simulations for a generalized chaotic unified system are illustrated to verify the theoretical results.
Optimization of an adaptive neural network to predict breathing
Murphy, Martin J; Pokhrel, Damodar
2008-01-01
Purpose: To determine the optimal configuration and performance of an adaptive feed forward neural network filter to predict breathing in respiratory motion compensation systems for external beam radiation therapy. Method and Materials: A two-layer feed forward neural network was trained to predict future breathing amplitudes for 27 recorded breathing histories. The prediction intervals ranged from 100 to 500 ms. The optimal sampling frequency, number of input samples, training rate, and numb...
Adaptive control of call acceptance in WCDMA network
Milan Manojle Šunjevarić; Goran Z. Đukanović; Nataša M. Gospić
2013-01-01
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 probabilit...
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.
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
Boolean Reasoning with Graphs of Partitions
Goossens, Daniel
2010-01-01
version longue du papier court "A Dynamic Boolean Knowledge Base" accepté à ICTAI 2010. This paper presents an implemented architecture for easy learning, reorganizing and navigation into a Boolean knowledge base. As the base grows with new definitions and constraints, it is normalized by the closure of a completion operator. This normalization allows arbitrary formats for Boolean expressions. It ensures basic reasoning abilities and spontaneously organizes intermingled taxonomies of conce...
Model Checking of Boolean Process Models
Schneider, Christoph; Wehler, Joachim
2011-01-01
In the field of Business Process Management formal models for the control flow of business processes have been designed since more than 15 years. Which methods are best suited to verify the bulk of these models? The first step is to select a formal language which fixes the semantics of the models. We adopt the language of Boolean systems as reference language for Boolean process models. Boolean systems form a simple subclass of coloured Petri nets. Their characteristics are low tokens to mode...
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 secondary interest. We show that PTFs on general Boolean domains are tightly connected to depth two threshold circuits. Our main results in regard to this connection are: PTFs of polynomial length and polynomial degree compute exactly the functions computed by THRMAJ circuits. An exponential length lower...
Progress in Applications of Boolean Functions
Sasao, Tsutomu
2010-01-01
This book brings together five topics on the application of Boolean functions. They are 1. Equivalence classes of Boolean functions: The number of n-variable functions is large, even for values as small as n = 6, and there has been much research on classifying functions. There are many classifications, each with their own distinct merit. 2. Boolean functions for cryptography: The process of encrypting/decrypting plain text messages often depends on Boolean functions with specific properties. For example, highly nonlinear functions are valued because they are less susceptible to linear attacks.
Adaptive synchronization in an array of asymmetric coupled neural networks
Institute of Scientific and Technical Information of China (English)
Gao Ming; Cui Bao-Tong
2009-01-01
This paper investigates the global synchronization in an array of linearly coupled neural networks with constant and delayed coupling. By a simple combination of adaptive control and linear feedback with the updated laws, some sufficient conditions are derived for global synchronization of the coupled neural networks. The coupling configuration matrix is assumed to be asymmetric, which is more coincident with the realistic network. It is shown that the approaches developed here extend and improve the earlier works. Finally, numerical simulations are presented to demonstrate the effectiveness of the theoretical results.
An Adaptive Neural Network Model for Nonlinear Programming Problems
Institute of Scientific and Technical Information of China (English)
Xiang-sun Zhang; Xin-jian Zhuo; Zhu-jun Jing
2002-01-01
In this paper a canonical neural network with adaptively changing synaptic weights and activation function parameters is presented to solve general nonlinear programming problems. The basic part of the model is a sub-network used to find a solution of quadratic programming problems with simple upper and lower bounds. By sequentially activating the sub-network under the control of an external computer or a special analog or digital processor that adjusts the weights and parameters, one then solves general nonlinear programming problems. Convergence proof and numerical results are given.
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 and...
High dynamic adaptive mobility network model and performance analysis
Institute of Scientific and Technical Information of China (English)
LIU Hui; ZHANG Jun
2008-01-01
Since mobile networks are not currently deployed on a large scale, research in this area is mostly by simulation. Among other simulation parameters, the mobility model plays a very important role in determining the protocol performance in MANET. Based on random direction mobility model, a high dynamic adaptive mo-bility network model is proposed in the paper. The algorithms and modeling are mainly studied and explained in detail. The technique keystone is that normal dis-tribution is combined with uniform distribution and inertial feedback control is combined with kinematics, through the adaptive control on nodes speed and pre-diction tracking on nodes routes, an adaptive model is designed, which can be used in simulations to produce realistic and dynamic network scenarios. It is the adaptability that nodes mobile parameters can be adjusted randomly in three-dimensional space. As a whole, colony mobility can show some rules. Such ran-dom movement processes as varied speed and dwells are simulated realistically. Such problems as sharp turns and urgent stops are smoothed well. The model can be adapted to not only common dynamic scenarios, but also high dynamic sce-narios. Finally, the mobility model performance is analyzed and validated based on random dynamic scenarios simulations.
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
Opinion dynamics on a group structured adaptive network
Gargiulo, F
2009-01-01
Many models have been proposed to analyze the evolution of opinion structure due to the interaction of individuals in their social environment. Such models analyze the spreading of ideas both in completely interacting backgrounds and on social networks, where each person has a finite set of interlocutors.Moreover also the investigation on the topological structure of social networks has been object of several analysis, both from the theoretical and the empirical point of view. In this framework a particularly important area of study regards the community structure inside social networks.In this paper we analyze the reciprocal feedback between the opinions of the individuals and the structure of the interpersonal relationships at the level of community structures. For this purpose we define a group based random network and we study how this structure co-evolve with opinion dynamics processes. We observe that the adaptive network structure affects the opinion dynamics process helping the consensus formation. Th...
An Adaptive Replica Allocation Algorithm in Mobile Ad Hoc Networks
Institute of Scientific and Technical Information of China (English)
JingZheng; JinshuSu; KanYang
2004-01-01
In mobile ad hoc networks (MANET), nodes move freely and the distribution of access requests changes dynamically. Replica allocation in such a dynamic environment is a significant challenge. In this paoer, a dynamic adaptive replica allocation algorithm that can adapt to the nodes motion is proposed to minimize the communication cost of object access. When changes occur in the access requests of the object or the network topology, each replica node collects access requests from its neighbors and makes decisions locally to expand replica to neighbors or to relinquish the replica. The algorithm dynamically adapts the replica allocation scheme to a local optimal one. Simulation results show that our algorithms efficiently reduce the communication cost of object access in MANET environment.
Genetic adaptation of the antibacterial human innate immunity network
Directory of Open Access Journals (Sweden)
Lazarus Ross
2011-07-01
Full Text Available Abstract Background Pathogens have represented an important selective force during the adaptation of modern human populations to changing social and other environmental conditions. The evolution of the immune system has therefore been influenced by these pressures. Genomic scans have revealed that immune system is one of the functions enriched with genes under adaptive selection. Results Here, we describe how the innate immune system has responded to these challenges, through the analysis of resequencing data for 132 innate immunity genes in two human populations. Results are interpreted in the context of the functional and interaction networks defined by these genes. Nucleotide diversity is lower in the adaptors and modulators functional classes, and is negatively correlated with the centrality of the proteins within the interaction network. We also produced a list of candidate genes under positive or balancing selection in each population detected by neutrality tests and showed that some functional classes are preferential targets for selection. Conclusions We found evidence that the role of each gene in the network conditions the capacity to evolve or their evolvability: genes at the core of the network are more constrained, while adaptation mostly occurred at particular positions at the network edges. Interestingly, the functional classes containing most of the genes with signatures of balancing selection are involved in autoinflammatory and autoimmune diseases, suggesting a counterbalance between the beneficial and deleterious effects of the immune response.
Adaptive Control of Flexible Redundant Manipulators Using Neural Networks
Institute of Scientific and Technical Information of China (English)
SONG Yimin; LI Jianxin; WANG Shiyu; LIU Jianping
2006-01-01
An investigation on the neural networks based active vibration control of flexible redundant manipulators was conducted.The smart links of the manipulator were synthesized with the flexible links to which were attached piezoceramic actuators and strain gauge sensors.A nonlinear adaptive control strategy named neural networks based indirect adaptive control (NNIAC) was employed to improve the dynamic performance of the manipulator.The mathematical model of the 4-layered dynamic recurrent neural networks (DRNN) was introduced.The neuro-identifier and the neurocontroller featuring the DRNN topology were designed off line so as to enhance the initial robustness of the NNIAC.By adjusting the neuro-identifier and the neuro-controller alternatively,the manipulator was controlled on line for achieving the desired dynamic performance.Finally,a planar 3R redundant manipulator with one smart link was utilized as an illustrative example.The simulation results proved the validity of the control strategy.
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.
Adaptive Route Selection Policy Based on Back Propagation Neural Networks
Directory of Open Access Journals (Sweden)
Fang Jing
2008-03-01
Full Text Available One of the key issues in the study of multiple route protocols in mobile ad hoc networks (MANETs is how to select routes to the packet transmission destination. There are currently two route selection methods: primary routing policy and load-balancing policy. Many ad hoc routing protocols are based on primary (fastest or shortest but busiest routing policy from the self-standpoint of traffic transmission optimization of each node. Load-balancing protocols equalize transmission load among multiple routes in the network. However, the lack of global perspective can cause congestion in primary policy and prolong delay time in load-balancing policy. So, although they are sometimes efficient, these two types of policies cannot adapt to intricately changing network conditions. We propose a new multiple route protocol with an Adaptive route selection Policy based on a Back propagation Neural network (APBN to optimize selection policy. In our study, we used a gradient ascent algorithm to determine the relationship between different optimum route selection polices and varying conditions in the communication network and to make a neural network that learns this relationship using the Back Propagation (BP algorithm to predict the next optimum route selection policy. We evaluated our protocol using Omnet simulator. The results show that the proposed scheme performs better than current protocols.
Fast Learning in Spiking Neural Networks by Learning Rate Adaptation
Institute of Scientific and Technical Information of China (English)
方慧娟; 罗继亮; 王飞
2012-01-01
For accelerating the supervised learning by the SpikeProp algorithm with the temporal coding paradigm in spiking neural networks (SNNs), three learning rate adaptation methods (heuristic rule, delta-delta rule, and delta-bar-delta rule), which are used to speed up training in artificial neural networks, are used to develop the training algorithms for feedforward SNN. The performance of these algorithms is investigated by four experiments: classical XOR (exclusive or) problem, Iris dataset, fault diagnosis in the Tennessee Eastman process, and Poisson trains of discrete spikes. The results demonstrate that all the three learning rate adaptation methods are able to speed up convergence of SNN compared with the original SpikeProp algorithm. Furthermore, if the adaptive learning rate is used in combination with the momentum term, the two modifications will balance each other in a beneficial way to accomplish rapid and steady convergence. In the three learning rate adaptation methods, delta-bar-delta rule performs the best. The delta-bar-delta method with momentum has the fastest convergence rate, the greatest stability of training process, and the maximum accuracy of network learning. The proposed algorithms in this paper are simple and efficient, and consequently valuable for practical applications of SNN.
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.
Boolean Search: Current State and Perspectives.
Frants, Valery I.; Shapiro, Jacob; Taksa, Isak; Voiskunskii, Vladimir G.
1999-01-01
Discusses the use of Boolean logic in information-retrieval systems and analyzes existing criticisms of operational systems. Considers users' ability to use and understand Boolean operators, ranking, the quality of query formulations, and negative effects of criticism; and concludes that criticism is directed at the methodology employed in…
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.
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 speci
Robust adaptive synchronization of chaotic neural networks by slide technique
Institute of Scientific and Technical Information of China (English)
Lou Xu-Yang; Cui Bao-Tong
2008-01-01
In this paper,we focus on the robust adaptive synchronization between two coupled chaotic neural networks with all the parameters unknown and time-varying delay.In order to increase the robustness of the two coupled neural networks,the key idea is that a sliding-mode-type controller is employed.Moreover,without the estimate values of the network unknown parameters taken as an updating object,a new updating object is introduced in the constructing of controller.Using the proposed controller,without any requirements for the boundedness,monotonicity and differentiability of activation functions,and symmetry of connections,the two coupled chaotic neural networks can achieve global robust synchronization no matter what their initial states are.Finally,the numerical simulation validates the effectiveness and feasibility of the proposed technique.
Reliable adaptive multicast protocol in wireless Ad hoc networks
Institute of Scientific and Technical Information of China (English)
Sun Baolin; Li Layuan
2006-01-01
In wireless ad hoc network environments, every link is wireless and every node is mobile. Those features make data lost easily as well as multicasting inefficient and unreliable. Moreover, Efficient and reliable multicast in wireless ad hoc network is a difficult issue. It is a major challenge to transmission delays and packet losses due to link changes of a multicast tree at the provision of high delivery ratio for each packet transmission in wireless ad hoc network environment.In this paper, we propose and evaluate Reliable Adaptive Multicast Protocol (RAMP) based on a relay node concept. Relay nodes are placed along the multicast tree. Data recovery is done between relay nodes. RAMP supports a reliable multicasting suitable for mobile ad hoc network by reducing the number of packet retransmissions. We compare RAMP with SRM (Scalable Reliable Multicast). Simulation results show that the RAMP has high delivery ratio and low end-to-end delay for packet transmission.
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.
Novel Intrusion Detection using Probabilistic Neural Network and Adaptive Boosting
Tran, Tich Phuoc; Tran, Dat; Nguyen, Cuong Duc
2009-01-01
This article applies Machine Learning techniques to solve Intrusion Detection problems within computer networks. Due to complex and dynamic nature of computer networks and hacking techniques, detecting malicious activities remains a challenging task for security experts, that is, currently available defense systems suffer from low detection capability and high number of false alarms. To overcome such performance limitations, we propose a novel Machine Learning algorithm, namely Boosted Subspace Probabilistic Neural Network (BSPNN), which integrates an adaptive boosting technique and a semi parametric neural network to obtain good tradeoff between accuracy and generality. As the result, learning bias and generalization variance can be significantly minimized. Substantial experiments on KDD 99 intrusion benchmark indicate that our model outperforms other state of the art learning algorithms, with significantly improved detection accuracy, minimal false alarms and relatively small computational complexity.
Adaptive Immune Evolutionary Algorithms Based on Immune Network Regulatory Mechanism
Institute of Scientific and Technical Information of China (English)
HE Hong; QIAN Feng
2007-01-01
Based on immune network regulatory mechanism, a new adaptive immune evolutionary algorithm (AIEA) is proposed to improve the performance of genetic algorithms (GA) in this paper. AIEA adopts novel selection operation according to the stimulation level of each antibody. A memory base for good antibodies is devised simultaneously to raise the convergent rapidity of the algorithm and adaptive adjusting strategy of antibody population is used for preventing the loss of the population adversity. The experiments show AIFA has better convergence performance than standard genetic algorithm and is capable of maintaining the adversity of the population and solving function optimization problems in an efficient and reliable way.
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
Effect of Adaptive Delivery Capacity on Networked Traffic Dynamics
Institute of Scientific and Technical Information of China (English)
CAO Xian-Bin; DU Wen-Bo; CHEN Cai-Long; ZHANG Jun
2011-01-01
@@ We introduce an adaptive delivering capacity mechanism into the traffic dynamic model on scale-free networks under shortest path routing strategy and focus on its effect on the network capacity measured by the critical point(Rc) of phase transition from free flow to congestion.Under this mechanism,the total node's delivering capacity is fixed and the allocation of delivering capacity on node i is proportional to niφ,where ni is the queue length of node i and φ is the adjustable parameter.It is found that the network capacity monotonously increases with the increment of φ,but there exists an optimal value of parameter φ leading to the highest transportation efficiency measured by average travelling time(〈T〉).Our work may be helpful for optimal design of networked traffic dynamics.%We introduce an adaptive delivering capacity mechanism into the traffic dynamic model on scale-free networks under shortest path routing strategy and focus on its effect on the network capacity measured by the critical point (Rc) of phase transition from free flow to congestion.Under this mechanism, the total node's delivering capacity is fixed and the allocation of delivering capacity on node i is proportional to niφ, where ni is the queue length of node i and φ is the adjustable parameter.It is found that the network capacity monotonously increases with the increment of φ, but there exists an optimal value of parameter φ leading to the highest transportation efficiency measured by average travelling time (＜T＞).Our work may be helpful for optimal design of networked traffic dynamics.
Pulse-transmission Oscillators: Autonomous Boolean Models and the Yeast Cell Cycle
Sevim, Volkan; Gong, Xinwei; Socolar, Joshua
2010-03-01
Models of oscillatory gene expression typically involve a constitutively expressed or positively autoregulated gene which is repressed by a negative feedback loop. In Boolean representations of such systems, which include the repressilator and relaxation oscillators, dynamical stability stems from the impossibility of satisfying all of the Boolean rules at once. We consider a different class of networks, in which oscillations are due to the transmission of a pulse of gene activation around a ring. Using autonomous Boolean modeling methods, we show how the circulating pulse can be stabilized by decoration of the ring with certain feedback and feed-forward motifs. We then discuss the relation of these models to ODE models of transcriptional networks, emphasizing the role of explicit time delays. Finally, we show that a network recently proposed as a generator of cell cycle oscillations in yeast contains the motifs required to support stable transmission oscillations.
Adaptation in Food Networks: Theoretical Framework and Empirical Evidences
Directory of Open Access Journals (Sweden)
Gaetano Martino
2013-03-01
Full Text Available The paper concerns the integration in food networks under a governance point of view. We conceptualize the integration processes in terms of the adaptation theory and focus the issues related under a transaction cost economics perspective. We conjecture that the allocation of decisions rights between the parties to a transaction is a key instrument in order to cope with the sources of basic uncertainty in food networks: technological innovation, sustainability strategies, quality and safety objectives. Six case studies are proposed which contribute to corroborate our conjecture. Managerial patters based on a joint decision approach also are documented
Adaptive Data Rates for Flexible Transceivers in Optical Networks
Directory of Open Access Journals (Sweden)
Brian Thomas Teipen
2012-05-01
Full Text Available Efforts towards commercializing higher-speed optical transmission have demonstrated the need for advanced modulation formats, several of which require similar transceiver hardware architecture. Adaptive transceivers can be built to have a number of possible operational configurations selected by software. Such software-defined transceiver configurations can create specific modulation formats to support sets of data rates, corresponding tolerances to system impairments, and sets of electronic digital signal processing schemes chosen to best function in a given network environment. In this paper, we discuss possibilities and advantages of reconfigurable, bit-rate flexible transceivers, and their potential applications in future optical networks.
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....
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......-changing environmental energy sources. In this paper, we present an improved and extended version of ODMAC and we analyze it by means of an analytical model that can approximate several performance metrics in an arbitrary network topology. The simulations and the analytical experiments show ODMAC's ability to satisfy...
Rescue of endemic states in interconnected networks with adaptive coupling.
Vazquez, F; Serrano, M Ángeles; Miguel, M San
2016-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 when the two layers are interconnected but not in each layer separately, 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 -and therefore on the interconnected system- 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 rewiring amplifies finite-size effects, preventing the disease transmission between finite networks, as there is a non zero probability that the epidemics stays confined in only one network during its lifetime. PMID:27380771
Dynamic data-driven sensor network adaptation for border control
Bein, Doina; Madan, Bharat B.; Phoha, Shashi; Rajtmajer, Sarah; Rish, Anna
2013-06-01
Given a specific scenario for the border control problem, we propose a dynamic data-driven adaptation of the associated sensor network via embedded software agents which make sensor network control, adaptation and collaboration decisions based on the contextual information value of competing data provided by different multi-modal sensors. We further propose the use of influence diagrams to guide data-driven decision making in selecting the appropriate action or course of actions which maximize a given utility function by designing a sensor embedded software agent that uses an influence diagram to make decisions about whether to engage or not engage higher level sensors for accurately detecting human presence in the region. The overarching goal of the sensor system is to increase the probability of target detection and classification and reduce the rate of false alarms. The proposed decision support software agent is validated experimentally on a laboratory testbed for multiple border control scenarios.
Adaptive Air-Fuel Ratio Control with MLP Network
Institute of Scientific and Technical Information of China (English)
Shi-Wei Wang; Ding-Li Yu
2005-01-01
This paper presents an application of adaptive neural network model-based predictive control (MPC) to the air-fuel ratio of an engine simulation. A multi-layer perceptron (MLP) neural network is trained using two on-line training algorithms: a back propagation algorithm and a recursive least squares (RLS) algorithm. It is used to model parameter uncertainties in the nonlinear dynamics of internal combustion (IC) engines. Based on the adaptive model, an MPC strategy for controlling air-fuel ratio is realized, and its control performance compared with that of a traditional PI controller.A reduced Hessian method, a newly developed sequential quadratic programming (SQP) method for solving nonlinear programming (NLP) problems, is implemented to speed up nonlinear optimization in the MPC.
Adaptive control of system with hysteresis using neural networks
Institute of Scientific and Technical Information of China (English)
Li Chuntao; Tan Yonghong
2006-01-01
An adaptive control scheme is developed for a class of single-input nonlinear systems preceded by unknown hysteresis, which is a non-differentiable and multi-value mapping nonlinearity. The controller based on the three-layer neural network (NN), whose weights are derived from Lyapunov stability analysis, guarantees closed-loop semiglobal stability and convergence of the tracking errors to a small residual set. An example is used to confirm the effectiveness of the proposed control scheme.
Adaptive Medium Access Control Protocol for Wireless Body Area Networks
Javaid, N.; Ahmad, A.; A. Rahim; Z.A. Khan; M. Ishfaq; Qasim, U.
2014-01-01
Wireless Body Area Networks (WBANs) are widely used for applications such as modern health-care systems, where wireless sensors (nodes) monitor the parameter(s) of interest. Nodes are provided with limited battery power and battery power is dependent on radio activity. MAC protocols play a key role in controlling the radio activity. Therefore, we present Adaptive Medium Access Control (A-MAC) protocol for WBANs supported by linear programming models for the minimization of energy consumption ...
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. PMID:27111037
RATE ADAPTIVE PROTOCOL FOR MULTIRATE IEEE 802.11 NETWORKS
Institute of Scientific and Technical Information of China (English)
Xi Yong; Huang Qingyan; Wei Jibo; Zhao Haitao
2007-01-01
In this paper,a rate adaptive protocol AMARF(Adaptive Multirate Auto Rate Fallback)for multirate IEEE 802.11 networks is proposed.In AMARF,each data rate is assigned a unique success threshold,which is a criterion to judge when to switch a rate to the next higher one,and the success thresholds call be adjusted dynamically in an adaptive manner according to the running conditions,such as packet length and channel parameters.Moreover,the proposed protocol can be implemented by software without any change to the current IEEE 802.11 standards.Simulation result shows that AMARF yields significantly higher throughput than other existing schemes including ARF and its variants,in various running conditions.
Channel Adaptive Shortest Path Routing for Ad Hoc Networks
Institute of Scientific and Technical Information of China (English)
TIAN Hui; XIE Fang; HU Jian-dong; ZHANG Ping
2003-01-01
Routing in Mobile Ad Hoc Network (MANET) is a challenge owing to the dynamic nature of network topology and the resource constraints. To maximize the channel resource utilization and minimize the network transfer delay along the path, the shortest path with the minimum hops approach is often adopted. However, the quality of wireless channels among the mobile nodes is time varying owing to fading, shadowing and path loss. Considering adaptive channel coding and modulation scheme, the channel state can be characterized by different link throughputs. If routing selection based on the link throughput is implemented, the minimum transfer delay from source to destination and the maximal throughput may be obtained. In this paper, a Channel Adaptive Shortest Path Routing (CASPR) is presented. Based on the adaptive channel coding and modulation, the CASPR transforms the link throughput into the channel quality factor Q and finds the shortest routing according to the Q measure. Simulation results show that the average path length in the proposed routing scheme may be slightly higher than that of the conventional shortest path with the minimum hops approach, but it can reduce the average transfer delay and increase the packet deliver rate.
Adaptive local routing strategy on a scale-free network
Liu, Feng; Zhao, Han; Li, Ming; Ren, Feng-Yuan; Zhu, Yan-Bo
2010-04-01
Due to the heterogeneity of the structure on a scale-free network, making the betweennesses of all nodes become homogeneous by reassigning the weights of nodes or edges is very difficult. In order to take advantage of the important effect of high degree nodes on the shortest path communication and preferentially deliver packets by them to increase the probability to destination, an adaptive local routing strategy on a scale-free network is proposed, in which the node adjusts the forwarding probability with the dynamical traffic load (packet queue length) and the degree distribution of neighbouring nodes. The critical queue length of a node is set to be proportional to its degree, and the node with high degree has a larger critical queue length to store and forward more packets. When the queue length of a high degree node is shorter than its critical queue length, it has a higher probability to forward packets. After higher degree nodes are saturated (whose queue lengths are longer than their critical queue lengths), more packets will be delivered by the lower degree nodes around them. The adaptive local routing strategy increases the probability of a packet finding its destination quickly, and improves the transmission capacity on the scale-free network by reducing routing hops. The simulation results show that the transmission capacity of the adaptive local routing strategy is larger than that of three previous local routing strategies.
Adaptive Influence Maximization in Social Networks: Why Commit when You can Adapt?
Vaswani, Sharan; Lakshmanan, Laks V. S.
2016-01-01
Most previous work on influence maximization in social networks is limited to the non-adaptive setting in which the marketer is supposed to select all of the seed users, to give free samples or discounts to, up front. A disadvantage of this setting is that the marketer is forced to select all the seeds based solely on a diffusion model. If some of the selected seeds do not perform well, there is no opportunity to course-correct. A more practical setting is the adaptive setting in which the ma...
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.
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. PMID:24112643
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
Adaptive Congestion Control Protocol (ACCP for Wireless Sensor Networks
Directory of Open Access Journals (Sweden)
James DzisiGadze
2013-10-01
Full Text Available In Wireless Sensor Networks (WSN when an event is detected there is an increase in data traffic that mightlead to packets being transmitted through the network close to the packet handling capacity of the WSN.The WSN experiences a decrease in network performance due to packet loss, long delays, and reduction inthroughput. In this paper we developed an adaptive congestion control algorithm that monitors networkutilization and adjust traffic levels and/or increases network resources to improve throughput and conserveenergy. The traffic congestion control protocol DelStatic is developed by introducing backpressuremechanism into NOAH. We analyzed various routing protocols and established that DSR has a higherresource congestion control capability. The proposed protocol, ACCP uses a sink switching algorithm totrigger DelStatic or DSR feedback to a congested node based on its Node Rank. From the simulationresults, ACCP protocol does not only improve throughput but also conserves energy which is critical tosensor application survivability on the field. Our Adaptive Congestion control achieved reliability, highthroughput and energy efficiency.
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.
Mining TCGA data using Boolean implications.
Sinha, Subarna; Tsang, Emily K; Zeng, Haoyang; Meister, Michela; Dill, David L
2014-01-01
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/.
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/.
Model Checking of Boolean Process Models
Schneider, Christoph
2011-01-01
In the field of Business Process Management formal models for the control flow of business processes have been designed since more than 15 years. Which methods are best suited to verify the bulk of these models? The first step is to select a formal language which fixes the semantics of the models. We adopt the language of Boolean systems as reference language for Boolean process models. Boolean systems form a simple subclass of coloured Petri nets. Their characteristics are low tokens to model explicitly states with a subsequent skipping of activations and arbitrary logical rules of type AND, XOR, OR etc. to model the split and join of the control flow. We apply model checking as a verification method for the safeness and liveness of Boolean systems. Model checking of Boolean systems uses the elementary theory of propositional logic, no modal operators are needed. Our verification builds on a finite complete prefix of a certain T-system attached to the Boolean system. It splits the processes of the Boolean sy...
Adaptive topology evolution in information-sharing social networks
Chen, Duanbing; Lu, Linyuan; Medo, Matus; Zhang, Yi-Cheng; Zhou, Tao
2011-01-01
The advent of Internet and World Wide Web has led to unprecedent growth of the information available. People usually face the information overload by following a limited number of sources which best fit their interests. In order to get the picture it is important to address issues like who people do follow and how they search for better information sources. In this work we conduct an empirical analysis on different on-line social networking sites, and draw inspiration from its results to present different source selection strategies in an adaptive model for social recommendation. We show that local search rules which enhance the typical topological features of real social communities give rise to network configurations that are globally optimal. Hence these abstract rules help to create networks which are both effective in information diffusion and people friendly.
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.
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.
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. PMID:22726907
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.
Densities of mixed volumes for Boolean models
Weil, Wolfgang
2001-01-01
In generalization of the well-known formulae for quermass densities of stationary and isotropic Boolean models, we prove corresponding results for densities of mixed volumes in the stationary situation and show how they can be used to determine the intensity of non-isotropic Boolean models Z in d-dimensional space for d = 2, 3, 4. We then consider non-stationary Boolean models and extend results of Fallert on quermass densities to densities of mixed volumes. In particular, we present explicit...
Directory of Open Access Journals (Sweden)
G.C. Rao
2012-11-01
Full Text Available A C- algebra is the algebraic form of the 3-valued conditional logic, which was introduced by F. Guzman and C. C. Squier in 1990. In this paper, some equivalent conditions for a C- algebra to become a boolean algebra in terms of congruences are given. It is proved that the set of all central elements B(A is isomorphic to the Boolean algebra of all C-algebras Sa, where a B(A. It is also proved that B(A is isomorphic to the Boolean algebra of all C-algebras Aa, where a B(A.
Generalizing Boolean Satisfiability II: Theory
Dixon, H E; Luks, E M; Parkes, A J; 10.1613/jair.1555
2011-01-01
This is the second of three planned papers describing ZAP, a satisfiability engine that substantially generalizes existing tools while retaining the performance characteristics of modern high performance solvers. The fundamental idea underlying ZAP is that many problems passed to such engines contain rich internal structure that is obscured by the Boolean representation used; our goal is to define a representation in which this structure is apparent and can easily be exploited to improve computational performance. This paper presents the theoretical basis for the ideas underlying ZAP, arguing that existing ideas in this area exploit a single, recurring structure in that multiple database axioms can be obtained by operating on a single axiom using a subgroup of the group of permutations on the literals in the problem. We argue that the group structure precisely captures the general structure at which earlier approaches hinted, and give numerous examples of its use. We go on to extend the Davis-Putnam-Logemann-...
Local Correction of Boolean Functions
Alon, Noga
2011-01-01
A Boolean function f over n variables is said to be q-locally correctable if, given a black-box access to a function g which is "close" to an isomorphism f_sigma of f, we can compute f_sigma(x) for any x in Z_2^n with good probability using q queries to g. We observe that any k-junta, that is, any function which depends only on k of its input variables, is O(2^k)-locally correctable. Moreover, we show that there are examples where this is essentially best possible, and locally correcting some k-juntas requires a number of queries which is exponential in k. These examples, however, are far from being typical, and indeed we prove that for almost every k-junta, O(k log k) queries suffice.
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.
An Adaptive Power Efficient Packet Scheduling Algorithm for Wimax Networks
Prasad, R Murali
2010-01-01
Admission control schemes and scheduling algorithms are designed to offer QoS services in 802.16/802.16e networks and a number of studies have investigated these issues. But the channel condition and priority of traffic classes are very rarely considered in the existing scheduling algorithms. Although a number of energy saving mechanisms have been proposed for the IEEE 802.16e, to minimize the power consumption of IEEE 802.16e mobile stations with multiple real-time connections has not yet been investigated. Moreover, they mainly consider non real- time connections in IEEE 802.16e networks. In this paper, we propose to design an adaptive power efficient packet scheduling algorithm that provides a minimum fair allocation of the channel bandwidth for each packet flow and additionally minimizes the power consumption. In the adaptive scheduling algorithm, packets are transmitted as per allotted slots from different priority of traffic classes adaptively, depending on the channel condition. Suppose if the buffer s...
Multisource Adaptive Data Distribution and Routing in Wireless Sensor Networks
Mukherjee, Subhabrata; Naskar, Mrinal K; Mukherjee, Amitava
2012-01-01
The wireless sensor network is a collection of energy-constrained nodes. Their objective is to sense, collect and process information for some ad-hoc purpose. Typically the nodes are deployed in geographically inaccessible regions. Thus the most challenging task is to design a network with minimal power consumption. As the nodes have to collect and process data very fast, minimizing data delivery time is another objective. In addition to this, when multiple sources transmit data simultaneously, the network load gradually increases and it may lead to congestion. In this paper we have proposed an adaptive framework in which multiple sources transmit data simultaneously with minimal end-to-end data delivery time and minimal energy consumption besides ensuring that congestion remains at an optimum low so that minimal number of data packets are dropped. This paper presents an adaptive framework to achieve the above-mentioned objectives. This framework has been used over Mac 802.11 and extensive simulations have be...
Effects of adaptive dynamical linking in networked games
Yang, Zhihu; Li, Zhi; Wu, Te; Wang, Long
2013-10-01
The role of dynamical topologies in the evolution of cooperation has received considerable attention, as some studies have demonstrated that dynamical networks are much better than static networks in terms of boosting cooperation. Here we study a dynamical model of evolution of cooperation on stochastic dynamical networks in which there are no permanent partners to each agent. Whenever a new link is created, its duration is randomly assigned without any bias or preference. We allow the agent to adaptively adjust the duration of each link during the evolution in accordance with the feedback from game interactions. By Monte Carlo simulations, we find that cooperation can be remarkably promoted by this adaptive dynamical linking mechanism both for the game of pairwise interactions, such as the Prisoner's Dilemma game (PDG), and for the game of group interactions, illustrated by the public goods game (PGG). And the faster the adjusting rate, the more successful the evolution of cooperation. We also show that in this context weak selection favors cooperation much more than strong selection does. What is particularly meaningful is that the prosperity of cooperation in this study indicates that the rationality and selfishness of a single agent in adjusting social ties can lead to the progress of altruism of the whole population.
An Adaptive Lossless Data Compression Scheme for Wireless Sensor Networks
Directory of Open Access Journals (Sweden)
Jonathan Gana Kolo
2012-01-01
Full Text Available Energy is an important consideration in the design and deployment of wireless sensor networks (WSNs since sensor nodes are typically powered by batteries with limited capacity. Since the communication unit on a wireless sensor node is the major power consumer, data compression is one of possible techniques that can help reduce the amount of data exchanged between wireless sensor nodes resulting in power saving. However, wireless sensor networks possess significant limitations in communication, processing, storage, bandwidth, and power. Thus, any data compression scheme proposed for WSNs must be lightweight. In this paper, we present an adaptive lossless data compression (ALDC algorithm for wireless sensor networks. Our proposed ALDC scheme performs compression losslessly using multiple code options. Adaptive compression schemes allow compression to dynamically adjust to a changing source. The data sequence to be compressed is partitioned into blocks, and the optimal compression scheme is applied for each block. Using various real-world sensor datasets we demonstrate the merits of our proposed compression algorithm in comparison with other recently proposed lossless compression algorithms for WSNs.
An adaptive blind watermarking scheme utilizing neural network for synchronization
Institute of Scientific and Technical Information of China (English)
WU Jian-zhen; XIE Jian-ying; YANG Yu-pu
2007-01-01
An important problem constraining the practical implementation of robust watermarking technology is the low robustness of existing algorithms against geometrical distortions. An adaptive blind watermarking scheme utilizing neural network for synchronization is proposed in this paper,which allows to recover watermark even if the image has been subjected to generalized geometrical transforms. Through classification of image's brightness, texture and contrast sensitivity utilizing fuzzy clustering theory and human visual system, more robust watermark is adaptively embedded in DWT domain. In order to register rotation, scaling and translation parameters, feedforward neural network is utilized to learn image geometric pattern represented by six combined low order image moments. The distortion can be inverted after determining the affine distortion applied to the image and watermark can be extracted in a standard way without original image. It only needs a trained neural network. Experimental results demonstrate its advantages over previous method in terms of computational effectiveness and parameter estimation accuracy. It can embed more robust watermark under certain visual distance, and effectively resist JPEG compression, noise and geometric attacks.
Adapting Bayes Network Structures to Non-stationary Domains
DEFF Research Database (Denmark)
Nielsen, Søren Holbech; Nielsen, Thomas Dyhre
2008-01-01
is gradually being constructed as observations of the environment are made. Existing algorithms for incremental learning assume that the samples in the database have been drawn from a single underlying distribution. In this paper we relax this assumption, so that the underlying distribution can change during......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...... the sampling of the database. The proposed method can thus be used in unknown environments, where it is not even known whether the dynamics of the environment are stable. We state formal correctness results for our method, and demonstrate its feasibility experimentally...
Sensor Activation and Radius Adaptation (SARA) in Heterogeneous Sensor Networks
Bartolini, Novella; la Porta, Thomas; Petrioli, Chiara; Silvestri, Simone
2010-01-01
In this paper we address the problem of prolonging the lifetime of wireless sensor networks (WSNs) deployed to monitor an area of interest. In this scenario, a helpful approach is to reduce coverage redundancy and therefore the energy expenditure due to coverage. We introduce the first algorithm which reduces coverage redundancy by means of Sensor Activation and sensing Radius Adaptation (SARA)in a general applicative scenario with two classes of devices: sensors that can adapt their sensing range (adjustable sensors) and sensors that cannot (fixed sensors). In particular, SARA activates only a subset of all the available sensors and reduces the sensing range of the adjustable sensors that have been activated. In doing so, SARA also takes possible heterogeneous coverage capabilities of sensors belonging to the same class into account. It specifically addresses device heterogeneity by modeling the coverage problem in the Laguerre geometry through Voronoi-Laguerre diagrams. SARA executes quickly and is guarante...
Boolean Logic with Fault Tolerant Coding
Alagoz, B. Baykant
2009-01-01
Error detectable and error correctable coding in Hamming space was researched to discover possible fault tolerant coding constellations, which can implement Boolean logic with fault tolerant property. Basic logic operators of the Boolean algebra were developed to apply fault tolerant coding in the logic circuits. It was shown that application of three-bit fault tolerant codes have provided the digital system skill of auto-recovery without need for designing additional-fault tolerance mechanisms.
Minimum-Risk Path Finding by an Adaptive Amoebal Network
Nakagaki, Toshiyuki; Iima, Makoto; Ueda, Tetsuo; Nishiura, Yasumasa; Saigusa, Tetsu; Tero, Atsushi; Kobayashi, Ryo; Showalter, Kenneth
2007-08-01
When two food sources are presented to the slime mold Physarum in the dark, a thick tube for absorbing nutrients is formed that connects the food sources through the shortest route. When the light-avoiding organism is partially illuminated, however, the tube connecting the food sources follows a different route. Defining risk as the experimentally measurable rate of light-avoiding movement, the minimum-risk path is exhibited by the organism, determined by integrating along the path. A model for an adaptive-tube network is presented that is in good agreement with the experimental observations.
Adaptive Framework for Data Distribution in Wireless Sensor Networks
Mukherjee, Subhabrata; Mukherjee, Amitava
2012-01-01
In recent years, the wireless sensor network (WSN) is playing a key role in sensing, collecting and disseminating information in various applications. An important feature associated with WSN is to develop an efficient data distribution and routing scheme to ensure better quality of service (QoS) that reduces the power consumption and the end-to-end data delivery time. In this work, we propose an adaptive framework to transmit data packets from a source to the sink in WSN across multiples paths with strategically distributed data packets so as to minimize the power consumption as well as the end-to-end data delivery time.
Spatial Path Following for AUVs Using Adaptive Neural Network Controllers
Directory of Open Access Journals (Sweden)
Jiajia Zhou
2013-01-01
Full Text Available The spatial path following control problem of autonomous underwater vehicles (AUVs is addressed in this paper. In order to realize AUVs’ spatial path following control under systemic variations and ocean current, three adaptive neural network controllers which are based on the Lyapunov stability theorem are introduced to estimate uncertain parameters of the vehicle’s model and unknown current disturbances. These controllers are designed to guarantee that all the error states in the path following system are asymptotically stable. Simulation results demonstrated that the proposed controller was effective in reducing the path following error and was robust against the disturbances caused by vehicle's uncertainty and ocean currents.
Multiple cardiac arrhythmia recognition using adaptive wavelet network.
Lin, Chia-Hung; Chen, Pei-Jarn; Chen, Yung-Fu; Lee, You-Yun; Chen, Tainsong
2005-01-01
This paper proposes a method for electrocardiogram (ECG) heartbeat pattern recognition using adaptive wavelet network (AWN). The ECG beat recognition can be divided into a sequence of stages, starting from feature extraction and conversion of QRS complexes, and then identifying cardiac arrhythmias based on the detected features. The discrimination method of ECG beats is a two-subnetwork architecture, consisting of a wavelet layer and a probabilistic neural network (PNN). Morlet wavelets are used to extract the features from each heartbeat, and then PNN is used to analyze the meaningful features and perform discrimination tasks. The AWN is suitable for application in a dynamic environment, with add-in and delete-off features using automatic target adjustment and parameter tuning. The experimental results obtained by testing the data of the MIT-BIH arrhythmia database demonstrate the efficiency of the proposed method. PMID:17281539
Strategic tradeoffs in competitor dynamics on adaptive networks
Hébert-Dufresne, Laurent; Noël, Pierre-André; Young, Jean-Gabriel; Libby, Eric
2016-01-01
Non-linear competitor dynamics have been studied on several non-trivial but static network structures. We consider a general model on adaptive networks and interpret the resulting structure as a signature of competitor strategies. We combine the voter model with a directed stochastic block model to encode how a strategy targets competitors (i.e., an aggressive strategy) or its own type (i.e., a defensive strategy). We solve the dynamics in particular cases with tradeoffs between aggressiveness and defensiveness. These tradeoffs yield interesting behaviors such as long transient dynamics, sensitive dependence to initial conditions, and non-transitive dynamics. Not only are such results reminiscent of classic voting paradoxes but they also translate to a dynamical view of political campaign strategies. Finally, while in a two competitor system there exists an optimal strategy that balances aggressiveness and defensiveness, three competitor systems have no such solution. The introduction of extreme strategies ca...
Feedback Stabilization over Wireless Network Using Adaptive Coded Modulation
Institute of Scientific and Technical Information of China (English)
Li Yang; Xin-Ping Guan; Cheng-Nian Long; Xiao-Yuan Luo
2008-01-01
In this paper, we apply adaptive coded modulation (ACM) schemes to a wireless networked control system (WNCS)to improve the energy efficiency and increase the data rate over a fading channel. To capture the characteristics of varying rate,interference, and routing in wireless transmission channels, the concepts of equivalent delay (ED) and networked condition index (NCI)are introduced. Also, the analytic lower and upper bounds of EDs are obtained. Furthermore, we model the WNCS as a multicontroller switched system (MSS) under consideration of EDs and loss index in the wireless transmission. Sufficient stability condition of the closed-loop WNCS and corresponding dynamic state feedback controllers are derived in terms of linear matrix inequality (LMI).Numerical results show the validity and advantage of our proposed control strategies.
LOAD AWARE ADAPTIVE BACKBONE SYNTHESIS IN WIRELESS MESH NETWORKS
Institute of Scientific and Technical Information of China (English)
Yuan Yuan; Zheng Baoyu
2009-01-01
Wireless Mesh Networks (WMNs) are envisioned to support the wired backbone with a wireless Backbone Networks (BNet) for providing internet connectivity to large-scale areas.With a wide range of internet-oriented applications with different Quality of Service (QoS) requirement,the large-scale WMNs should have good scalability and large bandwidth.In this paper,a Load Aware Adaptive Backbone Synthesis (LAABS) algorithm is proposed to automatically balance the traffic flow in the WMNs.The BNet will dynamically split into smaller size or merge into bigger one according to statistic load information of Backbone Nodes (BNs).Simulation results show LAABS generates moderate BNet size and converges quickly,thus providing scalable and stable BNet to facilitate traffic flow.
Adaptive model predictive process control using neural networks
Buescher, Kevin L.; Baum, Christopher C.; Jones, Roger D.
1997-01-01
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.
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
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.
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: (i
Adapting Mobile Beacon-Assisted Localization in Wireless Sensor Networks
Directory of Open Access Journals (Sweden)
Wei Dong
2009-04-01
Full Text Available The ability to automatically locate sensor nodes is essential in many Wireless Sensor Network (WSN applications. To reduce the number of beacons, many mobile-assisted approaches have been proposed. Current mobile-assisted approaches for localization require special hardware or belong to centralized localization algorithms involving some deterministic approaches due to the fact that they explicitly consider the impreciseness of location estimates. In this paper, we first propose a range-free, distributed and probabilistic Mobile Beacon-assisted Localization (MBL approach for static WSNs. Then, we propose another approach based on MBL, called Adapting MBL (A-MBL, to increase the efficiency and accuracy of MBL by adapting the size of sample sets and the parameter of the dynamic model during the estimation process. Evaluation results show that the accuracy of MBL and A-MBL outperform both Mobile and Static sensor network Localization (MSL and Arrival and Departure Overlap (ADO when both of them use only a single mobile beacon for localization in static WSNs.
A National Climate Change Adaptation Network for Protecting Water Security
Weaver, A.; Sauchyn, D.; Byrne, J. M.
2009-12-01
Water security and resource-dependent community-survival are being increasingly challenged as a consequence of climate change, and it is urgent that we plan now for the security of our water supplies which support our lives and livelihoods. However, the range of impacts of climate change on water availability, and the consequent environmental and human adaptations that are required, is so complex and serious that it will take the combined work of natural, health and social scientists working with industries and communities to solve them. Networks are needed that will identify crucial water issues under climate change at a range of scales in order to provide regionally-sensitive, solutions-oriented research and adaptation. We suggest national and supra-national water availability and community sustainability issues must be addressed by multidisciplinary research and adaptation networks. The work must be driven by a bottom-up research paradigm — science in the service of community and governance. We suggest that interdisciplinary teams of researchers, in partnership with community decision makers and local industries, are the best means to develop solutions as communities attempt to address future water demands, protect their homes from infrastructure damage, and meet their food, drinking water, and other essential resource requirements. The intention is to cover: the impact of climate change on Canadian natural resources, both marine and terrestrial; issues of long-term sustainability and resilience in human communities and the environments in which they are embedded; the making and moving of knowledge, be that between members of Indigenous and non-Indigenous communities, researchers of different disciplines, communities, industry, policymakers and the academy and the crucial involvement of the various orders of government in the response to water problems, under conditions of heightened uncertainty. Such an adaptation network must include a national
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.
Boolean integration. [applied to switching network synthesis
Tucker, J. H.; Tapia, M. A.; Bennett, A. W.
1976-01-01
This paper presents the necessary and sufficient conditions for a given differential expression to be compatibly integrable and it presents the necessary and sufficient conditions for a given expression to be exactly integrable. Methods are given for integrating a differential expression when it is exactly integrable and when it is compatibly integrable. The physical interpretation is given of the integral of order k, of a differential expression, and it is shown that any differential expression of the proper form is integrable by parts.
Directory of Open Access Journals (Sweden)
Kamalakshi.N
2009-11-01
Full Text Available Today's wireless networks are highly heterogeneous, with mobile devices consisting of multiple wireless network interfaces (WNICs. Since battery lifetime is limited, power management of the interfaces has become essential with flexible and open architecture, capable of supporting various types of networks, terminals and applications. However how to integrate the protocols to meet the heterogeneous network environments becomes a significant challenge in the fourth generation wireless network. Adaptive protocols are proposed to solve heterogeneity problem in future wireless networks. This paper discusses two protocols R²CP, and RCP and feasibility of RCP protocols applied to the manage power efficiently and adaptive Congestion control on heterogeneous wireless network.
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.
A recurrent neural network for adaptive beamforming and array correction.
Che, Hangjun; Li, Chuandong; He, Xing; Huang, Tingwen
2016-08-01
In this paper, a recurrent neural network (RNN) is proposed for solving adaptive beamforming problem. In order to minimize sidelobe interference, the problem is described as a convex optimization problem based on linear array model. RNN is designed to optimize system's weight values in the feasible region which is derived from arrays' state and plane wave's information. The new algorithm is proven to be stable and converge to optimal solution in the sense of Lyapunov. So as to verify new algorithm's performance, we apply it to beamforming under array mismatch situation. Comparing with other optimization algorithms, simulations suggest that RNN has strong ability to search for exact solutions under the condition of large scale constraints.
Fuzzy adaptive learning control network with sigmoid membership function
Institute of Scientific and Technical Information of China (English)
无
2007-01-01
To get simpler operation in modified fuzzy adaptive learning control network (FALCON) in some engineering application, sigmoid nonlinear function is employed as a substitute of traditional Gaussian membership function. For making the modified FALCON learning more efficient and stable, a simulated annealing (SA) learning coefficient is introduced into learning algorithm. At first, the basic concepts and main advantages of FALCON were briefly reviewed. Subsequently, the topological structure and nodes operation were illustrated; the gradient-descent learning algorithm with SA learning coefficient was derived;and the distinctions between the archetype and the modification were analyzed. Eventually, the significance and worthiness of the modified FALCON were validated by its application to probability prediction of anode effect in aluminium electrolysis cells.
Flexible and dynamic network coding for adaptive data transmission in DTNs
Radenkovic, Milena; Zakhary, Sameh
2012-01-01
Existing network coding approaches for Delay-Tolerant Networks (DTNs) do not detect and adapt to congestion in the network. In this paper we describe CafNC (Congestion aware forwarding with Network Coding) that combines adaptive network coding and adaptive forwarding in DTNs. In CafNC each node learns the status of its neighbours, and their egonetworks in order to detect coding opportunities, and codes as long as the recipients can decode. Our flexible design allows CafNC to efficiently supp...
Modeling and adaptive pinning synchronization control for a chaotic-motion motor in complex network
Energy Technology Data Exchange (ETDEWEB)
Zhu, Darui, E-mail: zdarui@163.com [State Key Laboratory of Electrical Insulation and Power Equipment, Xi' an 710049 (China); School of Electrical Engineering, Xi' an Jiaotong University, Xi' an 710049 (China); Liu, Chongxin; Yan, Bingnan [State Key Laboratory of Electrical Insulation and Power Equipment, Xi' an 710049 (China); School of Electrical Engineering, Xi' an Jiaotong University, Xi' an 710049 (China)
2014-01-24
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.
Skeleton-supported stochastic networks of organic memristive devices: Adaptations and learning
Energy Technology Data Exchange (ETDEWEB)
Erokhina, Svetlana; Sorokin, Vladimir [IFMB, Kazan Federal University, Kremliovskaya str. 18, 420008, Kazan (Russian Federation); Erokhin, Victor, E-mail: victor.erokhin@fis.unipr.it [IFMB, Kazan Federal University, Kremliovskaya str. 18, 420008, Kazan (Russian Federation); CNR-IMEM, Parco delle Scienze 37/A, 43124, Parma Italy (Italy)
2015-02-15
Stochastic networks of memristive devices were fabricated using a sponge as a skeleton material. Cyclic voltage-current characteristics, measured on the network, revealed properties, similar to the organic memristive device with deterministic architecture. Application of the external training resulted in the adaptation of the network electrical properties. The system revealed an improved stability with respect to the networks, composed from polymer fibers.
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...
Duality theories for Boolean algebras with operators
Givant, Steven
2014-01-01
In this new text, Steven Givant—the author of several acclaimed books, including works co-authored with Paul Halmos and Alfred Tarski—develops three theories of duality for Boolean algebras with operators. Givant addresses the two most recognized dualities (one algebraic and the other topological) and introduces a third duality, best understood as a hybrid of the first two. This text will be of interest to graduate students and researchers in the fields of mathematics, computer science, logic, and philosophy who are interested in exploring special or general classes of Boolean algebras with operators. Readers should be familiar with the basic arithmetic and theory of Boolean algebras, as well as the fundamentals of point-set topology.
A finite alternation result for reversible boolean circuits
Selinger, Peter
2016-01-01
We say that a reversible boolean function on n bits has alternation depth d if it can be written as the sequential composition of d reversible boolean functions, each of which acts only on the top n-1 bits or on the bottom n-1 bits. We show that every reversible boolean function of n >= 4 bits has alternation depth 9.
An integrated architecture of adaptive neural network control for dynamic systems
Energy Technology Data Exchange (ETDEWEB)
Ke, Liu; Tokar, R.; Mcvey, B.
1994-07-01
In this study, an integrated neural network control architecture for nonlinear dynamic systems is presented. Most of the recent emphasis in the neural network control field has no error feedback as the control input which rises the adaptation problem. The integrated architecture in this paper combines feed forward control and error feedback adaptive control using neural networks. The paper reveals the different internal functionality of these two kinds of neural network controllers for certain input styles, e.g., state feedback and error feedback. Feed forward neural network controllers with state feedback establish fixed control mappings which can not adapt when model uncertainties present. With error feedbacks, neural network controllers learn the slopes or the gains respecting to the error feedbacks, which are error driven adaptive control systems. The results demonstrate that the two kinds of control scheme can be combined to realize their individual advantages. Testing with disturbances added to the plant shows good tracking and adaptation.
Energy Technology Data Exchange (ETDEWEB)
Chertkov, Michael [Los Alamos National Laboratory
2012-07-24
The goal of the DTRA project is to develop a mathematical framework that will provide the fundamental understanding of network survivability, algorithms for detecting/inferring pre-cursors of abnormal network behaviors, and methods for network adaptability and self-healing from cascading failures.
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.
AQM Algorithm with Adaptive Reference Queue Threshold for Communication Networks
Directory of Open Access Journals (Sweden)
Liming Chen
2012-09-01
Full Text Available Nowadays, congestion in communication networks has been more intractable than ever before due to the explosive growth of network scale and multimedia traffic. Active queue management (AQM algorithms had been proposed to alleviate congestion to improve quality of service (QoS, but existing algorithms often suffer from some flaws in one aspect or another. In this paper, a novel AQM algorithm with adaptive reference queue threshold (ARTAQM is proposed of which the main innovative contributions are recounted as follows. First, traffic is predicted to calculate the packet loss ratio (PLR and the traffic rate based on traffic prediction algorithm. Second, by means of periodical measurements, a weighted PLR is obtained to dynamically adjust packet dropping probability in ARTAQM algorithm. Third, ARTAQM algorithm runs in both coarse and fine granularities. In coarse granularity, the mismatch of the predicted traffic rate and link capacity can adjusts the reference queue length in every period, while in fine granularity, reference queue remains fixed and the instantaneous queue is adjusted packet by packet in one period. Simulation results indicate that ARTAQM algorithm not only maintains stable queue and fast response speed, but has lower PLR and higher link utilization as well.
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.
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.
Analysis of affinely equivalent Boolean functions
Institute of Scientific and Technical Information of China (English)
MENG QingShu; ZHANG HuanGuo; YANG Min; WANG ZhangYi
2007-01-01
By some basic transforms and invariant theory, we give two results: 1) an algorithm,which can be used to judge if two Boolean functions are affinely equivalent and to obtain the equivalence relationship if they are equivalent. This is useful in studying Boolean functions and in engineering. For example, we classify all 8-variable homogeneous bent functions of degree 3 into two classes; 2) Reed-Muller codes R(4,6)/R(1,6), R(3,7)/R(1,7) are classified efficiently.
Coherent spaces, Boolean rings and quantum gates
Vourdas, A.
2016-10-01
Coherent spaces spanned by a finite number of coherent states, are introduced. Their coherence properties are studied, using the Dirac contour representation. It is shown that the corresponding projectors resolve the identity, and that they transform into projectors of the same type, under displacement transformations, and also under time evolution. The set of these spaces, with the logical OR and AND operations is a distributive lattice, and with the logical XOR and AND operations is a Boolean ring (Stone's formalism). Applications of this Boolean ring into classical CNOT gates with n-ary variables, and also quantum CNOT gates with coherent states, are discussed.
Boolean differentiation and integration using Karnaugh maps
Tucker, J. H.; Tapia, M. A.; Bennett, A. W.
1977-01-01
Algorithms are presented for differentiation and integration of Boolean functions by means of Karnaugh maps. The algorithms are considered simple when the number of variables is six or less; in this case Boolean differentiation and integration is said to be as easy as the Karnaugh map method of simplifying switching functions. It is suggested that the algorithms would be useful in the analysis of faults in combinational systems and in the synthesis of asynchronous sequential systems which utilize edge-sensitive flip-flops.
Algorithms for Boolean Function Query Properties
Aaronson, Scott
2001-01-01
We present new algorithms to compute fundamental properties of a Boolean function given in truth-table form. Specifically, we give an O(N^2.322 log N) algorithm for block sensitivity, an O(N^1.585 log N) algorithm for `tree decomposition,' and an O(N) algorithm for `quasisymmetry.' These algorithms are based on new insights into the structure of Boolean functions that may be of independent interest. We also give a subexponential-time algorithm for the space-bounded quantum query complexity of...
Suppressing Halo-chaos for Intense Ion Beamby Neural Network Adaptation Control Strategy
Institute of Scientific and Technical Information of China (English)
FANGJin-qing; LUOXiao-shu; WENGJia-qiang; ZHULun-wu
2003-01-01
Neural network has some advantages of adaptation, learn-self, self-organization and suitable for high-dimension for various applications in many fields, especially among them the feed-forward back-propagating neural network self-adaptation method is suitable for control of nonlinear systems.
Adaptive categorization of ART networks in robot behavior learning using game-theoretic formulation.
Fung, Wai-keung; Liu, Yun-hui
2003-12-01
Adaptive Resonance Theory (ART) networks are employed in robot behavior learning. Two of the difficulties in online robot behavior learning, namely, (1) exponential memory increases with time, (2) difficulty for operators to specify learning tasks accuracy and control learning attention before learning. In order to remedy the aforementioned difficulties, an adaptive categorization mechanism is introduced in ART networks for perceptual and action patterns categorization in this paper. A game-theoretic formulation of adaptive categorization for ART networks is proposed for vigilance parameter adaptation for category size control on the categories formed. The proposed vigilance parameter update rule can help improving categorization performance in the aspect of category number stability and solve the problem of selecting initial vigilance parameter prior to pattern categorization in traditional ART networks. Behavior learning using physical robot is conducted to demonstrate the effectiveness of the proposed adaptive categorization mechanism in ART networks.
Adaptive fuzzy-neural-network control for maglev transportation system.
Wai, Rong-Jong; Lee, Jeng-Dao
2008-01-01
A magnetic-levitation (maglev) transportation system including levitation and propulsion control is a subject of considerable scientific interest because of highly nonlinear and unstable behaviors. In this paper, the dynamic model of a maglev transportation system including levitated electromagnets and a propulsive linear induction motor (LIM) based on the concepts of mechanical geometry and motion dynamics is developed first. Then, a model-based sliding-mode control (SMC) strategy is introduced. In order to alleviate chattering phenomena caused by the inappropriate selection of uncertainty bound, a simple bound estimation algorithm is embedded in the SMC strategy to form an adaptive sliding-mode control (ASMC) scheme. However, this estimation algorithm is always a positive value so that tracking errors introduced by any uncertainty will cause the estimated bound increase even to infinity with time. Therefore, it further designs an adaptive fuzzy-neural-network control (AFNNC) scheme by imitating the SMC strategy for the maglev transportation system. In the model-free AFNNC, online learning algorithms are designed to cope with the problem of chattering phenomena caused by the sign action in SMC design, and to ensure the stability of the controlled system without the requirement of auxiliary compensated controllers despite the existence of uncertainties. The outputs of the AFNNC scheme can be directly supplied to the electromagnets and LIM without complicated control transformations for relaxing strict constrains in conventional model-based control methodologies. The effectiveness of the proposed control schemes for the maglev transportation system is verified by numerical simulations, and the superiority of the AFNNC scheme is indicated in comparison with the SMC and ASMC strategies. PMID:18269938
Institute of Scientific and Technical Information of China (English)
刘卫锋
2013-01-01
将软集理论应用到布尔代数中，提出了软布尔代数、软布尔子代数、软布尔代数的软理想、软理想布尔代数等概念，研究了它们的相关性质，并初步讨论了软布尔代数与几类布尔代数的模糊子代数的关系。%The soft set theory is applied to the Boolean algebra.The concepts of soft Boolean algebra, soft Boolean sub-algebra, soft ideal of soft Boolean algebra and idealistic soft Boolean algebra are presented and some related algebraic properties are discussed.The relations between soft Boolean algebra and several kinds of fuzzy subalgebras of Boolean algebra are preliminarily investigated.
Adaptive Data Fusion for Energy Efficient Routing in Wireless Sensor Network
Priya Mohite
2015-01-01
The data fusion process has led to an evolution for emerging Wireless Sensor Networks (WSNs) and examines the impact of various factors on energy consumption. Significantly there has always been a constant effort to enhance network efficiency without decreasing the quality of information. Based on Adaptive Fusion Steiner Tree (AFST), this paper proposes a heuristic algorithm called Modified Adaptive Fusion Steiner Tree (M-AFST) for energy efficient routing which not only does adaptively adjus...
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...
Demonstrating Boolean Logic Using Simple Electrical Circuits
McElhaney, Kevin W.
2004-01-01
While exploring the subject of geometric proofs, boolean logic operators AND and OR can be used to allow students to visualize their true-or-false patterns. An activity in the form of constructing electrical circuits is illustrated to explain the concept.
A Boolean Map Theory of Visual Attention
Huang, Liqiang; Pashler, Harold
2007-01-01
A theory is presented that attempts to answer two questions. What visual contents can an observer consciously access at one moment? Answer: only one feature value (e.g., green) per dimension, but those feature values can be associated (as a group) with multiple spatially precise locations (comprising a single labeled Boolean map). How can an…
Some Aspects of Boolean Valued Analysis
Kusraev, A. G.; Kutateladze, S. S.
2015-01-01
This is a survey of some recent applications of Boolean valued analysis to operator theory and harmonic analysis. Under consideration are pseudoembedding operators, the noncommutative Wickstead problem, the Radon-Nikodym Theorem for JB-algebras, and the Bochner Theorem for lattice-valued positive definite mappings on locally compact groups.
"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
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
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......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...
A Hybrid Adaptive Routing Algorithm for Event-Driven Wireless Sensor Networks
Loureiro, Antonio A. F.; Carlos M. S. Figueiredo; Eduardo F. Nakamura
2009-01-01
Routing is a basic function in wireless sensor networks (WSNs). For these networks, routing algorithms depend on the characteristics of the applications and, consequently, there is no self-contained algorithm suitable for every case. In some scenarios, the network behavior (traffic load) may vary a lot, such as an event-driven application, favoring different algorithms at different instants. This work presents a hybrid and adaptive algorithm for routing in WSNs, called Multi-MAF, that adapts ...
ADAPTIVELY IMPROVING LONG DISTANCE NETWORK TRANSFERS WITH LOGISTICS
Energy Technology Data Exchange (ETDEWEB)
LaBissoniere, D.; Roche, K.
2007-01-01
Long distance data movement is an essential activity of modern computing. However, the congestion control mechanisms in the Internet’s Transmission Control Protocol (TCP) severely limit the bandwidth achieved by long distance data transfers. The throughput of such transfers can be improved by applying the logistical technique of breaking a single long distance transfer into multiple shorter transfers. This technique can result in signifi cantly improved throughput while still respecting the shared nature of the Internet by not attempting to circumvent the TCP congestion controls. This technique has been incorporated into an algorithm which attempts to dynamically schedule transfers for optimal throughput. The algorithm couples graph techniques with real-time latency and bandwidth measurements to discover the best path and adaptively respond to network dynamics. The algorithm shows improvements in speed and fl exibility over standard data transfer methods such as FTP. Specifi c transfers tests performed between Oak Ridge National Laboratory and a destination in Sunnyvale, CA show throughput increases by a factor of two.
Resource pooling for frameless network architecture with adaptive resource allocation
Institute of Scientific and Technical Information of China (English)
XU XiaoDong; WANG Da; TAO XiaoFeng; SVENSSON Tommy
2013-01-01
The system capacity for future mobile communication needs to be increased to fulfill the emerging requirements of mobile services and innumerable applications. The cellular topology has for long been regarded as the most promising way to provide the required increase in capacity. However with the emerging densification of cell deployments, the traditional cellular structure limits the efficiency of the resource, and the coordination between different types of base stations is more complicated and entails heavy cost. Consequently, this study proposes frameless network architecture （FNA） to release the cell boundaries, enabling the topology needed to implement the FNA resource allocation strategy. This strategy is based on resource pooling incorporating a new resource dimension-antenna/antenna array. Within this architecture, an adaptive resource allocation method based on genetic algorithm is proposed to find the optimal solution for the multi-dimensional resource allocation problem. Maximum throughput and proportional fair resource allocation criteria are considered. The simulation results show that the proposed architecture and resource allocation method can achieve performance gains for both criteria with a relatively low complexity compared to existing schemes.
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.
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...
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 d
Design of artificial genetic regulatory networks with multiple delayed adaptive responses
Kaluza, Pablo
2016-01-01
Genetic regulatory networks with adaptive responses are widely studied in biology. Usually, models consisting only of a few nodes have been considered. They present one input receptor for activation and one output node where the adaptive response is computed. In this work, we design genetic regulatory networks with many receptors and many output nodes able to produce delayed adaptive responses. This design is performed by using an evolutionary algorithm of mutations and selections that minimizes an error function defined by the adaptive response in signal shapes. We present several examples of network constructions with a predefined required set of adaptive delayed responses. We show that an output node can have different kinds of responses as a function of the activated receptor. Additionally, complex network structures are presented since processing nodes can be involved in several input-output pathways.
Adaptive Personalisation in Self e-Learning Networks
Keenoy, Kevin; Poulovassilis, Alexandra; Papamarkos, George; Wood, Peter; Christophides, Vassilis; Magkanaraki, Aimilia; Stratakis, Miltos; Rigaux, Philippe; Spyratos, Nicolas
2005-01-01
This paper presents some of the personalisation services designed for self e-learning networks in the SeLeNe project. A self e-learning network consists of web-based learning objects that have been made available to the network by its users, along with metadata descriptions of these learning objects and of the network's users. The architecture of the network is distributed and service-oriented. The personalisation facilities include: querying learning object descriptions to return results tai...
Quantum walks outside of boolean domain as a gate for one, two, or three qubits
Cavin, Thomas; Solenov, Dmitry
Quantum computing needs entangling quantum gates to perform computation and error correction. We will discuss a novel way to implement quantum gates, such as CNOT, using quantum walks that are directed through a network of states outside of the boolean domain. In such implementations it is important to investigate walks on networks of different connectivities. Specifically, we will discuss solutions to non-symmetric linear chain networks and demonstrate how solutions to more complex networks that have branching, such as cubes, can be expressed in terms of linear chain solutions. We then show examples of implementing single qubit and two-qubit entangling gates.
Construction of a new adaptive wavelet network and its learning algorithm
Institute of Scientific and Technical Information of China (English)
无
2001-01-01
A new adaptive learning algorithm for constructing and training wavelet networks is proposed based on the time-frequency localization properties of wavelet frames and the adaptive projection algorithm. The exponential convergence of the adaptive projection algorithm in finite-dimensional Hilbert spaces is constructively proved, with exponential decay ratios given with high accuracy. The learning algorithm can sufficiently utilize the time-frequency information contained in the training data, iteratively determines the number of the hidden layer nodes and the weights of wavelet networks, and solves the problem of structure optimization of wavelet networks. The algorithm is simple and efficient, as illustrated by examples of signal representation and denoising.
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.
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. PMID:25390365
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
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...... 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...
Adaptive routing in wireless communication networks using swarm intelligence
Arabshahi, P.; Gray, A.; Kassabalidis, I.; Das, A.; Narayanan, S.; Sharkawi, M. El; Marks, R. J.
2001-01-01
In this paper we focus on the network routing problem, and survey swarm intelligent approaches for its efficient solution, after a brief overview of power-aware routing schemes, which are important in the network examples outlined above.
Boolean representations of simplicial complexes and matroids
Rhodes, John
2015-01-01
This self-contained monograph explores a new theory centered around boolean representations of simplicial complexes leading to a new class of complexes featuring matroids as central to the theory. The book illustrates these new tools to study the classical theory of matroids as well as their important geometric connections. Moreover, many geometric and topological features of the theory of matroids find their counterparts in this extended context. Graduate students and researchers working in the areas of combinatorics, geometry, topology, algebra and lattice theory will find this monograph appealing due to the wide range of new problems raised by the theory. Combinatorialists will find this extension of the theory of matroids useful as it opens new lines of research within and beyond matroids. The geometric features and geometric/topological applications will appeal to geometers. Topologists who desire to perform algebraic topology computations will appreciate the algorithmic potential of boolean represent...
Fast Vertical Mining Using Boolean Algebra
Directory of Open Access Journals (Sweden)
Hosny M. Ibrahim
2015-01-01
Full Text Available The vertical association rules mining algorithm is an efficient mining method, which makes use of support sets of frequent itemsets to calculate the support of candidate itemsets. It overcomes the disadvantage of scanning database many times like Apriori algorithm. In vertical mining, frequent itemsets can be represented as a set of bit vectors in memory, which enables for fast computation. The sizes of bit vectors for itemsets are the main space expense of the algorithm that restricts its expansibility. Therefore, in this paper, a proposed algorithm that compresses the bit vectors of frequent itemsets will be presented. The new bit vector schema presented here depends on Boolean algebra rules to compute the intersection of two compressed bit vectors without making any costly decompression operation. The experimental results show that the proposed algorithm, Vertical Boolean Mining (VBM algorithm is better than both Apriori algorithm and the classical vertical association rule mining algorithm in the mining time and the memory usage.
Dynamic adaptable overlay networks for personalised service delivery
Mathieu, B.; Stiemerling, M.; Soveri, M.C.; Galis, A.; Jean, K.; Ocampo, R.; Lai, Z.; Kampmann, M.; Tariq, M.A.; Balos, K.; Ahmed, O.K.; Busropan, B.J.; Prins, M.J.
2007-01-01
Overlay Networks have been designed as a promising solution to deliver new services via the use of intermediate nodes, acting as proxies or relays. This concept enables to hide the heterogeneity and variability of the underlying networks. In the Ambient Networks (ANs) project, the objectives are to
Efficient Analog Circuits for Boolean Satisfiability
Yin, Xunzhao; Sedighi, Behnam; Varga, Melinda; Ercsey-Ravasz, Maria; Toroczkai, Zoltan; Hu, Xiaobo Sharon
2016-01-01
Efficient solutions to NP-complete problems would significantly benefit both science and industry. However, such problems are intractable on digital computers based on the von Neumann architecture, thus creating the need for alternative solutions to tackle such problems. Recently, a deterministic, continuous-time dynamical system (CTDS) was proposed (Nature Physics, 7(12), 966 (2011)) to solve a representative NP-complete problem, Boolean Satisfiability (SAT). This solver shows polynomial ana...
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
Discrete interference modeling via boolean algebra.
Beckhoff, Gerhard
2011-01-01
Two types of boolean functions are considered, the locus function of n variables, and the interval function of ν = n - 1 variables. A 1-1 mapping is given that takes elements (cells) of the interval function to antidual pairs of elements in the locus function, and vice versa. A set of ν binary codewords representing the intervals are defined and used to generate the codewords of all genomic regions. Next a diallelic three-point system is reviewed in the light of boolean functions, which leads to redefining complete interference by a logic function. Together with the upper bound of noninterference already defined by a boolean function, it confines the region of interference. Extensions of these two functions to any finite number of ν are straightforward, but have been also made in terms of variables taken from the inclusion-exclusion principle (expressing "at least" and "exactly equal to" a decimal integer). Two coefficients of coincidence for systems with more than three loci are defined and discussed, one using the average of several individual coefficients and the other taking as coefficient a real number between zero and one. Finally, by way of a malfunction of the mod-2 addition, it is shown that a four-point system may produce two different functions, one of which exhibiting loss of a class of odd recombinants.
Boolean Logic Optimization in Majority-Inverter Graphs
Amarù, Luca; Gaillardon, Pierre-Emmanuel; De Micheli, Giovanni
2015-01-01
We present a Boolean logic optimization framework based on Majority-Inverter Graph (MIG). An MIG is a directed acyclic graph consisting of three-input majority nodes and regular/complemented edges. Current MIG optimization is supported by a consistent algebraic framework. However, when algebraic methods cannot improve a result quality, stronger Boolean methods are needed to attain further optimization. For this purpose, we propose MIG Boolean methods exploiting the error masking property of m...
Using Boolean Constraint Propagation for Sub-clause Deduction
Darras, Sylvain; Dequen, Gilles; Devendeville, Laure; Mazure, Bertrand; Ostrowski, Richard; Sais, Lahkdar
2005-01-01
Boolean Constraint Propagation (BCP) is recognized as one of the most use- ful technique for efficient satisfiability checking. In this paper a new extension of the scope of boolean constraint propagation is proposed. It makes an original use of BCP to achieve further reduction of boolean formulas. Considering the impli- cation graph generated by the constraint propagation process as a resolution tree, sub-clauses from the original formula can be deduced. Then, we show how such extension can ...
Ma, Chuang; Zhang, Hai-Feng
2016-01-01
So far, many network-structure-based link prediction methods have been proposed. However, these traditional methods were proposed by highlighting one or two structural features of networks, and then use the methods to implement link prediction in different networks. In many cases, the performance is not ideal since each network has its unique underlying structural features. In this article, by analyzing different real networks, we find that the structural features of different networks are remarkably different. In particular, even in the same networks, their inner structural features are utterly different. Inspired by these facts, an \\emph{adaptive} link prediction method is proposed to incorporate multiple structural features from the perspective of combination optimization. In the model, the weight of each structural feature is \\emph{adaptively } determined by logistic regression but not be artificially given in advance. According to our experimental results, we find that the logistic regression based link ...
Mapping DSP algorithms to a reconfigurable architecture Adaptive Wireless Networking (AWGN)
Rauwerda, Gerard
2003-01-01
This report will discuss the Adaptive Wireless Networking project. The vision of the Adaptive Wireless Networking project will be given. The strategy of the project will be the implementation of multiple communication systems in dynamically reconfigurable heterogeneous hardware. An overview of a wireless LAN communication system, namely HiperLAN/2, and a Bluetooth communication system will be given. Possible implementations of these systems in a dynamically reconfigurable architecture are dis...
Combinational Logic-Level Verification using Boolean Expression Diagrams
DEFF Research Database (Denmark)
Hulgaard, Henrik; Williams, Poul Frederick; Andersen, Henrik Reif
1997-01-01
Boolean Expression Diagrams (BEDs) is a new data structure for representing and manipulating Boolean functions. BEDs are a generalization of Binary Decision Diagrams (BDDs) that are capable of representing any Boolean circuit in linear space and still maintain many of the desirable properties...... 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...
Directory of Open Access Journals (Sweden)
Lubov Muhamedovna Mkrtchyan
2015-01-01
Full Text Available The development of a network communicative space causes the transformation of labor and actualizes the problem of employment as the main indicator of social security. In this regard, the article considers one of the mechanisms ensuring social security of the person as the cultural development of society and the ability to create and maintain a system of values and professional orientations of the person - effective professional adaptation, requirements to which are largely determined by the ability to manage information network technologies, professional and informational culture, the ability to self-education. In its turn, social security in modern conditions acquires the features of socio-network security as a stable state of human security and protection from the negative effects of network communications, which can modify the behavior of a person, his values, and professional orientations and mislead him in the information space. Therefore, this article analyzes the relationship of professional adaptation and professional culture which in the context of network communication is determined by specific activities of the network professional communities, propagating certain values and behaviors. The level of information culture requires from individuals not only systematic knowledge and skills in information technology, but also the ability to think critically, to provide appropriate selection of information, to oppose network risks and threats, to use the communication network as an adaptive resource in the process of self-education.
A Generalization of J-Boolean Like Rings%J-Boolean like 环的扩张
Institute of Scientific and Technical Information of China (English)
秦蕊
2014-01-01
对 J-Boolean like环进行了扩张，并且将 J-Boolean like环与广义矩阵环和Morita Context环联系起来，进而探索了部分环为 J-Boolean like环时应具备的条件，且给出若干相关例子。%The paper mainly explored the generalization of J-Boolean like rings ,and connected J-Boolean like rings with generalized matrix rings and Morita Context rings ,then studied the conditions when a part of other rings became J-Boolean like rings ,and listed some examples .
Nonlinear functional approximation with networks using adaptive neurons
Tawel, Raoul
1992-01-01
A novel mathematical framework for the rapid learning of nonlinear mappings and topological transformations is presented. It is based on allowing the neuron's parameters to adapt as a function of learning. This fully recurrent adaptive neuron model (ANM) has been successfully applied to complex nonlinear function approximation problems such as the highly degenerate inverse kinematics problem in robotics.
Directory of Open Access Journals (Sweden)
Chih-Hong Lin
2012-03-01
Full Text Available The permanent magnet synchronous motor (PMSM is suitable for high-performance servo applications and has been used widely for the industrial robots, computer-numerically-controlled (CNC machine tools and elevators. The control performance of the actual PMSM drive system depends on many parameters, such as parameter variations, external load disturbance, and friction force. Their relationships are complex and the actual PMSM drive system has the properties of nonlinear uncertainty and time-varying characteristics. It is difficult to establish an accurate model for the nonlinear uncertainty and time-varying characteristics of the actual PMSM drive system Therefore, an adaptive recurrent neural network uncertainty observer (ARNNUO based integral backstepping control system is developed to overcome this problem in this paper. The proposed control strategy is based on integral backstepping control combined with RNN uncertainty observer to estimate the required lumped uncertainty. An adaptive rule of the RNN uncertainty observer is employed to on-line adjust the weights of sigmoidal functions by using the gradient descent method and the backpropagation algorithm in according to Lyapunov function. This ARNNUO has the on-line learning ability to respond to the system’s nonlinear and time-varying behaviors. Experimental results are executed to show the control performance of the proposed control scheme.
Improved adaptive-threshold burst assembly in optical burst switching networks
Institute of Scientific and Technical Information of China (English)
Jiuru Yang; Gang Wang; Shilou Jia
2007-01-01
An improved adaptive-threshold burst assembly algorithm is proposed to alleviate the limitation of conventional assembly schemes on data loss and delay. The algorithm will adjust the values of assembly factors according to variant traffic regions. And the simulation results show that, by using the adaptive-factor adaptive assembly scheme, the performance of networks is extensively enhanced in terms of burst loss probability and average queuing delay.
Network Latency Adaptive Tempo in the Public Sound Objects System
Barbosa, Álvaro; Cardoso, Jorge; Geiger, Günter
2005-01-01
In recent years Computer Network-Music has increasingly captured the attention of the Computer Music Community. With the advent of Internet communication, geographical displacement amongst the participants of a computer mediated music performance achieved world wide extension. However, when established over long distance networks, this form of musical communication has a fundamental problem: network latency (or net-delay) is an impediment for real-time collaboration. From a recent study, carr...
Institute of Scientific and Technical Information of China (English)
FANG Jin-Qing; LUO Xiao-Shu; HUANG Guo-Xian
2006-01-01
Subject of the halo-chaos control in beam transport networks (channels) has become a key concerned issue for many important applications of high-current proton beam since 1990'. In this paper, the magnetic field adaptive control based on the neuralnetwork with time-delayed feedback is proposed for suppressing beam halo-chaos in the beam transport network with periodic focusing channels. The envelope radius of high-current proton beam is controlled to reach the matched beam radius by suitably selecting the control structure and parameter of the neural network, adjusting the delayed-time and control coefficient of the neural network.
Adaptive Resource Allocation and Internet Traffic Engineering on Data Network
Directory of Open Access Journals (Sweden)
Hatim Hussein
2015-02-01
Full Text Available This research paper describes the issues of bandwid th allocation, optimum capacity allocation, network operational cost reduction, and improve Int ernet user experience. Traffic engineering (TE is used to manipulate network traffic to achie ve certain requirements and meets certain needs. TE becomes one of the most important buildin g blocks in the design of the Internet backbone infrastructure. Research objective: effici ent allocation of bandwidth across multiple paths. Optimum path selection. Minimize network tra ffic delays and maximize bandwidth utilization over multiple network paths. The bandwi dth allocation is performed proportionally over multiple paths based on the path capacity.
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
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...
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.
Li, Ning; Cao, Jinde
2015-01-01
In this paper, we investigate synchronization for memristor-based neural networks with time-varying delay via an adaptive and feedback controller. Under the framework of Filippov's solution and differential inclusion theory, and by using the adaptive control technique and structuring a novel Lyapunov functional, an adaptive updated law was designed, and two synchronization criteria were derived for memristor-based neural networks with time-varying delay. By removing some of the basic literature assumptions, the derived synchronization criteria were found to be more general than those in existing literature. Finally, two simulation examples are provided to illustrate the effectiveness of the theoretical results. PMID:25299765
An Adaptive Scheme for Neighbor Discovery in Mobile Ad Hoc Networks
Institute of Scientific and Technical Information of China (English)
无
2007-01-01
The neighbor knowledge in mobile ad hoc networks is important information. However, the accuracy of neighbor knowledge is paid in terms of energy consumption. In traditional schemes for neighbor discovery, a mobile node uses fixed period to send HELLO messages to notify its existence. An adaptive scheme was proposed.The objective is that when mobile nodes are distributed sparsely or move slowly, fewer HELLO messages are needed to achieve reasonable accuracy, while in a mutable network where nodes are dense or move quickly, they can adaptively send more HELLO messages to ensure the accuracy. Simulation results show that the adaptive scheme achieves the objective and performs effectively.
International Nuclear Information System (INIS)
Multi-user cognitive radio network resource allocation based on the adaptive niche immune genetic algorithm is proposed, and a fitness function is provided. Simulations are conducted using the adaptive niche immune genetic algorithm, the simulated annealing algorithm, the quantum genetic algorithm and the simple genetic algorithm, respectively. The results show that the adaptive niche immune genetic algorithm performs better than the other three algorithms in terms of the multi-user cognitive radio network resource allocation, and has quick convergence speed and strong global searching capability, which effectively reduces the system power consumption and bit error rate. (geophysics, astronomy, and astrophysics)
Zu, Yun-Xiao; Zhou, Jie
2012-01-01
Multi-user cognitive radio network resource allocation based on the adaptive niche immune genetic algorithm is proposed, and a fitness function is provided. Simulations are conducted using the adaptive niche immune genetic algorithm, the simulated annealing algorithm, the quantum genetic algorithm and the simple genetic algorithm, respectively. The results show that the adaptive niche immune genetic algorithm performs better than the other three algorithms in terms of the multi-user cognitive radio network resource allocation, and has quick convergence speed and strong global searching capability, which effectively reduces the system power consumption and bit error rate.
Institute of Scientific and Technical Information of China (English)
Zu Yun-Xiao; Zhou Jie
2012-01-01
Multi-user cognitive radio network resource allocation based on the adaptive niche immune genetic algorithm is proposed,and a fitness function is provided.Simulations are conducted using the adaptive niche immune genetic algorithm,the simulated annealing algorithm,the quantum genetic algorithm and the simple genetic algorithm,respectively.The results show that the adaptive niche immune genetic algorithm performs better than the other three algorithms in terms of the multi-user cognitive radio network resource allocation,and has quick convergence speed and strong global searching capability,which effectively reduces the system power consumption and bit error rate.
A MULTILAYER COMPLEX NEURAL NETWORK TRAINING ALGORITHM AND ITS APPLICATION IN ADAPTIVE EQUALIZATION
Institute of Scientific and Technical Information of China (English)
Li Chunguang; Liao Xiaofeng; Wu Zhongfu; Yu Juebang
2001-01-01
In this paper, the layer-by-layer optimizing algorithm for training multilayer neural network is extended for the case of a multilayer neural network whose inputs, weights, and activation functions are all complex. The updating of the weights of each layer in the network is based on the recursive least squares method. The performance of the proposed algorithm is demonstrated with application in adaptive complex communication channel equalization.
Structural self-assembly and avalanchelike dynamics in locally adaptive networks
Gräwer, Johannes; Modes, Carl D.; Magnasco, Marcelo O.; Katifori, Eleni
2015-07-01
Transport networks play a key role across four realms of eukaryotic life: slime molds, fungi, plants, and animals. In addition to the developmental algorithms that build them, many also employ adaptive strategies to respond to stimuli, damage, and other environmental changes. We model these adapting network architectures using a generic dynamical system on weighted graphs and find in simulation that these networks ultimately develop a hierarchical organization of the final weighted architecture accompanied by the formation of a system-spanning backbone. In addition, we find that the long term equilibration dynamics exhibit behavior reminiscent of glassy systems characterized by long periods of slow changes punctuated by bursts of reorganization events.
Institute of Scientific and Technical Information of China (English)
Wang Shu-Guo; Zheng Song
2013-01-01
We investigate the problem of function projective synchronization (FPS) in drive-response dynamical networks with non-identical nodes.An adaptive controller is proposed for the FPS of complex dynamical networks with uncertain parameters and disturbance.Not only are the unknown parameters of the networks estimated by the adaptive laws obtained from the Lyapunov stability theory and Taylor expansions,but the unknown bounded disturbances are also simultaneously conquered by the proposed control.Finally,a numerical simulation is provided to illustrate the feasibility and effectiveness of the obtained result.
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.
Institute of Scientific and Technical Information of China (English)
Lu LU; Fagui LIU; Weixiang SHI
2008-01-01
In this paper, a novel control law is presented, which uses neural-network techniques to approximate the affine class nonlinear system having unknown or uncertain dynamics and noise disturbances. It adopts an adaptive control law to adjust the network parameters online and adds another control component according to H-infinity control theory to attenuate the disturbance. This control law is applied to the position tracking control of pneumatic servo systems. Simulation and experimental results show that the tracking precision and convergence speed is obviously superior to the results by using the basic BP-network controller and self-tuning adaptive controller.
de Nijs, Patrick J.; Berry, Nicholas J.; Wells, Geoff J.; Reay, Dave S.
2014-10-01
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.
Toward an Adaptive Learning System Framework: Using Bayesian Network to Manage Learner Model
Directory of Open Access Journals (Sweden)
Viet Anh Nguyen
2012-12-01
Full Text Available This paper represents a new approach to manage learner modeling in an adaptive learning system framework. It considers developing the basic components of an adaptive learning system such as the learner model, the course content model and the adaptation engine. We use the overlay model and Bayesian network to evaluate learners’ knowledge. In addition, we also propose a new content modeling method as well as adaptation engine to generate adaptive course based on learner’s knowledge. Based on this approach, we developed an adaptive learning system named is ACGS-II, that teaches students how to design an Entity Relationship model in a database system course. Empirical testing results for students who used the application indicate that our proposed model is very helpful as guidelines to develop adaptive learning system to meet learners’ demands.
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.
A study of interceptor attitude control based on adaptive wavelet neural networks
Li, Da; Wang, Qing-chao
2005-12-01
This paper engages to study the 3-DOF attitude control problem of the kinetic interceptor. When the kinetic interceptor enters into terminal guidance it has to maneuver with large angles. The characteristic of interceptor attitude system is nonlinearity, strong-coupling and MIMO. A kind of inverse control approach based on adaptive wavelet neural networks was proposed in this paper. Instead of using one complex neural network as the controller, the nonlinear dynamics of the interceptor can be approximated by three independent subsystems applying exact feedback-linearization firstly, and then controllers for each subsystem are designed using adaptive wavelet neural networks respectively. This method avoids computing a large amount of the weights and bias in one massive neural network and the control parameters can be adaptive changed online. Simulation results betray that the proposed controller performs remarkably well.
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.
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.
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 saf
Adaptive Resource Allocation For MAI Minimization In Wireless Adhoc Network
Directory of Open Access Journals (Sweden)
Mohammed Abdul Waheed
2011-05-01
Full Text Available Coding-based solutions for MANETs have emerged as a basic solution to current high rate data accessing in adhoc network. This has become essential related to the absence of centralized control such as a monitoring station. A code assignment protocol is needed to assign distinct codes to different terminals. This problem is less effective in small networks, but becomes dominative in large networks where the numbers of code sequence are lesser than the number of terminals to code, demanding reuse of the codes. The issue of code allocation in communication is focused in this paper with the evaluation of MAI in wireless network. Unlike previously proposed protocols in this paper a focus for the multiple access interference (MAI, thereby addressing the limiting near-far problem that decreases the throughput performance in MANETs is made. The code assignment scheme is developed for the proper usage of users code under MANETs communication to minimize the MAI impact.
Constructions of vector output Boolean functions with high generalized nonlinearity
Institute of Scientific and Technical Information of China (English)
KE Pin-hui; ZHANG Sheng-yuan
2008-01-01
Carlet et al. recently introduced generalized nonlinearity to measure the ability to resist the improved correlation attack of a vector output Boolean function. This article presents a construction of vector output Boolean functions with high generalized nonlinearity using the sample space. The relation between the resilient order and generalized nonlinearity is also discussed.
Boolean Queries and Term Dependencies in Probabilistic Retrieval Models.
Croft, W. Bruce
1986-01-01
Proposes approach to integrating Boolean and statistical systems where Boolean queries are interpreted as a means of specifying term dependencies in relevant set of documents. Highlights include series of retrieval experiments designed to test retrieval strategy based on term dependence model and relation of results to other work. (18 references)…
Towards Truly Boolean Arrays in Data-Parallel Array Processing
C. Grelck; H. Luyat
2013-01-01
We investigate several dense bit-wise implementations of Boolean arrays in the context of the functional data-parallel array programming language SAC. A particular problem arises in compiler or directive based parallelisation as the scheduling of loops over Boolean arrays is unaware of the restricte
IMPLEMENTATION OF ADAPTIVE ZONE ROUTING PROTOCOL FOR WIRELESS NETWORKS
T. RAVI NAYAK; SAKE. POTHALAIAH; Dr. K ASHOK BABU
2010-01-01
Mobile Ad hoc wireless Networks (MANETs) that do not need any fixed infrastructure. They are characterized by dynamic topology due to node mobility, limited channel bandwidth, and limited battery power of nodes. The key challenge in the design of ad hoc networks is the development of dynamic routing protocols that can efficiently findroutes between two communicating nodes. Thus, many ad hoc routing protocols have been proposed in recent years. All these routing protocols attempt to provide a ...
Multiple-model-and-neural-network-based nonlinear multivariable adaptive control
Institute of Scientific and Technical Information of China (English)
Yue FU; Tianyou CHAI
2007-01-01
A multivariable adaptive controller feasible for implementation on distributed computer systems (DCS) is presented for a class of uncertain nonlinear multivariable discrete time systems. The adaptive controller is composed of a linear adaptive controller, a neural network nonlinear adaptive controller and a switching mechanism. The linear controller can provide boundedness of the input and output signals, and the nonlinear controller can improve the performance of the system. The purpose of using the switching mechanism is to obtain the improved system performance and stability simultaneously. Theory analysis and simulation results are presented to show the effectiveness of the proposed method.
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...
Reasoning formalism in Boolean operator fuzzy logic
Institute of Scientific and Technical Information of China (English)
邓安生; 刘叙华
1995-01-01
Based on the newly introduced concepts of true-level and false-level, the formal structure of reasoning in Boolean operator fuzzy logic is presented. As a generalization of the theory of epistemic process in open logic, a formalism is also proposed to describe human reasoning with uncertain, inconsistent and insufficient knowledge, which can characterize the knowledge increment and revision, as well as the epistemic evolution. The formalism provides an explanation to the dynamic properties of human reasoning, i. e. continuous revision and combination of beliefs.
The Boolean algebra and central Galois algebras
Directory of Open Access Journals (Sweden)
George Szeto
2001-01-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 g∈G, and BJg=Beg for a central idempotent eg. Then a relation is given between the set of elements in the Boolean algebra (Ba,≤ generated by {0,eg∣g∈G} and a set of subgroups of G, and a central Galois algebra Be with a Galois subgroup of G is characterized for an e∈Ba.
Towards boolean operations with thermal photons
Ben-Abdallah, Philippe
2016-01-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 Letter 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.
CLASSIFICATIONS OF EEG SIGNALS FOR MENTAL TASKS USING ADAPTIVE RBF NETWORK
Institute of Scientific and Technical Information of China (English)
薛建中; 郑崇勋; 闫相国
2004-01-01
Objective This paper presents classifications of mental tasks based on EEG signals using an adaptive Radial Basis Function (RBF) network with optimal centers and widths for the Brain-Computer Interface (BCI) schemes. Methods Initial centers and widths of the network are selected by a cluster estimation method based on the distribution of the training set. Using a conjugate gradient descent method, they are optimized during training phase according to a regularized error function considering the influence of their changes to output values. Results The optimizing process improves the performance of RBF network, and its best cognition rate of three task pairs over four subjects achieves 87.0%. Moreover, this network runs fast due to the fewer hidden layer neurons. Conclusion The adaptive RBF network with optimal centers and widths has high recognition rate and runs fast. It may be a promising classifier for on-line BCI scheme.
An Optimized Technique of Increasing the Performance of Network Adapter on EML Layer
Directory of Open Access Journals (Sweden)
Prashanth L
2012-08-01
Full Text Available Simple Network Adapter initially which acts as an interface between the Transaction server and Network Elements communicates over the channel through tcppdu. Presently the disadvantage being involved in tcppdu is to maintain the channel contention, reservation of channel bandwidth. The disadvantage being involved is certain features, version of network elements communicates by receiving the xml over the socket. So, it’s not possible to change the entire framework, but by updating the framework an XML Over Socket(XOS formation should be supported. The XOS implementation is being performed using Java language through mainly in JVM. Such that by this deployment machines would become easier and form a good communication gap between them. This simple network adapter being developed should support operations of the North bounded server and gives an established authorized, secured, reliable portal. The interface being developed should provide a good performance in meeting the network demands and operated conversions of respective objects
ADAPTIVE FLIGHT CONTROL SYSTEM OF ARMED HELICOPTER USING WAVELET NEURAL NETWORK METHOD
Institute of Scientific and Technical Information of China (English)
ZHURong-gang; JIANGChangsheng; FENGBin
2004-01-01
A discussion is devoted to the design of an adaptive flight control system of the armed helicopter using wavelet neural network method. Firstly, the control loop of the attitude angle is designed with a dynamic inversion scheme in a quick loop and a slow loop. respectively. Then, in order to compensate the error caused by dynamic inversion, the adaptive flight control system of the armed helicopter using wavelet neural network method is put forward, so the BP wavelet neural network and the Lyapunov stable wavelet neural network are used to design the helicopter flight control system. Finally, the typical maneuver flight is simulated to demonstrate its validity and effectiveness. Result proves that the wavelet neural network has an engineering practical value and the effect of WNN is good.
LSSVM Network Flow Prediction Based on the Self-adaptive Genetic Algorithm Optimization
Directory of Open Access Journals (Sweden)
Liao Wenjing
2013-02-01
Full Text Available In order to change the insufficiency of traditional network flow prediction and improve its accuracy, the paper proposed a kind of network flow prediction method based on the self-adaptive genetic least square support vector machine optimization. Through analyzing the individual parameter of the LS-SVM principle and self-adaptive remains algorithm, the network flow prediction model structure of GA-LSSVM, and the genetic model global operation parameters, this paper would conduct a performance test to the network flow simulation experiment. The simulation result showed that: compared with the traditional forecasting methods, the accuracy of its network flow prediction was higher than the traditional forecasting methods by using the least square support vector machine genetic optimization.
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 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...
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....
Directory of Open Access Journals (Sweden)
Kirstie Cadger
2016-07-01
Full Text Available Social ties play an important role in agricultural knowledge exchange, particularly in developing countries with high exposure to agriculture development interventions. Institutions often facilitate agricultural training projects, with a focus on agroecological practices, such as agroforestry and agrobiodiversity. The structural characteristics of social networks amongst land managers influences decision-making to adopt such adaptive agroecoloigcal practice; however, the extent of knowledge transfer beyond direct project participants is often unknown. Using a social network approach, we chart the structure of agrarian knowledge networks (n = 131 in six communities, which have been differentially exposed to agriculture development interventions in Ghana. Farmer network size, density and composition were distinctly variable; development project-affiliated farmers were embedded in larger networks, had non-affiliated farmers within their networks, were engaged in more diverse agricultural production and reported adopting and adapting agroecological practice more frequently. Such bridging ties that link across distinctive groups in a network can expose network members to new and innovative agroecological practices, such as increasing agrobiodiversity, thus, contributing to livelihood strategies that mitigate environmental and market risk. Furthermore, we show that these knowledge networks were crop-specific where network size varied given the type of crop produced. Such factors, which may influence the rate and extent of agroecological knowledge diffusion, are critical for the effectiveness of land management practices as well as the persistence of agriculture development interventions.
From Cellular Attractor Selection to Adaptive Signal Control for Traffic Networks
Tian, Daxin; Zhou, Jianshan; Sheng, Zhengguo; Wang, Yunpeng; Ma, Jianming
2016-03-01
The management of varying traffic flows essentially depends on signal controls at intersections. However, design an optimal control that considers the dynamic nature of a traffic network and coordinates all intersections simultaneously in a centralized manner is computationally challenging. Inspired by the stable gene expressions of Escherichia coli in response to environmental changes, we explore the robustness and adaptability performance of signalized intersections by incorporating a biological mechanism in their control policies, specifically, the evolution of each intersection is induced by the dynamics governing an adaptive attractor selection in cells. We employ a mathematical model to capture such biological attractor selection and derive a generic, adaptive and distributed control algorithm which is capable of dynamically adapting signal operations for the entire dynamical traffic network. We show that the proposed scheme based on attractor selection can not only promote the balance of traffic loads on each link of the network but also allows the global network to accommodate dynamical traffic demands. Our work demonstrates the potential of bio-inspired intelligence emerging from cells and provides a deep understanding of adaptive attractor selection-based control formation that is useful to support the designs of adaptive optimization and control in other domains.
Using social network analysis to evaluate health-related adaptation decision-making in Cambodia.
Bowen, Kathryn J; Alexander, Damon; Miller, Fiona; Dany, Va
2014-02-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 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.
Shamshirband, Shahaboddin; Banjanovic-Mehmedovic, Lejla; Bosankic, Ivan; Kasapovic, Suad; Abdul Wahab, Ainuddin Wahid Bin
2016-01-01
Intelligent Transportation Systems rely on understanding, predicting and affecting the interactions between vehicles. The goal of this paper is to choose a small subset from the larger set so that the resulting regression model is simple, yet have good predictive ability for Vehicle agent speed relative to Vehicle intruder. The method of ANFIS (adaptive neuro fuzzy inference system) was applied to the data resulting from these measurements. The ANFIS process for variable selection was implemented in order to detect the predominant variables affecting the prediction of agent speed relative to intruder. This process includes several ways to discover a subset of the total set of recorded parameters, showing good predictive capability. The ANFIS network was used to perform a variable search. Then, it was used to determine how 9 parameters (Intruder Front sensors active (boolean), Intruder Rear sensors active (boolean), Agent Front sensors active (boolean), Agent Rear sensors active (boolean), RSSI signal intensity/strength (integer), Elapsed time (in seconds), Distance between Agent and Intruder (m), Angle of Agent relative to Intruder (angle between vehicles °), Altitude difference between Agent and Intruder (m)) influence prediction of agent speed relative to intruder. The results indicated that distance between Vehicle agent and Vehicle intruder (m) and angle of Vehicle agent relative to Vehicle Intruder (angle between vehicles °) is the most influential parameters to Vehicle agent speed relative to Vehicle intruder. PMID:27219539
Shamshirband, Shahaboddin; Banjanovic-Mehmedovic, Lejla; Bosankic, Ivan; Kasapovic, Suad; Abdul Wahab, Ainuddin Wahid Bin
2016-01-01
Intelligent Transportation Systems rely on understanding, predicting and affecting the interactions between vehicles. The goal of this paper is to choose a small subset from the larger set so that the resulting regression model is simple, yet have good predictive ability for Vehicle agent speed relative to Vehicle intruder. The method of ANFIS (adaptive neuro fuzzy inference system) was applied to the data resulting from these measurements. The ANFIS process for variable selection was implemented in order to detect the predominant variables affecting the prediction of agent speed relative to intruder. This process includes several ways to discover a subset of the total set of recorded parameters, showing good predictive capability. The ANFIS network was used to perform a variable search. Then, it was used to determine how 9 parameters (Intruder Front sensors active (boolean), Intruder Rear sensors active (boolean), Agent Front sensors active (boolean), Agent Rear sensors active (boolean), RSSI signal intensity/strength (integer), Elapsed time (in seconds), Distance between Agent and Intruder (m), Angle of Agent relative to Intruder (angle between vehicles °), Altitude difference between Agent and Intruder (m)) influence prediction of agent speed relative to intruder. The results indicated that distance between Vehicle agent and Vehicle intruder (m) and angle of Vehicle agent relative to Vehicle Intruder (angle between vehicles °) is the most influential parameters to Vehicle agent speed relative to Vehicle intruder. PMID:27219539
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......Central Pattern Generators (CPG) are oscillatory systems that are responsible for generating rhythmic patterns at the origin of many biological activities such as for example locomotion or digestion. These systems are generally modelled as recurrent neural networks whose parameters are tuned so...
A High TCP Performance Rate Adaptation Algorithm for IEEE 802.11 Networks
Directory of Open Access Journals (Sweden)
Kehao Zhang
2010-11-01
Full Text Available Rate adaptation is a link layer mechanism critical to the system performance by exploiting the multipletransmission rates provided by current IEEE 802.11 WLANs. The key challenge for designing such analgorithm is how to select the most appropriate transmission rate under different environments. The firstgeneration rate adaptation schemes perform poorly in a collision dominant environment because they donot differentiate frame losses caused by collision from channel degradation. The second generationschemes use RTS/CTS control frames to differentiate frame losses. However, introducing the overheadmay lower network performance especially when the data frame size is small. This paper gives severalguidelines on how to design an efficient rate adaptation scheme and proposes an algorithm calledAdvanced Rate Adaptation Algorithm (ARA. ARA is implemented along with four other representativerate adaptation schemes on a Linux-based testbed. Experiment results show that ARA outperforms otherrate adaptation schemes in most scenarios.
Study on the Robot Robust Adaptive Control Based on Neural Networks
Institute of Scientific and Technical Information of China (English)
温淑焕; 王洪瑞; 吴丽艳
2003-01-01
Force control based on neural networks is presented. Under the framework of hybrid control, an RBF neural network is used to compensate for all the uncertainties from robot dynamics and unknown environment first. The technique will improve the adaptability to environment stiffness when the end-effector is in contact with the environment, and does not require any a priori knowledge on the upper bound of syste uncertainties. Moreover, it need not compute the inverse of inertia matrix. Learning algorithms for neural networks to minimize the force error directly are designed. Simulation results have shown a better force/position tracking when neural network is used.
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.
Pliable Cognitive MAC for Heterogeneous Adaptive Cognitive Radio Sensor Networks
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. PMID:27257964
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 Information Access on Multiple Applications Support Wireless Sensor Networks
DEFF Research Database (Denmark)
Tobgay, Sonam; Olsen, Rasmus Løvenstein; Prasad, Ramjee
2014-01-01
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...
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. PMID:27257964
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.
Adaptive feature annotation for large video sensor networks
Cai, Yang; Bunn, Andrew; Liang, Peter; Yang, Bing
2013-10-01
We present an adaptive feature extraction and annotation algorithm for articulating traffic events from surveillance cameras. We use approximate median filter for moving object detection, motion energy image and convex hull for lane detection, and adaptive proportion models for vehicle classification. It is found that our approach outperforms three-dimensional modeling and scale-independent feature transformation algorithms in terms of robustness. The multiresolution-based video codec algorithm enables a quality-of-service-aware video streaming according to the data traffic. Furthermore, our empirical data shows that it is feasible to use the metadata to facilitate the real-time communication between an infrastructure and a vehicle for safer and more efficient traffic control.
Neutral Mutations and Punctuated Equilibrium in Evolving Genetic Networks
Bornholdt, Stefan; Sneppen, Kim
1997-01-01
Boolean networks may be viewed as idealizations of biological genetic networks, where each node is represented by an on-off switch which is a function of the binary output from some other nodes. We evolve connectivity in a single Boolean network, and demonstrate how the sole requirement of sequential matching of attractors may open for an evolution that exhibits punctuated equilibrium.
Boolean Algebra. Geometry Module for Use in a Mathematics Laboratory Setting.
Brotherton, Sheila; And Others
This module is recommended as an honors unit to follow a unit on logic. There are four basic parts: (1) What is a Boolean Algebra; (2) Using Boolean Algebra to Prove Theorems; (3) Using Boolean Algebra to Simplify Logical Statements; and (4) Circuit Problems with Logic and Boolean Algebra. Of these, sections 1, 2, and 3 are primarily written…
Enabling Adaptive Rate and Relay Selection for 802.11 Mobile Ad Hoc Networks
Mehta, Neil; Wang, Wenye
2011-01-01
Mobile ad hoc networks (MANETs) are self-configuring wireless networks that lack permanent infrastructure and are formed among mobile nodes on demand. Rapid node mobility results in dramatic channel variation, or fading, that degrades MANET performance. Employing channel state information (CSI) at the transmitter can improve the throughput of routing and medium access control (MAC) protocols for mobile ad hoc networks. Several routing algorithms in the literature explicitly incorporate the fading signal strength into the routing metric, thus selecting the routes with strong channel conditions. While these studies show that adaptation to the time-variant channel gain is beneficial in MANETs, they do not address the effect of the outdated fading CSI at the transmitter. For realistic mobile node speeds, the channel gain is rapidly varying, and becomes quickly outdated due the feedback delay. We analyze the link throughput of joint rate adaptation and adaptive relay selection in the presence of imperfect CSI. Mor...
Nonlinear adaptive control systems design of BTT missile based on fully tuned RBF neural networks
Hu, Yunan; Jin, Yuqiang; Li, Jing
2003-09-01
Based on fully tuned RBF neural networks and backstepping control techniques, a novel nonlinear adaptive control scheme is proposed for missile control systems with a general set of uncertainties. The effect of the uncertainties is synthesized one term in the design procedure. Then RBF neural networks are used to eliminate its effect. The nonlinear adaptive controller is designed using backstepping control techniques. The control problem is resolved while the control coefficient matrix is unknown. The adaptive tuning rules for updating all of the parameters of the fully tuned RBF neural networks are firstly derived by the Lyapunov stability theorem. Finally, nonlinear 6-DOF numerical simulation results for a BTT missile model are presented to demonstrate the effectiveness of the proposed method.
Time-Scale and Noise Optimality in Self-Organized Critical Adaptive Networks
Kuehn, Christian
2011-01-01
Recent studies have shown that adaptive networks driven by simple local rules can organize into "critical" global steady states, thereby providing another framework for self-organized criticality (SOC). Here we study SOC in an adaptive network considered first by Bornholdt and Rohlf [PRL, 84(26), p.6114-6117, 2000]. We focus on the important convergence to criticality and discover time-scale and noise optimal behaviour as well as a noise-induced phase transition. Due to the complexity of adaptive networks dynamics we suggest to investigate each effect separately by developing simple models. These models reveal three generically possible low-dimensional dynamical behaviors: time-scale resonance (TR), a simplified version of stochastic resonance - which call steady state stochastic resonance (SSR) - as well as noise-induced phase transitions. Thereby, our study not only opens up new directions for optimality in SOC but also applies to a much wider class of dynamical systems.
Adaptive learning with guaranteed stability for discrete-time recurrent neural networks
Institute of Scientific and Technical Information of China (English)
无
2007-01-01
To avoid unstable learning, a stable adaptive learning algorithm was proposed for discrete-time recurrent neural networks. Unlike the dynamic gradient methods, such as the backpropagation through time and the real time recurrent learning, the weights of the recurrent neural networks were updated online in terms of Lyapunov stability theory in the proposed learning algorithm, so the learning stability was guaranteed. With the inversion of the activation function of the recurrent neural networks, the proposed learning algorithm can be easily implemented for solving varying nonlinear adaptive learning problems and fast convergence of the adaptive learning process can be achieved. Simulation experiments in pattern recognition show that only 5 iterations are needed for the storage of a 15X15 binary image pattern and only 9 iterations are needed for the perfect realization of an analog vector by an equilibrium state with the proposed learning algorithm.
Robust adaptive synchronization of general dynamical networks with multiple delays and uncertainties
Indian Academy of Sciences (India)
LU YIMING; HE PING; MA SHU-HUA; LI GUO-ZHI; MOBAYBEN SALEH
2016-06-01
In this article, a general complex dynamical network which contains multiple delays and uncertainties is introduced, which contains time-varying coupling delays, time-varying node delay, and uncertainties of both the inner- and outer-coupling matrices. A robust adaptive synchronization scheme for these general complex networks with multiple delays and uncertainties is established and raised by employing the robust adaptive control principle and the Lyapunov stability theory. We choose some suitable adaptive synchronization controllers to ensure the robust synchronization of this dynamical network. The numerical simulations of the time-delay Lorenz chaotic system as local dynamical node are provided to observe and verify the viability and productivity of the theoretical research in this paper. Compared to the achievement of previous research, theresearch in this paper seems quite comprehensive and universal.
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.
RESEARCH ON ADAPTIVE COMPRESSION CODING FOR NETWORK CODING IN WIRELESS SENSOR NETWORK
Institute of Scientific and Technical Information of China (English)
Liu Ying; Yang Zhen; Mei Zhonghui; Kong Yuanyuan
2012-01-01
Based on the sequence entropy of Shannon information theory,we work on the network coding technology in Wireless Sensor Network (WSN).In this paper,we take into account the similarity of the transmission sequences at the network coding node in the multi-sources and multi-receivers network in order to compress the data redundancy.Theoretical analysis and computer simulation results show that this proposed scheme not only further improves the efficiency of network transmission and enhances the throughput of the network,but also reduces the energy consumption of sensor nodes and extends the network life cycle.
A novel adaptive modulation and coding strategy based on partial feedback for enhanced MBMS network
Institute of Scientific and Technical Information of China (English)
SHENG Yu; PENG Mu-gen; WANG Wen-bo
2008-01-01
The difference in link condition of broadcast/multicast users and the limitation of uplink resource, make itdifficult to utilize adaptive modulation and coding (AMC) in theenhanced multimedia broadcast and multicast service (E-MBMS)network. To obtain the improvement of system throughput, thisstudy proposes an adaptive modulation and coding schemebased on partial feedback, by which only partial users whosechannel qualities are lower than the system threshold need tomake a response to the modulation coding scheme (MCS)adaptation procedure. By this investigation, an adaptive schemecan be introduced in the E-MBMS network. Both the theoreticalanalysis and simulation results demonstrate the efficiency of theproposed strategy, in which the performance is close to the idealone and has a significant throughput improvement whencompared with that of the fixed MCS transmission scheme.
Decentralized direct adaptive neural network control for a class of interconnected systems
Institute of Scientific and Technical Information of China (English)
Zhang Tianping; Mei Jiandong
2006-01-01
The problem of direct adaptive neural network control for a class of large-scale systems with unknown function control gains and the high-order interconnections is studied in this paper. Based on the principle of sliding mode control and the approximation capability of multilayer neural networks, a design scheme of decentralized direct adaptive sliding mode controller is proposed. The plant dynamic uncertainty and modeling errors are adaptively compensated by adjusted the weights and sliding mode gains on-line for each subsystem using only local information. According to the Lyapunov method, the closed-loop adaptive control system is proven to be globally stable, with tracking errors converging to a neighborhood of zero. Simulation results demonstrate the effectiveness of the proposed approach.
Adaptive Home System Using Wireless Sensor Network And Multi Agent System
Directory of Open Access Journals (Sweden)
Jayarani Kamble
2014-03-01
Full Text Available Smart Home is an emerging technology growing continuously which includes number of new technologies which helps to improve human’s quality of living. This paper proposes an adaptive home system for optimum utilization of power, through Artificial Intelligence and Wireless Sensor network. Artificial Intelligence is a technology for developing adaptive system that can perceive the enviornmrnt, learn from the environment and can make decision using Rule based system.Zigbee is a wireless sensor network used to efficiently deliver solution for an energy management and efficiency for adaptive home. An algorithm used in adaptive home system is based on software agent approach that reduce the energy consumption at home by considering the user’s occupancy, temperature and user’s preferences as input to the system.
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
Directory of Open Access Journals (Sweden)
Jinhai Liu
2012-01-01
Full Text Available A novel adaptive fuzzy min-max neural network classifier called AFMN is proposed in this paper. Combined with principle component analysis and adaptive genetic algorithm, this integrated system can serve as a supervised and real-time classification technique. Considering the loophole in the expansion-contraction process of FMNN and GFMN and the overcomplex network architecture of FMCN, AFMN maintains the simple architecture of FMNN for fast learning and testing while rewriting the membership function, the expansion and contraction rules for hyperbox generation to solve the confusion problems in the hyperbox overlap region. Meanwhile, principle component analysis is adopted to finish dataset dimensionality reduction for increasing learning efficiency. After training, the confidence coefficient of each hyperbox is calculated based on the distribution of samples. During classifying procedure, utilizing adaptive genetic algorithm to complete parameter optimization for AFMN can also fasten the entire procedure than traversal method. For conditions where training samples are insufficient, data core weight updating is indispensible to enhance the robustness of classifier and the modified membership function can adjust itself according to the input varieties. The paper demonstrates the performance of AFMN through substantial examples in terms of classification accuracy and operating speed by comparing it with FMNN, GFMN, and FMCN.
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 overvi...
A Flow-Level Performance Model for Mobile Networks Carrying Adaptive Streaming Traffic
Bonald, Thomas; Elayoubi, Salah-Eddine; Lin, Yu-Ting
2015-01-01
International audience This paper proposes a performance model for mobile networks carrying adaptive streaming traffic. The proposed model takes into account the flow dynamics in addition to the main parameters influencing the performance of adaptive streaming, such as the playout buffer and the video bit rates. We show how to compute several performance metrics like the average video bit rate, the deficit rate, defined as the probability of having an instantaneous throughput lower than th...
自适应光传送网%Adaptive Optical Transport Network
Institute of Scientific and Technical Information of China (English)
王加莹; 赵继军; 刘赛
2005-01-01
提出未来光网络的智能化特征,包括连接智能化、业务智能化和传输自适应三个方面.这几个方面的特征将成为未来自适应光传送网的标志.%Intelligent features of future optical transport self-adaptation' ,which will construct an integrated earmark of future self-adaptive optical transport network.
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.
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.
Institute of Scientific and Technical Information of China (English)
LAI Xing-yu; YE Bang-yan; LI Wei-guang; YAN Chun-yan
2007-01-01
Combining information entropy and wavelet analysis with neural network, an adaptive control system and an adaptive control algorithm are presented for machining process based on extended entropy square error (EESE) and wavelet neural network (WNN). Extended entropy square error function is defined and its availability is proved theoretically. Replacing the mean square error criterion of BP algorithm with the EESE criterion, the proposed system is then applied to the on-line control of the cutting force with variable cutting parameters by searching adaptively wavelet base function and self adjusting scaling parameter, translating parameter of the wavelet and neural network weights. Simulation results show that the designed system is of fast response,non-overshoot and it is more effective than the conventional adaptive control of machining process based on the neural network. The suggested algorithm can adaptively adjust the feed rate on-line till achieving a constant cutting force approaching the reference force in varied cutting conditions, thus improving the machining efficiency and protecting the tool.
Design of artificial genetic regulatory networks with multiple delayed adaptive responses*
Kaluza, Pablo; Inoue, Masayo
2016-06-01
Genetic regulatory networks with adaptive responses are widely studied in biology. Usually, models consisting only of a few nodes have been considered. They present one input receptor for activation and one output node where the adaptive response is computed. In this work, we design genetic regulatory networks with many receptors and many output nodes able to produce delayed adaptive responses. This design is performed by using an evolutionary algorithm of mutations and selections that minimizes an error function defined by the adaptive response in signal shapes. We present several examples of network constructions with a predefined required set of adaptive delayed responses. We show that an output node can have different kinds of responses as a function of the activated receptor. Additionally, complex network structures are presented since processing nodes can be involved in several input-output pathways. Supplementary material in the form of one nets file available from the Journal web page at http://dx.doi.org/10.1140/epjb/e2016-70172-9
Molecular networks of human muscle adaptation to exercise and age.
Phillips, Bethan E.; Williams, John P; Thomas Gustafsson; Claude Bouchard; Tuomo Rankinen; Steen Knudsen; Kenneth Smith; Timmons, James A.; Atherton, Philip J.
2013-01-01
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%),...
ADAPTATIVE IMAGE WATERMARKING SCHEME BASED ON NEURAL NETWORK
BASSEL SOLAIMANE; ADNENE CHERIF; SAMEH OUESLATI,
2011-01-01
Digital image watermarking has been proposed as a method to enhance medical data security, confidentiality and integrity. Medical image watermarking requires extreme care when embedding additional data, given their importance to clinical diagnosis, treatment, and research. In this paper, a novel image watermarking approach based on the human visual system (HVS) model and neural network technique is proposed. The watermark was inserted into the middle frequency coefficients of the cover image’...
A scalable, adaptive, and extensible data center network architecture
Al-Fares, Mohammad Abdulaziz
2012-01-01
Today's largest data centers contain tens of thousands of servers, and they will encompass hundreds of thousands in the very near future. These machines are designed to serve a rich mix of applications and clients with significant aggregate bandwidth requirements; distributed computing frameworks like MapReduce/Hadoop significantly stress the network interconnect, which when compounded with progressively oversubscribed topologies and inefficient multipath forwarding, can cause a major bottlen...
Distributed MAC and Rate Adaptation for Ultrasonically Networked Implantable Sensors
Santagati, G. Enrico; Melodia, Tommaso; Galluccio, Laura; Palazzo, Sergio
2013-01-01
The use of miniaturized biomedical devices implanted in the human body and wirelessly internetworked is promising a significant leap forward in medical treatment of many pervasive diseases. Recognizing the well-understood limitations of traditional radio-frequency wireless communications in interconnecting devices within the human body, in this paper we propose for the first time to develop network protocols for implantable devices based on ultrasonic transmissions. We start off by assessing ...
Adaptive Neural Network Controller for Thermogenerator Angular Velocity Stabilization System
Horvat, Krunoslav; Šoić, Ines; Kuljača, Ognjen
2013-01-01
The paper presents an analytical and simulation approach for the selection of activation functions for the class of neural network controllers for ship’s thermogenerator angular velocity stabilization system. Such systems can be found in many ships. A Lyapunov-like stability analysis is performed in order to obtain a weight update law. A number of simulations were performed to find the best activation function using integral error criteria and statistical T-tests.
Alzheimer's Disease Diagnostics by Adaptation of 3D Convolutional Network
Hosseini-Asl, Ehsan; Keynto, Robert; El-Baz, Ayman
2016-01-01
Early diagnosis, playing an important role in preventing progress and treating the Alzheimer\\{'}s disease (AD), is based on classification of features extracted from brain images. The features have to accurately capture main AD-related variations of anatomical brain structures, such as, e.g., ventricles size, hippocampus shape, cortical thickness, and brain volume. This paper proposed to predict the AD with a deep 3D convolutional neural network (3D-CNN), which can learn generic features capt...
Adapting Mobile Beacon-Assisted Localization in Wireless Sensor Networks
Wei Dong; Kougen Zheng; Guodong Teng
2009-01-01
The ability to automatically locate sensor nodes is essential in many Wireless Sensor Network (WSN) applications. To reduce the number of beacons, many mobile-assisted approaches have been proposed. Current mobile-assisted approaches for localization require special hardware or belong to centralized localization algorithms involving some deterministic approaches due to the fact that they explicitly consider the impreciseness of location estimates. In this paper, we first propose a range-free,...
Diana Göhringer; Lukas Meder; Stephan Werner; Oliver Oey; Jürgen Becker; Michael Hübner
2012-01-01
This paper presents the hardware architecture and the software abstraction layer of an adaptive multiclient Network-on-Chip (NoC) memory core. The memory core supports the flexibility of a heterogeneous FPGA-based runtime adaptive multiprocessor system called RAMPSoC. The processing elements, also called clients, can access the memory core via the Network-on-Chip (NoC). The memory core supports a dynamic mapping of an address space for the different clients as well as different data transfer ...