*) non-deterministic computation;

*) relativized computation, specifically given access to oracles like 0' or 0'';

*) encoding input x and/or output y=f(x) in weaker ways according to the Real Arithmetic Hierarchy.

It turns out that, among these approaches, only the first one provides the required power. AU - Ziegler, Martin ID - 18280 SN - 0302-9743 T2 - Proc. CiE 2005: New Computational Paradigms TI - Computability and Continuity on the Real Arithmetic Hierarchy and the Power of Type-2 Nondeterminism VL - 3526 ER - TY - CHAP AU - Christen, Helen AU - Tophinke, Doris AU - Ziegler, Evelyn ED - Krämer-Neubert, Sabine ED - Wolf, Norbert Richardrd ID - 18261 T2 - Bayerische Dialektologie. Akten der Internationalen Dialektologischen Konferenz 26.-28. Februar 2002 TI - Chat und regionale Identität ER - TY - CHAP AU - Tophinke, Doris ED - Lange, Günter ED - Weinhold, Swantje ID - 18259 T2 - Grundlagen der Deutschdidaktik TI - Rechtschreiben ER - TY - CONF AU - Loeser, Christoph AU - Drüke, Isabell AU - Oesterdiekhoff, Brigitte ID - 18449 T2 - IEEE International Conference on Industrial Informatics (INDIN) TI - Glaschick, Rainer: Integrative Approach of Web Services and Universal Plug and Play within an AV Scenario ER - TY - GEN AU - Peckhaus, Volker ID - 18519 T2 - Zentralblatt für Mathematik und ihre Grenzgebiete [Zbl. 1072.01018] TI - Ziche, Paul, „Mathematik als Wissenschaftlichkeitsmodell. Wissenschaftssystematische Konsequenzen variierender Deutungen der Mathematik (1800/1900)“, in: Rudolf Seising/Menso Folkerts/Ulf Hashagen (Hgg.), Form, Zahl, Ordnung. Studien zur Wissenschafts- und Technikgeschichte. Festschrift für Ivo Schneider zum 65. Geburtstag, Franz Steiner Verlag: Stuttgart 2004, 91–106 ER - TY - GEN AU - Peckhaus, Volker ID - 18507 T2 - Zentralblatt für Mathematik und ihre Grenzgebiete [Zbl. 1055.03005; Wiederabdruck aus MR 2005b:03010; online: MathSciNet 2020423] TI - van Atten, Mark/Kennedy, Juliette, “On the Philosophical Development of Kurt Gödel”, Bulletin of Symbolic Logic 9 (2003), 425–476 ER - TY - GEN AU - Peckhaus, Volker ID - 18514 T2 - Zentralblatt für Mathematik und ihre Grenzgebiete [Zbl. 1059.00006] TI - Neuser, Wolfgang/Hösle, Vittorio (Hgg.), Logik, Mathematik und Natur im objektiven Idealismus. Festschrift für Dieter Wandschneider zum 65. Geburtstag, Könighausen & Neumann: Würzburg 2004 ER - TY - GEN AU - Peckhaus, Volker ID - 18805 T2 - Mathematical Reviews [MR 2005b:00008; MathSciNet 2025850] TI - Reck, Erich H., “Dedekind’s Structuralism: an Interpretation and Partial Defense”, Synthese 137 (2003), 369–419 ER - TY - GEN AU - Peckhaus, Volker ID - 18812 T2 - Mathematical Reviews [MR 2005k:03004; MathSciNet 2116140] TI - Kang, Jinho, “On the Composition of the Prototractatus”, Philosophical Quarterly 55 (2005), 1–20 ER - TY - JOUR AB - We consider the problem of computing the weight of a Euclidean minimum spanning tree for a set of n points in $\mathbb R^d$. We focus on the setting where the input point set is supported by certain basic (and commonly used) geometric data structures that can provide efficient access to the input in a structured way. We present an algorithm that estimates with high probability the weight of a Euclidean minimum spanning tree of a set of points to within $1 + \eps$ using only $\widetilde{\O}(\sqrt{n} \, \text{poly} (1/\eps))$ queries for constant d. The algorithm assumes that the input is supported by a minimal bounding cube enclosing it, by orthogonal range queries, and by cone approximate nearest neighbor queries. Read More: https://epubs.siam.org/doi/10.1137/S0097539703435297 AU - Czumaj, Artur AU - Ergün, Funda AU - Fortnow, Lance AU - Magen, Avner AU - Newman, Ilan AU - Rubinfeld, Ronitt AU - Sohler, Christian ID - 18855 IS - 1 JF - SIAM Journal on Computing SN - 0097-5397 TI - Approximating the Weight of the Euclidean Minimum Spanning Tree in Sublinear Time VL - 35 ER - TY - CONF AB - Modern computer graphics systems are able to render sophisticated 3D szenes consisting of millions of polygons. In this paper we address the problem of occlusion culling. Aila, Miettinen, and Nordlund suggested to implement a FIFO buffer on graphics cards which is able to delay the polygons before drawing them. When one of the polygons within the buffer is occluded or masked by another polygon arriving later from the application, the rendering engine can drop the occluded one without rendering, saving important rendering time.

We introduce a theoretical online model to analyse these problems in theory using competitive analysis. For different cost measures addressed we invent the first competitive algorithms for online occlusion culling. Our implementation shows that these algorithms outperform known ones for real 3D scenes as well. AU - Frahling, Gereon AU - Krokowski, Jens ID - 18867 SN - 0302-9743 T2 - Proc. of the 13th Annual European Symposium on Algorithms (ESA 2005) TI - Online Occlusion Culling VL - 3669 ER - TY - CONF AB - The dynamic page migration problem citedynamic-page-migration is defined in

