[{"date_updated":"2022-01-06T07:01:49Z","author":[{"last_name":"Buse","first_name":"Dominik","full_name":"Buse, Dominik"}],"status":"public","title":"Entwurf kooperativer Verhaltensweisen heterogener Roboter","year":"2013","user_id":"15504","_id":"530","publisher":"Universität Paderborn","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt B2","_id":"10"},{"name":"SFB 901 - Project Area B","_id":"3"}],"citation":{"chicago":"Buse, Dominik. <i>Entwurf Kooperativer Verhaltensweisen Heterogener Roboter</i>. Universität Paderborn, 2013.","short":"D. Buse, Entwurf Kooperativer Verhaltensweisen Heterogener Roboter, Universität Paderborn, 2013.","ieee":"D. Buse, <i>Entwurf kooperativer Verhaltensweisen heterogener Roboter</i>. Universität Paderborn, 2013.","apa":"Buse, D. (2013). <i>Entwurf kooperativer Verhaltensweisen heterogener Roboter</i>. Universität Paderborn.","bibtex":"@book{Buse_2013, title={Entwurf kooperativer Verhaltensweisen heterogener Roboter}, publisher={Universität Paderborn}, author={Buse, Dominik}, year={2013} }","ama":"Buse D. <i>Entwurf Kooperativer Verhaltensweisen Heterogener Roboter</i>. Universität Paderborn; 2013.","mla":"Buse, Dominik. <i>Entwurf Kooperativer Verhaltensweisen Heterogener Roboter</i>. Universität Paderborn, 2013."},"type":"bachelorsthesis","date_created":"2017-10-17T12:42:35Z"},{"author":[{"full_name":"Lutters, Sascha","last_name":"Lutters","first_name":"Sascha"}],"title":"Entwurf eines datenschutzgerechten Reputationssystems","status":"public","year":"2013","date_updated":"2022-01-06T07:01:49Z","_id":"531","language":[{"iso":"ger"}],"publisher":"Universität Paderborn","user_id":"477","citation":{"mla":"Lutters, Sascha. <i>Entwurf eines datenschutzgerechten Reputationssystems</i>. Universität Paderborn, 2013.","apa":"Lutters, S. (2013). <i>Entwurf eines datenschutzgerechten Reputationssystems</i>. Universität Paderborn.","ieee":"S. Lutters, <i>Entwurf eines datenschutzgerechten Reputationssystems</i>. Universität Paderborn, 2013.","chicago":"Lutters, Sascha. <i>Entwurf eines datenschutzgerechten Reputationssystems</i>. Universität Paderborn, 2013.","ama":"Lutters S. <i>Entwurf eines datenschutzgerechten Reputationssystems</i>. Universität Paderborn; 2013.","short":"S. Lutters, Entwurf eines datenschutzgerechten Reputationssystems, Universität Paderborn, 2013.","bibtex":"@book{Lutters_2013, title={Entwurf eines datenschutzgerechten Reputationssystems}, publisher={Universität Paderborn}, author={Lutters, Sascha}, year={2013} }"},"project":[{"_id":"1","name":"SFB 901"},{"_id":"13","name":"SFB 901 - Subprojekt C1"},{"name":"SFB 901 - Project Area C","_id":"4"}],"date_created":"2017-10-17T12:42:35Z","type":"mastersthesis"},{"type":"bachelorsthesis","date_created":"2017-10-17T12:42:36Z","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt C1","_id":"13"},{"_id":"4","name":"SFB 901 - Project Area C"}],"citation":{"ieee":"H. Hilleckes, <i>Entwicklung und Analyse einer verteilten Speicherverwaltung für dynamische heterogene Speichersysteme</i>. Universität Paderborn, 2013.","apa":"Hilleckes, H. (2013). <i>Entwicklung und Analyse einer verteilten Speicherverwaltung für dynamische heterogene Speichersysteme</i>. Universität Paderborn.","chicago":"Hilleckes, Hendrik. <i>Entwicklung und Analyse einer verteilten Speicherverwaltung für dynamische heterogene Speichersysteme</i>. Universität Paderborn, 2013.","short":"H. Hilleckes, Entwicklung und Analyse einer verteilten Speicherverwaltung für dynamische heterogene Speichersysteme, Universität Paderborn, 2013.","mla":"Hilleckes, Hendrik. <i>Entwicklung und Analyse einer verteilten Speicherverwaltung für dynamische heterogene Speichersysteme</i>. Universität Paderborn, 2013.","bibtex":"@book{Hilleckes_2013, title={Entwicklung und Analyse einer verteilten Speicherverwaltung für dynamische heterogene Speichersysteme}, publisher={Universität Paderborn}, author={Hilleckes, Hendrik}, year={2013} }","ama":"Hilleckes H. <i>Entwicklung und Analyse einer verteilten Speicherverwaltung für dynamische heterogene Speichersysteme</i>. Universität Paderborn; 2013."},"user_id":"477","_id":"532","language":[{"iso":"ger"}],"publisher":"Universität Paderborn","date_updated":"2022-01-06T07:01:49Z","author":[{"full_name":"Hilleckes, Hendrik","last_name":"Hilleckes","first_name":"Hendrik"}],"year":"2013","status":"public","title":"Entwicklung und Analyse einer verteilten Speicherverwaltung für dynamische heterogene Speichersysteme"},{"date_created":"2017-10-17T12:42:36Z","type":"bachelorsthesis","citation":{"apa":"Borkowski, R. (2013). <i>Entwicklung eines Hybriden Planers zur verhaltensorientierten Selbstoptimierung</i>. Universität Paderborn.","ieee":"R. Borkowski, <i>Entwicklung eines Hybriden Planers zur verhaltensorientierten Selbstoptimierung</i>. Universität Paderborn, 2013.","short":"R. Borkowski, Entwicklung eines Hybriden Planers zur verhaltensorientierten Selbstoptimierung, Universität Paderborn, 2013.","chicago":"Borkowski, Richard. <i>Entwicklung eines Hybriden Planers zur verhaltensorientierten Selbstoptimierung</i>. Universität Paderborn, 2013.","mla":"Borkowski, Richard. <i>Entwicklung eines Hybriden Planers zur verhaltensorientierten Selbstoptimierung</i>. Universität Paderborn, 2013.","ama":"Borkowski R. <i>Entwicklung eines Hybriden Planers zur verhaltensorientierten Selbstoptimierung</i>. Universität Paderborn; 2013.","bibtex":"@book{Borkowski_2013, title={Entwicklung eines Hybriden Planers zur verhaltensorientierten Selbstoptimierung}, publisher={Universität Paderborn}, author={Borkowski, Richard}, year={2013} }"},"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt B2","_id":"10"},{"_id":"3","name":"SFB 901 - Project Area B"}],"language":[{"iso":"ger"}],"_id":"533","publisher":"Universität Paderborn","user_id":"477","title":"Entwicklung eines Hybriden Planers zur verhaltensorientierten Selbstoptimierung","status":"public","year":"2013","author":[{"full_name":"Borkowski, Richard","first_name":"Richard","last_name":"Borkowski"}],"date_updated":"2022-01-06T07:01:49Z"},{"citation":{"ama":"Satya S. <i>Emulating Wavelength Division Multiplexing Using Openflow</i>. Universität Paderborn; 2013.","bibtex":"@book{Satya_2013, title={Emulating Wavelength Division Multiplexing using Openflow}, publisher={Universität Paderborn}, author={Satya, Suhas}, year={2013} }","mla":"Satya, Suhas. <i>Emulating Wavelength Division Multiplexing Using Openflow</i>. Universität Paderborn, 2013.","chicago":"Satya, Suhas. <i>Emulating Wavelength Division Multiplexing Using Openflow</i>. Universität Paderborn, 2013.","short":"S. Satya, Emulating Wavelength Division Multiplexing Using Openflow, Universität Paderborn, 2013.","apa":"Satya, S. (2013). <i>Emulating Wavelength Division Multiplexing using Openflow</i>. Universität Paderborn.","ieee":"S. Satya, <i>Emulating Wavelength Division Multiplexing using Openflow</i>. Universität Paderborn, 2013."},"project":[{"name":"SFB 901","_id":"1"},{"_id":"6","name":"SFB 901 - Subprojekt A2"},{"name":"SFB 901 - Project Area A","_id":"2"}],"date_created":"2017-10-17T12:42:36Z","type":"mastersthesis","department":[{"_id":"75"}],"status":"public","year":"2013","title":"Emulating Wavelength Division Multiplexing using Openflow","author":[{"full_name":"Satya, Suhas","first_name":"Suhas","last_name":"Satya"}],"date_updated":"2022-01-06T07:01:50Z","_id":"534","publisher":"Universität Paderborn","user_id":"15504"},{"date_updated":"2022-01-06T07:01:50Z","author":[{"full_name":"Reineke, Max","first_name":"Max","last_name":"Reineke"}],"status":"public","title":"Effizienzsteigerung durch gewichtete Produktbewertungen","year":"2013","user_id":"477","publisher":"Universität Paderborn","_id":"535","language":[{"iso":"ger"}],"project":[{"name":"SFB 901","_id":"1"},{"_id":"7","name":"SFB 901 - Subprojekt A3"},{"name":"SFB 901 - Project Area A","_id":"2"}],"citation":{"ama":"Reineke M. <i>Effizienzsteigerung durch gewichtete Produktbewertungen</i>. Universität Paderborn; 2013.","bibtex":"@book{Reineke_2013, title={Effizienzsteigerung durch gewichtete Produktbewertungen}, publisher={Universität Paderborn}, author={Reineke, Max}, year={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.","chicago":"Reineke, Max. <i>Effizienzsteigerung durch gewichtete Produktbewertungen</i>. Universität Paderborn, 2013.","apa":"Reineke, M. (2013). <i>Effizienzsteigerung durch gewichtete Produktbewertungen</i>. Universität Paderborn.","ieee":"M. Reineke, <i>Effizienzsteigerung durch gewichtete Produktbewertungen</i>. Universität Paderborn, 2013."},"type":"mastersthesis","date_created":"2017-10-17T12:42:36Z"},{"author":[{"id":"13264","full_name":"Stroh-Maraun, Nadja","last_name":"Stroh-Maraun","first_name":"Nadja"}],"status":"public","year":"2013","title":"Dynamic One-to-One Matching: Theory and a Job Market Application","date_updated":"2022-01-06T07:01:50Z","_id":"536","publisher":"Universität Paderborn","user_id":"13264","citation":{"ama":"Stroh-Maraun N. <i>Dynamic One-to-One Matching: Theory and a Job Market Application</i>. Universität Paderborn; 2013.","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} }","mla":"Stroh-Maraun, Nadja. <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.","short":"N. Stroh-Maraun, Dynamic One-to-One Matching: Theory and a Job Market Application, 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."},"project":[{"_id":"1","name":"SFB 901"},{"_id":"7","name":"SFB 901 - Subprojekt A3"},{"_id":"2","name":"SFB 901 - Project Area A"}],"date_created":"2017-10-17T12:42:36Z","department":[{"_id":"205"}],"type":"mastersthesis"},{"type":"mastersthesis","date_created":"2017-10-17T12:42:37Z","project":[{"_id":"1","name":"SFB 901"},{"_id":"5","name":"SFB 901 - Subprojekt A1"},{"name":"SFB 901 - Project Area A","_id":"2"}],"citation":{"ieee":"S. Heindorf, <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.","chicago":"Heindorf, Stefan. <i>Dispersion of Multi-Robot Teams</i>. Universität Paderborn, 2013.","short":"S. Heindorf, Dispersion of Multi-Robot Teams, Universität Paderborn, 2013.","mla":"Heindorf, Stefan. <i>Dispersion of Multi-Robot Teams</i>. Universität Paderborn, 2013.","bibtex":"@book{Heindorf_2013, title={Dispersion of Multi-Robot Teams}, publisher={Universität Paderborn}, author={Heindorf, Stefan}, year={2013} }","ama":"Heindorf S. <i>Dispersion of Multi-Robot Teams</i>. Universität Paderborn; 2013."},"user_id":"15504","_id":"537","publisher":"Universität Paderborn","date_updated":"2022-01-06T07:01:50Z","title":"Dispersion of Multi-Robot Teams","year":"2013","status":"public","author":[{"full_name":"Heindorf, Stefan","last_name":"Heindorf","first_name":"Stefan"}]},{"abstract":[{"lang":"eng","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."}],"file":[{"date_updated":"2018-03-15T10:35:04Z","relation":"main_file","file_size":389797,"access_level":"closed","file_name":"538-AB-KEM_01.pdf","content_type":"application/pdf","success":1,"file_id":"1292","creator":"florida","date_created":"2018-03-15T10:35:04Z"}],"date_created":"2017-10-17T12:42:37Z","type":"preprint","department":[{"_id":"64"}],"title":"Direct Chosen-Ciphertext Secure Attribute-Based Key Encapsulations without Random Oracles","year":"2013","author":[{"id":"23","last_name":"Blömer","first_name":"Johannes","full_name":"Blömer, Johannes"},{"last_name":"Liske","first_name":"Gennadij","full_name":"Liske, Gennadij"}],"date_updated":"2022-01-06T07:01:51Z","main_file_link":[{"url":"https://eprint.iacr.org/2013/646","open_access":"1"}],"file_date_updated":"2018-03-15T10:35:04Z","citation":{"mla":"Blömer, Johannes, and Gennadij Liske. <i>Direct Chosen-Ciphertext Secure Attribute-Based Key Encapsulations without Random Oracles</i>. Universität Paderborn, 2013.","ama":"Blömer J, Liske G. Direct Chosen-Ciphertext Secure Attribute-Based Key Encapsulations without Random Oracles. 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} }","apa":"Blömer, J., &#38; Liske, G. (2013). Direct Chosen-Ciphertext Secure Attribute-Based Key Encapsulations without Random Oracles. Universität Paderborn.","ieee":"J. Blömer and G. Liske, “Direct Chosen-Ciphertext Secure Attribute-Based Key Encapsulations without Random Oracles.” Universität Paderborn, 2013.","short":"J. Blömer, G. Liske, (2013).","chicago":"Blömer, Johannes, and Gennadij Liske. “Direct Chosen-Ciphertext Secure Attribute-Based Key Encapsulations without Random Oracles.” Universität Paderborn, 2013."},"project":[{"name":"SFB 901","_id":"1"},{"_id":"13","name":"SFB 901 - Subprojekt C1"},{"_id":"4","name":"SFB 901 - Project Area C"},{"_id":"43","name":"Securing the Financial Cloud"}],"oa":"1","status":"public","has_accepted_license":"1","publisher":"Universität Paderborn","_id":"538","ddc":["040"],"user_id":"25078"},{"author":[{"full_name":"Kornhoff, Tobias","first_name":"Tobias","last_name":"Kornhoff"}],"year":"2013","status":"public","title":"Der Einfluss adaptierter Erwartungen in dynamischen Cournot Oligopolen","date_updated":"2022-01-06T07:01:51Z","publisher":"Universität Paderborn","_id":"539","language":[{"iso":"ger"}],"user_id":"477","citation":{"chicago":"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.","apa":"Kornhoff, T. (2013). <i>Der Einfluss adaptierter Erwartungen in dynamischen Cournot Oligopolen</i>. Universität Paderborn.","ieee":"T. Kornhoff, <i>Der Einfluss adaptierter Erwartungen in dynamischen Cournot Oligopolen</i>. Universität Paderborn, 2013.","ama":"Kornhoff T. <i>Der Einfluss adaptierter Erwartungen in dynamischen Cournot Oligopolen</i>. Universität Paderborn; 2013.","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."},"project":[{"name":"SFB 901","_id":"1"},{"_id":"7","name":"SFB 901 - Subprojekt A3"},{"_id":"2","name":"SFB 901 - Project Area A"}],"date_created":"2017-10-17T12:42:37Z","type":"bachelorsthesis"},{"ddc":["040"],"user_id":"477","page":"1-7","_id":"541","has_accepted_license":"1","status":"public","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt A1","_id":"5"},{"_id":"2","name":"SFB 901 - Project Area A"}],"file_date_updated":"2018-03-15T10:33:20Z","citation":{"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.","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>","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>.","short":"K. Graffi, V. Rapp, in: Proceedings of the International Conference on Computer Communications and Networks (ICCCN’13), 2013, pp. 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>.","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} }","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>"},"doi":"10.1109/ICCCN.2013.6614118","language":[{"iso":"eng"}],"date_updated":"2022-01-06T07:01:52Z","title":"Continuous Gossip-based Aggregation through Dynamic Information Aging","year":"2013","author":[{"full_name":"Graffi, Kalman","last_name":"Graffi","first_name":"Kalman"},{"full_name":"Rapp, Vitaly","first_name":"Vitaly","last_name":"Rapp"}],"type":"conference","department":[{"_id":"79"}],"file":[{"date_created":"2018-03-15T10:33:20Z","creator":"florida","file_id":"1290","content_type":"application/pdf","success":1,"relation":"main_file","date_updated":"2018-03-15T10:33:20Z","file_name":"541-Continuous.Gossip.based.Aggregation.Through.Dynamic.Information.Aging.pdf","access_level":"closed","file_size":272960}],"date_created":"2017-10-17T12:42:37Z","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."}],"publication":"Proceedings of the International Conference on Computer Communications and Networks (ICCCN'13)"},{"file":[{"file_name":"542-CONE-DHT_A_distributed_self-stabilizing_algorithm_for_a_heterogeneous_storage_system.pdf","file_size":262302,"access_level":"closed","relation":"main_file","date_updated":"2018-03-15T10:32:48Z","file_id":"1289","content_type":"application/pdf","success":1,"creator":"florida","date_created":"2018-03-15T10:32:48Z"}],"date_created":"2017-10-17T12:42:38Z","type":"conference","department":[{"_id":"79"}],"publication":"Proceedings of the 27th International Symposium on Distributed Computing (DISC)","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."}],"series_title":"LNCS","doi":"10.1007/978-3-642-41527-2_37","title":"CONE-DHT: A distributed self-stabilizing algorithm for a heterogeneous storage system","year":"2013","author":[{"full_name":"Kniesburges, Sebastian","last_name":"Kniesburges","first_name":"Sebastian"},{"full_name":"Koutsopoulos, Andreas","last_name":"Koutsopoulos","first_name":"Andreas"},{"last_name":"Scheideler","first_name":"Christian","full_name":"Scheideler, Christian","id":"20792"}],"date_updated":"2022-01-06T07:01:53Z","file_date_updated":"2018-03-15T10:32:48Z","citation":{"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} }","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>","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>.","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>.","short":"S. Kniesburges, A. Koutsopoulos, C. Scheideler, in: Proceedings of the 27th International Symposium on Distributed Computing (DISC), 2013, pp. 537–549.","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.","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>"},"project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt C1","_id":"13"},{"_id":"4","name":"SFB 901 - Project Area C"}],"page":"537-549","_id":"542","ddc":["040"],"user_id":"15504","status":"public","has_accepted_license":"1"},{"user_id":"15504","_id":"543","publisher":"Universität Paderborn","date_updated":"2022-01-06T07:01:53Z","author":[{"full_name":"Jagannath, Kavitha","first_name":"Kavitha","last_name":"Jagannath"}],"year":"2013","title":"Comparison of Various Contract-Based Approaches for Specifying Behavior of On-The-Fly Computing Services","status":"public","type":"mastersthesis","date_created":"2017-10-17T12:42:38Z","project":[{"name":"SFB 901","_id":"1"},{"_id":"9","name":"SFB 901 - Subprojekt B1"},{"_id":"3","name":"SFB 901 - Project Area B"}],"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.","ieee":"K. Jagannath, <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.","ama":"Jagannath K. <i>Comparison of Various Contract-Based Approaches for Specifying Behavior of On-The-Fly Computing Services</i>. Universität Paderborn; 2013.","short":"K. Jagannath, Comparison of Various Contract-Based Approaches for Specifying Behavior of On-The-Fly Computing Services, 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} }"}},{"language":[{"iso":"eng"}],"doi":"10.1109/HPCSim.2013.6641399","year":"2013","title":"Comparative Evaluation of Peer-to-Peer Systems Using PeerfactSim.KOM","author":[{"full_name":"Feldotto, Matthias","first_name":"Matthias","orcid":"0000-0003-1348-6516","last_name":"Feldotto","id":"14052"},{"full_name":"Graffi, Kalman","last_name":"Graffi","first_name":"Kalman"}],"date_updated":"2022-01-06T07:01:53Z","file":[{"file_name":"544-FeldGraffi13.pdf","access_level":"closed","file_size":899441,"relation":"main_file","date_updated":"2018-03-15T10:32:17Z","file_id":"1288","success":1,"content_type":"application/pdf","creator":"florida","date_created":"2018-03-15T10:32:17Z"}],"date_created":"2017-10-17T12:42:38Z","type":"conference","department":[{"_id":"79"}],"publication":"Proceedings of the International Conference on High Performance Computing and Simulation (HPCS'13)","abstract":[{"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.","lang":"eng"}],"page":"99-106","_id":"544","ddc":["040"],"user_id":"14052","status":"public","has_accepted_license":"1","file_date_updated":"2018-03-15T10:32:17Z","citation":{"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} }","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.","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>.","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>"},"project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt A1","_id":"5"},{"_id":"2","name":"SFB 901 - Project Area A"}]},{"date_updated":"2022-01-06T07:01:54Z","author":[{"full_name":"Blumentritt, Fritz","last_name":"Blumentritt","first_name":"Fritz"}],"title":"Cliquenbildung in verteilten Systemen","year":"2013","status":"public","user_id":"477","language":[{"iso":"ger"}],"_id":"545","publisher":"Universität Paderborn","project":[{"name":"SFB 901","_id":"1"},{"_id":"5","name":"SFB 901 - Subprojekt A1"},{"name":"SFB 901 - Project Area A","_id":"2"}],"citation":{"bibtex":"@book{Blumentritt_2013, title={Cliquenbildung in verteilten Systemen}, publisher={Universität Paderborn}, author={Blumentritt, Fritz}, year={2013} }","ama":"Blumentritt F. <i>Cliquenbildung in verteilten Systemen</i>. Universität Paderborn; 2013.","short":"F. Blumentritt, Cliquenbildung in verteilten Systemen, 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.","apa":"Blumentritt, F. (2013). <i>Cliquenbildung in verteilten Systemen</i>. Universität Paderborn.","mla":"Blumentritt, Fritz. <i>Cliquenbildung in verteilten Systemen</i>. Universität Paderborn, 2013."},"type":"bachelorsthesis","date_created":"2017-10-17T12:42:38Z"},{"citation":{"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>.","short":"K. Graffi, M. Benter, M. Divband, S. Kniesburges, A. Koutsopoulos, in: Proceedings of the Conference on Networked Systems (NetSys), 2013, pp. 27–34.","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.","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>","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} }","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>","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>."},"publication":"Proceedings of the Conference on Networked Systems (NetSys)","file_date_updated":"2018-03-15T10:30:42Z","project":[{"name":"SFB 901","_id":"1"},{"_id":"5","name":"SFB 901 - Subprojekt A1"},{"_id":"13","name":"SFB 901 - Subproject C1"},{"name":"SFB 901 - Project Area A","_id":"2"},{"name":"SFB 901 - Project Area C","_id":"4"}],"abstract":[{"lang":"eng","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."}],"date_created":"2017-10-17T12:42:38Z","file":[{"file_size":244841,"access_level":"closed","file_name":"546-Kalman.Graffi_CaReChord.A.Churn.Resistant.Selfstabilizing.Chord.Overlay.Network_02.pdf","date_updated":"2018-03-15T10:30:42Z","relation":"main_file","success":1,"content_type":"application/pdf","file_id":"1286","creator":"florida","date_created":"2018-03-15T10:30:42Z"}],"department":[{"_id":"79"}],"type":"conference","author":[{"first_name":"Kalman","last_name":"Graffi","full_name":"Graffi, Kalman"},{"first_name":"Markus","last_name":"Benter","full_name":"Benter, Markus"},{"full_name":"Divband, Mohammad","first_name":"Mohammad","last_name":"Divband"},{"full_name":"Kniesburges, Sebastian","first_name":"Sebastian","last_name":"Kniesburges"},{"full_name":"Koutsopoulos, Andreas","first_name":"Andreas","last_name":"Koutsopoulos"}],"status":"public","year":"2013","title":"Ca-Re-Chord: A Churn Resistant Self-stabilizing Chord Overlay Network","has_accepted_license":"1","date_updated":"2022-01-06T07:01:55Z","_id":"546","page":"27-34","ddc":["040"],"doi":"10.1109/NetSys.2013.11","user_id":"15504"},{"type":"journal_article","department":[{"_id":"274"}],"date_created":"2018-11-08T14:22:26Z","issue":"5","publication":"International Small Business Journal (ISBJ).","citation":{"ieee":"M. Baum, C. Schwens, and R. Kabst, “International as Opposed to Domestic New Venturing: The Moderating Role of Perceived Barriers to Internationalization.,” <i>International Small Business Journal (ISBJ).</i>, vol. 31, no. 5, pp. 534–560, 2013.","mla":"Baum, M., et al. “International as Opposed to Domestic New Venturing: The Moderating Role of Perceived Barriers to Internationalization.” <i>International Small Business Journal (ISBJ).</i>, vol. 31, no. 5, 2013, pp. 534–60.","apa":"Baum, M., Schwens, C., &#38; Kabst, R. (2013). International as Opposed to Domestic New Venturing: The Moderating Role of Perceived Barriers to Internationalization. <i>International Small Business Journal (ISBJ).</i>, <i>31</i>(5), 534–560.","bibtex":"@article{Baum_Schwens_Kabst_2013, title={International as Opposed to Domestic New Venturing: The Moderating Role of Perceived Barriers to Internationalization.}, volume={31}, number={5}, journal={International Small Business Journal (ISBJ).}, author={Baum, M and Schwens, C and Kabst, Rüdiger}, year={2013}, pages={534–560} }","chicago":"Baum, M, C Schwens, and Rüdiger Kabst. “International as Opposed to Domestic New Venturing: The Moderating Role of Perceived Barriers to Internationalization.” <i>International Small Business Journal (ISBJ).</i> 31, no. 5 (2013): 534–60.","short":"M. Baum, C. Schwens, R. Kabst, International Small Business Journal (ISBJ). 31 (2013) 534–560.","ama":"Baum M, Schwens C, Kabst R. International as Opposed to Domestic New Venturing: The Moderating Role of Perceived Barriers to Internationalization. <i>International Small Business Journal (ISBJ)</i>. 2013;31(5):534-560."},"user_id":"46632","volume":31,"page":"534-560","_id":"5464","language":[{"iso":"eng"}],"date_updated":"2022-01-06T07:01:55Z","intvolume":"        31","title":"International as Opposed to Domestic New Venturing: The Moderating Role of Perceived Barriers to Internationalization.","year":"2013","status":"public","author":[{"first_name":"M","last_name":"Baum","full_name":"Baum, M"},{"full_name":"Schwens, C","last_name":"Schwens","first_name":"C"},{"last_name":"Kabst","first_name":"Rüdiger","full_name":"Kabst, Rüdiger","id":"42362"}]},{"citation":{"mla":"Baum, M., and Rüdiger Kabst. “Conjoint Implications on Job Preferences: The Moderating Role of Involvement.” <i>International Journal of Human Resource Management (IJHRM).</i>, vol. 24, no. 7, 2013, pp. 1393–417.","ama":"Baum M, Kabst R. Conjoint implications on job preferences: The moderating role of involvement. <i>International Journal of Human Resource Management (IJHRM)</i>. 2013;24(7):1393-1417.","bibtex":"@article{Baum_Kabst_2013, title={Conjoint implications on job preferences: The moderating role of involvement.}, volume={24}, number={7}, journal={International Journal of Human Resource Management (IJHRM).}, author={Baum, M and Kabst, Rüdiger}, year={2013}, pages={1393–1417} }","apa":"Baum, M., &#38; Kabst, R. (2013). Conjoint implications on job preferences: The moderating role of involvement. <i>International Journal of Human Resource Management (IJHRM).</i>, <i>24</i>(7), 1393–1417.","ieee":"M. Baum and R. Kabst, “Conjoint implications on job preferences: The moderating role of involvement.,” <i>International Journal of Human Resource Management (IJHRM).</i>, vol. 24, no. 7, pp. 1393–1417, 2013.","chicago":"Baum, M, and Rüdiger Kabst. “Conjoint Implications on Job Preferences: The Moderating Role of Involvement.” <i>International Journal of Human Resource Management (IJHRM).</i> 24, no. 7 (2013): 1393–1417.","short":"M. Baum, R. Kabst, International Journal of Human Resource Management (IJHRM). 24 (2013) 1393–1417."},"publication":"International Journal of Human Resource Management (IJHRM).","issue":"7","department":[{"_id":"274"}],"type":"journal_article","date_created":"2018-11-08T14:28:07Z","intvolume":"        24","date_updated":"2022-01-06T07:01:55Z","author":[{"full_name":"Baum, M","first_name":"M","last_name":"Baum"},{"first_name":"Rüdiger","last_name":"Kabst","full_name":"Kabst, Rüdiger","id":"42362"}],"status":"public","year":"2013","title":"Conjoint implications on job preferences: The moderating role of involvement.","volume":24,"user_id":"46632","language":[{"iso":"eng"}],"_id":"5465","page":"1393-1417"},{"date_created":"2017-10-17T12:42:39Z","type":"dissertation","department":[{"_id":"66"}],"supervisor":[{"id":"107","full_name":"Engels, Gregor","last_name":"Engels","first_name":"Gregor"}],"citation":{"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>","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>.","ieee":"C. Gerth, <i>Business Process Models - Change Management</i>. Universität Paderborn, 2013.","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>.","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>","short":"C. Gerth, Business Process Models - Change Management, Universität Paderborn, 2013.","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} }"},"abstract":[{"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.","lang":"eng"}],"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt B1","_id":"9"},{"name":"SFB 901 - Project Area B","_id":"3"}],"publisher":"Universität Paderborn","_id":"547","language":[{"iso":"eng"}],"doi":"10.1007/978-3-642-38604-6","user_id":"477","title":"Business Process Models - Change Management","status":"public","year":"2013","author":[{"full_name":"Gerth, Christian","last_name":"Gerth","first_name":"Christian"}],"date_updated":"2022-01-06T07:01:55Z"},{"status":"public","year":"2013","title":"How to attract applicants in the atlantic versus the asia-pacific region? A cross-national analysis on China, India, Germany, and Hungary.","author":[{"full_name":"Baum, M","first_name":"M","last_name":"Baum"},{"full_name":"Kabst, Rüdiger","last_name":"Kabst","first_name":"Rüdiger","id":"42362"}],"date_updated":"2022-01-06T07:01:55Z","intvolume":"        48","page":"175-185","language":[{"iso":"eng"}],"_id":"5478","user_id":"46632","volume":48,"issue":"2","publication":"Journal of World Business (JWB).","citation":{"mla":"Baum, M., and Rüdiger Kabst. “How to Attract Applicants in the Atlantic versus the Asia-Pacific Region? A Cross-National Analysis on China, India, Germany, and Hungary.” <i>Journal of World Business (JWB).</i>, vol. 48, no. 2, 2013, pp. 175–85.","bibtex":"@article{Baum_Kabst_2013, title={How to attract applicants in the atlantic versus the asia-pacific region? A cross-national analysis on China, India, Germany, and Hungary.}, volume={48}, number={2}, journal={Journal of World Business (JWB).}, author={Baum, M and Kabst, Rüdiger}, year={2013}, pages={175–185} }","ama":"Baum M, Kabst R. How to attract applicants in the atlantic versus the asia-pacific region? A cross-national analysis on China, India, Germany, and Hungary. <i>Journal of World Business (JWB)</i>. 2013;48(2):175-185.","ieee":"M. Baum and R. Kabst, “How to attract applicants in the atlantic versus the asia-pacific region? A cross-national analysis on China, India, Germany, and Hungary.,” <i>Journal of World Business (JWB).</i>, vol. 48, no. 2, pp. 175–185, 2013.","apa":"Baum, M., &#38; Kabst, R. (2013). How to attract applicants in the atlantic versus the asia-pacific region? A cross-national analysis on China, India, Germany, and Hungary. <i>Journal of World Business (JWB).</i>, <i>48</i>(2), 175–185.","short":"M. Baum, R. Kabst, Journal of World Business (JWB). 48 (2013) 175–185.","chicago":"Baum, M, and Rüdiger Kabst. “How to Attract Applicants in the Atlantic versus the Asia-Pacific Region? A Cross-National Analysis on China, India, Germany, and Hungary.” <i>Journal of World Business (JWB).</i> 48, no. 2 (2013): 175–85."},"date_created":"2018-11-12T10:14:53Z","type":"journal_article","department":[{"_id":"274"}]}]