1,042,433 research outputs found

    Topology: Big decisions

    Get PDF

    Difference engine

    Get PDF

    Algebraic Topology

    Full text link
    The chapter provides an introduction to the basic concepts of Algebraic Topology with an emphasis on motivation from applications in the physical sciences. It finishes with a brief review of computational work in algebraic topology, including persistent homology.Comment: This manuscript will be published as Chapter 5 in Wiley's textbook \emph{Mathematical Tools for Physicists}, 2nd edition, edited by Michael Grinfeld from the University of Strathclyd

    Dual-topology insertion of a dual-topology membrane protein.

    Get PDF
    Some membrane transporters are dual-topology dimers in which the subunits have inverted transmembrane topology. How a cell manages to generate equal populations of two opposite topologies from the same polypeptide chain remains unclear. For the dual-topology transporter EmrE, the evidence to date remains consistent with two extreme models. A post-translational model posits that topology remains malleable after synthesis and becomes fixed once the dimer forms. A second, co-translational model, posits that the protein inserts in both topologies in equal proportions. Here we show that while there is at least some limited topological malleability, the co-translational model likely dominates under normal circumstances

    The Bi-Compact-Open Topology on C(X)

    Full text link
    For the set C(X) of real-valued continuous functions on a Tychonoff space X, the compact-open topology on C(X) is a "set-open topology". This paper studies the separation and countability properties of the space C(X) having the topology given by the join of the compact-open topology and an "open-set topology" called the open-point topology, that was introduced in [6].Comment: Some corrections are mad

    Topology Control for Maintaining Network Connectivity and Maximizing Network Capacity Under the Physical Model

    Get PDF
    In this paper we study the issue of topology control under the physical Signal-to-Interference-Noise-Ratio (SINR) model, with the objective of maximizing network capacity. We show that existing graph-model-based topology control captures interference inadequately under the physical SINR model, and as a result, the interference in the topology thus induced is high and the network capacity attained is low. Towards bridging this gap, we propose a centralized approach, called Spatial Reuse Maximizer (MaxSR), that combines a power control algorithm T4P with a topology control algorithm P4T. T4P optimizes the assignment of transmit power given a fixed topology, where by optimality we mean that the transmit power is so assigned that it minimizes the average interference degree (defined as the number of interferencing nodes that may interfere with the on-going transmission on a link) in the topology. P4T, on the other hand, constructs, based on the power assignment made in T4P, a new topology by deriving a spanning tree that gives the minimal interference degree. By alternately invoking the two algorithms, the power assignment quickly converges to an operational point that maximizes the network capacity. We formally prove the convergence of MaxSR. We also show via simulation that the topology induced by MaxSR outperforms that derived from existing topology control algorithms by 50%-110% in terms of maximizing the network capacity

    Topology Control in Heterogeneous Wireless Networks: Problems and Solutions

    Get PDF
    Previous work on topology control usually assumes homogeneous wireless nodes with uniform transmission ranges. In this paper, we propose two localized topology control algorithms for heterogeneous wireless multi-hop networks with nonuniform transmission ranges: Directed Relative Neighborhood Graph (DRNG) and Directed Local Spanning Subgraph (DLSS). In both algorithms, each node selects a set of neighbors based on the locally collected information. We prove that (1) the topologies derived under DRNG and DLSS preserve the network connectivity; (2) the out degree of any node in the resulting topology by DLSS is bounded, while the out degree cannot be bounded in DRNG; and (3) the topologies generated by DRNG and DLSS preserve the network bi-directionality
    corecore