@inproceedings{19988,
  author       = {{Hamann, Heiko and Schmickl, Thomas and Zahadat, Payam}},
  booktitle    = {{13th European Conference on Artificial Life (ECAL 2015)}},
  pages        = {{174}},
  publisher    = {{MIT Press}},
  title        = {{{Evolving Collective Behaviors With Diverse But Predictable Sensor States}}},
  doi          = {{10.7551/978-0-262-33027-5-ch036}},
  year         = {{2015}},
}

@misc{281,
  author       = {{Rojahn, Tobias}},
  publisher    = {{Universität Paderborn}},
  title        = {{{Load Balancing for Range Queries in a Dimension Invariant Peer-to-Peer Network}}},
  year         = {{2015}},
}

@misc{28223,
  author       = {{Gausemeier, Jürgen and Dumitrescu, Roman and Rammig, Franz-Josef and Schäfer, Wilhelm and Trächtler, Ansgar}},
  isbn         = {{978-3-942647-62-5}},
  publisher    = {{Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}},
  title        = {{{10. Paderborner Workshop Entwurf mechatronischer Systeme}}},
  volume       = {{343}},
  year         = {{2015}},
}

@article{28304,
  abstract     = {{In this sequel paper, the previously presented framework for the planning and optimisation of functionally graded components Biermann et al. (Production Engineering Research & Development 7(6):657–664, 2013) is applied within a case study. In addition to the application, the implementational infrastructure of the framework is provided and the preliminaries for applying the framework to the respective production system are presented. Hence, the practical realisation of the models and methods is documented. In the context of the case study, each step of the planning process is demonstrated in a visually assisted way. These visualisations are based on the specific steps of the wizard guiding the planner through the framework. As a central contribution, the specification of a non-trivial gradation and the planning of the corresponding process chain by means of the planning framework are demonstrated.}},
  author       = {{Biermann, Dirk and Gausemeier, Jürgen and Heim, Hans-Peter and Hess, Stefan and Petersen, Marcus and Ries, Angela and Wagner, T.}},
  journal      = {{Production Engineering Research & Development 9(3)}},
  pages        = {{405--416}},
  title        = {{{Planning and Optimisation of Manufacturing Process Chains for Functionally Graded Components – Part 2: Case Study on Self-reinforced Thermoplastic Composites}}},
  year         = {{2015}},
}

@inproceedings{28317,
  abstract     = {{his paper examines the system protection for cyber-physical systems (CPS). CPS are particularly characterized by their networking system components. This means they are able to adapt to the needs of their users and its environment. With this ability, CPS have new, specific requirements on the protection against anti-counterfeiting, know-how loss and manipulation. They increase the requirements on system protection because piracy attacks can be more diverse, for example because of an increasing number of interfaces or through the networking abilities. The new requirements were identified and in a next step matched with existing protective measures. Due to the found gap the development of new protection measures has to be forced to close this gap. Moreover a comparison of the effectiveness between selected measures was realized and the first results are presented in this paper.}},
  author       = {{Kliewe, Daniel and Kühn, Arno and Dumitrescu, Roman and Gausemeier, Jürgen}},
  booktitle    = {{International Science Index, Band 9-5}},
  pages        = {{3566--3573}},
  title        = {{{Challenges in Anti-Counterfeiting of Cyber-Physical Systems}}},
  year         = {{2015}},
}

