[{"type":"dissertation","department":[{"_id":"78"}],"file":[{"file_name":"586-Drzevitzky-PhD_01.pdf","access_level":"closed","file_size":1438436,"relation":"main_file","date_updated":"2018-03-15T08:38:19Z","file_id":"1261","success":1,"content_type":"application/pdf","creator":"florida","date_created":"2018-03-15T08:38:19Z"}],"date_created":"2017-10-17T12:42:46Z","abstract":[{"lang":"eng","text":"FPGAs, systems on chip and embedded systems are nowadays irreplaceable. They combine the computational power of application specific hardware with software-like flexibility. At runtime, they can adjust their functionality by downloading new hardware modules and integrating their functionality. Due to their growing capabilities, the demands made to reconfigurable hardware grow. Their deployment in increasingly security critical scenarios requires new ways of enforcing security since a failure in security has severe consequences. Aside from financial losses, a loss of human life and risks to national security are possible. With this work I present the novel and groundbreaking concept of proof-carrying hardware. It is a method for the verification of properties of hardware modules to guarantee security for a target platform at runtime. The producer of a hardware module delivers based on the consumer's safety policy a safety proof in combination with the reconfiguration bitstream. The extensive computation of a proof is a contrast to the comparatively undemanding checking of the proof. I present a prototype based on open-source tools and an abstract FPGA architecture and bitstream format. The proof of the usability of proof-carrying hardware provides the evaluation of the prototype with the exemplary application of securing combinational and bounded sequential equivalence of reference monitor modules for memory safety."},{"text":"FPGAs, System on Chips und eingebettete Systeme sind heutzutage kaum mehr wegzudenken. Sie kombinieren die Rechenleistung von spezialisierter Hardware mit einer Software-ähnlichen Flexibilität. Zur Laufzeit können sie ihre Funktionalität anpassen, indem sie online neue Hardware Module beziehen und deren Funktionalität integrieren. Mit der Leistung wachsen auch die Anforderungen an rekonfigurierbare Hardware. Ihr Einsatz in immer sicherheitskritischeren Szenarien erfordert neue Wege um Sicherheit zu gewährleisten, da ein Versagen der Sicherheit gravierende Folgen mit sich bringt. Neben finanziellen Verlusten sind auch der Verlust von Menschenleben oder Einbußen in der nationalen Sicherheit denkbar. In dieser Arbeit stelle ich das neue und wegweisende Konzept der beweistragenden Hardware vor. Es ist eine Methode zur Verifizierung von Eigenschaften von Hardware Modulen um die Sicherheit der Zielplatformen zur Laufzeit zu garantieren. Der Produzent eines Hardware Moduls liefert, basierend auf den Sicherheitsbestimmungen des Konsumenten, einen Beweis der Sicherheit mit dem Rekonfigurierungsbitstrom. Die aufwendige Berechnung des Beweises steht im Kontrast zu der vergleichsweise unaufwendigen Überprüfung durch den Konsumenten. Ich präsentiere einen Prototypen basierend auf Open Source Werkzeugen und einer eigenen abstrakten FPGA Architektur samt Bitstromformat. Den Nachweis über die Nutzbarkeit von beweistragender Hardware erbringt die Evaluierung des Prototypen zur beispielhaften Anwendung der Sicherung von kombinatorischer und begrenzt sequenzieller Äquivalenz von Referenzmonitor-Modulen zur Speichersicherheit.","lang":"ger"}],"main_file_link":[{"url":"https://nbn-resolving.de/urn:nbn:de:hbz:466:2-10423","open_access":"1"}],"language":[{"iso":"eng"}],"publication_status":"published","date_updated":"2022-01-06T07:02:44Z","year":"2012","title":"Proof-Carrying Hardware: A Novel Approach to Reconfigurable Hardware Security","author":[{"last_name":"Drzevitzky","first_name":"Stephanie","full_name":"Drzevitzky, Stephanie"}],"oa":"1","project":[{"_id":"12","name":"SFB 901 - Subprojekt B4"},{"_id":"1","name":"SFB 901"},{"_id":"3","name":"SFB 901 - Project Area B"}],"file_date_updated":"2018-03-15T08:38:19Z","citation":{"mla":"Drzevitzky, Stephanie. <i>Proof-Carrying Hardware: A Novel Approach to Reconfigurable Hardware Security</i>. Universität Paderborn, 2012.","ama":"Drzevitzky S. <i>Proof-Carrying Hardware: A Novel Approach to Reconfigurable Hardware Security</i>. Universität Paderborn; 2012.","bibtex":"@book{Drzevitzky_2012, title={Proof-Carrying Hardware: A Novel Approach to Reconfigurable Hardware Security}, publisher={Universität Paderborn}, author={Drzevitzky, Stephanie}, year={2012} }","apa":"Drzevitzky, S. (2012). <i>Proof-Carrying Hardware: A Novel Approach to Reconfigurable Hardware Security</i>. Universität Paderborn.","ieee":"S. Drzevitzky, <i>Proof-Carrying Hardware: A Novel Approach to Reconfigurable Hardware Security</i>. Universität Paderborn, 2012.","chicago":"Drzevitzky, Stephanie. <i>Proof-Carrying Hardware: A Novel Approach to Reconfigurable Hardware Security</i>. Universität Paderborn, 2012.","short":"S. Drzevitzky, Proof-Carrying Hardware: A Novel Approach to Reconfigurable Hardware Security, Universität Paderborn, 2012."},"supervisor":[{"id":"398","full_name":"Platzner, Marco","last_name":"Platzner","first_name":"Marco"}],"user_id":"477","ddc":["040"],"page":"114","_id":"586","publisher":"Universität Paderborn","has_accepted_license":"1","status":"public"},{"department":[{"_id":"27"},{"_id":"518"},{"_id":"78"}],"type":"misc","date_created":"2017-10-17T12:42:46Z","file":[{"date_created":"2018-03-15T08:37:02Z","creator":"florida","file_id":"1260","content_type":"application/pdf","success":1,"file_name":"587-2012_plessl_awareness_magazine.pdf","access_level":"closed","file_size":353057,"relation":"main_file","date_updated":"2018-03-15T08:37:02Z"}],"project":[{"_id":"1","name":"SFB 901"},{"_id":"14","name":"SFB 901 - Subprojekt C2"},{"name":"SFB 901 - Project Area C","_id":"4"}],"citation":{"short":"C. Plessl, M. Platzner, A. Agne, M. Happe, E. Lübbers, Programming Models for Reconfigurable Heterogeneous Multi-Cores, Awareness Magazine, 2012.","chicago":"Plessl, Christian, Marco Platzner, Andreas Agne, Markus Happe, and Enno Lübbers. <i>Programming Models for Reconfigurable Heterogeneous Multi-Cores</i>. Awareness Magazine, 2012.","apa":"Plessl, C., Platzner, M., Agne, A., Happe, M., &#38; Lübbers, E. (2012). <i>Programming models for reconfigurable heterogeneous multi-cores</i>. Awareness Magazine.","ieee":"C. Plessl, M. Platzner, A. Agne, M. Happe, and E. Lübbers, <i>Programming models for reconfigurable heterogeneous multi-cores</i>. Awareness Magazine, 2012.","ama":"Plessl C, Platzner M, Agne A, Happe M, Lübbers E. <i>Programming Models for Reconfigurable Heterogeneous Multi-Cores</i>. Awareness Magazine; 2012.","bibtex":"@book{Plessl_Platzner_Agne_Happe_Lübbers_2012, title={Programming models for reconfigurable heterogeneous multi-cores}, publisher={Awareness Magazine}, author={Plessl, Christian and Platzner, Marco and Agne, Andreas and Happe, Markus and Lübbers, Enno}, year={2012} }","mla":"Plessl, Christian, et al. <i>Programming Models for Reconfigurable Heterogeneous Multi-Cores</i>. Awareness Magazine, 2012."},"file_date_updated":"2018-03-15T08:37:02Z","user_id":"398","ddc":["040"],"language":[{"iso":"eng"}],"_id":"587","publisher":"Awareness Magazine","has_accepted_license":"1","date_updated":"2022-01-06T07:02:44Z","author":[{"id":"16153","first_name":"Christian","orcid":"0000-0001-5728-9982","last_name":"Plessl","full_name":"Plessl, Christian"},{"full_name":"Platzner, Marco","last_name":"Platzner","first_name":"Marco","id":"398"},{"last_name":"Agne","first_name":"Andreas","full_name":"Agne, Andreas"},{"full_name":"Happe, Markus","last_name":"Happe","first_name":"Markus"},{"full_name":"Lübbers, Enno","first_name":"Enno","last_name":"Lübbers"}],"year":"2012","status":"public","title":"Programming models for reconfigurable heterogeneous multi-cores"},{"abstract":[{"lang":"eng","text":"We come up with a digital rights management (DRM) concept for cloud computing and show how license management for software within the cloud can be achieved in a privacy-friendly manner. In our scenario, users who buy software from software providers stay anonymous. At the same time, our approach guarantees that software licenses are bound to users and their validity is checked before execution. We employ a software re-encryption scheme so that computing centers which execute users’ software are not able to build user profiles—not even under pseudonym—of their users. We combine secret sharing and homomorphic encryption. We make sure that malicious users are unable to relay software to others. DRM constitutes an incentive for software providers to take part in a future cloud computing scenario.We make this scenario more attractive for users by preserving their privacy."}],"project":[{"name":"SFB 901","_id":"1"},{"_id":"13","name":"SFB 901 - Subprojekt C1"},{"_id":"4","name":"SFB 901 - Project Area C"}],"publication":"Proceedings of the 26th IEEE International Conference on Advanced Information Networking and Applications (AINA)","file_date_updated":"2018-03-15T08:36:16Z","citation":{"bibtex":"@inproceedings{Petrlic_Sorge_2012, title={Privacy-Preserving DRM for Cloud Computing}, DOI={<a href=\"https://doi.org/10.1109/WAINA.2012.92\">10.1109/WAINA.2012.92</a>}, booktitle={Proceedings of the 26th IEEE International Conference on Advanced Information Networking and Applications (AINA)}, author={Petrlic, Ronald and Sorge, Christoph}, year={2012}, pages={1286–1291} }","ama":"Petrlic R, Sorge C. Privacy-Preserving DRM for Cloud Computing. In: <i>Proceedings of the 26th IEEE International Conference on Advanced Information Networking and Applications (AINA)</i>. ; 2012:1286-1291. doi:<a href=\"https://doi.org/10.1109/WAINA.2012.92\">10.1109/WAINA.2012.92</a>","short":"R. Petrlic, C. Sorge, in: Proceedings of the 26th IEEE International Conference on Advanced Information Networking and Applications (AINA), 2012, pp. 1286–1291.","chicago":"Petrlic, Ronald, and Christoph Sorge. “Privacy-Preserving DRM for Cloud Computing.” In <i>Proceedings of the 26th IEEE International Conference on Advanced Information Networking and Applications (AINA)</i>, 1286–91, 2012. <a href=\"https://doi.org/10.1109/WAINA.2012.92\">https://doi.org/10.1109/WAINA.2012.92</a>.","ieee":"R. Petrlic and C. Sorge, “Privacy-Preserving DRM for Cloud Computing,” in <i>Proceedings of the 26th IEEE International Conference on Advanced Information Networking and Applications (AINA)</i>, 2012, pp. 1286–1291.","mla":"Petrlic, Ronald, and Christoph Sorge. “Privacy-Preserving DRM for Cloud Computing.” <i>Proceedings of the 26th IEEE International Conference on Advanced Information Networking and Applications (AINA)</i>, 2012, pp. 1286–91, doi:<a href=\"https://doi.org/10.1109/WAINA.2012.92\">10.1109/WAINA.2012.92</a>.","apa":"Petrlic, R., &#38; Sorge, C. (2012). Privacy-Preserving DRM for Cloud Computing. In <i>Proceedings of the 26th IEEE International Conference on Advanced Information Networking and Applications (AINA)</i> (pp. 1286–1291). <a href=\"https://doi.org/10.1109/WAINA.2012.92\">https://doi.org/10.1109/WAINA.2012.92</a>"},"type":"conference","file":[{"date_updated":"2018-03-15T08:36:16Z","relation":"main_file","access_level":"closed","file_size":194323,"file_name":"588-drm0-published_01.pdf","success":1,"content_type":"application/pdf","file_id":"1259","creator":"florida","date_created":"2018-03-15T08:36:16Z"}],"date_created":"2017-10-17T12:42:46Z","date_updated":"2022-01-06T07:02:45Z","has_accepted_license":"1","title":"Privacy-Preserving DRM for Cloud Computing","year":"2012","status":"public","author":[{"last_name":"Petrlic","first_name":"Ronald","full_name":"Petrlic, Ronald"},{"first_name":"Christoph","last_name":"Sorge","full_name":"Sorge, Christoph"}],"ddc":["040"],"doi":"10.1109/WAINA.2012.92","user_id":"15504","page":"1286-1291","_id":"588"},{"type":"conference","date_created":"2017-10-17T12:42:47Z","file":[{"relation":"main_file","date_updated":"2018-03-15T08:40:15Z","file_name":"589-published-trustcom.pdf","access_level":"closed","file_size":179985,"file_id":"1264","success":1,"content_type":"application/pdf","creator":"florida","date_created":"2018-03-15T08:40:15Z"}],"project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt C1","_id":"13"},{"_id":"4","name":"SFB 901 - Project Area C"}],"abstract":[{"text":"We present a privacy-preserving DRM scheme for a (future) cloud computing software market. In such a market, applications are packed into virtual machines (VMs) by software providers and the VMs can be executed at any computing center within the cloud. We propose the introduction of a software TPM as a container for VM-specific keys within the VM that moves around with the VM within the cloud. The software TPM is coupled to a virtual TPM at a computing center to constitute the root of trust for a local DRM enforcement system within the VM that checks the license before each application execution. This allows flexible price models, e.g. execute at most n timeslike models. Users have proof that their personally identifiable information, stored and processed within the VM at a computing center, cannot be obtained by the computing center. A feature of our solution is that neither software provider nor computing center are able to build usage profiles of the software executions.","lang":"eng"}],"citation":{"chicago":"Petrlic, Ronald. “Privacy-Preserving Digital Rights Management in a Trusted Cloud Environment.” In <i>Proceedings of the 11th IEEE International Conference on Trust, Security and Privacy in Computing and Communications (TrustCom)</i>, 958–63, 2012. <a href=\"https://doi.org/10.1109/TrustCom.2012.225\">https://doi.org/10.1109/TrustCom.2012.225</a>.","short":"R. Petrlic, in: Proceedings of the 11th IEEE International Conference on Trust, Security and Privacy in Computing and Communications (TrustCom), 2012, pp. 958–963.","apa":"Petrlic, R. (2012). Privacy-Preserving Digital Rights Management in a Trusted Cloud Environment. In <i>Proceedings of the 11th IEEE International Conference on Trust, Security and Privacy in Computing and Communications (TrustCom)</i> (pp. 958–963). <a href=\"https://doi.org/10.1109/TrustCom.2012.225\">https://doi.org/10.1109/TrustCom.2012.225</a>","ieee":"R. Petrlic, “Privacy-Preserving Digital Rights Management in a Trusted Cloud Environment,” in <i>Proceedings of the 11th IEEE International Conference on Trust, Security and Privacy in Computing and Communications (TrustCom)</i>, 2012, pp. 958–963.","ama":"Petrlic R. Privacy-Preserving Digital Rights Management in a Trusted Cloud Environment. In: <i>Proceedings of the 11th IEEE International Conference on Trust, Security and Privacy in Computing and Communications (TrustCom)</i>. ; 2012:958-963. doi:<a href=\"https://doi.org/10.1109/TrustCom.2012.225\">10.1109/TrustCom.2012.225</a>","bibtex":"@inproceedings{Petrlic_2012, title={Privacy-Preserving Digital Rights Management in a Trusted Cloud Environment}, DOI={<a href=\"https://doi.org/10.1109/TrustCom.2012.225\">10.1109/TrustCom.2012.225</a>}, booktitle={Proceedings of the 11th IEEE International Conference on Trust, Security and Privacy in Computing and Communications (TrustCom)}, author={Petrlic, Ronald}, year={2012}, pages={958–963} }","mla":"Petrlic, Ronald. “Privacy-Preserving Digital Rights Management in a Trusted Cloud Environment.” <i>Proceedings of the 11th IEEE International Conference on Trust, Security and Privacy in Computing and Communications (TrustCom)</i>, 2012, pp. 958–63, doi:<a href=\"https://doi.org/10.1109/TrustCom.2012.225\">10.1109/TrustCom.2012.225</a>."},"publication":"Proceedings of the 11th IEEE International Conference on Trust, Security and Privacy in Computing and Communications (TrustCom)","file_date_updated":"2018-03-15T08:40:15Z","ddc":["040"],"doi":"10.1109/TrustCom.2012.225","user_id":"477","language":[{"iso":"eng"}],"_id":"589","page":"958-963","has_accepted_license":"1","date_updated":"2022-01-06T07:02:45Z","author":[{"full_name":"Petrlic, Ronald","first_name":"Ronald","last_name":"Petrlic"}],"year":"2012","status":"public","title":"Privacy-Preserving Digital Rights Management in a Trusted Cloud Environment"},{"file_date_updated":"2018-03-15T08:33:56Z","citation":{"ieee":"D. Wonisch and H. Wehrheim, “Predicate Analysis with Block-Abstraction Memoization,” in <i>Proceedings of the 14th International Conference on Formal Engineering Methods (ICFEM)</i>, 2012, pp. 332–347.","apa":"Wonisch, D., &#38; Wehrheim, H. (2012). Predicate Analysis with Block-Abstraction Memoization. In <i>Proceedings of the 14th International Conference on Formal Engineering Methods (ICFEM)</i> (pp. 332–347). <a href=\"https://doi.org/10.1007/978-3-642-34281-3_24\">https://doi.org/10.1007/978-3-642-34281-3_24</a>","short":"D. Wonisch, H. Wehrheim, in: Proceedings of the 14th International Conference on Formal Engineering Methods (ICFEM), 2012, pp. 332–347.","chicago":"Wonisch, Daniel, and Heike Wehrheim. “Predicate Analysis with Block-Abstraction Memoization.” In <i>Proceedings of the 14th International Conference on Formal Engineering Methods (ICFEM)</i>, 332–47. LNCS, 2012. <a href=\"https://doi.org/10.1007/978-3-642-34281-3_24\">https://doi.org/10.1007/978-3-642-34281-3_24</a>.","mla":"Wonisch, Daniel, and Heike Wehrheim. “Predicate Analysis with Block-Abstraction Memoization.” <i>Proceedings of the 14th International Conference on Formal Engineering Methods (ICFEM)</i>, 2012, pp. 332–47, doi:<a href=\"https://doi.org/10.1007/978-3-642-34281-3_24\">10.1007/978-3-642-34281-3_24</a>.","bibtex":"@inproceedings{Wonisch_Wehrheim_2012, series={LNCS}, title={Predicate Analysis with Block-Abstraction Memoization}, DOI={<a href=\"https://doi.org/10.1007/978-3-642-34281-3_24\">10.1007/978-3-642-34281-3_24</a>}, booktitle={Proceedings of the 14th International Conference on Formal Engineering Methods (ICFEM)}, author={Wonisch, Daniel and Wehrheim, Heike}, year={2012}, pages={332–347}, collection={LNCS} }","ama":"Wonisch D, Wehrheim H. Predicate Analysis with Block-Abstraction Memoization. In: <i>Proceedings of the 14th International Conference on Formal Engineering Methods (ICFEM)</i>. LNCS. ; 2012:332-347. doi:<a href=\"https://doi.org/10.1007/978-3-642-34281-3_24\">10.1007/978-3-642-34281-3_24</a>"},"project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt B4","_id":"12"},{"_id":"3","name":"SFB 901 - Project Area B"}],"page":"332-347","_id":"590","user_id":"477","ddc":["040"],"status":"public","has_accepted_license":"1","file":[{"file_size":320901,"access_level":"closed","file_name":"590-WonischWehrheim2012.pdf","date_updated":"2018-03-15T08:33:56Z","relation":"main_file","success":1,"content_type":"application/pdf","file_id":"1258","creator":"florida","date_created":"2018-03-15T08:33:56Z"}],"date_created":"2017-10-17T12:42:47Z","type":"conference","department":[{"_id":"77"}],"publication":"Proceedings of the 14th International Conference on Formal Engineering Methods (ICFEM)","abstract":[{"lang":"eng","text":"Predicate abstraction is an established technique for reducing the size of the state space during verification. In this paper, we extend predication abstraction with block-abstraction memoization (BAM), which exploits the fact that blocks are often executed several times in a program. The verification can thus benefit from caching the values of previous block analyses and reusing them upon next entry into a block. In addition to function bodies, BAM also performs well for nested loops. To further increase effectiveness, block memoization has been integrated with lazy abstraction adopting a lazy strategy for cache refinement. Together, this achieves significant performance increases: our tool (an implementation within the configurable program analysis framework CPAchecker) has won the Competition on Software Verification 2012 in the category “Overall”."}],"language":[{"iso":"eng"}],"series_title":"LNCS","doi":"10.1007/978-3-642-34281-3_24","title":"Predicate Analysis with Block-Abstraction Memoization","year":"2012","author":[{"full_name":"Wonisch, Daniel","first_name":"Daniel","last_name":"Wonisch"},{"id":"573","full_name":"Wehrheim, Heike","last_name":"Wehrheim","first_name":"Heike"}],"date_updated":"2022-01-06T07:02:46Z"},{"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt A3","_id":"7"},{"name":"SFB 901 - Project Area A","_id":"2"}],"citation":{"apa":"Celik, A. (2012). <i>Penny Auctions: Design und Strategisches Verhalten</i>. Universität Paderborn.","ieee":"A. Celik, <i>Penny Auctions: Design und Strategisches Verhalten</i>. Universität Paderborn, 2012.","chicago":"Celik, Aydin. <i>Penny Auctions: Design und Strategisches Verhalten</i>. Universität Paderborn, 2012.","short":"A. Celik, Penny Auctions: Design und Strategisches Verhalten, Universität Paderborn, 2012.","mla":"Celik, Aydin. <i>Penny Auctions: Design und Strategisches Verhalten</i>. Universität Paderborn, 2012.","ama":"Celik A. <i>Penny Auctions: Design und Strategisches Verhalten</i>. Universität Paderborn; 2012.","bibtex":"@book{Celik_2012, title={Penny Auctions: Design und Strategisches Verhalten}, publisher={Universität Paderborn}, author={Celik, Aydin}, year={2012} }"},"type":"mastersthesis","date_created":"2017-10-17T12:42:47Z","date_updated":"2022-01-06T07:02:47Z","author":[{"full_name":"Celik, Aydin","first_name":"Aydin","last_name":"Celik"}],"title":"Penny Auctions: Design und Strategisches Verhalten","status":"public","year":"2012","user_id":"477","_id":"592","language":[{"iso":"ger"}],"publisher":"Universität Paderborn"},{"user_id":"477","language":[{"iso":"ger"}],"_id":"593","publisher":"Universität Paderborn","date_updated":"2022-01-06T07:02:47Z","year":"2012","title":"Optimale Zuteilung von Nutzern zu verteilten Cloud-Standorten","status":"public","author":[{"last_name":"Rojahn","first_name":"Tobias","full_name":"Rojahn, Tobias"}],"type":"bachelorsthesis","department":[{"_id":"75"}],"date_created":"2017-10-17T12:42:47Z","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt A2","_id":"6"},{"_id":"2","name":"SFB 901 - Project Area A"}],"citation":{"mla":"Rojahn, Tobias. <i>Optimale Zuteilung von Nutzern zu verteilten Cloud-Standorten</i>. Universität Paderborn, 2012.","bibtex":"@book{Rojahn_2012, title={Optimale Zuteilung von Nutzern zu verteilten Cloud-Standorten}, publisher={Universität Paderborn}, author={Rojahn, Tobias}, year={2012} }","ama":"Rojahn T. <i>Optimale Zuteilung von Nutzern zu verteilten Cloud-Standorten</i>. Universität Paderborn; 2012.","ieee":"T. Rojahn, <i>Optimale Zuteilung von Nutzern zu verteilten Cloud-Standorten</i>. Universität Paderborn, 2012.","apa":"Rojahn, T. (2012). <i>Optimale Zuteilung von Nutzern zu verteilten Cloud-Standorten</i>. Universität Paderborn.","short":"T. Rojahn, Optimale Zuteilung von Nutzern zu verteilten Cloud-Standorten, Universität Paderborn, 2012.","chicago":"Rojahn, Tobias. <i>Optimale Zuteilung von Nutzern zu verteilten Cloud-Standorten</i>. Universität Paderborn, 2012."}},{"citation":{"bibtex":"@book{Klerx_2012, title={Online Parameteroptimierung in P2P-Netzwerken mit Hilfe von Neuronalen Netzen}, publisher={Universität Paderborn}, author={Klerx, Timo}, year={2012} }","ama":"Klerx T. <i>Online Parameteroptimierung in P2P-Netzwerken mit Hilfe von Neuronalen Netzen</i>. Universität Paderborn; 2012.","mla":"Klerx, Timo. <i>Online Parameteroptimierung in P2P-Netzwerken mit Hilfe von Neuronalen Netzen</i>. Universität Paderborn, 2012.","chicago":"Klerx, Timo. <i>Online Parameteroptimierung in P2P-Netzwerken mit Hilfe von Neuronalen Netzen</i>. Universität Paderborn, 2012.","short":"T. Klerx, Online Parameteroptimierung in P2P-Netzwerken mit Hilfe von Neuronalen Netzen, Universität Paderborn, 2012.","ieee":"T. Klerx, <i>Online Parameteroptimierung in P2P-Netzwerken mit Hilfe von Neuronalen Netzen</i>. Universität Paderborn, 2012.","apa":"Klerx, T. (2012). <i>Online Parameteroptimierung in P2P-Netzwerken mit Hilfe von Neuronalen Netzen</i>. Universität Paderborn."},"project":[{"_id":"1","name":"SFB 901"},{"_id":"5","name":"SFB 901 - Subprojekt A1"},{"name":"SFB 901 - Project Area A","_id":"2"}],"date_created":"2017-10-17T12:42:47Z","type":"mastersthesis","title":"Online Parameteroptimierung in P2P-Netzwerken mit Hilfe von Neuronalen Netzen","year":"2012","status":"public","author":[{"full_name":"Klerx, Timo","last_name":"Klerx","first_name":"Timo"}],"date_updated":"2022-01-06T07:02:48Z","language":[{"iso":"ger"}],"_id":"594","publisher":"Universität Paderborn","user_id":"477"},{"year":"2012","status":"public","title":"On scheduling with multi-core and multi-speed processors using power down","author":[{"full_name":"Mallmann Trenn, Frederik","last_name":"Mallmann Trenn","first_name":"Frederik"}],"date_updated":"2022-01-06T07:02:48Z","publisher":"Universität Paderborn","_id":"595","user_id":"15504","citation":{"ieee":"F. Mallmann Trenn, <i>On scheduling with multi-core and multi-speed processors using power down</i>. Universität Paderborn, 2012.","apa":"Mallmann Trenn, F. (2012). <i>On scheduling with multi-core and multi-speed processors using power down</i>. Universität Paderborn.","short":"F. Mallmann Trenn, On Scheduling with Multi-Core and Multi-Speed Processors Using Power Down, Universität Paderborn, 2012.","chicago":"Mallmann Trenn, Frederik. <i>On Scheduling with Multi-Core and Multi-Speed Processors Using Power Down</i>. Universität Paderborn, 2012.","mla":"Mallmann Trenn, Frederik. <i>On Scheduling with Multi-Core and Multi-Speed Processors Using Power Down</i>. Universität Paderborn, 2012.","bibtex":"@book{Mallmann Trenn_2012, title={On scheduling with multi-core and multi-speed processors using power down}, publisher={Universität Paderborn}, author={Mallmann Trenn, Frederik}, year={2012} }","ama":"Mallmann Trenn F. <i>On Scheduling with Multi-Core and Multi-Speed Processors Using Power Down</i>. Universität Paderborn; 2012."},"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt C2","_id":"14"},{"_id":"4","name":"SFB 901 - Project Area C"}],"date_created":"2017-10-17T12:42:48Z","type":"bachelorsthesis"},{"project":[{"name":"SFB 901","_id":"1"},{"name":"SFB 901 - Subprojekt B3","_id":"11"},{"name":"SFB 901 - Project Area B","_id":"3"}],"abstract":[{"text":"To meet quality-of-service requirements in changing environments, modern software systems adapt themselves. The structure, and correspondingly the behavior, of these systems undergoes continuous change. Model-driven performance engineering, however, assumes static system structures, behavior, and deployment. Hence, self-adaptive systems pose new challenges to model-driven performance engineering. There are a few surveys on self-adaptive systems, performance engineering, and the combination of both in the literature. In contrast to existing work, here we focus on model-driven performance analysis approaches. Based on a systematic literature review, we present a classication, identify open issues, and outline further research.","lang":"eng"}],"citation":{"short":"M. Becker, M. Luckey, S. Becker, in: Proceedings of the 8th ACM SigSoft International Conference on Quality of Software Architectures (QoSA’12), 2012, pp. 117–122.","chicago":"Becker, Matthias, Markus Luckey, and Steffen Becker. “Model-Driven Performance Engineering of Self-Adaptive Systems: A Survey.” In <i>Proceedings of the 8th ACM SigSoft International Conference on Quality of Software Architectures (QoSA’12)</i>, 117–22, 2012. <a href=\"https://doi.org/10.1145/2304696.2304716\">https://doi.org/10.1145/2304696.2304716</a>.","apa":"Becker, M., Luckey, M., &#38; Becker, S. (2012). Model-Driven Performance Engineering of Self-Adaptive Systems: A Survey. In <i>Proceedings of the 8th ACM SigSoft International Conference on Quality of Software Architectures (QoSA’12)</i> (pp. 117–122). <a href=\"https://doi.org/10.1145/2304696.2304716\">https://doi.org/10.1145/2304696.2304716</a>","ieee":"M. Becker, M. Luckey, and S. Becker, “Model-Driven Performance Engineering of Self-Adaptive Systems: A Survey,” in <i>Proceedings of the 8th ACM SigSoft International Conference on Quality of Software Architectures (QoSA’12)</i>, 2012, pp. 117–122.","ama":"Becker M, Luckey M, Becker S. Model-Driven Performance Engineering of Self-Adaptive Systems: A Survey. In: <i>Proceedings of the 8th ACM SigSoft International Conference on Quality of Software Architectures (QoSA’12)</i>. ; 2012:117-122. doi:<a href=\"https://doi.org/10.1145/2304696.2304716\">10.1145/2304696.2304716</a>","bibtex":"@inproceedings{Becker_Luckey_Becker_2012, title={Model-Driven Performance Engineering of Self-Adaptive Systems: A Survey}, DOI={<a href=\"https://doi.org/10.1145/2304696.2304716\">10.1145/2304696.2304716</a>}, booktitle={Proceedings of the 8th ACM SigSoft International Conference on Quality of Software Architectures (QoSA’12)}, author={Becker, Matthias and Luckey, Markus and Becker, Steffen}, year={2012}, pages={117–122} }","mla":"Becker, Matthias, et al. “Model-Driven Performance Engineering of Self-Adaptive Systems: A Survey.” <i>Proceedings of the 8th ACM SigSoft International Conference on Quality of Software Architectures (QoSA’12)</i>, 2012, pp. 117–22, doi:<a href=\"https://doi.org/10.1145/2304696.2304716\">10.1145/2304696.2304716</a>."},"file_date_updated":"2018-03-15T08:23:31Z","publication":"Proceedings of the 8th ACM SigSoft International Conference on Quality of Software Architectures (QoSA'12)","type":"conference","date_created":"2017-10-17T12:42:48Z","file":[{"date_created":"2018-03-15T08:23:31Z","creator":"florida","content_type":"application/pdf","success":1,"file_id":"1256","file_size":141651,"access_level":"closed","file_name":"596-qosa25s-becker.pdf","date_updated":"2018-03-15T08:23:31Z","relation":"main_file"}],"has_accepted_license":"1","date_updated":"2022-01-06T07:02:48Z","author":[{"full_name":"Becker, Matthias","last_name":"Becker","first_name":"Matthias"},{"last_name":"Luckey","first_name":"Markus","full_name":"Luckey, Markus"},{"full_name":"Becker, Steffen","first_name":"Steffen","last_name":"Becker"}],"title":"Model-Driven Performance Engineering of Self-Adaptive Systems: A Survey","status":"public","year":"2012","user_id":"15504","ddc":["040"],"doi":"10.1145/2304696.2304716","_id":"596","page":"117-122"},{"type":"conference","date_created":"2017-10-17T12:42:48Z","file":[{"date_updated":"2018-03-15T08:20:53Z","relation":"main_file","file_size":345826,"access_level":"closed","file_name":"597-newtocs_01.pdf","content_type":"application/pdf","success":1,"file_id":"1254","creator":"florida","date_created":"2018-03-15T08:20:53Z"}],"project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt A3","_id":"7"},{"_id":"2","name":"SFB 901 - Project Area A"}],"abstract":[{"text":"We consider strategic games in which each player seeks a mixed strategy to minimize her cost evaluated by a concave valuation V (mapping probability distributions to reals); such valuations are used to model risk. In contrast to games with expectation-optimizer players where mixed equilibria always exist [15, 16], a mixed equilibrium for such games, called a V -equilibrium, may fail to exist, even though pure equilibria (if any) transfer over. What is the impact of such valuations on the existence, structure and complexity of mixed equilibria? We address this fundamental question for a particular concave valuation: expectation plus variance, denoted as RA, which stands for risk-averse; so, variance enters as a measure of risk and it is used as an additive adjustment to expectation. We obtain the following results about RA-equilibria:- A collection of general structural properties of RA-equilibria connecting to (i) E-equilibria and Var-equilibria, which correspond to the expectation and variance valuations E and Var, respectively, and to (ii) other weaker or incomparable equilibrium properties.- A second collection of (i) existence, (ii) equivalence and separation (with respect to E-equilibria), and (iii) characterization results for RA-equilibria in the new class of player-specific scheduling games. Using examples, we provide the first demonstration that going from E to RA may as well create new mixed (RA-)equilibria.- A purification technique to transform a player-specific scheduling game on identical links into a player-specific scheduling game so that all non-pure RA-equilibria are eliminated while new pure equilibria cannot be created; so, a particular game on two identical links yields one with no RA-equilibrium. As a by-product, the first-completeness result for the computation of RA-equilibria follows.","lang":"eng"}],"citation":{"ieee":"M. Mavronicolas and B. Monien, “Minimizing Expectation Plus Variance,” in <i>Proceedings of the 5th International Symposium on Algorithmic Game Theory (SAGT)</i>, 2012, pp. 239–250.","apa":"Mavronicolas, M., &#38; Monien, B. (2012). Minimizing Expectation Plus Variance. In <i>Proceedings of the 5th International Symposium on Algorithmic Game Theory (SAGT)</i> (pp. 239–250). <a href=\"https://doi.org/10.1007/978-3-642-33996-7_21\">https://doi.org/10.1007/978-3-642-33996-7_21</a>","short":"M. Mavronicolas, B. Monien, in: Proceedings of the 5th International Symposium on Algorithmic Game Theory (SAGT), 2012, pp. 239–250.","chicago":"Mavronicolas, Marios, and Burkhard Monien. “Minimizing Expectation Plus Variance.” In <i>Proceedings of the 5th International Symposium on Algorithmic Game Theory (SAGT)</i>, 239–50. LNCS, 2012. <a href=\"https://doi.org/10.1007/978-3-642-33996-7_21\">https://doi.org/10.1007/978-3-642-33996-7_21</a>.","mla":"Mavronicolas, Marios, and Burkhard Monien. “Minimizing Expectation Plus Variance.” <i>Proceedings of the 5th International Symposium on Algorithmic Game Theory (SAGT)</i>, 2012, pp. 239–50, doi:<a href=\"https://doi.org/10.1007/978-3-642-33996-7_21\">10.1007/978-3-642-33996-7_21</a>.","bibtex":"@inproceedings{Mavronicolas_Monien_2012, series={LNCS}, title={Minimizing Expectation Plus Variance}, DOI={<a href=\"https://doi.org/10.1007/978-3-642-33996-7_21\">10.1007/978-3-642-33996-7_21</a>}, booktitle={Proceedings of the 5th International Symposium on Algorithmic Game Theory (SAGT)}, author={Mavronicolas, Marios and Monien, Burkhard}, year={2012}, pages={239–250}, collection={LNCS} }","ama":"Mavronicolas M, Monien B. Minimizing Expectation Plus Variance. In: <i>Proceedings of the 5th International Symposium on Algorithmic Game Theory (SAGT)</i>. LNCS. ; 2012:239-250. doi:<a href=\"https://doi.org/10.1007/978-3-642-33996-7_21\">10.1007/978-3-642-33996-7_21</a>"},"publication":"Proceedings of the 5th International Symposium on Algorithmic Game Theory (SAGT)","file_date_updated":"2018-03-15T08:20:53Z","ddc":["040"],"doi":"10.1007/978-3-642-33996-7_21","user_id":"15504","_id":"597","series_title":"LNCS","page":"239-250","has_accepted_license":"1","date_updated":"2022-01-06T07:02:48Z","author":[{"last_name":"Mavronicolas","first_name":"Marios","full_name":"Mavronicolas, Marios"},{"first_name":"Burkhard","last_name":"Monien","full_name":"Monien, Burkhard"}],"year":"2012","title":"Minimizing Expectation Plus Variance","status":"public"},{"user_id":"477","_id":"598","publisher":"Universität Paderborn","language":[{"iso":"ger"}],"date_updated":"2022-01-06T07:02:48Z","status":"public","title":"Methoden zur Bestimmung von innerbetrieblichen Verrechnungspreisen","year":"2012","author":[{"last_name":"Mammadov","first_name":"Fuad","full_name":"Mammadov, Fuad"}],"type":"bachelorsthesis","date_created":"2017-10-17T12:42:48Z","project":[{"name":"SFB 901","_id":"1"},{"_id":"7","name":"SFB 901 - Subprojekt A3"},{"name":"SFB 901 - Project Area A","_id":"2"}],"citation":{"apa":"Mammadov, F. (2012). <i>Methoden zur Bestimmung von innerbetrieblichen Verrechnungspreisen</i>. Universität Paderborn.","ieee":"F. Mammadov, <i>Methoden zur Bestimmung von innerbetrieblichen Verrechnungspreisen</i>. Universität Paderborn, 2012.","short":"F. Mammadov, Methoden zur Bestimmung von innerbetrieblichen Verrechnungspreisen, Universität Paderborn, 2012.","chicago":"Mammadov, Fuad. <i>Methoden zur Bestimmung von innerbetrieblichen Verrechnungspreisen</i>. Universität Paderborn, 2012.","mla":"Mammadov, Fuad. <i>Methoden zur Bestimmung von innerbetrieblichen Verrechnungspreisen</i>. Universität Paderborn, 2012.","ama":"Mammadov F. <i>Methoden zur Bestimmung von innerbetrieblichen Verrechnungspreisen</i>. Universität Paderborn; 2012.","bibtex":"@book{Mammadov_2012, title={Methoden zur Bestimmung von innerbetrieblichen Verrechnungspreisen}, publisher={Universität Paderborn}, author={Mammadov, Fuad}, year={2012} }"}},{"date_created":"2017-10-17T12:42:48Z","type":"bachelorsthesis","citation":{"mla":"Löwen, Xenia. <i>Managerial Delegation and Capacity Choices: An Analysis of the Cournot-Nash Equilibrium</i>. Universität Paderborn, 2012.","bibtex":"@book{Löwen_2012, title={Managerial Delegation and Capacity Choices: An Analysis of the Cournot-Nash Equilibrium}, publisher={Universität Paderborn}, author={Löwen, Xenia}, year={2012} }","ama":"Löwen X. <i>Managerial Delegation and Capacity Choices: An Analysis of the Cournot-Nash Equilibrium</i>. Universität Paderborn; 2012.","ieee":"X. Löwen, <i>Managerial Delegation and Capacity Choices: An Analysis of the Cournot-Nash Equilibrium</i>. Universität Paderborn, 2012.","apa":"Löwen, X. (2012). <i>Managerial Delegation and Capacity Choices: An Analysis of the Cournot-Nash Equilibrium</i>. Universität Paderborn.","short":"X. Löwen, Managerial Delegation and Capacity Choices: An Analysis of the Cournot-Nash Equilibrium, Universität Paderborn, 2012.","chicago":"Löwen, Xenia. <i>Managerial Delegation and Capacity Choices: An Analysis of the Cournot-Nash Equilibrium</i>. Universität Paderborn, 2012."},"project":[{"name":"SFB 901","_id":"1"},{"_id":"7","name":"SFB 901 - Subprojekt A3"},{"name":"SFB 901 - Project Area A","_id":"2"}],"publisher":"Universität Paderborn","_id":"599","user_id":"15504","author":[{"full_name":"Löwen, Xenia","first_name":"Xenia","last_name":"Löwen"}],"year":"2012","title":"Managerial Delegation and Capacity Choices: An Analysis of the Cournot-Nash Equilibrium","status":"public","date_updated":"2022-01-06T07:02:49Z"},{"date_created":"2017-10-17T12:42:49Z","type":"bachelorsthesis","citation":{"bibtex":"@book{Feldkord_2012, title={Lokale Swaps und überholte Informationen in Basic Network Creation Games}, publisher={Universität Paderborn}, author={Feldkord, Björn}, year={2012} }","chicago":"Feldkord, Björn. <i>Lokale Swaps und überholte Informationen in Basic Network Creation Games</i>. Universität Paderborn, 2012.","short":"B. Feldkord, Lokale Swaps und überholte Informationen in Basic Network Creation Games, Universität Paderborn, 2012.","ama":"Feldkord B. <i>Lokale Swaps und überholte Informationen in Basic Network Creation Games</i>. Universität Paderborn; 2012.","ieee":"B. Feldkord, <i>Lokale Swaps und überholte Informationen in Basic Network Creation Games</i>. Universität Paderborn, 2012.","apa":"Feldkord, B. (2012). <i>Lokale Swaps und überholte Informationen in Basic Network Creation Games</i>. Universität Paderborn.","mla":"Feldkord, Björn. <i>Lokale Swaps und überholte Informationen in Basic Network Creation Games</i>. Universität Paderborn, 2012."},"project":[{"name":"SFB 901","_id":"1"},{"_id":"5","name":"SFB 901 - Subprojekt A1"},{"name":"SFB 901 - Project Area A","_id":"2"}],"_id":"600","publisher":"Universität Paderborn","language":[{"iso":"ger"}],"user_id":"477","year":"2012","status":"public","title":"Lokale Swaps und überholte Informationen in Basic Network Creation Games","author":[{"first_name":"Björn","last_name":"Feldkord","full_name":"Feldkord, Björn","id":"22704"}],"date_updated":"2022-01-06T07:02:49Z"},{"abstract":[{"text":"Wir betrachten eine Gruppe von mobilen, autonomen Robotern in einem ebenen Gel{\\\"a}nde. Es gibt keine zentrale Steuerung und die Roboter m{\\\"u}ssen sich selbst koordinieren. Zentrale Herausforderung dabei ist, dass jeder Roboter nur seine unmittelbare Nachbarschaft sieht und auch nur mit Robotern in seiner unmittelbaren Nachbarschaft kommunizieren kann. Daraus ergeben sich viele algorithmische Fragestellungen. In dieser Arbeit wird untersucht, unter welchen Voraussetzungen die Roboter sich auf einem Punkt versammeln bzw. eine Linie zwischen zwei festen Stationen bilden k{\\\"o}nnen. Daf{\\\"u}r werden mehrere Roboter-Strategien in verschiedenen Bewegungsmodellen vorgestellt. Diese Strategien werden auf ihre Effizienz hin untersucht. Es werden obere und untere Schranken f{\\\"u}r die ben{\\\"o}tigte Anzahl Runden und die Bewegungsdistanz gezeigt. In einigen F{\\\"a}llen wird außerdem die ben{\\\"o}tigte Bewegungsdistanz mit derjenigen Bewegungsdistanz verglichen, die eine optimale globale Strategie auf der gleichen Instanz ben{\\\"o}tigen w{\\\"u}rde. So werden kompetititve Faktoren hergeleitet.","lang":"eng"}],"date_created":"2017-10-17T12:42:49Z","file":[{"date_created":"2018-03-15T08:16:44Z","creator":"florida","content_type":"application/pdf","success":1,"file_id":"1252","file_size":3805310,"access_level":"closed","file_name":"601-Kempkes-PhD.pdf","date_updated":"2018-03-15T08:16:44Z","relation":"main_file"}],"department":[{"_id":"63"},{"_id":"26"}],"type":"dissertation","publication_identifier":{"isbn":["978-3-942647-21-2"]},"author":[{"full_name":"Kempkes, Barbara","first_name":"Barbara","last_name":"Kempkes"}],"year":"2012","title":"Local strategies for robot formation problems","intvolume":"       302","date_updated":"2022-01-06T07:02:50Z","language":[{"iso":"eng"}],"series_title":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn","supervisor":[{"full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","first_name":"Friedhelm","id":"15523"}],"citation":{"ama":"Kempkes B. <i>Local Strategies for Robot Formation Problems</i>. Vol 302. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn; 2012.","bibtex":"@book{Kempkes_2012, series={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, title={Local strategies for robot formation problems}, volume={302}, publisher={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, author={Kempkes, Barbara}, year={2012}, collection={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn} }","mla":"Kempkes, Barbara. <i>Local Strategies for Robot Formation Problems</i>. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2012.","chicago":"Kempkes, Barbara. <i>Local Strategies for Robot Formation Problems</i>. Vol. 302. Verlagsschriftenreihe Des Heinz Nixdorf Instituts, Paderborn. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2012.","short":"B. Kempkes, Local Strategies for Robot Formation Problems, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2012.","apa":"Kempkes, B. (2012). <i>Local strategies for robot formation problems</i> (Vol. 302). Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn.","ieee":"B. Kempkes, <i>Local strategies for robot formation problems</i>, vol. 302. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2012."},"file_date_updated":"2018-03-15T08:16:44Z","project":[{"name":"SFB 901","_id":"1"},{"_id":"5","name":"SFB 901 - Subprojekt A1"},{"_id":"2","name":"SFB 901 - Project Area A"}],"status":"public","has_accepted_license":"1","publisher":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn","_id":"601","volume":302,"ddc":["040"],"user_id":"5786"},{"abstract":[{"lang":"eng","text":"We study the consequences of dropping the perfect competition assumption in a standard infinite horizon model with infinitely-lived traders and real collateralized assets, together with one additional ingredient: information among players is asymmetric and monitoring is incomplete. The key insight is that trading assets is not only a way to hedge oneself against uncertainty and to smooth consumption across time: It also enables learning information. Conversely, defaulting now becomes strategic: Certain players may manipulate prices so as to provoke a default in order to prevent their opponents from learning. We focus on learning equilibria, at the end of which no player has incorrect beliefs — not because those players with heterogeneous beliefs were eliminated from the market (although default is possible at equilibrium) but because they have taken time to update their prior belief. We prove a partial Folk theorem à la Wiseman (2011) of the following form: For any function that maps each state of the world to a sequence of feasible and strongly individually rational allocations, and for any degree of precision, there is a perfect Bayesian equilibrium in which patient players learn the realized state with this degree of precision and achieve a payoff close to the one specified for each state."}],"project":[{"_id":"1","name":"SFB 901"},{"_id":"7","name":"SFB 901 - Subprojekt A3"},{"name":"SFB 901 - Project Area A","_id":"2"}],"file_date_updated":"2018-03-15T08:16:08Z","citation":{"mla":"Brangewitz, Sonja. <i>Learning by Trading in Infinite Horizon Strategic Market Games with Default</i>. Universität Paderborn, 2012.","bibtex":"@book{Brangewitz_2012, title={Learning by Trading in Infinite Horizon Strategic Market Games with Default}, publisher={Universität Paderborn}, author={Brangewitz, Sonja}, year={2012} }","ama":"Brangewitz S. <i>Learning by Trading in Infinite Horizon Strategic Market Games with Default</i>. Universität Paderborn; 2012.","ieee":"S. Brangewitz, <i>Learning by Trading in Infinite Horizon Strategic Market Games with Default</i>. Universität Paderborn, 2012.","apa":"Brangewitz, S. (2012). <i>Learning by Trading in Infinite Horizon Strategic Market Games with Default</i>. Universität Paderborn.","short":"S. Brangewitz, Learning by Trading in Infinite Horizon Strategic Market Games with Default, Universität Paderborn, 2012.","chicago":"Brangewitz, Sonja. <i>Learning by Trading in Infinite Horizon Strategic Market Games with Default</i>. Universität Paderborn, 2012."},"type":"report","department":[{"_id":"205"}],"file":[{"content_type":"application/pdf","success":1,"file_id":"1251","access_level":"closed","file_size":1284802,"file_name":"602-12062_01.pdf","date_updated":"2018-03-15T08:16:08Z","relation":"main_file","date_created":"2018-03-15T08:16:08Z","creator":"florida"}],"date_created":"2017-10-17T12:42:49Z","date_updated":"2022-01-06T07:02:51Z","has_accepted_license":"1","title":"Learning by Trading in Infinite Horizon Strategic Market Games with Default","year":"2012","status":"public","author":[{"first_name":"Sonja","last_name":"Brangewitz","full_name":"Brangewitz, Sonja"}],"user_id":"477","ddc":["040"],"_id":"602","language":[{"iso":"eng"}],"publisher":"Universität Paderborn"},{"citation":{"bibtex":"@book{Wette_Karl_2012, title={Introducing feedback to preemptive routing and wavelength assignment algorithms for dynamic traffic scenarios}, publisher={Universität Paderborn}, author={Wette, Philip and Karl, Holger}, year={2012} }","chicago":"Wette, Philip, and Holger Karl. <i>Introducing Feedback to Preemptive Routing and Wavelength Assignment Algorithms for Dynamic Traffic Scenarios</i>. Universität Paderborn, 2012.","ama":"Wette P, Karl H. <i>Introducing Feedback to Preemptive Routing and Wavelength Assignment Algorithms for Dynamic Traffic Scenarios</i>. Universität Paderborn; 2012.","short":"P. Wette, H. Karl, Introducing Feedback to Preemptive Routing and Wavelength Assignment Algorithms for Dynamic Traffic Scenarios, Universität Paderborn, 2012.","ieee":"P. Wette and H. Karl, <i>Introducing feedback to preemptive routing and wavelength assignment algorithms for dynamic traffic scenarios</i>. Universität Paderborn, 2012.","mla":"Wette, Philip, and Holger Karl. <i>Introducing Feedback to Preemptive Routing and Wavelength Assignment Algorithms for Dynamic Traffic Scenarios</i>. Universität Paderborn, 2012.","apa":"Wette, P., &#38; Karl, H. (2012). <i>Introducing feedback to preemptive routing and wavelength assignment algorithms for dynamic traffic scenarios</i>. Universität Paderborn."},"file_date_updated":"2018-03-09T09:57:26Z","project":[{"_id":"1","name":"SFB 901"},{"_id":"6","name":"SFB 901 - Subprojekt A2"},{"_id":"2","name":"SFB 901 - Project Area A"}],"abstract":[{"lang":"eng","text":"Preemptive Routing and Wavelength Assignment (RWA) algorithms preempt established lightpaths in case not enough resources are available to setup a new lightpath in a Wavelength Division Multiplexing (WDM) network. The selection of lightpaths to be preempted relies on internal decisions of the RWA algorithm. Thus, if dedicated properties of the network topology are required by the applications running on the network, these requirements have to be known by the RWA algorithm. Otherwise it might happen that by preempting a particular lightpath these requirements are violated. If, however, these requirements include parameters only known at the nodes running the application, the RWA algorithm cannot evaluate the requirements. For this reason a RWA algorithm is needed which involves its users in the preemption decisions. We present a family of preemptive RWA algorithms for WDM networks. These algorithms have two distinguishing features: a) they can handle dynamic traffic by on-the-fly reconfiguration, and b) users can give feedback for reconfiguration decisions and thus influence the preemption decision of the RWA algorithm, leading to networks which adapt directly to application needs. This is different from traffic engineering where the network is (slowly) adapted to observed traffic patterns. Our algorithms handle various WDM network configurations including networks consisting of heterogeneous WDM hardware. To this end, we are using the layered graph approach together with a newly developed graph model that is used to determine conflicting lightpaths."}],"date_created":"2017-10-17T12:42:49Z","file":[{"file_id":"1205","content_type":"application/pdf","success":1,"relation":"main_file","date_updated":"2018-03-09T09:57:26Z","file_name":"underlayMod2.pdf","access_level":"closed","file_size":717326,"date_created":"2018-03-09T09:57:26Z","creator":"hkarl"}],"department":[{"_id":"75"}],"type":"report","author":[{"last_name":"Wette","first_name":"Philip","full_name":"Wette, Philip"},{"last_name":"Karl","first_name":"Holger","full_name":"Karl, Holger","id":"126"}],"year":"2012","status":"public","title":"Introducing feedback to preemptive routing and wavelength assignment algorithms for dynamic traffic scenarios","has_accepted_license":"1","date_updated":"2022-01-06T07:02:51Z","_id":"603","publisher":"Universität Paderborn","ddc":["000"],"user_id":"126"},{"author":[{"first_name":"Henrik","last_name":"Seier","full_name":"Seier, Henrik"}],"year":"2012","status":"public","title":"Implementierung eines Branch-and-Bound-Algorithmus für nichtkonvexe gemischt-ganzzahlige Optimierungsprobleme mit quadratischen Nebenbedingungen","date_updated":"2022-01-06T07:02:51Z","language":[{"iso":"ger"}],"_id":"604","publisher":"Universität Paderborn","user_id":"477","citation":{"chicago":"Seier, Henrik. <i>Implementierung eines Branch-and-Bound-Algorithmus für nichtkonvexe gemischt-ganzzahlige Optimierungsprobleme mit quadratischen Nebenbedingungen</i>. Universität Paderborn, 2012.","short":"H. Seier, Implementierung eines Branch-and-Bound-Algorithmus für nichtkonvexe gemischt-ganzzahlige Optimierungsprobleme mit quadratischen Nebenbedingungen, Universität Paderborn, 2012.","ieee":"H. Seier, <i>Implementierung eines Branch-and-Bound-Algorithmus für nichtkonvexe gemischt-ganzzahlige Optimierungsprobleme mit quadratischen Nebenbedingungen</i>. Universität Paderborn, 2012.","apa":"Seier, H. (2012). <i>Implementierung eines Branch-and-Bound-Algorithmus für nichtkonvexe gemischt-ganzzahlige Optimierungsprobleme mit quadratischen Nebenbedingungen</i>. Universität Paderborn.","bibtex":"@book{Seier_2012, title={Implementierung eines Branch-and-Bound-Algorithmus für nichtkonvexe gemischt-ganzzahlige Optimierungsprobleme mit quadratischen Nebenbedingungen}, publisher={Universität Paderborn}, author={Seier, Henrik}, year={2012} }","ama":"Seier H. <i>Implementierung eines Branch-and-Bound-Algorithmus für nichtkonvexe gemischt-ganzzahlige Optimierungsprobleme mit quadratischen Nebenbedingungen</i>. Universität Paderborn; 2012.","mla":"Seier, Henrik. <i>Implementierung eines Branch-and-Bound-Algorithmus für nichtkonvexe gemischt-ganzzahlige Optimierungsprobleme mit quadratischen Nebenbedingungen</i>. Universität Paderborn, 2012."},"project":[{"name":"SFB 901","_id":"1"},{"_id":"15","name":"SFB 901 - Subprojekt C3"},{"_id":"4","name":"SFB 901 - Project Area C"}],"date_created":"2017-10-17T12:42:49Z","type":"mastersthesis"},{"date_updated":"2022-01-06T07:02:51Z","author":[{"last_name":"Isenberg","first_name":"Florian","full_name":"Isenberg, Florian"}],"year":"2012","title":"Implementierung eines adaptiven Verfahrens zur Linearisierung von nicht-konvexen, nichtlinearen Wassernetzmodellen mit Hilfe einer Fehlerabschätzung","status":"public","user_id":"477","_id":"605","publisher":"Universität Paderborn","language":[{"iso":"ger"}],"project":[{"_id":"1","name":"SFB 901"},{"_id":"15","name":"SFB 901 - Subprojekt C3"},{"name":"SFB 901 - Project Area C","_id":"4"}],"citation":{"ieee":"F. Isenberg, <i>Implementierung eines adaptiven Verfahrens zur Linearisierung von nicht-konvexen, nichtlinearen Wassernetzmodellen mit Hilfe einer Fehlerabschätzung</i>. Universität Paderborn, 2012.","apa":"Isenberg, F. (2012). <i>Implementierung eines adaptiven Verfahrens zur Linearisierung von nicht-konvexen, nichtlinearen Wassernetzmodellen mit Hilfe einer Fehlerabschätzung</i>. Universität Paderborn.","short":"F. Isenberg, Implementierung eines adaptiven Verfahrens zur Linearisierung von nicht-konvexen, nichtlinearen Wassernetzmodellen mit Hilfe einer Fehlerabschätzung, Universität Paderborn, 2012.","chicago":"Isenberg, Florian. <i>Implementierung eines adaptiven Verfahrens zur Linearisierung von nicht-konvexen, nichtlinearen Wassernetzmodellen mit Hilfe einer Fehlerabschätzung</i>. Universität Paderborn, 2012.","mla":"Isenberg, Florian. <i>Implementierung eines adaptiven Verfahrens zur Linearisierung von nicht-konvexen, nichtlinearen Wassernetzmodellen mit Hilfe einer Fehlerabschätzung</i>. Universität Paderborn, 2012.","bibtex":"@book{Isenberg_2012, title={Implementierung eines adaptiven Verfahrens zur Linearisierung von nicht-konvexen, nichtlinearen Wassernetzmodellen mit Hilfe einer Fehlerabschätzung}, publisher={Universität Paderborn}, author={Isenberg, Florian}, year={2012} }","ama":"Isenberg F. <i>Implementierung eines adaptiven Verfahrens zur Linearisierung von nicht-konvexen, nichtlinearen Wassernetzmodellen mit Hilfe einer Fehlerabschätzung</i>. Universität Paderborn; 2012."},"type":"mastersthesis","date_created":"2017-10-17T12:42:50Z"},{"publication":"Neural Networks","extern":"1","date_created":"2018-12-07T15:17:39Z","department":[{"_id":"115"}],"type":"journal_article","author":[{"full_name":"Mehler, Alexander","last_name":"Mehler","first_name":"Alexander"},{"first_name":"Andy","last_name":"Lücking","full_name":"Lücking, Andy"},{"id":"59649","full_name":"Menke, Peter","first_name":"Peter","last_name":"Menke"}],"publication_identifier":{"issn":["0893-6080"]},"title":"Assessing cognitive alignment in different types of dialog by means of a network model","year":"2012","intvolume":"        32","publication_status":"published","date_updated":"2022-01-06T07:02:51Z","language":[{"iso":"eng"}],"doi":"10.1016/j.neunet.2012.02.013","citation":{"apa":"Mehler, A., Lücking, A., &#38; Menke, P. (2012). Assessing cognitive alignment in different types of dialog by means of a network model. <i>Neural Networks</i>, <i>32</i>, 159–164. <a href=\"https://doi.org/10.1016/j.neunet.2012.02.013\">https://doi.org/10.1016/j.neunet.2012.02.013</a>","ieee":"A. Mehler, A. Lücking, and P. Menke, “Assessing cognitive alignment in different types of dialog by means of a network model,” <i>Neural Networks</i>, vol. 32, pp. 159–164, 2012.","short":"A. Mehler, A. Lücking, P. Menke, Neural Networks 32 (2012) 159–164.","chicago":"Mehler, Alexander, Andy Lücking, and Peter Menke. “Assessing Cognitive Alignment in Different Types of Dialog by Means of a Network Model.” <i>Neural Networks</i> 32 (2012): 159–64. <a href=\"https://doi.org/10.1016/j.neunet.2012.02.013\">https://doi.org/10.1016/j.neunet.2012.02.013</a>.","mla":"Mehler, Alexander, et al. “Assessing Cognitive Alignment in Different Types of Dialog by Means of a Network Model.” <i>Neural Networks</i>, vol. 32, Elsevier BV, 2012, pp. 159–64, doi:<a href=\"https://doi.org/10.1016/j.neunet.2012.02.013\">10.1016/j.neunet.2012.02.013</a>.","ama":"Mehler A, Lücking A, Menke P. Assessing cognitive alignment in different types of dialog by means of a network model. <i>Neural Networks</i>. 2012;32:159-164. doi:<a href=\"https://doi.org/10.1016/j.neunet.2012.02.013\">10.1016/j.neunet.2012.02.013</a>","bibtex":"@article{Mehler_Lücking_Menke_2012, title={Assessing cognitive alignment in different types of dialog by means of a network model}, volume={32}, DOI={<a href=\"https://doi.org/10.1016/j.neunet.2012.02.013\">10.1016/j.neunet.2012.02.013</a>}, journal={Neural Networks}, publisher={Elsevier BV}, author={Mehler, Alexander and Lücking, Andy and Menke, Peter}, year={2012}, pages={159–164} }"},"status":"public","_id":"6055","publisher":"Elsevier BV","page":"159-164","volume":32,"user_id":"59649"}]