@article{17567, author = {{Leonardi, Stefano and Mahlmann, Peter and Meyer auf der Heide, Friedhelm and Spirakis, Paul G. and Weikum, Gerhard}}, journal = {{e-Strategies, www.britishpublishers.com}}, title = {{{Guarding our digital society's well-being}}}, volume = {{3-10-2007}}, year = {{2007}}, } @inproceedings{18928, author = {{Dynia, Miroslaw and Łopuszański, Jakub and Schindelhauer, Christian}}, booktitle = {{Proc. of the 14th Colloquium on Structural Information and Communication Complexity (SIROCCO)}}, isbn = {{9783540729181}}, pages = {{37---- 46}}, title = {{{Why Robots Need Maps}}}, doi = {{10.1007/978-3-540-72951-8_5}}, year = {{2007}}, } @inproceedings{18929, author = {{Dynia, Miroslaw and Korzeniowski, Miroslaw and Kutyłowski, Jarosław}}, booktitle = {{Proc. of the 33rd International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM'07)}}, isbn = {{9783540695066}}, issn = {{0302-9743}}, pages = {{260----271}}, title = {{{Competitive Maintenance of Minimum Spanning Trees in Dynamic Graphs}}}, doi = {{10.1007/978-3-540-69507-3_21}}, volume = {{4362}}, year = {{2007}}, } @phdthesis{18931, author = {{Kutylowski, Jaroslaw}}, title = {{{Using Mobile Relays for Ensuring Connectivity in Sparse Networks}}}, year = {{2007}}, } @unpublished{18933, author = {{Kutylowski, Jaroslaw}}, title = {{{Competitive Maintenance of Minimum Spanning Trees under Stochastic Adversaries}}}, year = {{2007}}, } @inproceedings{20374, author = {{Dorigo, Marco and Hamann, Heiko and Szymanski, Marc and Wörn, Heinz and Shi, Yuhui}}, booktitle = {{IEEE Swarm Intelligence Symposium, Honolulu, USA, April 1-5}}, pages = {{310----315}}, publisher = {{IEEE Press}}, title = {{{Orientation in a Trail Network by Exploiting its Geometry for Swarm Robotics}}}, doi = {{10.1109/SIS.2007.367953}}, year = {{2007}}, } @inproceedings{20431, author = {{Hamann, Heiko and Wörn, Heinz and Sahin, Erol and Spears, Winfield and Winfield, Winfield}}, booktitle = {{Swarm Robotics - Second SAB 2006 International Workshop}}, pages = {{43----55}}, title = {{{An analytical and spatial model of foraging in a swarm of robots}}}, doi = {{10.1007/978-3-540-71541-2_4}}, volume = {{4433}}, year = {{2007}}, } @inproceedings{20432, abstract = {{Designing and implementing artificial self-organizing systems is a challenging task since they typically behave non- intuitive and only little theoretical foundations exist. Predicting a system of many components with a huge amount of interactions is beyond human skills. The currently common use of simulations for design support is not satisfying, as it is time-consuming and the results are most likely sub- optimal. In this work, we present the derivation of an analytical, time-, and space-continuous model for a swarm of autonomous robots based on the Fokker-Planck equation. While the motion model is in most parts physically motivated, the communication model is based on a heuristic approach. A showcase application to a recently proposed scenario of collective perception in a huge swarm of robots with very limited abilities is given and the simulation results are compared to the model. Despite the high level of abstraction, the prediction discrepancies are small and the parameters can be mapped one-to-one from the model to the control algorithm. Finally, we give an outlook on the capabilities of the proposed model, discuss its limitations, and suggest an improvement that could reduce the number of empirically determined parameters.}}, author = {{Hamann, Heiko and Wörn, Heinz}}, booktitle = {{First International Conference on Self-Adaptive and Self-Organizing Systems (SASO 2007)}}, isbn = {{0769529062}}, pages = {{23----31}}, title = {{{A Space- and Time-Continuous Model of Self-Organizing Robot Swarms for Design Support}}}, doi = {{10.1109/saso.2007.3}}, year = {{2007}}, } @article{20433, author = {{Hamann, Heiko and Wörn, Heinz and Nagy, Marius and Nagy, Naya}}, journal = {{Parallel Processing Letters}}, number = {{3}}, pages = {{287----298}}, title = {{{Embodied Computation}}}, volume = {{17}}, year = {{2007}}, } @inproceedings{20434, abstract = {{Current research in Micro, Nano and Swarm Robots as results of the European projects Miniman, MiCRoN and I-SWARM will be presented. First, the design and the control of 5 to 10cm3 sized mobile micro robots with five degrees of freedom will be shown. They can handle miniaturized parts as for example an optical component or a biological cell with a size in the micrometre-area with an accuracy of 100nm under a microscope or a raster-electron microscope. Second, the design and the control of a 1cm3-sized mobile untethered micro robot will be demonstrated. Here, the robot consists of five parts: the Piezzo locomotion module, the micro control unit, the communication unit, the navigation system and the micro gripper. The mobile robot can be guided and positioned in an arena with an accuracy of 5 micrometre and can be programmed and controlled over the wireless communication unit. Third, the design and the control of 3 × 3 × 3 mm3 sized micro-/nanorobots with 2 degrees of freedom will be presented. The transmission of energy and the communication between the robots is realized via infrared. The robot controller is fully integrated and has limited functionalities. Via basic sensors communication functions and elementary rules and behaviours the micro robot can act in a swarm consisting of hundreds and thousands of robots. Future applications could be monitoring-, inspection-, exploring-tasks etc. of big areas or objects.}}, author = {{Hamann, Heiko and Szymanski, Marc and Wörn, Heinz and Estana, Ramon and Xie, Ming and Dubowsky, Steven}}, booktitle = {{Advances in Climbing and walking robots. Proceedings of 10th International Conference (CLAWAR'07), Singapore, July 16-18}}, pages = {{15----24}}, title = {{{From Micro to Nano and Swarm Robotics}}}, doi = {{10.1142/9789812770189_0003}}, year = {{2007}}, } @article{17980, author = {{Ziegler, Martin}}, issn = {{1571-0661}}, journal = {{Electronic Notes in Theoretical Computer Science}}, pages = {{255--274}}, title = {{{Revising Type-2 Computation and Degrees of Discontinuity}}}, doi = {{10.1016/j.entcs.2006.08.015}}, 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}}, } @inbook{17982, author = {{Ziegler, Martin}}, booktitle = {{Lecture Notes in Computer Science}}, isbn = {{9783540730002}}, issn = {{0302-9743}}, title = {{{(Short) Survey of Real Hypercomputation}}}, doi = {{10.1007/978-3-540-73001-9_86}}, year = {{2007}}, } @inbook{17983, author = {{Meer, Klaus and Ziegler, Martin}}, booktitle = {{Mathematical Foundations of Computer Science 2007}}, isbn = {{9783540744559}}, issn = {{0302-9743}}, title = {{{Real Computational Universality: The Word Problem for a Class of Groups with Infinite Presentation}}}, doi = {{10.1007/978-3-540-74456-6_64}}, year = {{2007}}, } @unpublished{17984, abstract = {{The unit cost model is both convenient and largely realistic for describing integer decision algorithms over (+,*). Additional operations like division with remainder or bitwise conjunction, although equally supported by computing hardware, may lead to a considerable drop in complexity. We show a variety of concrete problems to benefit from such NON-arithmetic primitives by presenting and analyzing corresponding fast algorithms.}}, author = {{Lürwer-Brüggemeier, Katharina and Ziegler, Martin}}, booktitle = {{arXiv:0709.0624}}, title = {{{On Faster Integer Calculations using Non-Arithmetic Primitives}}}, year = {{2007}}, } @techreport{18285, author = {{Ziegler, Martin}}, title = {{{Real Computability and Hypercomputation}}}, year = {{2007}}, } @inproceedings{18347, abstract = {{The validation of material flow models as well as the selection of promising strategies for the generation of a successful experiment plan is a time-consuming process. A new approach is presented, which supports the simulation expert in his working process by giving him the opportunity to modify the simulated simulation run and afterwards compare the effects of his modification with the original setting, online and in one user interface, implemented by switching the visualizations between the simulation runs or opening up to 5 parallel 3D windows. The method developed therefore clones existing simulation runs online and allows the navigation within these existing simulation runs. The method has been implemented and is validated by a test model, which describes in detail the new working process of a modeler. New research questions are derived from this work, which will define following working steps. }}, author = {{Fischer, Matthias and Laroque, Christoph and Huber, Daniel and Krokowski, Jens and Mueck, Bengt and Kortenjan, Michael and Aufenanger, Mark and Dangelmaier, Wilhelm}}, booktitle = {{European Simulation and Modelling Conference (ESM 2007)}}, pages = {{499----505}}, title = {{{Interactive Refinement of a Material Flow Simulation Model by Comparing Multiple Simulation Runs in one 3D Environment}}}, year = {{2007}}, } @inproceedings{18349, author = {{Dangelmaier, Wilhelm and Laroque, Christoph and Fischer, Matthias}}, booktitle = {{Augmented & Virtual Reality in der Produktentstehung}}, pages = {{95--110}}, publisher = {{Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}}, title = {{{Ein ganzheitlicher Ansatz zur immersiven 3D-Materialflusssimulation innerhalb der Digitalen Fabrik}}}, volume = {{209}}, year = {{2007}}, } @inproceedings{18572, abstract = {{We present random sampling algorithms that with probability at least 1 − δ compute a (1 ±ε)-approximation of the clustering coefficient and of the number of bipartite clique subgraphs of a graph given as an incidence stream of edges. The space used by our algorithm to estimate the clustering coefficient is inversely related to the clustering coefficient of the network itself. The space used by our algorithm to compute the number K 3,3 of bipartite cliques is proportional to the ratio between the number of K 1,3 and K 3,3 in the graph. Since the space complexity depends only on the structure of the input graph and not on the number of nodes, our algorithms scale very well with increasing graph size. Therefore they provide a basic tool to analyze the structure of dense clusters in large graphs and have many applications in the discovery of web communities, the analysis of the structure of large social networks and the probing of frequent patterns in large graphs. We implemented both algorithms and evaluated their performance on networks from different application domains and of different size; The largest instance is a webgraph consisting of more than 135 million nodes and 1 billion edges. Both algorithms compute accurate results in reasonable time on the tested instances.}}, author = {{Buriol, Luciana S. and Frahling, Gereon and Leonardi, Stefano and Sohler, Christian}}, booktitle = {{Proceedings of the 15th European Symposium on Algorithms (ESA)}}, isbn = {{9783540755197}}, pages = {{618--632}}, publisher = {{Springer}}, title = {{{Estimating Clustering Indexes in Data Streams}}}, doi = {{10.1007/978-3-540-75520-3_55}}, volume = {{4698}}, 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}}, }