---
_id: '19967'
author:
- first_name: Mostafa
  full_name: Wahby, Mostafa
  last_name: Wahby
- first_name: Mohammad
  full_name: Divband Soorati, Mohammad
  last_name: Divband Soorati
- first_name: Sebastian
  full_name: von Mammen, Sebastian
  last_name: von Mammen
- first_name: Heiko
  full_name: Hamann, Heiko
  last_name: Hamann
citation:
  ama: 'Wahby M, Divband Soorati M, von Mammen S, Hamann H. Evolution of Controllers
    for Robot-Plant Bio-Hybdrids: A Simple Case Study Using a Model of Plant Growth
    and Motion. In: <i>Proceedings. 25. Computational Intelligence Workshop</i>. ;
    2015.'
  apa: 'Wahby, M., Divband Soorati, M., von Mammen, S., &#38; Hamann, H. (2015). Evolution
    of Controllers for Robot-Plant Bio-Hybdrids: A Simple Case Study Using a Model
    of Plant Growth and Motion. In <i>Proceedings. 25. Computational Intelligence
    Workshop</i>.'
  bibtex: '@inproceedings{Wahby_Divband Soorati_von Mammen_Hamann_2015, title={Evolution
    of Controllers for Robot-Plant Bio-Hybdrids: A Simple Case Study Using a Model
    of Plant Growth and Motion}, booktitle={Proceedings. 25. Computational Intelligence
    Workshop}, author={Wahby, Mostafa and Divband Soorati, Mohammad and von Mammen,
    Sebastian and Hamann, Heiko}, year={2015} }'
  chicago: 'Wahby, Mostafa, Mohammad Divband Soorati, Sebastian von Mammen, and Heiko
    Hamann. “Evolution of Controllers for Robot-Plant Bio-Hybdrids: A Simple Case
    Study Using a Model of Plant Growth and Motion.” In <i>Proceedings. 25. Computational
    Intelligence Workshop</i>, 2015.'
  ieee: 'M. Wahby, M. Divband Soorati, S. von Mammen, and H. Hamann, “Evolution of
    Controllers for Robot-Plant Bio-Hybdrids: A Simple Case Study Using a Model of
    Plant Growth and Motion,” in <i>Proceedings. 25. Computational Intelligence Workshop</i>,
    2015.'
  mla: 'Wahby, Mostafa, et al. “Evolution of Controllers for Robot-Plant Bio-Hybdrids:
    A Simple Case Study Using a Model of Plant Growth and Motion.” <i>Proceedings.
    25. Computational Intelligence Workshop</i>, 2015.'
  short: 'M. Wahby, M. Divband Soorati, S. von Mammen, H. Hamann, in: Proceedings.
    25. Computational Intelligence Workshop, 2015.'
date_created: 2020-10-09T13:50:38Z
date_updated: 2022-01-06T06:54:17Z
department:
- _id: '63'
- _id: '238'
language:
- iso: eng
publication: Proceedings. 25. Computational Intelligence Workshop
status: public
title: 'Evolution of Controllers for Robot-Plant Bio-Hybdrids: A Simple Case Study
  Using a Model of Plant Growth and Motion'
type: conference
user_id: '15415'
year: '2015'
...
---
_id: '19980'
abstract:
- lang: eng
  text: Fitness function design is known to be a critical feature of the evolutionary-robotics
    approach. Potentially, the complexity of evolving a successful controller for
    a given task can be reduced by integrating a priori knowledge into the fitness
    function which complicates the comparability of studies in evolutionary robotics.
    Still, there are only few publications that study the actual effects of different
    fitness functions on the robot's performance. In this paper, we follow the fitness
    function classification of Nelson et al. (2009) and investigate a selection of
    four classes of fitness functions that require different degrees of a priori knowledge.
    The robot controllers are evolved in simulation using NEAT and we investigate
    different tasks including obstacle avoidance and (periodic) goal homing. The best
    evolved controllers were then post-evaluated by examining their potential for
    adaptation, determining their convergence rates, and using cross-comparisons based
    on the different fitness function classes. The results confirm that the integration
    of more a priori knowledge can simplify a task and show that more attention should
    be paid to fitness function classes when comparing different studies.
author:
- first_name: Heiko
  full_name: Hamann, Heiko
  last_name: Hamann
- first_name: Mohammad
  full_name: Divband Soorati, Mohammad
  last_name: Divband Soorati
citation:
  ama: 'Hamann H, Divband Soorati M. The Effect of Fitness Function Design on Performance
    in Evolutionary Robotics: The Influence of a Priori Knowledge. In: <i>Proceedings
    of the Genetic and Evolutionary Computation Conference (GECCO 2015)</i>. ACM;
    2015:153-160. doi:<a href="https://doi.org/10.1145/2739480.2754676">10.1145/2739480.2754676</a>'
  apa: 'Hamann, H., &#38; Divband Soorati, M. (2015). The Effect of Fitness Function
    Design on Performance in Evolutionary Robotics: The Influence of a Priori Knowledge.
    In <i>Proceedings of the Genetic and Evolutionary Computation Conference (GECCO
    2015)</i> (pp. 153–160). ACM. <a href="https://doi.org/10.1145/2739480.2754676">https://doi.org/10.1145/2739480.2754676</a>'
  bibtex: '@inproceedings{Hamann_Divband Soorati_2015, title={The Effect of Fitness
    Function Design on Performance in Evolutionary Robotics: The Influence of a Priori
    Knowledge}, DOI={<a href="https://doi.org/10.1145/2739480.2754676">10.1145/2739480.2754676</a>},
    booktitle={Proceedings of the Genetic and Evolutionary Computation Conference
    (GECCO 2015)}, publisher={ACM}, author={Hamann, Heiko and Divband Soorati, Mohammad},
    year={2015}, pages={153–160} }'
  chicago: 'Hamann, Heiko, and Mohammad Divband Soorati. “The Effect of Fitness Function
    Design on Performance in Evolutionary Robotics: The Influence of a Priori Knowledge.”
    In <i>Proceedings of the Genetic and Evolutionary Computation Conference (GECCO
    2015)</i>, 153–60. ACM, 2015. <a href="https://doi.org/10.1145/2739480.2754676">https://doi.org/10.1145/2739480.2754676</a>.'
  ieee: 'H. Hamann and M. Divband Soorati, “The Effect of Fitness Function Design
    on Performance in Evolutionary Robotics: The Influence of a Priori Knowledge,”
    in <i>Proceedings of the Genetic and Evolutionary Computation Conference (GECCO
    2015)</i>, 2015, pp. 153–160.'
  mla: 'Hamann, Heiko, and Mohammad Divband Soorati. “The Effect of Fitness Function
    Design on Performance in Evolutionary Robotics: The Influence of a Priori Knowledge.”
    <i>Proceedings of the Genetic and Evolutionary Computation Conference (GECCO 2015)</i>,
    ACM, 2015, pp. 153–60, doi:<a href="https://doi.org/10.1145/2739480.2754676">10.1145/2739480.2754676</a>.'
  short: 'H. Hamann, M. Divband Soorati, in: Proceedings of the Genetic and Evolutionary
    Computation Conference (GECCO 2015), ACM, 2015, pp. 153–160.'
date_created: 2020-10-12T13:12:25Z
date_updated: 2022-01-06T06:54:17Z
department:
- _id: '63'
- _id: '238'
doi: 10.1145/2739480.2754676
language:
- iso: eng
page: 153-160
publication: Proceedings of the Genetic and Evolutionary Computation Conference (GECCO
  2015)
publisher: ACM
status: public
title: 'The Effect of Fitness Function Design on Performance in Evolutionary Robotics:
  The Influence of a Priori Knowledge'
type: conference
user_id: '15415'
year: '2015'
...
---
_id: '19988'
author:
- first_name: Heiko
  full_name: Hamann, Heiko
  last_name: Hamann
- first_name: Thomas
  full_name: Schmickl, Thomas
  last_name: Schmickl
- first_name: Payam
  full_name: Zahadat, Payam
  last_name: Zahadat
citation:
  ama: 'Hamann H, Schmickl T, Zahadat P. Evolving Collective Behaviors With Diverse
    But Predictable Sensor States. In: <i>13th European Conference on Artificial Life
    (ECAL 2015)</i>. MIT Press; 2015:174. doi:<a href="https://doi.org/10.7551/978-0-262-33027-5-ch036">10.7551/978-0-262-33027-5-ch036</a>'
  apa: Hamann, H., Schmickl, T., &#38; Zahadat, P. (2015). Evolving Collective Behaviors
    With Diverse But Predictable Sensor States. In <i>13th European Conference on
    Artificial Life (ECAL 2015)</i> (p. 174). MIT Press. <a href="https://doi.org/10.7551/978-0-262-33027-5-ch036">https://doi.org/10.7551/978-0-262-33027-5-ch036</a>
  bibtex: '@inproceedings{Hamann_Schmickl_Zahadat_2015, title={Evolving Collective
    Behaviors With Diverse But Predictable Sensor States}, DOI={<a href="https://doi.org/10.7551/978-0-262-33027-5-ch036">10.7551/978-0-262-33027-5-ch036</a>},
    booktitle={13th European Conference on Artificial Life (ECAL 2015)}, publisher={MIT
    Press}, author={Hamann, Heiko and Schmickl, Thomas and Zahadat, Payam}, year={2015},
    pages={174} }'
  chicago: Hamann, Heiko, Thomas Schmickl, and Payam Zahadat. “Evolving Collective
    Behaviors With Diverse But Predictable Sensor States.” In <i>13th European Conference
    on Artificial Life (ECAL 2015)</i>, 174. MIT Press, 2015. <a href="https://doi.org/10.7551/978-0-262-33027-5-ch036">https://doi.org/10.7551/978-0-262-33027-5-ch036</a>.
  ieee: H. Hamann, T. Schmickl, and P. Zahadat, “Evolving Collective Behaviors With
    Diverse But Predictable Sensor States,” in <i>13th European Conference on Artificial
    Life (ECAL 2015)</i>, 2015, p. 174.
  mla: Hamann, Heiko, et al. “Evolving Collective Behaviors With Diverse But Predictable
    Sensor States.” <i>13th European Conference on Artificial Life (ECAL 2015)</i>,
    MIT Press, 2015, p. 174, doi:<a href="https://doi.org/10.7551/978-0-262-33027-5-ch036">10.7551/978-0-262-33027-5-ch036</a>.
  short: 'H. Hamann, T. Schmickl, P. Zahadat, in: 13th European Conference on Artificial
    Life (ECAL 2015), MIT Press, 2015, p. 174.'
