Begehbare Bilder

Begehbare Bilder: // „Ist die Moderne unsere Antike?“ Der moderne Themenpark ist beliebtes ‚Feindbild’ der Kulturkritik, die häufig verkennt, dass dessen Grundlagen gerade der Kultur entsprangen, die gegen ihn verteidigt werden soll. Die Analyse des modernen Themenparks zeigt, dass dessen wichtigsten Merkmale: Ästhetisierung, Simulation und Sensation schon in den repräsentativen Gärten des Barock angelegt und im Landschaftspark voll ausgebildet wurden. Nicht erst in Disney World wird die Welt zur Landschaft. Die Paradigmen für den modernen Themenpark sind zu Beginn der Moderne entwickelt worden und bilden den geschichtlichen Bezugspunkt für dominante Repräsentationsstrategien des modernen Lebens. // Die These wird am Beispiel des Bergparks Wilhelmshöhe bei Kassel, der seit der Renaissance immer wieder umgestaltet wurde, illustriert. Aus dieser Interpretation des modernen Themenparks wird eine Kritik an der Absicht, den Bergpark Wilhelmshöhe zu einem Museum zu machen, entfaltet. Der Bergpark hat eine Entwicklungsgeschichte und Motive, die zu jeder Zeit sowohl neue Sichtweisen, Interpretationen und Veränderungen erfuhren. Die Autoren wollen hierzu Einblicke geben und die Diskussion um Denkmalschutz und Perspektiven für den Park beleben.

Anmerkungen zur Geschichte der hessischen Schul- und Unterrichtsinspektion

Die Inspektion von Schule und Unterricht hat eine lange Tradition. Auf der Grundlage von Dokumenten aus der hessischen Schulgeschichte wird gezeigt, dass anfänglich der einzelne Lehrer, sein sittliches Verhalten und insbesondere sein Umgang mit der unterrichtlichen Disziplin im Zentrum der Beobachtungen stand. Das moderne Inspektionswesen nutzt demgegenüber das sozialwissenschaftliche Instrumentarium um anstelle punktueller Erfolgskontrollen schulische und unterrichtliche Entwicklungsprozesse in ihrer Komplexität zu beobachten, zu beschreiben und zu bewerten.

A User-Centric Perspective on Parallel Programming with Focus on OpenMP

The process of developing software that takes advantage of multiple processors is commonly referred to as parallel programming. For various reasons, this process is much harder than the sequential case. For decades, parallel programming has been a problem for a small niche only: engineers working on parallelizing mostly numerical applications in High Performance Computing. This has changed with the advent of multi-core processors in mainstream computer architectures. Parallel programming in our days becomes a problem for a much larger group of developers. The main objective of this thesis was to find ways to make parallel programming easier for them. Different aims were identified in order to reach the objective: research the state of the art of parallel programming today, improve the education of software developers about the topic, and provide programmers with powerful abstractions to make their work easier. To reach these aims, several key steps were taken. To start with, a survey was conducted among parallel programmers to find out about the state of the art. More than 250 people participated, yielding results about the parallel programming systems and languages in use, as well as about common problems with these systems. Furthermore, a study was conducted in university classes on parallel programming. It resulted in a list of frequently made mistakes that were analyzed and used to create a programmers' checklist to avoid them in the future. For programmers' education, an online resource was setup to collect experiences and knowledge in the field of parallel programming - called the Parawiki. Another key step in this direction was the creation of the Thinking Parallel weblog, where more than 50.000 readers to date have read essays on the topic. For the third aim (powerful abstractions), it was decided to concentrate on one parallel programming system: OpenMP. Its ease of use and high level of abstraction were the most important reasons for this decision. Two different research directions were pursued. The first one resulted in a parallel library called AthenaMP. It contains so-called generic components, derived from design patterns for parallel programming. These include functionality to enhance the locks provided by OpenMP, to perform operations on large amounts of data (data-parallel programming), and to enable the implementation of irregular algorithms using task pools. AthenaMP itself serves a triple role: the components are well-documented and can be used directly in programs, it enables developers to study the source code and learn from it, and it is possible for compiler writers to use it as a testing ground for their OpenMP compilers. The second research direction was targeted at changing the OpenMP specification to make the system more powerful. The main contributions here were a proposal to enable thread-cancellation and a proposal to avoid busy waiting. Both were implemented in a research compiler, shown to be useful in example applications, and proposed to the OpenMP Language Committee.

The Navier-Stokes Equations with Particle Methods

The non-stationary nonlinear Navier-Stokes equations describe the motion of a viscous incompressible fluid flow for 0

The Navier-Stokes Equations with Time Delay

In the present paper we use a time delay epsilon > 0 for an energy conserving approximation of the nonlinear term of the non-stationary Navier-Stokes equations. We prove that the corresponding initial value problem (N_epsilon)in smoothly bounded domains G \subseteq R^3 is well-posed. Passing to the limit epsilon \rightarrow 0 we show that the sequence of stabilized solutions has an accumulation point such that it solves the Navier-Stokes problem (N_0) in a weak sense (Hopf).

Computing Generators of Free Modules over Orders in Group Algebras

Let E be a number field and G be a finite group. Let A be any O_E-order of full rank in the group algebra E[G] and X be a (left) A-lattice. We give a necessary and sufficient condition for X to be free of given rank d over A. In the case that the Wedderburn decomposition E[G] \cong \oplus_xM_x is explicitly computable and each M_x is in fact a matrix ring over a field, this leads to an algorithm that either gives elements \alpha_1,...,\alpha_d \in X such that X = A\alpha_1 \oplus ... \oplusA\alpha_d or determines that no such elements exist. Let L/K be a finite Galois extension of number fields with Galois group G such that E is a subfield of K and put d = [K : E]. The algorithm can be applied to certain Galois modules that arise naturally in this situation. For example, one can take X to be O_L, the ring of algebraic integers of L, and A to be the associated order A(E[G];O_L) \subseteq E[G]. The application of the algorithm to this special situation is implemented in Magma under certain extra hypotheses when K = E = \IQ.

Computations in Relative Algebraic K-Groups

Let G be finite group and K a number field or a p-adic field with ring of integers O_K. In the first part of the manuscript we present an algorithm that computes the relative algebraic K-group K_0(O_K[G],K) as an abstract abelian group. We solve the discrete logarithm problem, both in K_0(O_K[G],K) and the locally free class group cl(O_K[G]). All algorithms have been implemented in MAGMA for the case K = \IQ. In the second part of the manuscript we prove formulae for the torsion subgroup of K_0(\IZ[G],\IQ) for large classes of dihedral and quaternion groups.

Construction of fractal interpolation surfaces on rectangular grids

We present a general method of generating continuous fractal interpolation surfaces by iterated function systems on an arbitrary data set over rectangular grids and estimate their Box-counting dimension.