[{"date_created":"2021-06-15T11:08:42Z","author":[{"last_name":"Adelt","full_name":"Adelt, Philipp","first_name":"Philipp"},{"full_name":"Esau, Natascha","last_name":"Esau","first_name":"Natascha"},{"full_name":"Hölscher, Christian","last_name":"Hölscher","first_name":"Christian"},{"first_name":"Bernd","last_name":"Kleinjohann","full_name":"Kleinjohann, Bernd"},{"first_name":"Lisa","full_name":"Kleinjohann, Lisa","last_name":"Kleinjohann"},{"full_name":"Krüger, Martin","last_name":"Krüger","first_name":"Martin"},{"id":"604","full_name":"Zimmer, Detmar","last_name":"Zimmer","first_name":"Detmar"}],"publisher":"InTech","date_updated":"2022-01-06T06:55:31Z","doi":"10.5772/15451","title":"Hybrid Planning for Self-Optimization in Railbound Mechatronic Systems","publication_identifier":{"isbn":["978-953-307-300-2"]},"citation":{"short":"P. Adelt, N. Esau, C. Hölscher, B. Kleinjohann, L. Kleinjohann, M. Krüger, D. Zimmer, Hybrid Planning for Self-Optimization in Railbound Mechatronic Systems, InTech, 2011.","mla":"Adelt, Philipp, et al. <i>Hybrid Planning for Self-Optimization in Railbound Mechatronic Systems</i>. InTech, 2011, pp. 169–94, doi:<a href=\"https://doi.org/10.5772/15451\">10.5772/15451</a>.","bibtex":"@book{Adelt_Esau_Hölscher_Kleinjohann_Kleinjohann_Krüger_Zimmer_2011, title={Hybrid Planning for Self-Optimization in Railbound Mechatronic Systems}, DOI={<a href=\"https://doi.org/10.5772/15451\">10.5772/15451</a>}, publisher={InTech}, author={Adelt, Philipp and Esau, Natascha and Hölscher, Christian and Kleinjohann, Bernd and Kleinjohann, Lisa and Krüger, Martin and Zimmer, Detmar}, year={2011}, pages={169–194} }","apa":"Adelt, P., Esau, N., Hölscher, C., Kleinjohann, B., Kleinjohann, L., Krüger, M., &#38; Zimmer, D. (2011). <i>Hybrid Planning for Self-Optimization in Railbound Mechatronic Systems</i> (pp. 169–194). InTech. <a href=\"https://doi.org/10.5772/15451\">https://doi.org/10.5772/15451</a>","ama":"Adelt P, Esau N, Hölscher C, et al. <i>Hybrid Planning for Self-Optimization in Railbound Mechatronic Systems</i>. InTech; 2011:169-194. doi:<a href=\"https://doi.org/10.5772/15451\">10.5772/15451</a>","ieee":"P. Adelt <i>et al.</i>, <i>Hybrid Planning for Self-Optimization in Railbound Mechatronic Systems</i>. InTech, 2011, pp. 169–194.","chicago":"Adelt, Philipp, Natascha Esau, Christian Hölscher, Bernd Kleinjohann, Lisa Kleinjohann, Martin Krüger, and Detmar Zimmer. <i>Hybrid Planning for Self-Optimization in Railbound Mechatronic Systems</i>. InTech, 2011. <a href=\"https://doi.org/10.5772/15451\">https://doi.org/10.5772/15451</a>."},"page":"169-194","year":"2011","user_id":"38077","department":[{"_id":"9"},{"_id":"146"}],"_id":"22362","language":[{"iso":"eng"}],"type":"book","status":"public"},{"citation":{"apa":"Arens, S., Bolte, M., &#38; Domik, G. (2011). Seamless Integration of Multimodal Shader Compositing into a Flexible Ray Casting Pipeline. In P. Eisert, J. Hornegger, &#38; K. Polthier (Eds.), <i>Vision, Modeling, and Visualization (2011)</i>. The Eurographics Association. <a href=\"https://doi.org/10.2312/PE/VMV/VMV11/347-352\">https://doi.org/10.2312/PE/VMV/VMV11/347-352</a>","bibtex":"@inproceedings{Arens_Bolte_Domik_2011, title={Seamless Integration of Multimodal Shader Compositing into a Flexible Ray Casting Pipeline}, DOI={<a href=\"https://doi.org/10.2312/PE/VMV/VMV11/347-352\">10.2312/PE/VMV/VMV11/347-352</a>}, booktitle={Vision, Modeling, and Visualization (2011)}, publisher={The Eurographics Association}, author={Arens, Stephan and Bolte, Matthias and Domik, Gitta}, editor={Eisert, Peter and Hornegger, Joachim and Polthier, KonradEditors}, year={2011} }","short":"S. Arens, M. Bolte, G. Domik, in: P. Eisert, J. Hornegger, K. Polthier (Eds.), Vision, Modeling, and Visualization (2011), The Eurographics Association, 2011.","mla":"Arens, Stephan, et al. “Seamless Integration of Multimodal Shader Compositing into a Flexible Ray Casting Pipeline.” <i>Vision, Modeling, and Visualization (2011)</i>, edited by Peter Eisert et al., The Eurographics Association, 2011, doi:<a href=\"https://doi.org/10.2312/PE/VMV/VMV11/347-352\">10.2312/PE/VMV/VMV11/347-352</a>.","ama":"Arens S, Bolte M, Domik G. Seamless Integration of Multimodal Shader Compositing into a Flexible Ray Casting Pipeline. In: Eisert P, Hornegger J, Polthier K, eds. <i>Vision, Modeling, and Visualization (2011)</i>. The Eurographics Association; 2011. doi:<a href=\"https://doi.org/10.2312/PE/VMV/VMV11/347-352\">10.2312/PE/VMV/VMV11/347-352</a>","chicago":"Arens, Stephan, Matthias Bolte, and Gitta Domik. “Seamless Integration of Multimodal Shader Compositing into a Flexible Ray Casting Pipeline.” In <i>Vision, Modeling, and Visualization (2011)</i>, edited by Peter Eisert, Joachim Hornegger, and Konrad Polthier. The Eurographics Association, 2011. <a href=\"https://doi.org/10.2312/PE/VMV/VMV11/347-352\">https://doi.org/10.2312/PE/VMV/VMV11/347-352</a>.","ieee":"S. Arens, M. Bolte, and G. Domik, “Seamless Integration of Multimodal Shader Compositing into a Flexible Ray Casting Pipeline,” in <i>Vision, Modeling, and Visualization (2011)</i>, 2011."},"year":"2011","publication_identifier":{"isbn":["978-3-905673-85-2"]},"doi":"10.2312/PE/VMV/VMV11/347-352","title":"Seamless Integration of Multimodal Shader Compositing into a Flexible Ray Casting Pipeline","date_created":"2021-04-25T16:35:59Z","author":[{"first_name":"Stephan","last_name":"Arens","full_name":"Arens, Stephan"},{"last_name":"Bolte","full_name":"Bolte, Matthias","first_name":"Matthias"},{"first_name":"Gitta","last_name":"Domik","id":"90","full_name":"Domik, Gitta"}],"publisher":"The Eurographics Association","date_updated":"2022-01-06T06:55:13Z","status":"public","editor":[{"full_name":"Eisert, Peter","last_name":"Eisert","first_name":"Peter"},{"first_name":"Joachim","full_name":"Hornegger, Joachim","last_name":"Hornegger"},{"last_name":"Polthier","full_name":"Polthier, Konrad","first_name":"Konrad"}],"publication":"Vision, Modeling, and Visualization (2011)","type":"conference","language":[{"iso":"eng"}],"department":[{"_id":"65"}],"user_id":"14955","_id":"21765"},{"date_created":"2017-11-27T10:22:28Z","date_updated":"2022-01-06T07:04:12Z","doi":"10.1007/978-3-642-22450-8","title":"Ad-hoc, Mobile, and Wireless Networks - 10th International Conference, ADHOC-NOW 2011, Paderborn, Germany, July 18-20, 2011. Proceedings","publication_identifier":{"isbn":["978-3-642-22449-2"]},"citation":{"chicago":"Frey, Hannes, Xu Li, and Stefan R{ührup, eds. <i>Ad-Hoc, Mobile, and Wireless Networks - 10th International Conference, ADHOC-NOW 2011, Paderborn, Germany, July 18-20, 2011. Proceedings</i>. Lecture Notes in Computer Science, 2011. <a href=\"https://doi.org/10.1007/978-3-642-22450-8\">https://doi.org/10.1007/978-3-642-22450-8</a>.","ieee":"H. Frey, X. Li, and S. R{ührup, Eds., <i>Ad-hoc, Mobile, and Wireless Networks - 10th International Conference, ADHOC-NOW 2011, Paderborn, Germany, July 18-20, 2011. Proceedings</i>. 2011.","ama":"Frey H, Li X, R{ührup S, eds. <i>Ad-Hoc, Mobile, and Wireless Networks - 10th International Conference, ADHOC-NOW 2011, Paderborn, Germany, July 18-20, 2011. Proceedings</i>.; 2011. doi:<a href=\"https://doi.org/10.1007/978-3-642-22450-8\">10.1007/978-3-642-22450-8</a>","short":"H. Frey, X. Li, S. R{ührup, eds., Ad-Hoc, Mobile, and Wireless Networks - 10th International Conference, ADHOC-NOW 2011, Paderborn, Germany, July 18-20, 2011. Proceedings, 2011.","mla":"Frey, Hannes, et al., editors. <i>Ad-Hoc, Mobile, and Wireless Networks - 10th International Conference, ADHOC-NOW 2011, Paderborn, Germany, July 18-20, 2011. Proceedings</i>. 2011, doi:<a href=\"https://doi.org/10.1007/978-3-642-22450-8\">10.1007/978-3-642-22450-8</a>.","bibtex":"@book{Frey_Li_R{ührup_2011, series={Lecture Notes in Computer Science}, title={Ad-hoc, Mobile, and Wireless Networks - 10th International Conference, ADHOC-NOW 2011, Paderborn, Germany, July 18-20, 2011. Proceedings}, DOI={<a href=\"https://doi.org/10.1007/978-3-642-22450-8\">10.1007/978-3-642-22450-8</a>}, year={2011}, collection={Lecture Notes in Computer Science} }","apa":"Frey, H., Li, X., &#38; R{ührup, S. (Eds.). (2011). <i>Ad-hoc, Mobile, and Wireless Networks - 10th International Conference, ADHOC-NOW 2011, Paderborn, Germany, July 18-20, 2011. Proceedings</i>. <a href=\"https://doi.org/10.1007/978-3-642-22450-8\">https://doi.org/10.1007/978-3-642-22450-8</a>"},"year":"2011","series_title":"Lecture Notes in Computer Science","user_id":"15572","department":[{"_id":"75"}],"_id":"929","type":"conference_editor","status":"public","editor":[{"full_name":"Frey, Hannes","last_name":"Frey","first_name":"Hannes"},{"full_name":"Li, Xu","last_name":"Li","first_name":"Xu"},{"last_name":"R{ührup","full_name":"R{ührup, Stefan","first_name":"Stefan"}]},{"year":"2011","citation":{"ama":"Diehl M. <i>Vorteile der Paketbildung in Verhandlungen: Ein prozeduraler Zugang zu Superadditivität</i>. Universität Paderborn; 2011.","chicago":"Diehl, Matthias. <i>Vorteile der Paketbildung in Verhandlungen: Ein prozeduraler Zugang zu Superadditivität</i>. Universität Paderborn, 2011.","ieee":"M. Diehl, <i>Vorteile der Paketbildung in Verhandlungen: Ein prozeduraler Zugang zu Superadditivität</i>. Universität Paderborn, 2011.","bibtex":"@book{Diehl_2011, title={Vorteile der Paketbildung in Verhandlungen: Ein prozeduraler Zugang zu Superadditivität}, publisher={Universität Paderborn}, author={Diehl, Matthias}, year={2011} }","short":"M. Diehl, Vorteile der Paketbildung in Verhandlungen: Ein prozeduraler Zugang zu Superadditivität, Universität Paderborn, 2011.","mla":"Diehl, Matthias. <i>Vorteile der Paketbildung in Verhandlungen: Ein prozeduraler Zugang zu Superadditivität</i>. Universität Paderborn, 2011.","apa":"Diehl, M. (2011). <i>Vorteile der Paketbildung in Verhandlungen: Ein prozeduraler Zugang zu Superadditivität</i>. Universität Paderborn."},"title":"Vorteile der Paketbildung in Verhandlungen: Ein prozeduraler Zugang zu Superadditivität","date_updated":"2022-01-06T07:03:04Z","publisher":"Universität Paderborn","author":[{"first_name":"Matthias","last_name":"Diehl","full_name":"Diehl, Matthias"}],"date_created":"2017-10-17T12:42:57Z","status":"public","type":"bachelorsthesis","language":[{"iso":"ger"}],"_id":"642","project":[{"name":"SFB 901","_id":"1"},{"_id":"7","name":"SFB 901 - Subprojekt A3"},{"_id":"2","name":"SFB 901 - Project Area A"}],"user_id":"477"},{"department":[{"_id":"79"}],"user_id":"15504","_id":"645","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt C1","_id":"13"},{"_id":"4","name":"SFB 901 - Project Area C"}],"file_date_updated":"2018-03-14T13:58:11Z","ddc":["040"],"publication":"Proceedings of the 23rd ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)","type":"conference","status":"public","file":[{"file_id":"1228","access_level":"closed","file_name":"645-spaa70-scheideler.pdf","file_size":268500,"creator":"florida","date_created":"2018-03-14T13:58:11Z","date_updated":"2018-03-14T13:58:11Z","relation":"main_file","success":1,"content_type":"application/pdf"}],"abstract":[{"text":"In the standard consensus problem there are n processes with possibly di®erent input values and the goal is to eventually reach a point at which all processes commit to exactly one of these values. We are studying a slight variant of the consensus problem called the stabilizing consensus problem [2]. In this problem, we do not require that each process commits to a ¯nal value at some point, but that eventually they arrive at a common, stable value without necessarily being aware of that. This should work irrespective of the states in which the processes are starting. Our main result is a simple randomized algorithm called median rule that, with high probability, just needs O(logmlog log n + log n) time and work per process to arrive at an almost stable consensus for any set of m legal values as long as an adversary can corrupt the states of at most p n processes at any time. Without adversarial involvement, just O(log n) time and work is needed for a stable consensus, with high probability. As a by-product, we obtain a simple distributed algorithm for approximating the median of n numbers in time O(logmlog log n + log n) under adversarial presence.","lang":"eng"}],"date_created":"2017-10-17T12:42:57Z","author":[{"full_name":"Doerr, Benjamin","last_name":"Doerr","first_name":"Benjamin"},{"first_name":"Leslie Ann","full_name":"Goldberg, Leslie Ann","last_name":"Goldberg"},{"first_name":"Lorenz","last_name":"Minder","full_name":"Minder, Lorenz"},{"full_name":"Sauerwald, Thomas","last_name":"Sauerwald","first_name":"Thomas"},{"last_name":"Scheideler","full_name":"Scheideler, Christian","id":"20792","first_name":"Christian"}],"date_updated":"2022-01-06T07:03:05Z","doi":"10.1145/1989493.1989516","title":"Stabilizing consensus with the power of two choices","has_accepted_license":"1","page":"149-158","citation":{"apa":"Doerr, B., Goldberg, L. A., Minder, L., Sauerwald, T., &#38; Scheideler, C. (2011). Stabilizing consensus with the power of two choices. In <i>Proceedings of the 23rd ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)</i> (pp. 149–158). <a href=\"https://doi.org/10.1145/1989493.1989516\">https://doi.org/10.1145/1989493.1989516</a>","bibtex":"@inproceedings{Doerr_Goldberg_Minder_Sauerwald_Scheideler_2011, title={Stabilizing consensus with the power of two choices}, DOI={<a href=\"https://doi.org/10.1145/1989493.1989516\">10.1145/1989493.1989516</a>}, booktitle={Proceedings of the 23rd ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)}, author={Doerr, Benjamin and Goldberg, Leslie Ann and Minder, Lorenz and Sauerwald, Thomas and Scheideler, Christian}, year={2011}, pages={149–158} }","mla":"Doerr, Benjamin, et al. “Stabilizing Consensus with the Power of Two Choices.” <i>Proceedings of the 23rd ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)</i>, 2011, pp. 149–58, doi:<a href=\"https://doi.org/10.1145/1989493.1989516\">10.1145/1989493.1989516</a>.","short":"B. Doerr, L.A. Goldberg, L. Minder, T. Sauerwald, C. Scheideler, in: Proceedings of the 23rd ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 2011, pp. 149–158.","chicago":"Doerr, Benjamin, Leslie Ann Goldberg, Lorenz Minder, Thomas Sauerwald, and Christian Scheideler. “Stabilizing Consensus with the Power of Two Choices.” In <i>Proceedings of the 23rd ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)</i>, 149–58, 2011. <a href=\"https://doi.org/10.1145/1989493.1989516\">https://doi.org/10.1145/1989493.1989516</a>.","ieee":"B. Doerr, L. A. Goldberg, L. Minder, T. Sauerwald, and C. Scheideler, “Stabilizing consensus with the power of two choices,” in <i>Proceedings of the 23rd ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)</i>, 2011, pp. 149–158.","ama":"Doerr B, Goldberg LA, Minder L, Sauerwald T, Scheideler C. Stabilizing consensus with the power of two choices. In: <i>Proceedings of the 23rd ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)</i>. ; 2011:149-158. doi:<a href=\"https://doi.org/10.1145/1989493.1989516\">10.1145/1989493.1989516</a>"},"year":"2011"},{"alternative_title":["Education for a Global Networked Society"],"extern":"1","keyword":["educational development","study programmes","approaches to studying"],"user_id":"51057","department":[{"_id":"208"},{"_id":"282"}],"_id":"4485","status":"public","abstract":[{"text":"Research on teaching and learning in higher education has first and foremost centered on individuals, i.e. students' and teachers' approaches to learning and teaching as well as methods (Entwistle, McCune, & Scheja, 2006; Entwistle & Peterson, 2004). As a consequence, concepts on how to improve and innovate education at higher education institutions (HEI) have stayed on the level of individual courses, trying to qualify teachers to implement new teaching and learning methods in their classrooms (Aineley, 2008, S. 619). Yet, there are both theoretical as well as practical reasons that argue for a broader perspective on learning processes and, as a consequence, reach beyond the course-level but focus on entire educational programmes instead: First, over the last thirty years or so, learning theories are increasingly stressing the importance of (a) social-material contexts (McInerney & van Etten, 2002) as well as (b) learners' subjective experiences. This suggests that a course of study be not regarded as a mere addition of more or less independent courses, but rather as a holistic learning experience. This includes the sum total of a student's educationally purposeful social-material interactions at a HEI both within and outside the classroom (cf. Hu & Kuh, 2002). A second, more practical reason why educational researchers and designers should take a closer look on the design of educational programmes lies in the Bologna process: The introduction of the European Credit Transfer System as well as the tow-tiered study structure force HEI to systematically craft their programmes' internal structure. Due to the fact that there are virtually no pedagogical concepts concerning the design of study programmes, these design processes have so far been dominated by administrative considerations, largely neglecting students' experiences within the programme structures (Winter, 2009; Hildbrand, Tremp, Jäger & Tückmantel, 2008). Thus, it can be concluded that there is a lack of knowledge on how distinctive design features of study programmes (1) are perceived by students and (2) impact on their action strategies concerning for example the selection of learning activities, the attribution of resources for learning, and social interactions with their peers.","lang":"eng"}],"type":"conference","conference":{"start_date":"2011-08-30","name":"14th Biennial European Conference for Research on Learning and Instruction (EARLI)","location":"Exeter","end_date":"2011-09-03"},"title":"Developing a learning centered model for designing and managing study programmes","author":[{"orcid":" https://orcid.org/0000-0001-9262-5646","last_name":"Jenert","full_name":"Jenert, Tobias","id":"71994","first_name":"Tobias"}],"date_created":"2018-09-19T08:41:01Z","publisher":"European Association for Research on Learning and Instruction","date_updated":"2022-01-06T07:01:06Z","citation":{"ama":"Jenert T. Developing a learning centered model for designing and managing study programmes. In: European Association for Research on Learning and Instruction; 2011.","ieee":"T. Jenert, “Developing a learning centered model for designing and managing study programmes,” presented at the 14th Biennial European Conference for Research on Learning and Instruction (EARLI), Exeter, 2011.","chicago":"Jenert, Tobias. “Developing a Learning Centered Model for Designing and Managing Study Programmes.” European Association for Research on Learning and Instruction, 2011.","mla":"Jenert, Tobias. <i>Developing a Learning Centered Model for Designing and Managing Study Programmes</i>. European Association for Research on Learning and Instruction, 2011.","short":"T. Jenert, in: European Association for Research on Learning and Instruction, 2011.","bibtex":"@inproceedings{Jenert_2011, title={Developing a learning centered model for designing and managing study programmes}, publisher={European Association for Research on Learning and Instruction}, author={Jenert, Tobias}, year={2011} }","apa":"Jenert, T. (2011). Developing a learning centered model for designing and managing study programmes. Presented at the 14th Biennial European Conference for Research on Learning and Instruction (EARLI), Exeter: European Association for Research on Learning and Instruction."},"year":"2011"},{"publication":"Semiconductor Science and Technology","type":"journal_article","abstract":[{"text":"Laser irradiation damage in ZnTe epilayers was analyzed in situ by power-density-dependent and time-resolved micro-Raman spectroscopy. Damage by ablation or compound decomposition on the sample surface was revealed by the decrease of the ZnTe–nLO mode intensity with the increase of laser power density. The appearance of the peaks associated with the stronger crystalline-tellurium modes, tellurium aggregates and second-order Raman scattering at room temperature μ-Raman spectra was observed for higher power densities than 4.4 × 105 W cm−2. The Raman signal time transients of ZnTe–nLO and crystalline-tellurium modes reveal an exponential evolution of the laser irradiation damage and a fast formation of crystalline tellurium aggregates on the layer surface.","lang":"eng"}],"status":"public","_id":"4545","department":[{"_id":"15"},{"_id":"230"},{"_id":"35"}],"user_id":"49428","article_number":"105023","article_type":"original","language":[{"iso":"eng"}],"publication_identifier":{"issn":["0268-1242","1361-6641"]},"publication_status":"published","issue":"10","year":"2011","intvolume":"        26","citation":{"short":"V. Wiedemeier, G. Berth, A. Zrenner, E.M. Larramendi, U. Woggon, K. Lischka, D. Schikora, Semiconductor Science and Technology 26 (2011).","mla":"Wiedemeier, V., et al. “In Situ Characterization of ZnTe Epilayer Irradiation via Time-Resolved and Power-Density-Dependent Raman Spectroscopy.” <i>Semiconductor Science and Technology</i>, vol. 26, no. 10, 105023, IOP Publishing, 2011, doi:<a href=\"https://doi.org/10.1088/0268-1242/26/10/105023\">10.1088/0268-1242/26/10/105023</a>.","bibtex":"@article{Wiedemeier_Berth_Zrenner_Larramendi_Woggon_Lischka_Schikora_2011, title={In situ characterization of ZnTe epilayer irradiation via time-resolved and power-density-dependent Raman spectroscopy}, volume={26}, DOI={<a href=\"https://doi.org/10.1088/0268-1242/26/10/105023\">10.1088/0268-1242/26/10/105023</a>}, number={10105023}, journal={Semiconductor Science and Technology}, publisher={IOP Publishing}, author={Wiedemeier, V and Berth, Gerhard and Zrenner, Artur and Larramendi, E M and Woggon, U and Lischka, K and Schikora, D}, year={2011} }","apa":"Wiedemeier, V., Berth, G., Zrenner, A., Larramendi, E. M., Woggon, U., Lischka, K., &#38; Schikora, D. (2011). In situ characterization of ZnTe epilayer irradiation via time-resolved and power-density-dependent Raman spectroscopy. <i>Semiconductor Science and Technology</i>, <i>26</i>(10). <a href=\"https://doi.org/10.1088/0268-1242/26/10/105023\">https://doi.org/10.1088/0268-1242/26/10/105023</a>","ieee":"V. Wiedemeier <i>et al.</i>, “In situ characterization of ZnTe epilayer irradiation via time-resolved and power-density-dependent Raman spectroscopy,” <i>Semiconductor Science and Technology</i>, vol. 26, no. 10, 2011.","chicago":"Wiedemeier, V, Gerhard Berth, Artur Zrenner, E M Larramendi, U Woggon, K Lischka, and D Schikora. “In Situ Characterization of ZnTe Epilayer Irradiation via Time-Resolved and Power-Density-Dependent Raman Spectroscopy.” <i>Semiconductor Science and Technology</i> 26, no. 10 (2011). <a href=\"https://doi.org/10.1088/0268-1242/26/10/105023\">https://doi.org/10.1088/0268-1242/26/10/105023</a>.","ama":"Wiedemeier V, Berth G, Zrenner A, et al. In situ characterization of ZnTe epilayer irradiation via time-resolved and power-density-dependent Raman spectroscopy. <i>Semiconductor Science and Technology</i>. 2011;26(10). doi:<a href=\"https://doi.org/10.1088/0268-1242/26/10/105023\">10.1088/0268-1242/26/10/105023</a>"},"date_updated":"2022-01-06T07:01:09Z","publisher":"IOP Publishing","volume":26,"date_created":"2018-09-20T11:36:28Z","author":[{"first_name":"V","full_name":"Wiedemeier, V","last_name":"Wiedemeier"},{"first_name":"Gerhard","id":"53","full_name":"Berth, Gerhard","last_name":"Berth"},{"first_name":"Artur","id":"606","full_name":"Zrenner, Artur","orcid":"0000-0002-5190-0944","last_name":"Zrenner"},{"last_name":"Larramendi","full_name":"Larramendi, E M","first_name":"E M"},{"first_name":"U","last_name":"Woggon","full_name":"Woggon, U"},{"first_name":"K","last_name":"Lischka","full_name":"Lischka, K"},{"first_name":"D","last_name":"Schikora","full_name":"Schikora, D"}],"title":"In situ characterization of ZnTe epilayer irradiation via time-resolved and power-density-dependent Raman spectroscopy","doi":"10.1088/0268-1242/26/10/105023"},{"date_updated":"2022-01-06T07:03:53Z","author":[{"first_name":"Stefan","full_name":"Krauter, Stefan","id":"28836","orcid":"0000-0002-3594-260X","last_name":"Krauter"}],"date_created":"2019-03-05T13:32:51Z","title":"The Challenge of Renewable Energies & Decentralized Power Systems – State of the Art, Potentials & Perspectives","conference":{"name":"Decentralized Power Systems (DPS) 2011, Paderborn (Deutschland), 2. September 2011."},"year":"2011","citation":{"short":"S. Krauter, in:  Proceedings of Decentralized Power Systems (DPS) 2011, Paderborn (Deutschland), 2. September 2011., 2011.","bibtex":"@inproceedings{Krauter_2011, title={The Challenge of Renewable Energies &#38; Decentralized Power Systems – State of the Art, Potentials &#38; Perspectives}, booktitle={ Proceedings of Decentralized Power Systems (DPS) 2011, Paderborn (Deutschland), 2. September 2011.}, author={Krauter, Stefan}, year={2011} }","mla":"Krauter, Stefan. “The Challenge of Renewable Energies &#38; Decentralized Power Systems – State of the Art, Potentials &#38; Perspectives.” <i> Proceedings of Decentralized Power Systems (DPS) 2011, Paderborn (Deutschland), 2. September 2011.</i>, 2011.","apa":"Krauter, S. (2011). The Challenge of Renewable Energies &#38; Decentralized Power Systems – State of the Art, Potentials &#38; Perspectives. In <i> Proceedings of Decentralized Power Systems (DPS) 2011, Paderborn (Deutschland), 2. September 2011.</i>","chicago":"Krauter, Stefan. “The Challenge of Renewable Energies &#38; Decentralized Power Systems – State of the Art, Potentials &#38; Perspectives.” In <i> Proceedings of Decentralized Power Systems (DPS) 2011, Paderborn (Deutschland), 2. September 2011.</i>, 2011.","ieee":"S. Krauter, “The Challenge of Renewable Energies &#38; Decentralized Power Systems – State of the Art, Potentials &#38; Perspectives,” in <i> Proceedings of Decentralized Power Systems (DPS) 2011, Paderborn (Deutschland), 2. September 2011.</i>, 2011.","ama":"Krauter S. The Challenge of Renewable Energies &#38; Decentralized Power Systems – State of the Art, Potentials &#38; Perspectives. In: <i> Proceedings of Decentralized Power Systems (DPS) 2011, Paderborn (Deutschland), 2. September 2011.</i> ; 2011."},"_id":"8348","user_id":"16148","department":[{"_id":"53"}],"language":[{"iso":"eng"}],"type":"conference","publication":" Proceedings of Decentralized Power Systems (DPS) 2011, Paderborn (Deutschland), 2. September 2011.","status":"public"},{"doi":"10.1016/j.jlumin.2011.05.035","date_updated":"2022-01-06T07:00:25Z","author":[{"first_name":"Marie Christin","last_name":"Wiegand","full_name":"Wiegand, Marie Christin"},{"last_name":"Sievers","full_name":"Sievers, Werner","first_name":"Werner"},{"last_name":"Lindner","full_name":"Lindner, Jörg","id":"20797","first_name":"Jörg"},{"last_name":"Tröster","full_name":"Tröster, Th.","first_name":"Th."},{"first_name":"S.","last_name":"Schweizer","full_name":"Schweizer, S."}],"volume":131,"citation":{"ama":"Wiegand MC, Sievers W, Lindner J, Tröster T, Schweizer S. Photoluminescence properties of Sm2+-doped BaBr2 under hydrostatic pressure. <i>Journal of Luminescence</i>. 2011;131(11):2400-2403. doi:<a href=\"https://doi.org/10.1016/j.jlumin.2011.05.035\">10.1016/j.jlumin.2011.05.035</a>","chicago":"Wiegand, Marie Christin, Werner Sievers, Jörg Lindner, Th. Tröster, and S. Schweizer. “Photoluminescence Properties of Sm2+-Doped BaBr2 under Hydrostatic Pressure.” <i>Journal of Luminescence</i> 131, no. 11 (2011): 2400–2403. <a href=\"https://doi.org/10.1016/j.jlumin.2011.05.035\">https://doi.org/10.1016/j.jlumin.2011.05.035</a>.","ieee":"M. C. Wiegand, W. Sievers, J. Lindner, T. Tröster, and S. Schweizer, “Photoluminescence properties of Sm2+-doped BaBr2 under hydrostatic pressure,” <i>Journal of Luminescence</i>, vol. 131, no. 11, pp. 2400–2403, 2011.","apa":"Wiegand, M. C., Sievers, W., Lindner, J., Tröster, T., &#38; Schweizer, S. (2011). Photoluminescence properties of Sm2+-doped BaBr2 under hydrostatic pressure. <i>Journal of Luminescence</i>, <i>131</i>(11), 2400–2403. <a href=\"https://doi.org/10.1016/j.jlumin.2011.05.035\">https://doi.org/10.1016/j.jlumin.2011.05.035</a>","bibtex":"@article{Wiegand_Sievers_Lindner_Tröster_Schweizer_2011, title={Photoluminescence properties of Sm2+-doped BaBr2 under hydrostatic pressure}, volume={131}, DOI={<a href=\"https://doi.org/10.1016/j.jlumin.2011.05.035\">10.1016/j.jlumin.2011.05.035</a>}, number={11}, journal={Journal of Luminescence}, publisher={Elsevier BV}, author={Wiegand, Marie Christin and Sievers, Werner and Lindner, Jörg and Tröster, Th. and Schweizer, S.}, year={2011}, pages={2400–2403} }","short":"M.C. Wiegand, W. Sievers, J. Lindner, T. Tröster, S. Schweizer, Journal of Luminescence 131 (2011) 2400–2403.","mla":"Wiegand, Marie Christin, et al. “Photoluminescence Properties of Sm2+-Doped BaBr2 under Hydrostatic Pressure.” <i>Journal of Luminescence</i>, vol. 131, no. 11, Elsevier BV, 2011, pp. 2400–03, doi:<a href=\"https://doi.org/10.1016/j.jlumin.2011.05.035\">10.1016/j.jlumin.2011.05.035</a>."},"page":"2400-2403","intvolume":"       131","publication_status":"published","publication_identifier":{"issn":["0022-2313"]},"has_accepted_license":"1","article_type":"original","file_date_updated":"2018-08-27T12:45:30Z","_id":"4148","user_id":"55706","department":[{"_id":"15"},{"_id":"286"}],"status":"public","type":"journal_article","title":"Photoluminescence properties of Sm2+-doped BaBr2 under hydrostatic pressure","publisher":"Elsevier BV","date_created":"2018-08-27T12:44:42Z","year":"2011","issue":"11","ddc":["530"],"language":[{"iso":"eng"}],"abstract":[{"lang":"eng","text":"Photoluminescence spectra of Sm^(2+)-doped BaBr^2 have been measured under hydrostatic pressures up to 17 GPa at room temperature. In the low pressure range a red-shift of the broad 5d–4f transition of -145 cm^(-1)/GPa is observed. From 5 to 8 GPa a phase mixtureof the initial orthorhombic phase and the high-pressure monoclinic phase gives rise to two 5d–4f bands, which are strongly overlapping. Above 8 GPa the crystalis completely transformed to its high-pressure phase where two different Sm2^(2+) sites exist, but only one broad 5d–4f transition is detected. It exhibits are d-shift of -36 cm^(-1)/GPa. In addition,the line shifts of the (_^5)D_0→(_^7)F_J  (J=0,1,2)   transitions are investigated. Linear shifts of -19cm^(-1)/GPa  for J=0,2 and of -13cm^(-1)/GPa for J01 are observed in the pressure range from 0 to 5 GPa."}],"file":[{"content_type":"application/pdf","success":1,"relation":"main_file","date_updated":"2018-08-27T12:45:30Z","date_created":"2018-08-27T12:45:30Z","creator":"hclaudia","file_size":279989,"access_level":"closed","file_id":"4149","file_name":"Photoluminescence properties of Sm(2+)-doped BaBr2 under hydrostatic pressure.pdf"}],"publication":"Journal of Luminescence"},{"type":"mastersthesis","status":"public","department":[{"_id":"79"}],"user_id":"477","_id":"648","project":[{"_id":"1","name":"SFB 901"},{"_id":"5","name":"SFB 901 - Subprojekt A1"},{"name":"SFB 901 - Project Area A","_id":"2"}],"language":[{"iso":"eng"}],"citation":{"short":"P. Brandes, Robust Distributed Computation in Dynamic Networks, Universität Paderborn, 2011.","bibtex":"@book{Brandes_2011, title={Robust Distributed Computation in Dynamic Networks}, publisher={Universität Paderborn}, author={Brandes, Philipp}, year={2011} }","mla":"Brandes, Philipp. <i>Robust Distributed Computation in Dynamic Networks</i>. Universität Paderborn, 2011.","apa":"Brandes, P. (2011). <i>Robust Distributed Computation in Dynamic Networks</i>. Universität Paderborn.","chicago":"Brandes, Philipp. <i>Robust Distributed Computation in Dynamic Networks</i>. Universität Paderborn, 2011.","ieee":"P. Brandes, <i>Robust Distributed Computation in Dynamic Networks</i>. Universität Paderborn, 2011.","ama":"Brandes P. <i>Robust Distributed Computation in Dynamic Networks</i>. Universität Paderborn; 2011."},"year":"2011","author":[{"last_name":"Brandes","full_name":"Brandes, Philipp","first_name":"Philipp"}],"date_created":"2017-10-17T12:42:58Z","supervisor":[{"last_name":"Scheideler","id":"20792","full_name":"Scheideler, Christian","first_name":"Christian"}],"date_updated":"2022-01-06T07:03:06Z","publisher":"Universität Paderborn","title":"Robust Distributed Computation in Dynamic Networks"},{"type":"bachelorsthesis","status":"public","_id":"651","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt A3","_id":"7"},{"name":"SFB 901 - Project Area A","_id":"2"}],"department":[{"_id":"205"}],"user_id":"13264","language":[{"iso":"ger"}],"year":"2011","citation":{"apa":"Stroh-Maraun, N. (2011). <i>Prozedurale Ansätze zur Lösung mehrdimensionaler Verhandlungsprobleme</i>. Universität Paderborn.","short":"N. Stroh-Maraun, Prozedurale Ansätze zur Lösung mehrdimensionaler Verhandlungsprobleme, Universität Paderborn, 2011.","bibtex":"@book{Stroh-Maraun_2011, title={Prozedurale Ansätze zur Lösung mehrdimensionaler Verhandlungsprobleme}, publisher={Universität Paderborn}, author={Stroh-Maraun, Nadja}, year={2011} }","mla":"Stroh-Maraun, Nadja. <i>Prozedurale Ansätze zur Lösung mehrdimensionaler Verhandlungsprobleme</i>. Universität Paderborn, 2011.","chicago":"Stroh-Maraun, Nadja. <i>Prozedurale Ansätze zur Lösung mehrdimensionaler Verhandlungsprobleme</i>. Universität Paderborn, 2011.","ieee":"N. Stroh-Maraun, <i>Prozedurale Ansätze zur Lösung mehrdimensionaler Verhandlungsprobleme</i>. Universität Paderborn, 2011.","ama":"Stroh-Maraun N. <i>Prozedurale Ansätze zur Lösung mehrdimensionaler Verhandlungsprobleme</i>. Universität Paderborn; 2011."},"date_updated":"2022-01-06T07:03:08Z","publisher":"Universität Paderborn","date_created":"2017-10-17T12:42:58Z","supervisor":[{"first_name":"Claus-Jochen","last_name":"Haake","id":"20801","full_name":"Haake, Claus-Jochen"}],"author":[{"last_name":"Stroh-Maraun","id":"13264","full_name":"Stroh-Maraun, Nadja","first_name":"Nadja"}],"title":"Prozedurale Ansätze zur Lösung mehrdimensionaler Verhandlungsprobleme"},{"type":"conference","publication":"Proceedings of the Palladio Days 2011","abstract":[{"lang":"eng","text":"Performance prototyping is an often used technique to assess the performance of software architectures early in the development process without relying on models of the system under study. ProtoCom is a prototype generator for the PCM realised as model-2-text transformation for which no experience report in a larger, virtualised setting exists. In this paper, we report on four case studies performed with an improved version of ProtoCom and report on the results gained with respect to analysis accuracy and usability. Our results demonstrate that the new version is much easier to use than previous versions and that results gained in our virtualised execution environment help in early assessments of performance under realistic conditions."}],"file":[{"success":1,"relation":"main_file","content_type":"application/pdf","file_size":773622,"file_name":"653-Protocom-Lehrig_Zolynski.pdf","file_id":"1222","access_level":"closed","date_updated":"2018-03-14T13:53:10Z","creator":"florida","date_created":"2018-03-14T13:53:10Z"}],"status":"public","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt B3","_id":"11"},{"_id":"3","name":"SFB 901 - Project Area B"}],"_id":"653","user_id":"15504","series_title":"Karlsruhe Reports in Informatics","ddc":["040"],"file_date_updated":"2018-03-14T13:53:10Z","has_accepted_license":"1","year":"2011","citation":{"ama":"Lehrig S, Zolynski T. Performance Prototyping with ProtoCom in a Virtualised Environment: A Case Study. In: <i>Proceedings of the Palladio Days 2011</i>. Karlsruhe Reports in Informatics. ; 2011:15-22. doi:<a href=\"https://doi.org/10.5445/IR/1000025188 \">10.5445/IR/1000025188 </a>","chicago":"Lehrig, Sebastian, and Thomas Zolynski. “Performance Prototyping with ProtoCom in a Virtualised Environment: A Case Study.” In <i>Proceedings of the Palladio Days 2011</i>, 15–22. Karlsruhe Reports in Informatics, 2011. <a href=\"https://doi.org/10.5445/IR/1000025188 \">https://doi.org/10.5445/IR/1000025188 </a>.","ieee":"S. Lehrig and T. Zolynski, “Performance Prototyping with ProtoCom in a Virtualised Environment: A Case Study,” in <i>Proceedings of the Palladio Days 2011</i>, 2011, pp. 15–22.","bibtex":"@inproceedings{Lehrig_Zolynski_2011, series={Karlsruhe Reports in Informatics}, title={Performance Prototyping with ProtoCom in a Virtualised Environment: A Case Study}, DOI={<a href=\"https://doi.org/10.5445/IR/1000025188 \">10.5445/IR/1000025188 </a>}, booktitle={Proceedings of the Palladio Days 2011}, author={Lehrig, Sebastian and Zolynski, Thomas}, year={2011}, pages={15–22}, collection={Karlsruhe Reports in Informatics} }","mla":"Lehrig, Sebastian, and Thomas Zolynski. “Performance Prototyping with ProtoCom in a Virtualised Environment: A Case Study.” <i>Proceedings of the Palladio Days 2011</i>, 2011, pp. 15–22, doi:<a href=\"https://doi.org/10.5445/IR/1000025188 \">10.5445/IR/1000025188 </a>.","short":"S. Lehrig, T. Zolynski, in: Proceedings of the Palladio Days 2011, 2011, pp. 15–22.","apa":"Lehrig, S., &#38; Zolynski, T. (2011). Performance Prototyping with ProtoCom in a Virtualised Environment: A Case Study. In <i>Proceedings of the Palladio Days 2011</i> (pp. 15–22). <a href=\"https://doi.org/10.5445/IR/1000025188 \">https://doi.org/10.5445/IR/1000025188 </a>"},"page":"15-22","date_updated":"2022-01-06T07:03:10Z","author":[{"first_name":"Sebastian","last_name":"Lehrig","full_name":"Lehrig, Sebastian"},{"first_name":"Thomas","full_name":"Zolynski, Thomas","last_name":"Zolynski"}],"date_created":"2017-10-17T12:42:59Z","title":"Performance Prototyping with ProtoCom in a Virtualised Environment: A Case Study","doi":"10.5445/IR/1000025188 "},{"ddc":["040"],"language":[{"iso":"eng"}],"file_date_updated":"2018-03-14T13:50:18Z","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt A1","_id":"5"},{"name":"SFB 901 - Project Area A","_id":"2"}],"_id":"654","user_id":"477","department":[{"_id":"79"}],"abstract":[{"text":"Research on peer-to-peer (p2p) and distributed systems needs evaluation tools to predict and observe the behavior of protocols and mechanisms in large scale networks. PeerfactSim.KOM is a simulator for large scale distributed/p2p systems aiming at the evaluation of interdependencies in multi-layered p2p systems. The simulator is written in Java, is event-based and mainly used in p2p research projects. The main development of PeerfactSim.KOM started in 2005 and is driven since 2006 by the project “QuaP2P”,which aims at the systematic improvement and benchmarking of p2p systems. Further users of the simulator are working in the project “On-the-fly Computing” aiming at researching p2p-based service oriented architectures. Both projects state severe requirements on the evaluation of multi-layered and large-scale distributed systems. We describe the architecture of PeerfactSim.KOM supporting these requirements in Section II, present the workflow, selected experiences and lessons learned in Section III and conclude the overview in Section IV.","lang":"eng"}],"file":[{"file_name":"654-IEEE.P2P.11._Kalman.Graffi_PeerfactSim-A.P2P.System.Simulator_01.pdf","file_id":"1221","access_level":"closed","file_size":327680,"date_created":"2018-03-14T13:50:18Z","creator":"florida","date_updated":"2018-03-14T13:50:18Z","relation":"main_file","success":1,"content_type":"application/pdf"}],"status":"public","type":"conference","publication":"Proceedings of the IEEE International Conference on Peer-to-Peer Computing (IEEE PsP)","title":"PeerfactSim.KOM: A PSP System Simulator - Experiences and Lessons Learned","doi":"10.1109/P2P.2011.6038673","date_updated":"2022-01-06T07:03:11Z","author":[{"last_name":"Graffi","full_name":"Graffi, Kalman","first_name":"Kalman"}],"date_created":"2017-10-17T12:42:59Z","year":"2011","citation":{"ama":"Graffi K. PeerfactSim.KOM: A PSP System Simulator - Experiences and Lessons Learned. In: <i>Proceedings of the IEEE International Conference on Peer-to-Peer Computing (IEEE PsP)</i>. ; 2011:154-155. doi:<a href=\"https://doi.org/10.1109/P2P.2011.6038673\">10.1109/P2P.2011.6038673</a>","chicago":"Graffi, Kalman. “PeerfactSim.KOM: A PSP System Simulator - Experiences and Lessons Learned.” In <i>Proceedings of the IEEE International Conference on Peer-to-Peer Computing (IEEE PsP)</i>, 154–55, 2011. <a href=\"https://doi.org/10.1109/P2P.2011.6038673\">https://doi.org/10.1109/P2P.2011.6038673</a>.","ieee":"K. Graffi, “PeerfactSim.KOM: A PSP System Simulator - Experiences and Lessons Learned,” in <i>Proceedings of the IEEE International Conference on Peer-to-Peer Computing (IEEE PsP)</i>, 2011, pp. 154–155.","apa":"Graffi, K. (2011). PeerfactSim.KOM: A PSP System Simulator - Experiences and Lessons Learned. In <i>Proceedings of the IEEE International Conference on Peer-to-Peer Computing (IEEE PsP)</i> (pp. 154–155). <a href=\"https://doi.org/10.1109/P2P.2011.6038673\">https://doi.org/10.1109/P2P.2011.6038673</a>","bibtex":"@inproceedings{Graffi_2011, title={PeerfactSim.KOM: A PSP System Simulator - Experiences and Lessons Learned}, DOI={<a href=\"https://doi.org/10.1109/P2P.2011.6038673\">10.1109/P2P.2011.6038673</a>}, booktitle={Proceedings of the IEEE International Conference on Peer-to-Peer Computing (IEEE PsP)}, author={Graffi, Kalman}, year={2011}, pages={154–155} }","mla":"Graffi, Kalman. “PeerfactSim.KOM: A PSP System Simulator - Experiences and Lessons Learned.” <i>Proceedings of the IEEE International Conference on Peer-to-Peer Computing (IEEE PsP)</i>, 2011, pp. 154–55, doi:<a href=\"https://doi.org/10.1109/P2P.2011.6038673\">10.1109/P2P.2011.6038673</a>.","short":"K. Graffi, in: Proceedings of the IEEE International Conference on Peer-to-Peer Computing (IEEE PsP), 2011, pp. 154–155."},"page":"154-155","has_accepted_license":"1"},{"title":"Local Approximation Algorithms for the Uncapacitated Metric Facility Location Problem in Power-Aware Sensor Networks","doi":"10.1007/978-3-642-28209-6_3","date_updated":"2022-01-06T07:03:12Z","author":[{"last_name":"Abshoff","full_name":"Abshoff, Sebastan","first_name":"Sebastan"},{"last_name":"Cord-Landwehr","full_name":"Cord-Landwehr, Andreas","first_name":"Andreas"},{"first_name":"Bastian","last_name":"Degener","full_name":"Degener, Bastian"},{"last_name":"Kempkes","full_name":"Kempkes, Barbara ","first_name":"Barbara "},{"first_name":"Peter","last_name":"Pietrzyk","full_name":"Pietrzyk, Peter"}],"date_created":"2017-10-17T12:43:00Z","year":"2011","citation":{"bibtex":"@inproceedings{Abshoff_Cord-Landwehr_Degener_Kempkes_Pietrzyk_2011, series={LNCS}, title={Local Approximation Algorithms for the Uncapacitated Metric Facility Location Problem in Power-Aware Sensor Networks}, DOI={<a href=\"https://doi.org/10.1007/978-3-642-28209-6_3\">10.1007/978-3-642-28209-6_3</a>}, booktitle={Proceedings of the 7th International Symposium on Algorithms for Sensor Systems, Wireless Ad Hoc Networks and Autonomous Mobile Entities (ALGOSENSORS)}, author={Abshoff, Sebastan and Cord-Landwehr, Andreas and Degener, Bastian and Kempkes, Barbara  and Pietrzyk, Peter}, year={2011}, pages={13–27}, collection={LNCS} }","mla":"Abshoff, Sebastan, et al. “Local Approximation Algorithms for the Uncapacitated Metric Facility Location Problem in Power-Aware Sensor Networks.” <i>Proceedings of the 7th International Symposium on Algorithms for Sensor Systems, Wireless Ad Hoc Networks and Autonomous Mobile Entities (ALGOSENSORS)</i>, 2011, pp. 13–27, doi:<a href=\"https://doi.org/10.1007/978-3-642-28209-6_3\">10.1007/978-3-642-28209-6_3</a>.","short":"S. Abshoff, A. Cord-Landwehr, B. Degener, B. Kempkes, P. Pietrzyk, in: Proceedings of the 7th International Symposium on Algorithms for Sensor Systems, Wireless Ad Hoc Networks and Autonomous Mobile Entities (ALGOSENSORS), 2011, pp. 13–27.","apa":"Abshoff, S., Cord-Landwehr, A., Degener, B., Kempkes, B., &#38; Pietrzyk, P. (2011). Local Approximation Algorithms for the Uncapacitated Metric Facility Location Problem in Power-Aware Sensor Networks. In <i>Proceedings of the 7th International Symposium on Algorithms for Sensor Systems, Wireless Ad Hoc Networks and Autonomous Mobile Entities (ALGOSENSORS)</i> (pp. 13–27). <a href=\"https://doi.org/10.1007/978-3-642-28209-6_3\">https://doi.org/10.1007/978-3-642-28209-6_3</a>","chicago":"Abshoff, Sebastan, Andreas Cord-Landwehr, Bastian Degener, Barbara  Kempkes, and Peter Pietrzyk. “Local Approximation Algorithms for the Uncapacitated Metric Facility Location Problem in Power-Aware Sensor Networks.” In <i>Proceedings of the 7th International Symposium on Algorithms for Sensor Systems, Wireless Ad Hoc Networks and Autonomous Mobile Entities (ALGOSENSORS)</i>, 13–27. LNCS, 2011. <a href=\"https://doi.org/10.1007/978-3-642-28209-6_3\">https://doi.org/10.1007/978-3-642-28209-6_3</a>.","ieee":"S. Abshoff, A. Cord-Landwehr, B. Degener, B. Kempkes, and P. Pietrzyk, “Local Approximation Algorithms for the Uncapacitated Metric Facility Location Problem in Power-Aware Sensor Networks,” in <i>Proceedings of the 7th International Symposium on Algorithms for Sensor Systems, Wireless Ad Hoc Networks and Autonomous Mobile Entities (ALGOSENSORS)</i>, 2011, pp. 13–27.","ama":"Abshoff S, Cord-Landwehr A, Degener B, Kempkes B, Pietrzyk P. Local Approximation Algorithms for the Uncapacitated Metric Facility Location Problem in Power-Aware Sensor Networks. In: <i>Proceedings of the 7th International Symposium on Algorithms for Sensor Systems, Wireless Ad Hoc Networks and Autonomous Mobile Entities (ALGOSENSORS)</i>. LNCS. ; 2011:13-27. doi:<a href=\"https://doi.org/10.1007/978-3-642-28209-6_3\">10.1007/978-3-642-28209-6_3</a>"},"page":"13-27","has_accepted_license":"1","ddc":["040"],"file_date_updated":"2018-03-14T13:48:21Z","language":[{"iso":"eng"}],"project":[{"name":"SFB 901","_id":"1"},{"_id":"5","name":"SFB 901 - Subprojekt A1"},{"_id":"2","name":"SFB 901 - Project Area A"}],"_id":"657","series_title":"LNCS","user_id":"477","department":[{"_id":"63"}],"abstract":[{"text":"We present two distributed, constant factor approximation algorithms for the metric facility location problem. Both algorithms have been designed with a strong emphasis on applicability in the area of wireless sensor networks: in order to execute them, each sensor node only requires limited local knowledge and simple computations. Also, the algorithms can cope with measurement errors and take into account that communication costs between sensor nodes do not necessarily increase linearly with the distance, but can be represented by a polynomial. Since it cannot always be expected that sensor nodes execute algorithms in a synchronized way, our algorithms are executed in an asynchronous model (but they are still able to break symmetry that might occur when two neighboring nodes act at exactly the same time). Furthermore, they can deal with dynamic scenarios: if a node moves, the solution is updated and the update affects only nodes in the local neighborhood. Finally, the algorithms are robust in the sense that incorrect behavior of some nodes during some round will, in the end, still result in a good approximation. The first algorithm runs in expected O(log_{1+\\epsilon} n) communication rounds and yields a \\my^4(1+4\\my^2(1+\\epsilon)^{1/p})^p approximation, while the second has a running time of expected O(log^2_{1+\\epsilon} n) communication rounds and an approximation factor of \\my^4(1 + 2(1 + \\epsilon)^{1/p})^p. Here, \\epsilon > 0 is an arbitrarily small constant, p the exponent of the polynomial representing the communication costs, and \\my the relative measurement error.","lang":"eng"}],"file":[{"file_size":454740,"access_level":"closed","file_id":"1219","file_name":"657-flp_algosensors2011-Cord-Landwehr.pdf","date_updated":"2018-03-14T13:48:21Z","date_created":"2018-03-14T13:48:21Z","creator":"florida","success":1,"relation":"main_file","content_type":"application/pdf"}],"status":"public","type":"conference","publication":"Proceedings of the 7th International Symposium on Algorithms for Sensor Systems, Wireless Ad Hoc Networks and Autonomous Mobile Entities (ALGOSENSORS)"},{"year":"2011","citation":{"ama":"Peuster M. <i>Defining and Deploying Complex Applicances in Multi-Site Cloud Environments</i>. Universität Paderborn; 2011.","ieee":"M. Peuster, <i>Defining and Deploying Complex Applicances in Multi-Site Cloud Environments</i>. Universität Paderborn, 2011.","chicago":"Peuster, Manuel. <i>Defining and Deploying Complex Applicances in Multi-Site Cloud Environments</i>. Universität Paderborn, 2011.","bibtex":"@book{Peuster_2011, title={Defining and Deploying Complex Applicances in Multi-Site Cloud Environments}, publisher={Universität Paderborn}, author={Peuster, Manuel}, year={2011} }","short":"M. Peuster, Defining and Deploying Complex Applicances in Multi-Site Cloud Environments, Universität Paderborn, 2011.","mla":"Peuster, Manuel. <i>Defining and Deploying Complex Applicances in Multi-Site Cloud Environments</i>. Universität Paderborn, 2011.","apa":"Peuster, M. (2011). <i>Defining and Deploying Complex Applicances in Multi-Site Cloud Environments</i>. Universität Paderborn."},"date_updated":"2022-01-06T07:03:13Z","publisher":"Universität Paderborn","author":[{"id":"13271","full_name":"Peuster, Manuel","last_name":"Peuster","first_name":"Manuel"}],"date_created":"2017-10-17T12:43:00Z","title":"Defining and Deploying Complex Applicances in Multi-Site Cloud Environments","type":"bachelorsthesis","status":"public","_id":"660","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt A2","_id":"6"},{"_id":"2","name":"SFB 901 - Project Area A"}],"department":[{"_id":"75"}],"user_id":"15504"},{"type":"conference","publication":"Proceedings of the 13th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)","file":[{"success":1,"relation":"main_file","content_type":"application/pdf","file_size":305543,"file_name":"662-SSS2011-Corona-Scheideler.pdf","access_level":"closed","file_id":"1217","date_updated":"2018-03-14T13:46:48Z","creator":"florida","date_created":"2018-03-14T13:46:48Z"}],"status":"public","abstract":[{"lang":"eng","text":"We present Corona, a deterministic self-stabilizing algorithm for skip list construction in structured overlay networks. Corona operates in the low-atomicity message-passing asynchronous system model. Corona requires constant process memory space for its operation and, therefore, scales well. We prove the general necessary conditions limiting the initial states from which a self-stabilizing structured overlay network in message-passing system can be constructed. The conditions require that initial state information has to form a weakly connected graph and it should only contain identiers that are present in the system. We formally describe Corona and rigorously prove that it stabilizes from an arbitrary initial state subject to the necessary conditions. We extend Corona to construct a skip graph."}],"user_id":"15504","series_title":"LNCS","department":[{"_id":"79"}],"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt A1","_id":"5"},{"_id":"2","name":"SFB 901 - Project Area A"}],"_id":"662","file_date_updated":"2018-03-14T13:46:48Z","ddc":["040"],"has_accepted_license":"1","citation":{"apa":"Nesterenko, M., Mohd, R., &#38; Scheideler, C. (2011). Corona: A Stabilizing Deterministic Message-Passing Skip List. In <i>Proceedings of the 13th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)</i> (pp. 356--370). <a href=\"https://doi.org/10.1007/978-3-642-24550-3_27\">https://doi.org/10.1007/978-3-642-24550-3_27</a>","mla":"Nesterenko, Mikhail, et al. “Corona: A Stabilizing Deterministic Message-Passing Skip List.” <i>Proceedings of the 13th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)</i>, 2011, pp. 356--370, doi:<a href=\"https://doi.org/10.1007/978-3-642-24550-3_27\">10.1007/978-3-642-24550-3_27</a>.","bibtex":"@inproceedings{Nesterenko_Mohd_Scheideler_2011, series={LNCS}, title={Corona: A Stabilizing Deterministic Message-Passing Skip List}, DOI={<a href=\"https://doi.org/10.1007/978-3-642-24550-3_27\">10.1007/978-3-642-24550-3_27</a>}, booktitle={Proceedings of the 13th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)}, author={Nesterenko, Mikhail and Mohd, Rizal and Scheideler, Christian}, year={2011}, pages={356--370}, collection={LNCS} }","short":"M. Nesterenko, R. Mohd, C. Scheideler, in: Proceedings of the 13th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS), 2011, pp. 356--370.","ama":"Nesterenko M, Mohd R, Scheideler C. Corona: A Stabilizing Deterministic Message-Passing Skip List. In: <i>Proceedings of the 13th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)</i>. LNCS. ; 2011:356--370. doi:<a href=\"https://doi.org/10.1007/978-3-642-24550-3_27\">10.1007/978-3-642-24550-3_27</a>","ieee":"M. Nesterenko, R. Mohd, and C. Scheideler, “Corona: A Stabilizing Deterministic Message-Passing Skip List,” in <i>Proceedings of the 13th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)</i>, 2011, pp. 356--370.","chicago":"Nesterenko, Mikhail, Rizal Mohd, and Christian Scheideler. “Corona: A Stabilizing Deterministic Message-Passing Skip List.” In <i>Proceedings of the 13th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)</i>, 356--370. LNCS, 2011. <a href=\"https://doi.org/10.1007/978-3-642-24550-3_27\">https://doi.org/10.1007/978-3-642-24550-3_27</a>."},"page":"356--370","year":"2011","date_created":"2017-10-17T12:43:01Z","author":[{"last_name":"Nesterenko","full_name":"Nesterenko, Mikhail","first_name":"Mikhail"},{"first_name":"Rizal","full_name":"Mohd, Rizal","last_name":"Mohd"},{"first_name":"Christian","last_name":"Scheideler","full_name":"Scheideler, Christian","id":"20792"}],"date_updated":"2022-01-06T07:03:13Z","doi":"10.1007/978-3-642-24550-3_27","title":"Corona: A Stabilizing Deterministic Message-Passing Skip List"},{"year":"2011","citation":{"ieee":"K. Swierkot, <i>Complexity Classes for Local Computation</i>. Universität Paderborn, 2011.","chicago":"Swierkot, Kamil. <i>Complexity Classes for Local Computation</i>. Universität Paderborn, 2011.","ama":"Swierkot K. <i>Complexity Classes for Local Computation</i>. Universität Paderborn; 2011.","apa":"Swierkot, K. (2011). <i>Complexity Classes for Local Computation</i>. Universität Paderborn.","short":"K. Swierkot, Complexity Classes for Local Computation, Universität Paderborn, 2011.","bibtex":"@book{Swierkot_2011, title={Complexity Classes for Local Computation}, publisher={Universität Paderborn}, author={Swierkot, Kamil}, year={2011} }","mla":"Swierkot, Kamil. <i>Complexity Classes for Local Computation</i>. Universität Paderborn, 2011."},"publisher":"Universität Paderborn","date_updated":"2022-01-06T07:03:13Z","supervisor":[{"full_name":"Meyer auf der Heide, Friedhelm","id":"15523","last_name":"Meyer auf der Heide","first_name":"Friedhelm"}],"author":[{"first_name":"Kamil","last_name":"Swierkot","full_name":"Swierkot, Kamil"}],"date_created":"2017-10-17T12:43:01Z","title":"Complexity Classes for Local Computation","type":"mastersthesis","status":"public","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt A1","_id":"5"},{"name":"SFB 901 - Project Area A","_id":"2"}],"_id":"663","user_id":"477","department":[{"_id":"63"}],"language":[{"iso":"eng"}]},{"language":[{"iso":"ger"}],"user_id":"477","department":[{"_id":"79"}],"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt A1","_id":"5"},{"name":"SFB 901 - Project Area A","_id":"2"}],"_id":"665","status":"public","type":"mastersthesis","title":"Adaptives Loadbalancing für strukturierte Peer-to-Peer-Netzwerke am Beispiel von Chord","supervisor":[{"last_name":"Scheideler","id":"20792","full_name":"Scheideler, Christian","first_name":"Christian"}],"date_created":"2017-10-17T12:43:01Z","author":[{"last_name":"Wette","full_name":"Wette, Philip","first_name":"Philip"}],"date_updated":"2022-01-06T07:03:14Z","publisher":"Universität Paderborn","citation":{"apa":"Wette, P. (2011). <i>Adaptives Loadbalancing für strukturierte Peer-to-Peer-Netzwerke am Beispiel von Chord</i>. Universität Paderborn.","mla":"Wette, Philip. <i>Adaptives Loadbalancing für strukturierte Peer-to-Peer-Netzwerke am Beispiel von Chord</i>. Universität Paderborn, 2011.","bibtex":"@book{Wette_2011, title={Adaptives Loadbalancing für strukturierte Peer-to-Peer-Netzwerke am Beispiel von Chord}, publisher={Universität Paderborn}, author={Wette, Philip}, year={2011} }","short":"P. Wette, Adaptives Loadbalancing für strukturierte Peer-to-Peer-Netzwerke am Beispiel von Chord, Universität Paderborn, 2011.","chicago":"Wette, Philip. <i>Adaptives Loadbalancing für strukturierte Peer-to-Peer-Netzwerke am Beispiel von Chord</i>. Universität Paderborn, 2011.","ieee":"P. Wette, <i>Adaptives Loadbalancing für strukturierte Peer-to-Peer-Netzwerke am Beispiel von Chord</i>. Universität Paderborn, 2011.","ama":"Wette P. <i>Adaptives Loadbalancing für strukturierte Peer-to-Peer-Netzwerke am Beispiel von Chord</i>. Universität Paderborn; 2011."},"year":"2011"},{"language":[{"iso":"eng"}],"project":[{"_id":"1","name":"SFB 901"},{"_id":"5","name":"SFB 901 - Subprojekt A1"},{"_id":"2","name":"SFB 901 - Project Area A"}],"_id":"667","user_id":"477","department":[{"_id":"63"}],"editor":[{"last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","id":"15523","first_name":"Friedhelm"},{"first_name":"Rajmohan ","last_name":"Rajaraman","full_name":"Rajaraman, Rajmohan "}],"status":"public","type":"conference_editor","title":"23rd Annual ACM Symposium on Parallelism in Algorithms and Architectures","doi":"10.1145/1989493","date_updated":"2022-01-06T07:03:14Z","date_created":"2017-10-17T12:43:02Z","year":"2011","citation":{"apa":"Meyer auf der Heide, F., &#38; Rajaraman, R. (Eds.). (2011). <i>23rd Annual ACM Symposium on Parallelism in Algorithms and Architectures</i>. <a href=\"https://doi.org/10.1145/1989493\">https://doi.org/10.1145/1989493</a>","bibtex":"@book{Meyer auf der Heide_Rajaraman_2011, title={23rd Annual ACM Symposium on Parallelism in Algorithms and Architectures}, DOI={<a href=\"https://doi.org/10.1145/1989493\">10.1145/1989493</a>}, year={2011} }","short":"F. Meyer auf der Heide, R. Rajaraman, eds., 23rd Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2011.","mla":"Meyer auf der Heide, Friedhelm, and Rajmohan Rajaraman, editors. <i>23rd Annual ACM Symposium on Parallelism in Algorithms and Architectures</i>. 2011, doi:<a href=\"https://doi.org/10.1145/1989493\">10.1145/1989493</a>.","ieee":"F. Meyer auf der Heide and R. Rajaraman, Eds., <i>23rd Annual ACM Symposium on Parallelism in Algorithms and Architectures</i>. 2011.","chicago":"Meyer auf der Heide, Friedhelm, and Rajmohan  Rajaraman, eds. <i>23rd Annual ACM Symposium on Parallelism in Algorithms and Architectures</i>, 2011. <a href=\"https://doi.org/10.1145/1989493\">https://doi.org/10.1145/1989493</a>.","ama":"Meyer auf der Heide F, Rajaraman R, eds. <i>23rd Annual ACM Symposium on Parallelism in Algorithms and Architectures</i>.; 2011. doi:<a href=\"https://doi.org/10.1145/1989493\">10.1145/1989493</a>"}},{"author":[{"full_name":"Kaimann, Daniel","id":"18949","last_name":"Kaimann","first_name":"Daniel"}],"date_created":"2017-10-17T12:43:02Z","date_updated":"2022-01-06T07:03:15Z","publisher":"Universität Paderborn","title":"\"To infinity and beyond!\" - A genre-specific film analysis of movie success mechanisms","has_accepted_license":"1","citation":{"apa":"Kaimann, D. (2011). <i>“To infinity and beyond!” - A genre-specific film analysis of movie success mechanisms</i>. Universität Paderborn.","short":"D. Kaimann, “To Infinity and beyond!” - A Genre-Specific Film Analysis of Movie Success Mechanisms, Universität Paderborn, 2011.","bibtex":"@book{Kaimann_2011, title={“To infinity and beyond!” - A genre-specific film analysis of movie success mechanisms}, publisher={Universität Paderborn}, author={Kaimann, Daniel}, year={2011} }","mla":"Kaimann, Daniel. <i>“To Infinity and beyond!” - A Genre-Specific Film Analysis of Movie Success Mechanisms</i>. Universität Paderborn, 2011.","ama":"Kaimann D. <i>“To Infinity and beyond!” - A Genre-Specific Film Analysis of Movie Success Mechanisms</i>. Universität Paderborn; 2011.","ieee":"D. Kaimann, <i>“To infinity and beyond!” - A genre-specific film analysis of movie success mechanisms</i>. Universität Paderborn, 2011.","chicago":"Kaimann, Daniel. <i>“To Infinity and beyond!” - A Genre-Specific Film Analysis of Movie Success Mechanisms</i>. Universität Paderborn, 2011."},"year":"2011","department":[{"_id":"183"}],"user_id":"477","_id":"668","project":[{"name":"SFB 901","_id":"1"},{"_id":"7","name":"SFB 901 - Subprojekt A3"},{"name":"SFB 901 - Project Area A","_id":"2"}],"file_date_updated":"2018-03-14T13:30:32Z","language":[{"iso":"eng"}],"ddc":["040"],"type":"report","status":"public","file":[{"content_type":"application/pdf","relation":"main_file","success":1,"date_created":"2018-03-14T13:30:32Z","creator":"florida","date_updated":"2018-03-14T13:30:32Z","access_level":"closed","file_id":"1213","file_name":"668-SSRN-id2076540.pdf","file_size":800960}],"abstract":[{"lang":"eng","text":"The objective of this study is the analysis of movie success mechanisms in a genre-specific context. Instead of the examination of all time box office champions, we focus on the two film genres of computer animated and comic book based films. By introducing the concept of the motion-picture marketing mix, which represents a set of tactical marketing tools in order to strengthen a company’s strategic customer orientation, we are able to systematically identify key movie success factors. We conduct a cross-sectional empirical analysis across regional distinctions based on dataset that covers a time horizon of more than 30 years. We find empirical evidence that actors with ex ante popularity, award nominations and the production budget represent key movie success mechanisms and significantly influence a movie’s commercial appeal. Additionally, word-of-mouth creates reputation effects that also significantly affects box office gross."}]}]