date_created: 2020-10-13T08:50:38Z
date_updated: 2022-01-06T06:54:17Z
department:
- _id: '63'
- _id: '238'
doi: 10.7551/978-0-262-33027-5-ch036
language:
- iso: eng
page: '174'
publication: 13th European Conference on Artificial Life (ECAL 2015)
publisher: MIT Press
status: public
title: Evolving Collective Behaviors With Diverse But Predictable Sensor States
type: conference
user_id: '15415'
year: '2015'
...
---
_id: '19989'
author:
- first_name: Heiko
  full_name: Hamann, Heiko
  last_name: Hamann
- first_name: Nikolaus
  full_name: Correll, Nikolaus
  last_name: Correll
- first_name: Janusz
  full_name: Kacprzyk, Janusz
  last_name: Kacprzyk
- first_name: Witold
  full_name: Pedrycz, Witold
  last_name: Pedrycz
citation:
  ama: 'Hamann H, Correll N, Kacprzyk J, Pedrycz W. Probabilistic Modeling of Swarming
    Systems. In: <i>Springer Handbook of Computational Intelligence</i>. Springer;
    2015:1423-1431. doi:<a href="https://doi.org/10.1007/978-3-662-43505-2_74">10.1007/978-3-662-43505-2_74</a>'
  apa: Hamann, H., Correll, N., Kacprzyk, J., &#38; Pedrycz, W. (2015). Probabilistic
    Modeling of Swarming Systems. In <i>Springer Handbook of Computational Intelligence</i>
    (pp. 1423–1431). Springer. <a href="https://doi.org/10.1007/978-3-662-43505-2_74">https://doi.org/10.1007/978-3-662-43505-2_74</a>
  bibtex: '@inbook{Hamann_Correll_Kacprzyk_Pedrycz_2015, title={Probabilistic Modeling
    of Swarming Systems}, DOI={<a href="https://doi.org/10.1007/978-3-662-43505-2_74">10.1007/978-3-662-43505-2_74</a>},
    booktitle={Springer Handbook of Computational Intelligence}, publisher={Springer},
    author={Hamann, Heiko and Correll, Nikolaus and Kacprzyk, Janusz and Pedrycz,
    Witold}, year={2015}, pages={1423–1431} }'
  chicago: Hamann, Heiko, Nikolaus Correll, Janusz Kacprzyk, and Witold Pedrycz. “Probabilistic
    Modeling of Swarming Systems.” In <i>Springer Handbook of Computational Intelligence</i>,
    1423–31. Springer, 2015. <a href="https://doi.org/10.1007/978-3-662-43505-2_74">https://doi.org/10.1007/978-3-662-43505-2_74</a>.
  ieee: H. Hamann, N. Correll, J. Kacprzyk, and W. Pedrycz, “Probabilistic Modeling
    of Swarming Systems,” in <i>Springer Handbook of Computational Intelligence</i>,
    Springer, 2015, pp. 1423–1431.
  mla: Hamann, Heiko, et al. “Probabilistic Modeling of Swarming Systems.” <i>Springer
    Handbook of Computational Intelligence</i>, Springer, 2015, pp. 1423–31, doi:<a
    href="https://doi.org/10.1007/978-3-662-43505-2_74">10.1007/978-3-662-43505-2_74</a>.
  short: 'H. Hamann, N. Correll, J. Kacprzyk, W. Pedrycz, in: Springer Handbook of
    Computational Intelligence, Springer, 2015, pp. 1423–1431.'
date_created: 2020-10-13T09:04:19Z
date_updated: 2022-01-06T06:54:17Z
department:
- _id: '63'
- _id: '238'
doi: 10.1007/978-3-662-43505-2_74
language:
- iso: eng
page: 1423-1431
publication: Springer Handbook of Computational Intelligence
publisher: Springer
status: public
title: Probabilistic Modeling of Swarming Systems
type: book_chapter
user_id: '15415'
year: '2015'
...
---
_id: '19990'
author:
- first_name: Hongli
  full_name: Ding, Hongli
  last_name: Ding
- first_name: Heiko
  full_name: Hamann, Heiko
  last_name: Hamann
citation:
  ama: 'Ding H, Hamann H. Dependability in Swarm Robotics: Error Detection and Correction.
    In: <i>First International Symposium on Swarm Behavior and Bio-Inspired Robotics
    (SWARM 2015)</i>. ; 2015.'
  apa: 'Ding, H., &#38; Hamann, H. (2015). Dependability in Swarm Robotics: Error
    Detection and Correction. In <i>First International Symposium on Swarm Behavior
    and Bio-Inspired Robotics (SWARM 2015)</i>.'
  bibtex: '@inproceedings{Ding_Hamann_2015, title={Dependability in Swarm Robotics:
    Error Detection and Correction}, booktitle={First International Symposium on Swarm
    Behavior and Bio-Inspired Robotics (SWARM 2015)}, author={Ding, Hongli and Hamann,
    Heiko}, year={2015} }'
  chicago: 'Ding, Hongli, and Heiko Hamann. “Dependability in Swarm Robotics: Error
    Detection and Correction.” In <i>First International Symposium on Swarm Behavior
    and Bio-Inspired Robotics (SWARM 2015)</i>, 2015.'
  ieee: 'H. Ding and H. Hamann, “Dependability in Swarm Robotics: Error Detection
    and Correction,” in <i>First International Symposium on Swarm Behavior and Bio-Inspired
    Robotics (SWARM 2015)</i>, 2015.'
  mla: 'Ding, Hongli, and Heiko Hamann. “Dependability in Swarm Robotics: Error Detection
    and Correction.” <i>First International Symposium on Swarm Behavior and Bio-Inspired
    Robotics (SWARM 2015)</i>, 2015.'
  short: 'H. Ding, H. Hamann, in: First International Symposium on Swarm Behavior
    and Bio-Inspired Robotics (SWARM 2015), 2015.'
date_created: 2020-10-13T09:09:20Z
date_updated: 2022-01-06T06:54:17Z
department:
- _id: '63'
- _id: '238'
language:
- iso: eng
publication: First International Symposium on Swarm Behavior and Bio-Inspired Robotics
  (SWARM 2015)
status: public
title: 'Dependability in Swarm Robotics: Error Detection and Correction'
type: conference
user_id: '15415'
year: '2015'
...
---
_id: '19991'
author:
- first_name: Heiko
  full_name: Hamann, Heiko
  last_name: Hamann
- first_name: Thomas
  full_name: Schmickl, Thomas
  last_name: Schmickl
- first_name: Daniela
  full_name: Kengyel, Daniela
  last_name: Kengyel
- first_name: Payam
  full_name: Zahadat, Payam
  last_name: Zahadat
- first_name: Gerald
  full_name: Radspieler, Gerald
  last_name: Radspieler
- first_name: Franz
  full_name: Wotawa, Franz
  last_name: Wotawa
citation:
  ama: 'Hamann H, Schmickl T, Kengyel D, Zahadat P, Radspieler G, Wotawa F. Potential
    of Heterogeneity in Collective Behaviors: A Case Study on Heterogeneous Swarms.
    In: <i>Principles and Practice of Multi-Agent Systems (PRIMA 2015)</i>. ; 2015:201-217.'
  apa: 'Hamann, H., Schmickl, T., Kengyel, D., Zahadat, P., Radspieler, G., &#38;
    Wotawa, F. (2015). Potential of Heterogeneity in Collective Behaviors: A Case
    Study on Heterogeneous Swarms. In <i>Principles and Practice of Multi-Agent Systems
    (PRIMA 2015)</i> (pp. 201–217).'
  bibtex: '@inproceedings{Hamann_Schmickl_Kengyel_Zahadat_Radspieler_Wotawa_2015,
    title={Potential of Heterogeneity in Collective Behaviors: A Case Study on Heterogeneous
    Swarms}, booktitle={Principles and Practice of Multi-Agent Systems (PRIMA 2015)},
    author={Hamann, Heiko and Schmickl, Thomas and Kengyel, Daniela and Zahadat, Payam
    and Radspieler, Gerald and Wotawa, Franz}, year={2015}, pages={201–217} }'
  chicago: 'Hamann, Heiko, Thomas Schmickl, Daniela Kengyel, Payam Zahadat, Gerald
    Radspieler, and Franz Wotawa. “Potential of Heterogeneity in Collective Behaviors:
    A Case Study on Heterogeneous Swarms.” In <i>Principles and Practice of Multi-Agent
    Systems (PRIMA 2015)</i>, 201–17, 2015.'
  ieee: 'H. Hamann, T. Schmickl, D. Kengyel, P. Zahadat, G. Radspieler, and F. Wotawa,
    “Potential of Heterogeneity in Collective Behaviors: A Case Study on Heterogeneous
    Swarms,” in <i>Principles and Practice of Multi-Agent Systems (PRIMA 2015)</i>,
    2015, pp. 201–217.'
  mla: 'Hamann, Heiko, et al. “Potential of Heterogeneity in Collective Behaviors:
    A Case Study on Heterogeneous Swarms.” <i>Principles and Practice of Multi-Agent
    Systems (PRIMA 2015)</i>, 2015, pp. 201–17.'
  short: 'H. Hamann, T. Schmickl, D. Kengyel, P. Zahadat, G. Radspieler, F. Wotawa,
    in: Principles and Practice of Multi-Agent Systems (PRIMA 2015), 2015, pp. 201–217.'
