@inproceedings{16666,
author = {Schütze, Oliver and Talbi, El-ghazali and Pulido, Gregorio Toscano and Coello, Carlos Coello and Santana-Quintero, Luis Vicente},
booktitle = {2007 IEEE Swarm Intelligence Symposium},
isbn = {1424407087},
title = {{A Memetic PSO Algorithm for Scalar Optimization Problems}},
doi = {10.1109/sis.2007.368036},
year = {2007},
}
@inproceedings{16630,
abstract = {This paper formulates the dynamical equations of mechanics subject to holonomic constraints in terms of the states and controls using a constrained version of the Lagrange-d’Alembert principle. Based on a discrete version of this principle, a structure preserving time-stepping scheme is derived. It is shown that this respect for the mechanical structure (such as a reliable computation of the energy and momentum budget, without numerical dissipation) is retained when the system is reduced to its minimal dimension by the discrete null space method. Together with initial and final conditions on the configuration and conjugate momentum, the reduced time-stepping equations serve as nonlinear equality constraints for the minimisation of a given cost functional. The algorithm yields a sequence of discrete configurations together with a sequence of actuating forces, optimally guiding the system from the initial to the desired final state. The resulting discrete optimal control algorithm is shown to have excellent energy and momentum properties, which are illustrated by two specific examples, namely reorientation and repositioning of a rigid body subject to external forces and the reorientation of a rigid body with internal momentum wheels.},
author = {Leyendecker, Sigrid and Ober-Blöbaum, Sina and Marsden, Jerrold E. and Ortiz, Michael},
booktitle = {Volume 5: 6th International Conference on Multibody Systems, Nonlinear Dynamics, and Control, Parts A, B, and C},
isbn = {079184806X},
title = {{Discrete Mechanics and Optimal Control for Constrained Multibody Dynamics}},
doi = {10.1115/detc2007-34574},
year = {2007},
}
@inbook{4985,
author = {Bähring, Katrin and Thommes, Kirsten},
booktitle = {Kooperation und Konkurrenz},
editor = {Schreyögg, Georg and Sydow, Jörg},
isbn = {978-3-8349-0575-8},
pages = {41----74},
publisher = {Gabler},
title = {{Kooperation und Konkurrenz in Personaldienstleistungsbeziehungen}},
doi = {10.1007/978-3-8349-9331-1_2},
year = {2007},
}
@misc{17796,
author = {Peckhaus, Volker},
booktitle = {Bulletin of Symbolic Logic},
pages = {547--549},
title = {{Karl Sigmund/John Dawson/Kurt Mühlberger, Kurt Gödel. Das Album. The Album, Vieweg: Wiesbaden 2006}},
volume = {13},
year = {2007},
}
@inproceedings{17284,
abstract = {The paper introduces an online user study onapplications for social robots with 127 participants. The potential users proposed 570 application scenarios based on the appearance and functionality of four robots presented (AIBO,BARTHOC, BIRON, iCat). The items were grouped into 13 categories which are interpreted and discussed by means of four dimensions: public vs. private use, intensity of interaction,complexity of interaction model, and functional vs. human-like appearance. The interpretation lead to three classes of applications for social robots according to the degree of social interaction: (1) Specialized Applications where the robot has to perform clearly defined tasks which are delegated by a user, (2)Public Applications which are directed to the communication with many users, and (3) Individual Applications with the need of a highly elaborated social model to maintain a variety of situations with few people.},
author = {Hegel, Frank and Lohse, Manja and Swadzba, Agnes and Wachsmuth, Sven and Rohlfing, Katharina and Wrede, Britta},
booktitle = {16th IEEE International Symposium on Robot and Human Interactive Communication (RO-MAN’07)},
pages = {938--943},
publisher = {IEEE},
title = {{Classes of Applications for Social Robots: A User Study}},
doi = {10.1109/roman.2007.4415218},
year = {2007},
}
@article{17981,
author = {Ziegler, Martin},
issn = {1432-4350},
journal = {Theory of Computing Systems},
pages = {177--206},
title = {{Real Hypercomputation and Continuity}},
doi = {10.1007/s00224-006-1343-6},
year = {2007},
}
@book{17448,
abstract = {Rezension: Neue Zürcher Zeitung v. 6. Juni 2007 (G. Szpiro); Ralf Bülow, “Hundert Jahre moderne Mathematik”, heise online v. 13.02.2008 (http://www.heise.de/newsticker/Hundert-Jahre-moderne-Mathematik–/meldung/103411); Mathematical Reviews 2007m:01024 (J.M. Plotkin); MAA Online 5. Juli 2007 (M. Berg); Philip J. Davis, “The Z of ZF and ZFC and ZF¬C”, SIAM News 41.1, January/February 2008; SIAM Review 50.1 (2008), 167–169; (J.W. Dawson); European Mathematical Society Newsletter June 2008, 54; The Mathematical Intelligencer 31 (2009), 79–81 (Henry E. Heatherly); Notices of the AMS 56 (2009), 823–827 (G.H. Moore); Zbl. Math. 1176.01001 (H.K. Sørensen).},
author = {Ebbinghaus, Heinz-Dieter and Peckhaus, Volker},
pages = {xiv + 356 [insbesondere Abschnitte 1.2, 2.3.1, 2.4, 2.8.4, 2.10, 2.11.4, 3.1, 3.2]},
publisher = {Springer},
title = {{Ernst Zermelo. An Approach to His Life and Work}},
year = {2007},
}
@misc{18643,
author = {Peckhaus, Volker},
booktitle = {Zentralblatt für Mathematik und ihre Grenzgebiete [Zbl. 1111.68301; Wiederabdruck von MR 2003d:68002]},
title = {{Vollmar, Roland, „Von Zielen und Grenzen der Informatik“, Abh. Braunschw. Wiss. Ges. 51 (2002), 9–24}},
year = {2007},
}
@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},
}
@misc{18650,
author = {Peckhaus, Volker},
booktitle = {Zentralblatt für Mathematik und ihre Grenzgebiete [Zbl. 1123.01019]},
title = {{Bolzano, Bernard, Briefe an Josef Sommer und andere (1812–1848), hg. v. Jan Berg, Frommann-Holzboog: Stuttgart-Bad Cannstatt 2005 (Bernard Bolzano-Gesamtausgabe, III.5.1)}},
year = {2007},
}