[{"year":"2011","citation":{"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.","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>.","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>","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>","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."},"page":"15-22","has_accepted_license":"1","title":"Performance Prototyping with ProtoCom in a Virtualised Environment: A Case Study","doi":"10.5445/IR/1000025188 ","date_updated":"2022-01-06T07:03:10Z","author":[{"first_name":"Sebastian","last_name":"Lehrig","full_name":"Lehrig, Sebastian"},{"first_name":"Thomas","last_name":"Zolynski","full_name":"Zolynski, Thomas"}],"date_created":"2017-10-17T12:42:59Z","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":[{"date_updated":"2018-03-14T13:53:10Z","date_created":"2018-03-14T13:53:10Z","creator":"florida","file_size":773622,"file_id":"1222","file_name":"653-Protocom-Lehrig_Zolynski.pdf","access_level":"closed","content_type":"application/pdf","success":1,"relation":"main_file"}],"status":"public","type":"conference","publication":"Proceedings of the Palladio Days 2011","ddc":["040"],"file_date_updated":"2018-03-14T13:53:10Z","project":[{"name":"SFB 901","_id":"1"},{"_id":"11","name":"SFB 901 - Subprojekt B3"},{"name":"SFB 901 - Project Area B","_id":"3"}],"_id":"653","user_id":"15504","series_title":"Karlsruhe Reports in Informatics"},{"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"}],"status":"public","file":[{"content_type":"application/pdf","relation":"main_file","success":1,"date_created":"2018-03-14T13:50:18Z","creator":"florida","date_updated":"2018-03-14T13:50:18Z","file_name":"654-IEEE.P2P.11._Kalman.Graffi_PeerfactSim-A.P2P.System.Simulator_01.pdf","file_id":"1221","access_level":"closed","file_size":327680}],"publication":"Proceedings of the IEEE International Conference on Peer-to-Peer Computing (IEEE PsP)","type":"conference","ddc":["040"],"file_date_updated":"2018-03-14T13:50:18Z","language":[{"iso":"eng"}],"_id":"654","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt A1","_id":"5"},{"_id":"2","name":"SFB 901 - Project Area A"}],"department":[{"_id":"79"}],"user_id":"477","year":"2011","page":"154-155","citation":{"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.","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>.","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>","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>","short":"K. Graffi, in: Proceedings of the IEEE International Conference on Peer-to-Peer Computing (IEEE PsP), 2011, pp. 154–155.","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>."},"has_accepted_license":"1","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"},{"language":[{"iso":"ger"}],"title":"Modellgetriebene Skalierbarkeitsanalyse von selbst-adaptiven Komponentenbasierten Softwaresystemen in der Cloud","user_id":"477","date_created":"2017-10-17T12:42:59Z","author":[{"first_name":"Joachim","last_name":"Meyer","full_name":"Meyer, Joachim"}],"_id":"655","project":[{"_id":"1","name":"SFB 901"},{"_id":"11","name":"SFB 901 - Subprojekt B3"},{"_id":"3","name":"SFB 901 - Project Area B"}],"date_updated":"2022-01-06T07:03:11Z","publisher":"Universität Paderborn","status":"public","citation":{"short":"J. Meyer, Modellgetriebene Skalierbarkeitsanalyse von selbst-adaptiven Komponentenbasierten Softwaresystemen in der Cloud, Universität Paderborn, 2011.","bibtex":"@book{Meyer_2011, title={Modellgetriebene Skalierbarkeitsanalyse von selbst-adaptiven Komponentenbasierten Softwaresystemen in der Cloud}, publisher={Universität Paderborn}, author={Meyer, Joachim}, year={2011} }","mla":"Meyer, Joachim. <i>Modellgetriebene Skalierbarkeitsanalyse von selbst-adaptiven Komponentenbasierten Softwaresystemen in der Cloud</i>. Universität Paderborn, 2011.","apa":"Meyer, J. (2011). <i>Modellgetriebene Skalierbarkeitsanalyse von selbst-adaptiven Komponentenbasierten Softwaresystemen in der Cloud</i>. Universität Paderborn.","chicago":"Meyer, Joachim. <i>Modellgetriebene Skalierbarkeitsanalyse von selbst-adaptiven Komponentenbasierten Softwaresystemen in der Cloud</i>. Universität Paderborn, 2011.","ieee":"J. Meyer, <i>Modellgetriebene Skalierbarkeitsanalyse von selbst-adaptiven Komponentenbasierten Softwaresystemen in der Cloud</i>. Universität Paderborn, 2011.","ama":"Meyer J. <i>Modellgetriebene Skalierbarkeitsanalyse von selbst-adaptiven Komponentenbasierten Softwaresystemen in der Cloud</i>. Universität Paderborn; 2011."},"year":"2011","type":"mastersthesis"},{"ddc":["040"],"file_date_updated":"2018-03-14T13:48:21Z","language":[{"iso":"eng"}],"project":[{"_id":"1","name":"SFB 901"},{"_id":"5","name":"SFB 901 - Subprojekt A1"},{"name":"SFB 901 - Project Area A","_id":"2"}],"_id":"657","user_id":"477","series_title":"LNCS","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":[{"relation":"main_file","success":1,"content_type":"application/pdf","file_name":"657-flp_algosensors2011-Cord-Landwehr.pdf","file_id":"1219","access_level":"closed","file_size":454740,"date_created":"2018-03-14T13:48:21Z","creator":"florida","date_updated":"2018-03-14T13:48:21Z"}],"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)","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","date_created":"2017-10-17T12:43:00Z","author":[{"first_name":"Sebastan","last_name":"Abshoff","full_name":"Abshoff, Sebastan"},{"full_name":"Cord-Landwehr, Andreas","last_name":"Cord-Landwehr","first_name":"Andreas"},{"first_name":"Bastian","last_name":"Degener","full_name":"Degener, Bastian"},{"full_name":"Kempkes, Barbara ","last_name":"Kempkes","first_name":"Barbara "},{"first_name":"Peter","last_name":"Pietrzyk","full_name":"Pietrzyk, Peter"}],"year":"2011","citation":{"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>","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} }","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.","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>.","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"},{"language":[{"iso":"eng"}],"user_id":"477","department":[{"_id":"77"}],"project":[{"_id":"1","name":"SFB 901"},{"_id":"12","name":"SFB 901 - Subprojekt B4"},{"name":"SFB 901 - Project Area B","_id":"3"}],"_id":"658","status":"public","type":"mastersthesis","title":"Function Specification Inference Using Craig Interpolation","date_created":"2017-10-17T12:43:00Z","supervisor":[{"first_name":"Heike","last_name":"Wehrheim","full_name":"Wehrheim, Heike","id":"573"}],"author":[{"first_name":"Alexander","full_name":"Schremmer, Alexander","last_name":"Schremmer"}],"date_updated":"2022-01-06T07:03:12Z","publisher":"Universität Paderborn","citation":{"ama":"Schremmer A. <i>Function Specification Inference Using Craig Interpolation</i>. Universität Paderborn; 2011.","ieee":"A. Schremmer, <i>Function Specification Inference Using Craig Interpolation</i>. Universität Paderborn, 2011.","chicago":"Schremmer, Alexander. <i>Function Specification Inference Using Craig Interpolation</i>. Universität Paderborn, 2011.","apa":"Schremmer, A. (2011). <i>Function Specification Inference Using Craig Interpolation</i>. Universität Paderborn.","short":"A. Schremmer, Function Specification Inference Using Craig Interpolation, Universität Paderborn, 2011.","bibtex":"@book{Schremmer_2011, title={Function Specification Inference Using Craig Interpolation}, publisher={Universität Paderborn}, author={Schremmer, Alexander}, year={2011} }","mla":"Schremmer, Alexander. <i>Function Specification Inference Using Craig Interpolation</i>. Universität Paderborn, 2011."},"year":"2011"},{"file_date_updated":"2018-03-14T13:47:44Z","ddc":["040"],"department":[{"_id":"64"}],"user_id":"25078","_id":"659","project":[{"_id":"1","name":"SFB 901"},{"_id":"13","name":"SFB 901 - Subprojekt C1"},{"_id":"4","name":"SFB 901 - Project Area C"},{"name":"Securing the Financial Cloud","_id":"43"}],"status":"public","file":[{"date_updated":"2018-03-14T13:47:44Z","creator":"florida","date_created":"2018-03-14T13:47:44Z","file_size":1795920,"file_name":"659-MA_Fault_attacks_in_pairing-based_cryptography_01.pdf","file_id":"1218","access_level":"closed","content_type":"application/pdf","success":1,"relation":"main_file"}],"type":"mastersthesis","title":"Fault attacks in pairing-based cryptography","date_created":"2017-10-17T12:43:00Z","supervisor":[{"first_name":"Johannes","id":"23","full_name":"Blömer, Johannes","last_name":"Blömer"}],"author":[{"last_name":"Liske","full_name":"Liske, Gennadij","first_name":"Gennadij"}],"publisher":"Universität Paderborn","date_updated":"2022-01-06T07:03:13Z","citation":{"short":"G. Liske, Fault Attacks in Pairing-Based Cryptography, Universität Paderborn, 2011.","mla":"Liske, Gennadij. <i>Fault Attacks in Pairing-Based Cryptography</i>. Universität Paderborn, 2011.","bibtex":"@book{Liske_2011, title={Fault attacks in pairing-based cryptography}, publisher={Universität Paderborn}, author={Liske, Gennadij}, year={2011} }","apa":"Liske, G. (2011). <i>Fault attacks in pairing-based cryptography</i>. Universität Paderborn.","ama":"Liske G. <i>Fault Attacks in Pairing-Based Cryptography</i>. Universität Paderborn; 2011.","chicago":"Liske, Gennadij. <i>Fault Attacks in Pairing-Based Cryptography</i>. Universität Paderborn, 2011.","ieee":"G. Liske, <i>Fault attacks in pairing-based cryptography</i>. Universität Paderborn, 2011."},"year":"2011","has_accepted_license":"1"},{"user_id":"15504","department":[{"_id":"75"}],"project":[{"name":"SFB 901","_id":"1"},{"_id":"6","name":"SFB 901 - Subprojekt A2"},{"name":"SFB 901 - Project Area A","_id":"2"}],"_id":"660","status":"public","type":"bachelorsthesis","title":"Defining and Deploying Complex Applicances in Multi-Site Cloud Environments","date_created":"2017-10-17T12:43:00Z","author":[{"full_name":"Peuster, Manuel","id":"13271","last_name":"Peuster","first_name":"Manuel"}],"publisher":"Universität Paderborn","date_updated":"2022-01-06T07:03:13Z","citation":{"apa":"Peuster, M. (2011). <i>Defining and Deploying Complex Applicances in Multi-Site Cloud Environments</i>. Universität Paderborn.","short":"M. Peuster, Defining and Deploying Complex Applicances in Multi-Site Cloud Environments, 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} }","mla":"Peuster, Manuel. <i>Defining and Deploying Complex Applicances in Multi-Site Cloud Environments</i>. Universität Paderborn, 2011.","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."},"year":"2011"},{"year":"2011","citation":{"apa":"Arifulina, S. (2011). <i>Coverage Criteria for Testing DMM Specifications</i>. Universität Paderborn.","short":"S. Arifulina, Coverage Criteria for Testing DMM Specifications, Universität Paderborn, 2011.","bibtex":"@book{Arifulina_2011, title={Coverage Criteria for Testing DMM Specifications}, publisher={Universität Paderborn}, author={Arifulina, Svetlana}, year={2011} }","mla":"Arifulina, Svetlana. <i>Coverage Criteria for Testing DMM Specifications</i>. Universität Paderborn, 2011.","ieee":"S. Arifulina, <i>Coverage Criteria for Testing DMM Specifications</i>. Universität Paderborn, 2011.","chicago":"Arifulina, Svetlana. <i>Coverage Criteria for Testing DMM Specifications</i>. Universität Paderborn, 2011.","ama":"Arifulina S. <i>Coverage Criteria for Testing DMM Specifications</i>. Universität Paderborn; 2011."},"publisher":"Universität Paderborn","date_updated":"2022-01-06T07:03:13Z","author":[{"full_name":"Arifulina, Svetlana","last_name":"Arifulina","first_name":"Svetlana"}],"supervisor":[{"id":"107","full_name":"Engels, Gregor","last_name":"Engels","first_name":"Gregor"}],"date_created":"2017-10-17T12:43:00Z","title":"Coverage Criteria for Testing DMM Specifications","type":"mastersthesis","status":"public","_id":"661","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt B1","_id":"9"},{"_id":"3","name":"SFB 901 - Project Area B"}],"department":[{"_id":"66"}],"user_id":"477","language":[{"iso":"eng"}]},{"file":[{"date_updated":"2018-03-14T13:46:48Z","date_created":"2018-03-14T13:46:48Z","creator":"florida","file_size":305543,"access_level":"closed","file_name":"662-SSS2011-Corona-Scheideler.pdf","file_id":"1217","content_type":"application/pdf","success":1,"relation":"main_file"}],"status":"public","abstract":[{"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.","lang":"eng"}],"type":"conference","publication":"Proceedings of the 13th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS)","file_date_updated":"2018-03-14T13:46:48Z","ddc":["040"],"user_id":"15504","series_title":"LNCS","department":[{"_id":"79"}],"project":[{"name":"SFB 901","_id":"1"},{"_id":"5","name":"SFB 901 - Subprojekt A1"},{"name":"SFB 901 - Project Area A","_id":"2"}],"_id":"662","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","has_accepted_license":"1","doi":"10.1007/978-3-642-24550-3_27","title":"Corona: A Stabilizing Deterministic Message-Passing Skip List","author":[{"first_name":"Mikhail","last_name":"Nesterenko","full_name":"Nesterenko, Mikhail"},{"full_name":"Mohd, Rizal","last_name":"Mohd","first_name":"Rizal"},{"full_name":"Scheideler, Christian","id":"20792","last_name":"Scheideler","first_name":"Christian"}],"date_created":"2017-10-17T12:43:01Z","date_updated":"2022-01-06T07:03:13Z"},{"language":[{"iso":"eng"}],"department":[{"_id":"63"}],"user_id":"477","_id":"663","project":[{"_id":"1","name":"SFB 901"},{"_id":"5","name":"SFB 901 - Subprojekt A1"},{"name":"SFB 901 - Project Area A","_id":"2"}],"status":"public","type":"mastersthesis","title":"Complexity Classes for Local Computation","author":[{"last_name":"Swierkot","full_name":"Swierkot, Kamil","first_name":"Kamil"}],"date_created":"2017-10-17T12:43:01Z","supervisor":[{"last_name":"Meyer auf der Heide","id":"15523","full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm"}],"publisher":"Universität Paderborn","date_updated":"2022-01-06T07:03:13Z","citation":{"chicago":"Swierkot, Kamil. <i>Complexity Classes for Local Computation</i>. Universität Paderborn, 2011.","ieee":"K. Swierkot, <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.","bibtex":"@book{Swierkot_2011, title={Complexity Classes for Local Computation}, publisher={Universität Paderborn}, author={Swierkot, Kamil}, year={2011} }","short":"K. Swierkot, Complexity Classes for Local Computation, Universität Paderborn, 2011.","mla":"Swierkot, Kamil. <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."},"year":"2011"},{"has_accepted_license":"1","year":"2011","page":"31--40","citation":{"apa":"Gehweiler, J., Kling, P., &#38; Meyer auf der Heide, F. (2011). An Experimental Comparison of Load Balancing Strategies in a Web Computing Environment. In <i>Proceedings of the 9th International Conference on Parallel Processing and Applied Mathematics (PPAM)</i> (pp. 31--40). <a href=\"https://doi.org/10.1007/978-3-642-31500-8_4\">https://doi.org/10.1007/978-3-642-31500-8_4</a>","short":"J. Gehweiler, P. Kling, F. Meyer auf der Heide, in: Proceedings of the 9th International Conference on Parallel Processing and Applied Mathematics (PPAM), 2011, pp. 31--40.","bibtex":"@inproceedings{Gehweiler_Kling_Meyer auf der Heide_2011, series={LNCS}, title={An Experimental Comparison of Load Balancing Strategies in a Web Computing Environment}, DOI={<a href=\"https://doi.org/10.1007/978-3-642-31500-8_4\">10.1007/978-3-642-31500-8_4</a>}, booktitle={Proceedings of the 9th International Conference on Parallel Processing and Applied Mathematics (PPAM)}, author={Gehweiler, Joachim and Kling, Peter and Meyer auf der Heide, Friedhelm}, year={2011}, pages={31--40}, collection={LNCS} }","mla":"Gehweiler, Joachim, et al. “An Experimental Comparison of Load Balancing Strategies in a Web Computing Environment.” <i>Proceedings of the 9th International Conference on Parallel Processing and Applied Mathematics (PPAM)</i>, 2011, pp. 31--40, doi:<a href=\"https://doi.org/10.1007/978-3-642-31500-8_4\">10.1007/978-3-642-31500-8_4</a>.","chicago":"Gehweiler, Joachim, Peter Kling, and Friedhelm Meyer auf der Heide. “An Experimental Comparison of Load Balancing Strategies in a Web Computing Environment.” In <i>Proceedings of the 9th International Conference on Parallel Processing and Applied Mathematics (PPAM)</i>, 31--40. LNCS, 2011. <a href=\"https://doi.org/10.1007/978-3-642-31500-8_4\">https://doi.org/10.1007/978-3-642-31500-8_4</a>.","ieee":"J. Gehweiler, P. Kling, and F. Meyer auf der Heide, “An Experimental Comparison of Load Balancing Strategies in a Web Computing Environment,” in <i>Proceedings of the 9th International Conference on Parallel Processing and Applied Mathematics (PPAM)</i>, 2011, pp. 31--40.","ama":"Gehweiler J, Kling P, Meyer auf der Heide F. An Experimental Comparison of Load Balancing Strategies in a Web Computing Environment. In: <i>Proceedings of the 9th International Conference on Parallel Processing and Applied Mathematics (PPAM)</i>. LNCS. ; 2011:31--40. doi:<a href=\"https://doi.org/10.1007/978-3-642-31500-8_4\">10.1007/978-3-642-31500-8_4</a>"},"date_updated":"2022-01-06T07:03:14Z","date_created":"2017-10-17T12:43:01Z","author":[{"last_name":"Gehweiler","full_name":"Gehweiler, Joachim","first_name":"Joachim"},{"full_name":"Kling, Peter","last_name":"Kling","first_name":"Peter"},{"first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm","id":"15523","last_name":"Meyer auf der Heide"}],"title":"An Experimental Comparison of Load Balancing Strategies in a Web Computing Environment","doi":"10.1007/978-3-642-31500-8_4","publication":"Proceedings of the 9th International Conference on Parallel Processing and Applied Mathematics (PPAM)","type":"conference","abstract":[{"lang":"eng","text":"Web Computing is a variant of parallel computing where the idle times of PCs donated by worldwide distributed users are employed to execute parallel programs. The PUB-Web library developed by us supports this kind of usage of computing resources. A major problem for the efficient execution of such parallel programs is load balancing. In the Web Computing context, this problem becomes more difficult because of the dynamic behavior of the underlying \"parallel computer\": the set of available processors (donated PCs) as well as their availability (idle times) change over time in an unpredictable fashion.In this paper, we experimentally evaluate and compare load balancing algorithms in this scenario, namely a variant of the well-established Work Stealing algorithm and strategies based on a heterogeneous version of distributed hash-tables (DHHTs) introduced recently. In order to run a meaningful experimental evaluation, we employ, in addition to our Web Computing library PUB-Web, realistic data sets for the job input streams and for the dynamics of the availability of the resources.Our experimental evaluations suggest that Work Stealing is the better strategy if the number of processes ready to run matches the number of available processors. But a suitable variant of DHHTs outperforms Work Stealing if there are significantly more processes ready to run than available processors."}],"status":"public","file":[{"relation":"main_file","success":1,"content_type":"application/pdf","access_level":"closed","file_name":"664-PPAM11GKM_01.pdf","file_id":"1216","file_size":333335,"creator":"florida","date_created":"2018-03-14T13:45:57Z","date_updated":"2018-03-14T13:45:57Z"}],"_id":"664","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt C4","_id":"16"},{"_id":"14","name":"SFB 901 - Subproject C2"},{"_id":"4","name":"SFB 901 - Project Area C"}],"department":[{"_id":"63"}],"series_title":"LNCS","user_id":"15504","ddc":["040"],"file_date_updated":"2018-03-14T13:45:57Z"},{"year":"2011","citation":{"mla":"Wette, Philip. <i>Adaptives Loadbalancing für strukturierte Peer-to-Peer-Netzwerke am Beispiel von Chord</i>. Universität Paderborn, 2011.","short":"P. Wette, Adaptives Loadbalancing für strukturierte Peer-to-Peer-Netzwerke am Beispiel von Chord, 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} }","apa":"Wette, P. (2011). <i>Adaptives Loadbalancing für strukturierte Peer-to-Peer-Netzwerke am Beispiel von Chord</i>. Universität Paderborn.","ama":"Wette P. <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.","chicago":"Wette, Philip. <i>Adaptives Loadbalancing für strukturierte Peer-to-Peer-Netzwerke am Beispiel von Chord</i>. Universität Paderborn, 2011."},"title":"Adaptives Loadbalancing für strukturierte Peer-to-Peer-Netzwerke am Beispiel von Chord","date_updated":"2022-01-06T07:03:14Z","publisher":"Universität Paderborn","supervisor":[{"first_name":"Christian","last_name":"Scheideler","id":"20792","full_name":"Scheideler, Christian"}],"author":[{"first_name":"Philip","last_name":"Wette","full_name":"Wette, Philip"}],"date_created":"2017-10-17T12:43:01Z","status":"public","type":"mastersthesis","language":[{"iso":"ger"}],"_id":"665","project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt A1","_id":"5"},{"name":"SFB 901 - Project Area A","_id":"2"}],"department":[{"_id":"79"}],"user_id":"477"},{"file":[{"file_size":666039,"file_name":"666-drzevitzky11_recosoc.pdf","file_id":"1214","access_level":"closed","date_updated":"2018-03-14T13:40:48Z","date_created":"2018-03-14T13:40:48Z","creator":"florida","success":1,"relation":"main_file","content_type":"application/pdf"}],"status":"public","abstract":[{"lang":"eng","text":"Reconfigurable systems on chip are increasingly deployed in security and safety critical contexts. When downloading and configuring new hardware functions, we want to make sure that modules adhere to certain security specifications and do not, for example, contain hardware Trojans. As a possible approach to achieving hardware security we propose and demonstrate the concept of proof-carrying hardware, a concept inspired by previous work on proof-carrying code techniques in the software domain. In this paper, we discuss the hardware trust and threat models behind proof-carrying hardware and then present our experimental setup. We detail the employed open-source tool chain for the runtime verification of combinational equivalence and our bitstream format for an abstract FPGA architecture that allows us to experimentally validate the feasibility of our approach."}],"type":"conference","publication":"Proceedings of the 6th International Workshop on Reconfigurable Communication-centric Systems-on-Chip (ReCoSoC)","file_date_updated":"2018-03-14T13:40:48Z","language":[{"iso":"eng"}],"ddc":["040"],"user_id":"477","department":[{"_id":"78"}],"project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt B4","_id":"12"},{"name":"SFB 901 - Project Area B","_id":"3"}],"_id":"666","citation":{"ama":"Drzevitzky S, Platzner M. Achieving Hardware Security for Reconfigurable Systems on Chip by a Proof-Carrying Code Approach. In: <i>Proceedings of the 6th International Workshop on Reconfigurable Communication-Centric Systems-on-Chip (ReCoSoC)</i>. ; 2011:58-65. doi:<a href=\"https://doi.org/10.1109/ReCoSoC.2011.5981499\">10.1109/ReCoSoC.2011.5981499</a>","chicago":"Drzevitzky, Stephanie, and Marco Platzner. “Achieving Hardware Security for Reconfigurable Systems on Chip by a Proof-Carrying Code Approach.” In <i>Proceedings of the 6th International Workshop on Reconfigurable Communication-Centric Systems-on-Chip (ReCoSoC)</i>, 58–65, 2011. <a href=\"https://doi.org/10.1109/ReCoSoC.2011.5981499\">https://doi.org/10.1109/ReCoSoC.2011.5981499</a>.","ieee":"S. Drzevitzky and M. Platzner, “Achieving Hardware Security for Reconfigurable Systems on Chip by a Proof-Carrying Code Approach,” in <i>Proceedings of the 6th International Workshop on Reconfigurable Communication-centric Systems-on-Chip (ReCoSoC)</i>, 2011, pp. 58–65.","bibtex":"@inproceedings{Drzevitzky_Platzner_2011, title={Achieving Hardware Security for Reconfigurable Systems on Chip by a Proof-Carrying Code Approach}, DOI={<a href=\"https://doi.org/10.1109/ReCoSoC.2011.5981499\">10.1109/ReCoSoC.2011.5981499</a>}, booktitle={Proceedings of the 6th International Workshop on Reconfigurable Communication-centric Systems-on-Chip (ReCoSoC)}, author={Drzevitzky, Stephanie and Platzner, Marco}, year={2011}, pages={58–65} }","mla":"Drzevitzky, Stephanie, and Marco Platzner. “Achieving Hardware Security for Reconfigurable Systems on Chip by a Proof-Carrying Code Approach.” <i>Proceedings of the 6th International Workshop on Reconfigurable Communication-Centric Systems-on-Chip (ReCoSoC)</i>, 2011, pp. 58–65, doi:<a href=\"https://doi.org/10.1109/ReCoSoC.2011.5981499\">10.1109/ReCoSoC.2011.5981499</a>.","short":"S. Drzevitzky, M. Platzner, in: Proceedings of the 6th International Workshop on Reconfigurable Communication-Centric Systems-on-Chip (ReCoSoC), 2011, pp. 58–65.","apa":"Drzevitzky, S., &#38; Platzner, M. (2011). Achieving Hardware Security for Reconfigurable Systems on Chip by a Proof-Carrying Code Approach. In <i>Proceedings of the 6th International Workshop on Reconfigurable Communication-centric Systems-on-Chip (ReCoSoC)</i> (pp. 58–65). <a href=\"https://doi.org/10.1109/ReCoSoC.2011.5981499\">https://doi.org/10.1109/ReCoSoC.2011.5981499</a>"},"page":"58-65","year":"2011","has_accepted_license":"1","doi":"10.1109/ReCoSoC.2011.5981499","title":"Achieving Hardware Security for Reconfigurable Systems on Chip by a Proof-Carrying Code Approach","author":[{"first_name":"Stephanie","last_name":"Drzevitzky","full_name":"Drzevitzky, Stephanie"},{"last_name":"Platzner","full_name":"Platzner, Marco","id":"398","first_name":"Marco"}],"date_created":"2017-10-17T12:43:01Z","date_updated":"2022-01-06T07:03:14Z"},{"editor":[{"first_name":"Friedhelm","id":"15523","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide"},{"last_name":"Rajaraman","full_name":"Rajaraman, Rajmohan ","first_name":"Rajmohan "}],"status":"public","type":"conference_editor","language":[{"iso":"eng"}],"project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt A1","_id":"5"},{"name":"SFB 901 - Project Area A","_id":"2"}],"_id":"667","user_id":"477","department":[{"_id":"63"}],"year":"2011","citation":{"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>.","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.","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>","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>","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>."},"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"},{"file":[{"relation":"main_file","success":1,"content_type":"application/pdf","access_level":"closed","file_id":"1213","file_name":"668-SSRN-id2076540.pdf","file_size":800960,"creator":"florida","date_created":"2018-03-14T13:30:32Z","date_updated":"2018-03-14T13:30:32Z"}],"status":"public","abstract":[{"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.","lang":"eng"}],"type":"report","language":[{"iso":"eng"}],"file_date_updated":"2018-03-14T13:30:32Z","ddc":["040"],"user_id":"477","department":[{"_id":"183"}],"project":[{"name":"SFB 901","_id":"1"},{"_id":"7","name":"SFB 901 - Subprojekt A3"},{"name":"SFB 901 - Project Area A","_id":"2"}],"_id":"668","citation":{"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.","short":"D. Kaimann, “To Infinity and beyond!” - A Genre-Specific Film Analysis of Movie Success Mechanisms, Universität Paderborn, 2011.","apa":"Kaimann, D. (2011). <i>“To infinity and beyond!” - A genre-specific film analysis of movie success mechanisms</i>. Universität Paderborn.","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","has_accepted_license":"1","title":"\"To infinity and beyond!\" - A genre-specific film analysis of movie success mechanisms","date_created":"2017-10-17T12:43:02Z","author":[{"first_name":"Daniel","last_name":"Kaimann","full_name":"Kaimann, Daniel","id":"18949"}],"date_updated":"2022-01-06T07:03:15Z","publisher":"Universität Paderborn"},{"status":"public","publication":"Advances in Databases - 28th British National Conference on Databases, BNCOD 28, Revised Selected Papers","type":"conference","language":[{"iso":"eng"}],"_id":"6740","department":[{"_id":"66"},{"_id":"69"}],"user_id":"14961","series_title":"Lecture Notes in Computer Science","year":"2011","intvolume":"      7051","page":"209-220","citation":{"ama":"Böttcher S, Bokermann D, Hartel R. Computing Compressed XML Data from Relational Databases. In: <i>Advances in Databases - 28th British National Conference on Databases, BNCOD 28, Revised Selected Papers</i>. Vol 7051. Lecture Notes in Computer Science. Springer Berlin/Heidelberg; 2011:209-220.","ieee":"S. Böttcher, D. Bokermann, and R. Hartel, “Computing Compressed XML Data from Relational Databases,” in <i>Advances in Databases - 28th British National Conference on Databases, BNCOD 28, Revised Selected Papers</i>, 2011, vol. 7051, pp. 209–220.","chicago":"Böttcher, Stefan, Dennis Bokermann, and Rita Hartel. “Computing Compressed XML Data from Relational Databases.” In <i>Advances in Databases - 28th British National Conference on Databases, BNCOD 28, Revised Selected Papers</i>, 7051:209–20. Lecture Notes in Computer Science. Springer Berlin/Heidelberg, 2011.","mla":"Böttcher, Stefan, et al. “Computing Compressed XML Data from Relational Databases.” <i>Advances in Databases - 28th British National Conference on Databases, BNCOD 28, Revised Selected Papers</i>, vol. 7051, Springer Berlin/Heidelberg, 2011, pp. 209–20.","bibtex":"@inproceedings{Böttcher_Bokermann_Hartel_2011, series={Lecture Notes in Computer Science}, title={Computing Compressed XML Data from Relational Databases}, volume={7051}, booktitle={Advances in Databases - 28th British National Conference on Databases, BNCOD 28, Revised Selected Papers}, publisher={Springer Berlin/Heidelberg}, author={Böttcher, Stefan and Bokermann, Dennis and Hartel, Rita}, year={2011}, pages={209–220}, collection={Lecture Notes in Computer Science} }","short":"S. Böttcher, D. Bokermann, R. Hartel, in: Advances in Databases - 28th British National Conference on Databases, BNCOD 28, Revised Selected Papers, Springer Berlin/Heidelberg, 2011, pp. 209–220.","apa":"Böttcher, S., Bokermann, D., &#38; Hartel, R. (2011). Computing Compressed XML Data from Relational Databases. In <i>Advances in Databases - 28th British National Conference on Databases, BNCOD 28, Revised Selected Papers</i> (Vol. 7051, pp. 209–220). Springer Berlin/Heidelberg."},"publication_status":"published","title":"Computing Compressed XML Data from Relational Databases","publisher":"Springer Berlin/Heidelberg","date_updated":"2022-01-06T07:03:17Z","volume":7051,"date_created":"2019-01-15T14:49:24Z","author":[{"last_name":"Böttcher","full_name":"Böttcher, Stefan","id":"624","first_name":"Stefan"},{"id":"11308","full_name":"Bokermann, Dennis","last_name":"Bokermann","first_name":"Dennis"},{"id":"14961","full_name":"Hartel, Rita","last_name":"Hartel","first_name":"Rita"}]},{"title":"Narrative in Drama","date_created":"2019-01-16T09:28:30Z","publisher":"WVT","date_updated":"2022-01-06T07:03:17Z","corporate_editor":["Contemporary Drama in English"],"citation":{"apa":"Tönnies, M., Flotmann, C., &#38; Contemporary Drama in English (Eds.). (2011). <i>Narrative in Drama</i>. Trier: WVT.","bibtex":"@book{Tönnies_Flotmann_Contemporary Drama in English_2011, place={Trier}, title={Narrative in Drama}, publisher={WVT}, year={2011} }","mla":"Tönnies, Merle, et al., editors. <i>Narrative in Drama</i>. WVT, 2011.","short":"M. Tönnies, C. Flotmann, Contemporary Drama in English, eds., Narrative in Drama, WVT, Trier, 2011.","chicago":"Tönnies, Merle, Christina Flotmann, and Contemporary Drama in English, eds. <i>Narrative in Drama</i>. Trier: WVT, 2011.","ieee":"M. Tönnies, C. Flotmann, and Contemporary Drama in English, Eds., <i>Narrative in Drama</i>. Trier: WVT, 2011.","ama":"Tönnies M, Flotmann C, Contemporary Drama in English, eds. <i>Narrative in Drama</i>. Trier: WVT; 2011."},"year":"2011","place":"Trier","publication_status":"published","language":[{"iso":"eng"}],"department":[{"_id":"36"},{"_id":"1"},{"_id":"380"}],"user_id":"32277","_id":"6755","status":"public","editor":[{"id":"555","full_name":"Tönnies, Merle","last_name":"Tönnies","first_name":"Merle"},{"first_name":"Christina","full_name":"Flotmann, Christina","id":"8736","last_name":"Flotmann"}],"type":"book_editor"},{"status":"public","publication":"Wissenschaftliche Verhandlungen 2011 der Deutschen Physikalischen Gesellschaft,  Dresden, März 2011 ","type":"conference","language":[{"iso":"eng"}],"department":[{"_id":"53"}],"user_id":"16148","_id":"6833","citation":{"chicago":"Bendfeld, Jörg, and Stefan Krauter. “Meteorological Measurements in the Baltic and the North Sea.” In <i>Wissenschaftliche Verhandlungen 2011 Der Deutschen Physikalischen Gesellschaft,  Dresden, März 2011 </i>, 2011.","ieee":"J. Bendfeld and S. Krauter, “Meteorological measurements in the Baltic and the North Sea,” in <i>Wissenschaftliche Verhandlungen 2011 der Deutschen Physikalischen Gesellschaft,  Dresden, März 2011 </i>, 2011.","ama":"Bendfeld J, Krauter S. Meteorological measurements in the Baltic and the North Sea. In: <i>Wissenschaftliche Verhandlungen 2011 Der Deutschen Physikalischen Gesellschaft,  Dresden, März 2011 </i>. ; 2011.","short":"J. Bendfeld, S. Krauter, in: Wissenschaftliche Verhandlungen 2011 Der Deutschen Physikalischen Gesellschaft,  Dresden, März 2011 , 2011.","mla":"Bendfeld, Jörg, and Stefan Krauter. “Meteorological Measurements in the Baltic and the North Sea.” <i>Wissenschaftliche Verhandlungen 2011 Der Deutschen Physikalischen Gesellschaft,  Dresden, März 2011 </i>, 2011.","bibtex":"@inproceedings{Bendfeld_Krauter_2011, title={Meteorological measurements in the Baltic and the North Sea}, booktitle={Wissenschaftliche Verhandlungen 2011 der Deutschen Physikalischen Gesellschaft,  Dresden, März 2011 }, author={Bendfeld, Jörg and Krauter, Stefan}, year={2011} }","apa":"Bendfeld, J., &#38; Krauter, S. (2011). Meteorological measurements in the Baltic and the North Sea. In <i>Wissenschaftliche Verhandlungen 2011 der Deutschen Physikalischen Gesellschaft,  Dresden, März 2011 </i>."},"year":"2011","conference":{"name":"DPG-Frühjahrstagung 11"},"title":"Meteorological measurements in the Baltic and the North Sea","author":[{"last_name":"Bendfeld","id":"16148","full_name":"Bendfeld, Jörg","first_name":"Jörg"},{"first_name":"Stefan","last_name":"Krauter","orcid":"0000-0002-3594-260X","full_name":"Krauter, Stefan","id":"28836"}],"date_created":"2019-01-17T08:40:31Z","date_updated":"2022-01-06T07:03:21Z"},{"status":"public","publication":"Wissenschaftliche Verhandlungen 2011 der Deutschen Physikalischen Gesellschaft,  Dresden, März 2011","type":"conference","language":[{"iso":"eng"}],"_id":"6834","department":[{"_id":"53"}],"user_id":"16148","year":"2011","citation":{"apa":"Bendfeld, J., &#38; Krauter, S. (2011). Hybrid measuring devices for evaluation of waves and currents. In <i>Wissenschaftliche Verhandlungen 2011 der Deutschen Physikalischen Gesellschaft,  Dresden, März 2011</i>.","bibtex":"@inproceedings{Bendfeld_Krauter_2011, title={Hybrid measuring devices for evaluation of waves and currents}, booktitle={Wissenschaftliche Verhandlungen 2011 der Deutschen Physikalischen Gesellschaft,  Dresden, März 2011}, author={Bendfeld, Jörg and Krauter, Stefan}, year={2011} }","mla":"Bendfeld, Jörg, and Stefan Krauter. “Hybrid Measuring Devices for Evaluation of Waves and Currents.” <i>Wissenschaftliche Verhandlungen 2011 Der Deutschen Physikalischen Gesellschaft,  Dresden, März 2011</i>, 2011.","short":"J. Bendfeld, S. Krauter, in: Wissenschaftliche Verhandlungen 2011 Der Deutschen Physikalischen Gesellschaft,  Dresden, März 2011, 2011.","chicago":"Bendfeld, Jörg, and Stefan Krauter. “Hybrid Measuring Devices for Evaluation of Waves and Currents.” In <i>Wissenschaftliche Verhandlungen 2011 Der Deutschen Physikalischen Gesellschaft,  Dresden, März 2011</i>, 2011.","ieee":"J. Bendfeld and S. Krauter, “Hybrid measuring devices for evaluation of waves and currents,” in <i>Wissenschaftliche Verhandlungen 2011 der Deutschen Physikalischen Gesellschaft,  Dresden, März 2011</i>, 2011.","ama":"Bendfeld J, Krauter S. Hybrid measuring devices for evaluation of waves and currents. In: <i>Wissenschaftliche Verhandlungen 2011 Der Deutschen Physikalischen Gesellschaft,  Dresden, März 2011</i>. ; 2011."},"title":"Hybrid measuring devices for evaluation of waves and currents","conference":{"name":"DPG-Frühjahrstagung 11"},"date_updated":"2022-01-06T07:03:21Z","author":[{"first_name":"Jörg","last_name":"Bendfeld","full_name":"Bendfeld, Jörg","id":"16148"},{"last_name":"Krauter","orcid":"0000-0002-3594-260X","id":"28836","full_name":"Krauter, Stefan","first_name":"Stefan"}],"date_created":"2019-01-17T08:41:27Z"},{"department":[{"_id":"53"}],"user_id":"16148","_id":"6835","language":[{"iso":"eng"}],"publication":"Proceedings of the Decentralized Power Systems (DPS) 2011, Paderborn, Germany, 2. September 2011","type":"conference","status":"public","author":[{"first_name":"Jörg","last_name":"Bendfeld","full_name":"Bendfeld, Jörg","id":"16148"}],"date_created":"2019-01-17T08:42:43Z","date_updated":"2022-01-06T07:03:21Z","conference":{"name":"Decentralized Power Systems (DPS) 2011, Paderborn, Germany, 2. September 2011"},"title":"Increased availability of offshore wind power by distributed biogas plants","citation":{"ama":"Bendfeld J. Increased availability of offshore wind power by distributed biogas plants. In: <i>Proceedings of the Decentralized Power Systems (DPS) 2011, Paderborn, Germany, 2. September 2011</i>. ; 2011.","chicago":"Bendfeld, Jörg. “Increased Availability of Offshore Wind Power by Distributed Biogas Plants.” In <i>Proceedings of the Decentralized Power Systems (DPS) 2011, Paderborn, Germany, 2. September 2011</i>, 2011.","ieee":"J. Bendfeld, “Increased availability of offshore wind power by distributed biogas plants,” in <i>Proceedings of the Decentralized Power Systems (DPS) 2011, Paderborn, Germany, 2. September 2011</i>, 2011.","apa":"Bendfeld, J. (2011). Increased availability of offshore wind power by distributed biogas plants. In <i>Proceedings of the Decentralized Power Systems (DPS) 2011, Paderborn, Germany, 2. September 2011</i>.","bibtex":"@inproceedings{Bendfeld_2011, title={Increased availability of offshore wind power by distributed biogas plants}, booktitle={Proceedings of the Decentralized Power Systems (DPS) 2011, Paderborn, Germany, 2. September 2011}, author={Bendfeld, Jörg}, year={2011} }","short":"J. Bendfeld, in: Proceedings of the Decentralized Power Systems (DPS) 2011, Paderborn, Germany, 2. September 2011, 2011.","mla":"Bendfeld, Jörg. “Increased Availability of Offshore Wind Power by Distributed Biogas Plants.” <i>Proceedings of the Decentralized Power Systems (DPS) 2011, Paderborn, Germany, 2. September 2011</i>, 2011."},"year":"2011"}]