date_created: 2020-10-13T09:24:32Z
date_updated: 2022-01-06T06:54:17Z
department:
- _id: '63'
- _id: '238'
language:
- iso: eng
page: 201-217
publication: Principles and Practice of Multi-Agent Systems (PRIMA 2015)
status: public
title: 'Potential of Heterogeneity in Collective Behaviors: A Case Study on Heterogeneous
  Swarms'
type: conference
user_id: '15415'
year: '2015'
...
---
_id: '19992'
author:
- first_name: Gabriele
  full_name: Valentini, Gabriele
  last_name: Valentini
- first_name: Heiko
  full_name: Hamann, Heiko
  last_name: Hamann
citation:
  ama: 'Valentini G, Hamann H. Time-variant feedback processes in collective decision-making
    systems: influence and effect of dynamic neighborhood sizes. <i>Swarm Intelligence</i>.
    2015:153-176. doi:<a href="https://doi.org/10.1007/s11721-015-0108-8">10.1007/s11721-015-0108-8</a>'
  apa: 'Valentini, G., &#38; Hamann, H. (2015). Time-variant feedback processes in
    collective decision-making systems: influence and effect of dynamic neighborhood
    sizes. <i>Swarm Intelligence</i>, 153–176. <a href="https://doi.org/10.1007/s11721-015-0108-8">https://doi.org/10.1007/s11721-015-0108-8</a>'
  bibtex: '@article{Valentini_Hamann_2015, title={Time-variant feedback processes
    in collective decision-making systems: influence and effect of dynamic neighborhood
    sizes}, DOI={<a href="https://doi.org/10.1007/s11721-015-0108-8">10.1007/s11721-015-0108-8</a>},
    journal={Swarm Intelligence}, author={Valentini, Gabriele and Hamann, Heiko},
    year={2015}, pages={153–176} }'
  chicago: 'Valentini, Gabriele, and Heiko Hamann. “Time-Variant Feedback Processes
    in Collective Decision-Making Systems: Influence and Effect of Dynamic Neighborhood
    Sizes.” <i>Swarm Intelligence</i>, 2015, 153–76. <a href="https://doi.org/10.1007/s11721-015-0108-8">https://doi.org/10.1007/s11721-015-0108-8</a>.'
  ieee: 'G. Valentini and H. Hamann, “Time-variant feedback processes in collective
    decision-making systems: influence and effect of dynamic neighborhood sizes,”
    <i>Swarm Intelligence</i>, pp. 153–176, 2015.'
  mla: 'Valentini, Gabriele, and Heiko Hamann. “Time-Variant Feedback Processes in
    Collective Decision-Making Systems: Influence and Effect of Dynamic Neighborhood
    Sizes.” <i>Swarm Intelligence</i>, 2015, pp. 153–76, doi:<a href="https://doi.org/10.1007/s11721-015-0108-8">10.1007/s11721-015-0108-8</a>.'
  short: G. Valentini, H. Hamann, Swarm Intelligence (2015) 153–176.
date_created: 2020-10-13T09:27:48Z
date_updated: 2022-01-06T06:54:17Z
department:
- _id: '63'
- _id: '238'
doi: 10.1007/s11721-015-0108-8
language:
- iso: eng
page: 153-176
publication: Swarm Intelligence
publication_identifier:
  issn:
  - 1935-3812
  - 1935-3820
publication_status: published
status: public
title: 'Time-variant feedback processes in collective decision-making systems: influence
  and effect of dynamic neighborhood sizes'
type: journal_article
user_id: '15415'
year: '2015'
...
---
_id: '20005'
author:
- first_name: Marco
  full_name: Dorigo, Marco
  last_name: Dorigo
- first_name: Heiko
  full_name: Hamann, Heiko
  last_name: Hamann
- first_name: Gabriele
  full_name: Valentini, Gabriele
  last_name: Valentini
citation:
  ama: 'Dorigo M, Hamann H, Valentini G. Efficient Decision-Making in a Self-Organizing
    Robot Swarm: On the Speed Versus Accuracy Trade-Off. In: <i>Proceedings of the
    14th Int. Conf. on Autonomous Agents and Multiagent Systems (AAMAS 2015)</i>.
    ; 2015.'
  apa: 'Dorigo, M., Hamann, H., &#38; Valentini, G. (2015). Efficient Decision-Making
    in a Self-Organizing Robot Swarm: On the Speed Versus Accuracy Trade-Off. In <i>Proceedings
    of the 14th Int. Conf. on Autonomous Agents and Multiagent Systems (AAMAS 2015)</i>.'
  bibtex: '@inproceedings{Dorigo_Hamann_Valentini_2015, title={Efficient Decision-Making
    in a Self-Organizing Robot Swarm: On the Speed Versus Accuracy Trade-Off}, booktitle={Proceedings
    of the 14th Int. Conf. on Autonomous Agents and Multiagent Systems (AAMAS 2015)},
    author={Dorigo, Marco and Hamann, Heiko and Valentini, Gabriele}, year={2015}
    }'
  chicago: 'Dorigo, Marco, Heiko Hamann, and Gabriele Valentini. “Efficient Decision-Making
    in a Self-Organizing Robot Swarm: On the Speed Versus Accuracy Trade-Off.” In
    <i>Proceedings of the 14th Int. Conf. on Autonomous Agents and Multiagent Systems
    (AAMAS 2015)</i>, 2015.'
  ieee: 'M. Dorigo, H. Hamann, and G. Valentini, “Efficient Decision-Making in a Self-Organizing
    Robot Swarm: On the Speed Versus Accuracy Trade-Off,” in <i>Proceedings of the
    14th Int. Conf. on Autonomous Agents and Multiagent Systems (AAMAS 2015)</i>,
    2015.'
  mla: 'Dorigo, Marco, et al. “Efficient Decision-Making in a Self-Organizing Robot
    Swarm: On the Speed Versus Accuracy Trade-Off.” <i>Proceedings of the 14th Int.
    Conf. on Autonomous Agents and Multiagent Systems (AAMAS 2015)</i>, 2015.'
  short: 'M. Dorigo, H. Hamann, G. Valentini, in: Proceedings of the 14th Int. Conf.
    on Autonomous Agents and Multiagent Systems (AAMAS 2015), 2015.'
date_created: 2020-10-15T12:29:26Z
date_updated: 2022-01-06T06:54:18Z
department:
- _id: '63'
- _id: '238'
language:
- iso: eng
publication: Proceedings of the 14th Int. Conf. on Autonomous Agents and Multiagent
  Systems (AAMAS 2015)
status: public
title: 'Efficient Decision-Making in a Self-Organizing Robot Swarm: On the Speed Versus
  Accuracy Trade-Off'
type: conference
user_id: '15415'
year: '2015'
...
---
_id: '20006'
author:
- first_name: Marco
  full_name: Dorigo, Marco
  last_name: Dorigo
- first_name: Heiko
  full_name: Hamann, Heiko
  last_name: Hamann
- first_name: Gabriele
  full_name: Valentini, Gabriele
  last_name: Valentini
citation:
  ama: 'Dorigo M, Hamann H, Valentini G. Self-organized collective decisions in a
    robot swarm. In: <i>AAAI-15 Video Proceedings</i>. ; 2015.'
  apa: Dorigo, M., Hamann, H., &#38; Valentini, G. (2015). Self-organized collective
    decisions in a robot swarm. In <i>AAAI-15 Video Proceedings</i>.
  bibtex: '@inproceedings{Dorigo_Hamann_Valentini_2015, title={Self-organized collective
    decisions in a robot swarm}, booktitle={AAAI-15 Video Proceedings}, author={Dorigo,
    Marco and Hamann, Heiko and Valentini, Gabriele}, year={2015} }'
  chicago: Dorigo, Marco, Heiko Hamann, and Gabriele Valentini. “Self-Organized Collective
    Decisions in a Robot Swarm.” In <i>AAAI-15 Video Proceedings</i>, 2015.
  ieee: M. Dorigo, H. Hamann, and G. Valentini, “Self-organized collective decisions
    in a robot swarm,” in <i>AAAI-15 Video Proceedings</i>, 2015.
  mla: Dorigo, Marco, et al. “Self-Organized Collective Decisions in a Robot Swarm.”
    <i>AAAI-15 Video Proceedings</i>, 2015.
  short: 'M. Dorigo, H. Hamann, G. Valentini, in: AAAI-15 Video Proceedings, 2015.'
