@inproceedings{20121, abstract = {{Collective decision making in self-organized systems is challenging because it relies on local perception and local communication. Globally defined qualities such as consensus time and decision accuracy are both difficult to predict and difficult to guarantee. We present the weighted voter model which implements a self-organized collective decision making process. We provide an ODE model, a master equation model (numerically solved by the Gillespie algorithm), and agent-based simulations of the proposed decision-making strategy. This set of models enables us to investigate the system behavior in the thermodynamic limit and to investigate finite-size effects due to random fluctuations. Based on our results, we give minimum requirements to guarantee consensus on the optimal decision, a minimum swarm size to guarantee a certain accuracy, and we show that the proposed approach scales with system size and is robust to noise.}}, author = {{Dorigo, Marco and Hamann, Heiko and Valentini, Gabriele and Lomuscio, Alessio and Scerri, Paul and Bazzan, Ana and Huhns, Michael}}, booktitle = {{Proceedings of the 13th Int. Conf. on Autonomous Agents and Multiagent Systems (AAMAS 2014)}}, title = {{{Self-Organized Collective Decision Making: The Weighted Voter Model}}}, year = {{2014}}, } @inproceedings{20126, author = {{Hamann, Heiko}}, booktitle = {{Int. Conf. on Genetic and Evolutionary Computation (GECCO 2014)}}, pages = {{31--32}}, title = {{{Evolving Prediction Machines: Collective Behaviors Based on Minimal Surprisal}}}, doi = {{10.1145/2598394.2598507}}, year = {{2014}}, } @inproceedings{20127, author = {{Birattari, Mauro and Dorigo, Marco and Hamann, Heiko and Garnier, Simon and Montes de Oca, Marco and Solnon, Christine and Stuetzle, Thomas and Ding, Hongli}}, booktitle = {{Ninth Int. Conf. on Swarm Intelligence (ANTS 2014)}}, pages = {{262--269}}, title = {{{Sorting in Swarm Robots Using Communication-Based Cluster Size Estimation}}}, doi = {{10.1007/978-3-319-09952-1_25}}, volume = {{8667}}, year = {{2014}}, } @inbook{20128, author = {{Khaluf, Yara and Dorigo, Marco and Hamann, Heiko and Valentini, Gabriele and Bartz-Beielstein, T.}}, booktitle = {{13th International Conference on Parallel Problem Solving from Nature (PPSN 2014)}}, pages = {{181--190}}, publisher = {{Springer}}, title = {{{Derivation of a Micro-Macro Link for Collective Decision-Making Systems: Uncover Network Features Based on Drift Measurements}}}, doi = {{10.1007/978-3-319-10762-2_18}}, volume = {{8672}}, year = {{2014}}, } @inproceedings{20129, author = {{Hamann, Heiko and Sayama, Hiroki and Rieffel, John and Risi, Sebastian and Doursat, Rene and Lipson, Hod}}, booktitle = {{14th Int. Conf. on the Synthesis and Simulation of Living Systems (ALIFE 2014)}}, pages = {{344--351}}, publisher = {{MIT Press}}, title = {{{Evolution of Collective Behaviors by Minimizing Surprise}}}, doi = {{10.7551/978-0-262-32621-6-ch055}}, year = {{2014}}, } @inproceedings{20130, author = {{Cervera, Enric and Khaluf, Yara and Birattari, Mauro and Hamann, Heiko and Pobil, Angel P. del and Chinellato, Eris and Martinez-Martin, Ester and Hallam, John and Morales, Antonio}}, booktitle = {{Simulation of Adaptive Behavior (SAB 2014)}}, pages = {{270--279}}, title = {{{A Swarm Robotics Approach to Task Allocation Under Soft Deadlines and Negligible Switching Costs}}}, doi = {{10.1007/978-3-319-08864-8_26}}, volume = {{8575}}, year = {{2014}}, } @inproceedings{20142, author = {{Wachsmuth, Henning and Trenkmann, Martin and Stein, Benno and Engels, Gregor and Palakarska, Tsvetomira}}, booktitle = {{Proceedings of the 15th International Conference on Intelligent Text Processing and Computational Linguistics}}, pages = {{115–127}}, title = {{{A Review Corpus for Argumentation Analysis}}}, year = {{2014}}, } @misc{2866, author = {{Biermeier, Felix}}, title = {{{Untersuchung des Erreichbarkeitsproblems in ungerichteten Graphen bezüglich den Komplexitätsklassen L und SL}}}, year = {{2014}}, } @misc{2867, author = {{Sauer, Malte}}, title = {{{Evaluierung von Initialisierungsmethoden für Fuzzy-k-means Algorithmen}}}, year = {{2014}}, } @article{24155, author = {{Basavaraju, Manu and Chandran, L Sunil and Rajendraprasad, Deepak and Ramaswamy, Arunselvan}}, journal = {{Graphs and Combinatorics}}, number = {{6}}, pages = {{1363--1382}}, publisher = {{Springer}}, title = {{{Rainbow connection number of graph power and graph products}}}, volume = {{30}}, year = {{2014}}, } @article{24156, author = {{Basavaraju, Manu and Chandran, L Sunil and Rajendraprasad, Deepak and Ramaswamy, Arunselvan}}, journal = {{Graphs and Combinatorics}}, number = {{2}}, pages = {{275--285}}, publisher = {{Springer}}, title = {{{Rainbow connection number and radius}}}, volume = {{30}}, year = {{2014}}, } @inproceedings{26537, abstract = {{n the summer of 1994, courses at universities were supported for the first time through the use of the World Wide Web. With the introduction of this new technology, high expectations quickly arose that the established forms of teaching and learning in schools and universities would be replaced and that the institutions themselves might even prove to be superfluous. Twenty years later, it turns out that there is a great gap between hope and reality. Some of the ideas at the time that, for example, having access to the world's knowledge at any time would make textbooks superfluous, turned out to be naive in retrospect. Characteristic of the ideas at that time was the assumption that didactic and organizational problems of teaching and learning could be solved purely technically. }}, author = {{Keil, Reinhard and Selke, Harald and Winkelnkemper, Felix}}, editor = {{Trahasch, Stephan and Pl {\ "o} tzner, Rolf and Schneider, Gerhard and Gayer, Claudia and Sassiat, Daniel and W {\ "o} hrle, Nicole}}, pages = {{51–60}}, title = {{{Twenty years of learning with the World Wide Web}}}, year = {{2014}}, } @inproceedings{26538, author = {{Winkelnkemper, Felix and Keil, Reinhard}}, editor = {{Butz, Andreas and Schlichter, Johann}}, pages = {{255--264}}, publisher = {{Oldenbourg Verlag}}, title = {{{Zwischen Design und Flexibilit{\"a}t - Zur Ergonomie des Flat Design}}}, volume = {{2014}}, year = {{2014}}, } @inproceedings{26540, author = {{Jakoblew , Marcel and Keil, Reinhard and Winkelnkemper, Felix}}, booktitle = {{Proceedings der HDI 2014}}, editor = {{Forbrig, Peter and Magenheim, Johannes}}, pages = {{74--84}}, publisher = {{Universit{\"a}t Rostock}}, title = {{{Forschendes Lernen durch semantisches Positionieren}}}, year = {{2014}}, } @inproceedings{26541, author = {{Keil, Reinhard and Schild, Christian}}, pages = {{265--274}}, publisher = {{De Gruyter Oldenbourg}}, title = {{{Hypothesengeleitete Gestaltung von Benutzungsoberfl{\"a}chen}}}, year = {{2014}}, } @inproceedings{26542, author = {{Keil, Reinhard}}, editor = {{Keller, Stefan Andreas and Schneider, René and Volk, Benno}}, pages = {{162–179}}, publisher = {{De Gruyter Saur}}, title = {{{Knowledge integration processes and distributed knowledge organization}}}, year = {{2014}}, } @inproceedings{329, abstract = {{Network emulations are widely used for testing novel network protocols and routing algorithms in realistic scenarios. Up to now, there is no emulation tool that is able to emulate large software-defined data center networks that consist of several thousand nodes. Mininet is the most common tool to emulate Software-Defined Networks of several hundred nodes. We extend Mininet to span an emulated network over several physical machines, making it possible to emulate networks of several thousand nodes on just a handful of physical machines. This enables us to emulate, e.g., large data center networks. To test this approach, we additionally introduce a traffic generator for data center traffic. Since there are no data center traffic traces publicly available we use the results of two recent traffic studies to create synthetic traffic. We show the design and discuss some challenges we had in building our traffic generator. As a showcase for our work we emulated a data center consisting of 3200 hosts on a cluster of only 12 physical machines. We show the resulting workloads and the trade-offs involved.}}, author = {{Wette, Philip and Dräxler, Martin and Schwabe, Arne and Wallaschek, Felix and Zahraee, Mohammad Hassan and Karl, Holger}}, booktitle = {{Proceedings of the 2014 IFIP Networking Conference (Networking 2014)}}, pages = {{1--9}}, title = {{{MaxiNet: Distributed Emulation of Software-Defined Networks}}}, doi = {{10.1109/IFIPNetworking.2014.6857078}}, year = {{2014}}, } @inproceedings{336, abstract = {{Today, service compositions often need to be assembled or changed on-the-fly, which leaves only little time for quality assurance. Moreover, quality assurance is complicated by service providers only giving information on their services in terms of domain specific concepts with only limited semantic meaning. In this paper, we propose a method to construct service compositions based on pre-verifiedtemplates. Templates, given as workflow descriptions, are typed over a (domain-independent) template ontology defining concepts and predicates. Templates are proven correct using an abstract semantics, leaving the specific meaning of ontology concepts open, however, only up to given ontology rules. Construction of service compositions amounts to instantiation of templates with domain-specific services.Correctness of an instantiation can then simply be checked by verifying that the domain ontology(a) adheres to the rules of the template ontology, and (b) fulfills the constraints of the employed template.}}, author = {{Walther, Sven and Wehrheim, Heike}}, booktitle = {{Proceedings of the 11th International Symposium on Formal Aspects of Component Software (FACS)}}, editor = {{Lanese, Ivan and Madelaine, Eric}}, pages = {{31--48}}, title = {{{Verified Service Compositions by Template-Based Construction}}}, doi = {{10.1007/978-3-319-15317-9_3}}, year = {{2014}}, } @inproceedings{339, abstract = {{Preemptive Routing and Wavelength Assignment (RWA) algorithms preempt established lightpaths in case notenough resources are available to set up a new lightpath in aWavelength Division Multiplexing (WDM) network. The selectionof lightpaths to be preempted relies on internal decisions of theRWA algorithm. Thus, if dedicated properties of the networktopology are required by the applications running on the network,these requirements have to be known to the RWA algorithm.We present a family of preemptive RWA algorithms for WDMnetworks. These algorithms have two distinguishing features: a)they can handle dynamic traffic by on-the-fly reconfiguration,and b) users can give feedback for reconfiguration decisions andthus influence the preemption decision of the RWA algorithm,leading to networks which adapt directly to application needs.This is different from traffic engineering where the network is(slowly) adapted to observed traffic patterns.Our algorithms handle various WDM network configurationsincluding networks consisting of heterogeneous WDM hardware.To this end, we are using the layered graph approach togetherwith a newly developed graph model that is used to determineconflicting lightpaths.}}, author = {{Wette, Philip and Karl, Holger}}, booktitle = {{Proceedings of the IEEE International Conference on Communications 2014}}, pages = {{3270--3276}}, title = {{{Using Application Layer Knowledge in Routing and Wavelength Assignment Algorithms}}}, doi = {{10.1109/ICC.2014.6883825}}, year = {{2014}}, } @misc{340, author = {{Korth, Philipp}}, publisher = {{Universität Paderborn}}, title = {{{Untersuchung transitiver Eigenschaften der Technik "Programs from Proofs"}}}, year = {{2014}}, }