@inproceedings{28321,
  abstract     = {{Der Lebenszyklus von Produktionssystemen besteht nach Wiendahl et al. aus den drei Phasen Planung und Realisierung, Betrieb und Redistribution (Wiendahl et al. in Anlaufrobuste Produktionssysteme. Werkstattstechnik (wt) online, Jahrg. 92, Ausgabe 11/12, 2002, S. 650-655). Jede Phase enthält vielfältige Aufgaben die maßgeblich vom Fach- und Erfahrungswissen der Mitarbeiter abhängen. In der ersten Phase werden unter anderem die Fertigungsprozesse und -ressourcen festgelegt. Hierfür bedarf es genauer Kenntnisse über die zu fertigenden Bauteile, benötigten Prozesse und geeigneten Ressourcen selbst sowie deren Abhängigkeiten untereinander. In der Betriebsphase des Produktionssystems muss auf Maschinenausfälle oder Eilaufträge mit Um- bzw. Neuplanungen von Ressourcen reagiert werden. Das benötigte Wissen im Lebenszyklus von Produktionssystemen verteilt sich in der Regel auf verschiedene Personen und eine Vielzahl unterschiedlicher Dokumente; teilweise ist es auch nur implizit vorhanden. Demzufolge liegt es verteilt und unstrukturiert vor und eignet sich nicht für eine bedarfsgerechte Bereitstellung. Darüber hinaus fehlt eine Semantik, die das vorhandene Wissen in Beziehung setzt und durch automatisierte Schlussfolgerungen ergänzt. Hierfür bieten wissensbasierte Systeme (WBS) auf Basis von Ontologien einen vielversprechenden Lösungsansatz. Diese bieten eine Semantik und Inferenz zur Wissensmodellierung und ermöglichen den effizienten Zugriff auf das benötigte Wissen. Dies verspricht eine große Zeitersparnis bei den Aufgaben im Lebenszyklus von Produktionssystemen, auch im Hinblick auf die immer kürzer werdenden Produktlebenszyklen. Der Beitrag beschreibt den Aufbau von drei Ontologien für das Wissensmanagement im Rahmen verschiedener Aufgaben. Ferner werden die Vorteile durch den Einsatz von Ontologien praxisorientiert anhand eines Produktionssystems für eine Taschenlampe dargestellt.}},
  author       = {{Petersen, Marcus and Rehage, Gerald and Gausemeier, Jürgen and Bauer, Frank}},
  booktitle    = {{Wissenschafts- und Industrieforum 2015 Intelligente Technische Systeme - 10. Paderborner Workshop Entwurf mechatronischer Systeme, Nr. 343}},
  editor       = {{Gausemeier, Jürgen and Dumitrescu, Roman and Rammig, Franz-Josef and Schäfer, Wilhelm and Trächtler, Ansgar}},
  isbn         = {{978-3-942647-62-5}},
  pages        = {{189--209}},
  publisher    = {{Verlagsschriftenreihe des Heinz Nixdorf Instituts}},
  title        = {{{Wissensaufbereitung und -bereitstellung durch Ontologien im Lebenszyklus von Produktionssystemen}}},
  year         = {{2015}},
}

@inbook{28360,
  abstract     = {{Dieser Beitrag untersucht den Einfluss der Aussprache auf die Selbstkonstruktion von Lernenden und deren Bereitschaft, sich auf die zu erlernende Sprache und Kultur einzulassen. Im Gegensatz zu traditionellen Forschungsansätzen wird die Aussprache dabei als subjektiv bedeutsame Dimension im Sprachlernprozess konzipiert, die die Wahrnehmungen der Lernenden gegenüber sich selbst, anderen Sprechenden und dem gesamten Lernkontext stark mitprägt. Die Untersuchungen basieren auf den Narrationen zweier kanadischer Germanistikstudierender, die zwei Semester an deutschen Universitäten verbrachten. Der Selbstfindungs- und Lernprozess beider Studierender im fremden Umfeld wird dabei wesentlich durch ihre Selbstwahrnehmungen gelenkt, welche wiederum stark um das Thema Aussprache kreisen. Obwohl sich beide Lernende sehr unterschiedlich als Sprechende des Deutschen konstruieren,
fixieren sie sich darauf, wie sie meinen zu klingen und folglich wahrgenommen zu werden. Dabei erweist sich vor allem das Konstrukt des Native Speaker als zentraler Vergleichspunkt, an dem sich die Lernenden messen und der somit als Basis für die Wertung des Auslandsaufenthalts und des eigenen Lernerfolgs dient. Durch die Analyse subjektiver Lernertheorien entwirft dieser Beitrag einen gänzlich neuen Rahmen für die Betrachtung von Aussprache im Sprachlernprozess, der über die rein phonetische Dimension hinausgeht und den Fokus auf die sozialpsychologischen Funktionen von Aussprache lenkt.}},
  author       = {{Müller, Mareike and Schmenk, Barbara}},
  booktitle    = {{Konzepte aus der Sprachlehrforschung – Impulse für die Praxis: Festschrift für Karin Kleppin}},
  editor       = {{Böcker , Jessica  and Stauch, Annette}},
  isbn         = {{ 9783631647189}},
  pages        = {{171--188}},
  publisher    = {{Peter Lang}},
  title        = {{{Der Klang meines Selbst: Aussprache und Selbstkonstruktion von Fremdsprachenlernenden}}},
  year         = {{2015}},
}

