--- _id: '4107' article_type: original author: - first_name: Jörg full_name: Lindner, Jörg id: '20797' last_name: Lindner citation: ama: Lindner J. Nanosphere lithography for device fabrication. SPIE Newsroom. 2013. doi:10.1117/2.1201310.005154 apa: Lindner, J. (2013). Nanosphere lithography for device fabrication. SPIE Newsroom. https://doi.org/10.1117/2.1201310.005154 bibtex: '@article{Lindner_2013, title={Nanosphere lithography for device fabrication}, DOI={10.1117/2.1201310.005154}, journal={SPIE Newsroom}, publisher={SPIE-Intl Soc Optical Eng}, author={Lindner, Jörg}, year={2013} }' chicago: Lindner, Jörg. “Nanosphere Lithography for Device Fabrication.” SPIE Newsroom, 2013. https://doi.org/10.1117/2.1201310.005154. ieee: J. Lindner, “Nanosphere lithography for device fabrication,” SPIE Newsroom, 2013. mla: Lindner, Jörg. “Nanosphere Lithography for Device Fabrication.” SPIE Newsroom, SPIE-Intl Soc Optical Eng, 2013, doi:10.1117/2.1201310.005154. short: J. Lindner, SPIE Newsroom (2013). date_created: 2018-08-23T13:07:06Z date_updated: 2022-01-06T07:00:18Z ddc: - '530' department: - _id: '15' - _id: '286' doi: 10.1117/2.1201310.005154 file: - access_level: closed content_type: application/pdf creator: hclaudia date_created: 2018-08-23T13:09:31Z date_updated: 2018-08-23T13:09:31Z file_id: '4108' file_name: Nanosphere lithography for device fabrication.pdf file_size: 466277 relation: main_file success: 1 file_date_updated: 2018-08-23T13:09:31Z has_accepted_license: '1' publication: SPIE Newsroom publication_identifier: issn: - 1818-2259 publication_status: published publisher: SPIE-Intl Soc Optical Eng status: public title: Nanosphere lithography for device fabrication type: journal_article user_id: '55706' year: '2013' ... --- _id: '4109' author: - first_name: Johannes full_name: Pauly, Johannes last_name: Pauly - first_name: Jörg full_name: Lindner, Jörg id: '20797' last_name: Lindner citation: ama: 'Pauly J, Lindner J. Nickel Nanodot Arrays on Silicon formed by Nanosphere Lithography: A TEM Study. In: ; 2013.' apa: 'Pauly, J., & Lindner, J. (2013). Nickel Nanodot Arrays on Silicon formed by Nanosphere Lithography: A TEM Study. Presented at the Frühjahrstagung der Deutschen Physikalischen Gesellschaft, Regensburg (Germany).' bibtex: '@inproceedings{Pauly_Lindner_2013, title={Nickel Nanodot Arrays on Silicon formed by Nanosphere Lithography: A TEM Study}, author={Pauly, Johannes and Lindner, Jörg}, year={2013} }' chicago: 'Pauly, Johannes, and Jörg Lindner. “Nickel Nanodot Arrays on Silicon Formed by Nanosphere Lithography: A TEM Study,” 2013.' ieee: 'J. Pauly and J. Lindner, “Nickel Nanodot Arrays on Silicon formed by Nanosphere Lithography: A TEM Study,” presented at the Frühjahrstagung der Deutschen Physikalischen Gesellschaft, Regensburg (Germany), 2013.' mla: 'Pauly, Johannes, and Jörg Lindner. Nickel Nanodot Arrays on Silicon Formed by Nanosphere Lithography: A TEM Study. 2013.' short: 'J. Pauly, J. Lindner, in: 2013.' conference: end_date: 2013-03-15 location: Regensburg (Germany) name: Frühjahrstagung der Deutschen Physikalischen Gesellschaft start_date: 2013-03-10 date_created: 2018-08-23T13:11:21Z date_updated: 2022-01-06T07:00:18Z department: - _id: '15' - _id: '286' language: - iso: eng status: public title: 'Nickel Nanodot Arrays on Silicon formed by Nanosphere Lithography: A TEM Study' type: conference user_id: '55706' year: '2013' ... --- _id: '4110' author: - first_name: Thomas full_name: Riedl, Thomas id: '36950' last_name: Riedl - first_name: Jörg full_name: Lindner, Jörg id: '20797' last_name: Lindner citation: ama: 'Riedl T, Lindner J. Self-organized Fabrication of Periodic Nanocolumn Arrays on GaAs Surfaces. In: ; 2013.' apa: Riedl, T., & Lindner, J. (2013). Self-organized Fabrication of Periodic Nanocolumn Arrays on GaAs Surfaces. Presented at the MRS Fall Meeting 2013, Boston (USA). bibtex: '@inproceedings{Riedl_Lindner_2013, title={Self-organized Fabrication of Periodic Nanocolumn Arrays on GaAs Surfaces}, author={Riedl, Thomas and Lindner, Jörg}, year={2013} }' chicago: Riedl, Thomas, and Jörg Lindner. “Self-Organized Fabrication of Periodic Nanocolumn Arrays on GaAs Surfaces,” 2013. ieee: T. Riedl and J. Lindner, “Self-organized Fabrication of Periodic Nanocolumn Arrays on GaAs Surfaces,” presented at the MRS Fall Meeting 2013, Boston (USA), 2013. mla: Riedl, Thomas, and Jörg Lindner. Self-Organized Fabrication of Periodic Nanocolumn Arrays on GaAs Surfaces. 2013. short: 'T. Riedl, J. Lindner, in: 2013.' conference: end_date: 2013-12-06 location: Boston (USA) name: MRS Fall Meeting 2013 start_date: 2013-12-01 date_created: 2018-08-23T13:12:46Z date_updated: 2022-01-06T07:00:18Z department: - _id: '15' - _id: '286' language: - iso: eng status: public title: Self-organized Fabrication of Periodic Nanocolumn Arrays on GaAs Surfaces type: conference user_id: '55706' year: '2013' ... --- _id: '4111' abstract: - lang: eng text: "In this article we study the elemental distribution and solute solubility in nanocrystalline alloys of immiscible components near restricted equilibrium for the case of the binary Cu–Ag system. As predicted from thermodynamic considerations, a grain boundary segregated monophase alloy is observed in the annealed mechanically alloyed state for low Ag content by using atom probe tomography. From the detected Ag solute grain boundary enrichment the\r\nsegregation free enthalpy is estimated to range between -25 and -49 kJ mol^-1 following the McLean equation, in agreement with values reported for coarse-grained Cu–Ag. The extension of the alloying range is described by a two-domain thermodynamic model that considers the excess free volume in the grain boundaries and the strain in the strain interior on the basis of the universal equation of state at negative pressure. To access the grain boundary volumetric strain experimentally, a method based on a combination of density measurements and microscopical quantification of closed pore areas is presented. Moreover, we apply x-ray diffraction line broadening analysis to determine the local strain amplitude, which yields a root-mean-square microstrain of \x180.3% for a grain size of \x1830 nm. It is shown that the grain boundary free volume represents the major origin for the global solubility enhancement in\r\nnanocrystalline Cu–Ag at 503 K." article_number: 115401 (9 pp.) article_type: original author: - first_name: Thomas full_name: Riedl, Thomas id: '36950' last_name: Riedl - first_name: A full_name: Kirchner, A last_name: Kirchner - first_name: K full_name: Eymann, K last_name: Eymann - first_name: A full_name: Shariq, A last_name: Shariq - first_name: R full_name: Schlesiger, R last_name: Schlesiger - first_name: G full_name: Schmitz, G last_name: Schmitz - first_name: M full_name: Ruhnow, M last_name: Ruhnow - first_name: B full_name: Kieback, B last_name: Kieback citation: ama: 'Riedl T, Kirchner A, Eymann K, et al. Elemental distribution, solute solubility and defect free volume in nanocrystalline restricted-equilibrium Cu–Ag alloys. Journal of Physics: Condensed Matter. 2013;25(11). doi:10.1088/0953-8984/25/11/115401' apa: 'Riedl, T., Kirchner, A., Eymann, K., Shariq, A., Schlesiger, R., Schmitz, G., … Kieback, B. (2013). Elemental distribution, solute solubility and defect free volume in nanocrystalline restricted-equilibrium Cu–Ag alloys. Journal of Physics: Condensed Matter, 25(11). https://doi.org/10.1088/0953-8984/25/11/115401' bibtex: '@article{Riedl_Kirchner_Eymann_Shariq_Schlesiger_Schmitz_Ruhnow_Kieback_2013, title={Elemental distribution, solute solubility and defect free volume in nanocrystalline restricted-equilibrium Cu–Ag alloys}, volume={25}, DOI={10.1088/0953-8984/25/11/115401}, number={11115401 (9 pp.)}, journal={Journal of Physics: Condensed Matter}, publisher={IOP Publishing}, author={Riedl, Thomas and Kirchner, A and Eymann, K and Shariq, A and Schlesiger, R and Schmitz, G and Ruhnow, M and Kieback, B}, year={2013} }' chicago: 'Riedl, Thomas, A Kirchner, K Eymann, A Shariq, R Schlesiger, G Schmitz, M Ruhnow, and B Kieback. “Elemental Distribution, Solute Solubility and Defect Free Volume in Nanocrystalline Restricted-Equilibrium Cu–Ag Alloys.” Journal of Physics: Condensed Matter 25, no. 11 (2013). https://doi.org/10.1088/0953-8984/25/11/115401.' ieee: 'T. Riedl et al., “Elemental distribution, solute solubility and defect free volume in nanocrystalline restricted-equilibrium Cu–Ag alloys,” Journal of Physics: Condensed Matter, vol. 25, no. 11, 2013.' mla: 'Riedl, Thomas, et al. “Elemental Distribution, Solute Solubility and Defect Free Volume in Nanocrystalline Restricted-Equilibrium Cu–Ag Alloys.” Journal of Physics: Condensed Matter, vol. 25, no. 11, 115401 (9 pp.), IOP Publishing, 2013, doi:10.1088/0953-8984/25/11/115401.' short: 'T. Riedl, A. Kirchner, K. Eymann, A. Shariq, R. Schlesiger, G. Schmitz, M. Ruhnow, B. Kieback, Journal of Physics: Condensed Matter 25 (2013).' date_created: 2018-08-23T13:18:34Z date_updated: 2022-01-06T07:00:18Z ddc: - '530' department: - _id: '15' - _id: '286' doi: 10.1088/0953-8984/25/11/115401 file: - access_level: closed content_type: application/pdf creator: hclaudia date_created: 2018-08-23T13:21:21Z date_updated: 2018-08-23T13:21:21Z file_id: '4112' file_name: Elemental distribution, solute solubility and defect free volume in nanocrystalline restricted-equilibrium Cu-Ag alloys.pdf file_size: 1116530 relation: main_file success: 1 file_date_updated: 2018-08-23T13:21:21Z has_accepted_license: '1' intvolume: ' 25' issue: '11' language: - iso: eng publication: 'Journal of Physics: Condensed Matter' publication_identifier: issn: - 0953-8984 - 1361-648X publication_status: published publisher: IOP Publishing status: public title: Elemental distribution, solute solubility and defect free volume in nanocrystalline restricted-equilibrium Cu–Ag alloys type: journal_article user_id: '55706' volume: 25 year: '2013' ... --- _id: '4113' author: - first_name: Jörg full_name: Lindner, Jörg last_name: Lindner citation: ama: 'Lindner J. Ion Interactions with Nanopatterned Surfaces. In: ; 2013.' apa: Lindner, J. (2013). Ion Interactions with Nanopatterned Surfaces. Presented at the 18th International Conference on Surface Modification of Materials by Ion Beams, Kusadasi (Turkey). bibtex: '@inproceedings{Lindner_2013, title={Ion Interactions with Nanopatterned Surfaces}, author={Lindner, Jörg}, year={2013} }' chicago: Lindner, Jörg. “Ion Interactions with Nanopatterned Surfaces,” 2013. ieee: J. Lindner, “Ion Interactions with Nanopatterned Surfaces,” presented at the 18th International Conference on Surface Modification of Materials by Ion Beams, Kusadasi (Turkey), 2013. mla: Lindner, Jörg. Ion Interactions with Nanopatterned Surfaces. 2013. short: 'J. Lindner, in: 2013.' conference: end_date: 2013-09-20 location: Kusadasi (Turkey) name: 18th International Conference on Surface Modification of Materials by Ion Beams start_date: 2013-09-15 date_created: 2018-08-23T13:25:02Z date_updated: 2022-01-06T07:00:18Z department: - _id: '15' - _id: '286' language: - iso: eng status: public title: Ion Interactions with Nanopatterned Surfaces type: conference user_id: '55706' year: '2013' ... --- _id: '4353' article_type: original author: - first_name: Stefan full_name: Schumacher, Stefan id: '27271' last_name: Schumacher orcid: 0000-0003-4042-4951 - first_name: Artur full_name: Zrenner, Artur id: '606' last_name: Zrenner orcid: 0000-0002-5190-0944 citation: ama: Schumacher S, Zrenner A. Two-photon physics with quantum-dot biexcitons. ULTRAFAST PHENOMENA AND NANOPHOTONICS XVII. 2013. doi:10.1117/12.2004191 apa: Schumacher, S., & Zrenner, A. (2013). Two-photon physics with quantum-dot biexcitons. ULTRAFAST PHENOMENA AND NANOPHOTONICS XVII. https://doi.org/10.1117/12.2004191 bibtex: '@article{Schumacher_Zrenner_2013, title={Two-photon physics with quantum-dot biexcitons}, DOI={10.1117/12.2004191}, journal={ULTRAFAST PHENOMENA AND NANOPHOTONICS XVII}, author={Schumacher, Stefan and Zrenner, Artur}, year={2013} }' chicago: Schumacher, Stefan, and Artur Zrenner. “Two-Photon Physics with Quantum-Dot Biexcitons.” ULTRAFAST PHENOMENA AND NANOPHOTONICS XVII, 2013. https://doi.org/10.1117/12.2004191. ieee: S. Schumacher and A. Zrenner, “Two-photon physics with quantum-dot biexcitons,” ULTRAFAST PHENOMENA AND NANOPHOTONICS XVII, 2013. mla: Schumacher, Stefan, and Artur Zrenner. “Two-Photon Physics with Quantum-Dot Biexcitons.” ULTRAFAST PHENOMENA AND NANOPHOTONICS XVII, 2013, doi:10.1117/12.2004191. short: S. Schumacher, A. Zrenner, ULTRAFAST PHENOMENA AND NANOPHOTONICS XVII (2013). date_created: 2018-09-04T14:18:54Z date_updated: 2022-01-06T07:00:58Z department: - _id: '15' - _id: '230' - _id: '35' doi: 10.1117/12.2004191 language: - iso: eng publication: ULTRAFAST PHENOMENA AND NANOPHOTONICS XVII publication_identifier: issn: - 0277-786X status: public title: Two-photon physics with quantum-dot biexcitons type: journal_article user_id: '49428' year: '2013' ... --- _id: '500' author: - first_name: Margarita full_name: Staschewski, Margarita last_name: Staschewski citation: ama: Staschewski M. Price Formation in the Restaurant Industry - An Empirical Analysis. Universität Paderborn; 2013. apa: Staschewski, M. (2013). Price Formation in the Restaurant Industry - An Empirical Analysis. Universität Paderborn. bibtex: '@book{Staschewski_2013, title={Price Formation in the Restaurant Industry - An Empirical Analysis}, publisher={Universität Paderborn}, author={Staschewski, Margarita}, year={2013} }' chicago: Staschewski, Margarita. Price Formation in the Restaurant Industry - An Empirical Analysis. Universität Paderborn, 2013. ieee: M. Staschewski, Price Formation in the Restaurant Industry - An Empirical Analysis. Universität Paderborn, 2013. mla: Staschewski, Margarita. Price Formation in the Restaurant Industry - An Empirical Analysis. Universität Paderborn, 2013. short: M. Staschewski, Price Formation in the Restaurant Industry - An Empirical Analysis, Universität Paderborn, 2013. date_created: 2017-10-17T12:42:30Z date_updated: 2022-01-06T07:01:34Z 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: Price Formation in the Restaurant Industry - An Empirical Analysis type: bachelorsthesis user_id: '15504' year: '2013' ... --- _id: '501' abstract: - lang: eng text: 'Handling run-time dynamics on embedded system-on-chip architectures has become more challenging over the years. On the one hand, the impact of workload and physical dynamics on the system behavior has dramatically increased. On the other hand, embedded architectures have become more complex as they have evolved from single-processor systems over multi-processor systems to hybrid multi-core platforms.Static design-time techniques no longer provide suitable solutions to deal with the run-time dynamics of today''s embedded systems. Therefore, system designers have to apply run-time solutions, which have hardly been investigated for hybrid multi-core platforms.In this thesis, we present fundamental work in the new area of run-time management on hybrid multi-core platforms. We propose a novel architecture, a self-adaptive hybrid multi-core system, that combines heterogeneous processors, reconfigurable hardware cores, and monitoring cores on a single chip. Using self-adaptation on thread-level, our hybrid multi-core systems can effectively perform performance and thermal management autonomously at run-time. ' author: - first_name: Markus full_name: Happe, Markus last_name: Happe citation: ama: 'Happe M. Performance and Thermal Management on Self-Adaptive Hybrid Multi-Cores. Berlin: Logos Verlag Berlin GmbH; 2013.' apa: 'Happe, M. (2013). Performance and thermal management on self-adaptive hybrid multi-cores. Berlin: Logos Verlag Berlin GmbH.' bibtex: '@book{Happe_2013, place={Berlin}, title={Performance and thermal management on self-adaptive hybrid multi-cores}, publisher={Logos Verlag Berlin GmbH}, author={Happe, Markus}, year={2013} }' chicago: 'Happe, Markus. Performance and Thermal Management on Self-Adaptive Hybrid Multi-Cores. Berlin: Logos Verlag Berlin GmbH, 2013.' ieee: 'M. Happe, Performance and thermal management on self-adaptive hybrid multi-cores. Berlin: Logos Verlag Berlin GmbH, 2013.' mla: Happe, Markus. Performance and Thermal Management on Self-Adaptive Hybrid Multi-Cores. Logos Verlag Berlin GmbH, 2013. short: M. Happe, Performance and Thermal Management on Self-Adaptive Hybrid Multi-Cores, Logos Verlag Berlin GmbH, Berlin, 2013. date_created: 2017-10-17T12:42:30Z date_updated: 2022-01-06T07:01:34Z department: - _id: '78' language: - iso: eng page: '220' place: Berlin project: - _id: '14' name: SFB 901 - Subprojekt C2 - _id: '1' name: SFB 901 - _id: '4' name: SFB 901 - Project Area C publication_identifier: isbn: - 978-3-8325-3425-7 publication_status: published publisher: Logos Verlag Berlin GmbH related_material: link: - relation: confirmation url: https://www.logos-verlag.de/cgi-bin/engbuchmid?isbn=3425&lng=deu&id= status: public supervisor: - first_name: Marco full_name: Platzner, Marco id: '398' last_name: Platzner title: Performance and thermal management on self-adaptive hybrid multi-cores type: dissertation user_id: '477' year: '2013' ... --- _id: '502' abstract: - lang: eng text: Self-adaptation allows continuously running software systems to operate in changing and uncertain contexts while meeting their requirements in a broad range of contexts, e.g., from low to high load situations. As a consequence, requirementsfor self-adaptive systems are more complex than requirements for static systems as they have to explicitly address properties of the self-adaptation layer.While approaches exist in the literature to capture this new type of requirements formally, their achievement cannot be analyzed in early design phases yet. In this paper, we apply RELAX to formally specify non-functional requirements for self-adaptive systems. We then apply our model-based SimuLizar approach for a semi-automatic analysis to test whether the self-adaptation layer ensures that these non-functional requirements are met. We evaluate our approach on the design of a proof-of-concept load balancer system. As this evaluation demonstrates, we can iteratively improve our system design by improving unsatisfactory self-adaption rules. 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. Performance Analysis of Self-Adaptive Systems for Requirements Validation at Design-Time. In: Proceedings of the 9th ACM SigSoft International Conference on Quality of Software Architectures (QoSA’13). ; 2013:43-52. doi:10.1145/2465478.2465489' apa: Becker, M., Luckey, M., & Becker, S. (2013). Performance Analysis of Self-Adaptive Systems for Requirements Validation at Design-Time. In Proceedings of the 9th ACM SigSoft International Conference on Quality of Software Architectures (QoSA’13) (pp. 43–52). https://doi.org/10.1145/2465478.2465489 bibtex: '@inproceedings{Becker_Luckey_Becker_2013, title={Performance Analysis of Self-Adaptive Systems for Requirements Validation at Design-Time}, DOI={10.1145/2465478.2465489}, booktitle={Proceedings of the 9th ACM SigSoft International Conference on Quality of Software Architectures (QoSA’13)}, author={Becker, Matthias and Luckey, Markus and Becker, Steffen}, year={2013}, pages={43–52} }' chicago: Becker, Matthias, Markus Luckey, and Steffen Becker. “Performance Analysis of Self-Adaptive Systems for Requirements Validation at Design-Time.” In Proceedings of the 9th ACM SigSoft International Conference on Quality of Software Architectures (QoSA’13), 43–52, 2013. https://doi.org/10.1145/2465478.2465489. ieee: M. Becker, M. Luckey, and S. Becker, “Performance Analysis of Self-Adaptive Systems for Requirements Validation at Design-Time,” in Proceedings of the 9th ACM SigSoft International Conference on Quality of Software Architectures (QoSA’13), 2013, pp. 43–52. mla: Becker, Matthias, et al. “Performance Analysis of Self-Adaptive Systems for Requirements Validation at Design-Time.” Proceedings of the 9th ACM SigSoft International Conference on Quality of Software Architectures (QoSA’13), 2013, pp. 43–52, doi:10.1145/2465478.2465489. short: 'M. Becker, M. Luckey, S. Becker, in: Proceedings of the 9th ACM SigSoft International Conference on Quality of Software Architectures (QoSA’13), 2013, pp. 43–52.' date_created: 2017-10-17T12:42:30Z date_updated: 2022-01-06T07:01:35Z ddc: - '040' doi: 10.1145/2465478.2465489 file: - access_level: closed content_type: application/pdf creator: florida date_created: 2018-03-15T13:39:29Z date_updated: 2018-03-15T13:39:29Z file_id: '1309' file_name: 502-qosa33f.pdf file_size: 320384 relation: main_file success: 1 file_date_updated: 2018-03-15T13:39:29Z has_accepted_license: '1' page: '43-52 ' 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 9th ACM SigSoft International Conference on Quality of Software Architectures (QoSA'13) status: public title: Performance Analysis of Self-Adaptive Systems for Requirements Validation at Design-Time type: conference user_id: '15504' year: '2013' ... --- _id: '503' author: - first_name: Andreas full_name: Blix, Andreas last_name: Blix citation: ama: Blix A. Optimale und adaptive binäre Bäume in Netzwerken. Universität Paderborn; 2013. apa: Blix, A. (2013). Optimale und adaptive binäre Bäume in Netzwerken. Universität Paderborn. bibtex: '@book{Blix_2013, title={Optimale und adaptive binäre Bäume in Netzwerken}, publisher={Universität Paderborn}, author={Blix, Andreas}, year={2013} }' chicago: Blix, Andreas. Optimale und adaptive binäre Bäume in Netzwerken. Universität Paderborn, 2013. ieee: A. Blix, Optimale und adaptive binäre Bäume in Netzwerken. Universität Paderborn, 2013. mla: Blix, Andreas. Optimale und adaptive binäre Bäume in Netzwerken. Universität Paderborn, 2013. short: A. Blix, Optimale und adaptive binäre Bäume in Netzwerken, Universität Paderborn, 2013. date_created: 2017-10-17T12:42:30Z date_updated: 2022-01-06T07:01:35Z 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: Optimale und adaptive binäre Bäume in Netzwerken type: bachelorsthesis user_id: '477' year: '2013' ... --- _id: '5031' author: - first_name: Jörg full_name: Becker, Jörg last_name: Becker - first_name: Torben full_name: Bernhold, Torben last_name: Bernhold - first_name: Daniel full_name: Beverungen, Daniel id: '59677' last_name: Beverungen - first_name: Nina full_name: Kaling, Nina last_name: Kaling - first_name: Ralf full_name: Knackstedt, Ralf last_name: Knackstedt - first_name: Lellek full_name: Vanessa, Lellek last_name: Vanessa - first_name: Hans full_name: Peter Rauer, Hans last_name: Peter Rauer citation: ama: 'Becker J, Bernhold T, Beverungen D, et al. Softwaregestützte Konstruktion von Produktivitätsmodellen im Facility Management. In: Thomas O, Nüttgens M, eds. Dienstleistungsmodellierung 2012: Product-Service Systems Und Produktivität. Wiesbaden; 2013:208--226. doi:10.1007/978-3-658-00863-5' apa: 'Becker, J., Bernhold, T., Beverungen, D., Kaling, N., Knackstedt, R., Vanessa, L., & Peter Rauer, H. (2013). Softwaregestützte Konstruktion von Produktivitätsmodellen im Facility Management. In O. Thomas & M. Nüttgens (Eds.), Dienstleistungsmodellierung 2012: Product-Service Systems und Produktivität (pp. 208--226). Wiesbaden. https://doi.org/10.1007/978-3-658-00863-5' bibtex: '@inbook{Becker_Bernhold_Beverungen_Kaling_Knackstedt_Vanessa_Peter Rauer_2013, place={Wiesbaden}, title={Softwaregestützte Konstruktion von Produktivitätsmodellen im Facility Management}, DOI={10.1007/978-3-658-00863-5}, booktitle={Dienstleistungsmodellierung 2012: Product-Service Systems und Produktivität}, author={Becker, Jörg and Bernhold, Torben and Beverungen, Daniel and Kaling, Nina and Knackstedt, Ralf and Vanessa, Lellek and Peter Rauer, Hans}, editor={Thomas, Oliver and Nüttgens, MarkusEditors}, year={2013}, pages={208--226} }' chicago: 'Becker, Jörg, Torben Bernhold, Daniel Beverungen, Nina Kaling, Ralf Knackstedt, Lellek Vanessa, and Hans Peter Rauer. “Softwaregestützte Konstruktion von Produktivitätsmodellen Im Facility Management.” In Dienstleistungsmodellierung 2012: Product-Service Systems Und Produktivität, edited by Oliver Thomas and Markus Nüttgens, 208--226. Wiesbaden, 2013. https://doi.org/10.1007/978-3-658-00863-5.' ieee: 'J. Becker et al., “Softwaregestützte Konstruktion von Produktivitätsmodellen im Facility Management,” in Dienstleistungsmodellierung 2012: Product-Service Systems und Produktivität, O. Thomas and M. Nüttgens, Eds. Wiesbaden, 2013, pp. 208--226.' mla: 'Becker, Jörg, et al. “Softwaregestützte Konstruktion von Produktivitätsmodellen Im Facility Management.” Dienstleistungsmodellierung 2012: Product-Service Systems Und Produktivität, edited by Oliver Thomas and Markus Nüttgens, 2013, pp. 208--226, doi:10.1007/978-3-658-00863-5.' short: 'J. Becker, T. Bernhold, D. Beverungen, N. Kaling, R. Knackstedt, L. Vanessa, H. Peter Rauer, in: O. Thomas, M. Nüttgens (Eds.), Dienstleistungsmodellierung 2012: Product-Service Systems Und Produktivität, Wiesbaden, 2013, pp. 208--226.' date_created: 2018-10-30T13:32:55Z date_updated: 2022-01-06T07:01:35Z department: - _id: '526' doi: 10.1007/978-3-658-00863-5 editor: - first_name: Oliver full_name: Thomas, Oliver last_name: Thomas - first_name: Markus full_name: Nüttgens, Markus last_name: Nüttgens extern: '1' page: 208--226 place: Wiesbaden publication: 'Dienstleistungsmodellierung 2012: Product-Service Systems und Produktivität' status: public title: Softwaregestützte Konstruktion von Produktivitätsmodellen im Facility Management type: book_chapter user_id: '21671' year: '2013' ... --- _id: '504' author: - first_name: Simon full_name: Schwichtenberg, Simon id: '13235' last_name: Schwichtenberg citation: ama: Schwichtenberg S. Ontology-Based Normalization and Matching of Rich Service Descriptions. Universität Paderborn; 2013. apa: Schwichtenberg, S. (2013). Ontology-based Normalization and Matching of Rich Service Descriptions. Universität Paderborn. bibtex: '@book{Schwichtenberg_2013, title={Ontology-based Normalization and Matching of Rich Service Descriptions}, publisher={Universität Paderborn}, author={Schwichtenberg, Simon}, year={2013} }' chicago: Schwichtenberg, Simon. Ontology-Based Normalization and Matching of Rich Service Descriptions. Universität Paderborn, 2013. ieee: S. Schwichtenberg, Ontology-based Normalization and Matching of Rich Service Descriptions. Universität Paderborn, 2013. mla: Schwichtenberg, Simon. Ontology-Based Normalization and Matching of Rich Service Descriptions. Universität Paderborn, 2013. short: S. Schwichtenberg, Ontology-Based Normalization and Matching of Rich Service Descriptions, Universität Paderborn, 2013. date_created: 2017-10-17T12:42:30Z date_updated: 2022-01-06T07:01:35Z project: - _id: '1' name: SFB 901 - _id: '9' name: SFB 901 - Subprojekt B1 - _id: '3' name: SFB 901 - Project Area B publisher: Universität Paderborn status: public title: Ontology-based Normalization and Matching of Rich Service Descriptions type: mastersthesis user_id: '15504' year: '2013' ... --- _id: '5042' alternative_title: - 6., vollständig überarbeitete Auflage author: - first_name: Rolf full_name: König, Rolf last_name: König - first_name: Caren full_name: Sureth-Sloane, Caren last_name: Sureth-Sloane citation: ama: 'König R, Sureth-Sloane C. Besteuerung und Rechtsformwahl. Herne: Verlag Neue Wirtschafts-Briefe; 2013.' apa: 'König, R., & Sureth-Sloane, C. (2013). Besteuerung und Rechtsformwahl. Herne: Verlag Neue Wirtschafts-Briefe.' bibtex: '@book{König_Sureth-Sloane_2013, place={Herne}, title={Besteuerung und Rechtsformwahl}, publisher={Verlag Neue Wirtschafts-Briefe}, author={König, Rolf and Sureth-Sloane, Caren}, year={2013} }' chicago: 'König, Rolf, and Caren Sureth-Sloane. Besteuerung und Rechtsformwahl. Herne: Verlag Neue Wirtschafts-Briefe, 2013.' ieee: 'R. König and C. Sureth-Sloane, Besteuerung und Rechtsformwahl. Herne: Verlag Neue Wirtschafts-Briefe, 2013.' mla: König, Rolf, and Caren Sureth-Sloane. Besteuerung und Rechtsformwahl. Verlag Neue Wirtschafts-Briefe, 2013. short: R. König, C. Sureth-Sloane, Besteuerung und Rechtsformwahl, Verlag Neue Wirtschafts-Briefe, Herne, 2013. date_created: 2018-10-30T13:48:38Z date_updated: 2022-01-06T07:01:35Z department: - _id: '187' - _id: '635' language: - iso: ger place: Herne publisher: Verlag Neue Wirtschafts-Briefe status: public title: Besteuerung und Rechtsformwahl type: book user_id: '61801' year: '2013' ... --- _id: '5043' author: - first_name: Ralf full_name: Maiterth, Ralf last_name: Maiterth - first_name: Caren full_name: Sureth-Sloane, Caren id: '530' last_name: Sureth-Sloane citation: ama: Maiterth R, Sureth-Sloane C. Vermögensteuer vernichtet Eigenkapital. Frankfurter Allgemeine Zeitung. 2013. apa: Maiterth, R., & Sureth-Sloane, C. (2013). Vermögensteuer vernichtet Eigenkapital. Frankfurter Allgemeine Zeitung. bibtex: '@article{Maiterth_Sureth-Sloane_2013, title={Vermögensteuer vernichtet Eigenkapital}, number={125}, journal={Frankfurter Allgemeine Zeitung}, author={Maiterth, Ralf and Sureth-Sloane, Caren}, year={2013} }' chicago: Maiterth, Ralf, and Caren Sureth-Sloane. “Vermögensteuer Vernichtet Eigenkapital.” Frankfurter Allgemeine Zeitung, 2013. ieee: R. Maiterth and C. Sureth-Sloane, “Vermögensteuer vernichtet Eigenkapital,” Frankfurter Allgemeine Zeitung, no. 125, 2013. mla: Maiterth, Ralf, and Caren Sureth-Sloane. “Vermögensteuer Vernichtet Eigenkapital.” Frankfurter Allgemeine Zeitung, no. 125, 2013. short: R. Maiterth, C. Sureth-Sloane, Frankfurter Allgemeine Zeitung (2013). date_created: 2018-10-30T13:50:41Z date_updated: 2022-01-06T07:01:35Z department: - _id: '187' issue: '125' language: - iso: eng page: '18' publication: Frankfurter Allgemeine Zeitung publication_date: 2013-09-16 status: public title: Vermögensteuer vernichtet Eigenkapital type: newspaper_article user_id: '21222' year: '2013' ... --- _id: '5044' author: - first_name: Fabian full_name: Meißner, Fabian last_name: Meißner - first_name: Caren full_name: Sureth-Sloane, Caren id: '530' last_name: Sureth-Sloane citation: ama: Meißner F, Sureth-Sloane C. The Impact of Corporate Taxes and Flexibility on Entrepreneurial Decisions with Moral Hazard and Simultaneous Firm and Personal Level Taxation. Vol 141.; 2013. apa: Meißner, F., & Sureth-Sloane, C. (2013). The Impact of Corporate Taxes and Flexibility on Entrepreneurial Decisions with Moral Hazard and Simultaneous Firm and Personal Level Taxation (Vol. 141). bibtex: '@book{Meißner_Sureth-Sloane_2013, series={arqus, Quantitative Research in Taxation}, title={The Impact of Corporate Taxes and Flexibility on Entrepreneurial Decisions with Moral Hazard and Simultaneous Firm and Personal Level Taxation}, volume={141}, author={Meißner, Fabian and Sureth-Sloane, Caren}, year={2013}, collection={arqus, Quantitative Research in Taxation} }' chicago: Meißner, Fabian, and Caren Sureth-Sloane. The Impact of Corporate Taxes and Flexibility on Entrepreneurial Decisions with Moral Hazard and Simultaneous Firm and Personal Level Taxation. Vol. 141. Arqus, Quantitative Research in Taxation, 2013. ieee: F. Meißner and C. Sureth-Sloane, The Impact of Corporate Taxes and Flexibility on Entrepreneurial Decisions with Moral Hazard and Simultaneous Firm and Personal Level Taxation, vol. 141. 2013. mla: Meißner, Fabian, and Caren Sureth-Sloane. The Impact of Corporate Taxes and Flexibility on Entrepreneurial Decisions with Moral Hazard and Simultaneous Firm and Personal Level Taxation. Vol. 141, 2013. short: F. Meißner, C. Sureth-Sloane, The Impact of Corporate Taxes and Flexibility on Entrepreneurial Decisions with Moral Hazard and Simultaneous Firm and Personal Level Taxation, 2013. date_created: 2018-10-30T13:52:52Z date_updated: 2022-01-06T07:01:35Z department: - _id: '187' intvolume: ' 141' language: - iso: eng series_title: arqus, Quantitative Research in Taxation status: public title: The Impact of Corporate Taxes and Flexibility on Entrepreneurial Decisions with Moral Hazard and Simultaneous Firm and Personal Level Taxation type: working_paper user_id: '21222' volume: 141 year: '2013' ... --- _id: '5046' author: - first_name: Caren full_name: Sureth-Sloane, Caren id: '530' last_name: Sureth-Sloane citation: ama: Sureth-Sloane C. Die Reichensteuer gefährdet Arbeitsplätze. Cicero Online. 2013. apa: Sureth-Sloane, C. (2013). Die Reichensteuer gefährdet Arbeitsplätze. Cicero Online. bibtex: '@article{Sureth-Sloane_2013, title={ Die Reichensteuer gefährdet Arbeitsplätze}, journal={Cicero Online}, author={Sureth-Sloane, Caren}, year={2013} }' chicago: Sureth-Sloane, Caren. “ Die Reichensteuer gefährdet Arbeitsplätze.” Cicero Online, 2013. ieee: C. Sureth-Sloane, “ Die Reichensteuer gefährdet Arbeitsplätze,” Cicero Online, 2013. mla: Sureth-Sloane, Caren. “ Die Reichensteuer gefährdet Arbeitsplätze.” Cicero Online, 2013. short: C. Sureth-Sloane, Cicero Online (2013). date_created: 2018-10-30T13:55:19Z date_updated: 2022-01-06T07:01:35Z department: - _id: '187' language: - iso: ger publication: Cicero Online publication_date: 2013-04-02 status: public title: ' Die Reichensteuer gefährdet Arbeitsplätze' type: newspaper_article user_id: '21222' year: '2013' ... --- _id: '506' abstract: - lang: eng text: Alle Dom{\"a}nen und Branchen der heutigen Wirtschaft sind auf eine effiziente und effektive Entwicklung von ben{\"o}tigten Softwaresystemen angewiesen. Das 40 Jahre alte Prinzip der Beschaffung von Softwaresystemen durch den Einkauf von teuren, relativ unflexiblen Standardl{\"o}sungen beziehungsweise der noch teureren Erstellung durch Softwareh{\"a}user oder eigene Softwareabteilungen muss deshalb in Frage gestellt werden. Mit dem Einsatz von Cloud Computing-Techniken wird es m{\"o}glich, Softwaresysteme und die f{\"u}r den Betrieb ben{\"o}tigten Ressourcen nur bei Bedarf und nur in der ben{\"o}tigten Form einzukaufen. Mit dem Ansatz der service-orientierten Architekturen stehen Methoden zur Verf{\"u}gung, Software zumindest unternehmensintern flexibel zusammenzustellen. Diese ersten Ans{\"a}tze f{\"u}r eine neue Art der Entwicklung und des Betriebs von Softwaresystemen bilden den Ausgangspunkt f{\"u}r die Forschungen in dem seit 2011 laufenden DFG Sonderforschungsbereich (SFB) 901 „On-The-Fly Computing“ an der Universit{\"a}t Paderborn. Die Vision des On-The-Fly Computing ist, dass die Softwaresysteme der Zukunft aus individuell und automatisch konfigurierten und zur Ausf{\"u}hrung gebrachten Softwarebausteinen bestehen, die auf M{\"a}rkten frei gehandelt werden und flexibel kombinierbar sind. Um zu erforschen, in wie weit diese Vision realisierbar ist, werden Konzepte, Methoden und Techniken entwickelt, die eine weitestgehend automatische Konfiguration, Ausf{\"u}hrung und Adaption von Softwaresystemen aus auf weltweiten M{\"a}rkten verf{\"u}gbaren Services erm{\"o}glichen. Um diese Ziele zu erreichen, arbeiten an der Universit{\"a}t Paderborn Informatiker aus unterschiedlichen Disziplinen wie Softwaretechnik, Algorithmik, Rechnernetze, Systementwurf, Sicherheit und Kryptographie mit Wirtschaftswissenschaftlern zusammen, die ihre spezifische Expertise einbringen, mit der die Organisation und Weiterentwicklung des Marktes vorangetrieben werden kann. author: - first_name: Gregor full_name: Engels, Gregor id: '107' last_name: Engels citation: ama: 'Engels G. On-The-Fly Computing -- Das Entwicklungs- und Betriebsparadigma fürSoftwaresysteme der Zukunft. In: Proceedings of the Multikonferenz Sofware Engineering 2013 (SE 2013). LNI. ; 2013:17-18.' apa: Engels, G. (2013). On-The-Fly Computing -- Das Entwicklungs- und Betriebsparadigma fürSoftwaresysteme der Zukunft. In Proceedings of the Multikonferenz Sofware Engineering 2013 (SE 2013) (pp. 17–18). bibtex: '@inproceedings{Engels_2013, series={LNI}, title={On-The-Fly Computing -- Das Entwicklungs- und Betriebsparadigma fürSoftwaresysteme der Zukunft}, booktitle={Proceedings of the Multikonferenz Sofware Engineering 2013 (SE 2013)}, author={Engels, Gregor}, year={2013}, pages={17–18}, collection={LNI} }' chicago: Engels, Gregor. “On-The-Fly Computing -- Das Entwicklungs- Und Betriebsparadigma FürSoftwaresysteme Der Zukunft.” In Proceedings of the Multikonferenz Sofware Engineering 2013 (SE 2013), 17–18. LNI, 2013. ieee: G. Engels, “On-The-Fly Computing -- Das Entwicklungs- und Betriebsparadigma fürSoftwaresysteme der Zukunft,” in Proceedings of the Multikonferenz Sofware Engineering 2013 (SE 2013), 2013, pp. 17–18. mla: Engels, Gregor. “On-The-Fly Computing -- Das Entwicklungs- Und Betriebsparadigma FürSoftwaresysteme Der Zukunft.” Proceedings of the Multikonferenz Sofware Engineering 2013 (SE 2013), 2013, pp. 17–18. short: 'G. Engels, in: Proceedings of the Multikonferenz Sofware Engineering 2013 (SE 2013), 2013, pp. 17–18.' date_created: 2017-10-17T12:42:31Z date_updated: 2022-01-06T07:01:36Z ddc: - '040' department: - _id: '66' file: - access_level: closed content_type: application/pdf creator: florida date_created: 2018-03-15T10:48:11Z date_updated: 2018-03-15T10:48:11Z file_id: '1306' file_name: 506-SE2013-OntheFlyComputing-GE.pdf file_size: 175876 relation: main_file success: 1 file_date_updated: 2018-03-15T10:48:11Z has_accepted_license: '1' language: - iso: eng page: 17-18 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 Multikonferenz Sofware Engineering 2013 (SE 2013) series_title: LNI status: public title: On-The-Fly Computing -- Das Entwicklungs- und Betriebsparadigma fürSoftwaresysteme der Zukunft type: conference user_id: '477' year: '2013' ... --- _id: '507' abstract: - lang: eng text: We study two-party communication in the context of directed dynamic networks that are controlled by an adaptive adversary. This adversary is able to change all edges as long as the networks stay strongly-connected in each round. In this work, we establish a relation between counting the total number of nodes in the network and the problem of exchanging tokens between two communication partners which communicate through a dynamic network. We show that the communication problem for a constant fraction of n tokens in a dynamic network with n nodes is at most as hard as counting the number of nodes in a dynamic network with at most 4n+3 nodes. For the proof, we construct a family of directed dynamic networks and apply a lower bound from two-party communication complexity. author: - first_name: Sebastian full_name: Abshoff, Sebastian last_name: Abshoff - first_name: Markus full_name: Benter, Markus last_name: Benter - first_name: Manuel full_name: Malatyali, Manuel last_name: Malatyali - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm id: '15523' last_name: Meyer auf der Heide citation: ama: 'Abshoff S, Benter M, Malatyali M, Meyer auf der Heide F. On Two-Party Communication Through Dynamic Networks. In: Proceedings of the 17th International Conference on Principles of Distributed Systems (OPODIS). LNCS. ; 2013:11-22. doi:10.1007/978-3-319-03850-6_2' apa: Abshoff, S., Benter, M., Malatyali, M., & Meyer auf der Heide, F. (2013). On Two-Party Communication Through Dynamic Networks. In Proceedings of the 17th International Conference on Principles of Distributed Systems (OPODIS) (pp. 11–22). https://doi.org/10.1007/978-3-319-03850-6_2 bibtex: '@inproceedings{Abshoff_Benter_Malatyali_Meyer auf der Heide_2013, series={LNCS}, title={On Two-Party Communication Through Dynamic Networks}, DOI={10.1007/978-3-319-03850-6_2}, booktitle={Proceedings of the 17th International Conference on Principles of Distributed Systems (OPODIS)}, author={Abshoff, Sebastian and Benter, Markus and Malatyali, Manuel and Meyer auf der Heide, Friedhelm}, year={2013}, pages={11–22}, collection={LNCS} }' chicago: Abshoff, Sebastian, Markus Benter, Manuel Malatyali, and Friedhelm Meyer auf der Heide. “On Two-Party Communication Through Dynamic Networks.” In Proceedings of the 17th International Conference on Principles of Distributed Systems (OPODIS), 11–22. LNCS, 2013. https://doi.org/10.1007/978-3-319-03850-6_2. ieee: S. Abshoff, M. Benter, M. Malatyali, and F. Meyer auf der Heide, “On Two-Party Communication Through Dynamic Networks,” in Proceedings of the 17th International Conference on Principles of Distributed Systems (OPODIS), 2013, pp. 11–22. mla: Abshoff, Sebastian, et al. “On Two-Party Communication Through Dynamic Networks.” Proceedings of the 17th International Conference on Principles of Distributed Systems (OPODIS), 2013, pp. 11–22, doi:10.1007/978-3-319-03850-6_2. short: 'S. Abshoff, M. Benter, M. Malatyali, F. Meyer auf der Heide, in: Proceedings of the 17th International Conference on Principles of Distributed Systems (OPODIS), 2013, pp. 11–22.' date_created: 2017-10-17T12:42:31Z date_updated: 2022-01-06T07:01:36Z ddc: - '040' department: - _id: '63' doi: 10.1007/978-3-319-03850-6_2 file: - access_level: closed content_type: application/pdf creator: florida date_created: 2018-03-15T10:47:31Z date_updated: 2018-03-15T10:47:31Z file_id: '1305' file_name: 507-on-two-party-communication-through-dynamic-networks_01.pdf file_size: 181398 relation: main_file success: 1 file_date_updated: 2018-03-15T10:47:31Z has_accepted_license: '1' page: 11-22 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 17th International Conference on Principles of Distributed Systems (OPODIS) series_title: LNCS status: public title: On Two-Party Communication Through Dynamic Networks type: conference user_id: '15504' year: '2013' ... --- _id: '508' abstract: - lang: eng text: The process of planning a virtual topology for a Wavelength Devision Multiplexing (WDM) network is called Virtual Topology Design (VTD). The goal of VTD is to find a virtual topology that supports forwarding the expected traffic without congestion. In networks with fluctuating, high traffic demands, it can happen that no single topology fits all changing traffic demands occurring over a longer time. Thus, during operation, the virtual topology has to be reconfigured. Since modern networks tend to be large, VTD algorithms have to scale well with increasing network size, requiring distributed algorithms. Existing distributed VTD algorithms, however, react too slowly on congestion for the real-time reconfiguration of large networks. We propose Selfish Virtual Topology Reconfiguration (SVTR) as a new algorithm for distributed VTD. It combines reconfiguring the virtual topology and routing through a Software Defined Network (SDN). SVTR is used for online, on-the-fly network reconfiguration. Its integrated routing and WDM reconfiguration keeps connection disruption due to network reconfiguration to a minimum and is able to react very quickly to traffic pattern changes. SVTR works by iteratively adapting the virtual topology to the observed traffic patterns without global traffic information and without future traffic estimations. We evaluated SVTR by simulation and found that it significantly lowers congestion in realistic networks and high load scenarios. 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. On the Quality of Selfish Virtual Topology Reconfiguration in IP-over-WDM Networks. In: Proceedings of the 19th IEEE International Workshop on Local and Metropolitan Area Networks (IEEE LANMAN). ; 2013:1-6. doi:10.1109/LANMAN.2013.6528271' apa: Wette, P., & Karl, H. (2013). On the Quality of Selfish Virtual Topology Reconfiguration in IP-over-WDM Networks. In Proceedings of the 19th IEEE International Workshop on Local and Metropolitan Area Networks (IEEE LANMAN) (pp. 1–6). https://doi.org/10.1109/LANMAN.2013.6528271 bibtex: '@inproceedings{Wette_Karl_2013, title={On the Quality of Selfish Virtual Topology Reconfiguration in IP-over-WDM Networks}, DOI={10.1109/LANMAN.2013.6528271}, booktitle={Proceedings of the 19th IEEE International Workshop on Local and Metropolitan Area Networks (IEEE LANMAN)}, author={Wette, Philip and Karl, Holger}, year={2013}, pages={1–6} }' chicago: Wette, Philip, and Holger Karl. “On the Quality of Selfish Virtual Topology Reconfiguration in IP-over-WDM Networks.” In Proceedings of the 19th IEEE International Workshop on Local and Metropolitan Area Networks (IEEE LANMAN), 1–6, 2013. https://doi.org/10.1109/LANMAN.2013.6528271. ieee: P. Wette and H. Karl, “On the Quality of Selfish Virtual Topology Reconfiguration in IP-over-WDM Networks,” in Proceedings of the 19th IEEE International Workshop on Local and Metropolitan Area Networks (IEEE LANMAN), 2013, pp. 1–6. mla: Wette, Philip, and Holger Karl. “On the Quality of Selfish Virtual Topology Reconfiguration in IP-over-WDM Networks.” Proceedings of the 19th IEEE International Workshop on Local and Metropolitan Area Networks (IEEE LANMAN), 2013, pp. 1–6, doi:10.1109/LANMAN.2013.6528271. short: 'P. Wette, H. Karl, in: Proceedings of the 19th IEEE International Workshop on Local and Metropolitan Area Networks (IEEE LANMAN), 2013, pp. 1–6.' date_created: 2017-10-17T12:42:31Z date_updated: 2022-01-06T07:01:37Z ddc: - '040' department: - _id: '75' doi: 10.1109/LANMAN.2013.6528271 file: - access_level: closed content_type: application/pdf creator: florida date_created: 2018-03-15T10:50:19Z date_updated: 2018-03-15T10:50:19Z file_id: '1307' file_name: 508-06528271.pdf file_size: 219902 relation: main_file success: 1 file_date_updated: 2018-03-15T10:50:19Z has_accepted_license: '1' page: '1 - 6 ' project: - _id: '1' name: SFB 901 - _id: '6' name: SFB 901 - Subprojekt A2 - _id: '2' name: SFB 901 - Project Area A publication: Proceedings of the 19th IEEE International Workshop on Local and Metropolitan Area Networks (IEEE LANMAN) status: public title: On the Quality of Selfish Virtual Topology Reconfiguration in IP-over-WDM Networks type: conference user_id: '15572' year: '2013' ... --- _id: '509' abstract: - lang: eng text: In this paper we will introduce a new d-dimensional graph for constructing geometric application layer overlay net-works. Our approach will use internet coordinates, embedded using the L∞ -metric. After describing the graph structure, we will show how it limits maintenance overhead by bounding each node’s out-degree and how it supports greedy routing using one-hop neighbourhood information in each routing step. We will further show that greedy routing can always compute a path in our graph and we will also prove that in each forwarding step the next hop is closer to the destination than the current node. author: - first_name: Marcus full_name: Autenrieth, Marcus last_name: Autenrieth - first_name: Hannes full_name: Frey, Hannes last_name: Frey citation: ama: 'Autenrieth M, Frey H. On Greedy Routing in Degree-bounded Graphs over d-Dimensional Internet Coordinate Embeddings. In: Proceedings of the Conference on Networked Systems (NetSys). ; 2013:126-131. doi:10.1109/NetSys.2013.10' apa: Autenrieth, M., & Frey, H. (2013). On Greedy Routing in Degree-bounded Graphs over d-Dimensional Internet Coordinate Embeddings. In Proceedings of the Conference on Networked Systems (NetSys) (pp. 126–131). https://doi.org/10.1109/NetSys.2013.10 bibtex: '@inproceedings{Autenrieth_Frey_2013, title={On Greedy Routing in Degree-bounded Graphs over d-Dimensional Internet Coordinate Embeddings}, DOI={10.1109/NetSys.2013.10}, booktitle={Proceedings of the Conference on Networked Systems (NetSys)}, author={Autenrieth, Marcus and Frey, Hannes}, year={2013}, pages={126–131} }' chicago: Autenrieth, Marcus, and Hannes Frey. “On Greedy Routing in Degree-Bounded Graphs over d-Dimensional Internet Coordinate Embeddings.” In Proceedings of the Conference on Networked Systems (NetSys), 126–31, 2013. https://doi.org/10.1109/NetSys.2013.10. ieee: M. Autenrieth and H. Frey, “On Greedy Routing in Degree-bounded Graphs over d-Dimensional Internet Coordinate Embeddings,” in Proceedings of the Conference on Networked Systems (NetSys), 2013, pp. 126–131. mla: Autenrieth, Marcus, and Hannes Frey. “On Greedy Routing in Degree-Bounded Graphs over d-Dimensional Internet Coordinate Embeddings.” Proceedings of the Conference on Networked Systems (NetSys), 2013, pp. 126–31, doi:10.1109/NetSys.2013.10. short: 'M. Autenrieth, H. Frey, in: Proceedings of the Conference on Networked Systems (NetSys), 2013, pp. 126–131.' date_created: 2017-10-17T12:42:31Z date_updated: 2022-01-06T07:01:37Z ddc: - '040' department: - _id: '75' doi: 10.1109/NetSys.2013.10 file: - access_level: closed content_type: application/pdf creator: florida date_created: 2018-03-15T10:46:51Z date_updated: 2018-03-15T10:46:51Z file_id: '1304' file_name: 509-06529245.pdf file_size: 197048 relation: main_file success: 1 file_date_updated: 2018-03-15T10:46:51Z has_accepted_license: '1' page: 126-131 project: - _id: '1' name: SFB 901 - _id: '6' name: SFB 901 - Subprojekt A2 - _id: '2' name: SFB 901 - Project Area A publication: Proceedings of the Conference on Networked Systems (NetSys) status: public title: On Greedy Routing in Degree-bounded Graphs over d-Dimensional Internet Coordinate Embeddings type: conference user_id: '15504' year: '2013' ... --- _id: '510' author: - first_name: Chintan full_name: Jayesh Parekh, Chintan last_name: Jayesh Parekh citation: ama: Jayesh Parekh C. Meta-Data Based Search in Structured Peer-to-Peer Networks. Universität Paderborn; 2013. apa: Jayesh Parekh, C. (2013). Meta-data based Search in Structured Peer-to-Peer Networks. Universität Paderborn. bibtex: '@book{Jayesh Parekh_2013, title={Meta-data based Search in Structured Peer-to-Peer Networks}, publisher={Universität Paderborn}, author={Jayesh Parekh, Chintan}, year={2013} }' chicago: Jayesh Parekh, Chintan. Meta-Data Based Search in Structured Peer-to-Peer Networks. Universität Paderborn, 2013. ieee: C. Jayesh Parekh, Meta-data based Search in Structured Peer-to-Peer Networks. Universität Paderborn, 2013. mla: Jayesh Parekh, Chintan. Meta-Data Based Search in Structured Peer-to-Peer Networks. Universität Paderborn, 2013. short: C. Jayesh Parekh, Meta-Data Based Search in Structured Peer-to-Peer Networks, Universität Paderborn, 2013. date_created: 2017-10-17T12:42:31Z date_updated: 2022-01-06T07:01:37Z 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: Meta-data based Search in Structured Peer-to-Peer Networks type: mastersthesis user_id: '15504' year: '2013' ... --- _id: '5108' abstract: - lang: eng text: 'This study integrates the government in the context of company valuation. Our framework allows to analyze and to quantify the risk-sharing effects and conflicts of interest between the government and the shareholders when firms follow different financial policies. We provide novel evidence that firms with fixed future levels of debt might invest more than socially desirable. Economically, this happens if the gain in tax-shields is big enough to outweigh the loss in the unlevered firm value. Our findings have implications for the practice of investment subsidy programs provided by the government to avoid fostering investments beyond the socially optimal level. ' article_type: original author: - first_name: Daniel full_name: Kreutzmann, Daniel last_name: Kreutzmann - first_name: Sönke full_name: Sievers, Sönke id: '46447' last_name: Sievers - first_name: Christian full_name: Mueller, Christian last_name: Mueller citation: ama: Kreutzmann D, Sievers S, Mueller C. Investment distortions and the value of the government’s tax claim. Applied Financial Economics (VHB-JOURQUAL 3 Ranking C). 2013;23(11):977-989. doi:10.1080/09603107.2013.786161 apa: Kreutzmann, D., Sievers, S., & Mueller, C. (2013). Investment distortions and the value of the government’s tax claim. Applied Financial Economics (VHB-JOURQUAL 3 Ranking C), 23(11), 977–989. https://doi.org/10.1080/09603107.2013.786161 bibtex: '@article{Kreutzmann_Sievers_Mueller_2013, title={Investment distortions and the value of the government’s tax claim}, volume={23}, DOI={10.1080/09603107.2013.786161}, number={11}, journal={Applied Financial Economics (VHB-JOURQUAL 3 Ranking C)}, publisher={Taylor \& Francis}, author={Kreutzmann, Daniel and Sievers, Sönke and Mueller, Christian}, year={2013}, pages={977–989} }' chicago: 'Kreutzmann, Daniel, Sönke Sievers, and Christian Mueller. “Investment Distortions and the Value of the Government’s Tax Claim.” Applied Financial Economics (VHB-JOURQUAL 3 Ranking C) 23, no. 11 (2013): 977–89. https://doi.org/10.1080/09603107.2013.786161.' ieee: D. Kreutzmann, S. Sievers, and C. Mueller, “Investment distortions and the value of the government’s tax claim,” Applied Financial Economics (VHB-JOURQUAL 3 Ranking C), vol. 23, no. 11, pp. 977–989, 2013. mla: Kreutzmann, Daniel, et al. “Investment Distortions and the Value of the Government’s Tax Claim.” Applied Financial Economics (VHB-JOURQUAL 3 Ranking C), vol. 23, no. 11, Taylor \& Francis, 2013, pp. 977–89, doi:10.1080/09603107.2013.786161. short: D. Kreutzmann, S. Sievers, C. Mueller, Applied Financial Economics (VHB-JOURQUAL 3 Ranking C) 23 (2013) 977–989. date_created: 2018-10-31T07:50:58Z date_updated: 2022-01-06T07:01:38Z department: - _id: '275' doi: 10.1080/09603107.2013.786161 extern: '1' intvolume: ' 23' issue: '11' jel: - G31 - G32 - H21 - H25 keyword: - corporate tax claim - company valuation - optimal investment - cost of capital language: - iso: eng main_file_link: - url: https://www.tandfonline.com/doi/full/10.1080/09603107.2013.786161#.VE5YmBZwmAd page: 977-989 publication: Applied Financial Economics (VHB-JOURQUAL 3 Ranking C) publication_status: published publisher: Taylor \& Francis status: public title: Investment distortions and the value of the government's tax claim type: journal_article user_id: '46447' volume: 23 year: '2013' ... --- _id: '511' author: - first_name: Malte full_name: Splietker, Malte last_name: Splietker citation: ama: Splietker M. MapReduce in Software Defined Networks. Universität Paderborn; 2013. apa: Splietker, M. (2013). MapReduce in Software Defined Networks. Universität Paderborn. bibtex: '@book{Splietker_2013, title={MapReduce in Software Defined Networks}, publisher={Universität Paderborn}, author={Splietker, Malte}, year={2013} }' chicago: Splietker, Malte. MapReduce in Software Defined Networks. Universität Paderborn, 2013. ieee: M. Splietker, MapReduce in Software Defined Networks. Universität Paderborn, 2013. mla: Splietker, Malte. MapReduce in Software Defined Networks. Universität Paderborn, 2013. short: M. Splietker, MapReduce in Software Defined Networks, Universität Paderborn, 2013. date_created: 2017-10-17T12:42:32Z date_updated: 2022-01-06T07:01:38Z department: - _id: '75' 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: MapReduce in Software Defined Networks type: bachelorsthesis user_id: '15504' year: '2013' ... --- _id: '5111' author: - first_name: Bernard Michael full_name: Gilroy, Bernard Michael id: '175' last_name: Gilroy - first_name: Heike full_name: Schreckenberg, Heike last_name: Schreckenberg - first_name: Volker full_name: Seiler, Volker last_name: Seiler citation: ama: 'Gilroy BM, Schreckenberg H, Seiler V. Subsidiarity between economic freedom and harmonized regulation: is there an optimal degree of European integration? Federal Governance. 2013;10(2):3-18.' apa: 'Gilroy, B. M., Schreckenberg, H., & Seiler, V. (2013). Subsidiarity between economic freedom and harmonized regulation: is there an optimal degree of European integration? Federal Governance, 10(2), 3–18.' bibtex: '@article{Gilroy_Schreckenberg_Seiler_2013, title={Subsidiarity between economic freedom and harmonized regulation: is there an optimal degree of European integration?}, volume={10}, number={2}, journal={Federal Governance}, publisher={MISC}, author={Gilroy, Bernard Michael and Schreckenberg, Heike and Seiler, Volker}, year={2013}, pages={3–18} }' chicago: 'Gilroy, Bernard Michael, Heike Schreckenberg, and Volker Seiler. “Subsidiarity between Economic Freedom and Harmonized Regulation: Is There an Optimal Degree of European Integration?” Federal Governance 10, no. 2 (2013): 3–18.' ieee: 'B. M. Gilroy, H. Schreckenberg, and V. Seiler, “Subsidiarity between economic freedom and harmonized regulation: is there an optimal degree of European integration?,” Federal Governance, vol. 10, no. 2, pp. 3–18, 2013.' mla: 'Gilroy, Bernard Michael, et al. “Subsidiarity between Economic Freedom and Harmonized Regulation: Is There an Optimal Degree of European Integration?” Federal Governance, vol. 10, no. 2, MISC, 2013, pp. 3–18.' short: B.M. Gilroy, H. Schreckenberg, V. Seiler, Federal Governance 10 (2013) 3–18. date_created: 2018-10-31T07:56:40Z date_updated: 2022-01-06T07:01:38Z department: - _id: '203' intvolume: ' 10' issue: '2' language: - iso: eng page: 3-18 publication: Federal Governance publisher: MISC status: public title: 'Subsidiarity between economic freedom and harmonized regulation: is there an optimal degree of European integration?' type: journal_article user_id: '26589' volume: 10 year: '2013' ... --- _id: '5112' author: - first_name: Bernard Michael full_name: Gilroy, Bernard Michael id: '175' last_name: Gilroy - first_name: Elmar full_name: Lukas, Elmar last_name: Lukas - first_name: Christian full_name: Heimann, Christian last_name: Heimann citation: ama: Gilroy BM, Lukas E, Heimann C. Technologiestandort Deutschland und internationale Wissensspillover. Jahrbücher für Nationalokonomie 6 Statistik. 2013;233. apa: Gilroy, B. M., Lukas, E., & Heimann, C. (2013). Technologiestandort Deutschland und internationale Wissensspillover. Jahrbücher Für Nationalokonomie 6 Statistik, 233. bibtex: '@article{Gilroy_Lukas_Heimann_2013, title={Technologiestandort Deutschland und internationale Wissensspillover.}, volume={233}, journal={Jahrbücher für Nationalokonomie 6 Statistik}, author={Gilroy, Bernard Michael and Lukas, Elmar and Heimann, Christian}, year={2013} }' chicago: Gilroy, Bernard Michael, Elmar Lukas, and Christian Heimann. “Technologiestandort Deutschland Und Internationale Wissensspillover.” Jahrbücher Für Nationalokonomie 6 Statistik 233 (2013). ieee: B. M. Gilroy, E. Lukas, and C. Heimann, “Technologiestandort Deutschland und internationale Wissensspillover.,” Jahrbücher für Nationalokonomie 6 Statistik, vol. 233, 2013. mla: Gilroy, Bernard Michael, et al. “Technologiestandort Deutschland Und Internationale Wissensspillover.” Jahrbücher Für Nationalokonomie 6 Statistik, vol. 233, 2013. short: B.M. Gilroy, E. Lukas, C. Heimann, Jahrbücher Für Nationalokonomie 6 Statistik 233 (2013). date_created: 2018-10-31T07:58:12Z date_updated: 2022-01-06T07:01:38Z department: - _id: '203' intvolume: ' 233' language: - iso: eng publication: Jahrbücher für Nationalokonomie 6 Statistik status: public title: Technologiestandort Deutschland und internationale Wissensspillover. type: journal_article user_id: '26589' volume: 233 year: '2013' ... --- _id: '5113' abstract: - lang: eng text: 'Standard equity valuation approaches (i.e., DDM, RIM, and DCF model) are derived under the assumption of ideal conditions, such as infinite payoffs and clean surplus accounting. Because these conditions are hardly ever met, we extend the standard approaches, based on the fundamental principle of financial statement articulation. The extended models are then tested empirically by employing two sets of forecasts: (1) analyst forecasts provided by Value Line and (2) forecasts generated by cross-sectional regression models. The main result is that our extended models yield considerably smaller valuation errors. Moreover, by construction, identical value estimates are obtained across the extended models. By reestablishing empirical equivalence under non-ideal conditions, our approach provides a benchmark that enables us to quantify the errors resulting from individual deviations from ideal conditions, and thus, to analyze the robustness of the standard approaches. Finally, by providing a level playing field for the different valuation approaches, our findings have implications for other empirical settings, for example, estimating the implied cost of capital. ' article_type: original author: - first_name: Nicolas full_name: Heinrichs, Nicolas last_name: Heinrichs - first_name: Dieter full_name: Hess, Dieter last_name: Hess - first_name: Carsten full_name: Homburg, Carsten last_name: Homburg - first_name: Michael full_name: Lorenz, Michael last_name: Lorenz - first_name: Sönke full_name: Sievers, Sönke id: '46447' last_name: Sievers citation: ama: 'Heinrichs N, Hess D, Homburg C, Lorenz M, Sievers S. Extended dividend, cash flow, and residual income valuation models: Accounting for deviations from ideal conditions. Contemporary Accounting Research (VHB-JOURQUAL 3 Ranking A). 2013;30(1):42-79. doi:10.2139/ssrn.1145201' apa: 'Heinrichs, N., Hess, D., Homburg, C., Lorenz, M., & Sievers, S. (2013). Extended dividend, cash flow, and residual income valuation models: Accounting for deviations from ideal conditions. Contemporary Accounting Research (VHB-JOURQUAL 3 Ranking A), 30(1), 42–79. https://doi.org/10.2139/ssrn.1145201' bibtex: '@article{Heinrichs_Hess_Homburg_Lorenz_Sievers_2013, title={Extended dividend, cash flow, and residual income valuation models: Accounting for deviations from ideal conditions}, volume={30}, DOI={10.2139/ssrn.1145201}, number={1}, journal={Contemporary Accounting Research (VHB-JOURQUAL 3 Ranking A)}, publisher={Wiley Online Library}, author={Heinrichs, Nicolas and Hess, Dieter and Homburg, Carsten and Lorenz, Michael and Sievers, Sönke}, year={2013}, pages={42–79} }' chicago: 'Heinrichs, Nicolas, Dieter Hess, Carsten Homburg, Michael Lorenz, and Sönke Sievers. “Extended Dividend, Cash Flow, and Residual Income Valuation Models: Accounting for Deviations from Ideal Conditions.” Contemporary Accounting Research (VHB-JOURQUAL 3 Ranking A) 30, no. 1 (2013): 42–79. https://doi.org/10.2139/ssrn.1145201.' ieee: 'N. Heinrichs, D. Hess, C. Homburg, M. Lorenz, and S. Sievers, “Extended dividend, cash flow, and residual income valuation models: Accounting for deviations from ideal conditions,” Contemporary Accounting Research (VHB-JOURQUAL 3 Ranking A), vol. 30, no. 1, pp. 42–79, 2013.' mla: 'Heinrichs, Nicolas, et al. “Extended Dividend, Cash Flow, and Residual Income Valuation Models: Accounting for Deviations from Ideal Conditions.” Contemporary Accounting Research (VHB-JOURQUAL 3 Ranking A), vol. 30, no. 1, Wiley Online Library, 2013, pp. 42–79, doi:10.2139/ssrn.1145201.' short: N. Heinrichs, D. Hess, C. Homburg, M. Lorenz, S. Sievers, Contemporary Accounting Research (VHB-JOURQUAL 3 Ranking A) 30 (2013) 42–79. date_created: 2018-10-31T07:58:17Z date_updated: 2022-01-06T07:01:38Z department: - _id: '275' doi: 10.2139/ssrn.1145201 extern: '1' intvolume: ' 30' issue: '1' jel: - G12 - G14 - M41 keyword: - Dividend Discount Model - Residual Income - Discounted Cash Flow - Dirty Surplus - Terminal Value - Valuation Error language: - iso: eng main_file_link: - url: http://onlinelibrary.wiley.com/doi/10.1111/j.1911-3846.2011.01148.x/abstract page: 42-79 publication: Contemporary Accounting Research (VHB-JOURQUAL 3 Ranking A) publication_status: published publisher: Wiley Online Library quality_controlled: '1' related_material: link: - relation: earlier_version url: http://papers.ssrn.com/sol3/papers.cfm?abstract_id=1145201 status: public title: 'Extended dividend, cash flow, and residual income valuation models: Accounting for deviations from ideal conditions' type: journal_article user_id: '46447' volume: 30 year: '2013' ... --- _id: '5114' author: - first_name: Bernard Michael full_name: Gilroy, Bernard Michael id: '175' last_name: Gilroy - first_name: Anastasia full_name: Heimann, Anastasia last_name: Heimann - first_name: Mark full_name: Schopf, Mark last_name: Schopf citation: ama: 'Gilroy BM, Heimann A, Schopf M. Basic income and labour supply: The German case. Basic Income Studies. 2013;8(1):43-70.' apa: 'Gilroy, B. M., Heimann, A., & Schopf, M. (2013). Basic income and labour supply: The German case. Basic Income Studies, 8(1), 43–70.' bibtex: '@article{Gilroy_Heimann_Schopf_2013, title={Basic income and labour supply: The German case}, volume={8}, number={1}, journal={Basic Income Studies}, publisher={De Gruyter}, author={Gilroy, Bernard Michael and Heimann, Anastasia and Schopf, Mark}, year={2013}, pages={43–70} }' chicago: 'Gilroy, Bernard Michael, Anastasia Heimann, and Mark Schopf. “Basic Income and Labour Supply: The German Case.” Basic Income Studies 8, no. 1 (2013): 43–70.' ieee: 'B. M. Gilroy, A. Heimann, and M. Schopf, “Basic income and labour supply: The German case,” Basic Income Studies, vol. 8, no. 1, pp. 43–70, 2013.' mla: 'Gilroy, Bernard Michael, et al. “Basic Income and Labour Supply: The German Case.” Basic Income Studies, vol. 8, no. 1, De Gruyter, 2013, pp. 43–70.' short: B.M. Gilroy, A. Heimann, M. Schopf, Basic Income Studies 8 (2013) 43–70. date_created: 2018-10-31T08:00:24Z date_updated: 2022-01-06T07:01:38Z department: - _id: '203' intvolume: ' 8' issue: '1' language: - iso: eng page: 43-70 publication: Basic Income Studies publisher: De Gruyter status: public title: 'Basic income and labour supply: The German case' type: journal_article user_id: '26589' volume: 8 year: '2013' ... --- _id: '5115' author: - first_name: Bernard Michael full_name: Gilroy, Bernard Michael id: '175' last_name: Gilroy - first_name: Birke Thuy Duong full_name: Nguyen, Birke Thuy Duong last_name: Nguyen citation: ama: Gilroy BM, Nguyen BTD. Ist Fairer Handel Wirklich Fair? WiSt-Wirtschaftswissenschaftliches Studium. 2013;42(3):134-140. apa: Gilroy, B. M., & Nguyen, B. T. D. (2013). Ist Fairer Handel Wirklich Fair? WiSt-Wirtschaftswissenschaftliches Studium, 42(3), 134–140. bibtex: '@article{Gilroy_Nguyen_2013, title={Ist Fairer Handel Wirklich Fair?}, volume={42}, number={3}, journal={WiSt-Wirtschaftswissenschaftliches Studium}, publisher={Verlag Franz Vahlen GmbH}, author={Gilroy, Bernard Michael and Nguyen, Birke Thuy Duong}, year={2013}, pages={134–140} }' chicago: 'Gilroy, Bernard Michael, and Birke Thuy Duong Nguyen. “Ist Fairer Handel Wirklich Fair?” WiSt-Wirtschaftswissenschaftliches Studium 42, no. 3 (2013): 134–40.' ieee: B. M. Gilroy and B. T. D. Nguyen, “Ist Fairer Handel Wirklich Fair?,” WiSt-Wirtschaftswissenschaftliches Studium, vol. 42, no. 3, pp. 134–140, 2013. mla: Gilroy, Bernard Michael, and Birke Thuy Duong Nguyen. “Ist Fairer Handel Wirklich Fair?” WiSt-Wirtschaftswissenschaftliches Studium, vol. 42, no. 3, Verlag Franz Vahlen GmbH, 2013, pp. 134–40. short: B.M. Gilroy, B.T.D. Nguyen, WiSt-Wirtschaftswissenschaftliches Studium 42 (2013) 134–140. date_created: 2018-10-31T08:01:49Z date_updated: 2022-01-06T07:01:38Z department: - _id: '203' intvolume: ' 42' issue: '3' language: - iso: eng page: 134-140 publication: WiSt-Wirtschaftswissenschaftliches Studium publisher: Verlag Franz Vahlen GmbH status: public title: Ist Fairer Handel Wirklich Fair? type: journal_article user_id: '26589' volume: 42 year: '2013' ... --- _id: '5117' author: - first_name: Bernard Michael full_name: Gilroy, Bernard Michael id: '175' last_name: Gilroy - first_name: Heike full_name: Schreckenberg, Heike last_name: Schreckenberg - first_name: Volker full_name: Seiler, Volker last_name: Seiler citation: ama: Gilroy BM, Schreckenberg H, Seiler V. Water as an Alternative Asset.; 2013. apa: Gilroy, B. M., Schreckenberg, H., & Seiler, V. (2013). Water as an alternative asset. bibtex: '@book{Gilroy_Schreckenberg_Seiler_2013, title={Water as an alternative asset}, author={Gilroy, Bernard Michael and Schreckenberg, Heike and Seiler, Volker}, year={2013} }' chicago: Gilroy, Bernard Michael, Heike Schreckenberg, and Volker Seiler. Water as an Alternative Asset, 2013. ieee: B. M. Gilroy, H. Schreckenberg, and V. Seiler, Water as an alternative asset. 2013. mla: Gilroy, Bernard Michael, et al. Water as an Alternative Asset. 2013. short: B.M. Gilroy, H. Schreckenberg, V. Seiler, Water as an Alternative Asset, 2013. date_created: 2018-10-31T08:06:28Z date_updated: 2022-01-06T07:01:38Z department: - _id: '203' language: - iso: eng status: public title: Water as an alternative asset type: working_paper user_id: '26589' year: '2013' ... --- _id: '512' author: - first_name: Elvira full_name: Herzog, Elvira last_name: Herzog citation: ama: Herzog E. Lösungsverfahren für das many-to-one Matching Problem. Universität Paderborn; 2013. apa: Herzog, E. (2013). Lösungsverfahren für das many-to-one Matching Problem. Universität Paderborn. bibtex: '@book{Herzog_2013, title={Lösungsverfahren für das many-to-one Matching Problem}, publisher={Universität Paderborn}, author={Herzog, Elvira}, year={2013} }' chicago: Herzog, Elvira. Lösungsverfahren für das many-to-one Matching Problem. Universität Paderborn, 2013. ieee: E. Herzog, Lösungsverfahren für das many-to-one Matching Problem. Universität Paderborn, 2013. mla: Herzog, Elvira. Lösungsverfahren für das many-to-one Matching Problem. Universität Paderborn, 2013. short: E. Herzog, Lösungsverfahren für das many-to-one Matching Problem, Universität Paderborn, 2013. date_created: 2017-10-17T12:42:32Z date_updated: 2022-01-06T07:01:38Z 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: Lösungsverfahren für das many-to-one Matching Problem type: bachelorsthesis user_id: '477' year: '2013' ... --- _id: '513' abstract: - lang: eng text: This paper initiates the study of self-adjusting networks (or distributed data structures) whose topologies dynamically adapt to a communication pattern $\sigma$. We present a fully decentralized self-adjusting solution called SplayNet. A SplayNet is a distributed generalization of the classic splay tree concept. It ensures short paths (which can be found using local-greedy routing) between communication partners while minimizing topological rearrangements. We derive an upper bound for the amortized communication cost of a SplayNet based on empirical entropies of $\sigma$, and show that SplayNets have several interesting convergence properties. For instance, SplayNets features a provable online optimality under special requests scenarios. We also investigate the optimal static network and prove different lower bounds for the average communication cost based on graph cuts and on the empirical entropy of the communication pattern $\sigma$. From these lower bounds it follows, e.g., that SplayNets are optimal in scenarios where the requests follow a product distribution as well. Finally, this paper shows that in contrast to the Minimum Linear Arrangement problem which is generally NP-hard, the optimal static tree network can be computed in polynomial time for any guest graph, despite the exponentially large graph family. We complement our formal analysis with a small simulation study on a Facebook graph. author: - first_name: Chen full_name: Avin, Chen last_name: Avin - first_name: Bernhard full_name: Häupler, Bernhard last_name: Häupler - first_name: Zvi full_name: Lotker, Zvi last_name: Lotker - first_name: Christian full_name: Scheideler, Christian id: '20792' last_name: Scheideler - first_name: Stefan full_name: Schmid, Stefan last_name: Schmid citation: ama: 'Avin C, Häupler B, Lotker Z, Scheideler C, Schmid S. Locally Self-Adjusting Tree Networks. In: Proceedings of the 27th IEEE International Parallel and Distributed Processing Symposium (IPDPS). ; 2013:395-406. doi:10.1109/IPDPS.2013.40' apa: Avin, C., Häupler, B., Lotker, Z., Scheideler, C., & Schmid, S. (2013). Locally Self-Adjusting Tree Networks. In Proceedings of the 27th IEEE International Parallel and Distributed Processing Symposium (IPDPS) (pp. 395–406). https://doi.org/10.1109/IPDPS.2013.40 bibtex: '@inproceedings{Avin_Häupler_Lotker_Scheideler_Schmid_2013, title={Locally Self-Adjusting Tree Networks}, DOI={10.1109/IPDPS.2013.40}, booktitle={Proceedings of the 27th IEEE International Parallel and Distributed Processing Symposium (IPDPS)}, author={Avin, Chen and Häupler, Bernhard and Lotker, Zvi and Scheideler, Christian and Schmid, Stefan}, year={2013}, pages={395–406} }' chicago: Avin, Chen, Bernhard Häupler, Zvi Lotker, Christian Scheideler, and Stefan Schmid. “Locally Self-Adjusting Tree Networks.” In Proceedings of the 27th IEEE International Parallel and Distributed Processing Symposium (IPDPS), 395–406, 2013. https://doi.org/10.1109/IPDPS.2013.40. ieee: C. Avin, B. Häupler, Z. Lotker, C. Scheideler, and S. Schmid, “Locally Self-Adjusting Tree Networks,” in Proceedings of the 27th IEEE International Parallel and Distributed Processing Symposium (IPDPS), 2013, pp. 395–406. mla: Avin, Chen, et al. “Locally Self-Adjusting Tree Networks.” Proceedings of the 27th IEEE International Parallel and Distributed Processing Symposium (IPDPS), 2013, pp. 395–406, doi:10.1109/IPDPS.2013.40. short: 'C. Avin, B. Häupler, Z. Lotker, C. Scheideler, S. Schmid, in: Proceedings of the 27th IEEE International Parallel and Distributed Processing Symposium (IPDPS), 2013, pp. 395–406.' date_created: 2017-10-17T12:42:32Z date_updated: 2022-01-06T07:01:38Z ddc: - '040' department: - _id: '79' doi: 10.1109/IPDPS.2013.40 file: - access_level: closed content_type: application/pdf creator: florida date_created: 2018-03-15T10:45:15Z date_updated: 2018-03-15T10:45:15Z file_id: '1303' file_name: 513-ipdps13_01.pdf file_size: 518804 relation: main_file success: 1 file_date_updated: 2018-03-15T10:45:15Z has_accepted_license: '1' page: 395-406 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 27th IEEE International Parallel and Distributed Processing Symposium (IPDPS) status: public title: Locally Self-Adjusting Tree Networks type: conference user_id: '15504' year: '2013' ... --- _id: '514' abstract: - lang: eng text: Diese Arbeit besch{\"a}ftigt sich mit dem Facility Location Problem. Dies ist ein Optimierungsproblem, bei dem festgelegt werden muss an welchen Positionen Ressourcen zur Verf{\"u}gung gestellt werden, so dass diese von Nutzern gut erreicht werden k{\"o}nnen. Es sollen dabei Kosten minimiert werden, die zum einen durch Bereitstellung von Ressourcen und zum anderen durch Verbindungskosten zwischen Nutzern und Ressourcen entstehen. Die Schwierigkeit des Problems liegt darin, dass man einerseits m{\"o}glichst wenige Ressourcen zur Verf{\"u}gung stellen m{\"o}chte, andererseits daf{\"u}r sorgen muss, dass sich Nutzer nicht all zu weit weg von Ressourcen befinden. Dies w{\"u}rde n{\"a}mlich hohe Verbindungskosten nach sich ziehen. Das Facility Location Problem wurde bereits sehr intensiv in vielen unterschiedlichen Varianten untersucht. In dieser Arbeit werden drei Varianten des Problems modelliert und neue Algorithmen f{\"u}r sie entwickelt und bez{\"u}glich ihres Approximationsfaktors und ihrer Laufzeit analysiert. Jede dieser drei untersuchten Varianten hat einen besonderen Schwerpunkt. Bei der ersten Varianten handelt es sich um ein Online Problem, da hier die Eingabe nicht von Anfang an bekannt ist, sondern Schritt f{\"u}r Schritt enth{\"u}llt wird. Die Schwierigkeit hierbei besteht darin unwiderrufliche Entscheidungen treffen zu m{\"u}ssen ohne dabei die Zukunft zu kennen und trotzdem eine zu jeder Zeit gute L{\"o}sung angeben zu k{\"o}nnen. Der Schwerpunkt der zweiten Variante liegt auf Lokalit{\"a}t, die z.B. in Sensornetzwerken von großer Bedeutung ist. Hier soll eine L{\"o}sung verteilt und nur mit Hilfe von lokalen Information berechnet werden. Schließlich besch{\"a}ftigt sich die dritte Variante mit einer verteilten Berechnung, bei welcher nur eine stark beschr{\"a}nkte Datenmenge verschickt werden darf und dabei trotzdem ein sehr guter Approximationsfaktor erreicht werden muss. Die bei der Analyse der Approximationsfaktoren bzw. der Kompetitivit{\"a}t verwendeten Techniken basieren zum großen Teil auf Absch{\"a}tzung der primalen L{\"o}sung mit Hilfe einer L{\"o}sung des zugeh{\"o}rigen dualen Problems. F{\"u}r die Modellierung von Lokalit{\"a}t wird das weitverbreitete LOCAL Modell verwendet. In diesem Modell werden f{\"u}r die Algorithmen subpolynomielle obere Laufzeitschranken gezeigt. author: - first_name: Peter full_name: Pietrzyk, Peter last_name: Pietrzyk citation: ama: Pietrzyk P. Local and Online Algorithms for Facility Location. Universität Paderborn; 2013. apa: Pietrzyk, P. (2013). Local and Online Algorithms for Facility Location. Universität Paderborn. bibtex: '@book{Pietrzyk_2013, title={Local and Online Algorithms for Facility Location}, publisher={Universität Paderborn}, author={Pietrzyk, Peter}, year={2013} }' chicago: Pietrzyk, Peter. Local and Online Algorithms for Facility Location. Universität Paderborn, 2013. ieee: P. Pietrzyk, Local and Online Algorithms for Facility Location. Universität Paderborn, 2013. mla: Pietrzyk, Peter. Local and Online Algorithms for Facility Location. Universität Paderborn, 2013. short: P. Pietrzyk, Local and Online Algorithms for Facility Location, Universität Paderborn, 2013. date_created: 2017-10-17T12:42:32Z date_updated: 2022-01-06T07:01:38Z ddc: - '040' department: - _id: '63' file: - access_level: closed content_type: application/pdf creator: florida date_created: 2018-03-15T10:44:13Z date_updated: 2018-03-15T10:44:13Z file_id: '1302' file_name: 514-DissertationPietrzyk.pdf file_size: 790821 relation: main_file success: 1 file_date_updated: 2018-03-15T10:44:13Z has_accepted_license: '1' 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 supervisor: - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm id: '15523' last_name: Meyer auf der Heide title: Local and Online Algorithms for Facility Location type: dissertation user_id: '477' year: '2013' ... --- _id: '5144' author: - first_name: Volker full_name: Seiler, Volker last_name: Seiler - first_name: Markus full_name: Rudolf, Markus last_name: Rudolf - first_name: Tim full_name: Krume, Tim last_name: Krume citation: ama: Seiler V, Rudolf M, Krume T. The influence of socio-demographic variables on customer satisfaction and loyalty in the private banking industry. International Journal of Bank Marketing. 2013;31(4):235-258. apa: Seiler, V., Rudolf, M., & Krume, T. (2013). The influence of socio-demographic variables on customer satisfaction and loyalty in the private banking industry. International Journal of Bank Marketing, 31(4), 235–258. bibtex: '@article{Seiler_Rudolf_Krume_2013, title={The influence of socio-demographic variables on customer satisfaction and loyalty in the private banking industry}, volume={31}, number={4}, journal={International Journal of Bank Marketing}, publisher={Emerald Group Publishing Limited}, author={Seiler, Volker and Rudolf, Markus and Krume, Tim}, year={2013}, pages={235–258} }' chicago: 'Seiler, Volker, Markus Rudolf, and Tim Krume. “The Influence of Socio-Demographic Variables on Customer Satisfaction and Loyalty in the Private Banking Industry.” International Journal of Bank Marketing 31, no. 4 (2013): 235–58.' ieee: V. Seiler, M. Rudolf, and T. Krume, “The influence of socio-demographic variables on customer satisfaction and loyalty in the private banking industry,” International Journal of Bank Marketing, vol. 31, no. 4, pp. 235–258, 2013. mla: Seiler, Volker, et al. “The Influence of Socio-Demographic Variables on Customer Satisfaction and Loyalty in the Private Banking Industry.” International Journal of Bank Marketing, vol. 31, no. 4, Emerald Group Publishing Limited, 2013, pp. 235–58. short: V. Seiler, M. Rudolf, T. Krume, International Journal of Bank Marketing 31 (2013) 235–258. date_created: 2018-10-31T09:15:20Z date_updated: 2022-01-06T07:01:38Z intvolume: ' 31' issue: '4' page: 235-258 publication: International Journal of Bank Marketing publisher: Emerald Group Publishing Limited status: public title: The influence of socio-demographic variables on customer satisfaction and loyalty in the private banking industry type: journal_article user_id: '26589' volume: 31 year: '2013' ... --- _id: '5146' abstract: - lang: eng text: In this paper, we analyze a model in which two divisions negotiate over an intrafirm transfer price for an intermediate product. Formally, we consider bargaining problems under incomplete information, since the upstream division’s (seller's) costs and downstream division's (buyer's) revenues are supposed to be private information. Assuming two possible types for buyer and seller each, we first establish that the bargaining problem is regular, regardless whether incentive and/or efficiency constraints are imposed. This allows us to apply the generalized Nash bargaining solution to determine transfer payments and transfer probabilities. Furthermore, we derive general properties of this solution for the transfer pricing problem and compare the model developed here with the existing literature for negotiated transfer pricing under incomplete information. In particular, we focus on the models presented in Wagenhofer (1994). author: - first_name: Sonja full_name: Brangewitz, Sonja last_name: Brangewitz - first_name: Claus-Jochen full_name: Haake, Claus-Jochen id: '20801' last_name: Haake citation: ama: Brangewitz S, Haake C-J. Cooperative Transfer Price Negotiations under Incomplete Information. Vol 64. CIE Working Paper Series, Paderborn University; 2013. apa: Brangewitz, S., & Haake, C.-J. (2013). Cooperative Transfer Price Negotiations under Incomplete Information (Vol. 64). CIE Working Paper Series, Paderborn University. bibtex: '@book{Brangewitz_Haake_2013, series={Working Papers CIE}, title={Cooperative Transfer Price Negotiations under Incomplete Information}, volume={64}, publisher={CIE Working Paper Series, Paderborn University}, author={Brangewitz, Sonja and Haake, Claus-Jochen}, year={2013}, collection={Working Papers CIE} }' chicago: Brangewitz, Sonja, and Claus-Jochen Haake. Cooperative Transfer Price Negotiations under Incomplete Information. Vol. 64. Working Papers CIE. CIE Working Paper Series, Paderborn University, 2013. ieee: S. Brangewitz and C.-J. Haake, Cooperative Transfer Price Negotiations under Incomplete Information, vol. 64. CIE Working Paper Series, Paderborn University, 2013. mla: Brangewitz, Sonja, and Claus-Jochen Haake. Cooperative Transfer Price Negotiations under Incomplete Information. Vol. 64, CIE Working Paper Series, Paderborn University, 2013. short: S. Brangewitz, C.-J. Haake, Cooperative Transfer Price Negotiations under Incomplete Information, CIE Working Paper Series, Paderborn University, 2013. date_created: 2018-10-31T09:20:15Z date_updated: 2022-01-06T07:01:39Z ddc: - '040' department: - _id: '205' - _id: '475' file: - access_level: closed content_type: application/pdf creator: stela date_created: 2018-10-31T09:22:19Z date_updated: 2018-10-31T09:22:19Z file_id: '5148' file_name: WP - Cooperative Transfer Price Negotiations under Incomplete Information.pdf file_size: 430826 relation: main_file success: 1 file_date_updated: 2018-10-31T09:22:19Z has_accepted_license: '1' intvolume: ' 64' keyword: - Transfer Pricing - Negotiation - Generalized Nash Bargaining Solution - Incomplete Information language: - iso: eng project: - _id: '1' name: SFB 901 - _id: '2' name: SFB 901 - Project Area A - _id: '7' name: SFB 901 - Subproject A3 publisher: CIE Working Paper Series, Paderborn University series_title: Working Papers CIE status: public title: Cooperative Transfer Price Negotiations under Incomplete Information type: working_paper user_id: '477' volume: 64 year: '2013' ... --- _id: '515' abstract: - lang: eng text: The as a service paradigm reflects the fundamental idea of providing basic coherent functionality in terms of components that can be utilised on demand. These so-called services may also be interconnected in order to provide more complex functionality. Automation of this service composition process is indeed a formidable challenge. In our work, we are addressing this challenge by decomposing service composition into sequential decision making steps. Each step is supported by a recommendation mechanism. If composition requests recur over time and if evaluations of composition results are fed back, a proper recommendation strategy can evolve over time through learning from experience. In this paper, we describe our approach of modelling this service composition and recommendation process as Markov decision process and of solving it by means of reinforcement learning. A case study serves as proof of concept. 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 citation: ama: Jungmann A, Kleinjohann B, Kleinjohann E. Learning Service Recommendations. International Journal of Business Process Integration and Management. 2013;(4):284-297. doi:10.1504/IJBPIM.2013.059135 apa: Jungmann, A., Kleinjohann, B., & Kleinjohann, E. (2013). Learning Service Recommendations. International Journal of Business Process Integration and Management, (4), 284–297. https://doi.org/10.1504/IJBPIM.2013.059135 bibtex: '@article{Jungmann_Kleinjohann_Kleinjohann_2013, title={Learning Service Recommendations}, DOI={10.1504/IJBPIM.2013.059135}, number={4}, journal={International Journal of Business Process Integration and Management}, publisher={InderScience}, author={Jungmann, Alexander and Kleinjohann, Bernd and Kleinjohann, Elisabeth}, year={2013}, pages={284–297} }' chicago: 'Jungmann, Alexander, Bernd Kleinjohann, and Elisabeth Kleinjohann. “Learning Service Recommendations.” International Journal of Business Process Integration and Management, no. 4 (2013): 284–97. https://doi.org/10.1504/IJBPIM.2013.059135.' ieee: A. Jungmann, B. Kleinjohann, and E. Kleinjohann, “Learning Service Recommendations,” International Journal of Business Process Integration and Management, no. 4, pp. 284–297, 2013. mla: Jungmann, Alexander, et al. “Learning Service Recommendations.” International Journal of Business Process Integration and Management, no. 4, InderScience, 2013, pp. 284–97, doi:10.1504/IJBPIM.2013.059135. short: A. Jungmann, B. Kleinjohann, E. Kleinjohann, International Journal of Business Process Integration and Management (2013) 284–297. date_created: 2017-10-17T12:42:32Z date_updated: 2022-01-06T07:01:39Z ddc: - '040' doi: 10.1504/IJBPIM.2013.059135 file: - access_level: closed content_type: application/pdf creator: florida date_created: 2018-03-15T10:43:38Z date_updated: 2018-03-15T10:43:38Z file_id: '1301' file_name: 515-IJBPIM060402_JUNGMANN.pdf file_size: 5301831 relation: main_file success: 1 file_date_updated: 2018-03-15T10:43:38Z has_accepted_license: '1' issue: '4' main_file_link: - url: http://www.inderscience.com/offer.php?id=59135 page: 284-297 project: - _id: '1' name: SFB 901 - _id: '10' name: SFB 901 - Subprojekt B2 - _id: '3' name: SFB 901 - Project Area B publication: International Journal of Business Process Integration and Management publisher: InderScience status: public title: Learning Service Recommendations type: journal_article user_id: '477' year: '2013' ... --- _id: '516' abstract: - lang: eng text: 'The as a Service paradigm reflects the fundamental idea of providing basic coherent functionality in terms of components that can be utilized on demand. These so-called services may also be interconnected in order to provide more complex functionality. Automation of this service composition process is indeed a formidable challenge. In our work, we are addressing this challenge by decomposing service composition into sequential decision making steps. Each step is supported by a recommendation mechanism. If composition requests recur over time and if evaluations of composition results are fed back, a proper recommendation strategy can evolve over time through learning from experience. In this paper, we describe our general idea of modeling this service composition and recommendation process as Markov Decision Process and of solving it by means of Reinforcement Learning. A case study serves as proof of concept. ' author: - first_name: Alexander full_name: Jungmann, Alexander last_name: Jungmann - first_name: Bernd full_name: Kleinjohann, Bernd last_name: Kleinjohann citation: ama: 'Jungmann A, Kleinjohann B. Learning Recommendation System for Automated Service Composition. In: Proceedings of the 10th IEEE International Conference on Services Computing (SCC). ; 2013:97-104. doi:10.1109/SCC.2013.66' apa: Jungmann, A., & Kleinjohann, B. (2013). Learning Recommendation System for Automated Service Composition. In Proceedings of the 10th IEEE International Conference on Services Computing (SCC) (pp. 97–104). https://doi.org/10.1109/SCC.2013.66 bibtex: '@inproceedings{Jungmann_Kleinjohann_2013, title={Learning Recommendation System for Automated Service Composition}, DOI={10.1109/SCC.2013.66}, booktitle={Proceedings of the 10th IEEE International Conference on Services Computing (SCC)}, author={Jungmann, Alexander and Kleinjohann, Bernd}, year={2013}, pages={97–104} }' chicago: Jungmann, Alexander, and Bernd Kleinjohann. “Learning Recommendation System for Automated Service Composition.” In Proceedings of the 10th IEEE International Conference on Services Computing (SCC), 97–104, 2013. https://doi.org/10.1109/SCC.2013.66. ieee: A. Jungmann and B. Kleinjohann, “Learning Recommendation System for Automated Service Composition,” in Proceedings of the 10th IEEE International Conference on Services Computing (SCC), 2013, pp. 97–104. mla: Jungmann, Alexander, and Bernd Kleinjohann. “Learning Recommendation System for Automated Service Composition.” Proceedings of the 10th IEEE International Conference on Services Computing (SCC), 2013, pp. 97–104, doi:10.1109/SCC.2013.66. short: 'A. Jungmann, B. Kleinjohann, in: Proceedings of the 10th IEEE International Conference on Services Computing (SCC), 2013, pp. 97–104.' date_created: 2017-10-17T12:42:33Z date_updated: 2022-01-06T07:01:40Z ddc: - '040' doi: 10.1109/SCC.2013.66 file: - access_level: closed content_type: application/pdf creator: florida date_created: 2018-03-15T10:43:03Z date_updated: 2018-03-15T10:43:03Z file_id: '1300' file_name: 516-manuscript.pdf file_size: 1762714 relation: main_file success: 1 file_date_updated: 2018-03-15T10:43:03Z has_accepted_license: '1' page: 97-104 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 10th IEEE International Conference on Services Computing (SCC) status: public title: Learning Recommendation System for Automated Service Composition type: conference user_id: '15504' year: '2013' ... --- _id: '517' abstract: - lang: eng text: In the Semantic (Web) Services area, services are considered black boxes with a semantic description of their interfaces as to allow for precise service selection and configuration. The semantic description is usually grounded on domain-specific concepts as modeled in ontologies. This accounts for types used in service signatures, but also predicates occurring in preconditions and effects of services. Ontologies, in particular those enhanced with rules, capture the knowledge of domain experts on properties of and relations between domain concepts. In this paper, we present a verification technique for service compositions which makes use of this domain knowledge. We consider a service composition to be an assembly of services of which we just know signatures, preconditions, and effects. We aim at proving that a composition satisfies a (user-defined) requirement, specified in terms of guaranteed preconditions and required postconditions. As an underlying verification engine we use an SMT solver. To take advantage of the domain knowledge (and often, to enable verification at all), the knowledge is fed into the solver in the form of sorts, uninterpreted functions and in particular assertions as to enhance the solver’s reasoning capabilities. Thereby, we allow for deductions within a domain previously unknown to the solver. We exemplify our technique on a case study from the area of water network optimization software. author: - first_name: Sven full_name: Walther, Sven last_name: Walther - first_name: Heike full_name: Wehrheim, Heike id: '573' last_name: Wehrheim citation: ama: 'Walther S, Wehrheim H. Knowledge-Based Verification of Service Compositions - An SMT approach. In: Proceedings of the 18th IEEE International Conference on Engineering of Complex Computer Systems (ICECCS). ; 2013:24-32. doi:10.1109/ICECCS.2013.14' apa: Walther, S., & Wehrheim, H. (2013). Knowledge-Based Verification of Service Compositions - An SMT approach. In Proceedings of the 18th IEEE International Conference on Engineering of Complex Computer Systems (ICECCS) (pp. 24–32). https://doi.org/10.1109/ICECCS.2013.14 bibtex: '@inproceedings{Walther_Wehrheim_2013, title={Knowledge-Based Verification of Service Compositions - An SMT approach}, DOI={10.1109/ICECCS.2013.14}, booktitle={Proceedings of the 18th IEEE International Conference on Engineering of Complex Computer Systems (ICECCS)}, author={Walther, Sven and Wehrheim, Heike}, year={2013}, pages={24–32} }' chicago: Walther, Sven, and Heike Wehrheim. “Knowledge-Based Verification of Service Compositions - An SMT Approach.” In Proceedings of the 18th IEEE International Conference on Engineering of Complex Computer Systems (ICECCS), 24–32, 2013. https://doi.org/10.1109/ICECCS.2013.14. ieee: S. Walther and H. Wehrheim, “Knowledge-Based Verification of Service Compositions - An SMT approach,” in Proceedings of the 18th IEEE International Conference on Engineering of Complex Computer Systems (ICECCS), 2013, pp. 24–32. mla: Walther, Sven, and Heike Wehrheim. “Knowledge-Based Verification of Service Compositions - An SMT Approach.” Proceedings of the 18th IEEE International Conference on Engineering of Complex Computer Systems (ICECCS), 2013, pp. 24–32, doi:10.1109/ICECCS.2013.14. short: 'S. Walther, H. Wehrheim, in: Proceedings of the 18th IEEE International Conference on Engineering of Complex Computer Systems (ICECCS), 2013, pp. 24–32.' date_created: 2017-10-17T12:42:33Z date_updated: 2022-01-06T07:01:41Z ddc: - '000' department: - _id: '77' doi: 10.1109/ICECCS.2013.14 file: - access_level: closed content_type: application/pdf creator: ups date_created: 2018-11-02T13:26:08Z date_updated: 2018-11-02T13:26:08Z file_id: '5248' file_name: 06601801.pdf file_size: 217085 relation: main_file file_date_updated: 2018-11-02T13:26:08Z has_accepted_license: '1' language: - iso: eng page: '24 - 32 ' 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 18th IEEE International Conference on Engineering of Complex Computer Systems (ICECCS) status: public title: Knowledge-Based Verification of Service Compositions - An SMT approach type: conference user_id: '477' year: '2013' ... --- _id: '5172' author: - first_name: Sönke full_name: Sievers, Sönke id: '46447' last_name: Sievers citation: ama: 'Sievers S. Company Valuation and Growth: Theory, Empirical Evidence and Practical Implementation Issues. Verlag-Haus Monsenstein und Vannerdat; 2013.' apa: 'Sievers, S. (2013). Company Valuation and Growth: Theory, Empirical Evidence and Practical Implementation Issues. Verlag-Haus Monsenstein und Vannerdat.' bibtex: '@book{Sievers_2013, title={Company Valuation and Growth: Theory, Empirical Evidence and Practical Implementation Issues}, publisher={Verlag-Haus Monsenstein und Vannerdat}, author={Sievers, Sönke}, year={2013} }' chicago: 'Sievers, Sönke. Company Valuation and Growth: Theory, Empirical Evidence and Practical Implementation Issues. Verlag-Haus Monsenstein und Vannerdat, 2013.' ieee: 'S. Sievers, Company Valuation and Growth: Theory, Empirical Evidence and Practical Implementation Issues. Verlag-Haus Monsenstein und Vannerdat, 2013.' mla: 'Sievers, Sönke. Company Valuation and Growth: Theory, Empirical Evidence and Practical Implementation Issues. Verlag-Haus Monsenstein und Vannerdat, 2013.' short: 'S. Sievers, Company Valuation and Growth: Theory, Empirical Evidence and Practical Implementation Issues, Verlag-Haus Monsenstein und Vannerdat, 2013.' date_created: 2018-10-31T10:10:35Z date_updated: 2022-01-06T07:01:41Z department: - _id: '275' keyword: - Unternehmensbewertung - Unternehmenswachstum - Return on Investment Unternehmensbewertung - Investition - Steuervergünstigung language: - iso: eng publication_identifier: isbn: - 978-3-86582-925-2 publication_status: published publisher: Verlag-Haus Monsenstein und Vannerdat status: public title: 'Company Valuation and Growth: Theory, Empirical Evidence and Practical Implementation Issues' type: book user_id: '64756' year: '2013' ... --- _id: '518' author: - first_name: Vanessa full_name: Petrausch, Vanessa last_name: Petrausch citation: ama: Petrausch V. Klassifizierung unterschiedlicher Ansätze zum Matching von Services. Universität Paderborn; 2013. apa: Petrausch, V. (2013). Klassifizierung unterschiedlicher Ansätze zum Matching von Services. Universität Paderborn. bibtex: '@book{Petrausch_2013, title={Klassifizierung unterschiedlicher Ansätze zum Matching von Services}, publisher={Universität Paderborn}, author={Petrausch, Vanessa}, year={2013} }' chicago: Petrausch, Vanessa. Klassifizierung unterschiedlicher Ansätze zum Matching von Services. Universität Paderborn, 2013. ieee: V. Petrausch, Klassifizierung unterschiedlicher Ansätze zum Matching von Services. Universität Paderborn, 2013. mla: Petrausch, Vanessa. Klassifizierung unterschiedlicher Ansätze zum Matching von Services. Universität Paderborn, 2013. short: V. Petrausch, Klassifizierung unterschiedlicher Ansätze zum Matching von Services, Universität Paderborn, 2013. date_created: 2017-10-17T12:42:33Z date_updated: 2022-01-06T07:01:41Z language: - iso: ger project: - _id: '1' name: SFB 901 - _id: '9' name: SFB 901 - Subprojekt B1 - _id: '3' name: SFB 901 - Project Area B publisher: Universität Paderborn status: public title: Klassifizierung unterschiedlicher Ansätze zum Matching von Services type: bachelorsthesis user_id: '477' year: '2013' ... --- _id: '519' abstract: - lang: eng text: In this work we present the first scalable distributed information system,i.e., a system with low storage overhead, that is provably robust againstDenial-of-Service (DoS) attacks by a current insider. We allow acurrent insider to have complete knowledge about the information systemand to have the power to block any \epsilon-fraction of its serversby a DoS-attack, where \epsilon can be chosen up to a constant. The taskof the system is to serve any collection of lookup requests with at most oneper non-blocked server in an efficient way despite this attack. Previously,scalable solutions were only known for DoS-attacks of past insiders, where apast insider only has complete knowledge about some past time pointt_0 of the information system. Scheideler et al. (DISC 2007, SPAA 2009) showedthat in this case it is possible to design an information system so that anyinformation that was inserted or last updated after t_0 is safe against a DoS-attack. But their constructions would not work at all for a current insider. The key idea behindour IRIS system is to make extensive use of coding. More precisely, we presenttwo alternative distributed coding strategies with an at most logarithmicstorage overhead that can handle up to a constant fraction of blocked servers. author: - first_name: Martina full_name: Eikel, Martina last_name: Eikel - first_name: Christian full_name: Scheideler, Christian id: '20792' last_name: Scheideler citation: ama: 'Eikel M, Scheideler C. IRIS: A Robust Information System Against Insider DoS-Attacks. In: Proceedings of the 25th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA). ; 2013:119-129. doi:10.1145/2486159.2486186' apa: 'Eikel, M., & Scheideler, C. (2013). IRIS: A Robust Information System Against Insider DoS-Attacks. In Proceedings of the 25th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA) (pp. 119–129). https://doi.org/10.1145/2486159.2486186' bibtex: '@inproceedings{Eikel_Scheideler_2013, title={IRIS: A Robust Information System Against Insider DoS-Attacks}, DOI={10.1145/2486159.2486186}, booktitle={Proceedings of the 25th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)}, author={Eikel, Martina and Scheideler, Christian}, year={2013}, pages={119–129} }' chicago: 'Eikel, Martina, and Christian Scheideler. “IRIS: A Robust Information System Against Insider DoS-Attacks.” In Proceedings of the 25th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 119–29, 2013. https://doi.org/10.1145/2486159.2486186.' ieee: 'M. Eikel and C. Scheideler, “IRIS: A Robust Information System Against Insider DoS-Attacks,” in Proceedings of the 25th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 2013, pp. 119–129.' mla: 'Eikel, Martina, and Christian Scheideler. “IRIS: A Robust Information System Against Insider DoS-Attacks.” Proceedings of the 25th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 2013, pp. 119–29, doi:10.1145/2486159.2486186.' short: 'M. Eikel, C. Scheideler, in: Proceedings of the 25th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 2013, pp. 119–129.' date_created: 2017-10-17T12:42:33Z date_updated: 2022-01-06T07:01:42Z ddc: - '040' department: - _id: '79' doi: 10.1145/2486159.2486186 file: - access_level: closed content_type: application/pdf creator: florida date_created: 2018-03-15T10:38:34Z date_updated: 2018-03-15T10:38:34Z file_id: '1299' file_name: 519-iris-spaa2013_01.pdf file_size: 554618 relation: main_file success: 1 file_date_updated: 2018-03-15T10:38:34Z has_accepted_license: '1' page: 119-129 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 25th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA) status: public title: 'IRIS: A Robust Information System Against Insider DoS-Attacks' type: conference user_id: '15504' year: '2013' ... --- _id: '5191' abstract: - lang: eng text: This study examines the relevance of financial and non-financial information for the valuation of venture capital (VC) investments. Based on a hand-collected data set on venture-backed start-ups in Germany, we investigate the internal due diligence documents of over 200 investment rounds. We document that balance sheet and income statement items capture as much economic content as verifiable non-financial information (e.g. team experience or the number of patents) while controlling for several deal characteristics (e.g. industry, investment round, or yearly VC fund inflows). In addition, we show that valuations based on accounting and non-accounting information yield a level of valuation accuracy that is comparable to that of publicly traded firms. Further analyses show that the industry-specific total asset multiples outperform the popular revenue multiples but lead to significantly less accurate results than those obtained from the more comprehensive valuation models. Overall, our findings might inform researchers and standard-setters of the usefulness of accounting information for investment companies and provide additional evidence to gauge the overall valuation accuracy in VC settings. article_type: original author: - first_name: Sönke full_name: Sievers, Sönke id: '46447' last_name: Sievers - first_name: Christopher F full_name: Mokwa, Christopher F last_name: Mokwa - first_name: Georg full_name: Keienburg, Georg last_name: Keienburg citation: ama: Sievers S, Mokwa CF, Keienburg G. The relevance of financial versus non-financial information for the valuation of venture capital-backed firms. European Accounting Review (VHB-JOURQUAL 3 Ranking A). 2013;22(3):467-511. doi:10.1080/09638180.2012.741051 apa: Sievers, S., Mokwa, C. F., & Keienburg, G. (2013). The relevance of financial versus non-financial information for the valuation of venture capital-backed firms. European Accounting Review (VHB-JOURQUAL 3 Ranking A), 22(3), 467–511. https://doi.org/10.1080/09638180.2012.741051 bibtex: '@article{Sievers_Mokwa_Keienburg_2013, title={The relevance of financial versus non-financial information for the valuation of venture capital-backed firms}, volume={22}, DOI={10.1080/09638180.2012.741051}, number={3}, journal={European Accounting Review (VHB-JOURQUAL 3 Ranking A)}, publisher={Taylor \& Francis}, author={Sievers, Sönke and Mokwa, Christopher F and Keienburg, Georg}, year={2013}, pages={467–511} }' chicago: 'Sievers, Sönke, Christopher F Mokwa, and Georg Keienburg. “The Relevance of Financial versus Non-Financial Information for the Valuation of Venture Capital-Backed Firms.” European Accounting Review (VHB-JOURQUAL 3 Ranking A) 22, no. 3 (2013): 467–511. https://doi.org/10.1080/09638180.2012.741051.' ieee: S. Sievers, C. F. Mokwa, and G. Keienburg, “The relevance of financial versus non-financial information for the valuation of venture capital-backed firms,” European Accounting Review (VHB-JOURQUAL 3 Ranking A), vol. 22, no. 3, pp. 467–511, 2013. mla: Sievers, Sönke, et al. “The Relevance of Financial versus Non-Financial Information for the Valuation of Venture Capital-Backed Firms.” European Accounting Review (VHB-JOURQUAL 3 Ranking A), vol. 22, no. 3, Taylor \& Francis, 2013, pp. 467–511, doi:10.1080/09638180.2012.741051. short: S. Sievers, C.F. Mokwa, G. Keienburg, European Accounting Review (VHB-JOURQUAL 3 Ranking A) 22 (2013) 467–511. date_created: 2018-10-31T11:27:42Z date_updated: 2022-01-06T07:01:43Z department: - _id: '275' doi: 10.1080/09638180.2012.741051 extern: '1' intvolume: ' 22' issue: '3' jel: - G24 - G32 - M41 keyword: - value relevance - equity valuation - venture capital - human capital - start-ups language: - iso: eng main_file_link: - url: http://www.tandfonline.com/doi/full/10.1080/09638180.2012.741051 page: 467-511 publication: European Accounting Review (VHB-JOURQUAL 3 Ranking A) publication_status: published publisher: Taylor \& Francis quality_controlled: '1' related_material: link: - relation: earlier_version url: http://papers.ssrn.com/sol3/papers.cfm?abstract_id=1449740 status: public title: The relevance of financial versus non-financial information for the valuation of venture capital-backed firms type: journal_article user_id: '46447' volume: 22 year: '2013' ... --- _id: '5192' abstract: - lang: eng text: For the valuation of fast growing innovative firms Schwartz and Moon (Financ Anal J 56:62–75, 2000), (Financ Rev 36:7–26, 2001) develop a fundamental valuation model where key parameters follow stochastic processes. While prior research shows promising potential for this model, it has never been tested on a large scale dataset. Thus, guided by economic theory, this paper is the first to design a large-scale applicable implementation on around 30,000 technology firm quarter observations from 1992 to 2009 for the US to assess this model. Evaluating the feasibility and performance of the Schwartz-Moon model reveals that it is comparably accurate to the traditional sales multiple with key advantages in valuing small and non-listed firms. Most importantly, however, the model is able to indicate severe market over- or undervaluation from a fundamental perspective. We demonstrate that a trading strategy based on our implementation has significant investment value. Consequently, the model seems suitable for detecting misvaluations as the dot-com bubble. article_type: original author: - first_name: Jan full_name: Klobucnik, Jan last_name: Klobucnik - first_name: Sönke full_name: Sievers, Sönke id: '46447' last_name: Sievers citation: ama: Klobucnik J, Sievers S. Valuing high technology growth firms. Journal of Business Economics (VHB-JOURQUAL 3 Ranking B). 2013;83(9):947-984. doi:https://doi.org/10.1007/s11573-013-0684-2 apa: Klobucnik, J., & Sievers, S. (2013). Valuing high technology growth firms. Journal of Business Economics (VHB-JOURQUAL 3 Ranking B), 83(9), 947–984. https://doi.org/10.1007/s11573-013-0684-2 bibtex: '@article{Klobucnik_Sievers_2013, title={Valuing high technology growth firms}, volume={83}, DOI={https://doi.org/10.1007/s11573-013-0684-2}, number={9}, journal={Journal of Business Economics (VHB-JOURQUAL 3 Ranking B)}, publisher={Springer}, author={Klobucnik, Jan and Sievers, Sönke}, year={2013}, pages={947–984} }' chicago: 'Klobucnik, Jan, and Sönke Sievers. “Valuing High Technology Growth Firms.” Journal of Business Economics (VHB-JOURQUAL 3 Ranking B) 83, no. 9 (2013): 947–84. https://doi.org/10.1007/s11573-013-0684-2.' ieee: J. Klobucnik and S. Sievers, “Valuing high technology growth firms,” Journal of Business Economics (VHB-JOURQUAL 3 Ranking B), vol. 83, no. 9, pp. 947–984, 2013. mla: Klobucnik, Jan, and Sönke Sievers. “Valuing High Technology Growth Firms.” Journal of Business Economics (VHB-JOURQUAL 3 Ranking B), vol. 83, no. 9, Springer, 2013, pp. 947–84, doi:https://doi.org/10.1007/s11573-013-0684-2. short: J. Klobucnik, S. Sievers, Journal of Business Economics (VHB-JOURQUAL 3 Ranking B) 83 (2013) 947–984. date_created: 2018-10-31T11:31:56Z date_updated: 2022-01-06T07:01:43Z department: - _id: '275' doi: https://doi.org/10.1007/s11573-013-0684-2 extern: '1' intvolume: ' 83' issue: '9' jel: - G11 - G12 - G17 - G33 keyword: - Schwartz-Moon model - Market mispricing - Empirical test - Company valuation - Trading strategy language: - iso: eng main_file_link: - url: https://link.springer.com/article/10.1007/s11573-013-0684-2 page: 947-984 publication: Journal of Business Economics (VHB-JOURQUAL 3 Ranking B) publication_status: published publisher: Springer quality_controlled: '1' status: public title: Valuing high technology growth firms type: journal_article user_id: '46447' volume: 83 year: '2013' ... --- _id: '520' abstract: - lang: eng text: Preemptive Routing and Wavelength Assignment (RWA) algorithms preempt established lightpaths in case not enough resources are available to set up 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 to the RWA algorithm.Otherwise it might happen that by preempting a particular lightpath these requirements are violated. If, however, these requirements include parametersknown only at the nodes running the application, the RWA algorithm cannot evaluate the requirements. For this reason an RWA algorithm is needed which incorporates feedback from the application layer in the preemption decisions.This work proposes a simple interface along with an algorithm for computing and selecting preemption candidates in case a lightpath cannot be established. We reason about the necessity of using information from the application layer in the RWA and present two example applications which benefit from this idea. 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. Incorporating feedback from application layer into routing and wavelength assignment algorithms. In: Proceedings of the 32nd IEEE International Conference on Computer Communications (INFOCOM). ; 2013:51-52. doi:10.1109/INFCOMW.2013.6970733' apa: Wette, P., & Karl, H. (2013). Incorporating feedback from application layer into routing and wavelength assignment algorithms. In Proceedings of the 32nd IEEE International Conference on Computer Communications (INFOCOM) (pp. 51–52). https://doi.org/10.1109/INFCOMW.2013.6970733 bibtex: '@inproceedings{Wette_Karl_2013, title={Incorporating feedback from application layer into routing and wavelength assignment algorithms}, DOI={10.1109/INFCOMW.2013.6970733}, booktitle={Proceedings of the 32nd IEEE International Conference on Computer Communications (INFOCOM)}, author={Wette, Philip and Karl, Holger}, year={2013}, pages={51–52} }' chicago: Wette, Philip, and Holger Karl. “Incorporating Feedback from Application Layer into Routing and Wavelength Assignment Algorithms.” In Proceedings of the 32nd IEEE International Conference on Computer Communications (INFOCOM), 51–52, 2013. https://doi.org/10.1109/INFCOMW.2013.6970733. ieee: P. Wette and H. Karl, “Incorporating feedback from application layer into routing and wavelength assignment algorithms,” in Proceedings of the 32nd IEEE International Conference on Computer Communications (INFOCOM), 2013, pp. 51–52. mla: Wette, Philip, and Holger Karl. “Incorporating Feedback from Application Layer into Routing and Wavelength Assignment Algorithms.” Proceedings of the 32nd IEEE International Conference on Computer Communications (INFOCOM), 2013, pp. 51–52, doi:10.1109/INFCOMW.2013.6970733. short: 'P. Wette, H. Karl, in: Proceedings of the 32nd IEEE International Conference on Computer Communications (INFOCOM), 2013, pp. 51–52.' date_created: 2017-10-17T12:42:33Z date_updated: 2022-01-06T07:01:43Z ddc: - '040' department: - _id: '75' doi: 10.1109/INFCOMW.2013.6970733 file: - access_level: closed content_type: application/pdf creator: florida date_created: 2018-03-15T10:38:04Z date_updated: 2018-03-15T10:38:04Z file_id: '1298' file_name: 520-wetteinfocom2013.pdf file_size: 131502 relation: main_file success: 1 file_date_updated: 2018-03-15T10:38:04Z has_accepted_license: '1' main_file_link: - url: http://ieeexplore.ieee.org/document/6970733/ page: 51-52 project: - _id: '1' name: SFB 901 - _id: '6' name: SFB 901 - Subprojekt A2 - _id: '2' name: SFB 901 - Project Area A publication: Proceedings of the 32nd IEEE International Conference on Computer Communications (INFOCOM) status: public title: Incorporating feedback from application layer into routing and wavelength assignment algorithms type: conference user_id: '15504' year: '2013' ... --- _id: '5201' author: - first_name: Sönke full_name: Sievers, Sönke id: '46447' last_name: Sievers - first_name: Tobias full_name: Schlüter, Tobias last_name: Schlüter - first_name: Thomas full_name: Hartmann-Wendels, Thomas last_name: Hartmann-Wendels citation: ama: Sievers S, Schlüter T, Hartmann-Wendels T. Die erfolgreiche Bindung des Sparers an die Bank. Börsen-Zeitung. 2013. apa: Sievers, S., Schlüter, T., & Hartmann-Wendels, T. (2013). Die erfolgreiche Bindung des Sparers an die Bank. Börsen-Zeitung. bibtex: '@article{Sievers_Schlüter_Hartmann-Wendels_2013, title={Die erfolgreiche Bindung des Sparers an die Bank}, journal={Börsen-Zeitung}, author={Sievers, Sönke and Schlüter, Tobias and Hartmann-Wendels, Thomas}, year={2013} }' chicago: Sievers, Sönke, Tobias Schlüter, and Thomas Hartmann-Wendels. “Die erfolgreiche Bindung des Sparers an die Bank.” Börsen-Zeitung, 2013. ieee: S. Sievers, T. Schlüter, and T. Hartmann-Wendels, “Die erfolgreiche Bindung des Sparers an die Bank,” Börsen-Zeitung, 2013. mla: Sievers, Sönke, et al. “Die erfolgreiche Bindung des Sparers an die Bank.” Börsen-Zeitung, 2013. short: S. Sievers, T. Schlüter, T. Hartmann-Wendels, Börsen-Zeitung (2013). date_created: 2018-10-31T12:29:38Z date_updated: 2022-01-06T07:01:43Z department: - _id: '275' language: - iso: ger main_file_link: - url: https://www.boersen-zeitung.de/index.php?li=1&artid=2013018054&titel=Die-erfolgreiche-Bindung-des-Sparers-an-die-Bank publication: Börsen-Zeitung publication_date: 2013-01-10 publication_status: published status: public title: Die erfolgreiche Bindung des Sparers an die Bank type: newspaper_article user_id: '46447' year: '2013' ... --- _id: '5202' author: - first_name: Sönke full_name: Sievers, Sönke id: '46447' last_name: Sievers - first_name: Thomas full_name: Hartmann-Wendels, Thomas last_name: Hartmann-Wendels - first_name: Ramona full_name: Busch, Ramona last_name: Busch - first_name: Tobias full_name: Schlüter, Tobias last_name: Schlüter citation: ama: Sievers S, Hartmann-Wendels T, Busch R, Schlüter T. Wie Banken Kostenvorteile weitergeben. Börsen-Zeitung. 2013. apa: Sievers, S., Hartmann-Wendels, T., Busch, R., & Schlüter, T. (2013). Wie Banken Kostenvorteile weitergeben. Börsen-Zeitung. bibtex: '@article{Sievers_Hartmann-Wendels_Busch_Schlüter_2013, title={Wie Banken Kostenvorteile weitergeben}, volume={6}, journal={Börsen-Zeitung}, author={Sievers, Sönke and Hartmann-Wendels, Thomas and Busch, Ramona and Schlüter, Tobias}, year={2013} }' chicago: Sievers, Sönke, Thomas Hartmann-Wendels, Ramona Busch, and Tobias Schlüter. “Wie Banken Kostenvorteile weitergeben.” Börsen-Zeitung, 2013. ieee: S. Sievers, T. Hartmann-Wendels, R. Busch, and T. Schlüter, “Wie Banken Kostenvorteile weitergeben,” Börsen-Zeitung, vol. 6, 2013. mla: Sievers, Sönke, et al. “Wie Banken Kostenvorteile weitergeben.” Börsen-Zeitung, vol. 6, 2013. short: S. Sievers, T. Hartmann-Wendels, R. Busch, T. Schlüter, Börsen-Zeitung 6 (2013). date_created: 2018-10-31T12:32:09Z date_updated: 2022-01-06T07:01:43Z department: - _id: '275' intvolume: ' 6' language: - iso: ger main_file_link: - url: https://www.boersen-zeitung.de/index.php?li=1&artid=2013006066 page: '6' publication: Börsen-Zeitung publication_date: 2013-01-10 publication_status: published status: public title: Wie Banken Kostenvorteile weitergeben type: newspaper_article user_id: '46447' volume: 6 year: '2013' ... --- _id: '521' author: - first_name: Heinrich full_name: Riebler, Heinrich id: '8961' last_name: Riebler citation: ama: Riebler H. Identifikation und Wiederherstellung von kryptographischen Schlüsseln mit FPGAs. Universität Paderborn; 2013. apa: Riebler, H. (2013). Identifikation und Wiederherstellung von kryptographischen Schlüsseln mit FPGAs. Universität Paderborn. bibtex: '@book{Riebler_2013, title={Identifikation und Wiederherstellung von kryptographischen Schlüsseln mit FPGAs}, publisher={Universität Paderborn}, author={Riebler, Heinrich}, year={2013} }' chicago: Riebler, Heinrich. Identifikation und Wiederherstellung von kryptographischen Schlüsseln mit FPGAs. Universität Paderborn, 2013. ieee: H. Riebler, Identifikation und Wiederherstellung von kryptographischen Schlüsseln mit FPGAs. Universität Paderborn, 2013. mla: Riebler, Heinrich. Identifikation und Wiederherstellung von kryptographischen Schlüsseln mit FPGAs. Universität Paderborn, 2013. short: H. Riebler, Identifikation und Wiederherstellung von kryptographischen Schlüsseln mit FPGAs, Universität Paderborn, 2013. date_created: 2017-10-17T12:42:34Z date_updated: 2022-01-06T07:01:46Z department: - _id: '27' - _id: '518' keyword: - coldboot language: - iso: ger project: - _id: '1' name: SFB 901 - _id: '13' name: SFB 901 - Subprojekt C1 - _id: '14' name: SFB 901 - Subprojekt C2 - _id: '4' name: SFB 901 - Project Area C publisher: Universität Paderborn status: public title: Identifikation und Wiederherstellung von kryptographischen Schlüsseln mit FPGAs type: mastersthesis user_id: '477' year: '2013' ... --- _id: '522' author: - first_name: Matthias full_name: Feldotto, Matthias id: '14052' last_name: Feldotto orcid: 0000-0003-1348-6516 citation: ama: 'Feldotto M. HSkip+: A Self-Stabilizing Overlay Network for Nodes with Heterogeneous Bandwidths. Universität Paderborn; 2013.' apa: 'Feldotto, M. (2013). HSkip+: A Self-Stabilizing Overlay Network for Nodes with Heterogeneous Bandwidths. Universität Paderborn.' bibtex: '@book{Feldotto_2013, title={HSkip+: A Self-Stabilizing Overlay Network for Nodes with Heterogeneous Bandwidths}, publisher={Universität Paderborn}, author={Feldotto, Matthias}, year={2013} }' chicago: 'Feldotto, Matthias. HSkip+: A Self-Stabilizing Overlay Network for Nodes with Heterogeneous Bandwidths. Universität Paderborn, 2013.' ieee: 'M. Feldotto, HSkip+: A Self-Stabilizing Overlay Network for Nodes with Heterogeneous Bandwidths. Universität Paderborn, 2013.' mla: 'Feldotto, Matthias. HSkip+: A Self-Stabilizing Overlay Network for Nodes with Heterogeneous Bandwidths. Universität Paderborn, 2013.' short: 'M. Feldotto, HSkip+: A Self-Stabilizing Overlay Network for Nodes with Heterogeneous Bandwidths, Universität Paderborn, 2013.' date_created: 2017-10-17T12:42:34Z date_updated: 2022-01-06T07:01:47Z department: - _id: '79' project: - _id: '1' name: SFB 901 - _id: '2' name: SFB 901 - Teilprojekt A - _id: '5' name: SFB 901 - Subprojekt A1 publisher: Universität Paderborn status: public supervisor: - first_name: Christian full_name: Scheideler, Christian id: '20792' last_name: Scheideler title: 'HSkip+: A Self-Stabilizing Overlay Network for Nodes with Heterogeneous Bandwidths' type: mastersthesis user_id: '14052' year: '2013' ... --- _id: '523' abstract: - lang: eng text: In a distributed system with attacks and defenses, both attackers and defenders are self-interested entities. We assume a reward-sharing scheme among interdependent defenders; each defender wishes to (locally) maximize her own total fair share to the attackers extinguished due to her involvement (and possibly due to those of others). What is the maximum amount of protection achievable by a number of such defenders against a number of attackers while the system is in a Nash equilibrium? As a measure of system protection, we adopt the Defense-Ratio (Mavronicolas et al., 2008)[20], which provides the expected (inverse) proportion of attackers caught by the defenders. In a Defense-Optimal Nash equilibrium, the Defense-Ratio matches a simple lower bound.We discover that the existence of Defense-Optimal Nash equilibria depends in a subtle way on how the number of defenders compares to two natural graph-theoretic thresholds we identify. In this vein, we obtain, through a combinatorial analysis of Nash equilibria, a collection of trade-off results:• When the number of defenders is either sufficiently small or sufficiently large, Defense-Optimal Nash equilibria may exist. The corresponding decision problem is computationally tractable for a large number of defenders; the problem becomes NPNP-complete for a small number of defenders and the intractability is inherited from a previously unconsidered combinatorial problem in Fractional Graph Theory.• Perhaps paradoxically, there is a middle range of values for the number of defenders where Defense-Optimal Nash equilibria do not exist. author: - first_name: Marios full_name: Mavronicolas, Marios last_name: Mavronicolas - first_name: Burkhard full_name: Monien, Burkhard last_name: Monien - first_name: Vicky full_name: Papadopoulou Lesta, Vicky last_name: Papadopoulou Lesta citation: ama: Mavronicolas M, Monien B, Papadopoulou Lesta V. How many attackers can selfish defenders catch? Discrete Applied Mathematics. 2013;161(16-17):2563-2586. doi:10.1016/j.dam.2013.05.022 apa: Mavronicolas, M., Monien, B., & Papadopoulou Lesta, V. (2013). How many attackers can selfish defenders catch? Discrete Applied Mathematics, 161(16–17), 2563–2586. https://doi.org/10.1016/j.dam.2013.05.022 bibtex: '@article{Mavronicolas_Monien_Papadopoulou Lesta_2013, title={How many attackers can selfish defenders catch?}, volume={161}, DOI={10.1016/j.dam.2013.05.022}, number={16–17}, journal={Discrete Applied Mathematics}, publisher={Elsevier}, author={Mavronicolas, Marios and Monien, Burkhard and Papadopoulou Lesta, Vicky}, year={2013}, pages={2563–2586} }' chicago: 'Mavronicolas, Marios, Burkhard Monien, and Vicky Papadopoulou Lesta. “How Many Attackers Can Selfish Defenders Catch?” Discrete Applied Mathematics 161, no. 16–17 (2013): 2563–86. https://doi.org/10.1016/j.dam.2013.05.022.' ieee: M. Mavronicolas, B. Monien, and V. Papadopoulou Lesta, “How many attackers can selfish defenders catch?,” Discrete Applied Mathematics, vol. 161, no. 16–17, pp. 2563–2586, 2013. mla: Mavronicolas, Marios, et al. “How Many Attackers Can Selfish Defenders Catch?” Discrete Applied Mathematics, vol. 161, no. 16–17, Elsevier, 2013, pp. 2563–86, doi:10.1016/j.dam.2013.05.022. short: M. Mavronicolas, B. Monien, V. Papadopoulou Lesta, Discrete Applied Mathematics 161 (2013) 2563–2586. date_created: 2017-10-17T12:42:34Z date_updated: 2022-01-06T07:01:47Z ddc: - '040' doi: 10.1016/j.dam.2013.05.022 file: - access_level: closed content_type: application/pdf creator: florida date_created: 2018-03-15T10:37:35Z date_updated: 2018-03-15T10:37:35Z file_id: '1297' file_name: 523-MMP13.pdf file_size: 1127543 relation: main_file success: 1 file_date_updated: 2018-03-15T10:37:35Z has_accepted_license: '1' intvolume: ' 161' issue: 16-17 language: - iso: eng page: 2563-2586 project: - _id: '1' name: SFB 901 - _id: '7' name: SFB 901 - Subprojekt A3 - _id: '2' name: SFB 901 - Project Area A publication: Discrete Applied Mathematics publisher: Elsevier status: public title: How many attackers can selfish defenders catch? type: journal_article user_id: '42447' volume: 161 year: '2013' ... --- _id: '524' abstract: - lang: eng text: 'We study the complexity theory for the local distributed setting introduced by Korman, Peleg and Fraigniaud. They have defined three complexity classes LD (Local Decision), NLD (Nondeterministic Local Decision) and NLD^#n. The class LD consists of all languages which can be decided with a constant number of communication rounds. The class NLD consists of all languages which can be verified by a nondeterministic algorithm with a constant number of communication rounds. In order to define the nondeterministic classes, they have transferred the notation of nondeterminism into the distributed setting by the use of certificates and verifiers. The class NLD^#n consists of all languages which can be verified by a nondeterministic algorithm where each node has access to an oracle for the number of nodes. They have shown the hierarchy LD subset NLD subset NLD^#n. Our main contributions are strict hierarchies within the classes defined by Korman, Peleg and Fraigniaud. We define additional complexity classes: the class LD(t) consists of all languages which can be decided with at most t communication rounds. The class NLD-O(f) consists of all languages which can be verified by a local verifier such that the size of the certificates that are needed to verify the language are bounded by a function from O(f). Our main results are refined strict hierarchies within these nondeterministic classes.' author: - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm id: '15523' last_name: Meyer auf der Heide - first_name: Kamil full_name: Swirkot, Kamil last_name: Swirkot citation: ama: Meyer auf der Heide F, Swirkot K. Hierarchies in Local Distributed Decision. 2013. apa: Meyer auf der Heide, F., & Swirkot, K. (2013). Hierarchies in Local Distributed Decision. arXiv. bibtex: '@article{Meyer auf der Heide_Swirkot_2013, title={Hierarchies in Local Distributed Decision}, publisher={arXiv}, author={Meyer auf der Heide, Friedhelm and Swirkot, Kamil}, year={2013} }' chicago: Meyer auf der Heide, Friedhelm, and Kamil Swirkot. “Hierarchies in Local Distributed Decision.” arXiv, 2013. ieee: F. Meyer auf der Heide and K. Swirkot, “Hierarchies in Local Distributed Decision.” arXiv, 2013. mla: Meyer auf der Heide, Friedhelm, and Kamil Swirkot. Hierarchies in Local Distributed Decision. arXiv, 2013. short: F. Meyer auf der Heide, K. Swirkot, (2013). date_created: 2017-10-17T12:42:34Z date_updated: 2022-01-06T07:01:48Z ddc: - '040' department: - _id: '63' external_id: arxiv: - '1311.7229' file: - access_level: closed content_type: application/pdf creator: florida date_created: 2018-03-15T10:37:07Z date_updated: 2018-03-15T10:37:07Z file_id: '1296' file_name: 524-paper_01.pdf file_size: 534906 relation: main_file success: 1 file_date_updated: 2018-03-15T10:37:07Z has_accepted_license: '1' language: - iso: eng project: - _id: '1' name: SFB 901 - _id: '5' name: SFB 901 - Subprojekt A1 - _id: '2' name: SFB 901 - Project Area A publisher: arXiv status: public title: Hierarchies in Local Distributed Decision type: preprint user_id: '15415' year: '2013' ... --- _id: '525' author: - first_name: Tim full_name: Niklas Vinkemeier, Tim last_name: Niklas Vinkemeier citation: ama: Niklas Vinkemeier T. Haptics - Hadoop Performance Testing in Concurrent Job Scenarios. Universität Paderborn; 2013. apa: Niklas Vinkemeier, T. (2013). Haptics - Hadoop performance testing in concurrent job scenarios. Universität Paderborn. bibtex: '@book{Niklas Vinkemeier_2013, title={Haptics - Hadoop performance testing in concurrent job scenarios}, publisher={Universität Paderborn}, author={Niklas Vinkemeier, Tim}, year={2013} }' chicago: Niklas Vinkemeier, Tim. Haptics - Hadoop Performance Testing in Concurrent Job Scenarios. Universität Paderborn, 2013. ieee: T. Niklas Vinkemeier, Haptics - Hadoop performance testing in concurrent job scenarios. Universität Paderborn, 2013. mla: Niklas Vinkemeier, Tim. Haptics - Hadoop Performance Testing in Concurrent Job Scenarios. Universität Paderborn, 2013. short: T. Niklas Vinkemeier, Haptics - Hadoop Performance Testing in Concurrent Job Scenarios, Universität Paderborn, 2013. date_created: 2017-10-17T12:42:34Z date_updated: 2022-01-06T07:01:48Z department: - _id: '75' 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: Haptics - Hadoop performance testing in concurrent job scenarios type: bachelorsthesis user_id: '15504' year: '2013' ... --- _id: '526' author: - first_name: Alexander full_name: Mäcker, Alexander id: '13536' last_name: Mäcker citation: ama: Mäcker A. Greedy Network Creation With Heavy And Light Edges. Universität Paderborn; 2013. apa: Mäcker, A. (2013). Greedy Network Creation With Heavy And Light Edges. Universität Paderborn. bibtex: '@book{Mäcker_2013, title={Greedy Network Creation With Heavy And Light Edges}, publisher={Universität Paderborn}, author={Mäcker, Alexander}, year={2013} }' chicago: Mäcker, Alexander. Greedy Network Creation With Heavy And Light Edges. Universität Paderborn, 2013. ieee: A. Mäcker, Greedy Network Creation With Heavy And Light Edges. Universität Paderborn, 2013. mla: Mäcker, Alexander. Greedy Network Creation With Heavy And Light Edges. Universität Paderborn, 2013. short: A. Mäcker, Greedy Network Creation With Heavy And Light Edges, Universität Paderborn, 2013. date_created: 2017-10-17T12:42:35Z date_updated: 2022-01-06T07:01:48Z 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: Greedy Network Creation With Heavy And Light Edges type: mastersthesis user_id: '15504' year: '2013' ... --- _id: '527' abstract: - lang: eng text: 'In the future vision of software engineering, services from world-wide markets are composed automated in order to build custom-made systems.Supporting such scenarios requires an adequate service matching approach.Many existing approaches do not fulfill two key requirements of emerging concepts like On-The-Fly-Computing, namely (1) comprehensiveness, i.e., the consideration of different service aspects that cover not only functional properties, but also non-functional properties and (2) fuzzy matching, i.e., the ability to deliver gradual results in order to cope with a certain extent of uncertainty, incompleteness, and tolerance ranges.In this paper, I present a fuzzy matching process that distinguishes between different fuzziness sources and leverages fuzziness in different matching steps which consider different service aspects, e.g., behavior and quality properties. ' author: - first_name: Marie full_name: Christin Platenius, Marie last_name: Christin Platenius citation: ama: 'Christin Platenius M. Fuzzy Service Matching in On-The-Fly Computing. In: Proceedings of the Doctoral Symposium of the 9th Joint Meeting of the European Software Engineering Conference (ESEC) and the ACM SIGSOFT Symposium on the Foundations of Software Engineering (FSE). ; 2013:715-718. doi:10.1145/2491411.2492405' apa: Christin Platenius, M. (2013). Fuzzy Service Matching in On-The-Fly Computing. In Proceedings of the Doctoral Symposium of the 9th joint meeting of the European Software Engineering Conference (ESEC) and the ACM SIGSOFT Symposium on the Foundations of Software Engineering (FSE) (pp. 715–718). https://doi.org/10.1145/2491411.2492405 bibtex: '@inproceedings{Christin Platenius_2013, title={Fuzzy Service Matching in On-The-Fly Computing}, DOI={10.1145/2491411.2492405}, booktitle={Proceedings of the Doctoral Symposium of the 9th joint meeting of the European Software Engineering Conference (ESEC) and the ACM SIGSOFT Symposium on the Foundations of Software Engineering (FSE)}, author={Christin Platenius, Marie}, year={2013}, pages={715–718} }' chicago: Christin Platenius, Marie. “Fuzzy Service Matching in On-The-Fly Computing.” In Proceedings of the Doctoral Symposium of the 9th Joint Meeting of the European Software Engineering Conference (ESEC) and the ACM SIGSOFT Symposium on the Foundations of Software Engineering (FSE), 715–18, 2013. https://doi.org/10.1145/2491411.2492405. ieee: M. Christin Platenius, “Fuzzy Service Matching in On-The-Fly Computing,” in Proceedings of the Doctoral Symposium of the 9th joint meeting of the European Software Engineering Conference (ESEC) and the ACM SIGSOFT Symposium on the Foundations of Software Engineering (FSE), 2013, pp. 715–718. mla: Christin Platenius, Marie. “Fuzzy Service Matching in On-The-Fly Computing.” Proceedings of the Doctoral Symposium of the 9th Joint Meeting of the European Software Engineering Conference (ESEC) and the ACM SIGSOFT Symposium on the Foundations of Software Engineering (FSE), 2013, pp. 715–18, doi:10.1145/2491411.2492405. short: 'M. Christin Platenius, in: Proceedings of the Doctoral Symposium of the 9th Joint Meeting of the European Software Engineering Conference (ESEC) and the ACM SIGSOFT Symposium on the Foundations of Software Engineering (FSE), 2013, pp. 715–718.' date_created: 2017-10-17T12:42:35Z date_updated: 2022-01-06T07:01:48Z ddc: - '040' department: - _id: '76' doi: 10.1145/2491411.2492405 file: - access_level: closed content_type: application/pdf creator: florida date_created: 2018-03-15T10:36:38Z date_updated: 2018-03-15T10:36:38Z file_id: '1295' file_name: 527-p715-platenius.pdf file_size: 730490 relation: main_file success: 1 file_date_updated: 2018-03-15T10:36:38Z has_accepted_license: '1' language: - iso: eng page: ' 715-718 ' 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 Doctoral Symposium of the 9th joint meeting of the European Software Engineering Conference (ESEC) and the ACM SIGSOFT Symposium on the Foundations of Software Engineering (FSE) status: public title: Fuzzy Service Matching in On-The-Fly Computing type: conference user_id: '477' year: '2013' ... --- _id: '529' abstract: - lang: eng text: Mechatronic systems reconfigure the structure of their software architecture, e.g., to avoid hazardous situations or to optimize operational conditions like minimizing their energy consumption. As software architectures are typically build on components, reconfiguration actions need to respect the component structure. This structure should be hierarchical to enable encapsulated components. While many reconfiguration approaches for embedded real-time systems allow the use of hierarchically embedded components, i.e., horizontal composition, none of them offers a modeling and verification solution to take hierarchical composition, i.e., encapsulation, into account. In this paper, we present an extension to our existing modeling language, MechatronicUML, to enable safe hierarchical reconfigurations. The two main extensions are (a) an adapted variant of the two-phase commit protocol to initiate reconfigurations which maintain component encapsulation and (b) a timed model checking verification approach for instances of our model. We illustrate our approach on a case study in the area of smart railway systems by showing two different use cases of our approach and the verification of their safety properties. author: - first_name: Christian full_name: Heinzemann, Christian last_name: Heinzemann - first_name: Steffen full_name: Becker, Steffen last_name: Becker citation: ama: 'Heinzemann C, Becker S. Executing Reconfigurations in Hierarchical Component Architectures. In: Proceedings of the 16th International ACM SigSoft Symposium on Component-Based Software Engineering (CBSE). ; 2013:3-12. doi:10.1145/2465449.2465452' apa: Heinzemann, C., & Becker, S. (2013). Executing Reconfigurations in Hierarchical Component Architectures. In Proceedings of the 16th International ACM SigSoft Symposium on Component-Based Software Engineering (CBSE) (pp. 3–12). https://doi.org/10.1145/2465449.2465452 bibtex: '@inproceedings{Heinzemann_Becker_2013, title={Executing Reconfigurations in Hierarchical Component Architectures}, DOI={10.1145/2465449.2465452}, booktitle={Proceedings of the 16th International ACM SigSoft Symposium on Component-Based Software Engineering (CBSE)}, author={Heinzemann, Christian and Becker, Steffen}, year={2013}, pages={3–12} }' chicago: Heinzemann, Christian, and Steffen Becker. “Executing Reconfigurations in Hierarchical Component Architectures.” In Proceedings of the 16th International ACM SigSoft Symposium on Component-Based Software Engineering (CBSE), 3–12, 2013. https://doi.org/10.1145/2465449.2465452. ieee: C. Heinzemann and S. Becker, “Executing Reconfigurations in Hierarchical Component Architectures,” in Proceedings of the 16th International ACM SigSoft Symposium on Component-Based Software Engineering (CBSE), 2013, pp. 3–12. mla: Heinzemann, Christian, and Steffen Becker. “Executing Reconfigurations in Hierarchical Component Architectures.” Proceedings of the 16th International ACM SigSoft Symposium on Component-Based Software Engineering (CBSE), 2013, pp. 3–12, doi:10.1145/2465449.2465452. short: 'C. Heinzemann, S. Becker, in: Proceedings of the 16th International ACM SigSoft Symposium on Component-Based Software Engineering (CBSE), 2013, pp. 3–12.' date_created: 2017-10-17T12:42:35Z date_updated: 2022-01-06T07:01:49Z ddc: - '040' doi: 10.1145/2465449.2465452 file: - access_level: closed content_type: application/pdf creator: florida date_created: 2018-03-15T10:35:39Z date_updated: 2018-03-15T10:35:39Z file_id: '1293' file_name: 529-p3-heinzemann.pdf file_size: 541849 relation: main_file success: 1 file_date_updated: 2018-03-15T10:35:39Z has_accepted_license: '1' page: 3-12 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 16th International ACM SigSoft Symposium on Component-Based Software Engineering (CBSE) status: public title: Executing Reconfigurations in Hierarchical Component Architectures type: conference user_id: '15504' year: '2013' ... --- _id: '530' author: - first_name: Dominik full_name: Buse, Dominik last_name: Buse citation: ama: Buse D. Entwurf Kooperativer Verhaltensweisen Heterogener Roboter. Universität Paderborn; 2013. apa: Buse, D. (2013). Entwurf kooperativer Verhaltensweisen heterogener Roboter. Universität Paderborn. bibtex: '@book{Buse_2013, title={Entwurf kooperativer Verhaltensweisen heterogener Roboter}, publisher={Universität Paderborn}, author={Buse, Dominik}, year={2013} }' chicago: Buse, Dominik. Entwurf Kooperativer Verhaltensweisen Heterogener Roboter. Universität Paderborn, 2013. ieee: D. Buse, Entwurf kooperativer Verhaltensweisen heterogener Roboter. Universität Paderborn, 2013. mla: Buse, Dominik. Entwurf Kooperativer Verhaltensweisen Heterogener Roboter. Universität Paderborn, 2013. short: D. Buse, Entwurf Kooperativer Verhaltensweisen Heterogener Roboter, Universität Paderborn, 2013. date_created: 2017-10-17T12:42:35Z date_updated: 2022-01-06T07:01:49Z project: - _id: '1' name: SFB 901 - _id: '10' name: SFB 901 - Subprojekt B2 - _id: '3' name: SFB 901 - Project Area B publisher: Universität Paderborn status: public title: Entwurf kooperativer Verhaltensweisen heterogener Roboter type: bachelorsthesis user_id: '15504' year: '2013' ... --- _id: '531' author: - first_name: Sascha full_name: Lutters, Sascha last_name: Lutters citation: ama: Lutters S. Entwurf eines datenschutzgerechten Reputationssystems. Universität Paderborn; 2013. apa: Lutters, S. (2013). Entwurf eines datenschutzgerechten Reputationssystems. Universität Paderborn. bibtex: '@book{Lutters_2013, title={Entwurf eines datenschutzgerechten Reputationssystems}, publisher={Universität Paderborn}, author={Lutters, Sascha}, year={2013} }' chicago: Lutters, Sascha. Entwurf eines datenschutzgerechten Reputationssystems. Universität Paderborn, 2013. ieee: S. Lutters, Entwurf eines datenschutzgerechten Reputationssystems. Universität Paderborn, 2013. mla: Lutters, Sascha. Entwurf eines datenschutzgerechten Reputationssystems. Universität Paderborn, 2013. short: S. Lutters, Entwurf eines datenschutzgerechten Reputationssystems, Universität Paderborn, 2013. date_created: 2017-10-17T12:42:35Z date_updated: 2022-01-06T07:01:49Z 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: Entwurf eines datenschutzgerechten Reputationssystems type: mastersthesis user_id: '477' year: '2013' ... --- _id: '532' author: - first_name: Hendrik full_name: Hilleckes, Hendrik last_name: Hilleckes citation: ama: Hilleckes H. Entwicklung und Analyse einer verteilten Speicherverwaltung für dynamische heterogene Speichersysteme. Universität Paderborn; 2013. apa: Hilleckes, H. (2013). Entwicklung und Analyse einer verteilten Speicherverwaltung für dynamische heterogene Speichersysteme. Universität Paderborn. bibtex: '@book{Hilleckes_2013, title={Entwicklung und Analyse einer verteilten Speicherverwaltung für dynamische heterogene Speichersysteme}, publisher={Universität Paderborn}, author={Hilleckes, Hendrik}, year={2013} }' chicago: Hilleckes, Hendrik. Entwicklung und Analyse einer verteilten Speicherverwaltung für dynamische heterogene Speichersysteme. Universität Paderborn, 2013. ieee: H. Hilleckes, Entwicklung und Analyse einer verteilten Speicherverwaltung für dynamische heterogene Speichersysteme. Universität Paderborn, 2013. mla: Hilleckes, Hendrik. Entwicklung und Analyse einer verteilten Speicherverwaltung für dynamische heterogene Speichersysteme. Universität Paderborn, 2013. short: H. Hilleckes, Entwicklung und Analyse einer verteilten Speicherverwaltung für dynamische heterogene Speichersysteme, Universität Paderborn, 2013. date_created: 2017-10-17T12:42:36Z date_updated: 2022-01-06T07:01:49Z 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: Entwicklung und Analyse einer verteilten Speicherverwaltung für dynamische heterogene Speichersysteme type: bachelorsthesis user_id: '477' year: '2013' ... --- _id: '533' author: - first_name: Richard full_name: Borkowski, Richard last_name: Borkowski citation: ama: Borkowski R. Entwicklung eines Hybriden Planers zur verhaltensorientierten Selbstoptimierung. Universität Paderborn; 2013. apa: Borkowski, R. (2013). Entwicklung eines Hybriden Planers zur verhaltensorientierten Selbstoptimierung. Universität Paderborn. bibtex: '@book{Borkowski_2013, title={Entwicklung eines Hybriden Planers zur verhaltensorientierten Selbstoptimierung}, publisher={Universität Paderborn}, author={Borkowski, Richard}, year={2013} }' chicago: Borkowski, Richard. Entwicklung eines Hybriden Planers zur verhaltensorientierten Selbstoptimierung. Universität Paderborn, 2013. ieee: R. Borkowski, Entwicklung eines Hybriden Planers zur verhaltensorientierten Selbstoptimierung. Universität Paderborn, 2013. mla: Borkowski, Richard. Entwicklung eines Hybriden Planers zur verhaltensorientierten Selbstoptimierung. Universität Paderborn, 2013. short: R. Borkowski, Entwicklung eines Hybriden Planers zur verhaltensorientierten Selbstoptimierung, Universität Paderborn, 2013. date_created: 2017-10-17T12:42:36Z date_updated: 2022-01-06T07:01:49Z language: - iso: ger project: - _id: '1' name: SFB 901 - _id: '10' name: SFB 901 - Subprojekt B2 - _id: '3' name: SFB 901 - Project Area B publisher: Universität Paderborn status: public title: Entwicklung eines Hybriden Planers zur verhaltensorientierten Selbstoptimierung type: bachelorsthesis user_id: '477' year: '2013' ... --- _id: '534' author: - first_name: Suhas full_name: Satya, Suhas last_name: Satya citation: ama: Satya S. Emulating Wavelength Division Multiplexing Using Openflow. Universität Paderborn; 2013. apa: Satya, S. (2013). Emulating Wavelength Division Multiplexing using Openflow. Universität Paderborn. bibtex: '@book{Satya_2013, title={Emulating Wavelength Division Multiplexing using Openflow}, publisher={Universität Paderborn}, author={Satya, Suhas}, year={2013} }' chicago: Satya, Suhas. Emulating Wavelength Division Multiplexing Using Openflow. Universität Paderborn, 2013. ieee: S. Satya, Emulating Wavelength Division Multiplexing using Openflow. Universität Paderborn, 2013. mla: Satya, Suhas. Emulating Wavelength Division Multiplexing Using Openflow. Universität Paderborn, 2013. short: S. Satya, Emulating Wavelength Division Multiplexing Using Openflow, Universität Paderborn, 2013. date_created: 2017-10-17T12:42:36Z date_updated: 2022-01-06T07:01:50Z department: - _id: '75' 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: Emulating Wavelength Division Multiplexing using Openflow type: mastersthesis user_id: '15504' year: '2013' ... --- _id: '535' author: - first_name: Max full_name: Reineke, Max last_name: Reineke citation: ama: Reineke M. Effizienzsteigerung durch gewichtete Produktbewertungen. Universität Paderborn; 2013. apa: Reineke, M. (2013). Effizienzsteigerung durch gewichtete Produktbewertungen. Universität Paderborn. bibtex: '@book{Reineke_2013, title={Effizienzsteigerung durch gewichtete Produktbewertungen}, publisher={Universität Paderborn}, author={Reineke, Max}, year={2013} }' chicago: Reineke, Max. Effizienzsteigerung durch gewichtete Produktbewertungen. Universität Paderborn, 2013. ieee: M. Reineke, Effizienzsteigerung durch gewichtete Produktbewertungen. Universität Paderborn, 2013. mla: Reineke, Max. Effizienzsteigerung durch gewichtete Produktbewertungen. Universität Paderborn, 2013. short: M. Reineke, Effizienzsteigerung durch gewichtete Produktbewertungen, Universität Paderborn, 2013. date_created: 2017-10-17T12:42:36Z date_updated: 2022-01-06T07:01:50Z 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: Effizienzsteigerung durch gewichtete Produktbewertungen type: mastersthesis user_id: '477' year: '2013' ... --- _id: '536' author: - first_name: Nadja full_name: Stroh-Maraun, Nadja id: '13264' last_name: Stroh-Maraun citation: ama: 'Stroh-Maraun N. Dynamic One-to-One Matching: Theory and a Job Market Application. Universität Paderborn; 2013.' apa: 'Stroh-Maraun, N. (2013). Dynamic One-to-One Matching: Theory and a Job Market Application. Universität Paderborn.' bibtex: '@book{Stroh-Maraun_2013, title={Dynamic One-to-One Matching: Theory and a Job Market Application}, publisher={Universität Paderborn}, author={Stroh-Maraun, Nadja}, year={2013} }' chicago: 'Stroh-Maraun, Nadja. Dynamic One-to-One Matching: Theory and a Job Market Application. Universität Paderborn, 2013.' ieee: 'N. Stroh-Maraun, Dynamic One-to-One Matching: Theory and a Job Market Application. Universität Paderborn, 2013.' mla: 'Stroh-Maraun, Nadja. Dynamic One-to-One Matching: Theory and a Job Market Application. Universität Paderborn, 2013.' short: 'N. Stroh-Maraun, Dynamic One-to-One Matching: Theory and a Job Market Application, Universität Paderborn, 2013.' date_created: 2017-10-17T12:42:36Z date_updated: 2022-01-06T07:01:50Z department: - _id: '205' 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: 'Dynamic One-to-One Matching: Theory and a Job Market Application' type: mastersthesis user_id: '13264' year: '2013' ... --- _id: '537' author: - first_name: Stefan full_name: Heindorf, Stefan last_name: Heindorf citation: ama: Heindorf S. Dispersion of Multi-Robot Teams. Universität Paderborn; 2013. apa: Heindorf, S. (2013). Dispersion of Multi-Robot Teams. Universität Paderborn. bibtex: '@book{Heindorf_2013, title={Dispersion of Multi-Robot Teams}, publisher={Universität Paderborn}, author={Heindorf, Stefan}, year={2013} }' chicago: Heindorf, Stefan. Dispersion of Multi-Robot Teams. Universität Paderborn, 2013. ieee: S. Heindorf, Dispersion of Multi-Robot Teams. Universität Paderborn, 2013. mla: Heindorf, Stefan. Dispersion of Multi-Robot Teams. Universität Paderborn, 2013. short: S. Heindorf, Dispersion of Multi-Robot Teams, Universität Paderborn, 2013. date_created: 2017-10-17T12:42:37Z date_updated: 2022-01-06T07:01:50Z 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: Dispersion of Multi-Robot Teams type: mastersthesis user_id: '15504' year: '2013' ... --- _id: '538' abstract: - lang: eng text: 'We present a new technique to realize attribute-based encryption (ABE) schemes secure in the standard model against chosen-ciphertext attacks (CCA-secure). Our approach is to extend certain concrete chosen-plaintext secure (CPA-secure) ABE schemes to achieve more efficient constructions than the known generic constructions of CCA-secure ABE schemes. We restrict ourselves to the construction of attribute-based key encapsulation mechanisms (KEMs) and present two concrete CCA-secure schemes: a key-policy attribute-based KEM that is based on Goyal''s key-policy ABE and a ciphertext-policy attribute-based KEM that is based on Waters'' ciphertext-policy ABE. To achieve our goals, we use an appropriate hash function and need to extend the public parameters and the ciphertexts of the underlying CPA-secure encryption schemes only by a single group element. Moreover, we use the same hardness assumptions as the underlying CPA-secure encryption schemes.' author: - first_name: Johannes full_name: Blömer, Johannes id: '23' last_name: Blömer - first_name: Gennadij full_name: Liske, Gennadij last_name: Liske citation: ama: Blömer J, Liske G. Direct Chosen-Ciphertext Secure Attribute-Based Key Encapsulations without Random Oracles. 2013. apa: Blömer, J., & Liske, G. (2013). Direct Chosen-Ciphertext Secure Attribute-Based Key Encapsulations without Random Oracles. Universität Paderborn. bibtex: '@article{Blömer_Liske_2013, title={Direct Chosen-Ciphertext Secure Attribute-Based Key Encapsulations without Random Oracles}, publisher={Universität Paderborn}, author={Blömer, Johannes and Liske, Gennadij}, year={2013} }' chicago: Blömer, Johannes, and Gennadij Liske. “Direct Chosen-Ciphertext Secure Attribute-Based Key Encapsulations without Random Oracles.” Universität Paderborn, 2013. ieee: J. Blömer and G. Liske, “Direct Chosen-Ciphertext Secure Attribute-Based Key Encapsulations without Random Oracles.” Universität Paderborn, 2013. mla: Blömer, Johannes, and Gennadij Liske. Direct Chosen-Ciphertext Secure Attribute-Based Key Encapsulations without Random Oracles. Universität Paderborn, 2013. short: J. Blömer, G. Liske, (2013). date_created: 2017-10-17T12:42:37Z date_updated: 2022-01-06T07:01:51Z ddc: - '040' department: - _id: '64' file: - access_level: closed content_type: application/pdf creator: florida date_created: 2018-03-15T10:35:04Z date_updated: 2018-03-15T10:35:04Z file_id: '1292' file_name: 538-AB-KEM_01.pdf file_size: 389797 relation: main_file success: 1 file_date_updated: 2018-03-15T10:35:04Z has_accepted_license: '1' main_file_link: - open_access: '1' url: https://eprint.iacr.org/2013/646 oa: '1' project: - _id: '1' name: SFB 901 - _id: '13' name: SFB 901 - Subprojekt C1 - _id: '4' name: SFB 901 - Project Area C - _id: '43' name: Securing the Financial Cloud publisher: Universität Paderborn status: public title: Direct Chosen-Ciphertext Secure Attribute-Based Key Encapsulations without Random Oracles type: preprint user_id: '25078' year: '2013' ... --- _id: '539' author: - first_name: Tobias full_name: Kornhoff, Tobias last_name: Kornhoff citation: ama: Kornhoff T. Der Einfluss adaptierter Erwartungen in dynamischen Cournot Oligopolen. Universität Paderborn; 2013. apa: Kornhoff, T. (2013). Der Einfluss adaptierter Erwartungen in dynamischen Cournot Oligopolen. Universität Paderborn. bibtex: '@book{Kornhoff_2013, title={Der Einfluss adaptierter Erwartungen in dynamischen Cournot Oligopolen}, publisher={Universität Paderborn}, author={Kornhoff, Tobias}, year={2013} }' chicago: Kornhoff, Tobias. Der Einfluss adaptierter Erwartungen in dynamischen Cournot Oligopolen. Universität Paderborn, 2013. ieee: T. Kornhoff, Der Einfluss adaptierter Erwartungen in dynamischen Cournot Oligopolen. Universität Paderborn, 2013. mla: Kornhoff, Tobias. Der Einfluss adaptierter Erwartungen in dynamischen Cournot Oligopolen. Universität Paderborn, 2013. short: T. Kornhoff, Der Einfluss adaptierter Erwartungen in dynamischen Cournot Oligopolen, Universität Paderborn, 2013. date_created: 2017-10-17T12:42:37Z date_updated: 2022-01-06T07:01:51Z 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: Der Einfluss adaptierter Erwartungen in dynamischen Cournot Oligopolen type: bachelorsthesis user_id: '477' year: '2013' ... --- _id: '541' abstract: - lang: eng text: Existing solutions for gossip-based aggregation in peer-to-peer networks use epochs to calculate a global estimation from an initial static set of local values. Once the estimation converges system-wide, a new epoch is started with fresh initial values. Long epochs result in precise estimations based on old measurements and short epochs result in imprecise aggregated estimations. In contrast to this approach, we present in this paper a continuous, epoch-less approach which considers fresh local values in every round of the gossip-based aggregation. By using an approach for dynamic information aging, inaccurate values and values from left peers fade from the aggregation memory. Evaluation shows that the presented approach for continuous information aggregation in peer-to-peer systems monitors the system performance precisely, adapts to changes and is lightweight to operate. author: - first_name: Kalman full_name: Graffi, Kalman last_name: Graffi - first_name: Vitaly full_name: Rapp, Vitaly last_name: Rapp citation: ama: 'Graffi K, Rapp V. Continuous Gossip-based Aggregation through Dynamic Information Aging. In: Proceedings of the International Conference on Computer Communications and Networks (ICCCN’13). ; 2013:1-7. doi:10.1109/ICCCN.2013.6614118' apa: Graffi, K., & Rapp, V. (2013). Continuous Gossip-based Aggregation through Dynamic Information Aging. In Proceedings of the International Conference on Computer Communications and Networks (ICCCN’13) (pp. 1–7). https://doi.org/10.1109/ICCCN.2013.6614118 bibtex: '@inproceedings{Graffi_Rapp_2013, title={Continuous Gossip-based Aggregation through Dynamic Information Aging}, DOI={10.1109/ICCCN.2013.6614118}, booktitle={Proceedings of the International Conference on Computer Communications and Networks (ICCCN’13)}, author={Graffi, Kalman and Rapp, Vitaly}, year={2013}, pages={1–7} }' chicago: Graffi, Kalman, and Vitaly Rapp. “Continuous Gossip-Based Aggregation through Dynamic Information Aging.” In Proceedings of the International Conference on Computer Communications and Networks (ICCCN’13), 1–7, 2013. https://doi.org/10.1109/ICCCN.2013.6614118. ieee: K. Graffi and V. Rapp, “Continuous Gossip-based Aggregation through Dynamic Information Aging,” in Proceedings of the International Conference on Computer Communications and Networks (ICCCN’13), 2013, pp. 1–7. mla: Graffi, Kalman, and Vitaly Rapp. “Continuous Gossip-Based Aggregation through Dynamic Information Aging.” Proceedings of the International Conference on Computer Communications and Networks (ICCCN’13), 2013, pp. 1–7, doi:10.1109/ICCCN.2013.6614118. short: 'K. Graffi, V. Rapp, in: Proceedings of the International Conference on Computer Communications and Networks (ICCCN’13), 2013, pp. 1–7.' date_created: 2017-10-17T12:42:37Z date_updated: 2022-01-06T07:01:52Z ddc: - '040' department: - _id: '79' doi: 10.1109/ICCCN.2013.6614118 file: - access_level: closed content_type: application/pdf creator: florida date_created: 2018-03-15T10:33:20Z date_updated: 2018-03-15T10:33:20Z file_id: '1290' file_name: 541-Continuous.Gossip.based.Aggregation.Through.Dynamic.Information.Aging.pdf file_size: 272960 relation: main_file success: 1 file_date_updated: 2018-03-15T10:33:20Z has_accepted_license: '1' language: - iso: eng page: 1-7 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 International Conference on Computer Communications and Networks (ICCCN'13) status: public title: Continuous Gossip-based Aggregation through Dynamic Information Aging type: conference user_id: '477' year: '2013' ... --- _id: '542' abstract: - lang: eng text: 'We consider the problem of managing a dynamic heterogeneous storagesystem in a distributed way so that the amount of data assigned to a hostin that system is related to its capacity. Two central problems have to be solvedfor this: (1) organizing the hosts in an overlay network with low degree and diameterso that one can efficiently check the correct distribution of the data androute between any two hosts, and (2) distributing the data among the hosts so thatthe distribution respects the capacities of the hosts and can easily be adapted asthe set of hosts or their capacities change. We present distributed protocols forthese problems that are self-stabilizing and that do not need any global knowledgeabout the system such as the number of nodes or the overall capacity of thesystem. Prior to this work no solution was known satisfying these properties.' author: - first_name: Sebastian full_name: Kniesburges, Sebastian last_name: Kniesburges - first_name: Andreas full_name: Koutsopoulos, Andreas last_name: Koutsopoulos - first_name: Christian full_name: Scheideler, Christian id: '20792' last_name: Scheideler citation: ama: 'Kniesburges S, Koutsopoulos A, Scheideler C. CONE-DHT: A distributed self-stabilizing algorithm for a heterogeneous storage system. In: Proceedings of the 27th International Symposium on Distributed Computing (DISC). LNCS. ; 2013:537-549. doi:10.1007/978-3-642-41527-2_37' apa: 'Kniesburges, S., Koutsopoulos, A., & Scheideler, C. (2013). CONE-DHT: A distributed self-stabilizing algorithm for a heterogeneous storage system. In Proceedings of the 27th International Symposium on Distributed Computing (DISC) (pp. 537–549). https://doi.org/10.1007/978-3-642-41527-2_37' bibtex: '@inproceedings{Kniesburges_Koutsopoulos_Scheideler_2013, series={LNCS}, title={CONE-DHT: A distributed self-stabilizing algorithm for a heterogeneous storage system}, DOI={10.1007/978-3-642-41527-2_37}, booktitle={Proceedings of the 27th International Symposium on Distributed Computing (DISC)}, author={Kniesburges, Sebastian and Koutsopoulos, Andreas and Scheideler, Christian}, year={2013}, pages={537–549}, collection={LNCS} }' chicago: 'Kniesburges, Sebastian, Andreas Koutsopoulos, and Christian Scheideler. “CONE-DHT: A Distributed Self-Stabilizing Algorithm for a Heterogeneous Storage System.” In Proceedings of the 27th International Symposium on Distributed Computing (DISC), 537–49. LNCS, 2013. https://doi.org/10.1007/978-3-642-41527-2_37.' ieee: 'S. Kniesburges, A. Koutsopoulos, and C. Scheideler, “CONE-DHT: A distributed self-stabilizing algorithm for a heterogeneous storage system,” in Proceedings of the 27th International Symposium on Distributed Computing (DISC), 2013, pp. 537–549.' mla: 'Kniesburges, Sebastian, et al. “CONE-DHT: A Distributed Self-Stabilizing Algorithm for a Heterogeneous Storage System.” Proceedings of the 27th International Symposium on Distributed Computing (DISC), 2013, pp. 537–49, doi:10.1007/978-3-642-41527-2_37.' short: 'S. Kniesburges, A. Koutsopoulos, C. Scheideler, in: Proceedings of the 27th International Symposium on Distributed Computing (DISC), 2013, pp. 537–549.' date_created: 2017-10-17T12:42:38Z date_updated: 2022-01-06T07:01:53Z ddc: - '040' department: - _id: '79' doi: 10.1007/978-3-642-41527-2_37 file: - access_level: closed content_type: application/pdf creator: florida date_created: 2018-03-15T10:32:48Z date_updated: 2018-03-15T10:32:48Z file_id: '1289' file_name: 542-CONE-DHT_A_distributed_self-stabilizing_algorithm_for_a_heterogeneous_storage_system.pdf file_size: 262302 relation: main_file success: 1 file_date_updated: 2018-03-15T10:32:48Z has_accepted_license: '1' page: 537-549 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 27th International Symposium on Distributed Computing (DISC) series_title: LNCS status: public title: 'CONE-DHT: A distributed self-stabilizing algorithm for a heterogeneous storage system' type: conference user_id: '15504' year: '2013' ... --- _id: '543' author: - first_name: Kavitha full_name: Jagannath, Kavitha last_name: Jagannath citation: ama: Jagannath K. Comparison of Various Contract-Based Approaches for Specifying Behavior of On-The-Fly Computing Services. Universität Paderborn; 2013. apa: Jagannath, K. (2013). Comparison of Various Contract-Based Approaches for Specifying Behavior of On-The-Fly Computing Services. Universität Paderborn. bibtex: '@book{Jagannath_2013, title={Comparison of Various Contract-Based Approaches for Specifying Behavior of On-The-Fly Computing Services}, publisher={Universität Paderborn}, author={Jagannath, Kavitha}, year={2013} }' chicago: Jagannath, Kavitha. Comparison of Various Contract-Based Approaches for Specifying Behavior of On-The-Fly Computing Services. Universität Paderborn, 2013. ieee: K. Jagannath, Comparison of Various Contract-Based Approaches for Specifying Behavior of On-The-Fly Computing Services. Universität Paderborn, 2013. mla: Jagannath, Kavitha. Comparison of Various Contract-Based Approaches for Specifying Behavior of On-The-Fly Computing Services. Universität Paderborn, 2013. short: K. Jagannath, Comparison of Various Contract-Based Approaches for Specifying Behavior of On-The-Fly Computing Services, Universität Paderborn, 2013. date_created: 2017-10-17T12:42:38Z date_updated: 2022-01-06T07:01:53Z project: - _id: '1' name: SFB 901 - _id: '9' name: SFB 901 - Subprojekt B1 - _id: '3' name: SFB 901 - Project Area B publisher: Universität Paderborn status: public title: Comparison of Various Contract-Based Approaches for Specifying Behavior of On-The-Fly Computing Services type: mastersthesis user_id: '15504' year: '2013' ... --- _id: '544' abstract: - lang: eng text: Comparative evaluations of peer-to-peer protocols through simulations are a viable approach to judge the performance and costs of the individual protocols in large-scale networks. In order to support this work, we enhanced the peer-to-peer systems simulator PeerfactSim.KOM with a fine-grained analyzer concept, with exhaustive automated measurements and gnuplot generators as well as a coordination control to evaluate a set of experiment setups in parallel. Thus, by configuring all experiments and protocols only once and starting the simulator, all desired measurements are performed, analyzed, evaluated and combined, resulting in a holistic environment for the comparative evaluation of peer-to-peer systems. author: - first_name: Matthias full_name: Feldotto, Matthias id: '14052' last_name: Feldotto orcid: 0000-0003-1348-6516 - first_name: Kalman full_name: Graffi, Kalman last_name: Graffi citation: ama: 'Feldotto M, Graffi K. Comparative Evaluation of Peer-to-Peer Systems Using PeerfactSim.KOM. In: Proceedings of the International Conference on High Performance Computing and Simulation (HPCS’13). ; 2013:99-106. doi:10.1109/HPCSim.2013.6641399' apa: Feldotto, M., & Graffi, K. (2013). Comparative Evaluation of Peer-to-Peer Systems Using PeerfactSim.KOM. In Proceedings of the International Conference on High Performance Computing and Simulation (HPCS’13) (pp. 99–106). https://doi.org/10.1109/HPCSim.2013.6641399 bibtex: '@inproceedings{Feldotto_Graffi_2013, title={Comparative Evaluation of Peer-to-Peer Systems Using PeerfactSim.KOM}, DOI={10.1109/HPCSim.2013.6641399}, booktitle={Proceedings of the International Conference on High Performance Computing and Simulation (HPCS’13)}, author={Feldotto, Matthias and Graffi, Kalman}, year={2013}, pages={99–106} }' chicago: Feldotto, Matthias, and Kalman Graffi. “Comparative Evaluation of Peer-to-Peer Systems Using PeerfactSim.KOM.” In Proceedings of the International Conference on High Performance Computing and Simulation (HPCS’13), 99–106, 2013. https://doi.org/10.1109/HPCSim.2013.6641399. ieee: M. Feldotto and K. Graffi, “Comparative Evaluation of Peer-to-Peer Systems Using PeerfactSim.KOM,” in Proceedings of the International Conference on High Performance Computing and Simulation (HPCS’13), 2013, pp. 99–106. mla: Feldotto, Matthias, and Kalman Graffi. “Comparative Evaluation of Peer-to-Peer Systems Using PeerfactSim.KOM.” Proceedings of the International Conference on High Performance Computing and Simulation (HPCS’13), 2013, pp. 99–106, doi:10.1109/HPCSim.2013.6641399. short: 'M. Feldotto, K. Graffi, in: Proceedings of the International Conference on High Performance Computing and Simulation (HPCS’13), 2013, pp. 99–106.' date_created: 2017-10-17T12:42:38Z date_updated: 2022-01-06T07:01:53Z ddc: - '040' department: - _id: '79' doi: 10.1109/HPCSim.2013.6641399 file: - access_level: closed content_type: application/pdf creator: florida date_created: 2018-03-15T10:32:17Z date_updated: 2018-03-15T10:32:17Z file_id: '1288' file_name: 544-FeldGraffi13.pdf file_size: 899441 relation: main_file success: 1 file_date_updated: 2018-03-15T10:32:17Z has_accepted_license: '1' language: - iso: eng page: 99-106 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 International Conference on High Performance Computing and Simulation (HPCS'13) status: public title: Comparative Evaluation of Peer-to-Peer Systems Using PeerfactSim.KOM type: conference user_id: '14052' year: '2013' ... --- _id: '545' author: - first_name: Fritz full_name: Blumentritt, Fritz last_name: Blumentritt citation: ama: Blumentritt F. Cliquenbildung in verteilten Systemen. Universität Paderborn; 2013. apa: Blumentritt, F. (2013). Cliquenbildung in verteilten Systemen. Universität Paderborn. bibtex: '@book{Blumentritt_2013, title={Cliquenbildung in verteilten Systemen}, publisher={Universität Paderborn}, author={Blumentritt, Fritz}, year={2013} }' chicago: Blumentritt, Fritz. Cliquenbildung in verteilten Systemen. Universität Paderborn, 2013. ieee: F. Blumentritt, Cliquenbildung in verteilten Systemen. Universität Paderborn, 2013. mla: Blumentritt, Fritz. Cliquenbildung in verteilten Systemen. Universität Paderborn, 2013. short: F. Blumentritt, Cliquenbildung in verteilten Systemen, Universität Paderborn, 2013. date_created: 2017-10-17T12:42:38Z date_updated: 2022-01-06T07:01:54Z 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: Cliquenbildung in verteilten Systemen type: bachelorsthesis user_id: '477' year: '2013' ... --- _id: '546' abstract: - lang: eng text: Self-stabilization is the property of a system to transfer itself regardless of the initial state into a legitimate state. Chord as a simple, decentralized and scalable distributed hash table is an ideal showcase to introduce self-stabilization for p2p overlays. In this paper, we present Re-Chord, a self-stabilizing version of Chord. We show, that the stabilization process is functional, but prone to strong churn. For that, we present Ca-Re-Chord, a churn resistant version of Re-Chord, that allows the creation of a useful DHT in any kind of graph regardless of the initial state. Simulation results attest the churn resistance and good performance of Ca-Re-Chord. author: - first_name: Kalman full_name: Graffi, Kalman last_name: Graffi - first_name: Markus full_name: Benter, Markus last_name: Benter - first_name: Mohammad full_name: Divband, Mohammad last_name: Divband - first_name: Sebastian full_name: Kniesburges, Sebastian last_name: Kniesburges - first_name: Andreas full_name: Koutsopoulos, Andreas last_name: Koutsopoulos citation: ama: 'Graffi K, Benter M, Divband M, Kniesburges S, Koutsopoulos A. Ca-Re-Chord: A Churn Resistant Self-stabilizing Chord Overlay Network. In: Proceedings of the Conference on Networked Systems (NetSys). ; 2013:27-34. doi:10.1109/NetSys.2013.11' apa: 'Graffi, K., Benter, M., Divband, M., Kniesburges, S., & Koutsopoulos, A. (2013). Ca-Re-Chord: A Churn Resistant Self-stabilizing Chord Overlay Network. In Proceedings of the Conference on Networked Systems (NetSys) (pp. 27–34). https://doi.org/10.1109/NetSys.2013.11' bibtex: '@inproceedings{Graffi_Benter_Divband_Kniesburges_Koutsopoulos_2013, title={Ca-Re-Chord: A Churn Resistant Self-stabilizing Chord Overlay Network}, DOI={10.1109/NetSys.2013.11}, booktitle={Proceedings of the Conference on Networked Systems (NetSys)}, author={Graffi, Kalman and Benter, Markus and Divband, Mohammad and Kniesburges, Sebastian and Koutsopoulos, Andreas}, year={2013}, pages={27–34} }' chicago: 'Graffi, Kalman, Markus Benter, Mohammad Divband, Sebastian Kniesburges, and Andreas Koutsopoulos. “Ca-Re-Chord: A Churn Resistant Self-Stabilizing Chord Overlay Network.” In Proceedings of the Conference on Networked Systems (NetSys), 27–34, 2013. https://doi.org/10.1109/NetSys.2013.11.' ieee: 'K. Graffi, M. Benter, M. Divband, S. Kniesburges, and A. Koutsopoulos, “Ca-Re-Chord: A Churn Resistant Self-stabilizing Chord Overlay Network,” in Proceedings of the Conference on Networked Systems (NetSys), 2013, pp. 27–34.' mla: 'Graffi, Kalman, et al. “Ca-Re-Chord: A Churn Resistant Self-Stabilizing Chord Overlay Network.” Proceedings of the Conference on Networked Systems (NetSys), 2013, pp. 27–34, doi:10.1109/NetSys.2013.11.' short: 'K. Graffi, M. Benter, M. Divband, S. Kniesburges, A. Koutsopoulos, in: Proceedings of the Conference on Networked Systems (NetSys), 2013, pp. 27–34.' date_created: 2017-10-17T12:42:38Z date_updated: 2022-01-06T07:01:55Z ddc: - '040' department: - _id: '79' doi: 10.1109/NetSys.2013.11 file: - access_level: closed content_type: application/pdf creator: florida date_created: 2018-03-15T10:30:42Z date_updated: 2018-03-15T10:30:42Z file_id: '1286' file_name: 546-Kalman.Graffi_CaReChord.A.Churn.Resistant.Selfstabilizing.Chord.Overlay.Network_02.pdf file_size: 244841 relation: main_file success: 1 file_date_updated: 2018-03-15T10:30:42Z has_accepted_license: '1' page: 27-34 project: - _id: '1' name: SFB 901 - _id: '5' name: SFB 901 - Subprojekt A1 - _id: '13' name: SFB 901 - Subproject C1 - _id: '2' name: SFB 901 - Project Area A - _id: '4' name: SFB 901 - Project Area C publication: Proceedings of the Conference on Networked Systems (NetSys) status: public title: 'Ca-Re-Chord: A Churn Resistant Self-stabilizing Chord Overlay Network' type: conference user_id: '15504' year: '2013' ... --- _id: '5464' author: - first_name: M full_name: Baum, M last_name: Baum - first_name: C full_name: Schwens, C last_name: Schwens - first_name: Rüdiger full_name: Kabst, Rüdiger id: '42362' last_name: Kabst citation: ama: 'Baum M, Schwens C, Kabst R. International as Opposed to Domestic New Venturing: The Moderating Role of Perceived Barriers to Internationalization. International Small Business Journal (ISBJ). 2013;31(5):534-560.' apa: 'Baum, M., Schwens, C., & Kabst, R. (2013). International as Opposed to Domestic New Venturing: The Moderating Role of Perceived Barriers to Internationalization. International Small Business Journal (ISBJ)., 31(5), 534–560.' bibtex: '@article{Baum_Schwens_Kabst_2013, title={International as Opposed to Domestic New Venturing: The Moderating Role of Perceived Barriers to Internationalization.}, volume={31}, number={5}, journal={International Small Business Journal (ISBJ).}, author={Baum, M and Schwens, C and Kabst, Rüdiger}, year={2013}, pages={534–560} }' chicago: 'Baum, M, C Schwens, and Rüdiger Kabst. “International as Opposed to Domestic New Venturing: The Moderating Role of Perceived Barriers to Internationalization.” International Small Business Journal (ISBJ). 31, no. 5 (2013): 534–60.' ieee: 'M. Baum, C. Schwens, and R. Kabst, “International as Opposed to Domestic New Venturing: The Moderating Role of Perceived Barriers to Internationalization.,” International Small Business Journal (ISBJ)., vol. 31, no. 5, pp. 534–560, 2013.' mla: 'Baum, M., et al. “International as Opposed to Domestic New Venturing: The Moderating Role of Perceived Barriers to Internationalization.” International Small Business Journal (ISBJ)., vol. 31, no. 5, 2013, pp. 534–60.' short: M. Baum, C. Schwens, R. Kabst, International Small Business Journal (ISBJ). 31 (2013) 534–560. date_created: 2018-11-08T14:22:26Z date_updated: 2022-01-06T07:01:55Z department: - _id: '274' intvolume: ' 31' issue: '5' language: - iso: eng page: 534-560 publication: International Small Business Journal (ISBJ). status: public title: 'International as Opposed to Domestic New Venturing: The Moderating Role of Perceived Barriers to Internationalization.' type: journal_article user_id: '46632' volume: 31 year: '2013' ... --- _id: '5465' author: - first_name: M full_name: Baum, M last_name: Baum - first_name: Rüdiger full_name: Kabst, Rüdiger id: '42362' last_name: Kabst citation: ama: 'Baum M, Kabst R. Conjoint implications on job preferences: The moderating role of involvement. International Journal of Human Resource Management (IJHRM). 2013;24(7):1393-1417.' apa: 'Baum, M., & Kabst, R. (2013). Conjoint implications on job preferences: The moderating role of involvement. International Journal of Human Resource Management (IJHRM)., 24(7), 1393–1417.' bibtex: '@article{Baum_Kabst_2013, title={Conjoint implications on job preferences: The moderating role of involvement.}, volume={24}, number={7}, journal={International Journal of Human Resource Management (IJHRM).}, author={Baum, M and Kabst, Rüdiger}, year={2013}, pages={1393–1417} }' chicago: 'Baum, M, and Rüdiger Kabst. “Conjoint Implications on Job Preferences: The Moderating Role of Involvement.” International Journal of Human Resource Management (IJHRM). 24, no. 7 (2013): 1393–1417.' ieee: 'M. Baum and R. Kabst, “Conjoint implications on job preferences: The moderating role of involvement.,” International Journal of Human Resource Management (IJHRM)., vol. 24, no. 7, pp. 1393–1417, 2013.' mla: 'Baum, M., and Rüdiger Kabst. “Conjoint Implications on Job Preferences: The Moderating Role of Involvement.” International Journal of Human Resource Management (IJHRM)., vol. 24, no. 7, 2013, pp. 1393–417.' short: M. Baum, R. Kabst, International Journal of Human Resource Management (IJHRM). 24 (2013) 1393–1417. date_created: 2018-11-08T14:28:07Z date_updated: 2022-01-06T07:01:55Z department: - _id: '274' intvolume: ' 24' issue: '7' language: - iso: eng page: 1393-1417 publication: International Journal of Human Resource Management (IJHRM). status: public title: 'Conjoint implications on job preferences: The moderating role of involvement.' type: journal_article user_id: '46632' volume: 24 year: '2013' ... --- _id: '547' abstract: - lang: eng text: 'In recent years, the role of process models in the development of enterprise software systems has increased continuously. Today, process models are used at different levels in the development process. For instance, in Service-Oriented Architectures (SOA), high-level business process models become input for the development of IT systems, and in running IT systems executable process models describe choreographies of Web Services. A key driver behind this development is the necessity for a closer alignment of business and IT requirements, to reduce the reaction times in software development to frequent changes in competitive markets.Typically in these scenarios, process models are developed, maintained, and transformed in a team environment by several stakeholders that are often from different business units, resulting in different versions. To obtain integrated process models comprising the changes applied to different versions, the versions need to be consolidated by means of model change management. Change management for process models can be compared to widely used concurrent versioning systems (CVS) and consists of the following major activities: matching of process models, detection of differences, computation of dependencies and conflicts between differences, and merging of process models.Although in general model-driven development (MDD) is accepted as a well-established development approach, there are still some shortcomings that let developers decide against MDD and for more traditional development paradigms. These shortcomings comprise a lack of fully integrated and fully featured development environments for MDD, such as a comprehensive support for model change management.In this thesis, we present a framework for process model change management. The framework is based on an intermediate representation for process models that serves as an abstraction of specific process modeling languages and focuses on common syntactic and semantic core concepts for the modeling of workflow in process models. Based on the intermediate representation, we match process models in versioning scenarios and compute differences between process models generically. Further, we consider the analysis of dependencies between differences and show how conflicts between differences can be computed by taking into account the semantics of the modeling language.As proof-of concept, we have implemented major parts of this framework in terms of a prototype. The detection of differences and dependencies contributed also to the Compare & Merge framework for the IBM WebSphere Business Modeler V 7.0 [1] (WBM), which was released as a product in fall 2009.' author: - first_name: Christian full_name: Gerth, Christian last_name: Gerth citation: ama: Gerth C. Business Process Models - Change Management. Universität Paderborn; 2013. doi:10.1007/978-3-642-38604-6 apa: Gerth, C. (2013). Business Process Models - Change Management. Universität Paderborn. https://doi.org/10.1007/978-3-642-38604-6 bibtex: '@book{Gerth_2013, title={Business Process Models - Change Management}, DOI={10.1007/978-3-642-38604-6}, publisher={Universität Paderborn}, author={Gerth, Christian}, year={2013} }' chicago: Gerth, Christian. Business Process Models - Change Management. Universität Paderborn, 2013. https://doi.org/10.1007/978-3-642-38604-6. ieee: C. Gerth, Business Process Models - Change Management. Universität Paderborn, 2013. mla: Gerth, Christian. Business Process Models - Change Management. Universität Paderborn, 2013, doi:10.1007/978-3-642-38604-6. short: C. Gerth, Business Process Models - Change Management, Universität Paderborn, 2013. date_created: 2017-10-17T12:42:39Z date_updated: 2022-01-06T07:01:55Z department: - _id: '66' doi: 10.1007/978-3-642-38604-6 language: - iso: eng project: - _id: '1' name: SFB 901 - _id: '9' name: SFB 901 - Subprojekt B1 - _id: '3' name: SFB 901 - Project Area B publisher: Universität Paderborn status: public supervisor: - first_name: Gregor full_name: Engels, Gregor id: '107' last_name: Engels title: Business Process Models - Change Management type: dissertation user_id: '477' year: '2013' ... --- _id: '5478' author: - first_name: M full_name: Baum, M last_name: Baum - first_name: Rüdiger full_name: Kabst, Rüdiger id: '42362' last_name: Kabst citation: ama: Baum M, Kabst R. How to attract applicants in the atlantic versus the asia-pacific region? A cross-national analysis on China, India, Germany, and Hungary. Journal of World Business (JWB). 2013;48(2):175-185. apa: Baum, M., & Kabst, R. (2013). How to attract applicants in the atlantic versus the asia-pacific region? A cross-national analysis on China, India, Germany, and Hungary. Journal of World Business (JWB)., 48(2), 175–185. bibtex: '@article{Baum_Kabst_2013, title={How to attract applicants in the atlantic versus the asia-pacific region? A cross-national analysis on China, India, Germany, and Hungary.}, volume={48}, number={2}, journal={Journal of World Business (JWB).}, author={Baum, M and Kabst, Rüdiger}, year={2013}, pages={175–185} }' chicago: 'Baum, M, and Rüdiger Kabst. “How to Attract Applicants in the Atlantic versus the Asia-Pacific Region? A Cross-National Analysis on China, India, Germany, and Hungary.” Journal of World Business (JWB). 48, no. 2 (2013): 175–85.' ieee: M. Baum and R. Kabst, “How to attract applicants in the atlantic versus the asia-pacific region? A cross-national analysis on China, India, Germany, and Hungary.,” Journal of World Business (JWB)., vol. 48, no. 2, pp. 175–185, 2013. mla: Baum, M., and Rüdiger Kabst. “How to Attract Applicants in the Atlantic versus the Asia-Pacific Region? A Cross-National Analysis on China, India, Germany, and Hungary.” Journal of World Business (JWB)., vol. 48, no. 2, 2013, pp. 175–85. short: M. Baum, R. Kabst, Journal of World Business (JWB). 48 (2013) 175–185. date_created: 2018-11-12T10:14:53Z date_updated: 2022-01-06T07:01:55Z department: - _id: '274' intvolume: ' 48' issue: '2' language: - iso: eng page: 175-185 publication: Journal of World Business (JWB). status: public title: How to attract applicants in the atlantic versus the asia-pacific region? A cross-national analysis on China, India, Germany, and Hungary. type: journal_article user_id: '46632' volume: 48 year: '2013' ... --- _id: '548' abstract: - lang: eng text: Peer-to-peer systems scale to millions of nodes and provide routing and storage functions with best effort quality. In order to provide a guaranteed quality of the overlay functions, even under strong dynamics in the network with regard to peer capacities, online participation and usage patterns, we propose to calibrate the peer-to-peer overlay and to autonomously learn which qualities can be reached. For that, we simulate the peer-to-peer overlay systematically under a wide range of parameter configurations and use neural networks to learn the effects of the configurations on the quality metrics. Thus, by choosing a specific quality setting by the overlay operator, the network can tune itself to the learned parameter configurations that lead to the desired quality. Evaluation shows that the presented self-calibration succeeds in learning the configuration-quality interdependencies and that peer-to-peer systems can learn and adapt their behavior according to desired quality goals. author: - first_name: Kalman full_name: Graffi, Kalman last_name: Graffi - first_name: Timo full_name: Klerx, Timo last_name: Klerx citation: ama: 'Graffi K, Klerx T. Bootstrapping Skynet: Calibration and Autonomic Self-Control of Structured Peer-to-Peer Networks. In: Proceedings of the International Conference on Peer-to-Peer Computing (P2P’13). ; 2013:1-5. doi:10.1109/P2P.2013.6688720' apa: 'Graffi, K., & Klerx, T. (2013). Bootstrapping Skynet: Calibration and Autonomic Self-Control of Structured Peer-to-Peer Networks. In Proceedings of the International Conference on Peer-to-Peer Computing (P2P’13) (pp. 1–5). https://doi.org/10.1109/P2P.2013.6688720' bibtex: '@inproceedings{Graffi_Klerx_2013, title={Bootstrapping Skynet: Calibration and Autonomic Self-Control of Structured Peer-to-Peer Networks}, DOI={10.1109/P2P.2013.6688720}, booktitle={Proceedings of the International Conference on Peer-to-Peer Computing (P2P’13)}, author={Graffi, Kalman and Klerx, Timo}, year={2013}, pages={1–5} }' chicago: 'Graffi, Kalman, and Timo Klerx. “Bootstrapping Skynet: Calibration and Autonomic Self-Control of Structured Peer-to-Peer Networks.” In Proceedings of the International Conference on Peer-to-Peer Computing (P2P’13), 1–5, 2013. https://doi.org/10.1109/P2P.2013.6688720.' ieee: 'K. Graffi and T. Klerx, “Bootstrapping Skynet: Calibration and Autonomic Self-Control of Structured Peer-to-Peer Networks,” in Proceedings of the International Conference on Peer-to-Peer Computing (P2P’13), 2013, pp. 1–5.' mla: 'Graffi, Kalman, and Timo Klerx. “Bootstrapping Skynet: Calibration and Autonomic Self-Control of Structured Peer-to-Peer Networks.” Proceedings of the International Conference on Peer-to-Peer Computing (P2P’13), 2013, pp. 1–5, doi:10.1109/P2P.2013.6688720.' short: 'K. Graffi, T. Klerx, in: Proceedings of the International Conference on Peer-to-Peer Computing (P2P’13), 2013, pp. 1–5.' date_created: 2017-10-17T12:42:39Z date_updated: 2022-01-06T07:01:56Z ddc: - '040' department: - _id: '79' doi: 10.1109/P2P.2013.6688720 file: - access_level: closed content_type: application/pdf creator: florida date_created: 2018-03-15T10:30:09Z date_updated: 2018-03-15T10:30:09Z file_id: '1285' file_name: 548-Bootstrapping.Skynet.Calibration.and.Autonomic.Self-Control.of.Structured.P2P.Networks_01.pdf file_size: 629234 relation: main_file success: 1 file_date_updated: 2018-03-15T10:30:09Z has_accepted_license: '1' language: - iso: eng page: 1-5 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 International Conference on Peer-to-Peer Computing (P2P'13) status: public title: 'Bootstrapping Skynet: Calibration and Autonomic Self-Control of Structured Peer-to-Peer Networks' type: conference user_id: '477' year: '2013' ... --- _id: '5484' author: - first_name: I full_name: Haus, I last_name: Haus - 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: 'Haus I, Steinmetz H, Isidor R, Kabst R. Gender Effects on Entrepreneurial Intention: A Meta-Analytical Structural Equation Model. International Journal of Gender and Entrepreneurship (IJGE). 2013;5(2):130-156.' apa: 'Haus, I., Steinmetz, H., Isidor, R., & Kabst, R. (2013). Gender Effects on Entrepreneurial Intention: A Meta-Analytical Structural Equation Model. International Journal of Gender and Entrepreneurship (IJGE), 5(2), 130–156.' bibtex: '@article{Haus_Steinmetz_Isidor_Kabst_2013, title={Gender Effects on Entrepreneurial Intention: A Meta-Analytical Structural Equation Model.}, volume={5}, number={2}, journal={International Journal of Gender and Entrepreneurship (IJGE)}, author={Haus, I and Steinmetz, Holger and Isidor, R and Kabst, Rüdiger}, year={2013}, pages={130–156} }' chicago: 'Haus, I, Holger Steinmetz, R Isidor, and Rüdiger Kabst. “Gender Effects on Entrepreneurial Intention: A Meta-Analytical Structural Equation Model.” International Journal of Gender and Entrepreneurship (IJGE) 5, no. 2 (2013): 130–56.' ieee: 'I. Haus, H. Steinmetz, R. Isidor, and R. Kabst, “Gender Effects on Entrepreneurial Intention: A Meta-Analytical Structural Equation Model.,” International Journal of Gender and Entrepreneurship (IJGE), vol. 5, no. 2, pp. 130–156, 2013.' mla: 'Haus, I., et al. “Gender Effects on Entrepreneurial Intention: A Meta-Analytical Structural Equation Model.” International Journal of Gender and Entrepreneurship (IJGE), vol. 5, no. 2, 2013, pp. 130–56.' short: I. Haus, H. Steinmetz, R. Isidor, R. Kabst, International Journal of Gender and Entrepreneurship (IJGE) 5 (2013) 130–156. date_created: 2018-11-12T10:31:29Z date_updated: 2022-01-06T07:01:56Z department: - _id: '274' intvolume: ' 5' issue: '2' language: - iso: eng page: 130-156 publication: International Journal of Gender and Entrepreneurship (IJGE) status: public title: 'Gender Effects on Entrepreneurial Intention: A Meta-Analytical Structural Equation Model.' type: journal_article user_id: '46632' volume: 5 year: '2013' ... --- _id: '5489' author: - first_name: Holger full_name: Steinmetz, Holger id: '43261' last_name: Steinmetz citation: ama: 'Steinmetz H. Analyzing observed composite differences across groups: Is partial measurement invariance enough? European Journal of Research Methods for the Behavioral and Social Sciences. 2013;9(1):1-12.' apa: 'Steinmetz, H. (2013). Analyzing observed composite differences across groups: Is partial measurement invariance enough? European Journal of Research Methods for the Behavioral and Social Sciences., 9(1), 1–12.' bibtex: '@article{Steinmetz_2013, title={Analyzing observed composite differences across groups: Is partial measurement invariance enough?}, volume={9}, number={1}, journal={European Journal of Research Methods for the Behavioral and Social Sciences.}, author={Steinmetz, Holger}, year={2013}, pages={1–12} }' chicago: 'Steinmetz, Holger. “Analyzing Observed Composite Differences across Groups: Is Partial Measurement Invariance Enough?” European Journal of Research Methods for the Behavioral and Social Sciences. 9, no. 1 (2013): 1–12.' ieee: 'H. Steinmetz, “Analyzing observed composite differences across groups: Is partial measurement invariance enough?,” European Journal of Research Methods for the Behavioral and Social Sciences., vol. 9, no. 1, pp. 1–12, 2013.' mla: 'Steinmetz, Holger. “Analyzing Observed Composite Differences across Groups: Is Partial Measurement Invariance Enough?” European Journal of Research Methods for the Behavioral and Social Sciences., vol. 9, no. 1, 2013, pp. 1–12.' short: H. Steinmetz, European Journal of Research Methods for the Behavioral and Social Sciences. 9 (2013) 1–12. date_created: 2018-11-12T10:38:26Z date_updated: 2022-01-06T07:01:56Z department: - _id: '274' intvolume: ' 9' issue: '1' language: - iso: eng page: 1-12 publication: European Journal of Research Methods for the Behavioral and Social Sciences. status: public title: 'Analyzing observed composite differences across groups: Is partial measurement invariance enough?' type: journal_article user_id: '46632' volume: 9 year: '2013' ... --- _id: '549' author: - first_name: Christian full_name: Bick, Christian last_name: Bick citation: ama: Bick C. Beschleunigung von Tiefenberechung aus Stereobildern durch FPGA-basierte Datenflussrechner. Universität Paderborn; 2013. apa: Bick, C. (2013). Beschleunigung von Tiefenberechung aus Stereobildern durch FPGA-basierte Datenflussrechner. Universität Paderborn. bibtex: '@book{Bick_2013, title={Beschleunigung von Tiefenberechung aus Stereobildern durch FPGA-basierte Datenflussrechner}, publisher={Universität Paderborn}, author={Bick, Christian}, year={2013} }' chicago: Bick, Christian. Beschleunigung von Tiefenberechung aus Stereobildern durch FPGA-basierte Datenflussrechner. Universität Paderborn, 2013. ieee: C. Bick, Beschleunigung von Tiefenberechung aus Stereobildern durch FPGA-basierte Datenflussrechner. Universität Paderborn, 2013. mla: Bick, Christian. Beschleunigung von Tiefenberechung aus Stereobildern durch FPGA-basierte Datenflussrechner. Universität Paderborn, 2013. short: C. Bick, Beschleunigung von Tiefenberechung aus Stereobildern durch FPGA-basierte Datenflussrechner, Universität Paderborn, 2013. date_created: 2017-10-17T12:42:39Z date_updated: 2022-01-06T07:01:56Z language: - iso: ger 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: Beschleunigung von Tiefenberechung aus Stereobildern durch FPGA-basierte Datenflussrechner type: bachelorsthesis user_id: '477' year: '2013' ... --- _id: '550' author: - first_name: Julian full_name: Meschede, Julian last_name: Meschede citation: ama: Meschede J. Bandbreiten-beschränktes Scheduling mit skalierbaren Jobanforderungen in Multiprozessor-Umgebungen. Universität Paderborn; 2013. apa: Meschede, J. (2013). Bandbreiten-beschränktes Scheduling mit skalierbaren Jobanforderungen in Multiprozessor-Umgebungen. Universität Paderborn. bibtex: '@book{Meschede_2013, title={Bandbreiten-beschränktes Scheduling mit skalierbaren Jobanforderungen in Multiprozessor-Umgebungen}, publisher={Universität Paderborn}, author={Meschede, Julian}, year={2013} }' chicago: Meschede, Julian. Bandbreiten-beschränktes Scheduling mit skalierbaren Jobanforderungen in Multiprozessor-Umgebungen. Universität Paderborn, 2013. ieee: J. Meschede, Bandbreiten-beschränktes Scheduling mit skalierbaren Jobanforderungen in Multiprozessor-Umgebungen. Universität Paderborn, 2013. mla: Meschede, Julian. Bandbreiten-beschränktes Scheduling mit skalierbaren Jobanforderungen in Multiprozessor-Umgebungen. Universität Paderborn, 2013. short: J. Meschede, Bandbreiten-beschränktes Scheduling mit skalierbaren Jobanforderungen in Multiprozessor-Umgebungen, Universität Paderborn, 2013. date_created: 2017-10-17T12:42:39Z date_updated: 2022-01-06T07:01:56Z language: - iso: ger 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: Bandbreiten-beschränktes Scheduling mit skalierbaren Jobanforderungen in Multiprozessor-Umgebungen type: bachelorsthesis user_id: '477' year: '2013' ... --- _id: '551' abstract: - lang: eng text: In the service-oriented computing domain, the number of available software services steadily increased in recent years, favored by the rise of cloud computing with its attached delivery models like Software-as-a-Service (SaaS). To fully leverage the opportunities provided by these services for developing highly flexible and aligned SOA, integration of new services as well as the substitution of existing services must be simplified. As a consequence, approaches for automated and accurate service discovery and composition are needed. In this paper, we propose an automatic service composition approach as an extension to our earlier work on automatic service discovery. To ensure accurate results, it matches service requests and available offers based on their structural as well as behavioral aspects. Afterwards, possible service compositions are determined by composing service protocols through a composition strategy based on labeled transition systems. author: - first_name: Zille full_name: Huma, Zille last_name: Huma - first_name: Christian full_name: Gerth, Christian last_name: Gerth - first_name: Gregor full_name: Engels, Gregor id: '107' last_name: Engels - first_name: Oliver full_name: Juwig, Oliver last_name: Juwig citation: ama: 'Huma Z, Gerth C, Engels G, Juwig O. Automated Service Composition for On-the-Fly SOAs. In: Proceedings of the 11th International Conference on Service Oriented Computing (ICSOC’13). LNCS. ; 2013:524--532. doi:10.1007/978-3-642-45005-1_42' apa: Huma, Z., Gerth, C., Engels, G., & Juwig, O. (2013). Automated Service Composition for On-the-Fly SOAs. In Proceedings of the 11th International Conference on Service Oriented Computing (ICSOC’13) (pp. 524--532). https://doi.org/10.1007/978-3-642-45005-1_42 bibtex: '@inproceedings{Huma_Gerth_Engels_Juwig_2013, series={LNCS}, title={Automated Service Composition for On-the-Fly SOAs}, DOI={10.1007/978-3-642-45005-1_42}, booktitle={Proceedings of the 11th International Conference on Service Oriented Computing (ICSOC’13)}, author={Huma, Zille and Gerth, Christian and Engels, Gregor and Juwig, Oliver}, year={2013}, pages={524--532}, collection={LNCS} }' chicago: Huma, Zille, Christian Gerth, Gregor Engels, and Oliver Juwig. “Automated Service Composition for On-the-Fly SOAs.” In Proceedings of the 11th International Conference on Service Oriented Computing (ICSOC’13), 524--532. LNCS, 2013. https://doi.org/10.1007/978-3-642-45005-1_42. ieee: Z. Huma, C. Gerth, G. Engels, and O. Juwig, “Automated Service Composition for On-the-Fly SOAs,” in Proceedings of the 11th International Conference on Service Oriented Computing (ICSOC’13), 2013, pp. 524--532. mla: Huma, Zille, et al. “Automated Service Composition for On-the-Fly SOAs.” Proceedings of the 11th International Conference on Service Oriented Computing (ICSOC’13), 2013, pp. 524--532, doi:10.1007/978-3-642-45005-1_42. short: 'Z. Huma, C. Gerth, G. Engels, O. Juwig, in: Proceedings of the 11th International Conference on Service Oriented Computing (ICSOC’13), 2013, pp. 524--532.' date_created: 2017-10-17T12:42:39Z date_updated: 2022-01-06T07:01:57Z ddc: - '040' department: - _id: '66' doi: 10.1007/978-3-642-45005-1_42 file: - access_level: closed content_type: application/pdf creator: florida date_created: 2018-03-15T10:31:20Z date_updated: 2018-03-15T10:31:20Z file_id: '1287' file_name: 551-978-3-642-45005-1_42.pdf file_size: 384397 relation: main_file success: 1 file_date_updated: 2018-03-15T10:31:20Z has_accepted_license: '1' language: - iso: eng page: 524--532 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 Conference on Service Oriented Computing (ICSOC'13) series_title: LNCS status: public title: Automated Service Composition for On-the-Fly SOAs type: conference user_id: '477' year: '2013' ... --- _id: '552' author: - first_name: Kevin full_name: Meckenstock, Kevin last_name: Meckenstock citation: ama: Meckenstock K. Auktionen im Beschaffungsmanagement - Eine spieltheoretische Analyse. Universität Paderborn; 2013. apa: Meckenstock, K. (2013). Auktionen im Beschaffungsmanagement - Eine spieltheoretische Analyse. Universität Paderborn. bibtex: '@book{Meckenstock_2013, title={Auktionen im Beschaffungsmanagement - Eine spieltheoretische Analyse}, publisher={Universität Paderborn}, author={Meckenstock, Kevin}, year={2013} }' chicago: Meckenstock, Kevin. Auktionen im Beschaffungsmanagement - Eine spieltheoretische Analyse. Universität Paderborn, 2013. ieee: K. Meckenstock, Auktionen im Beschaffungsmanagement - Eine spieltheoretische Analyse. Universität Paderborn, 2013. mla: Meckenstock, Kevin. Auktionen im Beschaffungsmanagement - Eine spieltheoretische Analyse. Universität Paderborn, 2013. short: K. Meckenstock, Auktionen im Beschaffungsmanagement - Eine spieltheoretische Analyse, Universität Paderborn, 2013. date_created: 2017-10-17T12:42:39Z date_updated: 2022-01-06T07:01:57Z 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: Auktionen im Beschaffungsmanagement - Eine spieltheoretische Analyse type: bachelorsthesis user_id: '477' year: '2013' ... --- _id: '553' author: - first_name: Kathlén full_name: Kohn, Kathlén last_name: Kohn citation: ama: Kohn K. Attributbasierte Verschlüsselung mittels Gittermethoden - Mathematische Grundlagen, Verfahren und Sicherheitsbeweise. Universität Paderborn; 2013. apa: Kohn, K. (2013). Attributbasierte Verschlüsselung mittels Gittermethoden - Mathematische Grundlagen, Verfahren und Sicherheitsbeweise. Universität Paderborn. bibtex: '@book{Kohn_2013, title={Attributbasierte Verschlüsselung mittels Gittermethoden - Mathematische Grundlagen, Verfahren und Sicherheitsbeweise}, publisher={Universität Paderborn}, author={Kohn, Kathlén}, year={2013} }' chicago: Kohn, Kathlén. Attributbasierte Verschlüsselung mittels Gittermethoden - Mathematische Grundlagen, Verfahren und Sicherheitsbeweise. Universität Paderborn, 2013. ieee: K. Kohn, Attributbasierte Verschlüsselung mittels Gittermethoden - Mathematische Grundlagen, Verfahren und Sicherheitsbeweise. Universität Paderborn, 2013. mla: Kohn, Kathlén. Attributbasierte Verschlüsselung mittels Gittermethoden - Mathematische Grundlagen, Verfahren und Sicherheitsbeweise. Universität Paderborn, 2013. short: K. Kohn, Attributbasierte Verschlüsselung mittels Gittermethoden - Mathematische Grundlagen, Verfahren und Sicherheitsbeweise, Universität Paderborn, 2013. date_created: 2017-10-17T12:42:40Z date_updated: 2022-01-06T07:01:57Z 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 - _id: '43' name: Securing the Financial Cloud publisher: Universität Paderborn status: public supervisor: - first_name: Johannes full_name: Blömer, Johannes id: '23' last_name: Blömer title: Attributbasierte Verschlüsselung mittels Gittermethoden - Mathematische Grundlagen, Verfahren und Sicherheitsbeweise type: bachelorsthesis user_id: '477' year: '2013' ... --- _id: '554' abstract: - lang: eng text: We establish a link between cooperative and competitive behavior. For every possible vector of weights of an asymmetric Nash bargaining solution there exists a market that has this asymmetric Nash bargaining solution as its unique competitive payoff vector. author: - first_name: Sonja full_name: Brangewitz, Sonja last_name: Brangewitz - first_name: Jan-Philip full_name: Gamp, Jan-Philip last_name: Gamp citation: ama: Brangewitz S, Gamp J-P. Asymmetric Nash bargaining solutions and competitive payoffs. Economics Letters. 2013;(2):224-227. doi:10.1016/j.econlet.2013.08.013 apa: Brangewitz, S., & Gamp, J.-P. (2013). Asymmetric Nash bargaining solutions and competitive payoffs. Economics Letters, (2), 224–227. https://doi.org/10.1016/j.econlet.2013.08.013 bibtex: '@article{Brangewitz_Gamp_2013, title={Asymmetric Nash bargaining solutions and competitive payoffs}, DOI={10.1016/j.econlet.2013.08.013}, number={2}, journal={Economics Letters}, publisher={Elsevier}, author={Brangewitz, Sonja and Gamp, Jan-Philip}, year={2013}, pages={224–227} }' chicago: 'Brangewitz, Sonja, and Jan-Philip Gamp. “Asymmetric Nash Bargaining Solutions and Competitive Payoffs.” Economics Letters, no. 2 (2013): 224–27. https://doi.org/10.1016/j.econlet.2013.08.013.' ieee: S. Brangewitz and J.-P. Gamp, “Asymmetric Nash bargaining solutions and competitive payoffs,” Economics Letters, no. 2, pp. 224–227, 2013. mla: Brangewitz, Sonja, and Jan-Philip Gamp. “Asymmetric Nash Bargaining Solutions and Competitive Payoffs.” Economics Letters, no. 2, Elsevier, 2013, pp. 224–27, doi:10.1016/j.econlet.2013.08.013. short: S. Brangewitz, J.-P. Gamp, Economics Letters (2013) 224–227. date_created: 2017-10-17T12:42:40Z date_updated: 2022-01-06T07:01:58Z ddc: - '040' department: - _id: '205' doi: 10.1016/j.econlet.2013.08.013 file: - access_level: closed content_type: application/pdf creator: florida date_created: 2018-03-15T10:29:34Z date_updated: 2018-03-15T10:29:34Z file_id: '1284' file_name: 554-Asymmetric_Nash_bargaining_solutions_and_competitive_payoffs.pdf file_size: 374965 relation: main_file success: 1 file_date_updated: 2018-03-15T10:29:34Z has_accepted_license: '1' issue: '2' language: - iso: eng page: 224 - 227 project: - _id: '1' name: SFB 901 - _id: '7' name: SFB 901 - Subprojekt A3 - _id: '2' name: SFB 901 - Project Area A publication: Economics Letters publisher: Elsevier status: public title: Asymmetric Nash bargaining solutions and competitive payoffs type: journal_article user_id: '477' year: '2013' ... --- _id: '555' author: - first_name: Alexander full_name: Setzer, Alexander id: '11108' last_name: Setzer citation: ama: Setzer A. Approximation Algorithms for the Linear Arrangement of Special Classes of Graphs. Universität Paderborn; 2013. apa: Setzer, A. (2013). Approximation Algorithms for the Linear Arrangement of Special Classes of Graphs. Universität Paderborn. bibtex: '@book{Setzer_2013, title={Approximation Algorithms for the Linear Arrangement of Special Classes of Graphs}, publisher={Universität Paderborn}, author={Setzer, Alexander}, year={2013} }' chicago: Setzer, Alexander. Approximation Algorithms for the Linear Arrangement of Special Classes of Graphs. Universität Paderborn, 2013. ieee: A. Setzer, Approximation Algorithms for the Linear Arrangement of Special Classes of Graphs. Universität Paderborn, 2013. mla: Setzer, Alexander. Approximation Algorithms for the Linear Arrangement of Special Classes of Graphs. Universität Paderborn, 2013. short: A. Setzer, Approximation Algorithms for the Linear Arrangement of Special Classes of Graphs, Universität Paderborn, 2013. date_created: 2017-10-17T12:42:40Z date_updated: 2022-01-06T07:01:59Z department: - _id: '79' 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: Approximation Algorithms for the Linear Arrangement of Special Classes of Graphs type: mastersthesis user_id: '477' year: '2013' ... --- _id: '556' author: - first_name: Tobias full_name: Nickel, Tobias last_name: Nickel citation: ama: Nickel T. Analyse von Benutzeranforderungen von Service-Kompositionen mittels Modelchecking. Universität Paderborn; 2013. apa: Nickel, T. (2013). Analyse von Benutzeranforderungen von Service-Kompositionen mittels Modelchecking. Universität Paderborn. bibtex: '@book{Nickel_2013, title={Analyse von Benutzeranforderungen von Service-Kompositionen mittels Modelchecking}, publisher={Universität Paderborn}, author={Nickel, Tobias}, year={2013} }' chicago: Nickel, Tobias. Analyse von Benutzeranforderungen von Service-Kompositionen mittels Modelchecking. Universität Paderborn, 2013. ieee: T. Nickel, Analyse von Benutzeranforderungen von Service-Kompositionen mittels Modelchecking. Universität Paderborn, 2013. mla: Nickel, Tobias. Analyse von Benutzeranforderungen von Service-Kompositionen mittels Modelchecking. Universität Paderborn, 2013. short: T. Nickel, Analyse von Benutzeranforderungen von Service-Kompositionen mittels Modelchecking, Universität Paderborn, 2013. date_created: 2017-10-17T12:42:40Z date_updated: 2022-01-06T07:01:59Z 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: Analyse von Benutzeranforderungen von Service-Kompositionen mittels Modelchecking type: bachelorsthesis user_id: '477' year: '2013' ... --- _id: '557' abstract: - lang: eng text: Since the last two decades, the water consumption in Germany is decreasing, which causes the water tanks and pipes in a water supply system to work inefficiently. This paper proposes an approach for a decision support system, which helps to decide how to plan new water tanks and resize existing tanks in water supply systems. The approach uses a combination of network reduction, mathematical optimization and hydraulic simulation. The mathematical optimization model is a nonconvex Mixed Integer Quadratically Constrained Program (MIQCP), which is solved by a piecewise linearization. As this may lead to many binary variables and therefore high computational times, the size of the water supply system model is reduced before building the optimization model. By applying several network reduction techniques there may occur some hydraulic differences between the original network model and the reduced network model. To make sure that the solution obtained in the optimization process is feasible in the original water supply system, the solution is verified by a hydraulic simulation tool. author: - first_name: Corinna full_name: Hallmann, Corinna last_name: Hallmann citation: ama: Hallmann C. An Approach for a Decision Support Systems to Optimize Water Tanks in Water Supply Systems by Combining Network Reduction, Optimization and Simulation. Universität Paderborn; 2013. apa: Hallmann, C. (2013). An Approach for a Decision Support Systems to optimize Water Tanks in Water Supply Systems by combining Network Reduction, Optimization and Simulation. Universität Paderborn. bibtex: '@book{Hallmann_2013, title={An Approach for a Decision Support Systems to optimize Water Tanks in Water Supply Systems by combining Network Reduction, Optimization and Simulation}, publisher={Universität Paderborn}, author={Hallmann, Corinna}, year={2013} }' chicago: Hallmann, Corinna. An Approach for a Decision Support Systems to Optimize Water Tanks in Water Supply Systems by Combining Network Reduction, Optimization and Simulation. Universität Paderborn, 2013. ieee: C. Hallmann, An Approach for a Decision Support Systems to optimize Water Tanks in Water Supply Systems by combining Network Reduction, Optimization and Simulation. Universität Paderborn, 2013. mla: Hallmann, Corinna. An Approach for a Decision Support Systems to Optimize Water Tanks in Water Supply Systems by Combining Network Reduction, Optimization and Simulation. Universität Paderborn, 2013. short: C. Hallmann, An Approach for a Decision Support Systems to Optimize Water Tanks in Water Supply Systems by Combining Network Reduction, Optimization and Simulation, Universität Paderborn, 2013. date_created: 2017-10-17T12:42:40Z date_updated: 2022-01-06T07:01:59Z ddc: - '040' file: - access_level: closed content_type: application/pdf creator: florida date_created: 2018-03-15T10:27:58Z date_updated: 2018-03-15T10:27:58Z file_id: '1283' file_name: 557-Hal13.pdf file_size: 271038 relation: main_file success: 1 file_date_updated: 2018-03-15T10:27:58Z has_accepted_license: '1' 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: An Approach for a Decision Support Systems to optimize Water Tanks in Water Supply Systems by combining Network Reduction, Optimization and Simulation type: report user_id: '15504' year: '2013' ... --- _id: '5575' author: - first_name: Felix full_name: Wex, Felix last_name: Wex - first_name: Guido full_name: Schryen, Guido id: '72850' last_name: Schryen - first_name: Dirk full_name: Neumann, Dirk last_name: Neumann citation: ama: Wex F, Schryen G, Neumann D. Assignments of Collaborative Rescue Units during Emergency Response. International Journal of Information Systems for Crisis Response and Management. 2013;5(4):63-80. apa: Wex, F., Schryen, G., & Neumann, D. (2013). Assignments of Collaborative Rescue Units during Emergency Response. International Journal of Information Systems for Crisis Response and Management, 5(4), 63–80. bibtex: '@article{Wex_Schryen_Neumann_2013, title={Assignments of Collaborative Rescue Units during Emergency Response}, volume={5}, number={4}, journal={International Journal of Information Systems for Crisis Response and Management}, publisher={IGI Publ.}, author={Wex, Felix and Schryen, Guido and Neumann, Dirk}, year={2013}, pages={63–80} }' chicago: 'Wex, Felix, Guido Schryen, and Dirk Neumann. “Assignments of Collaborative Rescue Units during Emergency Response.” International Journal of Information Systems for Crisis Response and Management 5, no. 4 (2013): 63–80.' ieee: F. Wex, G. Schryen, and D. Neumann, “Assignments of Collaborative Rescue Units during Emergency Response,” International Journal of Information Systems for Crisis Response and Management, vol. 5, no. 4, pp. 63–80, 2013. mla: Wex, Felix, et al. “Assignments of Collaborative Rescue Units during Emergency Response.” International Journal of Information Systems for Crisis Response and Management, vol. 5, no. 4, IGI Publ., 2013, pp. 63–80. short: F. Wex, G. Schryen, D. Neumann, International Journal of Information Systems for Crisis Response and Management 5 (2013) 63–80. date_created: 2018-11-14T11:14:07Z date_updated: 2022-01-06T07:02:00Z ddc: - '000' department: - _id: '277' extern: '1' file: - access_level: open_access content_type: application/pdf creator: hsiemes date_created: 2018-12-11T14:25:51Z date_updated: 2018-12-13T15:13:02Z file_id: '6168' file_name: ERS_IJISCRAM2013_Revision 1.pdf file_size: 493113 relation: main_file file_date_updated: 2018-12-13T15:13:02Z has_accepted_license: '1' intvolume: ' 5' issue: '4' language: - iso: eng oa: '1' page: 63-80 publication: International Journal of Information Systems for Crisis Response and Management publisher: IGI Publ. status: public title: Assignments of Collaborative Rescue Units during Emergency Response type: journal_article user_id: '61579' volume: 5 year: '2013' ... --- _id: '5576' author: - first_name: Felix full_name: Wex, Felix last_name: Wex - first_name: Guido full_name: Schryen, Guido id: '72850' last_name: Schryen - first_name: Dirk full_name: Neumann, Dirk last_name: Neumann citation: ama: 'Wex F, Schryen G, Neumann D. Decision Modeling for Assignments of Collaborative Rescue Units during Emergency Response. In: Proceedings of the 46th Hawaii International Conference on System Science. ; 2013.' apa: Wex, F., Schryen, G., & Neumann, D. (2013). Decision Modeling for Assignments of Collaborative Rescue Units during Emergency Response. In Proceedings of the 46th Hawaii International Conference on System Science. bibtex: '@inproceedings{Wex_Schryen_Neumann_2013, title={Decision Modeling for Assignments of Collaborative Rescue Units during Emergency Response}, booktitle={Proceedings of the 46th Hawaii International Conference on System Science}, author={Wex, Felix and Schryen, Guido and Neumann, Dirk}, year={2013} }' chicago: Wex, Felix, Guido Schryen, and Dirk Neumann. “Decision Modeling for Assignments of Collaborative Rescue Units during Emergency Response.” In Proceedings of the 46th Hawaii International Conference on System Science, 2013. ieee: F. Wex, G. Schryen, and D. Neumann, “Decision Modeling for Assignments of Collaborative Rescue Units during Emergency Response,” in Proceedings of the 46th Hawaii International Conference on System Science, 2013. mla: Wex, Felix, et al. “Decision Modeling for Assignments of Collaborative Rescue Units during Emergency Response.” Proceedings of the 46th Hawaii International Conference on System Science, 2013. short: 'F. Wex, G. Schryen, D. Neumann, in: Proceedings of the 46th Hawaii International Conference on System Science, 2013.' date_created: 2018-11-14T11:14:56Z date_updated: 2022-01-06T07:02:00Z ddc: - '000' department: - _id: '277' extern: '1' file: - access_level: open_access content_type: application/pdf creator: hsiemes date_created: 2018-12-07T12:00:30Z date_updated: 2018-12-13T15:12:05Z file_id: '6049' file_name: ERS_HICSS2013_revised_v11-ACM [number].pdf file_size: 394101 relation: main_file file_date_updated: 2018-12-13T15:12:05Z has_accepted_license: '1' language: - iso: eng oa: '1' publication: Proceedings of the 46th Hawaii International Conference on System Science status: public title: Decision Modeling for Assignments of Collaborative Rescue Units during Emergency Response type: conference user_id: '61579' year: '2013' ... --- _id: '558' citation: ama: Flocchini P, Gao J, Kranakis E, Meyer auf der Heide F, eds. Algorithms for Sensor Systems - 9th International Symposium on Algorithms and Experiments for Sensor Systems, Wireless Networks and Distributed Robotics. Vol 8243. Springer; 2013. doi:10.1007/978-3-642-45346-5 apa: 'Flocchini, P., Gao, J., Kranakis, E., & Meyer auf der Heide, F. (Eds.). (2013). Algorithms for Sensor Systems - 9th International Symposium on Algorithms and Experiments for Sensor Systems, Wireless Networks and Distributed Robotics (Vol. 8243). Presented at the ALGOSENSORS 2013, Sophia Antipolis, France: Springer. https://doi.org/10.1007/978-3-642-45346-5' bibtex: '@book{Flocchini_Gao_Kranakis_Meyer auf der Heide_2013, series={LNCS}, title={Algorithms for Sensor Systems - 9th International Symposium on Algorithms and Experiments for Sensor Systems, Wireless Networks and Distributed Robotics}, volume={8243}, DOI={10.1007/978-3-642-45346-5}, publisher={Springer}, year={2013}, collection={LNCS} }' chicago: Flocchini, Paola, Jie Gao, Evangelos Kranakis, and Friedhelm Meyer auf der Heide, eds. Algorithms for Sensor Systems - 9th International Symposium on Algorithms and Experiments for Sensor Systems, Wireless Networks and Distributed Robotics. Vol. 8243. LNCS. Springer, 2013. https://doi.org/10.1007/978-3-642-45346-5. ieee: P. Flocchini, J. Gao, E. Kranakis, and F. Meyer auf der Heide, Eds., Algorithms for Sensor Systems - 9th International Symposium on Algorithms and Experiments for Sensor Systems, Wireless Networks and Distributed Robotics, vol. 8243. Springer, 2013. mla: Flocchini, Paola, et al., editors. Algorithms for Sensor Systems - 9th International Symposium on Algorithms and Experiments for Sensor Systems, Wireless Networks and Distributed Robotics. Vol. 8243, Springer, 2013, doi:10.1007/978-3-642-45346-5. short: P. Flocchini, J. Gao, E. Kranakis, F. Meyer auf der Heide, eds., Algorithms for Sensor Systems - 9th International Symposium on Algorithms and Experiments for Sensor Systems, Wireless Networks and Distributed Robotics, Springer, 2013. conference: end_date: 2013-09-06 location: Sophia Antipolis, France name: ALGOSENSORS 2013 start_date: 2013-09-05 date_created: 2017-10-17T12:42:41Z date_updated: 2022-01-06T07:02:02Z ddc: - '000' department: - _id: '63' doi: 10.1007/978-3-642-45346-5 editor: - first_name: Paola full_name: Flocchini, Paola last_name: Flocchini - first_name: Jie full_name: Gao, Jie last_name: Gao - first_name: Evangelos full_name: Kranakis, Evangelos last_name: Kranakis - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm id: '15523' last_name: Meyer auf der Heide file: - access_level: closed content_type: application/pdf creator: ups date_created: 2018-11-02T16:29:07Z date_updated: 2018-11-02T16:29:07Z file_id: '5327' file_name: 2014_Book_AlgorithmsForSensorSystems-1.pdf file_size: 9186107 relation: main_file success: 1 file_date_updated: 2018-11-02T16:29:07Z has_accepted_license: '1' intvolume: ' 8243' language: - iso: eng project: - _id: '1' name: SFB 901 - _id: '5' name: SFB 901 - Subprojekt A1 - _id: '2' name: SFB 901 - Project Area A publisher: Springer series_title: LNCS status: public title: Algorithms for Sensor Systems - 9th International Symposium on Algorithms and Experiments for Sensor Systems, Wireless Networks and Distributed Robotics type: conference_editor user_id: '477' volume: 8243 year: '2013' ... --- _id: '559' abstract: - lang: eng text: Distributed hash tables are very versatile to use, as distributed storage is a desirable feature for various applications. Typical structured overlays like Chord, Pastry or Kademlia consider only homogeneous nodes with equal capacities, which does not resemble reality. In a practical use case, nodes might get overloaded by storing popular data. In this paper, we present a general approach to enable capacity awareness and load-balancing capability of homogeneous structured overlays. We introduce a hierarchical second structured overlay aside, which allows efficient capacity-based access on the nodes in the system as hosting mirrors. Simulation results show that the structured overlay is able to store various contents, such as of a social network, with only a negligible number of overloaded peers. Content, even if very popular, is hosted by easily findable capable peers. Thus, long-existing and well-evaluated overlays like Chord or Pastry can be used to create attractive DHT-based applications. author: - first_name: Philip full_name: Wette, Philip last_name: Wette - first_name: Kalman full_name: Graffi, Kalman last_name: Graffi citation: ama: 'Wette P, Graffi K. Adding Capacity-Aware Storage Indirection to Homogeneous Distributed Hash Tables. In: Proceedings of the Conference on Networked Systems (NetSys). ; 2013:35-42. doi:10.1109/NetSys.2013.9' apa: Wette, P., & Graffi, K. (2013). Adding Capacity-Aware Storage Indirection to Homogeneous Distributed Hash Tables. In Proceedings of the Conference on Networked Systems (NetSys) (pp. 35–42). https://doi.org/10.1109/NetSys.2013.9 bibtex: '@inproceedings{Wette_Graffi_2013, title={Adding Capacity-Aware Storage Indirection to Homogeneous Distributed Hash Tables}, DOI={10.1109/NetSys.2013.9}, booktitle={Proceedings of the Conference on Networked Systems (NetSys)}, author={Wette, Philip and Graffi, Kalman}, year={2013}, pages={35–42} }' chicago: Wette, Philip, and Kalman Graffi. “Adding Capacity-Aware Storage Indirection to Homogeneous Distributed Hash Tables.” In Proceedings of the Conference on Networked Systems (NetSys), 35–42, 2013. https://doi.org/10.1109/NetSys.2013.9. ieee: P. Wette and K. Graffi, “Adding Capacity-Aware Storage Indirection to Homogeneous Distributed Hash Tables,” in Proceedings of the Conference on Networked Systems (NetSys), 2013, pp. 35–42. mla: Wette, Philip, and Kalman Graffi. “Adding Capacity-Aware Storage Indirection to Homogeneous Distributed Hash Tables.” Proceedings of the Conference on Networked Systems (NetSys), 2013, pp. 35–42, doi:10.1109/NetSys.2013.9. short: 'P. Wette, K. Graffi, in: Proceedings of the Conference on Networked Systems (NetSys), 2013, pp. 35–42.' date_created: 2017-10-17T12:42:41Z date_updated: 2022-01-06T07:02:04Z ddc: - '040' department: - _id: '79' doi: 10.1109/NetSys.2013.9 file: - access_level: closed content_type: application/pdf creator: florida date_created: 2018-03-15T10:27:21Z date_updated: 2018-03-15T10:27:21Z file_id: '1282' file_name: 559-Adding.Capacity.Aware.Storage.Indirection.to.Homogeneous.Distributed.Hash.Tables.pdf file_size: 734618 relation: main_file success: 1 file_date_updated: 2018-03-15T10:27:21Z has_accepted_license: '1' language: - iso: eng page: 35-42 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 Conference on Networked Systems (NetSys) status: public title: Adding Capacity-Aware Storage Indirection to Homogeneous Distributed Hash Tables type: conference user_id: '477' year: '2013' ... --- _id: '560' abstract: - lang: eng text: In the last decades, development turned from monolithic software products towards more flexible software components that can be provided on world-wide markets in form of services. Customers request such services or compositions of several services. However, in many cases, discovering the best services to address a given request is a tough challenge and requires expressive, gradual matching results, considering different aspects of a service description, e.g., inputs/ouputs, protocols, or quality properties. Furthermore,in situations in which no service exactly satifies the request, approximate matching which can deal with a certain amount of fuzziness becomes necessary. There is a wealth of service matching approaches, but it is not clear whether there is a comprehensive, fuzzy matching approach which addresses all these challenges. Although there are a few service matchingsurveys, none of them is able to answer this question. In this paper, we perform a systematic literature survey of 35 (outof 504) service matching approaches which consider fuzzy matching. Based on this survey, we propose a classication,discuss how different matching approaches can be combined into a comprehensive matching method, and identify future research challenges. author: - first_name: Marie full_name: Platenius, Marie last_name: Platenius - first_name: Markus full_name: von Detten, Markus last_name: von Detten - first_name: Steffen full_name: Becker, Steffen last_name: Becker - first_name: Wilhelm full_name: Schäfer, Wilhelm last_name: Schäfer - first_name: Gregor full_name: Engels, Gregor id: '107' last_name: Engels citation: ama: 'Platenius M, von Detten M, Becker S, Schäfer W, Engels G. A Survey of Fuzzy Service Matching Approaches in the Context of On-The-Fly Computing. In: Proceedings of the 16th International ACM Sigsoft Symposium on Component-Based Software Engineering. ; 2013:143-152. doi:10.1145/2465449.2465454' apa: Platenius, M., von Detten, M., Becker, S., Schäfer, W., & Engels, G. (2013). A Survey of Fuzzy Service Matching Approaches in the Context of On-The-Fly Computing. In Proceedings of the 16th International ACM Sigsoft Symposium on Component-Based Software Engineering (pp. 143–152). https://doi.org/10.1145/2465449.2465454 bibtex: '@inproceedings{Platenius_von Detten_Becker_Schäfer_Engels_2013, title={A Survey of Fuzzy Service Matching Approaches in the Context of On-The-Fly Computing}, DOI={10.1145/2465449.2465454}, booktitle={Proceedings of the 16th International ACM Sigsoft Symposium on Component-Based Software Engineering}, author={Platenius, Marie and von Detten, Markus and Becker, Steffen and Schäfer, Wilhelm and Engels, Gregor}, year={2013}, pages={143–152} }' chicago: Platenius, Marie, Markus von Detten, Steffen Becker, Wilhelm Schäfer, and Gregor Engels. “A Survey of Fuzzy Service Matching Approaches in the Context of On-The-Fly Computing.” In Proceedings of the 16th International ACM Sigsoft Symposium on Component-Based Software Engineering, 143–52, 2013. https://doi.org/10.1145/2465449.2465454. ieee: M. Platenius, M. von Detten, S. Becker, W. Schäfer, and G. Engels, “A Survey of Fuzzy Service Matching Approaches in the Context of On-The-Fly Computing,” in Proceedings of the 16th International ACM Sigsoft Symposium on Component-Based Software Engineering, 2013, pp. 143–152. mla: Platenius, Marie, et al. “A Survey of Fuzzy Service Matching Approaches in the Context of On-The-Fly Computing.” Proceedings of the 16th International ACM Sigsoft Symposium on Component-Based Software Engineering, 2013, pp. 143–52, doi:10.1145/2465449.2465454. short: 'M. Platenius, M. von Detten, S. Becker, W. Schäfer, G. Engels, in: Proceedings of the 16th International ACM Sigsoft Symposium on Component-Based Software Engineering, 2013, pp. 143–152.' date_created: 2017-10-17T12:42:41Z date_updated: 2022-01-06T07:02:06Z ddc: - '040' department: - _id: '66' - _id: '76' doi: 10.1145/2465449.2465454 file: - access_level: closed content_type: application/pdf creator: florida date_created: 2018-03-15T10:26:49Z date_updated: 2018-03-15T10:26:49Z file_id: '1281' file_name: 560-Platenius_et_al_CBSE2013.pdf file_size: 570580 relation: main_file success: 1 file_date_updated: 2018-03-15T10:26:49Z has_accepted_license: '1' language: - iso: eng page: 143-152 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 16th International ACM Sigsoft Symposium on Component-Based Software Engineering status: public title: A Survey of Fuzzy Service Matching Approaches in the Context of On-The-Fly Computing type: conference user_id: '477' year: '2013' ... --- _id: '561' abstract: - lang: eng text: 'We present a privacy-friendly architecture for a future cloud computing scenario where software licensing and software payment plays a major role. We show how digital rights management as a technical solution for software licensing can be achieved in a privacy-friendly manner. In our scenario, users who buy software from software providers and execute it at computing centres stay anonymous. At the same time, our approach guarantees that software licenses are bound to users and that their validity is checked before execution. Thus, DRM constitutes an incentive for software providers to take part in such a future cloud computing scenario. We employ a software re-encryption scheme so that computing centres are not able to build profiles of their users – not even under a pseudonym. We make sure that malicious users are unable to relay software to others. ' author: - first_name: Ronald full_name: Petrlic, Ronald last_name: Petrlic - first_name: Stephan full_name: Sekula, Stephan last_name: Sekula - first_name: Christoph full_name: Sorge, Christoph last_name: Sorge citation: ama: Petrlic R, Sekula S, Sorge C. A privacy-friendly Architecture for future Cloud Computing. International Journal of Grid and Utility Computing. 2013;(4):265-277. doi:10.1504/IJGUC.2013.057120 apa: Petrlic, R., Sekula, S., & Sorge, C. (2013). A privacy-friendly Architecture for future Cloud Computing. International Journal of Grid and Utility Computing, (4), 265–277. https://doi.org/10.1504/IJGUC.2013.057120 bibtex: '@article{Petrlic_Sekula_Sorge_2013, title={A privacy-friendly Architecture for future Cloud Computing}, DOI={10.1504/IJGUC.2013.057120}, number={4}, journal={International Journal of Grid and Utility Computing}, publisher={InderScience}, author={Petrlic, Ronald and Sekula, Stephan and Sorge, Christoph}, year={2013}, pages={265–277} }' chicago: 'Petrlic, Ronald, Stephan Sekula, and Christoph Sorge. “A Privacy-Friendly Architecture for Future Cloud Computing.” International Journal of Grid and Utility Computing, no. 4 (2013): 265–77. https://doi.org/10.1504/IJGUC.2013.057120.' ieee: R. Petrlic, S. Sekula, and C. Sorge, “A privacy-friendly Architecture for future Cloud Computing,” International Journal of Grid and Utility Computing, no. 4, pp. 265–277, 2013. mla: Petrlic, Ronald, et al. “A Privacy-Friendly Architecture for Future Cloud Computing.” International Journal of Grid and Utility Computing, no. 4, InderScience, 2013, pp. 265–77, doi:10.1504/IJGUC.2013.057120. short: R. Petrlic, S. Sekula, C. Sorge, International Journal of Grid and Utility Computing (2013) 265–277. date_created: 2017-10-17T12:42:41Z date_updated: 2022-01-06T07:02:07Z ddc: - '040' doi: 10.1504/IJGUC.2013.057120 file: - access_level: closed content_type: application/pdf creator: florida date_created: 2018-03-15T10:26:14Z date_updated: 2018-03-15T10:26:14Z file_id: '1280' file_name: 561-authorFinalVersion.pdf file_size: 1036554 relation: main_file success: 1 file_date_updated: 2018-03-15T10:26:14Z has_accepted_license: '1' issue: '4' main_file_link: - url: http://www.inderscience.com/offer.php?id=57120 page: 265-277 project: - _id: '1' name: SFB 901 - _id: '13' name: SFB 901 - Subprojekt C1 - _id: '4' name: SFB 901 - Project Area C publication: International Journal of Grid and Utility Computing publisher: InderScience status: public title: A privacy-friendly Architecture for future Cloud Computing type: journal_article user_id: '477' year: '2013' ... --- _id: '562' abstract: - lang: eng text: In Distributed Cloud Computing, applications are deployed across many data centres at topologically diverse locations to improved network-related quality of service (QoS). As we focus on interactive applications, we minimize the latency between users and an application by allocating Cloud resources nearby the customers. Allocating resources at all locations will result in the best latency but also in the highest expenses. So we need to find an optimal subset of locations which reduces the latency but also the expenses – the facility location problem (FLP). In addition, we consider resource capacity restrictions, as a resource can only serve a limited amount of users. An FLP can be globally solved. Additionally, we propose a local, distributed heuristic. This heuristic is running within the network and does not depend on a global component. No distributed, local approximations for the capacitated FLP have been proposed so far due to the complexity of the problem. We compared the heuristic with an optimal solution obtained from a mixed integer program for different network topologies. We investigated the influence of different parameters like overall resource utilization or different latency weights. author: - first_name: Matthias full_name: Keller, Matthias last_name: Keller - first_name: Stefan full_name: Pawlik, Stefan last_name: Pawlik - first_name: Peter full_name: Pietrzyk, Peter last_name: Pietrzyk - first_name: Holger full_name: Karl, Holger id: '126' last_name: Karl citation: ama: 'Keller M, Pawlik S, Pietrzyk P, Karl H. A Local Heuristic for Latency-Optimized Distributed Cloud Deployment. In: Proceedings of the 6th International Conference on Utility and Cloud Computing (UCC) Workshop on Distributed Cloud Computing. ; 2013:429-434. doi:10.1109/UCC.2013.85' apa: Keller, M., Pawlik, S., Pietrzyk, P., & Karl, H. (2013). A Local Heuristic for Latency-Optimized Distributed Cloud Deployment. In Proceedings of the 6th International Conference on Utility and Cloud Computing (UCC) workshop on Distributed cloud computing (pp. 429–434). https://doi.org/10.1109/UCC.2013.85 bibtex: '@inproceedings{Keller_Pawlik_Pietrzyk_Karl_2013, title={A Local Heuristic for Latency-Optimized Distributed Cloud Deployment}, DOI={10.1109/UCC.2013.85}, booktitle={Proceedings of the 6th International Conference on Utility and Cloud Computing (UCC) workshop on Distributed cloud computing}, author={Keller, Matthias and Pawlik, Stefan and Pietrzyk, Peter and Karl, Holger}, year={2013}, pages={429–434} }' chicago: Keller, Matthias, Stefan Pawlik, Peter Pietrzyk, and Holger Karl. “A Local Heuristic for Latency-Optimized Distributed Cloud Deployment.” In Proceedings of the 6th International Conference on Utility and Cloud Computing (UCC) Workshop on Distributed Cloud Computing, 429–34, 2013. https://doi.org/10.1109/UCC.2013.85. ieee: M. Keller, S. Pawlik, P. Pietrzyk, and H. Karl, “A Local Heuristic for Latency-Optimized Distributed Cloud Deployment,” in Proceedings of the 6th International Conference on Utility and Cloud Computing (UCC) workshop on Distributed cloud computing, 2013, pp. 429–434. mla: Keller, Matthias, et al. “A Local Heuristic for Latency-Optimized Distributed Cloud Deployment.” Proceedings of the 6th International Conference on Utility and Cloud Computing (UCC) Workshop on Distributed Cloud Computing, 2013, pp. 429–34, doi:10.1109/UCC.2013.85. short: 'M. Keller, S. Pawlik, P. Pietrzyk, H. Karl, in: Proceedings of the 6th International Conference on Utility and Cloud Computing (UCC) Workshop on Distributed Cloud Computing, 2013, pp. 429–434.' date_created: 2017-10-17T12:42:41Z date_updated: 2022-01-06T07:02:11Z ddc: - '040' department: - _id: '75' - _id: '63' doi: 10.1109/UCC.2013.85 file: - access_level: closed content_type: application/pdf creator: florida date_created: 2018-03-15T10:25:45Z date_updated: 2018-03-15T10:25:45Z file_id: '1279' file_name: 562-dcc13_paper.pdf file_size: 347873 relation: main_file success: 1 file_date_updated: 2018-03-15T10:25:45Z has_accepted_license: '1' language: - iso: eng page: 429-434 project: - _id: '1' name: SFB 901 - _id: '6' name: SFB 901 - Subprojekt A2 - _id: '5' name: SFB 901 - Subproject A1 - _id: '2' name: SFB 901 - Project Area A publication: Proceedings of the 6th International Conference on Utility and Cloud Computing (UCC) workshop on Distributed cloud computing status: public title: A Local Heuristic for Latency-Optimized Distributed Cloud Deployment type: conference user_id: '477' year: '2013' ... --- _id: '563' abstract: - lang: eng text: Dominating set based virtual backbones are used for rou-ting in wireless ad-hoc networks. Such backbones receive and transmit messages from/to every node in the network. Existing distributed algorithms only consider undirected graphs, which model symmetric networks with uniform transmission ranges. We are particularly interested in the well-established disk graphs, which model asymmetric networks with non-uniform transmission ranges. The corresponding graph theoretic problem seeks a strongly connected dominating-absorbent set of minimum cardinality in a digraph. A subset of nodes in a digraph is a strongly connected dominating-absorbent set if the subgraph induced by these nodes is strongly connected and each node in the graph is either in the set or has both an in-neighbor and an out-neighbor in it. We introduce the first distributed algorithm for this problem in disk graphs. The algorithm gives an O(k^4) -approximation ratio and has a runtime bound of O(Diam) where Diam is the diameter of the graph and k denotes the transmission ratio r_{max}/r_{min} with r_{max} and r_{min} being the maximum and minimum transmission range, respectively. Moreover, we apply our algorithm on the subgraph of disk graphs consisting of only bidirectional edges. Our algorithm gives an O(ln k) -approximation and a runtime bound of O(k^8 log^∗ n) , which, for bounded k , is an optimal approximation for the problem, following Lenzen and Wattenhofer’s Ω(log^∗ n) runtime lower bound for distributed constant approximation in disk graphs. author: - first_name: Christine full_name: Markarian, Christine id: '37612' last_name: Markarian - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm id: '15523' last_name: Meyer auf der Heide - first_name: Michael full_name: Schubert, Michael last_name: Schubert citation: ama: 'Markarian C, Meyer auf der Heide F, Schubert M. A Distributed Approximation Algorithm for Strongly Connected Dominating-Absorbent Sets in Asymmetric Wireless Ad-Hoc Networks. In: Proceedings of the 9th International Symposium on Algorithms and Experiments for Sensor Systems, Wireless Networks and Distributed Robotics (ALGOSENSORS). LNCS. ; 2013:217-227. doi:10.1007/978-3-642-45346-5_16' apa: Markarian, C., Meyer auf der Heide, F., & Schubert, M. (2013). A Distributed Approximation Algorithm for Strongly Connected Dominating-Absorbent Sets in Asymmetric Wireless Ad-Hoc Networks. In Proceedings of the 9th International Symposium on Algorithms and Experiments for Sensor Systems, Wireless Networks and Distributed Robotics (ALGOSENSORS) (pp. 217–227). https://doi.org/10.1007/978-3-642-45346-5_16 bibtex: '@inproceedings{Markarian_Meyer auf der Heide_Schubert_2013, series={LNCS}, title={A Distributed Approximation Algorithm for Strongly Connected Dominating-Absorbent Sets in Asymmetric Wireless Ad-Hoc Networks}, DOI={10.1007/978-3-642-45346-5_16}, booktitle={Proceedings of the 9th International Symposium on Algorithms and Experiments for Sensor Systems, Wireless Networks and Distributed Robotics (ALGOSENSORS)}, author={Markarian, Christine and Meyer auf der Heide, Friedhelm and Schubert, Michael}, year={2013}, pages={217–227}, collection={LNCS} }' chicago: Markarian, Christine, Friedhelm Meyer auf der Heide, and Michael Schubert. “A Distributed Approximation Algorithm for Strongly Connected Dominating-Absorbent Sets in Asymmetric Wireless Ad-Hoc Networks.” In Proceedings of the 9th International Symposium on Algorithms and Experiments for Sensor Systems, Wireless Networks and Distributed Robotics (ALGOSENSORS), 217–27. LNCS, 2013. https://doi.org/10.1007/978-3-642-45346-5_16. ieee: C. Markarian, F. Meyer auf der Heide, and M. Schubert, “A Distributed Approximation Algorithm for Strongly Connected Dominating-Absorbent Sets in Asymmetric Wireless Ad-Hoc Networks,” in Proceedings of the 9th International Symposium on Algorithms and Experiments for Sensor Systems, Wireless Networks and Distributed Robotics (ALGOSENSORS), 2013, pp. 217–227. mla: Markarian, Christine, et al. “A Distributed Approximation Algorithm for Strongly Connected Dominating-Absorbent Sets in Asymmetric Wireless Ad-Hoc Networks.” Proceedings of the 9th International Symposium on Algorithms and Experiments for Sensor Systems, Wireless Networks and Distributed Robotics (ALGOSENSORS), 2013, pp. 217–27, doi:10.1007/978-3-642-45346-5_16. short: 'C. Markarian, F. Meyer auf der Heide, M. Schubert, in: Proceedings of the 9th International Symposium on Algorithms and Experiments for Sensor Systems, Wireless Networks and Distributed Robotics (ALGOSENSORS), 2013, pp. 217–227.' date_created: 2017-10-17T12:42:42Z date_updated: 2022-01-06T07:02:13Z ddc: - '040' department: - _id: '63' doi: 10.1007/978-3-642-45346-5_16 file: - access_level: closed content_type: application/pdf creator: florida date_created: 2018-03-15T10:25:15Z date_updated: 2018-03-15T10:25:15Z file_id: '1278' file_name: 563-978-3-642-45346-5_16.pdf file_size: 348191 relation: main_file success: 1 file_date_updated: 2018-03-15T10:25:15Z has_accepted_license: '1' page: 217-227 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 9th International Symposium on Algorithms and Experiments for Sensor Systems, Wireless Networks and Distributed Robotics (ALGOSENSORS) series_title: LNCS status: public title: A Distributed Approximation Algorithm for Strongly Connected Dominating-Absorbent Sets in Asymmetric Wireless Ad-Hoc Networks type: conference user_id: '477' year: '2013' ... --- _id: '5637' author: - first_name: Guido full_name: Schryen, Guido id: '72850' last_name: Schryen citation: ama: 'Schryen G. Revisiting IS Business Value Research: What we already know, what we still need to know, and how we can get there. European Journal of Information Systems (EJIS). 2013;22(2):139-169.' apa: 'Schryen, G. (2013). Revisiting IS Business Value Research: What we already know, what we still need to know, and how we can get there. European Journal of Information Systems (EJIS), 22(2), 139–169.' bibtex: '@article{Schryen_2013, title={Revisiting IS Business Value Research: What we already know, what we still need to know, and how we can get there}, volume={22}, number={2}, journal={European Journal of Information Systems (EJIS)}, author={Schryen, Guido}, year={2013}, pages={139–169} }' chicago: 'Schryen, Guido. “Revisiting IS Business Value Research: What We Already Know, What We Still Need to Know, and How We Can Get There.” European Journal of Information Systems (EJIS) 22, no. 2 (2013): 139–69.' ieee: 'G. Schryen, “Revisiting IS Business Value Research: What we already know, what we still need to know, and how we can get there,” European Journal of Information Systems (EJIS), vol. 22, no. 2, pp. 139–169, 2013.' mla: 'Schryen, Guido. “Revisiting IS Business Value Research: What We Already Know, What We Still Need to Know, and How We Can Get There.” European Journal of Information Systems (EJIS), vol. 22, no. 2, 2013, pp. 139–69.' short: G. Schryen, European Journal of Information Systems (EJIS) 22 (2013) 139–169. date_created: 2018-11-14T14:31:37Z date_updated: 2022-01-06T07:02:16Z ddc: - '000' department: - _id: '277' extern: '1' file: - access_level: open_access content_type: application/pdf creator: hsiemes date_created: 2018-12-07T11:59:54Z date_updated: 2018-12-13T15:11:53Z file_id: '6048' file_name: EJIS-PAPER.pdf file_size: 792102 relation: main_file file_date_updated: 2018-12-13T15:11:53Z has_accepted_license: '1' intvolume: ' 22' issue: '2' language: - iso: eng oa: '1' page: 139-169 publication: European Journal of Information Systems (EJIS) status: public title: 'Revisiting IS Business Value Research: What we already know, what we still need to know, and how we can get there' type: journal_article user_id: '61579' volume: 22 year: '2013' ... --- _id: '564' abstract: - lang: eng text: We consider the problem of resource discovery in distributed systems. In particular we give an algorithm, such that each node in a network discovers the add ress of any other node in the network. We model the knowledge of the nodes as a virtual overlay network given by a directed graph such that complete knowledge of all nodes corresponds to a complete graph in the overlay network. Although there are several solutions for resource discovery, our solution is the first that achieves worst-case optimal work for each node, i.e. the number of addresses (O(n)) or bits (O(nlogn)) a node receives or sendscoincides with the lower bound, while ensuring only a linearruntime (O(n)) on the number of rounds. author: - first_name: Sebastian full_name: Kniesburges, Sebastian last_name: Kniesburges - first_name: Andreas full_name: Koutsopoulos, Andreas last_name: Koutsopoulos - first_name: Christian full_name: Scheideler, Christian id: '20792' last_name: Scheideler citation: ama: 'Kniesburges S, Koutsopoulos A, Scheideler C. A Deterministic Worst-Case Message Complexity Optimal Solution for Resource Discovery. In: Proceedings of 20th International Colloqium on Structural Information and Communication Complexity (SIROCCO). Lecture Notes in Computer Science. ; 2013:165-176. doi:10.1007/978-3-319-03578-9_14' apa: Kniesburges, S., Koutsopoulos, A., & Scheideler, C. (2013). A Deterministic Worst-Case Message Complexity Optimal Solution for Resource Discovery. In Proceedings of 20th International Colloqium on Structural Information and Communication Complexity (SIROCCO) (pp. 165–176). https://doi.org/10.1007/978-3-319-03578-9_14 bibtex: '@inproceedings{Kniesburges_Koutsopoulos_Scheideler_2013, series={Lecture Notes in Computer Science}, title={A Deterministic Worst-Case Message Complexity Optimal Solution for Resource Discovery}, DOI={10.1007/978-3-319-03578-9_14}, booktitle={Proceedings of 20th International Colloqium on Structural Information and Communication Complexity (SIROCCO)}, author={Kniesburges, Sebastian and Koutsopoulos, Andreas and Scheideler, Christian}, year={2013}, pages={165–176}, collection={Lecture Notes in Computer Science} }' chicago: Kniesburges, Sebastian, Andreas Koutsopoulos, and Christian Scheideler. “A Deterministic Worst-Case Message Complexity Optimal Solution for Resource Discovery.” In Proceedings of 20th International Colloqium on Structural Information and Communication Complexity (SIROCCO), 165–76. Lecture Notes in Computer Science, 2013. https://doi.org/10.1007/978-3-319-03578-9_14. ieee: S. Kniesburges, A. Koutsopoulos, and C. Scheideler, “A Deterministic Worst-Case Message Complexity Optimal Solution for Resource Discovery,” in Proceedings of 20th International Colloqium on Structural Information and Communication Complexity (SIROCCO), 2013, pp. 165–176. mla: Kniesburges, Sebastian, et al. “A Deterministic Worst-Case Message Complexity Optimal Solution for Resource Discovery.” Proceedings of 20th International Colloqium on Structural Information and Communication Complexity (SIROCCO), 2013, pp. 165–76, doi:10.1007/978-3-319-03578-9_14. short: 'S. Kniesburges, A. Koutsopoulos, C. Scheideler, in: Proceedings of 20th International Colloqium on Structural Information and Communication Complexity (SIROCCO), 2013, pp. 165–176.' date_created: 2017-10-17T12:42:42Z date_updated: 2022-01-06T07:02:17Z ddc: - '040' department: - _id: '79' doi: 10.1007/978-3-319-03578-9_14 file: - access_level: closed content_type: application/pdf creator: florida date_created: 2018-03-15T10:24:40Z date_updated: 2018-03-15T10:24:40Z file_id: '1277' file_name: 564-SIROCCO13.pdf file_size: 168884 relation: main_file success: 1 file_date_updated: 2018-03-15T10:24:40Z has_accepted_license: '1' page: 165-176 project: - _id: '1' name: SFB 901 - _id: '5' name: SFB 901 - Subprojekt A1 - _id: '2' name: SFB 901 - Project Area A publication: Proceedings of 20th International Colloqium on Structural Information and Communication Complexity (SIROCCO) series_title: Lecture Notes in Computer Science status: public title: A Deterministic Worst-Case Message Complexity Optimal Solution for Resource Discovery type: conference user_id: '15504' year: '2013' ... --- _id: '6456' author: - first_name: J. J. S. full_name: Higham, J. J. S. last_name: Higham - first_name: H.-Hugo full_name: Kremer, H.-Hugo id: '15280' last_name: Kremer - first_name: D. full_name: Yeomans, D. last_name: Yeomans citation: ama: 'Higham JJS, Kremer H-H, Yeomans D. Exploring Intermediate Vocational Education and Training for 16-19 Year-olds in Germany and England. In: Deitmer L, Hauschildt U, Rauner F, Zelloth H, eds. The Architecture of Innovative Apprenticeship. Dordrecht; 2013:39-50.' apa: Higham, J. J. S., Kremer, H.-H., & Yeomans, D. (2013). Exploring Intermediate Vocational Education and Training for 16-19 Year-olds in Germany and England. In L. Deitmer, U. Hauschildt, F. Rauner, & H. Zelloth (Eds.), The Architecture of Innovative Apprenticeship (pp. 39–50). Dordrecht. bibtex: '@inbook{Higham_Kremer_Yeomans_2013, place={Dordrecht}, title={Exploring Intermediate Vocational Education and Training for 16-19 Year-olds in Germany and England}, booktitle={The Architecture of Innovative Apprenticeship}, author={Higham, J. J. S. and Kremer, H.-Hugo and Yeomans, D.}, editor={Deitmer, L. and Hauschildt, U. and Rauner, F. and Zelloth, H.Editors}, year={2013}, pages={39–50} }' chicago: Higham, J. J. S., H.-Hugo Kremer, and D. Yeomans. “Exploring Intermediate Vocational Education and Training for 16-19 Year-Olds in Germany and England.” In The Architecture of Innovative Apprenticeship, edited by L. Deitmer, U. Hauschildt, F. Rauner, and H. Zelloth, 39–50. Dordrecht, 2013. ieee: J. J. S. Higham, H.-H. Kremer, and D. Yeomans, “Exploring Intermediate Vocational Education and Training for 16-19 Year-olds in Germany and England,” in The Architecture of Innovative Apprenticeship, L. Deitmer, U. Hauschildt, F. Rauner, and H. Zelloth, Eds. Dordrecht, 2013, pp. 39–50. mla: Higham, J. J. S., et al. “Exploring Intermediate Vocational Education and Training for 16-19 Year-Olds in Germany and England.” The Architecture of Innovative Apprenticeship, edited by L. Deitmer et al., 2013, pp. 39–50. short: 'J.J.S. Higham, H.-H. Kremer, D. Yeomans, in: L. Deitmer, U. Hauschildt, F. Rauner, H. Zelloth (Eds.), The Architecture of Innovative Apprenticeship, Dordrecht, 2013, pp. 39–50.' date_created: 2019-01-02T10:33:48Z date_updated: 2022-01-06T07:03:05Z department: - _id: '211' editor: - first_name: L. full_name: Deitmer, L. last_name: Deitmer - first_name: U. full_name: Hauschildt, U. last_name: Hauschildt - first_name: F. full_name: Rauner, F. last_name: Rauner - first_name: H. full_name: Zelloth, H. last_name: Zelloth language: - iso: eng page: 39-50 place: Dordrecht publication: The Architecture of Innovative Apprenticeship status: public title: Exploring Intermediate Vocational Education and Training for 16-19 Year-olds in Germany and England type: book_chapter user_id: '74378' year: '2013' ... --- _id: '6457' author: - first_name: H.-Hugo full_name: Kremer, H.-Hugo id: '15280' last_name: Kremer - first_name: Marc full_name: Beutner, Marc id: '21118' last_name: Beutner - first_name: W. full_name: Wirth, W. last_name: Wirth citation: ama: 'Kremer H-H, Beutner M, Wirth W. Lernen im Justizvollzug. Vorstellung und Grundidee des Modellprojektes TANDEM. In: Kremer H-H, Beutner M, Wirth W, eds. Berufsorientierung, Gewaltsensibilisierung und Kompetenzentwicklung  - Konzepte zur beruflichen Bildung im Jungtätervollzug. Paderborn; 2013.' apa: Kremer, H.-H., Beutner, M., & Wirth, W. (2013). Lernen im Justizvollzug. Vorstellung und Grundidee des Modellprojektes TANDEM. In H.-H. Kremer, M. Beutner, & W. Wirth (Eds.), Berufsorientierung, Gewaltsensibilisierung und Kompetenzentwicklung  - Konzepte zur beruflichen Bildung im Jungtätervollzug. Paderborn. bibtex: '@inbook{Kremer_Beutner_Wirth_2013, place={Paderborn}, title={Lernen im Justizvollzug. Vorstellung und Grundidee des Modellprojektes TANDEM}, booktitle={Berufsorientierung, Gewaltsensibilisierung und Kompetenzentwicklung  - Konzepte zur beruflichen Bildung im Jungtätervollzug}, author={Kremer, H.-Hugo and Beutner, Marc and Wirth, W.}, editor={Kremer, H.-H. and Beutner, M. and Wirth, W.Editors}, year={2013} }' chicago: Kremer, H.-Hugo, Marc Beutner, and W. Wirth. “Lernen im Justizvollzug. Vorstellung und Grundidee des Modellprojektes TANDEM.” In Berufsorientierung, Gewaltsensibilisierung und Kompetenzentwicklung  - Konzepte zur beruflichen Bildung im Jungtätervollzug, edited by H.-H. Kremer, M. Beutner, and W. Wirth. Paderborn, 2013. ieee: H.-H. Kremer, M. Beutner, and W. Wirth, “Lernen im Justizvollzug. Vorstellung und Grundidee des Modellprojektes TANDEM,” in Berufsorientierung, Gewaltsensibilisierung und Kompetenzentwicklung  - Konzepte zur beruflichen Bildung im Jungtätervollzug, H.-H. Kremer, M. Beutner, and W. Wirth, Eds. Paderborn, 2013. mla: Kremer, H. Hugo, et al. “Lernen im Justizvollzug. Vorstellung und Grundidee des Modellprojektes TANDEM.” Berufsorientierung, Gewaltsensibilisierung und Kompetenzentwicklung  - Konzepte zur beruflichen Bildung im Jungtätervollzug, edited by H.-H. Kremer et al., 2013. short: 'H.-H. Kremer, M. Beutner, W. Wirth, in: H.-H. Kremer, M. Beutner, W. Wirth (Eds.), Berufsorientierung, Gewaltsensibilisierung und Kompetenzentwicklung  - Konzepte zur beruflichen Bildung im Jungtätervollzug, Paderborn, 2013.' date_created: 2019-01-02T10:43:00Z date_updated: 2022-01-06T07:03:05Z department: - _id: '211' editor: - first_name: H.-H. full_name: Kremer, H.-H. last_name: Kremer - first_name: M. full_name: Beutner, M. last_name: Beutner - first_name: W. full_name: Wirth, W. last_name: Wirth language: - iso: ger place: Paderborn publication: Berufsorientierung, Gewaltsensibilisierung und Kompetenzentwicklung - Konzepte zur beruflichen Bildung im Jungtätervollzug status: public title: Lernen im Justizvollzug. Vorstellung und Grundidee des Modellprojektes TANDEM type: book_chapter user_id: '74378' year: '2013' ... --- _id: '6458' author: - first_name: H.-Hugo full_name: Kremer, H.-Hugo id: '15280' last_name: Kremer - first_name: Marc full_name: Beutner, Marc id: '21118' last_name: Beutner citation: ama: 'Kremer H-H, Beutner M. Berufsorientierung im Jungtätervollzug - Rahmenkonzept und übergreifenden Prinzipien. In: Berufsorientierung, Gewaltsensibilisierung und Kompetenzentwicklung - Konzepte zur beruflichen Bildung im Jungtätervollzug. Paderborn; 2013.' apa: Kremer, H.-H., & Beutner, M. (2013). Berufsorientierung im Jungtätervollzug - Rahmenkonzept und übergreifenden Prinzipien. In Berufsorientierung, Gewaltsensibilisierung und Kompetenzentwicklung - Konzepte zur beruflichen Bildung im Jungtätervollzug. Paderborn. bibtex: '@inbook{Kremer_Beutner_2013, place={Paderborn}, title={Berufsorientierung im Jungtätervollzug - Rahmenkonzept und übergreifenden Prinzipien}, booktitle={Berufsorientierung, Gewaltsensibilisierung und Kompetenzentwicklung - Konzepte zur beruflichen Bildung im Jungtätervollzug}, author={Kremer, H.-Hugo and Beutner, Marc}, year={2013} }' chicago: Kremer, H.-Hugo, and Marc Beutner. “Berufsorientierung im Jungtätervollzug - Rahmenkonzept und übergreifenden Prinzipien.” In Berufsorientierung, Gewaltsensibilisierung und Kompetenzentwicklung - Konzepte zur beruflichen Bildung im Jungtätervollzug. Paderborn, 2013. ieee: H.-H. Kremer and M. Beutner, “Berufsorientierung im Jungtätervollzug - Rahmenkonzept und übergreifenden Prinzipien,” in Berufsorientierung, Gewaltsensibilisierung und Kompetenzentwicklung - Konzepte zur beruflichen Bildung im Jungtätervollzug, Paderborn, 2013. mla: Kremer, H. Hugo, and Marc Beutner. “Berufsorientierung im Jungtätervollzug - Rahmenkonzept und übergreifenden Prinzipien.” Berufsorientierung, Gewaltsensibilisierung und Kompetenzentwicklung - Konzepte zur beruflichen Bildung im Jungtätervollzug, 2013. short: 'H.-H. Kremer, M. Beutner, in: Berufsorientierung, Gewaltsensibilisierung und Kompetenzentwicklung - Konzepte zur beruflichen Bildung im Jungtätervollzug, Paderborn, 2013.' date_created: 2019-01-02T10:45:41Z date_updated: 2022-01-06T07:03:05Z department: - _id: '211' language: - iso: ger place: Paderborn publication: Berufsorientierung, Gewaltsensibilisierung und Kompetenzentwicklung - Konzepte zur beruflichen Bildung im Jungtätervollzug status: public title: Berufsorientierung im Jungtätervollzug - Rahmenkonzept und übergreifenden Prinzipien type: book_chapter user_id: '74378' year: '2013' ... --- _id: '6459' author: - first_name: M. full_name: Gebbe, M. last_name: Gebbe - first_name: H.-Hugo full_name: Kremer, H.-Hugo id: '15280' last_name: Kremer citation: ama: 'Gebbe M, Kremer H-H. myflux.eu - Ein Instrument zur Förderung von Zielorientierung, Reflexion und Verantwortung im Berufsorientierungsprozess von Jungtätern. In: Kremer H-H, Beutner M, Wirth W, eds. Berufsorientierung, Gewaltsensibilisierung und Kompetenzentwicklung - Konzepte zur beruflichen Bildung im Jungtätervollzug. Paderborn; 2013.' apa: Gebbe, M., & Kremer, H.-H. (2013). myflux.eu - Ein Instrument zur Förderung von Zielorientierung, Reflexion und Verantwortung im Berufsorientierungsprozess von Jungtätern. In H.-H. Kremer, M. Beutner, & W. Wirth (Eds.), Berufsorientierung, Gewaltsensibilisierung und Kompetenzentwicklung - Konzepte zur beruflichen Bildung im Jungtätervollzug. Paderborn. bibtex: '@inbook{Gebbe_Kremer_2013, place={Paderborn}, title={myflux.eu - Ein Instrument zur Förderung von Zielorientierung, Reflexion und Verantwortung im Berufsorientierungsprozess von Jungtätern}, booktitle={Berufsorientierung, Gewaltsensibilisierung und Kompetenzentwicklung - Konzepte zur beruflichen Bildung im Jungtätervollzug}, author={Gebbe, M. and Kremer, H.-Hugo}, editor={Kremer, H.-H. and Beutner, M. and Wirth, W.Editors}, year={2013} }' chicago: Gebbe, M., and H.-Hugo Kremer. “myflux.eu - Ein Instrument zur Förderung von Zielorientierung, Reflexion und Verantwortung im Berufsorientierungsprozess von Jungtätern.” In Berufsorientierung, Gewaltsensibilisierung und Kompetenzentwicklung - Konzepte zur beruflichen Bildung im Jungtätervollzug, edited by H.-H. Kremer, M. Beutner, and W. Wirth. Paderborn, 2013. ieee: M. Gebbe and H.-H. Kremer, “myflux.eu - Ein Instrument zur Förderung von Zielorientierung, Reflexion und Verantwortung im Berufsorientierungsprozess von Jungtätern,” in Berufsorientierung, Gewaltsensibilisierung und Kompetenzentwicklung - Konzepte zur beruflichen Bildung im Jungtätervollzug, H.-H. Kremer, M. Beutner, and W. Wirth, Eds. Paderborn, 2013. mla: Gebbe, M., and H. Hugo Kremer. “myflux.eu - Ein Instrument zur Förderung von Zielorientierung, Reflexion und Verantwortung im Berufsorientierungsprozess von Jungtätern.” Berufsorientierung, Gewaltsensibilisierung und Kompetenzentwicklung - Konzepte zur beruflichen Bildung im Jungtätervollzug, edited by H.-H. Kremer et al., 2013. short: 'M. Gebbe, H.-H. Kremer, in: H.-H. Kremer, M. Beutner, W. Wirth (Eds.), Berufsorientierung, Gewaltsensibilisierung und Kompetenzentwicklung - Konzepte zur beruflichen Bildung im Jungtätervollzug, Paderborn, 2013.' date_created: 2019-01-02T10:48:32Z date_updated: 2022-01-06T07:03:05Z department: - _id: '211' editor: - first_name: H.-H. full_name: Kremer, H.-H. last_name: Kremer - first_name: M. full_name: Beutner, M. last_name: Beutner - first_name: W. full_name: Wirth, W. last_name: Wirth language: - iso: ger place: Paderborn publication: Berufsorientierung, Gewaltsensibilisierung und Kompetenzentwicklung - Konzepte zur beruflichen Bildung im Jungtätervollzug status: public title: myflux.eu - Ein Instrument zur Förderung von Zielorientierung, Reflexion und Verantwortung im Berufsorientierungsprozess von Jungtätern type: book_chapter user_id: '74378' year: '2013' ... --- _id: '6461' author: - first_name: H.-Hugo full_name: Kremer, H.-Hugo id: '15280' last_name: Kremer - first_name: S. full_name: Knust, S. last_name: Knust citation: ama: 'Kremer H-H, Knust S. Stärkenbasierte Berufsorientierung im Jungtätervollzug . In: Kremer H-H, Beutner M, Wirth W, eds. Berufsorientierung, Gewaltsensibilisierung und Kompetenzentwicklung - Konzepte zur beruflichen Bildung im Jungtätervollzug. Paderborn; 2013.' apa: Kremer, H.-H., & Knust, S. (2013). Stärkenbasierte Berufsorientierung im Jungtätervollzug . In H.-H. Kremer, M. Beutner, & W. Wirth (Eds.), Berufsorientierung, Gewaltsensibilisierung und Kompetenzentwicklung - Konzepte zur beruflichen Bildung im Jungtätervollzug. Paderborn. bibtex: '@inbook{Kremer_Knust_2013, place={Paderborn}, title={Stärkenbasierte Berufsorientierung im Jungtätervollzug }, booktitle={Berufsorientierung, Gewaltsensibilisierung und Kompetenzentwicklung - Konzepte zur beruflichen Bildung im Jungtätervollzug}, author={Kremer, H.-Hugo and Knust, S.}, editor={Kremer, H.-H. and Beutner, M. and Wirth, W.Editors}, year={2013} }' chicago: Kremer, H.-Hugo, and S. Knust. “Stärkenbasierte Berufsorientierung im Jungtätervollzug .” In Berufsorientierung, Gewaltsensibilisierung und Kompetenzentwicklung - Konzepte zur beruflichen Bildung im Jungtätervollzug, edited by H.-H. Kremer, M. Beutner, and W. Wirth. Paderborn, 2013. ieee: H.-H. Kremer and S. Knust, “Stärkenbasierte Berufsorientierung im Jungtätervollzug ,” in Berufsorientierung, Gewaltsensibilisierung und Kompetenzentwicklung - Konzepte zur beruflichen Bildung im Jungtätervollzug, H.-H. Kremer, M. Beutner, and W. Wirth, Eds. Paderborn, 2013. mla: Kremer, H. Hugo, and S. Knust. “Stärkenbasierte Berufsorientierung im Jungtätervollzug .” Berufsorientierung, Gewaltsensibilisierung und Kompetenzentwicklung - Konzepte zur beruflichen Bildung im Jungtätervollzug, edited by H.-H. Kremer et al., 2013. short: 'H.-H. Kremer, S. Knust, in: H.-H. Kremer, M. Beutner, W. Wirth (Eds.), Berufsorientierung, Gewaltsensibilisierung und Kompetenzentwicklung - Konzepte zur beruflichen Bildung im Jungtätervollzug, Paderborn, 2013.' date_created: 2019-01-02T10:52:12Z date_updated: 2022-01-06T07:03:06Z department: - _id: '211' editor: - first_name: H.-H. full_name: Kremer, H.-H. last_name: Kremer - first_name: M. full_name: Beutner, M. last_name: Beutner - first_name: W. full_name: Wirth, W. last_name: Wirth language: - iso: ger place: Paderborn publication: Berufsorientierung, Gewaltsensibilisierung und Kompetenzentwicklung - Konzepte zur beruflichen Bildung im Jungtätervollzug status: public title: 'Stärkenbasierte Berufsorientierung im Jungtätervollzug ' type: book_chapter user_id: '74378' year: '2013' ...