--- _id: '586' 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. - lang: ger 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. author: - first_name: Stephanie full_name: Drzevitzky, Stephanie last_name: Drzevitzky citation: ama: 'Drzevitzky S. Proof-Carrying Hardware: A Novel Approach to Reconfigurable Hardware Security. Universität Paderborn; 2012.' apa: 'Drzevitzky, S. (2012). Proof-Carrying Hardware: A Novel Approach to Reconfigurable Hardware Security. Universität Paderborn.' bibtex: '@book{Drzevitzky_2012, title={Proof-Carrying Hardware: A Novel Approach to Reconfigurable Hardware Security}, publisher={Universität Paderborn}, author={Drzevitzky, Stephanie}, year={2012} }' chicago: 'Drzevitzky, Stephanie. Proof-Carrying Hardware: A Novel Approach to Reconfigurable Hardware Security. Universität Paderborn, 2012.' ieee: 'S. Drzevitzky, Proof-Carrying Hardware: A Novel Approach to Reconfigurable Hardware Security. Universität Paderborn, 2012.' mla: 'Drzevitzky, Stephanie. Proof-Carrying Hardware: A Novel Approach to Reconfigurable Hardware Security. Universität Paderborn, 2012.' short: 'S. Drzevitzky, Proof-Carrying Hardware: A Novel Approach to Reconfigurable Hardware Security, Universität Paderborn, 2012.' date_created: 2017-10-17T12:42:46Z date_updated: 2022-01-06T07:02:44Z ddc: - '040' department: - _id: '78' file: - access_level: closed content_type: application/pdf creator: florida date_created: 2018-03-15T08:38:19Z date_updated: 2018-03-15T08:38:19Z file_id: '1261' file_name: 586-Drzevitzky-PhD_01.pdf file_size: 1438436 relation: main_file success: 1 file_date_updated: 2018-03-15T08:38:19Z has_accepted_license: '1' language: - iso: eng main_file_link: - open_access: '1' url: https://nbn-resolving.de/urn:nbn:de:hbz:466:2-10423 oa: '1' page: '114' project: - _id: '12' name: SFB 901 - Subprojekt B4 - _id: '1' name: SFB 901 - _id: '3' name: SFB 901 - Project Area B publication_status: published publisher: Universität Paderborn status: public supervisor: - first_name: Marco full_name: Platzner, Marco id: '398' last_name: Platzner title: 'Proof-Carrying Hardware: A Novel Approach to Reconfigurable Hardware Security' type: dissertation user_id: '477' year: '2012' ... --- _id: '587' author: - first_name: Christian full_name: Plessl, Christian id: '16153' last_name: Plessl orcid: 0000-0001-5728-9982 - first_name: Marco full_name: Platzner, Marco id: '398' last_name: Platzner - first_name: Andreas full_name: Agne, Andreas last_name: Agne - first_name: Markus full_name: Happe, Markus last_name: Happe - first_name: Enno full_name: Lübbers, Enno last_name: Lübbers citation: ama: Plessl C, Platzner M, Agne A, Happe M, Lübbers E. Programming Models for Reconfigurable Heterogeneous Multi-Cores. Awareness Magazine; 2012. apa: Plessl, C., Platzner, M., Agne, A., Happe, M., & Lübbers, E. (2012). Programming models for reconfigurable heterogeneous multi-cores. Awareness Magazine. 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} }' chicago: Plessl, Christian, Marco Platzner, Andreas Agne, Markus Happe, and Enno Lübbers. Programming Models for Reconfigurable Heterogeneous Multi-Cores. Awareness Magazine, 2012. ieee: C. Plessl, M. Platzner, A. Agne, M. Happe, and E. Lübbers, Programming models for reconfigurable heterogeneous multi-cores. Awareness Magazine, 2012. mla: Plessl, Christian, et al. Programming Models for Reconfigurable Heterogeneous Multi-Cores. Awareness Magazine, 2012. short: C. Plessl, M. Platzner, A. Agne, M. Happe, E. Lübbers, Programming Models for Reconfigurable Heterogeneous Multi-Cores, Awareness Magazine, 2012. date_created: 2017-10-17T12:42:46Z date_updated: 2022-01-06T07:02:44Z ddc: - '040' department: - _id: '27' - _id: '518' - _id: '78' file: - access_level: closed content_type: application/pdf creator: florida date_created: 2018-03-15T08:37:02Z date_updated: 2018-03-15T08:37:02Z file_id: '1260' file_name: 587-2012_plessl_awareness_magazine.pdf file_size: 353057 relation: main_file success: 1 file_date_updated: 2018-03-15T08:37:02Z has_accepted_license: '1' language: - iso: eng project: - _id: '1' name: SFB 901 - _id: '14' name: SFB 901 - Subprojekt C2 - _id: '4' name: SFB 901 - Project Area C publisher: Awareness Magazine status: public title: Programming models for reconfigurable heterogeneous multi-cores type: misc user_id: '398' year: '2012' ... --- _id: '588' 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. author: - first_name: Ronald full_name: Petrlic, Ronald last_name: Petrlic - first_name: Christoph full_name: Sorge, Christoph last_name: Sorge citation: ama: 'Petrlic R, Sorge C. Privacy-Preserving DRM for Cloud Computing. In: Proceedings of the 26th IEEE International Conference on Advanced Information Networking and Applications (AINA). ; 2012:1286-1291. doi:10.1109/WAINA.2012.92' apa: Petrlic, R., & Sorge, C. (2012). Privacy-Preserving DRM for Cloud Computing. In Proceedings of the 26th IEEE International Conference on Advanced Information Networking and Applications (AINA) (pp. 1286–1291). https://doi.org/10.1109/WAINA.2012.92 bibtex: '@inproceedings{Petrlic_Sorge_2012, title={Privacy-Preserving DRM for Cloud Computing}, DOI={10.1109/WAINA.2012.92}, 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} }' chicago: Petrlic, Ronald, and Christoph Sorge. “Privacy-Preserving DRM for Cloud Computing.” In Proceedings of the 26th IEEE International Conference on Advanced Information Networking and Applications (AINA), 1286–91, 2012. https://doi.org/10.1109/WAINA.2012.92. ieee: R. Petrlic and C. Sorge, “Privacy-Preserving DRM for Cloud Computing,” in Proceedings of the 26th IEEE International Conference on Advanced Information Networking and Applications (AINA), 2012, pp. 1286–1291. mla: Petrlic, Ronald, and Christoph Sorge. “Privacy-Preserving DRM for Cloud Computing.” Proceedings of the 26th IEEE International Conference on Advanced Information Networking and Applications (AINA), 2012, pp. 1286–91, doi:10.1109/WAINA.2012.92. short: 'R. Petrlic, C. Sorge, in: Proceedings of the 26th IEEE International Conference on Advanced Information Networking and Applications (AINA), 2012, pp. 1286–1291.' date_created: 2017-10-17T12:42:46Z date_updated: 2022-01-06T07:02:45Z ddc: - '040' doi: 10.1109/WAINA.2012.92 file: - access_level: closed content_type: application/pdf creator: florida date_created: 2018-03-15T08:36:16Z date_updated: 2018-03-15T08:36:16Z file_id: '1259' file_name: 588-drm0-published_01.pdf file_size: 194323 relation: main_file success: 1 file_date_updated: 2018-03-15T08:36:16Z has_accepted_license: '1' page: 1286-1291 project: - _id: '1' name: SFB 901 - _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) status: public title: Privacy-Preserving DRM for Cloud Computing type: conference user_id: '15504' year: '2012' ... --- _id: '589' abstract: - lang: eng 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. author: - first_name: Ronald full_name: Petrlic, Ronald last_name: Petrlic citation: ama: 'Petrlic R. Privacy-Preserving Digital Rights Management in a Trusted Cloud Environment. In: Proceedings of the 11th IEEE International Conference on Trust, Security and Privacy in Computing and Communications (TrustCom). ; 2012:958-963. doi:10.1109/TrustCom.2012.225' apa: Petrlic, R. (2012). Privacy-Preserving Digital Rights Management in a Trusted Cloud Environment. In Proceedings of the 11th IEEE International Conference on Trust, Security and Privacy in Computing and Communications (TrustCom) (pp. 958–963). https://doi.org/10.1109/TrustCom.2012.225 bibtex: '@inproceedings{Petrlic_2012, title={Privacy-Preserving Digital Rights Management in a Trusted Cloud Environment}, DOI={10.1109/TrustCom.2012.225}, 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} }' chicago: Petrlic, Ronald. “Privacy-Preserving Digital Rights Management in a Trusted Cloud Environment.” In Proceedings of the 11th IEEE International Conference on Trust, Security and Privacy in Computing and Communications (TrustCom), 958–63, 2012. https://doi.org/10.1109/TrustCom.2012.225. ieee: R. Petrlic, “Privacy-Preserving Digital Rights Management in a Trusted Cloud Environment,” in Proceedings of the 11th IEEE International Conference on Trust, Security and Privacy in Computing and Communications (TrustCom), 2012, pp. 958–963. mla: Petrlic, Ronald. “Privacy-Preserving Digital Rights Management in a Trusted Cloud Environment.” Proceedings of the 11th IEEE International Conference on Trust, Security and Privacy in Computing and Communications (TrustCom), 2012, pp. 958–63, doi:10.1109/TrustCom.2012.225. 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.' date_created: 2017-10-17T12:42:47Z date_updated: 2022-01-06T07:02:45Z ddc: - '040' doi: 10.1109/TrustCom.2012.225 file: - access_level: closed content_type: application/pdf creator: florida date_created: 2018-03-15T08:40:15Z date_updated: 2018-03-15T08:40:15Z file_id: '1264' file_name: 589-published-trustcom.pdf file_size: 179985 relation: main_file success: 1 file_date_updated: 2018-03-15T08:40:15Z has_accepted_license: '1' language: - iso: eng page: 958-963 project: - _id: '1' name: SFB 901 - _id: '13' name: SFB 901 - Subprojekt C1 - _id: '4' name: SFB 901 - Project Area C publication: Proceedings of the 11th IEEE International Conference on Trust, Security and Privacy in Computing and Communications (TrustCom) status: public title: Privacy-Preserving Digital Rights Management in a Trusted Cloud Environment type: conference user_id: '477' year: '2012' ... --- _id: '590' 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”.' author: - first_name: Daniel full_name: Wonisch, Daniel last_name: Wonisch - first_name: Heike full_name: Wehrheim, Heike id: '573' last_name: Wehrheim citation: ama: 'Wonisch D, Wehrheim H. Predicate Analysis with Block-Abstraction Memoization. In: Proceedings of the 14th International Conference on Formal Engineering Methods (ICFEM). LNCS. ; 2012:332-347. doi:10.1007/978-3-642-34281-3_24' apa: Wonisch, D., & Wehrheim, H. (2012). Predicate Analysis with Block-Abstraction Memoization. In Proceedings of the 14th International Conference on Formal Engineering Methods (ICFEM) (pp. 332–347). https://doi.org/10.1007/978-3-642-34281-3_24 bibtex: '@inproceedings{Wonisch_Wehrheim_2012, series={LNCS}, title={Predicate Analysis with Block-Abstraction Memoization}, DOI={10.1007/978-3-642-34281-3_24}, 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} }' chicago: Wonisch, Daniel, and Heike Wehrheim. “Predicate Analysis with Block-Abstraction Memoization.” In Proceedings of the 14th International Conference on Formal Engineering Methods (ICFEM), 332–47. LNCS, 2012. https://doi.org/10.1007/978-3-642-34281-3_24. ieee: D. Wonisch and H. Wehrheim, “Predicate Analysis with Block-Abstraction Memoization,” in Proceedings of the 14th International Conference on Formal Engineering Methods (ICFEM), 2012, pp. 332–347. mla: Wonisch, Daniel, and Heike Wehrheim. “Predicate Analysis with Block-Abstraction Memoization.” Proceedings of the 14th International Conference on Formal Engineering Methods (ICFEM), 2012, pp. 332–47, doi:10.1007/978-3-642-34281-3_24. short: 'D. Wonisch, H. Wehrheim, in: Proceedings of the 14th International Conference on Formal Engineering Methods (ICFEM), 2012, pp. 332–347.' date_created: 2017-10-17T12:42:47Z date_updated: 2022-01-06T07:02:46Z ddc: - '040' department: - _id: '77' doi: 10.1007/978-3-642-34281-3_24 file: - access_level: closed content_type: application/pdf creator: florida date_created: 2018-03-15T08:33:56Z date_updated: 2018-03-15T08:33:56Z file_id: '1258' file_name: 590-WonischWehrheim2012.pdf file_size: 320901 relation: main_file success: 1 file_date_updated: 2018-03-15T08:33:56Z has_accepted_license: '1' language: - iso: eng page: 332-347 project: - _id: '1' name: SFB 901 - _id: '12' name: SFB 901 - Subprojekt B4 - _id: '3' name: SFB 901 - Project Area B publication: Proceedings of the 14th International Conference on Formal Engineering Methods (ICFEM) series_title: LNCS status: public title: Predicate Analysis with Block-Abstraction Memoization type: conference user_id: '477' year: '2012' ... --- _id: '592' author: - first_name: Aydin full_name: Celik, Aydin last_name: Celik citation: ama: 'Celik A. Penny Auctions: Design und Strategisches Verhalten. Universität Paderborn; 2012.' apa: 'Celik, A. (2012). Penny Auctions: Design und Strategisches Verhalten. Universität Paderborn.' bibtex: '@book{Celik_2012, title={Penny Auctions: Design und Strategisches Verhalten}, publisher={Universität Paderborn}, author={Celik, Aydin}, year={2012} }' chicago: 'Celik, Aydin. Penny Auctions: Design und Strategisches Verhalten. Universität Paderborn, 2012.' ieee: 'A. Celik, Penny Auctions: Design und Strategisches Verhalten. Universität Paderborn, 2012.' mla: 'Celik, Aydin. Penny Auctions: Design und Strategisches Verhalten. Universität Paderborn, 2012.' short: 'A. Celik, Penny Auctions: Design und Strategisches Verhalten, Universität Paderborn, 2012.' date_created: 2017-10-17T12:42:47Z date_updated: 2022-01-06T07:02:47Z language: - iso: ger project: - _id: '1' name: SFB 901 - _id: '7' name: SFB 901 - Subprojekt A3 - _id: '2' name: SFB 901 - Project Area A publisher: Universität Paderborn status: public title: 'Penny Auctions: Design und Strategisches Verhalten' type: mastersthesis user_id: '477' year: '2012' ... --- _id: '593' author: - first_name: Tobias full_name: Rojahn, Tobias last_name: Rojahn citation: ama: Rojahn T. Optimale Zuteilung von Nutzern zu verteilten Cloud-Standorten. Universität Paderborn; 2012. apa: Rojahn, T. (2012). Optimale Zuteilung von Nutzern zu verteilten Cloud-Standorten. Universität Paderborn. bibtex: '@book{Rojahn_2012, title={Optimale Zuteilung von Nutzern zu verteilten Cloud-Standorten}, publisher={Universität Paderborn}, author={Rojahn, Tobias}, year={2012} }' chicago: Rojahn, Tobias. Optimale Zuteilung von Nutzern zu verteilten Cloud-Standorten. Universität Paderborn, 2012. ieee: T. Rojahn, Optimale Zuteilung von Nutzern zu verteilten Cloud-Standorten. Universität Paderborn, 2012. mla: Rojahn, Tobias. Optimale Zuteilung von Nutzern zu verteilten Cloud-Standorten. Universität Paderborn, 2012. short: T. Rojahn, Optimale Zuteilung von Nutzern zu verteilten Cloud-Standorten, Universität Paderborn, 2012. date_created: 2017-10-17T12:42:47Z date_updated: 2022-01-06T07:02:47Z department: - _id: '75' language: - iso: ger project: - _id: '1' name: SFB 901 - _id: '6' name: SFB 901 - Subprojekt A2 - _id: '2' name: SFB 901 - Project Area A publisher: Universität Paderborn status: public title: Optimale Zuteilung von Nutzern zu verteilten Cloud-Standorten type: bachelorsthesis user_id: '477' year: '2012' ... --- _id: '594' author: - first_name: Timo full_name: Klerx, Timo last_name: Klerx citation: ama: Klerx T. Online Parameteroptimierung in P2P-Netzwerken mit Hilfe von Neuronalen Netzen. Universität Paderborn; 2012. apa: Klerx, T. (2012). Online Parameteroptimierung in P2P-Netzwerken mit Hilfe von Neuronalen Netzen. Universität Paderborn. bibtex: '@book{Klerx_2012, title={Online Parameteroptimierung in P2P-Netzwerken mit Hilfe von Neuronalen Netzen}, publisher={Universität Paderborn}, author={Klerx, Timo}, year={2012} }' chicago: Klerx, Timo. Online Parameteroptimierung in P2P-Netzwerken mit Hilfe von Neuronalen Netzen. Universität Paderborn, 2012. ieee: T. Klerx, Online Parameteroptimierung in P2P-Netzwerken mit Hilfe von Neuronalen Netzen. Universität Paderborn, 2012. mla: Klerx, Timo. Online Parameteroptimierung in P2P-Netzwerken mit Hilfe von Neuronalen Netzen. Universität Paderborn, 2012. short: T. Klerx, Online Parameteroptimierung in P2P-Netzwerken mit Hilfe von Neuronalen Netzen, Universität Paderborn, 2012. date_created: 2017-10-17T12:42:47Z date_updated: 2022-01-06T07:02:48Z language: - iso: ger project: - _id: '1' name: SFB 901 - _id: '5' name: SFB 901 - Subprojekt A1 - _id: '2' name: SFB 901 - Project Area A publisher: Universität Paderborn status: public title: Online Parameteroptimierung in P2P-Netzwerken mit Hilfe von Neuronalen Netzen type: mastersthesis user_id: '477' year: '2012' ... --- _id: '595' author: - first_name: Frederik full_name: Mallmann Trenn, Frederik last_name: Mallmann Trenn citation: ama: Mallmann Trenn F. On Scheduling with Multi-Core and Multi-Speed Processors Using Power Down. Universität Paderborn; 2012. apa: Mallmann Trenn, F. (2012). On scheduling with multi-core and multi-speed processors using power down. Universität Paderborn. 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} }' chicago: Mallmann Trenn, Frederik. On Scheduling with Multi-Core and Multi-Speed Processors Using Power Down. Universität Paderborn, 2012. ieee: F. Mallmann Trenn, On scheduling with multi-core and multi-speed processors using power down. Universität Paderborn, 2012. mla: Mallmann Trenn, Frederik. On Scheduling with Multi-Core and Multi-Speed Processors Using Power Down. Universität Paderborn, 2012. short: F. Mallmann Trenn, On Scheduling with Multi-Core and Multi-Speed Processors Using Power Down, Universität Paderborn, 2012. date_created: 2017-10-17T12:42:48Z date_updated: 2022-01-06T07:02:48Z project: - _id: '1' name: SFB 901 - _id: '14' name: SFB 901 - Subprojekt C2 - _id: '4' name: SFB 901 - Project Area C publisher: Universität Paderborn status: public title: On scheduling with multi-core and multi-speed processors using power down type: bachelorsthesis user_id: '15504' year: '2012' ... --- _id: '596' abstract: - lang: eng 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. author: - first_name: Matthias full_name: Becker, Matthias last_name: Becker - first_name: Markus full_name: Luckey, Markus last_name: Luckey - first_name: Steffen full_name: Becker, Steffen last_name: Becker citation: ama: 'Becker M, Luckey M, Becker S. Model-Driven Performance Engineering of Self-Adaptive Systems: A Survey. In: Proceedings of the 8th ACM SigSoft International Conference on Quality of Software Architectures (QoSA’12). ; 2012:117-122. doi:10.1145/2304696.2304716' apa: 'Becker, M., Luckey, M., & Becker, S. (2012). Model-Driven Performance Engineering of Self-Adaptive Systems: A Survey. In Proceedings of the 8th ACM SigSoft International Conference on Quality of Software Architectures (QoSA’12) (pp. 117–122). https://doi.org/10.1145/2304696.2304716' bibtex: '@inproceedings{Becker_Luckey_Becker_2012, title={Model-Driven Performance Engineering of Self-Adaptive Systems: A Survey}, DOI={10.1145/2304696.2304716}, 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} }' chicago: 'Becker, Matthias, Markus Luckey, and Steffen Becker. “Model-Driven Performance Engineering of Self-Adaptive Systems: A Survey.” In Proceedings of the 8th ACM SigSoft International Conference on Quality of Software Architectures (QoSA’12), 117–22, 2012. https://doi.org/10.1145/2304696.2304716.' ieee: 'M. Becker, M. Luckey, and S. Becker, “Model-Driven Performance Engineering of Self-Adaptive Systems: A Survey,” in Proceedings of the 8th ACM SigSoft International Conference on Quality of Software Architectures (QoSA’12), 2012, pp. 117–122.' mla: 'Becker, Matthias, et al. “Model-Driven Performance Engineering of Self-Adaptive Systems: A Survey.” Proceedings of the 8th ACM SigSoft International Conference on Quality of Software Architectures (QoSA’12), 2012, pp. 117–22, doi:10.1145/2304696.2304716.' 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.' date_created: 2017-10-17T12:42:48Z date_updated: 2022-01-06T07:02:48Z ddc: - '040' doi: 10.1145/2304696.2304716 file: - access_level: closed content_type: application/pdf creator: florida date_created: 2018-03-15T08:23:31Z date_updated: 2018-03-15T08:23:31Z file_id: '1256' file_name: 596-qosa25s-becker.pdf file_size: 141651 relation: main_file success: 1 file_date_updated: 2018-03-15T08:23:31Z has_accepted_license: '1' page: 117-122 project: - _id: '1' name: SFB 901 - _id: '11' name: SFB 901 - Subprojekt B3 - _id: '3' name: SFB 901 - Project Area B publication: Proceedings of the 8th ACM SigSoft International Conference on Quality of Software Architectures (QoSA'12) status: public title: 'Model-Driven Performance Engineering of Self-Adaptive Systems: A Survey' type: conference user_id: '15504' year: '2012' ... --- _id: '597' abstract: - lang: eng 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.' author: - first_name: Marios full_name: Mavronicolas, Marios last_name: Mavronicolas - first_name: Burkhard full_name: Monien, Burkhard last_name: Monien citation: ama: 'Mavronicolas M, Monien B. Minimizing Expectation Plus Variance. In: Proceedings of the 5th International Symposium on Algorithmic Game Theory (SAGT). LNCS. ; 2012:239-250. doi:10.1007/978-3-642-33996-7_21' apa: Mavronicolas, M., & Monien, B. (2012). Minimizing Expectation Plus Variance. In Proceedings of the 5th International Symposium on Algorithmic Game Theory (SAGT) (pp. 239–250). https://doi.org/10.1007/978-3-642-33996-7_21 bibtex: '@inproceedings{Mavronicolas_Monien_2012, series={LNCS}, title={Minimizing Expectation Plus Variance}, DOI={10.1007/978-3-642-33996-7_21}, 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} }' chicago: Mavronicolas, Marios, and Burkhard Monien. “Minimizing Expectation Plus Variance.” In Proceedings of the 5th International Symposium on Algorithmic Game Theory (SAGT), 239–50. LNCS, 2012. https://doi.org/10.1007/978-3-642-33996-7_21. ieee: M. Mavronicolas and B. Monien, “Minimizing Expectation Plus Variance,” in Proceedings of the 5th International Symposium on Algorithmic Game Theory (SAGT), 2012, pp. 239–250. mla: Mavronicolas, Marios, and Burkhard Monien. “Minimizing Expectation Plus Variance.” Proceedings of the 5th International Symposium on Algorithmic Game Theory (SAGT), 2012, pp. 239–50, doi:10.1007/978-3-642-33996-7_21. short: 'M. Mavronicolas, B. Monien, in: Proceedings of the 5th International Symposium on Algorithmic Game Theory (SAGT), 2012, pp. 239–250.' date_created: 2017-10-17T12:42:48Z date_updated: 2022-01-06T07:02:48Z ddc: - '040' doi: 10.1007/978-3-642-33996-7_21 file: - access_level: closed content_type: application/pdf creator: florida date_created: 2018-03-15T08:20:53Z date_updated: 2018-03-15T08:20:53Z file_id: '1254' file_name: 597-newtocs_01.pdf file_size: 345826 relation: main_file success: 1 file_date_updated: 2018-03-15T08:20:53Z has_accepted_license: '1' page: 239-250 project: - _id: '1' name: SFB 901 - _id: '7' name: SFB 901 - Subprojekt A3 - _id: '2' name: SFB 901 - Project Area A publication: Proceedings of the 5th International Symposium on Algorithmic Game Theory (SAGT) series_title: LNCS status: public title: Minimizing Expectation Plus Variance type: conference user_id: '15504' year: '2012' ... --- _id: '598' author: - first_name: Fuad full_name: Mammadov, Fuad last_name: Mammadov citation: ama: Mammadov F. Methoden zur Bestimmung von innerbetrieblichen Verrechnungspreisen. Universität Paderborn; 2012. apa: Mammadov, F. (2012). Methoden zur Bestimmung von innerbetrieblichen Verrechnungspreisen. Universität Paderborn. bibtex: '@book{Mammadov_2012, title={Methoden zur Bestimmung von innerbetrieblichen Verrechnungspreisen}, publisher={Universität Paderborn}, author={Mammadov, Fuad}, year={2012} }' chicago: Mammadov, Fuad. Methoden zur Bestimmung von innerbetrieblichen Verrechnungspreisen. Universität Paderborn, 2012. ieee: F. Mammadov, Methoden zur Bestimmung von innerbetrieblichen Verrechnungspreisen. Universität Paderborn, 2012. mla: Mammadov, Fuad. Methoden zur Bestimmung von innerbetrieblichen Verrechnungspreisen. Universität Paderborn, 2012. short: F. Mammadov, Methoden zur Bestimmung von innerbetrieblichen Verrechnungspreisen, Universität Paderborn, 2012. date_created: 2017-10-17T12:42:48Z date_updated: 2022-01-06T07:02:48Z language: - iso: ger project: - _id: '1' name: SFB 901 - _id: '7' name: SFB 901 - Subprojekt A3 - _id: '2' name: SFB 901 - Project Area A publisher: Universität Paderborn status: public title: Methoden zur Bestimmung von innerbetrieblichen Verrechnungspreisen type: bachelorsthesis user_id: '477' year: '2012' ... --- _id: '599' author: - first_name: Xenia full_name: Löwen, Xenia last_name: Löwen citation: ama: 'Löwen X. Managerial Delegation and Capacity Choices: An Analysis of the Cournot-Nash Equilibrium. Universität Paderborn; 2012.' apa: 'Löwen, X. (2012). Managerial Delegation and Capacity Choices: An Analysis of the Cournot-Nash Equilibrium. Universität Paderborn.' 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} }' chicago: 'Löwen, Xenia. Managerial Delegation and Capacity Choices: An Analysis of the Cournot-Nash Equilibrium. Universität Paderborn, 2012.' ieee: 'X. Löwen, Managerial Delegation and Capacity Choices: An Analysis of the Cournot-Nash Equilibrium. Universität Paderborn, 2012.' mla: 'Löwen, Xenia. Managerial Delegation and Capacity Choices: An Analysis of the Cournot-Nash Equilibrium. Universität Paderborn, 2012.' short: 'X. Löwen, Managerial Delegation and Capacity Choices: An Analysis of the Cournot-Nash Equilibrium, Universität Paderborn, 2012.' date_created: 2017-10-17T12:42:48Z date_updated: 2022-01-06T07:02:49Z project: - _id: '1' name: SFB 901 - _id: '7' name: SFB 901 - Subprojekt A3 - _id: '2' name: SFB 901 - Project Area A publisher: Universität Paderborn status: public title: 'Managerial Delegation and Capacity Choices: An Analysis of the Cournot-Nash Equilibrium' type: bachelorsthesis user_id: '15504' year: '2012' ... --- _id: '600' author: - first_name: Björn full_name: Feldkord, Björn id: '22704' last_name: Feldkord citation: ama: Feldkord B. Lokale Swaps und überholte Informationen in Basic Network Creation Games. Universität Paderborn; 2012. apa: Feldkord, B. (2012). Lokale Swaps und überholte Informationen in Basic Network Creation Games. Universität Paderborn. 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. Lokale Swaps und überholte Informationen in Basic Network Creation Games. Universität Paderborn, 2012. ieee: B. Feldkord, Lokale Swaps und überholte Informationen in Basic Network Creation Games. Universität Paderborn, 2012. mla: Feldkord, Björn. Lokale Swaps und überholte Informationen in Basic Network Creation Games. Universität Paderborn, 2012. short: B. Feldkord, Lokale Swaps und überholte Informationen in Basic Network Creation Games, Universität Paderborn, 2012. date_created: 2017-10-17T12:42:49Z date_updated: 2022-01-06T07:02:49Z language: - iso: ger project: - _id: '1' name: SFB 901 - _id: '5' name: SFB 901 - Subprojekt A1 - _id: '2' name: SFB 901 - Project Area A publisher: Universität Paderborn status: public title: Lokale Swaps und überholte Informationen in Basic Network Creation Games type: bachelorsthesis user_id: '477' year: '2012' ... --- _id: '601' abstract: - lang: eng 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. author: - first_name: Barbara full_name: Kempkes, Barbara last_name: Kempkes citation: ama: Kempkes B. Local Strategies for Robot Formation Problems. Vol 302. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn; 2012. apa: Kempkes, B. (2012). Local strategies for robot formation problems (Vol. 302). Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn. 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} }' chicago: Kempkes, Barbara. Local Strategies for Robot Formation Problems. Vol. 302. Verlagsschriftenreihe Des Heinz Nixdorf Instituts, Paderborn. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2012. ieee: B. Kempkes, Local strategies for robot formation problems, vol. 302. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2012. mla: Kempkes, Barbara. Local Strategies for Robot Formation Problems. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2012. short: B. Kempkes, Local Strategies for Robot Formation Problems, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2012. date_created: 2017-10-17T12:42:49Z date_updated: 2022-01-06T07:02:50Z ddc: - '040' department: - _id: '63' - _id: '26' file: - access_level: closed content_type: application/pdf creator: florida date_created: 2018-03-15T08:16:44Z date_updated: 2018-03-15T08:16:44Z file_id: '1252' file_name: 601-Kempkes-PhD.pdf file_size: 3805310 relation: main_file success: 1 file_date_updated: 2018-03-15T08:16:44Z has_accepted_license: '1' intvolume: ' 302' language: - iso: eng project: - _id: '1' name: SFB 901 - _id: '5' name: SFB 901 - Subprojekt A1 - _id: '2' name: SFB 901 - Project Area A publication_identifier: isbn: - 978-3-942647-21-2 publisher: Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn series_title: Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn status: public supervisor: - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm id: '15523' last_name: Meyer auf der Heide title: Local strategies for robot formation problems type: dissertation user_id: '5786' volume: 302 year: '2012' ... --- _id: '602' 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.' author: - first_name: Sonja full_name: Brangewitz, Sonja last_name: Brangewitz citation: ama: Brangewitz S. Learning by Trading in Infinite Horizon Strategic Market Games with Default. Universität Paderborn; 2012. apa: Brangewitz, S. (2012). Learning by Trading in Infinite Horizon Strategic Market Games with Default. Universität Paderborn. 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} }' chicago: Brangewitz, Sonja. Learning by Trading in Infinite Horizon Strategic Market Games with Default. Universität Paderborn, 2012. ieee: S. Brangewitz, Learning by Trading in Infinite Horizon Strategic Market Games with Default. Universität Paderborn, 2012. mla: Brangewitz, Sonja. Learning by Trading in Infinite Horizon Strategic Market Games with Default. Universität Paderborn, 2012. short: S. Brangewitz, Learning by Trading in Infinite Horizon Strategic Market Games with Default, Universität Paderborn, 2012. date_created: 2017-10-17T12:42:49Z date_updated: 2022-01-06T07:02:51Z ddc: - '040' department: - _id: '205' file: - access_level: closed content_type: application/pdf creator: florida date_created: 2018-03-15T08:16:08Z date_updated: 2018-03-15T08:16:08Z file_id: '1251' file_name: 602-12062_01.pdf file_size: 1284802 relation: main_file success: 1 file_date_updated: 2018-03-15T08:16:08Z has_accepted_license: '1' language: - iso: eng project: - _id: '1' name: SFB 901 - _id: '7' name: SFB 901 - Subprojekt A3 - _id: '2' name: SFB 901 - Project Area A publisher: Universität Paderborn status: public title: Learning by Trading in Infinite Horizon Strategic Market Games with Default type: report user_id: '477' year: '2012' ... --- _id: '603' 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.' author: - first_name: Philip full_name: Wette, Philip last_name: Wette - first_name: Holger full_name: Karl, Holger id: '126' last_name: Karl citation: ama: Wette P, Karl H. Introducing Feedback to Preemptive Routing and Wavelength Assignment Algorithms for Dynamic Traffic Scenarios. Universität Paderborn; 2012. apa: Wette, P., & Karl, H. (2012). Introducing feedback to preemptive routing and wavelength assignment algorithms for dynamic traffic scenarios. Universität Paderborn. 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. Introducing Feedback to Preemptive Routing and Wavelength Assignment Algorithms for Dynamic Traffic Scenarios. Universität Paderborn, 2012. ieee: P. Wette and H. Karl, Introducing feedback to preemptive routing and wavelength assignment algorithms for dynamic traffic scenarios. Universität Paderborn, 2012. mla: Wette, Philip, and Holger Karl. Introducing Feedback to Preemptive Routing and Wavelength Assignment Algorithms for Dynamic Traffic Scenarios. 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. date_created: 2017-10-17T12:42:49Z date_updated: 2022-01-06T07:02:51Z ddc: - '000' department: - _id: '75' file: - access_level: closed content_type: application/pdf creator: hkarl date_created: 2018-03-09T09:57:26Z date_updated: 2018-03-09T09:57:26Z file_id: '1205' file_name: underlayMod2.pdf file_size: 717326 relation: main_file success: 1 file_date_updated: 2018-03-09T09:57:26Z has_accepted_license: '1' project: - _id: '1' name: SFB 901 - _id: '6' name: SFB 901 - Subprojekt A2 - _id: '2' name: SFB 901 - Project Area A publisher: Universität Paderborn status: public title: Introducing feedback to preemptive routing and wavelength assignment algorithms for dynamic traffic scenarios type: report user_id: '126' year: '2012' ... --- _id: '604' author: - first_name: Henrik full_name: Seier, Henrik last_name: Seier citation: ama: Seier H. Implementierung eines Branch-and-Bound-Algorithmus für nichtkonvexe gemischt-ganzzahlige Optimierungsprobleme mit quadratischen Nebenbedingungen. Universität Paderborn; 2012. apa: Seier, H. (2012). Implementierung eines Branch-and-Bound-Algorithmus für nichtkonvexe gemischt-ganzzahlige Optimierungsprobleme mit quadratischen Nebenbedingungen. 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} }' chicago: Seier, Henrik. Implementierung eines Branch-and-Bound-Algorithmus für nichtkonvexe gemischt-ganzzahlige Optimierungsprobleme mit quadratischen Nebenbedingungen. Universität Paderborn, 2012. ieee: H. Seier, Implementierung eines Branch-and-Bound-Algorithmus für nichtkonvexe gemischt-ganzzahlige Optimierungsprobleme mit quadratischen Nebenbedingungen. Universität Paderborn, 2012. mla: Seier, Henrik. Implementierung eines Branch-and-Bound-Algorithmus für nichtkonvexe gemischt-ganzzahlige Optimierungsprobleme mit quadratischen Nebenbedingungen. 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. date_created: 2017-10-17T12:42:49Z date_updated: 2022-01-06T07:02:51Z language: - iso: ger project: - _id: '1' name: SFB 901 - _id: '15' name: SFB 901 - Subprojekt C3 - _id: '4' name: SFB 901 - Project Area C publisher: Universität Paderborn status: public title: Implementierung eines Branch-and-Bound-Algorithmus für nichtkonvexe gemischt-ganzzahlige Optimierungsprobleme mit quadratischen Nebenbedingungen type: mastersthesis user_id: '477' year: '2012' ... --- _id: '605' author: - first_name: Florian full_name: Isenberg, Florian last_name: Isenberg citation: ama: Isenberg F. Implementierung eines adaptiven Verfahrens zur Linearisierung von nicht-konvexen, nichtlinearen Wassernetzmodellen mit Hilfe einer Fehlerabschätzung. Universität Paderborn; 2012. apa: Isenberg, F. (2012). Implementierung eines adaptiven Verfahrens zur Linearisierung von nicht-konvexen, nichtlinearen Wassernetzmodellen mit Hilfe einer Fehlerabschätzung. Universität Paderborn. 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} }' chicago: Isenberg, Florian. Implementierung eines adaptiven Verfahrens zur Linearisierung von nicht-konvexen, nichtlinearen Wassernetzmodellen mit Hilfe einer Fehlerabschätzung. Universität Paderborn, 2012. ieee: F. Isenberg, Implementierung eines adaptiven Verfahrens zur Linearisierung von nicht-konvexen, nichtlinearen Wassernetzmodellen mit Hilfe einer Fehlerabschätzung. Universität Paderborn, 2012. mla: Isenberg, Florian. Implementierung eines adaptiven Verfahrens zur Linearisierung von nicht-konvexen, nichtlinearen Wassernetzmodellen mit Hilfe einer Fehlerabschätzung. Universität Paderborn, 2012. short: F. Isenberg, Implementierung eines adaptiven Verfahrens zur Linearisierung von nicht-konvexen, nichtlinearen Wassernetzmodellen mit Hilfe einer Fehlerabschätzung, Universität Paderborn, 2012. date_created: 2017-10-17T12:42:50Z date_updated: 2022-01-06T07:02:51Z language: - iso: ger project: - _id: '1' name: SFB 901 - _id: '15' name: SFB 901 - Subprojekt C3 - _id: '4' name: SFB 901 - Project Area C publisher: Universität Paderborn status: public title: Implementierung eines adaptiven Verfahrens zur Linearisierung von nicht-konvexen, nichtlinearen Wassernetzmodellen mit Hilfe einer Fehlerabschätzung type: mastersthesis user_id: '477' year: '2012' ... --- _id: '6055' author: - first_name: Alexander full_name: Mehler, Alexander last_name: Mehler - first_name: Andy full_name: Lücking, Andy last_name: Lücking - first_name: Peter full_name: Menke, Peter id: '59649' last_name: Menke citation: ama: Mehler A, Lücking A, Menke P. Assessing cognitive alignment in different types of dialog by means of a network model. Neural Networks. 2012;32:159-164. doi:10.1016/j.neunet.2012.02.013 apa: Mehler, A., Lücking, A., & Menke, P. (2012). Assessing cognitive alignment in different types of dialog by means of a network model. Neural Networks, 32, 159–164. https://doi.org/10.1016/j.neunet.2012.02.013 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={10.1016/j.neunet.2012.02.013}, journal={Neural Networks}, publisher={Elsevier BV}, author={Mehler, Alexander and Lücking, Andy and Menke, Peter}, year={2012}, pages={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.” Neural Networks 32 (2012): 159–64. https://doi.org/10.1016/j.neunet.2012.02.013.' ieee: A. Mehler, A. Lücking, and P. Menke, “Assessing cognitive alignment in different types of dialog by means of a network model,” Neural Networks, vol. 32, pp. 159–164, 2012. mla: Mehler, Alexander, et al. “Assessing Cognitive Alignment in Different Types of Dialog by Means of a Network Model.” Neural Networks, vol. 32, Elsevier BV, 2012, pp. 159–64, doi:10.1016/j.neunet.2012.02.013. short: A. Mehler, A. Lücking, P. Menke, Neural Networks 32 (2012) 159–164. date_created: 2018-12-07T15:17:39Z date_updated: 2022-01-06T07:02:51Z department: - _id: '115' doi: 10.1016/j.neunet.2012.02.013 extern: '1' intvolume: ' 32' language: - iso: eng page: 159-164 publication: Neural Networks publication_identifier: issn: - 0893-6080 publication_status: published publisher: Elsevier BV status: public title: Assessing cognitive alignment in different types of dialog by means of a network model type: journal_article user_id: '59649' volume: 32 year: '2012' ...