@article{1733, author = {{Zhang, Shuang and Park, Yong-Shik and Liu, Yongmin and Zentgraf, Thomas and Zhang, Xiang}}, issn = {{1094-4087}}, journal = {{Optics Express}}, number = {{6}}, publisher = {{The Optical Society}}, title = {{{Far-field measurement of ultra-small plasmonic mode volume}}}, doi = {{10.1364/oe.18.006048}}, volume = {{18}}, year = {{2010}}, } @inproceedings{17422, abstract = {{Commercial software of material flow simulations has the ability to layout the simulated models. Arranged equipment, such as conveyors or machines, includes the need to model and determine motion paths for moving objects like forklifts or automatically guided vehicles, so that the simulation framework is able to navigate all vehicles across those motion paths. After analyzing first scenarios, the user often carries out layout changes in the simulation model, e.g. moving, adding or deleting equipment. However, those changes cause time consuming, additional modeling of the motion paths for the user. Our motion planning algorithm reduces these changes by automatically determining the motion paths for moving objects, depending on an actual model layout without colliding with other objects. The algorithm works on the basis of the virtual scene’s 3D-data used for the simulation model’s visualization. We demonstrate the technique with a multi-floor building example.}}, author = {{Fischer, Matthias and Renken, Hendrik and Laroque, Christoph and Schaumann, Guido and Dangelmaier, Wilhelm}}, booktitle = {{Proceedings of the 2010 Winter Simulation Conference}}, isbn = {{9781424498666}}, title = {{{Automated 3D-motion planning for ramps and stairs in intra-logistics material flow simulations}}}, doi = {{10.1109/wsc.2010.5678906}}, year = {{2010}}, } @techreport{17462, author = {{Gehweiler, Joachim and Meyer auf der Heide, Friedhelm and Schroeder, Ulf-Peter}}, publisher = {{Heinz Nixdorf Institut}}, title = {{{A Large-Scale Distributed Environment for Peer-to-Peer Services}}}, year = {{2010}}, } @techreport{17464, author = {{Blesa, Maria J. and Blum, Christian and de Caro, Angelo and Degener, Bastian and Kempkes, Barbara and Leone, Piere and Persiano, Giuseppe and Meyer auf der Heide, Friedhelm and Mylonas, Georgios}}, title = {{{Adapting a sensor net to the dynamic environment in a wildlife scenario - a case study}}}, year = {{2010}}, } @unpublished{17586, abstract = {{We are given a winding chain of $n$ mobile robots between two stations in the plane, each of them having a limited viewing range. It is only guaranteed that each robot can see its two neighbors in the chain. We analyze a simple and natural parallel strategy to shorten the chain in a time model where each relay is allowed to move up to a distance of $\delta$ in each time step. This model fills the gap between the previously used discrete time model and the continuous time model which was introduced recently in \cite{sirocco}. We analyze the strategy with respect to two quality measures: the number of time steps and the maximum distance to be traveled by the robots, which are the major energy consumers in this scenario. We provide asymptotically tight or almost tight bounds in this time model for both quality measures and it turns out that the best choice for $\delta$ is $\delta \in \Theta(\frac{1}{n})$, since this minimizes the number of time steps as well as the maximum traveled distance.}}, author = {{Brandes, Philipp and Degener, Bastian and Kempkes, Barbara and Meyer auf der Heide, Friedhelm}}, title = {{{Building short chains of mobile robots locally with a bounded stepwidth}}}, year = {{2010}}, } @inproceedings{17665, author = {{Bar-Yehuda, Reuven and Polevoy, Gleb and Rawitz, Dror}}, booktitle = {{DIALM-PODC}}, pages = {{33--42}}, title = {{{Bandwidth allocation in cellular networks with multiple interferences}}}, year = {{2010}}, } @inbook{17711, author = {{Claridge, Claudia and Mindt, Ilka}}, booktitle = {{Anglistentag 2009 Klagenfurt. Proceedings}}, editor = {{Helbig, Jörg and Schallegger, René}}, pages = {{1 -- 114}}, publisher = {{Wissenschaftler Verlag}}, title = {{{Beiträge der Sektion I "'Spoken' English through the Centuries." Sprachwissenschaftliche Sektion beim Anglistentag 2009 in Klagenfurt.}}}, year = {{2010}}, } @inbook{17768, author = {{Claridge, Claudia and Mindt, Ilka}}, booktitle = {{Anglistentag 2009 Klagenfurt. Proceedings}}, editor = {{Helbig, Jörg and Schallegger, René}}, pages = {{1 -- 8}}, publisher = {{Wissenschaftler Verlag}}, title = {{{Spoken English through the centuries: Introduction}}}, year = {{2010}}, } @inbook{17769, author = {{Mindt, Ilka}}, booktitle = {{Kompendium Korpuslinguistik. Eine Bestandsaufnahme aus deutsch-tschechischer Perspektive}}, editor = {{Kratochvílová, Iva and Wolf, Norbert Richard}}, pages = {{53 -- 65}}, publisher = {{Winter}}, title = {{{Methoden der Korpuslinguistik: Der korpus-basierte und der korpus-geleitete Ansatz}}}, year = {{2010}}, } @inbook{18761, author = {{Hamann, Heiko and Schmickl, Thomas and Stradner, Jürgen and Crailsheim, Karl and Levi, Paul and Kernbach, Serge}}, booktitle = {{Symbiotic Multi-Robot Organisms: Reliability, Adaptability, Evolution}}, pages = {{240----263}}, publisher = {{Springer}}, title = {{{Hormone-based Control for Multi-modular Robotics}}}, year = {{2010}}, } @phdthesis{18910, author = {{Bienkowski, Marcin}}, isbn = {{978-3-942647-01-4}}, publisher = {{Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}}, title = {{{Page migration in dynamic networks}}}, volume = {{282}}, year = {{2010}}, } @phdthesis{18927, author = {{Dynia, Miroslaw}}, isbn = {{978-3-942647-03-8}}, publisher = {{Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}}, title = {{{Collective graph exploration}}}, volume = {{284}}, year = {{2010}}, } @article{19011, author = {{Degener, Bastian and Gehweiler, Joachim and Lammersen, Christiane}}, issn = {{0178-4617}}, journal = {{Algorithmica}}, number = {{3}}, pages = {{562--584}}, title = {{{Kinetic Facility Location}}}, doi = {{10.1007/s00453-008-9250-7}}, volume = {{57}}, year = {{2010}}, } @book{19012, abstract = {{4. Auflage 2014}}, author = {{Eke, Norbert Otto and Allkemper, Alo}}, publisher = {{Fink}}, title = {{{Literaturwissenschaft}}}, year = {{2010}}, } @inproceedings{19013, author = {{Gehweiler, Joachim and Meyerhenke, Henning}}, booktitle = {{Proceeedings of 24th International Parallel and Distributed Processing Symposium (IPDPS, HPGC)}}, isbn = {{9781424465330}}, title = {{{A distributed diffusive heuristic for clustering a virtual P2P supercomputer}}}, doi = {{10.1109/ipdpsw.2010.5470922}}, year = {{2010}}, } @inproceedings{19016, abstract = {{Load balancing is an important requirement for the efficient execu-tion of parallel numerical simulations. In particular when the simulation domainchanges over time, the mapping of computational tasks to processors needs tobe modified accordingly. State-of-the-art libraries for this problem are basedon graph repartitioning. They have a number of drawbacks, including the opti-mized metric and the difficulty of parallelizing the popular repartitioning heuris-tic Kernighan-Lin (KL).Here we further explore the very promising diffusion-based graph partitioningalgorithm DIBAP (Meyerhenke et al., JPDC 69(9):750–761, 2009) by adaptingDIBAP to the related problem of load balancing. Experiments with graph se-quences that imitate adaptive numerical simulations demonstrate the applicabilityand high quality of DIBAP for load balancing by repartitioning. Compared to thefaster state-of-the-art repartitioners PARMETIS and parallel JOSTLE, DIBAP’ssolutions have partitions with significantly fewer external edges and boundarynodes and the resulting average migration volume in the important maximumnorm is also the best in most cases.We also prove that one of DIBAP’s key components optimizes a relaxed versionof the minimum edge cut problem. Moreover, we hint at a distributed algorithmbased on ideas used in DIBAP for clustering a virtual P2P supercomputer.}}, author = {{Gehweiler, Joachim and Meyerhenke, Henning}}, booktitle = {{Dagstuhl Seminar Proceedings 10261: Algorithm Engineering}}, title = {{{On Dynamic Graph Partitioning and Graph Clustering using Diffusion}}}, year = {{2010}}, } @techreport{19018, author = {{Thies, Michael and Gehweiler, Joachim}}, title = {{{Thread Migration and Checkpointing in Java}}}, year = {{2010}}, } @inproceedings{19023, author = {{Kernbach, Serge and Schmickl, Thomas and Hamann, Heiko and Stradner, Jürgen and Schlachter, Florian and Schwarzer, Christopher s. F. and Winfield, Alan F. T. and Matthias, Rene}}, booktitle = {{Artificial Life XII (ALife XII)}}, pages = {{781--788}}, publisher = {{MIT Press}}, title = {{{Adaptive Action Selection Mechanisms for Evolutionary Multimodular Robotics}}}, year = {{2010}}, } @inbook{19027, author = {{Seng, Eva- Maria}}, booktitle = {{Geschichte der Rekonstruktion. Konstruktion der Geschichte. Publikation und Ausstellungskatalog, Pinakothek der Moderne}}, editor = {{Nerdinger, Winfried}}, pages = {{78--95 und 224--232}}, title = {{{Rekonstruktionen von Kontinuität zwischen 1600 und 1800: Überbrückung der durch Politik, Religion und Krieg verursachten Zäsuren}}}, year = {{2010}}, } @inproceedings{19029, author = {{Briest, Patrick and Chalermsook, Parinya and Khanna, Sanjeev and Laekhanukit, Bundit and Nanongkai, Danupon}}, booktitle = {{Workshop on Internet and Network Economics (WINE)}}, isbn = {{9783642175718}}, issn = {{0302-9743}}, title = {{{Improved Hardness of Approximation for Stackelberg Shortest-Path Pricing}}}, doi = {{10.1007/978-3-642-17572-5_37}}, year = {{2010}}, }