@inproceedings{20934, author = {{von Detten, Markus and Meyer, Matthias and Travkin, Dietrich}}, booktitle = {{Proceedings of the 32nd ACM/IEEE International Conference on Software Engineering (ICSE 2010), Cape Town, South Africa, May 2-8, 2010}}, pages = {{299 -- 300}}, publisher = {{ACM Press}}, title = {{{Reverse Engineering with the Reclipse Tool Suite}}}, volume = {{2}}, year = {{2010}}, } @techreport{20935, abstract = {{Design pattern detection is a reverse engineering methodology that helps software engineers to analyze and understand legacy software by recovering design decisions and thereby providing deeper insight into software. In this report we present Reclipse, a reverse engineering tool suite based on Fujaba. Reclipse provides static and dynamic design pattern detection in combination with a pattern rating that is used to evaluate the quality of our detection results.}}, author = {{von Detten, Markus and Meyer, Matthias and Travkin, Dietrich}}, title = {{{Reclipse - A Reverse Engineering Tool Suite}}}, year = {{2010}}, } @inproceedings{20936, author = {{Löffler, Renate and Meyer, Matthias and Gottschalk, Matthias}}, booktitle = {{Proceedings of the 2010 ICSE Workshop on Software Engineering in Health Care}}, pages = {{57--67}}, publisher = {{ACM}}, title = {{{Formal Scenario-based Requirements Specification and Test Case Generation in Healthcare Applications}}}, year = {{2010}}, } @inbook{20961, abstract = {{Self-healing promises to improve the dependability of systems. In particular safety-critical systems like automotive systems are well suited application, since safe operation is required in these systems even in case of failures. Prerequisite for the improved dependability is the correct realization of the self-healing techniques. Consequently, self-healing activities should be rigorously specified and appropriately integrated with the rest of the system. In this paper, we present an approach for designing self-healing mechanisms in automotive systems. The approach contains a construction model which consist of a structural description as well as an extensive set of constraints. The constraints specify a correct system structure and are also used in the self-healing activities. We exemplify the self-healing approach using the adaptive cruise control system of modern cars. }}, author = {{Seebach, Hella and Nafz, Florian and Holtmann, Jörg and Meyer, Jan and Tichy, Matthias and Reif, Wolfgang and Schäfer, Wilhelm}}, booktitle = {{Lecture Notes in Computer Science}}, isbn = {{9783642165757}}, issn = {{0302-9743}}, title = {{{Designing Self-healing in Automotive Systems}}}, doi = {{10.1007/978-3-642-16576-4_4}}, year = {{2010}}, } @article{20962, abstract = {{Im Bereich der eingebetteten Systeme, beispielsweise im Automobilsektor, wird heutzutage immer mehr auf eine modellbasierte Entwicklung gesetzt. Die Anforderungen an die zu entwickelnden Systeme werden dagegen aus juristischen Gründen und zwecks einer guten Verständlichkeit nach wie vor rein textuell formuliert. Ein Prosatext lässt sich allerdings wegen der Fülle von Formulierungsmöglichkeiten nicht automatisiert verarbeiten. Dies führt dazu, dass die Qualitätsanalyse der Anforderungen und der Übergang von textuellen Anforderungen zu Systemmodellen auf manuelle Weise erfolgen müssen. Dies kostet Zeit und ist fehleranfällig. In diesem Beitrag wird ein Ansatz vorgestellt, mit dem Anforderungen auf Basis von Satzmustern weiterhin textuell, aber gleichzeitig auch automatisiert verarbeitbar formuliert werden können.}}, author = {{Holtmann, Jörg}}, journal = {{OBJEKTspektrum}}, number = {{RE/2010}}, title = {{{Mit Satzmustern von textuellen Anforderungen zu Modellen}}}, year = {{2010}}, } @inproceedings{20963, abstract = {{Heutige Transportsysteme, wie z.B. Automobile sind gekennzeichnet durch eine Vielzahl von Funktionalitaet, die sehr haeufig durch Software realisiert wird. Hiermit ist eine Zunahme der Komplexitaet festzustellen. Zur Beherrschung dieser Komplexitaet und damit einhergehend die Aufteilung des Systems in verschiedene Komponenten, ist eine Gesamtmodellierung des Systems inklusive des Verhaltens unerlaesslich. Ein besonderer Augenmerk liegt auf Grund der Echtzeitsysteme in dieser Domaene dabei auf der Modellierung von Zeiten auf Systemebene. Die derzeitigen Modellierungskonzepte, wie beispielsweise die Systems Modeling Language (SysML), sind dafuer aber noch nicht ausreichend. In dem hier vorgestellten Ansatz wird eine erweiterte Systemmodellierung vorgestellt, die zusaetzlich eine formale Spezifizierung von Zeiten erlaubt. Durch diese Modellierung sind weitere Analysemethoden, wie z.B. Simulationen oder Verifikationen moeglich, die zum einen die sicherheitsrelevante Funktionalitaet sicherstellen und zum anderen die Qualitaet der Software steigern.}}, author = {{Meyer, Jan and Holtmann, Jörg and Schäfer, Wilhelm and Nickel, Ulrich A.}}, booktitle = {{Software Engineering 2010 – Workshopband (inkl. Doktorandensymposium)}}, publisher = {{Bonner Koellen Verlag}}, title = {{{Eine erweiterte Systemmodellierung zur Entwicklung von softwareintensiven Anwendungen in der Automobilindustrie}}}, volume = {{P-160}}, 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{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}}, } @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}}, } @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}}, }