@inbook{19371, author = {{Eke, Norbert Otto}}, booktitle = {{Thomas Valentin: Der Hausfreund. Dramen}}, editor = {{Eke, Norbert Otto}}, pages = {{387--403}}, publisher = {{Igel}}, title = {{{Der Dramatiker Thomas Valentin}}}, year = {{2001}}, } @misc{23421, author = {{Zimmer, Detmar}}, title = {{{Dichtsysteme zwischen einer Welle und einem feststehenden Gehäuseteil}}}, year = {{2001}}, } @misc{23423, author = {{Zimmer, Detmar}}, title = {{{Modular Gear System with Contrate Gear}}}, year = {{2001}}, } @article{23731, abstract = {{ On 22 May 2000, the factorization of a pseudorandom polynomial of degree 1 048 543 over the binary field Z 2 was completed on a 4-processor Linux PC, using roughly 100 CPU-hours. The basic approach is a combination of the factorization software BIPOLAR and a parallel version of Cantor's multiplication algorithm. The PUB-library (Paderborn University BSP library) is used for the implementation of the parallel communication. }}, author = {{Bonorden, Olaf and von zur Gathen, Joachim and Gerhard, Jürgen and Müller, Olaf}}, issn = {{0163-5824}}, journal = {{ACM SIGSAM Bulletin}}, pages = {{16--18}}, title = {{{Factoring a binary polynomial of degree over one million}}}, doi = {{10.1145/504331.504333}}, year = {{2001}}, } @inproceedings{18152, abstract = {{Computing the spectral decomposition of a normal matrix is among the most frequent tasks to numerical mathematics. A vast range of methods are employed to do so, but all of them suffer from instabilities when applied to degenerate matrices, i.e., those having multiple eigenvalues. We investigate the spectral representation's effectivity properties on the sound formal basis of computable analysis. It turns out that in general the eigenvectors cannot be computed from a given matrix. If however the size of the matrix' spectrum (=number of different eigenvalues) is known in advance, it can be diagonalized effectively. Thus, in principle the spectral decomposition can be computed under remarkably weak non-degeneracy conditions.}}, author = {{Ziegler, Martin and Brattka, Vasco}}, booktitle = {{Proceedings of the 4th Workshop on Computability and Complexity in Analysis (CCA'2000)}}, isbn = {{9783540421979}}, issn = {{0302-9743}}, pages = {{378--388}}, title = {{{A Computable Spectral Theorem}}}, doi = {{10.1007/3-540-45335-0_23}}, volume = {{2064}}, year = {{2001}}, } @inproceedings{18166, abstract = {{What is the maximum number of edges of the d-dimensional hypercube, denoted by S(d,k), that can be sliced by k many hyperplanes? This question on combinatorial properties of Euclidean geometry arising from linear separability considerations in the theory of Perceptrons has become an issue on its own. We use computational and combinatorial methods to obtain new bounds on S(d,k), s<=8. These strengthen earlier results on hypercube cut numbers.}}, author = {{Ziegler, Martin and Emamy-Khansari, M. Reza}}, booktitle = {{Proceedings of the First International Conference on Discrete Models - Combinatorics, Computation and Geometry (DM-CCG'2001)}}, pages = {{155--164}}, title = {{{New Bounds for Hypercube Slicing Numbers}}}, volume = {{AA}}, year = {{2001}}, } @inproceedings{18168, abstract = {{We consider the classical LINEAR OPTIMIZATION Problem, but in the Turing rather than the RealRAM model. Asking for mere computability of a function's maximum over some closed domain, we show that the common presumptions 'full-dimensional' and `bounded' in fact cannot be omitted: The sound framework of Recursive Analysis enables us to rigorously prove this folkloristic observation! On the other hand, convexity of this domain may be weakened to connectedness, and even NON-linear functions turn out to be effectively optimizable.}}, author = {{Brattka, Vasco and Ziegler, Martin}}, booktitle = {{Proceedings of the 13th Canadian Conference on Computational Geometry (CCCG'01)}}, pages = {{181--184}}, title = {{{Turing Computability of (Non-)Linear Optimization}}}, year = {{2001}}, } @inproceedings{18370, abstract = {{We present a new approximate occlusion-culling algorithm that in contrast to other algorithms, manages the objects of the scene in a 3D-sectorgraph. For generating a frame, as far as possible only the visible objects are rendered that can be found quickly by an edge of the graph. The algorithm allows a real-time navigation with over 20 frames per second in complex scenes consisting of over 10 millions of polygons. Moreover, approximation errors are very low.}}, author = {{Klein, Jan and Fischer, Matthias}}, booktitle = {{Proc. of 3. GI-Informatiktage 2001}}, pages = {{275 -- 278}}, title = {{{Occlusion Culling for Virtual Environments based on the 3D-Sectorgraph}}}, year = {{2001}}, } @inproceedings{22321, author = {{Zimmer, Detmar}}, booktitle = {{Variantenvielfalt in Produkten und Prozessen. Erfahrungen, Methoden und Instrumente}}, isbn = {{3-18-091645-1}}, pages = {{77--87}}, publisher = {{VDI-Gesellschaft Entwicklung Konstruktion Vertrieb (VDI-EKV)}}, title = {{{Entwicklung eines Getriebemotoren-Baukastens}}}, year = {{2001}}, } @article{22322, author = {{Zimmer, Detmar}}, journal = {{SMM - Schweizer Maschinenmarkt }}, number = {{17}}, title = {{{Kraft- oder Formschluss?}}}, volume = {{102}}, year = {{2001}}, } @article{22323, author = {{Zimmer, Detmar}}, journal = {{Special Antriebstechnik - Eine Sonderausgabe der Zeitschriften VDI-Z und Konstruktion }}, number = {{1}}, pages = {{50--52}}, publisher = {{Vereinigte Fachverlage GmbH}}, title = {{{Berechnung des kegeligen Längspressverbands bei Einsteckritzeln}}}, volume = {{53}}, year = {{2001}}, } @article{22917, author = {{König, Rolf and Sureth-Sloane, Caren}}, journal = {{Steuern und Bilanzen}}, number = {{3}}, pages = {{117--121}}, publisher = {{Herne Berlin}}, title = {{{Der Einfluss der Unternehmenssteuerreform auf die rechtsformspezifische Steuerbelastung}}}, volume = {{3}}, year = {{2001}}, } @article{23347, author = {{Trächtler, Ansgar}}, journal = {{Tagung "Fahrdynamikregelung", Haus der Technik}}, title = {{{Integration der fahrdynamischen Funktionen durch Vehicle Dynamics Management}}}, year = {{2001}}, } @article{23348, author = {{Trächtler, Ansgar}}, journal = {{Fortschritt-Berichte VDI Reihe 8 Nr. 897}}, title = {{{Tomographische Methoden in der Meßtechnik }}}, year = {{2001}}, } @proceedings{7787, editor = {{Mehner, Katharina and Mezini, M. and Pulvermüller, Elke and Speck, Andreas}}, publisher = {{University of Paderborn}}, title = {{{Proceedings of the workshop on Aspect-Orientation, German Society for Informatics, Special Interest Group for Object-Oriented Software Developement, Paderborn (Germany)}}}, volume = {{tr-ri-01-223}}, year = {{2001}}, } @proceedings{7788, editor = {{Engels, Gregor and Oberweis, A. and Zündorf, Albert}}, publisher = {{Gesellschaft für Informatik (GI)}}, title = {{{Modellierung 2001}}}, volume = {{1}}, year = {{2001}}, } @proceedings{7789, editor = {{Böllert, K. and Streitferdt, D. and Heuzeroth, D. and Mehner, Katharina and Hanenberg, S.}}, title = {{{Proceedings of the 3rd Young Researchers Workshop, satellite of the 3rd International Symposium on Generative and Component-Based Engineering (GCSE '01), Erfurt (Germany)}}}, year = {{2001}}, } @inproceedings{7879, author = {{Lütkemeier, Björn and Thöne, Sebastian}}, booktitle = {{Proceedings of the Fachwissenschaftlicher Informatik-Kongress (Informatiktage 2001), Bad Schussenried (Germany)}}, publisher = {{Konradin-Verlag}}, title = {{{Prozessorientierte Integration von Softwarekomponenten durch XML-basierte Workflow-Modelle}}}, year = {{2001}}, } @inproceedings{7880, author = {{Baldan, Paolo and Corradini, Andrea and Ehrig, Hartmut and Heckel, Reiko}}, booktitle = {{Proceedings of the conference on Concurrency Theory (CONCUR 2001), Aalborg (Denmark)}}, pages = {{502--518}}, publisher = {{Springer}}, title = {{{Compositional Modeling of Reactive Systems Using Open Nets}}}, volume = {{2154}}, year = {{2001}}, } @inproceedings{7881, author = {{Küster, Jochen and Stroop, Joachim}}, booktitle = {{Proceedings of the conference on Object-Oriented Real-Time Distributed Computing (ISORC 2001), Magdeburg (Germany)}}, pages = {{31--40}}, publisher = {{IEEE Computer Society}}, title = {{{Consistent Design of Embedded Real-Time Systems with UML-RT}}}, doi = {{https://groups.uni-paderborn.de/fg-engels/Publications/doi.ieeecomputersociety.org/10.1109/ISORC.2001.922815}}, year = {{2001}}, }