@inproceedings{18655, abstract = {{We study graph properties which are testable for bounded degree graphs in time independent of the input size. Our goal is to distinguish between graphs having a predetermined graph property and graphs that are far from every graph having that property. It is believed that almost all, even very simple graph properties require a large complexity to be tested for arbitrary (bounded degree) graphs. Therefore in this paper we focus our attention on testing graph properties for special classes of graphs. We call a graph family non-expanding if every graph in this family is not a weak expander (its expansion is O(1/log2 n), where n is the graph size). A graph family is hereditary if it is closed under vertex removal. Similarly, a graph property is hereditary if it is closed under vertex removal. Next, we call a graph property Π to be testable for a graph family F if for every graph G ε F, in time independent of the size of G we can distinguish between the case when G satisfies property Π and when it is far from every graph satisfying property Π. In this paper we prove thatIn the bounded degree graph model, any hereditary property is testable if the input graph belongs to a hereditary and non-expanding family of graphs.As an application, our result implies that, for example, any hereditary property (e.g., k-colorability, H-freeness, etc.) is testable in the bounded degree graph model for planar graphs, graphs with bounded genus, interval graphs, etc. No such results have been known before and prior to our work, in the bounded degree graph model very few graph properties have been known to be testable for any graph classes.}}, author = {{Sohler, Christian and Czumaj, Artur}}, booktitle = {{Proceedings of the 17th ACM-SIAM Symposium on Discrete Algorithms (SODA'07)}}, isbn = {{9780898716245}}, pages = {{494--501}}, title = {{{On Testable Properties in Bounded Degree Graphs}}}, year = {{2007}}, } @inproceedings{18656, abstract = {{In the StrSort model [2], the input is given as a stream, e.g. a sequence of points, and an algorithm can perform (a) streaming and (b) sorting passes to process the stream. A streaming pass reads the input stream from left to right and writes an output stream, which is the input of the next pass. A sorting pass is a black box operation that sorts a stream according to some partial order. In this paper, we develop algorithms for two basic geometric problems in the StrSort model. At first, we propose a divide-and-conquer algorithm that computes the convex hull of a point set in 2D in O(log2 n) passes using O(1) memory. Then we give a StrSort algorithm to compute a (1+ε)-spanner for a point set in Rd for constant d and constant epsilon that uses O(logd-1 n) passes and O(log n) space. This result implies a (1+ε)-approximation of the Euclidean minimum spanning tree in Rd, for constant d and ε.}}, author = {{Sohler, Christian and Lammersen, Christiane}}, booktitle = {{Proceedings of the 23rd European Workshop on Computational Geometry (EWCG)}}, pages = {{69--72}}, title = {{{StrSort Algorithms for Geometric Problems}}}, year = {{2007}}, } @inproceedings{18660, author = {{Sohler, Christian and Czumaj, Artur}}, booktitle = {{Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS)}}, pages = {{570 -- 578}}, title = {{{Testing Expansion in Bounded-Degree Graphs}}}, year = {{2007}}, } @inproceedings{18662, author = {{Sohler, Christian and Czumaj, Artur}}, booktitle = {{Proceedings of the 24th International Symposium on Theoretical Aspects of Computer Science (STACS'07)}}, pages = {{536--548}}, title = {{{Small Space Representations for Metric Min-Sum k-Clustering and their Applications}}}, year = {{2007}}, } @article{18665, abstract = {{We present a novel analysis of a random sampling approach for four clustering problems in metric spaces: k-median, k-means, min-sum k-clustering, and balanced k-median. For all these problems, we consider the following simple sampling scheme: select a small sample set of input points uniformly at random and then run some approximation algorithm on this sample set to compute an approximation of the best possible clustering of this set. Our main technical contribution is a significantly strengthened analysis of the approximation guarantee by this scheme for the clustering problems.The main motivation behind our analyses was to design sublinear-time algorithms for clustering problems. Our second contribution is the development of new approximation algorithms for the aforementioned clustering problems. Using our random sampling approach, we obtain for these problems the first time approximation algorithms that have running time independent of the input size, and depending on k and the diameter of the metric space only. © 2006 Wiley Periodicals, Inc. Random Struct. Alg., 2007A preliminary extended abstract of this work appeared in Proceedings of the 31st Annual International Colloquium on Automata, Languages and Programming (ICALP), pp. 396407, 2004.}}, author = {{Sohler, Christian and Czumaj, Artur}}, journal = {{Random Structures & Algorithms}}, number = {{1-2}}, pages = {{226 ---- 256}}, title = {{{Sublinear-time approximation algorithms for clustering via random sampling}}}, volume = {{30}}, year = {{2007}}, } @inproceedings{18668, author = {{Sohler, Christian and Monemizahdeh, Morteza and Feldman, Dan}}, booktitle = {{Proceedings of the 23rd annual symposium on computational geometry (SoCG'07)}}, pages = {{11--18}}, title = {{{A PTAS for k-means clustering based on weak coresets}}}, year = {{2007}}, } @inproceedings{18669, author = {{Sohler, Christian and Czumaj, Artur and Frahling, Gereon}}, booktitle = {{Proceedings of the 19th Canadian Conference on Computational Geometry (CCCG)}}, pages = {{157--160}}, title = {{{Efficient kinetic data structures for MaxCut}}}, year = {{2007}}, } @inproceedings{2214, abstract = {{We present a randomized block-level storage virtualization for arbitrary heterogeneous storage systems that can distribute data in a fair and redundant way and can adapt this distribution in an efficient way as storage devices enter or leave the system. More precisely, our virtualization strategies can distribute a set of data blocks among a set of storage devices of arbitrary non-uniform capacities so that a storage device representing x% of the capacity in the system will get x% of the data (as long as this is in principle possible) and the different copies of each data block are stored so that no two copies of a data block are located in the same device. Achieving these two properties is not easy, and no virtualization strategy has been presented so far that has been formally shown to satisfy fairness and redundancy while being time- and space-eflcient and allowing an efficient adaptation to a changing set of devices.}}, author = {{Brinkmann, André and Effert, Sascha and Meyer auf der Heide, Friedhelm and Scheideler, Christian}}, booktitle = {{IEEE International Conference on Distributed Computing Systems (ICDCS)}}, title = {{{Dynamic and redundant data placement}}}, year = {{2007}}, } @inproceedings{22330, author = {{Frank, Ursula and Gausemeier, Jürgen and Schmidt, Alexander and Zimmer, Detmar}}, booktitle = {{Internationales Forum Mechatronik. Intelligente Systeme und Module}}, isbn = {{978-3-033-01192-2}}, publisher = {{Züricher Hochschule für Angewandte Wissenschaften Institut für Mechatronische Systeme}}, title = {{{Von der Mechatronik zur Selbstoptimierung}}}, year = {{2007}}, } @inproceedings{22331, author = {{Gausemeier, Jürgen and Dangelmaier, Wilhelm and Zimmer, Detmar and Schmidt, Alexander and Frank, Ursula and Klöpper, Benjamin}}, booktitle = {{Computers and Information in Engineering Conference, Parts A and B}}, isbn = {{0-7918-3806-4}}, pages = {{935--944}}, publisher = {{American Society of Mechanical Engineers}}, title = {{{Using Active Patterns for the Conceptual Design of Self-Optimizing Systems Exemplified by an Air Gap Adjustment System}}}, doi = {{10.1115/DETC2007-34642}}, volume = {{27}}, year = {{2007}}, } @inproceedings{22332, author = {{Gausemeier, Jürgen and Zimmer, Detmar and Frank, Ursula and Pook, Sebastian and Schmidt, Alexander}}, booktitle = {{International Conference of Engineering Design}}, isbn = {{1-904670-02-4}}, pages = {{311--323}}, title = {{{Conceptual Design of Self-Optimizing Systems Exemplified by a Magnetic Linear Drive}}}, volume = {{16}}, year = {{2007}}, } @inproceedings{22333, author = {{Zimmer, Detmar and Möller, Jens}}, booktitle = {{VDI-Gesellschaft Entwicklung Konstruktion Vertrieb (VDI-EKV)}}, isbn = {{978-3-18-091997-3}}, pages = {{305--322}}, publisher = {{: VDI Verlag GmbH }}, title = {{{Messung von radialen Lagerkräften an einem CVT-Variator mit Schubgliederband}}}, year = {{2007}}, } @article{22334, author = {{Zimmer, Detmar and Felgenhauer, Benedikt and Möller, Jens}}, isbn = {{0373-3300}}, journal = {{Konstruktion - Zeitschrift für Produktentwicklung und Ingenieur-Werkstoffe }}, number = {{6}}, pages = {{78--82}}, publisher = {{Springer-VDI-Verlag }}, title = {{{Messung der radialen Lagerkräfte eines CVT-Variators}}}, volume = {{59}}, year = {{2007}}, } @book{22335, author = {{Gausemeier, Jürgen and Frank, Ursula and Pook, Sebastian and Zimmer, Detmar and Schmidt, Alexander}}, isbn = {{978-3-939350-29-3}}, pages = {{175--196}}, publisher = {{W. V. Westfalia Druck GmbH}}, title = {{{Konzipierung selbstoptimierender Systeme am Beispiel eines magnetischen Linearantriebs}}}, year = {{2007}}, } @inproceedings{22336, author = {{Denzer, Vera}}, booktitle = {{CIRP Conference on Computer Aided Tolerancing. Specification and Verification for Assemblies}}, isbn = {{978-3-8322-6036-1}}, pages = {{39}}, publisher = {{Shaker Verlag }}, title = {{{Dimensioning and tolerancing in international comparison. Confrontation of standardisation works of GPS and GD&T}}}, volume = {{10}}, year = {{2007}}, } @phdthesis{22337, author = {{Felgenhauer, Benedikt}}, isbn = {{978-3-89959-625-0}}, publisher = {{Der Andere Verlag}}, title = {{{Untersuchungen zur Verformung, zum Lauf des Umschlingungsmittels und zur Reibung in einem stufenlosen Umschlingungsgetriebe}}}, year = {{2007}}, } @article{23278, author = {{Bruns, Torsten and Schäfer, Erika}}, journal = {{International Journal of Vehicle Systems Modelling and Testing 2007}}, pages = {{276--295}}, title = {{{Modelling and Identification of an All-Terrain Vehicle}}}, year = {{2007}}, } @inproceedings{23281, author = {{Henke, Christian and Rustemeier, Carsten and Schneider, Tobias and Böcker, Joachim and Trächtler, Ansgar}}, booktitle = {{Internationaler ETG - Kongress 2007}}, title = {{{RailCab - Ein Schienenverkehrssystem mit autonomen, Linearmotor getriebenen Einzelfahrzeugen}}}, year = {{2007}}, } @article{23282, author = {{Cinkaya, Hueseyin and Noelle, Rene and Münch, Eckehard and Trächtler, Ansgar}}, journal = {{AIM 2007}}, title = {{{Self-Calibration of the 6-dof Parallel Robot TriPlanar by Identification of the Geometry Parameters}}}, year = {{2007}}, } @inproceedings{23283, author = {{Nachtigal, Vitalij and Trächtler, Ansgar and Jäker, Karl-Peter}}, booktitle = {{5th IFAC Symposium on Advances in Automotive Control (AAC)}}, title = {{{X-by-Wire Test Vehicle for the Test of New Design Methods and Tools to Interconnect Vehicle-Dynamics Control Systems}}}, year = {{2007}}, }