[{"status":"public","citation":{"ama":"Reineke M. <i>Effizienzsteigerung durch gewichtete Produktbewertungen</i>. Universität Paderborn; 2013.","ieee":"M. Reineke, <i>Effizienzsteigerung durch gewichtete Produktbewertungen</i>. Universität Paderborn, 2013.","chicago":"Reineke, Max. <i>Effizienzsteigerung durch gewichtete Produktbewertungen</i>. Universität Paderborn, 2013.","mla":"Reineke, Max. <i>Effizienzsteigerung durch gewichtete Produktbewertungen</i>. Universität Paderborn, 2013.","short":"M. Reineke, Effizienzsteigerung durch gewichtete Produktbewertungen, Universität Paderborn, 2013.","bibtex":"@book{Reineke_2013, title={Effizienzsteigerung durch gewichtete Produktbewertungen}, publisher={Universität Paderborn}, author={Reineke, Max}, year={2013} }","apa":"Reineke, M. (2013). <i>Effizienzsteigerung durch gewichtete Produktbewertungen</i>. Universität Paderborn."},"year":"2013","type":"mastersthesis","language":[{"iso":"ger"}],"title":"Effizienzsteigerung durch gewichtete Produktbewertungen","date_created":"2017-10-17T12:42:36Z","author":[{"full_name":"Reineke, Max","last_name":"Reineke","first_name":"Max"}],"user_id":"477","_id":"535","date_updated":"2022-01-06T07:01:50Z","publisher":"Universität Paderborn","project":[{"_id":"1","name":"SFB 901"},{"_id":"7","name":"SFB 901 - Subprojekt A3"},{"_id":"2","name":"SFB 901 - Project Area A"}]},{"type":"mastersthesis","status":"public","department":[{"_id":"205"}],"user_id":"13264","_id":"536","project":[{"name":"SFB 901","_id":"1"},{"_id":"7","name":"SFB 901 - Subprojekt A3"},{"name":"SFB 901 - Project Area A","_id":"2"}],"citation":{"bibtex":"@book{Stroh-Maraun_2013, title={Dynamic One-to-One Matching: Theory and a Job Market Application}, publisher={Universität Paderborn}, author={Stroh-Maraun, Nadja}, year={2013} }","short":"N. Stroh-Maraun, Dynamic One-to-One Matching: Theory and a Job Market Application, Universität Paderborn, 2013.","mla":"Stroh-Maraun, Nadja. <i>Dynamic One-to-One Matching: Theory and a Job Market Application</i>. Universität Paderborn, 2013.","apa":"Stroh-Maraun, N. (2013). <i>Dynamic One-to-One Matching: Theory and a Job Market Application</i>. Universität Paderborn.","ieee":"N. Stroh-Maraun, <i>Dynamic One-to-One Matching: Theory and a Job Market Application</i>. Universität Paderborn, 2013.","chicago":"Stroh-Maraun, Nadja. <i>Dynamic One-to-One Matching: Theory and a Job Market Application</i>. Universität Paderborn, 2013.","ama":"Stroh-Maraun N. <i>Dynamic One-to-One Matching: Theory and a Job Market Application</i>. Universität Paderborn; 2013."},"year":"2013","author":[{"last_name":"Stroh-Maraun","full_name":"Stroh-Maraun, Nadja","id":"13264","first_name":"Nadja"}],"date_created":"2017-10-17T12:42:36Z","publisher":"Universität Paderborn","date_updated":"2022-01-06T07:01:50Z","title":"Dynamic One-to-One Matching: Theory and a Job Market Application"},{"project":[{"name":"SFB 901","_id":"1"},{"_id":"5","name":"SFB 901 - Subprojekt A1"},{"name":"SFB 901 - Project Area A","_id":"2"}],"_id":"537","user_id":"15504","status":"public","type":"mastersthesis","title":"Dispersion of Multi-Robot Teams","publisher":"Universität Paderborn","date_updated":"2022-01-06T07:01:50Z","author":[{"first_name":"Stefan","last_name":"Heindorf","full_name":"Heindorf, Stefan"}],"date_created":"2017-10-17T12:42:37Z","year":"2013","citation":{"chicago":"Heindorf, Stefan. <i>Dispersion of Multi-Robot Teams</i>. Universität Paderborn, 2013.","ieee":"S. Heindorf, <i>Dispersion of Multi-Robot Teams</i>. Universität Paderborn, 2013.","ama":"Heindorf S. <i>Dispersion of Multi-Robot Teams</i>. Universität Paderborn; 2013.","apa":"Heindorf, S. (2013). <i>Dispersion of Multi-Robot Teams</i>. Universität Paderborn.","short":"S. Heindorf, Dispersion of Multi-Robot Teams, Universität Paderborn, 2013.","bibtex":"@book{Heindorf_2013, title={Dispersion of Multi-Robot Teams}, publisher={Universität Paderborn}, author={Heindorf, Stefan}, year={2013} }","mla":"Heindorf, Stefan. <i>Dispersion of Multi-Robot Teams</i>. Universität Paderborn, 2013."}},{"type":"preprint","abstract":[{"text":"We present a new technique to realize attribute-based encryption (ABE) schemes secure in the standard model against chosen-ciphertext attacks (CCA-secure). Our approach is to extend certain concrete chosen-plaintext secure (CPA-secure) ABE schemes to achieve more efficient constructions than the known generic constructions of CCA-secure ABE schemes. We restrict ourselves to the construction of attribute-based key encapsulation mechanisms (KEMs) and present two concrete CCA-secure schemes: a key-policy attribute-based KEM that is based on Goyal's key-policy ABE and a ciphertext-policy attribute-based KEM that is based on Waters' ciphertext-policy ABE. To achieve our goals, we use an appropriate hash function and need to extend the public parameters and the ciphertexts of the underlying CPA-secure encryption schemes only by a single group element. Moreover, we use the same hardness assumptions as the underlying CPA-secure encryption schemes.","lang":"eng"}],"status":"public","file":[{"success":1,"relation":"main_file","content_type":"application/pdf","file_size":389797,"access_level":"closed","file_id":"1292","file_name":"538-AB-KEM_01.pdf","date_updated":"2018-03-15T10:35:04Z","date_created":"2018-03-15T10:35:04Z","creator":"florida"}],"_id":"538","project":[{"_id":"1","name":"SFB 901"},{"_id":"13","name":"SFB 901 - Subprojekt C1"},{"_id":"4","name":"SFB 901 - Project Area C"},{"_id":"43","name":"Securing the Financial Cloud"}],"department":[{"_id":"64"}],"user_id":"25078","ddc":["040"],"file_date_updated":"2018-03-15T10:35:04Z","has_accepted_license":"1","year":"2013","citation":{"ama":"Blömer J, Liske G. Direct Chosen-Ciphertext Secure Attribute-Based Key Encapsulations without Random Oracles. 2013.","chicago":"Blömer, Johannes, and Gennadij Liske. “Direct Chosen-Ciphertext Secure Attribute-Based Key Encapsulations without Random Oracles.” Universität Paderborn, 2013.","ieee":"J. Blömer and G. Liske, “Direct Chosen-Ciphertext Secure Attribute-Based Key Encapsulations without Random Oracles.” Universität Paderborn, 2013.","apa":"Blömer, J., &#38; Liske, G. (2013). Direct Chosen-Ciphertext Secure Attribute-Based Key Encapsulations without Random Oracles. Universität Paderborn.","short":"J. Blömer, G. Liske, (2013).","mla":"Blömer, Johannes, and Gennadij Liske. <i>Direct Chosen-Ciphertext Secure Attribute-Based Key Encapsulations without Random Oracles</i>. Universität Paderborn, 2013.","bibtex":"@article{Blömer_Liske_2013, title={Direct Chosen-Ciphertext Secure Attribute-Based Key Encapsulations without Random Oracles}, publisher={Universität Paderborn}, author={Blömer, Johannes and Liske, Gennadij}, year={2013} }"},"publisher":"Universität Paderborn","oa":"1","date_updated":"2022-01-06T07:01:51Z","author":[{"first_name":"Johannes","last_name":"Blömer","id":"23","full_name":"Blömer, Johannes"},{"full_name":"Liske, Gennadij","last_name":"Liske","first_name":"Gennadij"}],"date_created":"2017-10-17T12:42:37Z","title":"Direct Chosen-Ciphertext Secure Attribute-Based Key Encapsulations without Random Oracles","main_file_link":[{"url":"https://eprint.iacr.org/2013/646","open_access":"1"}]},{"author":[{"full_name":"Kornhoff, Tobias","last_name":"Kornhoff","first_name":"Tobias"}],"date_created":"2017-10-17T12:42:37Z","date_updated":"2022-01-06T07:01:51Z","publisher":"Universität Paderborn","title":"Der Einfluss adaptierter Erwartungen in dynamischen Cournot Oligopolen","citation":{"apa":"Kornhoff, T. (2013). <i>Der Einfluss adaptierter Erwartungen in dynamischen Cournot Oligopolen</i>. Universität Paderborn.","bibtex":"@book{Kornhoff_2013, title={Der Einfluss adaptierter Erwartungen in dynamischen Cournot Oligopolen}, publisher={Universität Paderborn}, author={Kornhoff, Tobias}, year={2013} }","mla":"Kornhoff, Tobias. <i>Der Einfluss adaptierter Erwartungen in dynamischen Cournot Oligopolen</i>. Universität Paderborn, 2013.","short":"T. Kornhoff, Der Einfluss adaptierter Erwartungen in dynamischen Cournot Oligopolen, Universität Paderborn, 2013.","ama":"Kornhoff T. <i>Der Einfluss adaptierter Erwartungen in dynamischen Cournot Oligopolen</i>. Universität Paderborn; 2013.","chicago":"Kornhoff, Tobias. <i>Der Einfluss adaptierter Erwartungen in dynamischen Cournot Oligopolen</i>. Universität Paderborn, 2013.","ieee":"T. Kornhoff, <i>Der Einfluss adaptierter Erwartungen in dynamischen Cournot Oligopolen</i>. Universität Paderborn, 2013."},"year":"2013","user_id":"477","project":[{"_id":"1","name":"SFB 901"},{"_id":"7","name":"SFB 901 - Subprojekt A3"},{"name":"SFB 901 - Project Area A","_id":"2"}],"_id":"539","language":[{"iso":"ger"}],"type":"bachelorsthesis","status":"public"},{"project":[{"name":"SFB 901","_id":"1"},{"_id":"5","name":"SFB 901 - Subprojekt A1"},{"name":"SFB 901 - Project Area A","_id":"2"}],"_id":"541","user_id":"477","department":[{"_id":"79"}],"ddc":["040"],"file_date_updated":"2018-03-15T10:33:20Z","language":[{"iso":"eng"}],"type":"conference","publication":"Proceedings of the International Conference on Computer Communications and Networks (ICCCN'13)","abstract":[{"lang":"eng","text":"Existing solutions for gossip-based aggregation in peer-to-peer networks use epochs to calculate a global estimation from an initial static set of local values. Once the estimation converges system-wide, a new epoch is started with fresh initial values. Long epochs result in precise estimations based on old measurements and short epochs result in imprecise aggregated estimations. In contrast to this approach, we present in this paper a continuous, epoch-less approach which considers fresh local values in every round of the gossip-based aggregation. By using an approach for dynamic information aging, inaccurate values and values from left peers fade from the aggregation memory. Evaluation shows that the presented approach for continuous information aggregation in peer-to-peer systems monitors the system performance precisely, adapts to changes and is lightweight to operate."}],"file":[{"date_updated":"2018-03-15T10:33:20Z","creator":"florida","date_created":"2018-03-15T10:33:20Z","file_size":272960,"file_id":"1290","access_level":"closed","file_name":"541-Continuous.Gossip.based.Aggregation.Through.Dynamic.Information.Aging.pdf","content_type":"application/pdf","success":1,"relation":"main_file"}],"status":"public","date_updated":"2022-01-06T07:01:52Z","author":[{"first_name":"Kalman","last_name":"Graffi","full_name":"Graffi, Kalman"},{"last_name":"Rapp","full_name":"Rapp, Vitaly","first_name":"Vitaly"}],"date_created":"2017-10-17T12:42:37Z","title":"Continuous Gossip-based Aggregation through Dynamic Information Aging","doi":"10.1109/ICCCN.2013.6614118","has_accepted_license":"1","year":"2013","citation":{"chicago":"Graffi, Kalman, and Vitaly Rapp. “Continuous Gossip-Based Aggregation through Dynamic Information Aging.” In <i>Proceedings of the International Conference on Computer Communications and Networks (ICCCN’13)</i>, 1–7, 2013. <a href=\"https://doi.org/10.1109/ICCCN.2013.6614118\">https://doi.org/10.1109/ICCCN.2013.6614118</a>.","ieee":"K. Graffi and V. Rapp, “Continuous Gossip-based Aggregation through Dynamic Information Aging,” in <i>Proceedings of the International Conference on Computer Communications and Networks (ICCCN’13)</i>, 2013, pp. 1–7.","ama":"Graffi K, Rapp V. Continuous Gossip-based Aggregation through Dynamic Information Aging. In: <i>Proceedings of the International Conference on Computer Communications and Networks (ICCCN’13)</i>. ; 2013:1-7. doi:<a href=\"https://doi.org/10.1109/ICCCN.2013.6614118\">10.1109/ICCCN.2013.6614118</a>","apa":"Graffi, K., &#38; Rapp, V. (2013). Continuous Gossip-based Aggregation through Dynamic Information Aging. In <i>Proceedings of the International Conference on Computer Communications and Networks (ICCCN’13)</i> (pp. 1–7). <a href=\"https://doi.org/10.1109/ICCCN.2013.6614118\">https://doi.org/10.1109/ICCCN.2013.6614118</a>","bibtex":"@inproceedings{Graffi_Rapp_2013, title={Continuous Gossip-based Aggregation through Dynamic Information Aging}, DOI={<a href=\"https://doi.org/10.1109/ICCCN.2013.6614118\">10.1109/ICCCN.2013.6614118</a>}, booktitle={Proceedings of the International Conference on Computer Communications and Networks (ICCCN’13)}, author={Graffi, Kalman and Rapp, Vitaly}, year={2013}, pages={1–7} }","mla":"Graffi, Kalman, and Vitaly Rapp. “Continuous Gossip-Based Aggregation through Dynamic Information Aging.” <i>Proceedings of the International Conference on Computer Communications and Networks (ICCCN’13)</i>, 2013, pp. 1–7, doi:<a href=\"https://doi.org/10.1109/ICCCN.2013.6614118\">10.1109/ICCCN.2013.6614118</a>.","short":"K. Graffi, V. Rapp, in: Proceedings of the International Conference on Computer Communications and Networks (ICCCN’13), 2013, pp. 1–7."},"page":"1-7"},{"citation":{"ieee":"S. Kniesburges, A. Koutsopoulos, and C. Scheideler, “CONE-DHT: A distributed self-stabilizing algorithm for a heterogeneous storage system,” in <i>Proceedings of the 27th International Symposium on Distributed Computing (DISC)</i>, 2013, pp. 537–549.","chicago":"Kniesburges, Sebastian, Andreas Koutsopoulos, and Christian Scheideler. “CONE-DHT: A Distributed Self-Stabilizing Algorithm for a Heterogeneous Storage System.” In <i>Proceedings of the 27th International Symposium on Distributed Computing (DISC)</i>, 537–49. LNCS, 2013. <a href=\"https://doi.org/10.1007/978-3-642-41527-2_37\">https://doi.org/10.1007/978-3-642-41527-2_37</a>.","ama":"Kniesburges S, Koutsopoulos A, Scheideler C. CONE-DHT: A distributed self-stabilizing algorithm for a heterogeneous storage system. In: <i>Proceedings of the 27th International Symposium on Distributed Computing (DISC)</i>. LNCS. ; 2013:537-549. doi:<a href=\"https://doi.org/10.1007/978-3-642-41527-2_37\">10.1007/978-3-642-41527-2_37</a>","bibtex":"@inproceedings{Kniesburges_Koutsopoulos_Scheideler_2013, series={LNCS}, title={CONE-DHT: A distributed self-stabilizing algorithm for a heterogeneous storage system}, DOI={<a href=\"https://doi.org/10.1007/978-3-642-41527-2_37\">10.1007/978-3-642-41527-2_37</a>}, booktitle={Proceedings of the 27th International Symposium on Distributed Computing (DISC)}, author={Kniesburges, Sebastian and Koutsopoulos, Andreas and Scheideler, Christian}, year={2013}, pages={537–549}, collection={LNCS} }","mla":"Kniesburges, Sebastian, et al. “CONE-DHT: A Distributed Self-Stabilizing Algorithm for a Heterogeneous Storage System.” <i>Proceedings of the 27th International Symposium on Distributed Computing (DISC)</i>, 2013, pp. 537–49, doi:<a href=\"https://doi.org/10.1007/978-3-642-41527-2_37\">10.1007/978-3-642-41527-2_37</a>.","short":"S. Kniesburges, A. Koutsopoulos, C. Scheideler, in: Proceedings of the 27th International Symposium on Distributed Computing (DISC), 2013, pp. 537–549.","apa":"Kniesburges, S., Koutsopoulos, A., &#38; Scheideler, C. (2013). CONE-DHT: A distributed self-stabilizing algorithm for a heterogeneous storage system. In <i>Proceedings of the 27th International Symposium on Distributed Computing (DISC)</i> (pp. 537–549). <a href=\"https://doi.org/10.1007/978-3-642-41527-2_37\">https://doi.org/10.1007/978-3-642-41527-2_37</a>"},"page":"537-549","year":"2013","has_accepted_license":"1","doi":"10.1007/978-3-642-41527-2_37","title":"CONE-DHT: A distributed self-stabilizing algorithm for a heterogeneous storage system","author":[{"first_name":"Sebastian","full_name":"Kniesburges, Sebastian","last_name":"Kniesburges"},{"last_name":"Koutsopoulos","full_name":"Koutsopoulos, Andreas","first_name":"Andreas"},{"first_name":"Christian","id":"20792","full_name":"Scheideler, Christian","last_name":"Scheideler"}],"date_created":"2017-10-17T12:42:38Z","date_updated":"2022-01-06T07:01:53Z","file":[{"access_level":"closed","file_name":"542-CONE-DHT_A_distributed_self-stabilizing_algorithm_for_a_heterogeneous_storage_system.pdf","file_id":"1289","file_size":262302,"creator":"florida","date_created":"2018-03-15T10:32:48Z","date_updated":"2018-03-15T10:32:48Z","relation":"main_file","success":1,"content_type":"application/pdf"}],"status":"public","abstract":[{"lang":"eng","text":"We consider the problem of managing a dynamic heterogeneous storagesystem in a distributed way so that the amount of data assigned to a hostin that system is related to its capacity. Two central problems have to be solvedfor this: (1) organizing the hosts in an overlay network with low degree and diameterso that one can efficiently check the correct distribution of the data androute between any two hosts, and (2) distributing the data among the hosts so thatthe distribution respects the capacities of the hosts and can easily be adapted asthe set of hosts or their capacities change. We present distributed protocols forthese problems that are self-stabilizing and that do not need any global knowledgeabout the system such as the number of nodes or the overall capacity of thesystem. Prior to this work no solution was known satisfying these properties."}],"type":"conference","publication":"Proceedings of the 27th International Symposium on Distributed Computing (DISC)","file_date_updated":"2018-03-15T10:32:48Z","ddc":["040"],"series_title":"LNCS","user_id":"15504","department":[{"_id":"79"}],"project":[{"_id":"1","name":"SFB 901"},{"_id":"13","name":"SFB 901 - Subprojekt C1"},{"name":"SFB 901 - Project Area C","_id":"4"}],"_id":"542"},{"title":"Comparison of Various Contract-Based Approaches for Specifying Behavior of On-The-Fly Computing Services","_id":"543","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt B1","_id":"9"},{"name":"SFB 901 - Project Area B","_id":"3"}],"date_updated":"2022-01-06T07:01:53Z","publisher":"Universität Paderborn","date_created":"2017-10-17T12:42:38Z","user_id":"15504","author":[{"first_name":"Kavitha","full_name":"Jagannath, Kavitha","last_name":"Jagannath"}],"year":"2013","status":"public","citation":{"apa":"Jagannath, K. (2013). <i>Comparison of Various Contract-Based Approaches for Specifying Behavior of On-The-Fly Computing Services</i>. Universität Paderborn.","mla":"Jagannath, Kavitha. <i>Comparison of Various Contract-Based Approaches for Specifying Behavior of On-The-Fly Computing Services</i>. Universität Paderborn, 2013.","bibtex":"@book{Jagannath_2013, title={Comparison of Various Contract-Based Approaches for Specifying Behavior of On-The-Fly Computing Services}, publisher={Universität Paderborn}, author={Jagannath, Kavitha}, year={2013} }","short":"K. Jagannath, Comparison of Various Contract-Based Approaches for Specifying Behavior of On-The-Fly Computing Services, Universität Paderborn, 2013.","ama":"Jagannath K. <i>Comparison of Various Contract-Based Approaches for Specifying Behavior of On-The-Fly Computing Services</i>. Universität Paderborn; 2013.","chicago":"Jagannath, Kavitha. <i>Comparison of Various Contract-Based Approaches for Specifying Behavior of On-The-Fly Computing Services</i>. Universität Paderborn, 2013.","ieee":"K. Jagannath, <i>Comparison of Various Contract-Based Approaches for Specifying Behavior of On-The-Fly Computing Services</i>. Universität Paderborn, 2013."},"type":"mastersthesis"},{"file":[{"content_type":"application/pdf","relation":"main_file","success":1,"date_created":"2018-03-15T10:32:17Z","creator":"florida","date_updated":"2018-03-15T10:32:17Z","file_name":"544-FeldGraffi13.pdf","access_level":"closed","file_id":"1288","file_size":899441}],"status":"public","abstract":[{"lang":"eng","text":"Comparative evaluations of peer-to-peer protocols through simulations are a viable approach to judge the performance and costs of the individual protocols in large-scale networks. In order to support this work, we enhanced the peer-to-peer systems simulator PeerfactSim.KOM with a fine-grained analyzer concept, with exhaustive automated measurements and gnuplot generators as well as a coordination control to evaluate a set of experiment setups in parallel. Thus, by configuring all experiments and protocols only once and starting the simulator, all desired measurements are performed, analyzed, evaluated and combined, resulting in a holistic environment for the comparative evaluation of peer-to-peer systems."}],"type":"conference","publication":"Proceedings of the International Conference on High Performance Computing and Simulation (HPCS'13)","language":[{"iso":"eng"}],"file_date_updated":"2018-03-15T10:32:17Z","ddc":["040"],"user_id":"14052","department":[{"_id":"79"}],"project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt A1","_id":"5"},{"_id":"2","name":"SFB 901 - Project Area A"}],"_id":"544","citation":{"apa":"Feldotto, M., &#38; Graffi, K. (2013). Comparative Evaluation of Peer-to-Peer Systems Using PeerfactSim.KOM. In <i>Proceedings of the International Conference on High Performance Computing and Simulation (HPCS’13)</i> (pp. 99–106). <a href=\"https://doi.org/10.1109/HPCSim.2013.6641399\">https://doi.org/10.1109/HPCSim.2013.6641399</a>","bibtex":"@inproceedings{Feldotto_Graffi_2013, title={Comparative Evaluation of Peer-to-Peer Systems Using PeerfactSim.KOM}, DOI={<a href=\"https://doi.org/10.1109/HPCSim.2013.6641399\">10.1109/HPCSim.2013.6641399</a>}, booktitle={Proceedings of the International Conference on High Performance Computing and Simulation (HPCS’13)}, author={Feldotto, Matthias and Graffi, Kalman}, year={2013}, pages={99–106} }","mla":"Feldotto, Matthias, and Kalman Graffi. “Comparative Evaluation of Peer-to-Peer Systems Using PeerfactSim.KOM.” <i>Proceedings of the International Conference on High Performance Computing and Simulation (HPCS’13)</i>, 2013, pp. 99–106, doi:<a href=\"https://doi.org/10.1109/HPCSim.2013.6641399\">10.1109/HPCSim.2013.6641399</a>.","short":"M. Feldotto, K. Graffi, in: Proceedings of the International Conference on High Performance Computing and Simulation (HPCS’13), 2013, pp. 99–106.","ama":"Feldotto M, Graffi K. Comparative Evaluation of Peer-to-Peer Systems Using PeerfactSim.KOM. In: <i>Proceedings of the International Conference on High Performance Computing and Simulation (HPCS’13)</i>. ; 2013:99-106. doi:<a href=\"https://doi.org/10.1109/HPCSim.2013.6641399\">10.1109/HPCSim.2013.6641399</a>","chicago":"Feldotto, Matthias, and Kalman Graffi. “Comparative Evaluation of Peer-to-Peer Systems Using PeerfactSim.KOM.” In <i>Proceedings of the International Conference on High Performance Computing and Simulation (HPCS’13)</i>, 99–106, 2013. <a href=\"https://doi.org/10.1109/HPCSim.2013.6641399\">https://doi.org/10.1109/HPCSim.2013.6641399</a>.","ieee":"M. Feldotto and K. Graffi, “Comparative Evaluation of Peer-to-Peer Systems Using PeerfactSim.KOM,” in <i>Proceedings of the International Conference on High Performance Computing and Simulation (HPCS’13)</i>, 2013, pp. 99–106."},"page":"99-106","year":"2013","has_accepted_license":"1","doi":"10.1109/HPCSim.2013.6641399","title":"Comparative Evaluation of Peer-to-Peer Systems Using PeerfactSim.KOM","date_created":"2017-10-17T12:42:38Z","author":[{"full_name":"Feldotto, Matthias","id":"14052","last_name":"Feldotto","orcid":"0000-0003-1348-6516","first_name":"Matthias"},{"first_name":"Kalman","last_name":"Graffi","full_name":"Graffi, Kalman"}],"date_updated":"2022-01-06T07:01:53Z"},{"language":[{"iso":"ger"}],"_id":"545","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt A1","_id":"5"},{"name":"SFB 901 - Project Area A","_id":"2"}],"user_id":"477","status":"public","type":"bachelorsthesis","title":"Cliquenbildung in verteilten Systemen","date_updated":"2022-01-06T07:01:54Z","publisher":"Universität Paderborn","author":[{"full_name":"Blumentritt, Fritz","last_name":"Blumentritt","first_name":"Fritz"}],"date_created":"2017-10-17T12:42:38Z","year":"2013","citation":{"ama":"Blumentritt F. <i>Cliquenbildung in verteilten Systemen</i>. Universität Paderborn; 2013.","chicago":"Blumentritt, Fritz. <i>Cliquenbildung in verteilten Systemen</i>. Universität Paderborn, 2013.","ieee":"F. Blumentritt, <i>Cliquenbildung in verteilten Systemen</i>. Universität Paderborn, 2013.","mla":"Blumentritt, Fritz. <i>Cliquenbildung in verteilten Systemen</i>. Universität Paderborn, 2013.","bibtex":"@book{Blumentritt_2013, title={Cliquenbildung in verteilten Systemen}, publisher={Universität Paderborn}, author={Blumentritt, Fritz}, year={2013} }","short":"F. Blumentritt, Cliquenbildung in verteilten Systemen, Universität Paderborn, 2013.","apa":"Blumentritt, F. (2013). <i>Cliquenbildung in verteilten Systemen</i>. Universität Paderborn."}},{"title":"Ca-Re-Chord: A Churn Resistant Self-stabilizing Chord Overlay Network","doi":"10.1109/NetSys.2013.11","date_updated":"2022-01-06T07:01:55Z","author":[{"first_name":"Kalman","last_name":"Graffi","full_name":"Graffi, Kalman"},{"first_name":"Markus","full_name":"Benter, Markus","last_name":"Benter"},{"full_name":"Divband, Mohammad","last_name":"Divband","first_name":"Mohammad"},{"full_name":"Kniesburges, Sebastian","last_name":"Kniesburges","first_name":"Sebastian"},{"first_name":"Andreas","full_name":"Koutsopoulos, Andreas","last_name":"Koutsopoulos"}],"date_created":"2017-10-17T12:42:38Z","year":"2013","page":"27-34","citation":{"bibtex":"@inproceedings{Graffi_Benter_Divband_Kniesburges_Koutsopoulos_2013, title={Ca-Re-Chord: A Churn Resistant Self-stabilizing Chord Overlay Network}, DOI={<a href=\"https://doi.org/10.1109/NetSys.2013.11\">10.1109/NetSys.2013.11</a>}, booktitle={Proceedings of the Conference on Networked Systems (NetSys)}, author={Graffi, Kalman and Benter, Markus and Divband, Mohammad and Kniesburges, Sebastian and Koutsopoulos, Andreas}, year={2013}, pages={27–34} }","short":"K. Graffi, M. Benter, M. Divband, S. Kniesburges, A. Koutsopoulos, in: Proceedings of the Conference on Networked Systems (NetSys), 2013, pp. 27–34.","mla":"Graffi, Kalman, et al. “Ca-Re-Chord: A Churn Resistant Self-Stabilizing Chord Overlay Network.” <i>Proceedings of the Conference on Networked Systems (NetSys)</i>, 2013, pp. 27–34, doi:<a href=\"https://doi.org/10.1109/NetSys.2013.11\">10.1109/NetSys.2013.11</a>.","apa":"Graffi, K., Benter, M., Divband, M., Kniesburges, S., &#38; Koutsopoulos, A. (2013). Ca-Re-Chord: A Churn Resistant Self-stabilizing Chord Overlay Network. In <i>Proceedings of the Conference on Networked Systems (NetSys)</i> (pp. 27–34). <a href=\"https://doi.org/10.1109/NetSys.2013.11\">https://doi.org/10.1109/NetSys.2013.11</a>","ama":"Graffi K, Benter M, Divband M, Kniesburges S, Koutsopoulos A. Ca-Re-Chord: A Churn Resistant Self-stabilizing Chord Overlay Network. In: <i>Proceedings of the Conference on Networked Systems (NetSys)</i>. ; 2013:27-34. doi:<a href=\"https://doi.org/10.1109/NetSys.2013.11\">10.1109/NetSys.2013.11</a>","ieee":"K. Graffi, M. Benter, M. Divband, S. Kniesburges, and A. Koutsopoulos, “Ca-Re-Chord: A Churn Resistant Self-stabilizing Chord Overlay Network,” in <i>Proceedings of the Conference on Networked Systems (NetSys)</i>, 2013, pp. 27–34.","chicago":"Graffi, Kalman, Markus Benter, Mohammad Divband, Sebastian Kniesburges, and Andreas Koutsopoulos. “Ca-Re-Chord: A Churn Resistant Self-Stabilizing Chord Overlay Network.” In <i>Proceedings of the Conference on Networked Systems (NetSys)</i>, 27–34, 2013. <a href=\"https://doi.org/10.1109/NetSys.2013.11\">https://doi.org/10.1109/NetSys.2013.11</a>."},"has_accepted_license":"1","ddc":["040"],"file_date_updated":"2018-03-15T10:30:42Z","_id":"546","project":[{"name":"SFB 901","_id":"1"},{"_id":"5","name":"SFB 901 - Subprojekt A1"},{"_id":"13","name":"SFB 901 - Subproject C1"},{"_id":"2","name":"SFB 901 - Project Area A"},{"name":"SFB 901 - Project Area C","_id":"4"}],"department":[{"_id":"79"}],"user_id":"15504","abstract":[{"text":"Self-stabilization is the property of a system to transfer itself regardless of the initial state into a legitimate state. Chord as a simple, decentralized and scalable distributed hash table is an ideal showcase to introduce self-stabilization for p2p overlays. In this paper, we present Re-Chord, a self-stabilizing version of Chord. We show, that the stabilization process is functional, but prone to strong churn. For that, we present Ca-Re-Chord, a churn resistant version of Re-Chord, that allows the creation of a useful DHT in any kind of graph regardless of the initial state. Simulation results attest the churn resistance and good performance of Ca-Re-Chord.","lang":"eng"}],"status":"public","file":[{"relation":"main_file","success":1,"content_type":"application/pdf","file_id":"1286","file_name":"546-Kalman.Graffi_CaReChord.A.Churn.Resistant.Selfstabilizing.Chord.Overlay.Network_02.pdf","access_level":"closed","file_size":244841,"creator":"florida","date_created":"2018-03-15T10:30:42Z","date_updated":"2018-03-15T10:30:42Z"}],"publication":"Proceedings of the Conference on Networked Systems (NetSys)","type":"conference"},{"date_updated":"2022-01-06T07:01:55Z","publisher":"Universität Paderborn","author":[{"last_name":"Gerth","full_name":"Gerth, Christian","first_name":"Christian"}],"supervisor":[{"first_name":"Gregor","last_name":"Engels","id":"107","full_name":"Engels, Gregor"}],"date_created":"2017-10-17T12:42:39Z","title":"Business Process Models - Change Management","doi":"10.1007/978-3-642-38604-6","year":"2013","citation":{"bibtex":"@book{Gerth_2013, title={Business Process Models - Change Management}, DOI={<a href=\"https://doi.org/10.1007/978-3-642-38604-6\">10.1007/978-3-642-38604-6</a>}, publisher={Universität Paderborn}, author={Gerth, Christian}, year={2013} }","short":"C. Gerth, Business Process Models - Change Management, Universität Paderborn, 2013.","mla":"Gerth, Christian. <i>Business Process Models - Change Management</i>. Universität Paderborn, 2013, doi:<a href=\"https://doi.org/10.1007/978-3-642-38604-6\">10.1007/978-3-642-38604-6</a>.","apa":"Gerth, C. (2013). <i>Business Process Models - Change Management</i>. Universität Paderborn. <a href=\"https://doi.org/10.1007/978-3-642-38604-6\">https://doi.org/10.1007/978-3-642-38604-6</a>","ama":"Gerth C. <i>Business Process Models - Change Management</i>. Universität Paderborn; 2013. doi:<a href=\"https://doi.org/10.1007/978-3-642-38604-6\">10.1007/978-3-642-38604-6</a>","chicago":"Gerth, Christian. <i>Business Process Models - Change Management</i>. Universität Paderborn, 2013. <a href=\"https://doi.org/10.1007/978-3-642-38604-6\">https://doi.org/10.1007/978-3-642-38604-6</a>.","ieee":"C. Gerth, <i>Business Process Models - Change Management</i>. Universität Paderborn, 2013."},"project":[{"_id":"1","name":"SFB 901"},{"_id":"9","name":"SFB 901 - Subprojekt B1"},{"_id":"3","name":"SFB 901 - Project Area B"}],"_id":"547","user_id":"477","department":[{"_id":"66"}],"language":[{"iso":"eng"}],"type":"dissertation","abstract":[{"lang":"eng","text":"In recent years, the role of process models in the development of enterprise software systems has increased continuously. Today, process models are used at different levels in the development process. For instance, in Service-Oriented Architectures (SOA), high-level business process models become input for the development of IT systems, and in running IT systems executable process models describe choreographies of Web Services. A key driver behind this development is the necessity for a closer alignment of business and IT requirements, to reduce the reaction times in software development to frequent changes in competitive markets.Typically in these scenarios, process models are developed, maintained, and transformed in a team environment by several stakeholders that are often from different business units, resulting in different versions. To obtain integrated process models comprising the changes applied to different versions, the versions need to be consolidated by means of model change management. Change management for process models can be compared to widely used concurrent versioning systems (CVS) and consists of the following major activities: matching of process models, detection of differences, computation of dependencies and conflicts between differences, and merging of process models.Although in general model-driven development (MDD) is accepted as a well-established development approach, there are still some shortcomings that let developers decide against MDD and for more traditional development paradigms. These shortcomings comprise a lack of fully integrated and fully featured development environments for MDD, such as a comprehensive support for model change management.In this thesis, we present a framework for process model change management. The framework is based on an intermediate representation for process models that serves as an abstraction of specific process modeling languages and focuses on common syntactic and semantic core concepts for the modeling of workflow in process models. Based on the intermediate representation, we match process models in versioning scenarios and compute differences between process models generically. Further, we consider the analysis of dependencies between differences and show how conflicts between differences can be computed by taking into account the semantics of the modeling language.As proof-of concept, we have implemented major parts of this framework in terms of a prototype. The detection of differences and dependencies contributed also to the Compare & Merge framework for the IBM WebSphere Business Modeler V 7.0 [1] (WBM), which was released as a product in fall 2009."}],"status":"public"},{"date_updated":"2022-01-06T07:01:56Z","date_created":"2017-10-17T12:42:39Z","author":[{"first_name":"Kalman","full_name":"Graffi, Kalman","last_name":"Graffi"},{"full_name":"Klerx, Timo","last_name":"Klerx","first_name":"Timo"}],"title":"Bootstrapping Skynet: Calibration and Autonomic Self-Control of Structured Peer-to-Peer Networks","doi":"10.1109/P2P.2013.6688720","has_accepted_license":"1","year":"2013","page":"1-5","citation":{"ieee":"K. Graffi and T. Klerx, “Bootstrapping Skynet: Calibration and Autonomic Self-Control of Structured Peer-to-Peer Networks,” in <i>Proceedings of the International Conference on Peer-to-Peer Computing (P2P’13)</i>, 2013, pp. 1–5.","chicago":"Graffi, Kalman, and Timo Klerx. “Bootstrapping Skynet: Calibration and Autonomic Self-Control of Structured Peer-to-Peer Networks.” In <i>Proceedings of the International Conference on Peer-to-Peer Computing (P2P’13)</i>, 1–5, 2013. <a href=\"https://doi.org/10.1109/P2P.2013.6688720\">https://doi.org/10.1109/P2P.2013.6688720</a>.","ama":"Graffi K, Klerx T. Bootstrapping Skynet: Calibration and Autonomic Self-Control of Structured Peer-to-Peer Networks. In: <i>Proceedings of the International Conference on Peer-to-Peer Computing (P2P’13)</i>. ; 2013:1-5. doi:<a href=\"https://doi.org/10.1109/P2P.2013.6688720\">10.1109/P2P.2013.6688720</a>","short":"K. Graffi, T. Klerx, in: Proceedings of the International Conference on Peer-to-Peer Computing (P2P’13), 2013, pp. 1–5.","bibtex":"@inproceedings{Graffi_Klerx_2013, title={Bootstrapping Skynet: Calibration and Autonomic Self-Control of Structured Peer-to-Peer Networks}, DOI={<a href=\"https://doi.org/10.1109/P2P.2013.6688720\">10.1109/P2P.2013.6688720</a>}, booktitle={Proceedings of the International Conference on Peer-to-Peer Computing (P2P’13)}, author={Graffi, Kalman and Klerx, Timo}, year={2013}, pages={1–5} }","mla":"Graffi, Kalman, and Timo Klerx. “Bootstrapping Skynet: Calibration and Autonomic Self-Control of Structured Peer-to-Peer Networks.” <i>Proceedings of the International Conference on Peer-to-Peer Computing (P2P’13)</i>, 2013, pp. 1–5, doi:<a href=\"https://doi.org/10.1109/P2P.2013.6688720\">10.1109/P2P.2013.6688720</a>.","apa":"Graffi, K., &#38; Klerx, T. (2013). Bootstrapping Skynet: Calibration and Autonomic Self-Control of Structured Peer-to-Peer Networks. In <i>Proceedings of the International Conference on Peer-to-Peer Computing (P2P’13)</i> (pp. 1–5). <a href=\"https://doi.org/10.1109/P2P.2013.6688720\">https://doi.org/10.1109/P2P.2013.6688720</a>"},"_id":"548","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt A1","_id":"5"},{"name":"SFB 901 - Project Area A","_id":"2"}],"department":[{"_id":"79"}],"user_id":"477","ddc":["040"],"file_date_updated":"2018-03-15T10:30:09Z","language":[{"iso":"eng"}],"publication":"Proceedings of the International Conference on Peer-to-Peer Computing (P2P'13)","type":"conference","abstract":[{"lang":"eng","text":"Peer-to-peer systems scale to millions of nodes and provide routing and storage functions with best effort quality. In order to provide a guaranteed quality of the overlay functions, even under strong dynamics in the network with regard to peer capacities, online participation and usage patterns, we propose to calibrate the peer-to-peer overlay and to autonomously learn which qualities can be reached. For that, we simulate the peer-to-peer overlay systematically under a wide range of parameter configurations and use neural networks to learn the effects of the configurations on the quality metrics. Thus, by choosing a specific quality setting by the overlay operator, the network can tune itself to the learned parameter configurations that lead to the desired quality. Evaluation shows that the presented self-calibration succeeds in learning the configuration-quality interdependencies and that peer-to-peer systems can learn and adapt their behavior according to desired quality goals."}],"status":"public","file":[{"date_updated":"2018-03-15T10:30:09Z","creator":"florida","date_created":"2018-03-15T10:30:09Z","file_size":629234,"file_name":"548-Bootstrapping.Skynet.Calibration.and.Autonomic.Self-Control.of.Structured.P2P.Networks_01.pdf","file_id":"1285","access_level":"closed","content_type":"application/pdf","success":1,"relation":"main_file"}]},{"status":"public","type":"bachelorsthesis","language":[{"iso":"ger"}],"_id":"549","project":[{"name":"SFB 901","_id":"1"},{"_id":"14","name":"SFB 901 - Subprojekt C2"},{"name":"SFB 901 - Project Area C","_id":"4"}],"user_id":"477","year":"2013","citation":{"apa":"Bick, C. (2013). <i>Beschleunigung von Tiefenberechung aus Stereobildern durch FPGA-basierte Datenflussrechner</i>. Universität Paderborn.","short":"C. Bick, Beschleunigung von Tiefenberechung aus Stereobildern durch FPGA-basierte Datenflussrechner, Universität Paderborn, 2013.","bibtex":"@book{Bick_2013, title={Beschleunigung von Tiefenberechung aus Stereobildern durch FPGA-basierte Datenflussrechner}, publisher={Universität Paderborn}, author={Bick, Christian}, year={2013} }","mla":"Bick, Christian. <i>Beschleunigung von Tiefenberechung aus Stereobildern durch FPGA-basierte Datenflussrechner</i>. Universität Paderborn, 2013.","chicago":"Bick, Christian. <i>Beschleunigung von Tiefenberechung aus Stereobildern durch FPGA-basierte Datenflussrechner</i>. Universität Paderborn, 2013.","ieee":"C. Bick, <i>Beschleunigung von Tiefenberechung aus Stereobildern durch FPGA-basierte Datenflussrechner</i>. Universität Paderborn, 2013.","ama":"Bick C. <i>Beschleunigung von Tiefenberechung aus Stereobildern durch FPGA-basierte Datenflussrechner</i>. Universität Paderborn; 2013."},"title":"Beschleunigung von Tiefenberechung aus Stereobildern durch FPGA-basierte Datenflussrechner","publisher":"Universität Paderborn","date_updated":"2022-01-06T07:01:56Z","author":[{"full_name":"Bick, Christian","last_name":"Bick","first_name":"Christian"}],"date_created":"2017-10-17T12:42:39Z"},{"year":"2013","citation":{"ama":"Meschede J. <i>Bandbreiten-beschränktes Scheduling mit skalierbaren Jobanforderungen in Multiprozessor-Umgebungen</i>. Universität Paderborn; 2013.","chicago":"Meschede, Julian. <i>Bandbreiten-beschränktes Scheduling mit skalierbaren Jobanforderungen in Multiprozessor-Umgebungen</i>. Universität Paderborn, 2013.","ieee":"J. Meschede, <i>Bandbreiten-beschränktes Scheduling mit skalierbaren Jobanforderungen in Multiprozessor-Umgebungen</i>. Universität Paderborn, 2013.","mla":"Meschede, Julian. <i>Bandbreiten-beschränktes Scheduling mit skalierbaren Jobanforderungen in Multiprozessor-Umgebungen</i>. Universität Paderborn, 2013.","bibtex":"@book{Meschede_2013, title={Bandbreiten-beschränktes Scheduling mit skalierbaren Jobanforderungen in Multiprozessor-Umgebungen}, publisher={Universität Paderborn}, author={Meschede, Julian}, year={2013} }","short":"J. Meschede, Bandbreiten-beschränktes Scheduling mit skalierbaren Jobanforderungen in Multiprozessor-Umgebungen, Universität Paderborn, 2013.","apa":"Meschede, J. (2013). <i>Bandbreiten-beschränktes Scheduling mit skalierbaren Jobanforderungen in Multiprozessor-Umgebungen</i>. Universität Paderborn."},"title":"Bandbreiten-beschränktes Scheduling mit skalierbaren Jobanforderungen in Multiprozessor-Umgebungen","publisher":"Universität Paderborn","date_updated":"2022-01-06T07:01:56Z","date_created":"2017-10-17T12:42:39Z","author":[{"first_name":"Julian","last_name":"Meschede","full_name":"Meschede, Julian"}],"status":"public","type":"bachelorsthesis","language":[{"iso":"ger"}],"project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt C2","_id":"14"},{"_id":"4","name":"SFB 901 - Project Area C"}],"_id":"550","user_id":"477"},{"has_accepted_license":"1","citation":{"ieee":"Z. Huma, C. Gerth, G. Engels, and O. Juwig, “Automated Service Composition for On-the-Fly SOAs,” in <i>Proceedings of the 11th International Conference on Service Oriented Computing (ICSOC’13)</i>, 2013, pp. 524--532.","chicago":"Huma, Zille, Christian Gerth, Gregor Engels, and Oliver Juwig. “Automated Service Composition for On-the-Fly SOAs.” In <i>Proceedings of the 11th International Conference on Service Oriented Computing (ICSOC’13)</i>, 524--532. LNCS, 2013. <a href=\"https://doi.org/10.1007/978-3-642-45005-1_42\">https://doi.org/10.1007/978-3-642-45005-1_42</a>.","ama":"Huma Z, Gerth C, Engels G, Juwig O. Automated Service Composition for On-the-Fly SOAs. In: <i>Proceedings of the 11th International Conference on Service Oriented Computing (ICSOC’13)</i>. LNCS. ; 2013:524--532. doi:<a href=\"https://doi.org/10.1007/978-3-642-45005-1_42\">10.1007/978-3-642-45005-1_42</a>","short":"Z. Huma, C. Gerth, G. Engels, O. Juwig, in: Proceedings of the 11th International Conference on Service Oriented Computing (ICSOC’13), 2013, pp. 524--532.","mla":"Huma, Zille, et al. “Automated Service Composition for On-the-Fly SOAs.” <i>Proceedings of the 11th International Conference on Service Oriented Computing (ICSOC’13)</i>, 2013, pp. 524--532, doi:<a href=\"https://doi.org/10.1007/978-3-642-45005-1_42\">10.1007/978-3-642-45005-1_42</a>.","bibtex":"@inproceedings{Huma_Gerth_Engels_Juwig_2013, series={LNCS}, title={Automated Service Composition for On-the-Fly SOAs}, DOI={<a href=\"https://doi.org/10.1007/978-3-642-45005-1_42\">10.1007/978-3-642-45005-1_42</a>}, booktitle={Proceedings of the 11th International Conference on Service Oriented Computing (ICSOC’13)}, author={Huma, Zille and Gerth, Christian and Engels, Gregor and Juwig, Oliver}, year={2013}, pages={524--532}, collection={LNCS} }","apa":"Huma, Z., Gerth, C., Engels, G., &#38; Juwig, O. (2013). Automated Service Composition for On-the-Fly SOAs. In <i>Proceedings of the 11th International Conference on Service Oriented Computing (ICSOC’13)</i> (pp. 524--532). <a href=\"https://doi.org/10.1007/978-3-642-45005-1_42\">https://doi.org/10.1007/978-3-642-45005-1_42</a>"},"page":"524--532","year":"2013","author":[{"full_name":"Huma, Zille","last_name":"Huma","first_name":"Zille"},{"first_name":"Christian","full_name":"Gerth, Christian","last_name":"Gerth"},{"last_name":"Engels","full_name":"Engels, Gregor","id":"107","first_name":"Gregor"},{"full_name":"Juwig, Oliver","last_name":"Juwig","first_name":"Oliver"}],"date_created":"2017-10-17T12:42:39Z","date_updated":"2022-01-06T07:01:57Z","doi":"10.1007/978-3-642-45005-1_42","title":"Automated Service Composition for On-the-Fly SOAs","type":"conference","publication":"Proceedings of the 11th International Conference on Service Oriented Computing (ICSOC'13)","file":[{"file_id":"1287","file_name":"551-978-3-642-45005-1_42.pdf","access_level":"closed","file_size":384397,"creator":"florida","date_created":"2018-03-15T10:31:20Z","date_updated":"2018-03-15T10:31:20Z","relation":"main_file","success":1,"content_type":"application/pdf"}],"status":"public","abstract":[{"lang":"eng","text":"In the service-oriented computing domain, the number of available software services steadily increased in recent years, favored by the rise of cloud computing with its attached delivery models like Software-as-a-Service (SaaS). To fully leverage the opportunities provided by these services for developing highly flexible and aligned SOA, integration of new services as well as the substitution of existing services must be simplified. As a consequence, approaches for automated and accurate service discovery and composition are needed. In this paper, we propose an automatic service composition approach as an extension to our earlier work on automatic service discovery. To ensure accurate results, it matches service requests and available offers based on their structural as well as behavioral aspects. Afterwards, possible service compositions are determined by composing service protocols through a composition strategy based on labeled transition systems."}],"user_id":"477","series_title":"LNCS","department":[{"_id":"66"}],"project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt B1","_id":"9"},{"name":"SFB 901 - Project Area B","_id":"3"}],"_id":"551","file_date_updated":"2018-03-15T10:31:20Z","language":[{"iso":"eng"}],"ddc":["040"]},{"title":"Auktionen im Beschaffungsmanagement - Eine spieltheoretische Analyse","language":[{"iso":"ger"}],"publisher":"Universität Paderborn","date_updated":"2022-01-06T07:01:57Z","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt A3","_id":"7"},{"_id":"2","name":"SFB 901 - Project Area A"}],"_id":"552","date_created":"2017-10-17T12:42:39Z","user_id":"477","author":[{"first_name":"Kevin","last_name":"Meckenstock","full_name":"Meckenstock, Kevin"}],"year":"2013","citation":{"ama":"Meckenstock K. <i>Auktionen im Beschaffungsmanagement - Eine spieltheoretische Analyse</i>. Universität Paderborn; 2013.","chicago":"Meckenstock, Kevin. <i>Auktionen im Beschaffungsmanagement - Eine spieltheoretische Analyse</i>. Universität Paderborn, 2013.","ieee":"K. Meckenstock, <i>Auktionen im Beschaffungsmanagement - Eine spieltheoretische Analyse</i>. Universität Paderborn, 2013.","mla":"Meckenstock, Kevin. <i>Auktionen im Beschaffungsmanagement - Eine spieltheoretische Analyse</i>. Universität Paderborn, 2013.","bibtex":"@book{Meckenstock_2013, title={Auktionen im Beschaffungsmanagement - Eine spieltheoretische Analyse}, publisher={Universität Paderborn}, author={Meckenstock, Kevin}, year={2013} }","short":"K. Meckenstock, Auktionen im Beschaffungsmanagement - Eine spieltheoretische Analyse, Universität Paderborn, 2013.","apa":"Meckenstock, K. (2013). <i>Auktionen im Beschaffungsmanagement - Eine spieltheoretische Analyse</i>. Universität Paderborn."},"status":"public","type":"bachelorsthesis"},{"type":"bachelorsthesis","status":"public","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt C1","_id":"13"},{"name":"SFB 901 - Project Area C","_id":"4"},{"name":"Securing the Financial Cloud","_id":"43"}],"_id":"553","user_id":"477","department":[{"_id":"64"}],"language":[{"iso":"ger"}],"year":"2013","citation":{"mla":"Kohn, Kathlén. <i>Attributbasierte Verschlüsselung mittels Gittermethoden - Mathematische Grundlagen, Verfahren und Sicherheitsbeweise</i>. Universität Paderborn, 2013.","short":"K. Kohn, Attributbasierte Verschlüsselung mittels Gittermethoden - Mathematische Grundlagen, Verfahren und Sicherheitsbeweise, Universität Paderborn, 2013.","bibtex":"@book{Kohn_2013, title={Attributbasierte Verschlüsselung mittels Gittermethoden - Mathematische Grundlagen, Verfahren und Sicherheitsbeweise}, publisher={Universität Paderborn}, author={Kohn, Kathlén}, year={2013} }","apa":"Kohn, K. (2013). <i>Attributbasierte Verschlüsselung mittels Gittermethoden - Mathematische Grundlagen, Verfahren und Sicherheitsbeweise</i>. Universität Paderborn.","ama":"Kohn K. <i>Attributbasierte Verschlüsselung mittels Gittermethoden - Mathematische Grundlagen, Verfahren und Sicherheitsbeweise</i>. Universität Paderborn; 2013.","ieee":"K. Kohn, <i>Attributbasierte Verschlüsselung mittels Gittermethoden - Mathematische Grundlagen, Verfahren und Sicherheitsbeweise</i>. Universität Paderborn, 2013.","chicago":"Kohn, Kathlén. <i>Attributbasierte Verschlüsselung mittels Gittermethoden - Mathematische Grundlagen, Verfahren und Sicherheitsbeweise</i>. Universität Paderborn, 2013."},"publisher":"Universität Paderborn","date_updated":"2022-01-06T07:01:57Z","author":[{"last_name":"Kohn","full_name":"Kohn, Kathlén","first_name":"Kathlén"}],"supervisor":[{"first_name":"Johannes","last_name":"Blömer","id":"23","full_name":"Blömer, Johannes"}],"date_created":"2017-10-17T12:42:40Z","title":"Attributbasierte Verschlüsselung mittels Gittermethoden - Mathematische Grundlagen, Verfahren und Sicherheitsbeweise"},{"publication":"Economics Letters","file":[{"content_type":"application/pdf","success":1,"relation":"main_file","date_updated":"2018-03-15T10:29:34Z","date_created":"2018-03-15T10:29:34Z","creator":"florida","file_size":374965,"access_level":"closed","file_name":"554-Asymmetric_Nash_bargaining_solutions_and_competitive_payoffs.pdf","file_id":"1284"}],"abstract":[{"text":"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.","lang":"eng"}],"language":[{"iso":"eng"}],"ddc":["040"],"issue":"2","year":"2013","date_created":"2017-10-17T12:42:40Z","publisher":"Elsevier","title":"Asymmetric Nash bargaining solutions and competitive payoffs","type":"journal_article","status":"public","user_id":"477","department":[{"_id":"205"}],"project":[{"name":"SFB 901","_id":"1"},{"_id":"7","name":"SFB 901 - Subprojekt A3"},{"name":"SFB 901 - Project Area A","_id":"2"}],"_id":"554","file_date_updated":"2018-03-15T10:29:34Z","has_accepted_license":"1","citation":{"ieee":"S. Brangewitz and J.-P. Gamp, “Asymmetric Nash bargaining solutions and competitive payoffs,” <i>Economics Letters</i>, no. 2, pp. 224–227, 2013.","chicago":"Brangewitz, Sonja, and Jan-Philip Gamp. “Asymmetric Nash Bargaining Solutions and Competitive Payoffs.” <i>Economics Letters</i>, no. 2 (2013): 224–27. <a href=\"https://doi.org/10.1016/j.econlet.2013.08.013\">https://doi.org/10.1016/j.econlet.2013.08.013</a>.","ama":"Brangewitz S, Gamp J-P. Asymmetric Nash bargaining solutions and competitive payoffs. <i>Economics Letters</i>. 2013;(2):224-227. doi:<a href=\"https://doi.org/10.1016/j.econlet.2013.08.013\">10.1016/j.econlet.2013.08.013</a>","apa":"Brangewitz, S., &#38; Gamp, J.-P. (2013). Asymmetric Nash bargaining solutions and competitive payoffs. <i>Economics Letters</i>, (2), 224–227. <a href=\"https://doi.org/10.1016/j.econlet.2013.08.013\">https://doi.org/10.1016/j.econlet.2013.08.013</a>","mla":"Brangewitz, Sonja, and Jan-Philip Gamp. “Asymmetric Nash Bargaining Solutions and Competitive Payoffs.” <i>Economics Letters</i>, no. 2, Elsevier, 2013, pp. 224–27, doi:<a href=\"https://doi.org/10.1016/j.econlet.2013.08.013\">10.1016/j.econlet.2013.08.013</a>.","bibtex":"@article{Brangewitz_Gamp_2013, title={Asymmetric Nash bargaining solutions and competitive payoffs}, DOI={<a href=\"https://doi.org/10.1016/j.econlet.2013.08.013\">10.1016/j.econlet.2013.08.013</a>}, number={2}, journal={Economics Letters}, publisher={Elsevier}, author={Brangewitz, Sonja and Gamp, Jan-Philip}, year={2013}, pages={224–227} }","short":"S. Brangewitz, J.-P. Gamp, Economics Letters (2013) 224–227."},"page":"224 - 227","author":[{"first_name":"Sonja","full_name":"Brangewitz, Sonja","last_name":"Brangewitz"},{"last_name":"Gamp","full_name":"Gamp, Jan-Philip","first_name":"Jan-Philip"}],"date_updated":"2022-01-06T07:01:58Z","doi":"10.1016/j.econlet.2013.08.013"},{"project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt A1","_id":"5"},{"name":"SFB 901 - Project Area A","_id":"2"}],"_id":"555","user_id":"477","department":[{"_id":"79"}],"type":"mastersthesis","status":"public","publisher":"Universität Paderborn","date_updated":"2022-01-06T07:01:59Z","date_created":"2017-10-17T12:42:40Z","author":[{"first_name":"Alexander","last_name":"Setzer","id":"11108","full_name":"Setzer, Alexander"}],"title":"Approximation Algorithms for the Linear Arrangement of Special Classes of Graphs","year":"2013","citation":{"ama":"Setzer A. <i>Approximation Algorithms for the Linear Arrangement of Special Classes of Graphs</i>. Universität Paderborn; 2013.","chicago":"Setzer, Alexander. <i>Approximation Algorithms for the Linear Arrangement of Special Classes of Graphs</i>. Universität Paderborn, 2013.","ieee":"A. Setzer, <i>Approximation Algorithms for the Linear Arrangement of Special Classes of Graphs</i>. Universität Paderborn, 2013.","apa":"Setzer, A. (2013). <i>Approximation Algorithms for the Linear Arrangement of Special Classes of Graphs</i>. Universität Paderborn.","mla":"Setzer, Alexander. <i>Approximation Algorithms for the Linear Arrangement of Special Classes of Graphs</i>. Universität Paderborn, 2013.","bibtex":"@book{Setzer_2013, title={Approximation Algorithms for the Linear Arrangement of Special Classes of Graphs}, publisher={Universität Paderborn}, author={Setzer, Alexander}, year={2013} }","short":"A. Setzer, Approximation Algorithms for the Linear Arrangement of Special Classes of Graphs, Universität Paderborn, 2013."}}]