a distributed network of $n$ mobile nodes sharing one indivisible memory page

of size $D$. During runtime, the nodes can both access a unit of data from

the page and move with a constant speed, thus changing the costs of communication.

The problem is to compute

to minimize the total communication cost.

In this paper we construct and analyze the first deterministic algorithm for this problem.

We prove that it achieves an (up to a constant factor) optimal competitive ratio

$O(n cdot sqrtD)$. We show that the randomization of this algorithm

improves this ratio to $O(sqrtD cdot log n)$ (against an oblivious adversary).

This substantially improves an $O(n cdot sqrtD)$ upper bound from citedynamic-page-migration.

We also give an almost matching lower bound of $Omega(sqrtD cdot sqrtlog n)$ for this problem. AU - Bienkowski, Marcin AU - Dynia, Miroslaw AU - Korzeniowski, Miroslaw ID - 18925 SN - 0302-9743 T2 - Proc. of the 22nd Symposium on Theoretical Aspects of Computer Science (STACS) TI - Improved Algorithms for Dynamic Page Migration ER - TY - CHAP AU - Schindlmayr, Arno ED - Blügel, Stefan ED - Brückel, Thomas ED - Schneider, Claus Michael ID - 18608 SN - 1433-5506 T2 - Magnetism goes Nano TI - Magnetic excitations VL - 26 ER - TY - CHAP AU - Eke, Norbert Otto ED - Eke, Norbert Otto ED - Wahrenburg, Fritz ID - 19346 T2 - Vormärz und Exil – Vormärz im Exil. Forum Vormärz Forschung. Jahrbuch 2004 TI - „Wie fern der Heimath! Mein Herz wie schwer!“ Vormärz und Exil – Vormärz im Exil ER - TY - GEN AU - Eke, Norbert Otto ID - 19531 T2 - IASLonline TI - „Gesucht die Lücke im Ablauf“ – nicht gerichtete Utopiekonzepte. (zu: Corinna Mieth: Das Utopische in Literatur und Philosophie. Zur Ästhetik Heiner Müllers und Alexander Kluges. Tübingen: A. Francke 2003) ER - TY - GEN AU - Eke, Norbert Otto ID - 19529 T2 - IASLonline TI - Totgesagte leben länger. (zu: Ingo Breuer: Theatralität und Gedächtnis. Deutschsprachiges Geschichtsdrama seit Brecht. Köln: Böhlau 2004) ER - TY - CONF AB - We present k-Flipper, a graph transformation algorithm that transforms regular undirected graphs. Given a path of k+2 edges it interchanges the end vertices of the path. By definition this operation preserves regularity and connectivity. We show that every regular connected graph can be reached by a series of these operations for all k ¡Ý 1. We use a randomized version, called Random k-Flipper, in order to create random regular connected undirected graphs that may serve as a backbone for peer-to-peer networks. We prove for degree d¡Ê ¦¸(log n) that a series of O(dn) Random k-Flipper operations with k ∈ ¦¨(d2n2 log 1/¦Å) transforms any graph into an expander graph with high probability, i.e. 1-n-¦¨(1). The Random 1-Flipper is symmetric, i.e. the transformation probability from any labeled

The cell structure has two advantages for applying position-based routing: It helps to determine local minima for greedy forwarding and improves recovery from such minima, because for recovery all edges can be used in contrast to other topology-based rules that can be appliedonly on a planar subgraph.

For the analysis of position-based routing algorithms the measures time and traffic are based on the cell structure. The difficulty of exploring the network is expressed by the size of the barriers (i.e. the number of cells in the perimeters). Exploration can be done in parallel, but with increasing traffic. We propose a comparative measure to assess both time and traffic, the combined comparative ratio, which is the maximum of the ratio of routing time and optimal time and the ratio of the traffic and the minimum exploration costs.

While flooding and common single-path strategies have a linear ratio, we present a simple algorithm that has a sub-linear

combined comparative ratio of O(sqrt(h)), where h is the minimal hop distance between source and target. AU - Rührup, S. AU - Schindelhauer, C. ID - 19834 SN - 0769523129 T2 - 19th IEEE International Parallel and Distributed Processing Symposium TI - Competitive Time and Traffic Analysis of Position-Based Routing using a Cell Structure ER - TY - CONF AB - Recent developments both in the business and the technological domain have led to a significant increase in demand for Business Intelligence (BI) infrastructures that can handle huge amounts of data in small time frames. BI applications are increasingly used by large user bases on all management levels; support tasks spanning the complete value chain are based on transactional data and are directly coupled with operational systems in closed loop approaches.

To effectively handle the resulting data volume turns out to be an extremely challenging task which encompasses a variety of issues on different levels. We propose an integrated multi layer tool for monitoring, benchmarking, analyzing, and optimizing the performance of such BI infrastructures.

Inside this paper we give a coarse outline of the tools architecture and demonstrate the value of distinct measurement points at operating system layer. For that purpose we introduce a kernel based benchmark environment and present first measurement results. The gathered data clearly indicates that a meaningful analysis of performance benchmarks without kernel trace points is of limited value - which shows the necessity to consider a separate component within the tools architecture. AU - Brinkmann, André AU - Effert, Sascha AU - Heidebuer, Michael AU - Vodisek, Mario AU - Baars, Henning ID - 19872 T2 - In Proceedings of the International Workshop on Storage Network Architecture and Parallel I/Os TI - An integrated Architecture for Business Intelligence support from Application down to Storage ER - TY - JOUR AU - Meschut, Gerson ID - 21219 JF - Konstruktion SN - ISSN 0947-9333 TI - Mischbauweise sorgt für frischen Wind VL - 04 ER -