--- _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' ... --- _id: '6057' author: - first_name: Peter full_name: Menke, Peter id: '59649' last_name: Menke citation: ama: 'Menke P. Evaluation of Technical Communication. In: Handbook of Technical Communication. Vol 8. Handbooks of Applied Linguistics. de Gruyter; 2012:285–314.' apa: Menke, P. (2012). Evaluation of Technical Communication. In Handbook of Technical Communication (Vol. 8, pp. 285–314). de Gruyter. bibtex: '@inbook{Menke_2012, series={Handbooks of Applied Linguistics}, title={Evaluation of Technical Communication}, volume={8}, booktitle={Handbook of Technical Communication}, publisher={de Gruyter}, author={Menke, Peter}, year={2012}, pages={285–314}, collection={Handbooks of Applied Linguistics} }' chicago: Menke, Peter. “Evaluation of Technical Communication.” In Handbook of Technical Communication, 8:285–314. Handbooks of Applied Linguistics. de Gruyter, 2012. ieee: P. Menke, “Evaluation of Technical Communication,” in Handbook of Technical Communication, vol. 8, de Gruyter, 2012, pp. 285–314. mla: Menke, Peter. “Evaluation of Technical Communication.” Handbook of Technical Communication, vol. 8, de Gruyter, 2012, pp. 285–314. short: 'P. Menke, in: Handbook of Technical Communication, de Gruyter, 2012, pp. 285–314.' date_created: 2018-12-07T15:22:25Z date_updated: 2022-01-06T07:02:51Z department: - _id: '115' extern: '1' intvolume: ' 8' language: - iso: eng page: 285–314 publication: Handbook of Technical Communication publication_identifier: isbn: - 978-3-11-018834-9 publication_status: published publisher: de Gruyter series_title: Handbooks of Applied Linguistics status: public title: Evaluation of Technical Communication type: book_chapter user_id: '59649' volume: 8 year: '2012' ... --- _id: '606' author: - first_name: Nils full_name: Löken, Nils id: '13703' last_name: Löken citation: ama: Löken N. Identitätsbasierte Signaturen - Ein Sicherheitsbeweis für Signaturen auf Grundlage von Gap-Diffie-Hellman-Gruppen mit Hilfe des Forking-Lemmas. Universität Paderborn; 2012. apa: Löken, N. (2012). Identitätsbasierte Signaturen - Ein Sicherheitsbeweis für Signaturen auf Grundlage von Gap-Diffie-Hellman-Gruppen mit Hilfe des Forking-Lemmas. Universität Paderborn. bibtex: '@book{Löken_2012, title={Identitätsbasierte Signaturen - Ein Sicherheitsbeweis für Signaturen auf Grundlage von Gap-Diffie-Hellman-Gruppen mit Hilfe des Forking-Lemmas}, publisher={Universität Paderborn}, author={Löken, Nils}, year={2012} }' chicago: Löken, Nils. Identitätsbasierte Signaturen - Ein Sicherheitsbeweis für Signaturen auf Grundlage von Gap-Diffie-Hellman-Gruppen mit Hilfe des Forking-Lemmas. Universität Paderborn, 2012. ieee: N. Löken, Identitätsbasierte Signaturen - Ein Sicherheitsbeweis für Signaturen auf Grundlage von Gap-Diffie-Hellman-Gruppen mit Hilfe des Forking-Lemmas. Universität Paderborn, 2012. mla: Löken, Nils. Identitätsbasierte Signaturen - Ein Sicherheitsbeweis für Signaturen auf Grundlage von Gap-Diffie-Hellman-Gruppen mit Hilfe des Forking-Lemmas. Universität Paderborn, 2012. short: N. Löken, Identitätsbasierte Signaturen - Ein Sicherheitsbeweis für Signaturen auf Grundlage von Gap-Diffie-Hellman-Gruppen mit Hilfe des Forking-Lemmas, Universität Paderborn, 2012. date_created: 2017-10-17T12:42:50Z date_updated: 2022-01-06T07:02:51Z department: - _id: '64' language: - iso: ger project: - _id: '1' name: SFB 901 - _id: '13' name: SFB 901 - Subprojekt C1 - _id: '4' name: SFB 901 - Project Area C publisher: Universität Paderborn status: public supervisor: - first_name: Johannes full_name: Blömer, Johannes id: '23' last_name: Blömer title: Identitätsbasierte Signaturen - Ein Sicherheitsbeweis für Signaturen auf Grundlage von Gap-Diffie-Hellman-Gruppen mit Hilfe des Forking-Lemmas type: bachelorsthesis user_id: '13703' year: '2012' ... --- _id: '607' author: - first_name: Thomas full_name: Haarhoff, Thomas last_name: Haarhoff citation: ama: Haarhoff T. Identitätsbasierte Kryptographie - Implementierung von Paarungen für Körper der Charakteristik 2. Universität Paderborn; 2012. apa: Haarhoff, T. (2012). Identitätsbasierte Kryptographie - Implementierung von Paarungen für Körper der Charakteristik 2. Universität Paderborn. bibtex: '@book{Haarhoff_2012, title={Identitätsbasierte Kryptographie - Implementierung von Paarungen für Körper der Charakteristik 2}, publisher={Universität Paderborn}, author={Haarhoff, Thomas}, year={2012} }' chicago: Haarhoff, Thomas. Identitätsbasierte Kryptographie - Implementierung von Paarungen für Körper der Charakteristik 2. Universität Paderborn, 2012. ieee: T. Haarhoff, Identitätsbasierte Kryptographie - Implementierung von Paarungen für Körper der Charakteristik 2. Universität Paderborn, 2012. mla: Haarhoff, Thomas. Identitätsbasierte Kryptographie - Implementierung von Paarungen für Körper der Charakteristik 2. Universität Paderborn, 2012. short: T. Haarhoff, Identitätsbasierte Kryptographie - Implementierung von Paarungen für Körper der Charakteristik 2, Universität Paderborn, 2012. date_created: 2017-10-17T12:42:50Z date_updated: 2022-01-06T07:02:51Z department: - _id: '64' language: - iso: ger project: - _id: '1' name: SFB 901 - _id: '13' name: SFB 901 - Subprojekt C1 - _id: '4' name: SFB 901 - Project Area C publisher: Universität Paderborn status: public supervisor: - first_name: Johannes full_name: Blömer, Johannes id: '23' last_name: Blömer title: Identitätsbasierte Kryptographie - Implementierung von Paarungen für Körper der Charakteristik 2 type: bachelorsthesis user_id: '477' year: '2012' ... --- _id: '608' abstract: - lang: eng text: 'Predicate abstraction is an established technique in software verification. It inherently includes an abstraction refinement loop successively adding predicates until the right level of abstraction is found. For concurrent systems, predicate abstraction can be combined with spotlight abstraction, further reducing the state space by abstracting away certain processes. Refinement then has to decide whether to add a new predicate or a new process. Selecting the right predicates and processes is a crucial task: The positive effect of abstraction may be compromised by unfavourable refinement decisions. Here we present a heuristic approach to abstraction refinement. The basis for a decision is a set of refinement candidates, derived by multiple counterexample-generation. Candidates are evaluated with respect to their influence on other components in the system. Experimental results show that our technique can significantly speed up verification as compared to a naive abstraction refinement.' author: - first_name: Nils full_name: Timm, Nils last_name: Timm - first_name: Heike full_name: Wehrheim, Heike id: '573' last_name: Wehrheim - first_name: Mike full_name: Czech, Mike last_name: Czech citation: ama: 'Timm N, Wehrheim H, Czech M. Heuristic-Guided Abstraction Refinement for Concurrent Systems. In: Proceedings of the 14th International Conference on Formal Engineering Methods (ICFEM). LNCS. ; 2012:348-363. doi:10.1007/978-3-642-34281-3_25' apa: Timm, N., Wehrheim, H., & Czech, M. (2012). Heuristic-Guided Abstraction Refinement for Concurrent Systems. In Proceedings of the 14th International Conference on Formal Engineering Methods (ICFEM) (pp. 348–363). https://doi.org/10.1007/978-3-642-34281-3_25 bibtex: '@inproceedings{Timm_Wehrheim_Czech_2012, series={LNCS}, title={Heuristic-Guided Abstraction Refinement for Concurrent Systems}, DOI={10.1007/978-3-642-34281-3_25}, booktitle={Proceedings of the 14th International Conference on Formal Engineering Methods (ICFEM)}, author={Timm, Nils and Wehrheim, Heike and Czech, Mike}, year={2012}, pages={348–363}, collection={LNCS} }' chicago: Timm, Nils, Heike Wehrheim, and Mike Czech. “Heuristic-Guided Abstraction Refinement for Concurrent Systems.” In Proceedings of the 14th International Conference on Formal Engineering Methods (ICFEM), 348–63. LNCS, 2012. https://doi.org/10.1007/978-3-642-34281-3_25. ieee: N. Timm, H. Wehrheim, and M. Czech, “Heuristic-Guided Abstraction Refinement for Concurrent Systems,” in Proceedings of the 14th International Conference on Formal Engineering Methods (ICFEM), 2012, pp. 348–363. mla: Timm, Nils, et al. “Heuristic-Guided Abstraction Refinement for Concurrent Systems.” Proceedings of the 14th International Conference on Formal Engineering Methods (ICFEM), 2012, pp. 348–63, doi:10.1007/978-3-642-34281-3_25. short: 'N. Timm, H. Wehrheim, M. Czech, in: Proceedings of the 14th International Conference on Formal Engineering Methods (ICFEM), 2012, pp. 348–363.' date_created: 2017-10-17T12:42:50Z date_updated: 2022-01-06T07:02:52Z ddc: - '040' department: - _id: '77' doi: 10.1007/978-3-642-34281-3_25 file: - access_level: closed content_type: application/pdf creator: florida date_created: 2018-03-15T08:15:33Z date_updated: 2018-03-15T08:15:33Z file_id: '1250' file_name: 608-Timm2013-0main.pdf file_size: 396337 relation: main_file success: 1 file_date_updated: 2018-03-15T08:15:33Z has_accepted_license: '1' language: - iso: eng page: 348-363 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: Heuristic-Guided Abstraction Refinement for Concurrent Systems type: conference user_id: '477' year: '2012' ... --- _id: '610' author: - first_name: Mario full_name: Mohr, Mario last_name: Mohr citation: ama: Mohr M. Generating Prototypes of Adaptive Component-Based Software Systems for Performance Analysis. Universität Paderborn; 2012. apa: Mohr, M. (2012). Generating Prototypes of Adaptive Component-based Software Systems for Performance Analysis. Universität Paderborn. bibtex: '@book{Mohr_2012, title={Generating Prototypes of Adaptive Component-based Software Systems for Performance Analysis}, publisher={Universität Paderborn}, author={Mohr, Mario}, year={2012} }' chicago: Mohr, Mario. Generating Prototypes of Adaptive Component-Based Software Systems for Performance Analysis. Universität Paderborn, 2012. ieee: M. Mohr, Generating Prototypes of Adaptive Component-based Software Systems for Performance Analysis. Universität Paderborn, 2012. mla: Mohr, Mario. Generating Prototypes of Adaptive Component-Based Software Systems for Performance Analysis. Universität Paderborn, 2012. short: M. Mohr, Generating Prototypes of Adaptive Component-Based Software Systems for Performance Analysis, Universität Paderborn, 2012. date_created: 2017-10-17T12:42:51Z date_updated: 2022-01-06T07:02:52Z ddc: - '040' file: - access_level: closed content_type: application/pdf creator: florida date_created: 2018-03-15T08:13:40Z date_updated: 2018-03-15T08:13:40Z file_id: '1248' file_name: 610-MA_Mohr_2012_final.pdf file_size: 1270467 relation: main_file success: 1 file_date_updated: 2018-03-15T08:13:40Z has_accepted_license: '1' project: - _id: '1' name: SFB 901 - _id: '11' name: SFB 901 - Subprojekt B3 - _id: '3' name: SFB 901 - Project Area B publisher: Universität Paderborn status: public title: Generating Prototypes of Adaptive Component-based Software Systems for Performance Analysis type: mastersthesis user_id: '15504' year: '2012' ... --- _id: '6102' author: - first_name: Holger full_name: Steinmetz, Holger id: '43261' last_name: Steinmetz - first_name: C full_name: Schwens, C last_name: Schwens - first_name: M full_name: Wehner, M last_name: Wehner - first_name: Rüdiger full_name: Kabst, Rüdiger id: '42362' last_name: Kabst citation: ama: 'Steinmetz H, Schwens C, Wehner M, Kabst R. Das Cranet-Projekt: Kreuzkulturelle Vergleiche im HR-Management. PERSONALquartely. 2012;64(1):34-39.' apa: 'Steinmetz, H., Schwens, C., Wehner, M., & Kabst, R. (2012). Das Cranet-Projekt: Kreuzkulturelle Vergleiche im HR-Management. PERSONALquartely, 64(1), 34–39.' bibtex: '@article{Steinmetz_Schwens_Wehner_Kabst_2012, title={Das Cranet-Projekt: Kreuzkulturelle Vergleiche im HR-Management.}, volume={64}, number={1}, journal={PERSONALquartely}, author={Steinmetz, Holger and Schwens, C and Wehner, M and Kabst, Rüdiger}, year={2012}, pages={34–39} }' chicago: 'Steinmetz, Holger, C Schwens, M Wehner, and Rüdiger Kabst. “Das Cranet-Projekt: Kreuzkulturelle Vergleiche Im HR-Management.” PERSONALquartely 64, no. 1 (2012): 34–39.' ieee: 'H. Steinmetz, C. Schwens, M. Wehner, and R. Kabst, “Das Cranet-Projekt: Kreuzkulturelle Vergleiche im HR-Management.,” PERSONALquartely, vol. 64, no. 1, pp. 34–39, 2012.' mla: 'Steinmetz, Holger, et al. “Das Cranet-Projekt: Kreuzkulturelle Vergleiche Im HR-Management.” PERSONALquartely, vol. 64, no. 1, 2012, pp. 34–39.' short: H. Steinmetz, C. Schwens, M. Wehner, R. Kabst, PERSONALquartely 64 (2012) 34–39. date_created: 2018-12-10T11:09:13Z date_updated: 2022-01-06T07:02:53Z department: - _id: '274' intvolume: ' 64' issue: '1' language: - iso: eng page: 34-39 publication: PERSONALquartely status: public title: 'Das Cranet-Projekt: Kreuzkulturelle Vergleiche im HR-Management.' type: journal_article user_id: '46632' volume: 64 year: '2012' ... --- _id: '6103' author: - first_name: Rüdiger full_name: Kabst, Rüdiger id: '42362' last_name: Kabst - first_name: M full_name: Baum, M last_name: Baum citation: ama: 'Kabst R, Baum M. Editorial: Employer Branding: Strategie, Instrumente, Umsetzung. PERSONALquartely. 2012;64(3):3.' apa: 'Kabst, R., & Baum, M. (2012). Editorial: Employer Branding: Strategie, Instrumente, Umsetzung. PERSONALquartely, 64(3), 3.' bibtex: '@article{Kabst_Baum_2012, title={Editorial: Employer Branding: Strategie, Instrumente, Umsetzung}, volume={64}, number={3}, journal={PERSONALquartely}, author={Kabst, Rüdiger and Baum, M}, year={2012}, pages={3} }' chicago: 'Kabst, Rüdiger, and M Baum. “Editorial: Employer Branding: Strategie, Instrumente, Umsetzung.” PERSONALquartely 64, no. 3 (2012): 3.' ieee: 'R. Kabst and M. Baum, “Editorial: Employer Branding: Strategie, Instrumente, Umsetzung,” PERSONALquartely, vol. 64, no. 3, p. 3, 2012.' mla: 'Kabst, Rüdiger, and M. Baum. “Editorial: Employer Branding: Strategie, Instrumente, Umsetzung.” PERSONALquartely, vol. 64, no. 3, 2012, p. 3.' short: R. Kabst, M. Baum, PERSONALquartely 64 (2012) 3. date_created: 2018-12-10T11:39:27Z date_updated: 2022-01-06T07:02:53Z department: - _id: '274' intvolume: ' 64' issue: '3' language: - iso: eng page: '3' publication: PERSONALquartely status: public title: 'Editorial: Employer Branding: Strategie, Instrumente, Umsetzung' type: journal_article user_id: '46632' volume: 64 year: '2012' ... --- _id: '611' author: - first_name: Hendrik full_name: Hangmann, Hendrik last_name: Hangmann citation: ama: Hangmann H. Generating Adjustable Temperature Gradients on Modern FPGAs. Universität Paderborn; 2012. apa: Hangmann, H. (2012). Generating Adjustable Temperature Gradients on modern FPGAs. Universität Paderborn. bibtex: '@book{Hangmann_2012, title={Generating Adjustable Temperature Gradients on modern FPGAs}, publisher={Universität Paderborn}, author={Hangmann, Hendrik}, year={2012} }' chicago: Hangmann, Hendrik. Generating Adjustable Temperature Gradients on Modern FPGAs. Universität Paderborn, 2012. ieee: H. Hangmann, Generating Adjustable Temperature Gradients on modern FPGAs. Universität Paderborn, 2012. mla: Hangmann, Hendrik. Generating Adjustable Temperature Gradients on Modern FPGAs. Universität Paderborn, 2012. short: H. Hangmann, Generating Adjustable Temperature Gradients on Modern FPGAs, Universität Paderborn, 2012. date_created: 2017-10-17T12:42:51Z date_updated: 2022-01-06T07:02:53Z 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: Generating Adjustable Temperature Gradients on modern FPGAs type: bachelorsthesis user_id: '15504' year: '2012' ... --- _id: '613' author: - first_name: Stefan full_name: Wohlfarth, Stefan last_name: Wohlfarth citation: ama: Wohlfarth S. Erweiterung von d3fact um die Domäne Wasserversorgung in Verbindung mit der Analyse und Implementierung eines hydraulischen Simulationsverfahrens. Universität Paderborn; 2012. apa: Wohlfarth, S. (2012). Erweiterung von d3fact um die Domäne Wasserversorgung in Verbindung mit der Analyse und Implementierung eines hydraulischen Simulationsverfahrens. Universität Paderborn. bibtex: '@book{Wohlfarth_2012, title={Erweiterung von d3fact um die Domäne Wasserversorgung in Verbindung mit der Analyse und Implementierung eines hydraulischen Simulationsverfahrens}, publisher={Universität Paderborn}, author={Wohlfarth, Stefan}, year={2012} }' chicago: Wohlfarth, Stefan. Erweiterung von d3fact um die Domäne Wasserversorgung in Verbindung mit der Analyse und Implementierung eines hydraulischen Simulationsverfahrens. Universität Paderborn, 2012. ieee: S. Wohlfarth, Erweiterung von d3fact um die Domäne Wasserversorgung in Verbindung mit der Analyse und Implementierung eines hydraulischen Simulationsverfahrens. Universität Paderborn, 2012. mla: Wohlfarth, Stefan. Erweiterung von d3fact um die Domäne Wasserversorgung in Verbindung mit der Analyse und Implementierung eines hydraulischen Simulationsverfahrens. Universität Paderborn, 2012. short: S. Wohlfarth, Erweiterung von d3fact um die Domäne Wasserversorgung in Verbindung mit der Analyse und Implementierung eines hydraulischen Simulationsverfahrens, Universität Paderborn, 2012. date_created: 2017-10-17T12:42:51Z date_updated: 2022-01-06T07:02:53Z 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: Erweiterung von d3fact um die Domäne Wasserversorgung in Verbindung mit der Analyse und Implementierung eines hydraulischen Simulationsverfahrens type: mastersthesis user_id: '477' year: '2012' ... --- _id: '6138' author: - first_name: W full_name: Weber, W last_name: Weber - first_name: Rüdiger full_name: Kabst, Rüdiger id: '42362' last_name: Kabst citation: ama: Weber W, Kabst R. Einführung in Die Betriebswirtschaftslehre. 8th ed. Wiesbaden; 2012. apa: Weber, W., & Kabst, R. (2012). Einführung in die Betriebswirtschaftslehre (8th ed.). Wiesbaden. bibtex: '@book{Weber_Kabst_2012, place={Wiesbaden}, edition={8}, title={Einführung in die Betriebswirtschaftslehre}, author={Weber, W and Kabst, Rüdiger}, year={2012} }' chicago: Weber, W, and Rüdiger Kabst. Einführung in Die Betriebswirtschaftslehre. 8th ed. Wiesbaden, 2012. ieee: W. Weber and R. Kabst, Einführung in die Betriebswirtschaftslehre, 8th ed. Wiesbaden, 2012. mla: Weber, W., and Rüdiger Kabst. Einführung in Die Betriebswirtschaftslehre. 8th ed., 2012. short: W. Weber, R. Kabst, Einführung in Die Betriebswirtschaftslehre, 8th ed., Wiesbaden, 2012. date_created: 2018-12-11T10:21:09Z date_updated: 2022-01-06T07:02:53Z department: - _id: '274' edition: '8' language: - iso: eng place: Wiesbaden publication_identifier: isbn: - 978-3-8349-1994-6 status: public title: Einführung in die Betriebswirtschaftslehre type: book user_id: '46632' year: '2012' ... --- _id: '614' author: - first_name: Sebastian full_name: Lehrig, Sebastian last_name: Lehrig citation: ama: Lehrig S. Empirischer, quantitativer Vergleich von Modelltransformationssprachen. Universität Paderborn; 2012. apa: Lehrig, S. (2012). Empirischer, quantitativer Vergleich von Modelltransformationssprachen. Universität Paderborn. bibtex: '@book{Lehrig_2012, title={Empirischer, quantitativer Vergleich von Modelltransformationssprachen}, publisher={Universität Paderborn}, author={Lehrig, Sebastian}, year={2012} }' chicago: Lehrig, Sebastian. Empirischer, quantitativer Vergleich von Modelltransformationssprachen. Universität Paderborn, 2012. ieee: S. Lehrig, Empirischer, quantitativer Vergleich von Modelltransformationssprachen. Universität Paderborn, 2012. mla: Lehrig, Sebastian. Empirischer, quantitativer Vergleich von Modelltransformationssprachen. Universität Paderborn, 2012. short: S. Lehrig, Empirischer, quantitativer Vergleich von Modelltransformationssprachen, Universität Paderborn, 2012. date_created: 2017-10-17T12:42:51Z date_updated: 2022-01-06T07:02:53Z language: - iso: ger project: - _id: '1' name: SFB 901 - _id: '11' name: SFB 901 - Subprojekt B3 - _id: '3' name: SFB 901 - Project Area B publisher: Universität Paderborn status: public title: Empirischer, quantitativer Vergleich von Modelltransformationssprachen type: mastersthesis user_id: '477' year: '2012' ... --- _id: '6148' author: - first_name: M full_name: Baum, M last_name: Baum - first_name: C full_name: Schwens, C last_name: Schwens - first_name: R full_name: Kabst, R last_name: Kabst citation: ama: 'Baum M, Schwens C, Kabst R. Determinants of Different Types of Born Globals. In: Gabrielsson M, Kirpalani M, eds. Handbook of Research on Born Globals. Cheltenham Glos/Northampton: Edward Elgar Publishing Ltd.; 2012:36-45.' apa: 'Baum, M., Schwens, C., & Kabst, R. (2012). Determinants of Different Types of Born Globals. In M. Gabrielsson & M. Kirpalani (Eds.), Handbook of Research on Born Globals (pp. 36–45). Cheltenham Glos/Northampton: Edward Elgar Publishing Ltd.' bibtex: '@inbook{Baum_Schwens_Kabst_2012, place={Cheltenham Glos/Northampton}, title={Determinants of Different Types of Born Globals.}, booktitle={Handbook of Research on Born Globals}, publisher={Edward Elgar Publishing Ltd.}, author={Baum, M and Schwens, C and Kabst, R}, editor={Gabrielsson, M and Kirpalani, MEditors}, year={2012}, pages={36–45} }' chicago: 'Baum, M, C Schwens, and R Kabst. “Determinants of Different Types of Born Globals.” In Handbook of Research on Born Globals, edited by M Gabrielsson and M Kirpalani, 36–45. Cheltenham Glos/Northampton: Edward Elgar Publishing Ltd., 2012.' ieee: 'M. Baum, C. Schwens, and R. Kabst, “Determinants of Different Types of Born Globals.,” in Handbook of Research on Born Globals, M. Gabrielsson and M. Kirpalani, Eds. Cheltenham Glos/Northampton: Edward Elgar Publishing Ltd., 2012, pp. 36–45.' mla: Baum, M., et al. “Determinants of Different Types of Born Globals.” Handbook of Research on Born Globals, edited by M Gabrielsson and M Kirpalani, Edward Elgar Publishing Ltd., 2012, pp. 36–45. short: 'M. Baum, C. Schwens, R. Kabst, in: M. Gabrielsson, M. Kirpalani (Eds.), Handbook of Research on Born Globals, Edward Elgar Publishing Ltd., Cheltenham Glos/Northampton, 2012, pp. 36–45.' date_created: 2018-12-11T11:02:56Z date_updated: 2022-01-06T07:02:53Z department: - _id: '274' editor: - first_name: M full_name: Gabrielsson, M last_name: Gabrielsson - first_name: M full_name: Kirpalani, M last_name: Kirpalani language: - iso: eng page: 36-45 place: Cheltenham Glos/Northampton publication: Handbook of Research on Born Globals publisher: Edward Elgar Publishing Ltd. status: public title: Determinants of Different Types of Born Globals. type: book_chapter user_id: '46632' year: '2012' ... --- _id: '6149' author: - first_name: R full_name: Isidor, R last_name: Isidor - first_name: C full_name: Schwens, C last_name: Schwens - first_name: R full_name: Kabst, R last_name: Kabst citation: ama: 'Isidor R, Schwens C, Kabst R. Die Messung von Joint-Venture Erfolg. In: Zentes J, ed. Markteintrittsstrategien - Dynamik Und Komplexität. ; 2012:193-205.' apa: Isidor, R., Schwens, C., & Kabst, R. (2012). Die Messung von Joint-Venture Erfolg. In J. Zentes (Ed.), Markteintrittsstrategien - Dynamik und Komplexität (pp. 193–205). bibtex: '@inbook{Isidor_Schwens_Kabst_2012, title={Die Messung von Joint-Venture Erfolg}, booktitle={Markteintrittsstrategien - Dynamik und Komplexität}, author={Isidor, R and Schwens, C and Kabst, R}, editor={Zentes, JEditor}, year={2012}, pages={193–205} }' chicago: Isidor, R, C Schwens, and R Kabst. “Die Messung von Joint-Venture Erfolg.” In Markteintrittsstrategien - Dynamik Und Komplexität, edited by J Zentes, 193–205, 2012. ieee: R. Isidor, C. Schwens, and R. Kabst, “Die Messung von Joint-Venture Erfolg,” in Markteintrittsstrategien - Dynamik und Komplexität, J. Zentes, Ed. 2012, pp. 193–205. mla: Isidor, R., et al. “Die Messung von Joint-Venture Erfolg.” Markteintrittsstrategien - Dynamik Und Komplexität, edited by J Zentes, 2012, pp. 193–205. short: 'R. Isidor, C. Schwens, R. Kabst, in: J. Zentes (Ed.), Markteintrittsstrategien - Dynamik Und Komplexität, 2012, pp. 193–205.' date_created: 2018-12-11T11:06:03Z date_updated: 2022-01-06T07:02:53Z department: - _id: '274' editor: - first_name: J full_name: Zentes, J last_name: Zentes language: - iso: eng page: 193-205 publication: Markteintrittsstrategien - Dynamik und Komplexität publication_identifier: isbn: - 978-3-8349-3503-8 status: public title: Die Messung von Joint-Venture Erfolg type: book_chapter user_id: '46632' year: '2012' ... --- _id: '616' author: - first_name: Sven full_name: Kluczniok, Sven last_name: Kluczniok citation: ama: Kluczniok S. Effiziente Paketbildung in mehrdimensionalen Verhandlungsproblemen. Universität Paderborn; 2012. apa: Kluczniok, S. (2012). Effiziente Paketbildung in mehrdimensionalen Verhandlungsproblemen. Universität Paderborn. bibtex: '@book{Kluczniok_2012, title={Effiziente Paketbildung in mehrdimensionalen Verhandlungsproblemen}, publisher={Universität Paderborn}, author={Kluczniok, Sven}, year={2012} }' chicago: Kluczniok, Sven. Effiziente Paketbildung in mehrdimensionalen Verhandlungsproblemen. Universität Paderborn, 2012. ieee: S. Kluczniok, Effiziente Paketbildung in mehrdimensionalen Verhandlungsproblemen. Universität Paderborn, 2012. mla: Kluczniok, Sven. Effiziente Paketbildung in mehrdimensionalen Verhandlungsproblemen. Universität Paderborn, 2012. short: S. Kluczniok, Effiziente Paketbildung in mehrdimensionalen Verhandlungsproblemen, Universität Paderborn, 2012. date_created: 2017-10-17T12:42:52Z date_updated: 2022-01-06T07:02:54Z 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: Effiziente Paketbildung in mehrdimensionalen Verhandlungsproblemen type: bachelorsthesis user_id: '477' year: '2012' ... --- _id: '617' abstract: - lang: eng text: In this paper, a color based feature extraction and classification approach for image processing in embedded systems in presented. The algorithms and data structures developed for this approach pay particular attention to reduce memory consumption and computation power of the entire image processing, since embedded systems usually impose strong restrictions regarding those resources. The feature extraction is realized in terms of an image segmentation algorithm. The criteria of homogeneity for merging pixels and regions is provided by the color classification mechanism, which incorporates appropriate methods for defining, representing and accessing subspaces in the working color space. By doing so, pixels and regions with color values that belong to the same color class can be merged. Furthermore, pixels with redundant color values that do not belong to any pre-defined color class can be completely discarded in order to minimize computational effort. Subsequently, the extracted regions are converted to a more convenient feature representation in terms of statistical moments up to and including second order. For evaluation, the whole image processing approach is applied to a mobile representative of embedded systems within the scope of a simple real-world scenario. author: - first_name: Alexander full_name: Jungmann, Alexander last_name: Jungmann - first_name: Bernd full_name: Kleinjohann, Bernd last_name: Kleinjohann - first_name: Elisabeth full_name: Kleinjohann, Elisabeth id: '15588' last_name: Kleinjohann - first_name: Maarten full_name: Bieshaar, Maarten last_name: Bieshaar citation: ama: 'Jungmann A, Kleinjohann B, Kleinjohann E, Bieshaar M. Efficient Color-Based Image Segmentation and Feature Classification for Image Processing in Embedded Systems. In: Proceedings of the Fourth International Conference on Resource Intensive Applications and Services (INTENSIVE). ; 2012:22-29.' apa: Jungmann, A., Kleinjohann, B., Kleinjohann, E., & Bieshaar, M. (2012). Efficient Color-Based Image Segmentation and Feature Classification for Image Processing in Embedded Systems. In Proceedings of the Fourth International Conference on Resource Intensive Applications and Services (INTENSIVE) (pp. 22–29). bibtex: '@inproceedings{Jungmann_Kleinjohann_Kleinjohann_Bieshaar_2012, title={Efficient Color-Based Image Segmentation and Feature Classification for Image Processing in Embedded Systems}, booktitle={Proceedings of the Fourth International Conference on Resource Intensive Applications and Services (INTENSIVE)}, author={Jungmann, Alexander and Kleinjohann, Bernd and Kleinjohann, Elisabeth and Bieshaar, Maarten}, year={2012}, pages={22–29} }' chicago: Jungmann, Alexander, Bernd Kleinjohann, Elisabeth Kleinjohann, and Maarten Bieshaar. “Efficient Color-Based Image Segmentation and Feature Classification for Image Processing in Embedded Systems.” In Proceedings of the Fourth International Conference on Resource Intensive Applications and Services (INTENSIVE), 22–29, 2012. ieee: A. Jungmann, B. Kleinjohann, E. Kleinjohann, and M. Bieshaar, “Efficient Color-Based Image Segmentation and Feature Classification for Image Processing in Embedded Systems,” in Proceedings of the Fourth International Conference on Resource Intensive Applications and Services (INTENSIVE), 2012, pp. 22–29. mla: Jungmann, Alexander, et al. “Efficient Color-Based Image Segmentation and Feature Classification for Image Processing in Embedded Systems.” Proceedings of the Fourth International Conference on Resource Intensive Applications and Services (INTENSIVE), 2012, pp. 22–29. short: 'A. Jungmann, B. Kleinjohann, E. Kleinjohann, M. Bieshaar, in: Proceedings of the Fourth International Conference on Resource Intensive Applications and Services (INTENSIVE), 2012, pp. 22–29.' date_created: 2017-10-17T12:42:52Z date_updated: 2022-01-06T07:02:55Z ddc: - '040' file: - access_level: closed content_type: application/pdf creator: florida date_created: 2018-03-15T06:47:50Z date_updated: 2018-03-15T06:47:50Z file_id: '1245' file_name: 617-INTENSIVE2012-Jungmann.pdf file_size: 2787964 relation: main_file success: 1 file_date_updated: 2018-03-15T06:47:50Z has_accepted_license: '1' page: 22-29 project: - _id: '1' name: SFB 901 - _id: '10' name: SFB 901 - Subprojekt B2 - _id: '3' name: SFB 901 - Project Area B publication: Proceedings of the Fourth International Conference on Resource Intensive Applications and Services (INTENSIVE) related_material: link: - relation: confirmation url: http://www.thinkmind.org/index.php?view=article&articleid=intensive_2012_1_50_30031 status: public title: Efficient Color-Based Image Segmentation and Feature Classification for Image Processing in Embedded Systems type: conference user_id: '477' year: '2012' ... --- _id: '618' author: - first_name: Sven full_name: Kurras, Sven last_name: Kurras citation: ama: Kurras S. Distributed Sampling of Regular Graphs. Universität Paderborn; 2012. apa: Kurras, S. (2012). Distributed Sampling of Regular Graphs. Universität Paderborn. bibtex: '@book{Kurras_2012, title={Distributed Sampling of Regular Graphs}, publisher={Universität Paderborn}, author={Kurras, Sven}, year={2012} }' chicago: Kurras, Sven. Distributed Sampling of Regular Graphs. Universität Paderborn, 2012. ieee: S. Kurras, Distributed Sampling of Regular Graphs. Universität Paderborn, 2012. mla: Kurras, Sven. Distributed Sampling of Regular Graphs. Universität Paderborn, 2012. short: S. Kurras, Distributed Sampling of Regular Graphs, Universität Paderborn, 2012. date_created: 2017-10-17T12:42:52Z date_updated: 2022-01-06T07:02:55Z 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: Distributed Sampling of Regular Graphs type: mastersthesis user_id: '15504' year: '2012' ... --- _id: '619' abstract: - lang: eng text: 'Dynamics in networks is caused by a variety of reasons, like nodes moving in 2D (or 3D) in multihop cellphone networks, joins and leaves in peer-to-peer networks, evolution in social networks, and many others. In order to understand such kinds of dynamics, and to design distributed algorithms that behave well under dynamics, many ways to model dynamics are introduced and analyzed w.r.t. correctness and eciency of distributed algorithms. In [16], Kuhn, Lynch, and Oshman have introduced a very general, worst case type model of dynamics: The edge set of the network may change arbitrarily from step to step, the only restriction is that it is connected at all times and the set of nodes does not change. An extended model demands that a xed connected subnetwork is maintained over each time interval of length T (T-interval dynamics). They have presented, among others, algorithms for counting the number of nodes under such general models of dynamics.In this paper, we generalize their models and algorithms by adding random edge faults, i.e., we consider fault-prone dynamic networks: We assume that an edge currently existing may fail to transmit data with some probability p. We rst observe that strong counting, i.e., each node knows the correct count and stops, is not possible in a model with random edge faults. Our main two positive results are feasibility and runtime bounds for weak counting, i.e., stopping is no longer required (but still a correct count in each node), and for strong counting with an upper bound, i.e., an upper bound N on n is known to all nodes.' author: - first_name: Philipp full_name: Brandes, Philipp last_name: Brandes - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm id: '15523' last_name: Meyer auf der Heide citation: ama: 'Brandes P, Meyer auf der Heide F. Distributed Computing in Fault-Prone Dynamic Networks. In: Proceedings of the 4th Workshop on Theoretical Aspects of Dynamic Distributed Systems (TADDS). ICPS. ; 2012:9-14. doi:10.1145/2414815.2414818' apa: Brandes, P., & Meyer auf der Heide, F. (2012). Distributed Computing in Fault-Prone Dynamic Networks. In Proceedings of the 4th Workshop on Theoretical Aspects of Dynamic Distributed Systems (TADDS) (pp. 9–14). https://doi.org/10.1145/2414815.2414818 bibtex: '@inproceedings{Brandes_Meyer auf der Heide_2012, series={ICPS}, title={Distributed Computing in Fault-Prone Dynamic Networks}, DOI={10.1145/2414815.2414818}, booktitle={Proceedings of the 4th Workshop on Theoretical Aspects of Dynamic Distributed Systems (TADDS)}, author={Brandes, Philipp and Meyer auf der Heide, Friedhelm}, year={2012}, pages={9–14}, collection={ICPS} }' chicago: Brandes, Philipp, and Friedhelm Meyer auf der Heide. “Distributed Computing in Fault-Prone Dynamic Networks.” In Proceedings of the 4th Workshop on Theoretical Aspects of Dynamic Distributed Systems (TADDS), 9–14. ICPS, 2012. https://doi.org/10.1145/2414815.2414818. ieee: P. Brandes and F. Meyer auf der Heide, “Distributed Computing in Fault-Prone Dynamic Networks,” in Proceedings of the 4th Workshop on Theoretical Aspects of Dynamic Distributed Systems (TADDS), 2012, pp. 9–14. mla: Brandes, Philipp, and Friedhelm Meyer auf der Heide. “Distributed Computing in Fault-Prone Dynamic Networks.” Proceedings of the 4th Workshop on Theoretical Aspects of Dynamic Distributed Systems (TADDS), 2012, pp. 9–14, doi:10.1145/2414815.2414818. short: 'P. Brandes, F. Meyer auf der Heide, in: Proceedings of the 4th Workshop on Theoretical Aspects of Dynamic Distributed Systems (TADDS), 2012, pp. 9–14.' date_created: 2017-10-17T12:42:52Z date_updated: 2022-01-06T07:02:56Z ddc: - '040' department: - _id: '63' doi: 10.1145/2414815.2414818 file: - access_level: closed content_type: application/pdf creator: florida date_created: 2018-03-15T06:47:15Z date_updated: 2018-03-15T06:47:15Z file_id: '1244' file_name: 619-Brandes_MadHTADDS12_01.pdf file_size: 346044 relation: main_file success: 1 file_date_updated: 2018-03-15T06:47:15Z has_accepted_license: '1' page: 9-14 project: - _id: '1' name: SFB 901 - _id: '5' name: SFB 901 - Subprojekt A1 - _id: '2' name: SFB 901 - Project Area A publication: Proceedings of the 4th Workshop on Theoretical Aspects of Dynamic Distributed Systems (TADDS) series_title: ICPS status: public title: Distributed Computing in Fault-Prone Dynamic Networks type: conference user_id: '15504' year: '2012' ... --- _id: '620' author: - first_name: Robert full_name: Mittendorf, Robert last_name: Mittendorf citation: ama: Mittendorf R. Datenschutzgerechtes DRM im Cloud Computing. Universität Paderborn; 2012. apa: Mittendorf, R. (2012). Datenschutzgerechtes DRM im Cloud Computing. Universität Paderborn. bibtex: '@book{Mittendorf_2012, title={Datenschutzgerechtes DRM im Cloud Computing}, publisher={Universität Paderborn}, author={Mittendorf, Robert}, year={2012} }' chicago: Mittendorf, Robert. Datenschutzgerechtes DRM im Cloud Computing. Universität Paderborn, 2012. ieee: R. Mittendorf, Datenschutzgerechtes DRM im Cloud Computing. Universität Paderborn, 2012. mla: Mittendorf, Robert. Datenschutzgerechtes DRM im Cloud Computing. Universität Paderborn, 2012. short: R. Mittendorf, Datenschutzgerechtes DRM im Cloud Computing, Universität Paderborn, 2012. date_created: 2017-10-17T12:42:52Z date_updated: 2022-01-06T07:02:56Z language: - iso: ger project: - _id: '1' name: SFB 901 - _id: '13' name: SFB 901 - Subprojekt C1 - _id: '4' name: SFB 901 - Project Area C publisher: Universität Paderborn status: public title: Datenschutzgerechtes DRM im Cloud Computing type: bachelorsthesis user_id: '477' year: '2012' ... --- _id: '621' author: - first_name: Stephan full_name: Sekula, Stephan last_name: Sekula citation: ama: Sekula S. Datenschutzgerechte E-Payment-Schemata im On-The-Fly Computing. Universität Paderborn; 2012. apa: Sekula, S. (2012). Datenschutzgerechte E-Payment-Schemata im On-The-Fly Computing. Universität Paderborn. bibtex: '@book{Sekula_2012, title={Datenschutzgerechte E-Payment-Schemata im On-The-Fly Computing}, publisher={Universität Paderborn}, author={Sekula, Stephan}, year={2012} }' chicago: Sekula, Stephan. Datenschutzgerechte E-Payment-Schemata im On-The-Fly Computing. Universität Paderborn, 2012. ieee: S. Sekula, Datenschutzgerechte E-Payment-Schemata im On-The-Fly Computing. Universität Paderborn, 2012. mla: Sekula, Stephan. Datenschutzgerechte E-Payment-Schemata im On-The-Fly Computing. Universität Paderborn, 2012. short: S. Sekula, Datenschutzgerechte E-Payment-Schemata im On-The-Fly Computing, Universität Paderborn, 2012. date_created: 2017-10-17T12:42:53Z date_updated: 2022-01-06T07:02:57Z language: - iso: ger project: - _id: '1' name: SFB 901 - _id: '13' name: SFB 901 - Subprojekt C1 - _id: '4' name: SFB 901 - Project Area C publisher: Universität Paderborn status: public title: Datenschutzgerechte E-Payment-Schemata im On-The-Fly Computing type: bachelorsthesis user_id: '477' year: '2012' ... --- _id: '622' abstract: - lang: eng text: Behavioral modeling languages are most useful if their behavior is specified formally such that it can e.g. be analyzed and executed automatically. Obviously, the quality of such behavior specifications is crucial. The rule-based semantics specification technique Dynamic Meta Modeling (DMM) honors this by using the approach of Test-driven Semantics Specification (TDSS), which makes sure that the specification at hand at least describes the correct behavior for a suite of test models. However, in its current state TDSS does not provide any means to measure the quality of such a test suite. In this paper, we describe how we have applied the idea of test coverage to TDSS. Similar to common approaches of defining test coverage criteria, we describe a data structure called invocation graph containing possible orders of applications ofDMM rules. Then we define different coverage criteria based on that data structure, taking the rule applications caused by the test suite’s models into account. Our implementation of the described approach gives the language engineer using DMM a means to reason about the quality of the language’s test suite, and also provides hints on how to improve that quality by adding dedicated test models to the test suite. author: - first_name: Svetlana full_name: Arifulina, Svetlana last_name: Arifulina - first_name: Gregor full_name: Engels, Gregor id: '107' last_name: Engels - first_name: Christian full_name: Soltenborn, Christian id: '1737' last_name: Soltenborn orcid: 0000-0002-0342-8227 citation: ama: 'Arifulina S, Engels G, Soltenborn C. Coverage Criteria for Testing DMM Specifications. In: Proceedings of the 11th International Workshop on Graph Transformation and Visual Modeling Techniques (GT-VMT). Electronic Communications of the EASST. ; 2012. doi:10.14279/tuj.eceasst.47.718' apa: Arifulina, S., Engels, G., & Soltenborn, C. (2012). Coverage Criteria for Testing DMM Specifications. In Proceedings of the 11th International Workshop on Graph Transformation and Visual Modeling Techniques (GT-VMT). https://doi.org/10.14279/tuj.eceasst.47.718 bibtex: '@inproceedings{Arifulina_Engels_Soltenborn_2012, series={Electronic Communications of the EASST}, title={Coverage Criteria for Testing DMM Specifications}, DOI={10.14279/tuj.eceasst.47.718}, booktitle={Proceedings of the 11th International Workshop on Graph Transformation and Visual Modeling Techniques (GT-VMT)}, author={Arifulina, Svetlana and Engels, Gregor and Soltenborn, Christian}, year={2012}, collection={Electronic Communications of the EASST} }' chicago: Arifulina, Svetlana, Gregor Engels, and Christian Soltenborn. “Coverage Criteria for Testing DMM Specifications.” In Proceedings of the 11th International Workshop on Graph Transformation and Visual Modeling Techniques (GT-VMT). Electronic Communications of the EASST, 2012. https://doi.org/10.14279/tuj.eceasst.47.718. ieee: S. Arifulina, G. Engels, and C. Soltenborn, “Coverage Criteria for Testing DMM Specifications,” in Proceedings of the 11th International Workshop on Graph Transformation and Visual Modeling Techniques (GT-VMT), 2012. mla: Arifulina, Svetlana, et al. “Coverage Criteria for Testing DMM Specifications.” Proceedings of the 11th International Workshop on Graph Transformation and Visual Modeling Techniques (GT-VMT), 2012, doi:10.14279/tuj.eceasst.47.718. short: 'S. Arifulina, G. Engels, C. Soltenborn, in: Proceedings of the 11th International Workshop on Graph Transformation and Visual Modeling Techniques (GT-VMT), 2012.' date_created: 2017-10-17T12:42:53Z date_updated: 2022-01-06T07:02:57Z ddc: - '040' department: - _id: '66' doi: 10.14279/tuj.eceasst.47.718 file: - access_level: closed content_type: application/pdf creator: florida date_created: 2018-03-15T06:46:40Z date_updated: 2018-03-15T06:46:40Z file_id: '1243' file_name: 622-gtvmt2012-Arifulina_01.pdf file_size: 301602 relation: main_file success: 1 file_date_updated: 2018-03-15T06:46:40Z has_accepted_license: '1' language: - iso: eng project: - _id: '1' name: SFB 901 - _id: '9' name: SFB 901 - Subprojekt B1 - _id: '3' name: SFB 901 - Project Area B publication: Proceedings of the 11th International Workshop on Graph Transformation and Visual Modeling Techniques (GT-VMT) series_title: Electronic Communications of the EASST status: public title: Coverage Criteria for Testing DMM Specifications type: conference user_id: '14955' year: '2012' ... --- _id: '623' abstract: - lang: eng text: 'This paper initiates the formal study of a fundamental problem: How to efficiently allocate a shared communication medium among a set of K co-existing networks in the presence of arbitrary external interference? While most literature on medium access focuses on how to share a medium among nodes, these approaches are often either not directly applicable to co-existing networks as they would violate the independence requirement, or they yield a low throughput if applied to multiple networks. We present the randomized medium access (MAC) protocol COMAC which guarantees that a given communication channel is shared fairly among competing and independent networks, and that the available bandwidth is used efficiently. These performance guarantees hold in the presence of arbitrary external interference or even under adversarial jamming. Concretely, we show that the co-existing networks can use a Ω(ε2 min{ε, 1/poly(K)})-fraction of the non-jammed time steps for successful message transmissions, where ε is the (arbitrarily distributed) fraction of time which is not jammed.' author: - first_name: Andrea W. full_name: Richa, Andrea W. last_name: Richa - first_name: Christian full_name: Scheideler, Christian id: '20792' last_name: Scheideler - first_name: Stefan full_name: Schmid, Stefan last_name: Schmid - first_name: 'Jin ' full_name: 'Zhang, Jin ' last_name: Zhang citation: ama: 'Richa AW, Scheideler C, Schmid S, Zhang J. Competitive and fair throughput for co-existing networks under adversarial interference. In: Proceedings of the 31st Annual ACM SIGACT-SIGOPS Symposium on Principles and Distributed Computing (PODC). ; 2012:291-300. doi:10.1145/2332432.2332488' apa: Richa, A. W., Scheideler, C., Schmid, S., & Zhang, J. (2012). Competitive and fair throughput for co-existing networks under adversarial interference. In Proceedings of the 31st Annual ACM SIGACT-SIGOPS Symposium on Principles and Distributed Computing (PODC) (pp. 291–300). https://doi.org/10.1145/2332432.2332488 bibtex: '@inproceedings{Richa_Scheideler_Schmid_Zhang_2012, title={Competitive and fair throughput for co-existing networks under adversarial interference}, DOI={10.1145/2332432.2332488}, booktitle={Proceedings of the 31st Annual ACM SIGACT-SIGOPS Symposium on Principles and Distributed Computing (PODC)}, author={Richa, Andrea W. and Scheideler, Christian and Schmid, Stefan and Zhang, Jin }, year={2012}, pages={291–300} }' chicago: Richa, Andrea W., Christian Scheideler, Stefan Schmid, and Jin Zhang. “Competitive and Fair Throughput for Co-Existing Networks under Adversarial Interference.” In Proceedings of the 31st Annual ACM SIGACT-SIGOPS Symposium on Principles and Distributed Computing (PODC), 291–300, 2012. https://doi.org/10.1145/2332432.2332488. ieee: A. W. Richa, C. Scheideler, S. Schmid, and J. Zhang, “Competitive and fair throughput for co-existing networks under adversarial interference,” in Proceedings of the 31st Annual ACM SIGACT-SIGOPS Symposium on Principles and Distributed Computing (PODC), 2012, pp. 291–300. mla: Richa, Andrea W., et al. “Competitive and Fair Throughput for Co-Existing Networks under Adversarial Interference.” Proceedings of the 31st Annual ACM SIGACT-SIGOPS Symposium on Principles and Distributed Computing (PODC), 2012, pp. 291–300, doi:10.1145/2332432.2332488. short: 'A.W. Richa, C. Scheideler, S. Schmid, J. Zhang, in: Proceedings of the 31st Annual ACM SIGACT-SIGOPS Symposium on Principles and Distributed Computing (PODC), 2012, pp. 291–300.' date_created: 2017-10-17T12:42:53Z date_updated: 2022-01-06T07:02:58Z ddc: - '040' department: - _id: '79' doi: 10.1145/2332432.2332488 file: - access_level: closed content_type: application/pdf creator: florida date_created: 2018-03-15T06:45:25Z date_updated: 2018-03-15T06:45:25Z file_id: '1241' file_name: 623-PODC-2012_01.pdf file_size: 210382 relation: main_file success: 1 file_date_updated: 2018-03-15T06:45:25Z has_accepted_license: '1' page: 291-300 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 31st Annual ACM SIGACT-SIGOPS Symposium on Principles and Distributed Computing (PODC) status: public title: Competitive and fair throughput for co-existing networks under adversarial interference type: conference user_id: '15504' year: '2012' ... --- _id: '624' author: - first_name: Marie-Christine full_name: Jakobs, Marie-Christine last_name: Jakobs citation: ama: Jakobs M-C. Change and Validity Analysis in Deductive Program Verification. Universität Paderborn; 2012. apa: Jakobs, M.-C. (2012). Change and Validity Analysis in Deductive Program Verification. Universität Paderborn. bibtex: '@book{Jakobs_2012, title={Change and Validity Analysis in Deductive Program Verification}, publisher={Universität Paderborn}, author={Jakobs, Marie-Christine}, year={2012} }' chicago: Jakobs, Marie-Christine. Change and Validity Analysis in Deductive Program Verification. Universität Paderborn, 2012. ieee: M.-C. Jakobs, Change and Validity Analysis in Deductive Program Verification. Universität Paderborn, 2012. mla: Jakobs, Marie-Christine. Change and Validity Analysis in Deductive Program Verification. Universität Paderborn, 2012. short: M.-C. Jakobs, Change and Validity Analysis in Deductive Program Verification, Universität Paderborn, 2012. date_created: 2017-10-17T12:42:53Z date_updated: 2022-01-06T07:02:58Z project: - _id: '1' name: SFB 901 - _id: '12' name: SFB 901 - Subprojekt B4 - _id: '3' name: SFB 901 - Project Area B publisher: Universität Paderborn status: public title: Change and Validity Analysis in Deductive Program Verification type: mastersthesis user_id: '15504' year: '2012' ... --- _id: '625' abstract: - lang: eng text: 'This paper initiates the study of self-adjusting distributed data structures for networks. In particular, we present SplayNets: a binary search tree based network that is self-adjusting to routing request.We derive entropy bounds on the amortized routing cost and show that our splaying algorithm has some interesting properties.' author: - first_name: Stefan full_name: Schmid, Stefan last_name: Schmid - first_name: Chen full_name: Avin, Chen last_name: Avin - first_name: Christian full_name: Scheideler, Christian id: '20792' last_name: Scheideler - first_name: Bernhard full_name: Häupler, Bernhard last_name: Häupler - first_name: Zvi full_name: Lotker, Zvi last_name: Lotker citation: ama: 'Schmid S, Avin C, Scheideler C, Häupler B, Lotker Z. Brief Announcement: SplayNets - Towards Self-Adjusting Distributed Data Structures. In: Proceedings of the 26th International Symposium on Distributed Computing (DISC). LNCS. ; 2012:439-440. doi:10.1007/978-3-642-33651-5_47' apa: 'Schmid, S., Avin, C., Scheideler, C., Häupler, B., & Lotker, Z. (2012). Brief Announcement: SplayNets - Towards Self-Adjusting Distributed Data Structures. In Proceedings of the 26th International Symposium on Distributed Computing (DISC) (pp. 439–440). https://doi.org/10.1007/978-3-642-33651-5_47' bibtex: '@inproceedings{Schmid_Avin_Scheideler_Häupler_Lotker_2012, series={LNCS}, title={Brief Announcement: SplayNets - Towards Self-Adjusting Distributed Data Structures}, DOI={10.1007/978-3-642-33651-5_47}, booktitle={Proceedings of the 26th International Symposium on Distributed Computing (DISC)}, author={Schmid, Stefan and Avin, Chen and Scheideler, Christian and Häupler, Bernhard and Lotker, Zvi}, year={2012}, pages={439–440}, collection={LNCS} }' chicago: 'Schmid, Stefan, Chen Avin, Christian Scheideler, Bernhard Häupler, and Zvi Lotker. “Brief Announcement: SplayNets - Towards Self-Adjusting Distributed Data Structures.” In Proceedings of the 26th International Symposium on Distributed Computing (DISC), 439–40. LNCS, 2012. https://doi.org/10.1007/978-3-642-33651-5_47.' ieee: 'S. Schmid, C. Avin, C. Scheideler, B. Häupler, and Z. Lotker, “Brief Announcement: SplayNets - Towards Self-Adjusting Distributed Data Structures,” in Proceedings of the 26th International Symposium on Distributed Computing (DISC), 2012, pp. 439–440.' mla: 'Schmid, Stefan, et al. “Brief Announcement: SplayNets - Towards Self-Adjusting Distributed Data Structures.” Proceedings of the 26th International Symposium on Distributed Computing (DISC), 2012, pp. 439–40, doi:10.1007/978-3-642-33651-5_47.' short: 'S. Schmid, C. Avin, C. Scheideler, B. Häupler, Z. Lotker, in: Proceedings of the 26th International Symposium on Distributed Computing (DISC), 2012, pp. 439–440.' date_created: 2017-10-17T12:42:53Z date_updated: 2022-01-06T07:02:58Z ddc: - '040' department: - _id: '79' doi: 10.1007/978-3-642-33651-5_47 file: - access_level: closed content_type: application/pdf creator: florida date_created: 2018-03-15T06:44:09Z date_updated: 2018-03-15T06:44:09Z file_id: '1240' file_name: 625-disc12adjBAshort.pdf file_size: 717284 relation: main_file success: 1 file_date_updated: 2018-03-15T06:44:09Z has_accepted_license: '1' page: 439-440 project: - _id: '1' name: SFB 901 - _id: '5' name: SFB 901 - Subprojekt A1 - _id: '2' name: SFB 901 - Project Area A publication: Proceedings of the 26th International Symposium on Distributed Computing (DISC) series_title: LNCS status: public title: 'Brief Announcement: SplayNets - Towards Self-Adjusting Distributed Data Structures' type: conference user_id: '15504' year: '2012' ... --- _id: '6250' author: - first_name: Volker full_name: Paelke, Volker last_name: Paelke - first_name: Karsten full_name: Nebe, Karsten last_name: Nebe - first_name: Christian full_name: Geiger, Christian last_name: Geiger - first_name: Florian full_name: Klompmaker, Florian last_name: Klompmaker - first_name: Holger Gerhard full_name: Fischer, Holger Gerhard id: '30457' last_name: Fischer citation: ama: Paelke V, Nebe K, Geiger C, Klompmaker F, Fischer HG. Multi-Modal, Multi-Touch Interaction with Maps in Disaster Management Applications. ISPRS - International Archives of the Photogrammetry, Remote Sensing and Spatial Information Sciences. 2012;XXXIX-B8:55-60. doi:10.5194/isprsarchives-xxxix-b8-55-2012 apa: Paelke, V., Nebe, K., Geiger, C., Klompmaker, F., & Fischer, H. G. (2012). Multi-Modal, Multi-Touch Interaction with Maps in Disaster Management Applications. ISPRS - International Archives of the Photogrammetry, Remote Sensing and Spatial Information Sciences, XXXIX-B8, 55–60. https://doi.org/10.5194/isprsarchives-xxxix-b8-55-2012 bibtex: '@article{Paelke_Nebe_Geiger_Klompmaker_Fischer_2012, title={Multi-Modal, Multi-Touch Interaction with Maps in Disaster Management Applications}, volume={XXXIX-B8}, DOI={10.5194/isprsarchives-xxxix-b8-55-2012}, journal={ISPRS - International Archives of the Photogrammetry, Remote Sensing and Spatial Information Sciences}, publisher={Copernicus GmbH}, author={Paelke, Volker and Nebe, Karsten and Geiger, Christian and Klompmaker, Florian and Fischer, Holger Gerhard}, year={2012}, pages={55–60} }' chicago: 'Paelke, Volker, Karsten Nebe, Christian Geiger, Florian Klompmaker, and Holger Gerhard Fischer. “Multi-Modal, Multi-Touch Interaction with Maps in Disaster Management Applications.” ISPRS - International Archives of the Photogrammetry, Remote Sensing and Spatial Information Sciences XXXIX-B8 (2012): 55–60. https://doi.org/10.5194/isprsarchives-xxxix-b8-55-2012.' ieee: V. Paelke, K. Nebe, C. Geiger, F. Klompmaker, and H. G. Fischer, “Multi-Modal, Multi-Touch Interaction with Maps in Disaster Management Applications,” ISPRS - International Archives of the Photogrammetry, Remote Sensing and Spatial Information Sciences, vol. XXXIX-B8, pp. 55–60, 2012. mla: Paelke, Volker, et al. “Multi-Modal, Multi-Touch Interaction with Maps in Disaster Management Applications.” ISPRS - International Archives of the Photogrammetry, Remote Sensing and Spatial Information Sciences, vol. XXXIX-B8, Copernicus GmbH, 2012, pp. 55–60, doi:10.5194/isprsarchives-xxxix-b8-55-2012. short: V. Paelke, K. Nebe, C. Geiger, F. Klompmaker, H.G. Fischer, ISPRS - International Archives of the Photogrammetry, Remote Sensing and Spatial Information Sciences XXXIX-B8 (2012) 55–60. date_created: 2018-12-18T10:18:13Z date_updated: 2022-01-06T07:02:58Z department: - _id: '66' - _id: '534' - _id: '221' doi: 10.5194/isprsarchives-xxxix-b8-55-2012 language: - iso: eng page: 55-60 publication: ISPRS - International Archives of the Photogrammetry, Remote Sensing and Spatial Information Sciences publication_identifier: issn: - 1682-1777 publication_status: published publisher: Copernicus GmbH status: public title: Multi-Modal, Multi-Touch Interaction with Maps in Disaster Management Applications type: journal_article user_id: '30457' volume: XXXIX-B8 year: '2012' ... --- _id: '626' abstract: - lang: eng text: The design of ecient search structures for peer-to-peer systems has attracted a lot of attention in recent years. In this announcement we address the problem of nding the predecessor in a key set and present an ecient data structure called hashed Predecessor Patricia trie. Our hashed Predecessor Patricia trie supports PredecessorSearch(x) and Insert(x) and Delete(x) in O(log log u) hash table accesses when u is the size of the universe of the keys. That is the costs only depend on u and not the size of the data structure. One feature of our approach is that it only uses the lookup interface of the hash table and therefore hash table accesses may be realized by any distributed hash table (DHT). author: - first_name: Sebastian full_name: Kniesburges, Sebastian last_name: Kniesburges - first_name: Christian full_name: Scheideler, Christian id: '20792' last_name: Scheideler citation: ama: 'Kniesburges S, Scheideler C. Brief Announcement: Hashed Predecessor Patricia Trie - A Data Structure for Efficient Predecessor Queries in Peer-to-Peer Systems. In: Proceedings of the 26th International Symposium on Distributed Computing (DISC). LNCS. ; 2012:435-436. doi:10.1007/978-3-642-33651-5_45' apa: 'Kniesburges, S., & Scheideler, C. (2012). Brief Announcement: Hashed Predecessor Patricia Trie - A Data Structure for Efficient Predecessor Queries in Peer-to-Peer Systems. In Proceedings of the 26th International Symposium on Distributed Computing (DISC) (pp. 435–436). https://doi.org/10.1007/978-3-642-33651-5_45' bibtex: '@inproceedings{Kniesburges_Scheideler_2012, series={LNCS}, title={Brief Announcement: Hashed Predecessor Patricia Trie - A Data Structure for Efficient Predecessor Queries in Peer-to-Peer Systems}, DOI={10.1007/978-3-642-33651-5_45}, booktitle={Proceedings of the 26th International Symposium on Distributed Computing (DISC)}, author={Kniesburges, Sebastian and Scheideler, Christian}, year={2012}, pages={435–436}, collection={LNCS} }' chicago: 'Kniesburges, Sebastian, and Christian Scheideler. “Brief Announcement: Hashed Predecessor Patricia Trie - A Data Structure for Efficient Predecessor Queries in Peer-to-Peer Systems.” In Proceedings of the 26th International Symposium on Distributed Computing (DISC), 435–36. LNCS, 2012. https://doi.org/10.1007/978-3-642-33651-5_45.' ieee: 'S. Kniesburges and C. Scheideler, “Brief Announcement: Hashed Predecessor Patricia Trie - A Data Structure for Efficient Predecessor Queries in Peer-to-Peer Systems,” in Proceedings of the 26th International Symposium on Distributed Computing (DISC), 2012, pp. 435–436.' mla: 'Kniesburges, Sebastian, and Christian Scheideler. “Brief Announcement: Hashed Predecessor Patricia Trie - A Data Structure for Efficient Predecessor Queries in Peer-to-Peer Systems.” Proceedings of the 26th International Symposium on Distributed Computing (DISC), 2012, pp. 435–36, doi:10.1007/978-3-642-33651-5_45.' short: 'S. Kniesburges, C. Scheideler, in: Proceedings of the 26th International Symposium on Distributed Computing (DISC), 2012, pp. 435–436.' date_created: 2017-10-17T12:42:54Z date_updated: 2022-01-06T07:02:59Z ddc: - '040' department: - _id: '79' doi: 10.1007/978-3-642-33651-5_45 file: - access_level: closed content_type: application/pdf creator: florida date_created: 2018-03-15T06:42:40Z date_updated: 2018-03-15T06:42:40Z file_id: '1239' file_name: 626-Predecessor-Kniesburges_Scheideler.pdf file_size: 184095 relation: main_file success: 1 file_date_updated: 2018-03-15T06:42:40Z has_accepted_license: '1' page: 435-436 project: - _id: '1' name: SFB 901 - _id: '5' name: SFB 901 - Subprojekt A1 - _id: '2' name: SFB 901 - Project Area A publication: Proceedings of the 26th International Symposium on Distributed Computing (DISC) series_title: LNCS status: public title: 'Brief Announcement: Hashed Predecessor Patricia Trie - A Data Structure for Efficient Predecessor Queries in Peer-to-Peer Systems' type: conference user_id: '15504' year: '2012' ... --- _id: '627' abstract: - lang: eng text: Block Abstraction Memoization (ABM) is a technique in software model checking that exploits the modularity of programs during verification by caching. To this end, ABM records the results of block analyses and reuses them if possible when revisiting the same block again. In this paper we present an implementation of ABM into the predicate-analysis component of the software-verification framework CPAchecker. With our participation at the Competition on Software Verification we aim at providing evidence that ABM can not only substantially increase the efficiency of predicate analysis but also enables verification of a wider range of programs. author: - first_name: Daniel full_name: Wonisch, Daniel last_name: Wonisch citation: ama: 'Wonisch D. Block Abstraction Memoization for CPAchecker. In: Proceedings of the 18th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS). LNCS. ; 2012:531-533. doi:10.1007/978-3-642-28756-5_41' apa: Wonisch, D. (2012). Block Abstraction Memoization for CPAchecker. In Proceedings of the 18th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS) (pp. 531–533). https://doi.org/10.1007/978-3-642-28756-5_41 bibtex: '@inproceedings{Wonisch_2012, series={LNCS}, title={Block Abstraction Memoization for CPAchecker}, DOI={10.1007/978-3-642-28756-5_41}, booktitle={Proceedings of the 18th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS)}, author={Wonisch, Daniel}, year={2012}, pages={531–533}, collection={LNCS} }' chicago: Wonisch, Daniel. “Block Abstraction Memoization for CPAchecker.” In Proceedings of the 18th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS), 531–33. LNCS, 2012. https://doi.org/10.1007/978-3-642-28756-5_41. ieee: D. Wonisch, “Block Abstraction Memoization for CPAchecker,” in Proceedings of the 18th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS), 2012, pp. 531–533. mla: Wonisch, Daniel. “Block Abstraction Memoization for CPAchecker.” Proceedings of the 18th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS), 2012, pp. 531–33, doi:10.1007/978-3-642-28756-5_41. short: 'D. Wonisch, in: Proceedings of the 18th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS), 2012, pp. 531–533.' date_created: 2017-10-17T12:42:54Z date_updated: 2022-01-06T07:02:59Z ddc: - '040' department: - _id: '77' doi: 10.1007/978-3-642-28756-5_41 file: - access_level: closed content_type: application/pdf creator: florida date_created: 2018-03-15T06:46:05Z date_updated: 2018-03-15T06:46:05Z file_id: '1242' file_name: 627-WonischSV-Comp2012_01.pdf file_size: 184000 relation: main_file success: 1 file_date_updated: 2018-03-15T06:46:05Z has_accepted_license: '1' language: - iso: eng page: 531-533 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 18th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS) series_title: LNCS status: public title: Block Abstraction Memoization for CPAchecker type: conference user_id: '477' year: '2012' ... --- _id: '6275' author: - first_name: M full_name: Schneid, M last_name: Schneid - first_name: Holger full_name: Steinmetz, Holger id: '43261' last_name: Steinmetz - first_name: R full_name: Isidor, R last_name: Isidor - first_name: Rüdiger full_name: Kabst, Rüdiger id: '42362' last_name: Kabst citation: ama: 'Schneid M, Steinmetz H, Isidor R, Kabst R. Diversität, Konflikte und Leistung in Teams: Ein meta-analytisches Strukturgleichungsmodell. In: ; 2012.' apa: 'Schneid, M., Steinmetz, H., Isidor, R., & Kabst, R. (2012). Diversität, Konflikte und Leistung in Teams: Ein meta-analytisches Strukturgleichungsmodell.' bibtex: '@inproceedings{Schneid_Steinmetz_Isidor_Kabst_2012, title={Diversität, Konflikte und Leistung in Teams: Ein meta-analytisches Strukturgleichungsmodell}, author={Schneid, M and Steinmetz, Holger and Isidor, R and Kabst, Rüdiger}, year={2012} }' chicago: 'Schneid, M, Holger Steinmetz, R Isidor, and Rüdiger Kabst. “Diversität, Konflikte Und Leistung in Teams: Ein Meta-Analytisches Strukturgleichungsmodell,” 2012.' ieee: 'M. Schneid, H. Steinmetz, R. Isidor, and R. Kabst, “Diversität, Konflikte und Leistung in Teams: Ein meta-analytisches Strukturgleichungsmodell,” 2012.' mla: 'Schneid, M., et al. Diversität, Konflikte Und Leistung in Teams: Ein Meta-Analytisches Strukturgleichungsmodell. 2012.' short: 'M. Schneid, H. Steinmetz, R. Isidor, R. Kabst, in: 2012.' date_created: 2018-12-18T12:42:54Z date_updated: 2022-01-06T07:02:59Z department: - _id: '274' language: - iso: eng status: public title: 'Diversität, Konflikte und Leistung in Teams: Ein meta-analytisches Strukturgleichungsmodell' type: conference user_id: '46632' year: '2012' ... --- _id: '6277' author: - first_name: Rüdiger full_name: Kabst, Rüdiger id: '42362' last_name: Kabst citation: ama: 'Kabst R. Endogeneity in the behavioral sciences: An illustration with real data. In: Amsterdam; 2012.' apa: 'Kabst, R. (2012). Endogeneity in the behavioral sciences: An illustration with real data. Amsterdam.' bibtex: '@inproceedings{Kabst_2012, place={Amsterdam}, title={Endogeneity in the behavioral sciences: An illustration with real data}, author={Kabst, Rüdiger}, year={2012} }' chicago: 'Kabst, Rüdiger. “Endogeneity in the Behavioral Sciences: An Illustration with Real Data.” Amsterdam, 2012.' ieee: 'R. Kabst, “Endogeneity in the behavioral sciences: An illustration with real data,” 2012.' mla: 'Kabst, Rüdiger. Endogeneity in the Behavioral Sciences: An Illustration with Real Data. 2012.' short: 'R. Kabst, in: Amsterdam, 2012.' date_created: 2018-12-18T12:43:58Z date_updated: 2022-01-06T07:02:59Z department: - _id: '274' language: - iso: eng place: Amsterdam status: public title: 'Endogeneity in the behavioral sciences: An illustration with real data' type: conference user_id: '46632' year: '2012' ... --- _id: '628' abstract: - lang: eng text: Network creation games model the creation and usage costs of networks formed by a set of selfish peers.Each peer has the ability to change the network in a limited way, e.g., by creating or deleting incident links.In doing so, a peer can reduce its individual communication cost.Typically, these costs are modeled by the maximum or average distance in the network.We introduce a generalized version of the basic network creation game (BNCG).In the BNCG (by Alon et al., SPAA 2010), each peer may replace one of its incident links by a link to an arbitrary peer.This is done in a selfish way in order to minimize either the maximum or average distance to all other peers.That is, each peer works towards a network structure that allows himself to communicate efficiently with all other peers.However, participants of large networks are seldom interested in all peers.Rather, they want to communicate efficiently with a small subset only.Our model incorporates these (communication) interests explicitly.Given peers with interests and a communication network forming a tree, we prove several results on the structure and quality of equilibria in our model.We focus on the MAX-version, i.e., each node tries to minimize the maximum distance to nodes it is interested in, and give an upper bound of O(\sqrt(n)) for the private costs in an equilibrium of n peers.Moreover, we give an equilibrium for a circular interest graph where a node has private cost Omega(\sqrt(n)), showing that our bound is tight.This example can be extended such that we get a tight bound of Theta(\sqrt(n)) for the price of anarchy.For the case of general networks we show the price of anarchy to be Theta(n).Additionally, we prove an interesting connection between a maximum independent set in the interest graph and the private costs of the peers. author: - first_name: Andreas full_name: Cord-Landwehr, Andreas last_name: Cord-Landwehr - first_name: Martina full_name: 'Huellmann (married name: Eikel), Martina' last_name: 'Huellmann (married name: Eikel)' - first_name: Peter full_name: Kling, Peter last_name: Kling - first_name: Alexander full_name: Setzer, Alexander id: '11108' last_name: Setzer citation: ama: 'Cord-Landwehr A, Huellmann (married name: Eikel) M, Kling P, Setzer A. Basic Network Creation Games with Communication Interests. In: Proceedings of the 5th International Symposium on Algorithmic Game Theory (SAGT). LNCS. ; 2012:72--83. doi:10.1007/978-3-642-33996-7_7' apa: 'Cord-Landwehr, A., Huellmann (married name: Eikel), M., Kling, P., & Setzer, A. (2012). Basic Network Creation Games with Communication Interests. In Proceedings of the 5th International Symposium on Algorithmic Game Theory (SAGT) (pp. 72--83). https://doi.org/10.1007/978-3-642-33996-7_7' bibtex: '@inproceedings{Cord-Landwehr_Huellmann (married name: Eikel)_Kling_Setzer_2012, series={LNCS}, title={Basic Network Creation Games with Communication Interests}, DOI={10.1007/978-3-642-33996-7_7}, booktitle={Proceedings of the 5th International Symposium on Algorithmic Game Theory (SAGT)}, author={Cord-Landwehr, Andreas and Huellmann (married name: Eikel), Martina and Kling, Peter and Setzer, Alexander}, year={2012}, pages={72--83}, collection={LNCS} }' chicago: 'Cord-Landwehr, Andreas, Martina Huellmann (married name: Eikel), Peter Kling, and Alexander Setzer. “Basic Network Creation Games with Communication Interests.” In Proceedings of the 5th International Symposium on Algorithmic Game Theory (SAGT), 72--83. LNCS, 2012. https://doi.org/10.1007/978-3-642-33996-7_7.' ieee: 'A. Cord-Landwehr, M. Huellmann (married name: Eikel), P. Kling, and A. Setzer, “Basic Network Creation Games with Communication Interests,” in Proceedings of the 5th International Symposium on Algorithmic Game Theory (SAGT), 2012, pp. 72--83.' mla: Cord-Landwehr, Andreas, et al. “Basic Network Creation Games with Communication Interests.” Proceedings of the 5th International Symposium on Algorithmic Game Theory (SAGT), 2012, pp. 72--83, doi:10.1007/978-3-642-33996-7_7. short: 'A. Cord-Landwehr, M. Huellmann (married name: Eikel), P. Kling, A. Setzer, in: Proceedings of the 5th International Symposium on Algorithmic Game Theory (SAGT), 2012, pp. 72--83.' date_created: 2017-10-17T12:42:54Z date_updated: 2022-01-06T07:02:59Z ddc: - '040' department: - _id: '79' - _id: '63' doi: 10.1007/978-3-642-33996-7_7 file: - access_level: closed content_type: application/pdf creator: florida date_created: 2018-03-15T06:42:01Z date_updated: 2018-03-15T06:42:01Z file_id: '1238' file_name: 628-FULL_paper_bncs_with_interests.pdf file_size: 300591 relation: main_file success: 1 file_date_updated: 2018-03-15T06:42:01Z has_accepted_license: '1' language: - iso: eng page: 72--83 project: - _id: '1' name: SFB 901 - _id: '5' name: SFB 901 - Subprojekt A1 - _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: Basic Network Creation Games with Communication Interests type: conference user_id: '477' year: '2012' ... --- _id: '6281' author: - first_name: M C full_name: Wehner, M C last_name: Wehner - first_name: A full_name: Giardini, A last_name: Giardini - first_name: Rüdiger full_name: Kabst, Rüdiger id: '42362' last_name: Kabst citation: ama: 'Wehner MC, Giardini A, Kabst R. Recruitment Process Outsourcing and Applicant Reactions: Does Image Make a Difference? In: University of Limerick, Ireland; 2012.' apa: 'Wehner, M. C., Giardini, A., & Kabst, R. (2012). Recruitment Process Outsourcing and Applicant Reactions: Does Image Make a Difference? University of Limerick, Ireland.' bibtex: '@inproceedings{Wehner_Giardini_Kabst_2012, place={University of Limerick, Ireland}, title={Recruitment Process Outsourcing and Applicant Reactions: Does Image Make a Difference?}, author={Wehner, M C and Giardini, A and Kabst, Rüdiger}, year={2012} }' chicago: 'Wehner, M C, A Giardini, and Rüdiger Kabst. “Recruitment Process Outsourcing and Applicant Reactions: Does Image Make a Difference?” University of Limerick, Ireland, 2012.' ieee: 'M. C. Wehner, A. Giardini, and R. Kabst, “Recruitment Process Outsourcing and Applicant Reactions: Does Image Make a Difference?,” 2012.' mla: 'Wehner, M. C., et al. Recruitment Process Outsourcing and Applicant Reactions: Does Image Make a Difference? 2012.' short: 'M.C. Wehner, A. Giardini, R. Kabst, in: University of Limerick, Ireland, 2012.' date_created: 2018-12-18T12:47:28Z date_updated: 2022-01-06T07:02:59Z department: - _id: '274' language: - iso: eng place: University of Limerick, Ireland status: public title: 'Recruitment Process Outsourcing and Applicant Reactions: Does Image Make a Difference?' type: conference user_id: '46632' year: '2012' ...