date_created: 2020-10-15T12:38:13Z
date_updated: 2022-01-06T06:54:18Z
department:
- _id: '63'
- _id: '238'
language:
- iso: eng
publication: AAAI-15 Video Proceedings
status: public
title: Self-organized collective decisions in a robot swarm
type: conference
user_id: '15415'
year: '2015'
...
---
_id: '280'
abstract:
- lang: eng
  text: The Collaborative Research Centre "On-The-Fly Computing" works on foundations
    and principles for the vision of the Future Internet. It proposes the paradigm
    of On-The-Fly Computing, which tackles emerging worldwide service markets. In
    these markets, service providers trade software, platform, and infrastructure
    as a service. Service requesters state requirements on services. To satisfy these
    requirements, the new role of brokers, who are (human) actors building service
    compositions on the fly, is introduced. Brokers have to specify service compositions
    formally and comprehensively using a domain-specific language (DSL), and to use
    service matching for the discovery of the constituent services available in the
    market. The broker's choice of the DSL and matching approaches influences her
    success of building compositions as distinctive properties of different service
    markets play a significant role. In this paper, we propose a new approach of engineering
    a situation-specific DSL by customizing a comprehensive, modular DSL and its matching
    for given service market properties. This enables the broker to create market-specific
    composition specifications and to perform market-specific service matching. As
    a result, the broker builds service compositions satisfying the requester's requirements
    more accurately. We evaluated the presented concepts using case studies in service
    markets for tourism and university management.
author:
- first_name: Svetlana
  full_name: Arifulina, Svetlana
  last_name: Arifulina
- first_name: Marie Christin
  full_name: Platenius, Marie Christin
  last_name: Platenius
- first_name: Felix
  full_name: Mohr, Felix
  last_name: Mohr
- first_name: Gregor
  full_name: Engels, Gregor
  id: '107'
  last_name: Engels
- first_name: Wilhelm
  full_name: Schäfer, Wilhelm
  last_name: Schäfer
citation:
  ama: 'Arifulina S, Platenius MC, Mohr F, Engels G, Schäfer W. Market-Specific Service
    Compositions: Specification and Matching. In: <i>Proceedings of the IEEE 11th
    World Congress on Services (SERVICES), Visionary Track: Service Composition for
    the Future Internet</i>. ; 2015:333--340. doi:<a href="https://doi.org/10.1109/SERVICES.2015.58">10.1109/SERVICES.2015.58</a>'
  apa: 'Arifulina, S., Platenius, M. C., Mohr, F., Engels, G., &#38; Schäfer, W. (2015).
    Market-Specific Service Compositions: Specification and Matching. In <i>Proceedings
    of the IEEE 11th World Congress on Services (SERVICES), Visionary Track: Service
    Composition for the Future Internet</i> (pp. 333--340). <a href="https://doi.org/10.1109/SERVICES.2015.58">https://doi.org/10.1109/SERVICES.2015.58</a>'
  bibtex: '@inproceedings{Arifulina_Platenius_Mohr_Engels_Schäfer_2015, title={Market-Specific
    Service Compositions: Specification and Matching}, DOI={<a href="https://doi.org/10.1109/SERVICES.2015.58">10.1109/SERVICES.2015.58</a>},
    booktitle={Proceedings of the IEEE 11th World Congress on Services (SERVICES),
    Visionary Track: Service Composition for the Future Internet}, author={Arifulina,
    Svetlana and Platenius, Marie Christin and Mohr, Felix and Engels, Gregor and
    Schäfer, Wilhelm}, year={2015}, pages={333--340} }'
  chicago: 'Arifulina, Svetlana, Marie Christin Platenius, Felix Mohr, Gregor Engels,
    and Wilhelm Schäfer. “Market-Specific Service Compositions: Specification and
    Matching.” In <i>Proceedings of the IEEE 11th World Congress on Services (SERVICES),
    Visionary Track: Service Composition for the Future Internet</i>, 333--340, 2015.
    <a href="https://doi.org/10.1109/SERVICES.2015.58">https://doi.org/10.1109/SERVICES.2015.58</a>.'
  ieee: 'S. Arifulina, M. C. Platenius, F. Mohr, G. Engels, and W. Schäfer, “Market-Specific
    Service Compositions: Specification and Matching,” in <i>Proceedings of the IEEE
    11th World Congress on Services (SERVICES), Visionary Track: Service Composition
    for the Future Internet</i>, 2015, pp. 333--340.'
  mla: 'Arifulina, Svetlana, et al. “Market-Specific Service Compositions: Specification
    and Matching.” <i>Proceedings of the IEEE 11th World Congress on Services (SERVICES),
    Visionary Track: Service Composition for the Future Internet</i>, 2015, pp. 333--340,
    doi:<a href="https://doi.org/10.1109/SERVICES.2015.58">10.1109/SERVICES.2015.58</a>.'
  short: 'S. Arifulina, M.C. Platenius, F. Mohr, G. Engels, W. Schäfer, in: Proceedings
    of the IEEE 11th World Congress on Services (SERVICES), Visionary Track: Service
    Composition for the Future Internet, 2015, pp. 333--340.'
date_created: 2017-10-17T12:41:46Z
date_updated: 2022-01-06T06:57:49Z
ddc:
- '040'
department:
- _id: '66'
- _id: '76'
- _id: '355'
doi: 10.1109/SERVICES.2015.58
file:
- access_level: closed
  content_type: application/pdf
  creator: florida
  date_created: 2018-03-21T09:26:04Z
  date_updated: 2018-03-21T09:26:04Z
  file_id: '1470'
  file_name: 280-07196546.pdf
  file_size: 234260
  relation: main_file
  success: 1
file_date_updated: 2018-03-21T09:26:04Z
has_accepted_license: '1'
language:
- iso: eng
page: 333--340
project:
- _id: '1'
  name: SFB 901
- _id: '9'
  name: SFB 901 - Subprojekt B1
- _id: '10'
  name: SFB 901 - Subproject B2
- _id: '3'
  name: SFB 901 - Project Area B
publication: 'Proceedings of the IEEE 11th World Congress on Services (SERVICES),
  Visionary Track: Service Composition for the Future Internet'
status: public
title: 'Market-Specific Service Compositions: Specification and Matching'
type: conference
user_id: '477'
year: '2015'
...
---
_id: '283'
abstract:
- lang: eng
  text: Today, software verification is an established analysis method which can provide
    high guarantees for software safety. However, the resources (time and/or memory)
    for an exhaustive verification are not always available, and analysis then has
    to resort to other techniques, like testing. Most often, the already achieved
    partial verification results arediscarded in this case, and testing has to start
    from scratch.In this paper, we propose a method for combining verification and
    testing in which testing only needs to check the residual fraction of an uncompleted
    verification. To this end, the partial results of a verification run are used
    to construct a residual program (and residual assertions to be checked on it).
    The residual program can afterwards be fed into standardtesting tools. The proposed
    technique is sound modulo the soundness of the testing procedure. Experimental
    results show that this combinedusage of verification and testing can significantly
    reduce the effort for the subsequent testing.
author:
- first_name: Mike
  full_name: Czech, Mike
  last_name: Czech
- first_name: Marie-Christine
  full_name: Jakobs, Marie-Christine
  last_name: Jakobs
- first_name: Heike
  full_name: Wehrheim, Heike
  id: '573'
  last_name: Wehrheim
citation:
  ama: 'Czech M, Jakobs M-C, Wehrheim H. Just test what you cannot verify! In: Egyed
    A, Schaefer I, eds. <i>Fundamental Approaches to Software Engineering</i>. Lecture
    Notes in Computer Science. ; 2015:100-114. doi:<a href="https://doi.org/10.1007/978-3-662-46675-9_7">10.1007/978-3-662-46675-9_7</a>'
  apa: Czech, M., Jakobs, M.-C., &#38; Wehrheim, H. (2015). Just test what you cannot
    verify! In A. Egyed &#38; I. Schaefer (Eds.), <i>Fundamental Approaches to Software
    Engineering</i> (pp. 100–114). <a href="https://doi.org/10.1007/978-3-662-46675-9_7">https://doi.org/10.1007/978-3-662-46675-9_7</a>
  bibtex: '@inproceedings{Czech_Jakobs_Wehrheim_2015, series={Lecture Notes in Computer
    Science}, title={Just test what you cannot verify!}, DOI={<a href="https://doi.org/10.1007/978-3-662-46675-9_7">10.1007/978-3-662-46675-9_7</a>},
    booktitle={Fundamental Approaches to Software Engineering}, author={Czech, Mike
    and Jakobs, Marie-Christine and Wehrheim, Heike}, editor={Egyed, Alexander and
    Schaefer, InaEditors}, year={2015}, pages={100–114}, collection={Lecture Notes
    in Computer Science} }'
  chicago: Czech, Mike, Marie-Christine Jakobs, and Heike Wehrheim. “Just Test What
    You Cannot Verify!” In <i>Fundamental Approaches to Software Engineering</i>,
    edited by Alexander Egyed and Ina Schaefer, 100–114. Lecture Notes in Computer
    Science, 2015. <a href="https://doi.org/10.1007/978-3-662-46675-9_7">https://doi.org/10.1007/978-3-662-46675-9_7</a>.
  ieee: M. Czech, M.-C. Jakobs, and H. Wehrheim, “Just test what you cannot verify!,”
    in <i>Fundamental Approaches to Software Engineering</i>, 2015, pp. 100–114.
  mla: Czech, Mike, et al. “Just Test What You Cannot Verify!” <i>Fundamental Approaches
    to Software Engineering</i>, edited by Alexander Egyed and Ina Schaefer, 2015,
    pp. 100–14, doi:<a href="https://doi.org/10.1007/978-3-662-46675-9_7">10.1007/978-3-662-46675-9_7</a>.
  short: 'M. Czech, M.-C. Jakobs, H. Wehrheim, in: A. Egyed, I. Schaefer (Eds.), Fundamental
    Approaches to Software Engineering, 2015, pp. 100–114.'
