TY - GEN AU - Kohn, Kathlén ID - 553 TI - Attributbasierte Verschlüsselung mittels Gittermethoden - Mathematische Grundlagen, Verfahren und Sicherheitsbeweise ER - TY - JOUR AB - We establish a link between cooperative and competitive behavior. For every possible vector of weights of an asymmetric Nash bargaining solution there exists a market that has this asymmetric Nash bargaining solution as its unique competitive payoff vector. AU - Brangewitz, Sonja AU - Gamp, Jan-Philip ID - 554 IS - 2 JF - Economics Letters TI - Asymmetric Nash bargaining solutions and competitive payoffs ER - TY - GEN AU - Setzer, Alexander ID - 555 TI - Approximation Algorithms for the Linear Arrangement of Special Classes of Graphs ER - TY - GEN AU - Nickel, Tobias ID - 556 TI - Analyse von Benutzeranforderungen von Service-Kompositionen mittels Modelchecking ER - TY - GEN AB - Since the last two decades, the water consumption in Germany is decreasing, which causes the water tanks and pipes in a water supply system to work inefficiently. This paper proposes an approach for a decision support system, which helps to decide how to plan new water tanks and resize existing tanks in water supply systems. The approach uses a combination of network reduction, mathematical optimization and hydraulic simulation. The mathematical optimization model is a nonconvex Mixed Integer Quadratically Constrained Program (MIQCP), which is solved by a piecewise linearization. As this may lead to many binary variables and therefore high computational times, the size of the water supply system model is reduced before building the optimization model. By applying several network reduction techniques there may occur some hydraulic differences between the original network model and the reduced network model. To make sure that the solution obtained in the optimization process is feasible in the original water supply system, the solution is verified by a hydraulic simulation tool. AU - Hallmann, Corinna ID - 557 TI - An Approach for a Decision Support Systems to optimize Water Tanks in Water Supply Systems by combining Network Reduction, Optimization and Simulation ER - TY - JOUR AU - Wex, Felix AU - Schryen, Guido AU - Neumann, Dirk ID - 5575 IS - 4 JF - International Journal of Information Systems for Crisis Response and Management TI - Assignments of Collaborative Rescue Units during Emergency Response VL - 5 ER - TY - CONF AU - Wex, Felix AU - Schryen, Guido AU - Neumann, Dirk ID - 5576 T2 - Proceedings of the 46th Hawaii International Conference on System Science TI - Decision Modeling for Assignments of Collaborative Rescue Units during Emergency Response ER - TY - GEN ED - Flocchini, Paola ED - Gao, Jie ED - Kranakis, Evangelos ED - Meyer auf der Heide, Friedhelm ID - 558 TI - Algorithms for Sensor Systems - 9th International Symposium on Algorithms and Experiments for Sensor Systems, Wireless Networks and Distributed Robotics VL - 8243 ER - TY - CONF AB - Distributed hash tables are very versatile to use, as distributed storage is a desirable feature for various applications. Typical structured overlays like Chord, Pastry or Kademlia consider only homogeneous nodes with equal capacities, which does not resemble reality. In a practical use case, nodes might get overloaded by storing popular data. In this paper, we present a general approach to enable capacity awareness and load-balancing capability of homogeneous structured overlays. We introduce a hierarchical second structured overlay aside, which allows efficient capacity-based access on the nodes in the system as hosting mirrors. Simulation results show that the structured overlay is able to store various contents, such as of a social network, with only a negligible number of overloaded peers. Content, even if very popular, is hosted by easily findable capable peers. Thus, long-existing and well-evaluated overlays like Chord or Pastry can be used to create attractive DHT-based applications. AU - Wette, Philip AU - Graffi, Kalman ID - 559 T2 - Proceedings of the Conference on Networked Systems (NetSys) TI - Adding Capacity-Aware Storage Indirection to Homogeneous Distributed Hash Tables ER - TY - CONF AB - In the last decades, development turned from monolithic software products towards more flexible software components that can be provided on world-wide markets in form of services. Customers request such services or compositions of several services. However, in many cases, discovering the best services to address a given request is a tough challenge and requires expressive, gradual matching results, considering different aspects of a service description, e.g., inputs/ouputs, protocols, or quality properties. Furthermore,in situations in which no service exactly satifies the request, approximate matching which can deal with a certain amount of fuzziness becomes necessary. There is a wealth of service matching approaches, but it is not clear whether there is a comprehensive, fuzzy matching approach which addresses all these challenges. Although there are a few service matchingsurveys, none of them is able to answer this question. In this paper, we perform a systematic literature survey of 35 (outof 504) service matching approaches which consider fuzzy matching. Based on this survey, we propose a classication,discuss how different matching approaches can be combined into a comprehensive matching method, and identify future research challenges. AU - Platenius, Marie AU - von Detten, Markus AU - Becker, Steffen AU - Schäfer, Wilhelm AU - Engels, Gregor ID - 560 T2 - Proceedings of the 16th International ACM Sigsoft Symposium on Component-Based Software Engineering TI - A Survey of Fuzzy Service Matching Approaches in the Context of On-The-Fly Computing ER -