@inproceedings{287,
  abstract     = {{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       = {{Wette, Philip and Karl, Holger}},
  booktitle    = {{Proceedings of the 4th European Workshop on Software Defined Networks (EWSDN 2015)}},
  pages        = {{1----7}},
  title        = {{{HybridTE: Traffic Engineering for Very Low-Cost Software-Defined Data-Center Networks}}},
  doi          = {{10.1109/EWSDN.2015.57}},
  year         = {{2015}},
}

@inproceedings{241,
  abstract     = {{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       = {{Scheideler, Christian and Setzer, Alexander and Strothmann, Thim Frederik}},
  booktitle    = {{Proceedings of the 19th International Conference on Principles of Distributed Systems (OPODIS)}},
  title        = {{{Towards Establishing Monotonic Searchability in Self-Stabilizing Data Structures}}},
  doi          = {{10.4230/LIPIcs.OPODIS.2015.24}},
  year         = {{2015}},
}

@inproceedings{242,
  abstract     = {{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       = {{Koutsopoulos, Andreas and Scheideler, Christian and Strothmann, Thim Frederik}},
  booktitle    = {{Proceedings of the 17th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)}},
  pages        = {{201--216}},
  title        = {{{Towards a Universal Approach for the Finite Departure Problem in Overlay Networks}}},
  doi          = {{10.1007/978-3-319-21741-3_14}},
  year         = {{2015}},
}

@inproceedings{243,
  abstract     = {{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       = {{Strothmann, Thim Frederik}},
  booktitle    = {{Proceedings of the 9th International Workshop on Algorithms and Computation (WALCOM)}},
  pages        = {{175----186}},
  title        = {{{The impact of communication patterns on distributed locally self-adjusting binary search trees}}},
  doi          = {{10.1007/978-3-319-15612-5_16}},
  year         = {{2015}},
}

@inproceedings{247,
  abstract     = {{Multi-rooted trees are becoming the norm for modern data-center networks. In these networks, scalable flow routing is challenging owing to vast number of flows. Current approaches either employ a central controller that can have scalability issues or a scalable decentralized algorithm only considering local information. In this paper we present a new decentralized approach to least-congested path routing in software-defined data center networks that has neither of these issues: By duplicating the initial (or SYN) packet of a flow and estimating the data rate of multiple flows in parallel, we exploit TCP’s habit to fill buffers to find the least congested path. We show that our algorithm significantly improves flow completion time without the need for a central controller or specialized hardware.}},
  author       = {{Schwabe, Arne and Karl, Holger}},
  booktitle    = {{Proceedings of the 4th European Workshop on Software Defined Networks (EWSDN 2015)}},
  pages        = {{37--42}},
  title        = {{{SynRace: Decentralized Load-Adaptive Multi-path Routing without Collecting Statistics}}},
  doi          = {{10.1109/EWSDN.2015.58}},
  year         = {{2015}},
}

@phdthesis{264,
  author       = {{Wette, Philip}},
  publisher    = {{Universität Paderborn}},
  title        = {{{Optimizing Software-Defined Networks using Application-Layer Knowledge}}},
  year         = {{2015}},
}

@article{26429,
  author       = {{Tsatsaronis, George and Balikas, Georgios and Malakasiotis, Prodromos and Partalas, Ioannis and Zschunke, Matthias and R. Alvers, Michael and Weissenborn, Dirk and Krithara, Anastasia and Petridis, Sergios and Polychronopoulos, Dimitris and Almirantis, Yannis and Pavlopoulos, John and Baskiotis, Nicolas and Gallinari, Patrick and Artières, Thierry and Ngonga Ngomo, Axel-Cyrille and Heino, Norman and Gaussier, Éric and Barrio-Alvers, Liliana and Schroeder, Michael and Androutsopoulos, Ion and Paliouras, Georgios}},
  journal      = {{{BMC} Bioinform.}},
  pages        = {{138:1--138:28}},
  title        = {{{An overview of the BIOASQ large-scale biomedical semantic indexing and question answering competition}}},
  doi          = {{10.1186/s12859-015-0564-6}},
  volume       = {{16}},
  year         = {{2015}},
}

@inproceedings{26434,
  author       = {{Unger, Christina and Forascu, Corina and López, Vanessa and Ngonga Ngomo, Axel-Cyrille and Cabrio, Elena and Cimiano, Philipp and Walter, Sebastian}},
  booktitle    = {{Working Notes of {CLEF} 2015 - Conference and Labs of the Evaluation forum, Toulouse, France, September 8-11, 2015}},
  editor       = {{Cappellato, Linda and Ferro, Nicola and J. F. Jones, Gareth and SanJuan, Eric}},
  publisher    = {{CEUR-WS.org}},
  title        = {{{Question Answering over Linked Data (QALD-5)}}},
  volume       = {{1391}},
  year         = {{2015}},
}

@inproceedings{26447,
  author       = {{Saleem, Muhammad and Mehmood, Qaiser and Ngonga Ngomo, Axel-Cyrille}},
  booktitle    = {{The Semantic Web - {ISWC} 2015 - 14th International Semantic Web Conference, Bethlehem, PA, USA, October 11-15, 2015, Proceedings, Part {I}}},
  editor       = {{Arenas, Marcelo and Corcho, Óscar and Simperl, Elena and Strohmaier, Markus and d'Aquin, Mathieu and Srinivas, Kavitha and Groth, Paul and Dumontier, Michel and Heflin, Jeff and Thirunarayan, Krishnaprasad and Staab, Steffen}},
  pages        = {{52--69}},
  publisher    = {{Springer}},
  title        = {{{FEASIBLE: A Feature-Based SPARQL Benchmark Generation Framework}}},
  doi          = {{10.1007/978-3-319-25007-6\_4}},
  volume       = {{9366}},
  year         = {{2015}},
}

@inproceedings{26448,
  author       = {{Bühmann, Lorenz and Usbeck, Ricardo and Ngonga Ngomo, Axel-Cyrille}},
  booktitle    = {{The Semantic Web - {ISWC} 2015 - 14th International Semantic Web Conference, Bethlehem, PA, USA, October 11-15, 2015, Proceedings, Part {II}}},
  editor       = {{Arenas, Marcelo and Corcho, Óscar and Simperl, Elena and Strohmaier, Markus and d'Aquin, Mathieu and Srinivas, Kavitha and Groth, Paul and Dumontier, Michel and Heflin, Jeff and Thirunarayan, Krishnaprasad and Staab, Steffen}},
  pages        = {{76--89}},
  publisher    = {{Springer}},
  title        = {{{ASSESS - Automatic Self-Assessment Using Linked Data}}},
  doi          = {{10.1007/978-3-319-25010-6\_5}},
  volume       = {{9367}},
  year         = {{2015}},
}

@inproceedings{26451,
  author       = {{Saleem, Muhammad and Intizar Ali, Muhammad and Hogan, Aidan and Mehmood, Qaiser and Ngonga Ngomo, Axel-Cyrille}},
  booktitle    = {{The Semantic Web - {ISWC} 2015 - 14th International Semantic Web Conference, Bethlehem, PA, USA, October 11-15, 2015, Proceedings, Part {II}}},
  editor       = {{Arenas, Marcelo and Corcho, Óscar and Simperl, Elena and Strohmaier, Markus and d'Aquin, Mathieu and Srinivas, Kavitha and Groth, Paul and Dumontier, Michel and Heflin, Jeff and Thirunarayan, Krishnaprasad and Staab, Steffen}},
  pages        = {{261--269}},
  publisher    = {{Springer}},
  title        = {{{LSQ: The Linked SPARQL Queries Dataset}}},
  doi          = {{10.1007/978-3-319-25010-6\_15}},
  volume       = {{9367}},
  year         = {{2015}},
}

@inproceedings{26454,
  author       = {{Saveta, Tzanina and Daskalaki, Evangelia and Flouris, Giorgos and Fundulaki, Irini and Herschel, Melanie and Ngonga Ngomo, Axel-Cyrille}},
  booktitle    = {{The Semantic Web - {ISWC} 2015 - 14th International Semantic Web Conference, Bethlehem, PA, USA, October 11-15, 2015, Proceedings, Part {I}}},
  editor       = {{Arenas, Marcelo and Corcho, Óscar and Simperl, Elena and Strohmaier, Markus and d'Aquin, Mathieu and Srinivas, Kavitha and Groth, Paul and Dumontier, Michel and Heflin, Jeff and Thirunarayan, Krishnaprasad and Staab, Steffen}},
  pages        = {{375--391}},
  publisher    = {{Springer}},
  title        = {{{LANCE: Piercing to the Heart of Instance Matching Tools}}},
  doi          = {{10.1007/978-3-319-25007-6\_22}},
  volume       = {{9366}},
  year         = {{2015}},
}

@inproceedings{266,
  abstract     = {{Many markets have seen a shift from the idea of buying and moved to leasing instead. Arguably, the latter has been the major catalyst for their success. Ten years ago, research realized this shift and initiated the study of "online leasing problems" by introducing leasing to online optimization problems. Resources required to provide a service in an "online leasing problem" are no more bought but leased for different durations. In this paper, we provide an overview of results that contribute to the understanding of "online resource leasing problems". }},
  author       = {{Markarian, Christine and Meyer auf der Heide, Friedhelm}},
  booktitle    = {{Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing (PODC)}},
  pages        = {{343--344}},
  title        = {{{Online Resource Leasing}}},
  doi          = {{10.1145/2767386.2767454}},
  year         = {{2015}},
}