date_created: 2017-10-17T12:41:47Z
date_updated: 2022-01-06T06:58:00Z
ddc:
- '040'
department:
- _id: '77'
doi: 10.1007/978-3-662-46675-9_7
editor:
- first_name: Alexander
  full_name: Egyed, Alexander
  last_name: Egyed
- first_name: Ina
  full_name: Schaefer, Ina
  last_name: Schaefer
file:
- access_level: closed
  content_type: application/pdf
  creator: florida
  date_created: 2018-03-21T09:25:36Z
  date_updated: 2018-03-21T09:25:36Z
  file_id: '1469'
  file_name: 283-FASEsubmission38_01.pdf
  file_size: 391253
  relation: main_file
  success: 1
file_date_updated: 2018-03-21T09:25:36Z
has_accepted_license: '1'
language:
- iso: eng
page: 100-114
project:
- _id: '1'
  name: SFB 901
- _id: '12'
  name: SFB 901 - Subprojekt B4
- _id: '3'
  name: SFB 901 - Project Area B
publication: Fundamental Approaches to Software Engineering
series_title: Lecture Notes in Computer Science
status: public
title: Just test what you cannot verify!
type: conference
user_id: '477'
year: '2015'
...
---
_id: '284'
abstract:
- lang: eng
  text: In this work, we present the first scalable distributed information system,
    that is, a system with low storage overhead, that is provably robust against denial-of-service
    (DoS) attacks by a current insider. We allow a current insider to have complete
    knowledge about the information system and to have the power to block any ϵ-fraction
    of its servers by a DoS attack, where ϵ can be chosen up to a constant. The task
    of the system is to serve any collection of lookup requests with at most one per
    nonblocked server in an efficient way despite this attack. Previously, scalable
    solutions were only known for DoS attacks of past insiders, where a past insider
    only has complete knowledge about some past time point t0 of the information system.
    Scheideler et al. [Awerbuch and Scheideler 2007; Baumgart et al. 2009] showed
    that in this case, it is possible to design an information system so that any
    information that was inserted or last updated after t0 is safe against a DoS attack.
    But their constructions would not work at all for a current insider. The key idea
    behind our IRIS system is to make extensive use of coding. More precisely, we
    present two alternative distributed coding strategies with an at most logarithmic
    storage overhead that can handle up to a constant fraction of blocked servers.
author:
- first_name: Martina
  full_name: Eikel, Martina
  last_name: Eikel
- first_name: Christian
  full_name: Scheideler, Christian
  id: '20792'
  last_name: Scheideler
citation:
  ama: 'Eikel M, Scheideler C. IRIS: A Robust Information System Against Insider DoS
    Attacks. <i>Transactions on Parallel Computing</i>. 2015;(3):18:1--18:33. doi:<a
    href="https://doi.org/10.1145/2809806">10.1145/2809806</a>'
  apa: 'Eikel, M., &#38; Scheideler, C. (2015). IRIS: A Robust Information System
    Against Insider DoS Attacks. <i>Transactions on Parallel Computing</i>, (3), 18:1--18:33.
    <a href="https://doi.org/10.1145/2809806">https://doi.org/10.1145/2809806</a>'
  bibtex: '@article{Eikel_Scheideler_2015, title={IRIS: A Robust Information System
    Against Insider DoS Attacks}, DOI={<a href="https://doi.org/10.1145/2809806">10.1145/2809806</a>},
    number={3}, journal={Transactions on Parallel Computing}, publisher={ACM}, author={Eikel,
    Martina and Scheideler, Christian}, year={2015}, pages={18:1--18:33} }'
  chicago: 'Eikel, Martina, and Christian Scheideler. “IRIS: A Robust Information
    System Against Insider DoS Attacks.” <i>Transactions on Parallel Computing</i>,
    no. 3 (2015): 18:1--18:33. <a href="https://doi.org/10.1145/2809806">https://doi.org/10.1145/2809806</a>.'
  ieee: 'M. Eikel and C. Scheideler, “IRIS: A Robust Information System Against Insider
    DoS Attacks,” <i>Transactions on Parallel Computing</i>, no. 3, pp. 18:1--18:33,
    2015.'
  mla: 'Eikel, Martina, and Christian Scheideler. “IRIS: A Robust Information System
    Against Insider DoS Attacks.” <i>Transactions on Parallel Computing</i>, no. 3,
    ACM, 2015, pp. 18:1--18:33, doi:<a href="https://doi.org/10.1145/2809806">10.1145/2809806</a>.'
  short: M. Eikel, C. Scheideler, Transactions on Parallel Computing (2015) 18:1--18:33.
date_created: 2017-10-17T12:41:47Z
date_updated: 2022-01-06T06:58:03Z
ddc:
- '040'
department:
- _id: '79'
doi: 10.1145/2809806
file:
- access_level: closed
  content_type: application/pdf
  creator: florida
  date_created: 2018-03-21T09:25:04Z
  date_updated: 2018-03-21T09:25:04Z
  file_id: '1468'
  file_name: 284-Eikel-Scheideler-ACM2015.pdf
  file_size: 651726
  relation: main_file
  success: 1
file_date_updated: 2018-03-21T09:25:04Z
has_accepted_license: '1'
issue: '3'
page: 18:1--18:33
project:
- _id: '1'
  name: SFB 901
- _id: '13'
  name: SFB 901 - Subprojekt C1
- _id: '4'
  name: SFB 901 - Project Area C
publication: Transactions on Parallel Computing
publisher: ACM
status: public
title: 'IRIS: A Robust Information System Against Insider DoS Attacks'
type: journal_article
user_id: '477'
year: '2015'
...
---
_id: '285'
abstract:
- lang: eng
  text: We propose an incremental workflow for the verification of parameterized systems
    modeled as symmetric networks of timed automata. Starting with a small number
    of timed automata in the network, a safety property is verified using IC3, a state-of-the-art
    algorithm based on induction.The result of the verification, an inductive strengthening,
    is reused proposing a candidate inductive strengthening for a larger network.If
    the candidate is valid, our main theorem states that the safety property holds
    for all sizes of the network of timed automata. Otherwise the number of automata
    is increased and the next iteration is started with a new run of IC3.We propose
    and thoroughly examine optimizations to our workflow, e.g. Feedback mechanisms
    to speed up the run of IC3.
author:
- first_name: Tobias
  full_name: Isenberg, Tobias
  last_name: Isenberg
citation:
  ama: 'Isenberg T. Incremental Inductive Verification of Parameterized Timed Systems.
    In: <i>Proceedings of the 15th International Conference on Application of Concurrency
    to System Design (ACSD)</i>. ; 2015:1-9. doi:<a href="https://doi.org/10.1109/ACSD.2015.13">10.1109/ACSD.2015.13</a>'
  apa: Isenberg, T. (2015). Incremental Inductive Verification of Parameterized Timed
    Systems. In <i>Proceedings of the 15th International Conference on Application
    of Concurrency to System Design (ACSD)</i> (pp. 1–9). <a href="https://doi.org/10.1109/ACSD.2015.13">https://doi.org/10.1109/ACSD.2015.13</a>
  bibtex: '@inproceedings{Isenberg_2015, title={Incremental Inductive Verification
    of Parameterized Timed Systems}, DOI={<a href="https://doi.org/10.1109/ACSD.2015.13">10.1109/ACSD.2015.13</a>},
    booktitle={Proceedings of the 15th International Conference on Application of
    Concurrency to System Design (ACSD)}, author={Isenberg, Tobias}, year={2015},
    pages={1–9} }'
  chicago: Isenberg, Tobias. “Incremental Inductive Verification of Parameterized
    Timed Systems.” In <i>Proceedings of the 15th International Conference on Application
    of Concurrency to System Design (ACSD)</i>, 1–9, 2015. <a href="https://doi.org/10.1109/ACSD.2015.13">https://doi.org/10.1109/ACSD.2015.13</a>.
  ieee: T. Isenberg, “Incremental Inductive Verification of Parameterized Timed Systems,”
    in <i>Proceedings of the 15th International Conference on Application of Concurrency
    to System Design (ACSD)</i>, 2015, pp. 1–9.
  mla: Isenberg, Tobias. “Incremental Inductive Verification of Parameterized Timed
    Systems.” <i>Proceedings of the 15th International Conference on Application of
    Concurrency to System Design (ACSD)</i>, 2015, pp. 1–9, doi:<a href="https://doi.org/10.1109/ACSD.2015.13">10.1109/ACSD.2015.13</a>.
  short: 'T. Isenberg, in: Proceedings of the 15th International Conference on Application
    of Concurrency to System Design (ACSD), 2015, pp. 1–9.'
