[{"abstract":[{"lang":"eng","text":"Although professional service providers increasingly deliver their services globally, little is known about cross-cultural differences in customers’ motivation to participate in service production. To address this lacuna, we survey a total of 2,284 banking customers in 11 countries on their motivation to provide personal information to, and follow the advice of, their service providers. We find differences in both aspects, but only the differences in providing personal information can be explained by the cultural values of uncertainty avoidance, individualism/collectivism, and masculinity/femininity. To perform certain tasks in the service process, global professional service providers should acknowledge cultural differences in customers’ motivations."}],"issue":"2","publication":"Schmalenbach Business Review","department":[{"_id":"181"}],"keyword":["Co-Production","Culture","Customer Participation","Professional Services"],"type":"journal_article","date_created":"2018-11-16T09:40:23Z","intvolume":"        64","article_type":"original","date_updated":"2022-01-06T07:02:37Z","publication_status":"published","author":[{"last_name":"Schumann","first_name":"Jan H","full_name":"Schumann, Jan H"},{"first_name":"Nancy","last_name":"Wünderlich","full_name":"Wünderlich, Nancy","id":"36392"},{"full_name":"Zimmer, Marcus S","first_name":"Marcus S","last_name":"Zimmer"}],"title":"Culture’s Impact on Customer Motivation to Engage in Professional Service Enactments.","year":"2012","language":[{"iso":"eng"}],"citation":{"mla":"Schumann, Jan H., et al. “Culture’s Impact on Customer Motivation to Engage in Professional Service Enactments.” <i>Schmalenbach Business Review</i>, vol. 64, no. 2, Springer, 2012, pp. 141–65.","ama":"Schumann JH, Wünderlich N, Zimmer MS. Culture’s Impact on Customer Motivation to Engage in Professional Service Enactments. <i>Schmalenbach Business Review</i>. 2012;64(2):141-165.","bibtex":"@article{Schumann_Wünderlich_Zimmer_2012, title={Culture’s Impact on Customer Motivation to Engage in Professional Service Enactments.}, volume={64}, number={2}, journal={Schmalenbach Business Review}, publisher={Springer}, author={Schumann, Jan H and Wünderlich, Nancy and Zimmer, Marcus S}, year={2012}, pages={141–165} }","apa":"Schumann, J. H., Wünderlich, N., &#38; Zimmer, M. S. (2012). Culture’s Impact on Customer Motivation to Engage in Professional Service Enactments. <i>Schmalenbach Business Review</i>, <i>64</i>(2), 141–165.","ieee":"J. H. Schumann, N. Wünderlich, and M. S. Zimmer, “Culture’s Impact on Customer Motivation to Engage in Professional Service Enactments.,” <i>Schmalenbach Business Review</i>, vol. 64, no. 2, pp. 141–165, 2012.","chicago":"Schumann, Jan H, Nancy Wünderlich, and Marcus S Zimmer. “Culture’s Impact on Customer Motivation to Engage in Professional Service Enactments.” <i>Schmalenbach Business Review</i> 64, no. 2 (2012): 141–65.","short":"J.H. Schumann, N. Wünderlich, M.S. Zimmer, Schmalenbach Business Review 64 (2012) 141–165."},"status":"public","volume":64,"user_id":"37741","_id":"5717","publisher":"Springer","page":"141-165"},{"citation":{"apa":"Schumann, J. H., Wünderlich, N., &#38; Wangenheim, F. (2012). Technology Mediation in Service Delivery: A New Typology and an Agenda for Managers and Academics. <i>Technovation</i>, <i>32</i>(2), 133–143.","ieee":"J. H. Schumann, N. Wünderlich, and F. Wangenheim, “Technology Mediation in Service Delivery: A New Typology and an Agenda for Managers and Academics.,” <i>Technovation</i>, vol. 32, no. 2, pp. 133–143, 2012.","short":"J.H. Schumann, N. Wünderlich, F. Wangenheim, Technovation 32 (2012) 133–143.","chicago":"Schumann, Jan H, Nancy Wünderlich, and Florian Wangenheim. “Technology Mediation in Service Delivery: A New Typology and an Agenda for Managers and Academics.” <i>Technovation</i> 32, no. 2 (2012): 133–43.","mla":"Schumann, Jan H., et al. “Technology Mediation in Service Delivery: A New Typology and an Agenda for Managers and Academics.” <i>Technovation</i>, vol. 32, no. 2, Elsevier, 2012, pp. 133–43.","ama":"Schumann JH, Wünderlich N, Wangenheim F. Technology Mediation in Service Delivery: A New Typology and an Agenda for Managers and Academics. <i>Technovation</i>. 2012;32(2):133-143.","bibtex":"@article{Schumann_Wünderlich_Wangenheim_2012, title={Technology Mediation in Service Delivery: A New Typology and an Agenda for Managers and Academics.}, volume={32}, number={2}, journal={Technovation}, publisher={Elsevier}, author={Schumann, Jan H and Wünderlich, Nancy and Wangenheim, Florian}, year={2012}, pages={133–143} }"},"status":"public","user_id":"37741","volume":32,"page":"133-143","publisher":"Elsevier","_id":"5718","abstract":[{"lang":"eng","text":"The role of information and communication technology for economic growth has been emphasized repeatedly. Technological breakthroughs have generated new forms of services, such as self-services or remote services. Although these encounters are qualitatively different from traditional service provision, prior service management literature thus far had paid little attention to theory development and the systematization of technology-based service encounters. To fill this research gap, the present study outlines how new types of technology-based services fit into existing service typologies and provides an extension of existing frameworks to capture their unique characteristics. These insights in turn offer managerial implications and highlight open research questions."}],"issue":"2","publication":"Technovation","type":"journal_article","keyword":["Services","Remote services","Self-services","Technology mediation"],"department":[{"_id":"181"}],"date_created":"2018-11-16T09:43:45Z","date_updated":"2022-01-06T07:02:37Z","publication_status":"published","intvolume":"        32","article_type":"original","year":"2012","title":"Technology Mediation in Service Delivery: A New Typology and an Agenda for Managers and Academics.","author":[{"last_name":"Schumann","first_name":"Jan H","full_name":"Schumann, Jan H"},{"full_name":"Wünderlich, Nancy","last_name":"Wünderlich","first_name":"Nancy","id":"36392"},{"first_name":"Florian","last_name":"Wangenheim","full_name":"Wangenheim, Florian"}],"language":[{"iso":"eng"}]},{"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt B1","_id":"9"},{"name":"SFB 901 - Project Area B","_id":"3"}],"file_date_updated":"2018-03-15T09:38:22Z","citation":{"ieee":"Z. Huma, C. Gerth, G. Engels, and O. Juwig, “Towards an Automatic Service Discovery for UML-based Rich Service Descriptions,” in <i>Proceedings of the ACM/IEEE 15th International Conference on Model Driven Engineering Languages and Systems (MoDELS)</i>, 2012, pp. 709--725.","apa":"Huma, Z., Gerth, C., Engels, G., &#38; Juwig, O. (2012). Towards an Automatic Service Discovery for UML-based Rich Service Descriptions. In <i>Proceedings of the ACM/IEEE 15th International Conference on Model Driven Engineering Languages and Systems (MoDELS)</i> (pp. 709--725). <a href=\"https://doi.org/10.1007/978-3-642-33666-9_45\">https://doi.org/10.1007/978-3-642-33666-9_45</a>","short":"Z. Huma, C. Gerth, G. Engels, O. Juwig, in: Proceedings of the ACM/IEEE 15th International Conference on Model Driven Engineering Languages and Systems (MoDELS), 2012, pp. 709--725.","chicago":"Huma, Zille, Christian Gerth, Gregor Engels, and Oliver Juwig. “Towards an Automatic Service Discovery for UML-Based Rich Service Descriptions.” In <i>Proceedings of the ACM/IEEE 15th International Conference on Model Driven Engineering Languages and Systems (MoDELS)</i>, 709--725. LNCS, 2012. <a href=\"https://doi.org/10.1007/978-3-642-33666-9_45\">https://doi.org/10.1007/978-3-642-33666-9_45</a>.","mla":"Huma, Zille, et al. “Towards an Automatic Service Discovery for UML-Based Rich Service Descriptions.” <i>Proceedings of the ACM/IEEE 15th International Conference on Model Driven Engineering Languages and Systems (MoDELS)</i>, 2012, pp. 709--725, doi:<a href=\"https://doi.org/10.1007/978-3-642-33666-9_45\">10.1007/978-3-642-33666-9_45</a>.","bibtex":"@inproceedings{Huma_Gerth_Engels_Juwig_2012, series={LNCS}, title={Towards an Automatic Service Discovery for UML-based Rich Service Descriptions}, DOI={<a href=\"https://doi.org/10.1007/978-3-642-33666-9_45\">10.1007/978-3-642-33666-9_45</a>}, booktitle={Proceedings of the ACM/IEEE 15th International Conference on Model Driven Engineering Languages and Systems (MoDELS)}, author={Huma, Zille and Gerth, Christian and Engels, Gregor and Juwig, Oliver}, year={2012}, pages={709--725}, collection={LNCS} }","ama":"Huma Z, Gerth C, Engels G, Juwig O. Towards an Automatic Service Discovery for UML-based Rich Service Descriptions. In: <i>Proceedings of the ACM/IEEE 15th International Conference on Model Driven Engineering Languages and Systems (MoDELS)</i>. LNCS. ; 2012:709--725. doi:<a href=\"https://doi.org/10.1007/978-3-642-33666-9_45\">10.1007/978-3-642-33666-9_45</a>"},"user_id":"477","ddc":["040"],"page":"709--725","_id":"572","has_accepted_license":"1","status":"public","type":"conference","department":[{"_id":"66"}],"file":[{"file_size":518982,"access_level":"closed","file_name":"572-MODELS2012-Huma_Gerth_Engels_Juwig.pdf","date_updated":"2018-03-15T09:38:22Z","relation":"main_file","content_type":"application/pdf","success":1,"file_id":"1270","creator":"florida","date_created":"2018-03-15T09:38:22Z"}],"date_created":"2017-10-17T12:42:43Z","abstract":[{"text":"Service-oriented computing (SOC) promises to solve many issues in the area of distributed software development, e.g. the realization of the loose coupling pattern in practice through service discovery and invocation. For this purpose, service descriptions must comprise structural as well as behavioral information of the services otherwise an accurate service discovery is not possible. We addressed this issue in our previous paper and proposed a UML-based rich service description language (RSDL) providing comprehensive notations to specify service requests and offers.However, the automatic matching of service requests and offers specified in a RSDL for the purpose of service discovery is a complex task, due to multifaceted heterogeneity of the service partners. This heterogeneity includes the use of different underlying ontologies or different levels of granularity in the specification itself resulting in complex mappings between service requests and offers. In this paper, we present an automatic matching mechanism for service requests and offers specified in a RSDL that overcomes the underlying heterogeneity of the service partners.","lang":"eng"}],"publication":"Proceedings of the ACM/IEEE 15th International Conference on Model Driven Engineering Languages and Systems (MoDELS)","doi":"10.1007/978-3-642-33666-9_45","language":[{"iso":"eng"}],"series_title":"LNCS","date_updated":"2022-01-06T07:02:37Z","year":"2012","title":"Towards an Automatic Service Discovery for UML-based Rich Service Descriptions","author":[{"full_name":"Huma, Zille","first_name":"Zille","last_name":"Huma"},{"last_name":"Gerth","first_name":"Christian","full_name":"Gerth, Christian"},{"first_name":"Gregor","last_name":"Engels","full_name":"Engels, Gregor","id":"107"},{"full_name":"Juwig, Oliver","first_name":"Oliver","last_name":"Juwig"}]},{"editor":[{"first_name":"Ulrich","last_name":"W. Eisenecker","full_name":"W. Eisenecker, Ulrich"},{"last_name":"Bucholdt","first_name":"Christian","full_name":"Bucholdt, Christian"}],"ddc":["040"],"user_id":"477","_id":"573","page":"23--26","has_accepted_license":"1","status":"public","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt B1","_id":"9"},{"name":"SFB 901 - Project Area B","_id":"3"}],"citation":{"ieee":"S. Arifulina, “Towards a Framework for the Integration of Modeling Languages,” in <i>Proceedings of the Doctoral Symposium of the 5th International Conference on Software Language Engineering 2012, Dresden, Germany (SLE (Doctoral Symposium))</i>, 2012, pp. 23--26.","apa":"Arifulina, S. (2012). Towards a Framework for the Integration of Modeling Languages. In U. W. Eisenecker &#38; C. Bucholdt (Eds.), <i>Proceedings of the Doctoral Symposium of the 5th International Conference on Software Language Engineering 2012, Dresden, Germany (SLE (Doctoral Symposium))</i> (pp. 23--26).","short":"S. Arifulina, in: U. W. Eisenecker, C. Bucholdt (Eds.), Proceedings of the Doctoral Symposium of the 5th International Conference on Software Language Engineering 2012, Dresden, Germany (SLE (Doctoral Symposium)), 2012, pp. 23--26.","chicago":"Arifulina, Svetlana. “Towards a Framework for the Integration of Modeling Languages.” In <i>Proceedings of the Doctoral Symposium of the 5th International Conference on Software Language Engineering 2012, Dresden, Germany (SLE (Doctoral Symposium))</i>, edited by Ulrich W. Eisenecker and Christian Bucholdt, 23--26. CEUR Workshop Proceedings, 2012.","mla":"Arifulina, Svetlana. “Towards a Framework for the Integration of Modeling Languages.” <i>Proceedings of the Doctoral Symposium of the 5th International Conference on Software Language Engineering 2012, Dresden, Germany (SLE (Doctoral Symposium))</i>, edited by Ulrich W. Eisenecker and Christian Bucholdt, 2012, pp. 23--26.","bibtex":"@inproceedings{Arifulina_2012, series={CEUR Workshop Proceedings}, title={Towards a Framework for the Integration of Modeling Languages}, booktitle={Proceedings of the Doctoral Symposium of the 5th International Conference on Software Language Engineering 2012, Dresden, Germany (SLE (Doctoral Symposium))}, author={Arifulina, Svetlana}, editor={W. Eisenecker, Ulrich and Bucholdt, ChristianEditors}, year={2012}, pages={23--26}, collection={CEUR Workshop Proceedings} }","ama":"Arifulina S. Towards a Framework for the Integration of Modeling Languages. In: W. Eisenecker U, Bucholdt C, eds. <i>Proceedings of the Doctoral Symposium of the 5th International Conference on Software Language Engineering 2012, Dresden, Germany (SLE (Doctoral Symposium))</i>. CEUR Workshop Proceedings. ; 2012:23--26."},"file_date_updated":"2018-03-15T09:37:48Z","series_title":"CEUR Workshop Proceedings","language":[{"iso":"eng"}],"date_updated":"2022-01-06T07:02:37Z","author":[{"last_name":"Arifulina","first_name":"Svetlana","full_name":"Arifulina, Svetlana"}],"title":"Towards a Framework for the Integration of Modeling Languages","year":"2012","department":[{"_id":"66"}],"type":"conference","date_created":"2017-10-17T12:42:43Z","file":[{"creator":"florida","date_created":"2018-03-15T09:37:48Z","relation":"main_file","date_updated":"2018-03-15T09:37:48Z","file_name":"573-Framework_for_Integration_of_Modeling_Languages.pdf","access_level":"closed","file_size":321930,"file_id":"1269","content_type":"application/pdf","success":1}],"abstract":[{"lang":"eng","text":"In software markets of the future, customer-specific software will be developed on demand from distributed software and hardware services available on world-wide markets. Having a request, services have to be automatically discovered and composed. For that purpose, services have to be matched based on their specifications. For the accurate matching, services have to be described comprehensively that requires the integration of different domain-specific languages (DSLs) used for functional, non-functional, and infrastructural properties. Since different service providers use plenty of language dialects to model the same service property, their integration is needed for the matching. In this paper, we propose a framework for integration of DSLs. It is based on a parameterized abstract core language that integrates key concepts needed to describe a service. Parts of the core language can be substituted with concrete DSLs. Thus, the framework serves as a basis for the comprehensive specification and automatic matching of services."}],"publication":"Proceedings of the Doctoral Symposium of the 5th International Conference on Software Language Engineering 2012, Dresden, Germany (SLE (Doctoral Symposium))"},{"project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt A1","_id":"5"},{"name":"SFB 901 - Project Area A","_id":"2"}],"citation":{"mla":"Clouser, Thomas, et al. “Tiara: A Self-Stabilizing Deterministic Skip List and Skip Graph.” <i>Theoretical Computer Science</i>, Elsevier, 2012, pp. 18–35, doi:<a href=\"https://doi.org/10.1016/j.tcs.2011.12.079\">10.1016/j.tcs.2011.12.079</a>.","ama":"Clouser T, Nesterenko M, Scheideler C. Tiara: A self-stabilizing deterministic skip list and skip graph. <i>Theoretical Computer Science</i>. 2012:18-35. doi:<a href=\"https://doi.org/10.1016/j.tcs.2011.12.079\">10.1016/j.tcs.2011.12.079</a>","bibtex":"@article{Clouser_Nesterenko_Scheideler_2012, title={Tiara: A self-stabilizing deterministic skip list and skip graph}, DOI={<a href=\"https://doi.org/10.1016/j.tcs.2011.12.079\">10.1016/j.tcs.2011.12.079</a>}, journal={Theoretical Computer Science}, publisher={Elsevier}, author={Clouser, Thomas and Nesterenko, Mikhail and Scheideler, Christian}, year={2012}, pages={18–35} }","apa":"Clouser, T., Nesterenko, M., &#38; Scheideler, C. (2012). Tiara: A self-stabilizing deterministic skip list and skip graph. <i>Theoretical Computer Science</i>, 18–35. <a href=\"https://doi.org/10.1016/j.tcs.2011.12.079\">https://doi.org/10.1016/j.tcs.2011.12.079</a>","ieee":"T. Clouser, M. Nesterenko, and C. Scheideler, “Tiara: A self-stabilizing deterministic skip list and skip graph,” <i>Theoretical Computer Science</i>, pp. 18–35, 2012.","short":"T. Clouser, M. Nesterenko, C. Scheideler, Theoretical Computer Science (2012) 18–35.","chicago":"Clouser, Thomas, Mikhail Nesterenko, and Christian Scheideler. “Tiara: A Self-Stabilizing Deterministic Skip List and Skip Graph.” <i>Theoretical Computer Science</i>, 2012, 18–35. <a href=\"https://doi.org/10.1016/j.tcs.2011.12.079\">https://doi.org/10.1016/j.tcs.2011.12.079</a>."},"file_date_updated":"2018-03-15T09:09:29Z","user_id":"477","ddc":["040"],"_id":"574","publisher":"Elsevier","page":"18-35","has_accepted_license":"1","status":"public","department":[{"_id":"79"}],"type":"journal_article","date_created":"2017-10-17T12:42:44Z","file":[{"file_name":"574-tiara.pdf","access_level":"closed","file_size":315843,"relation":"main_file","date_updated":"2018-03-15T09:09:29Z","file_id":"1268","success":1,"content_type":"application/pdf","creator":"florida","date_created":"2018-03-15T09:09:29Z"}],"abstract":[{"lang":"eng","text":"We present Tiara — a self-stabilizing peer-to-peer network maintenance algorithm. Tiara is truly deterministic which allows it to achieve exact performance bounds. Tiara allows logarithmic searches and topology updates. It is based on a novel sparse 0-1 skip list. We then describe its extension to a ringed structure and to a skip-graph.Key words: Peer-to-peer networks, overlay networks, self-stabilization."}],"publication":"Theoretical Computer Science","doi":"10.1016/j.tcs.2011.12.079","date_updated":"2022-01-06T07:02:38Z","author":[{"first_name":"Thomas","last_name":"Clouser","full_name":"Clouser, Thomas"},{"last_name":"Nesterenko","first_name":"Mikhail","full_name":"Nesterenko, Mikhail"},{"id":"20792","full_name":"Scheideler, Christian","last_name":"Scheideler","first_name":"Christian"}],"year":"2012","title":"Tiara: A self-stabilizing deterministic skip list and skip graph"},{"user_id":"15504","_id":"575","publisher":"Universität Paderborn","date_updated":"2022-01-06T07:02:38Z","author":[{"full_name":"Bremer, Lars","first_name":"Lars","last_name":"Bremer"}],"year":"2012","status":"public","title":"Symbiotic Coupling of Peer-to-Peer and Cloud Systems","type":"mastersthesis","date_created":"2017-10-17T12:42:44Z","project":[{"name":"SFB 901","_id":"1"},{"_id":"5","name":"SFB 901 - Subprojekt A1"},{"name":"SFB 901 - Project Area A","_id":"2"}],"citation":{"short":"L. Bremer, Symbiotic Coupling of Peer-to-Peer and Cloud Systems, Universität Paderborn, 2012.","chicago":"Bremer, Lars. <i>Symbiotic Coupling of Peer-to-Peer and Cloud Systems</i>. Universität Paderborn, 2012.","apa":"Bremer, L. (2012). <i>Symbiotic Coupling of Peer-to-Peer and Cloud Systems</i>. Universität Paderborn.","ieee":"L. Bremer, <i>Symbiotic Coupling of Peer-to-Peer and Cloud Systems</i>. Universität Paderborn, 2012.","ama":"Bremer L. <i>Symbiotic Coupling of Peer-to-Peer and Cloud Systems</i>. Universität Paderborn; 2012.","bibtex":"@book{Bremer_2012, title={Symbiotic Coupling of Peer-to-Peer and Cloud Systems}, publisher={Universität Paderborn}, author={Bremer, Lars}, year={2012} }","mla":"Bremer, Lars. <i>Symbiotic Coupling of Peer-to-Peer and Cloud Systems</i>. Universität Paderborn, 2012."}},{"user_id":"8447","doi":"10.1145/2446224.2446228","page":"4","language":[{"iso":"eng"}],"_id":"5753","date_updated":"2022-01-06T07:02:38Z","title":"Model-driven specification of adaptive cloud-based systems","year":"2012","status":"public","author":[{"first_name":"Benjamin","last_name":"Nagel","full_name":"Nagel, Benjamin"},{"last_name":"Gerth","first_name":"Christian","full_name":"Gerth, Christian"},{"id":"8447","first_name":"Enes","last_name":"Yigitbas","orcid":"0000-0002-5967-833X","full_name":"Yigitbas, Enes"},{"last_name":"Christ","first_name":"Fabian","full_name":"Christ, Fabian"},{"id":"107","first_name":"Gregor","last_name":"Engels","full_name":"Engels, Gregor"}],"type":"conference","department":[{"_id":"66"}],"date_created":"2018-11-19T15:18:29Z","publication":"Proceedings of the 1st International Workshop on Model-Driven Engineering for High Performance and CLoud computing co-located with 15th International Conference on Model Driven Engineering Languages and Systems {(MODELS} 2012), Innsbruck, Austria, October 01 - 05, 2012","citation":{"ieee":"B. Nagel, C. Gerth, E. Yigitbas, F. Christ, and G. Engels, “Model-driven specification of adaptive cloud-based systems,” in <i>Proceedings of the 1st International Workshop on Model-Driven Engineering for High Performance and CLoud computing co-located with 15th International Conference on Model Driven Engineering Languages and Systems {(MODELS} 2012), Innsbruck, Austria, October 01 - 05, 2012</i>, 2012, p. 4.","apa":"Nagel, B., Gerth, C., Yigitbas, E., Christ, F., &#38; Engels, G. (2012). Model-driven specification of adaptive cloud-based systems. In <i>Proceedings of the 1st International Workshop on Model-Driven Engineering for High Performance and CLoud computing co-located with 15th International Conference on Model Driven Engineering Languages and Systems {(MODELS} 2012), Innsbruck, Austria, October 01 - 05, 2012</i> (p. 4). <a href=\"https://doi.org/10.1145/2446224.2446228\">https://doi.org/10.1145/2446224.2446228</a>","chicago":"Nagel, Benjamin, Christian Gerth, Enes Yigitbas, Fabian Christ, and Gregor Engels. “Model-Driven Specification of Adaptive Cloud-Based Systems.” In <i>Proceedings of the 1st International Workshop on Model-Driven Engineering for High Performance and CLoud Computing Co-Located with 15th International Conference on Model Driven Engineering Languages and Systems {(MODELS} 2012), Innsbruck, Austria, October 01 - 05, 2012</i>, 4, 2012. <a href=\"https://doi.org/10.1145/2446224.2446228\">https://doi.org/10.1145/2446224.2446228</a>.","short":"B. Nagel, C. Gerth, E. Yigitbas, F. Christ, G. Engels, in: Proceedings of the 1st International Workshop on Model-Driven Engineering for High Performance and CLoud Computing Co-Located with 15th International Conference on Model Driven Engineering Languages and Systems {(MODELS} 2012), Innsbruck, Austria, October 01 - 05, 2012, 2012, p. 4.","mla":"Nagel, Benjamin, et al. “Model-Driven Specification of Adaptive Cloud-Based Systems.” <i>Proceedings of the 1st International Workshop on Model-Driven Engineering for High Performance and CLoud Computing Co-Located with 15th International Conference on Model Driven Engineering Languages and Systems {(MODELS} 2012), Innsbruck, Austria, October 01 - 05, 2012</i>, 2012, p. 4, doi:<a href=\"https://doi.org/10.1145/2446224.2446228\">10.1145/2446224.2446228</a>.","bibtex":"@inproceedings{Nagel_Gerth_Yigitbas_Christ_Engels_2012, title={Model-driven specification of adaptive cloud-based systems}, DOI={<a href=\"https://doi.org/10.1145/2446224.2446228\">10.1145/2446224.2446228</a>}, booktitle={Proceedings of the 1st International Workshop on Model-Driven Engineering for High Performance and CLoud computing co-located with 15th International Conference on Model Driven Engineering Languages and Systems {(MODELS} 2012), Innsbruck, Austria, October 01 - 05, 2012}, author={Nagel, Benjamin and Gerth, Christian and Yigitbas, Enes and Christ, Fabian and Engels, Gregor}, year={2012}, pages={4} }","ama":"Nagel B, Gerth C, Yigitbas E, Christ F, Engels G. Model-driven specification of adaptive cloud-based systems. In: <i>Proceedings of the 1st International Workshop on Model-Driven Engineering for High Performance and CLoud Computing Co-Located with 15th International Conference on Model Driven Engineering Languages and Systems {(MODELS} 2012), Innsbruck, Austria, October 01 - 05, 2012</i>. ; 2012:4. doi:<a href=\"https://doi.org/10.1145/2446224.2446228\">10.1145/2446224.2446228</a>"}},{"_id":"576","publisher":"Universität Paderborn","user_id":"15504","year":"2012","title":"Stereo Matching on a Convey HC-1 Hybrid Core Computer","status":"public","author":[{"full_name":"Schmitz, Henning","first_name":"Henning","last_name":"Schmitz"}],"date_updated":"2022-01-06T07:02:38Z","date_created":"2017-10-17T12:42:44Z","type":"bachelorsthesis","citation":{"short":"H. Schmitz, Stereo Matching on a Convey HC-1 Hybrid Core Computer, Universität Paderborn, 2012.","chicago":"Schmitz, Henning. <i>Stereo Matching on a Convey HC-1 Hybrid Core Computer</i>. Universität Paderborn, 2012.","apa":"Schmitz, H. (2012). <i>Stereo Matching on a Convey HC-1 Hybrid Core Computer</i>. Universität Paderborn.","ieee":"H. Schmitz, <i>Stereo Matching on a Convey HC-1 Hybrid Core Computer</i>. Universität Paderborn, 2012.","ama":"Schmitz H. <i>Stereo Matching on a Convey HC-1 Hybrid Core Computer</i>. Universität Paderborn; 2012.","bibtex":"@book{Schmitz_2012, title={Stereo Matching on a Convey HC-1 Hybrid Core Computer}, publisher={Universität Paderborn}, author={Schmitz, Henning}, year={2012} }","mla":"Schmitz, Henning. <i>Stereo Matching on a Convey HC-1 Hybrid Core Computer</i>. Universität Paderborn, 2012."},"project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt C2","_id":"14"},{"name":"SFB 901 - Project Area C","_id":"4"}]},{"department":[{"_id":"66"}],"type":"mastersthesis","date_created":"2018-11-19T15:29:59Z","citation":{"short":"E. Yigitbas, Entwicklung Eines Monitoring- Und Adaptionskonzeptes Für Geschäftsprozesse in Service-Orientierten Systemen, 2012.","chicago":"Yigitbas, Enes. <i>Entwicklung Eines Monitoring- Und Adaptionskonzeptes Für Geschäftsprozesse in Service-Orientierten Systemen</i>, 2012.","apa":"Yigitbas, E. (2012). <i>Entwicklung eines Monitoring- und Adaptionskonzeptes für Geschäftsprozesse in service-orientierten Systemen</i>.","ieee":"E. Yigitbas, <i>Entwicklung eines Monitoring- und Adaptionskonzeptes für Geschäftsprozesse in service-orientierten Systemen</i>. 2012.","ama":"Yigitbas E. <i>Entwicklung Eines Monitoring- Und Adaptionskonzeptes Für Geschäftsprozesse in Service-Orientierten Systemen</i>.; 2012.","bibtex":"@book{Yigitbas_2012, title={Entwicklung eines Monitoring- und Adaptionskonzeptes für Geschäftsprozesse in service-orientierten Systemen}, author={Yigitbas, Enes}, year={2012} }","mla":"Yigitbas, Enes. <i>Entwicklung Eines Monitoring- Und Adaptionskonzeptes Für Geschäftsprozesse in Service-Orientierten Systemen</i>. 2012."},"user_id":"8447","language":[{"iso":"eng"}],"_id":"5760","date_updated":"2022-01-06T07:02:38Z","author":[{"full_name":"Yigitbas, Enes","first_name":"Enes","last_name":"Yigitbas","orcid":"0000-0002-5967-833X","id":"8447"}],"status":"public","year":"2012","title":"Entwicklung eines Monitoring- und Adaptionskonzeptes für Geschäftsprozesse in service-orientierten Systemen"},{"date_created":"2017-10-17T12:42:44Z","file":[{"file_size":169564,"access_level":"closed","file_name":"577-SSS2012Richa-Scheideler.pdf","date_updated":"2018-03-21T13:09:19Z","relation":"main_file","success":1,"content_type":"application/pdf","file_id":"1569","creator":"florida","date_created":"2018-03-21T13:09:19Z"}],"department":[{"_id":"79"}],"type":"conference_editor","citation":{"short":"A.W. Richa, C. Scheideler, eds., Stabilization, Safety, and Security of Distributed Systems, 2012.","ama":"Richa AW, Scheideler C, eds. <i>Stabilization, Safety, and Security of Distributed Systems</i>.; 2012. doi:<a href=\"https://doi.org/10.1007/978-3-642-33536-5\">10.1007/978-3-642-33536-5</a>","chicago":"Richa, Andrea W., and Christian Scheideler, eds. <i>Stabilization, Safety, and Security of Distributed Systems</i>, 2012. <a href=\"https://doi.org/10.1007/978-3-642-33536-5\">https://doi.org/10.1007/978-3-642-33536-5</a>.","bibtex":"@book{Richa_Scheideler_2012, title={Stabilization, Safety, and Security of Distributed Systems}, DOI={<a href=\"https://doi.org/10.1007/978-3-642-33536-5\">10.1007/978-3-642-33536-5</a>}, year={2012} }","apa":"Richa, A. W., &#38; Scheideler, C. (Eds.). (2012). <i>Stabilization, Safety, and Security of Distributed Systems</i>. Presented at the Stabilization, Safety, and Security of Distributed Systems (SSS), Paderborn, Germany. <a href=\"https://doi.org/10.1007/978-3-642-33536-5\">https://doi.org/10.1007/978-3-642-33536-5</a>","mla":"Richa, Andrea W., and Christian Scheideler, editors. <i>Stabilization, Safety, and Security of Distributed Systems</i>. 2012, doi:<a href=\"https://doi.org/10.1007/978-3-642-33536-5\">10.1007/978-3-642-33536-5</a>.","ieee":"A. W. Richa and C. Scheideler, Eds., <i>Stabilization, Safety, and Security of Distributed Systems</i>. 2012."},"file_date_updated":"2018-03-21T13:09:19Z","project":[{"_id":"1","name":"SFB 901"},{"_id":"13","name":"SFB 901 - Subprojekt C1"},{"_id":"4","name":"SFB 901 - Project Area C"}],"abstract":[{"lang":"eng","text":"SSS is an international forum for researchers and practitioners in the design and development of distributed systems with self-properties: (classical) self-stabilizing, self-configuring, self-organizing, self-managing, self-repairing, self-healing, self-optimizing, self-adaptive, and self-protecting. Research in distributed systems is now at a crucialpoint in its evolution, marked by the importance of dynamic systems such as peer-to-peer networks, large-scale wireless sensor networks, mobile ad hoc networks, cloud computing, robotic networks, etc. Moreover, new applications such as grid and web services, banking and e-commerce, e-health and robotics, aerospace and avionics, automotive, industrial process control, etc. have joined the traditional applications of distributed systems. The theory of self-stabilization has been enriched in the last 30 years by high quality research contributions in the areas of algorithmic techniques, formal methodologies, model theoretic issues, and composition techniques. All these areas are essential to the understanding and maintenance of self-properties in fault-tolerant distributed systems."}],"_id":"577","editor":[{"last_name":"Richa","first_name":"Andrea W.","full_name":"Richa, Andrea W."},{"id":"20792","full_name":"Scheideler, Christian","last_name":"Scheideler","first_name":"Christian"}],"user_id":"15504","ddc":["040"],"doi":"10.1007/978-3-642-33536-5","conference":{"end_date":"2012-10-04","start_date":"2012-10-01","name":"Stabilization, Safety, and Security of Distributed Systems (SSS)","location":"Paderborn, Germany"},"status":"public","year":"2012","title":"Stabilization, Safety, and Security of Distributed Systems","has_accepted_license":"1","date_updated":"2022-01-06T07:02:39Z"},{"date_created":"2017-10-17T12:42:44Z","file":[{"creator":"florida","date_created":"2018-03-15T09:08:24Z","access_level":"closed","file_size":876927,"file_name":"578-WP48Brangewitz.pdf","date_updated":"2018-03-15T09:08:24Z","relation":"main_file","success":1,"content_type":"application/pdf","file_id":"1267"}],"department":[{"_id":"205"}],"type":"report","citation":{"chicago":"Brangewitz, Sonja, and Sarah Brockhoff. <i>Stability of Coalitional Equilibria within Repeated Tax Competition</i>. Universität Paderborn, 2012.","short":"S. Brangewitz, S. Brockhoff, Stability of Coalitional Equilibria within Repeated Tax Competition, Universität Paderborn, 2012.","apa":"Brangewitz, S., &#38; Brockhoff, S. (2012). <i>Stability of Coalitional Equilibria within Repeated Tax Competition</i>. Universität Paderborn.","ieee":"S. Brangewitz and S. Brockhoff, <i>Stability of Coalitional Equilibria within Repeated Tax Competition</i>. Universität Paderborn, 2012.","ama":"Brangewitz S, Brockhoff S. <i>Stability of Coalitional Equilibria within Repeated Tax Competition</i>. Universität Paderborn; 2012.","bibtex":"@book{Brangewitz_Brockhoff_2012, title={Stability of Coalitional Equilibria within Repeated Tax Competition}, publisher={Universität Paderborn}, author={Brangewitz, Sonja and Brockhoff, Sarah}, year={2012} }","mla":"Brangewitz, Sonja, and Sarah Brockhoff. <i>Stability of Coalitional Equilibria within Repeated Tax Competition</i>. Universität Paderborn, 2012."},"file_date_updated":"2018-03-15T09:08:24Z","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt A3","_id":"7"},{"name":"SFB 901 - Project Area A","_id":"2"}],"abstract":[{"lang":"eng","text":"This paper analyzes the stability of capital tax harmonization agreements in a stylized model where countries have formed coalitions which set a common tax rate in order to avoid the inefficient fully non-cooperative Nash equilibrium. In particular, for a given coalition structure we study to what extend the stability of tax agreements is affected by the coalitions that have formed. In our set-up, countries are symmetric, but coalitions can be of arbitrary size. We analyze stability by means of a repeated game setting employing simple trigger strategies and we allow a sub-coalition to deviate from the coalitional equilibrium. For a given form of punishment we are able to rank the stability of different coalition structures as long as the size of the largest coalition does not change. Our main results are: (1) singleton regions have the largest incentives to deviate, (2) the stability of cooperation depends on the degree of cooperative behavior ex-ante."}],"language":[{"iso":"eng"}],"_id":"578","publisher":"Universität Paderborn","user_id":"477","ddc":["040"],"author":[{"full_name":"Brangewitz, Sonja","first_name":"Sonja","last_name":"Brangewitz"},{"last_name":"Brockhoff","first_name":"Sarah","full_name":"Brockhoff, Sarah"}],"status":"public","title":"Stability of Coalitional Equilibria within Repeated Tax Competition","year":"2012","has_accepted_license":"1","date_updated":"2022-01-06T07:02:40Z"},{"ddc":["040"],"user_id":"477","_id":"579","publisher":"ACM","page":"30","has_accepted_license":"1","status":"public","project":[{"name":"SFB 901","_id":"1"},{"_id":"5","name":"SFB 901 - Subprojekt A1"},{"name":"SFB 901 - Project Area A","_id":"2"}],"citation":{"short":"V. Damerow, B. Manthey, F. Meyer auf der Heide, H. Räcke, C. Scheideler, C. Sohler, T. Tantau, Transactions on Algorithms (2012) 30.","chicago":"Damerow, Valentina, Bodo Manthey, Friedhelm Meyer auf der Heide, Harald Räcke, Christian Scheideler, Christian Sohler, and Till Tantau. “Smoothed Analysis of Left-to-Right Maxima with Applications.” <i>Transactions on Algorithms</i>, no. 3 (2012): 30. <a href=\"https://doi.org/10.1145/2229163.2229174\">https://doi.org/10.1145/2229163.2229174</a>.","ieee":"V. Damerow <i>et al.</i>, “Smoothed analysis of left-to-right maxima with applications,” <i>Transactions on Algorithms</i>, no. 3, p. 30, 2012.","apa":"Damerow, V., Manthey, B., Meyer auf der Heide, F., Räcke, H., Scheideler, C., Sohler, C., &#38; Tantau, T. (2012). Smoothed analysis of left-to-right maxima with applications. <i>Transactions on Algorithms</i>, (3), 30. <a href=\"https://doi.org/10.1145/2229163.2229174\">https://doi.org/10.1145/2229163.2229174</a>","bibtex":"@article{Damerow_Manthey_Meyer auf der Heide_Räcke_Scheideler_Sohler_Tantau_2012, title={Smoothed analysis of left-to-right maxima with applications}, DOI={<a href=\"https://doi.org/10.1145/2229163.2229174\">10.1145/2229163.2229174</a>}, number={3}, journal={Transactions on Algorithms}, publisher={ACM}, author={Damerow, Valentina and Manthey, Bodo and Meyer auf der Heide, Friedhelm and Räcke, Harald and Scheideler, Christian and Sohler, Christian and Tantau, Till}, year={2012}, pages={30} }","ama":"Damerow V, Manthey B, Meyer auf der Heide F, et al. Smoothed analysis of left-to-right maxima with applications. <i>Transactions on Algorithms</i>. 2012;(3):30. doi:<a href=\"https://doi.org/10.1145/2229163.2229174\">10.1145/2229163.2229174</a>","mla":"Damerow, Valentina, et al. “Smoothed Analysis of Left-to-Right Maxima with Applications.” <i>Transactions on Algorithms</i>, no. 3, ACM, 2012, p. 30, doi:<a href=\"https://doi.org/10.1145/2229163.2229174\">10.1145/2229163.2229174</a>."},"file_date_updated":"2018-03-15T09:04:58Z","doi":"10.1145/2229163.2229174","date_updated":"2022-01-06T07:02:41Z","author":[{"last_name":"Damerow","first_name":"Valentina","full_name":"Damerow, Valentina"},{"last_name":"Manthey","first_name":"Bodo","full_name":"Manthey, Bodo"},{"id":"15523","first_name":"Friedhelm","last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm"},{"last_name":"Räcke","first_name":"Harald","full_name":"Räcke, Harald"},{"id":"20792","first_name":"Christian","last_name":"Scheideler","full_name":"Scheideler, Christian"},{"full_name":"Sohler, Christian","last_name":"Sohler","first_name":"Christian"},{"full_name":"Tantau, Till","last_name":"Tantau","first_name":"Till"}],"year":"2012","title":"Smoothed analysis of left-to-right maxima with applications","department":[{"_id":"79"},{"_id":"63"}],"type":"journal_article","date_created":"2017-10-17T12:42:45Z","file":[{"creator":"florida","date_created":"2018-03-15T09:04:58Z","date_updated":"2018-03-15T09:04:58Z","relation":"main_file","file_size":329282,"access_level":"closed","file_name":"579-a30-damerow.pdf","content_type":"application/pdf","success":1,"file_id":"1266"}],"abstract":[{"text":"A left-to-right maximum in a sequence of n numbers s_1, …, s_n is a number that is strictly larger than all preceding numbers. In this article we present a smoothed analysis of the number of left-to-right maxima in the presence of additive random noise. We show that for every sequence of n numbers s_i ∈ [0,1] that are perturbed by uniform noise from the interval [-ε,ε], the expected number of left-to-right maxima is Θ(&sqrt;n/ε + log n) for ε>1/n. For Gaussian noise with standard deviation σ we obtain a bound of O((log3/2 n)/σ + log n).We apply our results to the analysis of the smoothed height of binary search trees and the smoothed number of comparisons in the quicksort algorithm and prove bounds of Θ(&sqrt;n/ε + log n) and Θ(n/ε+1&sqrt;n/ε + n log n), respectively, for uniform random noise from the interval [-ε,ε]. Our results can also be applied to bound the smoothed number of points on a convex hull of points in the two-dimensional plane and to smoothed motion complexity, a concept we describe in this article. We bound how often one needs to update a data structure storing the smallest axis-aligned box enclosing a set of points moving in d-dimensional space.","lang":"eng"}],"publication":"Transactions on Algorithms","issue":"3"},{"page":"218-231","_id":"580","ddc":["040"],"user_id":"477","editor":[{"full_name":"Even, Guy","last_name":"Even","first_name":"Guy"},{"full_name":"Rawitz, Dror","last_name":"Rawitz","first_name":"Dror"}],"status":"public","has_accepted_license":"1","file_date_updated":"2018-03-15T09:03:39Z","citation":{"ama":"Cord-Landwehr A, Kling P, Mallmann Trenn F. Slow Down &#38; Sleep for Profit in Online Deadline Scheduling. In: Even G, Rawitz D, eds. <i>Proceedings of the 1st Mediterranean Conference on Algorithms (MedAlg)</i>. LNCS. ; 2012:218-231. doi:<a href=\"https://doi.org/10.1007/978-3-642-34862-4_17\">10.1007/978-3-642-34862-4_17</a>","bibtex":"@inproceedings{Cord-Landwehr_Kling_Mallmann Trenn_2012, series={LNCS}, title={Slow Down &#38; Sleep for Profit in Online Deadline Scheduling}, DOI={<a href=\"https://doi.org/10.1007/978-3-642-34862-4_17\">10.1007/978-3-642-34862-4_17</a>}, booktitle={Proceedings of the 1st Mediterranean Conference on Algorithms (MedAlg)}, author={Cord-Landwehr, Andreas and Kling, Peter and Mallmann Trenn, Fredrik}, editor={Even, Guy and Rawitz, DrorEditors}, year={2012}, pages={218–231}, collection={LNCS} }","mla":"Cord-Landwehr, Andreas, et al. “Slow Down &#38; Sleep for Profit in Online Deadline Scheduling.” <i>Proceedings of the 1st Mediterranean Conference on Algorithms (MedAlg)</i>, edited by Guy Even and Dror Rawitz, 2012, pp. 218–31, doi:<a href=\"https://doi.org/10.1007/978-3-642-34862-4_17\">10.1007/978-3-642-34862-4_17</a>.","chicago":"Cord-Landwehr, Andreas, Peter Kling, and Fredrik Mallmann Trenn. “Slow Down &#38; Sleep for Profit in Online Deadline Scheduling.” In <i>Proceedings of the 1st Mediterranean Conference on Algorithms (MedAlg)</i>, edited by Guy Even and Dror Rawitz, 218–31. LNCS, 2012. <a href=\"https://doi.org/10.1007/978-3-642-34862-4_17\">https://doi.org/10.1007/978-3-642-34862-4_17</a>.","short":"A. Cord-Landwehr, P. Kling, F. Mallmann Trenn, in: G. Even, D. Rawitz (Eds.), Proceedings of the 1st Mediterranean Conference on Algorithms (MedAlg), 2012, pp. 218–231.","apa":"Cord-Landwehr, A., Kling, P., &#38; Mallmann Trenn, F. (2012). Slow Down &#38; Sleep for Profit in Online Deadline Scheduling. In G. Even &#38; D. Rawitz (Eds.), <i>Proceedings of the 1st Mediterranean Conference on Algorithms (MedAlg)</i> (pp. 218–231). <a href=\"https://doi.org/10.1007/978-3-642-34862-4_17\">https://doi.org/10.1007/978-3-642-34862-4_17</a>","ieee":"A. Cord-Landwehr, P. Kling, and F. Mallmann Trenn, “Slow Down &#38; Sleep for Profit in Online Deadline Scheduling,” in <i>Proceedings of the 1st Mediterranean Conference on Algorithms (MedAlg)</i>, 2012, pp. 218–231."},"project":[{"name":"SFB 901","_id":"1"},{"_id":"14","name":"SFB 901 - Subprojekt C2"},{"_id":"16","name":"SFB 901 - Subproject C4"},{"name":"SFB 901 - Project Area C","_id":"4"}],"language":[{"iso":"eng"}],"series_title":"LNCS","doi":"10.1007/978-3-642-34862-4_17","title":"Slow Down & Sleep for Profit in Online Deadline Scheduling","year":"2012","author":[{"full_name":"Cord-Landwehr, Andreas","last_name":"Cord-Landwehr","first_name":"Andreas"},{"full_name":"Kling, Peter","last_name":"Kling","first_name":"Peter"},{"last_name":"Mallmann Trenn","first_name":"Fredrik","full_name":"Mallmann Trenn, Fredrik"}],"date_updated":"2022-01-06T07:02:42Z","file":[{"file_id":"1265","content_type":"application/pdf","success":1,"file_name":"580-P._Kling__F._Mallmann-Trenn__A._Cord-Landwehr_-_Slow_Down___Sleep_for_Profit_in_Online_Deadline_Scheduling.pdf","file_size":325939,"access_level":"closed","relation":"main_file","date_updated":"2018-03-15T09:03:39Z","date_created":"2018-03-15T09:03:39Z","creator":"florida"}],"date_created":"2017-10-17T12:42:45Z","type":"conference","department":[{"_id":"63"}],"publication":"Proceedings of the 1st Mediterranean Conference on Algorithms (MedAlg)","abstract":[{"text":"We present and study a new model for energy-aware and profit-oriented scheduling on a single processor.The processor features dynamic speed scaling as well as suspension to a sleep mode.Jobs arrive over time, are preemptable, and have different sizes, values, and deadlines.On the arrival of a new job, the scheduler may either accept or reject the job.Accepted jobs need a certain energy investment to be finished in time, while rejected jobs cause costs equal to their values.Here, power consumption at speed $s$ is given by $P(s)=s^{\\alpha}+\\beta$ and the energy investment is power integrated over time.Additionally, the scheduler may decide to suspend the processor to a sleep mode in which no energy is consumed, though awaking entails fixed transition costs $\\gamma$.The objective is to minimize the total value of rejected jobs plus the total energy.Our model combines aspects from advanced energy conservation techniques (namely speed scaling and sleep states) and profit-oriented scheduling models.We show that \\emph{rejection-oblivious} schedulers (whose rejection decisions are not based on former decisions) have – in contrast to the model without sleep states – an unbounded competitive ratio.It turns out that the jobs' value densities (the ratio between a job's value and its work) are crucial for the performance of such schedulers.We give an algorithm whose competitiveness nearly matches the lower bound w.r.t\\text{.} the maximum value density.If the maximum value density is not too large, the competitiveness becomes $\\alpha^{\\alpha}+2e\\alpha$.Also, we show that it suffices to restrict the value density of low-value jobs only.Using a technique from \\cite{Chan:2010} we transfer our results to processors with a fixed maximum speed.","lang":"eng"}]},{"date_updated":"2022-01-06T07:02:42Z","year":"2012","title":"Self-Organizing Particle Systems","author":[{"full_name":"Drees, Maximilian","first_name":"Maximilian","last_name":"Drees"},{"full_name":"Hüllmann (married name: Eikel), Martina","first_name":"Martina","last_name":"Hüllmann (married name: Eikel)"},{"last_name":"Koutsopoulos","first_name":"Andreas","full_name":"Koutsopoulos, Andreas"},{"id":"20792","first_name":"Christian","last_name":"Scheideler","full_name":"Scheideler, Christian"}],"doi":"10.1109/IPDPS.2012.116","language":[{"iso":"eng"}],"abstract":[{"lang":"eng","text":"Nanoparticles are getting more and more in the focus of the scientic community since the potential for the development of very small particles interacting with each other and completing medical and other tasks is getting bigger year by year. In this work we introduce a distributed local algorithm for arranging a set of nanoparticles on the discrete plane into specic geometric shapes, for instance a rectangle. The concept of a particle we use can be seen as a simple mobile robot with the following restrictions: it can only view the state of robots it is physically connected to, is anonymous, has only a constant size memory, can only move by using other particles as an anchor point on which it pulls itself alongside, and it operates in Look-Compute-Move cycles. The main result of this work is the presentation of a random distributed local algorithm which transforms any given connected set of particles into a particular geometric shape. As an example we provide a version of this algorithm for forming a rectangle with an arbitrary predened aspect ratio. To the best of our knowledge this is the rst work that considers arrangement problems for these types of robots."}],"publication":"Proceedings of the 26th IEEE International Parallel and Distributed Processing Symposium (IPDPS)","type":"conference","department":[{"_id":"79"},{"_id":"63"}],"file":[{"creator":"florida","date_created":"2018-03-15T08:39:33Z","file_size":373131,"access_level":"closed","file_name":"581-IPDPS2012-Scheideler_Huellmann.pdf","date_updated":"2018-03-15T08:39:33Z","relation":"main_file","success":1,"content_type":"application/pdf","file_id":"1263"}],"date_created":"2017-10-17T12:42:45Z","has_accepted_license":"1","status":"public","ddc":["040"],"user_id":"14955","page":"1272-1283","_id":"581","project":[{"name":"SFB 901","_id":"1"},{"_id":"13","name":"SFB 901 - Subprojekt C1"},{"_id":"4","name":"SFB 901 - Project Area C"}],"file_date_updated":"2018-03-15T08:39:33Z","citation":{"chicago":"Drees, Maximilian, Martina Hüllmann (married name: Eikel), Andreas Koutsopoulos, and Christian Scheideler. “Self-Organizing Particle Systems.” In <i>Proceedings of the 26th IEEE International Parallel and Distributed Processing Symposium (IPDPS)</i>, 1272–83, 2012. <a href=\"https://doi.org/10.1109/IPDPS.2012.116\">https://doi.org/10.1109/IPDPS.2012.116</a>.","short":"M. Drees, M. Hüllmann (married name: Eikel), A. Koutsopoulos, C. Scheideler, in: Proceedings of the 26th IEEE International Parallel and Distributed Processing Symposium (IPDPS), 2012, pp. 1272–1283.","apa":"Drees, M., Hüllmann (married name: Eikel), M., Koutsopoulos, A., &#38; Scheideler, C. (2012). Self-Organizing Particle Systems. In <i>Proceedings of the 26th IEEE International Parallel and Distributed Processing Symposium (IPDPS)</i> (pp. 1272–1283). <a href=\"https://doi.org/10.1109/IPDPS.2012.116\">https://doi.org/10.1109/IPDPS.2012.116</a>","ieee":"M. Drees, M. Hüllmann (married name: Eikel), A. Koutsopoulos, and C. Scheideler, “Self-Organizing Particle Systems,” in <i>Proceedings of the 26th IEEE International Parallel and Distributed Processing Symposium (IPDPS)</i>, 2012, pp. 1272–1283.","ama":"Drees M, Hüllmann (married name: Eikel) M, Koutsopoulos A, Scheideler C. Self-Organizing Particle Systems. In: <i>Proceedings of the 26th IEEE International Parallel and Distributed Processing Symposium (IPDPS)</i>. ; 2012:1272-1283. doi:<a href=\"https://doi.org/10.1109/IPDPS.2012.116\">10.1109/IPDPS.2012.116</a>","bibtex":"@inproceedings{Drees_Hüllmann (married name: Eikel)_Koutsopoulos_Scheideler_2012, title={Self-Organizing Particle Systems}, DOI={<a href=\"https://doi.org/10.1109/IPDPS.2012.116\">10.1109/IPDPS.2012.116</a>}, booktitle={Proceedings of the 26th IEEE International Parallel and Distributed Processing Symposium (IPDPS)}, author={Drees, Maximilian and Hüllmann (married name: Eikel), Martina and Koutsopoulos, Andreas and Scheideler, Christian}, year={2012}, pages={1272–1283} }","mla":"Drees, Maximilian, et al. “Self-Organizing Particle Systems.” <i>Proceedings of the 26th IEEE International Parallel and Distributed Processing Symposium (IPDPS)</i>, 2012, pp. 1272–83, doi:<a href=\"https://doi.org/10.1109/IPDPS.2012.116\">10.1109/IPDPS.2012.116</a>."}},{"author":[{"last_name":"Strothmann","first_name":"Thim Frederik","full_name":"Strothmann, Thim Frederik","id":"11319"}],"status":"public","title":"Self-Optimizing Binary Search Trees - A Game Theoretic Approach","year":"2012","date_updated":"2022-01-06T07:02:42Z","_id":"582","publisher":"Universität Paderborn","language":[{"iso":"eng"}],"user_id":"477","citation":{"bibtex":"@book{Strothmann_2012, title={Self-Optimizing Binary Search Trees - A Game Theoretic Approach}, publisher={Universität Paderborn}, author={Strothmann, Thim Frederik}, year={2012} }","short":"T.F. Strothmann, Self-Optimizing Binary Search Trees - A Game Theoretic Approach, Universität Paderborn, 2012.","ama":"Strothmann TF. <i>Self-Optimizing Binary Search Trees - A Game Theoretic Approach</i>. Universität Paderborn; 2012.","chicago":"Strothmann, Thim Frederik. <i>Self-Optimizing Binary Search Trees - A Game Theoretic Approach</i>. Universität Paderborn, 2012.","ieee":"T. F. Strothmann, <i>Self-Optimizing Binary Search Trees - A Game Theoretic Approach</i>. Universität Paderborn, 2012.","mla":"Strothmann, Thim Frederik. <i>Self-Optimizing Binary Search Trees - A Game Theoretic Approach</i>. Universität Paderborn, 2012.","apa":"Strothmann, T. F. (2012). <i>Self-Optimizing Binary Search Trees - A Game Theoretic Approach</i>. Universität Paderborn."},"project":[{"_id":"1","name":"SFB 901"},{"_id":"5","name":"SFB 901 - Subprojekt A1"},{"name":"SFB 901 - Project Area A","_id":"2"}],"date_created":"2017-10-17T12:42:45Z","department":[{"_id":"79"}],"type":"mastersthesis"},{"date_updated":"2022-01-06T07:02:43Z","year":"2012","title":"Revenue-maximizing Order of Sale in Sequential Auctions","status":"public","author":[{"last_name":"Drücker","first_name":"Julian","full_name":"Drücker, Julian"}],"user_id":"15504","_id":"583","publisher":"Universität Paderborn","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt A3","_id":"7"},{"name":"SFB 901 - Project Area A","_id":"2"}],"citation":{"short":"J. Drücker, Revenue-Maximizing Order of Sale in Sequential Auctions, Universität Paderborn, 2012.","chicago":"Drücker, Julian. <i>Revenue-Maximizing Order of Sale in Sequential Auctions</i>. Universität Paderborn, 2012.","ieee":"J. Drücker, <i>Revenue-maximizing Order of Sale in Sequential Auctions</i>. Universität Paderborn, 2012.","apa":"Drücker, J. (2012). <i>Revenue-maximizing Order of Sale in Sequential Auctions</i>. Universität Paderborn.","bibtex":"@book{Drücker_2012, title={Revenue-maximizing Order of Sale in Sequential Auctions}, publisher={Universität Paderborn}, author={Drücker, Julian}, year={2012} }","ama":"Drücker J. <i>Revenue-Maximizing Order of Sale in Sequential Auctions</i>. Universität Paderborn; 2012.","mla":"Drücker, Julian. <i>Revenue-Maximizing Order of Sale in Sequential Auctions</i>. Universität Paderborn, 2012."},"type":"mastersthesis","date_created":"2017-10-17T12:42:45Z"},{"_id":"584","publisher":"Universität Paderborn","user_id":"15504","title":"Queuing Latency at Cooperative Base Stations","year":"2012","status":"public","author":[{"full_name":"Hohenberger, Till","first_name":"Till","last_name":"Hohenberger"}],"date_updated":"2022-01-06T07:02:43Z","date_created":"2017-10-17T12:42:46Z","type":"bachelorsthesis","department":[{"_id":"75"}],"citation":{"short":"T. Hohenberger, Queuing Latency at Cooperative Base Stations, Universität Paderborn, 2012.","chicago":"Hohenberger, Till. <i>Queuing Latency at Cooperative Base Stations</i>. Universität Paderborn, 2012.","ieee":"T. Hohenberger, <i>Queuing Latency at Cooperative Base Stations</i>. Universität Paderborn, 2012.","apa":"Hohenberger, T. (2012). <i>Queuing Latency at Cooperative Base Stations</i>. Universität Paderborn.","bibtex":"@book{Hohenberger_2012, title={Queuing Latency at Cooperative Base Stations}, publisher={Universität Paderborn}, author={Hohenberger, Till}, year={2012} }","ama":"Hohenberger T. <i>Queuing Latency at Cooperative Base Stations</i>. Universität Paderborn; 2012.","mla":"Hohenberger, Till. <i>Queuing Latency at Cooperative Base Stations</i>. Universität Paderborn, 2012."},"project":[{"name":"SFB 901","_id":"1"},{"_id":"6","name":"SFB 901 - Subprojekt A2"},{"_id":"2","name":"SFB 901 - Project Area A"}]},{"file_date_updated":"2018-03-15T08:38:58Z","publication":"Proceedings of 4th International Symposium on Cyberspace Safety and Security (CSS)","citation":{"mla":"Petrlic, Ronald. “Proxy Re-Encryption in a Privacy-Preserving Cloud Computing DRM Scheme.” <i>Proceedings of 4th International Symposium on Cyberspace Safety and Security (CSS)</i>, 2012, pp. 194–211, doi:<a href=\"https://doi.org/10.1007/978-3-642-35362-8_16\">10.1007/978-3-642-35362-8_16</a>.","apa":"Petrlic, R. (2012). Proxy Re-Encryption in a Privacy-Preserving Cloud Computing DRM Scheme. In <i>Proceedings of 4th International Symposium on Cyberspace Safety and Security (CSS)</i> (pp. 194–211). <a href=\"https://doi.org/10.1007/978-3-642-35362-8_16\">https://doi.org/10.1007/978-3-642-35362-8_16</a>","ieee":"R. Petrlic, “Proxy Re-Encryption in a Privacy-Preserving Cloud Computing DRM Scheme,” in <i>Proceedings of 4th International Symposium on Cyberspace Safety and Security (CSS)</i>, 2012, pp. 194–211.","ama":"Petrlic R. Proxy Re-Encryption in a Privacy-Preserving Cloud Computing DRM Scheme. In: <i>Proceedings of 4th International Symposium on Cyberspace Safety and Security (CSS)</i>. LNCS. ; 2012:194-211. doi:<a href=\"https://doi.org/10.1007/978-3-642-35362-8_16\">10.1007/978-3-642-35362-8_16</a>","short":"R. Petrlic, in: Proceedings of 4th International Symposium on Cyberspace Safety and Security (CSS), 2012, pp. 194–211.","chicago":"Petrlic, Ronald. “Proxy Re-Encryption in a Privacy-Preserving Cloud Computing DRM Scheme.” In <i>Proceedings of 4th International Symposium on Cyberspace Safety and Security (CSS)</i>, 194–211. LNCS, 2012. <a href=\"https://doi.org/10.1007/978-3-642-35362-8_16\">https://doi.org/10.1007/978-3-642-35362-8_16</a>.","bibtex":"@inproceedings{Petrlic_2012, series={LNCS}, title={Proxy Re-Encryption in a Privacy-Preserving Cloud Computing DRM Scheme}, DOI={<a href=\"https://doi.org/10.1007/978-3-642-35362-8_16\">10.1007/978-3-642-35362-8_16</a>}, booktitle={Proceedings of 4th International Symposium on Cyberspace Safety and Security (CSS)}, author={Petrlic, Ronald}, year={2012}, pages={194–211}, collection={LNCS} }"},"abstract":[{"text":"In a cloud-computing scenario where users buy software from software providers and execute it at computing centers, a digital rights management (DRM) system has to be in place to check the software licenses during each software execution. However, the exposure of users to privacy invasion in the presence of DRM systems is problematic.We come up with a concept that unites software providers' and users' demands for a secure and privacy-preserving DRM system for cloud computing. The employment of proxy re-encryption allows for a prevention of profile building (under pseudonym) of users by any party.","lang":"eng"}],"project":[{"_id":"1","name":"SFB 901"},{"_id":"13","name":"SFB 901 - Subprojekt C1"},{"name":"SFB 901 - Project Area C","_id":"4"}],"file":[{"success":1,"content_type":"application/pdf","file_id":"1262","access_level":"closed","file_size":582557,"file_name":"585-privacy-drm-cloud-1-css-camera-ready.pdf","date_updated":"2018-03-15T08:38:58Z","relation":"main_file","date_created":"2018-03-15T08:38:58Z","creator":"florida"}],"date_created":"2017-10-17T12:42:46Z","type":"conference","title":"Proxy Re-Encryption in a Privacy-Preserving Cloud Computing DRM Scheme","status":"public","year":"2012","author":[{"full_name":"Petrlic, Ronald","first_name":"Ronald","last_name":"Petrlic"}],"date_updated":"2022-01-06T07:02:43Z","has_accepted_license":"1","page":"194-211","_id":"585","series_title":"LNCS","user_id":"15504","doi":"10.1007/978-3-642-35362-8_16","ddc":["040"]},{"abstract":[{"text":"FPGAs, systems on chip and embedded systems are nowadays irreplaceable. They combine the computational power of application specific hardware with software-like flexibility. At runtime, they can adjust their functionality by downloading new hardware modules and integrating their functionality. Due to their growing capabilities, the demands made to reconfigurable hardware grow. Their deployment in increasingly security critical scenarios requires new ways of enforcing security since a failure in security has severe consequences. Aside from financial losses, a loss of human life and risks to national security are possible. With this work I present the novel and groundbreaking concept of proof-carrying hardware. It is a method for the verification of properties of hardware modules to guarantee security for a target platform at runtime. The producer of a hardware module delivers based on the consumer's safety policy a safety proof in combination with the reconfiguration bitstream. The extensive computation of a proof is a contrast to the comparatively undemanding checking of the proof. I present a prototype based on open-source tools and an abstract FPGA architecture and bitstream format. The proof of the usability of proof-carrying hardware provides the evaluation of the prototype with the exemplary application of securing combinational and bounded sequential equivalence of reference monitor modules for memory safety.","lang":"eng"},{"text":"FPGAs, System on Chips und eingebettete Systeme sind heutzutage kaum mehr wegzudenken. Sie kombinieren die Rechenleistung von spezialisierter Hardware mit einer Software-ähnlichen Flexibilität. Zur Laufzeit können sie ihre Funktionalität anpassen, indem sie online neue Hardware Module beziehen und deren Funktionalität integrieren. Mit der Leistung wachsen auch die Anforderungen an rekonfigurierbare Hardware. Ihr Einsatz in immer sicherheitskritischeren Szenarien erfordert neue Wege um Sicherheit zu gewährleisten, da ein Versagen der Sicherheit gravierende Folgen mit sich bringt. Neben finanziellen Verlusten sind auch der Verlust von Menschenleben oder Einbußen in der nationalen Sicherheit denkbar. In dieser Arbeit stelle ich das neue und wegweisende Konzept der beweistragenden Hardware vor. Es ist eine Methode zur Verifizierung von Eigenschaften von Hardware Modulen um die Sicherheit der Zielplatformen zur Laufzeit zu garantieren. Der Produzent eines Hardware Moduls liefert, basierend auf den Sicherheitsbestimmungen des Konsumenten, einen Beweis der Sicherheit mit dem Rekonfigurierungsbitstrom. Die aufwendige Berechnung des Beweises steht im Kontrast zu der vergleichsweise unaufwendigen Überprüfung durch den Konsumenten. Ich präsentiere einen Prototypen basierend auf Open Source Werkzeugen und einer eigenen abstrakten FPGA Architektur samt Bitstromformat. Den Nachweis über die Nutzbarkeit von beweistragender Hardware erbringt die Evaluierung des Prototypen zur beispielhaften Anwendung der Sicherung von kombinatorischer und begrenzt sequenzieller Äquivalenz von Referenzmonitor-Modulen zur Speichersicherheit.","lang":"ger"}],"file":[{"date_created":"2018-03-15T08:38:19Z","creator":"florida","content_type":"application/pdf","success":1,"file_id":"1261","date_updated":"2018-03-15T08:38:19Z","relation":"main_file","file_size":1438436,"access_level":"closed","file_name":"586-Drzevitzky-PhD_01.pdf"}],"date_created":"2017-10-17T12:42:46Z","type":"dissertation","department":[{"_id":"78"}],"year":"2012","title":"Proof-Carrying Hardware: A Novel Approach to Reconfigurable Hardware Security","author":[{"full_name":"Drzevitzky, Stephanie","last_name":"Drzevitzky","first_name":"Stephanie"}],"publication_status":"published","date_updated":"2022-01-06T07:02:44Z","main_file_link":[{"open_access":"1","url":"https://nbn-resolving.de/urn:nbn:de:hbz:466:2-10423"}],"language":[{"iso":"eng"}],"file_date_updated":"2018-03-15T08:38:19Z","citation":{"bibtex":"@book{Drzevitzky_2012, title={Proof-Carrying Hardware: A Novel Approach to Reconfigurable Hardware Security}, publisher={Universität Paderborn}, author={Drzevitzky, Stephanie}, year={2012} }","ama":"Drzevitzky S. <i>Proof-Carrying Hardware: A Novel Approach to Reconfigurable Hardware Security</i>. Universität Paderborn; 2012.","mla":"Drzevitzky, Stephanie. <i>Proof-Carrying Hardware: A Novel Approach to Reconfigurable Hardware Security</i>. Universität Paderborn, 2012.","chicago":"Drzevitzky, Stephanie. <i>Proof-Carrying Hardware: A Novel Approach to Reconfigurable Hardware Security</i>. Universität Paderborn, 2012.","short":"S. Drzevitzky, Proof-Carrying Hardware: A Novel Approach to Reconfigurable Hardware Security, Universität Paderborn, 2012.","ieee":"S. Drzevitzky, <i>Proof-Carrying Hardware: A Novel Approach to Reconfigurable Hardware Security</i>. Universität Paderborn, 2012.","apa":"Drzevitzky, S. (2012). <i>Proof-Carrying Hardware: A Novel Approach to Reconfigurable Hardware Security</i>. Universität Paderborn."},"supervisor":[{"id":"398","last_name":"Platzner","first_name":"Marco","full_name":"Platzner, Marco"}],"project":[{"_id":"12","name":"SFB 901 - Subprojekt B4"},{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area B","_id":"3"}],"oa":"1","status":"public","has_accepted_license":"1","page":"114","_id":"586","publisher":"Universität Paderborn","user_id":"477","ddc":["040"]},{"citation":{"bibtex":"@book{Plessl_Platzner_Agne_Happe_Lübbers_2012, title={Programming models for reconfigurable heterogeneous multi-cores}, publisher={Awareness Magazine}, author={Plessl, Christian and Platzner, Marco and Agne, Andreas and Happe, Markus and Lübbers, Enno}, year={2012} }","ama":"Plessl C, Platzner M, Agne A, Happe M, Lübbers E. <i>Programming Models for Reconfigurable Heterogeneous Multi-Cores</i>. Awareness Magazine; 2012.","mla":"Plessl, Christian, et al. <i>Programming Models for Reconfigurable Heterogeneous Multi-Cores</i>. Awareness Magazine, 2012.","chicago":"Plessl, Christian, Marco Platzner, Andreas Agne, Markus Happe, and Enno Lübbers. <i>Programming Models for Reconfigurable Heterogeneous Multi-Cores</i>. Awareness Magazine, 2012.","short":"C. Plessl, M. Platzner, A. Agne, M. Happe, E. Lübbers, Programming Models for Reconfigurable Heterogeneous Multi-Cores, Awareness Magazine, 2012.","ieee":"C. Plessl, M. Platzner, A. Agne, M. Happe, and E. Lübbers, <i>Programming models for reconfigurable heterogeneous multi-cores</i>. Awareness Magazine, 2012.","apa":"Plessl, C., Platzner, M., Agne, A., Happe, M., &#38; Lübbers, E. (2012). <i>Programming models for reconfigurable heterogeneous multi-cores</i>. Awareness Magazine."},"file_date_updated":"2018-03-15T08:37:02Z","project":[{"_id":"1","name":"SFB 901"},{"_id":"14","name":"SFB 901 - Subprojekt C2"},{"_id":"4","name":"SFB 901 - Project Area C"}],"date_created":"2017-10-17T12:42:46Z","file":[{"date_created":"2018-03-15T08:37:02Z","creator":"florida","file_id":"1260","content_type":"application/pdf","success":1,"file_name":"587-2012_plessl_awareness_magazine.pdf","access_level":"closed","file_size":353057,"relation":"main_file","date_updated":"2018-03-15T08:37:02Z"}],"department":[{"_id":"27"},{"_id":"518"},{"_id":"78"}],"type":"misc","author":[{"last_name":"Plessl","first_name":"Christian","orcid":"0000-0001-5728-9982","full_name":"Plessl, Christian","id":"16153"},{"id":"398","full_name":"Platzner, Marco","first_name":"Marco","last_name":"Platzner"},{"full_name":"Agne, Andreas","last_name":"Agne","first_name":"Andreas"},{"last_name":"Happe","first_name":"Markus","full_name":"Happe, Markus"},{"full_name":"Lübbers, Enno","first_name":"Enno","last_name":"Lübbers"}],"status":"public","year":"2012","title":"Programming models for reconfigurable heterogeneous multi-cores","has_accepted_license":"1","date_updated":"2022-01-06T07:02:44Z","_id":"587","language":[{"iso":"eng"}],"publisher":"Awareness Magazine","user_id":"398","ddc":["040"]}]