@inproceedings{18179,
abstract = {Do the solutions of linear equations depend computably on their coefficients? Implicitly, this has been one of the central questions in linear algebra since the very beginning of the subject and the famous Gauß algorithm is one of its numerical answers. Today there exists a tremendous number of algorithms which solve this problem for different types of linear equations. However, actual implementations in floating point arithmetic keep exhibiting numerical instabilities for ill-conditioned inputs. This situation raises the question which of these instabilities are intrinsic, thus caused by the very nature of the problem, and which are just side effects of specific algorithms. To approach this principle question we revisit linear equations from the rigorous point of view of computability. Therefore we apply methods of computable analysis, which is the Turing machine based theory of computable real number functions. It turns out that, given the coefficients of a system of linear equations, we can compute the space of solutions, if and only if the dimension of the solution space is known in advance. Especially, this explains why there cannot exist any stable algorithms under weaker assumptions.},
author = {Brattka, Vasco and Ziegler, Martin},
booktitle = {Proceedings of the 2nd IFIP International Conference on Theoretical Computer Science},
pages = {95--106},
title = {{Computability of Linear Equations}},
doi = {10.1007/978-0-387-35608-2_9},
year = {2002},
}
@inproceedings{16490,
abstract = {We present a new data structure for rendering highly complex virtual environments of arbitrary topology. The special feature of our approach is that it allows an interactive navigation in very large scenes (30 GB/400 million polygons in our benchmark scenes) that cannot be stored in main memory, but only on a local or remote hard disk. Furthermore, it allows interactive rendering of substantially more complex scenes by instantiating objects.
For the computation of an approximate image of the scene, a sampling technique is used. In the preprocessing, a so-called sample tree is built whose nodes contain randomly selected polygons from the scene. This tree only uses space that is linear in the number of polygons. In order to produce an image of the scene, the tree is traversed and polygons stored in the visited nodes are rendered. During the interactive walkthrough, parts of the sample tree are loaded from local or remote hard disk.
We implemented our algorithm in a prototypical walkthrough system. Analysis and experiments show that the quality of our images is comparable to images computed by the conventional z-buffer algorithm regardless of the scene topology.},
author = {Klein, Jan and Krokowski, Jens and Fischer, Matthias and Wand, Michael and Wanka, Rolf and Meyer auf der Heide, Friedhelm},
booktitle = {Proceedings of the ACM symposium on Virtual reality software and technology - VRST '02},
isbn = {1581135300},
title = {{The randomized sample tree: a data structure for interactive walkthroughs in externally stored virtual environments}},
doi = {10.1145/585740.585764},
year = {2002},
}
@inproceedings{18369,
abstract = {Visualising is a method used to help experiencing and understanding causal cohesions in simulation processes. For this purpose, tools for visualising are already implemented in prevalent simulation systems. The user creates his simulation model and generates a 3-dimensional (2,5-dimensional) visualising by means of the simulation system. This helps examining the process which makes it easier for the viewer to understand it. Simulation tools usually only provide the opportunity for a unidirectional visualising. In a 3-dimensional surrounding the viewer can not implement an interaction with the simulation while the system is running. Though an interaction during the simulation run enables the user to gain a better understanding of causal cohesions. Solutions via HLA are sophisticated and therefore rather suited for extensive projects.
We present a distributed system consisting of a commercial manufacturing simulation tool, a coupling module and a walkthrough system. The distributed system in conjunctions with the coupling module guarantees generality and a wide field of applications of the walkthrough system. Further it guarantees flexibility and selection of the specialized graphics hardware for the walkthrough system. A further contribution of this paper is the solution of the time synchronisation problem caused by simulation tool and walkthrough system.
},
author = {Mueck, Bengt and Dangelmaier, Wilhelm and Fischer, Matthias and Klemisch, Wolfram},
booktitle = {Simulation und Visualisierung},
pages = {71--84},
publisher = {SCS European Publishing House},
title = {{Bi-directional Coupling of Simulation Tools with a Walkthrough-System}},
year = {2002},
}
@misc{18408,
author = {Peckhaus, Volker},
booktitle = {Zentralblatt für Mathematik und ihre Grenzgebiete [Zbl. 0987.00002]},
title = {{Waldegg, Guillermina, “Ontological Convictions and Epistemological Obstacles in Bolzano’s Geometry”, Science and Education 10 (2001), 409–418}},
year = {2002},
}
@misc{18403,
author = {Peckhaus, Volker},
booktitle = {Zentralblatt für Mathematik und ihre Grenzgebiete [Zbl. 0981.03004]},
title = {{Linsky, Bernard, Russell’s Metaphysical Logic, CSLI Publications: Stanford, CA 1999}},
year = {2002},
}
@misc{18410,
author = {Peckhaus, Volker},
booktitle = {Zentralblatt für Mathematik und ihre Grenzgebiete [Zbl. 0990.03002]},
title = {{Moore, Gregory H., “The Prehistory of Infinitary Logic: 1885–1955”, in: Maria Luisa Dalla Chiara u.a. (Hgg.), Structures and Norms in Science. Volume two of the 10th International Congress of Logic, Methodology and Philosophy of Science, Florence, Italy, August 1995, Dordrecht: Kluwer Academic Publishers 1997, 105–123}},
year = {2002},
}
@misc{18415,
author = {Peckhaus, Volker},
booktitle = {Zentralblatt für Mathematik und ihre Grenzgebiete [Zbl. 0993.01003, Reprint von MR 2002h:01005]},
title = {{Degnan, Michael J., “What is the Scope of Aristotle’s Defense of the PNC”, Apeiron 32 (1999), no. 3, 243–274}},
year = {2002},
}
@inbook{18287,
author = {Tophinke, Doris},
booktitle = {Sprache als Form. FS für Utz Maas},
editor = {Bommes, Michael and Noack, Christina and Tophinke, Doris},
pages = {169--181},
publisher = {Westdeutscher Verlag},
title = {{Schreiben gegen die Regel – Formen und Funktionen orthografischer Abweichungen im Internet Relay Chat (IRC)}},
year = {2002},
}
@inbook{18321,
author = {Tophinke, Doris},
booktitle = {Textsorten im romanischen Sprachvergleich},
editor = {Drescher, Martina},
pages = {267--271},
publisher = {Stauffenburg},
title = {{Texttypologie aus diachroner Sicht}},
year = {2002},
}
@inproceedings{18566,
abstract = {We analyze a randomized pursuit-evasion game on graphs. This game is played by two players, a hunter and a rabbit. Let G be any connected, undirected graph with n nodes. The game is played in rounds and in each round both the hunter and the rabbit are located at a node of the graph. Between rounds both the hunter and the rabbit can stay at the current node or move to another node. The hunter is assumed to be restricted to the graph G: in every round, the hunter can move using at most one edge. For the rabbit we investigate two models: in one model the rabbit is restricted to the same graph as the hunter, and in the other model the rabbit is unrestricted, i.e., it can jump to an arbitrary node in every round.
We say that the rabbit is caught as soon as hunter and rabbit are located at the same node in a round. The goal of the hunter is to catch the rabbit in as few rounds as possible, whereas the rabbit aims to maximize the number of rounds until it is caught. Given a randomized hunter strategy for G, the escape length for that strategy is the worst case expected number of rounds it takes the hunter to catch the rabbit, where the worst case is with regards to all (possibly randomized) rabbit strategies. Our main result is a hunter strategy for general graphs with an escape length of only O
(n log (diam(G))) against restricted as well as unrestricted rabbits. This bound is close to optimal since Ω(n) is a trivial lower bound on the escape length in both models. Furthermore, we prove that our upper bound is optimal up to constant factors against unrestricted rabbits.},
author = {Adler, Micah and Räcke, Harald and Sivadasan, Naveen and Sohler, Christian and Vöcking, Berthold},
booktitle = {Proceedings of the 29th International Colloquium on Automata, Languages and Programming},
isbn = {9783540438649},
issn = {0302-9743},
title = {{Randomized Pursuit-Evasion in Graphs}},
doi = {10.1007/3-540-45465-9_77},
year = {2002},
}
@misc{18756,
author = {Peckhaus, Volker},
booktitle = {Mathematical Reviews [MR 2002h:01005]},
title = {{Degnan, Michael J., “What is the Scope of Aristotle’s Defense of the PNC”, Apeiron 32 (1999), no. 3, 243–274}},
year = {2002},
}
@misc{18751,
author = {Peckhaus, Volker},
booktitle = {Mathematical Reviews [MR 2002h:01001]},
title = {{Thom, Paul, “The Principle of Non-contradiction in Early Greek Philosophy”, Apeiron 32 (1999), no. 3, 153–170}},
year = {2002},
}
@article{19362,
author = {Eke, Norbert Otto},
journal = {Text + Kritik, H. 155: Herta Müller},
number = {Juli},
pages = {64--79},
title = {{Schönheit der Verwund(er)ung. Herta Müllers Weg zum Gedicht}},
year = {2002},
}
@phdthesis{18573,
author = {Sohler, Christian},
isbn = {3-935433-28-X},
title = {{Property Testing and Geometry}},
year = {2002},
}
@inproceedings{19850,
author = {Wanka, Rolf},
booktitle = {Proc. Workshop on Graph-Theoretic Concepts in Computer Science (WG)},
isbn = {9783540003311},
issn = {0302-9743},
pages = {413--420},
title = {{Any Load-Balancing Regimen for Evolving Tree Computations on Circulant Graphs Is Asymptotically Optimal}},
doi = {10.1007/3-540-36379-3_36},
year = {2002},
}
@inproceedings{2136,
author = {Brinkmann, André and Salzwedel, Kay and Scheideler, Christian},
booktitle = {SPAA},
pages = {53----62},
title = {{Compact, adaptive placement schemes for non-uniform requirements}},
year = {2002},
}
@article{22620,
author = {de los Arcos, T. and Vonau, F. and Garnier, M. G. and Thommen, V. and Boyen, H.-G. and Oelhafen, P. and Düggelin, M. and Mathis, D. and Guggenheim, R.},
issn = {0003-6951},
journal = {Applied Physics Letters},
pages = {2383--2385},
title = {{Influence of iron–silicon interaction on the growth of carbon nanotubes produced by chemical vapor deposition}},
doi = {10.1063/1.1465529},
year = {2002},
}
@article{23344,
author = {Fischer, Gerd and Heyken, Reent and Trächtler, Ansgar},
journal = {ATZ Worldwide 104},
pages = {7--10,},
title = {{Active stabilisation of the car-trailer combination with BMW X5 An innovative further improvement of the dynamic stability control DSC for active damping of trailer sway movements}},
year = {2002},
}
@phdthesis{24599,
author = {Goldschmidt, Stefan},
publisher = {Heinz Nixdorf Institut, Universität Paderborn},
title = {{Anwendung mengenorientierter numerischer Methoden zur Analyse nichtlinearer dynamischer Systeme am Beispiel der Spurführungsdynamik von Schienenfahrzeugen}},
volume = {112},
year = {2002},
}
@proceedings{24594,
editor = {Gausemeier, Jürgen},
publisher = {Heinz Nixdorf Institut, Universität Paderborn},
title = {{1. Paderborner Workshop Augmented & Virtual Reality in der Produktentstehung}},
volume = {107},
year = {2002},
}