date_created: 2017-10-17T12:41:47Z
date_updated: 2022-01-06T06:58:07Z
ddc:
- '040'
department:
- _id: '77'
doi: 10.1109/ACSD.2015.13
file:
- access_level: closed
  content_type: application/pdf
  creator: florida
  date_created: 2018-03-21T09:23:45Z
  date_updated: 2018-03-21T09:23:45Z
  file_id: '1466'
  file_name: 285-07352419.pdf
  file_size: 479808
  relation: main_file
  success: 1
file_date_updated: 2018-03-21T09:23:45Z
has_accepted_license: '1'
language:
- iso: eng
page: '1-9 '
project:
- _id: '1'
  name: SFB 901
- _id: '12'
  name: SFB 901 - Subprojekt B4
- _id: '3'
  name: SFB 901 - Project Area B
publication: Proceedings of the 15th International Conference on Application of Concurrency
  to System Design (ACSD)
status: public
title: Incremental Inductive Verification of Parameterized Timed Systems
type: conference
user_id: '477'
year: '2015'
...
---
_id: '286'
author:
- first_name: Benedikt
  full_name: Kalde, Benedikt
  last_name: Kalde
citation:
  ama: Kalde B. <i>Implementierung eines hybriden Verschlüsselungsverfahrens nach
    Cramer und Shoup</i>. Universität Paderborn; 2015.
  apa: Kalde, B. (2015). <i>Implementierung eines hybriden Verschlüsselungsverfahrens
    nach Cramer und Shoup</i>. Universität Paderborn.
  bibtex: '@book{Kalde_2015, title={Implementierung eines hybriden Verschlüsselungsverfahrens
    nach Cramer und Shoup}, publisher={Universität Paderborn}, author={Kalde, Benedikt},
    year={2015} }'
  chicago: Kalde, Benedikt. <i>Implementierung eines hybriden Verschlüsselungsverfahrens
    nach Cramer und Shoup</i>. Universität Paderborn, 2015.
  ieee: B. Kalde, <i>Implementierung eines hybriden Verschlüsselungsverfahrens nach
    Cramer und Shoup</i>. Universität Paderborn, 2015.
  mla: Kalde, Benedikt. <i>Implementierung eines hybriden Verschlüsselungsverfahrens
    nach Cramer und Shoup</i>. Universität Paderborn, 2015.
  short: B. Kalde, Implementierung eines hybriden Verschlüsselungsverfahrens nach
    Cramer und Shoup, Universität Paderborn, 2015.
date_created: 2017-10-17T12:41:47Z
date_updated: 2022-01-06T06:58:10Z
department:
- _id: '64'
language:
- iso: ger
project:
- _id: '1'
  name: SFB 901
- _id: '13'
  name: SFB 901 - Subprojekt C1
- _id: '4'
  name: SFB 901 - Project Area C
publisher: Universität Paderborn
status: public
supervisor:
- first_name: Johannes
  full_name: Blömer, Johannes
  id: '23'
  last_name: Blömer
title: Implementierung eines hybriden Verschlüsselungsverfahrens nach Cramer und Shoup
type: bachelorsthesis
user_id: '477'
year: '2015'
...
---
_id: '2865'
author:
- first_name: Daniela
  full_name: Strotmann, Daniela
  last_name: Strotmann
citation:
  ama: Strotmann D. <i>Singulärwertzerlegung Für μ-Ähnliche Bregman-Divergenzen</i>.;
    2015.
  apa: Strotmann, D. (2015). <i>Singulärwertzerlegung für μ-ähnliche Bregman-Divergenzen</i>.
  bibtex: '@book{Strotmann_2015, title={Singulärwertzerlegung für μ-ähnliche Bregman-Divergenzen},
    author={Strotmann, Daniela}, year={2015} }'
  chicago: Strotmann, Daniela. <i>Singulärwertzerlegung Für μ-Ähnliche Bregman-Divergenzen</i>,
    2015.
  ieee: D. Strotmann, <i>Singulärwertzerlegung für μ-ähnliche Bregman-Divergenzen</i>.
    2015.
  mla: Strotmann, Daniela. <i>Singulärwertzerlegung Für μ-Ähnliche Bregman-Divergenzen</i>.
    2015.
  short: D. Strotmann, Singulärwertzerlegung Für μ-Ähnliche Bregman-Divergenzen, 2015.
date_created: 2018-05-24T13:05:41Z
date_updated: 2022-01-06T06:58:12Z
department:
- _id: '64'
status: public
supervisor:
- first_name: Johannes
  full_name: Blömer, Johannes
  id: '23'
  last_name: Blömer
title: Singulärwertzerlegung für μ-ähnliche Bregman-Divergenzen
type: bachelorsthesis
user_id: '25078'
year: '2015'
...
---
_id: '287'
abstract:
- lang: eng
  text: The size of modern data centers is constantly increasing. As it is not economic
    to interconnect all machines in the data center using a full-bisection-bandwidth
    network, techniques have to be developed to increase the efficiency of data-center
    networks. The Software-Defined Network paradigm opened the door for centralized
    traffic engineering (TE) in such environments. Up to now, there were already a
    number of TE proposals for SDN-controlled data centers that all work very well.
    However, these techniques either use a high amount of flow table entries or a
    high flow installation rate that overwhelms available switching hardware, or they
    require custom or very expensive end-of-line equipment to be usable in practice.
    We present HybridTE, a TE technique that uses (uncertain) information about large
    flows. Using this extra information, our technique has very low hardware requirements
    while maintaining better performance than existing TE techniques. This enables
    us to build very low-cost, high performance data-center networks.
author:
- first_name: Philip
  full_name: Wette, Philip
  last_name: Wette
- first_name: Holger
  full_name: Karl, Holger
  id: '126'
  last_name: Karl
citation:
  ama: 'Wette P, Karl H. HybridTE: Traffic Engineering for Very Low-Cost Software-Defined
    Data-Center Networks. In: <i>Proceedings of the 4th European Workshop on Software
    Defined Networks (EWSDN 2015)</i>. ; 2015:1--7. doi:<a href="https://doi.org/10.1109/EWSDN.2015.57">10.1109/EWSDN.2015.57</a>'
  apa: 'Wette, P., &#38; Karl, H. (2015). HybridTE: Traffic Engineering for Very Low-Cost
    Software-Defined Data-Center Networks. In <i>Proceedings of the 4th European Workshop
    on Software Defined Networks (EWSDN 2015)</i> (pp. 1--7). <a href="https://doi.org/10.1109/EWSDN.2015.57">https://doi.org/10.1109/EWSDN.2015.57</a>'
  bibtex: '@inproceedings{Wette_Karl_2015, title={HybridTE: Traffic Engineering for
    Very Low-Cost Software-Defined Data-Center Networks}, DOI={<a href="https://doi.org/10.1109/EWSDN.2015.57">10.1109/EWSDN.2015.57</a>},
    booktitle={Proceedings of the 4th European Workshop on Software Defined Networks
    (EWSDN 2015)}, author={Wette, Philip and Karl, Holger}, year={2015}, pages={1--7}
    }'
  chicago: 'Wette, Philip, and Holger Karl. “HybridTE: Traffic Engineering for Very
    Low-Cost Software-Defined Data-Center Networks.” In <i>Proceedings of the 4th
    European Workshop on Software Defined Networks (EWSDN 2015)</i>, 1--7, 2015. <a
    href="https://doi.org/10.1109/EWSDN.2015.57">https://doi.org/10.1109/EWSDN.2015.57</a>.'
  ieee: 'P. Wette and H. Karl, “HybridTE: Traffic Engineering for Very Low-Cost Software-Defined
    Data-Center Networks,” in <i>Proceedings of the 4th European Workshop on Software
    Defined Networks (EWSDN 2015)</i>, 2015, pp. 1--7.'
  mla: 'Wette, Philip, and Holger Karl. “HybridTE: Traffic Engineering for Very Low-Cost
    Software-Defined Data-Center Networks.” <i>Proceedings of the 4th European Workshop
    on Software Defined Networks (EWSDN 2015)</i>, 2015, pp. 1--7, doi:<a href="https://doi.org/10.1109/EWSDN.2015.57">10.1109/EWSDN.2015.57</a>.'
  short: 'P. Wette, H. Karl, in: Proceedings of the 4th European Workshop on Software
    Defined Networks (EWSDN 2015), 2015, pp. 1--7.'
date_created: 2017-10-17T12:41:48Z
date_updated: 2022-01-06T06:58:17Z
ddc:
- '040'
department:
- _id: '75'
doi: 10.1109/EWSDN.2015.57
file:
- access_level: closed
  content_type: application/pdf
  creator: florida
  date_created: 2018-03-08T09:55:30Z
  date_updated: 2018-03-08T09:59:05Z
  file_id: '1203'
  file_name: 287-1503.04317v1.pdf
  file_size: 1625732
  relation: main_file
file_date_updated: 2018-03-08T09:59:05Z
has_accepted_license: '1'
page: 1--7
project:
- _id: '1'
  name: SFB 901
- _id: '6'
  name: SFB 901 - Subprojekt A2
- _id: '2'
  name: SFB 901 - Project Area A
publication: Proceedings of the 4th European Workshop on Software Defined Networks
  (EWSDN 2015)
