Zwischen Tradition und Innovation � Historische Plätze in der Bundesrepublik Deutschland nach 1945

Als Schauplätze historischer Ereignisse und Zentren modernen städtischen Lebens sind historische Plätze wichtige Identifikationsorte einer Stadt. Aufgrund ihrer besonderen Bedeutung wurden an sie immer besondere architektonische und städtebauliche Herausforderungen gestellt. Dies gilt um so mehr für die historischen Plätze in der Bundesrepublik nach den flächendeckenden Zerstörungen des Zweiten Weltkrieges. Die Arbeit untersucht die Rolle, welche Plätze als Träger historischer Kontinuität im Aufbauprozess seit 1945 spielen, und mit welchen gestalterischen Mitteln ihrer besonderer Bedeutung gerecht zu werden versucht wurde. Insbesondere wird dabei das Bemühen von Traditionalismus und von Moderne um die Gestaltungshoheit über den Identifikationsraum Platz nachgezeichnet

Exploring Grades 3-5 Mathematics Activities Found Online

We investigate resources on TeachersPayTeachers and discuss how what is available affects our teaching practices

Maple River dam removal project.

LimnologyGiven the lack of empirical studies on dam systems before and after dam removal, our study aims to fill this gap by researching the physical and biological compositions of the East, West, and Main Branches of the Maple River. By examining sites at varying distances upstream and downstream of the Maple River dam, we are creating an inventory of pre-dam removal conditions that will serve as a reference for ecological scientists, dam owners, sportsmen, and local municipalities involved in the processes and potential outcomes of dam removal. Our data includes discharge rates, temperature, conductivity, functional feeding groups and aquatic organisms. These data inform our predictions about potential ecological impacts of the Maple River dam removal.http://deepblue.lib.umich.edu/bitstream/2027.42/116616/1/Boehm_Carey_Fromm_Gadway_McGlashen_MacNeille_Michaelson_2015.pd

Enforcing Termination of Interprocedural Analysis

Interprocedural analysis by means of partial tabulation of summary functions may not terminate when the same procedure is analyzed for infinitely many abstract calling contexts or when the abstract domain has infinite strictly ascending chains. As a remedy, we present a novel local solver for general abstract equation systems, be they monotonic or not, and prove that this solver fails to terminate only when infinitely many variables are encountered. We clarify in which sense the computed results are sound. Moreover, we show that interprocedural analysis performed by this novel local solver, is guaranteed to terminate for all non-recursive programs --- irrespective of whether the complete lattice is infinite or has infinite strictly ascending or descending chains

A representation theorem for MV-algebras

An {\em MV-pair} is a pair $(B,G)$ where $B$ is a Boolean algebra and $G$ is a subgroup of the automorphism group of $B$ satisfying certain conditions. Let $\sim_G$ be the equivalence relation on $B$ naturally associated with $G$. We prove that for every MV-pair $(B,G)$, the effect algebra $B/\sim_G$ is an MV- effect algebra. Moreover, for every MV-effect algebra $M$ there is an MV-pair $(B,G)$ such that $M$ is isomorphic to $B/\sim_G$

On the homomorphism order of labeled posets

Partially ordered sets labeled with k labels (k-posets) and their homomorphisms are examined. We give a representation of directed graphs by k-posets; this provides a new proof of the universality of the homomorphism order of k-posets. This universal order is a distributive lattice. We investigate some other properties, namely the infinite distributivity, the computation of infinite suprema and infima, and the complexity of certain decision problems involving the homomorphism order of k-posets. Sublattices are also examined.Comment: 14 page

Quantitative Concept Analysis

Formal Concept Analysis (FCA) begins from a context, given as a binary relation between some objects and some attributes, and derives a lattice of concepts, where each concept is given as a set of objects and a set of attributes, such that the first set consists of all objects that satisfy all attributes in the second, and vice versa. Many applications, though, provide contexts with quantitative information, telling not just whether an object satisfies an attribute, but also quantifying this satisfaction. Contexts in this form arise as rating matrices in recommender systems, as occurrence matrices in text analysis, as pixel intensity matrices in digital image processing, etc. Such applications have attracted a lot of attention, and several numeric extensions of FCA have been proposed. We propose the framework of proximity sets (proxets), which subsume partially ordered sets (posets) as well as metric spaces. One feature of this approach is that it extracts from quantified contexts quantified concepts, and thus allows full use of the available information. Another feature is that the categorical approach allows analyzing any universal properties that the classical FCA and the new versions may have, and thus provides structural guidance for aligning and combining the approaches.Comment: 16 pages, 3 figures, ICFCA 201