28,382 research outputs found

    A weighted pair graph representation for reconstructibility of Boolean control networks

    Full text link
    A new concept of weighted pair graphs (WPGs) is proposed to represent a new reconstructibility definition for Boolean control networks (BCNs), which is a generalization of the reconstructibility definition given in [Fornasini & Valcher, TAC2013, Def. 4]. Based on the WPG representation, an effective algorithm for determining the new reconstructibility notion for BCNs is designed with the help of the theories of finite automata and formal languages. We prove that a BCN is not reconstructible iff its WPG has a complete subgraph. Besides, we prove that a BCN is reconstructible in the sense of [Fornasini & Valcher, TAC2013, Def. 4] iff its WPG has no cycles, which is simpler to be checked than the condition in [Fornasini & Valcher, TAC2013, Thm. 4].Comment: 20 pages, 10 figures, accepted by SIAM Journal on Control and Optimizatio

    Intrusion Detection Systems for Community Wireless Mesh Networks

    Get PDF
    Wireless mesh networks are being increasingly used to provide affordable network connectivity to communities where wired deployment strategies are either not possible or are prohibitively expensive. Unfortunately, computer networks (including mesh networks) are frequently being exploited by increasingly profit-driven and insidious attackers, which can affect their utility for legitimate use. In response to this, a number of countermeasures have been developed, including intrusion detection systems that aim to detect anomalous behaviour caused by attacks. We present a set of socio-technical challenges associated with developing an intrusion detection system for a community wireless mesh network. The attack space on a mesh network is particularly large; we motivate the need for and describe the challenges of adopting an asset-driven approach to managing this space. Finally, we present an initial design of a modular architecture for intrusion detection, highlighting how it addresses the identified challenges

    The impact of cellular characteristics on the evolution of shape homeostasis

    Full text link
    The importance of individual cells in a developing multicellular organism is well known but precisely how the individual cellular characteristics of those cells collectively drive the emergence of robust, homeostatic structures is less well understood. For example cell communication via a diffusible factor allows for information to travel across large distances within the population, and cell polarisation makes it possible to form structures with a particular orientation, but how do these processes interact to produce a more robust and regulated structure? In this study we investigate the ability of cells with different cellular characteristics to grow and maintain homeostatic structures. We do this in the context of an individual-based model where cell behaviour is driven by an intra-cellular network that determines the cell phenotype. More precisely, we investigated evolution with 96 different permutations of our model, where cell motility, cell death, long-range growth factor (LGF), short-range growth factor (SGF) and cell polarisation were either present or absent. The results show that LGF has the largest positive impact on the fitness of the evolved solutions. SGF and polarisation also contribute, but all other capabilities essentially increase the search space, effectively making it more difficult to achieve a solution. By perturbing the evolved solutions, we found that they are highly robust to both mutations and wounding. In addition, we observed that by evolving solutions in more unstable environments they produce structures that were more robust and adaptive. In conclusion, our results suggest that robust collective behaviour is most likely to evolve when cells are endowed with long range communication, cell polarisation, and selection pressure from an unstable environment

    Relative Stability of Network States in Boolean Network Models of Gene Regulation in Development

    Full text link
    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.Comment: 24 pages, 6 figures, 1 tabl
    corecore