quality_controlled: '1'
status: public
title: 'HybridTE: Traffic Engineering for Very Low-Cost Software-Defined Data-Center
  Networks'
type: conference
urn: '2875'
user_id: '15572'
year: '2015'
...
---
_id: '241'
abstract:
- lang: eng
  text: Distributed applications are commonly based on overlay networks interconnecting
    their sites so that they can exchange information. For these overlay networks
    to preserve their functionality, they should be able to recover from various problems
    like membership changes or faults. Various self-stabilizing overlay networks have
    already been proposed in recent years, which have the advantage of being able
    to recover from any illegal state, but none of these networks can give any guarantees
    on its functionality while the recovery process is going on. We initiate research
    on overlay networks that are not only self-stabilizing but that also ensure that
    searchability is maintained while the recovery process is going on, as long as
    there are no corrupted messages in the system. More precisely, once a search message
    from node u to another node v is successfully delivered, all future search messages
    from u to v succeed as well. We call this property monotonic searchability. We
    show that in general it is impossible to provide monotonic searchability if corrupted
    messages are present in the system, which justifies the restriction to system
    states without corrupted messages. Furthermore, we provide a self-stabilizing
    protocol for the line for which we can also show monotonic searchability. It turns
    out that even for the line it is non-trivial to achieve this property. Additionally,
    we extend our protocol to deal with node departures in terms of the Finite Departure
    Problem of Foreback et. al (SSS 2014). This makes our protocol even capable of
    handling node dynamics.
author:
- first_name: Christian
  full_name: Scheideler, Christian
  id: '20792'
  last_name: Scheideler
- first_name: Alexander
  full_name: Setzer, Alexander
  id: '11108'
  last_name: Setzer
- first_name: Thim Frederik
  full_name: Strothmann, Thim Frederik
  id: '11319'
  last_name: Strothmann
citation:
  ama: 'Scheideler C, Setzer A, Strothmann TF. Towards Establishing Monotonic Searchability
    in Self-Stabilizing Data Structures. In: <i>Proceedings of the 19th International
    Conference on Principles of Distributed Systems (OPODIS)</i>. Leibniz International
    Proceedings in Informatics (LIPIcs). ; 2015. doi:<a href="https://doi.org/10.4230/LIPIcs.OPODIS.2015.24">10.4230/LIPIcs.OPODIS.2015.24</a>'
  apa: Scheideler, C., Setzer, A., &#38; Strothmann, T. F. (2015). Towards Establishing
    Monotonic Searchability in Self-Stabilizing Data Structures. In <i>Proceedings
    of the 19th International Conference on Principles of Distributed Systems (OPODIS)</i>.
    <a href="https://doi.org/10.4230/LIPIcs.OPODIS.2015.24">https://doi.org/10.4230/LIPIcs.OPODIS.2015.24</a>
  bibtex: '@inproceedings{Scheideler_Setzer_Strothmann_2015, series={Leibniz International
    Proceedings in Informatics (LIPIcs)}, title={Towards Establishing Monotonic Searchability
    in Self-Stabilizing Data Structures}, DOI={<a href="https://doi.org/10.4230/LIPIcs.OPODIS.2015.24">10.4230/LIPIcs.OPODIS.2015.24</a>},
    booktitle={Proceedings of the 19th International Conference on Principles of Distributed
    Systems (OPODIS)}, author={Scheideler, Christian and Setzer, Alexander and Strothmann,
    Thim Frederik}, year={2015}, collection={Leibniz International Proceedings in
    Informatics (LIPIcs)} }'
  chicago: Scheideler, Christian, Alexander Setzer, and Thim Frederik Strothmann.
    “Towards Establishing Monotonic Searchability in Self-Stabilizing Data Structures.”
    In <i>Proceedings of the 19th International Conference on Principles of Distributed
    Systems (OPODIS)</i>. Leibniz International Proceedings in Informatics (LIPIcs),
    2015. <a href="https://doi.org/10.4230/LIPIcs.OPODIS.2015.24">https://doi.org/10.4230/LIPIcs.OPODIS.2015.24</a>.
  ieee: C. Scheideler, A. Setzer, and T. F. Strothmann, “Towards Establishing Monotonic
    Searchability in Self-Stabilizing Data Structures,” in <i>Proceedings of the 19th
    International Conference on Principles of Distributed Systems (OPODIS)</i>, 2015.
  mla: Scheideler, Christian, et al. “Towards Establishing Monotonic Searchability
    in Self-Stabilizing Data Structures.” <i>Proceedings of the 19th International
    Conference on Principles of Distributed Systems (OPODIS)</i>, 2015, doi:<a href="https://doi.org/10.4230/LIPIcs.OPODIS.2015.24">10.4230/LIPIcs.OPODIS.2015.24</a>.
  short: 'C. Scheideler, A. Setzer, T.F. Strothmann, in: Proceedings of the 19th International
    Conference on Principles of Distributed Systems (OPODIS), 2015.'
date_created: 2017-10-17T12:41:39Z
date_updated: 2022-01-06T06:56:07Z
ddc:
- '040'
department:
- _id: '79'
doi: 10.4230/LIPIcs.OPODIS.2015.24
file:
- access_level: closed
  content_type: application/pdf
  creator: florida
  date_created: 2018-03-21T10:28:21Z
  date_updated: 2018-03-21T10:28:21Z
  file_id: '1497'
  file_name: 241-ScheidelerSetzerStrothmann2015.pdf
  file_size: 692363
  relation: main_file
  success: 1
file_date_updated: 2018-03-21T10:28:21Z
has_accepted_license: '1'
language:
- iso: eng
project:
- _id: '1'
  name: SFB 901
- _id: '5'
  name: SFB 901 - Subprojekt A1
- _id: '2'
  name: SFB 901 - Project Area A
publication: Proceedings of the 19th International Conference on Principles of Distributed
  Systems (OPODIS)
series_title: Leibniz International Proceedings in Informatics (LIPIcs)
status: public
title: Towards Establishing Monotonic Searchability in Self-Stabilizing Data Structures
type: conference
user_id: '477'
year: '2015'
...
---
_id: '242'
abstract:
- lang: eng
  text: 'A fundamental problem for overlay networks is to safely exclude leaving nodes,
    i.e., the nodes requesting to leave the overlay network are excluded from it without
    affecting its connectivity. There are a number of studies for safe node exclusion
    if the overlay is in a well-defined state, but almost no formal results are known
    for the case in which the overlay network is in an arbitrary initial state, i.e.,
    when looking for a self-stabilizing solution for excluding leaving nodes. We study
    this problem in two variants: the Finite Departure Problem (FDP) and the Finite
    Sleep Problem (FSP). In the FDP the leaving nodes have to irrevocably decide when
    it is safe to leave the network, whereas in the FSP, this leaving decision does
    not have to be final: the nodes may resume computation when woken up by an incoming
    message. We are the first to present a self-stabilizing protocol for the FDP and
    the FSP that can be combined with a large class of overlay maintenance protocols
    so that these are then guaranteed to safely exclude leaving nodes from the system
    from any initial state while operating as specified for the staying nodes. In
    order to formally define the properties these overlay maintenance protocols have
    to satisfy, we identify four basic primitives for manipulating edges in an overlay
    network that might be of independent interest.'
author:
- first_name: Andreas
  full_name: Koutsopoulos, Andreas
  last_name: Koutsopoulos
- first_name: Christian
  full_name: Scheideler, Christian
  id: '20792'
  last_name: Scheideler
- first_name: Thim Frederik
  full_name: Strothmann, Thim Frederik
  id: '11319'
  last_name: Strothmann
citation:
  ama: 'Koutsopoulos A, Scheideler C, Strothmann TF. Towards a Universal Approach
    for the Finite Departure Problem in Overlay Networks. In: <i>Proceedings of the
    17th International Symposium on Stabilization, Safety, and Security of Distributed
    Systems (SSS)</i>. Lecture Notes in Computer Science. ; 2015:201-216. doi:<a href="https://doi.org/10.1007/978-3-319-21741-3_14">10.1007/978-3-319-21741-3_14</a>'
  apa: Koutsopoulos, A., Scheideler, C., &#38; Strothmann, T. F. (2015). Towards a
    Universal Approach for the Finite Departure Problem in Overlay Networks. In <i>Proceedings
    of the 17th International Symposium on Stabilization, Safety, and Security of
    Distributed Systems (SSS)</i> (pp. 201–216). <a href="https://doi.org/10.1007/978-3-319-21741-3_14">https://doi.org/10.1007/978-3-319-21741-3_14</a>
  bibtex: '@inproceedings{Koutsopoulos_Scheideler_Strothmann_2015, series={Lecture
    Notes in Computer Science}, title={Towards a Universal Approach for the Finite
    Departure Problem in Overlay Networks}, DOI={<a href="https://doi.org/10.1007/978-3-319-21741-3_14">10.1007/978-3-319-21741-3_14</a>},
    booktitle={Proceedings of the 17th International Symposium on Stabilization, Safety,
    and Security of Distributed Systems (SSS)}, author={Koutsopoulos, Andreas and
    Scheideler, Christian and Strothmann, Thim Frederik}, year={2015}, pages={201–216},
    collection={Lecture Notes in Computer Science} }'
  chicago: Koutsopoulos, Andreas, Christian Scheideler, and Thim Frederik Strothmann.
    “Towards a Universal Approach for the Finite Departure Problem in Overlay Networks.”
    In <i>Proceedings of the 17th International Symposium on Stabilization, Safety,
    and Security of Distributed Systems (SSS)</i>, 201–16. Lecture Notes in Computer
    Science, 2015. <a href="https://doi.org/10.1007/978-3-319-21741-3_14">https://doi.org/10.1007/978-3-319-21741-3_14</a>.
  ieee: A. Koutsopoulos, C. Scheideler, and T. F. Strothmann, “Towards a Universal
    Approach for the Finite Departure Problem in Overlay Networks,” in <i>Proceedings
    of the 17th International Symposium on Stabilization, Safety, and Security of
    Distributed Systems (SSS)</i>, 2015, pp. 201–216.
  mla: Koutsopoulos, Andreas, et al. “Towards a Universal Approach for the Finite
    Departure Problem in Overlay Networks.” <i>Proceedings of the 17th International
    Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)</i>,
    2015, pp. 201–16, doi:<a href="https://doi.org/10.1007/978-3-319-21741-3_14">10.1007/978-3-319-21741-3_14</a>.
  short: 'A. Koutsopoulos, C. Scheideler, T.F. Strothmann, in: Proceedings of the
    17th International Symposium on Stabilization, Safety, and Security of Distributed
    Systems (SSS), 2015, pp. 201–216.'
