508 research outputs found

    Toward an Energy Efficient Language and Compiler for (Partially) Reversible Algorithms

    Full text link
    We introduce a new programming language for expressing reversibility, Energy-Efficient Language (Eel), geared toward algorithm design and implementation. Eel is the first language to take advantage of a partially reversible computation model, where programs can be composed of both reversible and irreversible operations. In this model, irreversible operations cost energy for every bit of information created or destroyed. To handle programs of varying degrees of reversibility, Eel supports a log stack to automatically trade energy costs for space costs, and introduces many powerful control logic operators including protected conditional, general conditional, protected loops, and general loops. In this paper, we present the design and compiler for the three language levels of Eel along with an interpreter to simulate and annotate incurred energy costs of a program.Comment: 17 pages, 0 additional figures, pre-print to be published in The 8th Conference on Reversible Computing (RC2016

    Energy-Efficient Algorithms

    Full text link
    We initiate the systematic study of the energy complexity of algorithms (in addition to time and space complexity) based on Landauer's Principle in physics, which gives a lower bound on the amount of energy a system must dissipate if it destroys information. We propose energy-aware variations of three standard models of computation: circuit RAM, word RAM, and transdichotomous RAM. On top of these models, we build familiar high-level primitives such as control logic, memory allocation, and garbage collection with zero energy complexity and only constant-factor overheads in space and time complexity, enabling simple expression of energy-efficient algorithms. We analyze several classic algorithms in our models and develop low-energy variations: comparison sort, insertion sort, counting sort, breadth-first search, Bellman-Ford, Floyd-Warshall, matrix all-pairs shortest paths, AVL trees, binary heaps, and dynamic arrays. We explore the time/space/energy trade-off and develop several general techniques for analyzing algorithms and reducing their energy complexity. These results lay a theoretical foundation for a new field of semi-reversible computing and provide a new framework for the investigation of algorithms.Comment: 40 pages, 8 pdf figures, full version of work published in ITCS 201

    Trace Complexity of Chaotic Reversible Cellular Automata

    Full text link
    Delvenne, K\r{u}rka and Blondel have defined new notions of computational complexity for arbitrary symbolic systems, and shown examples of effective systems that are computationally universal in this sense. The notion is defined in terms of the trace function of the system, and aims to capture its dynamics. We present a Devaney-chaotic reversible cellular automaton that is universal in their sense, answering a question that they explicitly left open. We also discuss some implications and limitations of the construction.Comment: 12 pages + 1 page appendix, 4 figures. Accepted to Reversible Computation 2014 (proceedings published by Springer

    Similar recovery time of microbial functions from fungicide stress across biogeographical regions

    Get PDF
    Abstract Determining whether the structural and functional stress responses of communities are similar across space and time is paramount for forecasting and extrapolating the consequences of anthropogenic pressures on ecosystems and their services. Stream ecosystems are under high anthropogenic pressure; however, studies have only examined the response of stream communities across large scales over multiple generations. We studied the responses of leaf-associated microbial communities in streams within three European biogeographical regions to chemical stress in a microcosm experiment with multiple cycles of fungicide pollution and resource colonisation. Fungal community composition and the ecosystem function leaf decomposition were measured as response variables. Microbial leaf decomposition showed similar recovery times under environmental levels of fungicide exposure across regions. Initially, the decomposition declined (between 19 and 53%) under fungicide stress and recovered to control levels during the third cycle of pollution and colonisation. Although community composition and its stress response varied between regions, this suggests similar functional community adaptation towards fungicide stress over time. Genetic, epigenetic and physiological adaptations, as well as species turnover, may have contributed to community adaptation but further studies are required to determine if and to which extent these mechanisms are operating. Overall, our findings provide the first evidence of a similar functional response of microbial leaf decomposition to chemical stress across space and time

    The effects of user characteristics on query performance in the presence of information request ambiguity

    Get PDF
    This paper investigates the effects of personality characteristics on individuals' abilities to compose queries from information requests containing various types of ambiguity. In particular, this research examines the effects of user personality characteristics on query performance in the presence of information requests that contained no extraneous, syntactic, or both extraneous and syntactic ambiguities. The results indicate that personality characteristics significantly affect users' abilities to compose accurate queries. Neuroticism, agreeableness, openness to experience, and conscientiousness significantly affected the number of errors made in the query formulations. Conscientiousness affected the length of time taken to compose the queries and neuroticism affected the confidence users had in the accuracy of their queries. Although several personality dimensions affected query performance, no significant interactions between personality dimensions and ambiguity were detected. Furthermore, both query complexity and information request ambiguity exhibited greater impacts on query performance than personality characteristics. Hence, organizations should attempt to train users to deal with query complexity and information request ambiguity before modifying their training programs for personality characteristics

    The yeast P5 type ATPase, Spf1, regulates manganese transport into the endoplasmic reticulum

    Get PDF
    The endoplasmic reticulum (ER) is a large, multifunctional and essential organelle. Despite intense research, the function of more than a third of ER proteins remains unknown even in the well-studied model organism Saccharomyces cerevisiae. One such protein is Spf1, which is a highly conserved, ER localized, putative P-type ATPase. Deletion of SPF1 causes a wide variety of phenotypes including severe ER stress suggesting that this protein is essential for the normal function of the ER. The closest homologue of Spf1 is the vacuolar P-type ATPase Ypk9 that influences Mn2+ homeostasis. However in vitro reconstitution assays with Spf1 have not yielded insight into its transport specificity. Here we took an in vivo approach to detect the direct and indirect effects of deleting SPF1. We found a specific reduction in the luminal concentration of Mn2+ in ∆spf1 cells and an increase following it’s overexpression. In agreement with the observed loss of luminal Mn2+ we could observe concurrent reduction in many Mn2+-related process in the ER lumen. Conversely, cytosolic Mn2+-dependent processes were increased. Together, these data support a role for Spf1p in Mn2+ transport in the cell. We also demonstrate that the human sequence homologue, ATP13A1, is a functionally conserved orthologue. Since ATP13A1 is highly expressed in developing neuronal tissues and in the brain, this should help in the study of Mn2+-dependent neurological disorders
    • …
    corecore