date_created: 2017-10-17T12:41:39Z
date_updated: 2022-01-06T06:56:10Z
ddc:
- '040'
department:
- _id: '79'
doi: 10.1007/978-3-319-21741-3_14
file:
- access_level: closed
  content_type: application/pdf
  creator: florida
  date_created: 2018-03-21T09:59:32Z
  date_updated: 2018-03-21T09:59:32Z
  file_id: '1496'
  file_name: 242-KSS-SSS2015.pdf
  file_size: 532792
  relation: main_file
  success: 1
file_date_updated: 2018-03-21T09:59:32Z
has_accepted_license: '1'
language:
- iso: eng
page: 201-216
project:
- _id: '1'
  name: SFB 901
- _id: '5'
  name: SFB 901 - Subprojekt A1
- _id: '2'
  name: SFB 901 - Project Area A
publication: Proceedings of the 17th International Symposium on Stabilization, Safety,
  and Security of Distributed Systems (SSS)
series_title: Lecture Notes in Computer Science
status: public
title: Towards a Universal Approach for the Finite Departure Problem in Overlay Networks
type: conference
user_id: '477'
year: '2015'
...
---
_id: '243'
abstract:
- lang: eng
  text: This paper introduces the problem of communication pattern adaption for a
    distributed self-adjusting binary search tree. We propose a simple local algorithm,
    which is closely related to the nearly thirty-year-old idea of splay trees and
    evaluate its adaption performance in the distributed scenario if different communication
    patterns are provided.To do so, the process of self-adjustment is modeled similarly
    to a basic network creation game, in which the nodes want to communicate with
    only a certain subset of all nodes. We show that, in general, the game (i.e.,
    the process of local adjustments) does not converge, and convergence is related
    to certain structures of the communication interests, which we call conflicts.We
    classify conflicts and show that for two communication scenarios in which convergence
    is guaranteed, the self-adjusting tree performs well.Furthermore, we investigate
    the different classes of conflicts separately and show that, for a certain class
    of conflicts, the performance of the tree network is asymptotically as good as
    the performance for converging instances. However, for the other conflict classes,
    a distributed self-adjusting binary search tree adapts poorly.
author:
- first_name: Thim Frederik
  full_name: Strothmann, Thim Frederik
  id: '11319'
  last_name: Strothmann
citation:
  ama: 'Strothmann TF. The impact of communication patterns on distributed locally
    self-adjusting binary search trees. In: <i>Proceedings of the 9th International
    Workshop on Algorithms and Computation (WALCOM)</i>. LNCS. ; 2015:175--186. doi:<a
    href="https://doi.org/10.1007/978-3-319-15612-5_16">10.1007/978-3-319-15612-5_16</a>'
  apa: Strothmann, T. F. (2015). The impact of communication patterns on distributed
    locally self-adjusting binary search trees. In <i>Proceedings of the 9th International
    Workshop on Algorithms and Computation (WALCOM)</i> (pp. 175--186). <a href="https://doi.org/10.1007/978-3-319-15612-5_16">https://doi.org/10.1007/978-3-319-15612-5_16</a>
  bibtex: '@inproceedings{Strothmann_2015, series={LNCS}, title={The impact of communication
    patterns on distributed locally self-adjusting binary search trees}, DOI={<a href="https://doi.org/10.1007/978-3-319-15612-5_16">10.1007/978-3-319-15612-5_16</a>},
    booktitle={Proceedings of the 9th International Workshop on Algorithms and Computation
    (WALCOM)}, author={Strothmann, Thim Frederik}, year={2015}, pages={175--186},
    collection={LNCS} }'
  chicago: Strothmann, Thim Frederik. “The Impact of Communication Patterns on Distributed
    Locally Self-Adjusting Binary Search Trees.” In <i>Proceedings of the 9th International
    Workshop on Algorithms and Computation (WALCOM)</i>, 175--186. LNCS, 2015. <a
    href="https://doi.org/10.1007/978-3-319-15612-5_16">https://doi.org/10.1007/978-3-319-15612-5_16</a>.
  ieee: T. F. Strothmann, “The impact of communication patterns on distributed locally
    self-adjusting binary search trees,” in <i>Proceedings of the 9th International
    Workshop on Algorithms and Computation (WALCOM)</i>, 2015, pp. 175--186.
  mla: Strothmann, Thim Frederik. “The Impact of Communication Patterns on Distributed
    Locally Self-Adjusting Binary Search Trees.” <i>Proceedings of the 9th International
    Workshop on Algorithms and Computation (WALCOM)</i>, 2015, pp. 175--186, doi:<a
    href="https://doi.org/10.1007/978-3-319-15612-5_16">10.1007/978-3-319-15612-5_16</a>.
  short: 'T.F. Strothmann, in: Proceedings of the 9th International Workshop on Algorithms
    and Computation (WALCOM), 2015, pp. 175--186.'
date_created: 2017-10-17T12:41:39Z
date_updated: 2022-01-06T06:56:17Z
ddc:
- '040'
department:
- _id: '79'
doi: 10.1007/978-3-319-15612-5_16
file:
- access_level: closed
  content_type: application/pdf
  creator: florida
  date_created: 2018-03-21T09:59:00Z
  date_updated: 2018-03-21T09:59:00Z
  file_id: '1495'
  file_name: 243-Strothmann-Walcom2015.pdf
  file_size: 1003113
  relation: main_file
  success: 1
file_date_updated: 2018-03-21T09:59:00Z
has_accepted_license: '1'
language:
- iso: eng
page: 175--186
project:
- _id: '1'
  name: SFB 901
- _id: '5'
  name: SFB 901 - Subprojekt A1
- _id: '2'
  name: SFB 901 - Project Area A
publication: Proceedings of the 9th International Workshop on Algorithms and Computation
  (WALCOM)
series_title: LNCS
status: public
title: The impact of communication patterns on distributed locally self-adjusting
  binary search trees
type: conference
user_id: '477'
year: '2015'
...
---
_id: '246'
author:
- first_name: Galina
  full_name: Besova, Galina
  last_name: Besova
citation:
  ama: Besova G. <i>Systematic Development and Re-Use of Model Tranformations</i>.
    Universität Paderborn; 2015.
  apa: Besova, G. (2015). <i>Systematic Development and Re-Use of Model Tranformations</i>.
    Universität Paderborn.
  bibtex: '@book{Besova_2015, title={Systematic Development and Re-Use of Model Tranformations},
    publisher={Universität Paderborn}, author={Besova, Galina}, year={2015} }'
  chicago: Besova, Galina. <i>Systematic Development and Re-Use of Model Tranformations</i>.
    Universität Paderborn, 2015.
  ieee: G. Besova, <i>Systematic Development and Re-Use of Model Tranformations</i>.
    Universität Paderborn, 2015.
  mla: Besova, Galina. <i>Systematic Development and Re-Use of Model Tranformations</i>.
    Universität Paderborn, 2015.
  short: G. Besova, Systematic Development and Re-Use of Model Tranformations, Universität
    Paderborn, 2015.
date_created: 2017-10-17T12:41:40Z
date_updated: 2022-01-06T06:56:30Z
ddc:
- '040'
department:
- _id: '77'
file:
- access_level: closed
  content_type: application/pdf
  creator: florida
  date_created: 2018-03-21T09:47:14Z
  date_updated: 2018-03-21T09:47:14Z
  file_id: '1492'
  file_name: 246-Dissertation_-_Besova.pdf
  file_size: 10091866
  relation: main_file
  success: 1
file_date_updated: 2018-03-21T09:47:14Z
has_accepted_license: '1'
project:
- _id: '1'
  name: SFB 901
- _id: '11'
  name: SFB 901 - Subprojekt B3
- _id: '3'
  name: SFB 901 - Project Area B
publisher: Universität Paderborn
related_material:
  link:
  - relation: confirmation
    url: http://digital.ub.uni-paderborn.de/hsx/content/titleinfo/1705899
status: public
supervisor:
- first_name: Heike
  full_name: Wehrheim, Heike
  id: '573'
  last_name: Wehrheim
title: Systematic Development and Re-Use of Model Tranformations
type: dissertation
user_id: '477'
year: '2015'
...